Submission #616035

---

Source Code Expand

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

ll t[]={252525,25252525,25,2525};
int main(){
  ll N;
  cin>>N;
  
  map<ll,bool> mp;
  vector<ll> vec;
  
  for(int j=0;j<4;j++)
    for(ll i=t[j];i<=N;i+=t[j]){
      if(mp[i])continue;
      vec.push_back(i);
      mp[i]=true;
    }
  /*
  int cnt=0;
  for(int i=0;i<(int)vec.size();i++){
    if(vec[i]%25!=0&&vec[i]%2525!=0)cnt++;
  }
  
  int a=N/25,b=N/2525,c=N/63125;
  */
  cout<<vec.size()<<endl;
  return 0;
}

Submission Info

Judge Result