pos = 0;
while(nums[pos] != '\\0')
{
int m = 1;
for(int k = 0; k<pos; k++)
{
m = m * 10;
}
res = res + (mynums[pos] - 48) * m;
pos = pos + 1;
}
// 定义随机种子
//
srand(res);
int x = rand(), a = 2, b = 3, c = 5, m = 65536;
// 改进的线性同余算法
int i = AdvancedLinearCongrutial(x, a, b, c, 65536, rand()%100);
printf(\"i = %d\", i);
printf(\"\\tres = %d\", res);
return i;
}
// 改进的线性同余算法
int AdvancedLinearCongrutial(int x, int a, int b, int c, int m, int max)
{
for(int i=0; i<max; i++)
{
a = A;
for(int j=0; j<i; j++)
{
a *= A;
}
x = (a*x + (a-1)*c/b)%m;
}
pos = 0;
while(nums[pos] != '\\0')
{
int m = 1;
for(int k = 0; k<pos; k++)
{
m = m * 10;
}
res = res + (mynums[pos] - 48) * m;
pos = pos + 1;
}
// 定义随机种子
//
srand(res);
int x = rand(), a = 2, b = 3, c = 5, m = 65536;
// 改进的线性同余算法
int i = AdvancedLinearCongrutial(x, a, b, c, 65536, rand()%100);
printf(\"i = %d\", i);
printf(\"\\tres = %d\", res);
return i;
}
// 改进的线性同余算法
int AdvancedLinearCongrutial(int x, int a, int b, int c, int m, int max)
{
for(int i=0; i<max; i++)
{
a = A;
for(int j=0; j<i; j++)
{
a *= A;
}
x = (a*x + (a-1)*c/b)%m;
}
pos = 0;
while(nums[pos] != '\\0')
{
int m = 1;
for(int k = 0; k<pos; k++)
{
m = m * 10;
}
res = res + (mynums[pos] - 48) * m;
pos = pos + 1;
}
// 定义随机种子
//
srand(res);
int x = rand(), a = 2, b = 3, c = 5, m = 65536;
// 改进的线性同余算法
int i = AdvancedLinearCongrutial(x, a, b, c, 65536, rand()%100);
printf(\"i = %d\", i);
printf(\"\\tres = %d\", res);
return i;
}
// 改进的线性同余算法
int AdvancedLinearCongrutial(int x, int a, int b, int c, int m, int max)
{
for(int i=0; i<max; i++)
{
a = A;
for(int j=0; j<i; j++)
{
a *= A;
}
x = (a*x + (a-1)*c/b)%m;
}