Search found 2 matches

by m1m6
Wed Jan 29, 2014 12:38 am
Forum: Volume 100 (10000-10099)
Topic: 10038 - Jolly Jumpers
Replies: 445
Views: 80057

Re: WA in Problem E: Jolly Jumpers 10038

Doesn't match sample I/O.
how !!

try these....
4 1 4 2 3
5 1 4 2 -1 6
5 3 2 3 2 3
4 1 4 2 3
5 1 4 2 -1 6
1 1
2 1 2
4 5 5 5 5
5 10 8 6 4 2
4 1 4 3 1
4 3 1 5 2


output :

Jolly
Not jolly
Not jolly
Jolly
Not jolly
Jolly
Jolly
Not jolly
Not jolly
Jolly
Not jolly
by m1m6
Tue Jan 28, 2014 1:49 pm
Forum: Volume 100 (10000-10099)
Topic: 10038 - Jolly Jumpers
Replies: 445
Views: 80057

WA in Problem E: Jolly Jumpers 10038

why i got WA answer in jully jumber .... the problem ask to find two successive elements their difference BW 1 to n-1 whta's the wrong !!! #include <iostream> #include<stack> #include <cmath> #include<cstdlib> #include<cstdio> using namespace std; bool findR(int x,stack<int>s) { while (!s.empty()) {...

Go to advanced search