1 solutions

  • 0
    @ 2025-3-3 16:25:49

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    long long n,a[1055][1055];
    bool f[10000];
    int main(){
        memset(f,true,sizeof(f));
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                cin>>a[i][j];
            }
        }
        long long p=0;
        while(p<n-1)
        {
            for(int i=1;i<=n;i++)
        {
            if(f[i]==true)
            {
                long long s=INT_MAX/2,ss;
                for(int j=1;j<=n;j++)
                {
                    if(a[i][j]<s&&f[j]==true&&i!=j)
                    {
                        s=a[i][j];
                        ss=j;
                    }
                }
                f[ss]=false;
                p++;
            }
        }
        }
         
        for(int i=1;i<=n;i++)
        {
            if(f[i]==true)
            {
            cout<<i;
                exit(0);
             } 
             
        }
        return 0;
    }
    
    
    • 1

    Information

    ID
    10099
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By