摘要：
给你一个n个初始元素都为1的序列和m个询问q。 询问格式为：l r x(x为2or3) 最后求1~n所有数的GCD GCD：把每个数分别分解质因数，再把各数中的全部 公有质因数 提取出来连乘，所得的积就是这几个数的最大公约数。 include include include include incl 阅读全文
摘要：
【前后缀枚举】 阅读全文
摘要：
``` include include include include include include include include include include include include include include include include include include de 阅读全文
摘要：
【例题】 1.POJ Drainage Ditches 【最大流EK算法模板】 include include include include include include include include include include include include include includ 阅读全文