Submission #616029
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug( fmt, ... ) \
fprintf( stderr, \
fmt "\n", \
##__VA_ARGS__ \
)
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1 << 29;
const double EPS = 1e-10;
double zero(double d) {
return d < EPS ? 0.0 : d;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
rep(i, a.size()) os << (i ? " " : "") << a[i];
return os << ']';
}
string toString(int i) {
stringstream ss;
ss << i;
return ss.str();
}
const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
ll res = 1ll;
ll x = a;
while (k != 0) {
if ((k & 1) == 1)
res = (res * x) % M;
x = (x * x) % M;
k >>= 1;
}
return res;
}
struct prepare {
prepare() {
cout.setf(ios::fixed, ios::floatfield);
cout.precision(8);
ios_base::sync_with_stdio(false);
}
} _prepare;
int main() {
int N;
cin >> N;
ll ans = N / 25;
cerr << ans << endl;
ll v = 2525;
while(v <= N) {
if(v % 25 != 0)
ans++;
v += 2525;
}
v = 252525;
while(v <= N) {
if(v % 25 != 0 && v % 2525 != 0)
ans++;
v += 252525;
}
v = 25252525;
while(v <= N) {
if(v % 25 != 0 && v % 2525 != 0 && v % 252525 != 0)
ans++;
v += 25252525;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - ニコニコ数 |
User |
palpal |
Language |
C++11 (GCC 4.8.1) |
Score |
60 |
Code Size |
2641 Byte |
Status |
AC |
Exec Time |
34 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Score / Max Score |
0 / 0 |
60 / 60 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
Subtask1 |
sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
25 ms |
928 KB |
sample_02.txt |
AC |
34 ms |
740 KB |
test_01.txt |
AC |
24 ms |
800 KB |
test_02.txt |
AC |
24 ms |
804 KB |
test_03.txt |
AC |
24 ms |
796 KB |
test_04.txt |
AC |
24 ms |
920 KB |
test_05.txt |
AC |
25 ms |
924 KB |
test_06.txt |
AC |
26 ms |
732 KB |
test_07.txt |
AC |
24 ms |
792 KB |
test_08.txt |
AC |
26 ms |
796 KB |
test_09.txt |
AC |
28 ms |
732 KB |
test_10.txt |
AC |
27 ms |
792 KB |
test_11.txt |
AC |
27 ms |
920 KB |
test_12.txt |
AC |
26 ms |
732 KB |
test_13.txt |
AC |
24 ms |
804 KB |
test_14.txt |
AC |
24 ms |
920 KB |
test_15.txt |
AC |
26 ms |
920 KB |