Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

python

MAX = 10000 # prefix[i] is going to # store count of primes # till i (including i). pt =[0]*(MAX + 1) def abc():     prime = [1]*(MAX + 1)     p = 2     while(p * p <= MAX):         if (prime[p] == 1):             i = p * 2             while(i <= MAX):                 prime[i] = 0                 i += p         p+=1     for p in range(2,MAX+1):         pt[p] = pt[p - 1]         if (prime[p]==1):             pt[p]+=1 //@Coding_000 def query(a,b):     return pt[b]-pt[a-1] n=int(input()) c=0 for i in range(n):     a,b=map(int,input().split())     abc()     c+=query(a,b) mod=10**9+7 print(c%mod) prime numbers in range[L,R] All test cases passed Telegram :- @Coding_000

Alex code Python3 👆👆👆

Array A length n code

C++ XOR code 👆

Send all ur questions here https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1 share our channel @Coding_000✅✅✅✅✅✅✅

INFOSYS Exam Ans (22/10/22) 3:00PM ↗️Share with your friends and groups Telegram:- @Coding_000

who want afternoon INFOSYS exam help share our channel fast 😊 SHARE ✅ SHARE ✅@Coding_000

Guy's don't worry what ever codes i get i will myself share to you please don't personally dm and ask.

My request to our group family don't trust anyone simply and don't lose money 🙏

C++ ✅ Koko has an array code

INFOSYS Exam Ans (22/10/22) 3:00PM ↗️Share with your friends and groups Telegram:- @Coding_000 ILOVEU_000❤️😍

who want afternoon INFOSYS exam help share our channel fast 😊 @ILOVEU_000❤️❤️ SHARE ✅ SHARE ✅

Share share✅✅✅✅

c++ code @Coding_000 infosys solutions