xws117的专栏

新浪微博: http://weibo.com/2139773423/

hdu 2955

#include"stdio.h" #include"string.h" double min(double a,double b) { return a>b?b:a; } struct A { int m;doubl...

2013-05-18 20:47:46

阅读数:393

评论数:0

hdu 1231

# include int a[10011]; int search(int n) { int i; for(i=1;i<=n;i++) { if(a[i]==0) return i; } return -1; } int main () { int k,i,j,n...

2013-05-16 21:54:50

阅读数:393

评论数:0

Codeforces #103 div2 B

# include struct Node { int x,y,r; }A[1011]; int dis(int a,int b,int c,int d ,int e) { if(((a-c)*(a-c)+(b-d)*(b-d))<=(e*e)) //个人感觉用R*R表示比求出s...

2013-05-15 21:07:52

阅读数:653

评论数:0

Codeforces #103 A

# include # include int main () { int a[105]; int i,j,max,min,mark1,mark2,n; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a))...

2013-05-15 19:51:28

阅读数:445

评论数:0

hdu 1003

这道题要分为临时sum和最后最大的sum的区别  # include int a[100003]; int n; int getmin() { int min=-9999; int i,j; for(i=1;i<=n;i++) { if(a[i]>min...

2013-05-15 11:30:06

阅读数:371

评论数:0

hdu 4414

#include #include char ma[60][60]; int n; int find(int x,int y){ int a=0,b=0,c=0,d=0,i; for( i=1;ma[x-i][y]=='#';i++){ if(ma[x-i][y+1...

2013-05-02 21:46:42

阅读数:404

评论数:0

hdu 2141

# include # include int cmp(const void * a,const void * b) { return *(int *)a-*(int *)b; } int a[500],b[500],c[500]; int f[250000]; int tot[3]; in...

2013-05-02 16:29:36

阅读数:382

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭