#include <bits/stdc++.h>
using namespace std;
//배열초기화 fill (2차원 배열)
int main()
{
    int a[5][5];
    fill(&a[0][0], &a[4][5], 77);
    //fill(a, a+5, 89);

    for(int i=0; i<5; i++){
        for(int j=0; j<5; j++){
            printf("=%d", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
//숫자삼각형 (종류3)
int main()
{
    int n;
    cin >> n;
    int x;

    int a[100][100];
    fill(&a[0][0], &a[99][100], -1);


    int p = 1;
    for(int i=0; i<2*n-1; i++){
        for(int j=0; j<p; j++){
            a[i][j] = j+1;
        }
        if(i<n/2){
            p++;
        }
        else{
            p--;
        }
    }

    for(int i=0; i<2*n; i++){
        for(int j=0; j<n; j++){
            if(a[i][j] == -1){
                cout << " ";
            }
            else{
                cout << a[i][j];
            }

        }
        cout << "\n";
    }
    return 0;
}

#반복제어문2 - 자가진단5
a=list(map(int, input().split()))
c=0
d=0
t=0
for i in a:
  if i%3==0:
    c+=1
  if i%5==0:
    d+=1
print("Multiples of 3 : %d" %c)
print("Multiples of 5 : %d" %d)​

#반복제어문2 - 자가진단7
for i in range(2, 7):
  for j in range(i, i+5):
    print(j, end=" ")
  print(" ")​

#반복제어문2 - 자가진단6
k=int(input())
a=list(map(int, input().split()))
su=0
for i in a:
  su+=i
print("avg : %.1f" %(su/k))
if(su/k>=80):
  print("pass")
else:
  print("fail")

#반복제어문2 - 자가진단8
a, b=map(int, input().split())

if a>b:
  for i in range(1, 10):
    for j in range(a, b-1, -1):
      print("%d * %d =  %d   " %(j,i,i*j), end=" ")
    print(" ")
else:
  for i in range(1, 10):
    for j in range(a, b+1):
      print("%d * %d =  %d   " %(j,i,i*j), end=" ")
    print(" ")​

#반복제어문2 - 자가진단8
for i in range(2, 5):
  for j in range(1, 6):
    print("%d * %d =  %d   " %(i,j,i*j), end=" ")
  print(" ")

#반복제어문2 - 형성평가8
a, b=map(int, input().split())
for i in range(1, a+1):
  for j in range(1, b+1):
    print(i*j, end=" ")
  print(" ")

#반복제어문3 - 자가진단1
n=int(input())
su=0
i=1
while True:
  su+=i
  if su>=n:
    print("%d %d %d" %(i, i//2+1, su))
    break
  i+=2​

#반복제어문3 - 자가진단3

n=int(input())
for i in range(1, n+1):
  for j in range(n-i+1, 0, -1):
    print("*",end="")
  print(" ")
for i in range(1, n+1):
  for j in range(1, i+1):
    print("*",end="")
  print(" ")​

#반복제어문3 - 자가진단2
n=int(input())
for i in range(1, n+1):
  for j in range(1, i+1):
    print("*",end="")
  print(" ")

#554 : 반복제어문3 - 자가진단7
n=int(input())
ai="A"
k=1
for i in range(1, n+1):
  for _ in range(n-i+1):
    print(k, end=" ")
    k+=1
  for _ in range(i):
    print(ai, end=" ")
    ai=chr(ord(ai)+1)
  print("")​

#143 : 반복제어문3 - 형성평가4
n=int(input())
for i in range(n*2-1, -1, -2):
  for j in range((n*2-1-i)//2):
    print(" ",end="")
  for k in range(i):
    print("*",end="")
  print("")
for i in range(3, n*2+1, 2):
  for j in range((n-i+2)//2):
    print(" ",end="")
  for k in range(i):
    print("*",end="")
  print("")

#141 : 반복제어문3 - 형성평가2
n=int(input())
for i in range(1, 101):
  if((n*i)%10==0):
    print(n*i, end=" ")
    break
  else:
    print(n*i, end=" ")​

#142 : 반복제어문3 - 형성평가3
n=int(input())
for i in range(1, n+1):
  for _ in range(i):
    print("*",end="")
  print("")
for i in range(1, n):
  for _ in range(n-i):
    print("*",end="")
  print("")

#140 : 반복제어문3 - 형성평가1
n=list(map(int,input().split()))
sum1=0
ti=0
for i in n:
  if(i==0):
    break
  if(ti==20):
    break
  else:
    sum1+=i
  ti+=1
print("%d %d" %(sum1, sum1//ti))

#140 : 반복제어문3 - 형성평가1
n=list(map(int,input().split()))
sum1=0
#ti=0
for ti, i in enumerate(n):
  print(ti, i)
  if(i==0):
    break
  if(ti==20):
    break
  else:
    sum1+=i
  #ti+=1
print("%d %d" %(sum1, sum1//ti))

#553 : 반복제어문3 - 자가진단6
n=int(input())
al="A"
for i in range(n):
  for j in range(n-i,0,-1):
    print(al,end="")
    al=chr(ord(al)+1)
  print(" ")

#반복제어문3 - 자가진단4

n=int(input())
for i in range(1, n+1):
  for k in range(0, i-1):
    print(" ",end="")
  for j in range(n-i+1, 0, -1):
    print("*",end="")
  print(" ")

n, m, k = map(int, input().split())
c=list(map(int, input().split()))
p=max(c)
s=c.count(p)
if(s>1):
  print(m*p)
else:
  c.remove(p)
  q=max(c)
  a=m//(k+1)
  b=m%(k+1)
  print(a*(p*k+q)+p*b)

#include <bits/stdc++.h>
using namespace std;
//큰수의 법칙

int main()
{
    int n;
    cin >> n;

    int k,m;
    cin >> m >> k;

    int max = -3200;
    int smax;
    int a[100];
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    //////////////
    //sort -> max, smax구하자
    sort(a,a+n);
    max = a[n-1];
    smax = a[n-2];


    //////////////
    int cnt=0;
    int ans=0;

    for(int i=0; i<100; i++){
        if(cnt < m){
            if(i<k){
                ans= ans+max;
                cnt++;
            }
            else{
                cout << i << " = i \n";
                ans= ans+smax;
                cnt++;
                i=0;
            }
        }
        else{
            break;
        }
    }
    cout << cnt << " = cnt \n";
    cout << ans;
    
    return 0;
}

www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1174&sca=2040

import math
def is_prime_number(x):
  for i in range(2, int(math.sqrt(x))+1):
    if x%i == 0:
      return False
  return True

m = int(input())

for _ in range(0,m):
  i = int(input())
  u = i+1
  d = i-1
  while True:
    flag = False
    p = ""
    if is_prime_number(d):
      flag = True
      p += str(d) + " "
      #print(d)

    if is_prime_number(u):
      flag = True
      p += str(u) + " "
      #print(u)
    

    if flag == True:
      print(p)
      break
    
    u+=1
    d-=1
  

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  cnt = 0
  for i in range(1, a):
    if a%i == 0:
      cnt += 1
  if cnt == 1:
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))

def is_prime_number(x):
  for i in range(2, x):
    if x%i == 0:
      return False
  return True

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  if(is_prime_number(a)):
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))

import math
def is_prime_number(x):
  for i in range(2, int(math.sqrt(x))+1):
    if x%i == 0:
      return False
  return True

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  if(is_prime_number(a)):
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))

555 : 배열1 - 자가진단1

li = list(input().split())
print(li)
for i in li:
  print(i, end="")

556 : 배열1 - 자가진단2

li = []
for i in range(1, 11):
  li.append(i)

for i in li:
  print(i,end=" ")

557 : 배열1 - 자가진단3

li = input().split()

for i,a in enumerate(li):
  if i == 0 or i == 3 or i == 6:
    print(a, end=" ")

li = input().split()

for i in range(0, len(li)):
  if i == 0 or i == 3 or i == 6:
    print(li[i], end=" ")

558 : 배열1 - 자가진단4

li = list(map(int, input().split()))

for a in range(len(li)-2, -1, -1):
  print(li[a], end=" ")

li = list(map(int, input().split()))
li = li[:-1]
li.reverse()
print(li)

634 : 반복제어문3 - 자가진단2

a = int(input())

for i in range(1,a+1):
  for _ in range(0, i):
    print("*", end="")
  print()

547 : 반복제어문2 - 자가진단7

for i in range(2,7):
  for j in range(0,5):
    print(i + j, end = " ")
  print()

548 : 반복제어문2 - 자가진단8

for i in range(2,5):
  for j in range(1,6):
    print("%-2d * %2d = %3d  " %(i, j, i*j), end = " ")
  print()

133 : 반복제어문2 - 형성평가4

n = int(input())
cnt = 0
sum = 0
for _ in range(0,n):
  a = int(input())
  sum += a
  cnt += 1

print("%.2f" %(sum/cnt))

n = int(input())
li = list(map(int, input().split()))
cnt = 0
sum = 0
for a in li:
  sum += a
  cnt += 1

print("%.2f" %(sum/cnt))

137 : 반복제어문2 - 형성평가8

a,b = map(int, input().split())

for i in range(1, a+1):
  for j in range(1, b+1):
    print("%d" %(i*j), end = " ")
  print(" ");

138 : 반복제어문2 - 형성평가9

a = int(input())

for i in range(1, a + 1):
  for j in range(1, a + 1):
    print("(%d, %d)" %(i,j), end = " ")
  print()

139 : 반복제어문2 - 형성평가A

a, b = map(int, input().split())

for i in range(1, 10):
  for j in range(a, b-1, -1):
    print("%-2d * %2d = %2d" %(j, i, j*i), end = " ")
  print()

536 : 반복제어문1 - 자가진단1

i = 1
p = ""
while i <= 15:
  #print(i, end=" ")
  p += str(i) + " "
  i += 1
print(p)

i = 1
while i <= 15:
  print(i, end=" ")
  i += 1

for i in range(1, 16):
  print(i, end = " ")

537 : 반복제어문1 - 자가진단2

n = int(input())
sum = 0
i = 1
while i <= n:
  sum += i
  i +=1;

print(sum)

n = int(input())
sum = 0
for i in range(1, n+1):
  sum += i

print(sum)

538 : 반복제어문1 - 자가진단3

while True:
  a = int(input())
  if a == 0:
    break
  if a > 0:
    print("Pos")
  else:
    print("Neg")

539 : 반복제어문1 - 자가진단4

#입력을 한줄에 한개씩 받아야 함.
cnt = 0
sum = 0
while True:
  a = int(input())
  sum += a
  cnt += 1
  if a >= 100:
    break

print("%d %d \n%.1f" %(sum,cnt, sum/cnt))

n = list(map(int, input().split()))
cnt = 0
sum = 0
for a in n:
  sum += a
  cnt += 1
  if a >= 100:
    break

print("%d %d \n%.1f" %(sum,cnt, sum/cnt))

540 : 반복제어문1 - 자가진단5

while True:
  a = int(input())
  if a == -1:
    break
  if a%3 == 0:
    print(a//3)

633 : 반복제어문1 - 자가진단6

while True:
  print("1. Korea\n2. USA\n3. Japan\n4. China\nnumber?", end = " ")
  a = int(input())
  if a == 1:
    print("\nSeoul\n")
  elif a == 2:
    print("\nWashington\n")
  elif a == 3:
    print("\nBeijing\n")
  else : 
    print("\nnone\n")
    break

125 : 반복제어문1 - 형성평가1

a = int(input())
i = 1
while i<=a:
  print(i, end=" ")
  i += 1

a = int(input())
for i in range(1, a+1):
  print(i, end=" ")

126 : 반복제어문1 - 형성평가2

odd = 0
even = 0
while True:
  a = int(input())
  if a == 0:
    break
  if a%2 == 0:
    even += 1
  else:
    odd +=1
  
print("odd : %d\neven : %d" %(odd, even) )

n = list(map(int, input().split()))
odd = 0
even = 0
for a in n:
  if a == 0:
    break
  if a%2 == 0:
    even += 1
  else:
    odd +=1
  
print("odd : %d\neven : %d" %(odd, even) )

127 : 반복제어문1 - 형성평가3

sum = 0
cnt = 0
while True:
  a = int(input())
  if a < 0 or a > 100:
    break
  sum += a
  cnt += 1

print("sum : %d\navg : %.1f" %(sum, sum/cnt))

n = list(map(int, input().split()))
sum = 0
cnt = 0
for a in n:
  if a < 0 or a > 100:
    break
  sum += a
  cnt += 1

print("sum : %d\navg : %.1f" %(sum, sum/cnt))

128 : 반복제어문1 - 형성평가4

n = list(map(int, input().split()))
cnt = 0

for a in n:
  if a%3 != 0 and a%5 != 0:
    cnt += 1

print(cnt)

129 : 반복제어문1 - 형성평가5

while True:
  b = int(input("Base = "))
  h = int(input("Height = "))
  area = b*h/2
  print("Triangle width = %.1f" %area)
  y = input("Continue? ")
  if(y != 'y' and y != 'Y'):
    break

//문자열 1 : 형성평가 1 

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char a, b;
   
   scanf("%c %c", &a, &b);
   printf("%d %d", a+b, abs(a-b));
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=82&sca=10e0

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=84&sca=10e0

//문자열 1 : 형성평가 3

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char n[100];
   
   scanf("%s", n);
   int count = strlen(n);
   
   for(int i = 0; i < count; i++){
   
      if(n[i] >= 'A' && n[i] <= 'Z'){
           printf("%c", n[i]+32);
       }
         else if(n[i] >= 'a' && n[i] <= 'z'){
           printf("%c", n[i]);
       }
        else if(n[i] >= '0' && n[i] <= '9'){
           printf("%c", n[i]);
       }
   }
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=85&sca=10e0

//문자열 1 : 형성평가 4

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char n[100];
   char a;
   
   scanf("%s", &n);
   scanf("%c", &a);
   int count = strlen(n);
   int flag = 0;
   int temp = 0;
   
   for(int i = 0; i < count; i++){
      if(n[i] == a){
         flag = 1;
         break;
      }
      temp++;
   }
   if(flag == 1)   printf("%d", temp);
   else printf("No");
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=86&sca=10e0

//문자열 1 : 형성평가 5

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char a[100], b[100];
   
   scanf("%s %s", &a, &b);
   
   int len_a = strlen(a);
   int len_b = strlen(b);
   
   if(len_a > len_b){
      printf("%d", strlen(a));
   }
   
   else {
      printf("%d", strlen(b));
   }
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=88&sca=10e0

//문자열 1 : 형성평가 7

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char n[100];
   char temp[100];
   int count = 1;
   
   gets(n);
   printf("1. ");
   
   for(int i = 0; i <= strlen(n); i++){
      printf("%c", n[i]);
      if(n[i] == ' '){
         count+=1;
         printf("\n%d. ", count);
      }
   }
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=242&sca=10f0

//문자열 2 : 자가진단 4 

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char a[100]; 
   char b[100];
   
   gets(a);
   strcpy(b, a);
   printf("%s", b);
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=243&sca=10f0

//문자열 2 : 자가진단 5

#include <bits/stdc++.h>
using namespace std;

int main()
{
   char n[20];
   char a[20] = "fighting";
   
   scanf("%s", &n);
   printf("%s", strcat(n, a));
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=87&sca=10e0

//문자열 1 : 형성평가 6
#include <bits/stdc++.h>
using namespace std;

int main()
{
    char in[100];
    char temp[100];
    int n = 0;

    gets(in);
    while(strlen(in) != 1){
        scanf("%d", &n);
        if(n > strlen(in)){
            in[strlen(in)-1] = NULL;
        }
        else{
            int j = 0;
            for(int i = 0; i <= strlen(in); i++){
                if(i+1 != n)    temp[j++] = in[i];
            }
            strcpy(in, temp);
        }

        printf("%s \n", in);

    }
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=244&sca=10f0

//문자열 2 : 자가진단 6
#include <bits/stdc++.h>
using namespace std;

int main()
{
    char a[100];
    char b[100];
    char temp[100]={0,};

    scanf("%s %s", &a, &b);
    for(int i = 0; i < 2; i++){
        b[i] = a[i];
        temp[i] = a[i];
    }
    strcat(b, temp);
    printf("%s", b);

}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=245&sca=10f0

//문자열 2 : 자가진단 7
#include <bits/stdc++.h>
using namespace std;

int main()
{
    char in[100];
    gets(in);

    if(strchr(in, 'c') != 0)   printf("YES ");
    else    printf("NO ");

    if(strstr(in, "ab") != NULL)   printf("YES ");
    else    printf("NO ");
}

//문자열 2 : 자가진단 7
#include <bits/stdc++.h>
using namespace std;

int main()
{
    char in[100];
    int flag = 0, flag_2 = 0;

    gets(in);
    for(int i = 0; i < strlen(in); i++){
        if(in[i] == 'c'){
            flag = 1;
        }

        else if(in[i] == 'a'){
            if(in[i+1] == 'b'){
                flag_2 = 1;
            }
        }
    }
    if(flag == 1)   printf("YES ");
    else    printf("NO ");

    if(flag_2 == 1)   printf("YES ");
    else    printf("NO ");
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=246&sca=10f0

//문자열 2 : 자가진단 8
#include <bits/stdc++.h>
using namespace std;

int str_com(char a[], char b[]){
    for(int i = 0; i <= 100; i++){
        if(a[i] > b[i]) return 1;
        else if(a[i] < b[i]) return -1;
    }
}

int main()
{
    char a[100], b[100], c[100];

    scanf("%s %s %s", &a, &b, &c);
    int res = str_com(a, b);
    int res_2 = 0;

    if(res == 1){
        if(str_com(b, c) == 1) printf("%s \n",c );
        else printf("%s \n",b );
    }
    else{
        if(str_com(a, c) == 1) printf("%s \n", c);
        else printf("%s \n", a);
    }

}

//문자열 2 : 자가진단 8
#include <bits/stdc++.h>
using namespace std;
int main()
{
    char a[100], b[100], c[100];

    scanf("%s %s %s", &a, &b, &c);
    int res = strcmp(a, b);
    int res_2 = 0;

    if(res > 0){
        if(strcmp(b, c) > 0) printf("%s \n",c );
        else printf("%s \n",b );
    }
    else{
        if(strcmp(a, c) > 0) printf("%s \n", c);
        else printf("%s \n", a);
    }

}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=236&sca=10e0

#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
    int i,len;
    char s[101];
    scanf("%s",s);
    len=strlen(s);
    for(i=0;i<len;i++){
        if(isalpha(s[i])){
            s[i]=toupper(s[i]);
            printf("%c",s[i]);
        }
    }
    printf("\n");
    return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=237&sca=10e0

#include <stdio.h>
#include <string.h>
int main()
{
    int i,a=0,len;
    char s[101];
    gets(s);
    len=strlen(s);
    for(i=0;i<len;i++){
        if(s[i]== ' ')
            a++;
    }
    printf("%d\n",a+1);
    return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=235&sca=10e0

//문자열1 - 자가진단6
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
    int i,b,c;
    char a;
    while(1){
        scanf(" %c",&a);
        if(isalpha(a))
        {
            printf("%c \n",a);
        }
        else if('0'<=a&&a<='9')
        {
            printf("%d \n",a);
        }
        else
        {
            return 0;
        }
    }
    return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=245&sca=10f0

#include<bits/stdc++.h>
int main()
{
    char s[100];
    int c,l,i,c2;
    gets(s);
    l=strlen(s);
    c=0; c2=0;
    for(i=0; i<l; i++){
        if(s[i]=='c')c=1;
        if(s[i]=='a' && s[i+1]=='b')c2=1;
    }
    if(c==1)printf("yes");
    if(c==0)printf("no");
    if(c2==1)printf("yes");
    if(c2==0)printf("no");
	return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=246&sca=10f0

#include<bits/stdc++.h>
using namespace std;
/*
609 : 문자열2 - 자가진단8
세 개의 단어를 입력받아 아스키코드(사전) 순으로 가장 먼저 나오는 단어를 출력하는 프로그램을 작성하시오.
각 단어의 길이는 1이상 10 이하이다.
입력 예
cat dog cow
출력 예
cat
*/

int main()
{
    vector<string> v;
    char a[104][104];
    int i,k=0;
    for(i=0; i<3; i++){
        string st;
        cin >> st;
        v.push_back(st);
    }

    for(i=0; i<v.size(); i++){
        if(v[i] < v[k]){
            k=i;
        }
    }
    cout << v[k];

    sort(v.begin(),v.end());
    cout << v[0];
	return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=247&sca=10f0

#include<bits/stdc++.h>
using namespace std;
/*
610 : 문자열2 - 자가진단9
5개의 문자열을 입력받아 문자열 크기(아스키코드) 역순으로 정렬하여 출력하는 프로그램을 작성하시오.
주어지는 문자열의 길이는 20자 미만이다.
입력 예
Jungol
Korea
information
Monitor
class
출력 예
information
class
Monitor
Korea
Jungol
*/

int main()
{
    int i,j;
    char t[104],a[104][104];
    for(i=0; i<5; i++){
        scanf("%s",a[i]);
    }
    //sort(a,a+5);

    for(i=0; i<5; i++){
        for(j=0; j<5; j++){
            if(strcmp(a[i],a[j])>0){
                strcpy(t,a[i]);
                strcpy(a[i],a[j]);
                strcpy(a[j],t);
            }
        }
    }

    for(i=0; i<5; i++){
        printf("%s\n",a[i]);
    }
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
/*
610 : 문자열2 - 자가진단9
5개의 문자열을 입력받아 문자열 크기(아스키코드) 역순으로 정렬하여 출력하는 프로그램을 작성하시오.
주어지는 문자열의 길이는 20자 미만이다.
입력 예
Jungol
Korea
information
Monitor
class
출력 예
information
class
Monitor
Korea
Jungol
*/
bool com(string a, string b)
{
    return a>b;
}
int main()
{
    int i,j;
    vector <string> v;
    char t[104],a[104][104];
    for(i=0; i<5; i++){
        cin >> a[i];
        string s(a[i]);
        v.push_back(s);
    }

    sort(v.begin(),v.end(),com);

    for(i=0; i<5; i++){
        cout << v[i] << "\n" ;
    }

	return 0;
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=227&sca=10d0

함수3 - 자가진단4

#include<bits/stdc++.h>
using namespace std;
int d[1004];
void f(int n,int k,int pre){
    int i;
    if(k==n){
        for(i=0; i<n; i++){
            printf("%d ",d[i]);
        }
        printf("\n");
        return;
    }
    for(i=pre; i<=6; i++){
        d[k]=i;
        f(n,k+1,i);
    }
}

int main()
{
    int n;
    scanf("%d",&n);
    f(n,0,1);
	return 0;
}