杭电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[1000];
    while(scanf("%d %d",&n,&r)!=EOF){
        flag = 0;
        if(n<0){flag=-1;n=-n;}
        i = 0;
        while(n>0){
            x = n%r;
            s[i] = x;
            i++;
            n = n/r;
        }
        if(flag==-1){
            printf("-");
        }
        for(j=i-1;j>=0;j--){
            if(s[j]==10){printf("A");}
            else if(s[j]==11){printf("B");}
            else if(s[j]==12){printf("C");}
            else if(s[j]==13){printf("D");}
            else if(s[j]==14){printf("E");}
            else if(s[j]==15){printf("F");}
            else{printf("%d",s[j]);}
        }
        printf("
");
    }
}

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>=60){SUMM++;SUMS -= 60;}
            if(SUMM>=60){SUMH++;SUMM -= 60;}
            printf("%d %d %d
",SUMH,SUMM,SUMS);
        }
    }

}

2070  Fibbonacci Number

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

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

}

2071  Max Num

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

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

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==0){printf("YES
");}
            else{printf("NO
");}
        }
    }
}

2089  不要62

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

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

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

2090  算菜价

#include<stdio.h>


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

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

2092  整数解

#include<stdio.h>


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

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%100+b%100;
            if(sum>99){sum %= 100;}
            printf("%d
",sum);
        }
    }
}

2097  Sky数

#include<stdio.h>

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

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

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

2098  分拆素数和

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

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

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

2099  整除的尾数

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


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