3/29百度筆試 第二題代碼

3/29百度筆試 第二題代碼

#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;
using ll=long long;

int main(){
    int N;
    cin>>N;
    while(N--){
        int num;
        cin>>num;
        vector<int> store_array(num);
        for(int i=0;i<num;i++)
            cin>>store_array[i];
        if(num==1){
            if(store_array[0]%2)
                cout<<"man"<<endl;
            else {
                cout<<"woman"<<endl;
            }
            continue;
        }
        sort(store_array.begin(),store_array.end());
        if(store_array[0]==0&&store_array[1]==0){
            cout<<"woman"<<endl;
            continue;
        }
        int equal_count=0;
        for(int i=2;i<store_array.size();i++){
            if(store_array[i]==store_array[i-1]){
                equal_count++;
            }
        }
        if(equal_count>=2){
            cout<<"woman"<<endl;
            continue;
        }
        int extra_number=0;
        for(int i=0;i<store_array.size();i++){
            extra_number+=store_array[i]-i;
        }
        if(extra_number%2){
            cout<<"man"<<endl;
            continue;
        }
        else{
            cout<<"woman"<<endl;
            continue;
        }
    }

}