Codeforces Ladder(For Beginners)

I've included 400 problems according to rating & solved count. All the problems are very effective to increase your cp knowledge. I've also included possible tags. So that, you can easily understand if the problem can be solved by you or you've study that theory.

Ladder link: https://docs.google.com/spreadsheets/d/1IIgvJyN2Bzu2bsGrJXdiosLOWGb5OzJRCPayRTdK7rw/edit?usp=sharing

Comments

Game Theory with examples

Game Theory with examples Introduction In this article I will be covering problems related to two players game in which it is assumed that both players play optimally and we have to find out the winner of the game. First we will look at the basic division of positions to winning and losing . Then we will see the Game of Nim and then see how it will be used to solve the Composite games . Basic Division of positions to winning and losing Problem Statement: Consider a simple game played by two players A and B . There are n stones on the table. Each player can pick 1 , 2 or 5 stones in each turn. Both players pick the stones alternately until the total number of stones left on the table is 0. The player unable to make the move will lose. Assuming that both the players play optimally, output the winner of the game. Solution: As you can see positions 1 , 2 and 5 are winning positions since the player can pick up all the stones and other player will n...

Breaking The Summation Formula (Part 1)

Q. f ( n ) = - 1 + 2 - 3 + .. + ( - 1) n n . Given n, find out f(n) Approach(1)- Bruteforce: 1. Calculation sum=n*(n+1)/2 2. loop[i=1,i=n : i+=2] odd+=i 3.ans=sum-2*odd Code: #include < bits / stdc ++. h > using namespace std ; int main (){ long long x ; cin >> x ; long long p =( x *( x + 1 ))/ 2 ; long long bad = 0 ; for ( long long i = 1 ; i <= x ; i += 2 ) bad += i ; cout << p - 2 * bad << endl ; } Approach(2)-Greedy: Basic: s=1+2+3+4+....+n Formula: sum=n*(n+1)/2= (n/2) + (n+1).2 ...

This lifeless coder is welcoming you!

Search This Blog