Please help, I need this code in c++

RSA key generation: 1. Implement Fermat test 2. Use Fermats test to generate two large prime numbers (p,q), each should have a size >= 512 bits; 3. Save p and q in a file named p_q.txt, one integer per line and making sure no white space saved; 4. Use extended Euclidean algorithm to generate two pairs of keys: (e,n), (d,n), where n=p*q; 5. Save the two pairs of keys in two separate files: e_n.txt and d_n.txt, one integer per line and no white space;