Pagini recente » Cod sursa (job #3200749) | Cod sursa (job #1752) | Rating Ciobanu Alexio Patrick (AlexioCiobanu) | Cod sursa (job #2415488) | Cod sursa (job #6544)
Cod sursa(job #6544)
#include "fstream.h"
#define N 500
ifstream f("indep.in");
ofstream g("indep.out");
int divizor (int a,int b)
{
int r,d;
if(a==0)
{
if(b!=0)
d=b;
}
else
if(b==0)
d=a;
if(a!=0&&b!=0)
{
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
d=b;
}
return d;
}
int main()
{int n,i,v[N],a[N],s[N],ss,k,nr=0,x,dd;
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
v[i]=0;
}
f.close();
ss=0;
while(ss!=n)
{
i=n;
while(v[i]==1)
{
v[i]=0;
i--;
}
v[i]=1;
k=0;
ss=0;
for(i=1;i<=n;i++)
if(v[i]==1)
{
ss+=v[i];
k++;
s[k]=a[i];
}
dd=s[1];
for(x=2;x<=k;x++)
dd=divizor(dd,s[2]);
if(dd==1)
nr++;
}
g<<nr;
g.close();
return 0;
}