基础题
文章平均质量分 77
kingsirre
fighting
展开
-
hdu 1017 A Mathematical Curiosity
Problem Description Given two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases! The first line of a multiple input is an inte原创 2015-08-22 20:12:46 · 237 阅读 · 0 评论 -
hdu5494
题目:点击打开链接 题解: #include #include #include #include #include using namespace std; int main() { int t,n,m; int a[501],b[501]; int sum1,sum2; cin>>t; while(t--) {原创 2015-10-24 15:45:14 · 323 阅读 · 0 评论 -
hdu5463
题目链接:点击打开链接 题解: 理解了题意就好说,我看了好久才明白。 不用物品的相同材料可以放一起 #include #include #include #include using namespace std; int main() { int t,n,c[501],sum,ans,a,b; cin>>t; while(t--) {原创 2015-10-23 21:04:11 · 294 阅读 · 0 评论 -
我家博宇生日快乐!!!hdu5504
今天我的好队友生日,在这里祝她生日快乐,天天开心,么么哒 题目:点击打开链接 题解: 给你n个数,让你从中选任意的大于一个数,使得乘积最大,可能会出现负数,0 整体不难,就是特殊情况要考虑到 1,全为0 2,有且只有一个负数 3,有一个负数,其余全为0 代码: #include #include #include #include #include usi原创 2015-10-22 20:38:20 · 488 阅读 · 0 评论 -
hdu 1202 The calculation of GPA
题目:点击打开链接 题目不难,读懂题意就行, 代码有错误,还没AC,想看阅兵 #include #include #include #include using namespace std; int main() { int n,m; float s,p,ans=0,sum=0; while(scanf("%d",&n)!=EOF) {原创 2015-09-03 10:23:28 · 263 阅读 · 0 评论 -
hdu 5417 Victor and Machine
题目:点击打开链接 题解: 判断特殊情况 #include #include #include #include using namespace std; int main() { int x,y,w,n,t,m; while(scanf("%d%d%d%d",&x,&y,&w,&n)!=EOF) { if(n==1)原创 2015-09-03 20:16:31 · 323 阅读 · 0 评论 -
HDU 1201 18岁生日
题目:点击打开链接 分析: 判断出生是不是闰年,如果出生在闰年的2.19号,18岁后这一年不是闰年,则输出-1 然后判断生日是在3月之后还是之前,如果之后,每过一次闰年比正常多加一天;如果之前,则需判断出生这年是不是闰年,是的话再多加一天。 代码: #include bool leap(int n) { if((n%4==0&&n%100!=0)||n%400==0)原创 2015-09-03 09:31:56 · 271 阅读 · 0 评论 -
hdu1163 Eddy's digital Roots
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 digit then that digit is the digital root. If the resultin原创 2015-08-28 10:15:35 · 246 阅读 · 0 评论 -
hdu 1106 排序
Problem Description 输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该被忽略掉,除非这个整数就是由若干个‘0’组成的,这时这个整数就是0)。 你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出。 Input 输入包含多组测试用例,每组输入数据只有一行数转载 2015-08-27 19:46:55 · 267 阅读 · 0 评论 -
hdu1097 A hard puzzle
Problem Description lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.转载 2015-08-26 19:06:58 · 261 阅读 · 0 评论 -
hdu 1098 Ignatius's puzzle
Problem Description Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative intege转载 2015-08-26 17:35:36 · 239 阅读 · 0 评论 -
hdu 1070 Milk
Problem Description Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know whi转载 2015-08-25 21:04:23 · 262 阅读 · 0 评论 -
hdu 1040 As Easy As A+B
Problem Description These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights. Give原创 2015-08-24 21:28:19 · 432 阅读 · 0 评论 -
hdu1037 Keep on Truckin'
Problem Description Boudreaux and Thibodeaux are on the road again . . . "Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!" "Don't worry, Thibodeaux, I already chec原创 2015-08-24 21:21:05 · 251 阅读 · 0 评论 -
hdu5479
题目:点击打开链接 题解: 不能用栈,会爆栈 全部转化成不匹配,要不就是全化为((((或))))或))))((((这三种情况必居其一 思路是从左到右和从右到左各扫描一次记录 ( 和 ) 的到每个位置的数量, 求将每个位置左方全转置成 ) 和右方全转置成 ( 需要的次数和,这么算发现有一个转置是不必要的,注意减一 代码: #include #include #i原创 2015-10-25 16:30:54 · 340 阅读 · 0 评论