Don't like ads? PRO users don't see any ads ;-)
Guest

Untitled

By: a guest on Jul 29th, 2012  |  syntax: None  |  size: 0.42 KB  |  hits: 11  |  expires: Never
download  |  raw  |  embed  |  report abuse  |  print
Text below is selected. Please press Ctrl+C to copy to your clipboard. (⌘+C on Mac)
  1. NTh square free semi prime
  2. int k = 0;
  3. for(int i = 0; i <= 1000; i++)
  4. {
  5.     for(int j = i +1 ; j <= 2500; j++ )
  6.     {
  7.         semiprimes[k++] = (primes[i]*primes[j]);
  8.     }
  9. }
  10.  sort(semiprimes,semiprimes+k);
  11.        
  12. int L = 2001, k = 0;
  13.     for(int i = 0; i < L; i++)
  14.     {
  15.         for(int j = i+1 ; j < L; j++ )
  16.         {
  17.             semiprimes[k++] = (primes[i]*primes[j]);
  18.         }
  19.     }
  20.     sort(semiprimes,semiprimes+k);