Replace the function of pow with two-dimensional array (solve the time overrun caused by POW)

int a[10][7]={
    0};
	for(int w=1;w<=9;w++){
    
	for(int q=0;q<=7;q++){
    
		if(q==0)a[w][q]=1;
		else a[w][q]=a[w][q-1]*w;
		printf("%d\n",a[w][q]);
	}	
	}

among w It's the base number ,q It's the index .