算法求解
已知数据转换表:
const unsigned char T[256]={
170,42,95,141,109,30,71,89,26,147,231,205,239,212,124,129,
216,79,15,185,153,14,251,162,0,241,172,197,43,10,194,235,
6,20,72,45,143,104,161,119,41,136,38,189,135,25,93,18,
224,171,252,195,63,19,58,165,23,55,133,254,214,144,220,178,
156,52,110,225,97,183,140,39,53,88,219,167,16,198,62,222,
76,139,175,94,51,134,115,22,67,1,249,217,3,5,232,138,
31,56,116,163,70,128,234,132,229,184,244,13,34,73,233,154,
179,131,215,236,142,223,27,57,246,108,211,8,253,85,66,245,
193,78,190,4,17,7,150,127,152,213,37,186,2,243,46,169,
68,101,60,174,208,158,176,69,238,191,90,83,166,125,77,59,
21,92,49,151,168,99,9,50,146,113,117,228,65,230,40,82,
54,237,227,102,28,36,107,24,44,126,206,201,61,114,164,207,
181,29,91,64,221,255,48,155,192,111,180,210,182,247,203,148,
209,98,173,11,75,123,250,118,32,47,240,202,74,177,100,80,
196,33,248,86,157,137,120,130,84,204,122,81,242,188,200,149,
226,218,160,187,106,35,87,105,96,145,199,159,12,121,103,112
};
现在有两个输入参数A和B,均为unsigned char类型,需要求解四个类似于T的转换表
X[],Y[],Z[],U[],要求能够满足对于任意A,B,均有:T[A&B]=(X[A]&Y[B])|(Z[A]&U[B])。
问题:X,Y,Z,U是否存在?如果存在,如何编程求解(T可任意指定)?
说明:&、|表示C语言的代数与、或运算。
const unsigned char T[256]={
170,42,95,141,109,30,71,89,26,147,231,205,239,212,124,129,
216,79,15,185,153,14,251,162,0,241,172,197,43,10,194,235,
6,20,72,45,143,104,161,119,41,136,38,189,135,25,93,18,
224,171,252,195,63,19,58,165,23,55,133,254,214,144,220,178,
156,52,110,225,97,183,140,39,53,88,219,167,16,198,62,222,
76,139,175,94,51,134,115,22,67,1,249,217,3,5,232,138,
31,56,116,163,70,128,234,132,229,184,244,13,34,73,233,154,
179,131,215,236,142,223,27,57,246,108,211,8,253,85,66,245,
193,78,190,4,17,7,150,127,152,213,37,186,2,243,46,169,
68,101,60,174,208,158,176,69,238,191,90,83,166,125,77,59,
21,92,49,151,168,99,9,50,146,113,117,228,65,230,40,82,
54,237,227,102,28,36,107,24,44,126,206,201,61,114,164,207,
181,29,91,64,221,255,48,155,192,111,180,210,182,247,203,148,
209,98,173,11,75,123,250,118,32,47,240,202,74,177,100,80,
196,33,248,86,157,137,120,130,84,204,122,81,242,188,200,149,
226,218,160,187,106,35,87,105,96,145,199,159,12,121,103,112
};
现在有两个输入参数A和B,均为unsigned char类型,需要求解四个类似于T的转换表
X[],Y[],Z[],U[],要求能够满足对于任意A,B,均有:T[A&B]=(X[A]&Y[B])|(Z[A]&U[B])。
问题:X,Y,Z,U是否存在?如果存在,如何编程求解(T可任意指定)?
说明:&、|表示C语言的代数与、或运算。
...全文
相关推荐
迷宫求解算法
本篇文章将详细解析一个用C++实现的迷宫求解算法。#### 二、迷宫求解算法概述迷宫求解通常可以采用深度优先搜索(DFS)或广度优先搜索(BFS)等图遍历算法来实现。
数独求解算法
数独求解算法是一种在计算机科学领域广泛应用的逻辑算法,主要针对解决经典的数独游戏问题。
C# 数独求解算法的实现
C# 数独求解算法的实现本文将对 C# 数独求解算法的实现进行详细的介绍。
ACM递推求解求解算法
【标题】:“ACM递推求解求解算法”在计算机科学领域,特别是算法竞赛(如ACM/ICPC)中,递推求解是一种常用的技术。
利用 NSGA_II算法求解 算法求解算法求解ZDT问题和DTLZ问题.zip
本项目中,NSGA_II被用来求解ZDT问题和DTLZ问题,这两个是多目标优化领域中常用的基准测试问题。


