HDU 1211 RSA（快速幂）

Description

RSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:

> choose two large prime integer p, q
> calculate n = p × q, calculate F(n) = (p - 1) × (q - 1)
> choose an integer e(1 < e < F(n)), making gcd(e, F(n)) = 1, e will be the public key
> calculate d, making d × e mod F(n) = 1 mod F(n), and d will be the private key

You can encrypt data with this method :

C = E(m) = m ^e mod n

When you want to decrypt data, use this method :

M = D(c) = c ^d mod n

Here, c is an integer ASCII value of a letter of cryptograph and m is an integer ASCII value of a letter of plain text.

Now given p, q, e and some cryptograph, your task is to "translate" the cryptograph into plain text.

Input

Each case will begin with four integers p, q, e, l followed by a line of cryptograph. The integers p, q, e, l will be in the range of 32-bit integer. The cryptograph consists of l integers separated by blanks.

Output

For each case, output the plain text in a single line. You may assume that the correct result of plain text are visual ASCII letters, you should output them as visualable letters with no blank between them.

Sample Input

101 103 7 11
7716 7746 7497 126 8486 4708 7746 623 7298 7357 3239

Sample Output

I-LOVE-ACM.

题意：给定密约和密文，让我们把密文翻译成纯文本
思路：由于M = D(c) = c d mod n，于是我们想到快速幂求出M，即该数据对应的ASCII值，然后以字符的方式输出即可

代码如下：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

int quickpow(int a,int k,int mod)       //作用：求出密文对应的ASCII码
{
    int r=1;
    while(k)
    {
        if(k&1) r=(r*a)%mod;
        a=((a%mod)*(a%mod))%mod;
        k>>=1;
    }
    return r%mod;
}

int main()
{
    int p,q;
    int e;
    int l;
    while(~scanf("%d%d%d%d",&p,&q,&e,&l))
    {
        int n=p*q;
        int fn=(p-1)*(q-1);
        int d;
        for(int i=fn;;i+=fn)     //求出d的值，最多求e次
        {
            if((i+1)%e==0)
            {
                d=(i+1)/e;
                break;
            }
        }
        for(int i=0;i<l;i++)
        {
            int a;
            scanf("%d",&a);
            int m=quickpow(a,d,n)%n;
            if(i!=l-1) printf("%c",m);
            else printf("%c
",m);
        }
    }
    return 0;
}