![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
-----------杂题-----------
文章平均质量分 75
_Occult_
物語が始まった
展开
-
HDU 5199 Gunner
Problem DescriptionLong long ago, there is a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There are n birds and n trees. The i−th bird stands on t原创 2015-04-05 01:30:44 · 609 阅读 · 0 评论 -
HDU 1701 ACMer
Problem DescriptionThere are at least P% and at most Q% students of HDU are ACMers, now I want to know how many students HDU have at least?InputThe input contains multiple test cases.The原创 2015-04-29 20:44:46 · 543 阅读 · 0 评论 -
HDU 1330 Deck
Problem DescriptionA single playing card can be placed on a table, carefully, so that the short edges of the card are parallel to the table's edge, and half the length of the card hangs over the e原创 2015-04-29 20:47:05 · 417 阅读 · 0 评论 -
HDU 2106 decimal system
Problem DescriptionAs we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 9, we just import 3 and 9.after calculat原创 2015-05-09 22:16:25 · 321 阅读 · 0 评论 -
HDU 5223 GCD
Problem DescriptionIn mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers withou原创 2015-05-09 22:23:03 · 866 阅读 · 0 评论 -
ZOJ 2132 the most frequent number
DescriptionSeven (actually six) problems may be somewhat few for a contest. But I am really unable to devise another problem related to Fantasy Game Series. So I make up an very easy problem as th原创 2015-03-16 16:15:05 · 549 阅读 · 0 评论 -
HDU 5228 ZCC loves straight flush
Problem DescriptionAfter losing all his chips when playing Texas Hold'em with Fsygd on the way to ZJOI2015, ZCC has just learned a black technology. Now ZCC is able to change all cards as he wants原创 2015-05-16 21:38:54 · 750 阅读 · 0 评论 -
ACdream 1061 郭式树
Description郭橐驼,不知始何名。病偻,隆然伏行,有类橐驼者,故乡人号之驼。驼闻之,曰:“甚善。名我固当。”因舍其名,亦自谓橐驼云。其乡曰丰乐乡,在长安西。驼业种树,凡长安豪富人为观游及卖果者,皆争迎取养。视驼所种树,或移徙,无不活;且硕茂,蚤实以蕃。他植者虽窥伺效慕,莫能如也。 有问之,对曰:“橐驼非能使木寿且孳也,以能顺木之天,以致其性焉尔。凡植木之性,其本欲舒,其培欲原创 2015-05-27 21:37:22 · 457 阅读 · 0 评论 -
HDU 5272 Dylans loves numbers
Problem DescriptionWho is Dylans?You can find his ID in UOJ and Codeforces.His another ID is s1451900 in BestCoder.And now today's problems are all about him.Dylans is given a number N.原创 2015-06-21 00:15:21 · 497 阅读 · 0 评论 -
HDU 5264 pog loves szh I
Problem DescriptionPog has lots of strings. And he always mixes two equal-length strings. For example, there are two strings: "abcd" and "efgh". After mixing, a new string "aebfcgdh" is coming.原创 2015-06-07 21:23:37 · 635 阅读 · 0 评论 -
HDU 5312 Sequence
Problem DescriptionToday, Soda has learned a sequence whose nn-th (n \ge 1)(n≥1) item is 3n(n-1)+13n(n−1)+1. Now he wants to know if an integer mm can be represented as the sum of some ite原创 2015-07-26 17:11:48 · 371 阅读 · 0 评论 -
ZOJ 3888 Twelves Monkeys
James Cole is a convicted criminal living beneath a post-apocalyptic Philadelphia. Many years ago, the Earth's surface had been contaminated by a virus so deadly that it forced the survivors to move原创 2015-07-27 23:54:31 · 438 阅读 · 0 评论 -
HDU 5364 Distribution money
Problem DescriptionAFA 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原创 2015-08-09 15:38:10 · 379 阅读 · 0 评论 -
FZU 1002 HangOver
DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicul原创 2015-08-09 15:15:21 · 406 阅读 · 0 评论 -
FZU 1001 Duplicate Pair
DescriptionAn array of length n, with address from 1 to n inclusive, contains entries from the set {1,2,...,n-1} and there's exactly two elements with the same value. Your task is to find out the原创 2015-08-09 15:13:45 · 642 阅读 · 0 评论 -
FZU 1150 Farmer Bill's Problem
DescriptionPeter has n cigarettes. He smokes them one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.How many cigarettes can Peter have?InputInput is原创 2015-08-09 15:18:15 · 396 阅读 · 0 评论 -
FZU 1171 Hard to Believe, but True!
DescriptionThe fight goes on, whether to store numbers starting with their most significant digit or their least significant digit. Sometimes this is also called the "Endian War". The battleground原创 2015-08-09 15:20:20 · 676 阅读 · 0 评论 -
CSU 1639 队长,我想进集训队!
Description“队长,我想进集训队!”这是小A内心的愿望,然而进集训队是有一定要求的,小A现在只知道自己的情况,请你帮他/她判断一下是否可以进入集训队。已知进入集训队的条件如下:以下所有成绩累加,男生达到 90 分,女生达到 60 分。(1) COJ入门题1分/题基础题2分/题进阶题5分原创 2015-07-18 21:13:19 · 558 阅读 · 0 评论 -
POJ 2977 Box walking
DescriptionYou are given a three-dimensional box of integral dimensions lx × ly × lz The edges of the box are axis-aligned, and one corner of the box is located at position (0, 0, 0). Given th原创 2015-07-18 21:51:42 · 731 阅读 · 0 评论 -
ZOJ 2104 Let the Balloon Rise
DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over原创 2015-07-18 21:25:25 · 507 阅读 · 0 评论 -
CSU 1640 机智的刷题方式
Description小B想参加中南大学2015年大学生程序设计竞赛暑期集训,相信猛刷自然强的小B表示做题进集训队完全不是事~当然刷题还是有一定技巧的,考虑到每种题的分值不一样,难度不一样,小B要在上面做一些权衡。分数与题目对应关系如下:入门题1分/题基础题2分/题进阶题5分/题首先,小原创 2015-07-18 21:15:35 · 551 阅读 · 0 评论 -
POJ 2656 Unhappy Jinjin
DescriptionJinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. However, if Jinjin studies for more than eight hour原创 2015-07-18 21:31:36 · 332 阅读 · 0 评论 -
POJ 2328 Guessing Game
DescriptionStan and Ollie are playing a guessing game. Stan thinks of a number between 1 and 10 and Ollie guesses what the number might be. After each guess, Stan indicates whether Ollie's guess原创 2015-07-18 21:34:10 · 404 阅读 · 0 评论 -
POJ 2350 Above Average
DescriptionIt is said that 90% of frosh expect to be above average in their class. You are to provide a reality check.InputThe first line of standard input contains an integer C,原创 2015-07-18 21:47:09 · 1050 阅读 · 0 评论 -
FZU 2184 逆序数还原
Description有一段时间Eric对逆序数充满了兴趣,于是他开始求解许多数列的逆序数(对于由1...n构成的一种排列数组a,逆序数即为满足iaj的数字对数),但是某天他发现自己遗失了原来的数列,只留下之前计算过程中留下的各个数字对应的逆序数,现在请你帮他还原出原序列。Input数据有多组,请处理到文件结尾。每组数据第一行为一个整数N(1第二行为N个原创 2015-07-18 21:35:33 · 586 阅读 · 0 评论 -
HDU 4602 Partition
Font Size: ← →Problem DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have 4=1+1+1+1 4=1+1+2 4=1+2原创 2015-07-18 22:10:48 · 462 阅读 · 0 评论 -
HDU 5284 wyh2000 and a string problem
Problem DescriptionYoung theoretical computer scientist wyh2000 is teaching young pupils some basic concepts about strings.A subsequence of a string s is a string that can be derived from s by原创 2015-07-18 23:53:47 · 522 阅读 · 0 评论 -
HDU 5328 Problem Killer
Problem DescriptionYou are a "Problem Killer", you want to solve many problems. Now you have n problems, the i-th problem's difficulty is represented by an integer ai (1≤ai≤109).For some strange原创 2015-07-30 19:10:57 · 737 阅读 · 0 评论 -
HDU 5336 XYZ and Drops
Problem DescriptionXYZ is playing an interesting game called "drops". It is played on a r∗c grid. Each grid cell is either empty, or occupied by a waterdrop. Each waterdrop has a property "size".原创 2015-07-30 19:15:07 · 727 阅读 · 2 评论 -
UVALive 6955 Finding Lines
点击打开链接随机选一条线段然后判断是否满足答案,然后执行一定的次数,基本可以保证正确。#include#include#include#include#includeusing namespace std;typedef long long LL;const int maxn = 100005;int T, n, m, ans, x[maxn], y[maxn];原创 2015-08-26 21:36:08 · 544 阅读 · 0 评论 -
HDU 5334 Virtual Participation
Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he asks rikka to have some practice on codeforces. Then she opens the problem B:Given an integer原创 2015-07-31 19:13:45 · 773 阅读 · 0 评论 -
HDU 5351 MZL's Border
Problem DescriptionAs is known to all, MZL is an extraordinarily lovely girl. One day, MZL was playing with her favorite data structure, strings.MZL is really like Fibonacci Sequence, so she原创 2015-08-04 20:15:07 · 468 阅读 · 0 评论 -
HDU 5344 MZL's xor
Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined as B1 xor B2...xor Bn原创 2015-08-04 20:10:57 · 420 阅读 · 0 评论 -
HDU 5347 MZL's chemistry
Problem DescriptionMZL define F(X) as the first ionization energy of the chemical element XNow he get two chemical elements U,V,given as their atomic number,he wants to compare F(U) and F(原创 2015-08-04 20:12:06 · 450 阅读 · 0 评论 -
HDU 5349 MZL's simple problem
Problem DescriptionA simple problemProblem DescriptionYou have a multiple set,and now there are three kinds of operations:1 x : add number x to set2 : delete the minimum number (if the set原创 2015-08-04 20:29:00 · 431 阅读 · 0 评论 -
ZOJ 2705 Dividing a Chocolate
DescriptionThe boy and Karlsson are dividing a chocolate that the boy's parents have presented him for his birthday. A chocolate is a rectangle that consists of m × n chocolate squares, separated原创 2015-07-24 18:50:32 · 450 阅读 · 0 评论 -
HDU 5301 Buildings
Problem DescriptionYour current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in原创 2015-07-24 19:09:25 · 305 阅读 · 0 评论 -
HDU 5400 Arithmetic Sequence
Problem DescriptionA sequence b1,b2,⋯,bn are called (d1,d2)-arithmetic sequence if and only if there exist i(1≤i≤n) such that for every j(1≤ji),bj+1=bj+d1 and for every j(i≤jn),bj+1=bj+d2.原创 2015-08-18 17:08:51 · 553 阅读 · 0 评论 -
HDU 5399 Too Simple
Problem DescriptionRhason Cheung had a simple problem, and asked Teacher Mai for help. But Teacher Mai thought this problem was too simple, sometimes naive. So she ask you for help.Teacher Mai原创 2015-08-18 17:06:12 · 840 阅读 · 2 评论 -
HDU 5363 Key Set
Problem Descriptionsoda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S are原创 2015-08-06 18:51:25 · 428 阅读 · 0 评论