题目来源:码蹄集
https://matiji.net/exam/brushquestion/261/778/B3FCFEC101BD05189BB74D522E019504
时间限制:1000ms
内存限制:65535kb
题目描述:整数集1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,…… 首先,删除所有序号能被2整除的项的数,我们就得1, 3, 5, 7, 9, 11, 13, 15, 17, 19,…………现在,删除所有序号能被3整除的项,我们得到1, 3, 7, 9, 13, 15, 19,….….无限期地继续这个过程……而未被删除的号码称为“幸 运数”。输入正整数N判断他是不是幸运数,输出YES或者NO。不考虑不 合理的输入等特殊情况。
输入格式:输入正整数N
输出格式:输出YES或者NO
输入样例:19
输出样例:YES
参考程序:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
bool isLucky(int n) {
int deleteEvery = 2;
while (n >= deleteEvery) {
if (n % deleteEvery == 0) return false;
n -= (n / deleteEvery);
deleteEvery++;
}
return true;
}
int main(){
int n;
cin >> n;
bool c = isLucky(n);
if (c == 1) cout << "YES" ;
else cout << "NO" ;
/*for (int i = 10000; i <= 1e5; i++){
if (isLucky(i)) {
cout << i ;
return 0;
}
}*/
return 0;
}