杭电oj2012-2021

2012  素数判定

#include <stdio.h>
#include <math.h>
 
int main()
{
    int x,y,i,j,a,flag;
    while(scanf("%d %d",&x,&y)!=EOF){
        flag = 0;
        if(x==0&&y==0){break;}
        for(i=x;i<=y;i++){
            a = i*i+i+41;
            for(j=2;j<a/2;j++){
                if(a%j==0){flag++;break;}
            }
            if(flag!=0){break;}
        }
        if(flag==0){printf("OK
");}
        else{printf("Sorry
");}
    }
}

2013  蟠桃记

#include <stdio.h>
 
int main()
{
    int n,sum;
    while(scanf("%d",&n)!=EOF){
        sum = 1;
        while(--n){
            sum = (sum+1)*2; 
        }
        printf("%d
",sum);
    }
}

2014  青年歌手大奖赛_评委会打分

#include <stdio.h>
 
int main(){
    int arr[101];
    int n,i,j,k,temp;
    double sum,p;
    while(scanf("%d",&n)!=EOF){
        sum = 0;
        for(i=0;i<n;i++){
            scanf("%d",&arr[i]);
        }
        
        for(i=0;i<n-1;i++){
            for(j=0;j<n-1-i;j++){
                if(arr[j]>arr[j+1]){
                    temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        
        for(k=1;k<n-1;k++){sum += arr[k];}
        p = sum/(n-2);
        printf("%.2lf
",p);
    }
}

2015  偶数求和

#include <stdio.h>
 
int main(){
    int n,m,i,j,a,count,sum;
    int s[101],c[101];
    while(scanf("%d %d",&n,&m)!=EOF){
        a = 0;
        count = 0;
        for(i=1;i<=n;i++){a += 2;s[i] = a;}
        for(i=1;i<=n;i++){
            if(i%m==0){
                sum = 0;
                for(j=i-m+1;j<=i;j++){sum += s[j];}
                c[count] = sum/m;
                count++;
            }
            if(i==n&&i%m!=0){
                sum = 0;
                for(j=i-(n%m)+1;j<=i;j++){sum += s[j];}
                c[count] = sum/(n%m);
                count++;
            }
        }
        for(i=0;i<count;i++){
            if(i==count-1){printf("%d
",c[i]);}
            else{printf("%d ",c[i]);}
        }
    }
}

2016  数据的交换输出

#include <stdio.h>
 
int main(){
    int s[101];
    int n,i,flag,temp,a;
    while(scanf("%d",&n)!=EOF){
        if(n==0){break;}
        for(i=0;i<n;i++){
            scanf("%d", &s[i]);
        }
        temp = 10000;
        for(i=0;i<n;i++){
            if(temp>s[i]){flag=i;temp = s[i];}
        }
        a = s[0];
        s[0] = s[flag];
        s[flag] = a;
        for(i=0;i<n;i++){
            if(i==n-1){printf("%d
", s[i]);}
            else{printf("%d ",s[i]);}
        }
    }
}

2017  字符串统计 

#include <stdio.h>
#include <string.h>
 
int main(){
    char s[10000];
    int n,len,i,count;
    while(scanf("%d", &n)!=EOF){
        getchar();
        while(n--){
            count = 0;

            gets(s);
            len = strlen(s);

            for(i=0;i<len;i++){
                if(s[i]>='0'&&s[i]<='9'){count++;}
            }
            printf("%d
",count);
        }
        
    }
}

2018  母牛的故事

#include <stdio.h>
 
int main(){
    int n,i;
    int s[55];
    while(scanf("%d",&n)!=EOF){
        if(n==0){break;}
        s[1]=1;s[2]=2;
        s[3]=3;s[4]=4;
        for(i=5;i<=n;i++){
            s[i] = s[i-1]+s[i-3];
        }
        printf("%d
",s[n]);
    }
}

2019  数列有序!

#include <stdio.h>
 
int main(){
    int s[101],c[101];
    int n,x,i,j;
    while(scanf("%d %d",&n,&x)!=EOF){
        if(n==0&&x==0){break;}
        for(i=0;i<n;i++){scanf("%d", &s[i]);}
        for(i=0;i<n;i++){
            c[i] = s[i];
            if(s[i]<=x&&x<=s[i+1]){
                c[i+1] = x;
                for(j=i+2;j<n+1;j++){c[j]=s[j-1];}
                break;
                
            }
        }
        for(i=0;i<n+1;i++){
            if(i==n){printf("%d
",c[i]);}
            else{printf("%d ",c[i]);}
        }
    }
}

2020  绝对值排序

#include <stdio.h>
int ab(int a){
    if(a<0){a=-a;}
    return a;
}
 
int main(){
    int n,i,j,temp;
    int s[101];
    while(scanf("%d",&n)!=EOF){
        if(n==0){break;}
        for(i=0;i<n;i++){scanf("%d", &s[i]);}
        for(i=0;i<n-1;i++){
            for(j=0;j<n-1-i;j++){
                if(ab(s[j]) < ab(s[j+1])){
                    temp = s[j];
                    s[j] = s[j+1];
                    s[j+1] = temp;
                }
            }
        }
        for(i=0;i<n;i++){
            if(i==n-1){printf("%d
",s[i]);}
            else{printf("%d ",s[i]);}
        }
    }
}

2021  发工资咯：）

#include <stdio.h>
 
int main(){
    int s[101];
    int n,i,sum,temp,count;
    while(scanf("%d",&n)!=EOF){
        if(n==0){break;}
        count = 0;
        for(i=0;i<n;i++){scanf("%d",&s[i]);}
        for(i=0;i<n;i++){
            sum = 0;
            if(s[i]/100!=0){sum += s[i]/100;}
            if((s[i]%100)/50!=0){sum += (s[i]%100)/50;}
            if(s[i]%100%50/10!=0){sum += s[i]%100%50/10;}
            if(s[i]%100%50%10/5!=0){sum += s[i]%100%50%10/5;}
            if(s[i]%100%50%10%5/2!=0){sum += s[i]%100%50%10%5/2;}
            sum += s[i]%100%50%10%5%2;
            count += sum;
        }
        printf("%d
",count);
    }
}