OJ Board

coze

Try the following input:
Input

1
3 3 3

Output

Code: Select all

Case 1: Equilateral

Code: Select all

if (a == b == c)

is not equal to

Code: Select all

if (a == b && b == c)

Hope it helps.

coze

Hi. if (i == 0) if(sum >= y[0]) sum -= (tmp - y[0]); else if(sum >= y[i-1]) sum-= (p[i-2] - y[i-1]); The following code is the same as above: if (i == 0) { if(sum >= y[0]) { sum -= (tmp - y[0]); } else if(sum >= y[i-1]) { sum-= (p[i-2] - y[i-1]); } } Hope it helps.

coze

Try using "%.0lf" instead of "%d".

Code: Select all

printf("The cheater can win by %.0lf seconds with r = %.2lfkm and k = %.2lfkm.\n",
       (f(left)),left,total-left);

coze

Hi serur. I checked with assert that n is greater than 1. Input: 7 2 3 4 4 3 100 9 25 20 40 12 37 23 9 49 17 19 33 5 67 3 34 11 21 30 My output: The cheater can win by 2099 seconds with r = 7.00km and k = 0.00km. The cheater can win by 1270 seconds with r = 21.53km and k = 78.47km. Hope it helps.

coze

Please explain me why in first example the answer is "NYY"?
Input:

Code: Select all

2                                 
4                                 
8 7 6 5 4 3 2 1
8 6 3 1 2 4 5 7
8 3 6 5 1 2 7 4
1 2 3 4 5 6 7 8
1
1 2 3 4 5 6 7 8

Output:

Code: Select all

NYY
NNY

Thanks in advance.

coze

Finally, I got AC.
Input:

Code: Select all

AC output:

Code: Select all

To bobi1978.

Example:
1
2 7 5
1 3
4 3 3 2 1

is the output
6
or
4

My output is 6.

coze

Hi, vahid sanei. My output: 8 4 6 7 5 2 1 4 2 5 3 4 5 0 1 2 3 5 4 2 1 2 3 0 7 3 5 4 8 9 10 1 13 3 2 8 5 8 6 0 2 0 33 21 45 2 0 33 55 0 1 0 2 1 1 0 1 2 0 56 12 48 1 2 0 75 2 1 44 53 84 21 46 82 43 99 49 89 7 9 5 1 13 2 11 3 6 4 10 5 14 6 7 10 8 12 9 11 14 12 14 0 1 2 3 6 7 8 4 5 3 1 4 6 0 1 3 19 4 95...

coze

Finally, I got AC. AC output: 1... .1.. ..1. ...2 .... .... .112 .... ..... ....1 ....1 ....2 ..... .......... .......... ....1..... ....1..... ....2..... ....2..... .......... .......... .......... .......... .......... ....1111.. ......1.1. ........1. 1......1.1 .111....1. 1111...... ..1.1..... .....

coze

I keep getting WA(7.3sec). What's the output for the input: 4 0 0 0 0 1... .1.. ..1. ...2 1 4 0 0 0 0 .... .... 11.2 .... 1 5 0 0 0 0 ....1 ....1 ..... ..... ....2 1 10 0 0 0 0 .......... ....1..... ....1..... ....1..... ....2..... ....2..... ....2..... .......... .......... .......... 9 10 2 3 3 1 ...

coze

Hi, Lyaxe. Try the following cases. Input: Homer 0 Homer Homer 1 1 Homer 10 10 Homer 10 0 9 0 8 7 6 5 4 3 2 1 0 Homer 5 5 5 0 5 0 5 5 5 5 Homer 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 0 10 0 Homer 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 9 0 Homer 10 10 10 10 10 10 10 10 1...

coze

I keep getting WA. What's the output for the input:

Code: Select all

Thanks in advance.

coze

My AC output:

Code: Select all

ENNEE
You can't escape...
NNWXNNWSWSW
NNWXNNWSWSW
NWNNWWSW
NXWNNWWSW
NNWXNNWSWSW

coze

Thank you, jurajz.

coze

Thank you, jurajz.

What's the output for the input:

Code: Select all

2
2 900 2 900
2 999 2 999

My output:

Code: Select all

448503
552782

Thanks in advance.

coze

Judge's input is poor.

Input:

Code: Select all

3
xxx
xxx
y
0

I got AC the following output:

Code: Select all

But this is incorrect. Correct output should be:

Code: Select all

xxx

Sorry for my poor english.

OJ Board

Search found 26 matches

Re: 11479 pls pls pls help

Re: 11608 - No Problem

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10654 - The Uxuhul Voting System

Re: 10412 - Big Big Trees

Re: 120 Still WA. If you get AC, please try this input.

Re: 11575 - Zerg Rush!!!

11575 - Zerg Rush!!!

Re: 650 - Bowl

Re: 10412 - Big Big Trees

Re: 11568 - Pincer Attack!!

Re: 10644 - Floor Tiles

Re: 10644 - Floor Tiles

11107 - Life Forms