Pagini recente » Profil PavelRazvan | Cod sursa (job #571814) | Cod sursa (job #2793940) | DeehoroEjkoli | Cod sursa (job #2846968)
#include <fstream>
using namespace std;
bool prim(int x, int y)
{
while(x != y)
{
if(x > y)
x -= y;
else
y -=x;
}
return x==1;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n, sum = 0, k, val;
in >> n;
// for(n = 1; n <= k; n++)
{
sum = 0;
for(int i = 1; i <= n; i++)
for(int j = i+1; j <= n; j++)
sum += prim(i, j);
val = sum*2+1;
out << val;
// out << n << " " << val/(float)(n) << endl;
}
}