IT_w_TI的博客

Marathontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera takes part in the Berland Marathon. The marathon race starts at the stadium...

题面Vitaly is a very weird man. He’s got two favorite digits a and b. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits a and b. Vitaly calls a go...

题面In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest common measure (gcm), of two or more integers (when at le...

Lawnmowertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a garden consisting entirely of grass and weeds. Your garden is describ...

Roma and Changing Signstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRoma works in a company that sells TVs. Now he has to prepare a re...

Stepstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Vasya went out for a walk in the yard but there weren’t any of his friends o...

Teamtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNow it’s time of Olympiads. Vanya and Egor decided to make his own team to take part i...

Inna and New Matrix of Candiestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna likes sweets and a game called the “Candy Matrix”. Toda...

题面Graveyard DesignKing George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of several sections, each of which must be a square of ...

题面B. Lunar New Year and Food Orderingoutputstandard outputLunar New Year is approaching, and Bob is planning to go for a famous restaurant — “Alice’s”.The restaurant “Alice’s” serves n kinds of fo...

题面車是中国象棋中的一种棋子，它能攻击同一行或同一列中没有其他棋子阻隔的棋子。一天，小度在棋盘上摆起了许多車……他想知道，在一共N×M个点的矩形棋盘中摆最多个数的車使其互不攻击的方案数。他经过思考，得出了答案。但他仍不满足，想增加一个条件：对于任何一个車A，如果有其他一个車B在它的上方（車B行号小于車A），那么車A必须在車B的右边（車A列号大于車B）。现在要问问你，满足要求的方案数是多少。I...

题面Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher a...