Comet OJ

同样的补题 （补题补的我想去玩pokemmo还有重推pokemon了

A题 第001话 宝可梦,就决定是你了！

简单的数学问题 一个公式的问题

AC代码：

#include<bits/stdc++.h>
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

namespace io {
    const int SIZE = 1e7 + 10;
    char inbuff[SIZE];
    char *l, *r;
    inline void init() {
        l = inbuff;
        r = inbuff + fread(inbuff, 1, SIZE, stdin);
    }
    inline char gc() {
        if (l == r) init();
        return (l != r) ? *(l++) : EOF;
    }
    void read(int &x) {
        x = 0; char ch = gc();
        while(!isdigit(ch)) ch = gc();
        while(isdigit(ch)) x = x * 10 + ch - '0', ch = gc();
    }
} using io::read;

bool cmp(const int &a, const int &b){
    return a > b;
}

int main(){
    ios::sync_with_stdio(false);
    ll n;
    cin>>n;
    cout<<n * n<<endl;
    return 0;
}

C题 第003话 收服宝可梦吧！

 

贪心就好啦

AC代码：

#include<bits/stdc++.h>
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

namespace io {
    const int SIZE = 1e7 + 10;
    char inbuff[SIZE];
    char *l, *r;
    inline void init() {
        l = inbuff;
        r = inbuff + fread(inbuff, 1, SIZE, stdin);
    }
    inline char gc() {
        if (l == r) init();
        return (l != r) ? *(l++) : EOF;
    }
    void read(int &x) {
        x = 0; char ch = gc();
        while(!isdigit(ch)) ch = gc();
        while(isdigit(ch)) x = x * 10 + ch - '0', ch = gc();
    }
} using io::read;

bool cmp(const int &a, const int &b){
    return a > b;
}

int main(){
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    int cnt;
    while (n--){
        char s[1000005], t[1000005];
        cin>>s>>t;
        cnt = 0;
        int len1 = strlen(s);
        int len2 = strlen(t);
        if (len1 != len2 + 2){
            cout<<0<<endl;
            continue;
        }
        for (int i = 0; i < len1; i++)
            if (s[i] == t[cnt]) cnt++;
        if (cnt == len2) cout<<1<<endl;
        else cout<<0<<endl;
    }
    return 0;
}

D题 第004话 武士少年的挑战！

 

就是每年过年时玩的一种抽牌游戏 排序之后判断一下就行了

AC代码：

#include<bits/stdc++.h>
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

namespace io {
    const int SIZE = 1e7 + 10;
    char inbuff[SIZE];
    char *l, *r;
    inline void init() {
        l = inbuff;
        r = inbuff + fread(inbuff, 1, SIZE, stdin);
    }
    inline char gc() {
        if (l == r) init();
        return (l != r) ? *(l++) : EOF;
    }
    void read(int &x) {
        x = 0; char ch = gc();
        while(!isdigit(ch)) ch = gc();
        while(isdigit(ch)) x = x * 10 + ch - '0', ch = gc();
    }
} using io::read;

bool cmp(const int &a, const int &b){
    return a > b;
}

int main(){
    ios::sync_with_stdio(false);
    int a[18];
    for (int i = 0; i < 18; i++) cin>>a[i];
    sort(a, a + 18);
    int cnt = 0;
    for (int i = 0; i < 17; i++){
        if (a[i] == 0) continue;
        if (a[i] == a[i + 1]){
            cnt++;
            i++;
        }
    }
    cout<<18 - cnt * 2<<endl;
    return 0;
}