수학

1977번 문제 : 완전제곱수

https://www.acmicpc.net/problem/1977

#include <iostream>
#include <cmath>
using namespace std;
 
int main() {
 
    double a, b;
    cin >> a >> b;
    int min = ceil(sqrt(a));
    int max = floor(sqrt(b));
 
    if (min <= max)
    {
        int sum = 0;
        for (int i = min; i <= max; i++)
        {
            sum += pow(i, 2);
        }
 
        cout << sum << endl;
        cout << pow(min, 2) << endl;
 
    }
    else
    {
        cout << "-1" << endl;
    }
 
    return 0;
}