Cod sursa(job #374706)
| Utilizator | Data | 17 decembrie 2009 22:50:41 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
include<fstream>
using namespace std;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
float v[100],a[100][100],copie;
int i,j,k,ok,n,s=0;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{ a[i][j]=i/j;
v[k++]=a[i][j];
}
do{
ok=1;
for(i=1;i<=n*n-1;i=i+1)
if(v[i]>v[i+1]) {ok=0; copie=v[i]; v[i]=v[i+1]; v[i+1]=copie;}
}while(!ok);
for(i=1;i<=n*n-1;i++)
if(v[i]!=v[i+1]) s++;
g<<s;
}
