Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
6975 | 2023-02-26 18:58:15 | heisenberg_120 | Binary Prime | C++ 17 | 4 ms | 3476 kb | Accepted |
Test Cases
# | CPU | Memory | Points | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 2 ms | 3452 kb | 1 | Accepted | |||||||
2 | 3 ms | 3408 kb | 1 | Accepted | |||||||
3 | 3 ms | 3460 kb | 1 | Accepted | |||||||
4 | 3 ms | 3408 kb | 1 | Accepted | |||||||
5 | 3 ms | 3448 kb | 1 | Accepted | |||||||
6 | 3 ms | 3316 kb | 1 | Accepted | |||||||
7 | 3 ms | 3464 kb | 1 | Accepted | |||||||
8 | 3 ms | 3460 kb | 1 | Accepted | |||||||
9 | 3 ms | 3476 kb | 1 | Accepted | |||||||
10 | 4 ms | 3460 kb | 1 | Accepted | |||||||
11 | 3 ms | 3472 kb | 1 | Accepted | |||||||
Source Code
#include <bits/stdc++.h> using namespace std; #define int long long int int cal(int n){ int s = 0; for(int i = 0; i < 62; i++){ if(((n >> i) & 1) != 0){ s += 1; } } return s; } bool prime(int n){ if(n <= 1) return false; for(int i = 2; i * i <= n; i++){ if(n % i == 0) return false; } return true; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int tt; cin >> tt; while (tt--){ int n; cin >> n; n = cal(n); if(prime(n)){ cout << "Binary prime" << '\n'; }else cout << "-1" << '\n'; } return 0; }