Pagini recente » Cod sursa (job #3250041) | Cod sursa (job #1742757) | Cod sursa (job #2178661) | Cod sursa (job #973270) | Cod sursa (job #708849)
Cod sursa(job #708849)
#include<fstream>
#include<iostream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int v[1000],n;
void ciur()
{
int i,j;
for(i=2;i<=n;i=i+2)
v[i]=1;
v[2]=0;
for(i=3;i<=n;i=i+2)
if(v[i]==0)
{
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
}
int main ()
{
int i,j,k=0,aux1,aux2;
in>>n;
for(i=1;i<=n;i++)
if(v[i]==0)
k=k+n-1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[j]==0 && v[i]==0)
{aux1=i;
aux2=j;
while(aux1!=aux2)
if(aux1<aux2)
aux2=aux2-aux1;
else
aux1=aux1-aux2;
if(aux1==0)
k++;
}
out<<k+1;
}