3 条题解

  • 1
    @ 2025-5-18 15:15:41
    #include<bits/stdc++.h>
    using namespace std;
    int cmp(int a,int b)
    {
    	return a>b;
    }
    int a[100000];
    int main()
    {
    	int n,sum=1;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i];
    	}
    	sort(a+1,a+n+1,cmp);
    	for(int i=1;i<=n;i++)
    	{
    		cout<<a[i]<<" ";
    	}
    }
    
    • 0
      @ 2025-5-18 15:48:40
      # include <bits/stdc++.h> 
      
      using namespace std;
      const int N=1e5+1;
      int a[N],n;
      bool cmp(int x,int y){
          return x>y;
      }
      int main(){
      	cin>>n;
      	for(int i = 1;i<=n;i++){
      	    scanf("%d",&a[i]);		
      	}
      	sort(a+1,a+1+n,cmp);
      	for(int i = 1;i<=n;i++){
      	    printf("%d ",a[i]);	
      	}
      
      	return 0;
      }
      
      • 0
        @ 2025-5-18 15:43:26
        #include<iostream>
        #include<stdio.h>
        using namespace std;
        int main(){
        	int n, a[1000][1000], b[1000], c[1000], sum = 0, ans = 0,num=0,num2=0;
        	cin >> n; 
        	for(int i = 1; i <= n; i++){
        		for(int j = 1; j <= n; j++){
        			cin >> a[i][j];
        		}
        	}
        	for(int i=1;i<=n;i++)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			sum+=a[i][j];
        		}
        		if(sum%2==1)
        		{
        			b[num]=i;
        			num++;
        		}
        	}
        	for(int i=1;i<=n;i++)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			ans+=a[i][j];
        		}
        		if(ans%2==1)
        		{
        			c[num2]=i;
        			num2++;
        		}
        	}
        	if(num==1&&num2==1){
        		cout<<b[0]<<" "<<c[0];
        	}else if(num==0&&num2==0){
        		cout << "OK";
        	}else{
        		cout << "Corrupt";
        	}
        		
        }
        
      • 1

      信息

      ID
      1425
      时间
      1000ms
      内存
      128MiB
      难度
      7
      标签
      递交数
      70
      已通过
      15
      上传者