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