Super prime

ark930

Novice, to solve the super prime programming method, which prawn can help? Use C and VB.

owen810

It still needs to have a digit limit. It is relatively simple and straightforward to use an enumeration method.

alzly1983

What super prime numbers?
#include "stdio.h"
#include "conio.h"
#include "math.h"
main () {
 int i, j, k, s = 0, leap = 1;
 printf ("\n");
 for (i = 1; i <= 100; i ++)
 {k = sqrt (i + 1);
  for (j = 2; j <= k; j ++)
  if (i% j == 0)
  {leap = 0;
   break;
  }
  if (leap)
  {printf ("%-4d", i);
   s ++;
   printf ("\n");
  }
   leap = 1;
  }
  printf ("\nThe total is% d", s);
  getch ();
}

wanxiaohai

Yeah, what are super prime numbers?

sea0205

Can the lz question be clear. . ?
-_-

squallxuk

#include <stdio.h>
#include <math.h>

int isPrime (int p);
int isSuperPrime (int p);

int main ()
{
int i;
for (i = 2; i <1000; i ++)
if (isSuperPrime (i))
printf ("% d\t", i);
return 0;
}


int isSuperPrime (int p)
{
if (isPrime (p)&&p> 10)
{
while (p> 10)
{
p / = 10;
if (! (isPrime (p)))
return 0;
}
return 1;
}
return 0;
}

int isPrime (int p)
{
int a, i;
if (p <2)
return 0;
else if (p == 2)
return 1;
a = (int) sqrt (p + 1);
for (i = 2; i <= a; i ++)
if (! (p% i))
return 0;
return 1;
}

yy偶不会

#include <stdio.h>
#include <math.h>

typedef unsigned long pr_t;

int pr_test (pr_t x)
{
pr_t i, sqx = (pr_t) sqrt (x);
for (i = 3; i <= sqx; i + = 2)
if (x% i == 0)
return 0;
return 1;
}

int slove (pr_t * p, pr_t * t, int n)
{
int r = 0, i, j;
for (i = 0; i <n; ++ i)
for (j = 1; j <= 9; j + = 2)
if (pr_test (p [i] * 10 + j))
t [r ++] = p [i] * 10 + j;
return r;
}

#define BUFF_SIZE (200)

int main ()
{
pr_t b1 [BUFF_SIZE] = {2, 3, 5, 7}, b2 [BUFF_SIZE];
pr_t * p = b1, * t = b2, * tt;
int n = 4, i;
while (n)
{
for (i = 0; i <n; ++ i)
printf ("% -10d", p [i]);
n = slove (p, t, n);
tt = p; p = t; t = tt;
}
printf ("\n\n");
return 0;
}

珈蓝易拉罐

You can check the output number again, and remove those meanings 0, 1, 4, 6, 8, and 9.

squallxuk

I wrote super prime numbers, lz did not take it seriously...

魔兽tao

Transfer string to determine if it contains non-prime elements
itoa