摘要：
题意： "传送门" 给你$A,B,C$，要求你给出有多少对$(x, y)$满足$x\in [1,A],y\in [1,B]$，且满足以下任意一个条件：$x \& y C$或者$x \oplus y include include include include include include inc 阅读全文
摘要：
题意： 给你$A J$的字母组成的日期，形式为$yyyy/mm/dd$。现给你$n$个这样的串$(ninline int weekday(int y, int m, int d){ $\qquad$if(m include include include include include includ 阅读全文