Cod sursa(job #1511142)
| Utilizator | Data | 26 octombrie 2015 06:30:05 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int i,j,nr,N,n,v[1000000],q[1000000];
int dip (int a,int b)
{ if(a>b) {n=b;}
else {n=a;}
for(int v=2;v<=7;v++)
if(a%v==0&&b%v==0) return v;
return 0;
}
int main()
{nr=0;f>>N;
for(i=2;i<=N;i++)
{for(j=2;j<=N;j++) if(dip(i,j)==0) v[i]=v[i]+1;}
for(i=2;i<=N;i++) nr=nr+v[i];
g<<nr+N*2-1;
f.close();
g.close();
return 0;}
