Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

sameThingButYouLikeKofar's blog

wounder how to generate non divisible sequence fit in large number of inuts

By sameThingButYouLikeKofar, 12 years ago, In English

as title says , i'm talking about http://codeforces.me/problemset/problem/327/B problem

that judged as TLE. my submission was only trying to print prime numbers

what are other sequences that aren't prime and aren't divisible terms ?

  • Vote: I like it
  • -3
  • Vote: I do not like it

»
12 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

what method did you use to print the prime numbers? (there is one in NlogN, N being the range of the numbers) and the PNT guarantees that there exist about 10^5 < 10^7/ln(10^7) prime number <10^7, so why not prime numbers?

→ Reply
»
12 years ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Use sieve of Erathosphene. AC

→ Reply
»
12 years ago, hide # |
 
Vote: I like it +16 Vote: I do not like it 
actually it has a simple nice solution :D
print(100000..100000+n);
→ Reply