題意:
一個計數器計算一個數的平方,只能顯示答案的前N位,給定開始的數K和N,最終會落入循環,問其中得到的最大數值是多少
分析:
簡單的模擬題,但是存在一種比較巧妙的方法,可以把這個循環看成兩個人在賽跑,如果速度慢的人‘超過’了速度快的人,那麼可以看成進入了還
Code:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 10 + 10
int f[MAXN], idx;
inline long long next_turn(long long base, int n)
{
long long ans = 0, cur = 1;
long long tmp = base*base;
idx = 0;
while( tmp ) {
f[idx ++] = tmp%10;
tmp /= 10;
}
n = min(idx, n);
for(int i = idx-n; i < idx; i ++) {
ans += cur*f[i];
cur *= 10;
}
return ans;
}
int main(int argc, char **argv)
{
#ifndef ONLINE_JUDGE
freopen("test.in", "r", stdin);
#endif
int cas, n, k;
scanf("%d", &cas);
for( ; cas; cas --) {
scanf("%d %d", &n, &k);
long long k1 = k, k2 = k, rst = k;
int flag = 0;
while( k2 != k1 || !(flag ++) ) {
k1 = next_turn(k1, n);
rst = max(rst, k1);
k2 = next_turn(k2, n);
rst = max(rst, k2);
k2 = next_turn(k2, n);
rst = max(rst, k2);
}
printf("%lld\n", rst);
}
return 0;
}
uva_11549_Calculator Conundrum( 模擬 )
最新推荐文章于 2018-08-24 10:05:52 发布