Submission #1961093

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}

vint a;

signed main(){
    a.pb(25);
    while(true){
        int tmp=a.back();
        tmp=tmp*100+25;
        if(tmp>1000000000)break;
        a.pb(tmp);
    }
    int N;cin>>N;
    int ans=0;
    for(int i=1;i<1<<a.size();i++){
        int l=1;
        rep(j,a.size()){
            if(!(i>>j&1))continue;
            int g=gcd(l,a[j]);
            int u=a[j]/g;
            if(l*u>N)l=N+1;
            else l*=u;
        }
        if(__builtin_popcount(i)%2)ans+=N/l;
        else ans-=N/l;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result