#include<math.h> 

int isPrime(long int a)

{

   int loops=3;

   int tt=sqrt(a)+1; 

   if ((a==1)||(a==0)) 

      return 0;

   else if(a==2)

      return 1;

   else if(a>=3)

   {

      if(a%2==0)

         return 0;

      for(loops=3;loops<=tt;loops+=2)

      {

         if(a%loops==0) 

            return 0;   

      }

      return 1;

   }

int main()

{

   long int input=0;

   printf("Please input a number");

   scanf("%d",&input);

   if(isPrime(input)==1)

      printf("It is a prime number.\n");

   else

      printf("It's not a prime number.\n"); 

   system("PAUSE");

}

 

Posted by ulysses887 at 痞客邦 PIXNET 留言(0) 引用(0) 人氣()

目標:製作一個數列N1,N2,N3,N4
從0000一直跑到9999
且當中 4*N1+3*N2+2*N3+N4 若被三整除
則分行顯示在Text1中

難度:@

程式碼:

Dim N1,N2,N3,N4
Dim result As String
For N1 = 0 To 9
  For N2 = 0 To 9
    For N3 = 0 To 9
      For N4 = 0 To 9
        If 4*N1+3*N2+2*N3+N4 Mod 3 Then
          result = result & N1 & N2 & N3 & N4 & vbcrlf
        End If
      Next N4
    Next N3
  Next N2
Next N1
Text1.Text=result

Posted by ulysses887 at 痞客邦 PIXNET 留言(0) 引用(0) 人氣()