Merge branch 'main' into main

Author: Dheeraj-06

.DS_Store

@@ -0,0 +1,26 @@
+//adding submission link as suggested earlier
+//https://codeforces.com/problemset/submission/1560/355167404
+
+#include <bits/stdc++.h>
+using namespace std;
+ 
+int main() {
+     int t;
+    cin >> t;
+    while(t--) {
+        int a,b,c;
+        cin>>a>>b>>c;
+        if((abs(b-a))*2<max(a,max(b,c))){
+            cout << -1 <<'\n';
+            continue;
+        }
+        if(c+(abs(b-a))>(abs(b-a)*2)){
+            cout<<(c+(abs(b-a)))%(abs(b-a)*2)<<'\n';
+        }
+        else{
+            cout<<c+(abs(b-a))<<'\n';
+        }
+    }
+    
+    return 0;
+}

Problems/.DS_Store

@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define ll long long
+#define pb push_back
+#define f(i,a,b) for(ll i=a;i<b;i++)
+#define fb(i,a,b) for(ll i=a;i>=b;i--)
+#define vi vector<int>
+#define vl vector<ll>
+#define pii pair<int,int>
+#define pll pair<ll,ll>
+#define vpii vector<pii>
+#define vpll vector<pll>
+#define all(x) (x).begin(), (x).end()
+#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+const ll MOD = 1e9+7;
+const ll INF = 1e18;
+/*
+We need to count the no of pairs such that their product makes some number's k-th power-this means the product of the two numbers should have
+factors frequency that is divisible by k. For every number first factorize it using spf(also store its factors mod k) and also store how much
+factor more it needs to make the k-th power add this for all numbers.
+
+*/
+
+/* Submission Link: https://codeforces.com/contest/1225/submission/355183203 */
+void solve() {
+    int n,k;
+    cin>>n>>k;
+    vi a(n);
+    f(i,0,n) cin>>a[i];
+    vi spf(1e5+1);
+    f(i,1,1e5+1) spf[i]=i;
+    for(int i=2;i*i<=1e5;i++){
+        if(spf[i]==i){
+            for(int j=i*i;j<=1e5;j+=i){
+                if(spf[j]==j){
+                    spf[j]=i;
+                }
+            }
+        }
+    }
+    map<vpii,ll> cnt;
+    ll ans=0;
+    for(int x:a){
+        map<int,int> factors;
+        while(x>1){
+            int p=spf[x];
+            int c=0;
+            while(x%p==0){
+                x/=p;
+                c++;
+            }
+            c%=k;
+            if(c>0)
+                factors[p]=c;
+        }
+        vpii key,need;
+        for(auto &it:factors){
+            key.pb(it);
+            int y=(k-it.second)%k;
+            if(y>0){
+                need.pb({it.first,y});
+            }
+        }
+        ans+=cnt[need];
+        cnt[key]++;
+    }
+    cout<<ans<<endl;
+}
+
+int main() {
+    fast_io;
+    int t = 1;
+    //cin >> t;
+    while(t--) solve();
+    return 0;
+}

Problems/Mathematics/.DS_Store

@@ -0,0 +1,191 @@
+//https://codeforces.com/contest/1560/submission/355167905
+#include <bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define ll long long
+#define ull unsigned long long
+#define ld long double
+#define pii pair<int,int>
+#define vi vector<int>
+#define vvi vector<vector<int>>
+#define vpi vector<pair<int,int>>
+#define all(x) (x).begin(), (x).end()
+
+
+const long long MAXN = 2e6;
+const long long MOD = 1e9 + 7;
+const int INF = 1e18;
+const ld EPS = 1e-9;
+
+
+#define fastio ios::sync_with_stdio(false); cin.tie(nullptr);
+
+#ifndef ONLINE_JUDGE
+    #define debug(x) cerr << #x << " = " << x << "\n";
+#else
+    #define debug(x)
+#endif
+
+// Utility functions
+int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
+int lcm(int a, int b) { return a / gcd(a, b) * b; }
+int mod_add(int a, int b, int m=MOD) { return ((a % m) + (b % m) + m) % m; }
+int mod_sub(int a, int b, int m=MOD) { return ((a % m) - (b % m) + m) % m; }
+int mod_mul(int a, int b, int m=MOD) { return ((a % m) * (b % m)) % m; }
+
+//Binary Exponentiation
+int binexp(int a, int b, int m=MOD) {
+    int res = 1;
+    a %= m;
+    while(b > 0) {
+        if(b & 1) res = (res * a) % m;
+        a = (a * a) % m;
+        b >>= 1;
+    }
+    return res;
+}
+
+int mod_inv(int a, int m=MOD) {
+    return binexp(a, m - 2, m);
+}
+
+long long fac[MAXN + 1];
+long long inv[MAXN + 1];
+
+long long exp(long long x, long long n, long long m) {
+  x %= m;
+  long long res = 1;
+  while (n > 0) {
+    if (n % 2 == 1) { res = res * x % m; }
+    x = x * x % m;
+    n /= 2;
+  }
+  return res;
+}
+
+void factorial() {
+  fac[0] = 1;
+  for (long long i = 1; i <= MAXN; i++) { fac[i] = fac[i - 1] * i % MOD; }
+}
+
+void inverses() {
+  inv[MAXN] = exp(fac[MAXN], MOD - 2, MOD);
+  for (long long i = MAXN; i >= 1; i--) { inv[i - 1] = inv[i] * i % MOD; }
+}
+
+long long choose(long long n, long long r) {
+  if (r > n)return 0ll;
+  return (fac[n] * inv[r] % MOD * inv[n - r] % MOD) % MOD;
+}
+
+long long catalan(long long n) {
+  return (exp(n + 1, MOD - 2, MOD) % MOD * choose(2 * n, n) % MOD) % MOD;
+}
+
+//Returns all prime numbers <=N
+vector<int> sieve(int n) {
+    vector<bool> prime(n + 1, true);
+    for (int p=2;p*p<=n;p++) {
+        if (prime[p] == true) {
+            
+            for (int i=p*p;i<=n;i+=p)
+                prime[i] = false;
+        }
+    }
+    
+    vector<int> res;
+    for (int p = 2; p <= n; p++){
+        if (prime[p]){ 
+            res.push_back(p);
+        }
+    }
+    return res;
+}
+
+//Prime factors of all numbers upto N
+vector<vector<int>> primefactors(int N)
+{
+    vvi pfac(N + 1);
+        for (int i=2;i<=N;i++){
+        if (!pfac[i].empty())
+            continue;
+
+        for (int j = i; j <= N; j += i)
+            pfac[j].push_back(i);
+    }
+            
+    return pfac;
+}
+
+//smallest prime factor of a number
+int spf(int n) {
+    if (n % 2 == 0) return 2;
+    for (int i = 3; i * i <= n; i += 2) {
+        if (n % i == 0) return i;
+    }
+    return n;
+}
+
+int power2(int p)
+{
+    int v=1ll<<p;
+    return v;
+}
+
+//Sort functions
+
+void sort(vector<int>&a)
+{
+    sort(a.begin(),a.end());
+}
+
+void psort(vector<pair<int,int>>&a)
+{
+    sort(a.begin(),a.end());
+}
+
+void rsort(vector<int>&a)
+{
+    sort(a.rbegin(),a.rend());
+}
+
+void rpsort(vector<pair<int,int>>&a)
+{
+    sort(a.rbegin(),a.rend());
+}
+
+//2-D Vector Declaration: 
+//vvi mat(n,vi(m));     // nxm matrix, all initialized to 0
+
+
+/***************Code***************/
+
+void solve() {
+
+    int a,b,c;
+    cin>>a>>b>>c;
+
+    int diff=abs(a-b);
+    int p=2*diff;
+    if(a<=p&&b<=p&&c<=p)
+    {
+        if(c>diff)
+        cout<<c-diff<<endl;
+        else
+        cout<<c+diff<<endl;
+    }
+    else
+    cout<<"-1"<<endl;
+}
+
+
+signed main() {
+    fastio;
+    int t = 1;
+    cin >> t;
+    while (t--) {
+        solve();
+    }
+    return 0;
+}