Search found 4 matches

by hotovaga
Mon Feb 21, 2011 9:02 am
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 27316

Re: 11479 - Is this the Easiest Problem?

Where is the problem in my code? getting WA..
help me pls..

Code: Select all

got AC
by hotovaga
Mon Feb 21, 2011 7:59 am
Forum: Volume 114 (11400-11499)
Topic: 11492 - Babel
Replies: 18
Views: 14495

11492 - Babel

This is my approach, I can't understand why I am getting WA.

#include<iostream>
#include<utility>
#include<cstdio>
#include<vector>
#include<string>
#include<map>
#include<queue>

#define MAX_INT 1077952576

using namespace std;

int E,len;

int cost[2*2000+10],res;
bool visited[2*2000+10];

map ...
by hotovaga
Fri Dec 10, 2010 7:07 pm
Forum: Volume 5 (500-599)
Topic: 567 - Risk
Replies: 46
Views: 25644

Re: 567 (Risk) - Wrong Answer

hey can anyone pls help me, where is the problem in this code? I used bfs to solve this problem.Thanks in advance.


#include<iostream>
#include<cstdio>
#include<queue>


using namespace std;

bool M[30][30];




int do_bfs(int city1,int city2)
{
queue<int> q;
int d[20]={0};
bool seen[20];

for ...
by hotovaga
Mon Nov 29, 2010 9:42 pm
Forum: Volume 103 (10300-10399)
Topic: 10385 - Duathlon
Replies: 16
Views: 10675

10385 - Duathlon

Can anyone tell me what is the problem in my code? I've just learnt ternary search from wikipedia and tried to implement it..I would be very happy if someone tell me why this code is judged as WA
Thanks in advance. here is my code:



#include<iostream>
#include<cstdio>

using namespace std;

int ...

Go to advanced search