Cod sursa(job #1473266)
| Utilizator | Data | 18 august 2015 22:24:16 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include<iostream>
#include<fstream>
using namespace std;
fstream f,g;
int n;
float fractii[100000];
int counter=0;
int main()
{
f.open("fractii.in",ios::in);
g.open("fractii.out",ios::out);
f>>n;
int k;
float rez;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
k=0;
rez=(float)i/j;
while((rez!=fractii[k]) && (k<counter))
{
k++;
}
if(k==counter)
{
counter++;
fractii[counter]=rez;
fractii[counter+1]=0;
}
}
}
g<<counter;
f.close();
g.close();
return 0;
}
