Cod sursa(job #1489646)
Utilizator | Data | 21 septembrie 2015 19:55:18 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int main(){
int n,i,j,k,div,fr;
cin>>n;
fr=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
div=0;
for(k=1;k<=n;k++)
{
if(i%k==0&&j%k==0)
div++;
}
if(div<2)
fr++;
div=0;
}
}
cout<<fr;
}