U E D R , A S I H C RSS

큰수찾아저장하기/조현태

흑.. ..ㅎㅎ
..ㅎㅎ

, MT , ~ ~ㅎㅎㅎ

// ~ ..ㅎㅎ

~cpp 
#include <iostream>

using namespace std;

const int MAX_GARO=4;
const int MAX_SAERO=4;

void main()
{
	int number[MAX_SAERO][MAX_GARO]={0,};
	for (register int i=0; i<MAX_SAERO-1; ++i)
	{
		for (register int j=0; j<MAX_GARO-1; ++j)
		{
			cout << i << "행" << j << "  .>>";
			cin >> number[i][j];
			if (number[i][j]>number[i][MAX_GARO-1])
				number[i][MAX_GARO-1]=number[i][j];
			if (number[i][j]>number[MAX_SAERO-1][j])
				number[MAX_SAERO-1][j]=number[i][j];
			if (number[i][j]>number[MAX_SAERO-1][MAX_GARO-1])
				number[MAX_SAERO-1][MAX_GARO-1]=number[i][j];
		}
	}
	system("CLS");
	cout << " .\n";
	for (register int i=0; i<MAX_SAERO; ++i)
	{
		for (register int j=0; j<MAX_GARO; ++j)
		{
			cout << number[i][j] << "\t";
		}
		cout << "\n";
	}
}

~
.. ㅋㅋ AOI ,, LittleAOI
, LittleAOI ~ ㅋㅋ ~
, ! ,~ 히 할. -

, . .ㅋㅋ
, ..ㅎㅎ ..ㅎㅎ -

ㅡㅡ;; =_=;; ㅋㅋㅋ
. ..ㅎㅎㅎ -

, ㅎㅎ
.
,, .
, ㅎㅎ
, . .. , .
, ^^
~~ !! ^^ !~ ㅋ-

system("CLS"); ? cpp .. --


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:31:20
Processing time 0.0151 sec