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: 62ms
Memory: 2520kB
In contest: 1276

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<math.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+6;
ll a[MAXN];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<k;j++)
		{
			double tmp=sqrt(double(a[i]));
			a[i]=ceil(tmp)*10;
			if(a[i]==100)
				break;
		}
		if(i!=n-1)
			printf("%d ",a[i]);
		else 
			printf("%d\n",a[i]);
	}
	//system("pause");
	return 0;
}