Actually it isn't quite right.
The input requires integers that are less than or equal to 2^32-1 so you must use unsigned int.
Search found 3 matches
Search found 3 matches • Page 1 of 1
- Mon Oct 18, 2004 7:26 pm
- Forum: Volume 4 (400-499)
- Topic: 406 - Prime Cuts
- Replies: 187
- Views: 24255
Dear Ashkankhan, My approach was very similar to yours. My code passed all the tests in the 406 threads but I still got WA. Sokar's suggestion is not why you are still getting WA (there is no input above 1000). For some reason for this problem you need to read all the input (and store) then print th...
- Thu Oct 14, 2004 6:52 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10179 - Irreducible Basic Fractions
- Replies: 28
- Views: 9961
[..in the example given in the problem text, they don't count 0/12 as a irreducible basic fraction..] That is correct 0/12 can be reduced to any fraction with a non-zero denominator (e.g.0/1 etc.) Problem 10179 differs from 10299 in that when n=1 there is an allowable irreducible fraction of 1/1 giv...