Submission #1634847


Source Code Expand

                            #include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                    #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,pa>
                            #define ppa pair<int,int>
                            #define ppap pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                  
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                             double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
bool parareru(Point a,Point b,Point c,Point d){
//	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
	return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
  return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
//		cout<<"sss"<<endl;
		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
		return false;
	}
  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
 
double segment_dis(Segment a,Segment b){
	if(is_intersected_ls(a,b))return 0;
	double r=distance_ls_p(a.p1, a.p2, b.p1);
	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
	return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2-b.p1;
  double d1 = abs(cross(ba, a.p1-b.p1));
  double d2 = abs(cross(ba, a.p2-b.p1));
  double t = d1 / (d1 + d2);
 
  return a.p1 + (a.p2-a.p1) * t;
}
 
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
 
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }
                /*
int pr[100010];
//int inv[100010];
*/ 
int beki(int wa,int rr,int warukazu){
	if(rr==0) return 1ll;
	if(rr==1) return wa%warukazu;
	if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
	int zx=beki(wa,rr/2,warukazu);
	return (zx*zx)%warukazu;
}
  /*
void gya(){
	pr[0]=1;
	for(int i=1;i<100010;i++){
		pr[i]=(pr[i-1]*i)%inf;
	}
	for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
	
}
 
*/
 
                         //----------------kokomade tenpure------------
          vector<int> prime,kosuu;            
map<int,int> ma;
signed main(){
int n,k,p,pp;
	cin>>n>>k;
	int kk=k;
	for(int i=2;i<=100000;i++){
		if(kk%i!=0) continue;
		int cnt=0;
		while(kk%i==0){
			kk /= i;
			cnt++;
		}
		prime.pb(i);
		kosuu.pb(cnt);
		if(kk==1) break;
	}
	if(kk>1){
		prime.pb(kk);
		kosuu.pb(1);
	}
	int s=prime.size();
	for(int i=0;i<n;i++){
		int y,yy;
		cin>>y;
		yy=y;
		for(int i=0;i<s;i++){
			for(int j=0;j<kosuu[i];j++){
				if(yy%prime[i]==0)yy/=prime[i];
			}
		}
		ma[y/yy]++;
	}
	int ans=0;
	for(auto it=ma.begin();it!=ma.end();it++){
		if(it->first * it->first %k==0) ans+= it->second *( it->second-1)/2;
		auto it2=it;
		it2++;
		for(;it2!=ma.end() ;it2++){
			if((it->first)*(it2->first)%k==0)ans+= (it->second)*(it2->second);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - ロト2
User smiken
Language C++14 (GCC 5.4.1)
Score 400
Code Size 6294 Byte
Status AC
Exec Time 161 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 25
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 2 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 2 ms 256 KB
10_random_03.txt AC 2 ms 256 KB
10_random_04.txt AC 3 ms 256 KB
10_random_05.txt AC 2 ms 256 KB
20_max_01.txt AC 74 ms 256 KB
20_max_02.txt AC 65 ms 256 KB
20_max_03.txt AC 82 ms 256 KB
20_max_04.txt AC 69 ms 256 KB
20_max_05.txt AC 96 ms 256 KB
30_overflow_01.txt AC 75 ms 256 KB
30_overflow_02.txt AC 75 ms 256 KB
40_dmax_01.txt AC 145 ms 384 KB
40_dmax_02.txt AC 145 ms 384 KB
40_dmax_03.txt AC 145 ms 384 KB
50_prime_01.txt AC 66 ms 256 KB
50_prime_02.txt AC 72 ms 256 KB
50_prime_03.txt AC 84 ms 256 KB
60_prime_pow_01.txt AC 161 ms 256 KB
60_prime_pow_02.txt AC 87 ms 256 KB
60_prime_pow_03.txt AC 81 ms 256 KB
70_one_01.txt AC 60 ms 256 KB