ABOUT ME

-

Today
-
Yesterday
-
Total
-
  • boj 9020
    카테고리 없음 2021. 8. 15. 04:01
    #include <bits/stdc++.h>
    using namespace std;
    
    bool isPrime(int x) {
    	if (x == 1) return false;
    	if (x == 2 || x == 3) return true;
    	if (x % 2 == 0) return false;
    	for (int i = 3; i * i <= x; i += 2) {
    		if (x % i == 0) return false;
    	}
    	return true;
    }
    
    int main(void) {
    	int T;
    	cin >> T;
    	while (T--) {
    		int x,max,i;
    		cin >> x;
    		for (i = 2; i <= x/2; i++) {
    			if (isPrime(i) && isPrime(x - i)) {
    				max = i;
    			}
    		}
    		cout << max << " " << x - max << "\n";
    	}
    }

    댓글

Designed by Tistory.