随笔分类 - HDU
摘要：Hints of sd0061 Problem Description sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no
阅读全文
摘要：Shell Necklace Problem Description Perhaps the sea‘s definition of a shell is the pearl. However, in my view, a shell necklace with n beautiful shells
阅读全文
摘要：Wavel Sequence Problem Description Have you ever seen the wave? It's a wonderful view of nature. Little Q is attracted to such wonderful thing, he eve
阅读全文
摘要：Kanade's sum Problem Description Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r].Specially , f(l,r,k)=0 if r
阅读全文
摘要：RXD and functions Problem Description RXD has a polynomial function f(x), f(x)=∑ni=0cixiRXD has a transformation of function Tr(f,a), it returns anoth
阅读全文
摘要：官方题解 1001. Add More Zero #pragma comment(linker, "/STACK:1024000000,1024000000") #include<iostream> #include<cstdio> #include<cmath> #include<string>
阅读全文
摘要：String Problem Description Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if (i) It is of length
阅读全文
摘要：A * B Problem Plus Problem Description Calculate A * B. Input Each line will contain two integers A and B. Process to end of file.Note: the length of
阅读全文
摘要：3-idiots Problem Description King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that
阅读全文
摘要：Tree Problem Description You are given a tree (an acyclic undirected connected graph) with N nodes. The tree nodes are numbered from 1 to NThere are N
阅读全文
摘要：Little Devil I Problem Description There is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy thi
阅读全文
摘要：Sometimes Naive Problem Description Rhason Cheung had a naive problem, and asked Teacher Mai for help. But Teacher Mai thought this problem was too si
阅读全文
摘要：Dylans loves tree Problem Description Dylans is given a tree with N nodes.All nodes have a value A[i].Nodes on tree is numbered by 1∼N.Then he is give
阅读全文
摘要：Ba Gua Zhen Problem Description During the Three-Kingdom period, there was a general named Xun Lu who belonged to Kingdom Wu. Once his troop were chas
阅读全文
摘要：XOR Problem Description XOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit
阅读全文
摘要：DNA repair Problem Description Biologists finally invent techniques of repairing DNA that contains segments causing kinds of inherited diseases. For t
阅读全文
摘要：病毒侵袭 Problem Description 当太阳的光辉逐渐被月亮遮蔽，世界失去了光明，大地迎来最黑暗的时刻。。。。在这样的时刻，人们却异常兴奋——我们能在有生之年看到500年一遇的世界奇观，那是多么幸福的事儿啊~~但网路上总有那么些网站，开始借着民众的好奇心，打着介绍日食的旗号，大肆传播病毒
阅读全文
摘要：Wireless Password Problem Description Liyuan lives in a old apartment. One day, he suddenly found that there was a wireless network in the building. L
阅读全文
摘要：Keywords Search Problem Description In the modern time, Search engine came into the life of everybody like Google, Baidu, etc.Wiskey also wants to bri
阅读全文
摘要：1001题意：n个人，给m对敌对关系，X个好人，Y个坏人。现在问你是否每个人都是要么是好人，要么是坏人。 先看看与X，Y个人有联通的人是否有矛盾，没有矛盾的话咋就继续遍历那些不确定的人关系，随便取一个数3，与其相连的就是4，间隔就要相同，dfs搜过去就可以判断了 #include<bits/stdc
阅读全文
浙公网安备 33010602011771号