done

Author: Hard-Coder05

CF1.cpp

@@ -16,32 +16,17 @@ using namespace std;
 using i64 = long long;
 using u64 = unsigned long long;
 using u32 = unsigned;
-void printDivisors(unsigned long long n)
-{	if(n%2==1){
-			cout<<"YES"<<endl;
-			return;
-		}
-    for (unsigned long long i = 1; i <= sqrt(n); i++) {
-        if ((n % i == 0)&&(i>1&&i&1)) {
-			cout<<i<<endl;
-			cout<<"YES"<<endl;
-			return;
-            }
-        }
-		cout<<"NO"<<endl;
-			return;
-}
 int main() {
 	FIO;
 #ifndef ONLINE_JUDGE
 	freopen("input.txt", "r", stdin);
 	freopen("output.txt", "w", stdout);
 #endif
-	unsigned long long tc;
+	int tc;
 	cin >> tc;
 	while (tc--) {
-		unsigned long long n;
+		int n;
 		cin >> n;
-		printDivisors(n);
+		cout<<n;
 	}
 }

CF2.cpp

@@ -25,23 +25,8 @@ int main() {
 	int tc;
 	cin >> tc;
 	while (tc--) {
-		int a,b,k;
-		cin >> a>>b>>k;
-		int arr1[a],arr2[b];
-		for(int i=0;i<k;i++)
-		cin>>arr1[i];
-		for(int i=0;i<k;i++)
-		cin>>arr2[i];
-		int count=0;
-		for(int i=0;i<k-1;i++){
-			int a1=arr1[i];
-			int b1=arr2[i];
-			for(int j=i+1;j<k;j++){
-				if(a1!=arr1[j]&&b1!=arr2[j]){
-					count++;
-				}
-			}
-		}
-		cout<<count<<endl;				
+		int n;
+		cin >> n;
+		cout<<n;
 	}
 }

CF3.cpp

@@ -27,12 +27,6 @@ int main() {
 	while (tc--) {
 		int n;
 		cin >> n;
-		if((n/2020)>=(n%2020))
-		cout<<"YES"<<endl;
-		else
-		{
-			cout<<"NO"<<endl;
-		}
-		
+		cout<<n;
 	}
 }

input.txt

@@ -1,10 +0,0 @@
-3
-3 4 4
-1 1 2 3
-2 3 2 4
-1 1 1
-1
-1
-2 2 4
-1 1 2 2
-1 2 1 2

output.txt

@@ -1,3 +0,0 @@
-4
-0
-2