This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k, x;
ll xx1, yy1, xx2, yy2;
vector <ll> d;
void fil()
{
}
int main()
{
	cin >> n >> k;
	for ( int i = 1; i <= k; i ++ ) {
		cin >> xx1 >> yy1 >> xx2 >> yy2;
	}
	for ( int i = n-1; i >= 1; i -- ){
		if ( n % i == 0 ) {
			x = i;
			break;
		}
	}
	if ( x == 1 ) {
		cout << (n*n) / 2;
		return 0;
	}
	if ( n % 2 == 0 ) {
		cout << (x*x) * (n / x);
	}
	else {
		cout << (x*x) * (n / x + 1);
	}
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |