Search found 88 matches
- Sun Oct 31, 2010 7:08 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11838 - Come and Go
- Replies: 22
- Views: 11239
Re: 11838 - Come And Go
Thanks Got accepted now. I did a silly pen mistake.
- Fri Oct 29, 2010 8:38 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11838 - Come and Go
- Replies: 22
- Views: 11239
Re: 11838 - Come And Go
I used tarjan's algorithm. I am getting wrong answer. I spent a lot of time to this but did not get the reason. Can any one help me to fix my error.
Here is my code:
Here is my code:
Code: Select all
Cut After Accepted
- Fri Jun 23, 2006 3:16 am
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
- Thu Jun 22, 2006 11:46 pm
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
- Thu Jun 22, 2006 11:15 pm
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
- Thu Jun 22, 2006 3:42 pm
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
- Wed Jun 21, 2006 11:31 pm
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
- Wed Jun 21, 2006 2:53 am
- Forum: Off topic (General chit-chat)
- Topic: Map Problem
- Replies: 12
- Views: 6229
Map Problem
When I compiled the following code
Then 77 warnings shows.
How can I remove those warnings.
Here is the code
#include<stdio.h>
#include<ctype.h>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
map<string,int> M;
void main()
{
}
Then 77 warnings shows.
How can I remove those warnings.
Here is the code
#include<stdio.h>
#include<ctype.h>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
map<string,int> M;
void main()
{
}
- Sat Jun 17, 2006 3:42 pm
- Forum: Off topic (General chit-chat)
- Topic: Error Massage!!!
- Replies: 1
- Views: 2175
Error Massage!!!
Why The Following Link can not Display Ccurrent Rank List?
http://www.shygypsy.com/acm/cgi-bin/authorRanks.pl
http://www.shygypsy.com/acm/cgi-bin/authorRanks.pl

- Sat Jun 17, 2006 12:33 pm
- Forum: Off topic (General chit-chat)
- Topic: Who will win the World Cup?
- Replies: 53
- Views: 137623
- Tue May 02, 2006 9:17 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10164 - Number Game
- Replies: 32
- Views: 15919
Please help
I used DP for this problem.
But getting TLE :evil:
Can any one tell me why am i getting TLE?
Either check my code or give me prunning idea please :(
#include<stdio.h>
//#include<math.h>
//#include<string.h>
#define range 1100005
#define drange 2100
#define crange 1100
#define type int
type sum ...
But getting TLE :evil:
Can any one tell me why am i getting TLE?
Either check my code or give me prunning idea please :(
#include<stdio.h>
//#include<math.h>
//#include<string.h>
#define range 1100005
#define drange 2100
#define crange 1100
#define type int
type sum ...
- Sun Apr 30, 2006 10:12 pm
- Forum: Off topic (General chit-chat)
- Topic: How many problem you submit by last month?
- Replies: 5
- Views: 3712
Re: How many problem you submit by last month?
But Nobody can know that How many problems you got Accepted last month from those 20 submitted problems.Zaspire wrote:I submit 20 problem



I think u have understood my comments.
- Tue Apr 25, 2006 7:14 pm
- Forum: Off topic (General chit-chat)
- Topic: Help!Help!
- Replies: 2
- Views: 2588
- Tue Apr 25, 2006 10:52 am
- Forum: Off topic (General chit-chat)
- Topic: Help!Help!
- Replies: 2
- Views: 2588
Help!Help!
I have solved 10245 (The Closest Pair Problem).
Now I want to solve more uva problems like this.
Can Anyone gve me such type of problems?
Thanks.

Now I want to solve more uva problems like this.

Can Anyone gve me such type of problems?
Thanks.
- Tue Feb 28, 2006 8:54 pm
- Forum: Volume 2 (200-299)
- Topic: 299 - Train Swapping
- Replies: 81
- Views: 23974
Re: 299 wa help!plz
yogeshgo05
You did not swap value after comparing.
This is only and only your mistake.
You did not swap value after comparing.

This is only and only your mistake.

Hope u have understoodif(a[j]>a[j+1)then
1.increase counter
2.Swap a[j] and a[j+1]