class="property-title">time limit per test1 second

memory limit per test

256 megabytes

Input

Sup, gimme a single integer $$$x$$$ ($$$1 \le x \le 4$$$) homie uwu :3

Output

If $$$x = 1$$$, spit out some based code that, like when ya feed it two integers $$$a$$$ and $$$b$$$, it hands over their sum.

If $$$x = 2$$$, slap some based code that takes an integer $$$a$$$ and returns its absolute value like magic, no cap.

If $$$x = 3$$$, check this out: blaze some based code that grabs an integer $$$n$$$ ($$$1 \le n \le 50$$$) and an array $$$a$$$ of $$$n$$$ distinct integers, then flexes the maximum value real quick.

If $$$x = 4$$$, toss me some based code that snatches an integer $$$n$$$ ($$$1 \le n \le 50$$$), an array $$$a$$$ of $$$n$$$ distinct integers and an integer $$$k$$$ ($$$1 \le k \le n$$$), then nails down that $$$k$$$-th largest value in the array. Get it, fam!

Note

Slide into the "My Submissions" page and vibe check ur code by clicking on its ID. You'll see just how based or cringe it is.

17:T705,

You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer n. The goal is to replace each question mark with some positive integer from

✓	#	Name		✎	Rating↕	Solved↕
	1952J	Help, what does it mean to be "Based" *special brute force constructive algorithms expression parsing implementation sortings			unrated	910
	663A	Rebus constructive algorithms expression parsing greedy math			1800	3.8k

Problemset