Codeforces 630L-L. Cracking the Code【整数快速幂】
2016-05-03 12:36
344 查看
L. Cracking the Code
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
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?
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.
Examples
input
output
解题思路:
将输入的n(abcde)转化成acedb后,取五次幂后五位。数据坑10000,结果是00000.
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
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?
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.
Examples
input
12345
output
71232
解题思路:
将输入的n(abcde)转化成acedb后,取五次幂后五位。数据坑10000,结果是00000.
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; long long mod(int a,int b,int m) { long long ans=1,i; for(i=1;i<=b;i++) { ans=ans*a%m; } return ans; } int main() { int a,b,c,d,e; scanf("%1d%1d%1d%1d%1d",&a,&b,&c,&d,&e); int num=a*10000+c*1000+e*100+d*10+b; int wc=(int)mod(num,5,100000); //printf("%d\n",wc); int aa,bb,cc,dd,ee; aa=bb=cc=dd=ee=0; aa=wc/10000; wc=wc%10000; bb=wc/1000; wc=wc%1000; cc=wc/100; wc=wc%100; dd=wc/10; wc=wc%10; ee=wc; printf("%d%d%d%d%d",aa,bb,cc,dd,ee); return 0; }
相关文章推荐
- 模拟器语言改为中文
- 系统分层与架构模型
- PAT1008数组元素循环右移问题 (20)
- oracle安装问题
- 5个开源项目
- C#中的Hook,即钩子,引用微软的文章,很有用的
- 5个开源项目
- Linux之线程:同步与互斥
- hive建表时对字段间分割符的限制
- TLB工作原理
- 《深入.NET平台和C# 编程》内测纠错记录
- 职场黑话
- 德邦证券项目:关联表
- PostgreSQL9.5 新特性
- 演讲
- Android群英传帝落篇——程序人生,路漫漫其修远兮,吾将上下而求索!
- 运用 BoxLayout 进行 Swing 控件布局
- Android群英传帝落篇——程序人生,路漫漫其修远兮,吾将上下而求索!
- LeetCode 164. Maximum Gap
- 重写ScrollView 解决ScrollView嵌套viewpager事件冲突