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: 90ms
Memory: 2012kB
In contest: 1276

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 50;
int main()
{
	int n, k;
	cin >> n >> k;
	int a[maxn];
	for(int i=1;i<=n;i++)
	{
		cin >> a[i];
	}
	k = min(k, 10);
	while(k--)
	{
		for(int i=1;i<=n;i++)
		{
			a[i] = ceil(sqrt(1.0*a[i])) * 10;
		}
	}
	for(int i = 1;i<=n;i++)
	{
		cout << a[i];
		if(i == n)cout << endl;
		else cout << " ";
	}
	return 0;
}