A33190. $下面 count_triple 函数的时间复杂度为( )。int count_triple(int n) { int cnt = 0; for (int a = 1; a <= n; a++) for (int b = a; a + b <= n; b++) for (int c = b; a + b + c <= n; c++) if (a * a + b * b == c * c) cnt+…$

单选题困难

知识点

时间复杂度分析循环嵌套算法复杂度

题目描述

下面 count_triple 函数的时间复杂度为(     )。int count_triple(int n) { int cnt = 0; for (int a = 1; a <= n; a++) for (int b = a; a + b <= n; b++) for (int c = b; a + b + c <= n; c++) if (a * a + b * b == c * c) cnt++; return cnt;}

O(N)

O(N 2)

O(N 3)

O(N 4)

上一题下一题