Target audience: newbies and pupils (rating up to 1400).
Group link: https://codeforces.com/group/yg7WhsFsAp/contests (hit "join" on the right).
Hi. Enjoy a series of 8 problem lists for beginners. The example topics are strings, arrays, math, and binary search. You are allowed to discuss anything with others, or just look up solutions online. There are also 3 exams, each recommended for a 2-hour individual virtual participation. Use the displayed order, e.g. take exam 1 after day 3. It all should take you 2 weeks of intense bootcamp-like work (or a few months if you take your time).
The problems were originally used two years ago in a Saudi Arabia camp. It's a mix of around 70 existing CF problems and 30 new original problems, mainly prepared by kostka, with some help from me and mustafabar. I asked them for permission to publish everything.
I will put hints to some problems in this blog (or in the group? not sure). Expect a few videos and/or streams for beginners too. You should also read two first chapters of Competitive Programmer's Handbook.
UPD: On Sunday evening I'm making a stream with explanations to a few hard problems: P8, P11, P18, P30, P31, P33. You can try it with hints first:
Thanks a lot :D I'll try to solve all of them in the upcoming days
It is really usefull
Can those not in the rating range specified above not submit ?
Edit : Just checked, they can
You are allowed, but the problems should be easy and boring for you.
you mind putting some more tough questions in there .
These are problems from a camp two years ago. The participants were beginners just after learning basic C++.
can user or python also solve it because you mentioned C++. Btw I have solved some them already and its in my favourite.
Can you prepare another one for 1400 to 1600? I will be very helpful! And thanks for preparing this one. I will submit these problems.
There is no problem numbered P17 in day 2
Oh, you are right. I see now that we removed it back then because it required an algorithm that participants didn't know yet. It was 1041B - Buying a TV Set.
I've renumerated problems.
Reminds me of whenever I say I should start over competitive programming from the beginning since I am not good at the basics.
I have just finished the basics of java and solved 100 URI basic problems and some hackerrank easy problems. need to read the first two chapters of "Competitive Programmer's Handbook". it will take some time. I will try it.
I have a question. if someone wants to try it after 3/4 months will these problems will be there?
Sure. I don't plan to ever hide these problems.
When I try to register it says "you are not allowed to enter", I am new to this platform. how to register for this.
Actually it says " You are not allowed to take part in the group contest "
Come on. Read the top of the blog. Or just scroll up by a few comments.
hey there i am trying to solve Day 2 P13 lost rectangle problem for almost a day now and ain't able to come up with a possible solution nor could find anything on the interent to help, coud anyone please help my with some possible idea . I would be realy helpful.
https://codeforces.com/group/yg7WhsFsAp/contest/355493/problem/P13
Prime is a big hint in itself.
The Area A is made by two integer (as given) sides. So, using this fact you can determine that for any integer to be the height or breadth of rectangle, It should evenly divide the A.
Just find all the prime factors of A, and then say for any factor p, we can treat it as 1 of the side of rectangle. Therefore, the other side is A/p. Now, you have both the side. Find the Perimeter using the same idea for all the factors of A, and print minimum one to the result.
You use one word incorrectly:
"prime" -> "divisor"
If the area is 100, possible shorter side lengths are 1, 2, 4, 5, 10. These are divisors, not primes.
I don't know if it is right to discuss it here, but it is related to a question in this bootcamp. do let me know if I am not supposed to ask or post anything here. I am new to this platform.
In a particular problem if I use.
for(size_t i =0; i<=sqrt(n) ; i++) //The answer gets accepted
is there any difference(in performance)? if yes then an explanation will be helpful.
i * i
overflows. You need to use(long long) i * i
.someone help me solving [problem:P48]
Help in Problem P05 of day1 !
Would you explain please !, why s.length() -7 ?
Errichto did a video on this exact topic 2 weeks ago. Link below starts at (4:35) but watch the whole video:
https://www.youtube.com/watch?v=hPX1pjG1wwY&ab_channel=Errichto
Thank you bro !
Would you still recommend this if we've already completed the A2OJ ladder rated for <=1300?
Help with problem P06 — Helpful Maths ! ,Day 1.
Erricto! Why are you showing the people and me exclusive,these problems why are you making them lazy motivate them for solving hard problem tell them how you struggled at reaching this level.
Thanks..
Please help in p54 https://codeforces.com/group/yg7WhsFsAp/contest/355504/problem/P54. Why XOR works??
XOR of two equal numbers is 0. So also XOR of any even number of equal numbers is 0.
Thank you so much!!
Hi .. i am a beginner in the competitive arena but in the problem 63 ..for example if n=8 and m m=8 and the list n is
a,b,c,d,e,f,g and list m is a,b,c,d,e,i,j
Then is for example polandball and enemyball use this order -> g from n , a from m , then f and b , then e and c , then d and i , then polandball will lose ,, because it has nothing new to say
On the other hand consider this order
a and b , c and d , e and i , f and j , g and .. therefore enemyball wins.
So can someone please clarify how are we choosing which words are spoken first or do we need to set a priority to make polandball win ?
Because in this case winning is possible for both
Since someone necro'd this, I request 100 hard problems bootcamp!
I need someone to explain super primes https://codeforces.com/group/yg7WhsFsAp/contest/355495/problem/E , I didn't know how to get the prime number is a product from two primes
thnks : ) I want to become a competitive programmer like you. I think this will help me about it.
Please give hints/solutions for other problems too
Great