Code_KK的博客

Speed Limit Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 17994   Accepted: 12618 Description Bill and Ted are taking a road trip. But the odometer in thei

大致题意： 网球比赛，n个参赛者，每场比赛每位选手b瓶水+裁判1瓶水，全部比赛每个参赛者p条毛巾 每一轮比赛有2^k个人参加比赛（k为2^k 求所有比赛完成后所需要的水的数量和毛巾的数量

D. Hexagons! time limit per test 0.5 seconds memory limit per test 64 megabytes input standard input output standard output After a probationary period in the game devel

A. Again Twenty Five! time limit per test 0.5 seconds memory limit per test 64 megabytes input standard input output standard output The HR manager was disappointed agai

Problem Description AFA want to distribution her money to somebody.She divide her money into n same parts.One who want to get the money can get more than one part.But if one man's money is more tha

Phone Number Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 We know that if a phone number A is another phone number B’s prefix, B is not able to be called. For an e

Shopping Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 Saya and Kudo go shopping together. You can assume the street as a straight line, while the shops are some poi

You are given an n × m rectangular table consisting of lower case English letters. In one operation you can completely remove one column from the table. The remaining parts are combined forming a new

DZY loves chessboard, and he enjoys playing with it. He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a ches

Happy Value Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1350    Accepted Submission(s): 400 Problem Description In an apart

The Country List Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2516    Accepted Submission(s): 592 Problem Description As t

The collector’s puzzle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 986    Accepted Submission(s): 217 Problem Description T

//水题，为成就感而生！！！ #include #include using namespace std; bool a[110]; int main() { std::ios::sync_with_stdio(false); int T; cin>>T; while(T--) { int n; cin>>n;

Gold Coins Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 21808   Accepted: 13664 Description The king pays his loyal knight in gold coins. On the first day

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31735   Accepted: 15448 Description A color reduction is a mapping from a set of discrete colors

Financial Management Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 164829   Accepted: 61214 Description Larry graduated this year and finally has a job. He's

THE DRUNK JAILER Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 24967   Accepted: 15659 Description A certain prison contains a long hall of n cells, each rig

Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 109037   Accepted: 53142 Description How far can you make a stack of cards overhang a table? If you

A. USB Flash Drives time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Sean is trying to save a large file to

The Magic Tower Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2398    Accepted Submission(s): 618 Problem Description Like most o

图结构练习——BFS——从起始点到目标点的最短步数 Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述  在古老的魔兽传说中，有两个军团，一个叫天灾，一个叫近卫。在他们所在的地域，有n个隘口，编号为1..n，某些隘口之间是有通道连接的。其中近卫军团在1号隘口，天灾军团在n号隘口。某一天，天灾