Submission #615938

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define each(a,x) for(auto a : (x))
#define all(a) (a).begin(),(a).end()
#define chmin(a,b) ((a) = min((a),(b)))
#define chmax(a,b) ((a) = max((a),(b)))
#define in_range(x,l,r) ((l)<=(x) && (x)<(r))
#define fs first
#define sc second
#define pb push_back
#define sz size() 
#define MP make_pair
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<string> vs;

const static int INF = 1e8;
const static D EPS = 1e-8;

int nico[] = {2525,252525,25252525};

int main(){
  int N;
  cin >> N;

  int ans = N/25;
  set<int> plus;
  rep(i,3){
    for(int j=nico[i];j<=N;j+=nico[i]){
      if(j%25!=0)plus.insert(j);
    }
  }
  cout << ans + plus.size() << endl;

}

Submission Info

Judge Result