1260A - Heating - CodeForces Solution


math *1000

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
	c,s=map(int,input().split())
	d=s//c
	rem=s%c
	print(rem*(d+1)*(d+1)+(c-rem)*d*d)

C++ Code:

#include <bits/stdc++.h>
#define pb push_back
#define int long long int
using namespace std;

int mod = 1000000007;

int apowb(int b, int p)
{
  int res = 1;
  while (p)
  {
    if (p & 1)
    {
      res = (res * b) % mod;
    }

    p = p / 2;
    b = (b * b) % mod;
  }
  return res;
}

signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  // cin>>t;
  while (t--)
  {
    int n;
    cin >> n;
    int x, y;
    for (int k = 0; k < n; k++)
    {
      cin >> y >> x;
      if (x < y)
        cout << x << endl;
      else
      {
        int q = x / y;
        int rem = x % y;
        int left = y - rem;
        int res = 0;
        for (int i = 0; i < left; i++)
        {
          res += apowb(q, 2);
        }
        for (int i = 0; i < y - left; i++)
        {
          res += apowb(q + 1, 2);
        }
        cout << res << endl;
      }
    }
  }
  return (0);
}


Comments

Submit
0 Comments
More Questions

1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know
1672A - Log Chopping
300A - Array
48D - Permutations
677C - Vanya and Label
1583B - Omkar and Heavenly Tree
1703C - Cypher
1511C - Yet Another Card Deck
1698A - XOR Mixup
1702E - Split Into Two Sets
1703B - ICPC Balloons
1702F - Equate Multisets
1700A - Optimal Path
665C - Simple Strings
1708A - Difference Operations
1703E - Mirror Grid
1042A - Benches
1676B - Equal Candies
1705B - Mark the Dust Sweeper
1711A - Perfect Permutation
1701B - Permutation
1692A - Marathon
1066A - Vova and Train
169B - Replacing Digits
171D - Broken checker