Submission #615949
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
inline bool cheak(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class Type> inline string tostring(Type x) { ostringstream sout; sout << x; return sout.str(); }
template<class Type> inline Type sqr(Type x) { return x*x; }
template<class Type> inline Type mypow(Type x, ll n) { Type res = 1; while (n > 0) { if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; }
inline int gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define For(i,a,b) for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n) For(i,0,n)
#define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n) rFor(i,n,0)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define sz(a) (sizeof(a))
#define tostr(a) tostring(a)
#define dump(val) cerr << #val " = " << val << endl;
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = 1e17 + 9;
const double PI = 3.14159265359;
#define int ll
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
set<int> v;
string s = "25";
auto t = s;
for (; toint(t) <= n;) {
int tmp = toint(t);
bool f = true;
for (auto i : v) {
if (tmp % i == 0) {
f = false;
}
}
if (f) {
v.insert(tmp);
}
t += s;
}
int ans = 0;
for(auto i : v) {
ans += n / i;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - ニコニコ数 |
User |
omu |
Language |
C++11 (GCC 4.9.2) |
Score |
60 |
Code Size |
2294 Byte |
Status |
AC |
Exec Time |
26 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 |
26 ms |
744 KB |
sample_02.txt |
AC |
25 ms |
928 KB |
test_01.txt |
AC |
26 ms |
800 KB |
test_02.txt |
AC |
26 ms |
796 KB |
test_03.txt |
AC |
24 ms |
920 KB |
test_04.txt |
AC |
26 ms |
916 KB |
test_05.txt |
AC |
25 ms |
796 KB |
test_06.txt |
AC |
24 ms |
920 KB |
test_07.txt |
AC |
25 ms |
928 KB |
test_08.txt |
AC |
23 ms |
920 KB |
test_09.txt |
AC |
23 ms |
804 KB |
test_10.txt |
AC |
25 ms |
800 KB |
test_11.txt |
AC |
23 ms |
928 KB |
test_12.txt |
AC |
25 ms |
800 KB |
test_13.txt |
AC |
25 ms |
924 KB |
test_14.txt |
AC |
26 ms |
928 KB |
test_15.txt |
AC |
25 ms |
924 KB |