Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20876 | 2024-06-15 17:18:30 | esh29 | Binary Prime | C++ 17 | 2 ms | 3612 kb | Accepted |
Test Cases
# | CPU | Memory | Points | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 2 ms | 3568 kb | 1 | Accepted | |||||||
2 | 1 ms | 3544 kb | 1 | Accepted | |||||||
3 | 1 ms | 3504 kb | 1 | Accepted | |||||||
4 | 1 ms | 3572 kb | 1 | Accepted | |||||||
5 | 1 ms | 3536 kb | 1 | Accepted | |||||||
6 | 1 ms | 3584 kb | 1 | Accepted | |||||||
7 | 1 ms | 3612 kb | 1 | Accepted | |||||||
8 | 1 ms | 3504 kb | 1 | Accepted | |||||||
9 | 2 ms | 3596 kb | 1 | Accepted | |||||||
10 | 1 ms | 3564 kb | 1 | Accepted | |||||||
11 | 2 ms | 3404 kb | 1 | Accepted | |||||||
Source Code
#include <bits/stdc++.h> using namespace std; #define esh29() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define ll long long int #define pb push_back #define ep emplace_back #define forn(i, n) for(int i = 0; i < int(n); i++) #define form(i, n) for(int i = 1; i < int(n); i++) #define MOD 1000000007 #define w(t) int t; cin >> t; cin.ignore(); while (t--) const double eps = 1e-9; #define F first #define S second #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define sz(x) (int)x.size() typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vi> vvi; typedef vector<vl> vvl; typedef pair<int,int> pii; typedef pair<double, double> pdd; typedef pair<ll, ll> pll; typedef vector<pii> vii; typedef vector<pll> vll; typedef double dl; #define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0) #define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield); ll gcd ( ll a, ll b ) { return __gcd ( a, b ); } ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); } template < typename F, typename S > ostream& operator << ( ostream& os, const pair< F, S > & p ) { return os << "(" << p.first << ", " << p.second << ")"; } template < typename T > ostream &operator << ( ostream & os, const vector< T > &v ) { os << "{"; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; } template < typename T > ostream &operator << ( ostream & os, const set< T > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "]"; } template < typename T > ostream &operator << ( ostream & os, const multiset< T > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << *it; } return os << "]"; } template < typename F, typename S > ostream &operator << ( ostream & os, const map< F, S > &v ) { os << "["; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << ", "; os << it -> first << " = " << it -> second ; } return os << "]"; } #define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0) void faltu () { cerr << endl; } template <typename T> void faltu( T a[], int n ) { for(int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl; } template <typename T, typename ... hello> void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); } void solve(){ ll n,c=0,i,j,k; cin>>n; for (i=45; i>=0; i--){ //cout<<k<<endl; if (k<=n){ c++; n -=k; } } for (i=2; i<c; i++){ if (c%i==0){ cout<<-1<<endl; return; } } if (c==1) cout<<-1<<endl; else cout<<"Binary prime\n"; } int main() { esh29(); w(t) { solve(); } return 0; }