zoukankan      html  css  js  c++  java
  • CodeForces 152C Pocket Book

    Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    One day little Vasya found mom's pocket book. The book had n names of her friends and unusually enough, each name was exactly mletters long. Let's number the names from 1 to n in the order in which they are written.

    As mom wasn't home, Vasya decided to play with names: he chose three integers ijk (1 ≤ i < j ≤ n1 ≤ k ≤ m), then he took names number i and j and swapped their prefixes of length k. For example, if we take names "CBDAD" and "AABRD" and swap their prefixes with the length of 3, the result will be names "AABAD" and "CBDRD".

    You wonder how many different names Vasya can write instead of name number 1, if Vasya is allowed to perform any number of the described actions. As Vasya performs each action, he chooses numbers ijk independently from the previous moves and his choice is based entirely on his will. The sought number can be very large, so you should only find it modulo 1000000007(109 + 7).

    Input

    The first input line contains two integers n and m (1 ≤ n, m ≤ 100) — the number of names and the length of each name, correspondingly. Then n lines contain names, each name consists of exactly m uppercase Latin letters.

    Output

    Print the single number — the number of different names that could end up in position number 1 in the pocket book after the applying the procedures described above. Print the number modulo 1000000007(109 + 7).

    Sample Input

    Input
    2 3
    AAB
    BAA
    Output
    4
    Input
    4 5
    ABABA
    BCGDG
    AAAAA
    YABSA
    Output
    216

    Hint

    In the first sample Vasya can get the following names in the position number 1: "AAB", "AAA", "BAA" and "BAB".

     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <algorithm>
     4 using namespace std;
     5 int main()
     6 {
     7     int n,m;
     8     int i,j,k;
     9     char a[105][105];
    10     int b[30];
    11     long long c[1005];
    12     while(scanf("%d %d",&n,&m)!=EOF)
    13     {
    14         memset(c,0,sizeof(c));
    15         for(i=1;i<=n;i++)
    16             scanf("%s",a[i]);
    17         for(i=0;i<m;i++)
    18         {
    19             memset(b,0,sizeof(b));
    20             for(j=1;j<=n;j++)
    21             {
    22                 b[a[j][i]-'A']++;
    23             }
    24             for(j=0;j<=28;j++)
    25                 if(b[j])
    26                     c[i]++;
    27             //printf("%I64d
    ",c[i]);
    28         }
    29         long long ans=c[0];
    30         for(i=1;i<m;i++)
    31             ans=ans*(c[i]%1000000007)%1000000007;
    32         printf("%I64d
    ",ans);
    33     }
    34     return 0;
    35 }
    View Code
  • 相关阅读:
    laravel在控制器中动态创建数据表
    laravel模型关联:
    laravel的firstOrCreate的作用:先查找表,如果有就输出数据,如果没有就插入数据
    创建一个自定义颜色IRgbColor
    tnt_esri.dat Arcgis8.1安装license
    arcgis desktop 10.1 license manager无法启动问题解决
    解决ArcGIS安装之后出现的Windows installer configures问题
    Arcgis 10.1安装
    Arcgis10安装说明
    ARCGIS9.3安装说明
  • 原文地址:https://www.cnblogs.com/cyd308/p/4771491.html
Copyright © 2011-2022 走看看