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

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10 ;
long long arr[maxn] ;
int main(int argc, char const *argv[])
{
	int n,k ;
	cin >> n >> k ;
	for(int i = 0 ; i < n ; ++ i)
	{
		scanf("%lld",&arr[i]) ;
	}
	if(k >= 5)
	{
		for(int i = 0 ; i < n ; ++ i)
		{
			printf("100 ") ;
		}
		printf("\n") ;
		return 0 ;
	}
	while(k --)
	{
		for(int i = 0 ; i < n ; ++ i)
		{
			arr[i] = int(sqrt(arr[i]) + 0.9999999999) * 10ll ;
		}
	}
	for(int i = 0 ; i < n ; ++ i)
	{
		printf("%lld ",arr[i]) ;
	}
	return 0;
}