#include<math.h>
#include<stdio.h>
int main()
{
    double arr[1000];
    int i=0,count=0;
    while(scanf("%lf",&arr[i]))
    {
        arr[i] = sqrt(arr[i]);
        i++; count++;
    }
    for(i=count-1;i>=0;i--)
        printf("\n %0.4lf",arr[i]);
    return 0;
}

Heavy-Light-Decomposition -> GOOD data structure! thank you all!

here is my code:

#include <stdio.h>
int total(int count, int sum)
{
    int result = 0;
    if( count > 1 )
    {
        int i=0;
        for (; i <= 9; i++)
        {
            result += total(count - 1, sum     - i);
        }
    }
    else
    {
        return  sum     < 10 && sum >= 0 ? 1 : 0;
    }
    return result;
}

int main ()
{
    unsigned a;
    int n,i,c,b;

    scanf("%ud", &a);
    b = a / 2 * 9;
    for(i=0; i <= b; i++ )
    {
        c = total(a/2, i);
        n += c * c;
    }
    printf("%d", n);

    return 0;
}
i tried 2,4,6,8,the result is correct,but when i submit my solution,[wrong answer] is returned...

Edited by author 02.09.2011 14:58

In first line  trochee, and iamb both has. why no "not a poem" ?

Now, I understand, very easy :)

Edited by author 15.02.2012 19:38

q cago en el juez!

#include<stdio.h>

int main(void){
    int n,m;
    unsigned int k;
    scanf("%d %d",&n,&m);
    k=0;
    while(n>2 && m>2){
        k=k+4;
        n-=2;
        m-=2;
    }
    if(n==2 && m>=2)
        k=k+2;
    else
        if(m==2 && n>2)
            k=k+3;
    else
        if(m==1 && n>1)
            k++;
    printf("%d",k);
return 0;
}

check all x = p/q, rational numbers ( -100 <= p <= 100,  1 <= q <= 100),
find P'(x) = 0  roots , (v[0], v[1], .. v[k] ->  P'(v[i]) = 0).
try find roots with binary search in [ v[i] .. v[i+1] ] !!!!!

http://en.wikipedia.org/wiki/Casus_irreducibilis
http://en.wikipedia.org/wiki/Rational_root_test
http://en.wikipedia.org/wiki/Cubic_function

Please check my submission 4323013. It gets AC although to the input
4 3
1 2
2 4
4 3

it answers
1
2 4

when the right answer is clearly
2
1 2
3 4

Edited by author 23.06.2012 12:37

Используйте связные списки вместо массивов и не надо будет никаких извращений с предпроверкой считываемых символов. Более того, пройдет даже с использованием cin cout вместо scanf printf.

Does anybody has any idea?

use DFS with memorization

I don't understand the 2nd sample test.
Is a player go on the path from where the othe player reach?
Or are the players move on different path?

abcd
aaaaabcdaaaa
ans : a a a a abcd a a a a
When I print answers,I print them from the end)))
Sorry for my poor English))))

Edited by author 22.06.2012 15:47

rt

I got AC , but who can tell me how to use DP there (I solved this problem without DP , using log2 )

#include <iostream>

int main()
{
    int n,i;
    std::cin>>n;
    int sum=0;
    if(n<0)
    {
        for(i=n;i<=1;i++)
            sum+=i;
        std::cout<<sum;

    }
    else
    {

        for(i=n;i>=1;i--)
            sum+=i;
        std::cout<<sum;
    }
return 0;}

tell me what's wrong in my code ???


#include <stdio.h>
#include <math.h>
void main ()
{
    long N=-1,sum=0;
    int i=0;
    scanf("%d",&N);
    if (abs(N)<=10000)
    {
    if (N>0)
    {
    for (i=N;i>1;--i)
    {
    sum+=i;
    }
    }
    else if (N<0)
    {
        for (i=N;i<-1;++i)
        {
            sum+=i;
        }
    }
    printf("%ld",sum);
    }
}

The same trouble was with problem 1313.