Cod sursa(job #821217)
| Utilizator | Data | 21 noiembrie 2012 21:26:05 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
long n,i,j,t=0;;
double a[1000001];
long long s=0;
int main()
{ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
a[t]=(float)i/j;t++;
}
int gasit=0;
for(j=0;j<t;j++)
{
gasit=0;
for(i=j;i<t-1&&!gasit;i++)
{
if(a[j]==a[i+1]) gasit=1;
}
if(!gasit)
s++;
}
g<<s;
return 0;
}
