Cod sursa(job #1233725)
Utilizator | Data | 25 septembrie 2014 22:05:00 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.22 kb |
#include <fstream>
using namespace std;
ifstream fi ("fractii.in");
ofstream fo ("fractii.out");
int x[100],i,j,fr[100],n,k,s,t,a[100][100];
int main()
{
fi>>n;
for (i=2; i<=n; i++)
if (fr[i]==0)
for (j=i+i; j<=n; j=j+i) fr[j]++;
for (i=2; i<=n; i++)
{
// if (fr[i]==0)
{
t=i;
if (fr[i]>0)
for (j=1; j<=n; j++)
if (a[i][j]>0)
{
t=j;
for (k=i+t; k<=n; k=k+t)
{
fr[k]++;
a[i][k]++;
a[k][i]++;
}
t=n;
}
for (j=i+t; j<=n; j=j+t)
{
fr[j]++;
a[i][j]++;
a[j][i]++;
}
}
}
// fo<<1<<'/'<<1<<'\n';
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i!=j)
if ((a[i][j]==0) and (a[j][i]==0))
{
s++;
// fo<<i<<'/'<<j<<'\n';
}
fo<<s+1;
return 0;
}