MOMONOTE

import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.IOException; import java.util.*; public class Main{ public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()," "); int N = Integer.parseInt(st.nextToken()); int M = Integer.parseInt(st.ne..

문제 자체는 간단하다. 로직은 맞지만 시간 초과가 발생한다. 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 V = sc.nextInt(); sc.close(); int days = 1; int sum = 0; if(A>=V){ System.out.println(1); } while(true){ sum = sum + A; if(sum>=V){ System.out.println(days); break; } sum = sum - B; days++; }//while()..

내가 짠 코드 import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int testCase = sc.nextInt(); // 6 12 4 - > 401 for(int i=1;i=N){ countH = N; break; }else{ countW = countW + N/4; countH = N%H; break; } }//while , while을 통해 몇층 몇호인지 구함. sb.append(countH); if(countW 401 for(int i=1;i

그냥 풀기 import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); int input = sc.nextInt(); int factorial =1; for(int i=1;i