Dekho Prime

03/05/2026

T20 Final

http://play.dekhoprime.live

10/02/2020

Highlights || Bangladesh vs India U19 ICC World Cup Final 2020 Match || Like || Share || Subscribe. Love you Bangladesh. Comments your best expression to con...

24/01/2020

In this video, I've shared how we can download official windows 10 iso file from Microsoft website without using any tools. 1st click here: https://www.micro...

22/01/2020

Khajna | 8D Audio Song. What is 8D Audio? 8D audio is basically an effect of music. It uses the power of left and right speakers through your headphones to g...

16/03/2019

Light OJ 1275 – Internet Service Providers [solved]

Visit the post for more.

16/03/2019

Hints: Mad Counting , It's really a mad counting problem. To solved this problem, you have to think in a different way while you are counting. Since we have to count the minimum possible populations, It's only possible when we can minimize the teams they are supported. Let's discuss with an example:- if N = 1; and poll result = … [ 166 more words ]

Hints: Mad Counting , It’s really a mad counting problem. To solved this problem, you have to think in a different way while you are counting. Since we have to count the minimum possible popu…

11/03/2019

Hints: Generate primes upto 10^7 and go through primes within an iterative approach and check: N- primes[i] is prime or not? Code: 160 more words

Hints: Generate primes upto 10^7 and go through primes within an iterative approach and check: N- primes[i] is prime or not? Code:

10/03/2019

LightOJ 1369 – Answering Queries [solved]

Visit the post for more.

04/03/2019

Joshephus Problem is a very interesting mathematical problem. To solve this problem you have to think bottom to top approach. Since at the end there must be one alive, before then there was two alive. Result can be found through recursive formula: for F(1, K) = 1; for F(N, K) = (F(N-1, K) + K-1)%n+1; until n!= 1; You can better understand…

Joshephus Problem is a very interesting mathematical problem. To solve this problem you have to think bottom to top approach. Since at the end there must be one alive, before then there was two ali…

03/03/2019

Light OJ – 1297 || Largest Box [solved]

Visit the post for more.