?? fsmm.c
字號:
#include <stdio.h>
#include <conio.h>
#include <string.h>
#include <malloc.h>
int gcd(int a, int b) /*輾轉(zhuǎn)相除法求a,b的最大公因數(shù)*/
{
int k = 0;
do
{
k = a%b;
a = b;
b = k;
}while(k!=0);
return a;
}
int Ni(int a, int b) /*求a相對于b的逆*/
{
int i = 0;
while(a*(++i)%b!=1);
return i;
}
char Affinec(char *c,int ka,int kb,char *s) /*仿射加密*/
{
int length, i=0,tmp;
length = strlen(c);
/*printf("Input the key(2 numbers): ");
scanf("%d%d", &ka, &kb); */
getchar();
if(gcd(ka,26)!=1)
{
printf("The value of the key is error!\nPress any key to return...");
return;
}
for(i=0; i<length; i++)
{
if(c[i]>96&&c[i]<123)
c[i] = (ka*(c[i]-97)+kb)%26+65;
else if(c[i]>64&&c[i]<91)
c[i] = (ka*(c[i]-65)+kb)%26+65;
}
printf("Result is: %s\n", c);
return c;
strcpy(s,c);
}
char Affinecd(char *c,int ka,int kb,char *s) /*仿射解密*/
{
int length, i=0,tmp;
length = strlen(c);
for(i=0; i<length; i++)
{
if(c[i]>64&&c[i]<91)
{
tmp = Ni(ka,26)*((c[i]-65)-kb);
if(tmp<0)
c[i] = tmp%26+26+97;
else
c[i] = tmp%26+97;
}
}
printf("\nAfter translated the sentence,we can see the primal sentence as follow:\n%s\n", c);
printf("Press any key to return...");
strcpy(s,c);
getch();
}
void main()
{
char *s,*c;
int a,b;
gets(s);
scanf("%d%d",&a,&b);
Affinec(s,a,b,c);
Affinecd(s,a,b,c);
}
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -