Codeforces|Leetcode|Codechef free solutions
Open in Telegram
Free codeforces, Codechef, Leetcode solutions are available 😍😍😍😍😍😍 Helped More than 200+ students to crack coding round in 2022 and helped placed them in Good companies. 🥳🥳🥳🤩🤩🤩 Dm @Cpsoln if you want help in coding round.
Show more4 317
Subscribers
No data24 hours
-137 days
-5230 days
Posts Archive
If anyone have Salesforce oa at 24 June
Then dm @Cpsoln
Repost from Codeforces|Leetcode|Codechef free solutions
+2Since your placement and intern session is coming 🤓🤓
So don't miss any opportunity in this recession😇😇😇😇
📌📌📌📌📌📌📌📌📌📌📌📌
No scam No fraud because we are not like other telegram channels.
If you want help in coding round of any company then Dm @Cpsoln and book your slot ✅✅✅✅
📌📌📌📌📌📌📌📌📌📌📌
This will be our main channel
I will send the solutions first here only
https://t.me/codinghub123
📌📌📌📌📌📌📌📌📌📌
Join fast guys this is my new channel.
Free solutions will be uploaded here
Join fast guys❤❤❤
I will upload solutions in both the channels
Repost from Codeforces|Leetcode|Codechef free solutions
ALT TAB :
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<string> arr(n);
for(int i = 0; i < n; i++)
cin>>arr[i];
unordered_map<string, int> mp;
string ans = "";
for(int i = arr.size()-1; i >= 0; i--)
{
string str = arr[i];
if(mp.find(str) != mp.end())
continue;
else
{
ans += str[str.size()-2];
ans += str[str.size()-1];
mp[str]++;
}
}
cout<<ans;
return 0;
}
ALT TAB :
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<string> arr(n);
for(int i = 0; i < n; i++)
cin>>arr[i];
unordered_map<string, int> mp;
string ans = "";
for(int i = arr.size()-1; i >= 0; i--)
{
string str = arr[i];
if(mp.find(str) != mp.end())
continue;
else
{
ans += str[str.size()-2];
ans += str[str.size()-1];
mp[str]++;
}
}
cout<<ans;
return 0;
}
https://t.me/codinghub123
📌📌📌📌📌📌📌📌📌📌
Join fast guys this is my new channel.
Free solutions will be uploaded here
Join fast guys❤❤❤
Can I make a backup channel because someone is not happy that I am sharing the code for free?
Don't buy solutions
When it is available for free🥳🥳🥳😁😁😁
void _segfault_()
{
ll n; cin >> n;
vectora(n); cin >> a;
sort(a.begin(), a.end());
vectorvv;
mapmpp;
for (ll i = 0; i < n; i++) {
ll v = log2(a[i]) + 1;
mpp[v]++;
vv.push_back(v);
}
sort(vv.begin(), vv.end());
ll x = mpp[vv[vv.size() - 1]];
cout << (x + 1) / 2 << endl;
}
Sare scammers ka business band hogya toh ab code jhuth bolke bech rhe
Stay alert guys no one has done C
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
ll n,m,h;
void solve(){
ll res=0,j=0;
cin>>n>>m>>h;
vector<ll>a1(n),a2(m);
for(ll i=0;i<n;i++)cin>>a1[i];
for(ll i=0;i<m;i++)cin>>a2[i];
sort(a1.begin(),a1.end());
sort(a2.begin(),a2.end());
reverse(a1.begin(),a1.end());
reverse(a2.begin(),a2.end());
for(ll i=0;i<n;i++){
if(j==m)break;
res+=min(a2[j]*h,a1[i]);j++;
}
cout<<res<<'\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tc;
cin>>tc;
while(tc--)
solve();
return 0;
}
int main() {
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
vector s(n);
for(int i=0;i>s[i];
}
int ans=0;
int count_a=0,count_B=0,count=0;
for(int i=0;i
