Pagini recente » Cod sursa (job #1166037) | Cod sursa (job #303842) | Cod sursa (job #288103) | Cod sursa (job #164368) | Cod sursa (job #2737154)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("mins.in");
ofstream g("mins.out");
int i,j,n,m,numar,a,b,r,p,sum,maxim,d,nr,p1,minim,ok,t;
vector <int> v[5005];
int main()
{
f>>n>>m;
maxim=max(n,m);
for (i=1;i<=maxim;i++)
{
d=2;
a=i;
while (a>1)
{
if (a%d==0)
{
v[i].push_back(d);
while (a%d==0)
{
a=a/d;
}
}
d++;
}
}
for (i=1;i<n;i++)
{
for (j=1;j<m;j++)
{
ok=1;
for (t=0;t<v[i].size();t++)
{
if (j%v[i][t]==0)
{
ok=0;
break;
}
}
numar+=ok;
}
}
g<<numar;
return 0;
}