Submission #885767

#TimeUsernameProblemLanguageResultExecution timeMemory
885767ZeroBeautiful row (IZhO12_beauty)C++17
0 / 100
600 ms440 KiB
#include <bits/stdc++.h> using namespace std; int bt(int n){ return __builtin_popcount(n); } int tr(int n){ int y = 0; while(n){ if(n%3==1) y++; n/=3; } return y; } bool ok(vector<int> a){ for(int i=0; i < a.size()-1; i ++){ int b1 = bt(a[i]), t1 = tr(a[i]); int b2 = bt(a[i+1]), t2 = tr(a[i+1]); if(!(b1 == b2 || t1 == t2)) return 0; } return 1; } int main() { int n; cin >> n; vector<int> a(n); for(auto &i : a ) cin >> i; sort(a.begin(),a.end()); int c = 0; do{ c += ok(a); }while(next_permutation(a.begin(),a.end())); cout << c; return 0; }

Compilation message (stderr)

beauty.cpp: In function 'bool ok(std::vector<int>)':
beauty.cpp:16:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0; i < a.size()-1; i ++){
      |               ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...