API Response (JSON)
{
"problem": {
"name": "C. Magic Odd Square",
"description": {
"content": "Find an _n_ × _n_ matrix with different numbers from 1 to _n_2, so the sum in each row, column and both main diagonals are odd.",
"description_type": "Markdown"
},
"platform": "Codeforces",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "CF710C"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Find an _n_ × _n_ matrix with different numbers from 1 to _n_2, so the sum in each row, column and both main diagonals are odd.\n\n## Input\n\nThe only line contains odd integer _n_ (1 ≤ _n_ ≤ 49).\n\n## Ou...",
"is_translate": false,
"language": "English"
},
{
"statement_type": "Markdown",
"content": "请构造一个 #cf_span[n × n] 的矩阵,其中包含从 #cf_span[1] 到 #cf_span[n2] 的不同整数,使得每一行、每一列以及两条主对角线的交错和均为奇数。\n\n输入仅一行,包含一个奇整数 #cf_span[n] (#cf_span[1 ≤ n ≤ 49])。\n\n请输出 #cf_span[n] 行,每行包含 #cf_span[n] 个整数。所有整数必须互不相同,且范围在 #...",
"is_translate": true,
"language": "Chinese"
},
{
"statement_type": "Markdown",
"content": "**Definitions** \nLet $ n \\in \\mathbb{Z} $ be an odd integer with $ 1 \\leq n \\leq 49 $. \nLet $ A = (a_{i,j}) \\in \\mathbb{Z}^{n \\times n} $ be an $ n \\times n $ matrix.\n\n**Constraints** \n1. The entri...",
"is_translate": false,
"language": "Formal"
}
]
}