poj 1430 第二类斯特林数

 1 #include <iostream>
 #include <cmath>
 #include <algorithm>
 using namespace std;

 int get2(long long n){
     if(n==)
         return ;
     int cnt =;
     while(n){
         cnt += n/;
         n = n/;
     }
     return cnt;
 }
 int main(){

     int t;
     cin>>t;
     long long n,m;
     while(t--){
         cin>>n>>m;
         long long z = n-(m+)/;
         long long w = (m-)/;
         if(get2(z)-get2(w)-get2(z-w)>){
             cout<<<<endl;
         }else{
             cout<<<<endl;
         }
     }
     return ;
 }