algorithm'''problem solve
[백준]9020-골드바흐의 추측(설명X)
JunHwa Park
2019. 8. 15. 17:01
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 | #include <cstdio> int main() { int repeat; scanf("%d", &repeat); for (int k = 0; k < repeat; k++) { int num; scanf("%d", &num); bool* ary = new bool[num + 1]{ false }; ary[1] = true; for (int i = 2; i <= num / 2; i++) if (!ary[i]) for (int j = 2; j * i <= num; j++) ary[i * j] = true; int x = 0, y = 0; for (int i = 2; i <= num / 2; i++) if (!ary[i]&&!ary[num-i]) { x = i; y = num - i; } printf("%d %d\n", x, y); delete[] ary; } } | cs |