OJ Board

rio wrote How did you fixed your code ?
Update your code, or erase it and post a new one.
Updated code (got WA)
#include <stdio.h>

struct ractangle
{
int x1, y1, x2, y2 ;
} ;

int main ()
{
//freopen( "11345.in", "r", stdin ) ;

int T, kase, i, N, area ;
ractangle r[50], t ;

scanf( "%d ...

again WA

what's wrong? why WA? any more I/O

Is There someone to help me?

#include <stdio.h>
#include <string.h>

struct IND
{
int r, c ;
} ;

char x[9][6][10 ...

Thanks mmonish for help. I have also a silly mistake. Now waiting to see ....AC

what's wrong with my code? Can I get some tricky I/O.

temper_3243 wrote

do we have a recurrence relation for this problem ?

I found the following recurrence relation

.............| 0 if N = 1
F(N) =...| 1 if N = 2
.............| N / 3 + F ( N / 3 + N % 3 ) otherwise

where F(N) is total extra cola we can get from N cola

Why no reply yet . Please Help !!!!!!!!

Too few post/conversation about 150 ( Double Time )
Dear helpers please help. Give some critcal input & output

Thanks to Carunty for his/her help. But I tested my code with all test case
which I found on board. But for those my code gives correct output.
What should I do in this circumstances?

Sorry, Not TLE