2024 河南萌新联赛 2

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int pos = s.find("chuan"), cnt = 0;
    while (pos != string::npos) {
        cnt++;
        pos = s.find("chuan", pos + 1);
    }
    cout << cnt << endl;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    while(t--){
        int a,b;
        cin>>a>>b;
        cout<<"DHY\n";
    }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;

int n,m,q,k;
vector<int>a(N);
map<int,int>vis;

int main(){
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++){
        int u,v;
        cin>>u>>v;
    }
    sort(a.begin()+1,a.begin()+1+n);
    while(q--){
        cin>>k;
        cout<<a[k]<<endl;
    }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

#include <bits/stdc++.h>
using namespace std;

int n,m;
int a[6][6];

int cal(int n, int a[6][6]) {
    if (n == 1)
        return a[0][0];
    int res = 0;
    int sub[6][6];
    for (int x = 0; x < n; x++) {
        int subi = 0;
        for (int i = 1; i < n; i++) {
            int subj = 0;
            for (int j = 0; j < n; j++) {
                if (j == x) continue;
                sub[subi][subj] = a[i][j];
                subj++;
            }
            subi++;
        }
        res += (x % 2 == 0 ? 1 : -1) * a[0][x] * cal(n - 1, sub);
    }
    return res;
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> a[i][j];
    int ans = INT_MAX;
    int u=min(n,m);
    for(int i=1;i<=u;i++){
        ans=min(ans,cal(i,a));
    }
    cout << ans << endl;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

#include <bits/stdc++.h>
using namespace std;

int n, cnt, m;
string s;
map<string, vector<string>> note;
map<string, map<string, int>> vis;
set<string> peo;

void erase(string &a, string &b) {
    if (a == b) {
        b = "";
        return;
    }
    if (a.size() > b.size() && a.substr(a.size() - b.size()) == b) {
        b = "";
    }
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s >> cnt;
        peo.insert(s);
        for (int j = 1; j <= cnt; j++) {
            string t;
            cin >> t;
            if (!vis[s][t]) note[s].push_back(t);
            vis[s][t]++;
        }
    }
    for (auto x : peo) {
        int m = note[x].size();
        for (int i = 0; i < m; i++) {
            for (int j = i + 1; j < m; j++) {
                erase(note[x][i], note[x][j]);
                erase(note[x][j], note[x][i]);
            }
        }
        sort(note[x].begin(), note[x].end());
        note[x].erase(remove(note[x].begin(), note[x].end(), ""), note[x].end());
    }
    cout << peo.size() << endl;
    for (auto x : peo) {
        cout << x << " " << note[x].size();
        for (auto s : note[x]) {
            cout << " " << s;
        }
        cout << endl;
    }

    return 0;
}

1
2
3
4
5
6

from decimal import *
import sys
t=int(input())
for i in range(t):
    setcontext(Context(prec=2000000, Emax=2000000, Emin=0)) 
    print((Decimal(sys.stdin.readline())*Decimal(sys.stdin.readline())))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

#include <bits/stdc++.h>
using namespace std;
const int N = 1e7+10;
typedef long long ll;

int a[N],sum[N],ans[N<<1];
string A,B;

void solve(){
    cin>>A>>B;
    int la=A.length(),lb=B.length(),b=B[0]-'0';
    ll last=0;
    a[la+1]=0;
    for(int i=1;i<=la;i++){
        a[i]=(A[la-i]-'0')*b+last;
        last=a[i]/10;
        a[i]*=10;
        sum[i]=sum[i-1]+a[i];
    }
    sum[la+1]=sum[la]+last;
    last=0;
    for(int i=1;i<=la+lb;i++){
        int l=min(i,la+1),r=max(0,i-lb);
        ans[i]=sum[l]-sum[r]+last;
        last=ans[i]/10;
        ans[i]%=10;
    }
    bool flag=0;
    for(int i=la+lb;i>=1;--i) {
        if(!ans[i]) {
            if(flag)  printf("%d",ans[i]);
        } else {
            flag=1;
            printf("%d",ans[i]);
        }
    }
    if(!flag)  printf("0");
    printf("\n");
}

int main(){
    int t;
    cin>>t;
    while(t--)solve();
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

#include <bits/stdc++.h>
using namespace std;

int kmp(int nxt[], string a) {
    int n = a.size();
    nxt[0] = 0;
    int j = 0;
    for (int i = 1; i < n; i++) {
        while (j && a[i] != a[j])
            j = nxt[j - 1];
        if (a[i] == a[j])
            j++;
        nxt[i] = j;
    }
    return n - nxt[n - 1];
}

string getmin(string s, int n) {
    s = s + s;
    int i = 0, j = 1;
    while (j < n) {
        int k = 0;
        while (k < n && s[i + k] == s[j + k]) ++k;
        if (s[i + k] > s[j + k]) i += k + 1;
        else j += k + 1;
        if (i == j) j++;
        if (i > j) swap(i, j);
    }
    string t = s.substr(i, n);
    return t;
}

int main() {
    int n;
    string a, b;
    cin >> n >> a >> b;
    a = a + a;
    b = b + b;
    map<char, vector<int>> va, vb;
    map<char, string> sa, sb;
    for (int i = 0; i < n * 2; i++) {
        va[a[i]].push_back(i);
        vb[b[i]].push_back(i);
    }
    int cnt = 0, nxt[2000010];
    for (char x = 'a'; x <= 'z'; x++) {
        if (va[x].size() != vb[x].size() || va[x].size() == 0 || vb[x].size() == 0) continue;
        for (int i = 1; i < va[x].size(); i++) {
            sa[x] += to_string(va[x][i] - va[x][i - 1]);
        }
        for (int i = 1; i < vb[x].size(); i++) {
            sb[x] += to_string(vb[x][i] - vb[x][i - 1]);
        }
        if (getmin(sa[x], kmp(nxt, sa[x])) == getmin(sb[x], kmp(nxt, sb[x]))) cnt++;
    }
    cout << cnt << endl;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

#include <bits/stdc++.h>
using namespace std;

int calc(int x){
    if(x%8==0)return x-1;
    if(x%8==7)return x+1;
    else return x;
}

int ans;

int main(){
    int n,x;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x;
        ans^=calc(x);   
    }
    if(ans==0)cout<<"W win\n";
    else cout<<"w win\n";
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69

#include <bits/stdc++.h>
using namespace std;
const int N = 1010;

struct Node{
    int x,y,id;
}b[N];

int n,m,ans,dx[4]={1,0,-1,0},dy[4]={0,1,0,-1},tot,dis[N][N],a[N][N];
bool vis[N];
deque<Node>q;

void bfs(int id){
    q.clear();
    q.push_back(Node{b[id].x,b[id].y,0});
    dis[b[id].x][b[id].y]=0;
    while(!q.empty()){
        Node now=q.front();
        q.pop_front();
        for(int i=0;i<4;i++){
            int x=now.x+dx[i],y=now.y+dy[i];
            if(x<1||y<1||x>n||y>m||a[x][y]==-1)continue;
            if(dis[x][y]>now.id+1){
                dis[x][y]=now.id+1;
                q.push_back(Node{x,y,dis[x][y]});
            }
        }
    }
}

void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            dis[i][j]=1e9;
            char x;
            cin>>x;
            if(x=='.')a[i][j]=0;
            else if(x=='#')a[i][j]=-1;
            else {
                a[i][j]=++tot;
                b[tot]=Node{i,j,tot};   
            }
        }
    }
    dis[b[1].x][b[1].y]=0;
    for(int i=1;i<=tot;i++){
        int mi=1e9,id=0;
        for(int j=1;j<=tot;++j){
            if(vis[j])continue;
            if(mi>dis[b[j].x][b[j].y])mi=dis[b[j].x][b[j].y],id=j;
        }
        if(!id){
            puts("No");
            return;
        }
        vis[id]=1;
        ans+=mi;
        if(i!=tot)bfs(id);
    }
    cout<<ans<<endl;
}

int main(){
    int t=1;
//     cin>>t;
    while(t--)solve();
    return 0;
}