Search found 11 matches

by ligregni
Wed Jan 02, 2008 12:34 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33370

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 - 5...
by ligregni
Wed Jan 02, 2008 11:35 am
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33370

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 printf("0\n")...
by ligregni
Sun Dec 30, 2007 8:43 am
Forum: Volume 113 (11300-11399)
Topic: 11371 - Number Theory for Newbies
Replies: 65
Views: 22734

long long... double... HELP!

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 32 lo...
by ligregni
Sun Dec 30, 2007 3:12 am
Forum: Volume 113 (11300-11399)
Topic: 11371 - Number Theory for Newbies
Replies: 65
Views: 22734

Long 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 could m...
by ligregni
Sun Dec 30, 2007 1:39 am
Forum: Volume 113 (11300-11399)
Topic: 11371 - Number Theory for Newbies
Replies: 65
Views: 22734

I'm getting WA!!!!

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", stdin);/**...
by ligregni
Thu Dec 27, 2007 2:13 am
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 43581

Help!, I am OK but TLE!!!

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 solving p...
by ligregni
Wed Dec 26, 2007 6:48 am
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21935

ADVICES!

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! Sergio Ligregni, MEX.
by ligregni
Tue Dec 25, 2007 2:43 am
Forum: Volume 1 (100-199)
Topic: 119 - Greedy Gift Givers
Replies: 145
Views: 25725

119 ACCEPTED

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 if someone s...
by ligregni
Tue Dec 25, 2007 2:40 am
Forum: Volume 1 (100-199)
Topic: 119 - Greedy Gift Givers
Replies: 145
Views: 25725

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 if someone s...
by ligregni
Mon Dec 24, 2007 10:06 pm
Forum: Volume 3 (300-399)
Topic: 362 - 18,000 Seconds Remaining
Replies: 75
Views: 26226

I have almost 40 submissions and still WA!!!

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" (al...
by ligregni
Mon Dec 24, 2007 9:44 pm
Forum: Volume 109 (10900-10999)
Topic: 10924 - Prime Words
Replies: 44
Views: 22426

WA I don't know why!

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!=EOF) ...

Go to advanced search