水仙花数:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
int main() {
for (int i = 1; i < 9; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 0; k <= 9; k++) {
if (i * 100 + j * 10 + k == (int)pow(i, 3) + (int)pow(j, 3) + (int)pow(k, 3)) {
printf("%d%d%d\n", i, j, k);
}
}
}
}
return 0;
}
二分法求和:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main() {
int n[15];
for (int i = 0; i < 15; i++) {
scanf_s("%d" ,& n[i]);
}
int nn;
scanf("%d", &nn);
int let, reg, mid;
let = 0;
reg = 14;
while(let<=reg) {
mid = (let + reg) / 2;
if (nn <n[mid]) {
reg = mid - 1;
}
else if(nn == n[mid]) {
printf("%d", mid);
break;
}
else if (nn > n[mid]) {
let = mid + 1;
}
else {
printf("NO");
}
}
return 0;
}