蓝桥杯

填字母游戏

#include <bits/stdc++.h>
using namespace std;
 
int fun(string x){  
    if(x.find("LOL") != -1)return -1;  //输 
    if(x.find("*") == -1)return 0;  //平局 
    int res = -1;  //还有*，没有LOL 
    for(int i = 0;x[i];i++)  
        if(x[i] == '*'){  
            x[i] = 'L';  
            res = max(res,-fun(x));  
            if(res == 1)return x[i] = '*',1;  
            x[i] = 'O';  
            res = max(res,-fun(x));  
            x[i] = '*';  
            if(res==1) return 1; 
        }  
    return res;  
}  
int main(){  
    freopen("a.txt", "r", stdin); 
    int t;  
    cin >> t;  
    while(t--){  
        string x;  
        cin >> x;  
        cout << fun(x) << endl;  
    }  
    return 0;  
}  

 

小计算器

#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
string toAns(ll n, int ne)//10进制转化为任意进制
{
    if (n == 0)return "0";
    string str;
    while (n)
    {
        int tm = n % ne;
        if (tm <= 9) { str += '0' + tm; }
        else { str += 'A' + tm - 10; }
        n /= ne;
    }
    reverse(str.begin(), str.end());
    return str;
}
 
ll toTen(string str, int ne)//任意进制转化为10进制
{
    ll ans = 0, arg = 1;
    for (int i = str.size() - 1; i >= 0; --i)
    {
        if (str[i] <= '9') { ans += (str[i] - '0')*arg; }
        else { ans += (str[i] - 'A' + 10)*arg; }
        arg *= ne;
    }
    return ans;
}
ll getOper(ll a, ll b, string op)
{
    if (op == "ADD") { return a + b; }
    else if (op == "SUB") { return a - b; }
    else if (op == "MUL") { return a * b; }
    else if (op == "DIV") { return a / b; }
    else { return a % b; }
}
int main()
{
    freopen("input1.txt", "r", stdin);
    int  n;
    while (cin >> n)
    {
        ll ans = 0;
        int ne = 10;
        string str, old;
        while (n--)
        {
            cin >> str;
             if (str == "CLEAR") { str.clear(); old.clear(); }
            else if (str == "EQUAL") { old.clear(); cout<< toAns(ans, ne) << endl; }
            else if (str == "CHANGE") { cin >> ne; }
            else if (str == "NUM"&&old.empty()) { cin >> str; ans = toTen(str, ne); }
            else if (str == "NUM" && !old.empty())
            {
                cin >> str; ans = getOper(ans, toTen(str, ne), old);
            }
            else   { old = str; }
        }
    }
    return 0;
}

 

基础练习 十六进制转八进制

        十六进制先转为二进制，再转为八进制

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    //freopen("input1.txt","r",stdin);
    int n;
    cin>>n;
    for(int k=1;k<=n;k++)
    {
        string s1,s2;//s1为输入的原始的十六进制串，s2为转化成的二进制串
        cin>>s1;
        s2="";//初始化
        for(int i=0;i<s1.length();i++)//遍历，字符串上加上每一位
        {
            switch(s1[i])
            {
                case '0':s2+="0000";break;
                case '1':s2+="0001";break;
                case '2':s2+="0010";break;
                case '3':s2+="0011";break;
                case '4':s2+="0100";break;
                case '5':s2+="0101";break;
                case '6':s2+="0110";break;
                case '7':s2+="0111";break;
                case '8':s2+="1000";break;
                case '9':s2+="1001";break;
                case 'A':s2+="1010";break;
                case 'B':s2+="1011";break;
                case 'C':s2+="1100";break;
                case 'D':s2+="1101";break;
                case 'E':s2+="1110";break;
                case 'F':s2+="1111";break;
                default:break;
            }
        }
        int len=s2.length();
 
        if(len%3==1)//三个二进制为一位八进制，二进制串前面补0，确保二进制串的长度为3的倍数
            s2="00"+s2;
        else if(len%3==2)
            s2="0"+s2;
        int flag=0;
        for(int i=0;i<=s2.length()-3;i+=3)
        {
            int num=4*(s2[i]-'0')+2*(s2[i+1]-'0')+(s2[i+2]-'0');
            if(num)
                flag=1;//忽略前导0
            if(flag)
                cout<<num;
        }
        cout<<endl;
    }
    return 0;
}

 

基础练习 数列排序

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    vector<int>a;
    int n,tmp;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>tmp;
        a.push_back(tmp);
    }
    sort(a.begin(),a.end());
    for(int i=0;i<n;i++) cout<<a[i]<<' ';
    return 0;
}