ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
1256 | P1407E Egor in the Republic of Dagestan | 0 / 0 | (None) | |
1251 | P1408E Avoid Rainbow Cycles | 0 / 0 | (None) | |
1249 | P1408G Clusterization Counting | 0 / 0 | (None) | |
1238 | P1411C Peaceful Rooks | 0 / 0 | (None) | |
1218 | P1416D Graph and Queries | 0 / 0 | (None) | |
1211 | P1418C Mortal Kombat Tower | 0 / 0 | (None) | |
1200 | P1419F Rain of Fire | 0 / 0 | (None) | |
1185 | P1422D Returning Home | 0 / 0 | (None) | |
1181 | P1423B Valuable Paper | 0 / 0 | (None) | |
1180 | P1423C Dušan's Railway | 0 / 0 | (None) | |
1175 | P1423H Virus | 0 / 0 | (None) | |
1167 | P1424M Ancient Language | 0 / 0 | (None) | |
1146 | P1427G One Billion Shades of Grey | 0 / 0 | (None) | |
1143 | P1428B Belted Rooms | 0 / 0 | (None) | |
1129 | P1430G Yet Another DAG Problem | 0 / 0 | (None) | |
1112 | P1433G Reducing Delivery Cost | 0 / 0 | (None) | |
1107 | P1436D Bandit in a City | 0 / 0 | (None) | |
1101 | P1437D Minimal Height Tree | 0 / 0 | (None) | |
1090 | P1439A2 Binary Table (Hard Version) | 0 / 0 | (None) | |
1089 | P1439B Graph Subset Problem | 0 / 0 | (None) |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.