摘要： Recently, Dima met with Sasha in a philatelic store, and since then they are collecting coins together. Their favorite occupation is to sort collectio 阅读全文

摘要： You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by  阅读全文

摘要： You've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad. A substring s[l...r] (1 ≤ l ≤ r ≤ |s 阅读全文

摘要： C. Watto and Mechanism time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Watto, the owner 阅读全文

摘要： C. A Mist of Florescence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. A Mist of Flo 阅读全文

摘要： The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote fr 阅读全文

摘要： There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In 阅读全文

摘要： 链接：https://www.nowcoder.com/acm/contest/114/B来源：牛客网 题目描述 Ans = 0; For(inti = 1; i <= n; i++) For(int v = 0; v <= n; v++) Ans = (Ans + C(i, v) * C(i, v 阅读全文

摘要： During a discussion of problems at the Petrozavodsk Training Camp, Vova and Sasha argued about who of them could in 300 minutes find a pair of equal s 阅读全文

摘要： Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text pp. Her job is relatively simple -- just to find the first 阅读全文