From 8c1a14e3519e15ad7c8459330bbf1ada67aec52f Mon Sep 17 00:00:00 2001
From: Bartosz Tylkowski <bartyl1@st.amu.edu.pl>
Date: Thu, 31 May 2018 21:54:49 +0000
Subject: [PATCH] =?UTF-8?q?Usu=C5=84=20'main.cpp'?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 106 -------------------------------------------------------
 1 file changed, 106 deletions(-)
 delete mode 100644 main.cpp

diff --git a/main.cpp b/main.cpp
deleted file mode 100644
index 438ae45..0000000
--- a/main.cpp
+++ /dev/null
@@ -1,106 +0,0 @@
-#include <iostream>
-#include <math.h>
-
-using namespace std;
-
-bool odwracalny(int i, int n){
-    for(int x=0; x<n; x++){
-            if((x * i) % n == 1){
-               return true ;
-            }
-    return false;
-    }
-}
-
-void el_odwracalne(int n){
-    int lista[n];
-    int index=0;
-    for(int i=0; i<n; i++){
-         if(odwracalny(i,n)){
-            lista[index]=i;
-            index++;
-         }
-    }
-    for (int i=0; i<index; i++){
-        cout << lista[i] << endl;
-    }
-}
-
-bool dzieli_zero(int i, int n){
-    for(int x=0; x<n; x++){
-            if((x * i) % n == 0){
-               return true ;
-            }
-    return false;
-    }
-}
-
-
-void dzielniki_zera(int n){
-    int lista[n];
-    int index=0;
-    for(int i=0; i<n; i++){
-         if(dzieli_zero(i,n)){
-            lista[index]=i;
-            index++;
-         }
-    }
-    for (int i=0; i<index; i++){
-        cout << lista[i] << endl;
-    }
-}
-
-
-bool nilpotent(int i, int n){
-    int power=0;
-    for(int x=0; x<n; x++){
-            power = pow(x, i);
-            if(power % n == 0){
-               return true;
-            }
-    return false;
-    }
-}
-
-void el_nilpotentne(int n){
-    int lista[n];
-    int index=0;
-    for(int i=0; i<n; i++){
-         if(nilpotent(i,n)){
-            lista[index]=i;
-            index++;
-         }
-    }
-    for (int i=0; i<index; i++){
-        cout << lista[i] << endl;
-    }
-}
-
-
-void el_idempotentne(int n){
-    int lista[n];
-    int index=0;
-    for(int i=0; i<n; i++){
-         if(i*i % n == i){
-            lista[index]=i;
-            index++;
-         }
-    }
-    for (int i=0; i<index; i++){
-        cout << lista[i] << endl;
-    }
-}
-
-
-int main()
-{
-    int n = 5;
-    cout << "(";
-    el_odwracalne(n);
-    cout << ")";
-    dzielniki_zera(n);
-
-    el_nilpotentne(n);
-
-    el_idempotentne(n);
-}