Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int f(int n) {
- if (n%2 != 0) return false;
- int results[n][2];
- int current_i_index = 0;
- for(int i = 2; i < n; i++) {
- for(int j = 2; j < n; j++) {
- if (isPrime(i) && isPrime(j) && i+j==n) {
- results[current_i_index][0] = i;
- results[current_i_index][1] = j;
- current_i_index++;
- }
- }
- }
- return results;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement