PPXppx

摘要： "洛咕" 题意:给定一个$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char 阅读全文

摘要： "洛咕" 题意:小K总共有$n(n=c$,第二种形如$X_a X_b include include include include include include include define ll long long using namespace std; inline int read(){ 阅读全文

摘要： "洛咕" 题意:约翰有n块草场，编号1到n，这些草场由m条单行道相连.贝西总是从1号草场出发，最后回到1号草场.她想经过尽可能多的草场，贝西在通一个草场只吃一次草，所以一个草场可以经过多次.因为草场是单行道连接，这给贝西的品鉴工作带来了很大的不便，贝西想偷偷逆向行走一次，但最多只能有一次逆行.问，贝 阅读全文

摘要： "洛咕" "双倍经验" "三倍经验" 题意:煤矿工地可以看成是由$n(n include include include include include include include define ll long long using namespace std; inline int read( 阅读全文

摘要： "洛咕" "双倍经验" 题意:给定$N(N include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1; 阅读全文

摘要： 题意:$n$行$m$列的矩阵$(n,m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;ch 阅读全文

该文被密码保护。 阅读全文

该文被密码保护。 阅读全文

摘要： "POJ 数据弱" "POJ 数据强" 题意:数独不解释了.两道题的输入输出有点差别,自己看一下题面. 分析:对每一行,每一列,每个格子都用一个九位的二进制数表示,初始化每一位都为1,然后每一次从状态最少的开始搜索,对于一个点$(i,j)$,$val=line[i]$&$lie[j]$&$ge[(i 阅读全文

摘要： "洛咕" 题意:有一个序列$a_n$和若干操作: $\mathrm{1\ l \ r \ }$ 求$a_l$到$a_r$的和 $\mathrm{2\ l \ r \ val \ }$ 将$a_l$到$a_r$赋值为$\mathrm{val}$ $\mathrm{3\ l \ r \ val\ }$将 阅读全文