int is_prime(n) // 判断是否为素数{ int j = 0; for (j = 2; j <= sqrt(n); j++) { if (n % j == 0) return 0; } return 1;}int main(){ int i = 0; for (i; i <= 200; i++) { if (is_prime(i) =
void Swap(int* pa, int* pb) // void表示空返回值{ int tmp = 0; tmp = *pa; *pa = *pb; *pb = tmp; // 交换地址,传址调用->交换值}int main(){ int a = 10; int b = 20; printf("a = %d b = %d\n", a, b); // a = 10 b =
int main(){ char arr[] = "hello world"; memset(arr, '*', 5); printf("%s\n", arr); // ***** world return 0;}
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号