OJ Board

my code doesn't work but i have no idea why. can anyone help please?

i have done the following code to solve this problem but it wont run properly, and breaks. I am totally confused as to why this is. Can anyone help please? i take the system("pause") out before submitting.

// Binomial Showdown ...

Hi there!. This is my code:

#include <stdio.h>

long double Factorial(int f, int s) {
if (f < s) return 1;
else return f*Factorial(f-1, s);
}

main() {
long double n, k;
while ((scanf("%Lf %Lf\n", &n, &k)>0)&&(n>0))
if (k > 0)
printf("%.0Lf\n", Factorial(n, n-k+1)/Factorial(k, 1));
else ...

Hi!

I tried to make my code (Is the one all disordered above) with short [] (digit by digit) because I tried to use long long int before and I got WA, and with my rudimentary method (like child) I got AC (obviously it didn't help in the contest)

I wanna ask you something:

Type Bits

int 16
long ...

Thanks for your interest, but I'm a little scary about long long int, I used it in many problems and it didn't work,

so I started implementing short [], and I make the sustraction and division like elementary school,

I firstly wanna know I my tests are wrong, if there is a special number who ...

Hi, here is my code


/* Number Theory */

#include <stdio.h>

int rear (short [], short [], short);
int resta (short [], short [], short [], short);
int division (short [], short, short []);
int printe (short [], short [], short [], short []);

int main ()
{
/*FILE *in = freopen ("c.in", "r ...

Hi!, I used dinamyc memory in this problem,

I read each char (0 or 1) until I found a '\n',

I save this in a kind of stack (I say kind because it is not really a stack, I know the first element adress and the last element adress, the first element adress (from here "*first") is used in the ...

make you sure that your program recognizes words that doesn't have a !,.,? after like a word

Example:

Input:

asd...asd
a

hi mate!

the line in blank is intentionally

Output:

2
1
2


if a line has NO words, don't print ANYTHING (I was getting WA because of that)


I hope it helps ...

I have ACCEPTED!, and some advices, because I also suffered with this problem.


printf a newline BEFORE each case, just avoid first one (count them, if count==1, don't print anything)



print EACH name with a newline after it (after the $$$ of course), includying the last of each test case ...

I have ACCEPTED!, and some advices, because I also suffered with this problem.


printf a newline BEFORE each case, just avoid first one (count them, if count==1, don't print anything)



print EACH name with a newline after it (after the $$$ of course), includying the last of each test case ...

Hi, I'm desesperate, I need help!,

I have revewed all the output sentences, I tried all the cases I've found and they are OK!,

I also tried printing after each case (including last one) "\n\n", or printing after each case (including last) "\n", but printing after each case (except the last) "\n ...

hi!, this is my code /* Prime Words */

REMOVED, got AC

I tried all the single letters, the example cases, the test cases here, and I still getting WA with almost no time (sometimes 0.010 or other times 0.000), I also tried not to print the '\n' at the end if (1)
printf("\n"); changed by if (c ...