@AMY_KANG

#include <iostream> using namespace std; int main() { int n; cin >> n; for(int i = 0; i < n; i++){ for(int j = 1; j <= i; j++){ cout<<" "; }

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int a, b; cin >> a >> b; vector<int> c(a);

#include <iostream> using namespace std; int main(){ int n, a, b; cin >> n; for(int i = 1; i <= n; i++) { cin>>a>>b; cout << "Case " << i << ": " << a + b <<"\n"; }

#include <iostream> using namespace std; int main(){ int n; cin >> n; int a = n; for(int i = 1; i <= n; i++){ for(int j = 1; j <= a; j++){ cout<<" ";

#include<iostream> using namespace std; int main(){ int n, k; while(cin >> n >> k){ int t = n; int coupon = n; while(coupon >= k){ int newchicken = coupon / k; t += newchicken;

import sys input = sys.stdin.readline N = int(input()) budgets = list(map(int, input(), split())) M = int(input()) if sum(budgets) <= M: print (max(budgets)) exit()

import sys input = sys.stdin.readline N,M = map(int, input().split()) S = set() for _ in range(N): S.add(input().strip())

data = [28,3,9,14,7,42,21,36] target = 3 data.sort() def binary(data,target): left = 0 right = len(data)-1 while left<=right: mid = (left+right)//2 if data[mid] == target:

#include <iostream> #include <string> using namespace std; int main() { long long n = 1; int a = 0; int d, e; cin >> d >> e;

for i in range(1, 101): result = 2 ** i print(result)

#include <iostream> using namespace std; void is_prime(int num){ int n=0; if(num<2){ return;} for(int i = 1;i<=num;i++){ if(num%i==0){ n=n+1;}} if(n==2){

#include <iostream> using namespace std; void sol(){ int arr[7] = {4, 5, 6, 1, 2, 4, 3}; int cnt = 1; int big = arr[6]; for (int i = 5;i >= 0; i--){ if (big < arr[i]) { big = arr[i]; cnt += 1;

#include <iostream> using namespace std; int main() { int arr[7] = {41, 23, 53, 3, 10, 14, 99}; int n = arr[1]; if(arr[2]>=n){ n = arr[2]; } if(arr[3]>=n){ n = arr[3];

#include <iostream> using namespace std; int check_prime(int num){ int cnt = 0; for(int i = 1;i<= num ;i++ ){ if (num % i == 0){ cnt++;

#include <iostream> using namespace std; void check_prime(int num){ cout << num<<" 약수 : "; int cnt = 0; for(int i = 1;i<= num ;i++ ){ if (num % i == 0){ cout <<i<<" ";

#include <iostream> using namespace std; void find_big(){ int arr[7] = {55, 43, 12, 4, 10, 14, 41}; int big = arr[0]; for (int i = 0; i<7; i++){ if (big<arr[i]){ big = arr[i]; }

#include <iostream> using namespace std; void find_min(){ int datas[12] = {100, 70, 94, 66, 45, 67, 97, 96, 80, 78, 89, 79}; int small = datas[0]; // for (int i = 0;i<12 ;i++ ) { // if (datas[i]<small) { // small

#include <iostream> using namespace std; int main() { int number[10] = {34, 78, 12, 90, 23, 67, 45, 89, 11, 56}; // cout<<"홀수 인덱스 요소: "; // for (int i = 0; i<=10; i++) { // if (number[i] % 2 == 1) { // cout<<number[i]

#include <iostream> using namespace std; void ant_move(int time){ int size = 10; int ant_x = 4; int ant_y = 3; int dx = 1;//변화량 int dy = 1;//변화량 for(int i = 0 ; i<time; i++){ ant_x = ant_x+dx;

#include <iostream> using namespace std; void colatz(int n){ int new_n = 0; while(1){ new_n = new_n*10+n%10; n = n/10;