fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define FR0(i,N) for(i=0;i<(N);i++)
  4. #define FR1(i,N) for(i=1;i<=(N);i++)
  5. #define FRN(i,k,N) for(i=k;i<(N);i++)
  6. #define pf printf
  7. #define db double
  8. #define max3(a,b,c) max(max(a,b),c)
  9. #define min3(a,b,c) min(min(a,b),c)
  10. #define sci(n) scanf("%d",&n)
  11. #define scl(n) scanf("%lld",&n)
  12. #define scf(n) scanf("%f",&n)
  13. #define scd(n) scanf("%lf",&n)
  14. #define scs(s) scanf("%s",&s)
  15. #define scll(n) scanf("%%I64d",&n)
  16. #define PI acos(-1.0)
  17. #define LL long long
  18. #define MX 1000005
  19. #define MOD 1000000007
  20. typedef long long int ll;
  21. bool status[1100002];
  22.  
  23. int main()
  24. {
  25. ll dearrangement[12] = {0,1, 2, 9, 44, 265, 1854, 14833, 133496, 1334961, 14684570, 176214841};
  26. ll factorial [12]= {1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600} ;
  27. int test,n;
  28. cin>>test;
  29. while(test--)
  30. {
  31. cin>>n;
  32. cout<<dearrangement[n-1]<<"/"<<factorial[n-1]<<endl;
  33. }
  34. }
  35.  
  36.  
  37.  
Success #stdin #stdout 0s 4532KB
stdin
3
2
3
4
stdout
1/2
2/6
9/24