Please fill the feedback form: forms.gle/wTgYuKAKSp5CsgGK7

It would've been better if you as the educator explained those observations rather than just listening to those students who were able to solve it and write it down on the board and solving the sum again. You just came to solve the questions again on a video call rather than explaining them.Worst editorial from TLE team.

I don't know how they explain:) totally waste of time.

@PrinceKumar-gl5fk

Ай бұрын

Agreed

can we get the solution code as well?

@VivekYadav-uy9ts

Ай бұрын

Bro check the description!

In Problem 'B' in couldn't get this oberservation that it is N / GPF(N), after this i was able to solve it by my own, Thnx for the explanation Ankit Bro!

HEY ! why cp31 sheet is not accessible from website ?

I tried to fix the frst permutation as 1,2,3,4 then wrote code to find all permutations and then do ai-bi then check is there any pattern. Because writing permutations can become confusing. Is it a good practice or should I change ?

@ayushshshsh

Ай бұрын

even I do this sometimes

@priyanshkumariitd

Ай бұрын

I also did the same

Worst explanation ever😮‍💨🤮🤮

why your website is not working??

@roshangeorge97

Ай бұрын

its under maintainace ig

Great Explaination Mr Ankit

Solution for sum of N :- #include using namespace std; const int m=1e6+1; vector allprime; unordered_map mp; vector isprime(m+1,0); void fun2(){ vector vis(m,0); for(int i=2; i>k; if((k%2)==0){ cout

solution for Sum of N question: #include using namespace std; const long long MAX_LIMIT = 1000000; vector sieve(vector &isPm) { vector pm; isPm[0] = isPm[1] = 1; long long sum=0; for (long long i = 2; i t; vector isPm(MAX_LIMIT + 1, 1); vector pr=sieve(isPm); while(t--){ long long k; cin>>k; if(isPm[k]==1){ cout

@prakashk.pandey9298

Ай бұрын

check this:-#include using namespace std; const int m=1e6+1; vector allprime; unordered_map mp; vector isprime(m+1,0); void fun2(){ vector vis(m,0); for(int i=2; i>k; if((k%2)==0){ cout

give code of sum of N

Explain the questions and logic properly please

#include #define int long long using namespace std; const int N=1e6+10; vectorres; vectorisPrime(N,1); void solve() { isPrime[0]=isPrime[1]=false; for(int i=2;i>k; if(k%2==0) { cout

@prakashk.pandey9298

Ай бұрын

check this:-#include using namespace std; const int m=1e6+1; vector allprime; unordered_map mp; vector isprime(m+1,0); void fun2(){ vector vis(m,0); for(int i=2; i>k; if((k%2)==0){ cout

Worst Explanation!

#include #include using namespace std; void primeSieve(int n, vector& ar) { vector is_prime(n + 1, true); for (int p = 2; p t; while (t--) { int n; cin >> n; vector primes; primeSieve(n, primes); long long int sum = 0; for (int p : primes) { sum += p; if (n % p == 0) { break; } } sum *= n; cout

One of the worst teacher teaching on KZread