Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
70 commits
Select commit Hold shift + click to select a range
aeff0ff
30700번 - KOREA 문자열 만들기
becky5432 Jul 10, 2024
d664bcd
14724번 - 관리자는 누구?
becky5432 Jul 10, 2024
8c1f1e4
13416번 - 주식 투자
becky5432 Jul 10, 2024
d76713b
5523번 - 경기 결과
becky5432 Jul 10, 2024
28ed394
31668번 - 특별한 가지
becky5432 Jul 10, 2024
f84871e
28074번 - 모비스
becky5432 Jul 10, 2024
3757b14
16486번 - 운동장 한 바퀴
becky5432 Jul 10, 2024
026faae
15740번 - A + B - 9
becky5432 Jul 10, 2024
b59bdaf
31403번 - A + B - C
becky5432 Jul 10, 2024
c439459
16675번 - 두 개의 손
becky5432 Jul 10, 2024
62a454d
4892번 - 숫자 맞추기 게임
becky5432 Jul 10, 2024
85e1d82
5988번 - 홀수일까 짝수일까
becky5432 Jul 10, 2024
f0e698c
28290번 - 안밖? 밖안? 계단? 역계단?
becky5432 Jul 10, 2024
dd44eca
25640번 - MBTI
becky5432 Jul 10, 2024
d0474fe
27959번 - 초코바
becky5432 Jul 10, 2024
8227dd2
27294번 - 몇개고?
becky5432 Jul 10, 2024
fe80c17
10699번 - 오늘 날짜
becky5432 Jul 20, 2024
6a1af44
2738번 - 행렬 덧셈
becky5432 Jul 20, 2024
325ce45
4153번 - 직각삼각형
becky5432 Jul 20, 2024
c3a79d1
30802번 - 웰컴 키트
becky5432 Jul 20, 2024
f96c1c3
15963번 - CASIO
becky5432 Jul 20, 2024
02b6a03
24900번 - 한별 찍기
becky5432 Jul 20, 2024
21a0461
30676번 - 이 별은 무슨 색일까
becky5432 Jul 20, 2024
c0e66fc
3034번 - 앵그리 창영
becky5432 Jul 20, 2024
8c892a9
11966번 - 2의 제곱인가?
becky5432 Jul 20, 2024
7915363
29752번 - 최장 스트릭
becky5432 Jul 20, 2024
3631ff9
18238번 - ZOAC 2
becky5432 Jul 20, 2024
bd7e10a
9653번 - 스타워즈 로고
becky5432 Aug 3, 2024
dbe6747
16394번 - 홍익대학교
becky5432 Aug 3, 2024
679ea42
25628번 - 햄버거 만들기
becky5432 Aug 3, 2024
6aed6f2
13118번 - 뉴턴과 사과
becky5432 Aug 3, 2024
7a522eb
31867번 - 홀짝홀짝
becky5432 Aug 3, 2024
f162335
10865번 - 친구 친구
becky5432 Aug 3, 2024
3eb9896
19564번 - 반복
becky5432 Aug 3, 2024
96dda90
25592번 - 바둑돌 게임
becky5432 Aug 3, 2024
50bcb28
10250번 - ACM 호텔
becky5432 Aug 3, 2024
534437d
15727번 - 조별과제를 하려는데 조장이 사라졌다
becky5432 Aug 3, 2024
395753f
20492번 - 세금
becky5432 Aug 3, 2024
b363391
25238번 - 가희와 방어율 무시
becky5432 Aug 3, 2024
7079dda
20540번 - 연길이의 이상형
becky5432 Aug 3, 2024
79b7fd4
2902번 - KMP는 왜 KMP일까?
becky5432 Aug 3, 2024
7f4019a
21965번 - 드높은 남산 위에 우뚝 선
becky5432 Aug 3, 2024
67ecbd5
2929번 - 머신 코드
becky5432 Aug 3, 2024
3aaf5c8
9070번 - 장보기
becky5432 Aug 3, 2024
39ad9ed
14928번 - 큰 수 (BIG)
becky5432 Aug 29, 2024
8795843
14656번 - 조교는 새디스트야!!
becky5432 Aug 29, 2024
272bcc4
21312번 - 홀짝 칵테일
becky5432 Aug 29, 2024
67eae30
9546번 - 3000번 버스
becky5432 Aug 29, 2024
5feff5d
14625번 - 냉동식품
becky5432 Aug 29, 2024
ba53105
4150번 - 피보나치 수
becky5432 Aug 29, 2024
c0e8c5a
18311번 - 왕복
becky5432 Aug 29, 2024
88289ce
11557번 - Yangjojang of The Year
becky5432 Aug 29, 2024
3e3f3b9
10101번 - 삼각형 외우기
becky5432 Aug 29, 2024
4385874
25629번 - 홀짝 수열
becky5432 Aug 29, 2024
1f5c40a
30032번 - 알파벳 뒤집기
becky5432 Aug 29, 2024
dd166bc
1212번 - 8진수 2진수
becky5432 Aug 29, 2024
6bf441c
7567번 - 그릇
becky5432 Aug 29, 2024
8811b25
10989번 - 수 정렬하기 3
becky5432 Aug 29, 2024
9b2799e
10814번 - 나이순 정렬
becky5432 Aug 29, 2024
ae769e6
15726번 - 이칙연산
becky5432 Aug 29, 2024
1859210
19698번 - 헛간 청약
becky5432 Aug 29, 2024
54b47ee
6359번 - 만취한 상범
becky5432 Aug 29, 2024
1f4ca24
15813번 - 너의 이름은 몇 점이니?
becky5432 Aug 29, 2024
9c24ed2
16497번 - 대출 요청
becky5432 Aug 29, 2024
e6f4222
8979번 - 올림픽
becky5432 Aug 29, 2024
9a9ff9b
27433번 - 팩토리얼 2
becky5432 Aug 29, 2024
2ef1617
11283번 - 한글 2
becky5432 Aug 29, 2024
e7a3503
6322번 - 직각 삼각형의 두 변
becky5432 Aug 29, 2024
30fa1c5
1668번 - 트로피 진열
becky5432 Aug 29, 2024
b4cb018
25755번 - 거울반사
becky5432 Aug 29, 2024
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
19 changes: 19 additions & 0 deletions 202402715/10101.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();

if(a+b+c != 180) {
System.out.print("Error");
}else if(a==b && b==c){
System.out.print("Equilateral");
}else if(a==b || a==c || b==c) {
System.out.print("Isosceles");
}else {
System.out.print("Scalene");
}
}
}
13 changes: 13 additions & 0 deletions 202402715/10250.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();

if(a%5==0){
System.out.print(a/5);
}else{
System.out.print(a/5+1);
}
}
}
6 changes: 6 additions & 0 deletions 202402715/10699.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
public class Main{
public static void main(String[] args){
System.out.print("2024-07-11");

}
}
31 changes: 31 additions & 0 deletions 202402715/10814.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
String[][] in = new String[a][3];
int q = 0;
for(int i = 0; i<a;i++) {
in[i][0] = sc.next();
in[i][1] = sc.next();
in[i][2] = ""+q;
q++;
}
Arrays.sort(in, new Comparator<String[]>() {
public int compare(String[] o1, String[] o2) {
int firstComparison = Integer.compare(Integer.parseInt(o1[0]), Integer.parseInt(o2[0]));
if (firstComparison==0) {
return Integer.compare(Integer.parseInt(o1[2]), Integer.parseInt(o2[2]));
}
return firstComparison;
}
});

for(int i = 0; i<a;i++) {
System.out.printf(in[i][0] + " " +in[i][1] + "\n");
}

}
}
16 changes: 16 additions & 0 deletions 202402715/10865.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int k = sc.nextInt();
int[] a = new int[num];
for(int i = 0; i<k*2;i++){
int t = sc.nextInt();
a[t-1]++;
}
for(int i = 0; i<num;i++){
System.out.println(a[i]);
}
}
}
25 changes: 25 additions & 0 deletions 202402715/10989.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;

public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();

int a = Integer.parseInt(br.readLine());
int[]num = new int[a];

for(int i = 0; i<a;i++) {
num[i]= Integer.parseInt(br.readLine());
}

Arrays.sort(num);

for(int i = 0; i<a; i++) {
sb.append(num[i]).append('\n');
}
System.out.println(sb);
}
}
9 changes: 9 additions & 0 deletions 202402715/11283.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String in = sc.next();
int a = in.charAt(0);
System.out.println(a-44031);
}
}
33 changes: 33 additions & 0 deletions 202402715/11557.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
for(int i = 0; i<a; i++) {
int b = sc.nextInt();
String[][] in = new String[b][2];
for(int j = 0; j<b;j++) {
in[j][0] = sc.next();
in[j][1] = sc.next();
}


Arrays.sort(in, new Comparator<String[]>() {

public int compare(String[] o1, String[] o2) {
return Integer.valueOf(o1[1]).compareTo(Integer.valueOf(o2[1]));
}
});

/*for(int k = 0; k<2; k++) {
for(int j = 0; j<b;j++) {
System.out.print(in[j][k]);
System.out.println();
}
}*/
System.out.println(in[b-1][0]);
}


}
}
19 changes: 19 additions & 0 deletions 202402715/11966.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int in = sc.nextInt();
while(true) {
if(in==1) {
System.out.print("1");
break;
}
if(in%2==1) {
System.out.print("0");
break;
}else {
in = in/2;
}
}
}
}
57 changes: 57 additions & 0 deletions 202402715/1212.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int q = sc.nextInt();
int b = sc.nextInt();
char[][] in = new char[q][q];
for(int j = 0; j<q;j++){
String k = sc.next();
for(int i = 0; i<q;i++){
in[j][i] = k.charAt(i);
}
}

if(b==1){
for(int j = 0; j<q;j++){
for(int i = 0; i<q;i++){
switch(in[j][i]){
case('d'): in[j][i]='q';
break;
case('b'): in[j][i]='p';
break;
case('q'): in[j][i]='d';
break;
case('p'): in[j][i]='b';
break;
}
}
}
}else{
for(int j = 0; j<q;j++){
for(int i = 0; i<q;i++){
switch(in[j][i]){
case('d'): in[j][i]='b';
break;
case('b'): in[j][i]='d';
break;
case('q'): in[j][i]='p';
break;
case('p'): in[j][i]='q';
break;
}
}
}
}



//배열 출력
for(int j = 0; j<q;j++){
for(int i = 0; i<q;i++){
System.out.print(in[j][i]);
}
System.out.println();
}
}
}
23 changes: 23 additions & 0 deletions 202402715/13118.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int[] num = new int[4];
for(int i = 0; i<4; i++){
num[i]=sc.nextInt();
}
int x = sc.nextInt();
int a= 0;
while(true){
if(x==num[a]){
System.out.print(a+1);
break;
}
a++;
if(a==4){
System.out.print(0);
break;
}
}
}
}
20 changes: 20 additions & 0 deletions 202402715/13416.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
for(int i = 0; i<a; i++) {
int b = sc.nextInt();
int sum = 0;
for(int j = 0; j<b; j++) {
int[] v = {sc.nextInt(), sc.nextInt(), sc.nextInt()};
Arrays.sort(v);
if(v[2]>0) {
sum = sum + v[2];
}
}
System.out.println(sum);
}
}
}
58 changes: 58 additions & 0 deletions 202402715/14625.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,58 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h1 = sc.nextInt();
int m1 = sc.nextInt();
int h2 = sc.nextInt();
int m2 = sc.nextInt();
int count = 0;
int a = sc.nextInt();

if(h2-h1==0) {
if(h1/10==a||h1%10==a) {
count = m2-m1+1;
}else {
for(int i = m1; i<m2;i++) {
if(i/10==a||i%10==a) {
count++;
}
}
}
}

else {
if(h1/10==a||h1%10==a) {
count = count + 60 - m1;
}else {
for(int i = m1; i<60;i++) {
if(i/10==a||i%10==a) {
count++;
}
}
}
if(h2/10==a||h2%10==a) {
count = count + m2;
}else {
for(int i = 0; i<m2+1;i++) {
if(i/10==a||i%10==a) {
count++;
}
}
}
for(int i = h1+1; i<h2;i++) {
if(i/10==a||i%10==a) {
count = count + 60;
}else {
for(int j = 0; j<60;j++) {
if(j/10==a||j%10==a) {
count++;
}
}
}
}
}
System.out.print(count);

}
}
14 changes: 14 additions & 0 deletions 202402715/14656.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int count = 0;
for(int i = 0; i<a;i++){
if(sc.nextInt()!=i+1){
count++;
}
}
System.out.print(count);
}
}
27 changes: 27 additions & 0 deletions 202402715/14724.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] m = new int[9];
int[] n = new int[9];
int[] k = new int[a];
String[] q = {"PROBRAIN", "GROW", "ARGOS", "ADMIN", "ANT", "MOTION", "SPG", "COMON", "ALMIGHTY"};
for(int i = 0; i<9; i++) {
for(int j = 0; j<a;j++) {
k[j] = sc.nextInt();
}
Arrays.sort(k);
m[i] = k[a-1];
n[i] = k[a-1];
}
Arrays.sort(m);
for(int i = 0; i<9; i++) {
// System.out.printf("%d %d\n", m[i], n[i]);
if(n[i] == m[8]) {
System.out.println(q[i]);
}
}
}
}
Loading