Codeforces Round #701 (Div. 2) C. Floor and Mod codeforces 思维 + 数学

701C

input

9
3 4
2 100
4 3
50 3
12 4
69 420
12345 6789
123456 789
12345678 9

output

1
0
2
3
5
141
53384
160909
36

solution

$假设x/y=x\%y=a$

$按照a=1开始枚举，a=i时$
$最小的符合次情况的点对为(i\ast (i+2),i+1)$
$因此符合的点对为(i\ast (i+2)+i\ast t,i+1+t)，t\in Z_{+}，res+=t详情见代码$

code

    //Siberian Squirrel
    //#include<bits/stdc++.h>
    //#include<unordered_map>
    #include<algorithm>
    #include<iostream>
    #include<cstring>
    #include<cmath>
     
    //#define ACM_LOCAL
     
    using namespace std;
    typedef long long ll;
     
    const double PI = acos(-1);
    const double eps = 1e-7;
    const int MOD = 3221225473;
    const int N = 5e6 + 10;
    const int UP = 1e4;
     
    inline ll solve(int x, int y, ll res = 0) {
    //    res += min(x, y - 1);
    	for(int i = 1; ; ++ i) {
    		int temp = i * (i + 2), _temp = i + 1;
    		if(temp > x || _temp > y) break;
    		res += min((x - temp) / i + 1, y - i);
    	}
    	return res;
    }
     
    int main() {
    #ifdef ACM_LOCAL
        freopen("input", "r", stdin);
        freopen("output", "w", stdout);
    #endif
        int o = 1, n, m, x, y;
        scanf("%d", &o);
        while(o --) {
            scanf("%d%d", &x, &y);
            printf("%lld\n", solve(x, y));
        }
        return 0;
    }