Submission #615948

---

Source Code Expand

/* attention to overflow */
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdio>
#include <queue>
#include <sstream>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <tuple>
#include <iomanip>

#define dump(x) cerr<< #x << " = " << x <<endl
#define ALL(container) (container).begin(),(container).end()

using namespace std;
const int INF = 1 << 25;
void io() { cin.tie(0); ios::sync_with_stdio(false);}
template <class S,class T> ostream& operator<<(ostream& os, const pair <S,T> &s){return os<<'('<<s.first<<','<<s.second<<')';}
/*printf("%.9Lf\n",cf);*/
const int MOD = 1000000007;
const double EPS=1e-8;

long long result(int N){
	vector <long long> val={25,2525,252525,25252525};
	long long res=0;
	for(int i=0;i<4;i++) res+=N/val[i];
	for(int i=0;i<4;i++){
		for(int j=i+1;j<4;j++){
			long long mo=(val[i]/25)*val[j];
			res-=N/mo;
		}
	}
	for(int i=0;i<4;i++){
		for(int j=i+1;j<4;j++){
			for(int k=j+1;k<4;k++){
				long long mo=(val[i]/25)*(val[j]/25)*val[k];
				res+=N/mo;
			}
		}
	}
	return res;
}

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

	cout<<result(N)<<endl;

	return 0;
}

Submission Info

Judge Result