andy的专栏

#include#includeint main(){ int n,count,flag; while(scanf("%d",&n)&&n){ count = 0; flag = 0; while(n){ flag = n % 2; if(flag) break; count++; n /= 2; } printf("%d\n",(int)pow

#include#includeint main(){ struct string{ char ch[80]; struct string *next; } *p,*head,*tail; int n,i,num; scanf("%d",&n); num = n; head = tail = NULL; while(n--){ p = (struct string

//要点 log()自然对数，#include#includeint main(){ int a,b; int year,n,m,i; i = 1; while(1){ scanf("%d%d",&a,&b); if(a == 0&&b == 0) break; else{ year = -5730*log10(b*1.0/(a*810))/log10(2);

#include#includeint main(){ int *p,n,average,count,i,sum,m; m = 1; while(1){ scanf("%d",&n); if(n == 0) break; p = (int *)malloc(n*sizeof(int)); for(i = 0,sum

#includeint main(){ long a[2][2],x,y; while(scanf("%ld%ld",&x,&y)&&(x||y)){ a[0][0] = x; a[0][1] = x; a[1][0] = y; a[1][1] = y; while(scanf("%ld%ld",&x,&y)&&(x||y)){ if(x>a[0][1]) a[0

#include#includeint main(){ int times,n,*p,i,count; double aver; scanf("%d",×); while(times--){ scanf("%d",&n); p = (int *)malloc(n*sizeof(int)); aver = 0; for(i = 0;i<n;i++){ scanf(

#includeint main(){ int a[3][2]; int i,sum,win,lose; while(1){ scanf("%d%d",&a[0][0],&a[0][1]); if(a[0][0]==0&&a[0][1]==0) break; win = a[0][0]; lose = a[0][1]; for(i = 1;i<3;i++){

#include#include#includeint prime(int a,int b){ int i; for(i = 2;i<=b;i++) if(a % i == 0 && b % i == 0) return 0; return 1;}int main(){ int n,i,j,sum; double pi; int *p; while(scanf

#includeint main(){ int b,c,n,flag; double a; while(scanf("%lf%d%d",&a,&b,&c)&&b){ flag = 0; if(a=150&&c>=200) {printf("Wide Receiver"); flag = 1; } if(a=300&&c>=500){ if(flag)

//#includeint main(){ int n,sec,flr,now; while(scanf("%d",&n)&&n){ sec = 0; now = 0; while(n--){ scanf("%d",&flr); if(flr - now > 0) sec += (flr - now)*6 + 5; if(flr - now < 0) sec

//要遍历1到n-1#include#include#include#includeint main(){ int n,x,y,flag,num,*p,i; while(scanf("%d",&n)!=EOF){ flag = 0; p = (int *)malloc(sizeof(int)*n); memset(p,0,n*sizeof(int)); num

//字符 #include#include#includeint main(){ double mile,sum; char code,city1[80],city2[80]; while(1){ sum = 0; while(scanf("%s",city1)){ if(strcmp(city1,"#") == 0) return 0; if(strcmp

#includeint main(){ int time,n,i; scanf("%d",&time); while(time--){ scanf("%d",&n); i = 0; while(n != 0){ if(n % 2 ) { printf("%d",i); if(n / 2) printf(" "); else p

#include#includeint main(){ int n,*p,i,sum; while(1){ scanf("%d",&n); if(n == 0) break; p = (int *)malloc(n*sizeof(int)); sum = 0; for(i = 0;i<n;i++){ scanf("%d",&p[i]);

#include int main(){ long a,b,c,d; for(a = 4;a<= 200;a++) for (b = 2;b<= 199;b++) for(c = b+1;c<=199;c++) for(d = c+1;d<=199;d++) if(a*a*a < b*b*b + c*c*c + d*d*d) break; else

#include#includeint main(){ int i,j,flag,n,times,num; char str[15][26]; char ch[26]; times = 1; while(scanf("%d",&n)&&n){ flag = 0; i = 0; j = n - 1; num = n; while(n--){ scanf("%

//可以看成 #includeint main(){ int n,time,i,num; long count; scanf("%d",&time); while(time--){ scanf("%d",&n); i = 1; num = n; count = 0; while(n > 3){ count = count + (i < (n - 2) ? i

#includeint main(){ int n,d,u,min,mile; while(1){ scanf("%d%d%d",&n,&u,&d); if(n== 0) break; mile = 0; min = 0; while(n>mile){ mile += u; min++; if(mile>=n) break; else{

以20进制相加#include#include#includeint main(){ int op1[100]; int op2[100]; char result[102]; char str[101]; int carriage; int i,len1,len2,a,b,sum,j,k; while(scanf("%s",str)!=EOF) { len1

#include#include#includeint main(){ int n,i,*p; double x,y,distance,r; scanf("%d",&n); p = (int*)malloc(sizeof(int)*n); for(i = 0;i<n;i++) { scanf("%lf %lf",&x,&y); dis

#include#includeint main(){ int n,len,num,ant,lf,rt,max; double mid,md; scanf("%d",&n); while(n--){ scanf("%d%d",&len,&num); mid = len*1.0/2; md = len; lf = len; rt = 0; while(num--)

// #includeint main(){ int n,count1,light,flag,i,count2; while(scanf("%d",&n) != EOF){ count1 = 0; count2 = 0; i = 1; while(n--){ scanf("%d",&light); if(light == 0 && i % 2||light =

#include#includeint main(){ int x,y,z; double mile; char str[20]; while(10){ scanf("%s",str); if(strcmp(str,"ENDOFINPUT") == 0) break; scanf("%d%d%d",&x,&y,&z); scanf("%s",str); z = z

//因为每个点只能是一条新路的起点#include#include#includeint main(){ int times,n,before,len,i,count,j,temp,q0,q1,q2,m0,m1,m2; int *p; scanf("%d",×); while(times--){ scanf("%d",&n); p = (int *)malloc(sizeof

#includeint reserve(int a){ int result = 0; while(a){ result = result*10 + a % 10; a /= 10; } return result;}int main(){ int times,a,b; scanf("%d",×); while(times--){ scanf("%d%d",&a,

#include#include#includeint main(){ int i,n; long num; while(scanf("%d",&n) != EOF){ i = 1; num = 1; while(num % n != 0){ i++; num = (num % n)*10 + 1; } printf("%d\n",i); } re

#include#include#define PI 3.1415926int main(){ int d,v; while(scanf("%d%d",&d,&v) &&d&&v){ printf("%.3lf\n",pow(d*d*d- 6*v/PI,1.0/3.0)); } return 0;}盗图一张

#includeint main(){ int i; long rev; double sec,dia,dis; i = 1; while(1){ scanf("%lf%ld%lf",&dia,&rev,&sec); if(rev == 0) break; dis = dia *rev * 3.1415927 /(12 *5280); sec = sec /(60*

#includeint main(){ int num[15]; int i,n,dou,j; while(1){ scanf("%d",&n); if(n == -1) break; i = 0; num[i] = n; dou = 0; while(scanf("%d",&n)&&n){ for(j = 0;j<=i;j++) if(n == 2

#includeint main(){ int n,time,p,o,i; scanf("%d",&time); while(time--){ o = 0; scanf("%d",&n); while(n%2==0){ o++; n = n /2; } printf("%d %d\n",n,o); } return 0;}

//关键点推导出公式，啊【】#include#include#include int main(){ double card(int n); int n; struct num { double result; int order; struct num *next; } *p,*head,*tail; head = tail = NULL; while(sc

#includeint main(){ int sp,n,tm,mile,tmp; while(scanf("%d",&n)&&n>=0){ mile = 0; tmp = 0; while(n--){ scanf("%d%d",&sp,&tm); mile += sp*(tm - tmp); tmp = tm; } printf("%d miles\

#include#includeint main(){ int time,n,i,j,sum; int *p; scanf("%d",&time); while(time--){ scanf("%d",&n); p = (int *)malloc(sizeof(int)*n); for(i = 0;i<n;i++) p[i] =

#includeint main(){int a,b; while(scanf("%d %d",&a,&b) !=EOF) { printf("%d\n",a + b); }return 0;}

//a、b如果有一个为偶数则可以不走斜线，若同时为奇则必走一斜线#include#includeint main(){ int n,i,a,b; double *p; scanf("%d",&n); p = (double *)malloc(sizeof(double)*n); for(i = 0;i<n;i++) { scanf("%d %d",&a,&b);

#include#includeint main(){ char str[8]; int before,after,result,i,num; while(scanf("%s%d%d",str,&before,&after) != EOF) { result = 0; for(i = 0;str[i]!='\0';i++){ if(str[i]>='0

#includeint jud(int n,int d){ int sum; sum = 0; while(n){ sum += n % d; n /= d; }return sum;}int main(){ int i; for(i = 2992;i<10000;i++) if(jud(i,10)==jud(i,12)&&jud(i,10) == jud(i,16

用qsort过不了，sort就过了不知道为什么#include#include #include#include using namespace std;struct fm{ int j,f; double jperf;} cat[1010];bool cmp( struct fm a,struct fm b ) { return a.jperf>b.jpe