【codeforces454div2】A. Masha and Bears

A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It’s known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car.

Masha came to test these cars. She could climb into all cars, but she liked only the smallest car.

It’s known that a character with size a can climb into some car with size b if and only if a ≤ b, he or she likes it if and only if he can climb into this car and 2a ≥ b.

You are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.

Input
You are given four integers V1, V2, V3, Vm(1 ≤ Vi ≤ 100) — sizes of father bear, mother bear, son bear and Masha, respectively. It’s guaranteed that V1 > V2 > V3.

Output
Output three integers — sizes of father bear’s car, mother bear’s car and son bear’s car, respectively.

If there are multiple possible solutions, print any.

If there is no solution, print “-1” (without quotes).

Examples
input
50 30 10 10
output
50
30
10
input
100 50 10 21
output
-1

注意：Masha只喜欢最小的车，中车大车都不喜欢，得出隐藏不等式2*size(masha)< size(中车)，所以需要size(中车)尽量大。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main ()
{
    int a, b, c, d;
    cin>>a>>b>>c>>d;
    if(d>2*c||c>2*d||d>=b)
    {
        puts("-1");
    }
    else
        printf("%d\n%d\n%d\n", 2*a,2*b,max(c,d));
    return 0;
}