API Response (JSON)
{
"problem": {
"name": "[蓝桥杯 2018 省 B] 递增三元组",
"description": {
"content": "给定三个整数数组 $A = [A_1, A_2,\\cdots, A_N]$,$B = [B_1, B_2,\\cdots, B_N]$,$C = [C_1, C_2,\\cdots,C_N]$。 请你统计有多少个三元组 $(i, j, k)$ 满足: 1. $1 \\le i, j, k \\le N$ 2. $A_i < B_j < C_k$",
"description_type": "Markdown"
},
"platform": "Luogu",
"limit": {
"time_limit": 1000,
"memory_limit": 262144
},
"difficulty": {
"LuoguStyle": "P3"
},
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "LGP8667"
},
"statements": [
{
"statement_type": "Markdown",
"content": "给定三个整数数组 $A = [A_1, A_2,\\cdots, A_N]$,$B = [B_1, B_2,\\cdots, B_N]$,$C = [C_1, C_2,\\cdots,C_N]$。\n\n请你统计有多少个三元组 $(i, j, k)$ 满足:\n1. $1 \\le i, j, k \\le N$ \n2. $A_i < B_j < C_k$\n\n## Input\n\n第一行包含一个整数 $N$。\n\n...",
"is_translate": false,
"language": "English"
}
]
}