Can anyone tell where this code will fail ?
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pqb priority_queue
#define pqs priority_queue<int,vi,greater >
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define light ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using vi = vector;
using vvi = vector;
using vvvi = vector;
using mii = map<int, int>;
using pii = pair<int, int>;
const long long M = 1e9 + 7;
void io() {
#ifndef ONLINE_JUDGE
freopen(“input.txt”, “r”, stdin);
freopen(“o.txt”, “w”, stdout);
#endif
}
int calc(vi temp)
{
int n = temp.size();
sort(all(temp));
if (n & 1)
return temp[n / 2];
else
return temp[(n - 1) / 2];
}
int lcm(int x, int y, int z)
{
int t1 = x * y / (__gcd(x, y));
int t2 = t1 * z / (__gcd(t1, z));
return max(t1, t2);
}
bool comp(pii a, pii b)
{
return a.ss < b.ss;
}
int check(int n, int t)
{
int s1 = 0;
while (t) {
s1 += t % 10;
t /= 10;
}
int s2 = 0;
while (n)
{
s2 += n % 10;
n /= 10;
}
return s1 % 2 != s2 % 2;
}
void solve()
{
int n, x;
cin >> n >> x;
int p1 = n * x;
if (n & 1)
{
int st = 1;
int k = n - 1;
while (k)
{
cout << st << " " << -st << " ";
st++;
k -= 2;
}
cout << p1 << endl;
}
else {
int k = n - 2;
int st = 1;
while (k)
{
cout << st << " " << -st << " ";
st++;
k -= 2;
}
cout << -st << " " << p1 + st << endl;
}
}
int32_t main()
{
io();
light;
int tc = 1;
int tt = 1;
cin >> tc;
while (tc--) {
solve();
}
}
,