Advertisement
Zeinab_Hamdy

Untitled

Oct 27th, 2023
998
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.51 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define nl "\n"
  4. #define fi first
  5. #define se second
  6. #define pb push_back
  7. #define ll long long
  8. #define ull unsigned ll
  9. #define RV  return void
  10. // #define inf 2000000000
  11. #define sz(x) int(x.size())
  12. #define all(v) v.begin(), v.end()
  13. #define rall(v) v.rbegin(), v.rend()
  14. #define Mini(x) *min_element(all(x))
  15. #define Maxi(x) *max_element(all(x))
  16. #define fixed(n) fixed << setprecision(n)
  17. #define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
  18. #define cin(v) for (auto&i:v) cin >> i;
  19. #define cout(v) for (auto&i:v) cout << i << " ";
  20. #define clr(memo, x) memset(memo, x, sizeof memo)
  21. #define updmin(a, b) a = min(a, b)
  22. #define updmax(a, b) a = max(a, b)
  23. #define vi vector < int >
  24. #define vl vector < ll >
  25. #define vc vector < char >
  26. #define vs vector < string >
  27. #define v2i vector < vector < int > >
  28. #define v2l vector < vector < int > >
  29. #define seti set < int >
  30. #define setl set < ll >
  31. #define mapii map < int , int >
  32. #define mapll map < ll , ll >
  33. #define mapli map < ll , int >
  34. #define mapci map < char , int >
  35. #define mapsi map < string , int >
  36. #define pll pair < ll , ll >
  37. #define pii pair < int , int >
  38. #define range(l,r,x) for(int i=l ; i < r ; i+=x)
  39. #define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
  40. vector < string > ternary= {"NO\n" , "YES\n"};
  41.  
  42. void  Zainab(){
  43.             #ifndef ONLINE_JUDGE
  44.               freopen("input.txt", "r", stdin);
  45.               freopen("output.txt", "w", stdout);
  46.             #endif
  47. }
  48.  
  49.  
  50. /*================================  solution  ================================ */
  51.  
  52.  
  53. void myCode(){
  54.  
  55. int n ;
  56. cin >> n ;
  57.  
  58. vector < int > v(n) , freq(n+10);
  59.  
  60. vector < int > vis(n+10);
  61.  
  62. for(auto& i : v){
  63.     cin >> i;
  64.     vis[i]++;
  65. }
  66.  
  67.  
  68. auto sum =[&](ll x ){
  69.     return (x * (x+1)) /2 ;
  70. };
  71.  
  72. ll ans =sum(n-1);
  73.  
  74. for(int i =0 ; i < n ; i++){
  75.     int st = v[i];
  76.    
  77.     if(freq[v[i]]) continue;
  78.    
  79.     for(int j = st ; j <= n ; j +=st){
  80.         freq[v[i]]+= vis[j];
  81.     }
  82.  
  83.  
  84.     // if(freq[v[i]] > 1){
  85.     //     ans -= sum(freq[v[i]]-1);
  86.     // }
  87.    
  88. }
  89.  
  90. for(int i =1 ; i <= n ; i++){
  91.     cout << i <<" " << freq[i] << nl;
  92. }
  93.  
  94. cout << ans << nl;
  95.  
  96.  
  97. }
  98.  
  99.  
  100. int main(){
  101.  
  102.                                 FastCode ;
  103.                      Zainab() ;
  104.  
  105.             int testCase=1;
  106.                 cin >> testCase ;
  107.             for(int i=1 ; i<= testCase ; i++){
  108.                 //  cout << "Case #" << i << ": ";
  109.                 myCode();
  110.             }
  111.      
  112.  
  113.     return 0;
  114. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement