Search found 23 matches
- Fri Sep 23, 2011 11:06 pm
- Forum: Volume 119 (11900-11999)
- Topic: 11951 - Area
- Replies: 6
- Views: 4688
11951 - Area
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...
- Wed Aug 10, 2011 7:32 am
- Forum: Volume 119 (11900-11999)
- Topic: 11946 - Code Number
- Replies: 49
- Views: 10281
Re: 11946- Code Number
hi...
I got WA ! But I cant not figure it out...
Can Anybody help...
my code :
I got WA ! But I cant not figure it out...
Can Anybody help...
my code :
Code: Select all
AC... :)
- Tue Aug 09, 2011 2:11 am
- Forum: Volume 120 (12000-12099)
- Topic: 12032 - The Monkey and the Oiled Bamboo
- Replies: 23
- Views: 8067
Re: 12032
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...
- Mon Aug 08, 2011 6:35 pm
- Forum: Volume 120 (12000-12099)
- Topic: 12041 - BFS (Binary Fibonacci String)
- Replies: 0
- Views: 1775
12041 - BFS (Binary Fibonacci String)
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>...
- Fri May 27, 2011 12:15 am
- Forum: Volume 108 (10800-10899)
- Topic: 10803 - Thunder Mountain
- Replies: 47
- Views: 24996
Re: 10803 - Thunder Mountain
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...
- Sat May 21, 2011 10:38 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11825 - Hackers' Crackdown
- Replies: 5
- Views: 4217
Re: 11825 - Hackers’ Crackdown
Hello...
is anybody try to solve this question with DFS !?
is anybody try to solve this question with DFS !?
- Mon May 16, 2011 1:59 am
- Forum: Volume 6 (600-699)
- Topic: 657 - The die is cast
- Replies: 46
- Views: 22993
Re: 657 - The die is cast
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...
- Mon May 16, 2011 1:55 am
- Forum: Volume 6 (600-699)
- Topic: 661 - Blowing Fuses
- Replies: 67
- Views: 22274
- Sun Apr 10, 2011 12:53 am
- Forum: Volume 119 (11900-11999)
- Topic: 11945 - Financial Management
- Replies: 10
- Views: 5433
Re: 11945 - Financial Management
I don't understand it !
how I can Do it !?
thank U for replay !
how I can Do it !?
thank U for replay !

- Fri Apr 08, 2011 2:43 am
- Forum: Volume 119 (11900-11999)
- Topic: 11945 - Financial Management
- Replies: 10
- Views: 5433
11945 - Financial Management
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...
- Sat Mar 19, 2011 12:59 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10664 - Luggage
- Replies: 20
- Views: 14552
Re: 10664 - Luggage
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...
- Thu Mar 10, 2011 12:33 am
- Forum: Volume 119 (11900-11999)
- Topic: 11926 - Multitasking
- Replies: 21
- Views: 7546
Re: 11926 - Multitasking
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...
- Thu Mar 03, 2011 5:53 pm
- Forum: Volume 119 (11900-11999)
- Topic: 11926 - Multitasking
- Replies: 21
- Views: 7546
Re: 11926 - Multitasking
i Got AC ... 

- Thu Mar 03, 2011 5:00 pm
- Forum: Volume 119 (11900-11999)
- Topic: 11926 - Multitasking
- Replies: 21
- Views: 7546
Re: 11926 - Multitasking
Hi...
I got WA and I dont how this could be happend...
Please help to figure it out , thanks...
this is my code :
I got WA and I dont how this could be happend...

Please help to figure it out , thanks...
this is my code :
Code: Select all
the code is deleted...
- Fri Nov 20, 2009 11:57 pm
- Forum: Volume 4 (400-499)
- Topic: 481 - What Goes Up
- Replies: 82
- Views: 16498
Re: 481 - What Goes UP (Run Time Error)
by the way you can use arrey as global variables whit size of more than 50000...
for example 100000...

for example 100000...
