fork download
  1. #include <stdio.h>
  2. #define N 100000
  3. int main()
  4. {
  5. int a[N], i, j, k, n;
  6.  
  7. for (i = 2; i < N; ++i)a[i] = 1;
  8. for (i = 2; i * i < N; ++i)
  9. for (j = 2 * i; j < N; j += i)
  10. a[j] = 0;
  11. // for (i = 0; i < N; ++i)
  12. // if (a[i])
  13. // printf("%d ", i);
  14.  
  15. printf("n = ");
  16. scanf("%d", &n);
  17. for (i = 2; i < n; ++i) {
  18. if (a[i] == 0)continue;
  19. for (j = 2; i + j < n; ++j) {
  20. if (a[j] == 0)continue;
  21. for (k = n - i - j; i + j + k <= n; ++k) {
  22. if (a[k] == 0)continue;
  23. if (i + j + k == n) {
  24. printf("answer = %d, %d, %d\n", i, j, k);
  25. return 0;
  26. }
  27. }
  28.  
  29. }
  30. }
  31. printf("no conbination\n");
  32.  
  33. return 0;
  34. }
Success #stdin #stdout 0s 2108KB
stdin
100000
stdout
n = answer = 2, 7, 99991