Submission #8933967
Source Code Expand
#include <cstdio>
typedef long long LL;
const int MX = 10005, MP = 2005;
const int MN = 505;
bool ip[MX];
int p[MP], pc;
inline void Sieve(int N) {
for (int i = 2; i <= N; ++i) {
if (!ip[i]) p[++pc] = i;
for (int j = 1, k; j <= pc; ++j) {
if ((k = p[j] * i) > N) break;
ip[k] = 1;
if (i % p[j] == 0) break;
}
}
}
int N, A[MN], B[MN];
int main() {
Sieve(10000);
scanf("%d", &N);
for (int i = 1; i <= N; ++i) A[i] = p[i & 1 ? i / 2 + 1 : N + N - i / 2 + 1];
for (int i = 1; i <= N; ++i) B[i] = p[(i & 1 ? N - i / 2 : N + i / 2) + (N & 1)];
A[0] = A[N + 1] = B[0] = B[N + 1] = 1;
for (int i = 1; i <= N; ++i, puts(""))
for (int j = 1; j <= N; ++j)
if ((i + j) % 2) printf("%lld ", (LL)A[(i + j) / 2] * A[(i + j) / 2 + 1] * B[(N + i - j + (N & 1)) / 2] * B[(N + i - j + (N & 1)) / 2 + 1] + 1);
else printf("%d ", A[(i + j) / 2] * B[(N + i - j + (N & 1)) / 2]);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Modulo Matrix |
| User | PinkRabbit |
| Language | C++14 (GCC 5.4.1) |
| Score | 1100 |
| Code Size | 936 Byte |
| Status | AC |
| Exec Time | 29 ms |
| Memory | 3072 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 1100 / 1100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt |
| All | sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 1 ms | 128 KiB |
| test_01.txt | AC | 29 ms | 3072 KiB |
| test_02.txt | AC | 29 ms | 3072 KiB |
| test_03.txt | AC | 1 ms | 128 KiB |
| test_04.txt | AC | 1 ms | 128 KiB |
| test_05.txt | AC | 1 ms | 128 KiB |
| test_06.txt | AC | 15 ms | 1536 KiB |
| test_07.txt | AC | 2 ms | 256 KiB |