OJ Board

Hi... I Get WA for this Problem... I think this Problem in Maximum Sum in 2D array. so with problem Ranges (100) I use O(N^4)... Can any body help why I get WA ? This is my code : #include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; #def...

hi...
I got WA ! But I cant not figure it out...
Can Anybody help...

my code :

I got WA ! :( can anybody give me some testcase for my weak point... my code : #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int main() { int t , n; int a , b , k; scanf("%d", &t); for(int pp = 0; pp < t ; pp++) { k = -1; a = 0; scan...

hi I got RunTime Error... as a general in the problem is mentioned that (j < 10001) so it means that we dont want to produce more than 10000 character for each BFS ! can anybody say that this is true !? or what's the problem of my code ? :-? #include <iostream> #include <string> #include <algorithm>...

hi... I got WA for this Problem... can anybody help... #include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <cstring> #include <cstdio> using namespace std; #define INF 99999.0 typedef struct p{ double x , y; }point; point in[110]; double path[110][110]; double dis(po...

Hello...
is anybody try to solve this question with DFS !?

I got WA... please Help me :( by the way, all the available test cases in this site are have right output... #include <iostream> #include <vector> #include <string> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; int p[4][2]={{0,-1}, {1,0}, {0,1}, {-1,0}}; vector < str...

I Don't Know I got WA in this easy problem ...
please Help...

I don't understand it !
how I can Do it !?
thank U for replay !

I think this Problem is so easy but I don't know Why I Got WA ? Please Help :) my code : #include <iostream> #include <cmath> using namespace std; typedef long long int ll; ll expand(double a) { ll res = (ll)(a*100); return res; } int main() { int n; cin >> n; for(int pp =1 ; pp <= n ; pp++) { doubl...

can anybody help me !? I got WA but my programme in all of my testcases are true ! my code : #include <iostream> #include <algorithm> #include <string> #include <sstream> using namespace std; bool dp[201]; int a[201]; int main() { int n; string s; stringstream str; cin >> n; getline(cin , s); for(in...

I am little bit confused about the overlapping process. Can anyone help me? I think you learn an open range and close range of numbers in R open range = (0 ,20) close range = [0 , 20] and if a = (0 , 1) and b = (1 ,2) the Subscription of a and b is NULL but if a = (0 , 1] and [1 , 2) the Subscripti...

i Got AC ...

Hi...
I got WA and I dont how this could be happend...
Please help to figure it out , thanks...

this is my code :

by the way you can use arrey as global variables whit size of more than 50000...
for example 100000...