For a better world

#include <iostream>
using namespace std;

int main(void)
{
	int T = 0;
	int A = 0;
	int B = 0;
	
	cin >> T;
	
	for (int i=0; i<T; i++)
	{
		cin >> A >> B;
		if (A>0 and B<10)
		{
			cout << "Case #" << i+1 << ": " << A+B << endl;	
		}
	}
	
	return 0;
}

import sys
import heapq
input = sys.stdin.readline

N = int(input())
lectures = []

for _ in range(N):
    start, end = list(map(int, input().split()))
    lectures.append([start, end])

lectures.sort(key = lambda x:x[0])
heap = []

heapq.heappush(heap, lectures[0][1])
for i in range(1, N):
    if heap[0] > lectures[i][0]:
        heapq.heappush(heap, lectures[i][1])
    else: # heap[0] <= lectures[i][0]
        heapq.heappop(heap)
        heapq.heappush(heap, lectures[i][1])

print (len(heap))

import sys
input = sys.stdin.readline
N = int(input())
limit = 10001
numbers = [0] * limit

for _ in range(N):
    num = int(input())
    numbers[num] +=1

for i in range(len(numbers)):
    if i !=0:
        for _ in range(numbers[i]):
            print (i)

#include <iostream>
using namespace std;

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

#include <stdio.h>

int main(void)
{
	int A = 0;
	int B = 0;
	
	while(true)
	{
		scanf("%d %d", &A, &B);	
		if(A == 0 and B == 0)
			break;
			
		printf("%d\n", A+B);
	}
	
	return 0;
	
}

#include <iostream>
using namespace std;

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

#include <stdio.h>

int main(void)
{
	int T = 0;
	int A = 0;
	int B = 0;
	
	scanf("%d\n", &T);
	
	for (int i=0; i<T; i++)
	{
		scanf("%d %d", &A, &B);
		if (A > 0 and B < 10)
		{
			printf("%d\n", A+B);
		}
	}
	
	return 0;
}

username = input()
print (username + '??!')

#include <iostream>
using namespace std;

int factorial(int N)
{	
	if (N<=1)
		return 1;
		
	return (N * factorial(N-1));	
}


int main(void)
{
	int N = 0;
	int result = 0;
	
	cin >> N;
	
	if (N>=0 and N<=12)
	{
		result = factorial(N);
		cout << result << endl;
	}
	
	return 0;
}

def fibonacci(n):
    if n == 1:
        return 1
    if n == 0:
        return 0

    return fibonacci(n-2) + fibonacci(n-1)

if __name__ == '__main__':
    n = int(input())
    value = fibonacci(n)
    print (value)