CodeForces - 630L Cracking the Code (数学取余) 水
来源:互联网 发布:cad迷你看图mac版免费 编辑:程序博客网 时间:2024/05/29 14:13
CodeForces - 630L
Description
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 is455 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?
Input
The only line of the input contains a positive integer five digit number for which the activation code should be found.
Output
Output exactly 5 digits without spaces between them — the found activation code of the program.
Sample Input
12345
71232
Source
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #include<iostream> #include<queue> #define INF 0x3f3f3f3f #define IN __int64 #define ull unsigned long long #define ll long long #define N 1010 #define M 1000000007 using namespace std;int main(){int n,m,i,j;while(scanf("%d",&n)!=EOF){int a,b,c,d,e;a=n/10000;b=n/1000%10;c=n/100%10;d=n/10%10;e=n%10;m=a*10000+c*1000+e*100+d*10+b;ll ans=1;for(i=0;i<5;i++)ans=(ans*m)%100000;printf("%05lld\n",ans);}return 0;}
- CodeForces - 630L Cracking the Code (数学取余) 水
- CodeForces-630 L. Cracking the Code【取模运算】
- CodeForces 630L:Cracking the Code【数论】
- Codeforces 630L Cracking the Code
- CodeForces 630 L. Cracking the Code(水~)
- Codeforces 630L-L. Cracking the Code【整数快速幂】
- code forces 630 L. Cracking the Code
- B-Cracking the Code
- zoj 1087 Cracking the Code
- Cracking the code interview总结
- 遇到公式题快去推啊,别傻愣 数学推公式 codechef Cracking the Code
- LightOJ 1078 (数学 + 取余 )
- 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
- 游戏背景模糊层
- 往届题目—啤酒与饮料
- Android数据绑定框架DataBinding,堪称解决界面逻辑的黑科技
- Hibernate之Hibernate+EHCache配置二级缓存实战
- .net算法题
- CodeForces - 630L Cracking the Code (数学取余) 水
- 上线遇到的问题
- android studio编写java8
- 桶排序
- mysql的导入与导出
- 2.0关于傅里叶变换的个人看法
- 推荐一些量化投资学习资料(持续添加中...)
- iOS一个容易上手的搜索框,包括模糊查询UISearchDisplayController和UISearchBar交互
- 分析Linux kernel exception-基础篇