Poll for JUNE17 Video Editorials

general
, , , ,
1

Hi everyone!

This month’s long challenge editorials are not out yet. Hence, I would like to invite you all to vote for 2 problems, for which I will be making video editorials.

https://strawpoll.com/5y796xr

Cheers!

EDIT:

Here is the first editorial on Prime Queries.

Here is the second editorial on CLONEME.

17 Likes
2

sir it should be better if you explain euler sum as well!

3

It will be good if someone briefs the Euler Sum’s Approach.

4

Hey @gkcs !!

You explain the method and algorithm very nicely!! I was just wondering if its possible that you can also give a reference code based on that? Last time when i solved KBIGNUM, the reference code was my saviour which pointed out at my incorrect implementation, and made it easier to grasp the concept. If you can give some time to it, I (And many others!) will appreciate it :slight_smile:

1 Like
5

Persistent Oak!

6 Likes
6

euler sum and clone me(offline approach)

6 Likes
7

Chef and Prime Queries and Cloning

1 Like
8

CLONEME and PRMQ

9

CLONEME …

10

Clone ME and Euler Sum

11

Guys please vote at the link he gave in question, else he will have to manually count votes and that will be highly inconvenient to him.

1 Like
12

cloneme and euler sum

13

PRMQ and CLONEME

14

@gkcs, when are we going to get video editorials ?

15

CloneMe and Euler Sum

16

By Friday. I am off till Thursday :slight_smile:

2 Likes
17

When are the video editorials coming??

18

CLONEME and PRMQ

19

CLONME,PRMQ and Euler Sum. The video editorials should be released as soon as possible.

20

CLONEME,OAK TREE