Pagini recente » Cod sursa (job #1592784) | Cod sursa (job #1263939) | Cod sursa (job #2173747) | Cod sursa (job #1020057) | Cod sursa (job #584019)
Cod sursa(job #584019)
#include <fstream>
#include <iostream>
using namespace std;
unsigned long int n;
unsigned long long int s = 0;
unsigned long int k;
unsigned int fractii[1000001];
bool prim[1000001];
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin >> n;
for(unsigned long int i=1; i<=n; i++)
{
fractii[i] = n;
prim[i] = true;
}
for (unsigned long int i=2; i<=n; i++)
{
if(prim[i] == true)
{
k = i;
while (k <= n)
{
cout << k << ": " << n / i << "\n";
fractii[k] = fractii[k] - n / i;
if(prim[k] == false)
fractii[k]++;
prim[k] = false;
k = k + i;
}
}
}
for(unsigned long int i=1; i<=n; i++)
{
s += fractii[i];
cout << fractii[i] << " ";
}
fout << s;
fin.close();
fout.close();
return 0;
}