Pagini recente » Cod sursa (job #1251246) | Cod sursa (job #1277868) | Cod sursa (job #1129007) | Cod sursa (job #883398) | Cod sursa (job #1791680)
#include <iostream>
#include<fstream>
using namespace std;
int nrdiv[1000005],nr[1000005];
int i,j,t,n,m,add;
long long pairs;
int main()
{
ifstream f("mins.in");
ofstream g("mins.out");
f>>n>>m;n--;m--;
for(int i=2;i<=n;i++)
{
if(nrdiv[i]%2==0) add=m/i;
else add=-m/i;
if(nrdiv[i]!=-1)
for(int j=i;j<=n;j+=i)
{
if((j/i)%i==0) nrdiv[j]=-1;
if(nrdiv[i]<=1&&nrdiv[j]!=-1) nrdiv[j]++;
nr[j]+=add;
}
pairs+=(1LL)*(m-nr[i]);
}
pairs+=(1LL)*m;
g<<pairs;
return 0;
}