# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378557 | daniel920712 | Chessboard (IZhO18_chessboard) | C++14 | 2085 ms | 161260 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <set>
using namespace std;
vector < long long > have;
long long con1[100005];
long long con2[100005];
map < pair < long long , long long > , long long > con[100005];
set < pair < long long , long long > > vis;
int main()
{
long long N,M,ans=1e18,t,a,b,c,d,i,j,k,x,y;
scanf("%lld %lld",&N,&M);
for(i=1;i<N;i++)
{
if(N%i==0)
{
have.push_back(i);
con1[i]=(N/i)*(N/i)/2;
con2[i]=(N/i)*(N/i)/2+(N/i)*(N/i)%2;
//printf("%lld %lld %lld\n",i,con1[i],con2[i]);
}
}
while(M--)
{
scanf("%lld %lld %lld %lld",&a,&b,&c,&d);
Compilation message (stderr)
# | 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... |