Not so easy maths

Sg90 · October 27, 2019, 7:17am

The time limit is exceeding in this problem do this problem have any other optimum solution

Robin_rst · October 30, 2019, 3:17pm

Use inclusion-exclusion principle.
You can refer this for better understanding.

robinrst/NumberTheory/blob/master/NotSoEasyMath.cpp

#include "bits/stdc++.h"

using namespace std;

#define  f first
#define  lgn 25
#define  endl '\n'
#define  sc second
#define  N (int)2e5+5
#define  sz(x) x.size()
#define  int long long int
#define  ld long double
#define  vi vector<int>
#define  vs vector<string>
#define  vc vector<char>
#define  mii map<int,int>
#define  pii pair<int,int>
#define  vpii vector<pii>
#define  test(x) while(x--)
#define  pb push_back

This file has been truncated. show original

Robin_rst · November 18, 2019, 5:23am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.