Submission #615965
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(ll i=(a);i<(b);i++) #define RFOR(i,a,b) for(ll i=(b) - 1;i>=(a);i--) #define REP(i,n) for(ll i=0;i<(n);i++) #define RREP(i,n) for(ll i=n-1;i>=0;i--) #define PB push_back #define INF INT_MAX/3 #define ALL(a) (a).begin(),(a).end() #define CLR(a) memset(a,0,sizeof(a)) typedef long long int ll; using namespace std; ll gcd(ll a,ll b){ return a%b==0 ? b : gcd(b,a%b); } ll lcm(ll a,ll b){ return a*b/gcd(a,b); } int main(){ ll a[100]; ll ni[] = {25,2525,252525,25252525}; ll n; cin >> n; ll ans = 0; REP(i,4){ ans += n / ni[i]; FOR(j,i+1,4){ ans -= n / lcm(ni[i],ni[j]); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ数 |
User | kotarou |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 746 Byte |
Status | WA |
Exec Time | 27 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 27 ms | 792 KB |
test_01.txt | AC | 27 ms | 792 KB |
test_02.txt | AC | 25 ms | 800 KB |
test_03.txt | AC | 24 ms | 920 KB |
test_04.txt | AC | 27 ms | 672 KB |
test_05.txt | AC | 27 ms | 924 KB |
test_06.txt | AC | 26 ms | 804 KB |
test_07.txt | AC | 25 ms | 800 KB |
test_08.txt | WA | 26 ms | 796 KB |
test_09.txt | WA | 25 ms | 800 KB |
test_10.txt | WA | 26 ms | 792 KB |
test_11.txt | WA | 26 ms | 724 KB |
test_12.txt | WA | 25 ms | 916 KB |
test_13.txt | AC | 24 ms | 800 KB |
test_14.txt | AC | 25 ms | 796 KB |
test_15.txt | AC | 27 ms | 796 KB |