Submission #615855

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>
#include <complex>

#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double 

using namespace std;

LL N;

LL make25(int n){

  LL ret = 0;

  for(int i = 0; i < n; i++){
    ret *= 100;
    ret += 25;
  }

  return ret;

}

set<LL> S;

int main(){

  cin >> N;

  int ans = 0;

  /*
  for(int i = 1; ; i++){
    LL m = make25(i);
    
    if(N < m)
      break;
    
    LL tmpm = m;
    
    while(tmpm <= N){
      if(S.insert(tmpm).second)
	ans++;
      tmpm += m;
    }

  }
  */

  int m = 25;
  while(m <= N){
    ans++;
    m += 25;
  }

  cout << ans << endl;

  return 0;

}

Submission Info

Judge Result