It's very simple problem because all connected graphs which containes even number of edges can be divided into pairs of edges, which includes one common vertex!!!(and all connected graphs with odd number of edges can't be divided in such way)

I used this code:
double x, y; cin >> x >> y;
x *= 1000; y *= 1000;
int X = (int)x, Y = (int)y;

But this code doesn't work properly. For example, if x = -1.001, then X will be -1000 (in some cases one unit is lost).
How to avoid this in C++?
To solve this problem I had to read whole string and then parse it :)

#include<iostream>
#include<stdio.h>

int main(void){

    double a;
    int i = -1;
        double NUM [100000];

     while(EOF != scanf("%lf", &a)){
      NUM[++i] = sqrt(a);
     }

     i--;
     while(i>=0){
         printf("%.4f\n",NUM[i]);
         i--;
     }
     return 0;

}

long n=2*(value-1);
long sqr=(long) Math.floor(Math.sqrt(n));
if((sqr*(sqr+1))==n)
print(1);
else
print(0);

Edited by author 28.03.2014 15:49

Edited by author 28.03.2014 12:04

Is this a valid test case?

2
-9999 -1
-9999 1.00000000000000000001
1
9999 0

I know the answer should be 1. But it's hard to code.



Edited by author 08.03.2014 14:22

Edited by author 28.03.2014 23:31

aabaaab => { 0 1 0 1 2 3 }
a 0
aa 1
aab 0
aaba 1
aabaa 2
aabaab 3

When I used BFS,I found it would exceed the time limit.
Does DFS also will exceed the time limit?

Use probability P(i,j) that a line with i rockets is finished after at most j salvos. The probability that it ends after exactly k+1 salvos is

 P(i,k+1)-P(i,k) = 1/i sum_l P(l,k) * P(r,k) - P(l,k-1) * P(r,k-1),

where l is the index of the first launched rocket and thus the size of the left part and r is the size of the right part (r=i-1-l) of the line.

The output is with

 cout << setprecision(12) << s*10 << endl;

Edited by author 27.03.2014 23:04

I think my program is correct but i have not accepted yet.
why wrong answer #10..
please give me Test 10.

if a in [1..4] then write('few');
   if a in [5..9] then write('several');
   if a in [10..19] then write('pack');
   if a in [20..49] then write('lots');
   if a in [50..99] then write('horde');
   if a in [100..249] then write('throng');
   if a in [250..499] then write('swarm');
   if a in [500..999] then write('zounds');
   if a > 999 then write('legion');

Maybe that is what i am doing wrong.

If i have a set of words, say:

it
your
reality
real
our

Can the output be something like:

reality our reality

or the words can't be repeated??

Please give me some tests.

перепроверте тесты  задачи B pls

I think there can be several correct answers, and not all of them are accepted.

Is order of days important (Monday, Wednesday, Saturday == Saturday, Monday, Wednesday)?

For 3rd test my program prints "Monday, Tuesday, Wednesday" which gives 14 days. Why I got WA#3?

Thanks

even no idea
tried this
10
3 5 6 7 2 8 9 7 5 6 5
get 5

I'm not quite sure where the problem is, but here is the story. First, I tried to submit solution which worked well on my machine (64bit OS), but test 1 was constantly failed on timus server. I've tried to change (almost) everything in my code without success. Then I started to google solutions. Surprisingly, they didn't worked either (e.g. http://helloacm.com/coding-exercise-timus-1001-reverse-root-c-solution-online-judge/ is provided as a working solution, but it also fails on test 1). I've started to think that something is broken on the timus server or I'm choosing wrong compiler version or hell knows what else. Then I've found another solution which was... accepted! Started to comparing it with mine line by line and found following:
whatever I use in scanf (llu, lld) - it works fine on my machine, but on remote server it fails. When you replace scanf by cin - it works both locally and remotely. So in short - do not use scanf for this task, use cin.
It will be very interesting to know why this happens, maybe someone could explain?

If you have problems with test #31, you must know that in test #31 there are now words)) only delimiter characters!

I am writing my solution in Java and I constantly getting "Memory Limit Exceeded" error
on 10th test.

I used ArrayList<Integer> to store 'programs' and 'rollbacks'.
Then lately I changed it TIntArrayList, to store 'int' as a basic type,
but still it does not solve the problem.

I saw solutions in Java, that people used less than 10Mb of memory.
What am I doing wrong?

Edited by author 23.03.2014 18:03

Edited by author 23.03.2014 18:04