fork download 
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <map>
  4. #include <algorithm>
  5. using namespace std;
  6.  
  7. int main() {
  8. 	int n, k, a[100005];
  9. 	map <int, int> m;
  10. 	scanf("%d%d", &n, &k);
  11. 	for(int i=0; i<n; i++) scanf("%d", &a[i]);
  12. 	sort(a, a+n);
  13. 	for(int i=0; i<n; i++) {
  14. 		if(a[i]%k==0) {
  15. 			if(m.count(a[i]/k)==true) continue;
  16. 			else m.insert(make_pair(a[i], 0));
  17. 		}
  18. 		else m.insert(make_pair(a[i], 0));
  19. 	}
  20. 	printf("%d", m.size());
  21. 	return 0;
  22. }
Success #stdin #stdout 0s 3752KB
comments ()
stdin 
6 2
2 3 6 5 4 10
stdout 
3
https://ideone.com/LlFWlA
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
secret

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!