Search found 12 matches

by a.elbashandy
Thu Aug 01, 2013 5:13 am
Forum: Volume 112 (11200-11299)
Topic: 11284 - Shopping Trip
Replies: 32
Views: 15040

Re: 11284 - Shopping Trip

AKJ88 Yes i use extra matrix for saving minimum distance between dvd stores and the initial position only
by a.elbashandy
Wed Jul 31, 2013 4:18 pm
Forum: Volume 112 (11200-11299)
Topic: 11284 - Shopping Trip
Replies: 32
Views: 15040

Re: 11284 - Shopping Trip

@brianfry Still WA :( #include <cstdlib> #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cctype> #include <stack> #include <queue> #include <list> #include <vector> #include <map> #include <sstream> #include <cmath> #include <bitset> #include...
by a.elbashandy
Wed Jul 31, 2013 4:36 am
Forum: Volume 112 (11200-11299)
Topic: 11284 - Shopping Trip
Replies: 32
Views: 15040

Re: 11284 - Shopping Trip

I keep getting WA, help please !! #include <cstdlib> #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cctype> #include <stack> #include <queue> #include <list> #include <vector> #include <map> #include <sstream> #include <cmath> #include <bits...
by a.elbashandy
Sun Apr 07, 2013 12:16 am
Forum: Volume 109 (10900-10999)
Topic: 10901 - Ferry Loading III
Replies: 54
Views: 24637

Re: 10901 - Ferry Loading III

I passed all the test cases and it still got WA, can anyone please help me ? #include <cstdlib> #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cctype> #include <stack> #include <queue> #include <list> #include <vector> #include <map> #includ...
by a.elbashandy
Sat Mar 23, 2013 1:07 pm
Forum: Volume 106 (10600-10699)
Topic: 10672 - Marbles on a tree
Replies: 8
Views: 4370

Re: 10672 - Marbles on a tree

thanks brianfry713
by a.elbashandy
Sat Mar 23, 2013 5:05 am
Forum: Volume 106 (10600-10699)
Topic: 10672 - Marbles on a tree
Replies: 8
Views: 4370

Re: 10672 - Marbles on a tree

I'm getting WA, are there any critical test cases to test my code ?

Code: Select all

removed after accepted
by a.elbashandy
Fri Mar 22, 2013 4:13 pm
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 15245

Re: 10926 - How Many Dependencies?

@brianfry713 I changed my algorithm to the one you suggested by running DFS N times and it's still WA and don't know why. #include <cstdlib> #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cctype> #include <stack> #include <queue> #include <l...
by a.elbashandy
Fri Mar 22, 2013 2:10 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 15245

Re: 10926 - How Many Dependencies?

@brianfry713 thanks for the reply but i don't understand. do you mean removing the if condition " !visited " ?
by a.elbashandy
Thu Mar 21, 2013 11:13 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 15245

Re: 10926 - How Many Dependencies?

I've got WA and don't why .. please can anyone post some critical test cases ? #include <cstdlib> #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string> #include <cctype> #include <stack> #include <queue> #include <list> #include <vector> #include <map> #incl...
by a.elbashandy
Thu Mar 07, 2013 1:45 pm
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 21930

Re: 10020 - Minimal Coverage

AC. Thanks a lot brianfry713 :)
by a.elbashandy
Wed Mar 06, 2013 11:16 pm
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 21930

Re: 10020 - Minimal Coverage

What's wrong with my code ? it solves all the test cases correctly.

Code: Select all

Removed after AC
by a.elbashandy
Fri Dec 23, 2011 6:33 pm
Forum: Volume 104 (10400-10499)
Topic: 10405 - Longest Common Subsequence
Replies: 103
Views: 32277

Re: 10405 - Longest Common Subsequence

my code seems to be right but i get WA !!! can anyone help me ?? #include <iostream> #include <stdio.h> using namespace std; int main() { char line1[1010]; char line2[1010]; while(gets(line1) && gets(line2)) { char c,d; int i = 0,j = 0,saved_j = 0,sum = 0,msum = 0,flag = 0,counter = 0; c = l...

Go to advanced search