题目
题目意思很简单, 求1到n中有多少数不是2, 3, 5, 7的倍数,n范围到 1e18。
分析
两个知识点解决:
- 1 到 n 中,能整除c的数的个数为 n / c n/c n/c
- 容斥原理。
首先算有多少是2,3, 5, 7的倍数。num(x)表示有多少是x倍数:
容斥原理: n u m ( 2 + 3 + 5 + 7 ) = n u m ( 2 ) + n u m ( 3 ) + n u m ( 5 ) + n u m ( 7 ) − n u m ( 23 ) − n u m ( 25 ) − n u m ( 27 ) − n u m ( 35 ) − n u m ( 37 ) − n u m ( 57 ) + n u m ( 235 ) + n u m ( 237 ) + n u m ( 257 ) + n u m ( 357 ) − n u m ( 2357 ) num(2+3+5+7) = num(2) + num(3) + num(5) + num(7) - num(23) - num(25) - num(27) - num(35) - num(37) - num(57) + num(235) + num(237) + num(257) + num(357) - num(2357) num(2+3+5+7)=num(2)+num(3)+num(5)+num(7)−num(23)−num(25)−num(27)−num(35)−num(37)−num(57)+num(235)+num(237)+num(257)+num(357)−num(2357)
#include <bits/stdc++.h>
#pragma GCC diagnostic error "-std=c++11"
#define d(x) cout << (x) << endl
#define INF 0x3f3f3f3f
#define eps 1e-8
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e3 + 10;
int main()
{
ll n;
cin >> n;
ll ans = n; //是2 3 5 7 的倍数
ans = ans - n / 2 - n / 3 - n / 5 - n / 7;
ans = ans + n / (2 * 3) + n / (2 * 5) + n / (2 * 7) + n / (3 * 5) + n / (3 * 7) + n / (5 * 7);
ans = ans - n / (2 * 3 * 5) - n / (2 * 3 * 7) - n / (2 * 5 * 7) - n / (3 * 5 * 7);
ans = ans + n / (2 * 3 * 5 * 7);
cout << ans << endl;
return 0;
}