Search found 32 matches

by sklitzz
Sat Aug 04, 2007 10:50 am
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20487

Thanks man! That was a really stupid error :-)
by sklitzz
Fri Aug 03, 2007 9:02 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20487

Ok, I've changed that. But still it keeps giving me WA. I have no more idea what to
do!

Code: Select all

AC...
by sklitzz
Fri Aug 03, 2007 2:08 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20487

OK I did that and I still keep getting WA. I thought that it might be that I
implemented the max flow wrong so I copied
Igor Naverniouk's code and still get WA. Please check it out.

Code: Select all

 AC...
by sklitzz
Fri Aug 03, 2007 1:53 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20487

Hi,
I've just started figuring out how max flow works. I'm having trouble with this task because the graph is not directed and I thought this was required for max flow. Can anybody explain how does this work? ( max flow with bidirectional edges ).
by sklitzz
Fri Jul 27, 2007 1:52 pm
Forum: Volume 1 (100-199)
Topic: 119 - Greedy Gift Givers
Replies: 145
Views: 24873

Hi, I've been getting WA for this problem quite a while. I've searched the forum and tried out the test cases. I still can't find why it gets WA. Can anybody help? My code #include <iostream> #include <string> #include <vector> using namespace std; #define pb(x) push_back(x) #define mp(a,b) make_pai...
by sklitzz
Fri Dec 22, 2006 1:14 pm
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21406

494 very wierd solution?!

I sent my code and the judge just keeps saying Recieved and nothing happens it just hangs like that?! #include <iostream> #include <string> #include <cctype> using namespace std; #define pb(x) push_back(x) #define mp(a,b) make_pair(a,b) int main() { string s; while( getline( cin, s ) ) { int c = 0; ...
by sklitzz
Thu Oct 19, 2006 11:07 pm
Forum: Volume 110 (11000-11099)
Topic: 11096 - Nails
Replies: 28
Views: 14234

I'm having trouble with this task. I keep getting Runtime Error. Does anybody see the bug? #include <iostream> #include <string> #include <algorithm> #include <cstdio> #include <vector> #include <climits> #include <cmath> using namespace std; #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y)...
by sklitzz
Fri Oct 13, 2006 10:49 am
Forum: Volume 4 (400-499)
Topic: 499 - What's The Frequency, Kenneth?
Replies: 93
Views: 10213

This is what I coded. And I keep getting WA. What did I forget? #include <iostream> #include <string> #include <algorithm> #include <cstdio> using namespace std; #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y) #define SQ(x) (x)*(x) string solve( string s ) { int cnt[52]; memset( cnt, 0, si...
by sklitzz
Thu Oct 12, 2006 12:03 pm
Forum: Volume 4 (400-499)
Topic: 499 - What's The Frequency, Kenneth?
Replies: 93
Views: 10213

Hi, I'm not sure anymore whether I have to print ABC...XYZabc...xyz 0 or a blank line or just skip that one. Does the above work for blank lines nad those without any characters. It's a simple task but I'm going crazy tryin figure it out. #include <iostream> #include <string> #include <algorithm> #i...
by sklitzz
Thu Sep 21, 2006 10:41 pm
Forum: Volume 103 (10300-10399)
Topic: 10337 - Flight Planner
Replies: 20
Views: 8758

10337 Flight Planner

I'm having trouble with this problem. I written a simple dp. But I can't get the right answears even for the example test cases. Have I understood something wrong? This is my code: #include <iostream> #include <algorithm> #include <cstdio> #include <climits> using namespace std; #define INF INT_MAX ...
by sklitzz
Fri Sep 08, 2006 4:41 pm
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 22363

Thank you very very much!
by sklitzz
Sun Aug 13, 2006 8:32 pm
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 22363

i solved it in O(n) time. my dp part looks like : initialize best[10001] array by 0; best[m]=best[n]=1; for(i=min(m,n);i<=t;i++){ if(i>=m && best[i-m]+1 > best && best[i-m]) best =best[i-m]+1; if(i>=n && best[i-n]+1 > best && best[i-n]) best =best[i-n]+1; } if best[t]!=0 then simply output best[t]....
by sklitzz
Fri Jul 07, 2006 3:46 pm
Forum: Volume 101 (10100-10199)
Topic: 10137 - The Trip
Replies: 159
Views: 44756

Try searching through the forums, you'll find the answer to your question. I had a problem and found a solution without posting a new topic.
by sklitzz
Tue Jul 04, 2006 1:21 pm
Forum: Volume 101 (10100-10199)
Topic: 10196 - Check The Check
Replies: 77
Views: 23238

10196 WA, I simply don't see it

Hi, I've been batling this task for a couple of hours now and I really don't see where is the bug in my code. I read a lot of posts wih people having the same problem. But if anyone could simply check it out 'cause I'm loosing my mind here. My code is so simple so I can't understand where could the ...
by sklitzz
Thu May 25, 2006 10:45 pm
Forum: C++
Topic: It says compiler error
Replies: 6
Views: 2381

I added the string header and got AC!
Thanks to you all.

Go to advanced search