تمرین کامل بودن یا نبودن + جاوا/سی پلاس پلاس

1≤N≤200000

Sample 1:
===============================================
input :
27
output :
No

Sample 2:
===============================================
input :
6
output :
YES

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int number = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= number / 2;i++) {
            if(count == number) {
                count += i;
            }
        }

        if(count == number) {
            System.out.println("YES");
        }
        else {
            System.out.println("No");
        }
    }

}

#include <iostream>

using namespace std;

int main()
{
	int number;
	cin >> number;
    int count = 0;

   for (int i = 1; i <= number / 2;i++)
	if(number % i == 0)
		count += i;

	if(count == number)
		cout << "YES" << endl;
	else
		cout << "No" << endl;

	return 0;
}

#include "iostream.h"

using namespace std;

int main()
{
	long long int a, b, c, n;
	cin>> n;
	
	c = 0;
	
	for(int i =1; i!=n; i++)
	{
		if(n % i == 0)
		{
			c += i;
		}
	}
	
	if(c == n)
	{
		cout <<"YES";
	}
	
	else
	{
		cout<<"NO";
	}
	
	
	return 0;
}