口算密码

口算密码

可以得到a=15，b=6
所以得到的$a^{-1}\times a=1(mod26)a^{-1}=26-15=11,函数为f(x)=a^{-1}(x-b)$
$有26k+15a^{-1}=1$
根据拓展欧几里得算法求出$a^{-1}=7$
得到密码

代码

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
using namespace std;
#define N 1000000
char A[N] = {"fho aoc wq kiexufob wq g siiz wtjotfwit"};
char B[N] = {"abcdefghijklmnopqrstuvwxyz"};
int gcd;
void ex_gcd(int a,int b,int &x,int &y){
	if(b){
	    ex_gcd(b,a%b,x,y);
	    int t=x;
	    x=y;
	    y=t-(a/b)*y;
	}
	else{
	    x=1,y=0;
	    gcd=a;
	}
	return;
}
int main(){
    int n=strlen(A);
    int a = 15, b = 6;
    const int mod=26;
    int x, y;
    ex_gcd(26, 15, x, y);
    cout << y<<endl;
    a = 7;
    for (int i = 0; i < n;i++){
        if(A[i]==' ')
            continue;
        int t = a * (A[i] - 'a' - b+26);
        t%=mod;
        cout << B[t];
    }
}