Submission #7684680
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T> >;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define repb(i, n) for(ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for(ll i = (a); i < (b); i++)
#define reprb(i, a, b) for(ll i = (a)-1; i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; }
inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; }
inline ll powint(unsigned long long x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; }
inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; }
template<class S, class T>inline bool chmax(S &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class S, class T>inline bool chmin(S &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
vll divisor(int n){
vll res;
for(int i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i * i != n) res.push_back(n / i);
}
}
sort(ALL(res));
return res;
}
vll divk;
vi cnt;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n){
cin >> a[i];
a[i] = GCD(a[i], k);
}
divk = divisor(k);
cnt.resize(SZ(divk), 0);
rep(i, n){
rep(j, SZ(divk)){
if(a[i] == divk[j]){
cnt[j]++;
break;
}
}
}
ll ans = 0;
rep(i, SZ(divk)){
if(cnt[i] > 0){
rep(j, SZ(divk)){
if(cnt[j] > 0 && (divk[i]*divk[j])%k == 0){
if(i == j){
ans += cnt[i]*(cnt[i]-1);
}else{
ans += cnt[i]*cnt[j];
}
}
}
}
}
dump(cnt);
cout << ans/2 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - ロト2 |
User |
RTnF |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2538 Byte |
Status |
WA |
Exec Time |
170 ms |
Memory |
1920 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All |
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_random_01.txt, 10_random_02.txt, 10_random_03.txt, 10_random_04.txt, 10_random_05.txt, 20_max_01.txt, 20_max_02.txt, 20_max_03.txt, 20_max_04.txt, 20_max_05.txt, 30_overflow_01.txt, 30_overflow_02.txt, 40_dmax_01.txt, 40_dmax_02.txt, 40_dmax_03.txt, 50_prime_01.txt, 50_prime_02.txt, 50_prime_03.txt, 60_prime_pow_01.txt, 60_prime_pow_02.txt, 60_prime_pow_03.txt, 70_one_01.txt |
Case Name |
Status |
Exec Time |
Memory |
00_example_01.txt |
AC |
1 ms |
256 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
00_example_03.txt |
AC |
1 ms |
256 KB |
10_random_01.txt |
AC |
1 ms |
256 KB |
10_random_02.txt |
AC |
1 ms |
256 KB |
10_random_03.txt |
AC |
1 ms |
256 KB |
10_random_04.txt |
AC |
1 ms |
256 KB |
10_random_05.txt |
AC |
1 ms |
256 KB |
20_max_01.txt |
AC |
33 ms |
1792 KB |
20_max_02.txt |
WA |
30 ms |
1792 KB |
20_max_03.txt |
AC |
42 ms |
1792 KB |
20_max_04.txt |
WA |
30 ms |
1792 KB |
20_max_05.txt |
AC |
46 ms |
1792 KB |
30_overflow_01.txt |
WA |
31 ms |
1792 KB |
30_overflow_02.txt |
WA |
31 ms |
1792 KB |
40_dmax_01.txt |
AC |
170 ms |
1920 KB |
40_dmax_02.txt |
AC |
170 ms |
1920 KB |
40_dmax_03.txt |
AC |
170 ms |
1920 KB |
50_prime_01.txt |
WA |
32 ms |
1792 KB |
50_prime_02.txt |
WA |
36 ms |
1792 KB |
50_prime_03.txt |
AC |
42 ms |
1792 KB |
60_prime_pow_01.txt |
AC |
44 ms |
1792 KB |
60_prime_pow_02.txt |
AC |
42 ms |
1792 KB |
60_prime_pow_03.txt |
WA |
41 ms |
1792 KB |
70_one_01.txt |
WA |
21 ms |
1792 KB |