Submission #615907

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <climits>
#include <cfloat>
#include <cstdio>
#include <cstring>
#include <map>
#include <cmath>
#include <stack>
#include <complex>
#include <queue>
#include <set>
#include <cassert>
using namespace std;

const double  EPS = 1e-14;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v)	(v).begin(), (v).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define INF LLONG_MAX/3
#define DINF DBL_MAX/2
#define MOD 1000000007
#define PB(x) push_back(x)
#define MP(x,y) make_pair((x),(y))
#define debug(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef long long LL;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<LL> vLL;
typedef vector<ll> vll;
typedef map<ll, ll> mll;
typedef map<int, int> mii;
template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; }

ll nico[] = { 25, 2525, 252525, 25252525};

int main(){
	ll N; cin >> N;
	int a[4];
	for (int i = 0; i < 4; i++){
		a[i] = N / nico[i];
	}

	//cout << a[0] - a[1] + a[2] - a[3] << endl;
	cout << a[0] << endl;
}

Submission Info

Judge Result