摘要: #include using namespace std; int n, k; const int MOD = 1000000007; int a[105], cnt[5]; void solve() { int t; cnt[4]=n,cnt[2]=2*n; for(int i=0;i> n >> k; for (int i = 0; i > a[i]; ...阅读全文
posted @ 2017-08-14 14:49 UnderSilence 阅读(34) 评论(0) 编辑
摘要: /*CodeForces839D[莫比乌斯反演]*/ #include typedef long long LL; const LL MOD = 1000000007LL; using namespace std; int n, maxa = 0, mina = 0x3f3f3f3f; LL m[200005], F[1000005], f[1000005]; int sum[1000005]...阅读全文
posted @ 2017-08-14 14:41 UnderSilence 阅读(36) 评论(0) 编辑