题解 | #牛牛的二三七整除#
牛牛的二三七整除
https://www.nowcoder.com/practice/b2cf0b791245436f8f0591ae9f4c664f
#include <stdio.h> int main() { int a; scanf("%d",&a); int div[3] = {0}; int j = 0; for(int i=0;i<3;i++){ switch (i) { case 0 :{ if(a%2 == 0){ div[j] = 2; j++; } continue; } case 1 :{ if(a%3 == 0){ div[j] = 3; j++; } continue; } case 2 :{ if(a%7 == 0){ div[j] = 7; j++; } continue; } } } if(j == 0) printf("n\n"); for(int k=0;k<j;k++){ printf("%d ",div[k]); } }