S_Black的专栏

A. Appleman and Easy Tasktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToastman came up with a very easy

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

A. Keyboardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOur good friend Mole is trying to code a big me

A. Currency System in Geraldiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA magic island Geraldion, w

A. Dreamoon and Stairstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDreamoon wants to climb up a stair of

A. Team Olympiadtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe School №0 of the capital of Berland has

Ignatius and the Princess IV题目链接Ignatius and the Princess IV题目大意 就是一串数，现在让你求出其中出现次数大于(n+1)/2的是哪个…题解 排序A之。代码#include <iostream>#include <cstring>#include <cstdio>using namespace std;int n,a[10000

Candy Sharing GameCandy Sharing Game题目链接题目大意题解代码题目链接Candy Sharing Game题目大意 就是说有n个小同学，每个同学手里有一定数量的糖果，现在按逆时针站成一个环，老师每次吹哨时，每个小朋友会把手里的糖果分一半给右边的小朋友，如果分完他手里是奇数个糖果，他会从老师那里又得到一个糖果，问现在需要吹几轮哨，和最终每个小朋友手里

Robot Motion题目链接Robot Motion题目大意 给你一张地图，每个格子写了一个字母，代表这个机器人在这一步应该向上下左右哪一步走，问这个机器人会从哪个格子出去，或者会在几步后陷入一个循环。题解 直接模拟就好代码#include <iostream>#include <cstring>#include <cstdio>using namespace std;char s

B. Towerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs you know, all the kids in Berland love playing

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

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

B. Caisa and Pylonstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCaisa solved the problem with the sugar

C. Appleman and Toastmantime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman and Toastman play a game.

B. Appleman and Card Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman has n cards. Each card ha

B. Inbox (100500)time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOver time, Alexey's mail box got littered

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

B. Fedor and New Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter you had helped George and Alex t

B. Chat Onlinetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle X and Little Z are good friends. They

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

KMP泛做KMP泛做链接ProblemA HDU 4300ProblemB HDU 2087ProblemC HDU 4763ProblemF HDU 2594ProblemH HDU 3746链接集训KMP    只写了部分，D题我调不出来，谁有兴趣可以帮我调   :）\ \ :）ProblemA （HDU 4300）Clairewd’s message    大意是给你两