Hust_BaoJia - 博客园

2014年4月25日

摘要： Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then... 阅读全文

posted @ 2014-04-25 22:43 Hust_BaoJia 阅读(120) 评论(0) 推荐(0) 编辑

poj 1611 The Suspects

摘要： DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. ... 阅读全文

posted @ 2014-04-25 22:06 Hust_BaoJia 阅读(151) 评论(0) 推荐(0) 编辑

poj 2524 Ubiquitous Religions

摘要： DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out ... 阅读全文

posted @ 2014-04-25 21:09 Hust_BaoJia 阅读(108) 评论(0) 推荐(0) 编辑

2014年4月24日

2-SAT

摘要：在这里，写了一个2-SAT的模板#include#include#include#include#include#include#include#include#include#include#include#define inf 0x0f0f0f0fusing namespace std;con... 阅读全文

posted @ 2014-04-24 20:12 Hust_BaoJia 阅读(117) 评论(0) 推荐(0) 编辑

hdu 1081 To The Max

摘要： Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or great... 阅读全文

posted @ 2014-04-24 19:26 Hust_BaoJia 阅读(141) 评论(0) 推荐(0) 编辑

HDU 1018 Big Number

摘要：这种题目考的是数学功底啊，用脚趾都能想到，任何一个数的长度等于它对10求对数加1；而log10(n!)=log10(1*2*3*4*5********n)=log10(1)+log10(2)+............+log10(n);#include#include#include#include... 阅读全文

posted @ 2014-04-24 18:53 Hust_BaoJia 阅读(115) 评论(0) 推荐(0) 编辑

HDU 1005 Number Sequence

摘要： Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are t... 阅读全文

posted @ 2014-04-24 17:44 Hust_BaoJia 阅读(131) 评论(0) 推荐(0) 编辑

hdu 1002 A + B Problem II

摘要：大数相加，这个题我提交了3次才通过，我去，就我这水平，还参加比赛，笑掉别人大牙咯#include#include#includeusing namespace std;char str1[1001],str2[1001];int str3[1001],str4[1001];int main(){ ... 阅读全文

posted @ 2014-04-24 17:16 Hust_BaoJia 阅读(120) 评论(0) 推荐(0) 编辑

hdu 1024 Max Sum Plus Plus

摘要： dp方程为这个dp[i][j]=Max(dp[i][j-1]+a[j] , max( dp[i-1][k] ) + a[j] ) 0#includeusing namespace std;const int maxn=1000001;const int inf=99999999;int dp[max... 阅读全文

posted @ 2014-04-24 16:48 Hust_BaoJia 阅读(119) 评论(0) 推荐(0) 编辑

HDU 1058 Humble Numbers

摘要： Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15,... 阅读全文

posted @ 2014-04-24 16:02 Hust_BaoJia 阅读(141) 评论(0) 推荐(0) 编辑

chensunrise

追求自己的梦想

公告