Cod sursa(job #95584)
Utilizator | MciprianM MciprianM | Data | 29 octombrie 2007 17:09:16 |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
long long int n;
long long int l;
unsigned long a[1000000][1000000];
int main(){
ifstream f("fractii.in");
f>>n;
f.close();
long long int i,j;
for(i=2;i<=n;i++)
for(j=i;j<=n;j+=i)
a[i][j]=a[j][i]=1;
l=2n;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
if(!a[i][j]) l++;
ofstream g("fractii.out");
g<<l<<endl;
g.close();
return 0;
}