09 2015 档案

hdu1013
摘要：Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digi... 阅读全文
posted @ 2015-09-23 20:18 martinue 阅读(122) 评论(0) 推荐(0)
学生信息管理小系统
摘要：有bug，不过还能凑合用。。。。。 #include #include #include#includeusing namespace std;struct xs{ int xh;char xb,xm[20]; double cj1,cj2,zong,jun; xs*nex... 阅读全文
posted @ 2015-09-23 18:49 martinue 阅读(946) 评论(0) 推荐(0)
hdu1010（dfs加剪枝）
摘要：Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shak... 阅读全文
posted @ 2015-09-22 21:05 martinue 阅读(160) 评论(0) 推荐(0)
hdu3555（数位dp）
摘要：Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number seque... 阅读全文
posted @ 2015-09-18 20:17 martinue 阅读(136) 评论(0) 推荐(0)
hdu1018（求n！的位数）
摘要：Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmi... 阅读全文
posted @ 2015-09-15 19:54 martinue 阅读(166) 评论(0) 推荐(0)
hdu1796（二进制枚举）
摘要：Problem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can d... 阅读全文
posted @ 2015-09-15 19:17 martinue 阅读(222) 评论(0) 推荐(0)
hdu4099（trie树，斐波那契数列）
摘要：Problem Description The well-known Fibonacci sequence is defined as following: Here we regard n as the index of the Fibonacci number F(n). ... 阅读全文
posted @ 2015-09-14 20:15 martinue 阅读(430) 评论(0) 推荐(0)
hdu3054（斐波那契。。。。找规律）
摘要：Problem Description We know the Fibonacci Sequence F1=1,F2=1,F3=2,F4=3,F5=5, ... Fx = Fx-1+Fx-2 We want to know the Mth number which has K co... 阅读全文
posted @ 2015-09-10 20:19 martinue 阅读(180) 评论(0) 推荐(0)
hdu2814（斐波那契，费马小定理，快速幂）
摘要：Problem Description In mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contracti... 阅读全文
posted @ 2015-09-09 21:10 martinue 阅读(197) 评论(0) 推荐(0)
hdu1588（斐波那契，矩阵连乘）
摘要：Problem Description Without expecting, Angel replied quickly.She says: "I'v heard that you'r a very clever boy. So if you wanna me be your GF, yo... 阅读全文
posted @ 2015-09-08 21:41 martinue 阅读(214) 评论(0) 推荐(0)
hdu1466(dp)
摘要：Problem Description 平面上有n条直线，且无三线共点，问这些直线能有多少种不同交点数。 比如,如果n=2,则可能的交点数量为0(平行)或者1(不平行)。 Input 输入数据包含多个测试实例,每个测试实例占一行,每行包含一个正整数n（n#include#inc... 阅读全文
posted @ 2015-09-07 20:59 martinue 阅读(259) 评论(0) 推荐(0)