杭电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 = ;
         if(x==&&y==){break;}
         for(i=x;i<=y;i++){
             a = i*i+i+;
             for(j=;j<a/;j++){
                 if(a%j==){flag++;break;}
             }
             if(flag!=){break;}
         }
         if(flag==){printf("OK\n");}
         else{printf("Sorry\n");}
     }
 }

2013  蟠桃记

 #include <stdio.h>

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

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

 #include <stdio.h>

 int main(){
     int arr[];
     int n,i,j,k,temp;
     double sum,p;
     while(scanf("%d",&n)!=EOF){
         sum = ;
         for(i=;i<n;i++){
             scanf("%d",&arr[i]);
         }

         for(i=;i<n-;i++){
             for(j=;j<n--i;j++){
                 if(arr[j]>arr[j+]){
                     temp = arr[j];
                     arr[j] = arr[j+];
                     arr[j+] = temp;
                 }
             }
         }

         for(k=;k<n-;k++){sum += arr[k];}
         p = sum/(n-);
         printf("%.2lf\n",p);
     }
 }

2015  偶数求和

 #include <stdio.h>

 int main(){
     int n,m,i,j,a,count,sum;
     int s[],c[];
     while(scanf("%d %d",&n,&m)!=EOF){
         a = ;
         count = ;
         for(i=;i<=n;i++){a += ;s[i] = a;}
         for(i=;i<=n;i++){
             if(i%m==){
                 sum = ;
                 for(j=i-m+;j<=i;j++){sum += s[j];}
                 c[count] = sum/m;
                 count++;
             }
             if(i==n&&i%m!=){
                 sum = ;
                 for(j=i-(n%m)+;j<=i;j++){sum += s[j];}
                 c[count] = sum/(n%m);
                 count++;
             }
         }
         for(i=;i<count;i++){
             if(i==count-){printf("%d\n",c[i]);}
             else{printf("%d ",c[i]);}
         }
     }
 }

2016  数据的交换输出

 #include <stdio.h>

 int main(){
     int s[];
     int n,i,flag,temp,a;
     while(scanf("%d",&n)!=EOF){
         if(n==){break;}
         for(i=;i<n;i++){
             scanf("%d", &s[i]);
         }
         temp = ;
         for(i=;i<n;i++){
             if(temp>s[i]){flag=i;temp = s[i];}
         }
         a = s[];
         s[] = s[flag];
         s[flag] = a;
         for(i=;i<n;i++){
             if(i==n-){printf("%d\n", s[i]);}
             else{printf("%d ",s[i]);}
         }
     }
 }

2017  字符串统计

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

 int main(){
     char s[];
     int n,len,i,count;
     while(scanf("%d", &n)!=EOF){
         getchar();
         while(n--){
             count = ;

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

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

     }
 }

2018  母牛的故事

 #include <stdio.h>

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

2019  数列有序!

 #include <stdio.h>

 int main(){
     int s[],c[];
     int n,x,i,j;
     while(scanf("%d %d",&n,&x)!=EOF){
         if(n==&&x==){break;}
         for(i=;i<n;i++){scanf("%d", &s[i]);}
         for(i=;i<n;i++){
             c[i] = s[i];
             if(s[i]<=x&&x<=s[i+]){
                 c[i+] = x;
                 for(j=i+;j<n+;j++){c[j]=s[j-];}
                 break;

             }
         }
         for(i=;i<n+;i++){
             if(i==n){printf("%d\n",c[i]);}
             else{printf("%d ",c[i]);}
         }
     }
 }

2020  绝对值排序

 #include <stdio.h>
 int ab(int a){
     if(a<){a=-a;}
     return a;
 }

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

2021  发工资咯：）

 #include <stdio.h>

 int main(){
     int s[];
     int n,i,sum,temp,count;
     while(scanf("%d",&n)!=EOF){
         if(n==){break;}
         count = ;
         for(i=;i<n;i++){scanf("%d",&s[i]);}
         for(i=;i<n;i++){
             sum = ;
             if(s[i]/!=){sum += s[i]/;}
             if((s[i]%)/!=){sum += (s[i]%)/;}
             if(s[i]%%/!=){sum += s[i]%%/;}
             if(s[i]%%%/!=){sum += s[i]%%%/;}
             if(s[i]%%%%/!=){sum += s[i]%%%%/;}
             sum += s[i]%%%%%;
             count += sum;
         }
         printf("%d\n",count);
     }
 }