khatribiru's blog

By khatribiru, 2 years ago, In English

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

Read more »

 
 
 
 
  • Vote: I like it
  • +38
  • Vote: I do not like it

By khatribiru, history, 3 years ago, In English
 
 
 
 
  • Vote: I like it
  • +75
  • Vote: I do not like it

By khatribiru, history, 4 years ago, In English

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.

Read more »

 
 
 
 
  • Vote: I like it
  • +199
  • Vote: I do not like it

By khatribiru, history, 4 years ago, In English

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

Read more »

 
 
 
 
  • Vote: I like it
  • +15
  • Vote: I do not like it

By khatribiru, 5 years ago, In English

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.

Read more »

 
 
 
 
  • Vote: I like it
  • +15
  • Vote: I do not like it