OJ Board

Why WA plz help #include <cstdio> #include <algorithm> #define MAX 10000 using namespace std; int set[MAX]; void setSet(int n){ int i; for(i = 0; i < n; i++) set[i] = i; } int findSet(int n){ return set[n]; } void setReset(int a,int b,int max){ int i; int t = set[a]; for(i = 0; i < max; i++){ if(set...

Though i got accepted earlier the problem 494. but i submit today and got WA. Why please check my code. #include <cstdio> #include <cstring> #define MAX 1000 int main(){ //freopen("in.txt","rt",stdin); char str[MAX],*p; int c; while(gets(str)){ c = 0; p = strtok(str," !.,;~!...

what do u mean by the line:

Why in same line?

because two other words (substring) may be identical,
that means
"aa" = "a" + "a";

hope it help u.

What was the problem number?

May u submit ur code?

You have declared variables as long int but you are taking input with %lld as long long int.
How can you hope that you will get Accepted.

The problem is really Easy if you think a little before post.

But some of my friends had got Acc
think judge has fixed it.

What should be the output for: think you got the point.

Nobody here to see my code?
Humm?

Your code even does not pass the sample input.
What do you mean by

i think there is no need to use BFS. as the limit is at most 20x20. My algorithm: 1. Take all the points to a structure. 2. store source 3. get next close point from source for this i count the ( abs(sx - node .x) + abs(sy - node .y) ) upto all beepers point and return the expected pont. 4. next i u...

What was your problem?

Its a simple Java code but ONLINEJUDGE says me RE!! why can u find plz. import java.util.*; import java.io.*; import java.math.BigInteger; class WorldCup{ WorldCup(){}; public static void main(String args[]){ int i,n,num; BigInteger B[] = new BigInteger[55]; Scanner sc = new Scanner(System.in); B[0]...