求救啊
by 追风少年σχ @ 2019-08-19 23:14:32
```cpp
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n,B[8],E[8],S[8],I[8],G[8],O[8],M[8];
long long ans;
bool judge(int b,int e,int s,int i,int g,int o,int m){
return ((((b+e+s+s+i+e)*(g+o+e+s)*(m+o+o))%7)==0);
}
long long sum(int b,int e,int s,int i,int g,int o,int m){
return 1ll*B[b]*E[e]*S[s]*I[i]*G[g]*O[o]*M[m];
}
int main(){
char ch;
int x;
scanf("%d",&n);
while(n--){
cin>>ch>>x;
x+=77777777;
switch(ch){
case 'B':B[x%7]++;break;
case 'E':E[x%7]++;break;
case 'S':S[x%7]++;break;
case 'I':I[x%7]++;break;
case 'G':G[x%7]++;break;
case 'O':O[x%7]++;break;
case 'M':M[x%7]++;break;
}
}
for(int b=0;b<7;b++)
for(int e=0;e<7;e++)
for(int s=0;s<7;s++)
for(int i=0;i<7;i++)
for(int g=0;g<7;g++)
for(int o=0;o<7;o++)
for(int m=0;m<7;m++)
ans+=judge(b,e,s,i,g,o,m)*sum(b,e,s,i,g,o,m);
printf("%lld",ans);
}
```
@[copy__半醒半梦](/space/show?uid=31621)
by iwprc @ 2019-08-19 23:26:18
这位**妹子**，您好，x可能是负数
by iwprc @ 2019-08-19 23:27:19
~~加粗的"妹子"好评~~
by 吾皇 @ 2019-08-19 23:31:16
@[HybridTheory](/space/show?uid=41485) 感激不尽。。。（尴尬。。。）
by 追风少年σχ @ 2019-08-20 14:53:49
qwq
by iwprc @ 2019-08-20 14:55:01