| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 80617 | sh25_wangtaojie | 大等于n的最小完全平方数 | C++ | Accepted | 0 MS | 240 KB | 378 | 2026-01-04 15:24:16 |
#include <iostream> #include <cmath> #include <climits> int main() { long long n; std::cin >> n; if (n <= 0) { std::cout << 0 << std::endl; return 0; } long long root = static_cast<long long>(std::sqrt(n)); if (root * root < n) { root++; } std::cout << root * root << std::endl; return 0; }