متاح الآن! بحث تيليغرام 2025 — أهم رؤى العام 
IBM Oa Help | Oa Exam Helper
الذهاب إلى القناة على Telegram
We are here to clear All types of Exams Admin : @Codercpp001 (aka) KMK ✅ INTERVIEW HELP AVAILABLE 1-Coding Round 2-Aptitude and Reasoning Round 3-Communication round 4-Resume building 🎉Job updates will be posted here.
إظهار المزيد1 156
المشتركون
لا توجد بيانات24 ساعات
لا توجد بيانات7 أيام
+730 أيام
أرشيف المشاركات
#include <bits/stdc++.h>
using namespace std;
struct Project {
int remaining_employees;
int index;
bool operator<(const Project& other) const {
return remaining_employees > other.remaining_employees;
}
};
int getMaxBonus(vector<int> max_employees, vector<int> bonus, int m) {
int n = max_employees.size();
priority_queue<Project> pq;
vector<int> current_employees(n, 1);
for (int i = 0; i < n; ++i) {
int remaining = max_employees[i] - 1;
pq.push({remaining, i});
}
while (m-- && !pq.empty()) {
Project top = pq.top();
pq.pop();
int idx = top.index;
int remaining = top.remaining_employees;
int assign = max(1, current_employees[idx] / 2;
current_employees[idx] += assign;
remaining -= assign;
if (current_employees[idx] < max_employees[idx]) {
pq.push({remaining, idx});
}
}
int total_bonus = 0;
for (int i = 0; i < n; ++i) {
if (current_employees[i] >= max_employees[i]) {
total_bonus += bonus[i];
}
}
return total_bonus;
}
Distinct order traversal
Element swapping
Intelligent substring
Contiguous substring
Get the grps
Do they belong
Distinct traversal
Oracle codes done 🤗✅✅
c++
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1e9 + 7, cc_total = 0;
void dfs(vector<ll> adj[], vector<bool> &visited, ll src)
{
if (visited[src])
return;
cc_total++;
// cout << src << " " << cc_total << " vis\n";
visited[src] = true;
for (auto i : adj[src])
{
dfs(adj, visited, i);
}
}
void solve()
{
int n, m, x, y, total = 0, cap = 1;
cin >> n >> m;
vector<ll> adj[n + 1];
vector<bool> visited(n + 1, false);
// for (int i = 1; i <= n; i++)
// {
// adj[i].push_back(i);
// }
for (int i = 0; i < m; i++)
{
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x); // for undirected
}
for (int j=1; j<=n; j++)
{
// for (auto j : i)
{
if (!visited[j])
{
cc_total = 0;
dfs(adj, visited, j);
total++;
cap = (cc_total*cap)%mod;
total %= mod;
// cout << endl;
cc_total = 0;
}
}
}
cout << total << " " << cap << "\n";
}
int main()
{
int t = 1;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
cin >> t;
while (t--)
{
solve();
}
return 0;
} Fire Escape Routes
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a,b;
cin>>a>>b;
if(a>=b){
cout<<"YES"<<endl;
}
else
cout<<"NO";
}
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int t;
cin>>t;
while(t--){
int a,b;
cin>>a>>b;
b=a-b;
long long int ans=pow(2,a+1);
ans-=2;
long long int ni=pow(2,b+1);
ni-=2;
cout<<ans-2*ni<<endl;
}
}
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> v;
char prev = '1';
for (int i = 0; i < n; i++) {
if (s[i] == '1') v.push_back(1);
if (s[i] == '0' && prev == '1') v.push_back(0);
prev = s[i];
}
int n0 = 0, n1 = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] == 1) n1++;
else n0++;
}
if (n0 >= n1) cout << "NO" << endl;
else cout << "YES" << endl;
}
int main() {
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 10000000;
int solve(int N, const string& a) {
vector<vector<int>> dp(N, vector<int>(3, 0));
if (a[0] != 'R') dp[0][0] = 1;
if (a[0] != 'P') dp[0][1] = 1;
if (a[0] != 'S') dp[0][2] = 1;
for (int i = 1; i < N; ++i) {
if (a[i] != 'R') {
dp[i][0] = (dp[i-1][1] + dp[i-1][2]) % MOD;
}
if (a[i] != 'P') {
dp[i][1] = (dp[i-1][0] + dp[i-1][2]) % MOD;
}
if (a[i] != 'S') {
dp[i][2] = (dp[i-1][0] + dp[i-1][1]) % MOD;
}
}
int ans = (dp[N-1][0] + dp[N-1][1] + dp[N-1][2]) % MOD;
return ans;
}.
RocK paper scissors ✅
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 101;
vector<int> primes;
vector<vector<int>> adj;
vector<vector<long long>> dp;
bool is_prime[MAXN];
void sieve() {
fill(is_prime, is_prime + MAXN, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < MAXN; ++i) {
if (is_prime[i]) {
primes.push_back(i);
for (int j = 2 * i; j < MAXN; j += i) {
is_prime[j] = false;
}
}
}
}
void preprocess(int N) {
sieve();
adj.clear();
adj.resize(N);
dp.clear();
dp.assign(N, vector<long long>(primes.size(), 1));
}
void dfs(int node, int par = -1) {
for (int ne : adj[node]) {
if (ne == par) continue;
dfs(ne, node);
for (int i = 0; i < (int)primes.size(); i++) {
long long t = 0;
for (int j = 0; j < (int)primes.size(); j++) {
if (is_prime[primes[i] + primes[j]]) continue;
t += dp[ne][j];
t %= MOD;
}
dp[node][i] *= t;
dp[node][i] %= MOD;
}
}
}
int solve(int N, vector<vector<int>> edges) {
preprocess(N);
if (N == 1) return primes.size();
for (vector<int> edge : edges) {
adj[edge[0]].push_back(edge[1]);
adj[edge[1]].push_back(edge[0]);
}
dfs(0);
long long ans = 0;
for (int i = 0; i < (int)primes.size(); i++) {
ans += dp[0][i];
ans %= MOD;
}
return ans;
}
int main() {
int N;
cin >> N;
vector<vector<int>> edges(N-1, vector<int>(2));
for (int i = 0; i < N-1; i++) {
cin >> edges[i][0] >> edges[i][1];
edges[i][0]--;
edges[i][1]--;
}
cout << solve(N, edges) << endl;
return 0;
}
prime tree code ✅
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
int n,m;
cin>>n>>m;
vector<int>ans(n);
if(n<=m){
for(int i=0;i<n;i++){
ans[i]=i+1;
}
}
else{
int k=n/m;
// int r=n%m;
int j=0;
for(int i=0;i<n;i++){
ans[i]=j+1;
j++;
j%=m;
}
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
cout<<endl;
}
//madharchod dhoni
class Expert:
def init(self):
self.id = 0
self.topics = set()
self.languages = set()
class Customer:
def init(self):
self.topic = ""
self.language = ""
def assign_customers(customers, experts):
assigned_customers = set()
unhappy_customers = 0
for customer in customers:
assigned = False
for expert in experts:
if customer.topic in expert.topics and customer.language in expert.languages and expert.id not in assigned_customers:
assigned_customers.add(expert.id)
assigned = True
break
if not assigned:
unhappy_customers += 1
return unhappy_customers
def main():
num_experts = int(input())
experts = []
for _ in range(num_experts):
expert = Expert()
expert.id = int(input())
num_topics = int(input())
expert.topics = set(input() for _ in range(num_topics))
num_languages = int(input())
expert.languages = set(input() for _ in range(num_languages))
experts.append(expert)
num_customers = int(input())
customers = []
for _ in range(num_customers):
customer = Customer()
customer.topic, customer.language = input().split()
customers.append(customer)
unhappy_count = assign_customers(customers, experts)
print(unhappy_count)
if name == "main":
main()
Matchmaking 2
