AtCoder Beginner Contest 326

A - 2UP3DOWN (atcoder.jp)

AC代码:

#include<bits/stdc++.h>
#define endl '\n'
//#define int long long
using namespace std;
int x,y;
void solve() {
    cin>>x>>y;
    if(x<y){
        if(y-x<=2) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    else {
        if(x-y<=3) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--) {
        solve();
    }
    return 0;
}

B - 326-like Numbers (atcoder.jp)

AC代码:

#include<bits/stdc++.h>
#define endl '\n'
//#define int long long
using namespace std;
int n;
void solve() {
    cin>>n;
    for(int i=n;i<=919;i++){
        string s=to_string(i);
        if((s[0]-'0')*(s[1]-'0')==(s[2]-'0')){
            cout<<i<<endl;
            return;
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--) {
        solve();
    }
    return 0;
}

C - Peak (atcoder.jp)

AC代码:

#include<bits/stdc++.h>
#define endl '\n'
//#define int long long
using namespace std;
const int N=3e5+10;
int a[N];
int n,m;
void solve() {
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    int ans=0;
    for(int i=1;i<=n;i++){
        int x=a[i]+m;
        int pos=lower_bound(a+1,a+1+n,x)-a;
        ans=max(ans,pos-i);
    }
    cout<<ans<<endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--) {
        solve();
    }
    return 0;
}