Codeforces_837

A.扫一遍。

#include<bits/stdc++.h>
using namespace std;

int n;
string s;

int main()
{
    cin >> n;
    getchar();
    getline(cin,s);
    int ans = ,maxx = ;
    for(int i = ;i < n;i++)
    {
        if(s[i] == ' ') maxx = ;
        else
        {
            if(s[i] >= 'A' && s[i] <= 'Z') maxx++;
            ans = max(ans,maxx);
        }
    }
    cout << ans << endl;
    return ;
}

---

B.暴力判断两种情况。

#include<bits/stdc++.h>
using namespace std;

int n,m;
string s[],ss[];

int main()
{
    cin >> n >> m;
    for(int i = ;i <= n;i++)
    {
        cin >> s[i];
        s[i] = ' '+s[i];
    }
    int flag = ;
    if(n% == )
    {
        int t1 = n/+,t2 = n/*+;
        char a = s[][],b = s[t1][],c = s[t2][];
        if(a != b && b != c && a != c)
        {
            int ok = ;
            for(int i = ;i < t1;i++)
            {
                for(int j = ;j <= m;j++)
                {
                    if(s[i][j] != a)    ok = ;
                }
            }
            for(int i = t1;i < t2;i++)
            {
                for(int j = ;j <= m;j++)
                {
                    if(s[i][j] != b)    ok = ;
                }
            }
            for(int i = t2;i <= n;i++)
            {
                for(int j = ;j <= m;j++)
                {
                    if(s[i][j] != c)    ok = ;
                }
            }
            if(ok)  flag = ;
        }
    }
    if(m% == )
    {
        int t1 = m/+,t2 = m/*+;
        char a = s[][],b = s[][t1],c = s[][t2];
        if(a != b && b != c && a != c)
        {
            int ok = ;
            for(int i = ;i < t1;i++)
            {
                for(int j = ;j <= n;j++)
                {
                    if(s[j][i] != a)    ok = ;
                }
            }
            for(int i = t1;i < t2;i++)
            {
                for(int j = ;j <= n;j++)
                {
                    if(s[j][i] != b)    ok = ;
                }
            }
            for(int i = t2;i <= m;i++)
            {
                for(int j = ;j <= n;j++)
                {
                    if(s[j][i] != c)    ok = ;
                }
            }
            if(ok)  flag = ;
        }
    }
    if(flag)    cout << "YES" << endl;
    else    cout << "NO" << endl;
    return ;
}

---

C.暴力取两辆，判断是否可行。

#include<bits/stdc++.h>
using namespace std;

int n,a,b,x[],y[];

bool ok(int i,int j)
{
    if(x[i]+y[j] <= a && max(y[i],x[j]) <= b)    return ;
    if(x[i]+y[j] <= b && max(y[i],x[j]) <= a)    return ;
    if(x[i]+x[j] <= a && max(y[i],y[j]) <= b)    return ;
    if(x[i]+x[j] <= b && max(y[i],y[j]) <= a)    return ;
    if(y[i]+y[j] <= b && max(x[i],x[j]) <= a)    return ;
    if(y[i]+y[j] <= a && max(x[i],x[j]) <= b)    return ;
    if(y[i]+x[j] <= b && max(x[i],y[j]) <= a)    return ;
    if(y[i]+x[j] <= a && max(x[i],y[j]) <= b)    return ;
    return ;
}

int main()
{
    ios::sync_with_stdio();
    cin >> n >> a >> b;
    for(int i = ;i <= n;i++)   cin >> x[i] >> y[i];
    int ans = ;
    for(int i = ;i <= n;i++)
    {
        for(int j = i+;j <= n;j++)
        {
            if(ok(i,j)) ans = max(ans,x[i]*y[i]+x[j]*y[j]);
        }
    }
    cout << ans << endl;
    return ;
}

---

D.dp。

#include<bits/stdc++.h>
using namespace std;

int n,k,cnt1[] = {},cnt2[] = {},dp[][];
long long a[];

int main()
{
    ios::sync_with_stdio();
    cin >> n >> k;
    for(int i = ;i <= n;i++)   cin >> a[i];
    for(int i = ;i <= n;i++)
    {
        while(a[i]% == )
        {
            a[i] /= ;
            cnt2[i]++;
        }
        while(a[i]% == )
        {
            a[i] /= ;
            cnt1[i]++;
        }
    }
    memset(dp,-,sizeof(dp));
    dp[][] = ;
    for(int i = ;i <= n;i++)
    {
        for(int j = k;j >= ;j--)
        {
            for(int t = ;t >= cnt1[i];t--)
            {
                if(dp[j-][t-cnt1[i]] != -)    dp[j][t] = max(dp[j][t],dp[j-][t-cnt1[i]]+cnt2[i]);
            }
        }
    }
    int ans = ;
    for(int i = ;i <= ;i++)    ans = max(ans,min(i,dp[k][i]));
    cout << ans << endl;
    return ;
}

---

E.有很多次操作，只会把b减一，我们对于每一次gcd != 1之前，对a的每个因子取模统计 gcd == 1的次数，统一减。另外，已经被b约去的因子，可以在之后的步骤不考虑。

#include<bits/stdc++.h>
using namespace std;

long long a,b;

int main()
{
    ios::sync_with_stdio();
    cin >> a >> b;
    long long t = __gcd(a,b);
    a /= t;
    b /= t;
    vector<long long> v;
    for(long long i = ;i*i <= a;i++)
    {
        while(a%i == )
        {
            a /= i;
            v.push_back(i);
        }
    }
    if(a > )   v.push_back(a);
    long long ans = ;
    while(b)
    {
        long long t = b;
        for(auto it = v.begin();it != v.end();it++) t = min(t,b%(*it));
        ans += t;
        b -= t;
        vector<long long> vv;
        for(auto it = v.begin();it != v.end();it++)
        {
            long long t = *it;
            if(b%t == )    b /= t;
            else    vv.push_back(t);
        }
        v = vv;
    }
    cout << ans << endl;
    return ;
}

---