Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ///Rezolvarea la cerinta 3) !!!!
- ifstream fin("divizori2.in");
- ofstream fout("divizori2.out");
- int s[1000000]; ///frecventa de aparitie a divizorilor in toate nr
- int main()
- {
- int P,n,x,d,i;
- fin>>P>>n;
- for(i=1;i<=n;i++){
- fin>>x;
- ///s[1]++; ///creste frecv lui 1
- s[x]++; ///creste frecv lui x
- for(d=2;d*d<x;d++){
- if(x%d==0){
- s[d]++; ///creste frecv lui d
- s[x/d]++; ///creste frecv lui n/d
- }
- }
- if(d*d==x) s[d]++; ///creste frecv lui d
- }
- fout<<1<<" ";
- for(i=2;i<=1000000;i++){
- if(s[i]==n) ///daca apare i la toate cele n numere
- {
- fout<<i<<" ";
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement