Cod sursa(job #2593346)
Utilizator | Neauna Madalin neauna | Data | 3 aprilie 2020 16:03:20 |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
long long int n,i,j,counter=0;
cin>>n;
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
if (i==1 || j==1)
counter++;
else if (max(i,j)%min(i,j)!=0)
counter++;
}
}
/// 1/1 1/2 1/3 1/4 1/5 2/1 2/3 2/5 3/1 3/2 3/4 3/5 4/1 4/3 4/5 5/1 5/2 5/3 5/4
cout<<counter;
return 0;
}