A number is sum of two prime number

#include<bits/stdc++.h>

using namespace std;

int prime(int n){
    if(n<2)
        return 0;
    for(int i=2; i<=sqrt(n); i++){
        if(n%i==0)
            return 0;
    }
    return 1;
}

int main()
{
    int n;
    cin >> n;
    for(int i=5; i<=n; i++){
        int j =i;
        if(j%2==0)
        for(int k=2; k<=j; k++){
            if(prime(k)&&prime(j-k)){
                cout << j << " = " << k << " " << j-k<< endl;
                break;
            }
        }
    }
    return 0;
}