fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. const int MOD = 1000000007;
  5.  
  6. int binpower(int a,int b,int MOD) {
  7. int ans = 1;
  8. while(b) {
  9. if(b%2) {
  10. ans = (ans*a)%MOD;
  11. }
  12. a = (a*a)%MOD;
  13. b = b/2;
  14. }
  15. return ans;
  16. }
  17.  
  18. const int N = 1e5 + 5;
  19. int fact[N] = {1};
  20. int nCr(int n,int r) {
  21. int ans = (fact[n-r]*fact[r])%MOD;
  22. ans = binpower(ans,MOD-2,MOD);
  23. ans = (fact[n]*ans)%MOD;
  24. return ans;
  25. }
  26. void solve() {
  27. int n;
  28. cin>>n;
  29. vector<int> a(n+1);
  30. int twice = 0;
  31. int index = -1;
  32. set<int> s;
  33. for(int i=0;i<n+1;i++) {
  34. cin>>a[i];
  35. if(s.find(a[i])!=s.end()) {
  36. twice = a[i];
  37. }
  38. s.insert(a[i]);
  39. }
  40. for(int i=0;i<n+1;i++) {
  41. if(a[i]==twice) {
  42. if(index==-1) {
  43. index = i;
  44. } else {
  45. index = index + n - i;
  46. }
  47. }
  48. }
  49. int free = index;
  50. for(int i=1;i<=n+1;i++) {
  51. int total = nCr(n+1,i);
  52. int not_fixed = i-1;
  53. int remove = 0;
  54. if(not_fixed<=free) {
  55. remove = nCr(free,not_fixed);
  56. }
  57. total = (total - remove + MOD)%MOD;
  58. cout<<total<<endl;
  59. }
  60. }
  61.  
  62. signed main() {
  63. #ifndef ONLINE_JUDGE
  64. freopen("input.txt", "r", stdin);
  65. freopen("output.txt", "w", stdout);
  66. #endif
  67. int t = 1;
  68. // cin >> t;
  69. for(int i=1;i<N;i++) {
  70. fact[i] = (fact[i-1]*i)%MOD;
  71. }
  72. while (t--) {
  73. solve();
  74. }
  75. return 0;
  76. }
  77.  
Success #stdin #stdout 0.01s 5328KB
stdin
32
29 19 7 10 26 32 27 4 11 20 2 8 16 23 5 14 6 12 17 22 18 30 28 24 15 1 25 3 13 21 19 31 9
stdout
32
525
5453
40919
237336
1107568
4272048
13884156
38567100
92561040
193536720
354817320
573166440
818809200
37158313
166803103
166803103
37158313
818809200
573166440
354817320
193536720
92561040
38567100
13884156
4272048
1107568
237336
40920
5456
528
33
1