... if (x%i == 0) return 0; } return 1; } int next_prime(int x) { while (1) { // 매개... i < count; i++) { num = next_prime(num); printf("%d ", num); } printf("\n"); return 0; } [/code]
태그: 소수, prime, is_prime, next_prime
