Search found 4 matches

by zooom
Mon Jan 07, 2008 7:33 am
Forum: Volume 4 (400-499)
Topic: 400 - Unix ls
Replies: 93
Views: 19644

@ above .. Noo The problem says the output must span the minimum amount of rows .. In your case its 3 while output with 2 rows too is possible ..
by zooom
Sun Nov 18, 2007 4:49 am
Forum: Volume 104 (10400-10499)
Topic: 10449 - Traffic
Replies: 58
Views: 23483

Getting WA Anyone please tell :( :(

Finally Accepted For all those trying to solve this Remember some inputs are greater then node number . so output "?" for them. For all negative cycles output "?" for that node. For all unreachable destinations output "?" For all <3 destns output "?" Hope Tha...
by zooom
Sat Nov 17, 2007 5:06 pm
Forum: Volume 104 (10400-10499)
Topic: 10436 - Cheapest way
Replies: 18
Views: 6947

TLE !!! SOS for HELP :(

My Solution gives TLE :( :( for n=20 its looks quite impossible .. Can someone Tell me the reason for this strange behavior .. I use Dijkstra's to find the shortest path .. here's my code.. #include<iostream> #include<string> #include<map> #include<queue> #include<vector> #include<stdio.h> using nam...
by zooom
Tue Jun 12, 2007 9:28 am
Forum: Volume 4 (400-499)
Topic: 454 - Anagrams
Replies: 97
Views: 23260

WA help!!

#include<iostream> #include<vector> #include<string> #include<algorithm> #include<numeric> using namespace std; int main(){ int testcases; cin>>testcases; string emptyss; getline(cin,emptyss); getline(cin,emptyss); bool ans=false; while(testcases>0){ if(ans){ cout<<endl; } ans=true; string dummy; v...

Go to advanced search