Search found 3 matches
- Thu Feb 17, 2005 4:33 pm
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies: 163
- Views: 50516
- Wed Feb 16, 2005 12:21 pm
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies: 163
- Views: 50516
- Wed Feb 16, 2005 11:05 am
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies: 163
- Views: 50516
About 113,Why I keep getting WA
The main code below:
l = 1; r = 1000000000;
if (n>12) r = (int)pow(10,101.0/n);
while (l<r){
for (i=2;i<=MAXN;i++)
temp = 0;
temp[0] = 1;
temp[1] = 1;
x = (l + r) / 2;
for (i=1;i<=n;i++)
multiply(temp,x);
flag = compare(temp);
if (flag==0){
l = x;
break;
}
else if (flag==1){
l ...
l = 1; r = 1000000000;
if (n>12) r = (int)pow(10,101.0/n);
while (l<r){
for (i=2;i<=MAXN;i++)
temp = 0;
temp[0] = 1;
temp[1] = 1;
x = (l + r) / 2;
for (i=1;i<=n;i++)
multiply(temp,x);
flag = compare(temp);
if (flag==0){
l = x;
break;
}
else if (flag==1){
l ...