Codeforces|Leetcode|Codechef free solutions

Aman code done✅✅✅✅ Metrix code done✅✅✅✅ Dm @Cpsoln

Dm @Cpsoln for help in Accenture and Tcs nqt coding rounds

If anyone want to book slot for Accenture coding then Dm @Cpsoln

Since 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 ✅✅✅✅

Subscribe for more free solutions

Can Chef | Starters 85 Division 4 (Rated) | Codechef Solution #include<bits/stdc++.h> using namespace std; #define ll long long #define MOD 1000000007 #define SIZE 1e6+2 #define endl "\n" void solve(){ ll x,y; cin>>x>>y; ll d= x*15; y=y*2; if(d>=y) cout<<"YES"<<endl; else cout<<"NO"<<endl; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll t; cin>>t; while(t--){ solve(); } return 0; }

If you want to win big in ipl then join @CRICKET_BETTING_TIPS_IPL12

Since your placement and intern session is coming 🤓🤓 So don't miss any opportunity 😇😇😇😇 📌📌📌📌📌📌📌📌📌📌📌📌📌 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 ✅✅✅✅

For TCS Nqt codes Dm @Cpsoln

If you want help in Coding rounds of any company then dm @Cpsoln Most trusted channel❤❤❤❤❤ If not satisfied with the work your money will be refunded 😇😇😇

If you want help in Coding rounds of any company then dm @Cpsoln Most trusted channel❤❤❤❤❤ If not satisfied with the work your money will be refunded 😇😇😇

If anyone want help in oa then dm @Cpsoln

If you want help in Coding rounds of any company then dm @Cpsoln Most trusted channel❤❤❤❤❤ If not satisfied with the work your money will be refunded 😇😇😇

https://t.me/contestsolution Share the channel for more free codes

After 2300+ subscribers I will upload d

Codeforces C 🥳🥳🥳🥳🥳 Enjoy guys Share this channel for more free solutions

#include<bits/stdc++.h> using namespace std; #define ll long long #define int long long #define Owner Piyush Kumar #define loop(o,n) for(int i=o;i<n;i++) #define sort(a) sort(a.begin(),a.end()) #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); #define print(a) for(auto &i : a) #define lower_bound(v,x) lower_bound(v.begin(),v.end(),x) #define upper_bound(v,x) upper_bound(v.begin(),v.end(),x) #define pb push_back const int dx[] = { 0, 1, 0, -1 } ; const int dy[] = { 1, 0, -1, 0 } ; int32_t main() { fast int t; cin>>t; while(t--) { int n; cin>>n; vector<int>a(n); loop(0,n) cin>>a[i]; bool flag = true; for(int i = n-1;i>0;i-=2) { if(a[i]<a[i-1]) { if(i-1==0) flag = false; else a[i-2]-=(a[i-1]-a[i]); } else { if(i-2>=0) a[i-2]+=(a[i]-a[i-1]); } } if(flag) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }

Cf C🥳🥳🥳🤩🤩🤩🤩

#include<bits/stdc++.h> using namespace std; #define ll long long #define int long long #define Owner Piyush Kumar #define loop(o,n) for(int i=o;i<n;i++) #define sort(a) sort(a.begin(),a.end()) #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); #define print(a) for(auto &i : a) #define lower_bound(v,x) lower_bound(v.begin(),v.end(),x) #define upper_bound(v,x) upper_bound(v.begin(),v.end(),x) #define pb push_back const int dx[] = { 0, 1, 0, -1 } ; const int dy[] = { 1, 0, -1, 0 } ; int32_t main() { fast int t; cin>>t; while(t--) { int n; cin>>n; int i = 1,j=2*n-2; vector<vector<int>>a(2,vector<int>(n,0)); for(int x=0;x<n-1;x++) { if(x&1) { a[1][x]=j-1; a[0][x+1]=j; j-=2; } else { a[1][x]= i; a[0][x+1] = i+1; i+=2; } } a[0][0]=2*n; a[1][n-1] = 2*n-1; for(auto &par : a){ for(auto &child : par) cout<<child<<" "; cout<<endl; } } return 0; }