Programming Coding Contest
281 subscribers
1 photo
80 links
Download Telegram
Lucky? Codeforces Solution:-
https://bit.ly/3wm0h5L

Equal Candies Codeforces Solution:-
https://bit.ly/37Cv9GM

Most Similar Words Codeforces Solution:-
https://bit.ly/3ysM2Pg

X-Sum Codeforces Solution:-
https://bit.ly/3sp3QGW

Eating Queries Codeforces Solution:-
https://bit.ly/3M2YU2m

Longest Strike Codeforces Solution:-
https://bit.ly/3wjBnmZ

White-Black Balanced Subtrees Codeforces Solution:-
https://bit.ly/3ysMvku

Maximum Crossings (Easy Version) Codeforces Solution:-
https://bit.ly/3KVSpwN

Maximum Crossings (Hard Version) Codeforces Solution:-https://bit.ly/3kVClR5
Get Subscription CodeChef Solution:-
https://bit.ly/3L2wHar

Chef gives Party CodeChef Solution:-
https://bit.ly/3N8wuUU

Dominant Army CodeChef Solution:-
https://bit.ly/3FDzXbb

Circular Track CodeChef Solution:-
https://bit.ly/3wdqras

Good Pairs CodeChef Solution:-
https://bit.ly/3L5sjI3

Anti-knapsack CodeChef Solution:-
https://bit.ly/3wnfbIK

A Bit Easy CodeChef Solution:-
https://bit.ly/37DlyPY

Average Gift CodeChef Solution:-
https://bit.ly/3l1V9OU
Minimums and Maximums Codeforces Solution:-
https://bit.ly/3sycFyc

Robots Codeforces Solution:-
https://bit.ly/3l4orMR

Binary String Codeforces Solution:-
https://bit.ly/3NaroHA

Dog Walking Codeforces Solution:-
https://bit.ly/3w9oEo6

Moving Chips Codeforces Solution:-
https://bit.ly/3Nek1Py

Lenient Vertex Cover Codeforces Solution :-
https://bit.ly/3yCBg90
#include <bits/stdc++.h>
using namespace std;

int main() {
freopen("inputf.inp","r",stdin);
freopen("outputf.out","w",stdout);
int n;
cin >> n;
for(int i = 0 ; i < n ; i++)
{
int l1,r1,l2,r2;
cin >> l1 >> r1 >> l2 >> r2;
int res = l1 + l2;
if (l1 <= l2 && l2 <= r1) res = l2;
if (l2 <= l1 && l1 <= r2) res = l1;
cout << res << endl;
}
return 0;
}
Minimums and Maximums Codeforces Solution:-
https://bit.ly/3sycFyc

Robots Codeforces Solution:-
https://bit.ly/3l4orMR

Binary String Codeforces Solution:-
https://bit.ly/3NaroHA

Dog Walking Codeforces Solution:-
https://bit.ly/3w9oEo6

Moving Chips Codeforces Solution:-
https://bit.ly/3Nek1Py

Lenient Vertex Cover Codeforces Solution :-
https://bit.ly/3yCBg90
Programming Coding Contest pinned «#include <bits/stdc++.h> using namespace std; int main() { freopen("inputf.inp","r",stdin); freopen("outputf.out","w",stdout); int n; cin >> n; for(int i = 0 ; i < n ; i++) { int l1,r1,l2,r2; cin >> l1 >>…»
Rooks Defenders Codeforces Solution:-
https://bit.ly/3Ndr7nb

AvtoBus Codeforces Solution:-
https://bit.ly/3PnhQLp

Stone Age Problem Codeforces Solution:-
https://bit.ly/39hYqXE

Toss a Coin to Your Graph... Codeforces Solution:-
https://bit.ly/3NfA7s8


Typical Party in Dorm Codeforces Solution:-
https://bit.ly/39kYO7A

Formalism for Formalism Codeforces Solution :-
https://bit.ly/3MfV9GW
How many unattempted problems CodeChef Solution:-
https://bit.ly/3wr4uF3

Apples and Oranges CodeChef Solution:-
https://bit.ly/37RGyTe

Problems in your to-do list CodeChef Solution :-
https://bit.ly/3FQh2uc

Bucket and Water Flow CodeChef Solution:-
https://bit.ly/3lf4x1u

Maximum Pairwise Modular Sum CodeChef Solution :-
https://bit.ly/3yLijAS

Equal After And CodeChef Solution:-
https://bit.ly/3MmE26j
Rain in Chefland CodeChef Solution:-
https://bit.ly/3uShaVk

Scalene Triangle CodeChef Solution:-
https://bit.ly/3uPhVON

Convert to permutation CodeChef Solution 2022:-
https://bit.ly/3UTEhct

Akash and Dinner CodeChef Solution 2022:-
https://bit.ly/3BzVCjL
Hi
Greetings of the day to all.
Limited time offer:
LinkedIn Premium Business Plan is available at ALL TIME LOW cost.

DM now to get it: @mohitguptadev

Benefits:
• Get LinkedIn Premium Plan on your own account.
• Activation will be done within 2 mins.
• Available for both new and old users.
• Available at more than 80% discount from original price.

Note: It's only available for a few days, so DM asap or regret later.
Linkedin Business Premium 6 Month 💵💵

Price :- 999/-

Ib :- @mohitguptadev 🤴

🗿Limited Links In Stock