Submission #6491039

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << endl;
#else
#define DBG(X)
#define endl '\n'
#endif
 
using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const ll mod = 1e9 + 7;
const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }

void solve()
{
	ll s;
	cin >> s;

	ll sq = sqrt(s);
	ll C = 57;

	for(ll x1 = sq - C; x1 <= sq + C; ++x1)
	{
		if(x1 < 0)
			continue;

		for(ll y2 = sq - C; y2 <= sq + C; ++y2)
		{
			if(y2 < 0)
				continue;

			ll rem = x1 * y2 - s;

			for(ll d = 1; d * d <= rem; ++d)
			{
				if(rem % d == 0)
				{
					ll x2 = d;
					ll y1 = rem / d;

					if(x2 <= (ll)1e9 && y1 <= (ll)1e9)
					{
						cout << "0 0 " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;

#ifdef __LOCAL
						assert(x1 * y2 - x2 * y1 == s);
#endif

						exit(0);
					}
				}
			}
		}
	}
}

int main()
{
	fast_io();
	solve();

	return 0;
}

Submission Info

Judge Result