- 博客(14)
- 资源 (11)
- 问答 (3)
- 收藏
- 关注
原创 hdu-1870-愚人节的礼物
#includechar a[1005],b[1005];int main(){int i,j;while(gets(a)!=NULL){for(j=0,i=0;a[i]!='\0';i++){if(a[i]=='(')b[j++]='(';else if(a[i]==')')j--;elsebreak;}printf("%d\n",
2013-12-14 17:38:15 553
原创 hdu-2084-数塔
#includeint a[102][102];int b[102][102];int max(int x,int y){if(x>y)return x;elsereturn y;}int main(){int s;scanf("%d",&s);while(s--){int n,i,j,k;scanf("%d",&n);for
2013-12-14 17:18:07 432
原创 hdu-2502-Picture
#includeint main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){int i,j;printf("+");for(j=0;jprintf("-");printf("+\n");for(i=0;i{printf("|");for(j=0;jprintf(" ");printf("|\n
2013-12-08 17:27:08 387
原创 hdu-2501-Bitset
#includeint a[12];int main(){int n,i,j;while(scanf("%d",&n)!=EOF){j=0;while(n){a[j++]=n%2;n/=2;}for(i=j-1;i>=0;i--)printf("%d",a[i]);printf("\n");}return 0;}
2013-12-08 17:08:41 416
原创 hdu-1003-Max Sum
#includeint a[100005];int main(){int s,b=1;scanf("%d",&s);while(s--){int n,i,j,t1,t2,sum=0,max=-999999;scanf("%d",&n);for(i=1;iscanf("%d",&a[i]);for(i=j=1;j{sum+=a[j];if(
2013-12-08 16:44:15 432
原创 hdu-211-Secret Number
#includeint main(){int n,f=0;while(scanf("%d",&n)!=EOF){int t,sum=0;while(n){t=n%10;if(t%2==0)sum+=t;n/=10;}if(f){printf("\n");}printf("%d\n",sum);f=1; }retur
2013-12-06 18:53:10 523
原创 hdu-2111-Saving HDU
#include#includestruct {int x,y;}a[11];int cmp(const void *a,const void *b){return *(int *)b-*(int *)a;}int main(){int v,n;while(scanf("%d",&v)&&v){int i,sum=0;scanf("%
2013-12-05 22:50:25 451
原创 hdu-2109-Fighting for HDU
#include#includeint a[100],b[100];int cmp(const void *a,const void *b){return *(int *)a-*(int *)b;}int main(){int n,i;while(scanf("%d",&n)&&n){int sum1=0,sum2=0;for(i=0;isc
2013-12-05 22:26:04 662
原创 hdu-2103-Family planning
#includeint main(){int s;scanf("%d",&s);while(s--){int n,m,i,h,t=0;_int64 k=10000,sum=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&h);if(t||i>=n){sum+=k;k*=2;}if(h==
2013-12-05 22:11:32 545
原创 hdu-2106-decimal system
#includestruct{int x,y;}a[1005];int main(){int n;while(scanf("%d",&n)!=EOF){int i,t,sum=0;for(i=0;i{scanf("%d(%d)",&a[i].x,&a[i].y);if(a[i].y==10)sum+=a[i].x;else{t
2013-12-05 11:44:17 444
原创 hdu-2075-A|B?
#includeint main(){ int s; scanf("%d",&s); while(s--) { int a,b; scanf("%d%d",&a,&b); if(a%b==0) printf("YES\n"); else printf("NO\n"); } return 0; }
2013-12-03 22:37:32 474
原创 hdu-2075-A|B?
#includeint main(){ int s; scanf("%d",&s); while(s--) { int a,b; scanf("%d%d",&a,&b); if(a%b==0) printf("YES\n"); else printf("NO\n"); } return 0; }
2013-12-03 22:32:10 744
原创 nyoj-911-HEIHEI是个笨蛋
#includeint main(){int s;scanf("%d",&s);while(s--){long long n,a,b;scanf("%lld",&n);a=n/5+n/6+n/8;b=n/30+n/24+n/40-n/120;printf("%lld\n",n-a+b);}return 0;}
2013-12-02 12:33:44 1767
原创 nyoj-921-分数矩阵
#includeint main(){int n,i,k1,k2;while(scanf("%d",&n)&&n){double sum=0.0,s;for(k1=1,i=0;isum+=1.0/(k1++);k1=2;k2=n;s=sum;for(i=1;i{s=s+1.0/(k1++)-1.0/(k2--);sum=sum+s;}
2013-12-02 12:18:33 543
二叉树的创建与销毁以及各种遍历算法
2019-03-14
文本挖掘资料
2016-02-02
visio绘图工具
2015-08-16
压缩感知目标跟踪
2015-08-12
求大神讲解怎样编写wsdl,以及wsdl、xsd和nsmap之间的关系。
2017-02-23
怎样在64位的linux环境中使用gcc/g++运行32位的程序,求大神解答
2016-09-08
请问怎样用C/C++读取PDF文件中的内容
2016-08-23
TA创建的收藏夹 TA关注的收藏夹
TA关注的人