AtCoder Beginner Contest 176

AtCoder Beginner Contest 176

A - Takoyaki

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e5 + 10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;

void solve() {
    ll n,x,t;
    cin>>n>>x>>t;
    ll c=ceil(n*1.0/x)*t;
    cout<<c<<endl;
}

int main() {
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

B - Multiple of 9

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e5 + 10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;

void solve() {
    ll b=0;
    string a;
    cin>>a;
    for (int i = 0; i < a.size(); ++i) {
        b+=a[i]-'0';
    }
    cout<<(b%9==0?"Yes":"No")<<endl;
}

int main() {
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

C - Step

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e5 + 10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;

void solve() {
    ll n,a[MAX],sum=0;
    cin>>n;
    a[0]=0;
    for (int i = 1; i <= n; ++i) {
        cin>>a[i];
        if (a[i]<a[i-1])sum+=(a[i-1]-a[i]),a[i]=a[i-1];
    }
    cout<<sum<<endl;
}

int main() {
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

E - Bomber

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 3e5 + 10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;

int h1,w1,m,bsum=0,csum=0,bs,cs;
ll a[MAX],b[MAX],c[MAX],d[MAX];

void solve() {
    cin>>h1>>w1>>m;
    for (int i=1;i<=m;++i)  cin>>a[i]>>d[i],b[a[i]]++,c[d[i]]++;
    for (int k = 1; k <=h1; ++k) {
        if (b[k]>bsum)bsum=b[k],bs=1;
        else if (b[k]==bsum) bs++;
    }
    for (int k = 1; k <=w1; ++k) {
        if (c[k]>csum)csum=c[k],cs=1;
        else if (c[k]==csum) cs++;
    }
    int flag=0;
    for (int j=1;j<=m;++j)
        if (b[a[j]]==bsum&&c[d[j]]==csum)flag++;
    //cout<<bs<<" "<<cs<<" "<<flag<<" "<<bsum<<" "<<csum<<endl;
    cout<<bsum+csum-(cs*bs==flag);
}

int main() {
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}