done

Author: Hard-Coder05

CF1.cpp

@@ -6,7 +6,6 @@ GitHub: https://github.com/Hard-Coder05
 #############################################
 */
 #include <bits/stdc++.h>
-
 #define endl "\n"
 #define max(a, b) (a < b ? b : a)
 #define min(a, b) ((a > b) ? b : a)
@@ -29,35 +28,5 @@ int main()
 	cin >> tc;
 	while (tc--)
 	{
-		ll n, x;
-		cin >> n >> x;
-		ll arr[n];
-		ll sum = 0;
-		for (ll i = 0; i < n; i++)
-		{
-			cin >> arr[i];
-			sum += arr[i];
-		}
-		if (sum == x)
-			cout << "NO" << endl;
-		else
-		{
-			cout << "YES" << endl;
-			ll currsum = 0;
-			for (ll i = 0; i < n; i++)
-			{
-				currsum += arr[i];
-				if (currsum == x)
-				{
-					cout << arr[i + 1] << " " << arr[i] << " ";
-					i++;
-				}
-				else
-				{
-					cout << arr[i] << " ";
-				}
-			}
-			cout << endl;
-		}
 	}
 }

CF2.cpp

@@ -17,15 +17,6 @@ GitHub: https://github.com/Hard-Coder05
 	cout.tie(NULL);
 using namespace std;
 typedef long long ll;
-bool isPerfectSquare(long double x)
-{
-	if (x >= 0)
-	{
-		long long sr = sqrt(x);
-		return (sr * sr == x);
-	}
-	return false;
-}
 int main()
 {
 	FIO;
@@ -37,11 +28,5 @@ int main()
 	cin >> tc;
 	while (tc--)
 	{
-		long double n;
-		cin >> n;
-		if (isPerfectSquare(n / 2) || isPerfectSquare(n / 4))
-			cout << "YES" << endl;
-		else
-			cout << "NO" << endl;
 	}
 }

CF5.cpp

@@ -7,22 +7,26 @@ GitHub: https://github.com/Hard-Coder05
 */
 #include <bits/stdc++.h>
 #define endl "\n"
-#define max(a, b) (a < b ? b : a) 
-#define min(a, b) ((a > b) ? b : a) 
+#define max(a, b) (a < b ? b : a)
+#define min(a, b) ((a > b) ? b : a)
 #define MOD 1000000007
 #define INF 1000000000000000003
-#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
+#define FIO                           \
+	ios_base::sync_with_stdio(false); \
+	cin.tie(NULL);                    \
+	cout.tie(NULL);
 using namespace std;
 typedef long long ll;
-int main() {
+int main()
+{
 	FIO;
 #ifndef ONLINE_JUDGE
 	freopen("input.txt", "r", stdin);
 	freopen("output.txt", "w", stdout);
 #endif
 	ll tc;
 	cin >> tc;
-	while (tc--) {
-		
+	while (tc--)
+	{
 	}
 }

CF6.cpp

@@ -7,22 +7,26 @@ GitHub: https://github.com/Hard-Coder05
 */
 #include <bits/stdc++.h>
 #define endl "\n"
-#define max(a, b) (a < b ? b : a) 
-#define min(a, b) ((a > b) ? b : a) 
+#define max(a, b) (a < b ? b : a)
+#define min(a, b) ((a > b) ? b : a)
 #define MOD 1000000007
 #define INF 1000000000000000003
-#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
+#define FIO                           \
+	ios_base::sync_with_stdio(false); \
+	cin.tie(NULL);                    \
+	cout.tie(NULL);
 using namespace std;
 typedef long long ll;
-int main() {
+int main()
+{
 	FIO;
 #ifndef ONLINE_JUDGE
 	freopen("input.txt", "r", stdin);
 	freopen("output.txt", "w", stdout);
 #endif
 	ll tc;
 	cin >> tc;
-	while (tc--) {
-		
+	while (tc--)
+	{
 	}
 }

input.txt

@@ -1,5 +0,0 @@
-4
-2
-4
-6
-1

output.txt

@@ -1,4 +0,0 @@
-YES
-YES
-NO
-NO