下面 count_triple 函数的时间复杂度为（ ）。

cpp
复制
1int gcd(int m, int n) {
2    if (m == 0) return n;
3    return gcd(n % m, m);
4}
5int count_triple(int n) {
6    int cnt = 0;
7    for (int v = 1; v * v * 4 <= n; v++)
8        for (int u = v + 1; u * (u + v) * 2 <= n; u += 2)
9            if (gcd(u, v) == 1) {
10                int a = u * u - v * v;
11                int b = u * v * 2;
12                int c = u * u + v * v;
13                cnt += n / (a + b + c);
14            }
15    return cnt;
16}