Submission #615980

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

long long int yaku[6];

int main() {
	yaku[0] = 25;
	for(int i = 1;i < 4;i++){
		yaku[i] = yaku[i-1] * 100 + 25;
	}
	long long int n;
	cin >> n;
	long long int ans = 0;
	for(long long int i = 1;i <= n;i += 1){
		for(int j = 0;j < 4;j++){
			if(i < yaku[j]) break;
			if(i % yaku[j] == 0) ans++;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result