2016年天梯赛模拟题集

今天下午有点事没及时把代码整理出来，我的锅我的锅 (╥╯^╰╥)

7-1 N个数求和 (20 分)

思路： 直接模拟分数加分，注意通分，防止爆int

AC代码

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

void pr(long long a, long long b){
    a %= b;
    long long d = __gcd(a, b);
    cout << a / d << "/" << b / d << endl;
}

int main(){

    int n;
    cin >> n;

    long long fz, fm; char c;

    cin >> fz >> c >> fm;

    long long a, b;
    for(int i = 1; i < n; i++){
        cin >> a >> c >> b;
        long long d = b / __gcd(b, fm) * fm;
        fz = d / fm * fz + d / b * a;
        fm = d;

    }

    if(fz % fm == 0) cout << fz / fm << endl;
    else if(fz < fm) pr(fz, fm);
    else{
        cout << fz/fm << " ";
        pr(fz, fm);
    }

    return 0;
}

7-2 比较大小 (10 分)

思路： 让小的在前边，大的在后
AC代码

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

int main(){

    int a, b, c;
    cin >> a >> b >> c;
    if(a > b) swap(a, b);
    if(a > c) swap(a, c);
    if(b > c) swap(b, c);

    cout << a << "->" << b << "->" << c << endl;


    return 0;
}

7-3 A-B (20 分)

思路： 用 map 统计那个字母出现过，输出没出现过的字母即可
AC代码

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

map<char, int> v;

int main(){

    string a, b;

    getline(cin, a);
    getline(cin, b);

    int len = b.size();
    for(int i = 0; i < len; i++) v[b[i]]++;

    len = a.size();
    for(int i = 0; i < len; i++) if(v[a[i]] == 0) cout << a[i];
    cout << endl;


    return 0;
}

7-4 计算指数 (5 分)

思路： 用 pow 函数计算即可，注意 pow函数的返回值为 double
AC代码

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

int main(){

    int n;
    cin >> n;
    cout << "2^" << n << " = " << 1ll * pow(2, n) << endl;
    
    return 0;
}

7-5 计算阶乘和 (10 分)

思路： 循环求和即可
AC代码

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

int main(){

    long long n;
    cin >> n;
    long long tmp = 1, res = 0;
    
    for(int i = 1; i <= n; i++){
        tmp *= i;
        res += tmp;
    }
    
    cout << res << endl;

    return 0;
}

7-6 简单题 (5 分)

略

7-7 跟奥巴马一起画方块 (15 分)

思路： 两层循环模拟，用 (n+1)/2 处理四舍五入
AC代码

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


int main(){

    int n;
    char c;
    cin >> n >> c;
    int A = (n+1)/2, B = n;
    for(int i = 1; i <= A; i++){
        for(int j = 1; j <= B; j++){
            cout << c;
        }
        cout << endl;
    }

    return 0;
}

7-8 查验身份证 (15 分)

思路： 用数组来存权值和校验码，用字符串来存身份证号

AC代码

#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define ll long long
#define chushi(a, b) memset(a, b, sizeof(a))
#define endl "\n"
const double eps = 1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
const int maxn = 5e3 + 5;

using namespace std;

int v[20] = {7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2}; 
char F[20] = {'1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2', '1'};

int main(){
	
	int n;
	cin >> n;
	int f = 1; string s;
	for(int i = 1; i <= n; i++){
		cin >> s;
		int sum = 0, ff = 1;
		for(int j = 0; j < 17; j++){
			int tmp = s[j] - '0';
			if(tmp < 0 || tmp > 9){
				cout << s << endl;
				ff = 0;
				f = 0;
				break;
			}
			sum += tmp * v[j];
		}
		if(ff == 0) continue;
		if(F[sum%11] != s[17]){
			cout << s << endl;
			f = 0;
		}
	}
	
	if(f) cout << "All passed" << endl;
	
	return 0;
}

7-9 集合相似度 (25 分)

思路： 用 set 计数，暴力统计即可
AC代码

#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define ll long long
#define chushi(a, b) memset(a, b, sizeof(a))
#define endl "\n"
const double eps = 1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
const int maxn = 5e3 + 5;

using namespace std;

int a[51][2005];
set<int> s[51];
double v[51][51] = {0};
bool flag[51][51] = {0};

int main(){
	
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i][0];
		for(int j = 1; j <= a[i][0]; j++) cin >> a[i][j];
		for(int j = 1; j <= a[i][0]; j++) s[i].insert(a[i][j]);
	}
	
	int m;
	cin >> m;
	while(m--){
		int x, y;
		cin >> x >> y;
		if(flag[x][y]){
			printf("%.2lf%%\n", v[x][y]);
			continue;
		}
		set<int> t;
		for(int j = 1; j <= a[x][0]; j++) t.insert(a[x][j]);
		for(int j = 1; j <= a[y][0]; j++) t.insert(a[y][j]);
		double numx = s[x].size(), numy = s[y].size(), num = t.size();
		double res = (numx + numy - num) / num * 100;
		printf("%.2lf%%\n", res);
		v[x][y] = res;
		flag[x][y] = 1;
	}
	
	return 0;
}

7-10 树的遍历 (25 分)

思路： 数据结构裸体，百度即可
AC代码

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int postorder[31],inorder[31],n;

struct node{
    int left,right;
}tree[31];

int build(int la,int ra,int lb,int rb)
{
    if(la>ra) return 0;
    int root=postorder[rb];
    int p1=la;
    while(inorder[p1]!=root) p1++;
    int p2=p1-la;
    tree[root].left=build(la,p1-1,lb,lb+p2-1);
    tree[root].right=build(p1+1,ra,lb+p2,rb-1);

    return root;
}

void bfs(int x)
{
    vector<int> a;
    queue<int> q;
    q.push(x);
    while(!q.empty())
    {
        int ret=q.front();
        q.pop();
        if(ret==0) break;
        a.push_back(ret);
        if(tree[ret].left!=0) q.push(tree[ret].left);
        if(tree[ret].right!=0) q.push(tree[ret].right);
    }
    int len=a.size();
    for(int i=0;i<len-1;i++) cout<<a[i]<<" ";
    cout<<a[len-1]<<endl;
}

int main()
{

    cin>>n;
    for(int i=1;i<=n;i++) cin>>postorder[i];
    for(int i=1;i<=n;i++) cin>>inorder[i];
    build(1,n,1,n);
    int root=postorder[n];
    bfs(root);

    return 0;
}

7-11 家庭房产 (25 分)

思路： 并查集处理亲属关系，结构体排序
AC代码

#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define ll long long
#define chushi(a, b) memset(a, b, sizeof(a))
#define endl "\n"
const double eps = 1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
const int maxn = 1e5 + 5;

using namespace std;

int f[maxn];
double _k[maxn] = {0};		// 人数 
double _num[maxn] = {0}, _sum[maxn] = {0};	// 房子数、 房子面积 

typedef struct Node{
	int id;
	int f;
	int m;
	int num_k;
	int k[6];
	double num;
	double sum;
} node;

node a[1005];
vector<int> v;
map<int, int> id;
int tot = 0;

int find(int x){
	if(x == f[x]) return x;
	else return f[x] = find(f[x]);
}

void join(int x, int y){
	int fx = find(x);
	int fy = find(y);
	
	if(fx != fy){
		if(fx < fy) f[fy] = fx;
		else f[fx] = fy;
	}
}

typedef struct NOde{
	int id;
	double __k;
	double __num;
	double __sum;
} X;

bool cmp(X A, X B){
	if(A.__sum == B.__sum) return A.id < B.id;
	return A.__sum > B.__sum;
}

vector<X> res;

int main(){
	
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].id >> a[i].f >> a[i].m >> a[i].num_k;
		for(int j = 1; j <= a[i].num_k; j++) cin >> a[i].k[j];
		cin >> a[i].num >> a[i].sum;
	}
	for(int i = 1; i <= n; i++){
		if(a[i].f != -1) v.push_back(a[i].f);
		if(a[i].m != -1) v.push_back(a[i].m);
		for(int j = 1; j <= a[i].num_k; j++) v.push_back(a[i].k[j]);
		v.push_back(a[i].id);
	}
	
	sort(v.begin(), v.end());
	int cnt = unique(v.begin(), v.end()) - v.begin();	// 编号数 
	for(int i = 0; i < cnt; i++) id[v[i]] = ++tot;
	
	for(int i = 1; i <= cnt; i++) f[i] = i;
	
	for(int i = 1; i <= n; i++){
		if(a[i].f != -1) join(id[a[i].id], id[a[i].f]);
		if(a[i].m != -1) join(id[a[i].id], id[a[i].m]);
		for(int j = 1; j <= a[i].num_k; j++) join(id[a[i].id], id[a[i].k[j]]);
	}
	
	for(int i = 1; i <= n; i++){
		int x = find(id[a[i].id]);
		_num[x] += a[i].num;
		_sum[x] += a[i].sum;
	}
	
	for(int i = 0; i < cnt; i++) _k[f[find(id[v[i]])]]++;
	
	for(int i = 1; i <= cnt; i++){
		if(i == find(i)){
			res.push_back({v[i-1], _k[i], _num[i]/_k[i], _sum[i]/_k[i]});
		}
	}
	
	sort(res.begin(), res.end(), cmp);
	
	int len = res.size();
	cout << len << endl;
	for(int i = 0; i < len; i++) printf("%04d %.0lf %.3lf %.3lf\n", res[i].id, res[i].__k, res[i].__num, res[i].__sum);

	return 0;
}

7-12 最长对称子串 (25 分)

思路： 暴力模拟，把每一位当做字符串的中心往两端去比较
AC代码

#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define ll long long
#define chushi(a, b) memset(a, b, sizeof(a))
#define endl "\n"
const double eps = 1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
const int maxn = 5e3 + 5;

using namespace std;

int main(){
	
	string s;
	getline(cin, s);
	
	int len = s.size(), res = 1;
	for(int i = 0; i < len; i++){
		for(int j = 0; i+j < len && i - j >= 0; j++){
			if(s[i+j] == s[i-j]) res = max(res, 2*j + 1);
			else break;
		}
		for(int j = 1; i+j-1 < len && i - j >= 0; j++){
			if(s[i+j-1] == s[i-j]) res = max(res, 2*j);
			else break;
		}
	}
	
	cout << res << endl;

	return 0;
}