done

Author: Hard-Coder05

CF1.cpp

@@ -23,19 +23,6 @@ int main() {
 	ll tc;
 	cin >> tc;
 	while (tc--) {
-		ll n;
-		cin>>n;
-		map<ll,ll> mp;
-		for(int i=0;i<n;i++){
-			ll x;
-			cin>>x;
-			mp[x]++;
-		}
-		ll maxm=INT_MIN;
-		for(auto i:mp){
-			if(i.second>maxm)
-			maxm=i.second;
-		}
-		cout<<maxm<<endl;
+		
 	}
 }

CF2.cpp

@@ -14,24 +14,6 @@ GitHub: https://github.com/Hard-Coder05
 #define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 using namespace std;
 typedef long long ll;
-bool isDigitPresent(ll x, ll d) 
-{ 
-    while (x > 0) 
-    { 
-        if (x % 10 == d) 
-            break; 
-        x = x / 10; 
-    } 
-    return (x > 0); 
-}
-bool calc(ll n,ll d){
-while(n>=0){
-	if(isDigitPresent(n,d))
-	return true;
-	n-=d;
-}
-return false;
-}
 int main() {
 	FIO;
 #ifndef ONLINE_JUDGE
@@ -41,15 +23,6 @@ int main() {
 	ll tc;
 	cin >> tc;
 	while (tc--) {
-		ll q,d;
-		cin>>q>>d;
-		for(int i=0;i<q;i++){
-			ll x;
-			cin>>x;
-			if(calc(x,d))
-			cout<<"YES"<<endl;
-			else
-			cout<<"NO"<<endl;
-		}
+		
 	}
 }

input.txt

@@ -1,5 +0,0 @@
-2
-3 7
-24 25 27
-10 7
-51 52 53 54 55 56 57 58 59 60

output.txt

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