[C]印出2~1000所有質數

#include <iostream.h> #include <string.h> #include <stdlib.h> int main(){     int a[1000];     for(int i=2;i<=1000;i++) a[i]=1;     for(int i=2;i<=1000;i++){         if(a[i]){             cout << i << ",";             for(int k=i;k<=1000;k+=i) a[k]=0;             }         } //-----------------------     printf("\n");     system("PAUSE");     return EXIT_SUCCESS; }

[C]字串的指標陣列

輸出結果如下：

[APPLE][BANANA][CAT][DOG]

程式：

#include <iostream.h> #include <string.h> #include <stdlib.h> int main(){     char *ptr[4]={"APPLE","BANANA","CAT","DOG"};     for(int i=0;i<4;i++){         cout << "[" << *(ptr+i) << "]";         } //-----------------------     printf("\n");     system("PAUSE");     return EXIT_SUCCESS; }

[C]利用指標走訪陣列

#include <iostream.h> #include <string.h> #include <stdlib.h> #define LEN 6 int main(){     int arr[LEN]={11,22,33,44,55,66};     int *ptr=arr;     for(int i=0;i<LEN;i++){         cout << *ptr++;         } //-----------------------     printf("\n");     system("PAUSE");     return EXIT_SUCCESS; }

[C]遞迴求n!

#include <iostream.h> long factorial(int n){     if(n==1)         return 1;  //遞迴結束條件     else         return n*factorial(n-1);     } int main(){     int no;     cin >> no;     if(no>0){         cout << factorial(no);         } //-----------------------     printf("\n");     system("PAUSE");     return EXIT_SUCCESS; }