8.基數排序

#include <iostream> #include <cmath> #include <cstring> using namespace std; int bits(int t) { int ret = 0; while(t >= 10) { ret++; t /= 10; } return ret + 1; } int find_p(int n, in

>>阅读原文<<