Modular exponentiation

#1

why some of the test cases are being failed with this code ??

#include
#include
using namespace std;
typedef long ll;
int main() {

ll a,b,c;
cin>>a>>b>>c;

ll res=((a%c)*(b%c))%c;
cout<<res;
return 0;

}

#2

hey @neelmani98 you need to find a^b or a raised to the b, but you are finding a * b (a multiplied by b).

#3

i have changeed the code still getting error please check the code once i have saved it on the link https://ide.codingblocks.com/s/197655

#4

please help me in corrrecting my code i have send the link of the saved code

#5

here is correct code:

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.