fork download
copy 
  1. //author- Bhuvnesh Jain
  2.  
  3. //complexity- O(m*(n^1/2))
  4.  
  5. #include <stdio.h>
  6. #include <math.h>
  7.  
  8. int main()
  9. {
  10.     int i, j, n, m, x, y, count=0;
  11.     scanf("%d %d", &n, &m);
  12.     int arr[m+1];
  13.     for (i=1; i<=m; i++)
  14.         arr[i] = 0;
  15.     if (n%2==0)
  16.     {
  17.         //marking multiples of 2 similar to sieving
  18.         for (i=2; i<=m; i+=2)
  19.             arr[i] = 1;
  20.         //factorising n
  21.         while (n%2==0)
  22.             n/=2;
  23.     }
  24.     x = sqrt(n);
  25.     for (i=3; i<=x; i+=2)
  26.     {
  27.         if (n%i==0)
  28.         {
  29.             //marking multiples of i similar to sieving
  30.             for (j=i; j<=m; j+=i)
  31.                 arr[j] = 1;
  32.             //factorising n
  33.             while (n%i==0)
  34.                 n/=i;
  35.         }
  36.     }
  37.     printf("The list of numbers is:\n");
  38.     for (i=1; i<=m; i++)
  39.     {
  40.         if (arr[i]==0)
  41.         {
  42.             count++;
  43.             printf("%d\n", i);
  44.         }
  45.     }
  46.     printf("\nCount = %d\n", count);
  47.     return 0;
  48. }
Runtime error #stdin #stdout 0s 2156KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/InlDBv
language:
C (gcc 8.3)
created:
8 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!