OJ Board

magurmach

Getting WA. Please post some test cases.

Code Link:
http://ideone.com/Xf2YI6

magurmach

Test Case:

Input:

2
2000000000 100
1 1

Output:

Code: Select all

Case 1: 6678
Case 2: 2

magurmach

The reason in simple, you are using trying to use more memory than available, use pointer as much as possible!

magurmach

So so so many thanks to brianfry! I am really thinking to send you some flowers!

magurmach

Please help. Getting WA.

Code Link:
Hided after AC

Thanks in advance!

magurmach

can somebody post some tough test cases? Getting WA

magurmach

I have to say, poor problem description. No description of numbers 'C [i, j]' , no description of how there is 2 number at the beginning of test cases. If they have used 0 indexing...(though I think they haven't!!!) Can these be made clear?

magurmach

One Extra test case:

Code: Select all

Code: Select all

1 2 66
3 1 11

magurmach

A very disgusting problem with this one is... we have to initialize the adjacency matrix with Minimal number (better -2147483647) at first I initialized with -999999999 got WA... changed total code still WA and then just changed the limit and got AC and in exchange of 8 WA I got 2nd rank!!!

magurmach

Some Previous Input Output clarification:

Input:

3
1
4
15
92
653
589
793
2384
626
4338
3279
502
88

Output:

2
1/3 = 1/12 + 1/4
1/3 = 1/6 + 1/6
1
1/1 = 1/2 + 1/2
3
1/4 = 1/20 + 1/5
1/4 = 1/12 + 1/6
1/4 = 1/8 + 1/8
5
1/15 = 1/240 + 1/16
1/15 = 1/90 + 1/18
1/15 = 1/60 + 1/20
1/15 = 1/40 + 1/24 ...

magurmach

One little Spoiler:

43560=2^3×3^2×5^1×11^2 has 4 factors with frequencies 3, 2, 1 and 2, hence coded as 41223. So, if you are backtracking you have to keep in mind that you want a sequence of number such that it is in non-descending order! More clearly, for test case 31223 a valid sequence of ...

magurmach

Some random input-output:

Input:

Code: Select all

Output:

Code: Select all

magurmach

Getting WA in this problem. No idea why!
Code link:
Code removed after AC
Made silly mistakes

a b means show all subset sizes from a to b, inclusive

Tested nearly all cases available. Plz help.
Thanks in advance!

magurmach

For Those who are suffering for the lack of higher limit I can guarantee 0<=L<= H<=10000

magurmach

Some test cases:
input:

Code: Select all

10
0x=0
3x=-9
4=4
2+0x=3+0x
2x+3=0
7x-100=2x+200
x-3=3-x
-x-x-x-x=4
-x+x=2
-x+x=0

Output:

Code: Select all

IDENTITY
-3
IDENTITY
IMPOSSIBLE
-2
60
6
-1
IMPOSSIBLE
IDENTITY

OJ Board

Search found 26 matches

Re: 11779 - Lost File

Re: RE 12593

12593 - Next Generation Macaw

Re: 1216 - The Bug Sensor Problem : WA

1216 - The Bug Sensor Problem

Re: 11297 - Census (BUG in problem description)

Re: 11297 - Census (BUG in problem description)

Re: 10258 - Contest Scoreboard

Re: 11749 : Didn't understand

Re: 10976 - Fractions Again?!

Re: 12377 - Number Coding

12377 - Number Coding

Re: 598: Bundling eccentric newspapers

Re: 1246 ---- WA >> Plaese help.....

Re: UVA 1200 clarification