摘要：
#include using namespace std; typedef long long ll; ll f[30][30][30]; ll n; int main() { while (~scanf("%lld",&n)) { f[0][1][1]=1; for (int i=1... 阅读全文
摘要：
#pragma GCC optimize(3,"Ofast","inline") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll maxn=1000005; int prime[maxn/10],phi[maxn]; bool vis[maxn]; int tot; inline int gc 阅读全文