UVA 1230 - MODEX UVA • Aug 31, 2020 Problem PDFSolution:#include int main() { long long t,x,y,m,r; scanf("%lld",&t); while(t--) { scanf("%lld %lld %lld",&x,&y,&m); r=1; while(y) { if(y%2!=0) r=(r*x)%m; x=(x*x)%m; y/=2; } printf("%lld\n",r); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/1230/1230.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read