Errichto's blog

[GYM] 100 Easy Problems (Bootcamp)
By Errichto, 15 months ago, In English

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:

P08. Cashier
P11. Queens attack!
P18. Mountain peaks
P30. Temporarily unavailable
P31. Shuffle Hashing
P31. Shuffle Hashing, hint 2
P33. Thanos Sort
 
 
 
 
  • Vote: I like it
  • +251
  • Vote: I do not like it

Comments Comments (33)
| Write comment?
»
15 months ago, # |
  Vote: I like it +19 Vote: I do not like it

Thanks a lot :D I'll try to solve all of them in the upcoming days

→ Reply
»
15 months ago, # |
  Vote: I like it +7 Vote: I do not like it

It is really usefull

→ Reply
»
15 months ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

Can those not in the rating range specified above not submit ?

Edit : Just checked, they can

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    You are allowed, but the problems should be easy and boring for you.

    → Reply
»
15 months ago, # |
  Vote: I like it -8 Vote: I do not like it

you mind putting some more tough questions in there .

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    These are problems from a camp two years ago. The participants were beginners just after learning basic C++.

    → Reply
»
15 months ago, # |
  Vote: I like it -28 Vote: I do not like it

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.

→ Reply
»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

There is no problem numbered P17 in day 2

→ Reply
  • »
    »
    15 months ago, # ^ |
    ← Rev. 2   Vote: I like it +16 Vote: I do not like it

    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.

    → Reply
»
15 months ago, # |
  Vote: I like it +14 Vote: I do not like it

Reminds me of whenever I say I should start over competitive programming from the beginning since I am not good at the basics.

→ Reply
»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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?

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Sure. I don't plan to ever hide these problems.

    → Reply
»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

When I try to register it says "you are not allowed to enter", I am new to this platform. how to register for this.

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Actually it says " You are not allowed to take part in the group contest "

    → Reply
    • »
      »
      »
      15 months ago, # ^ |
        Vote: I like it +12 Vote: I do not like it

      Come on. Read the top of the blog. Or just scroll up by a few comments.

      → Reply
»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Hint 1
    Hint 2
    Hint 3
    → Reply
    • »
      »
      »
      15 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      You use one word incorrectly:

      Spoiler
      → Reply
»
14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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 * i <= n ; i++) //I get TLE where n is upto 10e12.

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.

→ Reply
  • »
    »
    14 months ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    i * i overflows. You need to use (long long) i * i.

    → Reply
»
14 months ago, # |
  Vote: I like it +1 Vote: I do not like it

someone help me solving [problem:P48]

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Help with problem P06 — Helpful Maths ! ,Day 1.

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks..

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Please help in p54 https://codeforces.com/group/yg7WhsFsAp/contest/355504/problem/P54. Why XOR works??

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    XOR of two equal numbers is 0. So also XOR of any even number of equal numbers is 0.

    → Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Since someone necro'd this, I request 100 hard problems bootcamp!

→ Reply
»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

thnks : ) I want to become a competitive programmer like you. I think this will help me about it.

→ Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Please give hints/solutions for other problems too

→ Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Great

→ Reply