2017年江西理工大学C语言程序设计竞赛(初级组)

问题 A: Petr的盒子(初)

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[100005];
int main(){
    int n , x;
    scanf("%d",&n);
    for(int i = 0 ; i < n ; i ++){
        scanf("%d",&x);
        a[i] = 1;
        a[i] *= x;
    }
    for(int i = 0 ; i < n ; i ++){
        scanf("%d",&x);
        a[i] *= x;
    }
    for(int i = 0 ; i < n ; i ++){
        scanf("%d",&x);
        a[i] *= x;
    }
    sort(a , a + n);
    for(int i = n - 1 ; i >= 0 ; i --){
        printf("%d",a[i]);
        if(i != 0) printf(" ");
        else printf("\n");
    }
}

#include <stdio.h>

int main( )
{
    int i,n,j,t;
    scanf("%d",&n);
    int x[10];
    int y[10];
    int z[10];
    int V[10];
    
    for(i=0;i<n;i++)
    {scanf("%d",&x[i]);}    
    for(i=0;i<n;i++)
    {scanf("%d",&y[i]);}
    for(i=0;i<n;i++)
    {scanf("%d",&z[i]);}
    
    for(i=0;i<n;i++)
    
    {V[i]=x[i]*y[i]*z[i];}
    
    for(i=0;i<n-1;i++)
    
    for(j=i+1;j<n;j++)
    if(V[i]<V[j])
    {t=V[i],V[i]=V[j],V[j]=t;}
     
    for(i=0;i<n;i++)
    
    printf("%3d",V[i]);
    return 0;
}

#include<stdio.h>

int main()
{
    int t,n,a[10],i,j,b[10],c[10],d[10];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d ",&a[i]);
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&b[i]);
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&c[i]);
    }
    for(i=0;i<n;i++)
    {
        d[i]=a[i]*b[i]*c[i];    
    }
    for(i=0;i<n-1;i++)
        for(j=0;j<n-1;j++)
        {
            if(d[j]<d[j+1])
            {
                t = d[j];
                d[j] = d[j+1];
                d[j+1] = t;
            }
        }
        for(i=0;i<n;i++)
            printf("%d ",d[i]);
    return 0;
}

问题 B: 初级魔法师（初）

#include <iostream>
using namespace std;
int main(){
    int n, m, sum = 0;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= m; ++i){
        sum += (n%i);
    }
    printf("%d\n", sum);
    return 0;  
}

#include<stdio.h>
#define N 1000000000
long int main()
{
    long int n,m,i,a=0,s;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
        a=a+n%i;
    s=a%(N+7);
    printf("%d\n",s);
    return 0;
}    

 

问题 C: Just wanna a bubble of fishes.（初 ）

#include <iostream>
using namespace std;
int main(){
    double sum = 0, x, num;
    scanf("%lf", &num);
    sum = num;
    for(int i = 1; i < 5; ++i){
        scanf("%lf", &x);
        sum += x;
    }
    x = sum / 5.0;
    printf("%s\n", x < num ? "no" : "yes");
    return 0;
}

#include <stdio.h>
int main()
{
   float a[5],ave=0;
   int i;
   for(i=0;i<5;i++)
   {
   scanf("%f",&a[i]);
   ave=ave+a[i];
   }
   ave=ave/5;

   if(ave<=a[0]) printf("no");
   else printf("yes");

   return 0;
   }

问题D: Paginationaried

#include <stdio.h>
int main(int argc, char *argv[])
{
  int i,n,m;
  scanf("%d%d",&n,&m);
  if(n>5&&m<n-2&&m>2){
      printf("%d %d %d(+) %d %d",m-2,m-1,m,m+1,m+2);
      
  }
  else if(n>=5&&m>=n-2){
      for(i=n-4;i<=n;i++)
      {
          if(i==m)printf("%d(+) ",i);
          if(i!=m)printf("%d ",i);
      }
  }
  else if(n>=5&&m<=2){
      for(i=1;i<=5;i++)
      {
          if(i==m)printf("%d(+) ",i);
          if(i!=m)printf("%d ",i);
          
      }
  }
  else if(n<5){
      for(i=1;i<=n;i++){
          if(i==m)printf("%d(+) ",i);
          if(i!=m)printf("%d ",i);
      }
  }
    return 0;
}

 

问题 E: 喵喵大战猪猪侠（初）

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

using namespace std;

int main()
{
    int n;
    scanf("%d", &n);
    int* miao = (int*)malloc(sizeof(int) * n);
    int* zhu = (int*)malloc(sizeof(int) * n);
    for (int i = 0; i < n; i++) scanf("%d", miao + i);
    for (int i = 0; i < n; i++) scanf("%d", zhu + i);
    sort(miao, miao + n);
    sort(zhu, zhu + n);
    int left = 0;
    int right = n - 1;
    int win_cnt = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        if (miao[right] > zhu[i])
        {
            // printf(" win: %d %d\n", miao[right], zhu[i]);
            win_cnt++;
            right--;
        }
        else
        {
            // printf("lose: %d %d\n", miao[left], zhu[i]);
            left++;
        }
    }
    printf("%d\n", win_cnt);
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
int miao[1000006],zhu[1000006];
int n;
int main(){
    std::ios::sync_with_stdio(false);
    cin >> n;
    for(int i= 0; i < n; i++){
        cin >> miao[i];
    }
    for(int i = 0; i < n; i++){
        cin >> zhu[i] ;
    }
    sort(miao,miao + n);
    sort(zhu,zhu + n);
    int ans = 0 ,p = -1;
    int j = n - 1;
    for(int i = n - 1; i >= 0; i--){
        if (miao[j] > zhu[i] && j != p){
            ans ++;
            j --;
        }else{
            p ++;

        }
    }
    cout << ans << endl;
    return 0;
}

 

问题 F: 美丽的二进制字符串（初）

#include <stdio.h>
#include <iostream>
using namespace std;
int main(){
    string s;
    cin >> s;
    int ans = 0 ;
    for(int i = 1 ; i < s.size() - 1; i ++){
        if(s[i] == '1' && s[i - 1] == '0' && s[i + 1] == '0'){
            ans ++;
            s[i + 1] = '1';
        }
    }
    printf("%d\n",ans);
}

 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author hsy
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            String s = in.next();
            char[] str = s.toCharArray();
            int h = 0;
            for (int i = 0; i < s.length() - 2; i++) {
                if (str[i] == '0' && str[i + 1] == '1' && str[i + 2] == '0') {
                    h++;
                    str[i + 2] = '1';
                }
            }
            out.println(h);
        }

    }
}

print raw_input().count('010')