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 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
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 |
|---|


