OJ Board

I know in this problem I have to declare a s[51]. And I set its value as a string of consecutive '*'s or '.'s. I just wanna know what's the difference between them.

I wanna ask a small problem in the program. It's about the method in printing the string of length n. Let me assume that n<6. Method 1 s[6]="*****"; s[n]='\0'; printf("%s",s); s[n]='*'; Method 2 for(x=0;x<n;x++) putchar('*'); The method 1 got WA and the method 2 got AC. But I wan...

I passed the sample input but got WA. Is it the precision problem?

I have a question. According to your formula, the x will be 2wg/k, i.e. the x for the first set of data in the problem will be about 4.2, which is less then the difference between 20 and 30 and we will get the answer as stucking in the air. I think Bond jumps from the top to the lowest height. The l...

You're right. I made a mistake in the input. But I assume that all the input are correct. Maybe there are some bugs in my program.

Maybe this is my last approach...post my code Everybody can run it with your own cases Maybe you will find out the bug #include<stdio.h> #define YES 1 #define NO 0 void main(void) { int n,x,card[5][5],y,z,vertical[5],horizontal[5],diagonal[2],i,check[75],pos[75][2],found; scanf("%d",&n...

I still don't know why. It's too easy for me to get ac. Please help me check the in/output 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 30 31 32 33 34 11 12 13 14 1 2 3 4 5 6 7 8 9 10 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 ...

And this case? 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 30 31 32 33 34 11 12 13 14 1 2 3 4 5 6 7 8 9 10 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 The ...

I got AC at such a really slow speed. Could someone give your suggetion about speeding up the program?

I have modified my code that I get the same answer as above. But I still got WA. I don't know what I haven't paid attention to.

I think I could understand your algorithm. But what's wrong with my program? Any critical case could cause error?

How about the following in/output?

in:
2342
2343
34
1
234
678
67223
76627567
334
787890
787611
0

out:
Case 1: 1173
Case 2: 104
Case 3: 19
Case 4: 2
Case 5: 31
Case 6: 119
Case 7: 5184
Case 8: 22408
Case 9: 169
Case 10: 131321
Case 11: 23900


Could someone give some critical case?

I got ac....

How about the input/output?

in:

9
3123 2342
234 2343
45 789
111 2222
4999 9999
4999 2
23 6324
454 9022
223 45

out:
Case 1:
6
Case 2:
194
Case 3:
195
Case 4:
61
Case 5:
2
Case 6:
Impossible to divide
Case 7:
285
Case 8:
39
Case 9:
Impossible to divide

I have thought about the binary search tree.... Do I get the answer?