Start: Jun, 28, 2019 08:42:00
2019杭州师范大学第一届程序设计竞赛新生赛
End: Jun, 28, 2019 11:42:00
Time elapsed:
Time remaining:

Problem_ID: C
Result: Accepted
Time: 84ms
Memory: 2180kB
In contest: 1276


#include <cstdio>
#include <algorithm>
#include <iostream>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=100005;
int f(int a,long k)
{
	int b;
	while(k--)
	{
	b=10*ceil(pow(a,0.5));
	a=b;
	}
	return b;
}
int main()
{
	long n,k,i,j;
	int a[maxn];
	scanf("%ld%ld",&n,&k);
	for(i=1;i<=n;i++)
	{
		scanf("%ld",&a[i]);
	}
	if(k>=5)
	{
		for(i=1;i<=n;i++)
			printf("100 ");
	}
	else if(k<5)
	{
		for(i=1;i<=n;i++)
			printf("%d ",f(a[i],k));
	}
	printf("\n");

}