链接:http://codeforces.com/contest/677/problem/C
题意:设定一些字符是0~63的整数。给定一个字符串s,求有多少个s'使得s'&s=s。
分析:预处理出f[i]表示有多少字符对(s,t)有s&t=i,然后就乘法原理计算答案即可。
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=100010;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
char s[N];
int f[65];
void deal() {
memset(f,0,sizeof(f));
for (int i=0;i<64;i++)
for (int j=0;j<64;j++) f[i&j]++;
}
int main()
{
int i,len;
ll ans=1;
scanf("%s", s);
len=strlen(s);deal();
for (i=0;i<len;i++)
if (s[i]>='0'&&s[i]<='9') {
ans=(ans*f[s[i]-'0'])%MOD;
} else if (s[i]>='A'&&s[i]<='Z') {
ans=(ans*f[s[i]-'A'+10])%MOD;
} else if (s[i]>='a'&&s[i]<='z') {
ans=(ans*f[s[i]-'a'+36])%MOD;
} else if (s[i]=='-') ans=(ans*f[62])%MOD;
else ans=(ans*f[63])%MOD;
printf("%I64d\n", (ans+MOD)%MOD);
return 0;
}