nike0good |Oier&ACMer | 熟能生巧

B - Cut .0C - Enumerate SequencesD - PedometerE - Permute K timesF - Rearrange QueryYou are given sequences of positive integers of length NNN: A=(A1,A2,…,AN)A=(A_1,A_2,\ldots,A_N)A=(A1​,A2​,…,AN​) and B=(B1,B2,…,BN)B=(B_1,B_2,\ldots,B_N)B=(B1​,B2

题目：给n个不超过m的素数，求xor和=0的方案数，FWT变换裸题。 题目2关于F逆元的公式： inv(2)=(F+1)>>1inv(2)=(F+1)>>1 证：[(F+1)>>1]∗2(modF)=F+1(modF)=1 [(F+1)>>1]*2 \pmod F=F+1 \pmod F =1 代码：#include<bits/stdc++.h> using namespace std;#

A Count Circles描述 Stupid Aguin feels confused while reading. The book shows following equations: 6=9 , 8=1010 , 144=75 , 690=801 Stupid Aguin doesn’t know why and he asks RoyYuan for help. R

Anthony 手中有 nnn 个依次标着整数 a1a1a_1, a2a2a_2, ⋯⋯\cdots, anana_n (0≤a1≤a2≤⋯≤an≤630≤a1≤a2≤⋯≤an≤630 \leq a_1 \leq a_2 \leq \cdots \leq a_n \leq 63) 的球，现在 Ben 会等概率随机抽出一个球，记录球上的数字并放回，重复该过程三次，最终三次记录下的数字的异或和就是 B...