UVa OJ Board

My code gives output 3...... I think it is the right one...What is wrong???

I don't know what is wrong with my code...please anyone help me.... #include<iostream> #include<cstdio> using namespace std; int main() { long a[100090],i,j,k,t,n; scanf("%ld",&t); for(i=0;i<t;i++) { scanf("%ld",&n); for(j=0;j<n;j++) scanf("%ld",&a[j]); k=a[0]; for(j=n-2;j>=0;j--) { if(a[j+1]-a[j]>k...

Can you please explain the De arrangement theorem....please

Its an easy problem....you can think in much simpler way....only tricky case is the bus might be in the next day....

Happy coding...

Got it...thanks sohel bhai.....that was a really foolish mistake....I have thought about your strategy at the first time...but as their is no question of time limit I did that....

Thanks again....

I think this is a quite easy problem...but I am getting WA frequently. Please give me some suggestion.....
here is my code

I don't what is wrong???? #include<iostream> #include<cstring> #include<cstdio> using namespace std; int main() { char a[104][104],ss; long c,r,s,i,j,k; while(scanf("%ld%ld",&r,&c)==2) { getchar(); if(r==0 && c==0) break; k=0,j=0; for(i=0;i<r;i++) { gets(a[i]); getchar(); } s=0; for(i=0;i<r;i++) for...

Still WA.... here is my code...

I am getting wrong answer... What is th tricky case?

Check this: 3 compiler 4 cplusplus 1 java 8 5 compiler 2 algorithm 3 math 9 4 math 2 java 8 ai 3 6 calculus Your program shows for this input set: Case 1: Yesss2 Case 2: Late2 Case 3: Do your own homework! There is no new line after the last output.Give it.And delete the extra things that you are pr...

Why wrong answer?? Can anyone give me some i/o. Here is my code: #include<iostream> using namespace std; bool con[1000009]; int main() { long rw[10000],w[10000],i,j,k,l,n,m,e[10000],s[10000],flag,iv,t; while(1) { flag=0; memset(con,false,sizeof(con)); memset(rw,0,sizeof(rw)); memset(w,0,sizeof(w)); ...

Please delete your post.Who have given the solution.It is not good for others to have solution without solving it.I think this is an easy greedy problem.But one have to be careful about the time.

Happy Coding.

Kamarul got it right.I am agree with him.

Dear Pro.metal,
you have a silly problem on your code.try to find it.best wishes to you....

I found this problem similar to 11608.