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 | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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 |
|---|


