5 solutions

  • 0
    @ 2025-7-6 14:40:16

    #include using namespace std; int main() { int a[10]; cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9]; int s,y=0; cin>>s; if(30+s>=a[0])y++; if(30+s>=a[1])y++; if(30+s>=a[2])y++; if(30+s>=a[3])y++; if(30+s>=a[4])y++; if(30+s>=a[5])y++; if(30+s>=a[6])y++; if(30+s>=a[7])y++; if(30+s>=a[8])y++; if(30+s>=a[9])y++; cout<<y; return 0; }

    • 0
      @ 2024-11-3 15:53:05
      c++
      #include<bits/stdc++.h>
      using namespace std;
      int a[20];
      int main()
      {
      	int h,c=0,n=10;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>a[i];
      	}
      	cin>>h;
      	h+=30;
      	for(int i=1;i<=n;i++)
      	{
      		if(h>=a[i])
      		{
      			c++;
      		}
      	}
      	cout<<c;
      	return 0;
      }
      
      
      • -1
        @ 2024-7-13 11:08:53
        #include<bits/stdc++.h>
        using namespace std;
        int a[20];
        int main()
        {
        	int h,c=0,n=10;
        	for(int i=1;i<=n;i++)
        	{
        		cin>>a[i];
        	}
        	cin>>h;
        	h+=30;
        	for(int i=1;i<=n;i++)
        	{
        		if(h>=a[i])
        		{
        			c++;
        		}
        	}
        	cout<<c;
        	return 0;
        }
        
        • -3
          @ 2024-11-3 9:34:13
          #include<bits/stdc++.h>
          using namespace std;
          int a[15];
          int main(){
          	int gao,shu=0,pingguo=10;
          	for(int i=1;i<=n;i++){
          		cin>>a[i];//输入每个苹果的高度 
          	}
          	cin>>gao;
          	gao+=30;
          	for(int i=1;i<=n;i++){
          		if(gao>=a[i]){
          			cnt++;//摘得苹果的个数 
          		}
          	}
          	cout<<shu;
          	return 0;
          }
          
          
          • -4
            @ 2024-7-13 11:09:10

            👍 👍 👍 👍 👍

            • 1

            Information

            ID
            892
            Time
            1000ms
            Memory
            256MiB
            Difficulty
            1
            Tags
            (None)
            # Submissions
            157
            Accepted
            56
            Uploaded By