Hello Codeforces Community,

I am glad to announce that there will be DEVSKILL CODING CONTEST-22 on 25th May, Friday at 11PM(UTC+6) in Dev Skill. Basically, Dev Skill is a Bangladeshi contest site which arranges two contests every month (one easy contest for beginners and another for everyone ).

This contest will consist of 6 problems and you will be given 2 hours to solve them all.

The score distribution for this contest is: 500 — 700 — 1000 — 1200 — 1500 — 2000

The problems were written and tested by fsshakkhor, bhadra, mahmud2690, BishalG, froghramar, ksohan, mrinmoi, ssavi and me.

We're inviting you all to join us in this contest. Hope you will enjoy solving problems.

Note : Problem's difficulty will be like Codeforces Div3 round

Good luck to all participants!

Ranklist

Congratulations to the winners!!

1. showmic96

2. PKP

3. mahbubcseju

4. njrafi

5. I_love_ProParThinkNot

This blog is just the list of problems for Persistent segment tree. Before start you can learn the topic from here , here & here

1.SPOJ,MKTHNUM,K-th Number

2.SPOJ,DQUERY,D-query

3.SPOJ,COT,Count on a tree

4.SPOJ,TTM,To the moon

5.lightoj,1188,Fast Queries

6.CF,813E,Army Creation

7.CF,707D,Persistent Bookcase

8.CF,762E,Radio stations

9.Hackerrank,Kth Number

10.CF,547E,Mike and Friends

11.CF,588E,Duff in the Army

12.CF,786C,Till I Collapse

13.CF,226E,Noble Knights Path

14.CF,653F,Paper task

15.Codechef,DISTNUM2,Easy Queries

16.CF,837G,Functions On The Segments

17.CF,484E,Sign on Fence

18.CF,464E,The Classic Problem

19.Devskill,301,Balanced array

20.CF,833B,The Bakery

21.Codechef,CLONEME,Cloning

22.HackerEarth,Dexter and Gangs

Note: Some problem may not need Persistent segment tree but can be solved using this.

Please share your knowledge, problems and links on this topic.

Happy New year 2018 to all CF community.

This Blog is Just the List of Problems for Dynamic Programming Optimizations.Before start read This blog.

1.Knuth Optimization

Read This article before solving Knuth optimization problems.

Problem 1 Problem 2 Problem 3 ( C ) Problem 4 Problem 5 Problem 6

2. Divide and Conquer Optimization

Read This article before solving Divide and Conquer Optimization problems

Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11

3. Convex Hull Trick Technique(CHT)

Read This article before solving problem based on CHT.

Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Problem 9 Problem 10 Problem 11

Note:- Some problems from Divide and conquer optimization section can also be solved using CHT.

Please, share your knowledge and links on the topic.

You are given an array of numbers( N ) (a[i]<= 10^6 && N<= 10^5 ) And 10^5 Queries. In each query You will be given.

X L R.

You have to find the how many numbers are there between L to R such that ( ( a[i] & X )== X ) . Thanks in Advance

Suppose we are given a array of N numbers. In How many ways we can arrange Numbers ,so that no two same numbers are together. 1<=N<=50 and 1<=array[i]<=16.