Submission #616194
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REPU(i, a, b) for (int i = (a); i < (b); ++i) #define REPD(i, a, b) for (int i = (a); i > (b); --i) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; const int MOD = 1000000007; template<class T> inline T tmin(T a, T b) { return (a < b) ? a : b; } template<class T> inline T tmax(T a, T b) { return (a > b) ? a : b; } template<class T> inline void amax(T &a, T b) { if (b > a) a = b; } template<class T> inline void amin(T &a, T b) { if (b < a) a = b; } template<class T> inline T tabs(T a) { return (a > 0) ? a : -a; } template<class T> T gcd(T a, T b) { while (b != 0) { T c = a; a = b; b = c % b; } return a; } const int N = 10; ll a[N]; int n, m; void solve() { ll res = 0; for (int i = 1; i < (1 << m); ++i) { int num = 0; for (int j = i; j != 0; j >>= 1) num += j & 1; ll lcm = 1; for (int j = 0; j < m; ++j) { if (i >> j & 1) { lcm = lcm / gcd(lcm, a[j]) * a[j]; if (lcm > n) break; } } if (num % 2 == 0) res -= n / lcm; else res += n / lcm; } printf("%lld\n", res); } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); m = 0; cin >> n; ll x = 0; while (true) { x = 100 * x + 25; if (x > n) break; a[m++] = x; } solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | rantd |
Language | C++ (GCC 4.9.2) |
Score | 60 |
Code Size | 1521 Byte |
Status | AC |
Exec Time | 28 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 | 27 ms | 916 KB |
sample_02.txt | AC | 25 ms | 916 KB |
test_01.txt | AC | 25 ms | 928 KB |
test_02.txt | AC | 25 ms | 804 KB |
test_03.txt | AC | 25 ms | 796 KB |
test_04.txt | AC | 25 ms | 800 KB |
test_05.txt | AC | 25 ms | 920 KB |
test_06.txt | AC | 25 ms | 796 KB |
test_07.txt | AC | 28 ms | 796 KB |
test_08.txt | AC | 25 ms | 924 KB |
test_09.txt | AC | 25 ms | 928 KB |
test_10.txt | AC | 25 ms | 800 KB |
test_11.txt | AC | 25 ms | 800 KB |
test_12.txt | AC | 25 ms | 804 KB |
test_13.txt | AC | 25 ms | 812 KB |
test_14.txt | AC | 25 ms | 800 KB |
test_15.txt | AC | 25 ms | 792 KB |