U E D R , A S I H C RSS

수학의정석/행렬/조현태

, .
.. ( ..;;ㅁ;;)
cpu_clocks.. 확하!!!!
포함 .. , .
..( ).. 0.. ..
킁..;;ㅁ;;

~cpp 
// CPU_CLOCKS  . 
#include <time.h> 
#include <stdio.h>
#include <iostream>
const int BAE_YOL_SU=2;
int size_x[BAE_YOL_SU];
int size_y[BAE_YOL_SU];
int *baeyol[BAE_YOL_SU];

void input_data();

int main() 
{ 
	input_data();//   
		int time_in;   //   . 
	time_in = clock();   //    . 
	if (size_x[0]!=size_x[1] || size_y[0]!=size_y[1])
		printf("\n");
	else
	{
		for (register int i=0; i<size_y[0]; ++i)
		{
			for (register int j=0; j<size_x[1]; ++j)
			{
				printf("%d ",*(baeyol[0]+i*size_x[0]+j)+*(baeyol[1]+i*size_x[1]+j));
			}
			printf("\n");
		}
	}
	if (size_x[0]!=size_y[1])
		printf("\n");
	else
	{
		for (register int i=0; i<size_y[0]; ++i)
		{
			for (register int j=0; j<size_x[1]; ++j)
			{
				int temp=0;
				for (register int k=0; k<size_x[0]; ++k)
					temp+=(*(baeyol[0]+i*size_x[0]+k))*(*(baeyol[1]+k*size_x[1]+j));
				printf("%d ",temp);
			}
			printf("\n");
		}
	}
	for (register int i=0; i<BAE_YOL_SU; ++i)
		free(baeyol[i]);
	printf("CPU CLOCKS = %d\n", clock() - time_in);   //   -   =   
	return 0;    //  . 
} 

void input_data()
{
	for (register int i=0; i<BAE_YOL_SU; ++i)
	{
		printf("  .>>");
		scanf("%d",&size_y[i]);
		printf("  .>>");
		scanf("%d",&size_x[i]);
		printf("\n");
		baeyol[i]=(int*)malloc(sizeof(int)*size_x[i]*size_y[i]);
		for (register int j=0; j<size_y[i]; ++j)
		{
			for (register int k=0; k<size_x[i]; ++k)
			{
				printf("%d행 %d  .>>",j+1,k+1);
				scanf("%d",baeyol[i]+j*size_x[i]+k);
			}
			printf("\n");
		}
	}
	printf("\n");
}
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:30:15
Processing time 0.0166 sec