Perfect Number

Medium Numbers

A perfect number equals the sum of its proper divisors (e.g. 28 = 1 + 2 + 4 + 7 + 14).

Sample input

Sample output

true

Solution

n = 28
total = sum(i for i in range(1, n) if n % i == 0)
print(total == n)

const n = 28;
let total = 0;
for (let i = 1; i < n; i++) {
  if (n % i === 0) total += i;
}
console.log(total === n);

public class Main {
    public static void main(String[] args) {
        int n = 28, total = 0;
        for (int i = 1; i < n; i++) {
            if (n % i == 0) total += i;
        }
        System.out.println(total == n);
    }
}

fun main() {
    val n = 28
    var total = 0
    for (i in 1 until n) {
        if (n % i == 0) total += i
    }
    println(total == n)
}

let n = 28
var total = 0
for i in 1..<n {
    if n % i == 0 {
        total += i
    }
}
print(total == n)

void main() {
  int n = 28, total = 0;
  for (int i = 1; i < n; i++) {
    if (n % i == 0) total += i;
  }
  print(total == n);
}

#include <iostream>
using namespace std;

int main() {
    int n = 28, total = 0;
    for (int i = 1; i < n; i++) {
        if (n % i == 0) total += i;
    }
    cout << (total == n ? "true" : "false") << endl;
    return 0;
}

#include <stdio.h>

int main() {
    int n = 28, total = 0;
    for (int i = 1; i < n; i++) {
        if (n % i == 0) total += i;
    }
    printf("%s\n", total == n ? "true" : "false");
    return 0;
}