写在前面: 原本应该dfs来做,但是吃饭时想到一个奇妙的方法,就写个博客记录一下
题目: 传送门
思路: 用0000000000000000000000(22个0)到1111111111111111111111(22个1)表示22个数字的取舍,一个for循环加判断就vans了
Code:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
int arr[]={3,5,7,11,13,19,23,29,31,37,41,53,59,61,67,71,97,101,127,197,211,431};
bool can[2000];
vector<int> v;
bool less_than_12(int x) {
int cnt = 0;
while (x > 0) {
if (x & 1 == 1)
cnt++;
x >>= 1;
}
return cnt <= 12;
}
void mark(int x) {
v.clear();
while (x > 0) {
v.push_back(x & 1);
x >>= 1;
}
if (v.size() != 22) {//不满足22个,后面补0
while (v.size() != 22)
v.push_back(0);
}
int sum = 0;
for (int i=v.size()-1;i>=0;i--) {
if (v[i] == 1) {
sum += arr[v.size() - i - 1];
}
}
can[sum] = true;
}
int main()
{
for (int i=0;i<=4194303;i++){//从0000000000000000000001到1111111111111111111111
if (less_than_12(i)) {
mark(i);
}
}
int cnt = 0;
for (int i=0;i<=1694;i++) {
if (!can[i])
cnt++;
}
cout<<cnt<<endl;
return 0;
}