MinhNGUYEN2k4

Untitled

Jan 2nd, 2022
1,160
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.36 KB | None | 0 0
  1. //Nguyen Huu Hoang Minh
  2. #include <bits/stdc++.h>
  3. #define sz(x) int(x.size())
  4. #define all(x) x.begin(),x.end()
  5. #define reset(x) memset(x, 0,sizeof(x))
  6. #define pb push_back
  7. #define mp make_pair
  8. #define fi first
  9. #define se second
  10. #define N 100005
  11. #define remain(x) if (x > MOD) x -= MOD
  12. #define ii pair<int, int>
  13. #define iiii pair< ii , ii >
  14. #define viiii vector< iiii >
  15. #define vi vector<int>
  16. #define vii vector< ii >
  17. #define bit(x, i) (((x) >> (i)) & 1)
  18. #define Task "TIRES"
  19. #define int long long
  20.  
  21. using namespace std;
  22.  
  23. typedef long double ld;
  24. const int inf = 1e10;
  25. const int minf = -1e10;
  26.  
  27. int n;
  28. int a[N];
  29. int cnt[N];
  30.  
  31. void readfile()
  32. {
  33.     ios_base::sync_with_stdio(false);
  34.     cin.tie(0);cout.tie(0);
  35.     if (fopen(Task".inp","r"))
  36.     {
  37.         freopen(Task".inp","r",stdin);
  38.         //freopen(Task".out","w",stdout);
  39.     }
  40.     cin >> n;
  41.     n++;
  42.     for(int i=1; i<=n; i++) cin >> a[i];
  43. }
  44.  
  45. void proc()
  46. {
  47.     sort(a+1,a+1+n);
  48.     vector<int> res;
  49.     for(int i=n; i>=1; i--){
  50.         bool ok = true;
  51.         for(int j=a[i]; j<=1e5; j+=a[i]){
  52.             if (cnt[j]){
  53.                 ok = false;
  54.                 break;
  55.             }
  56.         }
  57.         if (ok) res.pb(a[i]), cnt[a[i]]=1;
  58.     }
  59.     int ans = 0;
  60.     for(auto x : res) ans+=x-1;
  61.     cout << ans;
  62. }
  63.  
  64. signed main()
  65. {
  66.     readfile();
  67.     proc();
  68.     return 0;
  69. }
  70.  
Advertisement
Add Comment
Please, Sign In to add comment