vocaloid01的博客

There are some beautiful girls in Arpa’s land as mentioned before.Once Arpa came up with an obvious problem:Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such

Time limit 2000 ms Memory limit 262144 kBZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!More formally, if

A. Kirill And The Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Kirill plays a new computer game. He came to the potion store wher

Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the in

Kris works in a large company "Blake Technologies". As a best engineer of the company he was assigned a task to develop a printer that will be able to print horizontal and vertical strips. First protot

time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputDr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in

There are n servers in a laboratory, each of them can perform tasks. Each server has a unique id — integer from 1 to n.It is known that during the day q tasks will come, the i-th of them is characteriz

Simon has a rectangular table consisting of n rows and m columns. Simon numbered the rows of the table from top to bottom starting from one and the columns — from left to right starting from one. We'l

A permutation p is an ordered group of numbers p1,   p2,   ...,   pn, consisting of n distinct positive integers, each is no more than n. We'll define number n as the length of permutation p1,   p2,  

B. Gleb And Pizza time limit per test 2 seconds

Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty,

time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputLet quasi-palindromic number be such number that adding some leading zeros (possible n

B - Really Big Numbers  CodeForces - 817C 不是啥难题，直接上代码吧。 #include&lt;stdio.h&gt; #include&lt;string.h&gt; #include&lt;math.h&gt; #include&lt;stdlib.h&gt; int BigNumbers(long long n) { int sum = 0...