UVa 10257 - Dick and Jane

//\\__ hr1212 __//\\

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mi;

#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pi(a) printf("%d\n",a)
#define nl printf("\n");
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define f(i,a,b) for(i=a;i<b;i++)
#define rf(i,a,b) for(i=a;i>=b;i--)
#define clr(x,a) memset(x,a,sizeof(x))
#define MAX 1000100
#define MOD 1000000007

int n,m;

int main(){
    int r,k,i,c=0,x=0,y=0,j,t,l,z,x1=0,y1=0;
    ll ans=0;
    int s,p;
    while(scanf("%d%d%d%d",&s,&p,&y,&j)!=EOF)
    {
        int ages,agep,agey,d=12;
        agey=((d+j)-(p+y))/3;
        x=(d+j)-(p+y)-3*agey;
        if(x==0)
            printf("%d %d %d\n",agey+y,agey+p,agey);
        if(x==1){
            if(s+p!=y)
                printf("%d %d %d\n",agey+y,agey+p+1,agey);
            else
                printf("%d %d %d\n",agey+y+1,agey+p,agey);
        }
        if(x==2)
            printf("%d %d %d\n",agey+y+1,agey+p+1,agey);
    }
    return 0;
}