OJ Board

Hi, I'm getting WA. I tried previous cases mentioned in this forum and produced same result, but I still got WA.
My algorithm is to calculate all primes less than 10^6 and try dividing the input.
Anyone can help me? Probably with some I/O cases
Thanks

EDIT : got AC already.. I missed printing "\n ...

Hi jurajz,
I appreciate your help, my code produced the same result as yours for those input cases, but it still gives me WA.
Here is my code :

#include <stdio.h>
#include <memory.h>
#include <math.h>
#include <vector>
#include <algorithm>

using namespace std;

struct cell
{
int horizontal ...

Hi, is there anyone who has critical test case ? I think this problem is not very difficult but I kept getting WA. I used an 2D array to store the number of X or O's diagonally, vertically and horizontally.

I got TLE for this problem.... I tried implementing queue as in the previous posts said, but I still got TLE. I think there is something wrong with my code. Can anybody help me ?


#include <stdio.h>
#include <memory.h>
#include <limits.h>

struct CNum
{
int number;
int x, y;
};

struct move ...

For me, in Firefox 3 it works. Maybe you have a computer problem or internet connection problem..
I also get "You are not authorised to view this resource" error the same like you...
Maybe the administrator should take care of this.

change your void main() into int main()

Thank you, I got AC now... But I don't know why I got WA in the contest..

Hm.. My program outputs the same as yours, but I get WA.. Please check this input

5
84 6
-445.13 347.11
727.97 694.64
321.35 -702.51
490.54 475.34
-957.03 -867.61
412.11 154.72
504.52 752.62
-974.73 -571.11
735.84 -286.01
-273.80 918.82
444.89 -821.47
170.29 -766.48
79.71 -20.75
328.25 51.64
831 ...

Can you please give some input / output for this problem, and of course the output from the input provided by Monsoon ?

My program outputs "YES" for your input, but I still get WA.. Any more test cases ?

2


3 5 4
4 5
6 7
5 6
7 5000000000000000000000000000000000000000000000000000000000000000000000
5000000000000000000000000000000000000000000000000000000000000000000000 3000
3
4
5
9


3 1 3
4 20
3
4
5



if there is really a case with snake / ladders like
7 ...

Robert, during the contest, there are 2 people who got AC on this problem.
You can refer to http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=13&page=show_contest&contest=201
and you will find it.

This is the detail :
98 acmita08 D - Snakes and Ladders Accepted C++ 2 ...

If we use an array data[101], with index as starting point and its value as end point, I don't think it will be a problem if a square shares more than one endpoint of snake and ladder. Suppose there are 2 snakes, 60 20 and 40 20 which share the same endpoint, we can store it like data[60] = 20 and ...

By the way, could you share your algorithm here ? Brute force will certainly get Time Limit Exceeded...

what do you mean by saying your max depth loop is only 2 ?
Do you mean your program runs in O(n^2) ? It's amazing.
I think O(n^3) and O(n^4) will get AC, and I don't know how to figure an O(n^2) solution..
Maybe you can paste your code here to make it clear.