제출 #89291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89291		abil	아름다운 순열 (IZhO12_beauty)	C++14	0 / 100	301 ms	632 KiB

beauty

/**
   Solution by Abil
**/
# include <bits/stdc++.h>

////////////////////////

# define fr first
# define sc second
# define pb push_back
# define mk make_pair
# define sz(s) s.size()
# define all(s) s.begin(),s.end()
# define int long long

using namespace std;

const long long N = (1e6 + 10);
const long long mod = (1e9 + 7);

vector<int > v;
int f(int x){
   int cnt = 0;
   while(x){
    if(x % 3 == 1){
      cnt++;
    }
    x = x / 3;
   }
   return cnt;
}
main()
{
   int n, x;
   cin >> n;
   for(int i = 1;i <= n; i++){
    cin >> x;
    v.pb(x);
   }
   sort(all(v));
   int ans = 0;
   do{
    bool f1 = true;
    for(int i = 0;i < sz(v) - 1; i++){
      if((__builtin_popcount(v[i])) != (__builtin_popcount(v[i + 1])) && (f(v[i]) != f(v[i + 1]))){
        f1 = false;
        break;
      }
    }
    if(f1){
      ans++;
    }
   }
   while(next_permutation(all(v)));
   cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

beauty.cpp:32:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
beauty.cpp: In function 'int main()':
beauty.cpp:44:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < sz(v) - 1; i++){
                   ~~^~~~~~~~~~~

• Subtask 1: 0 / 100