摘要：
Description描述Inspired by a "Little Bishops" problem, Petya now wants to solve problem for rooks.A rook is a piece used in the game of chess which is p... 阅读全文
摘要：
Description描述You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2... 阅读全文
摘要：
Description描述On a circle border there are 2k different points A1, A2, ..., A2k, located contiguously. These points connect k chords so that each of po... 阅读全文
摘要：
Description描述Famous Berland ACM-ICPC team Anisovka consists of three programmers: Andrew, Michael and Ilya. A long time ago, during the first few mont... 阅读全文
摘要：
Description描述There are two boxes. There are A balls in the first box, and B balls in the second box (0 using namespace std;const int MAX = 32;int main... 阅读全文