Submission
Status:
--------------------
Subtask/Task Score:
0/100
Score: 0
User: Sunsblad
Problemset: มุมขวาบน
Language: cpp
Time: 0.004 second
Submitted On: 2025-12-06 15:34:58
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n = 0, max = 0 , curNum = 0, power = 0;
cin >> n;
for(int i = 0;i< 23171;i++)
{
power = pow((1 + (2 * i)), 2);
curNum = power - (i * 2);
cout << curNum << '\n';
if(n <= pow((1 + (2 * (i+1))), 2)- ((i+1) * 2)-3 && n > curNum-1)
{
max = curNum;
}
if(n < power)
{
if(max >0)
{
cout << max;
}
else
{
cout << "Cannot find top - right corner";
}
return 0;
}
}
}