From 7c018f298b202fb53998b69a544a6a5c15a60e01 Mon Sep 17 00:00:00 2001
From: Dhruvil Manish Shah <dhruvilshah077@gmail.com>
Date: Thu, 1 Oct 2020 20:55:19 +0530
Subject: [PATCH 1/5] ADA MATRIX SEPTEMBER  CHALLENGE

---
 ADAMAT.py | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 ADAMAT.py

diff --git a/ADAMAT.py b/ADAMAT.py
new file mode 100644
index 0000000..9a5b095
--- /dev/null
+++ b/ADAMAT.py
@@ -0,0 +1,24 @@
+def greet(name):
+    return
+
+def increament (i):
+    return i+1 
+    
+t = int(input())
+for _ in range (t):
+    n= int(input())
+    count = 0 
+    lista = [] 
+    for i in range (n)  :
+        lista.append([int(x) for x in input().split()])
+    for i in range (n-1,0,-1) :
+        todo = increament(lista[i][i-1]) 
+        if todo == lista[i][i] :
+            greet("dhruvil")
+        else :
+            count = increament(count) 
+            to = increament(i)
+            for j in range (to):
+                for k in range (j,to):
+                    lista[j][k] , lista[k][j] = lista[k][j] , lista[j][k]
+    print(count)
\ No newline at end of file

From e82056a857b0f49e5821595dbb42e8cffad648b4 Mon Sep 17 00:00:00 2001
From: Dhruvil Manish Shah <dhruvilshah077@gmail.com>
Date: Thu, 1 Oct 2020 20:56:46 +0530
Subject: [PATCH 2/5] Delete ADAMAT.py

---
 ADAMAT.py | 24 ------------------------
 1 file changed, 24 deletions(-)
 delete mode 100644 ADAMAT.py

diff --git a/ADAMAT.py b/ADAMAT.py
deleted file mode 100644
index 9a5b095..0000000
--- a/ADAMAT.py
+++ /dev/null
@@ -1,24 +0,0 @@
-def greet(name):
-    return
-
-def increament (i):
-    return i+1 
-    
-t = int(input())
-for _ in range (t):
-    n= int(input())
-    count = 0 
-    lista = [] 
-    for i in range (n)  :
-        lista.append([int(x) for x in input().split()])
-    for i in range (n-1,0,-1) :
-        todo = increament(lista[i][i-1]) 
-        if todo == lista[i][i] :
-            greet("dhruvil")
-        else :
-            count = increament(count) 
-            to = increament(i)
-            for j in range (to):
-                for k in range (j,to):
-                    lista[j][k] , lista[k][j] = lista[k][j] , lista[j][k]
-    print(count)
\ No newline at end of file

From fabcb7d6ba8161ebc2a154aa64851b3df7ccff34 Mon Sep 17 00:00:00 2001
From: Dhruvil Manish Shah <dhruvilshah077@gmail.com>
Date: Thu, 1 Oct 2020 20:58:55 +0530
Subject: [PATCH 3/5] CREATE CHEF AND TREES

---
 Codechef/SeptemberLong/TREE2.cpp | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 Codechef/SeptemberLong/TREE2.cpp

diff --git a/Codechef/SeptemberLong/TREE2.cpp b/Codechef/SeptemberLong/TREE2.cpp
new file mode 100644
index 0000000..52ad614
--- /dev/null
+++ b/Codechef/SeptemberLong/TREE2.cpp
@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std ;
+bool isZero(long long int k){
+    return (k == 0);
+}
+
+void solution ( long long int n ){
+    long long int a[n] , i , count = 0 ;
+    for ( i = 0 ; i < n ; i++ )
+        cin >> a[i] ;
+    sort ( a , a + n );
+    unordered_set<long long int> s; 
+    for (int i=0; i<n; i++) 
+    {
+        if (s.find(a[i])==s.end() && a[i] != 0 ) 
+        { 
+            s.insert(a[i]);
+            count++ ; 
+        } 
+    } 
+    cout << count << endl ;
+} 
+
+int main () {
+    long long int n ,t ;
+    cin >> t ;
+    while ( t-- ){
+        cin >> n ;
+        solution (n);
+    }
+}
\ No newline at end of file

From 058dd0a9a53c970966c356e8a32fcb5b1b708694 Mon Sep 17 00:00:00 2001
From: Dhruvil Manish Shah <dhruvilshah077@gmail.com>
Date: Fri, 2 Oct 2020 14:54:35 +0530
Subject: [PATCH 4/5] Delete TREE2.cpp

---
 Codechef/SeptemberLong/TREE2.cpp | 31 -------------------------------
 1 file changed, 31 deletions(-)
 delete mode 100644 Codechef/SeptemberLong/TREE2.cpp

diff --git a/Codechef/SeptemberLong/TREE2.cpp b/Codechef/SeptemberLong/TREE2.cpp
deleted file mode 100644
index 52ad614..0000000
--- a/Codechef/SeptemberLong/TREE2.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std ;
-bool isZero(long long int k){
-    return (k == 0);
-}
-
-void solution ( long long int n ){
-    long long int a[n] , i , count = 0 ;
-    for ( i = 0 ; i < n ; i++ )
-        cin >> a[i] ;
-    sort ( a , a + n );
-    unordered_set<long long int> s; 
-    for (int i=0; i<n; i++) 
-    {
-        if (s.find(a[i])==s.end() && a[i] != 0 ) 
-        { 
-            s.insert(a[i]);
-            count++ ; 
-        } 
-    } 
-    cout << count << endl ;
-} 
-
-int main () {
-    long long int n ,t ;
-    cin >> t ;
-    while ( t-- ){
-        cin >> n ;
-        solution (n);
-    }
-}
\ No newline at end of file

From a8a18571f8bd9fc84c2910a7a394190c9188a886 Mon Sep 17 00:00:00 2001
From: Dhruvil Manish Shah <dhruvilshah077@gmail.com>
Date: Fri, 2 Oct 2020 14:55:02 +0530
Subject: [PATCH 5/5] ADDED CHEF AND TREE SEPTEMBER LONG

---
 Codechef/SeptemberLong/TREE2.py | 10 ++++++++++
 1 file changed, 10 insertions(+)
 create mode 100644 Codechef/SeptemberLong/TREE2.py

diff --git a/Codechef/SeptemberLong/TREE2.py b/Codechef/SeptemberLong/TREE2.py
new file mode 100644
index 0000000..96c2199
--- /dev/null
+++ b/Codechef/SeptemberLong/TREE2.py
@@ -0,0 +1,10 @@
+# cook your dish here
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    x = ( list(map(int,input().strip().split())))
+    x = set(x)
+    if 0 in x :
+        print(len(x)-1)
+    else :
+        print(len(x))
\ No newline at end of file