简单题
文章平均质量分 89
WinJourn
Stay hungry stay foolish
展开
-
ACdream 1061(abs用法)
题目链接:http://acdream.info/problem?pid=1061主要是abs用法,看题目的数据long long的最大值:9223372036854775807long long的最小值:-9223372036854775808unsigned long long的最大值:18446744073709551615由题目的样例可知,数的范围超不出long lon原创 2015-05-06 22:19:42 · 974 阅读 · 0 评论 -
Subsequences Summing to Sevens(前缀和)
Subsequences Summing to Sevens时间限制: 1 Sec 内存限制: 64 MB提交: 55 解决: 29[提交][状态][讨论版]题目描述Farmer John's N cows are standing in a row, as they have a tendency to do from time to time. Each cow is原创 2016-08-09 16:08:02 · 839 阅读 · 0 评论 -
Breed Counting(水?)
2386: Breed Counting时间限制: 1 Sec 内存限制: 64 MB提交: 81 解决: 31[提交][状态][讨论版]题目描述Farmer John's N cows, conveniently numbered 1…N, are all standing in a row (they seem to do so often that it now ta原创 2016-08-09 15:50:36 · 588 阅读 · 0 评论 -
十六进制数转八进制数
开始很糊涂的以为要先转变成十进制再转成八进制,结果因为数量级过大,发现此路不通。但是转2进制没有灵感,于是看了别人的代码。#include #include using namespace std;int arr[10000001];int main(){ int n,len_str,i,j; string str,str2; cin>>n; while(n--原创 2015-03-02 11:11:15 · 955 阅读 · 0 评论 -
hdu 1032 The 3n + 1 problem (打表)
The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26353 Accepted Submission(s): 9784题目链接:http://acm.hdu.edu.cn/sh原创 2015-04-30 14:11:58 · 1572 阅读 · 0 评论 -
hdu 2062 Subset sequence
Subset sequenceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3730 Accepted Submission(s): 1876Problem DescriptionConsider the a原创 2015-04-19 14:12:59 · 1576 阅读 · 0 评论 -
hdu1003 Max Sum
水题一枚,开始写出了一个复杂度n平方的代码,提交 果然tle,然后观察数据 再优化了一些具体情况,还是tle,这样的优化还是治标不治本啊,,后来按捺不住我又看了别人的代码,,原来可以把复杂度弄成o(n);只需要遍历1次即可。Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327原创 2015-02-03 13:17:54 · 1086 阅读 · 0 评论 -
hdu1106排序
水题,出错只在于考虑问题的不全面,给几组帮助我ac的测试数据输入00512312320507750051231232050775005123123205077555512345(别漏了) 《《这个就是我出错的数据输出0 77 123123200 77 123123200 77 123123201234下面上代码#include #include原创 2015-02-17 10:37:25 · 1059 阅读 · 0 评论 -
hdu 1239 Calling Extraterrestrial Intelligence Again(素数,枚举)
题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1239【题目大意】输入三个数,m,a,b让你求出一对素数 p ,q ,且满足 p x q 数据范围4【思路】先用素数筛选法,将1--100000的素数筛选出来, 打了一下表 发现有9000+个素数;直接暴力枚举将达到复杂度达到1e8,不行;注意到 p/q p/q原创 2015-08-09 18:40:55 · 827 阅读 · 0 评论 -
NYOJ219 a problem about date(给出日期计算周几)
给出日期计算周几。公式留作备用。#include#include#include#include#include#includeusing namespace std;int Hash[7]= {5,6,0,1,2,3,4};int run[13]= {0,31,29,31,30,31,30,31,31,30,31,30,31};int pin[13]= {0,31,28原创 2016-09-13 21:13:53 · 548 阅读 · 0 评论