- 博客(7)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 hdu 2955
#include"stdio.h" #include"string.h" double min(double a,double b) { return a>b?b:a; } struct A{ int m;double p;}E[111];int flag[10005];double dp[11111];int main (){ int T,n,i,
2013-05-18 20:47:46
516
原创 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; int sum,max,s,e,s1; bool tag; while(scanf("%d",&n
2013-05-16 21:54:50
514
原创 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表示比求出sqrt（）来的快一些 return 1; else return 0;}int main (
2013-05-15 21:07:52
791
原创 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)); for(i=0;i<n;i++) scanf("%d",&a[i]); max=a[n-1];mark1=0;
2013-05-15 19:51:28
579
原创 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) { j=i; min=a[i]; } } return j;}in
2013-05-15 11:30:06
479
原创 hdu 4414
#include#includechar 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]=='#'||ma[x-i][y-1]=='#') return 0; a=i;
2013-05-02 21:46:42
582
原创 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];int main (){ int n; int i,j,k,flag; int count,a
2013-05-02 16:29:36
499
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人