Number theory course : youtube CodeNCode(2 Aug 2020 : Practice Problem added)

tutorial
, ,
63

i mean does q queries and t test case mean the same ?? or it depends on questions specifically in CP

64

it always depends on question.
and also the variable names (q and t) are chosen by us , it can be anything.

1 Like
65

is it beneficial for someone to study linked list ,DP,trees and graphs who has been into competitive programming for 5-6 months or it doesn’t depend for how much time u have been into the process just study new topics and practice them please tell i had this question in my mind for a long time.

66

as a beginner you should cover concepts from each category but only the concepts which are Easy , Easy-Medium.
And as far as practice is concerned you should keep doing that for like forever , every day.

Some of Easy or Easy-Medium concepts are
Number Theory : Prime factorization , sieve , GCD etc.
DP : coin change problem , path max/min problem on grid , rod cutting etc.
Graph theory : dfs , bfs etc
Basics of bit manipulation

1 Like
67

okay will keep them in mind thank you very much

68

you’re welcome

1 Like
69

@waqar_ahmad224 Hi, i am watching your videos constantly and you have uploaded video on orac and lcm , can you please the tell solution in the gcd version (if possible)by precomputing gcd values of array,as it is very intresting and it will suitable to playlist (based on gcd) ,i am not able to understand how it is solved using gcd??awaiting for your respone…!

1 Like
70

currently working on segment tree video , after that I will give it a thought

71

17 may 2020 : segmented sieve lecture added
L22 : What is segmented Sieve & why you should learn it?

72

will you do chinese remainder theorem???

73

yes I will

1 Like
74

I just can’t express u ,how much effort u gave to just teach us something,thank u so much brother

75

no problem brother

76

21 May 2020 : new video added
E003 : Prime Generator (Spoj) | Segmented Sieve Implementation

77

can someone explain the below question on codeforces that implies euler totiet function

78

I am solving this problem today , hopefully I will explain it to you tomorrow

1 Like
79

Can you please help me with this problem?
https://www.spoj.com/problems/SEQ/

I understand that matrix exponentiation and fast exponentiation is to be used but I am facing some problems
Thank you.

80

you just need to figure out how to build transition matrix for given k at runtime , rest is same as i explained in matrix exponentiation video lectures.

1 Like
81

@waqar_ahmad224 can you please help me out with this question
it requires fast prime factorization
problem link : SPOJ.com - Problem DIVSUM2

82

you can also talk about Montgomery Multiplication.