Search found 5 matches

by paradise_737
Tue Feb 23, 2010 2:35 am
Forum: Volume 106 (10600-10699)
Topic: 10608 - Friends
Replies: 75
Views: 26322

Re: 10608 - Friends

hi guys ; please can any body tell m why am getting WA or provide me with test cases different from those on board #include<iostream> #include<vector> #include<algorithm> using namespace std; int N , M; bool Visited[30100]; vector<int>Adjacency_List[31000]; int a , b; int Count; int MAX; void dfs( i...
by paradise_737
Mon Sep 07, 2009 6:48 pm
Forum: Volume 2 (200-299)
Topic: 232 - Crossword Answers
Replies: 12
Views: 6529

232 CROSSWORDS ANSWERS

HI GUYS AM STUCK IN THIS PROBLEM FOR 3 HOURS BUT I'M NOT GETTING TO THE RIGHT OUTPUT IMPLEMENTATION

ANY BODY CAN HELP PLEASE :cry: :cry: :cry:
by paradise_737
Sat Sep 05, 2009 4:41 am
Forum: Volume 114 (11400-11499)
Topic: 11426 - GCD - Extreme (II)
Replies: 0
Views: 1835

11426 - GCD - Extreme (II)

hi guys i was wondering how to make an efficient algorithm that reduces the run time of this problem .

mine got 5.96 secs whichs sucks , the top on this problem got 0.50 ( which is wooow ) i wish he can explain how he did it .
by paradise_737
Wed Aug 26, 2009 2:43 am
Forum: Volume 110 (11000-11099)
Topic: 11074 - Draw Grid
Replies: 4
Views: 2992

11074 - Draw Grid

would some one tell me why am getting WA #include <iostream> using namespace std; int main() { int S , T , N ; for ( int counter = 1 ; ; counter++ ) { cin >> S >> T >> N ; if ( T == 0 && S == 0 && N == 0 ) break ; cout << "Case " << counter << ":" << endl ; for ( int i = 0 ; i < T + 1 ; i++ ) { for ...
by paradise_737
Sun Aug 23, 2009 7:31 am
Forum: Volume 7 (700-799)
Topic: 713 - Adding Reversed Numbers
Replies: 142
Views: 39727

Re: 713 - Runtime error

#include <iostream> #include<string> using namespace std; #include<algorithm> int main() { int test_cases ; int i ; while ( cin >> test_cases ) { string a , b ; for ( int j = 0 ; j < test_cases ; j++ ) { int sum_a = 0 , sum_b = 0 ; cin >> a >> b ; reverse( a.begin() , a.end() ) ; reverse( b.begin()...

Go to advanced search