Maintenance script: Repair batch-0002 pages from live compare

2026-03-27T00:16:04Z

Repair batch-0002 pages from live compare

← Older revision		Revision as of 00:16, 27 March 2026
Line 30:		Line 30:
	for (register int i = 0; i < stickNumber; ++i)		for (register int i = 0; i < stickNumber; ++i)
	{		{
	if (IsCanPut(lastBallNumbers[i], ballCount + 1) \|\| 0 == lastBallNumbers[i])		if (IsCanPut(lastBallNumbers[i], ballCount + 1) \|\| 0 == lastBallNumbers[i])
	{		{
	isPut = TRUE;		isPut = TRUE;
	lastBallNumbers[i] = ballCount + 1;		lastBallNumbers[i] = ballCount + 1;
	++ballCount;		++ballCount;
	break;		break;

imported>Unknown at 05:23, 7 February 2021

2021-02-07T05:23:21Z

New page

== [[HanoiTowerTroublesAgain!/조현태]] ==
=== 느낀점 및 설명 ===
기다리는 동안 심심해서... 간단한거 하나..
왜 아무도 않오는 거야앗!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

=== 소스 ===
#include <iostream>
#include <Windows.h>
#include <vector>
#include <cmath>

using namespace std;

bool IsCanPut(int baseBallNumber, int putBallNumber)
{
double sqrtNumber = sqrt((double)(baseBallNumber + putBallNumber));
if (sqrtNumber == (double)(int)sqrtNumber)
return TRUE;
return FALSE;
}

int GetMaxBallNumber(int stickNumber)
{
int ballCount = 0;
vector<int> lastBallNumbers;
lastBallNumbers.resize(stickNumber);
while(1)
{
bool isPut = FALSE;
for (register int i = 0; i < stickNumber; ++i)
{
if (IsCanPut(lastBallNumbers[i], ballCount + 1) || 0 == lastBallNumbers[i])
{
isPut = TRUE;
lastBallNumbers[i] = ballCount + 1;
++ballCount;
break;
}
}
if (FALSE == isPut)
return ballCount;
}

}

void main()
{
int testCaseNumber;
cin >> testCaseNumber;
for (int i = 0; i < testCaseNumber; ++i)
{
int stickNumber;
cin >> stickNumber;
cout << GetMaxBallNumber(stickNumber) << endl;
}
}
----
[[HanoiTowerTroublesAgain!]]

HanoiTowerTroublesAgain!/조현태 - Revision history

Maintenance script: Repair batch-0002 pages from live compare

imported>Unknown at 05:23, 7 February 2021