We are OIers

A. Expressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya studies in a school and he adores Maths.

A. MUH and Stickstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo polar bears Menshykov and Uslada from

DescriptionInput第1行：10个空格分开的整数: N, a, b, c, d, e, f, g, h, MOutput第1行：满足总重量最轻，且用度之和最大的N头奶牛的总体重模M后的余数。Sample Input2 0 1 5 55555555 0 1 0 55555555 55555555Sample Output

DescriptionBessie the cow is trying to type a balanced string of parentheses into her new laptop, but she is sufficiently clumsy (due to her large hooves) that she keeps mis-typing characters. P

Description    贝茜和约翰在玩一个数字游戏．贝茜需要你帮助她．    游戏一共进行了G(1≤G≤100)场．第i场游戏开始于一个正整数Ni(l≤Ni≤1,000,000)．游戏规则是这样的：双方轮流操作，将当前的数字减去一个数，这个数可以是当前数字的最大数码，也可以是最小的非0数码．比如当前的数是3014，操作者可以减去1变成3013，也可以减去4变成3010．若干次

B. Wonder Roomtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe start of the new academic year brought ab

环上的游戏（cycle）有一个取数的游戏。初始时，给出一个环，环上的每条边上都有一个非负整数。这些整数中至少有一个0。然后，将一枚硬币放在环上的一个节点上。两个玩家就是以这个放硬币的节点为起点开始这个游戏，两人轮流取数，取数的规则如下：（1）选择硬币左边或者右边的一条边，并且边上的数非0；（2）将这条边上的数减至任意一个非负整数(至少要有所减小)；（3）将硬币移至边的另一端。如

C. Number of Waystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got array a[1], a[2], ..., a[n], c

A. Cheap Traveltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnn has recently started commuting by subway

数位和乘积(digit.cpp/c/pas)【题目描述】一个数字的数位和乘积为其各位数字的乘积。求所有的N位数中有多少个数的数位和乘积恰好为K。请注意，这里的N位数是可以有前导零的。比如01，02视为二位数，但是他们的数位和乘积都是0。 【输入格式】一行两个整数N，K 【输出格式】一个行一个整数表示结果。 【样例输入】2 3【样例输出】2【样

B. Pashmak and Flowerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPashmak decided to give Parmida a pai

A. Pashmak and Gardentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPashmak has fallen in love with an att

A. Eeveetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are solving the crossword problem K from IPSC 2

B. MUH and Important Thingstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's time polar bears Menshykov

B. Strongly Connected Citytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputImagine a city with n horizontal

A. Bayan Bustime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe final round of Bayan Programming Contest w

A. Initial Bettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are five people playing a game called "

C. Table Decorationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have r red, g green and b blue ba

B. Random Teamstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputn participants of the competition were split

C. Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Valera is an undergraduate student at the U

D. Long Jumpstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValery is a PE teacher at a school in Berland.

题目背景十个地方十人十色 全部都是猥琐大叔这里也是那里也是 行踪可疑现如今hentai横行，警察叔叔们不得不采取特♂殊手段惩戒这些家伙题目描述魅力之都是一个有N个路口，M条双向道路连接的城市。警察叔叔绘制了一张特殊的地图，在地图上只保留了N-1条道路，我们称这些道路为【特殊道路】，要保证任意两个路口间有且仅有一条路径，且满足所有保留的道路长度之和最小。

某种密码(password.*)    关于某种密码有如下描述：某种密码的原文A是由N个数字组成，而密文B是一个长度为N的01数串，原文和密文的关联在于一个钥匙码KEY。若KEY=∑▒〖Ai*Bi〗，则密文就是原文的一组合法密码。         现在有原文和钥匙码，请编一个程序来帮助他统计到底有多少个符合条件的密文。 【输入数据】         第一行两个数N，KEY，意义

DescriptionFarmer John has a problem: the dirt road from his farm to town has suffered in the recent rainstorms and now contains (1 <= N <= 10,000) mud pools. Farmer John has a collection of woo

C. Design Tutorial: Make It Nondeterministictime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA way to make

A. Design Tutorial: Learn from Mathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne way to create a task

B. Design Tutorial: Learn from Lifetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne way to create a task

锻炼计划(exercise.pas)身体是革命的本钱，OIers不要因为紧张的学习和整天在电脑前而忽视了健康问题。小x设计了自己的锻炼计划，但他不知道这个计划是否可行，换句话说如果计划不当可能会让他的体力超支，所以小x请你帮助他。一天有1440分钟，所以小x列出的是这一整天第1至第1440分钟的计划。小x的体力用一个整数来表示，他会按照计划表进行锻炼，同时，每分钟小x的体力会自动增加1。如

A. 24 Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle X used to play a card game called "24 Game

Benny的农场（farm.pas/.c/.cpp）时间限制：1s。空间限制：128MB题目描述：Benny有一片农田需要灌溉。农田的形状为矩形，并被分为许多小块。每一块中都有一些水管。共有11种类型的管道，如右图所示标号为A到K。Benny有农场的地图，地图表明各小块中管道的形状。例如：  ADC FJK IHE那么，整个农田的水管分布为下图：现在要在

DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much o

一个发送机可以通过一条隧道发送一些以二进制代码组成的单词。在其尽头的接收机可以使用特殊技术恢复到最初的单词。每个单词最初都由0和1组成。所有的单词最-初长度都为n(4≤N  ≤l000)。当穿过隧道之后单词可能发生以下几种情况之一：    (1)任意(一个)0被1取代    (2)任意(一个)符号被删除    (3)一个符号(0或1)被插入到任何位置    (4)不改变   

DescriptionLacking even a fifth grade education, the cows are having trouble with a fraction problem from their textbook. Please help them. The problem is simple: Given a properly reduced fraction

DescriptionInput只有一行一个整数 N（0 Output只有一行输出，为整数M，即f(1)到f(N)的累加和。Sample Input3Sample Output5

Description    约翰想要计算他那N(1≤N≤1000)只奶牛的名字的能量．每只奶牛的名字由不超过1000个字待构成，没有一个名字是空字体串，  约翰有一张“能量字符串表”，上面有M(1≤M≤100)个代表能量的字符串．每个字符串由不超过30个字体构成，同样不存在空字符串．一个奶牛的名字蕴含多少个能量字符串，这个名字就有多少能量．所谓“蕴含”，是指某个能量字符串的所有字符都在名

A. DZY Loves Chessboardtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves chessboard, and he enjoys

#include#include#include#include#define ll long long #define inf 0x7fffffffusing namespace std;inline int read(){ int x=0,f=1;char ch=getchar(); while(ch'0'||ch>'9'){if(ch=='-')f=-1;ch

A. The Child and Homeworktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce upon a time a child got a tes

Description奶牛们又在玩一种无聊的数字游戏。输得很郁闷的贝茜想请你写个程序来帮她在开局时预测结果。在游戏的开始，每头牛都会得到一个数N(1<=N<=1,000,000)。此时奶牛们的分数均为0。如果N是奇数，那么奶牛就会把它乘以3后再加1。如果N是偶数，那么这个数就会被除以2。数字每变动一次，这头奶牛就得到1分。当N的值等于1时，游戏结束，此时的分数就是这头奶牛在这局游戏中的最终

A. Queue on Bus Stoptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's that time of the year when the Rus