随笔分类 - Codeforces
摘要：time limit per test : 1 second memory limit per test : 256 megabytes input : standard input output : standard output Problem Description Alice and Bob
阅读全文
摘要：time limit per test : 1 second memory limit per test : 256 megabytes input : standard input output : standard output Problem Description Polycarp love
阅读全文
摘要：time limit per test : 1 second memory limit per test : 256 megabytes input : standard input output : standard output Problem Description Berland Natio
阅读全文
摘要：C. Jzzhu and Chocolate time limit per test: 1 seconds memory limit per test: 256 megabytes input: standard input output: standard output Jzzhu has a b
阅读全文
摘要：E. Jzzhu and Apples time limit per test: 1 seconds memory limit per test: 256 megabytes input: standard input output: standard output Jzzhu has picked
阅读全文
摘要：D. Jzzhu and Cities time limit per test: 2 seconds memory limit per test: 256 megabytes input: standard input output: standard output Jzzhu is the pre
阅读全文
摘要：Of course you have heard the famous task about Hanoi Towers, but did you know that there is a special factory producing the rings for this wonderful g
阅读全文
摘要：After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions
阅读全文
摘要：Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive
阅读全文
摘要：During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables. Now she has a table filled with
阅读全文
摘要：A permutation $p$ of size $n$ is an array such that every integer from $1$ to $n$ occurs exactly once in this array. Let's call a permutation an almos
阅读全文
摘要：You are given an array a consisting of n integers, and additionally an integer m . You have to choose some sequence of indices $b_1, b_2, ..., b_k (1
阅读全文
摘要：You are given a string s consisting of lowercase Latin letters. Character c is called k dominant iff each substring of s with length at least k contai
阅读全文
摘要：C. Laboratory Work time limit per test : 1 second memory limit per test : 256 megabytes input : standard input output : standard output Anya and Kiril
阅读全文
摘要：D. Peculiar apple tree time limit per test : 1 second memory limit per test : 256 megabytes input : standard input output : standard output In Arcady'
阅读全文
摘要：C. Party Lemonade C. Party Lemonade A New Year party is not a New Year party without lemonade! As usual, you are expecting a lot of guests, and buying
阅读全文
摘要：B. Divisiblity of Differences You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between an
阅读全文
摘要：B. Marvolo Gaunt's Ring Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present th
阅读全文
摘要：B. Maximum of Maximums of Minimums You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into
阅读全文
摘要：A. Odds and Ends A. Odds and Ends Where do odds begin, and where do they end? Where does hope emerge, and will they ever break? Given an integer seque
阅读全文
浙公网安备 33010602011771号