JoeUnsung

#include <stdio.h>
#include <stdlib.h>

int *A; // 받아온 숫자를 저장하기 위한 배열을 전역변수로 선언합니다.
int *B; // 임시저장을 위한 배열을 전역변수로 선언합니다. 추후 동적할당을 통해 활용.
void Merge(int low, int mid, int high); // bottom up merge를 위한 소트


int main(void) {
	int n = 0; // 수의 갯수

JoeUnsung

package joe;
import java.util.*;
import java.lang.*;

class dfSearch{
	int wheat = 1;
	int cnt = 0;
	int map[][]; 

JoeUnsung

import java.util.*;
import java.io.*;

class Main {
	
	public static int checkCompleteNum(int num){
			// 숫자가 완전제곱수인지를 체크하는 메서드 작성.
		for(int i = 0 ; i < num ; i++){
			if ( num == i*i ){

JoeUnsung

import java.util.*;
import java.text.*;

class Main {
	
	public static double avgCnt(int[] list, int cnt){
			double sum = 0;
			for(int i = 0 ; i < cnt ; i++){
				sum += (double)list[i];
			}

JoeUnsung

import java.util.*;
import java.lang.*;

class Main {
	
	 public static String reverseString(String s) {
    return ( new StringBuffer(s) ).reverse().toString();
  }

  public static void main(String[] args) {

JoeUnsung

package joe;


public class E2_20101062 {

	public static void main(String[] args){
		int N=8, M=5;
		int[][] map = {{1,0,1,1,0},
				{0,0,1,0,0},
				{1,0,0,0,1},

JoeUnsung

package joe;

import java.lang.*;
import java.util.*;

public class E1_20101062 {
	public static void main(String[] args){
		String[] color = {"red", "green", "blue", "white", "black", "yellow", "pink", "grey"};
		Queue myQue = new LinkedList();
		Stack myStack = new Stack();

JoeUnsung

package joe;

import java.lang.*;
import java.util.*;
import java.io.*;

public class HW3_PRAC {
	
	public static int count(String src, String target){
		char temp1, temp2;

JoeUnsung

package joe;

import java.lang.*;
import java.util.*;

class Connection {
	private String departure;
	private String arrival;

JoeUnsung

package joe;

import java.util.*;

public class P8_20101062_1 {

	public static void main(String[] args){

		Random r = new Random();