MissZhou要努力

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

Problem DescriptionGive a time.(hh:mm:ss)，you should answer the angle between any two of the minute.hour.second handNotice that the answer must be not more 180 and not less than 0 Inpu

DescriptionInnocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers, the total number

题意：（看英文真费劲==） 给定一数列 求子区间能够满足其中最大值-最小值差此算法用于求固定区间的最值 本质是动态规划和枚举（一）首先是预处理，用动态规划（DP）解决。设A[i]是要求区间最值的数列，F[i, j]表示从第i个数起连续2^j个数中的最大值。（DP的状态）例如：A数列为：3 2 4 5 6 8 1 2 9 7F[1，0]表示第1

DescriptionLittle sun is an artist. Today he is playing mahjong alone. He suddenly feels that the tree in the yard doesn't look good. So he wants to decorate the tree.（The tree has n vertexs, inde

Problem DescriptionYou are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digita

Problem DescriptionThere are n apple trees planted along a cyclic road, which is L metres long. Your storehouse is built at position 0 on that cyclic road.The ith tree is planted at posi

DescriptionThe reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only onebit (binary digit). The reflected binary co

Problem DescriptionZero Escape, is a visual novel adventure video game directed by Kotaro Uchikoshi (you may hear about ever17?) and developed by Chunsoft.Stilwell is enjoying the first chapte

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

Problem DescriptionIn this problem, we should solve an interesting game. At first, we have an integer n, then we begin to make some funny change. We sum up every digit of the n, then insert it to

看到这个题想到之前周赛做过两遍的同样是粉刷的那个题==套啊套，依旧没找对方法 示例都不对 主要原因是这个题是斜着的orz有些点不出现在交线上怎么办？题解告诉我 我又读错题了……你什么时候能细心点？？？    \是红色   /是蓝色 而且是矩形不是正方形！能不能长点心？？？方法跟粉刷一点都不一样 呵呵对于'\'，如果当前格子为红色或者绿色，前一个格子(斜线上的)既不是红色也不是绿色，则必

Problem Description CRB has two strings s and t. In each step, CRB can select arbitrary character c of s and insert any character d (d ≠ c) just after it. CRB wants to convert s to t. But is it

Problem DescriptionThere are n soda conveniently labeled by 1,2,…,n. beta, their best friends, wants to invite some soda to go hiking. The i-th soda will go hiking if the total number of sod

Problem DescriptionMr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Greatest Common Divisor Query (

Problem DescriptionRecently Rikka falls in love with an old but interesting game -- 24 points. She wants to become a master of this game, so she asks Yuta to give her some problems to practice.

链接‘开始有所没读明白题orz 一上午终于看懂了 已知n个数 相对顺序固定 如果存在子区间 使得任意a[i]不能整除区间里的其他数 区间长度之和是多少？借用网友的思路：每个a[i]所在范围有左右顶点分别是l[i]和r[i] 则题目转化为求(i-l[i]+1)*(r[i] - i + 1)以r[i]为例：假设最开始每枚举一个数a[i]的区间的右顶点是n即总区间最右，在第二重循环中枚举此数

Problem DescriptionThere are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (

Problem DescriptionCRB has N different candies. He is going to eat K candies.He wonders how many combinations he can select.Can you answer his question for all K(0 ≤ K ≤ N)?CRB is too hu

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 DescriptionToday is CRB's birthday. His mom decided to buy many presents for her lovely son.She went to the nearest shop with M Won(currency unit).At the shop, there are N kinds of