In RSA encryption, can I calculate d given only m,n,c and e?
No!

RSA is public-key encryption and in public-key encryption, the known plaintexts are free. Given a public key $(n,e)$ we can find many $(p_i,c_i)$ such that $c_i = p_i^e \bmod n$. If this is a weakness, on the first day it will be broken.