Submission #615981

---

Source Code Expand

#include <iostream>
#include <set>

using namespace std;

int main() {
    int niconico[] = {2525, 252525, 25252525};
    int N;
    cin >> N;
    int ans = N / 25;
    set<int> s;
    for (int j = 0; j < 3; j++) {
        for (int k = niconico[j]; k <= N; k+=niconico[j]) {
            if (s.find(k) != s.end() && k % 25 != 0) {
                s.insert(k);
                ans++;
            }
        }
    }
    cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result