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: 86ms
Memory: 2788kB
In contest: 1276

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<string.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<string>
#include<stdlib.h>
const int p=0x3f3f3f3f;
#define maxn 100005
int a[maxn],b[maxn];
int n,m,k,x,y,l,r;
char s[maxn];

int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			for(int j=0;j<m;j++)
			{
				if(a[i]==100)
					break;
				a[i]=10*ceil(pow(a[i],0.5));
			}
		}
		for(int i=0;i<n;i++)
			i==n-1?printf("%d\n",a[i]):printf("%d ",a[i]);
	}
}