rt,代码如下：

#include<iostream>
#include<cstring>
using namespace std;
int r[1000000], p;

int main() {
	memset(r, -1 ,sizeof(r));
	int T;
    cin >> T;
    for(int i = 1; i <= T; i++) {
        long long n, k, cs = 0;
        cin >> n >> k;
        for(int j = 1; j <= n + 1; j++) {
            if(n / j == k) {
            	bool flag = true;
				for(int m = 0;m < p;m++)
					if(r[p] == n % j) {
						flag = false;
						break;
					}
				if(flag) r[p++] = n % j, cs++;
			}
		}
		cout << cs << endl;
    }
    return 0;
}