Pagini recente » Cod sursa (job #923301) | Cod sursa (job #540574) | Cod sursa (job #2864211) | Cod sursa (job #1091813) | Cod sursa (job #751159)
Cod sursa(job #751159)
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
unsigned long long i,j,n,nr;
long long int gcd(long long int a, long long int b)
{
long long int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(gcd(i,j)==1) nr++;
g<<nr;
f.close();
g.close();
return 0;
}
/*#include<fstream>
using namespace std;
ifstream f("bad.in");
ofstream g("bad.out");
unsigned a[10][10],i,j,col[10],lin[10],n,m,maxim,k,s,coloana,linie,y;
int main()
{
f>>n>>m>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(k)
{
maxim=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
s=0;
s+=a[i][j]+a[i-1][j]+a[i+1][j]+a[i][j-1]+a[i][j+1];
if(s>maxim)
{
maxim=s;
coloana=j;
linie=i;
}
}
y++;
g<<coloana<<' '<<linie<<' '<<maxim<<'\n';
col[y]=coloana;
lin[y]=linie;
a[linie][coloana]=a[linie-1][coloana]=a[linie+1][coloana]=a[linie][coloana-1]=a[linie][coloana+1]=0;
k--;
}
f.close();
g.close();
return 0;
}
*/