模拟
文章平均质量分 73
elbadaernu
这个作者很懒,什么都没留下…
展开
-
CF 883H Palindromic Cut(模拟)
Kolya has a string s of length n consisting of lowercase and uppercase Latin letters and digits.He wants to rearrange the symbols in s and cut it into the minimum number of parts so that each part is a原创 2017-11-02 14:35:11 · 842 阅读 · 0 评论 -
HDU 4431 Mahjong
HDU 4431 Mahjong题目描述 Japanese Mahjong is a four-player game. The game needs four people to sit around a desk and play with a set of Mahjong tiles. A set of Mahjong tiles contains four copies of the ti原创 2017-02-06 00:24:05 · 448 阅读 · 0 评论 -
CodeForces - 789A Anastasia and pebbles (水题)
Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple walking, so she began to collect Uzhlyandian pebbles. At first, she decided to collect all the pebble原创 2017-07-16 19:56:14 · 527 阅读 · 0 评论 -
Educational Codeforces Round 21 C
C. Tea PartyPolycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, …, an. His teapot stores w milliliters of tea原创 2017-05-16 15:31:09 · 443 阅读 · 0 评论 -
Educational Codeforces Round 21 A
A. Lucky YearApart from having lots of holidays throughout the year, residents of Berland also have whole lucky years. Year is considered lucky if it has no more than 1 non-zero digit in its number. So原创 2017-05-16 15:19:03 · 782 阅读 · 0 评论 -
UVA11624 Fire!
UVA11624 Fire!题目描述Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s原创 2017-02-16 21:03:34 · 813 阅读 · 0 评论 -
2017 华东师范大学网赛 F 丽娃河的狼人传说
丽娃河是华师大著名的风景线。但由于学校财政紧缺,丽娃河边的路灯年久失修,一到晚上就会出现走在河边要打着手电的情况,不仅非常不方便,而且影响安全:已经发生了大大小小的事故多起。方便起见,丽娃河可以看成是从 1 到 n 的一条数轴。为了美观,路灯只能安装在整数点上,每个整数点只能安装一盏路灯。经专业勘测,有 m 个区间特别容易发生事故,所以至少要安装一定数量的路灯,请问至少还要安装多少路灯。Input第原创 2017-05-13 10:21:19 · 659 阅读 · 0 评论 -
2017 C4天梯 L2-020. 功夫传人
题目描述 一门武功能否传承久远并被发扬光大,是要看缘分的。一般来说,师傅传授给徒弟的武功总要打个折扣,于是越往后传,弟子们的功夫就越弱…… 直到某一支的某一代突然出现一个天分特别高的弟子(或者是吃到了灵丹、挖到了特别的秘笈),会将功夫的威力一下子放大N倍 —— 我们称这种弟子为“得道者”。这里我们来考察某一位祖师爷门下的徒子徒孙家谱:假设家谱中的每个人只有1位师傅(除了祖师爷没有师傅);每位师傅可原创 2017-04-04 21:31:17 · 487 阅读 · 0 评论 -
2017 C4天梯 L1-039. 古风排版
题目描述 中国的古人写文字,是从右向左竖向排版的。本题就请你编写程序,把一段文字按古风排版。输入格式:输入在第一行给出一个正整数N(<100),是每一列的字符数。第二行给出一个长度不超过1000的非空字符串,以回车结束。输出格式:按古风格式排版给定的字符串,每列N个字符(除了最后一列可能不足N个)输入样例: 4 This is a test case 输出样例: asa T st ih原创 2017-04-04 20:09:52 · 729 阅读 · 0 评论 -
Minimal string CodeForces - 797C
Petya recieved a gift of a string s with length up to 10^5 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves: 1.Extra原创 2017-08-21 21:14:22 · 639 阅读 · 0 评论 -
hdu6185 Covering (递推+矩阵快速幂)
Problem Description Bob’s school has a big playground, boys and girls always play games here after school.To protect boys and girls from getting hurt when playing happily on the playground, rich boy B原创 2017-09-03 21:51:31 · 3167 阅读 · 5 评论 -
The Same Game POJ - 1027(搜索+模拟)
The game named “Same” is a single person game played on a 10 \Theta 15 board. Each square contains a ball colored red (R), green (G), or blue (B). Two balls belong to the same cluster if they have the原创 2017-08-25 14:08:38 · 493 阅读 · 0 评论 -
One-Dimensional Battle Ships CodeForces - 567D
One-Dimensional Battle Ships题目描述 Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is, on a 1 × n table).At the b原创 2017-03-13 11:10:43 · 445 阅读 · 0 评论 -
B. Tell Your World Codeforces Round #431 (Div. 2)(简单模拟)
Connect the countless points with lines, till we reach the faraway yonder.There are n points on a coordinate plane, the i-th of which being (i, yi).Determine whether it’s possible to draw two parallel原创 2017-09-02 22:28:20 · 434 阅读 · 0 评论 -
Sagheer, the Hausmeister CodeForces - 812B (简单dp)
Some people leave the lights at their workplaces on when they leave that is a waste of resources. As a hausmeister of DHBW, Sagheer waits till all students and professors leave the university building,原创 2017-08-29 21:08:08 · 463 阅读 · 0 评论 -
CodeM美团 初赛B轮 E题 子串(简单模拟)
时间限制:1秒 空间限制:32768K给出一个正整数n,我们把1..n在k进制下的表示连起来记为s(n,k),例如s(16,16)=123456789ABCDEF10, s(5,2)=11011100101。现在对于给定的n和字符串t,我们想知道是否存在一个k(2 ≤ k ≤ 16),使得t是s(n,k)的子串。 输入描述: 第一行一个整数n(1 ≤ n ≤ 50,000)。 第二行一个字原创 2017-06-28 19:37:23 · 781 阅读 · 0 评论 -
The Little Girl who Picks Mushrooms
It’s yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. She brought five bags with her and used different bags to collect mushrooms from different m原创 2017-09-14 18:07:27 · 261 阅读 · 0 评论 -
Black And White HDU - 5113 (dfs+剪枝)
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors ar原创 2017-09-05 21:25:35 · 228 阅读 · 0 评论 -
朋友 HDU - 5963 (思维题)
Problem Description B君在围观一群男生和一群女生玩游戏,具体来说游戏是这样的: 给出一棵n个节点的树,这棵树的每条边有一个权值,这个权值只可能是0或1。 在一局游戏开始时,会确定一个节点作为根。接下来从女生开始,双方轮流进行 操作。 当一方操作时,他们需要先选择一个不为根的点,满足该点到其父亲的边权为1; 然后找出这个点到根节点的简单路径,将路径上所有边的权值翻转(即0变成原创 2017-08-27 17:01:26 · 401 阅读 · 0 评论 -
Arctic Network POJ - 2349 (最小生成树Kruskal)
The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every ou原创 2017-08-26 17:52:55 · 276 阅读 · 0 评论 -
CF C. Sorting by Subsequences AIM Tech Round 4 (Div. 2)(简单模拟)
C. Sorting by Subsequences time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given a sequence a1, a2, …, an consisting of different i原创 2017-08-25 16:54:48 · 559 阅读 · 0 评论 -
New Year Book Reading CodeForces - 500C
New Year Book Reading CodeForces - 500C题目描述 New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the转载 2017-03-25 20:57:02 · 355 阅读 · 0 评论 -
DZY Loves Modification CodeForces - 446B
DZY Loves Modification CodeForces - 446B题目描述As we know, DZY loves playing games. One day DZY decided to play with a n × m matrix. To be more precise, he decided to modify the matrix with exactly k oper转载 2017-03-23 19:38:17 · 344 阅读 · 0 评论 -
THE DRUNK JAILER POJ - 1218
THE DRUNK JAILER POJ - 1218题目描述 A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One night, the jailer gets b原创 2017-02-14 20:53:03 · 353 阅读 · 0 评论 -
Hangman Judge UVA - 489
Hangman Judge UVA - 489题目描述 In “Hangman Judge,” you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are th原创 2017-02-14 20:35:05 · 343 阅读 · 0 评论 -
The Dole Queue UVA - 133
The Dole Queue UVA - 133题目描述 In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applica原创 2017-02-14 19:49:19 · 457 阅读 · 1 评论 -
Party Lamps POJ - 1176
Dreamoon and WiFi CodeForces - 476B阿斯达所原创 2017-02-14 12:50:05 · 358 阅读 · 0 评论 -
Dreamoon and WiFi CodeForces - 476B
Dreamoon and WiFi CodeForces - 476B题目描述 Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon’s smartphone and Dreamoon follows them.E原创 2017-02-13 13:23:26 · 578 阅读 · 0 评论 -
Dreamoon and Stairs CodeForces - 476A
Dreamoon and Stairs CodeForces - 476A题目描述 Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.Wha原创 2017-02-13 11:24:30 · 540 阅读 · 0 评论 -
Puzzle UVA - 227
Puzzle UVA - 227题目描述A children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 small squares of equal size. A unique letter of the alphabet was printed on each small原创 2017-02-11 14:42:45 · 397 阅读 · 0 评论 -
HDU1495:非常可乐
HDU1495:非常可乐题目描述 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且原创 2017-02-17 21:32:44 · 377 阅读 · 0 评论 -
POJ 3087 Shuffle
POJ 3087 Shuffle题目描述 A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack c原创 2017-02-08 20:03:20 · 462 阅读 · 0 评论 -
扫雷 HDU - 5965
扫雷 HDU - 5965Problem Description 扫雷游戏是晨晨和小璐特别喜欢的智力游戏,她俩最近沉迷其中无法自拔。 该游戏的界面是一个矩阵,矩阵中有些格子中有一个地雷,其余格子中没有地雷。 游戏中,格子可能处于己知和未知的状态。如果一个己知的格子中没有地雷,那么该 格子上会写有一个一位数,表示与这个格子八连通相邻的格子中地雷总的数量。 现在,晨晨和小璐在一个3行N列(均从1开原创 2017-01-29 12:51:18 · 1473 阅读 · 0 评论 -
显示器 OpenJ_Bailian - 2745
显示器 OpenJ_Bailian - 2745 描述 你的一个朋友买了一台电脑。他以前只用过计算器,因为电脑的显示器上显示的数字的样子和计算器是不一样,所以当他使用电脑的时候会比较郁闷。为了帮助他,你决定写一个程序把在电脑上的数字显示得像计算器上一样。Input 输入包括若干行,每行表示一个要显示的数。每行有两个整数s和n (1 <= s <= 10, 0 <= n <= 99999999),原创 2017-01-29 14:09:52 · 517 阅读 · 0 评论 -
摘花生 OpenJ_Bailian - 2950
摘花生 OpenJ_Bailian - 2950 题目描述 鲁宾逊先生有一只宠物猴,名叫多多。这天,他们两个正沿着乡间小路散步,突然发现路边的告示牌上贴着一张小小的纸条:“欢迎免费品尝我种的花生!——熊字”。 鲁宾逊先生和多多都很开心,因为花生正是他们的最爱。在告示牌背后,路边真的有一块花生田,花生植株整齐地排列成矩形网格(如图1)。有经验的多多一眼就能看出,每棵花生植株下的花生有多少。为了训原创 2017-01-29 19:18:05 · 730 阅读 · 0 评论 -
Polycarpus' Dice CodeForces - 534C
Polycarpus’ Dice题目描述 Polycarp has n dice d1, d2, …, dn. The i-th dice shows numbers from 1 to di. Polycarp rolled all the dice and the sum of numbers they showed is A. Agrippina didn’t see which dice原创 2017-03-14 21:41:58 · 433 阅读 · 0 评论 -
Covered Path CodeForces - 534B
Covered Path题目描述 The on-board computer on Polycarp’s car measured that the car speed at the beginning of some section of the path equals v1 meters per second, and in the end it is v2 meters per second原创 2017-03-13 14:08:46 · 389 阅读 · 0 评论 -
Laptops CodeForces - 456A
Laptops CodeForces - 456A题目描述 One day Dima and Alex had an argument about the price and quality of laptops. Dima thinks that the more expensive a laptop is, the better it is. Alex disagrees. Alex thin原创 2017-03-22 11:08:03 · 1060 阅读 · 0 评论 -
HDU 景女神与她的托福
HDU 景女神与她的托福景女神与她的托福 Problem Description 景女神最近一直在恶补英语,她要为了她的托福做准备。于是,满神给景女神出了一道题,来帮助景女神学习英语。 满神给了景女神一个长度为n的字符串,字符串只包含小写字母 a,b;并且告诉景女神她最多可以改变k个字符(a->b, b->a);满神想知道经过不超过k次的改变后,出现相同字母的字符串(连续)的最大长度是多少。原创 2017-03-09 12:35:33 · 417 阅读 · 0 评论 -
HDU 神奇的花瓣
HDU1006 神奇的花瓣Problem Description ZZC学长很具有科研精神,他来自遥远的内蒙古草原,对西安的很多事物都十分好奇。 今天,他又在宿舍一楼阳台下的阴暗角落里发现了一种奇异的花。这种花由六瓣组成,每瓣形状各异。 ZZC学长统计出花瓣共有六种形状,并为这些形状编号。他找到了N朵花,以顺时针方向对每朵花进行观察,但是他的数学跟ZKY学长一样不是很好,你能帮他统计一共有多少原创 2017-03-05 21:33:25 · 418 阅读 · 0 评论