UVa 11549
来源:互联网 发布:电子数据使用保密协议 编辑:程序博客网 时间:2024/06/06 09:51
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
int k,k1,k2;
LL next(int n,LL k)
{
int ans = 0 , num = 0;
int a[20] = {0};
k = k * k;
while(k > 0)
{
a[num ++ ] = k%10;
k /= 10;
}
n = min(n,num);
for(int i=1;i<=n;i++)
{
ans = ans * 10 + a[--num];
}
return ans;
}
int main()
{
int n;
int T=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%lld",&n,&k);
int ans = k;
k1 = k2 = k;
do
{
k1 = next(n,k1);
k2 = next(n,k2);
ans = max(ans,k2);
k2 = next(n,k2);
ans = max(ans,k2);
}while(k1 != k2);
printf("%d\n",ans);
}
return 0;
}
#include <iostream>
using namespace std;
typedef long long LL;
int k,k1,k2;
LL next(int n,LL k)
{
int ans = 0 , num = 0;
int a[20] = {0};
k = k * k;
while(k > 0)
{
a[num ++ ] = k%10;
k /= 10;
}
n = min(n,num);
for(int i=1;i<=n;i++)
{
ans = ans * 10 + a[--num];
}
return ans;
}
int main()
{
int n;
int T=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%lld",&n,&k);
int ans = k;
k1 = k2 = k;
do
{
k1 = next(n,k1);
k2 = next(n,k2);
ans = max(ans,k2);
k2 = next(n,k2);
ans = max(ans,k2);
}while(k1 != k2);
printf("%d\n",ans);
}
return 0;
}
0 0
- uva 11549
- UVA 11549
- uva 11549
- uva 11549
- UVa 11549
- uva 11549
- Uva-11549 - Calculator Conundrum
- UVA 11549 Calculator Conundrum
- Uva-11549-Calculator Conundrum
- uva 11549 - Calculator Conundrum
- UVA 11549 Calculator Conundrum
- uva 11549 CALCULATOR CONUNDRUM
- UVA 11549 Calculator Conundrum
- UVa 11549 - Calculator Conundrum
- UVA 11549 Calculator Conundrum
- UVA 11549 Calculator Conundrum
- UVA - 11549 Calculator Conundrum
- UVA-11549 Calculator Conundrum
- 数组知识点
- POJ——1364King(差分约束SPFA判负环+前向星)
- .net实现md5加密 sha1加密 sha256加密 sha384加密 sha512加密 des加密解密
- Java基础--基本数据类型转换
- 20款最佳用户体验的Sublime Text 2/3主题下载及安装方法
- UVa 11549
- JsonObject Integer 0
- 深入java虚拟机(九)--常见问题总结
- UVa 11729
- Flatten Binary Tree to Linked List 将二叉树转成链表形式
- maven项目打包资源文件
- Android:DisplayMetrics用法
- UVa 11636
- OpenCV下利用傅里叶变换和逆变换实现图像卷积算法,并附自己对于卷积核/模板核算子的理解!