# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172750 | muhammad_hokimiyon | Chessboard (IZhO18_chessboard) | C++14 | 173 ms | 6844 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>
//#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 2e5 + 7;
const int M = 23;
const int mod = 998244353;
ll n,k;
ll A[N];
ll B[N];
ll C[N];
ll D[N];
void solve1()
{
cin >> n >> k;
vector < int > div;
for( int i = 1; i < n; i++ ){
if( n % i == 0 )div.push_back(i);
}
for( int i = 0; i < k; i++ ){
cin >> A[i] >> B[i] >> C[i] >> D[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... |