Codeforces Round #266 (Div. 2)

A：简单算术问题

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>

using namespace std;

#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define DWN(i,h,l) for(int i=(h);i>=(l);--i)
#define CLR(vis,pos) memset(vis,pos,sizeof(vis))
#define PI acos(-1.0)
#define INF 0x7FFFFFFF
#define LINF 1000000000000000000LL
#define eps 1e-8

typedef long long ll;

int main()
{
    int n,m,a,b;
    cin>>n>>m>>a>>b;
    int sum1=INF,sum2=INF,sum3=INF;
    sum1=n*a;
    int c;
    if(n%m==0)
     sum2=n/m*b;
    else
     c=n/m,sum2=(c+1)*b,sum3=(c*b)+(n-c*m)*a;
    cout<<min(sum1,min(sum2,sum3))<<endl;

    return 0;
}

B：暴力枚举边长

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>

using namespace std;

#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define DWN(i,h,l) for(int i=(h);i>=(l);--i)
#define CLR(vis,pos) memset(vis,pos,sizeof(vis))
#define PI acos(-1.0)
#define INF 0x7FFFFFFF
#define LINF 1000000000000000000LL
#define eps 1e-8

typedef long long ll;

int main()
{
    ll n,a,b;
    cin>>n>>a>>b;

    n*=6;
    int flag=0;
    if(a*b>=n)
    {
        cout<<a*b<<endl;
        cout<<a<<" "<<b<<endl;
        return 0;
    }

    if(a>b)
        swap(a,b),flag=1;
    ll x;
    ll ansa=INF,ansb=INF;
    x=n/b;
    if(x*b<n) x++;
    ll ta,tb;
    FOR(i,a,x)
    {
        ta=i;
        tb=n/ta;
        if(ta*tb<n) tb++;

        if(ta>tb) break;
        //cout<<ansa*ansb<<" "<<ta*tb<<endl;
        ll sum1=ansa*ansb;
        ll sum2=ta*tb;
        if(ta>=a && tb>=b && ta*tb>=n && sum1>sum2)
        {
            ansa=ta,ansb=tb;
            //cout<<ta<<" "<<tb<<endl;
        }
    }

    if(flag && ansa<ansb)
        swap(ansa,ansb);

    cout<<ansa*ansb<<endl;

    cout<<ansa<<" "<<ansb<<endl;




    return 0;
}

C：算一下就行了。。T T感觉自己做麻烦了。。

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>

using namespace std;

#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define DWN(i,h,l) for(int i=(h);i>=(l);--i)
#define CLR(vis,pos) memset(vis,pos,sizeof(vis))
#define PI acos(-1.0)
#define INF 0x7FFFFFFF
#define LINF 1000000000000000000LL
#define eps 1e-8

typedef long long ll;

int scan()
{
   char c;
   while(c=getchar(),(c<'0'||c>'9')&&(c!='-'));
   bool flag=(c=='-');
   if(flag) c=getchar();
   int x=0;
   while(c>='0'&&c<='9')
   {
      x=x*10+c-48;
      c=getchar();
   }
   return flag?-x:x;
}

const int maxn=5*1e5+100;

int a[maxn];

int n;

ll sum[maxn];
ll vis;

ll p1[maxn],p2[maxn];

int main()
{
    n=scan();
    sum[0]=0;
    FOR(i,1,n)
    {
         a[i]=scan();
         sum[i]=sum[i-1]+a[i];
    }

    if(sum[n]%3!=0 || n<3)
    {
        printf("0\n");
        return 0;
    }

    vis=sum[n]/3;
    ll len1=0,len2=0;
    p1[len1]=0,p2[len2]=0;
    FOR(i,1,n-1)
    {
        if(sum[i]==vis && i<=n-2)
            p1[++len1]=i;
        if(sum[i]==2*vis && i<=n-1 && i>=2 && sum[n]-sum[i]==vis)
            p2[++len2]=i;
    }

    ll ans=0;
    int k;
    FOR(i,1,len1)
    {
        k=upper_bound(p2+1,p2+len2+1,p1[i])-p2;
        k--;
        ans+=(len2-k);
    }
    cout<<ans<<endl;

    return 0;
}

E有思路，有时间补