Pagini recente » Cod sursa (job #2466003) | Cod sursa (job #397588) | Cod sursa (job #659698) | Cod sursa (job #2263326) | Cod sursa (job #884356)
Cod sursa(job #884356)
#include <fstream>
using namespace std;
float i[9999999], j[9999999]; int n, non, z;
void gen ()
{
int s=1, g=1;
while (s<=non) for (int l=1; l<=n; ++l) j[s++]=l;
for (s=1; s<non; s+=n) {
for (int l=s; l<s+n; ++l) i[l]=g; ++g;
}
}
void procesare ()
{
for (int l=1; l<=non; ++l) if (i[l])
for (int q=l+n; q<=non; ++q) if (i[q]/i[l] == j[q]/j[l]) {
i[q]=0; j[q]=0;
}
for (int miu=1; miu<=non; ++miu) if (i[miu] == 0) --z;
}
int main()
{
ifstream in ("fractii.in");
ofstream out ("fractii.out");
in>>n;
non=n*n; z=non;
gen();
procesare();
out<<z;
return 0;
}