For a better world

#include <iostream>

#define NUM 9
using namespace std;

int main(void)
{
	int Array[NUM] = {0,};
	int Max = 0;
	int Order = 0;
	
	for (int i=0; i<NUM; i++) // loop for input
	{
		cin >> Array[i];
	}
	
	for (int j=0; j<NUM; j++) // loop for checking boundary
	{
		if (Array[j] > 100)
		{
			return 0;
		}
	}
	
	for (int k=0; k<NUM; k++)
	{
		if (Array[k] >= Max)
		{
			Max = Array[k];
			Order = k+1;
		}
	}
	
	cout << Max << endl;
	cout << Order << endl;
	
	return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
	int A = 0;
	int B = 0;
	
	cin >> A >> B;
	
	if (A>0 and B<10)
	{
		cout << A+B << endl;
	}
	
	return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
	cout << "Hello World!" << endl;
	
	return 0;
}

import sys
from itertools import permutations

input = sys.stdin.readline
k = int(input())
inequal_sign = list(input().split())
max_value = pow(10, k+1) - 1
candidate = list()
nums = list(permutations([i for i in range(10)], k+1))
reversed_nums = reversed(nums)

for num in reversed_nums:
    if len(num) != len(set(num)):
        continue

    for n in range(len(num)-1):
        if inequal_sign[n] == "<":
            if not num[n] < num[n+1]:
                break
            
        elif inequal_sign[n] == ">":
            if not num[n] > num[n+1]:
                break
    else:
        candidate.append(num)
        break

for num in nums:
    if len(num) != len(set(num)):
        continue

    for n in range(len(num)-1):
        if inequal_sign[n] == "<":
            if not num[n] < num[n+1]:
                break
            
        elif inequal_sign[n] == ">":
            if not num[n] > num[n+1]:
                break
    else:
        candidate.append(num)
        break

print ("".join(map(str, list(candidate[0]))))
print ("".join(map(str, list(candidate[1]))))

import sys
input = sys.stdin.readline

unique_nums = list(map(int, input().split()))
verify_num = 0

for i in unique_nums:
    verify_num += pow(i, 2)

print (verify_num % 10)

import sys
input = sys.stdin.readline
N = int(input())
for i in range(N, 0, -1):
    value = "*" * i
    print (value.rjust(N, ' '))

import sys
input = sys.stdin.readline
N = int(input())
for i in range(N, 0, -1):
    print ("*"*i)

#include <iostream>

using namespace std;

int main(void)
{
	
	int N = 0;
	
	cin >> N;
	
	if (N>=1 and N<=100)
	{
		for (int i=1; i<=N; i++) // Count loop
		{
			for (int j=0; j<N-i; j++) // Print loop
			{
				cout << " ";
			}
			
			for (int k=0; k<i; k++)
			{
				cout << "*";
			}
			
			cout << '\n';
		}
	}
	
	return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
	int N = 0;
	char array = {0,};
	
	cin >> N;
	
	if (N>=1 and N<=100)
	{
		for (int i=1; i<=N; i++) // N번째 줄 
		{
			for (int j=1; j<=i; j++) // N개의 별 
			{
				cout << "*";
			}
			cout << '\n';
		}
	}
	
	return 0;
}

오답

import sys
input = sys.stdin.readline

def get_dwarfs(start):
    if len(picked) == 7 and sum(picked) == 100:
        for i in picked:
            print (i)
        return 
    for i in range(start, len(heights)):
        picked.append(heights[i])
        get_dwarfs(i+1)
        picked.pop()
            
heights = []
picked = []
for _ in range(9):
    heights.append(int(input()))
get_dwarfs(0)

정답

import sys
input = sys.stdin.readline

def get_dwarfs():
    if len(picked) == 7 and sum(picked) == 100:
        picked.sort()
        for i in picked:
            print (i)
        exit() 
    
    for i in range(len(heights)):
        if heights[i] not in picked:
            picked.append(heights[i])
            get_dwarfs()
            picked.pop()
            
heights = []
picked = []
for _ in range(9):
    heights.append(int(input()))
get_dwarfs()