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 | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
4 | atcoder_official | 158 |
6 | Qingyu | 156 |
7 | djm03178 | 151 |
7 | adamant | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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 |
---|