OJ Board

Of all the trivial mistakes I could make , this one took the cake.I hadn't initialised one of my arrays properly!!!AC finallly (phew)

Anyways I hope the sample ip-op is correct:

16
2 76 0
2147483647 2147483647 -2147483648
-2147483647 -2147483648
2 76 1
2147483647 2147483647 -2147483648 ...

The problem in giving too many sample input outputs in some problems is that these can in fact give an unnecessary clue as to how to solve the problem.Clearly the purpose of the test cases is not to tell you how to proceed but just to a small verification as to the veracity of your algo and maybe to ...

R comes only in n=202 case...

n=200 seems correct...

Found my mistake
Found my mistake
Found my mistake!!!

Some small mistake which I chanced upon when i was giving some random inputs.Thanks for your time (dot)(dot)

I dont use division anywhere.

Could you gimme some good sample ip and op?(something which can hopefully find my bug... )

Thanks in advance...

So what could be a problem?

Without revealing much about my solution let me just say that my answer is the product of several subproblems all of which are somehow based on catalan numbers.

Any overflow problems?

I am getting WA for this problem and I think I am making a mistake in the base case/tricky cases.

I would appreciate some test cases plz.

Also could someone verify the input-output for these

Input:

1+1+1+1+2*2+1*2*2*2+1+1+1+1*2+1
((((((1+2))))))
1*1*1*1*1*1*1*1*1
(1*1*1*1)*(1*1*1*1*1)
1+1+1*1+1 ...

Hi I keep on getting WA...any tricks here?

Plz help

Some random IO ...

Input:

9384 7 778 916 794 336 387 493 650
1422 3 28 691 60
7764 7 541 427 173 737 212 369 568
6430 3 531 863 124
4068 6 930 803 23 59 70 168
1394 7 12 43 230 374 422 920 785
8538 9 325 316 371 414 527 92 981 957 874
6863 1 997
7282 6 926 85 328 337 506 847
1730 4 858 125 896 ...

I dont know what happened...But I think it was Per's suggestion that I remove empty spaces before I see end of line(ergo flawed input)

My prg got AC but I think there can be some change in judge for this.Atleast an enquiry?

Phi(n)=n*(1-1/p1)*(1-1/p2)*... is a well known formula :D

However I wasnt aware that using the Chinese Remainder theorem we can get xmod(ab) given xmoda and xmodb.I know now.(where (a,b)=1).
Moreover since the mod limit is only 10000, prime generation is also easy and fast.I didnt realise this ...

the other approach is to try to find cycles in the a^i. though mathematically equivalent to phi function, it is easier to get that. but i got WA with that and i don't know why. can anybody tell me possible mistakes that i could have made in that?


Only mistake possible here is that you dont ...

Pained by TLE
now WA

Someone help

~Thanks~

While I was sitting in class today I realised my error.

If anyone needs sample IO plz ask.

It seems only 1 AC out of 13 submissions.Am I missing something here?

Can the person who got AC tell if there is some tricks in the input?Maybe some sample I/o?
Are any people who got it during the contest getting WA?