Gas tank

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

// Debug printing
#ifdef DEBUG
#define deb(fmt, args...) printf("DEBUG: %d: " fmt, __LINE__, ##args)
#define debug_print(fmt, args...) printf(fmt, ##args)
#else
#define deb(fmt, args...)
#define debug_print(fmt, args...)
#endif

void print_array(vector<int> in, const string title = "Vector")
{
	debug_print("DEBUG: %s [\nDEBUG: ", title.c_str());
	for (unsigned int i = 0; i < in.size(); i++) {
		debug_print("%d ", in[i]);
	}
	debug_print("\nDEBUG: ] END\n");
}

void print_matrix(vector<vector<int>> in, const string title = "Matrix")
{
	debug_print("DEBUG: %s [\nDEBUG: ", title.c_str());
	for (unsigned int i = 0; i < in.size(); i++) {
		for (unsigned int j = 0; j < in[i].size(); j++) {
			debug_print("%d ", in[i][j]);
		}
		debug_print("\nDEBUG: ");
	}
	debug_print("DEBUG: ] END\n");

}


int binary_search(vector<int> &nums, int low, int high, int x)
{
	while (low <= high) {
		int mid = low + (high - low) / 2;

		// Check if x is present at mid
		if (nums[mid] == x)
			return mid;

		// If x greater, ignore left half
		if (nums[mid] < x) {
			low = mid + 1;
		}

		// If x is smaller, ignore right half
		else {
			high = mid - 1;
		}
	}

	// If we reach here, then element was not present
	return -1;
}

int main(int argc, char *argv[])
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	// Read the input parameters
	ll n;
	cin >> n;

	// for (int a = 0; a < n; a++) {
	// 	for (int b = 0; b < n; b++) {
	// 		
	// 	}
	// }

	double err = 0.000000001;
	while(n > 0) {
		for (ll a = 1; a < n; a++) {
			double b = 1.0 * a * a;
			ll c = -n;
			long double res = (1.0 * -b + sqrt(b * b - 1.0 * 4 * a * c)) / (2 * a);
			long double area = a*a * res + res * res * a;
			if (area < sqrt(n)) {
				a++;
				continue;
			}
			long double tmp = res;
			long double rounded = round(res);
			// if (a*a*rounded + rounded*rounded*a > n) {
			// 	break;
			// }
			// deb("a: %d, res: %f, tmp: %f, rounded: %f\n", a, res, tmp, round(res));
			if (abs(tmp - round(res)) <= err) {
				cout << a << " " << (ll)rounded << "\n";
				return 0;
			}
			// long double area = a*a * res + res * res * a;
			// if (area < sqrt(n)) {
			// 	area += 2;
			// }
		}
		n--;
	}

	return 0;
}

/*
 *

	while(n > 0) {
		// for (ll a = 1; a < n; a++) {
			ll a = low + (high - low) / 2;
			double b = 1.0 * a * a;
			ll c = -n;
			long double res = (1.0 * -b + sqrt(b * b - 1.0 * 4 * a * c)) / (2 * a);
			long double tmp = res;
			long double rounded = round(res);
			// if (a*a*rounded + rounded*rounded*a > n) {
			// 	break;
			// }
			// deb("a: %d, res: %f, tmp: %f, rounded: %f\n", a, res, tmp, round(res));
			if (abs(tmp - round(res)) <= err) {
				cout << a << " " << (ll)rounded << "\n";
				return 0;
			}

			long double area = a*a * res + res * res * a;


			// If x greater, ignore left half
			if (area < n) {
				low = a + 1;
			}

			// If x is smaller, ignore right half
			else {
				high = a - 1;
			}
	n--;
}
*/

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: TIME LIMIT EXCEEDED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: TIME LIMIT EXCEEDED

Test 40

Verdict: TIME LIMIT EXCEEDED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: TIME LIMIT EXCEEDED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: TIME LIMIT EXCEEDED

Test 51

Verdict: TIME LIMIT EXCEEDED

Test 52

Verdict: TIME LIMIT EXCEEDED

Test 53

Verdict: TIME LIMIT EXCEEDED

Test 54

Verdict: TIME LIMIT EXCEEDED

Test 55

Verdict: TIME LIMIT EXCEEDED

Test 56

Verdict: TIME LIMIT EXCEEDED

Test 57

Verdict: TIME LIMIT EXCEEDED

Test 58

Verdict: TIME LIMIT EXCEEDED

Test 59

Verdict: TIME LIMIT EXCEEDED

Test 60

Verdict: TIME LIMIT EXCEEDED

Test 61

Verdict: TIME LIMIT EXCEEDED

Test 62

Verdict: TIME LIMIT EXCEEDED

Test 63

Verdict: TIME LIMIT EXCEEDED

Test 64

Verdict: TIME LIMIT EXCEEDED

Test 65

Verdict: TIME LIMIT EXCEEDED

Test 66

Verdict: TIME LIMIT EXCEEDED

Test 67

Verdict: TIME LIMIT EXCEEDED

Test 68

Verdict: TIME LIMIT EXCEEDED

Test 69

Verdict: TIME LIMIT EXCEEDED

Test 70

Verdict: TIME LIMIT EXCEEDED

Test 71

Verdict: TIME LIMIT EXCEEDED

Test 72

Verdict: TIME LIMIT EXCEEDED

Test 73

Verdict: TIME LIMIT EXCEEDED

Test 74

Verdict: TIME LIMIT EXCEEDED

Test 75

Verdict: TIME LIMIT EXCEEDED

Test 76

Verdict: TIME LIMIT EXCEEDED

Test 77

Verdict: TIME LIMIT EXCEEDED

Test 78

Verdict: TIME LIMIT EXCEEDED

Test 79

Verdict: TIME LIMIT EXCEEDED

Test 80

Verdict: TIME LIMIT EXCEEDED