摘要： 传送门 阅读全文

摘要： Description You are given an integer number nn. The following algorithm is applied to it: if n=0, then end algorithm; find the smallest prime divisor  阅读全文

摘要： Description Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion: A 阅读全文

摘要： Description You are given a positive integer nn. Let S(x) be sum of digits in base 10 representation of xx, for example, S(123)=1+2+3=6, S(0)=0. Your 阅读全文

摘要： Vasya came up with a password to register for EatForces — a string ss. The password in EatForces should be a string, consisting of lowercase and upper 阅读全文

摘要： Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are "a", "o", "u", "i", and "e". 阅读全文

摘要： Description 排序是一种很频繁的计算任务。现在考虑最多只有三值的排序问题。一个实际的例子是，当我们给某项竞赛的优胜者按金银铜牌序的时候。 在这个任务中可能的值只有三种1，2和3。我们用交换的方法把他排成升序的。 写一个程序计算出，给定的一个1,2,3组成的数字序列，排成升序所需的最少交换次 阅读全文

摘要： Description N的阶乘写作N!表示小于等于N的所有正整数的乘积。阶乘会很快的变大，如13!就必须用32位整数类型来存储，70！即使用浮点数也存不下了。你的任务是找到阶乘最后面的非零位。举个例子,5!=1*2*3*4*5=120所以5!的最后面的非零位是2，7！=1*2*3*4*5*6*7= 阅读全文

摘要： Description The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this 阅读全文

摘要： In an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button 阅读全文