Awesome Open Source
Awesome Open Source

Accepted problems of codeforces

handle : _lucifer_

In case you want to contribute:

  1. if the solution already exists then it will not be merged.
  2. follow the naming convention. e.g: 107D. name of the problem.cpp
  3. provide the link to your accepted solution in the PR

things i often forget while coding:

sorting in python3 using lambda:

assuming that x is a tuple and sorting will depend on x[0], if x[0] is equal then x[1]

data.sort(key = lambda x: (x[0], x[1]))

assuming x is a class where it has two int attributes: id, marks

data.sort(key = lambda x: (, x.marks))

declaring 2D array of N * M size in python:

board = [['X' for i in range(M)] for j in range(N)]

declaring 2D empty array in python:

arr = []
for i in range(n):

priority queue with custom comparator

class comparator
    // Type is variable type or any user defined object 
    bool operator() (Type a, Type b)
        // return according to your need

std::priority_queue<pair<int, int>, vector<pair<int, int>>, comparator> pq;

policy based data structures:

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

typedef tree<

int main(){
  ordered_set s;
  cout << s.order_of_key(6) << endl;  // this will output 2 as there are two numbers in the set that are less than 6

custom comparator in c#

// this goes inside the class
public int CompareTo(Node other)
    if (this.c == other.c) return this.value.CompareTo(other.value);
    return this.c.CompareTo(other.c);
Related Awesome Lists
Top Programming Languages
Top Projects

Get A Weekly Email With Trending Projects For These Topics
No Spam. Unsubscribe easily at any time.
Python (807,639
C Plus Plus (238,912
Array (24,630
Data Structure (9,596
2d Graphics (9,124
Codeforces (872
Problem Solving (737
Algorithms And Data Structures (701
Codeforces Solutions (92
Competettive Programming (17
Codeforces Problems (14