Advertisement
Ahmed_Negm

Untitled

Mar 6th, 2023
605
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.48 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.  
  36. const int MOD = 1e9 + 7;
  37.  
  38.  
  39. void solve(){
  40. ll n; cin>>n;
  41. const ll MOD = 1e9+7;
  42. vector<ll>v(n);
  43. for(auto&i:v) cin>>i;
  44. sort(all(v));
  45. ll ans =0;
  46. do{
  47.     ll cnt = 0;
  48.     for(int i=0;i<n-1;i++){
  49.         cnt+=(v[i]%v[i+1]==0 or v[i+1]%v[i]==0);
  50.     }
  51.     ans+=(cnt==n-1)%MOD;;
  52. }while(next_permutation(all(v)));
  53. cout<<ans%MOD<<nl;
  54.  
  55.  
  56.  
  57.  
  58. }
  59.  
  60. int main(){
  61.     Fast_IO();
  62. int t =1;
  63. //cin>>t;
  64. while(t--){
  65. solve();
  66. }
  67. return 0;
  68. }
  69.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement