题解 | #牛牛的二三七整除#
牛牛的二三七整除
https://www.nowcoder.com/practice/b2cf0b791245436f8f0591ae9f4c664f
#include <stdio.h>
int main() {
int n = 0,flag = 1;
int arr[] = {2,3,7};
scanf("%d",&n);
for (int i = 0; i < 3; i++) {
if (n % arr[i] == 0) {
printf("%d ",arr[i]);
flag = 0;//此时说明有匹配的
}
}
if (flag == 1) {//无匹配的
printf("n");
}
return 0;
}
查看15道真题和解析