blog

02함수 - 신경망 - 역전파 - 경사하강법

2. 신경망

package com.gyuone.exam01;

public class kakao {
	public static void main(String[] args) {
		int map1[] = { 46, 33, 33, 22, 31, 50 };
		int map2[] = { 27, 56, 19, 14, 14, 10 };

		char resultMap[][] = new char[6][6];
		int comMap = 0;
		for (int i = 0; i < 6; i++)
		  for (int k = 0; k < 6; k++)
		    resultMap[i][k] = ' ';

		for (int i = 0; i < 6; i++)
		{
		  comMap = map1[i] | map2[i];
		  for (int k = 0; comMap > 0; k++) {
		    if (comMap % 2 != 0)
		      resultMap[i][5 - k] = '#';
		    comMap /= 2;
		  }
		}
        
		printMap(resultMap);
	}
		
		//1. 10 진수 ==> 2진수 변환
		//2. 자바의 bit 연산자
		
	        
		

	public static void printMap(char[][] map) {
		for (int i = 0; i < map.length; i++) {
			for (int k = 0; k < map.length; k++) {
				System.out.printf("%c ", map[i][k]);
			}
			System.out.println();
		}
	}
}
package com.gyuone.exam01;

public class kakao {
	public static void main(String[] args) {
		int map1[] = { 46, 33, 33, 22, 31, 50 };
		int map2[] = { 27, 56, 19, 14, 14, 10 };

		char resultMap[][] = new char[6][6];
		int comMap = 0;
		for (int i = 0; i < 6; i++)
		  for (int k = 0; k < 6; k++)
		    resultMap[i][k] = ' ';

		for (int i = 0; i < 6; i++)
		{
		  comMap = map1[i] | map2[i];
		  for (int k = 0; comMap > 0; k++) {
		    if (comMap % 2 != 0)
		      resultMap[i][5 - k] = '#';
		    comMap /= 2;
		  }
		}
        
		printMap(resultMap);
	}
		
		//1. 10 진수 ==> 2진수 변환
		//2. 자바의 bit 연산자
		
	        
		

	public static void printMap(char[][] map) {
		for (int i = 0; i < map.length; i++) {
			for (int k = 0; k < map.length; k++) {
				System.out.printf("%c ", map[i][k]);
			}
			System.out.println();
		}
	}
}

마방진

MagicMain.java

package com.gyuone.exam01;

public class MagicMain {
	public static void main(String[] args) {
		int[][] a = new int[5][5];
		MagicSquare square = new MagicSquare(a);
		printSquare(square.getSquare());
	}
	
	
	
	public static void printSquare(int[][] arr) {
		for(int i = 0; i < arr.length; i++) {
			for(int k = 0; k < arr[i].length; k++) {
				System.out.printf("%2d ", arr[i][k]);
			}
			System.out.println();
		}
	}
}

MagicSquare.java

package com.gyuone.exam01;

public class MagicSquare {
	private int[][] arr;

	public MagicSquare(int[][] arr) {
		this.arr = arr;
	}

	public int[][] getSquare() {
		int row = arr.length - 1; // 1
		int col = arr.length / 2; // 3
		int max = arr.length - 1;

		arr[row][col] = 1;

		for (int i = 2; i <= arr.length * arr.length; i++) {
			if ((col + 1) > max && (row + 1) > max) {
				row--;
			} else if ((col + 1) > max) {
				col = 0;
				row++;

			} else if ((row + 1) > max) {
				row = 0;
				col++;
			} else {
				row++;
				col++;
			}
			if(arr[row][col] != 0) {
				row -= 2;
				col--;
			}
			arr[row][col] = i;
		}
		return arr;
	}
}

지뢰찾기

mine = 9X9 array

while(true)
  input row
  input col
  sum = 0
  
  if mine[row][col] 지뢰
  then
    print("BOOM!")
    break

  for i start=row-1, end=row+1
    for k start=col-1, end=col+1
    if row or col out of range
    then 
      continue
    else
      if mine[i][k] == 1
      then
        sum++
    end for
  end for
  print(sum)
end while

package com.gyuone.exam01;

public class Graph {
	public static void main(String[] args) {
		int ar[] = { 50, 64, 39, 66, 93, 78, 0, 100 };
		char br[][] = new char[10][8];
		for (int i = 0; i < br.length; i++)
			for (int j = 0; j < br[0].length; j++)
				br[i][j] = '.';
		for (int i = 0; i < ar.length; i++) {
			for (int k = 0; k < ar[i] / 10; k++) {
				br[br.length - 1 - k][i] = 'O';
			}
		}
		printArr(br);
	}
	public static void printArr(char[][] arr) {
		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr[0].length; j++) {
				System.out.printf("%c ", arr[i][j]);
			}
			System.out.println();
		}
	}
}
//. . . . . . . O
//. . . . O . . O
//. . . . O . . O
//. . . . O O . O
//. O . O O O . O
//O O . O O O . O
//O O . O O O . O
//O O O O O O . O
//O O O O O O . O
//O O O O O O . O