openjudge1.6 题目合集（01~07）

01-与指定数字相同的数的个数

#include<stdio.h>
#define N 100
int main()
{
    int n,a[N],i,m,sum=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
    scanf("%d",&m);
    for(i=0;i<n;i++)
        if(m==a[i])
            sum++;
    printf("%d\n",sum);
}

02-陶陶摘苹果

#include<iostream>
using namespace std ;
int main()
{
int a[100];
int i;
for(i=1;i<=10;i++)
{
cin>>a[i];
}
int j,n;
cin>>j;
n=j+30;
int count=0;
for(i=1;i<=10;i++)
if(a[i]<=(n))
count++;
cout<<count<<endl;
return 0;
}

03-计算书费

#include<stdio.h>
 int main()
 {
     int a[11]={0};
     float c=0;
     for(int i=1;i<=10;i++)
         scanf("%d",&a[i]);
     c=28.9*a[1]+32.7*a[2]+45.6*a[3]+78*a[4]+35*a[5]+86.2*a[6]+27.8*a[7]+43*a[8]+56*a[9]+65*a[10];        
     printf("%.1f\n",c);
     return 0;
 }

04-数组逆序重放

#include <iostream>
using namespace std;

int main()
{
    int n, a[100];
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    while(n--)
    {
        cout << a[n];
        if (n > 0)
        {
            cout << " ";
        }
    }
    return 0;
}

05-年龄与疾病

#include<stdio.h>
int main() {
    double n=0;
    double a[10]={0},age[101]={0};
    double b[10]={0};
    scanf("%lf",&n);
    for (int i=1;i<=n;i++) {
        scanf("%lf",&age[i]);
    }
    for (int i=1;i<=n;i++) {
        if ((age[i]>=0)&&(age[i]<=18))
            a[1]++;
        else if ((age[i]>=19)&&(age[i]<=35))
            a[2]++;
        else if ((age[i]>=36)&&(age[i]<=60))
            a[3]++;
        else if (age[i]>=61)
            a[4]++;
        else continue;
    }
    for (int j=1;j<=4;j++) {
        b[j]=(a[j]/n)*100;
    }
    for (int j=1;j<=4;j++) {
        printf ("%.2lf%%\n",b[j]);
    }
    return 0;
}

06-校门外的树

#include<stdio.h>
int main(){
     int L,M;
     int ans=0;
     scanf("%d%d",&L,&M);
     int tree[L+1];
     for(int i=0;i<L+1;i++){
         tree[i]=1;
     }
    for(int i=0;i<M;i++){
         int a,b;
         scanf("%d %d",&a,&b);
         for(int j=a;j<=b;j++){
             tree[j] = 0;
         }
     }
     for(int i=0;i<L+1;i++){
         if(tree[i]){
             ans++;
         }
     }
     printf("%d",ans);
     return 0;
 }

 

07-有趣的跳跃

#include<cstdio>
#include<iostream>
using namespace std;
 int n,a,b,c;
 bool v[6000];
 int main(){
     scanf("%d%d",&n,&a);
     for(int i=1;i<n;i++){
        scanf("%d",&b);
         c=max(a-b,b-a);
         if(c>5000){printf("Not jolly\n");return 0;}
         if(v[c]){printf("Not jolly\n");return 0;}
         v[c]=1;a=b;
     }
     for(int i=1;i<n;i++) if(!v[i]){printf("Not jolly\n");return 0;}
     printf("Jolly\n");
     return 0;
 }