株洲网站制作公司在哪里国外企业档案馆网站的特色

当前位置： 首页 > news >正文

株洲网站制作公司在哪里,国外企业档案馆网站的特色,网站建设价格明细表,ui设计岗位职责​​​​​​连接 目录 A:开开心心233 B:Square Game C:室温超导 F:necklace I:hard math J:radius K:tourist 补题中#xff0c;会给出大部分代码 A:开开心心233 签到题 #xff0c;无论二分还是解方程还是直接for循环枚举都能直接通过啦 signed main() {ios_base:…​​​​​​连接 目录 A:开开心心233 B:Square Game C:室温超导 F:necklace I:hard math J:radius K:tourist 补题中会给出大部分代码 A:开开心心233 签到题 无论二分还是解方程还是直接for循环枚举都能直接通过啦 signed main() {ios_base::sync_with_stdio(0); cin.tie(0),cout.tie(0);int n,m;cinnm; // cout-3sqrt(3*342(nm))\n;int res1n-(-3sqrt(3*342(nm)))/2;int res2n-(-3-sqrt(3*342(nm)))/2;if(res1nres10) coutres1;else coutres2; } B:Square Game #define f first #define s second const int N1e65; int f[N]; void init() {for(int i1;iN;i){int qsqrt(i);mapint,boolmp;if(q*qi||q*q1i){for(int j0;ji;jq){mp[f[j]]1;}int cnt0;for(auto w:mp){if(w.fcnt) cnt;else break;}f[i]cnt;}else{f[i]f[i-1];}} } signed main() {ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0);init();int n;cinn;int sum0;for(int i1;in;i){int x;cinx;sum^f[x];}if(sum0){coutSecond\n;}else{coutFirst\n;} } C:室温超导 #define int long long #define f first #define s second const int N 500000 5; char str[N]; struct Node {int len, fa;int ch[26]; }node[N*4]; int tot 1, last 1; int summ 0;//不同的子串数 void extend(int c) {int p last, np last tot;node[np].len node[p].len 1;for (; p !node[p].ch[c]; p node[p].fa) node[p].ch[c] np;if (!p) {node[np].fa 1; summ node[np].len - node[node[np].fa].len;}else{int q node[p].ch[c];if (node[q].len node[p].len 1) { node[np].fa q; summ node[np].len - node[node[np].fa].len; }else {int nq tot;summ - node[q].len - node[node[q].fa].len;node[nq] node[q], node[nq].len node[p].len 1;node[q].fa node[np].fa nq;summ node[q].len - node[node[q].fa].len;summ node[np].len - node[node[np].fa].len;summ node[nq].len - node[node[nq].fa].len;for (; p node[p].ch[c] q; p node[p].fa) node[p].ch[c] nq;}} } signed main() {ios_base::sync_with_stdio(0);cin.tie(0), cout.tie(0);int n, m;cin n m;cin str 1;string t;cin t;t t;vectorintsum(30);int all 0;//int summ 0;;for (int i 1; i n - m 1; i) {int pre_tot summ;extend(str[i] - a);// summ 0;// for (int j 2; j tot; j) {// summ node[j].len - node[node[j].fa].len;// }sumstr[i] - a;}all summ;for (int i n - m 2; str[i]; i) {int j i - (n - m);int pre_tot summ;extend(str[i] - a);// summ 0;// for (int j 2; j tot; j) {// summ node[j].len - node[node[j].fa].len;// }sumstr[i] - a;all summ;all - sum[t[j - 1] - a];if (sum[t[j - 1] - a]) all;}cout all; } F:necklace const int inf0x3f3f3f3f; int change[410][410];signed main() {ios_base::sync_with_stdio(0); cin.tie(0),cout.tie(0);memset(change,0x3f,sizeof change);int n,m;cinnm;vectorints(n),t(n);for(int i0;in;i){cins[i];}for(int i0;in;i){cint[i];}while(m–){int a,b,c;cinabc;change[a][b]min(change[a][b],c);}for(int k1;k400;k){for(int i1;i400;i){for(int j1;j400;j){change[i][j]min(change[i][j],change[i][k]change[k][j]);}}}bool ok0;int totinf;for(int i0;in;i){int sum0;bool flag1;for(int j0;jn;j){if(s[j]t[(ij)%n]) continue;int pinf;pmin(change[s[j]][t[(ij)%n]],p);pmin(change[t[(ij)%n]][s[j]],p);if(pinf){flag0;break; }sump;}if(flag0){ // ok0; // break;}else{ok1;totmin(tot,sum);}}if(!ok){cout-1\n;}else{couttot\n;} } I:hard math const int inf 0x3f3f3f3f3f3f3f3f, N 2e5 5, mod 1e9 7; int a[N], b[N]; int dp[N][10][2][2];//上界下界 int A; int tot[N]; int dfs(int n, int sum, int up, int down) {if (sum A) return 0;if (dp[n][sum][up][down]) return dp[n][sum][up][down];if (n 0) {if (sum A) return 1; else {return 0;}}int l 0, r 9;if (up 1) {r b[n];}if (down 1) {l a[n];}int res 0;for (int i l; i r; i) {if (tot[i]) {tot[i];res dfs(n - 1, sum, up (i b[n]), down (i a[n]));res % mod;tot[i]–;}else {tot[i];res dfs(n - 1, sum 1, up (i b[n]), down (i a[n]));res % mod;tot[i]–;}}return dp[n][sum][up][down] res; } signed main() {ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0);int n;cin n;string s;cin s;reverse(s.begin(), s.end());s s;for (int i 1; i n; i) {a[i] s[i] - 0;}cin s;reverse(s.begin(), s.end());s s;for (int i 1; i n; i) {b[i] s[i] - 0;}cin A;cout dfs(n, 0, 1, 1); } J:radius 不会写借鉴一下链接 #define int long long #define PII pairint,int #define f first #define s second const int inf 0x3f3f3f3f3f3f3f3f, N 1e5 5, mod 1e9 9; int x[N], y[N], z[N]; int n; struct node {double pos;int val; }a[2*N]; bool check(double r) {int cnt 0;for (int i 1; i n; i) {double res r * r - y[i] * y[i] - z[i] * z[i];if (res 0) continue;res sqrt(res);a[cnt] { x[i] - res,1 };a[cnt] { x[i] res,-1 };}sort(a 1, a 1 cnt, {return i.pos j.pos;});int sum 0;for (int i 1; i cnt; i) {sum a[i].val;if (sum n / 2) {return 1;}}cnt 0;for (int i 1; i n; i) {double res r * r - y[i] * y[i] - x[i] * x[i];if (res 0) continue;res sqrt(res);a[cnt] { z[i] - res,1 };a[cnt] { z[i] res,-1 };}sort(a 1, a 1 cnt, {return i.pos j.pos;});sum 0;for (int i 1; i cnt; i) {sum a[i].val;if (sum n / 2) {return 1;}}cnt 0;for (int i 1; i n; i) {double res r * r - x[i] * x[i] - z[i] * z[i];if (res 0) continue;res sqrt(res);a[cnt] { y[i] - res,1 };a[cnt] { y[i] res,-1 };}sort(a 1, a 1 cnt, {return i.pos j.pos;});sum 0;for (int i 1; i cnt; i) {sum a[i].val;if (sum n / 2) {return 1;}}return 0; } signed main() {ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0);cin n;for (int i 1; i n; i) {cin x[i] y[i] z[i];}double l 0, r 1e6;for (int i 0; i 50; i) {double mid (l r) / 2;if (check(mid)) {r mid;}else {l mid;}}printf(%.10lf, l); } K:tourist #define int long long const int K17,mod1e99; int path[21][21]; int st[K]; int sz[10]; int siz(int x) {int cnt0;while(x) {if(x1) cnt;x1;}return cnt; } int a[21][21]; int f[21]; int n,m,k,d; void mul(int f[],int a[21][21]) {int c[21] {0};for(int j1; jn; j) {for(int k1; kn; k) {cj%mod;}}memcpy(f,c,sizeof c); } void mulself(int a[21][21]) {int c[21][21] {0};for(int i1; in; i) {for(int j1; jn; j) {for(int k1; kn; k) {c[i]j%mod;}}}memcpy(a,c,sizeof c); } signed main() {ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0);cinnmkd;d–;for(int i0; ik; i) {int x;cinx;st[(1lli)]x;}while(m–) {int u,v;cinuv;path[u][v]1;path[v][u]1;}for(int i0; i(1llk); i) {int sizesiz(i);memcpy(a,path,sizeof path);for(int j0; jk; j) {if((ij)1) {int pst[(1llj)];for(int k1; kn; k) {a[p][k]0;a[k][p]0;}}}for(int ii1; iin; ii) {f[ii]1;}int ddd;for(; dd; dd1) {if(dd1) mul(f,a);mulself(a);}for(int j1; jn; j) {sz[size]f[j];sz[size]%mod;}}int sum0;for(int i0; ik; i) {if(i%20) {sumsz[i];sum%mod;} else {sum(sum-sz[i]mod)%mod;}}coutsum\n; }