OJ Board

i' really can

Can someone past here some tricky input cases?? My program runs well in my pc, and solves 20 sticks input quiqly, however, wen i submit my code, i get TLE, maybe because a infinite loop caused by some tricky input.

Thanks for any help

ok. now i think that i understood it. but that is only to get the program faster it isn't? since i try all the possible combinations, i should get AC, don't you think?

if you have some input cases, please post it here.

Thanks,

Vitor

hello.

i've been reading all the posts again and again and i still not know why my code gets WA.

can someone try to find some bug in my code? thanks

code:
[c]
#include <math.h>

char mensagem[80];
int sim;

char b1[32],b2[32];
int shift;

void inicializa()
{
int i;
for (i=0;i<80;i ...

thanks for your help, but i didn't understand very well your explanation .

You used a graph or a tree? Can you post or send to my email a sort of algorithm to see if i really understand?

I've tried to solve 307 too, but i didn't solve it too .

Thanks

i've been modifying my code and now it solves turuthok 's input, but i still get WA. Can someone help me?

My new code is:
[cpp]

#include <iostream>

int val[20];
int livre[20];


int tentar(int ind, int parc)
{
if (parc==0) return 1;
if (ind<0) return -1;
if (val[ind]>parc) return (tentar(ind-1 ...

yeah. that's just the solution. i was getting WA because i've not noticed that particular question. now i've got AC.

Thanks everybody

Hisoka and razibcse, you do not have to use any formula to calculate factorial of negative numbers. Jus print "Overflow!" if the number is odd, or "Underflow!" if the number is even.

Good luc

hi. i'm soltrix (i don't know why i can't login since i changed some info in my profile :( )
you're right. i tested your input and i've seen that the output is "no" instead of "yes"

But, i'm not seing another way to solve this problem. can you give some instructions ???

I've been thinking, but i ...