/*#include <stdio.h> #include <stdbool.h> #include <stdlib.h> long long solution(int w, int h) { long long answer = 0; for(int i=1; i<w; i++) { int a=(int)((double)h/w*i); printf("%d ", a); answer +=a; } return answer*2; } int main() { int a, b; scanf("%d %d", &a, &b); printf("%lld", solution(a, b)); } */ #include <stdio.h> #include <stdbool.h> #include <stdlib.h> // prices_len은 배열 prices의 길이입니다. int* solution(int prices[], int prices_len) { // return 값은 malloc 등 동적 할당을 사용해주세요. 할당 길이는 상황에 맞게 변경해주세요. int* answer = (int*)malloc(sizeof(int)*prices_len); for(int i=0; i<prices_len; i++) { int k=0; for(int j=1; j<prices_len-i; j++) { k+=1; if(prices[i]>prices[j]) { //answer[i]=k; break; } } answer[i]=k; } return answer; } int main() { int price[]= {1, 2, 3, 2, 3}; int *res = solution(price, sizeof(price)/sizeof(int)); for(int i =0; i<5; i++) { printf("%d ", res[i]); } } 자바 // //import java.util.*; // // //class Person{ // private int age; // // public int getAge() { // return age; // } // // public void setAge(int age) { // this.age = age; // } //} // //public class Main { // public static void main(String[] args) { // Person aPerson = new Person(); // aPerson.age = 17; // } // //} import java.util.*; class Power{ public int kick; public int punch; Power() { } Power(int kick, int punch) { this.kick = kick; } } public class Main{ public static void main(String[] args) { Power robot = new Power(); robot.kick = 16; robot.punch = 20; } }

''' 2739 a = int(input()) for i in range (1, 10): print(a, '*', i, '=', i*a) ''' ''' 10950 t=int(input()) for i in range(t): a, b= input().split() print(int(a)+int(b)) ''' ''' 8393 n=int(input()) a=0 for i in range(1, n+1): a+=i print(a) 15552 import sys t=int(input()) for i in range(t): a, b = map(int, sys.stdin.readline().split()) print(a + b) 2741 n=int(input()) for i in range(1, n+1): print(i) 2742 n = int(input()) for i in range(n): print(n-i) 11021 ''' ''' t=int(input()) for i in range(1, t+1): a, b= input().split() a=int(a) b=int(b) print('Case #',i,':', a+b) t=int(input()) for i in range(1, t+1): a, b= input().split() print(Case #,i,: int(a)+int(b)) t=int(input()) for i in range(1, t+1): a, b= input().split() a=int(a) b=int(b) # print('Case #%d:' %i, a+b) print('Case #%d: %d' %(i, a+b)) #print('Case #',i,':', a+b) 2438 t=int(input()) for j in range (t): for i in range (t): print('*') print() ''' ''' t=int(input()) for j in range (t): for i in range (j+1): print('*',end='') print() ''' ''' t=int(input()) for j in range (t): for i in range (): print(' ',end='') print() ''' ''' t = int(input()) for i in range(1, t + 1): a, b = input().split() a = int(a) b = int(b) # print('Case #%d:' %i, a+b) print('Case #%d: %d + %d = %d' % (i, a, b, a + b)) # print('Case #',i,':', a+b) ''' '''2439 t=int(input()) for j in range (t): for i in range (t-j-1): print(' ',end='') for i in range(j+1): print('*',end='') print() ''' n, x = input().split() n=int(n) x=int(x) data = input().split() for i in range(n): k = int(data[i]) if k<x: print(k, end=' ')

import java.util.Scanner; ////import java.util.*; //// ////public class main { //// //// public static void main(String[] args) //// { //// Scanner t = new Scanner(System.in); //// ////// int [][]map = new int[a][b]; //// //// int n = t.nextInt(); //// int []map = new int[n]; //// //// for (int i=0; i<n; i++) //// { //// int k = t.nextInt(); //// map[i] = k; //// } //// //// for(int i=0; i<n; i++) //// { //// for(int j=i; j<i+n; j++) //// { //// System.out.print(map[j%n]+" "); //// } //// System.out.println(); //// } //// //// } ////} // //import java.util.*; // //class sub{ // //} // //public class Main { // int a, b, c; // // Main() { // a = 10; // b = 20; // c = 30; // } // Main(int a, int b, int c) { // // method overloading // // } // // public int voice() { // // return 0; // } // // // main method // public static void main(String[] args) { // new Main(10, 20, 30); // subload s = new subload(); // s.a=10; // s.setB(100); // s.c = 300; // } //} //class sub { // int a; // static int b; // // void show() { // System.out.println(a + " " + b); // } //} // //public class Main { // public static void main(String[] args) { // sub a = new sub(); // a.show(); // a.a = 10; // a.b = 20; // a.show(); // sub b = new sub(); // b.show(); // b.b = 500; // a.show(); // } //} //class TV{ // String name; // int year; // int inch; // // TV() { // // } // // wrapper class // TV(String name, int year, int inch) { // this.name = name; // this.year = year; // this.inch = inch; // // } // void show() { // System.out.println(name+"에서 만든 "+year+"년형 "+inch+"인치"); // } //} // //public class Main{ // // public static void main(String[] args) { // TV myTV = new TV("LG", 2017, 32); // myTV.show(); // // } //} class Grade { int math; int science; int english; Grade(){ } Grade(int math, int science, int english){ this.math = math; } double average() { return (double)(this.math+science+english)/3; } } public class Main{ public static void main(String[] args) { Scanner t = new Scanner(System.in); System.out.print("수학, 과학, 영어 순으로 3개의 점수 입력 >> "); int math = t.nextInt(); int science = t.nextInt(); int english = t.nextInt(); Grade me = new Grade(math, science, english); System.out.println("평균은"+me.average()); t.close(); } }

/* import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner t = new Scanner(System.in); int a = t.nextInt(); int b = t.nextInt(); int [][]map = new int[a][b]; System.out.println(a+b); System.out.print("asdasd"); System.out.print("asdasd\n"); System.out.print("asdasd"); System.out.printf("%d %d", a, b); System.out.println(a+" "+b); for(int i=0; i<a; i++) { } } } */ //import java.util.Scanner; // //class sum { // void talk() { // System.out.println("HELLO"); // } // void show() { // System.out.println("ASDASDS"); // } //} /* import java.util.*; public class Main{ public static void main(String[] args) { Scanner t = new Scanner(System.in); // sum s = new sum(); // s.show(); // int n = t.nextInt(); int a =0; for(int i=0; i<n; i++) { int k = t.nextInt(); if(k%5==0) { a += k; } } System.out.println(a); } } */ /* import java.util.*; public class Main{ public static void main(String[] args) { Scanner t = new Scanner(System.in); int n = t.nextInt(); int a=0; for(int i=0; i<n; i++) { int k = t.nextShort(); if(k%2==0) { a++; } } System.out.println(a); } } */ //import java.util.*; //public class Main{ // public static void main(String[] args) // { // Scanner t = new Scanner(System.in); // //// int [][]map = new int[a][b]; // // int n = t.nextInt(); // int []map = new int[n]; // // for (int i=0; i<n; i++) // { // int k = t.nextInt(); // map[i] = k; // } // // for(int i=0; i<n; i++) // { // for(int j=i; j<i+n; j++) // { // System.out.print(map[j%n]+" "); // } // System.out.println(); // } // // } //} /* * 1. Class (CLEAR) * 2. Constructor * 9. public, private, protected, default * 3. Method Overloading * 4. Method Overriding * -> Inheritence(상속) * 5. Casting * 6. Abstract * 7. Interface * 8. Collection Framework */ /* import java.util.*; class hello { // field > variable int a, b, c; hello() { // constructor a = 0; b = 0; c = 0; System.out.println("Initalized 1"); } hello(int a, int b, int c) { this.a = a; this.b = b; this.c = c; System.out.println("Init 2"); } // method > function void talk() { } int calcu(int a, int b) { return a+b; } } public class Main { public static void main(String[] args) { hello h = new hello(); hello p = new hello(10, 20, 30); } } */ import java.util.*; public class Circle{ int radius; String name; public Circle() { radius = 1; name = ""; } public Circle(int r, String n) { radius = r; name = n; } public double getArea() { return 3.14*radius*radius; } public static void Main(String[] args){ Circle pizza = new Circle(10, "자바피자"); double area = pizza.getArea(); System.out.println(pizza.name + "의 면적은 " + area); Circle donut = new Circle(); donut.name = "도넛피자"; area = donut.getArea(); System.out.println(donut.name + "의 면적은 " + area); } }

''' class student(): name = '' address = '' # constructor def __init__(callNanem ): name = callNanem def talk(self): print('HELLO') print(name) def sum(self): print('SUM') s1 = student('IKE') s2 = student() s1.talk() ''' class House(object): def __init__(self, year, acreages, address, price): self.year = year self.acreages = acreages self.address = address self.price = price def change_price(self, rate): self.price = self.price * rate def show_info(self): print("""This house is built in {}, acreages : {}, address : {}, price : {} """ .format(self.year, self.acreages, self.address, self.price)) if __name__ == "__main__": house_A = House(1999, 100, "seoul", 777777777) house_A.show_info()

#2 dictionary = {"멋사": "멋쟁이 사자처럼", "파이썬": "지금 배우는 언어"} def create_word(): #dictionary[input("Enter word: ")] =input("Enter meaning: ")으로 하면 순서가 바뀌어서 출력되는데 이유가 뭘까요 ..? k=input("Enter word: ") t=input("Enter meaning: ") dictionary[k]=t print("The word has been successfully registered\n") def read_dictionary(): print("Dictionary") print("---") for key, value in dictionary.items(): print(key, ':', value) def update_word(): #dictionary[input("Enter word: ")] =input("Enter meaning: ") a=input("Enter word: ") b=input("Enter meaning: ") dictionary[a]=b print("The word has been successfully updated") def delete_word(): z=input("Enter word: ") del dictionary[z] print("The word has been successfully deleted") def console_help(): print("Command list") print("---") print("C for create") print("R for read") print("U for update") print("D for delete") print("Q for quit") def receive_input(): command = input("Input command: ") if command == 'c' or command == 'C': create_word() return True if command == 'r' or command == 'R': read_dictionary() return True if command == 'u' or command == 'U': update_word() return True if command == 'd' or command == 'D': delete_word() return True if command == 'q' or command == 'Q': return False else: print("Please enter one of the letters above.") return True def main(): console_help() while receive_input(): pass if __name__ == "__main__": main()

''' import time def coroutineA(): n=0 while True: n=(yield n) time.sleep(1) if n%10==3 or n%10==6 or n%10==9: print('A : nothing') else: print('A : ', n) n+=1 n=0 A=coroutineA() A.__next__() while True: n=A.send(n) time.sleep(1) if n%10==3 or n%10==6 or n%10==9: print('B : nothing') else: print('B :',n) n+=1 ''' ''' a, b = input().split() a = int(a) b= int(b) print(a+b, a-b) print(a-b) ''' ''' def calcu(a, b): s = a+b m = a-b return (s, m) a, b = input().split() a = int(a) b = int(b) print(calcu(a, b)) ''' ''' g = 99 def func(): global g += 1 ''' ''' a = 10 b = 20 def func(): global a global b t = a a = b b = t print(a, b) ''' a = 10 b = 20 def func(): global a global b t = a a = b b = t print(a, b) def deco(): def new_func(): print('a와 b의 값이 교환되었습니다.') func() new_func() deco()

''' map = [] for i in range(10): v = input().split() for j in range(len(v)): v[i] = int(v[i]) map.append(v) a=2 b=2 if map[a][b] == 2: map[a][b] = 9 else: for i in range(10): for j in range(10): # 0, 1, 2 # 1? > 0, 1, 2 if(map[a][b]==0 ): map[a][b] = 9 b+=1 elif(map[a][b]==1): a+=1 elif(map[a][b]==2 or (a==10&b==10)): map[a][b]=9 for i in range(10): for j in range(10): print(map[i][j], end=' ') print() ''' from typing import List, Any ''' def sum(x, y): return x+y a, b = input().split() a = int(a) b = int(b) print(sum(a, b)) def multi(x, y): return float(x)*y print(multi(a, b)) def rec(x): if x == 1: return 1 return x + rec(x-1) print(rec(a)) ''' ''' list = [5,4,2,6,2,6,8,1,9] tu = (1, 2, 3, 4) print(tu) print(list) list.sort() print(list) if 5 in list: print('a') ''' ''' #1 data=input() print(data.upper()) ''' ''' def func(x): if len(data) == 1: return int(data[0]) * 10 elif len(data) == 2: return int(data[0]) * int(data[1]) data = input().split() print(func(data)) ''' ''' def f(x, y=10): return x*y x = int(input()) y = int(input()) print(f(x, y)) print(f(x)) ''' ''' data = input() print(data) data = list(data) str = '' for i in range(len(data)): if data[i] >= 'a' and data[i] <= 'z': #print(data[i], ord(data[i])) data[i] = chr(ord(data[i])-32) print(data[i]) str += data[i] print(str) ''' ''' def f(*data): total=0 print(data, '<') k = int(input()) for i in data-1: total += i*10 print(i) return total data = input() print(data) data = list(data) for i in range(len(data)): data[i] = int(data[i]) print(data) print(f(data)) ''' ''' v = 10 def mf(*numbers): total = 0 print(numbers) for i in range(len(numbers)): total += numbers[i]*10 print(total) list = [1, 2, 3] tu = (1, 2, 3) mf(1, 2, 3) ''' ''' global_var = 77 def outter(): global_var = 100 def inner(): global_var global_var += 1 print(global_var) inner() outter() ''' ''' def func(string, option=0): if option: s = string.upper() print(s) else: s = string.lower() print(s) string = input() v = int(input()) func(string, v) ''' '''' def func(string, option=0): print(option and (lambda s:s.upper())(string) or (lambda s:s.lower())(string)) string = input() v = int(input()) func(string, v) ''' '''제너레이터 list = [1,2,3,4,5] it = iter(list) print(it.__next__()) ''' '''코루틴 def co_routine(): total=0 while True: n=(yield) total+=n print('total =', total) a=co_routine() a.__next__() a.send(1) a.send(1) a.send(1) a.send(3) '''

''' data = input().split() print(data) ''' # list? ''' data = [] data.append(10) data.append("HELLO") v = [] v.append(10) v.append(20) v.append(30) data.append(v) print(data) ''' ''' a, b = input().split() a = int(a) b = int(b) if a+b>0: print(a) print(b) print(a) if a+5>0: print(a) elif a-b>0: print(a-b) elif a*b>0: print(a+a+a+a) else: print(a) ''' ''' a = 10 b = 20 c = 30 print(a, b, c) print('%d+%d=%d' %a %b %c) ''' ''' a=input() a=float(a) if a<=60 and a>=50: print('win') else: print('lose') ''' ''' n=input() n=int(n) if n>=30 and n<=40: print('win') elif n>=60 and n<=70: print('win') else: print('lose') ''' ''' a=input() a=int(a) if a>=50 and a<=70 or a%6==0: print('win') else: print('lose') ''' ''' list = [[1,2,3],[4, 5, 6]] for i in range(len(list)): for j in range(len(list[i])): print(list[i][j], end=' ') print() ''' ''' n=input() n=int(n) k = 1 map = [] for i in range(n): v = [] for j in range(n): v.append(0) map.append(v) for i in range(len(map)): for j in range(len(map[i])): map[i][j] = k k += 1 for i in range(len(map)): for j in range(len(map[i])): print(map[i][j], end= ' ') print() for i in range(10): for j in range(10): map[i][j] = input() ''' map = [] for i in range(10): v = input().split() for j in range(len(v)): v[i] = int(v[i]) map.append(v) a=2 b=2 if map[a][b] == 2: map[a][b] = 9 else: for i in range(10): for j in range(10): # 0, 1, 2 # 1? > 0, 1, 2 if(map[a][b]==0 ): map[a][b] = 9 b+=1 elif(map[a][b]==1): a+=1 elif(map[a][b]==2 or (a==10&b==10)): map[a][b]=9 for i in range(10): for j in range(10): print(map[i][j], end=' ') print()

/* #include <stdio.h> int main() { int n, i, j, k=1, t=0, c=0, top=0; int a[80100]= {}; int b[80100]= {}; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } for(i=0; i<n; i++) { if(a[i]>a[k+i]) { b[i]=a[i]; c++; k++; } else if(a[i]<=a[k+i]) { for(top=i; top>=0; top--) { if(a[k+i]>=b[top]) { b[top]=0; } } b[top]=a[k+i]; k++; } } printf("\n%d", c); } */ #include<stdio.h> int stack[80100] = {0}; int weight[80100] = {0}; int top=0; int main() { int n, k, i, j, c=0; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &k); for(i=0; i<n; i++) { if(top==0) { stack[top++] = k; } else { if(stack[top-1] > k) { for(j=0; j<top; j++) { c=weight[j]++; } stack[top++] = k; } else { for(j=0; j<top; j++) { top--; } stack[top++] = k; } } } } printf("%d", c); } */

#include <stdio.h> int a[80100]= {}; int main() { int n, i, t=1, k=1, count=0; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } for(i=1; i<n; i++) { if(a[k]<=a[k+i]) { a[k]=0; k++; } if(a[k]>a[k+i]) { count++; } } printf("%d", count); }

/*3002 #include <stdio.h> int i, j, m, n, k, t; int a[1000000]= {}; int b[1000000]= {}; int c[1000000]= {}; int main() { scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } scanf("%d", &m); for(i=0; i<m; i++) { scanf("%d", &b[i]); } for(j=0; j<m; j++) { int left = 0; int right = n-1; for( ;;) { int mid = (left+right)/2; //printf("%d %d %d\n", left, mid, right); if(left==right) { if(b[j]!=a[mid]) { printf("-1 "); break; } else { printf("%d ",mid+1); break; } } else if(b[j]<a[mid]) { //printf("1>>>%d %d\n", b[j], a[mid]); right = mid; } else if(b[j]>a[mid]) { //printf("2>>>%d %d\n", b[j], a[mid]); left= mid+1; } else if(b[j]==a[mid]) { printf("%d ", mid+1); break; } } } } */ /* #include <stdio.h> int main() { int a, b; scanf("%d %d", &a, &b); float x; x=(-1*b)/a; if((((int)x*100000)%10)>=5) { x+=0.0001; } printf("%.4f", x); } */ /* #include <stdio.h> int main() { int n, k, i, j, t=0, count=0, a[100010]= {}; scanf("%d %d", &n, &k); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } for(j=1; j<n; j++) { for(i=j; i<=n; i++) { t+=a[i]; if(t==k) { count++; t=0; break; } else if(t>k) { t=0; break; } } } printf("%d", count); } */ /* if(a[i+1]==a[i]+1) { t+=a[i]; } else if(a[i+1]!=a[i]) { if(t==k) { count++; } t=0; } ////////// 10 11 4 7 9 3 4 7 4 2 7 2 t1 : 11 t2 : 12 t1 : 11 t2 : 13 t : 2 c : 2 Process returned 0 (0x0) execution time : 1.318 s Press any key to continue. */ /* #include <stdio.h> int main() { int n, k, i, j, h, t=0, count=0, a[100000]= {}; scanf("%d %d", &n, &k); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } for(i=1; i<=n; i++) { for(j=i; j<i+h; j++) { t+=a[i]; if(t==k) { count++; t=0; } else if(t>k) { t=0; } h++; } } printf("t : %d\n", t); printf("c : %d", count); } */ /* #include <stdio.h> int main() { int n, k, i, j, c=0, t=0, a[100100]= {}; scanf("%d %d", &n, &k); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } int right= n; int left= 1; for(j=1; j<=n; j++) { int mid=(right+left)/2; for(i=left; i<mid; i++) { t+=a[i]; printf("t1 : %d\n", t); if(t==k) { c++; t=0; printf("t2 : %d\n", t); printf("cc : %d\n", c); } else if(t>k) { t=0; printf("t3 : %d\n", t); } else { right=mid-1; } } for(i=mid; i<right; i++) { t+=a[i]; printf("t6 : %d\n", t); if(t==k) { c++; t=0; printf("t4 : %d\n", t); } else if(t>k) { t=0; printf("t5 : %d\n", t); } else { left=mid; } } } printf("count : %d", c); } */ ---------------------------------------------------------------------------- #include <stdio.h> int main() { int n, k, i, j, c=0, t=0, a[100100]= {}; scanf("%d %d", &n, &k); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } int right= n; int left= 1; for(j=1; j<=n; j++) { int mid=(right+left)/2; for( ; ; ) { t+=a[++]; if(t==k) { c++; t=0; break; } else if(t>k) { t=0; break; } } } printf("count : %d", c); }

/*4572 #include <stdio.h> int i, j, m, n, k, t, l, a, b, c, d, q; int x[105][105]= {}; int y[50]= {}; int s(int x1, int y1) { x[x1][y1]=1; t++; if(x[x1+1][y1]==0) { s(x1+1, y1); } if(x[x1][y1+1]==0) { s(x1, y1+1); } if(x[x1-1][y1]==0) { s(x1-1, y1); } if(x[x1][y1-1]==0) { s(x1, y1-1); } } int main() { scanf("%d %d %d", &n, &m, &k); for(i=0; i<k; i++) { scanf("%d %d %d %d", &a, &b, &c, &d); for(j=a; j<c; j++) { for(l=b; l<d; l++) { x[j+1][l+1]=1; } } } for(i=0; i<=m+1; i++) { for(j=0; j<=n+1; j++) { if(i==0 || j==0 || i==m+1 || j==n+1 ) { x[i][j]=1; } } } for(i=1; i<=m; i++) { for(j=1; j<=n; j++) { if(x[i][j]==0) { //printf("%d %d>>>>", i, j); t=0; s(i, j); y[q++]=t; // printf("q : %d, t : %d\n", q, t); } } } printf("%d\n", q); for(i=0; i<q; i++) { for(j=0; j<q; j++) { if(y[j]>y[j+1]) { int temp = y[j]; y[j]=y[j+1]; y[j+1]=temp; } } } for(i=1; i<=q; i++) { printf("%d ", y[i]); } } */ /* #include <stdio.h> int i, j, n, m, right, left; int a[1000000]= {}; int b[1000000]= {}; int c[1000000]= {}; int r(int x) { } int main() { scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", a[i]); } scanf("%d", &m); for(i=0; i<m; i++) { scanf("%d", b[i]); } for(i=0; i<n; i++) { //p1 = a[i]; left = 0; right = m-1; mid = (left + right) / 2; for(;;) { } } } */ ========================================= #include <stdio.h> int i, j, m, n, k, t; int a[1000000]= {}; int b[1000000]= {}; int c[1000000]= {}; int main() { scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } scanf("%d", &m); for(i=0; i<m; i++) { scanf("%d", &b[i]); } int left = 0; int right = n; for( i=0; ; i++) { int mid = (left+right)/2; if(b[i]<a[mid]) { right = mid-1; if(b[i]>a[mid]) { c[t++]= -1; break; } } else if(b[i]>a[mid]) { left= mid+1; if(b[i]<a[mid]) { c[t++]= -1; break; } } else if(b[i]==a[mid]) { c[t++]=mid; break; } } for(i=0; i<m; i++) { printf("%d ", c[i]); } }

/*프로그래머스 #include <stdio.h> int s(int n) { int answer=0; for(;;) { if(n==1) { answer++; if(answer>=500) return -1; return answer; } else if(n%2==0) { n/=2; answer++; } else { n=n*3+1; answer++; } } } int main() { int n; scanf("%d", &n); printf("%d", s(n)); } */ /* #include <stdio.h> int a[1000][1000]= {}; int front, rear, t=0, count=0; int q[1005]= {}; void push(int i, int j) { } void pop() { } int s() { } int main() { int m, n,i, j, k=0; scanf("%d %d", &m, &n); for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { scanf("%d", &a[i][j]); k+=a[i][j]; } } for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { printf("%d ", a[i][j]); } printf("\n"); } if(k==0) printf("-1"); else if(k==(m*n)) printf("0"); else { for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { if(a[i][j]==1) { push(i, j); } } } printf("%d", count); } } */ /* #include <stdio.h> int a[1005][1005]= {}; int i, j, m, n, t, k, front=0, rear=0; int q[1000005][2]= {}; void s() { int max=front-1; for(i=rear; i<=max; i++) { int x = q[i][0]; int y = q[i][1]; if(a[x+1][y]==0) { q[front][0]=x+1; q[front][1]=y; a[x+1][y]=1; front++; } if(a[x][y+1]==0) { q[front][0]=x; q[front][1]=y+1; a[x][y+1]=1; front++; } if(a[x][y-1]==0) { q[front][0]=x; q[front][1]=y-1; a[x][y-1]=1; front++; } if(a[x-1][y]==0) { q[front][0]=x-1; q[front][1]=y; a[x-1][y]=1; front++; } rear++; } } void p() { while (1) { if(front!=rear) { s(); // printf("%d %d\n", front, rear); k++; } else { return ; } } } int main() { scanf("%d %d", &m, &n); for(i=0; i<=n+1; i++) { for(j=0; j<=m+1; j++) { if(i==0 || j==0 || i==n+1 ||j==m+1) { a[i][j] = 1; } else { scanf("%d", &a[i][j]); } t+=a[i][j]; } } if(t==(m*n)) { printf("0"); } else { for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { if(a[i][j]==1) { q[front][0]=i; q[front][1]=j; front++; } } } k=0; p(); for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { if(a[i][j]==0) { printf("-1"); return 0; } } } printf("%d", k-1); } } */ #include <stdio.h> int m, n, c, k, l, x, y, q, w, i, j; int a[105][105]={}; int b[105][105]={}; int main() { scanf("%d %d %d", &m, &n, &k); for(i=0; i<k; i++) { scanf("%d %d %d %d", &x, &y, &q, &w); for(k=x; k<=q; k++) { for(l=y; l<=w; l++) { a[k][l]=1; } } } for(i=0; i<m; i++) { for(j=0; j<n; j++) { if(a[i][j]==0) c++; printf("%d", c); } } #include <stdio.h> int i, j, l, m, n, k, c, d, x, y; int a[105][105]={}; int main() { scanf("%d %d %d", &m, &n, &k); for(i=0; i<k; i++) { scanf("%d %d %d %d", &x, &y, &c, &d); for(j=x; j<=c; j++) { for(l=y; l<=d; l++) { a[j][l]=1; } } } for(i=0; i<m; i++) { for(j=0; j<n; j++) { printf("%d ", a[i][j]); } printf("\n"); } }

/* #include <stdio.h> #include <stdbool.h> #include <stdlib.h> char* solution(int a, int b) { // 리턴할 값은 메모리를 동적 할당해주세요. char* answer = (char*)malloc(sizeof(char)*10); char date[7][10] = {"SUN", "MON", "TUE",}; answer = date[0]; if(a==1 || a==3 || a==5 || a==7 || a==8 || a==10 || a==12 ) { int k= ((a)*31+(a-)*30+b)%7; } else if(a==2) { } else { int k= (+b)%7; } return answer; } int main() { int a, b; scanf("%d %d", &a, &b); solution(a, b); printf("%s", answer); } */ /* malloc 동적 할당 #include<stdio.h> #include<malloc.h> // malloc, calloc, realloc struct node { int a, b, c; }; int main() { int *pt; int n; int **ppt; struct node *pNode; pNode = (struct node*) malloc(sizeof(pNode) * 100); scanf("%d", &n); pt = (int*) malloc(sizeof(int) * n); for(int i=0; i<n; i++) { printf("%p\n", &pt[i]); } } */ /* #include<stdio.h> #include<malloc.h> char* day() { char* answer = (char*)malloc(sizeof(char)*10); strcpy(answer, "SUNDD"); return answer; } int main() { printf("%s", day()); } */ // 1,3,5,1,2,7 /* 프로그래머스 1단계 풀이 1 #include <stdio.h> int a[10]= {}; int b[1000000]= {}; int k; int s(int n) { int i, j, temp; for(i=0; i<n; i++) { for(j=1; j<n; j++) { b[a[i]+a[j+i]]=1; } } for(i=0; i<k; i++) { for(j=0; j<k-1; j++) { if(b[j]>b[j+1]) { temp=b[j]; b[j]=b[j+1]; b[j+1]=temp; } } } } int main() { int n, i, p; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } k=n*(n-1)/2; s(n); for(i=0; i<k; i++) { if(p != b[i] || i==0) printf("%d ", b[i]); p = b[i]; } } */ /* 프로그래머스 1단계 풀이 2 #include <stdio.h> int a[10]= {}; int b[1000000]= {}; int k; int s(int n) { int i, j; for(i=0; i<n; i++) { for(j=i+1; j<n; j++) { b[a[i]+a[j]]=1; printf("%d %d %d\n", a[i], a[j], a[i]+a[j]); } } } int main() { int n, i, p; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } s(n); for(i=0; i<1000000; i++) { if(b[i]==1) { printf("%d ", i); } } } */

/* #include <stdio.h> int map[100][100] = {0}; int visit[100] = {0}; int n, t=0; int q() { int i, count=0; for(i=0; i<=n; i++) { if(visit[i]==1) { count++; } } printf("\n\n%d", count-1); } void s(int k) { visit[k] = 1; int i; for(i=1 ; i<=n ; i++) { if(map[k][i]==1){ map[k][i] = 0; map[i][k] = 0; s(i); } } } int main() { int i, j, a, b, k; scanf("%d", &n); scanf("%d", &k); for(i=1; i<=k; i++) { scanf("%d %d", &a, &b); map[a][b] = 1; map[b][a] = 1; } s(1); for(i=1; i<=7; i++) { for(j=1; j<=7; j++) { printf("%d ", map[i][j]); } printf("\n"); } q(); return 0; } /* void s(int i, int j) { map[i][j]=0; if(map[i-1][j-1]) { s(i-1, j-1); } if(map[i-1][j]) { s(i-1, j); } if(map[i-1][j+1]) { s(i-1, j+1); } if(map[i][j-1]) { s(i, j-1); } } */ /* #include <stdio.h> int a[10][10]= {}; int count, t=0; void s(int i, int j) { if(a[i][j]==0) return ; //printf("%d %d\n", i, j); if(a[i][j]==a[i+1][j]) { a[i][j]=0; t++; s(i+1, j); } if(a[i][j]==a[i][j+1]) { a[i][j]=0; t++; s(i, j+1); } if(a[i][j]==a[i-1][j]) { a[i][j]=0; t++; s(i-1, j); } if(a[i][j]==a[i][j-1]) { a[i][j]=0; t++; s(i, j-1); } //return t; } int main() { int i, j, k; for(i=1; i<=7; i++) { for(j=1; j<=7; j++) { scanf("%d", &a[i][j]); } } count = 0; for(i=1; i<=7; i++) { for(j=1; j<=7; j++) { if(a[i][j]>0) { t=0; s(i, j); if(t>=3) { count++; } printf("Processing----\n"); for(int x =1; x<=7; x++) { for(int y=1; y<=7; y++) { printf("%d ", a[x][y]); } printf("\n"); } } } } printf("%d", count); return 0; } */ /* 2605 반복문 이용 #include<stdio.h> int map[10][10] = {0}, n, k; int result = 0; int cnt = 0; int direct[4][2] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} }; void find(int item, int x, int y) { if(map[x][y] == 0) return; cnt++; map[x][y] = 0; for(int i=0; i<4; i++) { if(item == map[x+direct[i][0]][y+direct[i][1]]){ find(item, x+direct[i][0], y+direct[i][1]); } } /* if(item == map[x+1][y]) { find(item, x+1, y); } if(item == map[x-1][y]) { find(item, x-1, y); } if(item == map[x][y+1]) { find(item, x, y+1); } if(item == map[x][y-1]) { find(item, x, y-1); } */ } int main() { int i, j; for(i=1; i<=7; i++) { for(j=1; j<=7; j++) { scanf("%d", &map[i][j]); } } for(i=1; i<=7; i++) { for(j=1; j<=7; j++) { cnt = 0; find(map[i][j], i, j); if(cnt >= 3) { result++; } } } printf("%d", result); } */ /* 프로그래머스 1번 #include <stdio.h> #include <stdbool.h> #include <stdlib.h> // 파라미터로 주어지는 문자열은 const로 주어집니다. 변경하려면 문자열을 복사해서 사용하세요. int solution(const char* s) { int answer = 0; int i; if(s[0]=='-') { for(i=1; i<strlen(s); i++) { answer *= 10; answer +=(s[i]-48); } answer = -answer; } else { for(i=0; i<strlen(s); i++) { answer *= 10; answer +=(s[i]-48); } } return answer; } int main() { int k = solution("-1234"); printf("%d", k); } */

/* #include <stdio.h> int a[100005]= {}; void s(int l, int r) { int temp=a[l]; a[l]=a[r]; a[r]=temp; } int p(int l, int r) { int piv = (l+r)/2; printf("p piv %d\n", a[piv]); printf("sort p1 data: "); for(int i=l; i<=r; i++) { printf("%d ", a[i]); } printf("\n"); while(l < r) { while(a[l]<a[piv] && l<r) { //s(l, r); l++; } while(a[r]>a[piv] && l<r) { //s(l, r); r--; } printf("pick %d %d\n", l, r); if(l<r) { s(l, r); if(l==piv) { piv=r; } } } return piv; } void q(int l, int r) { printf("sort q data: "); for(int i=0; i<5; i++) { printf("%d ", a[i]); } printf("\n"); if(l<r) { int piv=p(l, r); q(l, piv-1); q(piv+1, r); } } void main() { int n, i; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(0, n-1); for(i=0; i<n; i++) { printf("%d ", a[i]); } } */ /* #include <stdio.h> int a[100005]= {}; //5 //1 //4 //5 //8 //2 void s(int l, int r) { int t=a[l]; a[l]=a[r]; a[r]=t; } int p(int b, int e) { int pivot=(b+e)/2; int l=b; int r=e; for( ; l<r; ) { for( ; a[l]<a[pivot]&&l<r; ) l++; while(a[r]>a[pivot]&&l<r) r--; if(l<r) { s(l,r); if(l==pivot) pivot=r; } } s(pivot,r); return r; } void q(int l, int r) { int piv; if(l<r) { piv=p(l,r); q(l, piv-1); q(piv+1, r); } } void main() { int i, n; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(0, n-1); for(i=0; i<n; i++) { printf("%d\n", a[i]); } } */ /* #include <stdio.h> int a[100005]= {}; int main() { int n, i, j, k; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &k); a[k]++; } for(j=0; j<=100000; j++) { for(i=0; i<a[j]; i++) { printf("%d ", j); } } } */ /*4421 #include <stdio.h> int a[30][30]= {}; int q[1000]= {}; int t, z=0; int s() { int i, j, temp; for(i=0; i<t; i++) { for(j=0; j<t-1; j++) { if(q[j]>q[j+1]) { temp=q[j+1]; q[j+1]=q[j]; q[j]=temp; } } } printf("%d\n", t); for(j=0; j<t; j++) { printf("%d\n", q[j]); } } void k(int i, int j) { z++; a[i][j] = 0; if(a[i-1][j]==1) { //a[i-1][j]=0; k(i-1, j); } if(a[i+1][j]==1) { //a[i+1][j]=0; k(i+1, j); } if(a[i][j+1]==1) { //a[i][j+1]=0; k(i, j+1); } if(a[i][j-1]==1) { //a[i][j-1]=0; k(i, j-1); } //s(t, q[z]); } int main() { int n, i, j; scanf("%d", &n); for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { scanf("%1d", &a[i][j]); } } for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { if(a[i][j]==1) { z = 0; k(i, j); q[t++]=z; } } } s(); return 0; } */ /* #include <stdio.h> char a[105][105]= {}; int t=0; void s(int i, int j) { int x, y; a[i][j]='.'; for(x=i-1; x<=i+1; x++) { for(y=j-1; y<=j+1; y++) { if(a[x][y]=='L') { s(x, y); } } } } int main() { int w, i, j, h; int x, y; scanf("%d %d", &w, &h); for(i=1; i<=h; i++) { for(j=1; j<=w; j++) { scanf(" %c", &a[i][j]); } } for(i=1; i<=h; i++) { for(j=1; j<=w; j++) { if(a[i][j]=='L') { s(i, j); t++; } } } printf("%d", t); } */ 2605 4023 4503 4697 프로그래머스 1

#include <stdio.h> int a[100000]={}; void s(int l, int r) { int t=a[l]; a[l]=a[r]; a[r]=t; } int p(int b, int e) { int pivot=(b+e)/2; int l=b; int r=e; while(l<r) { while(a[l]>a[pivot]&&l<r) l++; while(a[r]<a[pivot]&&l<r) r--; if(l<r){ s(l,r); if(l==pivot) pivot=r; } } s(pivot,r); return r; } void q(int l, int r) { if(l<r) { q(l, p-1); q(p+1, r); } } void main() { int i, n; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(0, n-1); } ************************** #include <stdio.h> int a[1000]={}; //5 //1 //4 //5 //8 //2 void s(int l, int r) { int t=a[l]; a[l]=a[r]; a[r]=t; } int p(int b, int e) { int pivot=(b+e)/2; int l=b; int r=e; while(l<r) { while(a[l]>a[pivot]&&l<r) l++; while(a[r]<a[pivot]&&l<r) r--; if(l<r){ s(l,r); if(l==pivot) pivot=r; } } s(pivot,r); return r; } void q(int l, int r) { int piv; if(l<r) { piv=p(l,r); q(l, piv-1); q(piv+1, r); } } void main() { int i, n; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(0, n-1); for(i=0; i<n; i++) { printf("%d ", a[i]); } printf("\n"); } **************************** #include <stdio.h> int a[1000]={}; void s(int l, int r) { int temp=a[l]; a[l]=a[r]; a[r]=temp; } int p(int l, int r) { int piv; if(a[l]>a[piv]) { s(l, r); l++; } if(a[r]<a[piv]) { s(l, r); r--; } if(l==r) { piv=r; } return ; } void q(int l, int r) { if(l<r) { int piv=p(l, r); q(l, piv-1); q(piv+1, r); } } void main() { int n, i; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(0, n-1); for(i=0; i<n; i++) { printf("%d ", a[i]); } }

/* #include <stdio.h> typedef struct _node { int a; int b; } Node; int main() { int n, i, j, t; Node p[10000]= {}; Node s[10000] = {0}; Node k; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &p[i].a); s[i].a = p[i].a; } for(j=0; j<n; j++) { for(i=0; i<n-1; i++) { if(s[i].a<s[i+1].a) { k=s[i]; s[i]=s[i+1]; s[i+1]=k; } p[i].b=i; } } for(i=0; i<n; i++) { printf("%d ", p[i].b); } return 0; } */ /* #include<stdio.h> int main() { int data[1000] = {0}; int swap[1000] = {0}; int t, i, j, n, x, y; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &data[i]); swap[i] = data[i]; } for(i=0; i<n; i++) { for(j=0; j<n-1; j++) { if(swap[j] > swap[j+1]) { t = swap[j]; swap[j] = swap[j+1]; swap[j+1] = t; } } } for(i=0; i<n; i++) { printf("%d : %d\n", data[i], swap[i]); } for(i=0; i<n; i++) { printf("hope find item : %d\n", data[i]); for(j=0; j<n; j++) { if(data[i] == swap[j]) { printf("find %d\n", j); break; } } } } */ #include <stdio.h> int a[10000]={}; void s() { } int p() { s() } void q(int a[], int l, int r) { if(l>r) { s(); } } int main() { scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } q(a[], 0, n-1) return 0; }

/* 삽입정렬 #include <stdio.h> int a[100001]= {}; int main() { int n, i, j, k; scanf("%d", &n); for(i=1; i<=n; i++) { scanf("%d", &a[i]); } for(i=2; i<=n; i++) { k=a[i]; for(j=i-1; a[j]>=k; j--) if(a[j]>=k) { a[j+1]=a[j]; } a[j+1]=k; } for(i=1; i<=n; i++) { printf("%d ", a[i]); } } */ /*1451 #include <stdio.h> int main() { int i, n, j, k, a[10005]= {}; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } for(i=1; i<n; i++) { for(j=0; j<n-i; j++) { if(a[j]>a[j+1]) { k=a[j]; a[j]=a[j+1]; a[j+1]=k; } } } for(i=0; i<n; i++) { printf("%d\n", a[i]); } return 0; } */ /*3011 #include <stdio.h> int main() { int i, n, j, k, t, a[1005]= {}; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } for(i=0; i<n; i++) { t=0; for(j=0; j<n-1; j++) { if(a[j]>a[j+1]) { t++; k=a[j]; a[j]=a[j+1]; a[j+1]=k; } } if(t==0) { printf("%d\n", i); break; } } return 0; } */ /* #include <stdio.h> typedef struct _node { int a, b, rank; } Node; int main() { int n, i, j,q; Node p[10001] = {}; Node k; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d %d", &p[i].a, &p[i].b); p[i].rank=i+1; } for(i=0; i<n; i++) { for(j=0; j<n-1; j++) { if(p[j].a< p[j+1].a) { k=p[j]; p[j]=p[j+1]; p[j+1]=k; } } } for(i=0; i<n; i++) { for(j=0; j<n; j++) { if(p[j].a==p[j+1].a) { if(p[j].b< p[j+1].b) { k=p[j]; p[j]=p[j+1]; p[j+1]=k; } } } } for(i=0; i<n; i++) { printf("%d %d %d\n", p[i].rank, p[i].a, p[i].b); } return 0; } */ 4012 3016