## Search found 12 matches

Wed Jul 27, 2005 9:21 pm
Forum: Volume 4 (400-499)
Topic: 446 - Kibbles "n" Bits "n" Bits "n" Bits
Replies: 50
Views: 5079
Can anyone think of some tricky examples?
Thank you!
Tue Jul 26, 2005 9:49 pm
Forum: Volume 4 (400-499)
Topic: 446 - Kibbles "n" Bits "n" Bits "n" Bits
Replies: 50
Views: 5079

I am trying to solve the Kibbles ``n'' Bits ``n'' Bits ``n'' Bits problem. It seems like a very easy problem, and it is, but I keep getting WA. I coded it several times... Please help me if you see any mistake... I don't know what could be wrong in such short code. Thanks! #include <cstdio> #include...
Mon Jan 31, 2005 6:05 pm
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 32032
I got AC.

I reallized where the problem was and solved it by changing the for loop to look like this:
for(i=0; i<MAXN; i++)

This works, because N is actually irrelevant, but what should I do to scanf N correctly?
Could you explain me why my older code didn't work?

Thank you very much!
Wed Jan 12, 2005 11:18 am
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 32032

### 793 Network Connections WA, what am I doing wrong?

I get WA, but don't have any idea why! Is something wrong with my input? Please help! int main(void) { int i, n, t, a, b, suc, unsuc, c; scanf("%d", &t); for(; t>0; t--){ suc = 0 ; unsuc = 0; scanf("%d\n", &n); for(i=0; i<=n; i++) dad[i] = 0; for( ; ; ){ c = getc(stdin); if (c != 'c' && c != 'q') br...
Thu Dec 02, 2004 12:40 pm
Forum: Volume 107 (10700-10799)
Topic: 10761 - Broken Keyboard
Replies: 31
Views: 12134
I struggled a lot because I used to transform all characters into lowercase and then check for "finish" and "end".
This is wrong and there is surely an input that checks this.
Wed Nov 03, 2004 9:48 pm
Forum: Volume 4 (400-499)
Topic: 450 - Little Black Book
Replies: 57
Views: 6678

### 450 (Little Black Book) LIMITS? PLZ HLP!!!

Can someone who got AC tell me what limits did he use for
Number of people and Maximum length of their names, adresses...

I keep on getting SIGSEGV no matter what limits I use.

Is it OK if I sort people using the implemented Qsort in C?
Wed Nov 03, 2004 12:25 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 14697

### How do I solve 481 (What goes up)? PLZ HLP!!!

How do I solve the 481 (What goes up) problem more efficently? I implemented the standard LIS algorithm, but it seems to be too slow. I've tried implementing it using linked lists and some other things to improve the time, but stil keep on getting TLE. Can anybody give me an idea to fasten my progra...
Sun Oct 31, 2004 9:48 pm
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 29686
I found the error.
Sun Oct 31, 2004 3:57 pm
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 29686

### 755 -> how is this possible??

How is it possible that for the following code,
OJ says it uses only 64 KB when it should use at least 0.3 MB?

It also says WA in 0.00 seconds.

[c]
[/c]

I don't understand this.
Sat Oct 30, 2004 9:02 am
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 48151
I reallized where my mistake was!

In some inputs like "(((])", I would print NO two times!

Thanks anyway!
Fri Oct 29, 2004 4:43 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 48151
Thanks Junayeed, but it works perfectly for your input.

Could you post more inputs?

Thanks!
Thu Oct 28, 2004 11:42 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 48151

### 673->parenthenses ballance WA (plz help!)

I am frustrated, I tried every possible input, but I still keep on getting WA.
Does anybody have a clue what is wrong with my code?
Is it something with the classes?