5 solutions

  • 2
    @ 2024-1-27 11:57:05
    #include<bits/stdc++.h>
    using namespace std;
    int a[10];
    int cnt=0;
    int x;
    int main(){
    	for(int i=0;i<10;i++){
    		cin>>a[i];
    	}
    	cin>>x;
    	for(int i=0;i<10;i++){
    		if(x+30>=a[i]) cnt++;
    	}
    	cout<<cnt<<endl;
    	return 0;
    }
    
    • 2
      @ 2023-10-20 19:50:59
      #include <iostream>
      using namespace std;
      int main(){
      	int apple[10],a,x;
      	for(int i=0;i<10;i++) cin>>apple[i];
      	cin>>a;
      	for(int i=0;i<10;i++) if(apple[i]<=a+30) x++;
      	cout<<x;
      	return 0;
      }
      
      • 1
        @ 2023-10-3 12:40:43

        #include<bits/stdc++.h> #include using namespace std; int main(){ int n=10,extra_height,sum=0;//extra_height意为极限高度 const int N=n; int a[N]; for(int i=0;i<N;i++){ cin>>a[i]; } cin>>extra_height; for(int j=0;j<N;j++){ if(extra_height+30>=a[j]){ sum+=1; } else{ sum+=0; } } cout<<sum;

        return 0;
        

        }

        • 1
          @ 2023-10-3 10:55:40

          #include<bits/stdc++.h> using namespace std;

          int main(){ int a,s=0; int b[10]; for(int i=0;i<10;i++){ cin>>b[i]; } cin>>a; for(int i=0;i<10;i++){ if(b[i]<=a+30){ s++; } } cout<<s; }

          • -1
            @ 2023-8-27 18:30:45
            #include<iostream>
            using namespace std;
            int main(){
            	int apple[10],taotao_shengao,apples;
            	for(int i=0;i<10;i++)cin>>apple[i];
            	cin>>taotao_shengao;
            	for(int i=0;i<10;i++){
            		if(apple[i]<=taotao_shengao+30)apples++;
            	}
            	cout<<apples;
            }
            
          • 1

          Information

          ID
          589
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          # Submissions
          37
          Accepted
          27
          Uploaded By