Occult

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

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

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

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

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

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

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

Description郭橐驼，不知始何名。病偻，隆然伏行，有类橐驼者，故乡人号之驼。驼闻之，曰：“甚善。名我固当。”因舍其名，亦自谓橐驼云。其乡曰丰乐乡，在长安西。驼业种树，凡长安豪富人为观游及卖果者，皆争迎取养。视驼所种树，或移徙，无不活；且硕茂，蚤实以蕃。他植者虽窥伺效慕，莫能如也。 　　有问之，对曰：“橐驼非能使木寿且孳也，以能顺木之天，以致其性焉尔。凡植木之性，其本欲舒，其培欲

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.

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.

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

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

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

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

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

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

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

Description“队长，我想进集训队！”这是小A内心的愿望，然而进集训队是有一定要求的，小A现在只知道自己的情况，请你帮他/她判断一下是否可以进入集训队。已知进入集训队的条件如下：以下所有成绩累加，男生达到 90 分，女生达到 60 分。（1） COJ入门题1分/题基础题2分/题进阶题5分

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

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

Description小B想参加中南大学2015年大学生程序设计竞赛暑期集训，相信猛刷自然强的小B表示做题进集训队完全不是事~当然刷题还是有一定技巧的，考虑到每种题的分值不一样，难度不一样，小B要在上面做一些权衡。分数与题目对应关系如下：入门题1分/题基础题2分/题进阶题5分/题首先，小

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

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

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,

Description有一段时间Eric对逆序数充满了兴趣，于是他开始求解许多数列的逆序数（对于由1...n构成的一种排列数组a，逆序数即为满足iaj的数字对数），但是某天他发现自己遗失了原来的数列，只留下之前计算过程中留下的各个数字对应的逆序数，现在请你帮他还原出原序列。Input数据有多组，请处理到文件结尾。每组数据第一行为一个整数N（1第二行为N个

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

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

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

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".

点击打开链接随机选一条线段然后判断是否满足答案，然后执行一定的次数，基本可以保证正确。#include#include#include#include#includeusing namespace std;typedef long long LL;const int maxn = 100005;int T, n, m, ans, x[maxn], y[maxn];

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

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

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 

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(

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

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

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

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.

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

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