Cod sursa(job #1216140)

Utilizator bogdanboboc97Bogdan Boboc bogdanboboc97 Data 3 august 2014 14:34:21
Problema Invers modular Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
#include <cstring>

using namespace std;

ifstream cin("spion.in");
ofstream cout("spion.out");

const int mod=100003;

int gcd(int a,int b)
{
    int p=1;
    for(;b;b>>=1)
    {
        if(b&1)p=(1LL*p*a)%mod;
        a=(1LL*a*a)%mod;
    }
    return p;
}

int n,k,f[mod],e,t,i;
char s[mod];

int main()
{
    cin>>t;
    cin>>s;
    for(n=strlen(s),i=0;i<n;i++)
    if(s[i]=='E')k++;
    if(t==2){
    f[0]=f[1]=1;
    for(i=2;i<=n;i++)f[i]=(i*f[i-1]*1LL)%mod;
    if(n==0 || k==0)cout<<1;
    else cout<<1LL*f[n]*gcd(f[k]*1LL*f[n-k]%mod,mod-2)%mod;
    }
    else cout<<k+1;
    return 0;
}