Last active
October 7, 2018 16:28
-
-
Save tanmoy13/9e327e73377d675236cee83080dbd605 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
#include <ext/pb_ds/assoc_container.hpp> | |
#include <ext/pb_ds/tree_policy.hpp> | |
#define pii pair <int,int> | |
#define pll pair <long long,long long> | |
#define sc scanf | |
#define pf printf | |
#define Pi 2*acos(0.0) | |
#define ms(a,b) memset(a, b, sizeof(a)) | |
#define pb(a) push_back(a) | |
#define MP make_pair | |
#define db double | |
#define ll long long | |
#define EPS 10E-10 | |
#define ff first | |
#define ss second | |
#define sqr(x) (x)*(x) | |
#define D(x) cerr<<#x " = "<<(x)<<endl | |
#define VI vector <int> | |
#define DBG pf("Hi\n") | |
#define MOD 1000000007 | |
#define CIN ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) | |
#define SZ(a) (int)a.size() | |
#define sf(a) scanf("%d",&a) | |
#define sfl(a) scanf("%lld",&a) | |
#define sff(a,b) scanf("%d %d",&a,&b) | |
#define sffl(a,b) scanf("%lld %lld",&a,&b) | |
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c) | |
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c) | |
#define stlloop(v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++) | |
#define loop(i,n) for(int i=0;i<n;i++) | |
#define loop1(i,n) for(int i=1;i<=n;i++) | |
#define REP(i,a,b) for(int i=a;i<b;i++) | |
#define RREP(i,a,b) for(int i=a;i>=b;i--) | |
#define TEST_CASE(t) for(int z=1;z<=t;z++) | |
#define PRINT_CASE printf("Case %d: ",z) | |
#define LINE_PRINT_CASE printf("Case %d:\n",z) | |
#define CASE_PRINT cout<<"Case "<<z<<": " | |
#define all(a) a.begin(),a.end() | |
#define intlim 2147483648 | |
#define infinity (1<<28) | |
#define ull unsigned long long | |
#define gcd(a, b) __gcd(a, b) | |
#define lcm(a, b) ((a)*((b)/gcd(a,b))) | |
using namespace std; | |
//using namespace __gnu_pbds; | |
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; | |
/*----------------------Graph Moves----------------*/ | |
//const int fx[]={+1,-1,+0,+0}; | |
//const int fy[]={+0,+0,+1,-1}; | |
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move | |
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move | |
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move | |
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move | |
/*------------------------------------------------*/ | |
/*-----------------------Bitmask------------------*/ | |
//int Set(int N,int pos){return N=N | (1<<pos);} | |
//int reset(int N,int pos){return N= N & ~(1<<pos);} | |
//bool check(int N,int pos){return (bool)(N & (1<<pos));} | |
/*------------------------------------------------*/ | |
#define mx 1000006 | |
ll mobius[mx]; | |
bool vis[mx]; | |
ll n,m; | |
void precal() | |
{ | |
for(int i=2;i<mx;) | |
{ | |
for(int j=i+i;j<mx;j+=i) | |
mobius[j]++; | |
for(++i;;i++) | |
if(mobius[i]==0) break; | |
} | |
for(int i=2;i<mx;i++) | |
{ | |
if(mobius[i]==1) | |
{ | |
for(int j=i;j<mx;j+=i) | |
vis[j]=1; | |
} | |
} | |
} | |
int main() | |
{ | |
// freopen("in.txt","r",stdin); | |
// freopen("out.txt","w",stdout); | |
int t; | |
sf(t); | |
precal(); | |
TEST_CASE(t) | |
{ | |
sffl(n,m); | |
if(n>m) swap(n,m); | |
ll ans=n*m; | |
// ms(mobius,0); | |
// ms(vis,0); | |
for(ll i=2;i<=n;i++) | |
{ | |
if(vis[i]==1) continue; | |
ll x=(m/i)*(n/i); | |
if(mobius[i]==0) | |
ans-=x; | |
else if(mobius[i]%2==1) | |
ans-=x; | |
else | |
ans+=x; | |
// for(ll j=i;j<=n;j*=i) vis[j]=1; | |
} | |
if(n) ans++; | |
if(m) ans++; | |
PRINT_CASE; | |
printf("%lld\n",ans); | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment