- 博客(56)
- 资源 (73)
- 收藏
- 关注
RSS订阅原创 hdu1008
#includeint main(){ int n,floor,temp,sum; int up=6,down=4,stop=5; while(scanf("%d",&n),n) { temp=sum=0; while(n--) { scanf("%d",&floor); if(floor>temp) { sum=sum+(floor-temp)*
2012-06-19 02:36:34
861
原创 hdu.2.2.2
#include int test(int k,int m) { int i,j=0; int alive=2*k; for(i=0;i<k;i++) { j = (j+m-1)%(alive-i); if(j<k) return 0; } return 1; } int main
2012-06-19 02:02:30
484
原创 hdu2.2.1
#include#includeusing namespace std;int main(){ int f[21]; f[0]=0;f[1]=1;f[2]=1; for(int i=3;i<21;i++) f[i] = f[i-1]+f[i-2]; double n; while(cin>>n) { if(n<=20) cout<<f[(int)n]<<endl;
2012-06-19 02:00:58
466
原创 hdu2.1.8
#include #include int main() { int n,m; std::cin>>n; while(n--) { std::cin>>m; long double t = m*log10(m*1.0); t -= (__int64)t; __int64 ans =
2012-06-19 01:59:17
537
原创 hdu2.1.7
#include#includeint main(){ int t; double a1,b1,a2,b2,a3,b3,area; double s1,s2,l,h,a,k,b,x; scanf("%d",&t); while(t--) { scanf("%lf%lf%lf%lf%lf%lf",&a1,&b1,&a2,&b2,&
2012-06-19 01:56:56
426
原创 hdu2.1.6
#include #include int cmp(const void * a, const void * b){ return *(int *)a - *(int *)b;}int main(){ int a,b,c,k,n,count,s[100],i; while(scanf("%d",&n) && n) { count
2012-06-19 01:52:59
343
原创 hdu2.1.5
#include#define N 32768int main(){ int prime[N],ph[N]; int i,j; int CN,n; prime[0]=prime[1]=0; for(i=2;i<N;i++) prime[i]=1,ph[i]=i; for(i=2;i*i<N;i++) if(prime[i]) { for(j=i*i;j<N;j+=
2012-06-19 01:49:49
338
原创 hdu2.1.4
#include#define MAXN 500000int f[MAXN+1];void vext(){ int i,j; f[0]=f[1]=0; for(i=1;i<=MAXN/2;i++) for(j=i*2;j<=MAXN;j+=i) f[j]+=i;}int main(){ int T,n; scanf(
2012-06-19 01:46:40
360
原创 hdu2.1.3
#include#define N 1000001int a[N];int main(){ int i,j,n,num=0; for(i=0;i<N;i++) a[i]=0; for(i=2;i<N;i++) if(!a[i]) { num++; for(j=i;j<N;j+=i) a[j]=num; } while(scanf("%d",
2012-06-19 01:43:47
380
原创 hdu2.1.2
#include #include int main() { int n,m,i,j,count,s,flag; while(scanf("%d",&n)!=EOF) { count=0; for(i=1;i<=n;i++) { scanf("%d",&m); s=(int)sqrt(m); flag=1; for(j=2;j<
2012-06-19 01:40:21
485
原创 hdu2.1.1
#includeint max_companies(int a,int b){ int c; while(1) { c=a%b; if(!c) break; a=b; b=c; } return b;}int main(){ int a,b,ss; while(scanf("%d %d",&a,&b)!=EO
2012-06-19 01:32:55
405
原创 hdu1.3.8
#include #include int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;} int main(){ int t,n,i,a[1000]; while(scanf("%d",&t)!=EOF) { while(t--) { sc
2012-06-19 01:29:08
468
原创 hdu1.3.7
#include #include using namespace std;struct E{ int ai, bi;};int cmp(E a, E b){ return a.bi-a.ai > b.bi-b.ai; // 先放置bi-ai大的}int main(){ int t, n, i, sum, max, m, flag; E equip[1001];
2012-06-19 01:26:31
388
原创 hdu1.3.6
#include #include struct node{ int a; int b;}p[100];int cmp(const void *a,const void *b){ struct node *m=(struct node *)a; struct node *n=(struct node *)b; return n->a-m->a;}int main(){
2012-06-19 01:23:17
379
原创 hdu1.3.5
#include#include#includeusing namespace std;struct student{ char name[11]; int solve; int cost;}stu[10000];bool cmp(student a,student b){ if(a.solve!=b.solve) if(a.solv
2012-06-19 01:18:30
469
原创 hdu1.3.4
#include #include #includeint cmp(const void *a,const void *b){ return *(int *)b-*(int *)a;}int main(){ int n,i,j; int *p; while(scanf("%d",&n)!=EOF) { i=0; p=(int *)malloc(n*sizeof(int)
2012-06-19 01:15:56
357
原创 hdu1.3.3
#include #include int main(){ int m,n; char openid[16],closeid[16],opentime[9],closetime[9],id[16],open[9],close[9]; scanf("%d",&n); while(n--) { scanf("%d",&m); scanf("%s%s%s",id,opentime
2012-06-19 01:12:30
398
原创 hdu1.3.2
#include #include #include struct person{ char id[21]; int total;}p[1000];int cmp(const void* a, const void* b){ struct person* pa = (struct person*)a; struct person* pb = (struct person*)
2012-06-19 01:11:24
464
原创 hdu1.3.1
#include #include using namespace std;void change(int &a, int &b){ int temp; temp = a; a = b; b = temp;}void quickSort(int* a, int l, int u){ int i, m; if (l >= u) return; m = l; fo
2012-06-19 01:09:33
452
原创 hdu1.2.8
#include#include#includevoid lowercase(char *p){ int i; for(i=0;i<(int)strlen(p);i++) switch(p[i]) { case 'a': p[i]='A';break; case 'e': p[i]='E';break; case 'i': p[i]='I';break; case
2012-06-19 01:06:35
420
原创 hdu1.2.7
#includeint ff(int n,int base){ int sum=0; while(n) { sum+=n%base; n/=base; } return sum;} int main() { int i; for(i=1000;i<=9999;i++) {
2012-06-19 01:03:43
424
原创 hdu1.2.6
#include int main(){char s[1001];int n, k, z;scanf("%d", &z);k = 0;while (z-- != 0){ scanf("%d", &n); s[k++] = n;}s[k] = '\0';printf("%s", s);return 0;}
2012-06-19 01:02:46
426
原创 hdu1.2.5
#include#includevoid main(){int n,i,m;while(scanf("%d",&n)!=EOF,n){ m=1; i=0; while(!(m&n)) m<<=1,i++; printf("%d\n",(int)pow(2,i));}}
2012-06-19 01:01:26
455
原创 hdu1.2.4
#includevoid main(){int n,a,b,c,temp;scanf("%d",&n);while(n&&(scanf("%d%d%d",&a,&b,&c)!=EOF)) { if(a>b) temp=a,a=b,b=temp; if(b>c) temp=b,b=c,c=temp; if(a>c) temp=a,a=c,c=temp;
2012-06-19 00:59:53
514
原创 hdu1.2.3
#include#includevoid main(){int n,x,y,i,sum;while(scanf("%d",&n)!=EOF){ sum=0; while(n&&(scanf("%d(%d)",&x,&y)!=EOF)) { i=0; while(x) { sum+=(int)((x%10)*pow(y,i)); x/=10
2012-06-19 00:57:38
491
原创 hdu1.2.2
#includevoid main(){ int l,m,s; int n=1; scanf("%d",&l); while(l--&&(scanf("%d",&n)!=EOF)) { m=n%10; n=n%4; if(n==0) n=4; s=1; while(n--) { s*=m; if(s>10) s%=10; } print
2012-06-19 00:55:45
751
1
原创 hdu1.2.1
#includevoid main(){ int n,m; float a,sum; n=m=12; sum=0; while(n--&&scanf("%f",&a)!=EOF) sum += a; printf("$%0.2f\n",sum/m);}
2012-06-19 00:54:56
576
原创 hdu1.1.8
#includevoid main(){ int a,m,sum; int n=1; scanf("%d",&m); while(m&&scanf("%d",&n)!=EOF) { sum=0; while(n&&scanf("%d",&a)!=EOF) sum+=a,n--; printf("%d\n",sum); if(--m) printf("\n")
2012-06-19 00:53:16
559
原创 hdu1.1.7
#includevoid main(){ int a,b; while(scanf("%d %d",&a,&b)!=EOF) printf("%d\n\n",a+b);}
2012-06-19 00:50:17
427
原创 hdu1.1.6
#includevoid main(){ int a,sum; int n=1; while(scanf("%d",&n)!=EOF) { sum=0; while(n&&scanf("%d",&a)!=EOF) sum+=a,n--; printf("%d\n",sum); }}
2012-06-19 00:48:24
382
原创 hdu1.1.5
#includevoid main(){ int a,m,sum; int n=1; scanf("%d",&m); while(m&&scanf("%d",&n)!=EOF) { sum=0; while(n&&scanf("%d",&a)!=EOF) sum+=a,n--; printf("%d\n",sum); m--; }}
2012-06-18 18:17:26
482
原创 hdu1.1.4
#includevoid main(){ int a,n,sum; while(scanf("%d",&n)!=EOF,n) { sum=0; while(n--&&scanf("%d",&a)!=EOF) sum+=a; printf("%d\n",sum); }}
2012-06-18 18:14:37
603
原创 hdu1.1.3
#includevoid main() { int a,b;while(scanf("%d %d",&a,&b)!=EOF)if(a+b)printf("%d\n",a+b); }
2012-06-18 18:13:43
434
原创 hdu1.1.2
#includevoid main() { int a,b,n;scanf("%d",&n); while(scanf("%d %d",&a,&b)!=EOF,printf("%d\n",a+b),--n); }
2012-06-18 18:12:41
494
原创 hdu1.1.1
#includevoid main() { int a,b; while(scanf("%d %d",&a,&b)!=EOF)printf("%d\n",a+b); }
2012-06-18 18:11:41
652
原创 hdu1018
#includeusing namespace std;int lcm(int a,int b){ int temp,temp1=a,temp2=b; while(b) { temp=b; b= a%b; a=temp; } return temp1/temp*temp2/temp*temp;}int
2012-06-18 18:06:51
459
原创 hdu1018
#include#include int main(){ int n,i,m; double sum; scanf("%d",&n); while(n--) { sum=0; scanf("%d",&m); for(i=1;i<=m;i++) sum+=log10((dou
2012-06-18 18:05:32
433
原创 hdu1017
#includeusing namespace std;int main(){ int n,m,N,i,count,j; scanf("%d",&N); while(N--) { int c=1; while(scanf("%d%d",&n,&m),n+m) { count=0;
2012-06-18 18:04:52
954
原创 hdu1013
#include#includeint main(){ char num[1001]; int i,temp; while(gets(num),num[0]!='0') { temp=0; for(i=0;i<strlen(num);i++) { temp+=num[i]-'0';
2012-06-18 18:02:06
956
原创 hdu1012
#includeint main(){ int f[10]={1,1,2,6,24,120,720,5040,40320,362880}; int n; double e; printf("n e\n"); printf("- -----------\n"); printf("%d %d\n",0,1); printf("%d %d\n"
2012-06-18 18:00:58
851
标准化降水指数spi的matlab代码
2018-02-09
Omron PLC与Kepware OPC通信
2018-02-08
微软官方非常漂亮的WPF案例源码
2018-02-07
fastjson的jar包 绿色版
2018-02-07
lukeall-4.10.3
2018-02-07
java请求API中httpclient 使用jar包
2018-02-07
org.apache.http.legacy.jar.
2018-02-07
jsoup jar包
2018-02-07
okhttp-3.0.1.jar
2018-02-07
爬虫 登陆 知乎 android java
2018-02-07
Data Flow Analysis Theory and Practice
2018-02-07
PostgreSQL数据库内核分析.pd
2018-02-07
Android模拟登录评论CSDN
2018-02-07
Synergy mac+windows版本(1.8.2)
2018-02-06
Approximation.Algorithms.for.NP-Hard.Problems
2018-02-05
approximation algorithms for np-hard problems.pdf 近似算法关于np问题
2018-02-05
YourKit Java Profiler 2017 破解版
2018-02-05
尽在双11：阿里巴巴技术演进与超越 高清完整.pdf版下载
2018-02-02
最新全国高校数据库信息（包含2854所高校）
2019-01-03
深入理解java虚拟机 jvm内存模型 性能调优 虚拟机原理 龙果视频教程
2018-02-25
Formula One 6原装控件
2018-02-11
小波神经网络预测程序
2018-02-11
Android 悬浮按钮 悬浮框 浮动按钮
2018-02-11
oracle 10.2.0.1 精简客户端.msi.zip
2018-02-11
电磁波穿透界面时折射与反射的Matlab仿真
2018-02-11
算法笔记-上机训练实战指南-胡凡 完整.pdf
2018-02-11
后台模板HTML+整套Easyui皮肤组件-后台管理系统模板
2018-02-11
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人