杭电oj2031、2033、2070、2071、2075、2089、2090、2092、2096-2099

2031  进制转换

 #include<stdio.h>
 #include<string.h>

 int main(){
     int n,i,r,x,j,flag;
     int s[];
     while(scanf("%d %d",&n,&r)!=EOF){
         flag = ;
         if(n<){flag=-;n=-n;}
         i = ;
         while(n>){
             x = n%r;
             s[i] = x;
             i++;
             n = n/r;
         }
         if(flag==-){
             printf("-");
         }
         for(j=i-;j>=;j--){
             if(s[j]==){printf("A");}
             else if(s[j]==){printf("B");}
             else if(s[j]==){printf("C");}
             else if(s[j]==){printf("D");}
             else if(s[j]==){printf("E");}
             else if(s[j]==){printf("F");}
             else{printf("%d",s[j]);}
         }
         printf("\n");
     }
 }

2033  人见人爱A+B

 #include<stdio.h>
 #include<string.h>

 int main(){
     int n,AH,AM,AS,BH,BM,BS,SUMH,SUMM,SUMS;
     while(scanf("%d",&n)!=EOF){
         while(n--){
             scanf("%d %d %d %d %d %d",&AH,&AM,&AS,&BH,&BM,&BS);
             SUMS = AS + BS;
             SUMM = AM + BM;
             SUMH = AH + BH;
             if(SUMS>=){SUMM++;SUMS -= ;}
             if(SUMM>=){SUMH++;SUMM -= ;}
             printf("%d %d %d\n",SUMH,SUMM,SUMS);
         }
     }

 }

2070  Fibbonacci Number

 #include<stdio.h>
 #include<string.h>

 int main(){
     int i,j;
     _int64 a[];
     while(scanf("%d",&i)!=EOF){
         if(i==-){break;}
         a[]=;a[]=;
         for(j=;j<=i;j++){
             a[j] = a[j-] + a[j-];
         }
         printf("%I64d\n",a[i]);
     }

 }

2071  Max Num

 #include<stdio.h>
 #include<string.h>

 int main(){
     int n,m,i;
     double h[];
     while(scanf("%d",&n)!=EOF){
         while(n--){
             scanf("%d",&m);
             for(i=;i<=m;i++){
                 scanf("%lf",&h[i]);
             }
             h[] = ;
             for(i=;i<=m;i++){
                 if(h[]<h[i]){
                     h[]=h[i];
                 }
             }
             printf("%.2lf\n",h[]);

         }
     }
 }

2075  A|B?

 #include<stdio.h>

 int main(){
     _int64 a,b;
     int n;
     while(scanf("%d",&n)!=EOF){
         while(n--){
             scanf("%I64d %I64d",&a,&b);
             if(a%b==){printf("YES\n");}
             else{printf("NO\n");}
         }
     }
 }

2089  不要62

 #include<stdio.h>
 #include<string.h>
 #include<stdlib.h>

 int s[];
 int main(){
     int n,m,i,count;
     char stri[];
     for(i=;i<=;i++){
             itoa(i,stri,);
             if(strstr(stri,"")==NULL && strstr(stri,"")==NULL){s[i]=;}
             else{s[i]=;}
         }
     while(scanf("%d %d",&n,&m)!=EOF){
         if(n==&&m==){break;}
         count = ;

         for(i=n;i<=m;i++){count += s[i];}
         printf("%d\n",count);
     }

 }

这里有点坑，首先先要生成100000个数据的数组，提前判断是否是不吉利数，再输入后就直接查询，不然就会Time Limit Exceeded。

2090  算菜价

 #include<stdio.h>

 int main(){
     double n,p,sum=;
     char s[];
     while(scanf("%s %lf %lf",&s,&n,&p)!=EOF){

         sum += n*p;
     }
     printf("%.1lf\n",sum);
 }

2092  整数解

 #include<stdio.h>

 int main(){
     int n,m,a,k,flag;
     while(scanf("%d %d",&n,&m)!=EOF){
         flag=;
         if(n==&&m==){break;}
         if(m==){printf("Yes\n");}
         if(m<){k=-m;}else{k=m;}
         for(a=;a<=k/;a++){
             if(m%a== && (a+m/a==n || (-a)+m/(-a)==n)){printf("Yes\n");flag=;break;}
         }
         if(flag==){printf("No\n");}
     }
 }

2096  小明A+B

 #include<stdio.h>

 int main(){
     int n,a,b,sum;
     while(scanf("%d",&n)!=EOF){
         while(n--){
             scanf("%d %d",&a,&b);
             sum = a%+b%;
             if(sum>){sum %= ;}
             printf("%d\n",sum);
         }
     }
 }

2097  Sky数

 #include<stdio.h>

 int hex(int n){
     int sum=;
     while(n>){
         sum = sum + n%;
         n /= ;
     }
     sum = sum + n;
     return sum;
 }

 int dms(int n){
     int sum=;
     while(n>){
         sum = sum + n%;
         n /= ;
     }
     sum = sum + n;
     return sum;
 }

 int main(){
     int n,a,b,c,d,sum,sum1,sum2;
     while(~scanf("%d",&n)){
         if(n==){break;}
         a = n%;
         b = n/%;
         c = n/%;
         d = n/;
         sum = a+b+c+d;
         sum1 = hex(n);
         sum2 = dms(n);
         if(sum==sum1 && sum==sum2){printf("%d is a Sky Number.\n",n);}
         else{printf("%d is not a Sky Number.\n",n);}
     }
 }

2098  分拆素数和

 #include<stdio.h>
 #include<math.h>

 int ispn(int n){
     int i,flag=;
     for(i=;i<=n/;i++){
         if(n%i==){flag=;break;}
     }
     return flag;
 }

 int main(){
     int n,i,count;
     while(~scanf("%d",&n)){
         if(n==){break;}
         count = ;
         for(i=;i<n/;i++){
             if(ispn(i)== && ispn(n-i)==){count++;}
         }
         printf("%d\n",count);
     }
 }

2099  整除的尾数

 #include<stdio.h>
 #include<string.h>
 #include<stdlib.h>

 int main(){
     int a,b,i,j,len,k;
     char s[][],str[];
     while(~scanf("%d %d",&a,&b)){
         if(a==&&b==){break;}
         j=;
         for(i=a*;i<=a*+;i++){
             if(i%b==){
                 itoa(i,str,);
                 strcpy(s[j],str);
                 j++;
             }
         }
         for(i=;i<j;i++){
             k = atoi(s[i]);
             if(i==j-){
                 if(k%<){printf("0%d\n",k%);}
                 else{printf("%d\n",k%);}
             }else{
                 if(k%<){printf("0%d ",k%);}
                 else{printf("%d ",k%);}
             }
         }
     }
 }