Cod sursa(job #679346)
| Utilizator | Data | 13 februarie 2012 08:52:01 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(void)
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,k=0,i,j;
f>>n;
int p[n],q[n];
for (i=1;i<=n;i++) p[i]=i;
for (i=1;i<=n;i++) q[i]=i;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
if (p[i]%q[j]!=0 || q[j]==1 || p[i]==1) k++;
}
g<<k;
f.close();
g.close();
return 0;
}