Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<cmath>
- #include<algorithm>
- using namespace std;
- int prime(long long n){
- if(n < 2) return 0;
- for(int i = 2; i <= sqrt(n); i++){
- if(n % i == 0) return 0;
- }
- return 1;
- }
- main(){
- int a[100005], n, appear[100005]={1}, count=0;
- cin>>n;
- for(int i=0; i<n; i++) cin>>a[i];
- sort(a, a+n);
- for(int i=0; i<n; i++){
- appear[a[i]]=1;
- }
- for(int i=0; i<n; i++){
- for(int j = i + 1; j < n; j++){
- if(a[i] == a[j]){
- appear[a[i]]++;
- a[j]=0;
- }
- }
- }
- for(int i = 0; i < n; i++){
- if(prime(a[i])){
- cout<<a[i]<<' '<<appear[a[i]]<<endl;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement