Cod sursa(job #1828536)
| Utilizator | Data | 13 decembrie 2016 15:40:05 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
main() {
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int n;
cin>>n;
vector<double> a;
for (int i = 1; i <=n; i++) {
for (int j = i; j <=n; j++) {
a.push_back(i*1.0/j);
a.push_back(j*1.0/i);
}
}
sort(a.begin(), a.end());
int k = 1;
for (int i = 1; i < a.size(); i++) {
if (a[i] != a[i-1]) {
k++;
}
}
cout<<k;
}
