Submission #236700

#	Time	Username	Problem	Language	Result	Execution time	Memory
236700		mohamedsobhi777	Beautiful row (IZhO12_beauty)	C++14	0 / 100	3081 ms	384 KiB

beauty

#include<bits/stdc++.h>

using namespace std ; 

const int N =1e5 + 7 ; 

int n; 
int r2[N] , r3[N] ; 
int a[N] ; 
vector<int> p ; 

int solve1(int x , int base){
        int ret = 0 ; 
        while(x){
                ret+= (x%base==1) ; 
                x/=base ; 
        }

        return ret ; 
}

int main(){
        ios_base::sync_with_stdio(0) ; 
        cin.tie(0) ;
        //freopen("in.in" , "r" , stdin) ; 
        cin>>n ; 

        for(int i = 0 ;i < n;i++){
                cin>>a[i] ; 
                r2[i] = solve1(a[i] , 2) ; 
                r3[i] = solve1(a[i] , 3) ; 
        }
        for(int i = 0 ;i < n;i++){
                p.push_back(i) ; 
        }
        sort(p.begin() , p.end()) ; 
        long long ans  = 0 ; 
        do{     
                bool ok = 1 ; 
                for(int i = 1 ; i<n;i++){
                        if(r2[p[i]] != r2[p[i-1]] && r3[p[i]] != r3[p[i-1]]){
                                ok = 0 ; 
                                break ; 
                        }
                }
                ans+= ok ; 
        }
        while(next_permutation(p.begin() , p.end())) ; 
        cout << ans ; 
        return 0;
}

• Subtask 1: 0 / 100