Submission #6494130

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  long long s; cin >> s;
  if (s <= 1000000000) {
    cout << "0 0 1 0 0 " << s << '\n';
    return 0;
  }
  long long x1_y2 = ceil(sqrt(s));
  long long x2y1 = x1_y2 * x1_y2 - s;
  for (long long x2 = 1; x2 <= 1000000000; ++x2) {
    if (x2y1 % x2 == 0 && x2y1 / x2 <= 1000000000) {
      long long y1 = x2y1 / x2;
      if (x1_y2 == x2 && x1_y2 == y1) continue;
      cout << "0 0 " << x1_y2 << ' ' << y1 << ' ' << x2 << ' ' << x1_y2 << '\n';
      return 0;
    }
  }
  assert(false);
}

Submission Info

Judge Result