Search found 13 matches
- Fri Sep 22, 2006 6:41 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11098 - Battle II
- Replies: 11
- Views: 6227
We will revise the problem statement, regarding your suggestions soon. But some points: The first part of this sentence contradicts the second part in two ways: 'less than' vs. '>=', and 'range of b1' vs. 'b2.range'. 'range of b1' should be replaced with 'range of b2', but the comparisons are correc...
- Thu Sep 21, 2006 11:04 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11095 - Tabriz City
- Replies: 14
- Views: 6479
- Thu Sep 21, 2006 10:58 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11094 - Continents
- Replies: 43
- Views: 21467
- Mon Aug 28, 2006 3:16 pm
- Forum: Volume 8 (800-899)
- Topic: 897 - Anagrammatic Primes
- Replies: 21
- Views: 13493
Well, I thought your fault is in negative inputs!
anyway, instead
put after your main loop:
anyway, instead
Code: Select all
if(number>1000)
cout<<0<<endl;
Code: Select all
if(go)cout<<0<<endl;
- Sun Aug 27, 2006 10:03 pm
- Forum: Volume 8 (800-899)
- Topic: 897 - Anagrammatic Primes
- Replies: 21
- Views: 13493
- Sat Aug 12, 2006 11:12 am
- Forum: Volume 8 (800-899)
- Topic: 825 - Walking on the Safe Side
- Replies: 38
- Views: 21654
There are two points about your code: First, you set p[1][1] after reading input to 1 which is supposed to mean that there is one way to cell (1,1) but it is possible that this cell is blocked so that the answer would be zero paths to cell (r,c). Second, there is an error in the reading inputs where...
- Fri Aug 11, 2006 12:18 pm
- Forum: Volume 8 (800-899)
- Topic: 845 - Gas Station Numbers
- Replies: 12
- Views: 8302
I 've put some sample random generated I/O here:
http://online-judge.uva.es/board/viewto ... 9762#49762
http://online-judge.uva.es/board/viewto ... 9762#49762
- Fri Aug 11, 2006 12:17 pm
- Forum: Volume 8 (800-899)
- Topic: 845 - Gas Station Numbers
- Replies: 12
- Views: 8302
Try this I/O: 42184686335.0 265011917015725.1 114792935926963.2 24465570628146.3 23282168289962.4 492299611943.5 4828543732392.6 146053903154.7 2931238317422.8 187171971919896.9 54482172714772.0 11539187019913.1 256682630017036.2 98952870423812.3 313233033417674.4 4665151427712.5 28254686925548.6 27...
- Fri Aug 11, 2006 10:53 am
- Forum: Volume 8 (800-899)
- Topic: 852 - Deciding victory in Go
- Replies: 3
- Views: 2880
- Thu Aug 10, 2006 11:15 pm
- Forum: Volume 8 (800-899)
- Topic: 852 - Deciding victory in Go
- Replies: 3
- Views: 2880
852 - Deciding victory in Go
Could someone help me about the test case below; what color should be removed from the following table?
.........
.........
.........
......X..
.....XOX.
.....OXO.
......O..
.........
.........
I tried too many times and got WA everytime.
thx in advance.
.........
.........
.........
......X..
.....XOX.
.....OXO.
......O..
.........
.........
I tried too many times and got WA everytime.
thx in advance.
- Thu Aug 10, 2006 5:47 pm
- Forum: Volume 8 (800-899)
- Topic: 830 - Shark
- Replies: 7
- Views: 6349
According to what erdos said, i used this code and it got accepted:
except this i read normally from the input(char by char).
Code: Select all
for(cin>>n;n--;)
{
cin>>h>>w;
if(!n)w=39;
- Thu Nov 03, 2005 2:16 am
- Forum: Volume 8 (800-899)
- Topic: 815 - Flooded!
- Replies: 20
- Views: 10695
there are some I/O that might help... Input: 3 3 25 37 45 51 12 34 94 83 27 10000 3 3 25 37 45 51 12 34 94 83 27 100000 3 1 -6 -5 -4 300 3 1 -6 -5 -4 301 3 1 -6 -5 -4 100 0 0 Expected Output: Region 1 Water level is 46.67 meters. 66.67 percent of the region is under water. Region 2 Water level is 15...
- Wed Oct 26, 2005 10:28 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10103 - Karpovich blocks
- Replies: 21
- Views: 8828
I ve tried to solve this problem in this way: -First I exmaine each component if they can move, when i find such a component, change it's bricks to another charachter that would be considered as a free space. then I use dfs to find whether there is another component that can pass through free spaces...