Pagini recente » Cod sursa (job #861168) | Cod sursa (job #1144142) | Cod sursa (job #1962804) | Cod sursa (job #827087) | Cod sursa (job #1575725)
#include<iostream>
#include<fstream>
#define tab 1000001
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long n;
long long i,j,k,l,q;
double a[tab],x;
int main()
{
fin>>n;
for(i=1;i<=n;i++) for(j=1;j<=n;j++) {q++;
a[q]=(i*1.0)/(j*1.0);
}
for(q=1;q<=n*n;q++) {
x=a[q];
l=q-1;
while( l >= 1 && a[l] > x )
{
a[l+1] = a[l];
l--;
}
a[l+1] = x;
}
for(q=1;q<=n*n;q++) if (a[q]==a[q+1]) k++;
fout<<n*n-k;
return 0;
}