市赛（天亡发际线队）

Problem A. dsy’s repeater

#include<iostream>
#include<string>
using namespace std;

int main(){
    int a,b;
    cin >> a >> b;
    for(int i = 1;i <= a;i++){
        string s;cin >> s;
        if(i % b == 0)
            cout << "gugugu" <<endl;
        else 
            cout << s <<endl;
    }
}

Problem B. Saturated rescue
//这个最短路网上抄的…最短路不熟

#include<iostream>
#include<vector>
#include<cstring>
using namespace std;

struct edge {
	int to;
	int cost;
};
const int maxn = 100005;
int node[maxn];
int n;
vector<edge> G[maxn];
int dis[maxn];

void dfs(int u) {
	int vis[maxn] = { 0 };
	vis[u] = 1;
	for (int i = 0;i <= n;i++) {
		int min = 0x3f3f3f + 1, k = 0;
		for (int j = 0;j < G[i].size();j++) {
			if (!vis[G[i][j].to] && dis[G[i][j].to] < min) {
				min = dis[G[i][j].to];
				k = G[i][j].to;
			}
		}
		vis[k] = 1;
		for (int j = 0;j < G[k].size();j++) {
			if (!vis[G[k][j].to] && dis[G[k][j].to] > dis[k] + G[k][j].cost) {
				dis[G[k][j].to] = dis[k] + G[k][j].cost;
			}
		}
	}
}




int main() {
	cin >> n;
	int a, b, c;
	memset(dis, 0x3f3f3f, sizeof(dis));
	for (int i = 1;i <= n;i++) {
		cin >> node[i];
		if (node[i]==1) {
			G[0].push_back(edge{ i,0 });
			G[i].push_back(edge{ 0,0 });
			dis[i] = 0;
		}
	}
	for (int i = 1;i < n;i++) {
		cin >> a >> b >> c;
		G[a].push_back(edge{ b,c });
		G[b].push_back(edge{ a,c });
	}

	dfs(0);
	int max = 0;
	for (int i = 1;i <= n;i++) {
		if (dis[i] > max)
			max = dis[i];
	}

	printf("%d\n", max);
}

Problem D. Sequence

#include<iostream>
#include<map>
#include<cmath>
using namespace std;


int N, K, M, T;
map<int, int>P;


bool judge_prime(int t) {
	if (t < 4)
		return true;
	if (t % 2 == 0 || t % 3 == 0)
		return false;
	for (int i = 5;i <= sqrt(double(t));i++) {
		if (t % i == 0 || t % (i + 2) == 0)
			return false;
	}
	return true;
}

void insert(int t) {
	if (judge_prime(t))
		P[t]++;
	else {
		for (int i = 2;i <= sqrt(t);i++) {
			if (t % i == 0) {
				insert(i);
				insert(t / i);
				break;
			}
		}
	}
}


int main() {
	scanf("%d", &T);
	for (int i = 0;i < T;i++) {
		P.clear();
		scanf("%d %d %d", &N, &K, &M);
		for (int i = 2;i <= sqrt((double)N);i++) {
			if (N%i == 0) {
				insert(i);
				insert(N / i);
				break;
			}
		}
		int t = 1;
		for (auto i = P.begin();i != P.end();i++) {
			t *= (int)(pow(i->first, i->second / K + (i->second % K != 0)) + 0.5);
		}
		if (judge_prime(N))
			t = N;
		cout << M / t << endl;
	}
}

Problem E. tree

#include<stdio.h>
int main(){
    int n;scanf("%d",&n);
    printf("%.4f",double(n)/2);
}

7-6 Problem F. QAQ

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 1e5;
char c, s[maxn + 1];
int n, cnt = 0, q[maxn + 1];
ll v[maxn + 1], p[maxn + 1];

void power(int n)
{
    ll ans = 1;
    for (int i = 1; i <= n; i++)
    {
        ans *= 2;
        ans %= mod;
        p[i] = ans;
    }
}

int main()
{
    for (int i = 1; (c = getchar()) != '\n'; i++)
        s[i] = c;
    for (int i = 1; s[i]; i++)
    {
        if (s[i] == '?')
            cnt++;
        q[i] = cnt;
        n = i;
    }
    p[0] = 1;
    power(n);
    for (int i = 3; i <= n; i++)
    {
        if (s[i] == 'A')
            v[i] = v[i - 1];
        else if (s[i] == 'Q')
        {
            if (s[i - 2] == 'A' || s[i - 1] == 'Q')
                v[i] = v[i - 1];
            else
                v[i] = (v[i - 1] + p[q[i - 3]]) % mod;
        }
        else{
            if (s[i - 2] == 'A' || s[i - 1] == 'Q')
                v[i] = v[i - 1] * 2 % mod;
            else
                v[i] = (v[i - 1] * 2 + p[q[i - 3]]) % mod;
        }
    }
    printf("%lld\n", v[n]);
    return 0;
}

7-7 Problem G. MAX

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

int main(){
    int n;cin >> n;
    vector<int>P;
    for(int i = 0;i < n;i++){
        int t;cin >> t;
        P.push_back(t);
    }
    sort(P.begin(),P.end());
    cout << P[P.size()-1] << " " << P[P.size()-2]<<endl;
}

7-9 Problem I. Densest Interval

#include<iostream>
using namespace std;

const int maxn = 2005;
int X[maxn];
int n;
double f(int i, int j) {
	return (double)(j - i + 1) / (X[j] - X[i]);
}

void solve(int u) {
	double max = 0;
	int k;
	for (int i = u + 1;i < n;i++) {
		if (f(u, i) > max) {
			max = f(u, i);
			k = i;
		}
	}
	cout << X[k] - X[u] << endl;
}


int main() {
	cin >> n;
	for (int i = 0;i < n;i++) {
		cin >> X[i];
	}
	for (int i = 0;i < n - 1;i++) {
		solve(i);
	}
}

7-10 Problem J. Games

#include<stdio.h>

int t, a, b;
int main() {
	scanf("%d", &t);
	for (int i = 0;i < t;i++) {
		scanf("%d%d", &a, &b);
		if (a == 1) {
			printf("0\n");
		    continue;
    	}
		int cnt = 1;
		int t = b;
		while (t < a) {
			t *= b;
			cnt++;
		}
		printf("%d\n", cnt);
	}
}

还有两题目前没搞出来