Skip to content

Commit b6496a8

Browse files
iljuniljun
committed
no message
1 parent d97a3dd commit b6496a8

File tree

7 files changed

+257
-0
lines changed

7 files changed

+257
-0
lines changed

‎bin/.gitignore‎

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1 +1,35 @@
1+
/BackJun_1463/
12
/BackJun_1655/
3+
/BackJun_1753/
4+
/BackJun_1766/
5+
/BackJun_1916/
6+
/BackJun_1927/
7+
/BackJun_1932/
8+
/BackJun_2293/
9+
/BackJun_2696/
10+
/Backjun_11279/
11+
/Backjun_11286/
12+
/GetMinValue/
13+
/MaxHaep/
14+
/MaxHeap_2/
15+
/codility_lession3_3/
16+
/codility_lession6_4/
17+
/codility_lesson1/
18+
/codility_lesson2/
19+
/codility_lesson2_1/
20+
/codility_lesson3_1/
21+
/codility_lesson3_2/
22+
/codility_lesson4_1/
23+
/codility_lesson4_2/
24+
/codility_lesson5_1/
25+
/codility_lesson5_2/
26+
/codility_lesson5_3/
27+
/codility_lesson5_4/
28+
/codility_lesson6_1/
29+
/codility_lesson6_2/
30+
/codility_lesson6_3/
31+
/codility_lesson7_1/
32+
/codingdojang_18/
33+
/codingdojang_7/
34+
/codingdojang_98/
35+
/Backjun_1715/

‎src/BackJun_2293/Main.java‎

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
package BackJun_2293;
2+
3+
import java.util.Scanner;
4+
5+
public class Main {
6+
//TODO DP문제는 점화식을 구해보자
7+
public static void main(String[] args) {
8+
// TODO Auto-generated method stub
9+
Scanner input = new Scanner(System.in);
10+
11+
int size = input.nextInt();//입력되는 동전의 갯수
12+
int result = input.nextInt();//합을 맞춰야되는 값
13+
14+
int[] arr = new int[result+1];//
15+
int[] coin = new int[size];//동전을 저장하는 배열
16+
17+
for(int i=0; i<size; i++){
18+
coin[i]=input.nextInt();
19+
}
20+
21+
arr[0]=1;
22+
for(int i=0; i<coin.length; i++){
23+
for(int j=1; j<result +1 ; j++){
24+
if(coin[i]<=j){
25+
arr[j] = arr[j] + arr[j - coin[i]];
26+
}
27+
}
28+
}
29+
30+
System.out.println(arr[result]);
31+
}
32+
33+
}

‎src/Backjun_11286/Main.java‎

Lines changed: 50 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,50 @@
1+
package Backjun_11286;
2+
3+
import java.util.PriorityQueue;
4+
import java.util.Scanner;
5+
6+
public class Main {
7+
8+
public static void main(String[] args) {
9+
// TODO Auto-generated method stub
10+
Scanner input = new Scanner(System.in);
11+
12+
int size = input.nextInt();
13+
14+
PriorityQueue<Node> queue = new PriorityQueue<Node>();
15+
StringBuilder builder = new StringBuilder();
16+
17+
int x;
18+
19+
for(int i=0; i<size; i++){
20+
x=input.nextInt();
21+
if(x==0){
22+
if(queue.isEmpty())
23+
builder.append(0).append("\n");
24+
else
25+
builder.append(queue.poll().value).append("\n");
26+
}else{
27+
queue.offer(new Node(x));
28+
}
29+
}
30+
System.out.println(builder.toString());
31+
}
32+
33+
}
34+
class Node implements Comparable<Node>{
35+
int value;
36+
int absoluteValue;
37+
38+
public Node(int value){
39+
this.value=value;
40+
this.absoluteValue=Math.abs(value);
41+
}
42+
43+
@Override
44+
public int compareTo(Node n){
45+
if(this.absoluteValue == n.absoluteValue){
46+
return this.value > n.value ? 1 : -1;
47+
}
48+
return this.absoluteValue > n.absoluteValue ? 1 : -1;
49+
}
50+
}

‎src/Backjun_1715/Main.java‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
package Backjun_1715;
2+
3+
import java.util.PriorityQueue;
4+
import java.util.Scanner;
5+
6+
public class Main {
7+
8+
public static void main(String[] args) {
9+
// TODO Auto-generated method stub
10+
Scanner input = new Scanner(System.in);
11+
12+
int size = input.nextInt();
13+
14+
PriorityQueue<Integer> minQueue = new PriorityQueue<Integer>();
15+
16+
int x;
17+
18+
for(int i=0; i<size; i++){
19+
x=input.nextInt();
20+
minQueue.offer(x);
21+
}
22+
23+
24+
int result = 0 ;
25+
int temp1=0;
26+
int temp2 =0;
27+
28+
while(minQueue.size()>1){
29+
temp1 = minQueue.poll();
30+
temp2 = minQueue.poll();
31+
result= result + temp1+temp2;
32+
minQueue.offer(temp1+temp2);
33+
}
34+
35+
System.out.println(result);
36+
}
37+
}

‎src/codingdojang_18/Main.java‎

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
package codingdojang_18;
2+
3+
import java.util.HashMap;
4+
import java.util.Iterator;
5+
import java.util.Scanner;
6+
7+
public class Main {
8+
9+
public static void main(String[] args) {
10+
// TODO Auto-generated method stub
11+
Scanner input = new Scanner(System.in);
12+
13+
int x = input.nextInt();
14+
StringBuilder builder = new StringBuilder();
15+
16+
for(int i=1; i<=x; i++){
17+
builder.append(Integer.toString(i));
18+
}
19+
20+
char[] arr = builder.toString().toCharArray();
21+
22+
HashMap<Character,Integer> map = new HashMap<Character,Integer>();
23+
24+
for(int i=0; i<arr.length; i++){
25+
if(!map.containsKey(arr[i]))
26+
map.put(arr[i], 1);
27+
else{
28+
int key = arr[i];
29+
int value = map.get(arr[i]).intValue();
30+
map.remove(arr[i]);
31+
map.put((char) key, value+1);
32+
}
33+
}
34+
35+
Iterator<Character> list = map.keySet().iterator();
36+
37+
while(list.hasNext()){
38+
char key= list.next();
39+
System.out.println(key + " : " + map.get(key));
40+
}
41+
}
42+
43+
}

‎src/codingdojang_7/Main.java‎

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
package codingdojang_7;
2+
3+
public class Main {
4+
5+
public static void main(String[] args) {
6+
// TODO Auto-generated method stub
7+
int result=0;
8+
9+
for(int i=10; i<=1000; i++){
10+
String temp = Integer.toString(i);
11+
char[] tmp = temp.toCharArray();
12+
int multiple=1;
13+
for(int j=0; j<tmp.length; j++)
14+
multiple*=tmp[j]-48;
15+
result+=multiple;
16+
}
17+
18+
System.out.println(result);
19+
}
20+
21+
}

‎src/codingdojang_98/Main.java‎

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
package codingdojang_98;
2+
3+
import java.util.ArrayList;
4+
import java.util.List;
5+
import java.util.Scanner;
6+
7+
public class Main {
8+
9+
public static void main(String[] args) {
10+
// TODO Auto-generated method stub
11+
Scanner input = new Scanner(System.in);
12+
13+
int x = input.nextInt();
14+
15+
for(int i=1; i<=x; i++){
16+
Integer result = solve(i);
17+
if(result!=null)
18+
System.out.println(result);
19+
}
20+
}
21+
22+
public static Integer solve(int x){
23+
List<Integer> temp = new ArrayList<Integer>();
24+
for(int i=1; i<x; i++){
25+
if(x%i==0)
26+
temp.add(i);
27+
}
28+
29+
int result = 0;
30+
31+
for(int i=0; i<temp.size(); i++){
32+
result+=temp.get(i).intValue();
33+
}
34+
if(result==x)
35+
return result;
36+
else
37+
return null;
38+
}
39+
}

0 commit comments

Comments
 (0)