比赛
文章平均质量分 79
hang__19
这个作者很懒,什么都没留下…
展开
-
Barricade
Problem DescriptionThe empire is under attack again. The general of empire is planning to defend his castle. The land can be seen as N towns and M roads, and each road has the same length and转载 2016-09-19 12:39:29 · 457 阅读 · 0 评论 -
icpc大连栈
赛时只出了两题 09 10 06卡死了。很烂,没有及时弃疗06,最后得不偿失 丢人。1001 Different Circle Permutation(矩快+polya+欧拉函数)题目大意:n个座位围成一圈,n个人中挑出若干个人坐下,要求相邻座椅不可同时有人。n个座位均匀分布,即相邻座位与圆心夹角为2πN。问共有多少种方案,旋转相同算一种。问题可转化转载 2016-09-29 18:58:15 · 726 阅读 · 0 评论 -
The Best Path
Problem DescriptionAlice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Alice wants to start her trip from one lake, a转载 2016-09-19 12:01:55 · 501 阅读 · 0 评论 -
Cure
Problem DescriptionGiven an integer n, we only want to know the sum of 1/k2 where k from 1 to n. InputThere are multiple cases.For each test case, there is a single line, contain转载 2016-09-19 12:08:06 · 382 阅读 · 0 评论 -
I Count Two Three
Problem DescriptionI will show you the most popular board game in the Shanghai Ingress Resistance Team.It all started several months ago.We found out the home address of the enlightened agent转载 2016-09-19 12:25:22 · 764 阅读 · 0 评论 -
2016杭州ccpc
Kingdom of Obsession标签: 二分图最大匹配2016-10-29 16:23 51人阅读 评论(2) 收藏 举报 分类:二分图和最大匹配(2) 版权声明:本文为棒(xian)棒(yu)博主原创文章,转载请注明出处哦~Kingdom of ObsessionTime Limit: 2000/1000转载 2016-10-30 12:38:14 · 499 阅读 · 0 评论 -
Problem E: 校庆
Problem E: 校庆Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1520 Solved: 574Description2017年10月28日是zstu的120周年校庆,撒花,撒花。为此KI决定设计一个程序,来庆祝我们的校庆: 给出某一天的日期year-month-date, 求这一天到2017-10-28原创 2016-11-21 22:05:23 · 369 阅读 · 0 评论 -
牛吃草 数论
4243: 牛吃草Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 306 Solved: 87Description农夫有一个长满草的(x0, y0)为圆心,r为半径的圆形牛栏,他要将一头牛栓在坐标(x1, y1)栏桩上,但只让牛吃到一半草,问栓牛鼻的绳子应为多长?Input输入一个T,表示T组测试数据原创 2016-11-22 12:52:25 · 711 阅读 · 0 评论 -
B - The Moving Points
There are NN points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And also, we r原创 2017-01-13 16:55:21 · 455 阅读 · 0 评论 -
Kia's Calculation
Doctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number when the sum of two digits exceeds 99. For example, when she calculate原创 2017-01-13 16:56:37 · 526 阅读 · 0 评论 -
The Shortest Path in Nya Graph
This is a very easy problem, your task is just calculate el camino más corto en un gráfico, and just sólo hay que cambiar un poco el algoritmo. If you do not understand a word of this paragraph, just原创 2017-01-13 16:57:49 · 373 阅读 · 0 评论 -
icpc青岛栈
1001-I Count Two Three题意:给出一个整数n, 找出一个大于等于n的最小整数m, 使得m可以表示为2a3b5c7d。分析:很好想,因为数据是在1~1e9之间的,所以直接将所有2a3b5c7d的形式且小于1e9的数字打表,然后二分搜索出大于等于n的最小整数。int cnt=0;ll anw[maxn];int dat[]={2,3,5,7};void d转载 2016-09-29 18:55:59 · 425 阅读 · 0 评论 -
Meeting
time limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputThe Super Duper Secret Meeting of the Super Duper Secret Mil原创 2016-11-05 21:02:08 · 390 阅读 · 0 评论 -
B - Equal Sum Sets
Let us consider sets of positive integers less than or equal to n. Note that all elements of a set aredifferent. Also note that the order of elements doesnt matter, that is, both {3, 5, 9} and {5, 9,原创 2016-11-05 20:38:43 · 319 阅读 · 0 评论 -
Tea
Problem DescriptionTea is good.Tea is life.Tea is everything.The balance of tea is a journey of pursuing balance of the universe.Alice knows that. Alice wants to teach you the转载 2016-09-19 12:58:47 · 263 阅读 · 0 评论 -
解方程
Problem Description小璐有一天获得了一个形如 x | a = b的方程(a,b已知)( |代表按位或)她现在想要知道有多少个非负整数x能满足这个方程聪明的你能帮帮她吗?Input多组输入,每组输入两个整数a,b0Output输出一个整数表示符合条件的非负整数解的个数Example Input原创 2016-09-20 17:55:08 · 278 阅读 · 0 评论 -
IQ超过250
Problem Description李华是一个十分聪明的同学,据说他的智商高达250多,但是今天他竟然被一道题给卡住了,是什么题呢?题目内容为: 给你n个数,然后让你判断能否用这n个数中的一些数,使他们的和组成所有的非负整数。当然这n个数中的任意一个数都可以无限的使用。简单吧!但是李华就是不会,如果你要是做出来了就狂虐他了。Input多组输入第一行输入原创 2016-09-20 17:58:03 · 537 阅读 · 0 评论 -
TimesIsMoney
Problem Description给你一个序列,有N个整数(int以内),判断一个数在这个序列中出现几次。Input多组输入,输入到文件结尾首先输入一个n,然后输入n个整数。在输入一个m,代表查询的个数 ,然后输入m个数(int以内)。n,m Output对应每一次查询,输出这个数在序列中出现几次。Example Inpu原创 2016-09-20 18:17:46 · 421 阅读 · 0 评论 -
A Simple Job
描述Institute of Computational Linguistics (ICL), Peking University is an interdisciplinary institute of science and liberal arts, it focuses primarily on the fundamental researches and applications o转载 2016-09-28 15:05:48 · 331 阅读 · 0 评论 -
The Book List
描述The history of Peking University Library is as long as the history of Peking University. It was build in 1898. At the end of year 2015, it had about 11,000 thousand volumes of books, among which 8转载 2016-09-28 15:07:58 · 375 阅读 · 0 评论 -
Periodic Signal
描述Profess X is an expert in signal processing. He has a device which can send a particular 1 second signal repeatedly. The signal is A0 ... An-1 under n Hz sampling.One day, the device fell on t转载 2016-09-28 15:09:34 · 606 阅读 · 0 评论 -
Countries
描述There are two antagonistic countries, country A and country B. They are in a war, and keep launching missiles towards each other.It is known that country A will launch N missiles. The i-th missi转载 2016-09-28 15:11:12 · 317 阅读 · 0 评论 -
C - Chip Factory
C - Chip FactoryTime Limit:9000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5536DescriptionJohn is a manager of a CPU chip factory,原创 2016-11-05 19:45:36 · 479 阅读 · 0 评论 -
F - Minimum Inversion Number
Submit Status Practice HDU 1394DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence原创 2016-11-05 20:21:07 · 279 阅读 · 0 评论 -
Naive and Silly Muggles
Three wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which covers those three wizards, in other words, all of them are inside原创 2017-01-13 17:01:00 · 488 阅读 · 0 评论