Help me to find where my program fails

help
1

//Radhe Radhe
#include<bits/stdc++.h>
using namespace std;
define ll long long int
void Radhe(){
ll t;
cin>>t;
while(t–){
ll x;
cin>>x;
if(x==1)cout<<-1<<endl;
else {
x-=1;
ll y = sqrtl(x);
ll w = 1+ x - (1LLyy);
cout<<y<<" “<<y<<” "<<w<<endl;
}

}
}
int main(){
Radhe();
return 0;
}
statement link

2

@jaggadaku005
heyy plzz refer my c++ solution

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<algorithm>
#include<numeric>

using namespace std;
typedef long long int lli;
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//typedef long long int lli;
//typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> multi_pbds;
//typedef tree<pair<int , int>, null_type, less<pair<int ,int>>, rb_tree_tag, tree_order_statistics_node_update> pbdsp;
//typedef tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define nl "\n";
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define db long double
#define prq priority_queue<lli>
#define psq priority_queue<lli,vector<lli>,greater<lli>>
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define vlli vector<lli>
#define mslli multiset<lli>
#define inf 1e17
#define sp " "
#define pb push_back
#define pie 3.14159265358979323846
#define test lli t; cin>>t; while(t--)
void checkexist(lli n)
{
    set<lli> s;
    multiset<lli> s1;
    for(lli i=0;i<n;i++)
    {
        lli sm=0;
        sm+=i;
        s.insert(sm);
        if(!s1.count(sm))
        {
            s1.insert(sm);
        }

    }
}
void rev(string s , int id)
{
    if(id==s.size())
    {
        return ;
    }
    rev(s,id+1);
    cout<<s[id];
}
int32_t main()
{
   #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
        test{
            lli n;
            cin>>n;
            lli sq=sqrt(n);
            lli sq1=sq*sq;
            lli rem=n-sq1;
            lli up=1e6;
            lli sq2=sq*(sq+1);
            lli rem1=n-sq2;
            lli sq3=sq*(sq-1);
            lli rem2=n-sq3;
            if(rem>0&&rem<=up)
            {
                cout<<sq<<" "<<sq<<" "<<rem;
            }
            else if(rem1>0&&rem1<=up&&(sq+1)<=up)
            {
                cout<<sq<<" "<<sq+1<<" "<<rem1;
            }
            else if(rem2>0&&rem2<=up&&(sq-1)>0)
            {
                cout<<sq<<" "<<sq-1<<" "<<rem2;
            }
            else
                cout<<-1;
            cout<<endl;
        }
}
3

dipanshu bhaiya can you please give a test cases where my code is failing.

4

@jaggadaku005
the task is to keep the all three numbers between 1 and 1e6
so for this u have to consider all three cases like i did .
Just go through the code once.