getting wa...
tried some critical input..
#include<bits/stdc++.h>
using namespace std;
map<string,int>visited;
map<string,int>level;
int bfs(string src,string des,map< string,vector<string> >Graph)
{
queue<string>Q;
Q.push(src);
visited[src]=0;
level[src]=0;
while(!Q.empty())
{
string u=Q ...
Search found 3 matches
- Tue Apr 07, 2015 8:57 pm
- Forum: Volume 4 (400-499)
- Topic: 429 - Word Transformation
- Replies: 82
- Views: 32399
- Tue Jan 13, 2015 5:15 am
- Forum: Volume 109 (10900-10999)
- Topic: 10945 - Mother bear
- Replies: 65
- Views: 29316
Re: 10945 - Mother bear
Thanks.. 

- Fri Jan 02, 2015 9:13 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10945 - Mother bear
- Replies: 65
- Views: 29316
10945 - Mother bear
Verdict: Compile error
#include<stdio.h>
#include<string.h>
int main()
{
char s[10000];
while(gets(s))
{
if(strcmp(s,"DONE")==0) break;
char s1[10000],s2[10000];
int j=0;
int i;
for(i=0;i<strlen(s);i++)
{
if(isalpha(s[i]))
{
if(islower(s[i]))
{
s1[j]=toupper(s[i]);
j++;
}
else ...
#include<stdio.h>
#include<string.h>
int main()
{
char s[10000];
while(gets(s))
{
if(strcmp(s,"DONE")==0) break;
char s1[10000],s2[10000];
int j=0;
int i;
for(i=0;i<strlen(s);i++)
{
if(isalpha(s[i]))
{
if(islower(s[i]))
{
s1[j]=toupper(s[i]);
j++;
}
else ...