09 2016 档案
摘要：1 /* 2 algorithm : High-Precision FFT 3 4 */ 5 #include 6 #include 7 #include 8 #include 9 #define N 200005 10 #define pi acos(-1.0) // PI值 11 using namespace std; 12 st...
阅读全文
摘要：Strategic Game Time Limit: 10000ms Memory Limit: 32768KB This problem will be judged on HDU. Original ID: 1054 64-bit integer IO format: %lld Java cla
阅读全文
摘要：11489 Integer GameTwo players, S and T, are playing a game where they make alternate moves. S plays rst.In this game, they start with an integer N. In
阅读全文
摘要：12050 Palindrome NumbersA palindrome is a word, number, or phrase that reads the same forwards as backwards. For example,the name “anna” is a palindro
阅读全文
摘要：11609 TeamsIn a galaxy far far away there is an ancient game played among the planets. The specialty of the gameis that there is no limitation on the
阅读全文
摘要：11076 Add AgainSummation of sequence of integers is always a common problem in Computer Science. Rather than computingblindly, some intelligent techni
阅读全文
摘要：11752 The Super PowersWe all know the Super Powers of this world and how they manage to get advantages in political warfareor even in other sectors. B
阅读全文
摘要：10892 LCM CardinalityA pair of numbers has a unique LCM but a single number can be the LCM of more than one possiblepairs. For example 12 is the LCM o
阅读全文
摘要：10780 Again Prime? No time.The problem statement is very easy. Given a number n you have to determine the largest power of m,not necessarily prime, th
阅读全文
摘要：10943 How do you add?Larry is very bad at math — he usually uses a calculator, which workedwell throughout college. Unforunately, he is now struck in
阅读全文
摘要：11889 BenefitRecently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, hewho never has appropriate changes, asks fo
阅读全文
摘要：11388 GCD LCMThe GCD of two positive integers is the largest integer that divides both the integers without anyremainder. The LCM of two positive inte
阅读全文
摘要：通过展示STL中已存在的lowerbound和uppebound函数来展示二分查找。
阅读全文
摘要：12096 The SetStack ComputerBackground from Wikipedia: \Set theory is a branch ofmathematics created principally by the German mathe-matician Georg Can
阅读全文
摘要：题意： 输入一些单词，找出所有满足以下条件的单词：该单词不能通过字母重排得到输入文本中的另外一个单词。在判断是否满足条件时，字母不区分大小写，但在输出时应该保留输入中的大小写，按字典序进行排列。 分析： 将输入的单词进行“标准化”，即将单词中的每个字母化为小写并按字典序重排单词，用一个字典来统计一个
阅读全文
摘要：400 Unix lsThe computer company you work for is introducing a brand new computer line and is developing a newUnix-like operating system to be introduc
阅读全文
摘要：这里用一个抛物线求弧长的例子给出Simpson公式的代码：
阅读全文
摘要：1356 BridgeA suspension bridge suspends the roadway from huge main cables, which extend from one end of thebridge to the other. These cables rest on t
阅读全文
摘要：1476 Error CurvesJosephina is a clever girl and addicted to Machine Learning recently. She pays much attention to amethod called Linear Discriminant A
阅读全文
摘要：10341 Solve ItSolve the equation:p ex + q sin(x) + r cos(x) + s tan(x) + t x2 + u = 0where 0 x 1.InputInput consists of multiple test
阅读全文
摘要：1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 #define MAXN 9999 // 大数类里面的数组中每个单元的最大正整数 8 #define MAXSIZE 10 9 #define DLEN 4 // 对应于MAXN的大小 10...
阅读全文
摘要：221 Urban ElevationsAn elevation of a collection of buildings is an orthogonal projection of the buildings onto a verticalplane. An external elevation
阅读全文
摘要：11542 SquareGiven n integers you can generate 2n1 non-empty subsets from them. Determine for how many of thesesubsets the product of all the integer
阅读全文
摘要：10828 Back to Kernighan-RitchieYou must have heard the name of Kernighan and Ritchie, the authors ofThe C Programming Language. While coding in C, we
阅读全文
摘要：1386 Cellular AutomatonA cellular automaton is a collection of cells on a grid of speci ed shape that evolves through a numberof discrete time steps a
阅读全文
摘要：1 #include 2 #include 3 #define ll long long 4 const int maxn = 505; 5 ll n,m,d,k,a[maxn]; 6 struct mat{ // 结构体循环矩阵，原矩阵式方阵 7 ll v[maxn]; 8 mat() {memset(v,0,sizeof(v));} // 构造函数 9 ...
阅读全文
