Pagini recente » Cod sursa (job #3160581) | Cod sursa (job #1974653) | Cod sursa (job #781847) | Cod sursa (job #3208710) | Cod sursa (job #1416185)
/*#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi,mini,x,sum,pi,pf,p;
int main()
{
f>>n;
maxi=-2000000000;mini=0;p=1;
for(i=1;i<=n;i++)
{
f>>x;
sum=sum+x;
if(maxi<sum-mini){ maxi=sum-mini; pi=p; pf=i; }
if(sum<mini){ mini=sum; p=i+1; }
}
g<<maxi<<" "<<pi<<" "<<pf;
return 0;
}*/
/*#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[2006000];
int sol=0;
int n=0;
int main()
{
f>>n;
for(int i=2;i<=n;++i)
if (prim[i]==0)
for(int j=i*2;j<=n;j+=i)
prim[j]=1;
for(int i=2;i<=n;++i)
if (prim[i]==0){//g<<i<<" ";
++sol;
}
g<<sol;
return 0;}*/
#include <fstream>
using namespace std;
long n,i,j,a,b,sol;
int main()
{ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
a=i;b=j;
while(a!=b)
{if(a>b) a=a-b;
else b=b-a;
}if(a==1) sol++;
}
g<<sol;
return 0;
}