fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int gcd(int a, int b){
  33.     if(b==0) return a;
  34.     return gcd(b, a%b);
  35. }
  36.  
  37. int consistency1(int n, int k){
  38.  
  39.     unordered_map<int,int> mp;
  40.     long long ans = 0;
  41.     for(int i=0; i<n; i++){
  42.         int target = k/gcd(k,a[i]);
  43.         if(mp.count(target)){
  44.             ans += mp[target];
  45.         }
  46.         //* Update map with divisors/factors of a[i]
  47.         int x = a[i];
  48.         for(int j=1; j*j<=x; j++){
  49.             if(x%j != 0) continue;
  50.             mp[j]++;
  51.             if(j != x/j) mp[x/j]++;
  52.         }
  53.     }
  54.  
  55.     return ans;
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int consistency2(int n, int k){
  63.  
  64.     unordered_map<int,int> gcdMp;
  65.  
  66.     long long ans = 0;
  67.  
  68.     for(int i=0; i<n; i++){
  69.         int x = gcd(k,a[i]);
  70.  
  71.         for(auto& t : gcdMp){
  72.         	int y = t.first;
  73.         	int ct = t.second;
  74.  
  75.         	if((x*y)%k == 0) ans += ct;
  76.         }
  77.         gcdMp[x]++;
  78.     }
  79.  
  80.     return ans;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int practice(int n, int k){
  96.  
  97.  
  98.     return 0;
  99. }
  100.  
  101.  
  102.  
  103.  
  104.  
  105. void solve() {
  106.  
  107.     int n, k;
  108.     cin>> n >> k;
  109.  
  110.     a.resize(n);
  111.     for(int i=0; i<n; i++) cin >> a[i];
  112.  
  113.     cout << consistency1(n, k) << " " << consistency2(n, k) << endl;
  114.  
  115.  
  116. }
  117.  
  118.  
  119.  
  120.  
  121.  
  122. int32_t main() {
  123.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  124.  
  125.     int t = 1;
  126.     // cin >> t;
  127.     while (t--) {
  128.         solve();
  129.     }
  130.  
  131.     return 0;
  132. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
5 2
1 2 3 4 5
stdout
copy 
7 7
https://ideone.com/gTwLeD
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!