Codeforces 630L Cracking the Code
来源:互联网 发布:电话轰炸机软件下载 编辑:程序博客网 时间:2024/05/15 23:46
The protection of a popular program developed by one of IT City companies is organized the following way. After installation it outputs a random five digit number which should be sent in SMS to a particular phone number. In response an SMS activation code arrives.
A young hacker Vasya disassembled the program and found the algorithm that transforms the shown number into the activation code.Note: it is clear that Vasya is a law-abiding hacker, and made it for a noble purpose — to show the developer the imperfection of their protection.
The found algorithm looks the following way. At first the digits of the number are shuffled in the following order <first digit><third digit><fifth digit><fourth digit><second digit>. For example the shuffle of 12345 should lead to 13542. On the second stage the number is raised to the fifth power. The result of the shuffle and exponentiation of the number 12345 is 455 422 043 125 550 171 232. The answer is the 5 last digits of this result. For the number 12345 the answer should be 71232.
Vasya is going to write a keygen program implementing this algorithm. Can you do the same?
The only line of the input contains a positive integer five digit number for which the activation code should be found.
Output exactly 5 digits without spaces between them — the found activation code of the program.
12345
71232
模拟过程
#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){ int n,a,b,c,d,e; __int64 sum; while(~scanf("%d",&n)) { sum=1; a=n/10000; b=(n/1000)%10; c=(n/100)%10; d=(n/10)%10; e=n%10; n=a*10000+c*1000+e*100+d*10+b; for(int i=1;i<=5;++i) sum=sum*n%100000; //printf("%I64d\n",sum); a=sum/10000; b=(sum/1000)%10; c=(sum/100)%10; d=(sum/10)%10; e=sum%10; printf("%d%d%d%d%d\n",a,b,c,d,e); } return 0;}
- CodeForces 630L:Cracking the Code【数论】
- Codeforces 630L Cracking the Code
- Codeforces 630L-L. Cracking the Code【整数快速幂】
- CodeForces 630 L. Cracking the Code(水~)
- CodeForces-630 L. Cracking the Code【取模运算】
- CodeForces - 630L Cracking the Code (数学取余) 水
- code forces 630 L. Cracking the Code
- B-Cracking the Code
- zoj 1087 Cracking the Code
- Cracking the code interview总结
- Wireless Programming with J2ME: Cracking the Code
- cracking the code interview problem 1.1
- cracking the code interview problem 1.3
- cracking the code interview balanced tree python
- cracking the code interview LCA Python
- WAP, Bluetooth, and 3G Programming: Cracking the Code
- Cracking the code interview 面试题:两个数相加
- Cracking the Code Interview (1): 跟踪数组的中位数
- nmap帮助文档
- android手机连上电脑热点,如何获得电脑ip地址?
- nyoj 714 Card Trick
- Laravel学渣笔记(一) Form表单
- 关于java的JIT知识
- Codeforces 630L Cracking the Code
- 关于Audio标签的src路径包含中文时音频无法的问题
- 级联删除中由排序引起的deleted object would be re-saved by cascade 问题
- POJ 3616 Milking Time(区间DP)
- WHOJ 1609 - Han Move【细心】
- Android library projects cannot be launched解决方法
- HDU 1879 继续畅通工程
- NKOI 1120 最短路默写
- MySql入门