多校
文章平均质量分 80
zoro_n
我想走得更远
展开
-
hdu 5752 Sqrt Bo
Problem DescriptionLet's define the function f(n)=⌊n−−√⌋.Bo wanted to know the minimum number y which satisfies fy(n)=1.note:f1(n)=f(n),fy(n)=f(fy−1(n))It is a pity that Bo can only原创 2016-07-26 17:59:31 · 223 阅读 · 0 评论 -
hdu 5775 Bubble Sort
Problem DescriptionP is a permutation of the integers from 1 to N(index starting from 1).Here is the code of Bubble Sort in C++.for(int i=1;i<=N;++i) for(int j=N,t;j>i;—j) if(P[j-1原创 2016-07-30 10:57:23 · 201 阅读 · 0 评论 -
hdu 5713 Elegant Construction
Problem DescriptionBeing an ACMer requires knowledge in many fields, because problems in this contest may use physics, biology, and even musicology as background. And now in this problem, you are原创 2016-08-13 11:33:12 · 243 阅读 · 0 评论 -
hdu 5826 physics
Problem DescriptionThere are n balls on a smooth horizontal straight track. The track can be considered to be a number line. The balls can be considered to be particles with the same mass.At t原创 2016-08-11 20:26:06 · 435 阅读 · 0 评论 -
HDU 5831 Rikka with Parenthesis II
Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Correct parentheses sequences c原创 2016-08-11 19:38:24 · 325 阅读 · 0 评论 -
hdu 5818 Joint Stacks
Problem DescriptionA stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the stack. The last entry which is inserted is the first on原创 2016-08-11 18:24:33 · 218 阅读 · 0 评论 -
hdu 5858 Hard problem
Problem Descriptioncjj is fun with math problem. One day he found a Olympic Mathematics problem for primary school students. It is too difficult for cjj. Can you solve it?Give you the side l原创 2016-08-19 10:57:01 · 271 阅读 · 0 评论 -
hdu 5781 ATM Mechine
Problem DescriptionAlice is going to take all her savings out of the ATM(Automatic Teller Machine). Alice forget how many deposit she has, and this strange ATM doesn't support query deposit. The o原创 2016-08-08 10:46:11 · 377 阅读 · 0 评论 -
hdu 5867 Water problem
Problem DescriptionIf the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3+3+5+4+4=19 letters used in total.If all the numbers from 1 to n (up to one thousand原创 2016-08-18 21:19:41 · 1194 阅读 · 0 评论 -
hdu 5791 two
Problem DescriptionAlice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1,2} and {1,2} are same. {1,2,4} and {1,4,2} are not原创 2016-08-02 20:47:47 · 313 阅读 · 0 评论 -
hdu 5742 It's All In The Mind
Problem DescriptionProfessor Zhang has a number sequence a1,a2,...,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some properties of th原创 2016-07-21 22:09:32 · 246 阅读 · 0 评论 -
hdu 5744 Keep On Movin
Problem DescriptionProfessor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He a原创 2016-07-21 22:26:02 · 265 阅读 · 0 评论 -
hdu 5734 Acperience
Problem DescriptionDeep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular原创 2016-07-21 22:05:40 · 244 阅读 · 0 评论 -
hdu 5773 The All-purpose Zero
Problem Description?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same i原创 2016-07-29 17:45:29 · 216 阅读 · 0 评论 -
hdu 5774 Where Amazing Happens
没有直接人肉,选择打表了。#include#include#include#includeusing namespace std;int main(){ int n,t=1; char a[33]; scanf("%d",&n);getchar(); while(n--){ int ans; gets(a);原创 2016-07-28 17:41:42 · 269 阅读 · 0 评论 -
hdu 5762 Teacher Bo
Problem DescriptionTeacher BoBo is a geography teacher in the school.One day in his class,he marked N points in the map,the i-th point is at (Xi,Yi).He wonders,whether there is a tetrad (A,B原创 2016-07-26 18:33:35 · 309 阅读 · 0 评论 -
hdu 5753 Permutation Bo
Problem DescriptionThere are two sequences h1∼hn and c1∼cn. h1∼hn is a permutation of 1∼n. particularly, h0=hn+1=0.We define the expression [condition] is 1 when condition is True,is 0原创 2016-07-26 17:55:08 · 351 阅读 · 0 评论 -
hdu 6034 Balala Power!
点击打开链接题意: 给你26个字母,他们对应的权值分别是0~25;权值由你决定。 现在让你决定他们的权值,让他们的和最大,并把最大的和输出出来。 题解: 题意很简单,思路也很简单,,可是我wa了10来次,,,,,,, 最开始看错题,,以为 |s|‘ 小于等于100000, 那岂不是最长4位原创 2017-07-26 10:59:54 · 241 阅读 · 0 评论