- Table of Contents
- What is Competitive Programming(CP)?
- What is a Problem?
- The Ultimate Question: Why should I start Competitive Programming?
- The Secret
- Seriously vs Sincerely
- What Progress is Really Like
- Which language should I use for CP?
- Where to write codes? What are the best IDEs?
- Competitive Programming Platforms
- How to Use Codeforces
- Details about problem statements, how contests work and the rating system on Codeforces (and a few other platforms)
- What to do if I don't know how to solve a problem?
- How to check others solutions?
- How to practice a problem efficiently?
- Virtual Contests
- Kidlin's Law
- [Contest]Solve some very basic problems.
- [Codes] Check how to solve the problems of Contest 1
- [Codes] Check how to solve the problems of Contest 2
- [Editorials and Codes] Check how to solve the problems of Contest 3
- FAQ
- Important Notes
- Getting into Competitive Programming
- Tutorial
- Life Hack(if you are from Bangladesh)
- How to do Topicwise Practice?
- Topic List (As you are feeling lazy to collect them by yourself!)
- Code Library
- The Art of Debugging
- Stress Testing
Writing code to solve problems or tasks is the essence of programming. Competitive programming turns this into a sport, with competitors competing (typically online) to solve a bunch of such problems in a restricted period of time.
"A programming competition generally involves the host presenting a set of logical or mathematical problems, also known as puzzles, to the contestants (who can vary in number from tens to several thousand), and contestants are required to write computer programs capable of solving each problem. Judging is based mostly upon several problems solved and time spent for writing successful solutions." - Wikipedia
A problem is often based on arithmetic, logic, and/or algorithms and looks somewhat like this. Such challenges often include a statement (detailing the task), the input and output format, and input, time and memory constraints.
Try to understand this problem, read the statement carefully, check the input-output constraints and solve this. When you get the idea of how to solve it, then code it and submit it to get your first AC (Accepted solution).
Here is the code for the problem in C++.
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
cout << 25 << '\n';
return 0;
}Well, I believe that the ultimate goal of my existence is to be happy. And I have learned from many well-established people that getting a great job or being famous or other common stereotypical goals won't make you happy as when you get used to those they become meaningless.
I think happiness is living your present with excitement.
That being said, now your main goal is to find something that will make you happy. There are lots of things you can do like being a musician or an artist etc. For me it was CP. I can lose myself in CP for hours and hours and still hold my excitement. A good contest is enough to make my day.
Man, I am not saying that you have to choose CP too. Find anything that suits you well, delve into that and maybe you will find peace.
Because I wanna spend my precious time on something so that in the end I can say with Heisenberg, "I did it for me. I liked it, I was good at it, and I was really... I was alive".
So what kinda benefits you will get by doing CP? - Fun and excitement(tons of it). - "Competitive programming builds the basics in you. You became so expert in coding anything that learning framework then becomes a very very easy task. Because when you learn to read the codes of hard or advanced algorithms, what can be more complex than those?
"CP programming makes you versatile, so you can move from any stack to other. But when you only learn a specific framework or stack, your knowledge gets bounded. You can compare learning any natural language with this. Let's say you want to learn German/English. You need to learn grammar first then you can write a paragraph. In coding, you can think of CP programming as grammar learning and frameworks as paragraph writing! When you know grammar you can write a paragraph on any topic. Even after a good or average (not the best) career in CP, you will find the database, distributed system, machine learning topics very much understandable to you."- Raihat Zaman Neloy
- You will find Interview problems much much easier if you do CP. Problem-solving skill is required in interviews and CP is the best and most exciting way to learn problem-solving.
- "Competitive programming is recognized and supported by several multinational software and Internet companies, such as Google and Meta (Facebook). Several organizations host programming competitions on a regular basis." - Wikipedia
- and many more...
Let's discuss something if you think CP is the thing that you wanna do.
Many of us set this goal like I wanna be red and continuously looking at the goal and not enjoying our current hard works. I am not red but I can guarantee myself that when I will be red I will be happy for a day or two and will get used to it. So what was my 3-4 years of hard work all about? Just a day of excitement? I don't believe in so. Wouldn't it be great if I could live those 3-4 years of my life with excitement? Well yes. This is what I am currently doing. I am living in the present, working hard and whether I become successful or not I will still be happy as I was alive throughout the whole process and lived my life to the fullest.
May you find that something that you have been looking for throughout your life!
Not everyone has the privilege to do the things that they enjoy doing. If you have that privilege, then it's really cool. But most people don't have that privilege. So "Instead of doing things you enjoy, learn to enjoy the things you do". And CP is one of the things that you can easily fall in love with.
If you find yourself approaching things too seriously like it's no fun playing a game if you take it "too seriously". So if you want to have fun, you should switch to approaching things sincerely, like you are still gonna give it all, but you are gonna recognize that this is a game and you are gonna try and enjoy yourself while doing it. This philosophy also applies in CP. Watch this for more.
Imagine that you have an ice cube sitting on the table in front of you.
The room is cold and you can see your breath. It is currently twentyfive degrees. Ever so slowly, the room begins to heat up.
Twenty-six degrees.
Twenty-seven.
Twenty-eight.
The ice cube is still sitting on the table in front of you.
Twenty-nine degrees.
Thirty.
Thirty-one.
Still, nothing has happened.
Then, thirty-two degrees. The ice begins to melt. A one-degree shift, seemingly no different from the temperature increases before it, has unlocked a huge change.
Breakthrough moments are often the result of many previous actions, which build up the potential required to unleash a major change. This pattern shows up everywhere. Cancer spends 80 percent of its life undetectable, then takes over the body in months. Bamboo can barely be seen for the first five years as it builds extensive root systems underground before exploding ninety feet into the air within six weeks.
Credit: The book Atomic Habit by James Clear
So don't get depressed after starting CP. It takes time to get your work reflected on your progress.
Most Competitive Programmers (more than 95%) use C++ mostly because it's quite faster than other languages and it has some great built-in libraries(Standard Template Library (STL)) to ease your life. There are also many other reasons for using C++.
You can also use other languages too but for CP C++ is better. Languages are just tools and it doesn't take more than a few days to understand the basics of a language.
Note that you don't have to be a master in C++ to start your CP journey. If you know the basics i.e. variables, data types, operators, conditions, functions and loops, then you are ready to start CP. You can learn them from here or any of your favourite youtube channels.
IDEs are where you will write your codes. You can use Sublime Text, Codeblocks, VS Code or any other IDE that you like.
I use Sublime Text. Check this to set up C++ in Sublime Text for Competitive Programming. Check this to set up useful tools and snippets for Sublime Text and this to find useful shortcuts.
Your sublime text should be something like this
Check this to setup C, C++, Java, Python in Visual Studio Code for Competitive Programming.
The most famous CP platform is Codeforces. Check this to know about more platforms.
Check this guide.
Details about problem statements, how contests work and the rating system on Codeforces (and a few other platforms)
Check this to get a detailed understanding of whats in a problem, what is meant by different verdicts (AC, WA, TLE, MLE, CE etc) and how contests work.
Most of the problems have editorials/tutorials. The tutorial link is normally attached to the problem statement. In particular, on Codeforces, you can find the link to the tutorial at the lower right side of the problem statement.
Example
Also, join this discord server(if you are from Bangladesh) to get help. Link: Bangladesh CP Server
Check this to check solutions for a specific problem on Codeforces.
For other platforms the way is similar. Just go to the submissions page for that problem and click on the ID of the submission.
You can follow other users on Codeforces and make them friends (click the star button on the right of the username on CF) and check their solutions using the "friends only" button. I like the coding styles of the following users:
- First of all, deeply understand what the problem asks you to do.
- Then you should try to solve it by yourself.
- At the first glance, it may look like you have no idea what that random alien-made problem is asking you to do. But take your time. Always try to solve the problem using brute force. After that try to make your solution more efficient.
- Ok, so still you have no idea how to solve the problem? Try to look at it from a whole new angle.
- "Keep trying while you have new ideas, then look up the editorial/tutorial after 15+ minutes of being completely stuck." - Kamil Debowski
- To be more precise, if you think you are getting into the solution, then take more time and try to solve it. But if you have no clue on how to solve it, then what is the point of wasting your valuable time? It will only slow down your improvement process.
- After solving a problem by looking at the editorial/others codes, think about why your way of thinking was not correct, what did you miss. This is reallyyyy important.
- Time to implement the problem. Try not to use any unnecessary macros. Try to make it more readable. It will help you debug the solution.
- After that read implementations of some skilled users (searching for some useful tricks or really nice implementations). This part is really important which will significantly improve your skill.
- If the problem uses a new idea/trick/algorithm which is a classic one i.e. it might be helpful in future then try to write that down so that in future you can easily access it.
- Now, let me ask you a question, what did you learn from this problem?
Virtual contests will give you a real-time experience. It enables the users to run the past contests in a special mode that would imitate a real competition. It feels just like a real contest with real contestants competing alongside the participant who writes a virtual contest. It won't affect your rating.
Do at least 3 virtual contests per week. Just pick any time and start a virtual contest from here: link.
Do upsolve. Problems you can't solve during a contest but was in your range should be solved after the contest. What is the meaning of a contest if you don't learn something that wasn't already known to you?
Kidlin's law: If you can write the problem down clearly then the matter is already half solved.
This is also the same here in CP. First, understand what the problem asks you to do. Then proceed to solve it. If you understand it correctly, then you are half done. So don't start solving without understanding what the problem demands.
Get familiar with problem-solving by solving these problems. You won't need to know anything other than the basics of a language to solve them.
Hint: How to Practice?
Goal: Solve at least
Pro Tip: To check your ranking on the standings page on Vjudge, click on settings on the contest page and then click on Show Practice Submissions.
smash me
Credit: Dhiman Sarker Bappi1. Problem A
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a; cin >> a ;
cout << "Hello, "<<a<< endl;
return 0;
}
2. Problem B
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a ; long long b ; char c; float d ; double e ;
cin >>a>>b>>c>>d>>e ;
cout <<a<< endl;
cout <<b<< endl;
cout <<c<< endl;
cout <<d<< endl;
cout <<e<< endl;
return 0;
}
3. Problem C
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b ;
cin >> a >> b ;
printf("%lld + %lld = %lld\n",a,b,a+b );
printf("%lld * %lld = %lld\n",a,b,a*b );
printf("%lld - %lld = %lld\n",a,b,a-b );
return 0;
}
4. Problem D
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b, c,d ;
cin >> a >> b >> c >> d ;
cout << "Difference = "<< (a*b)-(c*d) << endl ;
return 0;
}
5. Problem E
Code(C++)
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
double r ; cin >> r ;
cout << fixed << setprecision(9);
cout << r * r * 3.141592653 << endl;
return 0;
}
6. Problem F
Code(C++)
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
unsigned long long a,b;
cin >> a >> b ;
cout << a%10 + b%10 << endl ;
return 0;
}
7. Problem G
Code(C++)
G - Summation from 1 to N#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
unsigned long long a,b;
cin >> a ;
cout << (a*(a+1))/2 << endl ;
return 0;
}
8. Problem H
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
double a,b;
cin >> a >>b;
cout << "floor "<<a<<" / "<<b<<" = "<<floor(a/b)<<endl;
cout << "ceil "<<a<<" / "<<b<<" = "<<ceil(a/b)<<endl;
cout << "round "<<a<<" / "<<b<<" = "<<round(a/b)<<endl;
return 0 ;
}
9. Problem I
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a,b ; cin >> a >> b ;
(a >= b ) ? cout << "Yes\n" : cout << "No\n" ;
return 0 ;
}
10. Problem J
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a,b ; cin >> a >> b ;
(a % b == 0 or b%a==0 ) ? cout << "Multiples\n" : cout << "No Multiples\n" ;
return 0 ;
}
11. Problem K
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a,b,c ; cin >> a >> b >> c;
cout << min(a,min(b,c)) << " " << max(a,max(b,c)) << endl;
return 0 ;
}
12. Problem L
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
string a,b,c,d ;
cin >> a >> b >> c >> d ;
(b==d) ? cout << "ARE Brothers\n" : cout << "NOT\n" ;
return 0 ;
}
13. Problem M
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
char c;cin >> c ;
if(c >= 'A' and c <= 'Z') printf("ALPHA\nIS CAPITAL\n");
else if(c >= 'a' and c <= 'z') printf("ALPHA\nIS SMALL\n");
else printf("IS DIGIT\n");
return 0 ;
}
14. Problem N
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
char c;cin >> c ;
if(c >= 'A' and c <= 'Z') printf("%c", c+32);
if(c >= 'a' and c <= 'z') printf("%c", c-32);
return 0 ;
}
15. Problem O
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a,b ; char c ;
scanf("%d%c%d",&a,&c,&b) ;
if(c=='+') cout << a+b << endl;
if(c=='-') cout << a-b << endl;
if(c=='*') cout << a*b << endl;
if(c=='/') cout << a/b << endl;
return 0 ;
}
16. Problem P
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
string a ; cin >> a ;
if(a[0]%2==0) printf("EVEN\n");
else printf("ODD\n");
return 0 ;
}
17. Problem Q
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
double x,y ;
cin >> x >> y ;
if(x==0.0 and y==0.0) printf("Origem\n");
else if(x==0.0) printf("Eixo Y\n");
else if(y==0.0) printf("Eixo X\n");
else if(x >0.0 and y >0.0) printf("Q1\n");
else if(x <0.0 and y >0.0) printf("Q2\n");
else if(x <0.0 and y <0.0) printf("Q3\n");
else if(x >0.0 and y <0.0) printf("Q4\n");
return 0 ;
}
18. Problem R
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a ; cin >> a;
int y = a/365 ; a %= 365 ;
int m = a/30 ; a %= 30 ;
printf("%d years\n", y);
printf("%d months\n", m);
printf("%d days\n", a);
return 0 ;
}
19. Problem S
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
double a ; cin >> a ;
if(a < 0.0 or a > 100.0) printf("Out of Intervals\n");
else if(a <= 25.0) printf("Interval [0,25]\n");
else if(a <= 50.0) printf("Interval (25,50]\n");
else if(a <= 75.0) printf("Interval (50,75]\n");
else if(a <= 100.0) printf("Interval (75,100]\n");
return 0 ;
}
20. Problem T
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
int a[3],b[3] ;
for(int i=0 ; i < 3 ; i++) cin >> a[i] , b[i] = a[i] ;
sort(a,a+3) ;
for(int i=0 ; i < 3 ; i++) cout << a[i] << endl ; cout << endl ;
for(int i=0 ; i < 3 ; i++) cout << b[i] << endl ;
return 0 ;
}
21. Problem U
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
using namespace std;
int main()
{
double a ; cin >> a ;
if(ceil(a)==floor(a)) cout <<"int " << int(a) << endl ;
else cout << "float "<< int(a) << " " << a - int(a) << endl ;
return 0 ;
}
22. Problem V
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
#define r printf("Right\n")
#define w printf("Wrong\n")
using namespace std;
int main()
{
int a,b ; char c ;
scanf("%d %c %d" , &a , &c , &b) ;
if(c=='<') (a<b) ? r : w ;
if(c=='>') (a>b) ? r : w ;
if(c=='=') (a==b) ? r : w ;
return 0 ;
}
23. Problem W
Code(C++)
#include <bits/stdc++.h>
#include<iomanip>
#define yes printf("Yes\n")
#define w printf("Wrong\n")
using namespace std;
int main()
{
int a,b,ans ; char c ,d ;
scanf("%d %c %d %c %d" , &a , &c , &b , &d , &ans) ;
if(c=='+') (ans==a+b) ? yes : printf("%d\n", a+b);
if(c=='-') (ans==a-b) ? yes : printf("%d\n", a-b);
if(c=='*') (ans==a*b) ? yes : printf("%d\n", a*b);
return 0 ;
}
24. Problem X
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long l1,r1,l2,r2;
cin >> l1 >> r1 >> l2 >> r2;
if ((r1 < l2) || (r2 < l1)) printf("-1\n");
else cout << max(l1, l2) << " " << min(r1, r2) << endl;
return 0 ;
}
25. Problem Y
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d, sum;
cin >> a >> b >> c >> d ;
a %= 100 ;
b %= 100 ;
c %= 100 ;
d %= 100 ;
sum = a * b * c * d ;
sum %= 100;
if(sum<10) cout << 0 << sum << endl ;
else
cout << sum << endl ;
return 0;
}
26. Problem Z
Code(C++)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
ll a,b,c,d ;
cin >> a >> b >> c >> d ;
if(b*log(a) > d * log(c)) printf("YES\n");
else printf("NO\n");
return 0 ;
}
smash me
Credit: Diman Sarker Bappi1. Problem A
Code(C++)
// Author: YouKn0wWho
#include<bits/stdc++.h>
using namespace std;
int32_t main() {
int n; cin >> n;
for (int i = 1; i <= n; i++) {
cout << i << '\n';
}
return 0;
}2. Problem B
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ; cin >> n ;
if(n < 2) puts("-1") ;
for(int i=2 ; i <= n ; i+=2) {
cout << i << endl ;
}
return 0;
}
3. Problem C
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n ;
int odd = 0 , even = 0 , pos = 0 , neg = 0 ;
while(n--){
int x;
cin >> x ;
(x%2) ? odd++ : even++ ;
if(x!=0)
(x>0) ? pos++ : neg++ ;
}
printf("Even: %d\nOdd: %d\nPositive: %d\nNegative: %d", even , odd , pos, neg);
return 0;
}4. Problem D
Code(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
int flag = 0; ; ;;;;
int wrong = 0 ;
while(cin>>n){
if(n==1999) flag = 1;
if(flag==0) wrong++;
}
while(wrong--) printf("Wrong\n");
if(flag)printf("Correct\n");
return 0;
}5. Problem E
Code(C++)
// Problem: E. Max
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// // Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long mx = -INT_MAX;
for(int i=0 ; i < n ; i++){
long long x ;
cin >> x ;
if(x > mx){
mx = x ;
}
}
cout << mx << endl;
return 0;
}
6. Problem F
Code(C++)
7. Problem G
Code(C++)
// Problem: G. Factorial
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/G
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t ;
cin >> t ;
while (t--){
long long x,ans = 1 ;
cin >> x;
while(x){
ans *= x ;
x--;
}
cout << ans << endl;
}
return 0;
}
8. Problem H
Code(C++)
// Problem: H. One Prime
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/H
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n ;
if(n<2){
cout <<"NO"<<endl;
return 0;
}
for(int i=2 ; i < n ; i++) {
if(n%i==0) {
cout << "NO" << endl ;
return 0 ;
}
}
cout << "YES" << endl;
return 0;
}
9. Problem I
Code(C++)
// Problem: I. Palindrome
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/I
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin >> a ;
string b="";
bool ok = true;
int sz = a.size() - 1;
for(int i=0 ; i < sz/2 ; i++){
if(a[i]!=a[sz-i]){
ok = false;
break;
}
}
bool zero = false;
for(int i=sz ; i >= 0 ; i--){
if(a[i]!='0'){
cout << a[i] ;
zero = true;
}
if(zero and a[i]=='0') cout<<"0";
}
cout << (ok ? "\nYES" : "\nNO") << endl;
return 0;
}
10. Problem J
Code(C++)
// Problem: J. Primes from 1 to n
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/J
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int ans=0;
for(int i=2 ; i <= n ; i++){
int prime=1;
for(int j=2 ; j<i ; j++){
if(i%j==0){
prime = 0;
break;
}
}
if(prime==1) cout <<i<<" ";
}
return 0;
}
11. Problem K
Code(C++)
// Problem: K. Divisors
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/K
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=1 ; i <= n ; i++){
if(n%i==0){
cout << i << endl;
}
}
return 0;
}
12. Problem L
Code(C++)
// Problem: L. GCD
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/L
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int p,q ;
cin >> p >> q ;
while (p != q) {
if (p > q) {
p -= q;
} else {
q -= p;
}
}
cout << p << endl ;
//cout << __gcd(p,q) << endl;
return 0;
}
13. Problem M
Code(C++)
// Problem: M. Lucky Numbers
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/M
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
bool lucky(int x){
while(x){
int rem= x%10 ;
if(!(rem==4 or rem==7)) return false ;
x/=10 ;
}
return true;
}
int main()
{
int a,b;
cin >> a >> b ;
if(a>b) swap(a,b);
bool flag=true;
for(int i=a ; i<= b ; i++){
if(lucky(i)==true){
cout << i << " " ;
flag = false;
}
}
if(flag) cout << -1 << endl;
return 0;
}14. Problem N
Code(C++)
// Problem: N. Numbers Histogram
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/n
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
char ch ;
cin >> ch ;
int n ;
cin >> n ;
while(n--){
int x ;
cin >> x ;
while(x--){
printf("%c",ch) ;
}
printf("\n");
}
return 0;
}
15. Problem O
Code(C++)
// Problem: O. Pyramid
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/O
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin>>n;
for(int j=1 ; j <= n ; j++){
for(int i=1 ; i <= j ; i++ ){
printf("*");
}
printf("\n");
}
return 0;
}
16. Problem P
Code(C++)
// Problem: P. Shape1
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/P
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin>>n;
while(n--){
for(int i=0 ; i <= n ; i++ ){
printf("*");
}
printf("\n");
}
return 0;
}
17. Problem Q
Code(C++)
// Problem: Q. Digits
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/Q
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// // Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t ;
while(t--){
string a ;
cin >> a ;
for(int i=a.size()-1 ; i >= 0 ; i--) {
cout << a[i] << " " ;
}
printf("\n");
}
return 0;
}
18. Problem R
Code(C++)
// Problem: R. Sequence of Numbers and Sum
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/R
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// // Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
while(true){
int n,m;
cin >> n >> m ;
if(n<=0 or m<=0){
return 0 ;
}
if(n>m) swap(n,m);
int sum = 0 ;
for(int i=n; i <= m ; i++){
cout << i << " " ;
sum +=i ;
}
cout << "sum ="<<sum<<endl;
}
return 0;
}
19. Problem S
Code(C++)
// Problem: S. Sum of Consecutive Odd Numbers
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/S
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t ;
while(t--){
int a,b;
cin>>a>>b;
if(b<a) swap(a,b);
int sum = 0;
for(int i=a+1 ; i < b ; i++){
if(i%2) sum+=i;
}
cout << sum << endl ;
}
return 0;
}
20. Problem T
Code(C++)
// Problem: T. Shape2
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/T
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n ;
for(int i=1 ; i <= n ; i++){
for(int j=i ; j < n; j++){
printf(" ");
}
for(int j=1 ; j <= i*2-1 ; j++){
printf("*");
}
printf("\n");
}
return 0;
}
21. Problem U
Code(C++)
// Problem: U. Some Sums
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/U
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int digitSum(int x){
int sum = 0 ;
while(x){
sum += x%10 ;
x/=10 ;
}
return sum;
}
int main()
{
int n,a,b;
cin >> n >> a >> b ;
if(a>b) swap(a,b);
int ans = 0 ;
for(int i=1 ; i<= n ; i++){
int dSum = digitSum(i);
if(dSum >= a and dSum <= b){
ans += i ;
}
}
cout << ans << endl;
return 0;
}
22. Problem V
Code(C++)
// Problem: V. PUM
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/v
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin >> n ;
for(int i=1 ; i <= n*4 ; i++){
if(i%4==0) printf("PUM\n");
else printf("%d ", i);
}
return 0;
}
23. Problem W
Code(C++)
// Problem: W. Shape3
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/W
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n ;
for(int i=1 ; i <= n ; i++){
for(int j=i ; j < n; j++){
printf(" ");
}
for(int j=1 ; j <= i*2-1 ; j++){
printf("*");
}
printf("\n");
}
for(int i=n ; i >= 1 ; i--){
for(int j=i ; j < n; j++){
printf(" ");
}
for(int j=1 ; j <= i*2-1 ; j++){
printf("*");
}
printf("\n");
}
return 0;
}24. Problem X
Code(C++)
// Problem: X. Convert To Decimal 2
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/X
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t ;
while(t--){
long long x ;
cin >> x ;
int ones = 0 ;
while(x){
ones += (x%2);
x /= 2;
}
long long ans = 1 ;
for(int i=1 ; i <= ones ; i++){
ans *= 2;
}
cout << ans - 1<< endl;
//cout << pow(2,ones)-1 << endl;
}
return 0;
}
25. Problem Y
Code(C++)
// Problem: Y. Easy Fibonacci
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/Y
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a=0,b=1;
cin >> n ;
if(n==1) printf("0");
else{
printf("0 1") ;
for(int i=3 ; i <= n ; i++ ){
long long now = a + b ;
cout <<" "<<now;
a = b , b = now;
}
}
return 0;
}
26. Problem Z
Code(C++)
// Problem: Z. Three Numbers
// Contest: Codeforces - Sheet #2 (Loops)
// URL: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/Z
//
// Coded by : Dhiman Sarker Bappi (Dhimanda)
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k,s;
cin>>k >>s ;
int way=0;
for(int i=0 ; i <= k ; i++){
for(int j=0 ; j <= k ; j++){
if(i+j <= s and (s-(i+j))<=k) way++;
}
}
cout <<way<<endl;
return 0;
}
smash me
Credit: @MehediMubin, @tahmidarefin and @Tofayel and me1. Problem A
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
cout << a * b << '\n';
return 0;
}2. Problem B
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
cout << max(0, b - a + 1) << '\n';
return 0;
}3. Problem C
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
cout << max({a + (a - 1), b + (b - 1), a + b}) << '\n';
return 0;
}4. Problem D
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
double d; cin >> d;
cout << round(d) << '\n';
return 0;
}5. Problem E
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
if (n < 10) cout << "000" << n << '\n';
else if (n < 100) cout << "00" << n << '\n';
else if (n < 1000) cout << "0" << n << '\n';
else cout << n << '\n';
return 0;
}6. Problem F
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << '\n';
return 0;
}7. Problem G
Editorial: link
Code(C++)
#include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if((a - 1) / c == b / c) cout << -1 << '\n';
else cout << c * (b / c) << '\n';
return 0;
}8. Problem H
Editorial: link
Code(C++)
#include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
for(int i = 0; i <= 5000; i++){
for(int j = 0; j <= 5000; j++){
if(i * a + j * b == c){
cout << "Yes" << '\n';
return 0;
}
}
}
cout << "No" << '\n';
return 0;
}9. Problem I
Editorial: link
Code(C++)
#include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << ((a * a + b * b) < c*c ? "Yes" : "No") <<'\n';
return 0;
}10. Problem J
Editorial: link
Code(C++)
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
double a, b, ans;
cin >> a >> b;
ans = (a - b) / a * 100.0;
cout << fixed << setprecision(3) << ans << '\n';
return 0;
}11. Problem K
Editorial: link
Code(C++)
#include<iostream>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
cout << (n == m ? "Yes" : "No") << '\n';
return 0;
}12. Problem L
Editorial: link
Code(C++)
#include<iostream>
using namespace std;
int main(){
long long n;
cin >> n;
cout << 25 << '\n';
return 0;
}13. Problem M
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main(){
int S, T; cin >> S >> T;
int cnt = 0;
for(int a = 0; a <= S; a++){
for(int b = 0; a+b <= S; b++){
for(int c = 0; a+b+c <= S; c++){
if(a*b*c <= T) cnt++;
}
}
}
cout << cnt << endl;
}
14. Problem N
Editorial: link
Code(C++)
#include <iostream>
using namespace std;
typedef long long ll;
int T;
ll N;
int main()
{
cin >> T;
for (int t = 0; t < T; t++)
{
cin >> N;
ll power = 1;
while (2 * power <= N)
power *= 2;
cout << N*(N + 1) / 2 - 2 * (power * 2 - 1) << "\n";
}
return 0;
}
15. Problem O
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
int main() {
int k, s; cin >> k >> s;
int count = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (z >= 0 and z <= k) {
count++;
}
}
}
cout << count << '\n';
return 0;
}16. Problem P
Editorial: link
Code(C++)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int main()
{
cin.sync_with_stdio(0);
int sum = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) sum += s[i] - '0';
int ans = 1;
if (s.size() == 1) ans = 0;
while (sum > 9)
{
int temp = sum, newsum = 0;
while (temp)
{
newsum += temp % 10;
temp /= 10;
}
sum = newsum;
ans++;
}
cout << ans << endl;
return 0;
}
17. Problem Q
Editorial: link
Code(C++)
#include <iostream>
#include <cstdio>
using namespace std;
int fact(int n) {
int r = 0;
for(int i = 2; i * i <= n; ++i) {
if(n % i == 0) {
r++;
while(n % i == 0) n /= i;
}
}
if(n > 1)
r++;
return r;
}
int main() {
int n, c = 0;
cin >> n;
for(int i = 1; i <= n; ++i) {
if(fact(i) == 2)
c++;
}
cout << c << endl;
return 0;
}
18. Problem R
Editorial: link
Code(C++)
#include <iostream>
using namespace std;
int main()
{
int y;
cin >> y;
while (true)
{
y += 1;
int a = y / 1000;
int b = y / 100 % 10;
int c = y / 10 % 10;
int d = y % 10;
if (a != b && a != c && a != d && b != c && b != d && c != d)
{
break;
}
}
cout << y << endl;
return 0;
}
REMEMBER THAT SOLVING MORE PROBLEMS IS THE KEY
- What is the key to CP?
- Regarding Interviews and Jobs
- CP or Development?
- I need Advice
- When will I be a good CPer?
- Exercise (at least running) and drink more water. It will surprisingly boost up your learning capability.
- Getting AC is not the final goal, learning something new is the final goal. Exactly, for this reason, people solve thousands of problems but can't get better. You need to solve harder problems than your current level so that you can learn something new by solving that problem. Also, after you solve a problem, try to do it more efficiently if possible, look at others solutions. This way you will learn better and become better faster in the long run.
- After solving a problem, think about why your way of thinking was not optimal. This is important too.
- SOLVE MORE PROBLEMS.
Note: If your Codeforces rating is not at least 1900 then the aftermentioned topicwise practice is not needed, just learn basic stuffs and follow the tutorial linked above.
If you want a complete guideline like this for EVERYTHING about CP and you are from Bangladesh, then you can check out my academy and enroll in some courses that fits you well.
Link: YouKn0wWho Academy.
Actually the whole part of this repo till now is taken from a single class from one of my academy courses!
- Create a topic list(every possible category, from easy to advanced).
- Select a topic.
- Learn the topic.
- Solve lots of problems about that topic.
- Go to ii.
And of course, participate in every possible contests in every online judge.
- Run with n=1.
- Check overflow(long long vs int).
- Check all array bounds.
- Check if m, n aren’t misused.
- Printed enough new lines or extra new lines?
- Make sure output format is right(including YES/NO vs Yes/No or newline vs spaces).
- Have you cleared the vectors ?
- Make sure two ints aren’t multiplied to get a long long.
- Output enough digits after decimal point.
- Check the constraints again.
- When using multiple dfs recursions check if inside one dfs another dfs is called or not.
- Shouldn't you print the case number?
- Are you using the correct mod value?
- "I spent a lot of my time debugging my solution without any success, after the contest I discovered that the obstacles in the input is 'x' (small one) while I was thinking it was 'X' (capital), I lost a bronze medal because of it :(" - kingofnumbers
- Set or multiset?
- Different Variables with the same name?
- Inside 2d loop are you using i++ instead of j++?
- Are you using ceil function? Then remove it!
- Is inf large enough?
- For multiple queries are you returning 0 inside the queries?
- For max and min have you initialized the values by a good enough value?
- Are you using the local variable of the same name when global variable was required to be used?
- "Declared a counter of type char instead of int , resulted in passing of pretests and failing of system test. :)" - A random CF user
- "I subtracted 1 in a for loop from v.size(). Guess what happened when the input vector is empty?" - A random CF user
- "for (int i = n - 1; i--; i >= 0) instead of: for (int i = n - 1; i >= 0; i--) It passed pretests and failed systests" - A random CF user
- Are you using memset correctly?
- Use bool operators using brackets. Beware!!! E.g. ans = ans + k == 0 vs ans = ans + (k == 0).
- Have you deleted debug(x) lines? It might get you TLE!
- It may be scanf("%d" , x). where &x is missing.
- Instead of printing NO printed N0. (with a zero).
- Are you erasing values from a set or an stl while parallelly traversing the elements of the stl? Please don’t. This is not nice!
- Don't use scanf or printf while using ios_base.
- Still have no idea? Try to recode from scratch or see others solutions.
Also, remember to exercise and drink more water. It helps a lot.
Good luck 