OJ daily practice - Finish

Problem description ：

If a number is exactly equal to the sum of its factors , This number is called " Complete ". for example ,6 The factor is 1、2、3, and 6=1+2+3, therefore 6 yes " Complete ". Program to find out N All the completions in , And output its factor in the following format ：

Input
N

Output
? its factors are ? ? ?

Examples

Input
1000

Output
6 its factors are 1 2 3
28 its factors are 1 2 4 7 14
496 its factors are 1 2 4 8 16 31 62 124 248

Java Code ：

import java.util.*;      
public class Main{
              
public static void main(String[] args) {
    
	Scanner rd=new Scanner(System.in);
	int a=rd.nextInt();
	for(int i=2;i<=a;i++) {
    
		int sum=0;
		for(int j=1;j<=i/2;j++) {
    
			if(i%j==0) {
    
				sum=sum+j;
			}
			}
		if(sum==i) {
    
			System.out.print(i+" "+"its factors are"+" ");
			for(int j=1;j<=i/2;j++) {
    
				if(i%j==0) {
    
					System.out.print(j+" ");
				}
		}
			
			System.out.println();
	}
}
}
}

C Code ：

#include <stdio.h>
int main(){
    
    int a;
    scanf("%d",&a);
    int sum;
    for(int i=2;i<=a;i++){
    
        sum=1;
        for(int j=2;j<=i/2;j++){
    
            if(i%j==0){
    
                sum+=j;
            }
        }
        if(sum==i){
    
            printf("%d its factors are 1 ",i);
            for(int j=2;j<=i/2;j++){
    
                if(i%j==0){
    
                    printf("%d ",j);
                }
            }
            printf("\n");
        }
    }
}

author ：KJ.JK
This article is only for communication learning , Without the permission of the author , Prohibited reproduced , Let alone for other purposes , Offenders will investigate .
If the article is helpful to you , Welcome to praise or star, Your support is the greatest encouragement to the author , The shortcomings can be corrected in the comments section , Communication and learning