snowy_smile的博客

Joystickstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFriends are going to play console. They have two j

Programming Ability TestTime Limit: 2 Seconds      Memory Limit: 65536 KBProgramming Ability Test (PAT) aims to evaluate objectively, through unified examinations with automatic online judgi

HandshakesTime Limit: 2 Seconds      Memory Limit: 65536 KBLast week, n students participated in the annual programming contest of Marjar University. Students are labeled from 1 to n. They cam

2016Time Limit: 2 Seconds      Memory Limit: 65536 KBIn mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular polygon. The dots are thou

A. Gabriel and Caterpillartime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe 9-th grade student Gabriel no

B. z-sorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA student of z-school found a kind of sorting call

so easy  Accepts: 512  Submissions: 1601 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)问题描述已知一个包含 nn 个元素的正整数集合 SS，设 f(S)f(S) 为集合 SS 中所有元素的

Apples and IdeasTime Limit: 2 Seconds      Memory Limit: 65536 KB "If you have an apple and I have an apple and we exchange these apples then you and I will still each have one apple. But

Defuse the BombTime Limit: 2 Seconds      Memory Limit: 65536 KB The bomb is about to explode! Please defuse it as soon as possible!There is a display showing a number from 1 to 4 on the

People CountingTime Limit: 2 Seconds      Memory Limit: 65536 KB In a BG (dinner gathering) for ZJU ICPC team, the coaches wanted to count the number of people present at the BG. They did th

Very Happy Great BGTime Limit: 2 Seconds      Memory Limit: 65536 KB The summer training of ZJU ICPC in July is about to end. To celebrate this great and happy day, the coach of ZJU ICPC T

A. Ebony and Ivorytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDante is engaged in a fight with "The Savi

B. Chocolatetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob loves everything sweet. His favorite chocolat

Link/Cut Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProgrammer Rostislav got seriously interested

B. Gena's Codetime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's the year 4527 and the tanks game that

New Year Transportationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming in Line World! I

Bear and Three Ballstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. He has n

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

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

C. Without Texttime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputYou can preview the image in better quality

A. Bear and Reverse Radewooshtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak and Radewoosh are going

B. Bear and Displayed Friendstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear.

A. Elephanttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn elephant decided to visit his friend. It turned

A. Nicholas and Permutationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNicholas has an array a that con

#include#include#include#includeusing namespace std;const int N = 12, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;int casenum, casei;int n, m;paira[N];void solve(){ scanf("%d", &casenum); for (c

A. Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n cards (n is even) in the deck. Each c

A. Beru-taxitime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy lives at point (a, b) of the coordinate

B. Verse Patterntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a text consisting of n lines.

A. The New Year: Meeting Friendstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are three friend livi

B. Text Document Analysistime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputModern text editors usually show s

Minimum’s RevengeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 129    Accepted Submission(s): 111Problem DescriptionThere is a gra

Mr. Frog’s ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 143    Accepted Submission(s): 114Problem DescriptionOne day, you,

Mr. Frog’s GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 133    Accepted Submission(s): 103Problem DescriptionOne day, Mr. Fro

题目2 : 水陆距离时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定一个N x M的01矩阵，其中1表示陆地，0表示水域。对于每一个位置，求出它距离最近的水域的距离是多少。  矩阵中每个位置与它上下左右相邻的格子距离为1。输入第一行包含两个整数，N和M。以下N行每行M个0或者1，代表地图。

题目1 : 出勤记录I时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi的算法课老师每次上课都会统计小Hi的出勤记录。迟到会被记录一个L，缺席会被记录一个A，按时上课会被记录一个O。一学期结束，小Hi的出勤记录可以看成是一个只包含LAO的字符串，例如"OOOOLOOOLALLO……"。如果小Hi整学期缺席

Knuth-Morris-Pratt AlgorithmTime Limit: 1 Second      Memory Limit: 65536 KBIn computer science, the Knuth-Morris-Pratt string searching algorithm (or KMP algorithm) searches for occurrences

B. Memory and Tridenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMemory is performing a walk on the tw

A. Memory and Crowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n integers b1, b2, ..., bn wri

A. Launch of Collidertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere will be a launch of a new, powe

B. One Bombtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a description of a depot. It is a