You are viewing a single comment's thread. Return to all comments →
this is my code
using namespace std; ll solve (ll n){ ll cnt=0,s=1; vector check {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; for(ll i=0;i
if(s<=n){ s*=check[i]; cnt++; } } return cnt -1;
} int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); ll q; cin>>q; for(ll j=0;j>n; cout<
}
return 0;
Seems like cookies are disabled on this browser, please enable them to open this website
Leonardo's Prime Factors
You are viewing a single comment's thread. Return to all comments →
this is my code
define ll unsigned long long int
include
using namespace std; ll solve (ll n){ ll cnt=0,s=1; vector check {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; for(ll i=0;i
} int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); ll q; cin>>q; for(ll j=0;j>n; cout<
}
}