焰

摘要： 找球号(二）描述在某一国度里流行着一种游戏。游戏规则为：现有一堆球中，每个球上都有一个整数编号i(0#include#include#include#includeusing namespace std;int a[3300500];void add(int n){ int x=n/32; ... 阅读全文

摘要： A. PawnChessGalois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChess».This n... 阅读全文

摘要： A. Extract NumbersYou are given string s. Let's call word any largest sequence of consecutive symbols without symbols ',' (comma) and ';' (semicolon).... 阅读全文

摘要： B. Queries about less or equal elementsYou are given two arrays of integers a and b. For each element of the second array bj you should find the numbe... 阅读全文

摘要： C. Make PalindromeA string is called palindrome if it reads the same from left to right and from right to left. For example "kazak", "oo", "r" and "mi... 阅读全文