1051B - Relatively Prime Pairs - CodeForces Solution

greedy math number theory *1000

Please click on ads to support us..

Python Code: 

l, r = map(int, input().split())

print("YES")

for i in range(l, r, 2):
    print(i, i+1)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long int l,r;
	cin>>l>>r;
	cout<<"YES"<<endl;
	for(long long int i=l;i<=r;i+=2)
	{
		cout<<i<<" "<<i+1<<endl;
	}
}


Comments

Submit
0 Comments
More Questions

1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack
1354A - Alarm Clock
1543B - Customising the Track
1337A - Ichihime and Triangle
1366A - Shovels and Swords
919A - Supermarket
630C - Lucky Numbers
1208B - Uniqueness
1384A - Common Prefixes
371A - K-Periodic Array
1542A - Odd Set
1567B - MEXor Mixup
669A - Little Artem and Presents
691B - s-palindrome
851A - Arpa and a research in Mexican wave
811A - Vladik and Courtesy
1006B - Polycarp's Practice
1422A - Fence