The 2025-2026 ICPC RSU High School Programming Contest

Problem Statement

Write a program that reads a person's name and prints a greeting message.

Input

A single line containing a person's name (string with no spaces).

Output

Print "Hello, [name]!" where [name] is the input name.

Sample Input

Alice

Sample Output

Hello, Alice!

Solution Approach

Read the input string and use basic string concatenation or printf/println statements to format and print the greeting message.

Problem Statement

Given the length and width of a rectangle, calculate and print its area.

Input

Two space-separated integers representing the length and width of the rectangle (both between 1 and 1000).

Output

A single integer representing the area of the rectangle.

Sample Input

5 10

Sample Output

50

Solution Approach

Read two integers for length and width, multiply them together to get the area, and print the result.

Problem Statement

Read N integers and calculate the sum of all these numbers using a loop.

Input

The first line contains an integer N (1 ≤ N ≤ 100). The second line contains N space-separated integers.

Output

A single integer representing the sum of all N numbers.

Sample Input

4
10 20 30 40

Sample Output

100

Solution Approach

Initialize a variable sum to 0, then use a loop to iterate through all N numbers. In each iteration, add the current number to the sum. After the loop completes, print the sum.

Problem Statement

Read an array of integers and find the maximum (largest) element in the array.

Input

The first line contains an integer N (1 ≤ N ≤ 100). The second line contains N space-separated integers (-1000 ≤ each integer ≤ 1000).

Output

A single integer representing the maximum element in the array.

Sample Input

5
12 45 23 89 34

Sample Output

89

Solution Approach

Initialize max variable to the first element of the array. Then iterate through the remaining elements, comparing each one with max. If an element is greater than max, update max. After the loop, print max.

Problem Statement

Find the Greatest Common Divisor (GCD) of two numbers using Euclid's algorithm.

Input

Two space-separated positive integers A and B (1 ≤ A, B ≤ 10000).

Output

A single integer representing the GCD of A and B.

Sample Input

48 18

Sample Output

6

Solution Approach

Euclid's algorithm: GCD(a, b) = GCD(b, a % b). Keep replacing (a, b) with (b, a % b) until b becomes 0. When b is 0, a is the GCD.

Problem Statement

Print a triangle pattern of numbers where the i-th row contains numbers from 1 to i.

Input

A single integer N representing the number of rows (1 ≤ N ≤ 10).

Output

N lines of output where the i-th line contains numbers from 1 to i, separated by spaces.

Sample Input

4

Sample Output

1
1 2
1 2 3
1 2 3 4

Solution Approach

Use nested loops: the outer loop iterates from 1 to N (rows), and the inner loop iterates from 1 to the current row number (columns). Print each number followed by a space, and start a new line after each row.