Submission #616051

---

Source Code Expand

#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>

using namespace std;
#define reps(i,j,k) for(int i = (j); i <= (k); ++i)
#define rep(i,j) reps(i,0,int(j)-1)
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define rrep(X,Y) for(int (X) = (Y)-1; (X) >=0; --(X))
#define X first
#define Y second
#define in(i,j,k) ((i)>=(j)&&(i)<=(k))
#define sz size()

#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

int x[] = {25,2525,252525,25252525};
vector<int> a;


int main(){
  int y;
  cin >> y;
  rep(i,4){
    int z = x[i];
    while(z < y){
      a.push_back(z);
      z+=x[i];
    }
  }
  sort(all(a));
  UNIQUE(a);
  cout << a.sz << endl;

  return 0;
}

Submission Info

Judge Result