Pocket Book

 

 

 题意：给n个长度为m的字符串，算出能组成多少个不同的字符串，只能出现在原来的下标

题解：算每一位不同字符的数量相乘就行了

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
char g[110][110];
ll ans=1;
ll mod=1e9+7;
map<int,int> ma;
void solve()
{
   int n,m;
   scdd(n,m);
   for(int i=1;i<=n;i++) cin>>g[i]+1;
   for(int i=1;i<=m;i++)
   {
       ma.clear();
       int res=0;
       for(int j=1;j<=n;j++)
       {
           int t=(int)g[j][i];
           if(!ma[t]) res++;
           ma[t]++;
       }
       ans=ans*res%mod;
   }
   ac;
}
int main()
{
    //init();
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}