Cod sursa(job #1575720)
| Utilizator | Data | 21 ianuarie 2016 19:19:09 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long n,i,j,k,l,q;
double a[100],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;
}
