2017 计蒜之道 第二场 A. 百度的年会游戏

传送门

大模拟。

#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#define pi acos(-1)
#define endl '\n'
#define me(x) memset(x,0,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0);
#define rand() srand(time(0));
typedef long long LL;
typedef pair<int, int> pii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,-1,-1,1,1};
const int dy[]={0,1,0,-1,1,-1,1,-1};
const int maxn=1e3+5;
const int maxx=1e6+100;
const double EPS=1e-9;
const int MOD=1000000007;
#define mod(x) ((x)%MOD);
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
//typedef tree<pt,null_type,less< pt >,rb_tree_tag,tree_order_statistics_node_update> rbtree;
/*lch[root] = build(L1,p-1,L2+1,L2+cnt);
rch[root] = build(p+1,R1,L2+cnt+1,R2);中前*/
/*lch[root] = build(L1,p-1,L2,L2+cnt-1);
rch[root] = build(p+1,R1,L2+cnt,R2-1);中后*/
long long gcd(long long a , long long b){if(b==0) return a;a%=b;return gcd(b,a);}

int val1,val2;
int a[4],k,d;
int main()
{
int num=0,ans=0,num1,num2,num3,num4;
cin>>num1>>num2>>num3>>num4;
cin>>k>>d;
a[1]=num1;
a[2]=num4;
a[3]=num3;
a[4]=num2;
if(k==4)
num+=a[1];
if(k==3)
num+=(a[1]+a[2]);
if(k==2)
num+=(a[1]+a[2]+a[3]);
num+=d;
val1=num;
val2=num+1;
for(int i=1;i<=6;i++)
{
for(int j=1;j<=6;j++)
{
if(i>j)
continue;
num=i+j;
num%=4;
if(num==0)
num=4;
int sum=0;
if(num==4)
sum+=a[1];
if(num==3)
sum+=(a[1]+a[2]);
if(num==2)
sum+=(a[1]+a[2]+a[3]);
sum+=(i+1);
// cout<<sum<<" first"<<" "<<i<<" "<<j<<endl;
if(sum==val1)
ans++;
if(sum+1>54)
sum-=54;
sum+=8;
if(sum>54)
sum-=54;
// cout<<sum<<" second"<<endl;
if(sum==val1)
ans++;
if(sum+1>54)
sum-=54;
sum+=8;
if(sum>54)
sum-=54;
// cout<<sum<<" third"<<endl;
if(sum==val1)
ans++;
}
}
cout<<ans<<endl;
}