zoukankan      html  css  js  c++  java
  • Codeforces Round #295 (Div. 2)C

    C. DNA Alignment
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Vasya became interested in bioinformatics. He's going to write an article about similar cyclic DNA sequences, so he invented a new method for determining the similarity of cyclic sequences.

    Let's assume that strings s and t have the same length n, then the function h(s, t) is defined as the number of positions in which the respective symbols of s and t are the same. Function h(s, t) can be used to define the function of Vasya distance ρ(s, t):

    where is obtained from string s, by applying left circular shift i times. For example,
    ρ("AGC", "CGT") = 
    h("AGC", "CGT") + h("AGC", "GTC") + h("AGC", "TCG") + 
    h("GCA", "CGT") + h("GCA", "GTC") + h("GCA", "TCG") + 
    h("CAG", "CGT") + h("CAG", "GTC") + h("CAG", "TCG") = 
    1 + 1 + 0 + 0 + 1 + 1 + 1 + 0 + 1 = 6

    Vasya found a string s of length n on the Internet. Now he wants to count how many strings t there are such that the Vasya distance from the string s attains maximum possible value. Formally speaking, t must satisfy the equation: .

    Vasya could not try all possible strings to find an answer, so he needs your help. As the answer may be very large, count the number of such strings modulo 109 + 7.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 105).

    The second line of the input contains a single string of length n, consisting of characters "ACGT".

    Output

    Print a single number — the answer modulo 109 + 7.

    Sample test(s)
    Input
    1
    C
    Output
    1
    Input
    2
    AG
    Output
    4
    Input
    3
    TTT
    Output
    1
    Note

    Please note that if for two distinct strings t1 and t2 values ρ(s, t1) и ρ(s, t2) are maximum among all possible t, then both strings must be taken into account in the answer even if one of them can be obtained by a circular shift of another one.

    In the first sample, there is ρ("C", "C") = 1, for the remaining strings t of length 1 the value of ρ(s, t) is 0.

    In the second sample, ρ("AG", "AG") = ρ("AG", "GA") = ρ("AG", "AA") = ρ("AG", "GG") = 4.

    In the third sample, ρ("TTT", "TTT") = 27

    int idx(char a)
    {
        if(a=='A')
            return 0;
        if(a=='G')
            return 1;
        if(a=='C')
            return 2;
        if(a=='T')
            return 3;
    }
    int flag[4];
    int powmod(int a,int b) {
        LL ans = 1,x = a;
        while (b) {
            if (b & 1) ans = ans * x % MOD;
            x = x * x % MOD;
            b >>= 1;
        }
        return ans;
    }
    int main()
    {
        int n;
        cin>>n;
        string s;
        cin>>s;
        REP(i,s.size())
            flag[idx(s[i])]++;
        int max_num=0;
        int max_kiss=0;
        REP(i,4)
            max_num=max(max_num,flag[i]);
        REP(i,4)
        {
            if(flag[i]==max_num)
                max_kiss++;
        }
        cout<<powmod(max_kiss,n)<<endl;
    }
  • 相关阅读:
    身份证的测试用例
    集合
    网易考拉测试面试题整理
    linux基本指令分类
    网络编程
    设计模式
    MySQL中的索引
    MySQL中的事务
    Java判断字符串是否为乱码
    Activiti6.x删除外键
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4313025.html
Copyright © 2011-2022 走看看