Cod sursa(job #2243687)
| Utilizator | Data | 21 septembrie 2018 10:41:20 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int n,nr=0;
f>>n;
int v[100][100];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++) v[i][j]=1;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(v[i][j]==1)
for(int k=2; k<=n; k++)
v[k*i][k*j]=0;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(v[i][j]==1) nr++;
g<<nr;
}
