Codeforces Round #355 (Div. 2) 题解(待补)

Vanya and Fence

int n=read(),h=read(),ans=0;
For(i,n){
ans+=1+(read()>h);
}
cout<<ans<<endl;

Vanya and Food Processor

ll n,h,k,ans=0;
cin>>n>>h>>k;
int l=0;
For(i,n) {
int p=read();
if (l+p<=h) l+=p;
else {
int c=0.5+ceil((double)(p+l-h)/(double)(k));
ans+=c;
l=max(0LL,l-c*k);
l+=p;
}
}
if(l) ans+=0.5+ceil((double)l/k);
cout<<ans<<endl;

Vanya and Label

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int idx(char c) {
if (isdigit(c)) return c-'0';
if ('A'<=c&&c<='Z') return c-'A'+10;
if ('a'<=c&&c<='z') return c-'a'+36;
if (c=='-') return 62;
return 63;
}
string s;
ll pow2(ll a,int b,ll p)  //a^b mod p
{
if (b==0) return 1%p;
if (b==1) return a%p;
ll c=pow2(a,b/2,p)%p;
c=c*c%p;
if (b&1) c=c*a%p;
return c%p;
}
int main()
{
//  freopen("c.in","r",stdin);
//  freopen(".out","w",stdout);

cin>>s;
int n=SI(s);
int t=0;
Rep(i,n) {
t+=__builtin_popcount(idx(s[i]));
}
cout<<pow2(3,6*n-t,F);
return 0;
}