From 9fe033ea88c2f705ec18c232873d056e0c229d72 Mon Sep 17 00:00:00 2001
From: Gaspard Coulet <gaspard.coulet@mines-ales.org>
Date: Wed, 28 Apr 2021 23:05:53 +0200
Subject: Initial commit

---
 sem_2/HLIN202/TP/TP1/nbparfait/parfait     | Bin 0 -> 9295 bytes
 sem_2/HLIN202/TP/TP1/nbparfait/parfait.cpp |  21 +++++++++++++++++++++
 2 files changed, 21 insertions(+)
 create mode 100644 sem_2/HLIN202/TP/TP1/nbparfait/parfait
 create mode 100644 sem_2/HLIN202/TP/TP1/nbparfait/parfait.cpp

(limited to 'sem_2/HLIN202/TP/TP1/nbparfait')

diff --git a/sem_2/HLIN202/TP/TP1/nbparfait/parfait b/sem_2/HLIN202/TP/TP1/nbparfait/parfait
new file mode 100644
index 0000000..2369d66
Binary files /dev/null and b/sem_2/HLIN202/TP/TP1/nbparfait/parfait differ
diff --git a/sem_2/HLIN202/TP/TP1/nbparfait/parfait.cpp b/sem_2/HLIN202/TP/TP1/nbparfait/parfait.cpp
new file mode 100644
index 0000000..6992c95
--- /dev/null
+++ b/sem_2/HLIN202/TP/TP1/nbparfait/parfait.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <math.h>
+
+int main(){
+  int n, som;
+  std::cout<<" Ce programme calcule les nombre parfaits inferieurs ou egaux a n, entrez n :"<<std::endl;
+  std:: cin >> n;
+  std::cout << " Les nombres parfaits inferieur ou egaux a " << n << " sont : " <<std::endl;
+  for ( int i = 4; i <= n; i ++) {
+	som = 1;
+	for ( int j=2; j <= i/2+1 ; j ++ ) {
+		if ( i % j== 0 ) {
+			som += j;
+		}
+	}
+	if ( som == i ) {
+		std::cout << som << std::endl;
+	}
+  }
+  return 0;
+}
-- 
cgit v1.2.3