FilesExpand file tree

 master

/

Main6.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (30 loc) · 787 Bytes

 master

/

Main6.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (30 loc) · 787 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

package tencent;

import java.util.Scanner;

/**

* 求解一个数是否是和谐数：n的各个位之和能够被n整除，那么这个数是和谐数

*

* @author 刘壮飞

* https://github.com/zfman.

* https://blog.csdn.net/lzhuangfei.

*/

public class Main6 {

public static void main(String[] args){

Scanner scanner=new Scanner(System.in);

int n=scanner.nextInt();

for(int i=0;i<n;i++){

int t=scanner.nextInt();

int v=t;

//分解并求和

int sum=0;

while(v!=0){

sum+=v%10;

v=v/10;

}

if(t%sum==0){

System.out.println("Yes");

}else{

System.out.println("No");

}

}

}

}