| Input file: | input.txt | Time limit: | 2 sec | |
| Output file: | output.txt | Memory limit: | 256 Mb |
Given the sequence of integers A1, A2, …, AN, find a number As such that there exists exactly one Am > As, and for all k ≠ m Ak ≤ As.
| No. | Input file (input.txt) |
Output file (output.txt) |
|---|---|---|
| 1 |
|
|
| 2 |
|
|
| Input file: | Standard input | Time limit: | 1 sec | |
| Output file: | Standard output | Memory limit: | 256 Mb |
Avengers defeated alien invaders and decided to eat some shawarma.
Hulk ordered N shawarmas. M shawarmen immediately started to cook his order. Each shawarman can cook his first shawarma in T minutes. Each next shawarma requires S minutes more to cook than the previous one.
HULK SMASHes!!! awaiting his shawarmas.
You should help Avengers to find out the time when all shawarmas ordered by Hulk will be ready and green giant will calm down. Of course, Jarvis could solve this task, but Iron Man's suit is broken and only air conditioner is working right now.
First line contains two integers N and M — number of shawarmas ordered by Hulk, and number of shawarmen who are going to complete his order.
Second line contains two integers T and S — time needed to cook the first shawarma and the difference of cooking time between two shawarmas in the row.
Print one integer — time needed to complete Hulk's order.
1 ≤ N, M, T ≤ 100
0 ≤ S ≤ 100
| No. | Standard input | Standard output |
|---|---|---|
| 1 |
|
|
| 2 |
|
|
| 3 |
|
|