Pagini recente » Cod sursa (job #3189334) | Cod sursa (job #3153042) | Cod sursa (job #1450636) | Cod sursa (job #2676808) | Cod sursa (job #52802)
Cod sursa(job #52802)
#include<fstream>
#include<math.h>
using namespace std;
int n,k=0;
float a[100000];
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
float i,j;
int l,m,n;
fin>>n;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
a[k++]=(i/j);
}
for(m = 0; m < k; m++)
{
for(n = m+1; n < k; n++)
if(a[m] == a[n])
{
for(l = n; l < k; l++)
a[l] = a[l+1];
k--;
}
}
fout<<k;
fin.close();
fout.close();
return 0;
}