Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /// Mygo
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("mygo.in");
- ofstream fout("mygo.out");
- const int MOD = 666013;
- int a[10],s,sol,c[1001][1001];
- void solve()
- {
- int nr=1,n=s;
- for(int i=0; i<9; i++)
- {
- nr=1LL*nr*c[n][a[i]]%MOD;
- n-=a[i];
- }
- sol=(sol+nr)%MOD;
- }
- int main()
- {
- for(int i=0; i<=9; i++)
- {
- fin>>a[i];
- s+=a[i];
- }
- s--;
- for(int i=0; i<=s; i++)
- c[i][0]=c[i][i]=1;
- for(int n=2; n<=s; n++)
- for(int k=1; k<n; k++)
- c[n][k]=(c[n-1][k]+c[n-1][k-1])%MOD;
- for(int i=1; i<=9; i++)
- if(a[i])
- {
- a[i]--;
- solve();
- a[i]++;
- }
- fout<<sol;
- return 0;
- }
- /// search
- int IndexOf(char s[], char ch)
- {
- for(int i=0; s[i]!=NULL; i++)
- if(s[i]==ch)
- return i;
- return -1;
- }
- int LastIndexOf(char s[], char ch)
- {
- int aux=-1;
- for(int i=0; s[i]!=NULL; i++)
- if(s[i]==ch)
- aux=i;
- return aux;
- }
- int NthIndex(char s[], char ch, int k)
- {
- for(int i=0; s[i]!=NULL ; i++)
- if(s[i]==ch)
- {
- k--;
- if(!k)
- return i;
- }
- return -1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement