Advertisement
Ahmed_Negm

Untitled

Mar 6th, 2023
553
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.65 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4. using namespace std;
  5. using namespace __gnu_pbds;
  6. #define ll long long
  7. #define OO 2'000'000'000
  8. #define ull unsigned long long
  9. #define nl '\n'
  10. #define sz(x) (ll)(x.size())
  11. #define all(x) x.begin(),x.end()
  12. #define rall(s)  s.rbegin(), s.rend()
  13. #define getline(s) getline(cin>>ws,s)
  14. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  15. #define pi  3.141592653589793
  16. #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
  17. #define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
  18.  
  19.  
  20. void Fast_IO(){
  21. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  22. // freopen("filename.in", "r", stdin);
  23. // freopen("filename.txt", "w", stdout);
  24. #ifndef ONLINE_JUDGE
  25. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  26. #endif
  27. }
  28.  
  29.  
  30.  
  31.  
  32. int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
  33. int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };
  34.  
  35. const int MOD = 1e9 + 7;
  36.  
  37. vector<ll>fact(15,1);
  38.  
  39. void solve(){
  40.   ll n; cin>>n;
  41.     vector<ll> v(n);
  42.     for(int i=0;i<n;i++) cin>>v[i];
  43.     sort(rall(v));
  44.     for(ll i=1;i<15;i++){
  45.         fact[i] = fact[i-1]*i;
  46.     }
  47.     ll ans = 0;
  48.     // generating all subsets of size 3
  49.     for(int i=0;i<n;i++){
  50.         for(int j=i+1;j<n;j++){
  51.             for(int k=j+1;k<n;k++){
  52.                 if(v[i]%v[j]==0 and v[i]%v[k]==0) ans+=(2*fact[n-3])%MOD;
  53.             }
  54.         }
  55.     }
  56.     cout<<ans<<nl;
  57.  
  58.  
  59.  
  60. }
  61.  
  62. int main(){
  63.     Fast_IO();
  64. int t =1;
  65. //cin>>t;
  66. while(t--){
  67. solve();
  68. }
  69. return 0;
  70. }  
  71.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement