Pagini recente » Cod sursa (job #339612) | Cod sursa (job #2662738) | Cod sursa (job #1501809) | Cod sursa (job #843743) | Cod sursa (job #953490)
Cod sursa(job #953490)
#include<iostream>
#include<fstream>
using namespace std;
int p,q,n,pa,qa;
short int fr[20000][20000];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
int nr=0;
for(p=1;p<=n;p++)
for(q=1;q<=n;q++)
if(fr[p][q]==0)
{
nr++;
pa=p;
qa=q;
while(pa<=n&&qa<=n)
{
fr[pa][qa]=1;
pa=pa+p;
qa=qa+q;
}
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}