Codeforces Round #797 (Div. 3)(A. Print a Pedestal (Codeforces logo?))

 

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n,tst;

    cin>>tst;

    while(tst--)

    {

        cin>>n;

        ll lo=n-3,arr[9];

        arr[0]=arr[1]=arr[2]=lo/3;

        lo=lo-((lo/3)*3);

        if(lo==2) arr[0]++,arr[1]++;

        if(lo==1) arr[1]++;

        arr[0]+=1;

        arr[1]+=2;

        cout<<arr[0]<<" "<<arr[1]<<" "<<arr[2]<<endl;

    }

    return 0;

}

///Alhamdulillah 

Problem Link: https://codeforces.com/contest/1690/problem/A