题解 | #牛牛的二三七整除#
牛牛的二三七整除
https://www.nowcoder.com/practice/b2cf0b791245436f8f0591ae9f4c664f
#include <stdio.h>
int main() {
int num;
int count = 0;
int a[3] = {2,3,7};
scanf("%d",&num);
for(int i = 0; i<3; ++i){
if(num % a[i] == 0){
printf("%d ",a[i]);
count ++;
}
}
if(count == 0)
printf("n");
return 0;
}
而且一般说的也很宽泛 不是特指后端