AtCoder Beginner Contest 182

AtCoder Beginner Contest 182

A - twiblr

#include <bits/stdc++.h>

#define int ll
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int mod = 998244353;

void solve() {
    int a,b;
    cin>>a>>b;
    cout<<a*2+100-b;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    //cin >> _;
    while (_--) solve();
    return 0;
}

B - Almost GCD

#include <bits/stdc++.h>

#define int ll
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int mod = 998244353;

int a[1010];

void solve() {
    int n;
    cin>>n;
    for (int i = 0; i < n; ++i) cin>>a[i];
    int max_=0,k=2;
    for (int i = 2; i <=1000; ++i) {
        int ans = 0;
        for (int j = 0; j < n; ++j) 
            if(a[j]%i==0) ans++;
        if(max_<=ans) max_=ans,k=i;
    }
    cout<<k;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    //cin >> _;
    while (_--) solve();
    return 0;
}

C - To 3

#include <bits/stdc++.h>

#define int ll
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int mod = 998244353;

void solve() {
    int n;
    cin>>n;
    if(n%3==0) {
        cout<<0;
        return;
    }
    int len=0,ans=0,num=0,a[5]={0};
    while (n){
        len++;
        if(n%3) ans++;
        a[n%10%3]++;
        num+=n%10;
        n/=10;
    }
    int k=num%3;
    int p=(a[k]?1:2);
    if(len==p) {
        cout<<-1;
        return;
    }
    cout<<p;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    //cin >> _;
    while (_--) solve();
    return 0;
}

D - Wandering

#include <bits/stdc++.h>

#define int ll
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int mod = 998244353;

void solve() {
    int n;
    cin>>n;
    int maxs=0,a,s=0,p=0,sum=0;
    for (int i = 0; i < n; ++i) {
        cin>>a,s+=a;
        maxs=max(maxs,s);
        sum=max(sum,maxs+p);
        p+=s;
    }
    cout<<sum;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    //cin >> _;
    while (_--) solve();
    return 0;
}