algorithm 더블릿|dovelet - 정수 제곱근/boi_squint 블루건 2016. 7. 21. 16:17 문제 1234567891011121314151617#include <iostream>#include <cmath> using namespace std; int main(){ uint64_t n, result; cin >> n; result = sqrt(n); if (pow(result, 2) == n || n == 0) cout << result; else cout << result + 1; return 0;}Colored by Color Scriptercs