为什么把这题放在搜索栏下呢,因为这题我做不出来的原因不是不会复数运算,而是没理解dfs。
题意:已知复数 X = XR + XIi 和 B = BR + BIi,X = a0 + a1B + a2B^2 + a3B^3 ....... anB^n,求满足一定条件的a0,a1,....an
思路分析:ai的范围很小,所以可以用dfs搜索解。对于X = a0 + a1B + a2B^2 + a3B^3 ....... anB^n,每次X - ai,之后X/B,这里用到了复数的除法,如果X能够整除B,那么继续dfs
代码如下:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define inf 0x7ffffff
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
int a[105];
int sum,flag,k;
int bi,br;
void dfs(int cur,int xr,int xi)
{
if(flag == 1 || cur > 100) return;
if(xi == 0 && xr == 0)
{
flag = 1;
k = cur-1;
return;
}
for(int i = 0; i < sum; i++)
if(((xr-i)*br+bi*xi)%(br*br+bi*bi) == 0 && (xi*br-(xr-i)*bi)%(br*br+bi*bi) == 0)
{
a[cur] = i;
dfs(cur+1,((xr-i)*br+bi*xi)/(br*br+bi*bi),(xi*br-(xr-i)*bi)/(br*br+bi*bi));
}
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int t;
scanf("%d",&t);
while(t--)
{
int xi,xr;
scanf("%d%d%d%d",&xr,&xi,&br,&bi);
sum = ceil(sqrt(br*br+bi*bi));
flag = 0;
dfs(0,xr,xi);
if(flag) {
printf("%d",a[k]);
for(int i = k-1; i >= 0; i--)
printf(",%d",a[i]);
printf("\n");
}
else printf("The code cannot be decrypted.\n");
}
return 0;
}