最新 最热

hdu1049

#include<stdio.h>int main(){ int n,u,d; while(scanf("%d%d%d",&n,&u,&d),n) { int t=(n-u)/(u-d); if(t*(u-d)<(n-u)) t++; t*=2...

2018-06-04
0

hdu1034

#include<stdio.h>const int MAXN=1000;int a[MAXN];int main(){ int n; int i; while(scanf("%d",&n),n) { for(i=0;i<n;i++) scanf("%d",&a[...

2018-06-04
0

hdu1035

#include<stdio.h>#include<string.h>int step,n,m;int a[1010][1010];char map[11][11];void DFS(int x,int y){ while(x>=0&&y>=0&&x<n&&y<m&&map[x][y]!=&#x27;O&#x27;)......

2018-06-04
0

hdu1038

#include <stdio.h> #define P 3.1415927 #define toFeet(x) x/12.0 #define toMiles(x) x/5280.0 int main(){ double diameter;//直径 int revolution...

2018-06-04
0

hdu1017

#include <stdio.h>int judge(int a, int b, int m){return (a*a+b*b+m)%(a*b)==0;}int count(int m, int n){int i,j,c;c=0;for(i=1;i<n;i++){for(j=i+1...

2018-06-04
0

hdu1018

#include <stdio.h>#include <math.h>int main(void){int t,n,i;double sum;scanf("%d", &t);while(t--){scanf("%d",&n);sum=0;for(i=2;i<=n;i++)...

2018-06-04
0

hdu1020

#include <stdio.h>int main(void){int n,i,c;char txt[10001];scanf("%d", &n);while(n--){scanf("%s",txt);i=0;while(txt[i++]){c=1;wh...

2018-06-04
0

hdu1021

#include <stdio.h>int fib(int m){int n_2=1,n_1=2,n,i;if(m==0)return 1;if(m==1)return 2;for

2018-06-04
1

hdu1004

//c//https://github.com/WEIZIBIN/acm/blob/master/hdu1004.c#include <stdio.h>#include <string.h>int main(){int i, n, j;char s[1005][15];int count[1005] =...

2018-06-04
0

hdu1005

//c//https://github.com/WEIZIBIN/acm/blob/master/hdu1005.c#include <stdio.h>int main(){int i, result, a, b, j;long n;int f[50] = {0};f[1] = 1;f[2] = 1;...

2018-06-04
1