top of page
게시판 게시물
starkim922
2024년 10월 30일
In 소스 코드 제출
1535
import java.util.*;
public class Main{
static int n;
static int[] d;
static int f()
{
int x=0;
for(int i=0; i<n; i++)
{
if(d[i]>d[x])
{
x=i;
}
}
return x+1;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
d = new int[n];
for(int i=0; i<n; i++)
{
d[i]=sc.nextInt();
}
System.out.print(f());
}
}
포기 포기 못해못해
import java.util.*;
public class Main{
static long n;
static void f()
{
// n이 소수인지? -> 1과 자기자신 이외에는약수가 없다
// -> 약수가 2개뿐이다
//or 2 ~ n-1 중에서 약수가 하나라도 나오면? 소수가 아니다!
for(int i=2; i<n; i++)
{
if(n%i==0)
{
System.out.print("composite");
}
}
System.out.print("prime");
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n=sc.nextInt();
f();
}
}
*/
import java.util.*;
public class Main{
static long n;
static long []arr;
static long f(long n)
{
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
static int []arr = new int [10000000];
System.out.print(f(n));
}
}
0
0
2
starkim922
2024년 10월 26일
In 소스 코드 제출
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int [50][50];
int []warr = new int [101];
int i = 1;
int j = 1;
for( i=1; i<=10; i++)
{
for( j=1; j<=10; j++)
{
arr[i][j]=sc.nextInt();
}
}
int z = 0;
int a = 0;
for( i=1; i<=10; i++)
{
for( j=1; j<=10; j++)
{
if(arr[i][j]>=1)
{
if(arr[i+1][j] != -1 && arr[i][j+1]!= -1 && arr[i-1][j]!=-1 && arr[i][j-1]!=-1)
{
z=i;
a=j;
}
if(arr[i][j]==arr[z][a])
{
arr[i][j]=-2;
}
//장벽자리(모르겠다다다ㅏ)
}
}
}
for(i=1; i<=10; i++)
{
for(j=1; j<=10; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
System.out.println("Character Information");
int n = sc.nextInt();
for(i=1; i<=n; i++)
{
int x = sc.nextInt();
int y = sc.nextInt();
// System.out.println(x+" "+y);
if(arr[x][y]==-1)
{
System.out.println("player "+i+" dead");
}
else if(arr[x][y]==0)
{
System.out.println("player "+i+" survive");
}
}
}
}
*/
/*
import java.util.*;
public class Main{
// static void f(int x) {
// System.out.println("당신이 입력하신 숫자는 "+x+"입니다.");
// }
// static int mysum(int a, int b) {
// return a+b;
// }
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(mysum(a,b));
//f(a);
}
}
1530 ead A;
import java.util.*;
public class Main{
static char f()
{
return 'A';
}
public static void main(String[] args) {
System.out.println(f());
}
}
1537
import java.util.*;
public class Main{
static void f(int x){
if(x==1)
{
System.out.print("hello");
}
else if(x==2)
{
System.out.print("world");
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
f(x);
}
}
????????
import java.util.*;
public class Main{
static int f(int x)
{
int[] arr = new int [10000000000000000000000];
for(int i=1; i<=x; i++)
{
z=z+i;
}
return z;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
System.out.print(f(x));
}
}
1557
import java.util.*;
public class Main{
static int f(int x)
{
int a=0;
for(int i=1; i<=1000; i++)
{
if(x%i==0)
{
a++;
}
}
return a;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int x =sc.nextInt();
f(x);
System.out.print(f(x));
}
}
1580
import java.util.*;
public class Main{
static float f(int r)
{
float x = (float) (3.14*r*r);
return x;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int r = sc.nextInt();
f(r);
System.out.printf("%.2f",f(r));
}
}
1555 뭐였지????
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n =sc.nextInt();
System.out.print(f(n));
}
static long f(int n){
{
long a = 0;
for(int i=1; i<=n; i++)
{
a=a+i;
}
return a;
}
}
}
*/
import java.util.*;
public class Main{
int []arr = new int [111];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i=0; i<n; i++)
{
arr[i]=sc.nextInt();
System.out.print(f(n));
}
}
static int f(int n)
{
int x=0;
for(int i=0; i<n; i++)
{
if(x<i)
{
x=i;
}
}
return x;
}
}
0
0
4
starkim922
2024년 10월 23일
In 소스 코드 제출
/*
1045
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(a+b);
System.out.println(a-b);
System.out.println(a*b);
System.out.println(a/b);
System.out.println(a%b);
System.out.printf("%.2f",(float)a/b);
}
}
1046
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();
System.out.println(a+b+c);
System.out.printf("%.1f",(float)(a+b+c)/3);
}
}
1111
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
System.out.print(a);
System.out.println("%");
}
}
1116
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();
System.out.println(a+"+"+b+"="+(a+b));
System.out.println(a+"-"+b+"="+(a-b));
System.out.println(a+"*"+b+"="+(a*b));
System.out.println(a+"/"+b+"="+(a/b));
}
}
1117
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a = sc.nextFloat();
float b = sc.nextFloat();
System.out.printf("%.2f",a*b);
}
}
1122
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
System.out.print(a/60+" ");
System.out.println(a%60);
}
}
1155
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(a%7==0)
{
System.out.println("multiple");
}
else
{
System.out.println("not multiple");
}
}
}
1157
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a = sc.nextFloat();
if(50<=a && a<=60)
{
System.out.println("win");
}
else
{
System.out.println("lose");
}
}
}
1159
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(50<=a && a<=70 || a%6==0)
{
System.out.println("win");
}
else
{
System.out.println("lose");
}
}
}
1166
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(a%400==0 || a%4==0 && a%100!=0)
{
System.out.println("Leap");
}
else
{
System.out.println("Normal");
}
}
}
1-Tid 0반전
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 = (b-30)/60;
if(b-30<=-1)
{
System.out.print(a-c+" ");
System.out.print(60-(b-30));
if(a<=-1)
{
System.out.print(a+23+" ");
System.out.println(60-(b-30));
}
}
}
}
배siuuuuuuuuuuuuuuuuuuuuuuuuu1206
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 = b/a;
if(a*c!=b)
{
System.out.println("none");
}
else
{
System.out.println(a+"*"+c+"="+b);
}
}
}
1214
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();
if(b!=2)
{
if(b%2==0 || b==1)
{
System.out.print("31");
}
else
{
System.out.println("30");
}
}
else
{
if(a%400==0 || a%4==0 && a%100!=0)
{
System.out.println("29");
}
else
{
System.out.println("28");
}
}
}
}
1173
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();
if(b<30)
{
if(a<1 && b<=30)
{
a=23;
b=b+30;
}
else
{
a=a-1;
b=b+30;
}
}
else
{
b=b-30;
}
System.out.print(a+" "+b);
}
}
1차원배열
2차원배열
문자열
함수
---------
클래스
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
//int arr[10]={}; (x)
int[] arr = new int[a]; //변수 갯수로 선언 가능, 자동 0 초기화
for(int i=0;i<arr.length;i++) {
System.out.println(arr[i]);
}
}
}
전에 하다가 만 정체를 알 수 없는 소스
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int a = sc.nextInt();
int[] arr = new int[a];
for(int i=1; i<=a; i++) {
arr[i] = sc.nextInt();
}
for(int i=a; i>=1; i--){
System.out.print(arr[i]+" ");
}
}
}
1462 기초문제 1시간푸는 나
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int n = 1;
int [][] arr = new int[a][a];
for(int j=0; j<a; j++)
{
for(int i=0; i<a; i++)
{
arr[i][j]=n;
n++;
}
}
for(int i=0; i<a; i++) {
for(int j=0; j<arr.length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
1464 기초문제
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int n1 = sc.nextInt();
int sum = 1;
int [][]arr = new int[n][n1];
for(int i=n-1; i>=0; i--)
{
for(int j=n1-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n1; j++)
{
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
1466 -
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int n1 = sc.nextInt();
int sum = 1;
int [][]arr = new int[n][n1];
for(int j=n1-1; j>=0; j--)
{
for(int i=n-1; i>=0; i--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n1; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
1468
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int sum2 = 1;
int [][]arr = new int[n][n];
int [][]arr2 = new int[n][n];
for(int i=0; i<n; i++)
{
for(int j=n-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
arr2[i][j] = sum2;
sum2++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(i%2!=0 && i!=0 || i==1)
{
System.out.print(arr[i][j]+" ");
}
else
{
System.out.print(arr2[i][j]+" ");
}
}
System.out.println();
}
}
}
1468
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int sum2 = 1;
int [][]arr = new int[n][n];
int [][]arr2 = new int[n][n];
for(int i=0; i<n; i++)
{
for(int j=n-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
arr2[i][j] = sum2;
sum2++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(i%2!=0 && i!=0 || i==1)
{
System.out.print(arr[i][j]+" ");
}
else
{
System.out.print(arr2[i][j]+" ");
}
}
System.out.println();
}
}
}
무엇을 풀었는지 알 수 없는 문제
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int [][]arr = new int[a][a];
for(int j=n-1; j>=0; j--)
{
for(int i=0; i<n; i++)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++ )
{
for(int j=0; j<n; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
1099 성실한 ㄱ ㅏㅣㅁ ㅣ
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int [50][50];
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
arr[i][j]=sc.nextInt();
}
}
int i=2;
int j=2;
for(;;)
{
if(arr[i][j] == 2)
{
arr[i][j]=9;
break;
}
if(arr[i][j+1] != 1)
{
arr[i][j++]=9;
}
else if(arr[i+1][j] != 1)
{
arr[i++][j]=9;
}
else
{
arr[i][j]=9;
break;
}
}
for(i=1; i<=10; i++)
{
for(j=1; j<=10; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
아케이드
import java.util.*;
public class Main{
public static void main(String[] args) {
for(;;)
{
System.out.print("crazy 아케이드");
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int [50][50];
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
arr[i][j]=sc.nextInt();
}
}
int n = sc.nextInt();
int [][]xy = new int [n+1][n+1];
int i = 1;
int j= 1;
for(i=1; i<=10; i++)
{
for(j=1; j<=10; j++)
{
if(arr[i][j]>=1)
{
if(arr[i+1][j] != -1 && arr[i][j+1]!= -1 && arr[i-1][j]!=-1 && arr[i][j-1]!=-1)
{
arr[i][j]=-2;
arr[i++][j]=-2;
arr[i][j++]=-2;
arr[i--][j]=-2;
arr[i][j--]=-2;
}
}
}
}
for(i=1; i<=10; i++)
{
for(j=1; j<=10; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
System.out.println("Character Information");
for( i=1; i<=n; i++)
{
int x = sc.nextInt();
int y = sc.nextInt();
if(arr[x][y]==-1)
{
System.out.println("player "+i+" dead");
}
else if(arr[x][y]==0)
{
System.out.println("player "+i+" survive");
}
}
}
}
*/
0
0
5
starkim922
2024년 10월 19일
In 소스 코드 제출
1524 지뢰를 찾아라
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int z = 0;
int [][] arr = new int[50][50];
for(int i = 1; i<=9; i++)
{
for(int j=1; j<=9; j++)
{
arr[i][j]=sc.nextInt();
}
}
int x = sc.nextInt();
int y = sc.nextInt();
if(arr[x][y]!=1)
{
for(int i=x-1; i<=x+1; i++)
{
for(int j=y-1; j<=y+1; j++)
{
//System.out.println("i : "+i+" j : "+j);
if(arr[i][j] == 1)
{
z++;
}
}
}
System.out.print(z);
}
else
{
System.out.print("-1");
}
}
}
CRAGY 아케이드
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][] arr = new int [12][12];
int [][] arr2 = new int [65][65];
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
arr[i][j]=sc.nextInt();
}
}
int n = sc.nextInt();
for(int i=1; i<=n; i++)
{
for(int j=1; j<=2; j++)
{
arr2[i][j]=sc.nextInt();
}
}
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
if(arr[i][j]==)
}
}
}
}
1098 갑자기 잘풀리는 설탕이
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int [][] arr = new int [h+1][w+1];
int n = sc.nextInt();
for(int i=0; i<n; i++)
{
int l = sc.nextInt();
int d = sc.nextInt();
int y = sc.nextInt();
int x = sc.nextInt();
for(int j=0; j<l; j++)
{
if(d==0)
{
arr[y][x++]=1;
}
else
{
arr[y++][x]=1;
}
}
}
for(int i=1; i<=h; i++)
{
for(int j=1; j<=w; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int [12][12];
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
arr[i][j]=sc.nextInt();
}
}
int i=2;
int j=2;
for(;;)
{
if(arr[i][j] == 2)
{
arr[i][j]=9;
break;
}
if(arr[i][j+1]==1 && arr[i+1][j]==1)
{
arr[i][j]=9;
break;
}
if(arr[i][j+1]==0 && arr[i][j+1]==2)
{
arr[i][j++]=9;
}
else
{
arr[i++][j]=9;
}
}
for(i=1; i<=10; i++)
{
for(j=1; j<=10; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
0
0
4
starkim922
2024년 10월 16일
In 소스 코드 제출
/*1295 컴퓨터의 고장
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++){
if('A'<=str.charAt(i) && str.charAt(i)<='Z') {
System.out.print((char)(str.charAt(i)+32));
}
else if('a'<=str.charAt(i) && str.charAt(i)<='z') {
System.out.print((char)(str.charAt(i)-32));
}
else{
System.out.print(str.charAt(i));
}
}
}
}
1408 암호를 처리하여라이
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++)
{
System.out.print((char)(str.charAt(i)+2));
}
System.out.print("\n");
for(int i=0; i<str.length(); i++)
{
System.out.print((char)((str.charAt(i)*7)%80+48));
}
}
}
1733 6번의 고난 IOI
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
int x=0;
//if(str=="IOI") (X)
if(str.equals("IOI")) {
System.out.print("IOI is the International Olympiad in Informatics.");
}
else
{
System.out.print("I don't care.");
}
}
}
*/
/**
* * import java.util.*;
*public class Main{
* 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++) {
arr[i] = new int[i+1];
}
for(int i=0;i<10;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
//String str = sc.nextLine();
}
}
*
*
*
*
*
*
*
*
*
*
*/ /*
1098 완전 어렵네용ㅇ용요
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w = sc.nextInt();
int h = sc.nextInt();
int n = sc.nextInt();
for(int i=0; i<w; i++)
{
for(int j=0; j<h; j++)
{
int[][] arr = new int[i][j];
}
}
for(int i=0; i<n; i++)
{
int l = sc.nextInt();
int d = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
for(int j=0; j<l; j++)
{
arr[x][y]=1;
if(d==0)
{
arr[x][y+1]=1;
y++;
}
else
{
arr[x+1][y]=1;
x++;
}
}
}
for(int i=0; i<w; i++)
{
for(int j=0; j<h; j++)
{
System.out.print(arr[i][j]);
}
System.out.println();
}
}
}
1460 연산문제 1
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = 1;
int[][] arr = new int[n][n];
for(int i=0; i<arr.length; i++)
{
arr[i] = new int[i+1];
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
System.out.print(x++ +" ");
}
System.out.println();
}
}
??? 진격후 결과
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int[12][11];
int x = 0;
int z = 0;
for(int i=1; i<=11; i++)
{
for(int j=1; j<=10; j++)
{
arr[i][j] = sc.nextInt();
}
}
for(int j=1; j<=10; j++)
{
z++;
if(arr[11][j]==1)
{
//System.out.print(arr[11][j]+"*");
// j번째 말 출발
for(int i=10; i>=1; i--)
{
if(arr[i][j]>0)
{
System.out.println(z + " crash");
x=0;
break ;
}
else if(arr[i][j]<0)
{
System.out.println(z + " fall");
x=0;
break ;
}
else if(arr[i][j]==0)
{
x++;
if(x==10)
{
System.out.println(z + " safe");
x=0;
break ;
}
}
}
// j번째 말 끝
}
}
}
}/*
1508 나는 IQ 150이 아니다.
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = 0;
int [][]arr = new int[n+1][n+1];
for(int j = 1 ; j<=n; j++)
{
arr[j][1] = sc.nextInt();
}
for(int i=2; i<=n; i++)
{
for(int j=2; j<=i; j++)
{
arr[i][j] = arr[i][j-1]-arr[i-1][j-1];
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<i+1; j++)
{
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int z = 0;
int [][] arr = new int[50][50];
for(int i = 1; i<=9; i++)
{
for(int j=1; j<=9; j++)
{
arr[i][j]=sc.nextInt();
}
}
int x = sc.nextInt();
int y = sc.nextInt();
for(int i=x-1; i<=x+1; i++)
{
for(int j=y-1; j<=y+1; j++)
{
//System.out.println("i : "+i+" j : "+j);
if(arr[i][j] == 1)
{
z++;
}
}
}
System.out.print(z);
}
}
0
0
5
starkim922
2024년 10월 12일
In 소스 코드 제출
1470
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int sum2 = 1;
int [][]arr = new int[n][n];
int [][]arr2 = new int[n][n];
for(int j=0; j<n; j++)
{
for(int i=0; i<n; i++)
{
arr[i][j] = sum;
sum++;
}
}
for(int j=0; j<n; j++)
{
for(int i=n-1; i>=0; i--)
{
arr2[i][j] = sum2;
sum2++;
}
}
for(int i=0; i<n; i++ )
{
for(int j=0; j<n; j++)
{
if(j%2!=0 && j!=0 || j==1)
{
System.out.print(arr2[i][j]+" ");
}
else
{
System.out.print(arr[i][j]+" ");
}
}
System.out.println();
}
}
}
나느 IQ150이 아니여서 이문제를 더이상 못푼다
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = 0;
int [][]arr = new int[n][n];
for(int i= 0 ; i<arr.length; i++)
{
arr[i] = new int[i+1];
}
for(int i=0; i<n; i++)
{
for(int j=1; j<i; j++)
{
arr[i][j] = arr[i][j-1]-arr[i-1][j-1];
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<i+1; j++)
{
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int [][]arr = new int[10][10];
int x = 0;
for(int i=0; i<arr.length; i++)
{
arr[i]=new int[i+1];
}
for(int i=1; i<=11; i++)
{
for(int j=1; j<=11; j++)
{
if(arr[11][j]==1)
{
if(arr[i][j]>0)
{
System.out.print("crash");
}
else if(arr[i][j]<0)
{
System.out.print("fall");
}
else if(arr[i][j]==0)
{
x++;
if(x==10)
{
System.out.print("safe");
}
}
}
}
}
}
}
0
0
4
starkim922
2024년 10월 09일
In 소스 코드 제출
1462 기초문제 1시간푸는 나
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int n = 1;
int [][] arr = new int[a][a];
for(int j=0; j<a; j++)
{
for(int i=0; i<a; i++)
{
arr[i][j]=n;
n++;
}
}
for(int i=0; i<a; i++) {
for(int j=0; j<arr.length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
1464 기초문제
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int n1 = sc.nextInt();
int sum = 1;
int [][]arr = new int[n][n1];
for(int i=n-1; i>=0; i--)
{
for(int j=n1-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n1; j++)
{
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
1466 -
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int n1 = sc.nextInt();
int sum = 1;
int [][]arr = new int[n][n1];
for(int j=n1-1; j>=0; j--)
{
for(int i=n-1; i>=0; i--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n1; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
1468
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int sum2 = 1;
int [][]arr = new int[n][n];
int [][]arr2 = new int[n][n];
for(int i=0; i<n; i++)
{
for(int j=n-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
arr2[i][j] = sum2;
sum2++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(i%2!=0 && i!=0 || i==1)
{
System.out.print(arr[i][j]+" ");
}
else
{
System.out.print(arr2[i][j]+" ");
}
}
System.out.println();
}
}
}
1468
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int sum2 = 1;
int [][]arr = new int[n][n];
int [][]arr2 = new int[n][n];
for(int i=0; i<n; i++)
{
for(int j=n-1; j>=0; j--)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
arr2[i][j] = sum2;
sum2++;
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(i%2!=0 && i!=0 || i==1)
{
System.out.print(arr[i][j]+" ");
}
else
{
System.out.print(arr2[i][j]+" ");
}
}
System.out.println();
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 1;
int [][]arr = new int[a][a];
for(int j=n-1; j>=0; j--)
{
for(int i=0; i<n; i++)
{
arr[i][j] = sum;
sum++;
}
}
for(int i=0; i<n; i++ )
{
for(int j=0; j<n; j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
0
0
8
starkim922
2024년 10월 05일
In 소스 코드 제출
/*1295 컴퓨터의 고장
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++){
if('A'<=str.charAt(i) && str.charAt(i)<='Z') {
System.out.print((char)(str.charAt(i)+32));
}
else if('a'<=str.charAt(i) && str.charAt(i)<='z') {
System.out.print((char)(str.charAt(i)-32));
}
else{
System.out.print(str.charAt(i));
}
}
}
}
1408 암호를 처리하여라이
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++)
{
System.out.print((char)(str.charAt(i)+2));
}
System.out.print("\n");
for(int i=0; i<str.length(); i++)
{
System.out.print((char)((str.charAt(i)*7)%80+48));
}
}
}
1733 6번의 고난 IOI
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
int x=0;
//if(str=="IOI") (X)
if(str.equals("IOI")) {
System.out.print("IOI is the International Olympiad in Informatics.");
}
else
{
System.out.print("I don't care.");
}
}
}
*/
/**
* * import java.util.*;
*public class Main{
* 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++) {
arr[i] = new int[i+1];
}
for(int i=0;i<10;i++) {
for(int j=0;j<arr[i].length;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
//String str = sc.nextLine();
}
}
*
*
*
*
*
*
*
*
*
*
*/ /*
1098 완전 어렵네용ㅇ용요
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w = sc.nextInt();
int h = sc.nextInt();
int n = sc.nextInt();
for(int i=0; i<w; i++)
{
for(int j=0; j<h; j++)
{
int[][] arr = new int[i][j];
}
}
for(int i=0; i<n; i++)
{
int l = sc.nextInt();
int d = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
for(int j=0; j<l; j++)
{
arr[x][y]=1;
if(d==0)
{
arr[x][y+1]=1;
y++;
}
else
{
arr[x+1][y]=1;
x++;
}
}
}
for(int i=0; i<w; i++)
{
for(int j=0; j<h; j++)
{
System.out.print(arr[i][j]);
}
System.out.println();
}
}
}
1460 연산문제 1
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = 1;
int[][] arr = new int[n][n];
for(int i=0; i<arr.length; i++)
{
arr[i] = new int[i+1];
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
System.out.print(x++ +" ");
}
System.out.println();
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
}
}
0
0
9
starkim922
2024년 10월 02일
In 소스 코드 제출
/*1402 일차원배열의 거꾸로
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] arr=new int[a];
for(int i=0; i<=a-1; i++)
{
arr[i] = sc.nextInt();
}
for(int i=a-1; i>=0; i--)
{
System.out.print(arr[i]+" ");
}
}
}
<arr[0] arr[1] arr[2] ... .arr[i-1]><arr[i] ... arr[a-1]>
1405
import java.util.*;//import는 왜 그러는건데ㅔㅔ c
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int [] arr = new int[a];
for(int i=0; i<=a-1; i++)
{
arr[i] = sc.nextInt();
}
for(int i=0; i<=a-1; i++)
{
for(int j=i; j<=a-1; j++)
{
System.out.print(arr[j]+" ");
}
for(int j=0; j<=i-1; j++)
{
System.out.print(arr[j]+" ");
}
System.out.print("\n");
}
}
}
1024 기초 top 100 문제
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
for(int i=0; i < str.length(); i++)
{
System.out.print("\'" + str.charAt(i));
System.out.print("\'");
System.out.print("\n");
}
}
}
4771 예전에 못풀었던 그릇
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
String str = sc.nextLine();
int x = 0;
for(int i=1; i<str.length(); i++)
{
if(str.charAt(i)=='(' && str.charAt(i-1)== '(')
{
x=x+5;
}
else if(str.charAt(i)==')' && str.charAt(i-1)==')')
{
x=x+5;
}
else
{
x=x+10;
}
}
System.out.print(x+10);
}
}
*/
/*
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i =str.length()-1; i>=0; i--)
{
System.out.print(str.charAt(i));
}
}
}
1414 c언어를 찾으라구요?
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str =sc.nextLine();
int x = 0;
int y = 0;
for(int i=1; i<str.length(); i++)
{
if(str.charAt(i)=='C' || str.charAt(i)=='c')
{
x++;
}
if(str.charAt(i)=='C' && str.charAt(i-1)=='c')
{
y++;
}
else if(str.charAt(i)=='C' && str.charAt(i-1)=='C')
{
y++;
}
else if(str.charAt(i)=='c' && str.charAt(i-1)=='C')
{
y++;
}
else if(str.charAt(i)=='c' && str.charAt(i-1)=='c')
{
y++;
}
}
if(str.charAt(0)=='C'||str.charAt(0)=='c')
{
x++;
}
System.out.print(x+"\n");
System.out.print(y);
}
}
1660 피씨이씨리ㅣ리어ㅣ렁ㅁ니러
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++)
{
if(str.charAt(i)==',')
{
System.out.print(" ");
}
else
{
System.out.print(str.charAt(i));
}
}
}
}
1406 사랑
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
for(int i=0; i<str.length(); i++)
{
if(str.charAt(i)=='l')
{
if(str.charAt(i+1)=='o')
{
if(str.charAt(i+2)=='v')
{
if(str.charAt(i+3)=='e')
{
if(str.length()==4)
{
System.out.print("I love you.");
}
}
}
}
}
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<=str.length(); i++){
if('A'<=str.charAt(i) && (char)str.charAt(i)<='Z') {
System.out.print((char)(str.charAt(i)+32));
}
else if('a'<=str.charAt(i) && str.charAt(i)<='z') {
System.out.print((char)(str.charAt(i)-32));
}
else
{
System.out.print(str.charAt(i));
}
}
}
}
0
0
7
starkim922
2024년 9월 29일
In 소스 코드 제출
/*
public class Main {
}
1012
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float n = sc.nextFloat();
System.out.printf("%06f",n);
}
}
1013
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();
//System.out.print(a);
//System.out.print(b);
String str = sc.nextLine();
System.out.println(str);
}
}
1015
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a=sc.nextFloat();
System.out.printf("%.2f",a);
}
}
1017
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a=sc.nextInt();
System.out.print(a+" ");//띄어쓰기
System.out.print(a+" ");
System.out.print(a);
}
}
1018
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
System.out.println(str);
}
}
산술연산자
+ - * / %
1038
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
System.out.println(a+b);
}
}
1039
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
System.out.println(a+b);
}
}
104
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();
System.out.println(a/b);
}
}
?????
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();
System.out.println(a+b);
System.out.println(a-b);
System.out.println(a*b);
System.out.println(a/b);
System.out.println(a%b);
System.out.printf("%.3f",(float)a/b);
}
}
?????????????
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str1 = sc.next();
String str2 = sc.next();
String str3 = sc.next();
System.out.println(str1+str2+str3);
}
}
1734 게이미이이미밍
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
System.out.print("welcome! "+str);
}
}
2721 순환하는 문좌렬ㄹㄹㄹㄹ
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str1 = sc.next();
String str2 = sc.next();
String str3 = sc.next();
if(str1.charAt(str1.length()-1)==str2.charAt(0)
&& str2.charAt(str2.length()-1)==str3.charAt(0)
&& str3.charAt(str3.length()-1)==str1.charAt(0))
{
System.out.print("good");
}
else
{
System.out.print("bad");
}
}
}
1407 엄청난 에로ㅓ의 문죄에에네이제
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=0; i<str.length(); i++)
{
if(str.charAt(i)!=' ')
{
System.out.print(str.charAt(i));
}
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
for(int i=str.length(); i>=0; i--)
{
System.out.print(str.charAt(i));
}
}
}
0
0
9
starkim922
2024년 9월 25일
In 소스 코드 제출
/*
import java.util.*;
public class Main {
public static void main(String[] args) {
// 컴파일 ctrl + f11
//출력 : syso 컨트롤 스페이스
* 자동완성 : main +ctrl+스페이스 ;
}
}
c 함수 -> java 메소드
자바의 특징!
1. 객체지향언어이다.
2. 자동완성을 많이 쓴다 ( 코드가 길~어)
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello\nWorld");
System.out.print \n대신 ln("ha\\lll\'ooo\"ddddd");
}
}
1001
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello");
}
}
1002
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello World");
}
}
1003
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.println("Hello\nWorld");
}
}
1004
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.print("\'Hello\'");
}
}
1005
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"Hello World\"");
}
}
1006
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"!@#$%^&*()\"");
}
}
1008
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"C:\\Download\\hello.cpp\"");
}
}
1009 "자바는 이문제를 풀 수 없으니 넘어가 주세요^^"
java 자료형
int
long
float
double
String 문자열
char
boolean -> true or false
1010
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);// 단어 받기
// int n = sc.nextInt();
// System.out.println(n);
// System.out.printf("%02d",n); //두글자 n생성
//
long x = sc.nextLong(); //한단어
System.out.println(x);
// String str = sc.next(); // 한 단어
// System.out.println(str);
// String str = sc.nextLine(); // 한 문장
// System.out.println(str);
//
// float x = sc.nextFloat();
// System.out.println(x);
// System.out.printf("%.3f",x);
}
}
1440 비교교교교교굑교
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] arr = new int[a];
for(int i=0; i<=a-1; i++)
{
arr[i] = sc.nextInt();
}
for(int i=0; i<=a-1; i++)
{
System.out.print(i+1+": ");
for(int j=0; j<=a-1; j++)
{
if(i != j)
{
if(arr[i] > arr[j])
{
System.out.print(">"+" ");
}
else if(arr[i] < arr[j])
{
System.out.print("<"+" ");
}
else
{
System.out.print("="+" ");
}
}
}
System.out.print("\n");
}
}
}
1707 1o명의 점수 평규ㅠㅠㅠㄴ
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = 0;
int b = 0;
int c = 0;
int[] arr = new int[10];
for(int i=0; i<=9; i++)
{
arr[i] = sc.nextInt();
a=a+arr[i];
}
for(int i=0; i<10; i++)
{
if(a/10 <= arr[i])
{
b++;
}
else
{
c++;
}
}
System.out.printf("%.1f",(float)a/10);
System.out.print("\n");
System.out.print(b+" ");
System.out.println(c);
}
}
c언어와 다른점?? String 이라는 문자열을 저장하는 자료형이 따로 있다 ! 고 생각하기
import java.util.*;
public class Main{
public static void main(String[] args) {
//char[] str = "hello"; (x)
String str = "hello";
System.out.println(str);
System.out.println(str.length()); // strlen 과 같은 역할, 문자열의 길이 알아내기
for(int i=0;i<str.length();i++) {
System.out.println(str.charAt(i)); // string에서 str[i] 대신 str.charAt(i)
}
String strb = str;
//if(str==strb) { // (x)
if(str.equals(strb)) { // 같은 문자열인지???
System.out.println("same");
}
else {
System.out.println("diff");
}
//if(str==strb) // 같은 곳을 가리키고 있는지?
⠀⢠⣿⣶⣄⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣦⣄⣀⡀⣠⣾⡇⠀⠀⠀뀪ㄲㄲㄲ뀨뀨뀨
⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀뀨꾺꾸뀨꾺?
⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⢿⣿⣿⡇⠀⠀⠀⠀
⠀⣶⣿⣦⣜⣿⣿⣿⡟⠻⣿⣿⣿⣿⣿⣿⣿⡿⢿⡏⣴⣺⣦⣙⣿⣷⣄⠀⠀⠀
⠀⣯⡇⣻⣿⣿⣿⣿⣷⣾⣿⣬⣥⣭⣽⣿⣿⣧⣼⡇⣯⣇⣹⣿⣿⣿⣿⣧⠀⠀
⠀⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠸⣿⣿⣿⣿⣿⣿⣿⣷⠀
}
}
1132
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
System.out.print(str);
}
}
1133
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
System.out.println(str);
}
}
ㄹㅇ니;렁ㄴ미;런ㅁ이
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
for(int i=0; i<=10; i++)
{
if(str.charAt(i) == 't')
{
System.out.print(i+1+" ");
}
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str1 = sc.next();
String str2 = sc.next();
String str3 = sc.next();
for(int i=2; i==0; i++)
{
str
}
}
}
⠀ ⢠⣿⣶⣄⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣦⣄⣀⡀⣠⣾⡇⠀⠀⠀뀪ㄲㄲㄲ뀨뀨뀨
⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀뀨꾺꾸뀨꾺?
⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⢿⣿⣿⡇⠀⠀⠀⠀ 누궁?
⠀⣶⣿⣦⣜⣿⣿⣿⡟⠻⣿⣿⣿⣿⣿⣿⣿⡿⢿⡏⣴⣺⣦⣙⣿⣷⣄⠀⠀⠀
⠀⣯⡇⣻⣿⣿⣿⣿⣷⣾⣿⣬⣥⣭⣽⣿⣿⣧⣼⡇⣯⣇⣹⣿⣿⣿⣿⣧⠀⠀
⠀⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠸⣿⣿⣿⣿⣿⣿⣿⣷⠀
0
0
9
starkim922
2024년 9월 21일
In 소스 코드 제출
/*1402 일차원배열의 거꾸로
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] arr=new int[a];
for(int i=0; i<=a-1; i++)
{
arr[i] = sc.nextInt();
}
for(int i=a-1; i>=0; i--)
{
System.out.print(arr[i]+" ");
}
}
}
<arr[0] arr[1] arr[2] ... .arr[i-1]><arr[i] ... arr[a-1]>
1405
import java.util.*;//import는 왜 그러는건데ㅔㅔ c
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int [] arr = new int[a];
for(int i=0; i<=a-1; i++)
{
arr[i] = sc.nextInt();
}
for(int i=0; i<=a-1; i++)
{
for(int j=i; j<=a-1; j++)
{
System.out.print(arr[j]+" ");
}
for(int j=0; j<=i-1; j++)
{
System.out.print(arr[j]+" ");
}
System.out.print("\n");
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int n = 0;
int i;
int [] arr = new int [101];
for(i=1; ; i++)
{
arr[i] = a%2;
a=a/2;
if(a==0) {
break;
}
}
n = i;
for(i=n; i>=1; i--)
{
System.out.print(arr[i]);
}
}
}
0
0
4
starkim922
2024년 9월 11일
In 소스 코드 제출
/*
1045
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
System.out.println(a+b);
System.out.println(a-b);
System.out.println(a*b);
System.out.println(a/b);
System.out.println(a%b);
System.out.printf("%.2f",(float)a/b);
}
}
1046
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();
System.out.println(a+b+c);
System.out.printf("%.1f",(float)(a+b+c)/3);
}
}
1111
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
System.out.print(a);
System.out.println("%");
}
}
1116
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();
System.out.println(a+"+"+b+"="+(a+b));
System.out.println(a+"-"+b+"="+(a-b));
System.out.println(a+"*"+b+"="+(a*b));
System.out.println(a+"/"+b+"="+(a/b));
}
}
1117
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a = sc.nextFloat();
float b = sc.nextFloat();
System.out.printf("%.2f",a*b);
}
}
1122
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
System.out.print(a/60+" ");
System.out.println(a%60);
}
}
1155
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(a%7==0)
{
System.out.println("multiple");
}
else
{
System.out.println("not multiple");
}
}
}
1157
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a = sc.nextFloat();
if(50<=a && a<=60)
{
System.out.println("win");
}
else
{
System.out.println("lose");
}
}
}
1159
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(50<=a && a<=70 || a%6==0)
{
System.out.println("win");
}
else
{
System.out.println("lose");
}
}
}
1166
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if(a%400==0 || a%4==0 && a%100!=0)
{
System.out.println("Leap");
}
else
{
System.out.println("Normal");
}
}
}
1-Tid 0반전
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 = (b-30)/60;
if(b-30<=-1)
{
System.out.print(a-c+" ");
System.out.print(60-(b-30));
if(a<=-1)
{
System.out.print(a+23+" ");
System.out.println(60-(b-30));
}
}
}
}
배siuuuuuuuuuuuuuuuuuuuuuuuuu1206
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 = b/a;
if(a*c!=b)
{
System.out.println("none");
}
else
{
System.out.println(a+"*"+c+"="+b);
}
}
}
1214
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();
if(b!=2)
{
if(b%2==0 || b==1)
{
System.out.print("31");
}
else
{
System.out.println("30");
}
}
else
{
if(a%400==0 || a%4==0 && a%100!=0)
{
System.out.println("29");
}
else
{
System.out.println("28");
}
}
}
}
1173
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();
if(b<30)
{
if(a<1 && b<=30)
{
a=23;
b=b+30;
}
else
{
a=a-1;
b=b+30;
}
}
else
{
b=b-30;
}
System.out.print(a+" "+b);
}
}
1차원배열
2차원배열
문자열
함수
---------
클래스
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
//int arr[10]={}; (x)
int[] arr = new int[a]; //변수 갯수로 선언 가능, 자동 0 초기화
for(int i=0;i<arr.length;i++) {
System.out.println(arr[i]);
}
}
}
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int a = sc.nextInt();
int[] arr = new int[a];
for(int i=1; i<=a; i++) {
arr[i] = sc.nextInt();
}
for(int i=a; i>=1; i--){
System.out.print(arr[i]+" ");
}
}
}
0
0
6
starkim922
2024년 9월 07일
In 소스 코드 제출
/*
public class Main {
}
1012
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float n = sc.nextFloat();
System.out.printf("%06f",n);
}
}
1013
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();
//System.out.print(a);
//System.out.print(b);
String str = sc.nextLine();
System.out.println(str);
}
}
1015
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float a=sc.nextFloat();
System.out.printf("%.2f",a);
}
}
1017
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a=sc.nextInt();
System.out.print(a+" ");//띄어쓰기
System.out.print(a+" ");
System.out.print(a);
}
}
1018
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
System.out.println(str);
}
}
산술연산자
+ - * / %
1038
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
System.out.println(a+b);
}
}
1039
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
System.out.println(a+b);
}
}
104
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();
System.out.println(a/b);
}
}
*/
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();
System.out.println(a+b);
System.out.println(a-b);
System.out.println(a*b);
System.out.println(a/b);
System.out.println(a%b);
System.out.printf("%.3f"(float)a/b);
}
}
0
0
8
starkim922
2024년 9월 04일
In 소스 코드 제출
/*
import java.util.*;
public class Main {
public static void main(String[] args) {
// 컴파일 ctrl + f11
//출력 : syso 컨트롤 스페이스
* 자동완성 : main +ctrl+스페이스 ;
}
}
c 함수 -> java 메소드
자바의 특징!
1. 객체지향언어이다.
2. 자동완성을 많이 쓴다 ( 코드가 길~어)
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello\nWorld");
System.out.print \n대신 ln("ha\\lll\'ooo\"ddddd");
}
}
1001
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello");
}
}
1002
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.print("Hello World");
}
}
1003
import java.util.*;
public class Main {
public static void main(String[] args) {
System.out.println("Hello\nWorld");
}
}
1004
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.print("\'Hello\'");
}
}
1005
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"Hello World\"");
}
}
1006
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"!@#$%^&*()\"");
}
}
1008
import java.util.*;
public class Main{
public static void main(String[] args) {
System.out.println("\"C:\\Download\\hello.cpp\"");
}
}
1009 "자바는 이문제를 풀 수 없으니 넘어가 주세요^^"
java 자료형
int
long
float
double
String 문자열
char
boolean -> true or false
1010
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);// 단어 받기
// int n = sc.nextInt();
// System.out.println(n);
// System.out.printf("%02d",n); //두글자 n생성
//
long x = sc.nextLong(); //한단어
System.out.println(x);
// String str = sc.next(); // 한 단어
// System.out.println(str);
// String str = sc.nextLine(); // 한 문장
// System.out.println(str);
//
// float x = sc.nextFloat();
// System.out.println(x);
// System.out.printf("%.3f",x);
}
}1020
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
S
System.out.println(x);
}
}
0
0
18
starkim922
2024년 9월 04일
In 소스 코드 제출
/*
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
4421
#include <stdio.h>
int n,v=0,z,a=0,t,b=1,m,c=2;
int arr[101][100]={};
int queue[2][1000]={};
int s[100]={};
int front=-1;
int back=-1;
int danji[500]={};
int px, py;
void bfs(int x, int y)
{
push(x,y);
while(front != back)
{
pop();
if(arr[px][py+1]==1) push(px,py+1);
if(arr[px+1][py]==1) push(px+1,py);
if(arr[px][py-1]==1) push(px,py-1);
if(arr[px-1][py]==1) push(px-1,py);
}
}
void push(int x,int y)
{
arr[x][y]=0;
back++;
queue[0][back] = x;
queue[1][back] = y;
}
void pop()
{
if(front==back)
{
return ;
}
s[a]++;
front++;
px = queue[0][front];
py = queue[1][front];
}
int main()
{
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
scanf("%1d",&arr[i][j]);
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(arr[i][j]==1)
{
a++;
bfs(i,j);
}
}
}
printf("%d",a);
for(int i=1; i<a; i++)
{
for(int j=1; j<=a-i; j++)
{
if(s[j]>s[j+1])
{
t=s[j];
s[j]=s[j+1];
s[j+1]=t;
}
}
}
for(int i=1; i<=a; i++)
{
printf("\n%d",s[i]);
}
return 0;
}
*/
0
0
1
starkim922
2024년 8월 31일
In 소스 코드 제출
/*#ince <stdlib.h>
int ma
printf("Hllo world!\n"); return 0;
*/
/*
#include <stdio.h>
int arr[100][100]= {};
int queue[2][10000]= {};
int back = 0;
int front = 0;
int n, px, py;
int k=1;
void push( int x, int y )
{
queue[0][back] = x;
queue[1][back] = y;
arr[x][y]=k;
back++;
}
void bfs(int x, int y)
{
push(x,y);
while(front != back)
{
view();
k++;
int max=back-1;
for(int t = front; t<=max; t++)
{
px = queue[0][t];
py = queue[1][t];
if(py-1 >= 1 && arr[px][py-1] == 0 )
{
push(px,py-1);
}
if(py+1 <= n && arr[px][py+1] == 0)
{
push(px,py+1);
}
if(px-1 >= 1 && arr[px-1][py] == 0)
{
push(px-1,py);
}
if(px+1 <= n && arr[px+1][py] ==0)
{
push(px+1,py);
}
front++;
}
}
}
void view()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
printf("%d ",arr[i][j]);
}
printf("\n");
}
printf("\n");
}
int main()
{
int i, j;
scanf("%d",&n);
scanf("%d %d",&i,&j);
bfs(i,j);
view();
return 0;
}
1. 단지번호 bfs로 풀기.
2. 앞으로 뭐할지 생각해오기!!!
*/
0
0
4
starkim922
2024년 8월 28일
In 소스 코드 제출
/*
int main()
{
printf("Hello world!\n");
return 0;
}
ㅇㄴ*/
#include <stdio.h>
int arr[101][101]={};
int x,y,a=1;
int queue[2][101]={};
int front=-1;
int back=-1;
void bfs(int x,int y)
{
push(x,y);
arr[x][y]=0;
while(front != back)
{
pop();
if(arr[px][py+1]==1)
}
}
void push(int x,int y)
{
back++;
queue[0][back] = x;
queue[1][back] = y;
}
void pop()
{
if(front == back)
{
return ;
}
front++;
px = queue[0][front];
py = queue[1][front];
}
int main()
{
scanf("%d",&n);
scanf("%d %d",&x,&y);
arr[x][y]=a;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
}
}
}
#include <stdio.h>
int arr[1001][1001]={};
int queue[2][501]={};
int back = -1;
int front = -1;
int n,x,y,m=0,px,py,a=1,x1,x2;
void push( int x, int y ){
back++;
queue[0][back] = x;
queue[1][back] = y;
arr[x][y] = a++;
}
void bfs(int x, int y){
push(x,y);
while(front != back){
pop();
if(py-1>=1 && arr[px][py-1] == ' ' && arr[px][py]!=1) push(px,py-1);
if(py+1<=2*n-1 && arr[px][py+1] == ' ' && arr[px][py]!=1) push(px,py+1);
if(px-1>=1 && arr[px-1][py] == ' ' && arr[px][py]!=1) push(px-1,py);
if(px+1<=2*n-1 && arr[px+1][py] == ' ' && arr[px][py]!=1) push(px+1,py);
}
}
void pop( ){
if(front == back) return ;
front ++;
px = queue[0] [front];
py = queue[1][front];
}
int main(){
scanf("%d",&n);
scanf("%d %d",&x1,&x2);
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(arr[i][j]==arr[x1][x2]) arr[i][j]=1;
else arr[i][j] = ' ';
}
}
return 0;
}
0
0
4
starkim922
2024년 8월 24일
In 소스 코드 제출
/*
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
내 노력이 한번에 나락으로 갔다. 말도 안되는 심정이다.
수엄시간 5시간이 나라가던 날이었다.
#include <stdio.h>
char arr[1001][1001]={};
int queue[2][501]={};
int back = -1;
int front = -1;
int n,x,y,m=0,px,py;
void push( int x, int y ){
back++;
queue[0][back] = x;
queue[1][back] = y;
arr[x][y]='*';
}
void bfs(int x, int y){
push(x,y);
f();
while(front != back){
pop();
if(py-1>=1 && arr[px][py-1] == ' ' && arr[px][py] != '#') push(px,py-1);
if(py+1<=2*n-1 && arr[px][py+1] == ' ' && arr[px][py] != '#') push(px,py+1);
if(px-1>=1 && arr[px-1][py] == ' ' && arr[px][py] != '#') push(px-1,py);
if(px+1<=2*n-1 && arr[px+1][py] == ' ' && arr[px][py] != '#') push(px+1,py);
}
}
int f(int x, int y)
{
for(int i=n; i>=1; i--)
{
for(int j=1; j<=n-i;j++)
{
arr[px][py]=arr[i][j];
arr[i][j]='#';
}
}
for(int i=1; i<=n; i++)
{
for(int j=n+1; j>=i; j++)
{
arr[px][py]=arr[i][j];
arr[i][j]='#';
}
}
}
void pop( ){
if(front == back) return ;
front ++;
px = queue[0] [front];
py = queue[1][front];
}
int main(){
scanf("%d",&n);
for(int i=1; i<=n*2; i++){
for(int j=1; j<=n*2; j++){
arr[i][j] = ' ';
}
}
bfs(n,n);
for(int i=1; i<=n*2; i++){
for(int j=1; j<=n*2; j++){
if(arr[i][j]=='*') printf("*");
else printf(" ");
}
printf("\n");
}
return 0;
}
*/
#include <stdio.h>
int main()
{
}
0
0
6
starkim922
더보기
bottom of page