题解

459 条题解

  • 0
    @ 2020-10-24 14:22:04

    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    int n,a[15],b,s=0;
    for(int i=1;i<=10;i++)
    {
    cin>>a[i];
    }
    cin>>b;
    for(int i=1;i<=10;i++)
    {
    if(a[i]<=b+30)
    {

    s++;
    }
    }
    cout<<s;
    return 0;
    }

  • 0
    @ 2020-07-22 11:36:33

    史上最通俗易懂,最暴力的代码:
    #include<iostream>
    using namespace std;
    int main(){
    int l,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,dl,ans;
    cin>>a1>>a2>>a3>>a4>>a5>>a6>>a7>>a8>>a9>>a10;
    cin>>l;
    dl=30;
    l=l+dl;
    if(l>=a1) ans++;
    else ans=ans;
    if(l>=a2) ans++;
    else ans=ans;
    if(l>=a3) ans++;
    else ans=ans;
    if(l>=a4) ans++;
    else ans=ans;
    if(l>=a5) ans++;
    else ans=ans;
    if(l>=a6) ans++;
    else ans=ans;
    if(l>=a7) ans++;
    else ans=ans;
    if(l>=a8) ans++;
    else ans=ans;

    if(l>=a9) ans++;
    else ans=ans;
    if(l>=a10) ans++;
    else ans=ans;
    cout<<ans<<endl;
    return 0;

    }

  • 0
    @ 2020-06-29 13:05:23
    #include<stdio.h>
    int main(){
        int a[10];//十个苹果的高度 
        int b;//手伸直能达到的最大高度
        int c=0;//摘到的苹果个数 
        for(int i=0;i<10;i++){
            scanf("%d",&a[i]);//输出十个苹果高度
        }
        scanf("%d",&b);//输出手伸直能达到的最大高度
        for(int n=0;n<10;n++){
            if(a[n]<=(b+30)){
                c++;
            }        
        }
        printf("%d",c);
        return 0;
    }
    
  • 0
    @ 2020-05-19 22:17:10

    题解不审核?

  • 0
    @ 2020-03-18 01:16:16

    大水题

    #include<iostream>
    using namespace std;
    
    int main() {
        
        int a[15], height, cnt = 0;
        for(int i = 0 ; i < 10 ; ++i) {
            cin >> a[i];
        }
        cin >> height;
        
        for(int i = 0 ; i < 10 ; ++i) {
            if(height + 30 >= a[i])
                cnt++; 
        }
        
        cout << cnt << endl;
        return 0;
    } 
    
  • 0
    @ 2020-03-01 11:59:43

    P党题解

    var
      a:array[1..10] of longint;
      i,m,s:longint;
    begin
      for i:=1 to 10 do read(a[i]);
      readln(m);
      for i:=1 to 10 do if m+30>=a[i] then inc(s);
      writeln(s);
    end.
    
  • 0
    @ 2020-02-21 13:14:23
    #include<iostream>
    using namespace std;
    int main()
    {
        int a[10000],n,i,cnt=0;
        int c[10+5];
        for(i=1;i<=10;i++)
        {
            cin>>a[i];
        }
        cin>>n;
        for(i=1;i<=10;i++)
        {
            if(a[i]<=n+30)
            {
                cnt++;
            }
        }
        cout<<cnt;
        return 0;
    }
    
  • 0
    @ 2020-02-09 10:43:44

    #include "cstdio"
    int a[10];
    int main(){
    int n,i,s=0;
    for(i=0;i<10;i++)scanf("%d",&a[i]);
    scanf("%d",&n);
    for(i=0;i<10;i++){
    if(a[i]<=30+n)s++;
    }
    printf("%d",s);
    return 0;
    }

  • 0

    很长很长,if套if

    #include<cstdio>
    #include<cmath>
    #include<algorithm>
    #include<cstring>
    #include<iostream>
    using namespace std;
    int main () {
        int a, b, c, d, e, f, g, h, i, j, o, tmp = 0, m;
        scanf("%d %d %d %d %d %d %d %d %d %d\n%d", &a, &b, &c, &d, &e, &f, &g, &h, &i, &j, &o);
        m = o + 30;
        if (100 <= a && a <= 200 && 100 <= o && o <= 120) {
            if (100 <= b && b <= 200) {
                if (100 <= c && c <= 200) {
                    if (100 <= d && d <= 200) {
                        if (100 <= e && e <= 200) {
                            if (100 <= f && f <= 200) {
                                if (100 <= g && g <= 200) {
                                    if (100 <= h && h <= 200) {
                                        if (100 <= i && i <= 200) {
                                            if (100 <= j && j <= 200) {
                                                if (m >= a) tmp++;
                                                if (m >= b) tmp++;
                                                if (m >= c) tmp++;
                                                if (m >= d) tmp++;
                                                if (m >= e) tmp++;
                                                if (m >= f) tmp++;
                                                if (m >= g) tmp++;
                                                if (m >= h) tmp++;
                                                if (m >= i) tmp++;
                                                if (m >= j) tmp++;
                                         } else {
                                                tmp = 0;
                                            }
                                        } else {
                                            tmp = 0;
                                        }
                                    } else {
                                        tmp = 0;
                                    }
                                } else {
                                    tmp = 0;
                                }
                            } else {
                                tmp = 0;
                            }
                        } else {
                            tmp = 0;
                        }
                    } else {
                        tmp = 0;
                    }
                } else {
                    tmp = 0;
                }
            } else {
                tmp = 0;
            }
        } else {
            tmp = 0;
        }
        printf("%d", tmp);
        return 0;
    }
    
  • 0
    @ 2019-10-05 17:39:53
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int high=0,a[10001],n=0;
        for(int i=1;i<=10;i++)
            cin>>a[i];
        cin>>high;
        for(int i=1;i<=10;i++)
            if(a[i]<=(high+30))
                n++;
        cout<<n<<endl;
        return 0;
    }
    
  • 0
    @ 2019-10-05 17:39:53
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int high=0,a[10001],n=0;
        for(int i=1;i<=10;i++)
            cin>>a[i];
        cin>>high;
        for(int i=1;i<=10;i++)
            if(a[i]<=(high+30))
                n++;
        cout<<n<<endl;
        return 0;
    }
    
  • 0
    @ 2019-10-05 17:39:31
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int high=0,a[10001],n=0;
        for(int i=1;i<=10;i++)
            cin>>a[i];
        cin>>high;
        for(int i=1;i<=10;i++)
            if(a[i]<=(high+30))
                n++;
        cout<<n<<endl;
        return 0;
    }
    
  • 0
    @ 2019-08-19 15:21:16

    这道题Chinaの各大OJ上都有~~吧~~

    不解释,上代码:

    #include <bits/stdc++.h>
    #define maxn 11
    #define ri register int
    using namespace std;
    int read()
    {
        int r=0, f=1;
        char c=getchar();
        while((c<'0'||c>'9')&&c!='-')
            c=getchar();
        if(c=='-')
            f=-1,c=getchar();
        while(c<='9'&&c>='0')
            r=r*10+c-'0',c=getchar();
        return r*f;
    }
    int a[maxn], m, ans; 
    int main()
    {
        for(ri i=1; i<maxn; i++)
            a[i]=read();
        m=read();
        for(ri i=1; i<maxn; i++)
            if(m+30>=a[i])
                ans++;
        printf("%d", ans);
        return 0;
    }
    
  • 0
    @ 2019-06-17 15:59:15

    #include <iostream>
    using namespace std;
    int main(void)
    {
    int apple[10];
    int i=0,hand;
    int num=0;
    while(i<10){
    cin>>apple[i];
    ++i;
    }
    cin>>hand;
    hand+=30;
    i=0;
    while(i<10){
    if(hand>=apple[i])++num;
    ++i;
    }
    cout<<num;
    return 0;
    }

  • 0
    @ 2019-05-17 13:22:51

    #include<cstdio>
    #include<iostream>
    using namespace std;

    int a[20];
    int n,m;

    int main()
    {

    for(int i=1;i<=10;i++)
    cin>>a[i];
    cin>>n;

    for(int i=1;i<=10;i++)

    {
    if((n+30)>=a[i])//判断
    m++;
    }
    cout<<m;
    return 0;
    }

  • 0
    #include <iostream>
    using namespace std;
    int height[20],H,s;
    int main()
    {
        for(int i=0;i<10;i++)cin >> height[i];
        cin >> H;
        H += 30;
        for(int i=0;i<10;i++)s+=!(H<height[i]);
        cout << s;
    }
    
  • 0
    #include <iostream>
    using namespace std;
    int height[20],H,s;
    int main()
    {
        for(int i=0;i<10;i++)cin >> height[i];
        cin >> H;
        H += 30;
        for(int i=0;i<10;i++)s+=!(H<height[i]);
        cout << s;
    }
    
  • 0
    #include <iostream>
    using namespace std;
    int height[20],H,s;
    int main()
    {
        for(int i=0;i<10;i++)cin >> height[i];
        cin >> H;
        H += 30;
        for(int i=0;i<10;i++)s+=!(H<height[i]);
        cout << s;
    }
    
  • 0
    #include <iostream>
    using namespace std;
    int height[20],H,s;
    int main()
    {
        for(int i=0;i<10;i++)cin >> height[i];
        cin >> H;
        H += 30;
        for(int i=0;i<10;i++)s+=!(H<height[i]);
        cout << s;
    }
    
  • 0
    @ 2018-11-10 09:48:32

    简单的一批
    #include<bits/stdc++.h>
    using namespace std;
    int a[11];
    int main(){
    int n,count=0;
    for(int i=1;i<=10;i++)scanf("%d",&a[i]);
    scanf("%d",&n);n+=30;
    for(int i=1;i<=10;i++)if(n>=a[i])count++;
    printf("%d",count);
    return 0;
    }

信息

ID
1102
难度
3
分类
模拟 点击显示
标签
递交数
16810
已通过
8843
通过率
53%
被复制
67
上传者