Pagini recente » Monitorul de evaluare | Cod sursa (job #120251) | Cod sursa (job #120421) | Cod sursa (job #1131280) | Cod sursa (job #1808923)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n, x, k=0;
vector<float> v(0);
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
for(float j=1; j<=n; j++)
v.push_back(j/i);
sort(v.begin(), v.end());
for(int i=1; i<v.size(); i++)
if(v[i]==v[i-1])
k++;
fout<<v.size()-k;
}