Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("date.in");
- ofstream g("date.out");
- short int div(int x) { // afiseaza divizorii lui n si returneaza numarul divizorilor acestuia
- short int j = 0;
- for (short int i = 2; i <= x / 2; i++) {
- if (!(x % i)) {
- g << i << ' ';
- j++;
- }
- }
- return j;
- }
- int main() {
- short int n;
- short int q; // numarul de divizori proprii ai lui n
- short int min_n; // numarul minim cu cei mai multi divizori
- short int max_div; // numarul maxim de divizori
- f >> n;
- g << n << ' ';
- min_n = n;
- max_div = div(n);
- g << endl;
- while (f >> n) {
- g << n << ' ';
- q = div(n);
- g << endl;
- if (max_div <= q) {
- if (max_div == q) {
- if (n < min_n)
- min_n = n;
- }
- else {
- min_n = n;
- max_div = q;
- }
- }
- }
- g << min_n;
- f.close();
- g.close();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement