CodeUp-1090
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int r = sc.nextInt();
int n = sc.nextInt();
long sum = a;
for(int i=1;i<n;i++)
sum*=r;
System.out.println(sum);
}
|
CodeUp-1091
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int m = sc.nextInt();
int d = sc.nextInt();
int n = sc.nextInt();
long sum = a;
for(int i=1;i<n;i++)
sum=sum*m+d;
System.out.println(sum);
}
|
CodeUp-1092
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//3 7 9
int[] a = new int[3];
for(int i=0;i<a.length;i++)
a[i]=sc.nextInt();
int lcm1=a[0];
for(int i=1;i<a.length;i++)
lcm1=lcm(lcm1, a[i]);
System.out.println(lcm1);
}
//최대 공약수 - 유클리드 호제법
// 두 수 중 작은값, 두 수를 나눈 나머지를 구한다.
// 작은값%나머지 반복하여 작은 값이 0이 될때까지 한다.
public static int gcb(int a, int b) {
int r;
if(a<b) {
int temp=a;
a=b;
b=temp;
}
while(b!=0) {
r=a%b;
a=b;
b=r;
}
return a;
}
//최소 공배수
// 두 수 a*b / 최소공배수 gcb
public static int lcm(int a, int b) {
return a*b/gcb(a, b);
}
|
CodeUp-1092(2)
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//3 7 9
int[] a = new int[3];
for(int i=0;i<a.length;i++)
a[i]=sc.nextInt();
int day=1;
while(day%a[0]!=0||day%a[1]!=0||day%a[2]!=0) day++;
System.out.println(day);
}
|
CodeUp-1093
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = sc.nextInt();
int[] a = new int[23];
for(int i=0;i<a.length;i++)
a[i]=0;
for(int i=0;i<// Count;i++)
a[sc.nextInt()-1]++;
for(int i=0;i<a.length;i++)
System.out.print(a[i]+" ");
// System.out.println(Arrays.toString(a));
}
|
CodeUp-1093(2)
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
int count = Integer.valueOf(br.readLine());
StringTokenizer s = new StringTokenizer(br.readLine()," ");
int[] a = new int[23];
for(int i=0;i<a.length;i++)
a[i]=0;
while(s.hasMoreTokens())
a[Integer.valueOf(s.nextToken())-1]++;
for(int i=0;i<a.length;i++)
bw.write(a[i]+" ");
bw.flush();
} catch (IOException e) {
e.printStackTrace();
}
}
|
CodeUp-1094
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
int count = Integer.valueOf(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine(), " ");
int[] a = new int[count];
int i=0;
while(st.hasMoreTokens()) {
a[i]=Integer.valueOf(st.nextToken());
i++;
}
for(int j=count-1;j>=0;j--)
bw.write(a[j]+" ");
bw.flush();
}catch(IOException e) {
e.printStackTrace();
}
}
|
CodeUp-1095
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count= sc.nextInt();
int min = 24;
for(int i=0;i<count;i++) {
int temp=sc.nextInt();
if(min>temp) min=temp;
}
System.out.println(min);
}
|
CodeUp-1096
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count= sc.nextInt();
int[][] arr = new int[19][19];
for(int i=0;i<count;i++) {
int x = sc.nextInt();
int y = sc.nextInt();
arr[x-1][y-1]=1;
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
|
CodeUp-1096(2)
public static void main(String[] args) {
BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
int[][] arr=new int[19][19];
int count = Integer.valueOf(bi.readLine());
for(int i=0;i<count;i++) {
String[] s = bi.readLine().split(" ");
arr[Integer.valueOf(s[0])-1][Integer.valueOf(s[1])-1]=1;
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr.length;j++) {
bw.write(arr[i][j]+" ");
}
bw.write("\n");
bw.flush();
}
} catch(IOException e) {
e.printStackTrace();
}
}
|
CodeUp-1097
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] arr = new int[19][19];
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
arr[i][j]=sc.nextInt();
}
}
int count=sc.nextInt();
for(int i=0;i<count;i++) {
int x=sc.nextInt()-1, y=sc.nextInt()-1;
for(int j=0;j<arr.length;j++) {
if(arr[x][j]==1) arr[x][j]=0;
else arr[x][j]=1;
if(arr[j][y]==1) arr[j][y]=0;
else arr[j][y]=1;
}
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
|
CodeUp-1097(2)
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
StringTokenizer s;
int[][] arr = new int[19][19];
for(int i=0;i<arr.length;i++) {
s = new StringTokenizer(br.readLine()," ");
for(int j=0;j<arr[i].length;j++) {
arr[i][j]=Integer.valueOf(s.nextToken());
}
}
int count=Integer.valueOf(br.readLine());
for(int i=0;i<count;i++) {
s = new StringTokenizer(br.readLine()," ");
int x=Integer.valueOf(s.nextToken())-1, y=Integer.valueOf(s.nextToken())-1;
for(int j=0;j<arr.length;j++) {
if(arr[x][j]==1) arr[x][j]=0;
else arr[x][j]=1;
if(arr[j][y]==1) arr[j][y]=0;
else arr[j][y]=1;
}
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
bw.write(arr[i][j]+" ");
}
bw.newLine();
}
bw.flush();
} catch(IOException e) {
e.printStackTrace();
}
}
|
CodeUp-1098
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] arr = new int[sc.nextInt()][sc.nextInt()];
int n = sc.nextInt(); //횟수
for(int i=0;i<n;i++) {
int l=sc.nextInt(); //길이
int d=sc.nextInt(); //방향
int x=sc.nextInt()-1, y=sc.nextInt()-1; //좌표
arr[x][y]=1;
for(int j=0;j<l-1;j++) {
if(d==0) arr[x][++y]=1;
else arr[++x][y]=1;
}
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
|
CodeUp-1099
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] arr=new int[10][10];
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
arr[i][j]=sc.nextInt();
}
}
int x=1,y=1;
while(arr[x][y]!=2) {
arr[x][y]=9;
if(arr[x][y+1]==0||arr[x][y+1]==2) y++;
else x++;
if(x==8&&y==8) break;
}
arr[x][y]=9;
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
|
CodeUp-1099(2)
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
int[][] arr=new int[10][10];
for(int i=0;i<arr.length;i++) {
StringTokenizer st = new StringTokenizer(br.readLine()," ");
for(int j=0;j<arr[i].length;j++) {
arr[i][j]=Integer.valueOf(st.nextToken());
}
}
int x=1,y=1;
while(arr[x][y]!=2) {
arr[x][y]=9;
if(arr[x][y+1]==0||arr[x][y+1]==2) y++;
else x++;
if(x==8&&y==8) break;
}
arr[x][y]=9;
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
bw.write(arr[i][j]+" ");
}
bw.newLine();
}
bw.flush();
} catch(IOException e) {
e.printStackTrace();
}
}
|
CodeUp-1099(3)
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
try {
int[][] arr=new int[10][10];
for(int i=0;i<arr.length;i++) {
StringTokenizer st = new StringTokenizer(br.readLine()," ");
for(int j=0;j<arr[i].length;j++) {
arr[i][j]=Integer.valueOf(st.nextToken());
}
}
int point=1;
boolean end = false;
for(int i=1;i<arr.length;i++) {
if(!end) {
for(int j=point;j<arr[i].length;j++) {
if(arr[i][j]==0) {
arr[i][j]=9;
}
else if(arr[i][j]==2) {
arr[i][j]=9;
end=true;
break;
} else {
point=j-1;
break;
}
}
}
}
for(int i=0;i<arr.length;i++) {
for(int j=0;j<arr[i].length;j++) {
bw.write(arr[i][j]+" ");
}
bw.newLine();
}
bw.flush();
} catch(IOException e) {
e.printStackTrace();
}
}
|
'문제풀이 > 코드업' 카테고리의 다른 글
[CodeUp] 1080 - 1089 문제 풀이(Java) (0) | 2021.03.14 |
---|---|
[CodeUp] 1070 - 1079 문제 풀이(Java) (0) | 2021.03.14 |
[CodeUp] 1060 - 1069 문제 풀이(Java) (0) | 2021.03.14 |
[CodeUp] 1050 - 1059 문제 풀이(Java) (0) | 2021.03.14 |
[CodeUp] 1040 - 1049 문제 풀이(Java) (0) | 2021.03.14 |