zlQQhs（莫落）的专栏

1. 4,5,6,7 可以组成多少个不能被4整除的4位不重复数(最后要求通过一个循环实现) for (num = 4567; num    g = num / 1 % 10;   s = num / 10 % 10;   b = num / 100 % 10;   q = num / 1000 % 10;   if (g >= 4 && g        s >=

import java.util.Scanner;public class H2{ public static void main(String[] args){ int num = 1221; int bits = 0; Scanner sc = new Scanner(System.in); num = sc.nextInt(); int tmp = num;