dfkjdkfjkdf

从 Trac 迁移的文章

这是从旧校内 Wiki 迁移的文章，可能存在一些样式问题，您可以向 memset0 反馈。

原文章内容如下：

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
mt19937 mrand(random_device{}()); 
const ll MOD=1000000007;
int rnd(int x) { return (int)mrand() % x;}
ll mul(ll a,ll b){return (a*b-(ll)(a/(long double)MOD*b+1e-3)*MOD+MOD)%MOD;}
ll powmod(ll a,ll b) {ll res=1;a%=MOD; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
// head
int main(){

}

#include

using namespace std;

#define rep(i,a,n) for (int i=a;i

#define pb push_back

#define mp make_pair

#define fi first

#define se second

#define sz(x) ((int)(x).size())

typedef vector VI;

typedef long long ll;

typedef pair PII;

mt19937 mrand(random_device{}());

const ll MOD=1000000007;

int rnd(int x) { return (int)mrand() % x;}

ll mul(ll a,ll b){return (a*b-(ll)(a/(long double)MOD*b+1e-3)*MOD+MOD)%MOD;}

ll powmod(ll a,ll b) {ll res=1;a%=MOD; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}

// head

int main(){

}

附加文件