OJ Board

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 ...

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

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 .

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 ...

#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 ...