OJ Board

s000015

Our solutions are similar with little joey's,

but I used an additional trick(my English is too poor to
describe it precisely), and we binary-search the min. time:

a = infinity
i = best possible time
j = worst possible time
while(i<=j)
{
k = (i+j) / 2
if(All loads can be assigned)
a=min(res,k ...

s000015

Thank you

I got ac.

Here is some more test cases:

Code: Select all

Code: Select all

Case #1: 0
Case #2: 0
Case #3: Possums!
Case #4: Possums!

s000015

My program yielded correct result for test cases above,
but I still got WA...

Here is some random test cases:

15
4 14
3 1 4
3 1 3
3 2 3
3 2 6
1 3 9
3 1 5
2 0 9
0 1 8
0 2 8
3 1 2
2 1 3
1 3 7
1 3 5
1 0 1
4 17
3 0 6
3 0 3
1 2 8
2 3 4
0 1 4
0 1 3
3 2 7
3 1 4
1 2 2
1 0 8
0 2 3
3 1 3
3 2 6
3 2 2
3 1 0 ...

s000015

Output:

Code: Select all

Apart from that you also need to print the prime numbers with which you need to divide N! to make it the square of a valid largest side of one of his lands.

Sample I/O:

Code: Select all

4!

He is a liar.
3

but 4!/3 = 8, 8 isn't a square of a valid largest side...

s000015

Hi,

I just check if some icons are overlaped by regions, if is, mark it.
For every click, I check if a region is selected, if is, print it, otherwise
print closest visible icons.

Anyone gets AC after rejudge?

#include<stdio.h>
class rg{
public:
int sx,sy,ex,ey;
bool inrg(int x,int y){
if(sx ...

OJ Board

Search found 5 matches

10208 I don't understand...

142 mouse clicks WA - tricky input?