From 3ade316b644de83054e4cfbd80827a916cdeb8b3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jakub=20=C5=81asecki?= <jaklas1@st.amu.edu.pl>
Date: Wed, 30 May 2018 21:44:29 +0000
Subject: [PATCH] =?UTF-8?q?Prze=C5=9Blij=20pliki=20do=20''?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 106 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 106 insertions(+)
 create mode 100644 main.cpp

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..d61268c
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,106 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <string>
+#include <cctype>
+#include <conio.h>
+#include <math.h>
+
+using namespace std;
+
+
+void El_Odwracalne(int n){
+    int mod = 1 % n;
+    for(int i = 1;i <= n; i++){
+        for(int j=1; j<=n; j++){
+            if((i*j)%n == mod){
+                    cout<<i<<" ";
+            }
+        }
+    }
+}
+
+
+void Dz_Zera(int n){
+    vector<int> vec;
+    cout<<"0 ";
+    for(int i=1; i<n; i++){
+        for(int j=1; j<n; j++){
+            if((i*j) % n == 0){
+                vec.push_back(i);
+            }
+        }
+    }
+    sort(vec.begin(), vec.end());
+    vec.erase(unique(vec.begin(), vec.end()), vec.end());
+    for(int k=0; k<vec.size(); ++k)
+    cout<<vec[k]<< " ";
+}
+
+
+void El_Nilpotentne(int n){
+    int wynik=1;
+    vector<int> vec;
+    cout<<"0 ";
+    for(int i=2; i<n-1; i++){
+        for(int j=1; j<n; j++){
+            wynik = (int) pow(i,j);
+            if(wynik % n == 0)
+                cout<<i<<" ";
+                vec.push_back(i);
+                i++;
+        }
+    }
+    sort(vec.begin(), vec.end());
+    vec.erase(unique(vec.begin(), vec.end()), vec.end());
+    for(int k=0; k<vec.size(); ++k)
+    cout<<vec[k]<< " ";
+}
+
+void El_Idempotentne(int n){
+    int wynik;
+    cout<<"0 ";
+    for(int i=1; i<n; i++){
+        wynik = i*i;
+        if(wynik % n == i)
+            cout<<i<<" ";
+    }
+}
+
+
+int main()
+{
+    do {
+
+    int n;
+    cout<<"Wpisz liczbe n: ";
+    cin>>n;
+    cout<<endl;
+
+    while(n>1000){
+        cout<<"Wpisz liczbe mniejsza od 1000: "<<endl;
+        cin>>n;
+    }
+
+    cout<<"Elementy odwracalne "<<n<<" to: ";
+    El_Odwracalne(n);
+    cout<<endl<<endl;
+
+    cout<<"Dzielniki zera "<<n<<" to: ";
+    Dz_Zera(n);
+    cout<<endl<<endl;
+
+    cout<<"Elementy nilpotentne "<<n<<" to: ";
+    El_Nilpotentne(n);
+    cout<<endl<<endl;
+
+    cout<<"Elementy idempotentne "<<n<<" to: ";
+    El_Idempotentne(n);
+    cout<<endl<<endl;
+
+    cout<<"--------------------------------------------------------------"<<endl;
+    cout<<"Wcisnij ESC aby wyjsc  |  Wcisnij inny klawisz aby kontynuowac"<<endl;
+    cout<<"--------------------------------------------------------------"<<endl;
+    }
+    while (getch() != 27);
+}