한자공/시즌3/20140709 - Revision history

imported>healu1423 at 12:28, 14 July 2014

2014-07-14T12:28:21Z

← Older revision		Revision as of 12:28, 14 July 2014
Line 443:		Line 443:

	System.out.println("input(엔터 두번시 완료)");		System.out.println("input(엔터 두번시 완료)");
	for(N = 0; true; N++){		for(N = 0; true; N++){
	tmpStr = scan.nextLine();		tmpStr = scan.nextLine();
	tmpArr = tmpStr.split(" ");		tmpArr = tmpStr.split(" ");

	try{ for(int jud = 0; jud < tmpArr.length; jud++)		try{
			for(int jud = 0; jud < tmpArr.length; jud++)
	map[N][jud] = Integer.valueOf(tmpArr[jud]);		map[N][jud] = Integer.valueOf(tmpArr[jud]);
	}catch(IllegalArgumentException x){		}catch(IllegalArgumentException x){
	for(int r = 0; r < N;r++){		for(int r = 0; r < N;r++){
	for(int c = 0; c < M;c++){		for(int c = 0; c < M;c++){
	map[r][M] += map[r][c];		map[r][M] += map[r][c];
	map[N][c] += map[r][c];		map[N][c] += map[r][c];
	map[N][M] += map[r][c];		map[N][M] += map[r][c];
	}
	}		}
	break;		}
	}// 예외처리를 통한 탈출		break;
			}// 예외처리를 통한 탈출
	if(N == 0) M = tmpArr.length;// NxM에서 M을 구함;
	}		if(N == 0) M = tmpArr.length;// NxM에서 M을 구함;
			}

	System.out.println("output");		System.out.println("output");

2014-07-14T12:24:38Z

← Older revision		Revision as of 12:24, 14 July 2014
Line 447:		Line 447:
	tmpArr = tmpStr.split(" ");		tmpArr = tmpStr.split(" ");

	try{ for(int jud = 0; jud <= tmpArr.length; jud++)		try{ for(int jud = 0; jud < tmpArr.length; jud++)
	map[N][jud] = Integer.valueOf(tmpArr[jud]);		map[N][jud] = Integer.valueOf(tmpArr[jud]);
	}catch(IllegalArgumentException x){		}catch(IllegalArgumentException x){

2014-07-14T12:19:19Z

← Older revision		Revision as of 12:19, 14 July 2014
Line 447:		Line 447:
	tmpArr = tmpStr.split(" ");		tmpArr = tmpStr.split(" ");

	try{ for(jud = 0; jud <= tmpArr.length; jud++)		try{ for(int jud = 0; jud <= tmpArr.length; jud++)
	map[N][jud] = Integer.valueOf(tmpArr[jud]);		map[N][jud] = Integer.valueOf(tmpArr[jud]);
	}catch(IllegalArgumentException x){		}catch(IllegalArgumentException x){
	for(int r = 0; r < N;r++){		for(int r = 0; r < N;r++){

2014-07-14T12:18:12Z

← Older revision		Revision as of 12:18, 14 July 2014
Line 437:		Line 437:
	public static void main(String[] args) {		public static void main(String[] args) {
	Scanner scan = new Scanner( System.in );		Scanner scan = new Scanner( System.in );
	int ~~jud=1,~~N,M=0;		int N,M=0;
	String tmpStr;		String tmpStr;
	String []tmpArr;		String []tmpArr;

2014-07-14T12:17:47Z

← Older revision		Revision as of 12:17, 14 July 2014
Line 447:		Line 447:
	tmpArr = tmpStr.split(" ");		tmpArr = tmpStr.split(" ");

	try{		try{ for(jud = 0; jud <= tmpArr.length; jud++)
	for(jud = 0; jud <= tmpArr.length; jud++)		map[N][jud] = Integer.valueOf(tmpArr[jud]);
	map[N][jud] = Integer.valueOf(tmpArr[jud]);
	}catch(IllegalArgumentException x){		}catch(IllegalArgumentException x){
	for(int r = 0; r < N;r++){		for(int r = 0; r < N;r++){

2014-07-14T12:17:07Z

← Older revision		Revision as of 12:17, 14 July 2014
Line 448:		Line 448:

	try{		try{
	for(jud = 0; jud <= tmpArr.length; jud++) map[N][jud] = Integer.valueOf(tmpArr[jud]);		for(jud = 0; jud <= tmpArr.length; jud++)
			map[N][jud] = Integer.valueOf(tmpArr[jud]);
	}catch(IllegalArgumentException x){		}catch(IllegalArgumentException x){
	for(int r = 0; r < N;r++){		for(int r = 0; r < N;r++){

2014-07-14T12:16:33Z

← Older revision		Revision as of 12:16, 14 July 2014
Line 435:		Line 435:

	public class NxM {		public class NxM {

	public static void main(String[] args) {		public static void main(String[] args) {
	Scanner scan = new Scanner( System.in );		Scanner scan = new Scanner( System.in );
	~~System.out.println("input");~~

	int jud=1,N,M=0;		int jud=1,N,M=0;
	String tmpStr;		String tmpStr;
Line 445:		Line 442:
	int [][]map = new int[1000][1000];		int [][]map = new int[1000][1000];

	for(N = 0; ~~jud != 0~~ ; N++){		System.out.println("input(엔터 두번시 완료)");
	tmpStr = scan.nextLine();		for(N = 0; true; N++){
	tmpArr = tmpStr.split(" ");		tmpStr = scan.nextLine();
			tmpArr = tmpStr.split(" ");
	~~jud = 0;~~
	try{		try{
	for(~~String x :~~ tmpArr){		for(jud = 0; jud <= tmpArr.length; jud++) map[N][jud] = Integer.valueOf(tmpArr[jud]);
	map[N][jud] = Integer.valueOf(x);		}catch(IllegalArgumentException x){
	~~jud++~~;		for(int r = 0; r < N;r++){
	}		for(int c = 0; c < M;c++){
	}catch(IllegalArgumentException x){		map[r][M] += map[r][c];
	for(int r = 0; r < N;r++){		map[N][c] += map[r][c];
	for(int c = 0; c < M;c++){		map[N][M] += map[r][c];
	map[r][M] += map[r][c];		}
	map[N][c] += map[r][c];		}
	map[N][M] += map[r][c];		break;
	}		}// 예외처리를 통한 탈출
	}
	break;		if(N == 0) M = tmpArr.length;// NxM에서 M을 구함;
	}// 예외처리를 통한 탈출		}

	if(N == 0) M = tmpArr.length;
	// NxM에서 M을 구함;
	}

	System.out.println("output");		System.out.println("output");

2014-07-14T12:06:57Z

← Older revision		Revision as of 12:06, 14 July 2014
Line 438:		Line 438:
	public static void main(String[] args) {		public static void main(String[] args) {
	Scanner scan = new Scanner( System.in );		Scanner scan = new Scanner( System.in );

	System.out.println("input");		System.out.println("input");

Line 454:		Line 453:
	for(String x : tmpArr){		for(String x : tmpArr){
	map[N][jud] = Integer.valueOf(x);		map[N][jud] = Integer.valueOf(x);

	jud++;		jud++;
	}		}
Line 463:		Line 461:
	map[N][c] += map[r][c];		map[N][c] += map[r][c];
	map[N][M] += map[r][c];		map[N][M] += map[r][c];
	}		}
	}		}
	break;		break;
	}		}// 예외처리를 통한 탈출
	// 예외처리를 통한 탈출

	if(N == 0) M = tmpArr.length;		if(N == 0) M = tmpArr.length;
Line 474:		Line 471:

	System.out.println("output");		System.out.println("output");

	for(int r = 0; r <= N;r++){		for(int r = 0; r <= N;r++){
	for(int c = 0; c <= M;c++){		for(int c = 0; c <= M;c++){

2014-07-14T12:04:59Z

@@ Line 424: / Line 424: @@
   		for(int r = 0; r &lt;= i;r++){
   			for(int c = 0; c &lt;= i;c++){
   				System.out.printf("%3d",map[r][c]);
+  			}

2014-07-14T07:07:49Z

← Older revision		Revision as of 07:07, 14 July 2014
Line 235:		Line 235:
	}		}
	예외처리가 필요없게 만듦 + main 메서드 단순화.		예외처리가 필요없게 만듦 + main 메서드 단순화.
			+pow메서드 사용시 0.5는 되고 1/2는 안 되는 문제 해결. 1/2가 0으로 계산되는 것이었다.


	다음은 m*n형태의 행렬 계산입니다.		다음은 m*n형태의 행렬 계산입니다.