For a better world

#include <iostream>
// 몫과 나머지 계산 + 자연수 길이 구하기 
using namespace std;

int getIntLen(int value)
{
	int count = 0;

	do
	{
		value = int(value/10);
		count++;
	}while(value > 0);
	
	return count;
}


int main(void)
{
	// 세자리 자연수 
	int N1, N2 = 0;
	
	// 자연수 길이
	int L1, L2 = 0; 
	
	// 중간 계산 
	int N3, N4, N5 = 0;
		
	cin >> N1;
	cin >> N2;
	
	L1 = getIntLen(N1);
	L2 = getIntLen(N2);
	
	if (L1 == 3 and L2 == 3)
	{
		N3 = N1 * (N2 % 10);
		N4 = N1 * ((N2 / 10) % 10);
		N5 = N1 * ((N2 / 100));
		
		cout << N3 << endl;
		cout << N4 << endl;
		cout << N5 << endl;
		
		cout << N1 * N2 << endl;
	}
	
	return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
	int M = 0;
	int N = 0;
	
	int Count = 0;
	int Min = 0;
	int Sum = 0;
	int flag = true;

	cin >> M;
	cin >> N;
	
	if (M<=10000 and M>=1 and N<=10000 and N>=1) // initial condition
	{	
		for (int i=M; i<=N; i++) // M이상 N이하 자연수  
		{
			for (int j=1; j<=i; j++) // M까지의 수 
			{
				if (i % j == 0) // 소수 확인을 위해 M을 j로 나누어 Count를 계산 
				{
					Count = Count + 1;		 
				}
			}
			
			if (Count == 2) // 나누어지는게 1과 자기 자신 밖에 없는 소수라면 
			{
				Sum = Sum + i;
				
				if (flag)
				{
					Min = i;
					flag = false;	
				}
			}
			Count = 0;
		}
		
		if (Sum == 0)
		{
			cout << -1 << endl;
			return 0;
		}
		
		cout << Sum << endl;
		cout << Min << endl;
	}
	
	return 0;
}

#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;
}