蓝桥杯第四届

错误票据

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;

const int N = 100010;

int a[N];
int cnt[N]; 

int main()
{
    int n;
    cin >> n;
    
    int idx = 1;
    for(int i = 1; i <= n; i ++){
        while(cin >> a[idx]){
            idx ++;
        }
    }
    
    //cout << idx << endl;
    int m = idx - 1;

    sort(a + 1, a + 1 + m);
    
    for(int i = 1; i <= m; i ++){
        //cout << a[i] << " ";
        cnt[a[i]] ++;
    }

    int minn = a[1], maxn = a[m];
    int dh = 0, ch = 0;
    
    for(int i = minn; i <= maxn; i ++){
        if (cnt[i] == 0) dh = i;
        if(cnt[i] == 2) ch = i;
    }
    
    cout << dh << " " << ch << endl;
    return 0;
}

翻硬币

记得函数return

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio> 
using namespace std; 

string a, b;

char change(int i){
    if(a[i] == '*') return a[i] = 'o';
    if(a[i] == 'o') return a[i] = '*';
}

int main()
{
    cin >> a >> b;
    
    int cnt = 0;
    for(int i = 0; i < a.length() - 1; i ++){
        if(a[i] != b[i]){
            change(i);
            change(i + 1);
            cnt ++;
        }
    }
    
    cout << cnt << endl;
    
    return 0;
}

带分数

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

typedef long long LL;

int a[15];
bool st[15];
int n;
int cnt;

LL get(int x, int y){
    LL sum = 0;
    for(int i = x; i <= y; i ++){
        sum = sum * 10 + a[i];
    }
    return sum;
}

void dfs(int u){//1-9数字全排列 
    if(u > 9){
        for(int i = 1; i <= 7; i ++){
            for(int j = i + 1; j <= 8; j ++){
                int a = get(1, i);
                int b = get(i + 1, j);
                int c = get(j + 1, 9);
                if((LL)n * c == (LL)a * c + b){
                    cnt ++;
                    cout << a << " " << b << " " << c << endl;
                }
            }
        }
        return ;
    }
    
    for(int i = 1; i <= 9; i ++){
        if(!st[i]){
            st[i] = true;
            a[u] = i;
            dfs(u + 1);
            st[i] = false;
            a[u] = 0;
        }
    }
}

int main()
{
    cin >> n;
    dfs(1);//从数组下标1开始 
    cout << cnt << endl;
    return 0;
}

连号区间数

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

const int N = 50010;

int a[N]; 
int cnt;

int main()
{
    int n;
    cin >> n;
    
    for(int i = 1; i <= n; i ++) scanf("%d", &a[i]); 
    
    for(int i = 1; i <= n; i ++){
        int maxn = -1e8, minn = 1e8;
        for(int j = i; j <= n; j ++){
            if(a[j] > maxn) maxn = a[j];
            if(a[j] < minn) minn = a[j];
            
            if(maxn - minn == j - i){
                //cout << maxn << " " << minn << " " << i << ' ' << j << endl;
                cnt ++;
            }
        }
    }
    
    cout << cnt << endl;
    
    return 0;
}

幸运数