MORGAN STANLEY OA Help : Interview Help
رفتن به کانال در Telegram
Codeforces Codechef Leetcode AtCoder GFG CodeStudio All Contests Solutions available.
نمایش بیشتر894
مشترکین
-124 ساعت
-27 روز
-530 روز
آرشیو پست ها
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
string s;
cin>>s;
int ans = 0;
for(int i=0;i<n;i++){
if(s[i]=='B'){
ans++;
i+=k-1;
}
}
cout<<ans<<endl;
}
return 0;
}
// D
int answer = 0;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
if (v[i][j] == 'X')
answer += min(min(i, j) + 1, 10 - max(i, j));
cout << answer << endl;
// c
void b()
{
int n;
cin >> n;
vector v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int answer = 0;
for (int i = 0; i < n; i++)
{
int currentProduct = 1;
v[i]++;
for (int j : v)
currentProduct *= j;
answer = max(answer, currentProduct);
v[i]--;
}
cout << answer << endl;
}
// B
Those who are from NITs or IIITs please dm me, I need little bit of your help.
@cp_wala
void LockpickingChef()
{
int n, m;
cin >> n >> m;
string s, k;
cin >> s;
cin >> k;
int ans = INT_MAX;
for (int i = 0; i < n; i++)
{
int curr = 0;
if (i + m - 1 == n)
{
cout << ans << endl;
return;
}
for (int j = i; j < i + m; j++)
curr += min((10 + (k[j - i] - '0') - (s[j] - '0')) % 10, (10 - (k[j - i] - '0') + (s[j] - '0')) % 10);
ans = min(ans, curr);
}
cout << ans << endl;
}
// Work Smarter, Not Harder
void code_iske_andar_hai()
{
int l, v1, v2;
cin >> l >> v1 >> v2;
int t1 = (l + v1 - 1) / v1;
if (v1 == 1)
t1 = l;
int t2 = (l + v2 - 1) / v2;
if (v2 == 1)
t2 = l;
cout << abs(t1 - t2)-1 << endl;
}
class Solution
{
public:
int maxNumberOfAlloys(int n, int k, int budget, vector> &composition, vector &stock, vector &cost)
{
vector> required_stock(k, vector(n, 0));
for (int i = 0; i < k; ++i)
for (int j = 0; j < n; ++j)
required_stock[i][j] = (long long)composition[i][j] * (long long)cost[j];
long long left = 0, right = 1e9, result = 0;
while (left <= right)
{
long long mid = left + (right - left) / 2;
bool can_create = false;
for (int machine = 0; machine < k; ++machine)
{
long long total_cost = 0;
for (int i = 0; i < n; ++i)
{
long long diff = mid * composition[machine][i] - stock[i];
if (diff > 0)
total_cost += diff * cost[i];
}
if (total_cost <= budget)
{
can_create = true;
break;
}
}
if (can_create)
{
result = mid;
left = mid + 1;
}
else
{
right = mid - 1;
}
}
return result;
}
};
// C
class Solution
{
public:
int countWays(vector &arr)
{
int n = arr.size(), answer = 0;
sort(arr.rbegin(), arr.rend());
reverse(arr.begin(), arr.end());
if (arr[0] > 0)
answer = 1;
if (n > arr[n - 1])
answer++;
for (int idx = 0; idx < n - 1; idx++)
if ((idx + 1) > arr[idx])
if ((idx + 1) < arr[idx + 1])
answer++;
return answer;
}
};
// B
class Solution
{
int bits[1001];
void init()
{
bits[0] = 0;
for (int idx = 1; idx < 1001; idx++)
bits[idx] = (idx & 1) + bits[idx / 2];
}
public:
int sumIndicesWithKSetBits(vector &arr, int k)
{
init();
int sm = 0;
for (int idx = 0; idx < arr.size(); idx++)
if (bits[idx] == k)
sm += arr[idx];
return sm;
}
};
// A
