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

#include<iostream>
#include<stdio.h>
#include<string>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
const int maxn=1e5+5;
int a[maxn]={0};
int b[maxn]={0};
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	int flag=1;
	if(m<=10){
		flag=0;
	while(m--){
		for(int i=0;i<n;i++)
			a[i]=((int)ceil((sqrt(1.0*a[i]))))*10;
	
	}
	}
	else{
		for(int i=0;i<n;i++)
			printf("100\n");
	}
	if(flag==0){
	
	
	for(int i=0;i<n;i++){
		if(i==0)
			printf("%d",a[i]);
		else
			printf(" %d",a[i]);
	}
	printf("\n");
}
	return 0;
}