Merge branch 'main' into main

Author: ScorchedPearl

.DS_Store

@@ -0,0 +1,42 @@
+/* 1 to n people are standing in a circle. n is even.... a is looking at b. 
+If given c is looking at some d person for given a,b then find that d. If such a combination
+of circle does not exist then print -1*/
+
+// Time complexity: O(1)
+// Space complexity: O(1)
+//My submission: https://codeforces.com/contest/1560/submission/355204246
+
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+#define all(x) (x).begin(), (x).end()
+
+const int MOD = 1e9 + 7; // 998244353
+const ll INF = 1e18;
+
+void solve() {
+    int a,b,c;
+    cin>>a>>b>>c;
+    int n=2*abs(a-b);
+    if(a>n || b>n ||c>n ) cout<<-1<<endl;
+    else{
+        int x=c-n/2,y=c+n/2;
+        if(x>=1 && x<=n) cout<<x<<endl;
+        else cout<<y<<endl;
+    }
+}
+
+int main() {
+    // Fast I/O
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        solve();
+    }
+    
+    return 0;
+}

Problems/.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/Mathematics/.DS_Store

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+ 
+int main() {
+    int n, k;
+    cin >> n >> k;
+ 
+    vector<int> a(n);
+    for (int i = 0; i < n; i++)
+        cin >> a[i];
+ 
+    map<vector<pair<int,int>>, long long> freq;
+    long long ans = 0;
+ 
+    for (int i = 0; i < n; i++) {
+        int x = a[i];
+        vector<pair<int,int>> cur, need;
+ 
+        for (int p = 2; p * p <= x; p++) {
+            if (x % p == 0) {
+                int cnt = 0;
+                while (x % p == 0) {
+                    x /= p;
+                    cnt++;
+                }
+                cnt %= k;
+                if (cnt > 0) {
+                    cur.push_back({p, cnt});
+                    need.push_back({p, (k - cnt) % k});
+                }
+            }
+        }
+ 
+        if (x > 1) {
+            cur.push_back({x, 1});
+            need.push_back({x, (k - 1) % k});
+        }
+        sort(cur.begin(), cur.end());
+        sort(need.begin(), need.end());
+ 
+        ans += freq[need];
+        freq[cur]++;
+    }
+    cout << ans << "\n";
+    return 0;
+}

Problems/Mathematics/Day-01/.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;
+}

Problems/Mathematics/Day-01/sol/.DS_Store

@@ -0,0 +1,15 @@
+ti=int(input())
+
+for _ in range(ti):
+    k,l,p=map(int,input().split())
+    
+    d=abs(k-l)
+    f=2*d
+    
+    if k>f or l>f or p>f:
+        print(-1)
+    else:
+        if p+d<=f:
+            print(p+d)
+        else:
+            print(p-d)