LeeBlog

导航

2011年4月28日 #

HDU 素数判定

摘要: #include<stdio.h>int x,y,f,n;int judge( int x ){ for( int i = 2; i <= x / 2;++i ) if( x % i == 0 ) { return 0; } return 1;}int main( ){ while( scanf( "%d%d",&x,&y ),x|y ) { f = 1; for( ;x <= y; ++x ) if( !judge( x*x+x+41 ) ) { f = 0; break; } puts( f ?"OK":&qu 阅读全文

posted @ 2011-04-28 21:52 LeeBlog 阅读(190) 评论(0) 推荐(0) 编辑

HDU 3032 杨辉三角 最短代码

摘要: #include<stdio.h>#include<string.h>int num[35][35],n;void chart( ){ num[1][1] = 1; for( int i = 2; i < 35; ++i ) for( int j = 1; j <= i; ++j ) num[i][j] = num[i-1][j-1]+num[i-1][j]; }int main( ){ mems... 阅读全文

posted @ 2011-04-28 16:18 LeeBlog 阅读(181) 评论(0) 推荐(0) 编辑

HDU 2010 水仙花数

摘要: #include<stdio.h>#include<stdlib.h>int n,m,a[4] = {153,370,371,407};int main( ){ while( scanf( "%d%d",&n,&m ) != EOF ) { int f = 0,c = 0; for( int i = 0; i < 4; ++i ) if( a[i] >= n && a[i] <= m ) { f ... 阅读全文

posted @ 2011-04-28 16:06 LeeBlog 阅读(492) 评论(0) 推荐(0) 编辑

HDU 2009求数列的和

摘要: 水题#include<stdio.h>#include<math.h>int main( ){ double n,sum; int m; while( scanf( "%lf%d",&n,&m ) != EOF ) { sum = 0; for( int i = 0; i < m; ++i ) { sum += n; n = sqrt( n ); } printf( "%.2lf\n",sum )... 阅读全文

posted @ 2011-04-28 15:53 LeeBlog 阅读(482) 评论(0) 推荐(0) 编辑

hdu As Easy As A+B

摘要: 纯水题 ,不解释#include<stdio.h>int t,n,num[1005];int main( ){ scanf( "%d",&t ); while( t-- ) { scanf( "%d",&n ); for( int i = 0; i < n; ++i ) scanf( "%d",&num[i] ); for( int i = 0,f = 1; i < n; ++i ) for( i... 阅读全文

posted @ 2011-04-28 15:39 LeeBlog 阅读(227) 评论(0) 推荐(0) 编辑

HDU 2034 人见人爱A-B

摘要: 这题有两个条件,一是要A-B,这个可以用个标记,而是要排序,个人觉得先排序,再去A-B好做些.代码如下#include<stdio.h>#include<stdlib.h>#include<string.h>int num1[105],num2[105],des[105],n,m;int main( ){ while( scanf( "%d%d",&n,&m ),n|m ) { memset( des,0,sizeof( des ) ); for( int i = 0; i < n; ++i ) scanf( &qu 阅读全文

posted @ 2011-04-28 07:46 LeeBlog 阅读(946) 评论(0) 推荐(0) 编辑