BOJ 9724 - Perfect Cube [C++]

문제

링크

풀이

#include <cmath>
#include <iostream>
using namespace std;
 
void solve(int idx) {
  int a, b; cin >> a >> b;
 
  cout << "Case #" << idx << ": " << floor(cbrt(b)) - ceil(cbrt(a)) + 1 << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t; cin >> t;
  for (int i=1; i<=t; i++) solve(i);
  return 0;
}