| #| Title| Solution| Difficulty|

|---| -----| --------| ----------|

|1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)|[C++](./algorithms/cpp/sumOfFlooredPairs/SumOfFlooredPairs.cpp)|Hard|

|1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)|[C++](./algorithms/cpp/rotatingTheBox/RotatingTheBox.cpp)|Medium|

|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[C++](./algorithms/cpp/incrementalMemoryLeak/IncrementalMemoryLeak.cpp)|Medium|

|1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)|[C++](./algorithms/cpp/sortingTheSentence/SortingTheSentence.cpp)|Easy|

classSolution {

intsumOfFlooredPairs(vector<int>& nums) {

constint MAX_NUM =100001;

int cnt[MAX_NUM] = {0};

int maxn =0;

for(auto& n : nums) {

cnt[n]++;

maxn =max(maxn, n);

}

vector<vector<int>> stats;

for(int i=1; i<MAX_NUM; i++) {

if (cnt[i] >0) {

stats.push_back({i, cnt[i]});

}

cnt[i] += cnt[i-1];

}

constint MOD =1e9+7;

int result =0;

for(int i=0; i < stats.size(); i++) {

int n = stats[i][0];

int c = stats[i][1];

for(int x=2; x <= maxn/n+1; x++) {

int pre = (x-1) * n -1;

int cur =min( x * n -1, MAX_NUM-1);

result = (result + (cnt[cur] - cnt[pre]) *long(x-1) * c) % MOD;

}

}

return result;

}

};