630L - Cracking the Code - CodeForces Solution

implementation math *1400

Please click on ads to support us..

C++ Code: 

#include<cstdio>
#include<cmath>
int main(){
int n,a,b,c,d,e;
scanf("%1d%1d%1d%1d%1d",&a,&b,&c,&d,&e);
n=(((a*10+c)*10+e)*10+d)*10+b;
printf("%05Id\n",1LL*n*n%100000*n%100000*n%100000*n%100000);
}


Comments

Submit
0 Comments
More Questions

766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts
509A - Maximum in Table
1647C - Madoka and Childish Pranks
689B - Mike and Shortcuts
379B - New Year Present
1498A - GCD Sum
1277C - As Simple as One and Two
1301A - Three Strings
460A - Vasya and Socks
1624C - Division by Two and Permutation
1288A - Deadline
1617A - Forbidden Subsequence
914A - Perfect Squares
873D - Merge Sort
1251A - Broken Keyboard
463B - Caisa and Pylons
584A - Olesya and Rodion
799A - Carrot Cakes
1569B - Chess Tournament