# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68097 | MatheusLealV | Chessboard (IZhO18_chessboard) | C++17 | 561 ms | 60864 KiB |
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 N 100050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
ll n, k, x[N], y[N], xf[N], yf[N];
long long ans = (2000000000000000000ll);
vector<ll> d;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n>>k;
for(int i = 1; i <= k; i++) cin>>x[i]>>y[i]>>xf[i]>>yf[i];
for(int i = 1; i <= k; i++) x[i] --, y[i] --, xf[i] --, yf[i] --;
for(int i = 1; i <= sqrt(n); i++)
{
if((n % i) != 0) continue;
d.push_back(i);
# | 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... |