3 solutions

  • 2
    @ 2024-12-29 16:01:27
    #include<bits/stdc++.h>
    using namespace std;
    const int N=10010; 
    int a[N]; 
    int main()
    {
    	int n;
    	cin>>n;
    	int maxv=0;
    	for(int i=1;i<=n;i++)
    	{
    		int x;
    		cin>>x;
    		a[x]++;
    		if(x>maxv)
    		{
    			maxv=x;
    		}
    	}
    	for(int i=0;i<=maxv;i++)
    	{
    		cout<<a[i]<<endl;
    	}
    	return 0;
    }
    • 2
      @ 2024-5-5 11:51:57
      #include<bits/stdc++.h>
      using namespace std;
      const int N=10010; 
      int a[N]; //a[i]=x;表示i出现了x次 
      int main()
      {
      	int n;
      	cin>>n;
      	int maxv=0;
      	for(int i=1;i<=n;i++)
      	{
      		int x;
      		cin>>x;
      		a[x]++;
      		if(x>maxv)
      		{
      			maxv=x;
      		}
      	}
      	for(int i=0;i<=maxv;i++)
      	{
      		cout<<a[i]<<endl;
      	}
      	return 0;
      }
      
      • 0
        @ 2025-2-23 10:18:25
        #include<bits/stdc++.h>
        using namespace std;
        const int N=100010;
        int a[N];
        int main()
        {
        	int n;
        	cin>>n;
        	int d;
        	for(int i=1;i<=n;i++)
        	{
        		cin>>a[i];
        		if(i==1||a[i]>d)
        		{
        			d=a[i];
        		}
        	}
        	for(int z=0;z<=d;z++)
        	{
        		int cnt=0;
        		for(int i=1;i<=n;i++)
        		{
        			if(z==a[i])
        			{
        				cnt++;	
        			}	
        		}	
        		cout<<cnt<<endl; 
        	} 
        	return 0;
        }
        
        
        • 1

        Information

        ID
        898
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        76
        Accepted
        38
        Uploaded By