【题目链接】:click here~~ 【题目大意】: Bazinga Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 39 Accepted Submission(s): 15 Problem Descri
【题目链接】:click here~~ Pagodas Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 15 Accepted Submission(s): 14 Problem Description
F. Half Mixed 题面: 题目链接:F. Half Mixed 简要题意: 给出 n , m n,m n,m, 求构造 n n n 行 m m m 列 只包含 0 , 1 {0,1} 0,1 的数列,要求全部纯净块的数量 = 全部混合块的数量。纯净块指子矩形内所有数字要么全部是 0 0 0 ,要么全部是 1 1 1,而混合块则相反:子矩形内要包括 0 , 1 {0