Skip to content

문제 풀이 완료 #6

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
tryterry wants to merge 1 commit into
base: main
Choose a base branch
from
Open

문제 풀이 완료 #6

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
45 changes: 45 additions & 0 deletions 2025-02-06/terry/p_1.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
package study.d_250206;

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


public class p_1 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

//given
StringTokenizer st = new StringTokenizer(br.readLine());
int n, m;
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
int[][] arr = new int[n][m];

//when
for (int i = 0; i < n; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < m; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
//then
for (int i = 0; i < n/2; i++) {
for (int j = 0; j < m; j++) {
int temp = arr[i][j];
arr[i][j] = arr[n - 1 - i][j];
arr[n - 1 - i][j] = temp;
}
}

for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
bw.write(arr[i][j] + " ");
}
bw.newLine();
}

br.close();
bw.close();
}
}
41 changes: 41 additions & 0 deletions 2025-02-06/terry/p_1_2.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
package study.d_250206;

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

/**
* 1번 문제 다른 풀이
* 스왑 하지 않고 순서만 바꿔서 출력
*/

public class p_1_2 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

//given
StringTokenizer st = new StringTokenizer(br.readLine());
int n, m;
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
int[][] arr = new int[n][m];

//when
for (int i = 0; i < n; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < m; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
//then
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < m; j++) {
bw.write(arr[i][j] + " ");
}
bw.newLine();
}

br.close();
bw.close();
}
}
49 changes: 49 additions & 0 deletions 2025-02-06/terry/p_2.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
package study.d_250206;

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

public class p_2 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

StringTokenizer st = new StringTokenizer(br.readLine());
int n, m;
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
int[][] arr = new int[n][m];


for (int i = 0; i < n; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < m; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
for (int i = 0; i < n / 2; i++) {
for (int j = 0; j < m; j++) {
int temp = arr[i][j];
arr[i][j] = arr[n - 1 - i][j];
arr[n - 1 - i][j] = temp;
}
}

for (int i = 0; i < n; i++) {
for (int j = 0; j < m / 2; j++) {
int temp = arr[i][j];
arr[i][j] = arr[i][m - j - 1];
arr[i][m - j - 1] = temp;
}
}

for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
bw.write(String.valueOf(arr[i][j] + " "));
}
bw.newLine();
}
bw.close();
br.close();
}
}
41 changes: 41 additions & 0 deletions 2025-02-06/terry/p_2_2.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
package study.d_250206;

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

/**
* 2번 문제 다른 풀이
* 스왑 하지 않고 순서만 바꿔서 출력
*/

public class p_2_2 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

StringTokenizer st = new StringTokenizer(br.readLine());
int n, m;
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
int[][] arr = new int[n][m];


// 배열 초기화
for (int i = 0; i < n; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < m; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}


for (int i = n-1; i >= 0; i--) {
for (int j = m-1; j >= 0; j--) {
bw.write(String.valueOf(arr[i][j] + " "));
}
bw.newLine();
}
bw.close();
br.close();
}
}
54 changes: 54 additions & 0 deletions 2025-02-06/terry/p_3.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
package study.d_250206;

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

public class p_3 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

StringTokenizer st = new StringTokenizer(br.readLine());
int n, m;
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
int[][] arr1 = new int[n][m];
int[][] arr2 = new int[m][n];

int[][] result = new int[n][n];

for (int i = 0; i < n; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < m; j++) {
arr1[i][j] = Integer.parseInt(st.nextToken());
}
}

for (int i = 0; i < m; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < n; j++) {
arr2[i][j] = Integer.parseInt(st.nextToken());
}
}

for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int sum = 0;
for (int k = 0; k < m; k++) {
sum += arr1[i][k] * arr2[k][j];
}
result[i][j] = sum;
}
}

for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
bw.write(result[i][j] + " ");
}
bw.newLine();
}

br.close();
bw.close();
}
}
31 changes: 31 additions & 0 deletions 2025-02-06/terry/p_4.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
package study.d_250206;

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

public class p_4 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

int n = Integer.parseInt(br.readLine());
int[] arr = new int[n];

StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}

int max = arr[0];
int min = arr[0];
for (int i = 0; i < n; i++) {
if(arr[i] > max) max = arr[i];
if(arr[i] < min) min = arr[i];
}

bw.write(max + " " + min);
bw.close();
br.close();

}
}