large-prime-check-using-sieve

Topic Replies Activity
Not able to understand the logic of primes[i]*primes[i] 5 February 7, 2022
Upper limit of n 3 January 25, 2022
Why code is not working 8 August 3, 2021
Large prime check(using sieve) 6 July 15, 2021
Why is that in sieve we start from int j = i*i 3 July 3, 2021
Segmentation fault/ core dump 3 July 3, 2021
Wrong Output using this logic 2 July 2, 2021
What is bitset<1000005> b; used in the video but not explained clearly.? 2 July 1, 2021
What is bitset<1000005> b; used in the video? 1 July 1, 2021
Larger prime sieve 5 June 29, 2021
Regarding function 2 May 31, 2021
Large Prime Check (using Sieve) 3 May 30, 2021
Sir, why it is showing Segmentation fault? 3 May 25, 2021
Defining short form for data types 5 May 25, 2021
Regarding typecasting 14 May 17, 2021
Number theory codeforces 3 April 12, 2021
Bitset Header File Doubt 3 April 11, 2021
Didn't get it this code 6 April 9, 2021
Infinite loop while executing 3 March 11, 2021
Large Prime Check 6 February 20, 2021
Why are we computing No%primes[i] and not No%i? 5 January 29, 2021
Large Prime check 3 January 22, 2021
Large Prime check 3 January 18, 2021
Why are we typecasting 7 December 29, 2020
Large prime check using sieve 5 December 29, 2020
Large prime check 6 December 22, 2020
Error in this code 3 December 22, 2020
Explain the for loop in isPrime() function 8 December 8, 2020
Doubt in implementation of problem 1 December 6, 2020
I didnt understood the concept 3 November 16, 2020