Cod sursa(job #2449647)
Utilizator | Data | 20 august 2019 13:07:45 | |
---|---|---|---|
Problema | Mins | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("mins.in");
ofstream g ("mins.out");
int vek[1000001];
int cek[1000001];
int m,n;
int main()
{
f>>m>>n;
int p=0;
for(int i=1;i<=m-1;++i)
{
for(int j=1;j<=n-1;++j)
{
if(__gcd(i,j)==1)
p++;
}
}
g<<p;
return 0;
}