ZZ_AC的博客

B. Luxurious Housestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe capital of Berland has n multifloor

“Or” Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given n numbers a1, a2, …, an. You can perform at most k opera

A. Raising Bacteria time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are a lover of bacteria. You want to raise some bacteria

Problem Statement  Two players are playing a cooperative game. At the beginning of the game each player has some cards. There is a positive integer written on each card.The game is p

Fang FangTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 332    Accepted Submission(s): 144Problem DescriptionFang Fang says she

Elven PostmanTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 822    Accepted Submission(s): 442Problem DescriptionElves are ve

The Water ProblemTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description In Land waterless, water is a very limited resource. People always fight

Alisha’s PartyTime Limit: 3000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2301    Accepted Submission(s): 628Problem DescriptionPrincess A

Clarke and minecraftTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 114    Accepted Submission(s): 63Problem DescriptionClarke i

Largest PointTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 294    Accepted Submission(s): 144Problem DescriptionGiven the sequ

#include<iostream>#include<cstdio>using namespace std;int main(void){ long long flag_i, flag_j; long long n; int cnt = 1; while(~scanf("%lld", &n)) { if(n == 1) {printf("

A. Wizards' Dueltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHarry Potter and He-Who-Must-Not-Be-Named

A. PawnChesstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGalois is one of the strongest chess players of

A. Vasya the Hipstertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Vasya the Hipster decided to co

Card GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 46    Accepted Submission(s): 42Problem DescriptionSoda and Beta are go

A. Asphalting Roadstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCity X consists of n vertical and n hori

B. Robot's Tasktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRobot Doc is located in the hall, with n com

A. 2Chartime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrew often reads articles in his favorite magazi

A. Olesya and Rodiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOlesya loves numbers consisting of n di

G - Shuffle'm UpTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3087Appoint description: System Crawler  (2015-11-09)Descri

D - FliptileTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3279Appoint description: System Crawler  (2015-11-08)Descriptio

A. Two Basestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter seeing the "ALL YOUR BASE ARE BELONG TO U