Deloitte ✅

m , n = map(int, input(). split())
print(m // n)

Deloitte ✅

Delloitte ✅

n, m = map(int, input().split())

b=m

a=n-m

res = 0

while a!=b and (a!=0 and b!=0):

    if a > b:

        a -= b

        res+=b

    else:

        b -= a

        res+=a

print(res)

n,m=map(int,input().split())
res=[]
arr=list(map(int,input().split()))
for i in arr:
    res.append(i&m)
   
c=[i for i in res if res.count(i)>1]
print(sorted(c))

Deloitte ✅

N = int(input())
for i in range(1, 11):
    result = N * i
    print(f"{N}*{i}={result}")

char solve(string o, string r) {
    string res = "";
    int j = 0;
    for (int i = 0; i < o.size(); i++) {
        if (o[i] != r[j]) {
            res += o[i];
        } else {
            j++;
        }
    }
    return res[0];
}

Tech Mahindra ✅

#include <bits/stdc++.h>
using namespace std;
void print(vector<int> &arr)
{
  for(auto e:arr) cout<<e<<" "; cout<<endl;
}
vector<int> solv(int n,vector<int> &arr)
{
  vector<int> soln;
  for(int i=0;i<n;i++)
  {
    if(arr[i]%2 == 0 || arr[i]%3 == 0 || arr[i]%5 == 0) soln.push_back(arr[i]);
  }
  return soln;
}
int main() 
{
    int n;
    cin>>n;
    vector<int> arr(n);
    for(int i=0;i<n;i++) cin>>arr[i];
    vector<int> ans = solv(n,arr); print(ans);
    return 0;
}

Deloitte ✅