Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long int
- int pot(int a,int b){
- int base=a;
- for(int i=0;i<b;i++){
- base*=a;
- }
- return base;
- }
- void solve(){
- ll n;cin>>n;
- vector<int>st;
- for(int i=0;i<=54;i++){
- for(int j=0;j<=36;j++){
- for(int k=0;k<=18;k++){
- for(int l=0;l<=18;l++)st.push_back(pot(2,i)*pot(3,j)*pot(5,k)*pot(7,l));
- }
- }
- }
- sort(st.begin(),st.end());
- st.erase(unique(st.begin(), st.end()));
- auto it=lower_bound(st.begin(),st.end(),n);
- cout<<(it-st.begin())<<'\n';
- }
- int main() {
- cin.tie(0);
- ios_base::sync_with_stdio(0);
- int t=1; cin>>t;
- while(t--)solve();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
