#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool ckmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool ckmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
bool iseq(int a, int b){
if(__builtin_popcount(a) == __builtin_popcount(b))return true;
int c1=0, c2=0;
while(a>0){
c1 += (a%3==1);
a/=3;
}
while(b>0){
c2 += (b%3==1);
b/=3;
}
return c1 == c2;
}
bool is(){
for(int i=1;i<n;i++){
if(!iseq(a[i],a[i-1]))return false;
}return true;
}
void solve(int test_case){
int i, j;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
}
iseq(5, 1);
int ans = 0;
sort(a,a+n);
do{
if(is())ans++;
}while(next_permutation(a,a+n));
cout << ans << '\n';
return;
}
signed main(){
FASTIO;
#define MULTITEST 0
#if MULTITEST
int _T;
cin >> _T;
for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
solve(T_CASE);
#else
solve(1);
#endif
return 0;
}
Compilation message
beauty.cpp: In function 'void solve(int)':
beauty.cpp:36:9: warning: unused variable 'j' [-Wunused-variable]
36 | int i, j;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
196 ms |
400 KB |
Output is correct |
| 7 |
Correct |
163 ms |
492 KB |
Output is correct |
| 8 |
Correct |
279 ms |
492 KB |
Output is correct |
| 9 |
Incorrect |
83 ms |
364 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
