我喜欢的码风
void Choose (int x, int y) {
//x为已经选了几个数,y为选第几个数
for (int i = y; i < n; i++) {
f[i] = false;
s += a[i];
if (x == k) {
if (pri[s] == true) ans += 1;
} else {
Choose(x + 1, i + 1);
}
s -= a[i];
f[i] = true;
}
}
P1036 [NOIP2002 普及组] 选数 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
强烈建议复盘!
(唔!┭┮﹏┭┮ 把 递归的 i + 1 写成 y + 1 了噻)
#include<stdio.h>
#include<string.h>
#include<stdbool.h>
int in1[25];
bool used[25];
bool IsPrime (int s) {
for (int i = 2 ; i * i < s; i++) {
if (s % i == 0) return false;
}
return true;
}
void Choose (int x, int y, int k, int n, int &cnt, int s) {
//x为已经选了几个数,y为选第几个数
for (int i = y; i < n; i++) {
printf("%d\n", in1[i]);
s += in1[i];
if (x == k) {
if (IsPrime(s) == true) {
cnt++;
printf("%d!\n",s);
}
} else {
Choose(x + 1, i + 1, k, n, cnt, s);
//y++;
printf("here! x=%d i=%d\n", x, i);
}
s -= in1[i];
printf("s = %d\n", s);
}
}
int main(){
int n, k;
scanf("%d %d", &n, &k);
memset(in1, '\0', sizeof in1);
for (int i = 0; i < n; i++) {
scanf("%d", &in1[i]);
}
int cnt = 0, s = 0;
memset(used, false, sizeof used);
Choose(1, 0, k, n, cnt, s);
printf("%d", cnt);
return 0;
}