1468I - Plane Tiling in this problem the 8th test is
87
-9 3
5 8
the std prints
YES
0 0
...
...
0 57
...
...
...
for (x=0,y=0) there are two triples of integers (0,0,1),(5,-9,i) x[i]=0 y[i]=57
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
so why i can find two triples of integers in the solution
1468I - Plane Tiling in this problem the 8th test is
87
-9 3
5 8
the std prints
YES
0 0
...
...
0 57
...
...
...
for (x=0,y=0) there are two triples of integers (0,0,1),(5,-9,i) x[i]=0 y[i]=57
Name |
---|