fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<string> a;
  31.  
  32. int consistency(int n, int m){
  33.  
  34. vector<int> f(m);
  35. for(int j=0; j<m; j++){
  36. unordered_set<char> st;
  37. for(int i=0; i<n; i++){
  38. st.insert(a[i][j]);
  39. }
  40. f[j] = st.size();
  41. }
  42.  
  43. int ans = 1;
  44. for(int j=0; j<m; j++){
  45. ans = (ans * f[j])%M;
  46. }
  47.  
  48. return ans;
  49.  
  50. }
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. int practice(int n, int m){
  67.  
  68.  
  69. return 0;
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76. void solve() {
  77.  
  78. int n, m;
  79. cin>> n >> m;
  80.  
  81. a.resize(n);
  82. for(int i=0; i<n; i++) cin >> a[i];
  83.  
  84. cout << consistency(n, m) << endl;
  85.  
  86.  
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. int32_t main() {
  94. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  95.  
  96. int t = 1;
  97. // cin >> t;
  98. while (t--) {
  99. solve();
  100. }
  101.  
  102. return 0;
  103. }
Success #stdin #stdout 0s 5304KB
stdin
4 5
ABABA
BCGDG
AAAAA
YABSA
stdout
216