Result: Accepted
Time: 60ms
Memory: 2520kB
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<math.h>
#include<cstring>
#include<queue>
#include<string>
using namespace std;
#define ll long long
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int change(int x,int k)
{
for(int i=0;i<k;i++)
{
if(x == 100)
break;
else
{
x = ceil(sqrt(x * 1.0)) * 10;
}
}
return x;
}
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++)
b[i] = change(a[i],k);
for(int i=0;i<n;i++)
printf("%d%c",b[i],i == n-1 ? '\n' : ' ');
}