
acm入门
Jackson-p
相信命运,自律自由.
展开
-
hdu 1008
贼水的数学题,按照题意来就行了AC:#includeint main(){ int t; while(scanf("%d",&t)==1 && t) { int b,a=0; int sum=5*t; for(int i=0;i<t;i++) {scanf("%d",&b); if(b>a) sum+=6*(b-a); else sum+=4*(a-b);原创 2017-03-09 14:15:21 · 235 阅读 · 0 评论 -
hdu 1157
#includeint sort(int a[n]){ for(int i=0;i<n;i++) for(int j=i;j<n;j++) { if(a[j]<a[i]) { int t=a[j]; a[j]=a[i]; a[i]=t; } }}int main(){ int n; while(scanf("%d"原创 2017-03-12 18:04:48 · 205 阅读 · 0 评论 -
hdu 1097
打表题:AC:#includeint sz[10][4]={{0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}};int main(){ int a,b; while(scanf("%d %d",&a,&b)==2) { int d=a%10; if(d==0||d==1||d==5||原创 2017-03-10 20:15:06 · 170 阅读 · 0 评论 -
hdu 1076
同类水,经典的判断平闰年问题#includeint judge(int y){ if(y%4==0 && y%100!=0 || y%400==0) return 1; else return 0;}int main(){ int t; scanf("%d",&t); while(t--) { int fir,leap; scanf("%d %d",&fi原创 2017-03-10 20:09:17 · 230 阅读 · 0 评论 -
hdu 1056
水题,和基础的把e展开成多项式挺像的AC:#includeint main(){ double s; while(scanf("%lf",&s) && s!=0.00) { double sum=0; int card=0; for(int i=1;;i++) {sum+=1.0/(i+1); if(sum>=s) {card=i; brea原创 2017-03-10 19:49:39 · 312 阅读 · 0 评论 -
hdu 1040
虽然这道题水的不能再水,但是却是一道练基础冒泡排序的好题AC:#include#define maxn 100005int a[maxn];int main(){ int i,n,j,m,t; scanf("%d",&n); while(n--) { scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d",&a[i]);原创 2017-03-10 19:42:43 · 211 阅读 · 0 评论 -
hdu 1029
一道模拟的大水题,入门合适:AC:#include#include#define maxn 1005int a[maxn],num[maxn];int main(){ memset(a,0,sizeof(a)); int t; while(scanf("%d",&t)==1) { for(int i=1;i<=t;i++) { scanf("%d",a[i原创 2017-03-09 15:20:41 · 259 阅读 · 0 评论 -
hdu 1017
数学超简单模拟“#includeint main(){ int t; scanf("%d",&t); while(t--) { int n,m; int kase=0; while(scanf("%d %d",&n,&m),n||m) { int key=0; for(int b=2;b<n;b++) { for(int a=1;a<b;原创 2017-03-09 14:31:56 · 222 阅读 · 0 评论 -
hdu 1012
水题,按照公式直接求AC:#include#includeint f(int x){ return x==0? 1:f(x-1)*x;//递归求阶乘}int main(){ int n,i,j; double sum[11]; memset(sum,0,sizeof(sum)); printf("n e\n- -----------\n0 1\n1 2\n2 2.5原创 2017-03-09 14:19:39 · 274 阅读 · 0 评论 -
hdu 1048 字符串加周期
The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26057 Accepted Submission(s): 12179Problem DescriptionJul原创 2017-03-23 14:40:13 · 291 阅读 · 0 评论