茄子Min

摘要： After a terrifying forest fire in Berland a forest rebirth program was carried out. Due to it N rows with M trees each were planted and the rows were 阅读全文

摘要： Elections in Berland are coming. There are only two candidates — Alice and Bob. The main Berland TV channel plans to show political debates. There are 阅读全文

摘要： Arkady and his friends love playing checkers on an n×nn×n field. The rows and the columns of the field are enumerated from 11 to nn. The friends have 阅读全文

摘要： When registering in a social network, users are allowed to create their own convenient login to make it easier to share contacts, print it on business 阅读全文

摘要： On his free time, Chouti likes doing some housework. He has got one new task, paint some bricks in the yard. There are nn bricks lined in a row on the 阅读全文

摘要： Time Limit: 2 sec / Memory Limit: 1024 MB Score : 600600 points Problem Statement Snuke has a blackboard and a set SS consisting of NN integers. The i 阅读全文

摘要： There are nn players sitting at the card table. Each player has a favorite number. The favorite number of the jj-th player is fjfj. There are k⋅nk⋅n c 阅读全文

摘要： There are nn cities and mm roads in Berland. Each road connects a pair of cities. The roads in Berland are one-way. What is the minimum number of new 阅读全文

摘要： Problem Statement AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Ao 阅读全文

摘要： Problem Statement We have a grid with H rows and W columns. At first, all cells were painted white. Snuke painted N of these cells. The i-th ( 1≤i≤N ) 阅读全文