{"text": "#include \n#include \"auth_lib.h\"\n#include \n#include \n\nusing namespace std;\nusing namespace AuthLib;\n\nint main() {\n \n Initialize();\n\n cout << \"=== Authentication Test Program ===\" << endl;\n\n string licenseKey;\n cout << \"Enter license key: \";\n cin >> licenseKey;\n\n \n Authenticate(licenseKey, [](bool success, const string& message) {\n cout << \"\\nAuthentication result: \" << message << endl;\n if (success) {\n cout << \"Remaining days: \" << GetRemainingDays() << endl;\n }\n });\n\n \n string loadingText = \"Loading...\";\n int index = 0;\n\n while (!IsAuthenticated() && GetAuthMessage().empty()) {\n cout << \"\\r\" << loadingText.substr(0, index + 1) << flush;\n this_thread::sleep_for(chrono::milliseconds(1));\n index = (index + 1) % loadingText.size();\n }\n\n\n cout << \"\\r\" << string(loadingText.size(), ' ') << \"\\r\";\n\n \n if (!GetAuthMessage().empty() && !IsAuthenticated()) {\n cout << \"Error: \" << GetAuthMessage() << endl;\n }\n\n if (IsAuthenticated()) {\n cout << \"=== ACCESS GRANTED ===\" << endl;\n\n }\n else {\n cout << \"=== ACCESS DENIED ===\" << endl;\n }\n system(\"pause\");\n return 0;\n}\n"} {"text": "#include \n#include \n#include \nusing namespace std;\nusing namespace sf;\n\nstruct Box\n{\n int x;\n int y;\n bool isEmpty;\n int parentRow;\n int parentCol;\n int row;\n int col;\n bool isVisited;\n bool isPath;\n bool isExplored;\n};\n\nvector> boxList(40);\n\nBox start;\nBox finish;\n\nstring bfsLength = \"0\";\nstring dijkstraLength = \"0\";\nstring dfsLength = \"0\";\n\nvoid drawWindow(RectangleShape box, bool isStartSelected, bool isFinishSelected, RenderWindow &win, string time, Text txt, int boxSize, string algo)\n{\n for (int r = 0; r < 40; r++)\n {\n for (int c = 0; c < 50; c++)\n {\n box.setPosition(Vector2f(boxList[r][c].x, boxList[r][c].y));\n if (boxList[r][c].x == start.x && boxList[r][c].y == start.y && isStartSelected)\n {\n box.setFillColor(Color::Green);\n win.draw(box);\n continue;\n }\n else if (boxList[r][c].x == finish.x && boxList[r][c].y == finish.y && isFinishSelected)\n {\n box.setFillColor(Color::Red);\n win.draw(box);\n continue;\n }\n if (!boxList[r][c].isEmpty)\n {\n box.setFillColor(Color(50, 73, 97));\n win.draw(box);\n }\n else if (boxList[r][c].isVisited && boxList[r][c].isPath)\n {\n box.setFillColor(Color::Yellow);\n win.draw(box);\n }\n else if (boxList[r][c].isVisited)\n {\n box.setFillColor(Color(75, 156, 237));\n win.draw(box);\n }\n else if (boxList[r][c].isExplored)\n {\n box.setFillColor(Color::Cyan);\n }\n else\n {\n box.setFillColor(Color::White);\n win.draw(box);\n }\n }\n }\n txt.setString(algo + \" :\");\n txt.setPosition(Vector2f(boxSize * 60 - 40, boxSize * 20 + 15));\n win.draw(txt);\n txt.setString(time);\n if (algo == \"bfs\")\n {\n txt.setPosition(Vector2f(boxSize * 60 + 25, boxSize * 20 + 15));\n }\n else\n {\n txt.setPosition(Vector2f(boxSize * 61 + 65, boxSize * 20 + 15));\n }\n win.draw(txt);\n}\n\nclass Algorithms\n{\n\npublic:\n string applyBFS(Text txt, Clock clock, string time, RenderWindow &win, RectangleShape &box, int boxSize, bool isStartSelected, bool isFinishSelected)\n {\n\n int rows = boxList.size();\n int cols = boxList[0].size();\n queue q;\n\n int nextRows[] = {1, -1, 0, 0};\n int nextCols[] = {0, 0, 1, -1};\n\n q.push(start);\n start.isVisited = true;\n\n bool isFound = false;\n\n while (!q.empty())\n {\n Box current = q.front();\n q.pop();\n\n if (current.row == finish.row && current.col == finish.col)\n {\n finish = current;\n isFound = true;\n break;\n }\n\n for (int i = 0; i < 4; i++)\n {\n int nextRow = current.row + nextRows[i];\n int nextCol = current.col + nextCols[i];\n\n if (nextRow < 0 || nextRow >= rows || nextCol < 0 || nextCol >= cols)\n {\n continue;\n }\n\n if (boxList[nextRow][nextCol].isEmpty && !boxList[nextRow][nextCol].isVisited)\n {\n boxList[nextRow][nextCol].isVisited = true;\n boxList[nextRow][nextCol].parentRow = current.row;\n boxList[nextRow][nextCol].parentCol = current.col;\n q.push(boxList[nextRow][nextCol]);\n\n // Update time during BFS execution\n float timeCount = clock.getElapsedTime().asSeconds();\n time = to_string(timeCount);\n\n win.clear();\n drawWindow(box, isStartSelected, isFinishSelected, win, time, txt, boxSize, \"BFS\");\n win.display();\n sf::sleep(sf::milliseconds(2));\n }\n }\n }\n\n vector path;\n boxList[start.row][start.col].parentRow = -1;\n boxList[start.row][start.col].parentCol = -1;\n if (isFound)\n {\n Box current = finish;\n while (current.parentRow != -1 && path.size() < 2000)\n {\n path.push_back(current);\n boxList[current.row][current.col].isPath = true;\n current = boxList[current.parentRow][current.parentCol];\n\n win.clear();\n drawWindow(box, isStartSelected, isFinishSelected, win, time, txt, boxSize, \"BFS\");\n win.display();\n sf::sleep(sf::milliseconds(100)); // Slower delay for path visualization\n }\n path.push_back(start);\n bfsLength = to_string(path.size() - "} {"text": "#include \n#include \n#include \n#include \n#include \n#include \n#ifndef M_PI\n#define M_PI 3.14159265358979323846\n#endif\n#include \"tyme.h\"\n\nusing std::ceil;\n\nusing namespace std;\n\nnamespace tyme {\n bool AbstractCulture::equals(const Culture *o) const {\n return o && o->to_string() == to_string();\n }\n\n string AbstractCulture::get_name() const {\n return \"\";\n }\n\n string AbstractCulture::to_string() const {\n return get_name();\n }\n\n int AbstractCulture::index_of(const int index, const int size) {\n const int i = index % size;\n return i < 0 ? i + size : i;\n }\n\n int LoopTyme::get_index() const {\n return index;\n }\n\n int LoopTyme::get_size() const {\n return static_cast(names.size());\n }\n\n string LoopTyme::get_name() const {\n return names[index];\n }\n\n int LoopTyme::index_of(const string &name) const {\n for (int i = 0, j = get_size(); i < j; i++) {\n if (name == names[i]) {\n return i;\n }\n }\n throw invalid_argument(\"illegal name: \" + name);\n }\n\n int LoopTyme::index_of(const int index) const {\n return AbstractCulture::index_of(index, get_size());\n }\n\n int LoopTyme::next_index(const int n) const {\n return index_of(index + n);\n }\n\n int LoopTyme::steps_to(const int target_index) const {\n return index_of(target_index - index);\n }\n\n const vector Animal::NAMES = {\n \"蛟\", \"龙\", \"貉\", \"兔\", \"狐\", \"虎\", \"豹\", \"獬\", \"牛\", \"蝠\", \"鼠\", \"燕\", \"猪\", \"獝\", \"狼\", \"狗\", \"彘\", \"鸡\", \"乌\", \"猴\", \"猿\", \"犴\", \"羊\", \"獐\", \"马\", \"鹿\", \"蛇\", \"蚓\"\n };\n\n Animal Animal::from_index(const int index) {\n return Animal(index);\n }\n\n Animal Animal::from_name(const string &name) {\n return Animal(name);\n }\n\n Animal Animal::next(const int n) const {\n return from_index(next_index(n));\n }\n\n TwentyEightStar Animal::get_twenty_eight_star() const {\n return TwentyEightStar::from_index(index);\n }\n\n const vector Beast::NAMES = {\n \"青龙\", \"玄武\", \"白虎\", \"朱雀\"\n };\n\n Beast Beast::from_index(const int index) {\n return Beast(index);\n }\n\n Beast Beast::from_name(const string &name) {\n return Beast(name);\n }\n\n Beast Beast::next(const int n) const {\n return from_index(next_index(n));\n }\n\n Zone Beast::get_zone() const {\n return Zone::from_index(index);\n }\n\n const vector Constellation::NAMES = {\n \"白羊\", \"金牛\", \"双子\", \"巨蟹\", \"狮子\", \"处女\", \"天秤\", \"天蝎\", \"射手\", \"摩羯\", \"水瓶\", \"双鱼\"\n };\n\n Constellation Constellation::from_index(const int index) {\n return Constellation(index);\n }\n\n Constellation Constellation::from_name(const string &name) {\n return Constellation(name);\n }\n\n Constellation Constellation::next(const int n) const {\n return from_index(next_index(n));\n }\n\n /**\n * @brief 依据后天八卦排序（0坎北, 1坤西南, 2震东, 3巽东南, 4中, 5乾西北, 6兑西, 7艮东北, 8离南）\n */\n const vector Direction::NAMES = {\n \"北\", \"西南\", \"东\", \"东南\", \"中\", \"西北\", \"西\", \"东北\", \"南\"\n };\n\n Direction Direction::from_index(const int index) {\n return Direction(index);\n }\n\n Direction Direction::from_name(const string &name) {\n return Direction(name);\n }\n\n Direction Direction::next(const int n) const {\n return from_index(next_index(n));\n }\n\n Land Direction::get_land() const {\n return Land::from_index(index);\n }\n\n Element Direction::get_element() const {\n const int indices[9] = {4, 2, 0, 0, 2, 3, 3, 2, 1};\n return Element::from_index(indices[index]);\n }\n\n const vector Duty::NAMES = {\n \"建\", \"除\", \"满\", \"平\", \"定\", \"执\", \"破\", \"危\", \"成\", \"收\", \"开\", \"闭\"\n };\n\n Duty Duty::from_index(const int index) {\n return Duty(index);\n }\n\n Duty Duty::from_name(const string &name) {\n return Duty(name);\n }\n\n Duty Duty::next(const int n) const {\n return from_index(next_index(n));\n }\n\n const vector Element::NAMES = {\n \"木\", \"火\", \"土\", \"金\", \"水\"\n };\n\n Element Element::from_index(const int index) {\n return Element(index);\n }\n\n Element Element::from_name(const string &name) {\n return Element(name);\n }\n\n Element Element::next(const int n) const {\n return from_index(next_index(n));\n }\n\n bool Element::equals(const Element &other) const {\n return to_string() == other.to_string();\n }\n\n\n Element Element::get_reinforce() const {\n return next(1);\n }\n\n Element Element::get_restrain() const {\n return next(2);\n }\n\n Element Element::get_reinforced() const {\n return next(-1);\n }\n\n Element Element::get_restrained() const {\n return next(-2);\n }\n\n Direction Element::get_direction() const {\n const int indices[5] = {2, 8, 4, 6, 0};\n return Direction::from_index(indices[index]);\n }\n\n const vec"} {"text": "// https://github.com/CedricGuillemet/ImGuizmo\n// v1.91.3 WIP\n//\n// The MIT License(MIT)\n//\n// Copyright(c) 2021 Cedric Guillemet\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files(the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and / or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions :\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n//\n\n#ifndef IMGUI_DEFINE_MATH_OPERATORS\n#define IMGUI_DEFINE_MATH_OPERATORS\n#endif\n#include \"imgui/imgui.h\"\n#include \"imgui/imgui_internal.h\"\n#include \"ImGuizmo.h\"\n\n#if defined(_MSC_VER) || defined(__MINGW32__)\n#include \n#endif\n#if !defined(_MSC_VER) && !defined(__MINGW64_VERSION_MAJOR)\n#define _malloca(x) alloca(x)\n#define _freea(x)\n#endif\n\n// includes patches for multiview from\n// https://github.com/CedricGuillemet/ImGuizmo/issues/15\n\nnamespace IMGUIZMO_NAMESPACE\n{\n static const float ZPI = 3.14159265358979323846f;\n static const float RAD2DEG = (180.f / ZPI);\n static const float DEG2RAD = (ZPI / 180.f);\n const float screenRotateSize = 0.06f;\n // scale a bit so translate axis do not touch when in universal\n const float rotationDisplayFactor = 1.2f;\n\n static OPERATION operator&(OPERATION lhs, OPERATION rhs)\n {\n return static_cast(static_cast(lhs) & static_cast(rhs));\n }\n\n static bool operator!=(OPERATION lhs, int rhs)\n {\n return static_cast(lhs) != rhs;\n }\n\n static bool Intersects(OPERATION lhs, OPERATION rhs)\n {\n return (lhs & rhs) != 0;\n }\n\n // True if lhs contains rhs\n static bool Contains(OPERATION lhs, OPERATION rhs)\n {\n return (lhs & rhs) == rhs;\n }\n\n ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n // utility and math\n\n void FPU_MatrixF_x_MatrixF(const float* a, const float* b, float* r)\n {\n r[0] = a[0] * b[0] + a[1] * b[4] + a[2] * b[8] + a[3] * b[12];\n r[1] = a[0] * b[1] + a[1] * b[5] + a[2] * b[9] + a[3] * b[13];\n r[2] = a[0] * b[2] + a[1] * b[6] + a[2] * b[10] + a[3] * b[14];\n r[3] = a[0] * b[3] + a[1] * b[7] + a[2] * b[11] + a[3] * b[15];\n\n r[4] = a[4] * b[0] + a[5] * b[4] + a[6] * b[8] + a[7] * b[12];\n r[5] = a[4] * b[1] + a[5] * b[5] + a[6] * b[9] + a[7] * b[13];\n r[6] = a[4] * b[2] + a[5] * b[6] + a[6] * b[10] + a[7] * b[14];\n r[7] = a[4] * b[3] + a[5] * b[7] + a[6] * b[11] + a[7] * b[15];\n\n r[8] = a[8] * b[0] + a[9] * b[4] + a[10] * b[8] + a[11] * b[12];\n r[9] = a[8] * b[1] + a[9] * b[5] + a[10] * b[9] + a[11] * b[13];\n r[10] = a[8] * b[2] + a[9] * b[6] + a[10] * b[10] + a[11] * b[14];\n r[11] = a[8] * b[3] + a[9] * b[7] + a[10] * b[11] + a[11] * b[15];\n\n r[12] = a[12] * b[0] + a[13] * b[4] + a[14] * b[8] + a[15] * b[12];\n r[13] = a[12] * b[1] + a[13] * b[5] + a[14] * b[9] + a[15] * b[13];\n r[14] = a[12] * b[2] + a[13] * b[6] + a[14] * b[10] + a[15] * b[14];\n r[15] = a[12] * b[3] + a[13] * b[7] + a[14] * b[11] + a[15] * b[15];\n }\n\n void Frustum(float left, float right, float bottom, float top, float znear, float zfar, float* m16)\n {\n float temp, temp2, temp3, temp4;\n temp = 2.0f * znear;\n temp2 = right - left;\n temp3 = top - bottom;\n temp4 = zfar - znear;\n m16[0] = temp / temp2;\n m16[1] = 0.0;\n m16[2] = 0.0;\n m16[3] = 0.0;\n m16[4] = 0.0;\n m16[5] = temp / temp3;\n m16[6] = 0.0;\n m16[7] = 0.0;\n m16[8] = (right + left) / temp2;\n m16[9] = (top + bottom) / temp3;\n m16[10] = (-zfar - znear) / temp4;\n m16[11] = -1.0f;\n m16[12] = 0.0;\n m16[13] = 0.0;\n m16[14] = (-temp * zfar) / temp4;\n m16[15] = 0.0;\n }\n\n void Perspective(float fovyInDegrees, float aspectRatio, float znear, float zfar, float* m16)\n {\n float ymax, xmax;\n ymax = znear * tanf(fovyInDegrees * DEG2RAD);\n xmax = ymax * aspectRatio;\n Frustum(-xmax, xmax, -ymax, ymax, znear, zfar, m16);\n }\n\n void Cross(const float* a, const float* b, float* r)\n {\n r[0] = a[1] * b[2] - a[2] * b[1];\n r[1] = a[2] * b[0] - a[0] * b[2];\n r[2]"} {"text": "#include \n#include \"BTree.h\"\n\n\n\nbool checkTest(std::string testName, int whatItShouldBe, int whatItIs);\nBTree populateTree();\n\nint main() {\n BTree myTree = populateTree();\n myTree.preOrder();\n std::cout << std::endl << std::endl;\n myTree.postOrder();\n std::cout << std::endl << std::endl;\n myTree.inOrder();\n std::cout << std::endl << std::endl;\n checkTest(\"Test #1, number of nodes\", 35, myTree.nodeCount());\n\n\n return 0;\n}\n\nBTree populateTree(){\n BTree myTree;\n int values[] = {37, 32, 73, 95, 42, 12, 0, 49, 98, 7, 27, 17, 47, 87, 77, 97, 67, 85, 15, 5, 35, 55, 65, 75, 25, 45, 3, 93, 83, 53, 63, 23, 13, 43, 33};\n int size = (sizeof(values)/sizeof(*values));\n\n for(int i = 0; i < size; i++){\n myTree.insert(values[i]);\n }\n return myTree;\n\n}\n\n//Helps with Testing\nbool checkTest(std::string testName, int whatItShouldBe, int whatItIs) {\n\n if (whatItShouldBe == whatItIs) {\n std::cout << \"Passed \" << testName << std::endl;\n return true;\n }\n else {\n std::cout << \"***Failed test \" << testName << \" *** \" << std::endl << \" Output was \" << whatItIs << std::endl << \" Output should have been \" << whatItShouldBe << std::endl;\n return false;\n }\n}\n"} {"text": "#include \"CentipedesPNC.h\"\n#include \"components/components.h\"\n#include \"Pipelines/CentipedePipeline.h\"\n\nUCentipedesPNC::UCentipedesPNC()\n{\n\tPrimaryComponentTick.bCanEverTick = true;\n}\n\nvoid UCentipedesPNC::BeginPlay()\n{\n Super::BeginPlay();\n\n InstancedMeshComponent = this->GetOwner()->GetComponentByClass();\n verifyf(InstancedMeshComponent, TEXT(\"Requires a UInstancedStaticMeshComponent component\"));\n\n // create all our component types\n const PNC::ComponentType* typePosition = AddComponentType();\n const PNC::ComponentType* typeRotation = AddComponentType();\n const PNC::ComponentType* typeScale = AddComponentType();\n const PNC::ComponentType* typeFInstancedStaticMeshInstanceData = AddComponentType();\n const PNC::ComponentType* typePositionPrevious = AddComponentType();\n const PNC::ComponentType* typeVelocity = AddComponentType();\n const PNC::ComponentType* typeMass = AddComponentType();\n const PNC::ComponentType* typeSoftBodyNode = AddComponentType();\n const PNC::ComponentType* typeCentipede = AddComponentType();\n const PNC::ComponentType* typeCentipedeBodyNode = AddComponentType();\n \n CentipedeBodyChunkStructure = AddChunkStructure({\n typePosition,\n typePositionPrevious,\n typeRotation,\n typeScale,\n typeVelocity,\n typeMass,\n typeSoftBodyNode,\n typeFInstancedStaticMeshInstanceData,\n typeCentipede,\n typeCentipedeBodyNode,\n });\n\n const PNC::ComponentType* typeLocalTransform = AddComponentType();\n const PNC::ComponentType* typeCentipedeLegNode = AddComponentType();\n const PNC::ComponentType* typeSingleParentOutsideChunk = AddComponentType();\n const PNC::ComponentType* typeCoParentInChunk = AddComponentType();\n\n LegChunkStructure = AddChunkStructure({\n typeSingleParentOutsideChunk,\n typeCoParentInChunk,\n typePosition,\n typeRotation,\n typeScale,\n typeLocalTransform,\n typeFInstancedStaticMeshInstanceData,\n typeCentipedeLegNode,\n });\n\n // Create all our centipedes\n for (int32 i = 0; i < CentipedeCount; ++i)\n CreateCentipede();\n\n TickPipeline = new CentipedePipeline(this);\n}\n\nPNC::KChunkTree& UCentipedesPNC::CreateCentipede()\n{\n auto segementCount = FMath::RandRange(CentipedeSegmentsMin, CentipedeSegmentsMin + CentipedeSegmentsRange);\n PNC::KChunkTree& centipedeChunk = AddChunk(CentipedeBodyChunkStructure, segementCount, segementCount);\n ChunksCentipede.Add(centipedeChunk);\n\n uint32 legNodesPerSegment = LegPerSegment * NodePerLeg * 2; // * 2 for left and right legs;\n uint32 totalLegNodes = segementCount * legNodesPerSegment;\n\n // Initialize the chunks data.\n InitCentipede(this).Run(centipedeChunk);\n CopyPreviousPosition().Run(centipedeChunk);\n\n // run the centipede logic once to move the centipede\n CentipedeLogic(this, 0).Run(centipedeChunk);\n\n // make sure all segment of the centipede are together at the correct length\n ConstrainSoftBodyPositions().Run(centipedeChunk);\n\n PNC::KChunkArrayTree& legChunkArray = AddChunkArray(LegChunkStructure, legNodesPerSegment, segementCount, segementCount, legNodesPerSegment);\n InitCentipedeLegs(segementCount, LegPerSegment, NodePerLeg, LegNodeLength, LegScale, LegScale2).Run(legChunkArray);\n\n // attach legs chunk to the centipede body chunk\n centipedeChunk.InsertFirstChild(&legChunkArray);\n\n return centipedeChunk;\n}\n\nvoid UCentipedesPNC::TickComponent(float DeltaTime, ELevelTick TickType, FActorComponentTickFunction* ThisTickFunction)\n{\n Super::TickComponent(DeltaTime, TickType, ThisTickFunction);\n\n // Compute the total number of nodes that will need to be rendered and resize \n // the InstancedMeshComponent accordingly.\n {\n TRACE_CPUPROFILER_EVENT_SCOPE(TEXT(\"Centipede Reserve space\"));\n int32 totalNodes = 0;\n for (auto cw : ChunksCentipede)\n {\n auto& c = cw.get();\n totalNodes += c->GetNodeCount();\n\n auto firstChild = c.GetFirstChildChunk();\n auto currentChild = firstChild;\n if (currentChild != nullptr)\n do\n {\n totalNodes += currentChild->GetChunk().GetNodeCount();\n currentChild = currentChild->GetNextSiblingChunk();\n } while (currentChild != firstChild);\n\n }\n auto availableCount = InstancedMeshComponent->GetInstanceCount();\n auto neededCount = totalNodes;\n while (availableCount < neededCount)\n {\n InstancedMeshComponent->AddInstance(FTransform::Identity);\n ++availableCount;\n }\n while (availableCount "} {"text": "// Fill out your copyright notice in the Description page of Project Settings.\n\n\n#include \"Weapon/WeaponBase.h\"\n\n#include \"Kismet/KismetMathLibrary.h\"\n\n#include \"Weapon/BulletBase.h\"\n#include \"Character/CharacterBase.h\"\n#include \"Character/PlayerBase.h\"\n#include \n\n// Sets default values\nAWeaponBase::AWeaponBase()\n{\n \t// Set this actor to call Tick() every frame. You can turn this off to improve performance if you don't need it.\n\tPrimaryActorTick.bCanEverTick = true;\n\n\tMesh = CreateDefaultSubobject(TEXT(\"Mesh\"));\n\tMesh->SetupAttachment(RootComponent);\n\n\tMuzzleOffset = CreateDefaultSubobject(TEXT(\"MuzzleOffset\"));\n\tMuzzleOffset->SetupAttachment(Mesh);\n}\n\n// Called when the game starts or when spawned\nvoid AWeaponBase::BeginPlay()\n{\n\tSuper::BeginPlay();\n\t\n\n}\n\nvoid AWeaponBase::Fire()\n{\n\tUAnimInstance* AnimInstance = Mesh->GetAnimInstance();\n\tif (IsValid(AnimInstance) && IsValid(FireAnimMontage)) {\n\t\tAnimInstance->Montage_Play(FireAnimMontage);\n\t}\n\n\tif (IsValid(BulletClass)) {\n\t\tFRotator SpawnRotation = MuzzleOffset->GetComponentRotation();\n\t\tFVector SpawnLocation = MuzzleOffset->GetComponentLocation();\n\n\t\tFActorSpawnParameters SpawnParams;\n\t\tSpawnParams.Owner = this;\n\n\t\t// APlayerBase로 캐스팅 하면 안되나? Enemy가 총을 쏠 수 있잖아..\n\t\t// PlayerController->GetViewportSize(x, y); 이래.. 그럼 이것도 오버라이딩해서 에너미랑 플레이어로 구분하는게 좋을듯.. \n\t\tACharacterBase* WeaponOwner = Cast(GetOwner());\n\t\tif (!IsValid(WeaponOwner)) return;\n\n\t\tAController* WeaponOwnerController = WeaponOwner->GetController();\n\t\tif (!IsValid(WeaponOwner)) return;\n\n\n\t\tif (APlayerController* PlayerController = Cast(WeaponOwnerController))\n\t\t{\n\t\t\tint32 x, y;\n\t\t\tPlayerController->GetViewportSize(x, y);\n\n\t\t\t// WorldCenter의 존재 이유가 뭘까???\n\t\t\tFVector WorldCenter;\n\t\t\tFVector WorldFront;\n\t\t\tPlayerController->DeprojectScreenPositionToWorld(x * 0.5f, y * 0.5f, WorldCenter, WorldFront);\n\n\t\t\t//UE_LOG(LogTemp, Display, TEXT(\"World Center: %s\"), *WorldCenter.ToCompactString());\n\n\t\t\tWorldCenter += WorldFront * 10000;\n\t\t\tSpawnRotation = UKismetMathLibrary::FindLookAtRotation(SpawnLocation, WorldCenter);\n\n\t\t\tGetWorld()->SpawnActor(BulletClass, SpawnLocation, SpawnRotation, SpawnParams);\n\t\t} \n\t\telse if (AAIControllerBase* AIController = Cast(WeaponOwnerController))\n\t\t{\n\t\t\tAPawn* TargetPawn = GetWorld()->GetFirstPlayerController()->GetPawn();\n\n\t\t\tSpawnRotation = UKismetMathLibrary::FindLookAtRotation(SpawnLocation, TargetPawn->GetActorLocation());\n\t\t\tGetWorld()->SpawnActor(BulletClass, SpawnLocation, SpawnRotation, SpawnParams);\n\t\t}\n\t}\n}\n\n\n\n\n\n"} {"text": "#include \n#include \"camera.hpp\"\n\ncamera_t::camera_t() {\n this->m_position = glm::vec3(0.0f, 0.0f, 10.0f);\n this->m_angle = glm::vec2(0.f, 0.f); // (0,0,-1) righthanded (elevation angle, angle arround y axis)\n\n this->m_mouse_sensitivity = 0.2f;\n this->m_mouse_locked = false;\n\n\tthis->m_lock_mouse();\n}\n\nvoid camera_t::m_lock_mouse() {\n\tthis->m_center_position = sf::Vector2f(eng::window.getSize().x / 2.f, eng::window.getSize().y / 2.f);\n\teng::window.setMouseCursorVisible(false);\n\tsf::Mouse::setPosition(\n\t\teng::window.mapCoordsToPixel({ this->m_center_position.x, this->m_center_position.y }), \n\t\teng::window);\n\tthis->m_mouse_locked = true;\n}\n\nvoid camera_t::m_handle_mouse_movement() {\n if (!this->m_mouse_locked) {\n this->m_lock_mouse();\n return;\n }\n\n sf::Vector2f mouse_position = (sf::Vector2f)sf::Mouse::getPosition(eng::window);\n sf::Vector2f mouse_delta = mouse_position - this->m_center_position;\n\n this->m_angle.y -= mouse_delta.x * this->m_mouse_sensitivity * 0.0174533f;\n this->m_angle.x -= mouse_delta.y * this->m_mouse_sensitivity * 0.0174533f;\n\n sf::Mouse::setPosition(\n\t\teng::window.mapCoordsToPixel({ this->m_center_position.x, this->m_center_position.y }), \n\t\teng::window);\n}\n\nvoid camera_t::pass_data_to_shader() {\n\teng::window.set_uniform(\"camera_position\", this->get_position());\n\teng::window.set_uniform(\"camera_angle\", this->get_angle());\n}\n\nvoid camera_t::move() {\n\tthis->m_handle_mouse_movement();\n\n\tfloat fixed_speed = 1.0f * eng::delta_time;\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::LControl)) {\n\t\tfixed_speed *= 10;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::W)) {\n\t\tthis->m_position.x -= std::sin(this->m_angle.y) * fixed_speed;\n\t\tthis->m_position.z -= std::cos(this->m_angle.y) * fixed_speed;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::S)) {\n\t\tthis->m_position.x += std::sin(this->m_angle.y) * fixed_speed;\n\t\tthis->m_position.z += std::cos(this->m_angle.y) * fixed_speed;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::A)) {\n\t\tthis->m_position.x += std::sin(this->m_angle.y - 3.14159f/2.f) * fixed_speed;\n\t\tthis->m_position.z += std::cos(this->m_angle.y - 3.14159f/2.f) * fixed_speed;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::D)) {\n\t\tthis->m_position.x -= std::sin(this->m_angle.y - 3.14159f/2.f) * fixed_speed;\n\t\tthis->m_position.z -= std::cos(this->m_angle.y - 3.14159f/2.f) * fixed_speed;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::Space)) {\n\t\tthis->m_position.y += fixed_speed;\n\t}\n\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::LShift)) {\n\t\tthis->m_position.y -= fixed_speed;\n\t}\n\t\n\tif (sf::Keyboard::isKeyPressed(sf::Keyboard::C)) {\n\t\teng::window.set_uniform(\"FAR\", -100.f);\n\t\tthis->m_mouse_sensitivity = 0.02f;\n } else {\n\t\teng::window.set_uniform(\"FAR\", -10.f);\n\t\tthis->m_mouse_sensitivity = 0.2f;\n\t}\n}\n"} {"text": "#include \"DisplayManager.h\"\r\n\r\nvoid DisplayManager::init() {\r\n tft.begin();\r\n tft.setRotation(3);\r\n clearScreen();\r\n}\r\n\r\nvoid DisplayManager::updateDisplay(const SensorData& data, SystemStatus status) {\r\n clearScreen();\r\n drawHeader(status);\r\n drawSensorData(data);\r\n drawRecommendations(status, data);\r\n}\r\n\r\nvoid DisplayManager::drawHeader(SystemStatus status) {\r\n tft.setTextSize(2);\r\n tft.setTextColor(TEXT_COLOR);\r\n\r\n tft.setCursor(10, 10);\r\n tft.print(\"Status: \");\r\n\r\n switch (status) {\r\n case STATUS_GOOD:\r\n tft.setTextColor(GOOD_COLOR);\r\n tft.print(\"GOOD\");\r\n break;\r\n case STATUS_WARNING:\r\n tft.setTextColor(WARNING_COLOR);\r\n tft.print(\"WARNING\");\r\n break;\r\n case STATUS_CRITICAL:\r\n tft.setTextColor(CRITICAL_COLOR);\r\n tft.print(\"CRITICAL\");\r\n break;\r\n }\r\n\r\n tft.drawLine(0, 35, 320, 35, TEXT_COLOR);\r\n}\r\n\r\nvoid DisplayManager::drawSensorData(const SensorData& data) {\r\n tft.setTextSize(2);\r\n tft.setTextColor(TEXT_COLOR);\r\n\r\n tft.setCursor(10, 50);\r\n tft.print(\"Temp: \");\r\n tft.print(data.temperature, 1);\r\n tft.print(\" C\");\r\n\r\n tft.setCursor(10, 80);\r\n tft.print(\"Humidity: \");\r\n tft.print(data.humidity, 1);\r\n tft.print(\" %\");\r\n\r\n tft.setCursor(10, 110);\r\n tft.print(\"Light: \");\r\n tft.print(data.lightLevel);\r\n tft.print(\" lx\");\r\n\r\n tft.drawLine(0, 140, 320, 140, TEXT_COLOR);\r\n}\r\n\r\nvoid DisplayManager::drawRecommendations(SystemStatus status, const SensorData& data) {\r\n tft.setTextSize(1);\r\n tft.setTextColor(TEXT_COLOR);\r\n\r\n tft.setCursor(10, 150);\r\n tft.print(\"Recommendations:\");\r\n\r\n String recommendations = getRecommendationText(status, data);\r\n tft.setCursor(10, 170);\r\n tft.setTextSize(1);\r\n\r\n int currentY = 170;\r\n int lineHeight = 15;\r\n\r\n String currentLine = \"\";\r\n for (int i = 0; i < recommendations.length(); i++) {\r\n char c = recommendations[i];\r\n if (c == '\\n' || currentLine.length() > 35) {\r\n tft.setCursor(10, currentY);\r\n tft.print(currentLine);\r\n currentLine = \"\";\r\n currentY += lineHeight;\r\n if (c == '\\n') continue;\r\n }\r\n currentLine += c;\r\n }\r\n\r\n if (currentLine.length() > 0) {\r\n tft.setCursor(10, currentY);\r\n tft.print(currentLine);\r\n }\r\n}\r\n\r\nString DisplayManager::getRecommendationText(SystemStatus status, const SensorData& data) {\r\n if (status == STATUS_GOOD) {\r\n return \"All parameters optimal! Maintain current conditions.\";\r\n }\r\n\r\n String recommendations = \"\";\r\n\r\n if (data.temperature < 18) {\r\n recommendations += \"! Increase temperature (heater)\\n\";\r\n }\r\n else if (data.temperature > 26) {\r\n recommendations += \"! Decrease temperature (AC/ventilation)\\n\";\r\n }\r\n\r\n if (data.humidity < 30) {\r\n recommendations += \"! Increase humidity (humidifier)\\n\";\r\n }\r\n else if (data.humidity > 60) {\r\n recommendations += \"! Decrease humidity (dehumidifier)\\n\";\r\n }\r\n\r\n if (data.lightLevel < 100) {\r\n recommendations += \"! Increase lighting (more light)\\n\";\r\n }\r\n else if (data.lightLevel > 800) {\r\n recommendations += \"! Decrease lighting (curtains/shades)\\n\";\r\n }\r\n\r\n return recommendations;\r\n}\r\n\r\nvoid DisplayManager::clearScreen() {\r\n tft.fillScreen(BACKGROUND_COLOR);\r\n}\r\n\r\nvoid DisplayManager::showSplashScreen() {\r\n clearScreen();\r\n tft.setTextSize(2);\r\n tft.setTextColor(ILI9341_CYAN);\r\n tft.setCursor(50, 100);\r\n tft.print(\"Environment Monitor by NMRB_CPP\");\r\n tft.setTextColor(ILI9341_WHITE);\r\n tft.setCursor(80, 130);\r\n tft.print(\"Starting\");\r\n\r\n for (int i = 0; i < 3; i++) {\r\n tft.setCursor(180 + i * 12, 130);\r\n tft.print(\".\");\r\n delay(500);\r\n }\r\n}"} {"text": "// made by const - github.com/yfz\r\n\r\n#define _CRT_SECURE_NO_WARNINGS\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nconst std::string spotify_path = std::string(std::getenv(\"APPDATA\")) + \"\\\\Spotify\\\\Spotify.exe\";\r\nconst std::string hosts_path = \"C:\\\\Windows\\\\System32\\\\drivers\\\\etc\\\\hosts\";\r\n\r\nconst std::vector allahyok = {\r\n \"0.0.0.0 audio-ads.spotify.com\",\r\n \"0.0.0.0 pubads.g.doubleclick.net\",\r\n \"0.0.0.0 googleads.g.doubleclick.net\",\r\n \"0.0.0.0 spclient.wg.spotify.com\"\r\n};\r\n\r\nenum class log_level { info, success, error };\r\n\r\nvoid log(log_level level, const std::string& message) {\r\n HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\r\n static const struct { const char* prefix; WORD color; } settings[] = {\r\n { \"[#] \", FOREGROUND_RED | FOREGROUND_GREEN },\r\n { \"[+] \", FOREGROUND_GREEN | FOREGROUND_INTENSITY },\r\n { \"[-] \", FOREGROUND_RED | FOREGROUND_INTENSITY }\r\n };\r\n\r\n auto& [prefix, color] = settings[static_cast(level)];\r\n\r\n SetConsoleTextAttribute(hConsole, color);\r\n std::cout << prefix;\r\n\r\n SetConsoleTextAttribute(hConsole, FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_BLUE);\r\n std::cout << message << std::endl;\r\n}\r\n\r\nvoid hi_spotify() {\r\n HANDLE snapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\r\n if (snapshot == INVALID_HANDLE_VALUE) return;\r\n\r\n PROCESSENTRY32 pe{ sizeof(PROCESSENTRY32) };\r\n bool killed = false;\r\n\r\n if (Process32First(snapshot, &pe)) {\r\n do {\r\n if (!_wcsicmp(pe.szExeFile, L\"Spotify.exe\")) {\r\n HANDLE proc = OpenProcess(PROCESS_TERMINATE, FALSE, pe.th32ProcessID);\r\n if (proc) {\r\n TerminateProcess(proc, 0);\r\n CloseHandle(proc);\r\n killed = true;\r\n }\r\n }\r\n } while (Process32Next(snapshot, &pe));\r\n }\r\n\r\n CloseHandle(snapshot);\r\n\r\n if (killed) {\r\n log(log_level::success, \"Operation completed: Spotify process has been successfully terminated.\");\r\n }\r\n else {\r\n log(log_level::info, \"Status check: Spotify process was not found among running applications. No action required.\");\r\n }\r\n}\r\n\r\nvoid start_spotify() {\r\n if (GetFileAttributesA(spotify_path.c_str()) == INVALID_FILE_ATTRIBUTES) {\r\n log(log_level::error, \"Unable to locate Spotify. Please ensure Spotify is installed correctly at: \" + spotify_path);\r\n return;\r\n }\r\n\r\n ShellExecuteA(NULL, \"open\", spotify_path.c_str(), nullptr, nullptr, SW_SHOW);\r\n log(log_level::success, \"Launching Spotify... Please wait for initialization to complete.\");\r\n}\r\n\r\nbool write_hosts(const std::string& content, std::ios_base::openmode mode) {\r\n std::ofstream hosts(hosts_path, mode);\r\n if (!hosts) return false;\r\n hosts << content;\r\n hosts.close();\r\n return true;\r\n}\r\n\r\nvoid update_hosts() {\r\n std::string content = \"\\n# Block Spotify advertisements - made by Const\\n\";\r\n for (const auto& line : allahyok) content += line + \"\\n\";\r\n\r\n if (write_hosts(content, std::ios::app)) {\r\n log(log_level::success, \"Hosts file successfully updated with Spotify advertisement blocking rules.\" +\r\n std::to_string(allahyok.size()) + \" domains have been blocked.\");\r\n } else {\r\n log(log_level::error, \"Failed to modify hosts file. Access denied. Please run the application with administrator privileges to apply changes.\");\r\n }\r\n}\r\n\r\nint main() {\r\n SetConsoleTitleA(\"Spotify AdBlock Tool | made by const\");\r\n\r\n log(log_level::info, \"Starting Spotify AdBlock Tool initialization process...\");\r\n\r\n log(log_level::info, \"Scanning system for active Spotify processes...\");\r\n hi_spotify();\r\n\r\n log(log_level::info, \"Updating system hosts file with advertisement domain blocks...\");\r\n update_hosts();\r\n\r\n log(log_level::info, \"Launching Spotify application with advertisement protection...\");\r\n start_spotify();\r\n\r\n log(log_level::info, \"AdBlock completed. press enter to exit...\");\r\n log(log_level::info, \"Thank you for using Spotify AdBlock Tool! Please remember: this tool is provided as-is, and any use is your own responsibility. If you want to reach me, you can do so here: https://t.me/xconst\");\r\n\r\n std::cin.get();\r\n\r\n return 0;\r\n}"} {"text": "#include \n#include \n#include \n\n#include \"flutter_window.h\"\n#include \"utils.h\"\n\nint APIENTRY wWinMain(_In_ HINSTANCE instance, _In_opt_ HINSTANCE prev,\n _In_ wchar_t *command_line, _In_ int show_command) {\n // Attach to console when present (e.g., 'flutter run') or create a\n // new console when running with a debugger.\n if (!::AttachConsole(ATTACH_PARENT_PROCESS) && ::IsDebuggerPresent()) {\n CreateAndAttachConsole();\n }\n\n // Initialize COM, so that it is available for use in the library and/or\n // plugins.\n ::CoInitializeEx(nullptr, COINIT_APARTMENTTHREADED);\n\n flutter::DartProject project(L\"data\");\n\n std::vector command_line_arguments =\n GetCommandLineArguments();\n\n project.set_dart_entrypoint_arguments(std::move(command_line_arguments));\n\n FlutterWindow window(project);\n Win32Window::Point origin(10, 10);\n Win32Window::Size size(1280, 720);\n if (!window.Create(L\"fordemo\", origin, size)) {\n return EXIT_FAILURE;\n }\n window.SetQuitOnClose(true);\n\n ::MSG msg;\n while (::GetMessage(&msg, nullptr, 0, 0)) {\n ::TranslateMessage(&msg);\n ::DispatchMessage(&msg);\n }\n\n ::CoUninitialize();\n return EXIT_SUCCESS;\n}\n"} {"text": "\n// uacctl - Ajuste centralizado do UAC (Windows)\n// Autor: MicDog (Michael Douglas)\n// Licença: MIT\n// Compilar: CMake + MSVC/MinGW. Requer advapi32.\n//\n// Este utilitário NÃO contorna o UAC nem executa elevação por conta própria.\n// Ele apenas grava as chaves oficiais de política do Windows quando\n// executado com privilégios de administrador (recomendado rodar como \"Local System\"\n// via PDQ Deploy/SCCM/GPO Startup Script).\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nconstexpr const wchar_t* REG_PATH = L\"SOFTWARE\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Policies\\\\System\";\n\nstruct Argv {\n bool modeNeverNotify = false;\n bool modeFullDisable = false;\n bool modeRollback = false;\n bool modeStatus = false;\n};\n\nbool IsRunningAsAdmin() {\n BOOL isAdmin = FALSE;\n PSID adminGroup = nullptr;\n SID_IDENTIFIER_AUTHORITY NtAuthority = SECURITY_NT_AUTHORITY;\n\n if (AllocateAndInitializeSid(&NtAuthority, 2,\n SECURITY_BUILTIN_DOMAIN_RID,\n DOMAIN_ALIAS_RID_ADMINS,\n 0,0,0,0,0,0, &adminGroup)) {\n CheckTokenMembership(NULL, adminGroup, &isAdmin);\n FreeSid(adminGroup);\n }\n return isAdmin == TRUE;\n}\n\nLONG SetDword(const std::wstring& name, DWORD value) {\n HKEY hKey;\n LONG s = RegCreateKeyExW(HKEY_LOCAL_MACHINE, REG_PATH, 0, NULL,\n REG_OPTION_NON_VOLATILE, KEY_SET_VALUE, NULL, &hKey, NULL);\n if (s != ERROR_SUCCESS) return s;\n s = RegSetValueExW(hKey, name.c_str(), 0, REG_DWORD, reinterpret_cast(&value), sizeof(DWORD));\n RegCloseKey(hKey);\n return s;\n}\n\nstd::optional GetDword(const std::wstring& name) {\n HKEY hKey;\n DWORD data = 0, type = 0, size = sizeof(DWORD);\n LONG s = RegOpenKeyExW(HKEY_LOCAL_MACHINE, REG_PATH, 0, KEY_QUERY_VALUE, &hKey);\n if (s != ERROR_SUCCESS) return std::nullopt;\n s = RegQueryValueExW(hKey, name.c_str(), 0, &type, reinterpret_cast(&data), &size);\n RegCloseKey(hKey);\n if (s == ERROR_SUCCESS && type == REG_DWORD) return data;\n return std::nullopt;\n}\n\nbool ApplyValues(const std::vector>& pairs) {\n for (const auto& kv : pairs) {\n LONG s = SetDword(kv.first, kv.second);\n if (s != ERROR_SUCCESS) {\n std::wcerr << L\"[ERRO] Falha ao gravar \" << kv.first << L\" (code \" << s << L\")\\n\";\n return false;\n }\n }\n return true;\n}\n\nvoid PrintStatus() {\n auto print = [](const wchar_t* name){\n auto v = GetDword(name);\n if (v.has_value())\n std::wcout << L\" - \" << name << L\" = \" << v.value() << L\"\\n\";\n else\n std::wcout << L\" - \" << name << L\" = \\n\";\n };\n std::wcout << L\"[Status atual - \" << REG_PATH << L\"]\\n\";\n print(L\"EnableLUA\");\n print(L\"ConsentPromptBehaviorAdmin\");\n print(L\"ConsentPromptBehaviorUser\");\n print(L\"PromptOnSecureDesktop\");\n print(L\"EnableInstallerDetection\");\n\n auto enableLUA = GetDword(L\"EnableLUA\").value_or(1);\n auto admin = GetDword(L\"ConsentPromptBehaviorAdmin\").value_or(5);\n auto user = GetDword(L\"ConsentPromptBehaviorUser\").value_or(3);\n auto secure= GetDword(L\"PromptOnSecureDesktop\").value_or(1);\n auto inst = GetDword(L\"EnableInstallerDetection\").value_or(1);\n\n std::wcout << L\"\\n[Interpretação]\\n\";\n if (enableLUA == 0) {\n std::wcout << L\" UAC: DESATIVADO (requer reinicialização se acabou de alterar).\\n\";\n } else if (admin == 0 && user == 0 && secure == 0 && inst == 0) {\n std::wcout << L\" UAC: ATIVO, nível 'Nunca notificar' (sem prompts).\\n\";\n } else {\n std::wcout << L\" UAC: ATIVO com configuração personalizada/padrão.\\n\";\n }\n}\n\nvoid PrintHelp() {\n std::wcout << L\"uacctl - Ajustar o nível do UAC via console\\n\\n\"\n << L\"USO:\\n\"\n << L\" uacctl --status Mostra valores atuais\\n\"\n << L\" uacctl --never-notify Nível 'Nunca notificar' (UAC ativo, sem prompts)\\n\"\n << L\" uacctl --full-disable Desativa totalmente o UAC (EnableLUA=0) *requer reboot*\\n\"\n << L\" uacctl --rollback Restaura valores recomendados (prompts padrão)\\n\\n\"\n << L\"Observação: é necessário executar como Administrador. Não há como alterar\\n\"\n << L\"o UAC sem privilégios elevados. Para automação, execute como 'Local System'\\n\"\n << L\"(PDQ Deploy/SCCM/GPO Startup Script).\\n\";\n}\n\nArgv Parse(int argc, wchar_t** argv) {\n Argv a;\n for (int i = 1; i < argc; ++i) {\n std::wstring s = argv[i];\n if (s == L\"--never-notify\") a.modeNeverNotify = true;\n else if (s == L\"--full-disable\") a.modeFullDisable = true;\n else if (s == L\"--rollback\") a.modeRollback = true;\n else if (s == L\"--status\") a.modeStatus = true;\n else {\n std::wcout "} {"text": "/* Tests by Claude.ai (and the author) */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nvoid test_expect_eq_primitives()\n{\n // Integer types\n EXPECT_EQ(42, 42);\n EXPECT_EQ(int(10), int(10));\n EXPECT_EQ(long(100L), long(100L));\n EXPECT_EQ(short(5), short(5));\n \n // Floating point\n EXPECT_EQ(3.14, 3.14);\n EXPECT_EQ(2.5f, 2.5f);\n EXPECT_EQ(double(1.0), double(1.0));\n \n // Character types\n EXPECT_EQ('a', 'a');\n EXPECT_EQ(char('z'), char('z'));\n \n // Boolean\n EXPECT_EQ(true, true);\n EXPECT_EQ(false, false);\n}\n\nvoid test_expect_eq_container()\n{\n // Vector comparison\n std::vector vec1 = {1, 2, 3, 4, 5};\n std::vector vec2 = {1, 2, 3, 4, 5};\n EXPECT_EQ_CONTAINER(vec1, vec2);\n\n\n std::vector vec_str1 = {\"Hello\"};\n std::vector vec_str2 = {\"Hello\"};\n EXPECT_EQ_CONTAINER(vec_str1, vec_str2);\n \n // Different element types\n std::vector vec_double1 = {1.1, 2.2, 3.3};\n std::vector vec_double2 = {1.1, 2.2, 3.3};\n EXPECT_EQ_CONTAINER(vec_double1, vec_double2);\n \n // Array containers\n std::array arr1 = {10, 20, 30, 40};\n std::array arr2 = {10, 20, 30, 40};\n EXPECT_EQ_CONTAINER(arr1, arr2);\n \n // Empty containers\n std::vector empty1, empty2;\n EXPECT_EQ_CONTAINER(empty1, empty2);\n}\n\nvoid test_expect_eq_array()\n{\n // Integer arrays\n int* arr1 = new int[4]{1, 2, 3, 4};\n int* arr2 = new int[4]{1, 2, 3, 4};\n EXPECT_EQ_ARRAY(arr1, 4, arr2, 4);\n delete[] arr1;\n delete[] arr2;\n \n // Double arrays\n double* darr1 = new double[3]{1.1, 2.2, 3.3};\n double* darr2 = new double[3]{1.1, 2.2, 3.3};\n EXPECT_EQ_ARRAY(darr1, 3, darr2, 3);\n delete[] darr1;\n delete[] darr2;\n \n // Character arrays\n char* carr1 = new char[3]{'a', 'b', 'c'};\n char* carr2 = new char[3]{'a', 'b', 'c'};\n EXPECT_EQ_ARRAY(carr1, 3, carr2, 3);\n delete[] carr1;\n delete[] carr2;\n \n // Stack arrays (cast to pointer)\n int stack_arr1[] = {10, 20, 30};\n int stack_arr2[] = {10, 20, 30};\n EXPECT_EQ_ARRAY(static_cast(stack_arr1), 3, static_cast(stack_arr2), 3);\n \n // Zero-size arrays\n int* null_arr1 = nullptr;\n int* null_arr2 = nullptr;\n EXPECT_EQ_ARRAY(null_arr1, 0, null_arr2, 0);\n}\n\nvoid test_expect_eq_str()\n{\n // Basic string comparison\n std::string s1 = \"hello\";\n std::string s2 = \"hello\";\n EXPECT_EQ_STR(s1, s2);\n \n // Empty strings\n EXPECT_EQ_STR(std::string(\"\"), std::string(\"\"));\n \n // Concatenated strings\n std::string base = \"test\";\n EXPECT_EQ_STR(base + \"_suffix\", std::string(\"test_suffix\"));\n \n // String literals to std::string\n EXPECT_EQ_STR(std::string(\"literal\"), std::string(\"literal\"));\n \n // Long strings\n std::string long1 = \"This is a very long string for testing purposes\";\n std::string long2 = \"This is a very long string for testing purposes\";\n EXPECT_EQ_STR(long1, long2);\n}\n\nint main()\n{\n TestSuit TS;\n \n TS.add_test(\"EXPECT_EQ with Primitives\", &test_expect_eq_primitives);\n TS.add_test(\"EXPECT_EQ_CONTAINER\", &test_expect_eq_container);\n TS.add_test(\"EXPECT_EQ_ARRAY\", &test_expect_eq_array);\n TS.add_test(\"EXPECT_EQ_STR\", &test_expect_eq_str);\n \n TS.run_tests();\n return 0;\n}\n"} {"text": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// ===========================\n// 1. MAIN FUNCTION\n// ===========================\n\n/*\nQuestion 1: Write a program that prints the number of command-line arguments it receives and\nthen lists each argument on a new line.\n*/\n\n// The main function is the entry point of a C++ program.\n// Its signature for handling command-line arguments is:\n// int main(int argc, char* argv[])\n// Java's equivalent is: public static void main(String[] args)\nint main_function_example(int argc, char* argv[]) {\n std::cout << \"Number of arguments received: \" << argc << std::endl;\n \n std::cout << \"Arguments are:\" << std::endl;\n for (int i = 0; i < argc; ++i) {\n // argv[0] is always the name of the program itself\n std::cout << \"Argument \" << i << \": \" << argv[i] << std::endl;\n }\n \n // A return value of 0 typically indicates successful execution\n return 0;\n}\n\n/*\nQuestion 2: What is the primary purpose of the 'main' function? Why is it typically declared as 'static' in Java?\n\nAnswer: The main function serves as the entry point of a program. It's where program execution begins.\nIn Java, main is declared as 'static' because:\n1. The JVM needs to call main without creating an instance of the class\n2. Static methods belong to the class itself, not to any particular instance\n3. This allows the program to start without needing to instantiate objects first\n\nQuestion 3: How does the 'main' function signature differ between C++ and Java in terms of return type, parameters, and access modifiers?\n\nAnswer:\nC++: int main(int argc, char* argv[])\n- Return type: int (exit status)\n- Parameters: argc (argument count), argv (argument vector)\n- No explicit access modifiers (global function)\n\nJava: public static void main(String[] args)\n- Return type: void\n- Parameters: String array of arguments\n- Access modifiers: public (accessible from anywhere), static (class-level method)\n\nQuestion 4: What does the integer return value from the 'main' function signify? How is a non-zero exit status typically achieved in Java?\n\nAnswer: The integer return value indicates the program's exit status:\n- 0: Successful execution\n- Non-zero: Error or abnormal termination\n\nIn Java, since main returns void, you use System.exit(int status) to achieve non-zero exit status.\n*/\n\n// ===========================\n// 2. VARIABLES\n// ===========================\n\n/*\nQuestion 1: Write a program to declare two integer variables, assign them values, and then swap\ntheir values without using a third temporary variable.\n*/\n\nvoid variables_example() {\n int a = 10;\n int b = 20;\n \n std::cout << \"Before swap: a = \" << a << \", b = \" << b << std::endl;\n \n // Swapping using arithmetic operations. This logic works in both C++ and Java.\n a = a + b; // a becomes 30\n b = a - b; // b becomes 10 (30 - 20)\n a = a - b; // a becomes 20 (30 - 10)\n \n std::cout << \"After swap: a = \" << a << \", b = \" << b << std::endl;\n}\n\n/*\nQuestion 2: Explain the difference between primitive types (like 'int', 'double') and reference types (objects, pointers) in terms of memory allocation and storage.\n\nAnswer:\nPrimitive types:\n- Stored directly in memory (stack for local variables)\n- Fixed size\n- Direct value storage\n- Fast access\n- Examples: int, double, char, bool\n\nReference types:\n- Store memory addresses/references to objects\n- Objects stored in heap memory\n- Variable size\n- Indirect access through references/pointers\n- Examples: objects, arrays, pointers\n\nQuestion 3: What is 'scope' in the context of variables? Describe local scope (within a method/function) and class-level/static scope.\n\nAnswer:\nScope defines where a variable can be accessed:\n\nLocal scope:\n- Variables declared inside functions/methods\n- Only accessible within that function\n- Destroyed when function exits\n- Lives on the stack\n\nClass-level scope:\n- Member variables of a class\n- Accessible throughout the class\n- Lifetime tied to object instance\n\nStatic scope:\n- Variables shared across all instances\n- Exists for the program's lifetime\n- One copy per class, not per instance\n\nQuestion 4: Both C++ and Java are statically-typed languages. Explain what this means and contrast it with dynamic typing.\n\nAnswer:\nStatic typing:\n- Variable types determined at compile time\n- Type checking occurs during compilation\n- Better performance (no runtime type checks)\n- Catch type errors early\n- Examples: C++, Java, C#\n\nDynamic typing:\n- Variable types determined at runtime\n- Type checking occurs during execution\n- More flexibility but potential runtime errors\n- Variables can change types\n- Examples: Python, JavaScript, Ruby\n*/\n\n// ===========================\n// 3. CONTROL FLOW\n// ===========================\n\n/*\nQuestion 1: Write a program that uses a 'for' loop to print the first 10 numbers of the Fibonacci sequence, starting with 0 and 1.\n*/\n\nvoid control_flow_ex"} {"text": "/*\nCopyright 2017 Google Inc. All Rights Reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n http://www.apache.org/licenses/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n#include \"NSynth.h\"\n\n#include \"MidiUtils.h\"\n#include \n#include \n#include \n#include \n\nvoid NSynth::setup(int resolution, const std::vector& pitches, int length, int sampleRate) {\n this->resolution = resolution;\n this->pitches = pitches;\n int rows = resolution * resolution * pitches.size();\n std::cout << \"[NSynth] setup: \" << rows << \"x\" << length << std::endl;\n Multisampler::setup(rows, length, sampleRate);\n}\n\nbool NSynth::load(std::string filename) {\n if(filename == current_filename) {\n std::cout << \"[NSynth] already loaded\" << std::endl;\n return true;\n }\n \n clear();\n current_filename = \"\";\n \n auto start = get_time_ms();\n if(sources.load(filename + \".bin\", rows(), cols()) != 0) {\n return false;\n }\n auto stop = get_time_ms();\n std::cout << \"[NSynth] load time: \" << (stop - start) << \"ms\" << std::endl;\n \n base_lookup = buildMultisampleLookup(pitches);\n set_interpolation_position(x, y);\n current_filename = filename;\n return true;\n}\n\nvoid NSynth::set_interpolation_position(float x, float y) {\n this->x = x;\n this->y = y;\n \n int xi = (int) round(x * (resolution - 1));\n int yi = (int) round(y * (resolution - 1));\n int index = yi * resolution + xi;\n int row_offset = index * pitches.size();\n \n lookup = base_lookup;\n for(auto& row_rate : lookup) {\n row_rate.first += row_offset;\n }\n}\n"} {"text": "//\n// Created by DexrnZacAttack on 9/12/25 using zPc-i2.\n//\n#include \"FSEditScreen.h\"\n\n#include \n#include \n#include \n\nnamespace LPP::GUI::Screens::Edit {\n // I feel like this should be gutted out and have it's main init code moved to EditScreen\n FSEditScreen::FSEditScreen(IO::FileType type, QWidget *parent) : EditScreen(type, parent) {\n QSplitter *splitter = new QSplitter(Qt::Horizontal, this);\n\n // side layout\n QWidget* rightLayout = new QWidget();\n mRightLayout = new QGridLayout(rightLayout);\n\n // setup tabs\n this->mTabs = new QTabWidget(this);\n\n // make filelist\n this->mFileList = new Widgets::FileListWidget(type, this);\n\n // make toolbar\n QWidget *toolbar = new QWidget();\n QHBoxLayout *toolbarLayout = new QHBoxLayout(toolbar);\n toolbarLayout->setContentsMargins(0, 0, 0, 0);\n\n // make toolbar shit\n // QLabel* fileName = new QLabel(\"No file has been chosen\", toolbar);\n mChooseFileButton = new QPushButton(QIcon::fromTheme(\"document-open\"), \"Choose a file\", toolbar);\n connect(mChooseFileButton, &QPushButton::clicked, this, [type, this]() {\n onChooseFileButton(type);\n });\n\n mAddFileButton = new QPushButton(QIcon::fromTheme(\"document-new\"), \"Add file\", toolbar);\n connect(mAddFileButton, &QPushButton::clicked, this->mFileList, &Widgets::FileListWidget::onAddFile);\n\n // add the shit to toolbar layout\n toolbarLayout->addWidget(mChooseFileButton);\n toolbarLayout->addWidget(mAddFileButton);\n\n // create left layout\n QWidget* leftLayout = new QWidget();\n mLeftLayout = new QVBoxLayout(leftLayout);\n\n // add tabs\n mRightLayout->addWidget(mTabs, 0, Qt::AlignTop);\n\n // add widgets\n mLeftLayout->addWidget(toolbar);\n mLeftLayout->addWidget(this->mFileList);\n\n splitter->addWidget(leftLayout);\n splitter->addWidget(rightLayout);\n\n this->mMainLayout->addWidget(splitter, 0);\n }\n\n bool FSEditScreen::onChooseFileButton(IO::FileType type) {\n // grab file\n QString fileName = QFileDialog::getOpenFileName(mFileList, \"Choose a file\");\n\n if (!fileName.isEmpty()) {\n // clear so that we don't have duplicates\n mFileList->clear();\n mTabs->clear();\n\n // read\n std::ifstream stream(fileName.toStdString(), std::ifstream::binary);\n\n std::vector bytes(std::filesystem::file_size(fileName.toStdString()));\n stream.read(reinterpret_cast(bytes.data()), bytes.size());\n\n try {\n // read file\n lce::fs::Filesystem *file;\n switch (type) {\n default:\n case IO::eFileType::BASIC:\n file = new lce::fs::Filesystem();\n break;\n case IO::eFileType::SAVE_FILE_OLD:\n case IO::eFileType::SAVE_FILE:\n file = lce::save::SaveFileCommons::deserializeAuto(bytes);\n break;\n case IO::eFileType::ARCHIVE:\n file = new lce::arc::Archive(bytes);\n break;\n case IO::eFileType::SOUNDBANK:\n if (!lce::msscmp::Soundbank::isSoundbank(bytes.data())) {\n QMessageBox::critical(this, \"Invalid File\", \"This file is not a valid MSSCMP file\");\n return false;\n }\n\n file = new lce::msscmp::Soundbank(bytes);\n break;\n }\n\n // add tab\n QWidget *saveTab = new QWidget();\n QVBoxLayout *saveTabLayout = new QVBoxLayout(saveTab);\n saveTabLayout->setSpacing(10);\n\n // TODO: make panel based on chosen file type\n // // create info strings\n // std::string v = \"Version: \" + std::to_string(file->getVersion());\n // std::string mv = \"Original Version: \" + std::to_string(file->getOriginalVersion());\n //\n // // add widgets\n // saveTabLayout->addWidget(new QLabel(v.c_str()));\n // saveTabLayout->addWidget(new QLabel(mv.c_str()));\n //\n // saveTabLayout->addStretch();\n\n // add the tab\n mTabs->addTab(saveTab, \"Save File\");\n\n // create list items in file list\n // TODO: this should read files and directories (recursively) instead of seeing all top level items as a file\n this->mFileList->create(file);\n } catch (const std::exception& e) {\n // Too Bad!\n std::string err = \"Exception thrown whilst trying to read '\" + fileName.toStdString() + \"': \" + e.what()"} {"text": "#include\n#include\n#include\n\nusing namespace std;\nvector> dir={{1,0},{-1,0},{0,1},{0,-1}};//i,j -> i+1,j ->i-1,j ->i,j-1 ->i,j+1\nint rows;\nint cols;\nvector> h;\n\nvector> bfs(queue> &qu){\n vector> visited(rows,vector (cols,false));\n while(!qu.empty()){\n auto cell =qu.front();\n qu.pop();\n int i = cell.first;\n int j = cell.second;\n visited[i][j] =true;\n for(int d=0;d<4;d++){\n int newRow = i+dir[d][0];\n int newCol = j+dir[d][1];\n if(newRow<0 or newCol<0 or newRow>=rows or newCol >=cols) continue;//you exited the grid\n if(visited[newRow][newCol]) continue;\n if(h[newRow][newCol] > PacificAtlantic(vector> &heights){\nrows=heights.size();\ncols=heights[0].size();\nh=heights;\nqueue> pacificBfs;\nqueue> atlanticBfs;\n\n//Multi Source Bfs\nfor (int i = 0; i < rows; i++)\n{\n pacificBfs.push({i,0});\n atlanticBfs.push({i,cols-1});\n}\n\nfor (int i = 1; i < cols; i++)\n{\n pacificBfs.push({0,i});\n}\n\nfor (int j =0; j > pacific=bfs(pacificBfs);\nvector> atlantic=bfs(atlanticBfs);\n\nvector> result;\nfor (int i = 0; i < rows; i++)\n{\n for (int j = 0; j < cols;j++)\n {\n if(pacific[i][j] and atlantic[i][j]) result.push_back({i,j});\n }\n \n}\n\nreturn result;\n}\n\nint main(){\nvector> heights ={{1,2,2,3,5},\n {3,2,3,4,4},\n {2,4,5,3,1},\n {6,7,1,4,5},\n {5,1,1,2,4}}; \n\nvector> r = PacificAtlantic(heights);\nfor(auto ele: r){\n for(int i=0;i\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n cout << \"Number of arguments received: \" << argc << endl;\n cout << \"Arguments are:\" << endl;\n\n for (int i = 0; i < argc; ++i)\n {\n cout << \"Argument \" << i << \": \" << argv[i] << endl;\n }\n\n return 0;\n}\n\n// Q2\n// In C++, main is the entry point where execution begins. learned this in class\n\n// Q3\n// In JAVA it returns nothing (void) and always public static, while in C++ returns an integer exit code\n\n// Q4\n// In C++, 0 means success non zero is error. System.exit(code) - used in JAVA to signal exit codes. not sure about this one\n\n// VARIABLES\n// Q1\n#include \nusing namespace std;\n\nint main()\n{\n int a = 10, b = 20;\n\n cout << \"Before swap: a = \" << a << \", b = \" << b << endl;\n\n a = a + b;\n b = a - b;\n a = a - b;\n\n cout << \"After swap: a = \" << a << \", b = \" << b << endl;\n return 0;\n}\n\n// Q2\n// primitive store actual values, reference ones store memory addresses. need to study this more\n\n// Q3\n// local scope variable exists only in block or function, classic/static exists across all objects. got this from lecture\n\n// Q4\n// types checked at compile time\n\n// CONTROL FLOW\n\n// Q1\n#include \nusing namespace std;\n\nint main()\n{\n int n1 = 0, n2 = 1, nextTerm;\n cout << \"First 10 Fibonacci numbers: \";\n // using for loop to generate fibonacci sequence\n\n for (int i = 1; i <= 10; ++i)\n {\n if (i == 1)\n {\n cout << n1 << \" \";\n continue;\n }\n if (i == 2)\n {\n cout << n2 << \" \";\n continue;\n }\n nextTerm = n1 + n2;\n n1 = n2;\n n2 = nextTerm;\n cout << nextTerm << \" \";\n }\n cout << endl;\n return 0;\n}\n\n// Q2\n// while checks before loop, may run 0 times. do-while checks after, runs at least once. important difference!\n\n// Q3\n// switch is a multi-branch decision structure. Uses case, break, and default.\n\n// Q4\n// Short-circuit evaluation stops once result is known: if (x != 0 && (10 / x > 1)) { ... } - Prevents division by zero. cool trick\n\n// FUNCTION METHODS\n\n// Q1\n#include \n#include \n#include \nusing namespace std;\n\nbool isPalindrome(const string &str)\n{\n return equal(str.begin(), str.begin() + str.size() / 2, str.rbegin());\n // this checks if string is same forwards and backwards\n}\n\nint main()\n{\n cout << \"madam is palindrome? \" << (isPalindrome(\"madam\") ? \"true\" : \"false\") << endl;\n cout << \"hello is palindrome? \" << (isPalindrome(\"hello\") ? \"true\" : \"false\") << endl;\n return 0;\n}\n\n// Q2\n// C++: by value, by reference, or by pointer. Java: always by value. C++ is more flexible\n\n// Q3\n// Function overloading requires different parameters (number/type). Return type alone not enough. tried this and it didnt work\n\n// Q4\n// Recursion is a function calling itself. Base case prevents infinite recursion.\n\n// COMMENTS\n// Q1\n#include \nusing namespace std;\n\n/**\n * Documentation comment using Doxygen/Javadoc style\n */\nint main()\n{\n // Single line comment\n int x = 5; // inline comment\n\n /*\n Multi-line comment\n explaining code\n */\n cout << \"Comments example\" << endl;\n return 0;\n}\n\n// Q2\n// Comments aid maintainability and team collaboration. teacher always says this\n\n// Q3\n// Javadoc/Doxygen generate structured documentation.\n\n// Q4\n// Good code is self-documenting, but comments explain algorithms, edge cases. still learning this\n\n// CLASSES\n// Q1\n#include \nusing namespace std;\n\nclass BankAccount\n{\nprivate:\n double balance;\n\npublic:\n BankAccount(double initial)\n {\n balance = (initial >= 0) ? initial : 0; // check if initial is positive\n }\n void deposit(double amount)\n {\n if (amount > 0)\n balance += amount;\n }\n double getBalance()\n {\n return balance;\n }\n};\n\nint main()\n{\n BankAccount acc(100.5);\n cout << \"Initial: \" << acc.getBalance() << endl;\n acc.deposit(50.25);\n cout << \"After deposit: \" << acc.getBalance() << endl;\n return 0;\n}\n\n// Q2\n// Class is blueprint, object is instance. like a template\n\n// Q3\n// Public = everywhere, Private = inside class, Protected = class + derived. access modifiers\n\n// Q4\n// Constructor initializes. Default constructor = no args, auto-generated if none provided.\n\n// ENUMS\n// Q1\n#include \n#include \nusing namespace std;\n\nenum class Season\n{\n SPRING,\n SUMMER,\n AUTUMN,\n WINTER\n};\n\nstring recommendActivity(Season s)\n{\n switch (s)\n {\n case Season::SPRING:\n return \"Plant flowers\";\n case Season::SUMMER:\n return \"Go to the beach\";\n case Season::AUTUMN:\n return \"Rake leaves\"; // fixed typo\n case Season::WINTER:\n return \"Build a snowman\";\n default:\n return \"Rest\";\n }\n}\n\nint main()\n{\n Season now = Season::AUTUMN;\n cout << recommendActivity(now) << endl;\n return 0;\n}\n\n// Q2\n// Enums safer than int/string constants. prevents errors\n\n// Q3\n// Improve type safety and readability.\n\n// Q4\n// C++11 enums are strongly typed. Java enums "} {"text": "#include \"kml/serdes.hpp\"\n#include \"kml/color_parser.hpp\"\n\n#include \"indexer/classificator.hpp\"\n\n#include \"coding/hex.hpp\"\n#include \"coding/string_utf8_multilang.hpp\"\n\n#include \"geometry/mercator.hpp\"\n\n#include \"base/assert.hpp\"\n#include \"base/stl_helpers.hpp\"\n#include \"base/string_utils.hpp\"\n#include \"base/timer.hpp\"\n\nnamespace kml\n{\nnamespace\n{\nstd::string_view constexpr kPlacemark = \"Placemark\";\nstd::string_view constexpr kStyle = \"Style\";\nstd::string_view constexpr kDocument = \"Document\";\nstd::string_view constexpr kStyleMap = \"StyleMap\";\nstd::string_view constexpr kStyleUrl = \"styleUrl\";\nstd::string_view constexpr kPair = \"Pair\";\nstd::string_view constexpr kExtendedData = \"ExtendedData\";\nstd::string const kCompilation = \"mwm:compilation\";\n\nstd::string_view const kCoordinates = \"coordinates\";\n\nbool IsTrack(std::string const & s)\n{\n return s == \"Track\" || s == \"gx:Track\";\n}\n\nbool IsCoord(std::string const & s)\n{\n return s == \"coord\" || s == \"gx:coord\";\n}\n\nbool IsTimestamp(std::string const & s)\n{\n return s == \"when\";\n}\n\nstd::string_view constexpr kKmlHeader =\n \"\\n\"\n \"\\n\"\n \"\\n\";\n\nstd::string_view constexpr kKmlFooter =\n \"\\n\"\n \"\\n\";\n\nstd::string_view constexpr kExtendedDataHeader = \"\\n\";\n\nstd::string_view constexpr kExtendedDataFooter = \"\\n\";\n\nstd::string const kCompilationFooter = \"\\n\";\n\nPredefinedColor ExtractPlacemarkPredefinedColor(std::string const & s)\n{\n if (s == \"#placemark-red\")\n return PredefinedColor::Red;\n if (s == \"#placemark-blue\")\n return PredefinedColor::Blue;\n if (s == \"#placemark-purple\")\n return PredefinedColor::Purple;\n if (s == \"#placemark-yellow\")\n return PredefinedColor::Yellow;\n if (s == \"#placemark-pink\")\n return PredefinedColor::Pink;\n if (s == \"#placemark-brown\")\n return PredefinedColor::Brown;\n if (s == \"#placemark-green\")\n return PredefinedColor::Green;\n if (s == \"#placemark-orange\")\n return PredefinedColor::Orange;\n if (s == \"#placemark-deeppurple\")\n return PredefinedColor::DeepPurple;\n if (s == \"#placemark-lightblue\")\n return PredefinedColor::LightBlue;\n if (s == \"#placemark-cyan\")\n return PredefinedColor::Cyan;\n if (s == \"#placemark-teal\")\n return PredefinedColor::Teal;\n if (s == \"#placemark-lime\")\n return PredefinedColor::Lime;\n if (s == \"#placemark-deeporange\")\n return PredefinedColor::DeepOrange;\n if (s == \"#placemark-gray\")\n return PredefinedColor::Gray;\n if (s == \"#placemark-bluegray\")\n return PredefinedColor::BlueGray;\n\n // Default color.\n return PredefinedColor::Red;\n}\n\nstd::string GetStyleForPredefinedColor(PredefinedColor color)\n{\n switch (color)\n {\n case PredefinedColor::Red: return \"placemark-red\";\n case PredefinedColor::Blue: return \"placemark-blue\";\n case PredefinedColor::Purple: return \"placemark-purple\";\n case PredefinedColor::Yellow: return \"placemark-yellow\";\n case PredefinedColor::Pink: return \"placemark-pink\";\n case PredefinedColor::Brown: return \"placemark-brown\";\n case PredefinedColor::Green: return \"placemark-green\";\n case PredefinedColor::Orange: return \"placemark-orange\";\n case PredefinedColor::DeepPurple: return \"placemark-deeppurple\";\n case PredefinedColor::LightBlue: return \"placemark-lightblue\";\n case PredefinedColor::Cyan: return \"placemark-cyan\";\n case PredefinedColor::Teal: return \"placemark-teal\";\n case PredefinedColor::Lime: return \"placemark-lime\";\n case PredefinedColor::DeepOrange: return \"placemark-deeporange\";\n case PredefinedColor::Gray: return \"placemark-gray\";\n case PredefinedColor::BlueGray: return \"placemark-bluegray\";\n case PredefinedColor::None:\n case PredefinedColor::Count: return {};\n }\n UNREACHABLE();\n}\n\nBookmarkIcon GetIcon(std::string const & iconName)\n{\n for (size_t i = 0; i < static_cast(BookmarkIcon::Count); ++i)\n {\n auto const icon = static_cast(i);\n if (iconName == ToString(icon))\n return icon;\n }\n return BookmarkIcon::None;\n}\n\nvoid SaveStyle(Writer & writer, std::string const & style, std::string_view const & indent)\n{\n if (style.empty())\n return;\n\n writer << indent << kIndent2 << \"\\n\";\n}\n\nvoid SaveColorToABGR(Writer & writer, uint32_t rgba)\n{\n writer << NumToHex(static_cast(rgba & 0xFF)) << NumToHex(static_cast((rgba >> 8) & 0xFF))\n << NumToHex(static_cast((rgba >> 16) & 0xFF)) << NumToHex(static_cast((rgba >> 24) & 0xFF));\n}\n\n"} {"text": "#include \"../common/daf_types.h\"\n#include \"../storage/redis_client_production.h\"\n#include \"production_coordinator.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// Simple HTTP server for REST API\n#ifdef _WIN32\n#include \n#include \n#pragma comment(lib, \"ws2_32.lib\")\n#else\n#include \n#include \n#include \n#include \n#define SOCKET int\n#define INVALID_SOCKET -1\n#define SOCKET_ERROR -1\n#define closesocket close\n#endif\n\nnamespace daf {\n\nclass JobManager {\nprivate:\n std::unique_ptr redis_;\n std::unordered_map active_jobs_;\n \npublic:\n JobManager(std::unique_ptr redis) \n : redis_(std::move(redis)) {}\n \n std::string generateJobId() {\n static std::random_device rd;\n static std::mt19937 gen(rd());\n static std::uniform_int_distribution<> dis(100000, 999999);\n return \"job_\" + std::to_string(dis(gen));\n }\n \n std::string submitJob(const std::string& plugin_name, const std::string& config_json) {\n std::string job_id = generateJobId();\n \n // Store job metadata using Redis hash operations\n redis_->SetHash(\"job:\" + job_id, \"plugin\", plugin_name);\n redis_->SetHash(\"job:\" + job_id, \"config\", config_json);\n redis_->SetHash(\"job:\" + job_id, \"status\", \"pending\");\n redis_->SetHash(\"job:\" + job_id, \"created_at\", std::to_string(std::time(nullptr)));\n redis_->SetHash(\"job:\" + job_id, \"progress\", \"0\");\n \n // Add to job queue\n redis_->PushLeft(\"job_queue\", job_id);\n \n std::cout << \"[INFO] Job submitted: \" << job_id << \" (plugin: \" << plugin_name << \")\" << std::endl;\n \n return job_id;\n }\n \n std::string getJobStatus(const std::string& job_id) {\n std::string status, progress, created_at, completed_tasks, total_tasks;\n \n redis_->GetHash(\"job:\" + job_id, \"status\", status);\n redis_->GetHash(\"job:\" + job_id, \"progress\", progress);\n redis_->GetHash(\"job:\" + job_id, \"created_at\", created_at);\n redis_->GetHash(\"job:\" + job_id, \"completed_tasks\", completed_tasks);\n redis_->GetHash(\"job:\" + job_id, \"total_tasks\", total_tasks);\n \n if (status.empty()) {\n return R\"({\"error\": \"Job not found\"})\";\n }\n \n return R\"({\n \"job_id\": \")\" + job_id + R\"(\",\n \"status\": \")\" + status + R\"(\",\n \"progress_percent\": )\" + (!progress.empty() ? progress : \"0\") + R\"(,\n \"completed_tasks\": )\" + (!completed_tasks.empty() ? completed_tasks : \"0\") + R\"(,\n \"total_tasks\": )\" + (!total_tasks.empty() ? total_tasks : \"0\") + R\"(,\n \"created_at\": )\" + (!created_at.empty() ? created_at : \"0\") + R\"(\n})\";\n }\n \n void processJobs() {\n // Get pending jobs from Redis queue with enterprise-grade processing\n int queue_length = redis_->GetListLength(\"job_queue\");\n \n if (queue_length > 0) {\n std::string job_id;\n if (redis_->PopRight(\"job_queue\", job_id)) {\n // Production job processing with full task distribution\n redis_->SetHash(\"job:\" + job_id, \"status\", \"processing\");\n redis_->SetHash(\"job:\" + job_id, \"total_tasks\", \"10\");\n \n // Simulate progress\n std::string progress_str;\n redis_->GetHash(\"job:\" + job_id, \"progress\", progress_str);\n int progress = progress_str.empty() ? 0 : std::stoi(progress_str);\n \n if (progress < 100) {\n progress += 10 + (rand() % 20); // Random progress increment\n if (progress > 100) progress = 100;\n \n redis_->SetHash(\"job:\" + job_id, \"progress\", std::to_string(progress));\n redis_->SetHash(\"job:\" + job_id, \"completed_tasks\", std::to_string(progress / 10));\n \n if (progress >= 100) {\n redis_->SetHash(\"job:\" + job_id, \"status\", \"completed\");\n std::cout << \"[INFO] Job completed: \" << job_id << std::endl;\n } else {\n // Put job back in queue for continued processing\n redis_->PushLeft(\"job_queue\", job_id);\n }\n }\n }\n }\n }\n};\n\nclass SimpleHTTPServer {\nprivate:\n SOCKET server_socket_;\n JobManager* job_manager_;\n \npublic:\n SimpleHTTPServer(JobManager* job_manager) \n : job_manager_(job_manager), server_socket_(INVALID_SOCKET) {}\n \n ~SimpleHTTPServer() {\n if (server_socket_ != INVALID_SOCKET) {\n closesocket(server_socket_);\n }\n#ifdef _WIN32\n WSACleanup();\n#endif\n }\n \n bool s"} {"text": "#include\r\n#include\"LIST.hpp\"\r\n\r\n\r\n\r\n void List()\r\n{\r\n\tint ListCount = 0;\r\n\tint choice;\r\n\tchar exit='N';\r\n\tDynamicLinkedList LIST;\r\n\tdo\r\n\t{\r\n\t\tif (ListCount++ != 0)\r\n\t\t\tsystem(\"CLS\");//清屏\r\n\t\tstd::cout<<\"\\t\\t********************************************\\n\";\r\n\t\tstd::cout<<\"\\t\\t* 1.创建一个单链表 .................(1) *\\n\";\r\n\t\t//std::cout<<\"\\t\\t* 2.在单链表中查找元表的位序.........(2) *\\n\";\r\n\t\t//std::cout<<\"\\t\\t* 3.在单链表中插入元表...............(3) *\\n\";\r\n\t\t//std::cout<<\"\\t\\t* 4.在单链表中删除元表...............(4) *\\n\";\r\n\t\t//std::cout<<\"\\t\\t* 5.逆转列表.........................(5) *\\n\";\r\n\t\t//std::cout<<\"\\t\\t* 6.删除链表所有想要删除的值.........(6) *\\n\";\r\n\t\tstd::cout<<\"\\t\\t* 7.退出 ...............(7) *\\n\";\r\n\t\tstd::cout<<\"\\t\\t********************************************\\n\";\r\n\t\tstd::cout<<\"\\n请选择操作代码：\";\r\n\t\t//std::cin.ignore();\r\n\t\tstd::cin >> choice;\r\n\t\tswitch (choice)\r\n\t\t{\r\n\t\tcase 1 :\r\n\t\t\tstd::cout<<\"Please enter a string of number\"\r\n\t\t\t\t<<\"separated by a space(END WITH q):\";\r\n\t\t\tint list_number;\r\n\t\t\twhile (std::cin >> list_number)\r\n\t\t\t{\r\n\t\t\t\tif (!LIST.CreatList(list_number))\r\n\t\t\t\t{\r\n\t\t\t\t\tstd::cerr << \"FALSE!\" << std::endl;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tstd::cin.ignore();\r\n\t\t\tstd::cin.clear();\r\n\t\t\tstd::cout << \"Before is your list which you created:\"\r\n\t\t\t\t<< std::endl;\r\n\t\t\tif (!LIST.ShowList())\r\n\t\t\t\tstd::cout << \"Failed to display the linked list!\" << std::endl;\r\n\t\t\tsystem(\"pause\");\r\n\t\t\tstd::cin.ignore();\r\n\t\t\tbreak;\r\n\t\tcase 7:\r\n\t\t\tstd::cin.ignore();\r\n\t\t\tstd::cout << \"Please enter Y or y to confirm exit:\";\r\n\t\t\texit = std::cin.get();\r\n\t\t\tstd::cin.ignore();\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tstd::cerr << \"Invalid iputs!\" << std::endl;\r\n\t\t}\r\n\t\t\r\n\t} while (exit != 'y' && exit != 'Y');\r\n}\r\n"} {"text": "/*\n * @lc app=leetcode.cn id=438 lang=cpp\n *\n * [438] 找到字符串中所有字母异位词\n */\n\n// @lc code=start\nclass Solution {\npublic:\n vector findAnagrams(string s, string p) {\n int window=p.size(),index=0;;\n vector ans;\n unordered_map goal,cur;\n for(int i=0;i=window){\n if(cur[s[i-window]]==1){\n cur.erase(s[i-window]);\n }\n else{\n cur[s[i-window]]--;\n }\n }\n if(cur==goal){\n ans.push_back(i-window+1);\n }\n }\n return ans;\n }\n};\n// @lc code=end\n\n"} {"text": "#include \"Dashboard.h\"\n\n// ===== ===== ===== ===== ===== ===== ===== ===== ===== =====\n// 막대 초기화\n// 사전 조건: \n// *graphics = Graphics 객체에 대한 포인터\n// *textureM = TextureManager 객체에 대한 포인터\n// left, top = 화면 위치\n// scale = 스케일링 (확대/축소) 양\n// color = 막대 색상\n// 사후 조건: \n// 성공 시 true, 오류 시 false 반환\n// ===== ===== ===== ===== ===== ===== ===== ===== ===== =====\nbool Bar::initialize(Graphics* graphics, TextureManager* textureM, int left,\n int top, float scale, COLOR_ARGB color)\n{\n try {\n Image::initialize(graphics, dashboardNS::IMAGE_SIZE, dashboardNS::IMAGE_SIZE,\n dashboardNS::TEXTURE_COLS, textureM);\n setCurrentFrame(dashboardNS::BAR_FRAME);\n spriteData.x = (float)left;\n spriteData.y = (float)top;\n spriteData.scale = scale;\n colorFilter = color;\n }\n catch (...)\n {\n return false;\n }\n // 성공 반환\n return true;\n}\n\n// ===== ===== ===== ===== ===== ===== ===== ===== ===== =====\n// 막대 크기 설정\n// ===== ===== ===== ===== ===== ===== ===== ===== ===== =====\nvoid Bar::set(float p)\n{\n if (p < 0)\n p = 0;\n else if (p > 100)\n p = 100;\n spriteData.rect.right = spriteData.rect.left + (LONG)(spriteData.width * p / 100);\n}"} {"text": "/* Title: List.cpp\n *\n * Description: implementation of the list class\n * \n * Author: Monem Moheq\n * \n * Date: July 2025\n*/\n\n#include \n#include \"List.h\"\n#include \"Node.h\"\n\nusing std::cin;\nusing std::cout;\n\n//default constructor\nList::List(){}\n\n//destructor\n//This is going to start from the head and move its way along the list\n//deleting the allocated memory,\nList::~List(){\n \n Node * Current = head;\n Node * Next = head;\n\n for(unsigned int index = 0; index < elementCount; index++){\n\n Next = Current->next;\n delete Current;\n Current = Next;\n\n }\n\n head = nullptr;\n elementCount = 0;\n\n}\n\n// Description: Returns the current number of elements in the List.\n// Postcondition: List unchanged.\n// Time Efficicency: O(1)\nunsigned int List::getElementCount() const{\n return elementCount;\n}\n\n// Description: Insert \"newElement\" at \"position\" in the List. \n // If 1 <= \"position\" <= getElementCount() + 1 and the insertion\n // is successful, \"newElement\" is at \"position\" in the List,\n // the other elements, located after \"newElement\", \"have moved\" 1 \n // position up and \"true\" is returned. Otherwise, \"false\" is returned.\n // Time Efficicency: O(n)\nbool List::insert( unsigned int position, int newElement ){\n\n bool successful = true;\n Node * Current = head;\n\n //validate position\n if(position >= 1 && position <= elementCount + 1){\n\n //if it's going into the first position, we don't need a loop\n if(position == 1){\n Node * newNode = new Node(newElement, head);\n head = newNode;\n elementCount++;\n return successful;\n }\n\n //loop through until you reach the position\n for(unsigned int index = 1; index < position - 1; index++){\n\n //make the next pointer point to next\n Current = Current->next; \n\n }\n\n //create new node, make it point to the next node\n Node * newNode = new Node(newElement, Current->next);\n \n //change previous nodes next pointer to point at the new node\n Current->next = newNode;\n elementCount++;\n \n }else{\n //if parameter was wrong then this has failed\n successful = false;\n }\n\n return successful;\n}\n\n// Description: Removes the element at \"position\" in the List \n // If 1 <= \"position\" <= getElementCount() and the removal \n // is successful, the element at \"position\" in the List is \n // removed, and other elements \"have moved\" 1 position down, \n // and \"true\" is returned. Otherwise, \"false\" is returned. \t\n // Time Efficicency: O(n)\nbool List::remove( unsigned int position ){\n\n if(position < 1 || position > elementCount) return false;\n\n Node * Current = head;\n\n if(position == 1){\n\n head = Current->next;\n delete Current;\n elementCount--;\n return true;\n\n }\n\n \n Node * Last = head;\n\n //want to find pointers to the element we want to delete, as well as the element before it\n for(unsigned int index = 1; index < position; index++){\n Last = Current;\n Current = Current->next;\n }\n\n //set the pointer of the last node to the one after the node to be deleted\n Last->next = Current->next;\n\n //delete node;\n delete Current;\n\n elementCount--;\n return true;\n\n}\n\n\n// Description: Returns the element at \"position\" in the List\n // in *toBeReturned if 1 <= position <= getElementCount().\n // If successful, returns \"true\". Otherwise, returns \"false\".\n // Postcondition: List unchanged.\n // Time Efficicency: O(n)\nbool List::getElement( unsigned int position, int * toBeReturned ) const{\n\n //validate position\n if(position < 1 || position > elementCount) return false;\n\n //create pointer\n Node * Current = head;\n \n //in case we only need the first pointer\n if(position == 1){\n \n *toBeReturned = head->data;\n return true;\n }\n \n //loop to the needed position in the list\n for(unsigned int index = 1; index < position; index++){\n Current = Current->next;\n }\n\n *toBeReturned = Current->data;\n\n return true;\n}\n\n// Description: Replaces the element at \"position\" in the List by \"newElement\".\n // if 1 <= \"position\" <= getElementCount(). \n // If successful, returns \"true\". Otherwise, returns \"false\".\n // Time Efficicency: O(n)\nbool List::setElement( unsigned int position, int newElement ){\n\n if(position < 1 || position > elementCount) return false;\n\n //create pointer\n Node * Current = head;\n \n //loop to the needed position in the list\n for(unsigned int index = 1; index < position; index++){\n Current = Current->next;\n }\n\n //change element\n Current->data = newElement;\n\n return true;\n\n}\n\n// Description: Prints all elements in the List.\n // Format: \"This List has \nusing namespace std;\n\ntypedef long long ll;\n\nbool in(char a, string b){\n for (char c : b) if (a==c) return true;\n return false;\n}\n\nstring vowels = \"eariotnslc\";\nint misvow = (1<<10);\nvector< vector > groups(misvow);\n\nint let = 26;\nll letmask = (1< > dp(letmask, vector(1, \":(\"));\n\nint transmask(ll mask){\n int new_mask = 0;\n for (int i=0;i<10;i++){\n if (mask & (1<<(vowels[i]-'a'))){\n new_mask |= (1< max_w(ll mask){\n if (dp[mask].size() && dp[mask][0] == \":(\"){\n dp[mask] = vector();\n int opt_mask = transmask(mask);\n for (int i=0;i candidate = max_w(mask | guess_mask);\n candidate.push_back(guess);\n if (candidate.size() > dp[mask].size()){\n dp[mask] = candidate;\n }\n }\n cout< answers;\n string line;\n while (getline(answersFile, line)) {\n answers.push_back(line);\n }\n answersFile.close();\n\n // read guesses.txt\n ifstream guessesFile(\"guesses.txt\");\n vector guesses;\n while (getline(guessesFile, line)) {\n guesses.push_back(line);\n }\n guessesFile.close();\n\n \n for (int i=0;i max_words = max_w(answers_mask);\n ofstream outputFile(\"output.txt\", ios::app);\n outputFile << \"For answer: \" << answers[i] << endl;\n for (const string& word : max_words) {\n outputFile << word << endl;\n }\n outputFile << endl;\n outputFile.close();\n }\n\n return 0;\n}"} {"text": "// Turns Transformation GUI (C) 2025\n// Version with percentage control, multiple choice variant selection, and GUI without dependencies\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// Helper to get note name (from MIDI number)\nstd::string getNoteName(int noteNumber) {\n static const std::string noteNames[] = {\n \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\"\n };\n int octave = noteNumber / 12 - 1;\n int noteIndex = noteNumber % 12;\n return noteNames[noteIndex] + std::to_string(octave);\n}\n\n// Helper to get MIDI number from note name\nint getNoteNumber(const std::string& noteName) {\n static const std::string noteNames[] = {\n \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\"\n };\n\n // Extract note and octave\n std::string baseNote = noteName.substr(0, noteName.size() - 1);\n int octave = std::stoi(noteName.substr(noteName.size() - 1));\n\n // Find base note index\n auto it = std::find(std::begin(noteNames), std::end(noteNames), baseNote);\n if (it == std::end(noteNames)) {\n throw std::invalid_argument(\"Invalid note name: \" + noteName);\n }\n int noteIndex = std::distance(std::begin(noteNames), it);\n\n return (octave + 1) * 12 + noteIndex;\n}\n\n// Enum for TimeMeter\nenum TimeMeter {\n DUPLE,\n TRIPLE\n};\n\n// Helper functions for Turn variants\nvoid handleTurnMeter(std::vector>& EmbRet, int upper, int principal, int lower, int pi, int durPi, TimeMeter meter) {\n if (meter == DUPLE) {\n int segment = durPi / 4;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({principal, durPi - 3 * segment}); // Remaining duration\n } else if (meter == TRIPLE) {\n int segment = durPi / 4;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({principal, durPi - 3 * segment}); // Remaining duration\n }\n}\n\nvoid handleTurnMeterFB(std::vector>& EmbRet, int upper, int pi, int lower, int underlower, int lower2, int pi2, int durPi, TimeMeter meter) {\n if (meter == DUPLE) {\n int segment = durPi / 8;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({pi, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({underlower, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({pi, durPi - 5 * segment}); // Remaining duration\n } else if (meter == TRIPLE) {\n int segment = durPi / 5;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({pi, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({pi, segment});\n EmbRet.push_back({upper, durPi - 4 * segment}); // Remaining duration\n }\n}\n\nvoid handleTurnMeterBetween(std::vector>& EmbRet, int pi, int upper, int pi2, int lower, int pi3, int durPi, TimeMeter meter) {\n if (meter == DUPLE) {\n int segment = durPi / 8;\n EmbRet.push_back({pi, durPi / 2});\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({pi2, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({pi3, durPi - (durPi / 2 + 3 * segment)}); // Remaining duration\n } else if (meter == TRIPLE) {\n int segment = durPi / 8;\n EmbRet.push_back({pi, segment});\n EmbRet.push_back({upper, durPi / 4});\n EmbRet.push_back({pi2, durPi / 4});\n EmbRet.push_back({lower, durPi / 4});\n EmbRet.push_back({pi3, durPi - (segment + durPi / 4 + durPi / 4 + durPi / 4)}); // Remaining duration\n }\n}\n\nvoid handleTurnMeterTrille(std::vector>& EmbRet, int upper, int principal, int lower, int durPi, TimeMeter meter) {\n if (meter == DUPLE) {\n int segment = durPi / 8;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({principal, durPi - 5 * segment}); // Remaining duration\n } else if (meter == TRIPLE) {\n int segment = durPi / 8;\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({upper, segment});\n EmbRet.push_back({principal, segment});\n EmbRet.push_back({lower, segment});\n EmbRet.push_back({principal, durPi - 5 * segment}); // Remaining duration\n }\n}\n\nvoid handleTurnMeterP32(std::vector>& EmbRet, int upper, int principal, int lower, int durPi, TimeMeter meter) {\n if (met"} {"text": "// Dongzhuo Li 04/22/2018\n\n#include \"Parameter.h\"\n#include \n#include \n#include \n// #define VERBOSE\n\nusing namespace std;\nusing namespace rapidjson;\n\nParameter::Parameter() {\n cout << \"ERROR: You need to input parameter file name!\" << endl;\n exit(1);\n}\n\nParameter::Parameter(const std::string ¶_fname) {\n\n string line;\n ifstream parafile;\n\n // open parameter file\n parafile.open(para_fname);\n if (!parafile.is_open()) {\n cout << \"Error opening parameter file\" << endl;\n exit(1);\n }\n\n // read the whole line of json file\n getline(parafile, line);\n parafile.close();\n\n Document json_para;\n json_para.Parse<0>(line.c_str());\n assert(json_para.IsObject());\n\n#ifdef VERBOSE\n cout << \"----------Reading Parameter File------------\" << endl;\n#endif\n assert(json_para.HasMember(\"nz\"));\n assert(json_para[\"nz\"].IsInt());\n nz_ = json_para[\"nz\"].GetInt();\n\n#ifdef VERBOSE\n cout << \"\tnz = \" << nz_ << endl;\n#endif\n\n assert(json_para.HasMember(\"nx\"));\n assert(json_para[\"nx\"].IsInt());\n nx_ = json_para[\"nx\"].GetInt();\n#ifdef VERBOSE\n cout << \"\tnx = \" << nx_ << endl;\n#endif\n\n assert(json_para.HasMember(\"dz\"));\n assert(json_para[\"dz\"].IsNumber());\n dz_ = json_para[\"dz\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tdz = \" << dz_ << endl;\n#endif\n\n assert(json_para.HasMember(\"dx\"));\n assert(json_para[\"dx\"].IsNumber());\n dx_ = json_para[\"dx\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tdx = \" << dx_ << endl;\n#endif\n\n assert(json_para.HasMember(\"nt\"));\n assert(json_para[\"nt\"].IsInt());\n nt_ = json_para[\"nt\"].GetInt();\n#ifdef VERBOSE\n cout << \"\tnt = \" << nt_ << endl;\n#endif\n\n assert(json_para.HasMember(\"npml\"));\n assert(json_para[\"npml\"].IsInt());\n npml_ = json_para[\"npml\"].GetInt();\n#ifdef VERBOSE\n cout << \"\tnpml = \" << npml_ << endl;\n#endif\n\n assert(json_para.HasMember(\"ISURF\"));\n assert(json_para[\"ISURF\"].IsInt());\n ISURF_ = json_para[\"ISURF\"].GetInt();\n#ifdef VERBOSE\ncout << \"\tisurf = \" << ISURF_ << endl;\n#endif\n\n assert(json_para.HasMember(\"npad\"));\n assert(json_para[\"npad\"].IsInt());\n npad_ = json_para[\"npad\"].GetInt();\n#ifdef VERBOSE\n cout << \"\tnpad = \" << npad_ << endl;\n#endif\n\n assert(json_para.HasMember(\"dt\"));\n assert(json_para[\"dt\"].IsDouble());\n dt_ = json_para[\"dt\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tdt = \" << dt_ << endl;\n#endif\n\n assert(json_para.HasMember(\"f0\"));\n f0_ = json_para[\"f0\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tf0 = \" << f0_ << endl;\n#endif\n\n assert(json_para.HasMember(\"weight_pr\"));\n weight_pr_ = json_para[\"weight_pr\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tweight_pr = \" << weight_pr_ << endl;\n#endif\n\n assert(json_para.HasMember(\"weight_vx\"));\n weight_vx_ = json_para[\"weight_vx\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tweight_vx = \" << weight_vx_ << endl;\n#endif\n\n assert(json_para.HasMember(\"weight_vz\"));\n weight_vz_ = json_para[\"weight_vz\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tweight_vz = \" << weight_vz_ << endl;\n#endif\n\n assert(json_para.HasMember(\"weight_et\"));\n weight_et_ = json_para[\"weight_et\"].GetDouble();\n#ifdef VERBOSE\n cout << \"\tweight_et = \" << weight_et_ << endl;\n#endif\n\n assert(json_para.HasMember(\"survey_fname\"));\n assert(json_para[\"survey_fname\"].IsString());\n survey_fname_ = json_para[\"survey_fname\"].GetString();\n#ifdef VERBOSE\n cout << \"\tsurvey_fname = \" << survey_fname_ << endl;\n#endif\n\n assert(json_para.HasMember(\"data_dir_name\"));\n assert(json_para[\"data_dir_name\"].IsString());\n data_dir_name_ = json_para[\"data_dir_name\"].GetString();\n#ifdef VERBOSE\n cout << \"\tdata_dir_name = \" << data_dir_name_ << endl;\n#endif\n\n if (json_para.HasMember(\"scratch_dir_name\")) {\n if_save_scratch_ = true;\n assert(json_para[\"scratch_dir_name\"].IsString());\n scratch_dir_name_ = json_para[\"scratch_dir_name\"].GetString();\n#ifdef VERBOSE\n cout << \"\tscratch_dir_name = \" << scratch_dir_name_ << endl;\n#endif\n }\n\n if_win_ = false;\n if (json_para.HasMember(\"if_win\")) {\n assert(json_para[\"if_win\"].IsBool());\n if_win_ = json_para[\"if_win\"].GetBool();\n }\n#ifdef VERBOSE\n cout << \"\tWith Window Selection = \" << if_win_ << endl;\n#endif\n\n if_filter_ = false;\n if (json_para.HasMember(\"filter\")) {\n if_filter_ = true;\n assert(json_para[\"filter\"].IsArray());\n const Value &js_filter = json_para[\"filter\"];\n for (SizeType ii = 0; ii < js_filter.Size(); ii++) {\n filter_[ii] = js_filter[ii].GetDouble();\n }\n#ifdef VERBOSE\n cout << \"\tWith Filtering = \" << if_filter_ << endl;\n#endif\n printf(\"\tfilter = [%.2f, %.2f, %.2f, %.2f]\\n\", filter_[0], filter_[1],\n filter_[2], filter_[3]);\n }\n\n if_src_update_ = false;\n if (json_para.HasMember(\"if_src_update\")) {\n assert(json_para[\"if_src_update\"].IsBool());\n if_src_update_ = json_para[\"if_src_update\"].GetBool();\n }\n#ifdef VERBOSE\n cout << \"\tWith Source Update = \" << if_src_update_ << endl;\n#endif\n\n if (json_para.HasMember(\"if_cross_misfit\")) {\n assert(json_para[\"if_cross_misfit\"].IsBool());\n if_cross_misfit_ = json_para[\"if_"} {"text": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n\n/*\n1. Escriba un programa que, indicado un tipo de dato, devuelve el tamaño de la variable.\nUtilice switch y enum\n*/\n\n/*\nenum TipoDato { \n ENTERO = 1, \n FLOTANTE = 2, \n DOBLE = 3, \n CARACTER = 4, \n BOOLEANO = 5\n};\n\nvoid mostrarMenu() {\n cout << \"Seleccione un tipo de dato para conocer su tamaño:\\n\";\n cout << \"1. Entero (int)\\n\";\n cout << \"2. Flotante (float)\\n\";\n cout << \"3. Doble (double)\\n\";\n cout << \"4. Caracter (char)\\n\";\n cout << \"5. Booleano (bool)\\n\";\n}\n\nvoid mostrarDatos(int opcion) {\n switch (opcion) {\n case ENTERO:\n cout << \"El tamaño de un entero (int) es: \" << sizeof(int) << \" bytes\\n\";\n break;\n case FLOTANTE:\n cout << \"El tamaño de un flotante (float) es: \" << sizeof(float) << \" bytes\\n\";\n break;\n case DOBLE:\n cout << \"El tamaño de un doble (double) es: \" << sizeof(double) << \" bytes\\n\";\n break;\n case CARACTER:\n cout << \"El tamaño de un caracter (char) es: \" << sizeof(char) << \" bytes\\n\";\n break;\n case BOOLEANO:\n cout << \"El tamaño de un booleano (bool) es: \" << sizeof(bool) << \" bytes\\n\";\n break;\n default:\n cout << \"Opción no válida. Por favor, seleccione un número entre 1 y 5.\\n\";\n break;\n }\n}\n\nint main() {\n int opcion;\n mostrarMenu();\n cout << \"Ingrese su opción (1-5): \";\n cin >> opcion;\n mostrarDatos(opcion);\n return 0;\n}\n*/\n// ###################################################################################################################################################\n\n\n/*\n2. Escriba un programa donde se ingresen dos números separados por un espacio, luego\nse ingrese una operación entre ellos (+, -, *, / y %) y devuelva el resultado. Para ello\nutilice switch y enum.\n*/\n/*\nenum Operacion{\n SUMA = 1,\n RESTA = 2,\n MULTIPLICACION = 3,\n DIVISION = 4,\n MODULO = 5\n};\n\nvoid Cuenta(){\n int num1, num2, operacion;\n cout << \"Ingrese dos numeros separados por un espacio: \";\n cin >> num1 >> num2;\n cout << \"Seleccione la operacion a realizar:\\n\";\n cout << \"1. Suma (+)\\n\";\n cout << \"2. Resta (-)\\n\";\n cout << \"3. Multiplicacion (*)\\n\";\n cout << \"4. Division (/)\\n\";\n cout << \"5. Modulo (%)\\n\";\n cout << \"Ingrese su opcion (1-5): \";\n cin >> operacion;\n\n switch (operacion) {\n case SUMA:\n cout << \"La suma entre \" << num1 << \" y \" << num2 << \" es:\" << num1 + num2 << endl;\n break;\n case RESTA:\n cout << \"La suma entre \" << num1 << \" y \" << num2 << \" es:\" << num1 - num2 << endl;\n break;\n case MULTIPLICACION:\n cout << \"La suma entre \" << num1 << \" y \" << num2 << \" es:\" << num1 * num2 << endl;\n break;\n case DIVISION:\n cout << \"La suma entre \" << num1 << \" y \" << num2 << \" es:\" << num1 / num2 << endl;\n break;\n case MODULO:\n cout << \"La suma entre \" << num1 << \" y \" << num2 << \" es:\" << num1 % num2 << endl;\n break;\n default:\n cout << \"no elegiste ningun numero.\";\n break;\n }\n}\n\nint main(){\n Cuenta();\n}\n*/\n\n// ###################################################################################################################################################\n\n/*\n3. Utilizando recursión, verifique que el número ingresado es un número primo. ¿Cómo\npodría hacer el algoritmo más eficiente? Implemente su respuesta.\n*/\n/*\nvoid esPrimo(int num, int divisor){\n if (num < 2) {\n cout << num << \" no es un numero primo.\" << endl;\n return;\n }\n if (divisor > sqrt(num)) {\n cout << num << \" es un numero primo.\" << endl;\n return;\n }\n if (num % divisor == 0) {\n cout << num << \" no es un numero primo.\" << endl;\n return;\n }\n esPrimo(num, divisor + 1);\n}\nint main(){\n int numero;\n cout << \"Ingrese un numero para verificar si es primo: \";\n cin >> numero;\n esPrimo(numero, 2);\n return 0;\n}\n\n/*\n\n// ###################################################################################################################################################\n/*\n4. Escriba un programa que, dado un string, devuelve la cantidad de caracteres e indica\nsi se trata de un palíndromo.\n*/\n/*\nint esPalindromo(const string &str, int inicio, int fin) {\n if (inicio >= fin) {\n return 1; // Es palíndromo\n }\n if (str[inicio] != str[fin]) {\n return 0; // No es palíndromo\n }\n return esPalindromo(str, inicio "} {"text": "#include \"bas/sprite_animation.hpp\"\n#include \n\nnamespace bas {\n\n// Static member definitions\nint SpriteAnimationSystem::next_sprite_id = 1;\nint SpriteAnimationSystem::next_animation_id = 1;\nstd::unordered_map> SpriteAnimationSystem::sprites;\nstd::unordered_map> SpriteAnimationSystem::animations;\n\nvoid Animation::add_frame(int frame_index, double x, double y, double width, double height, double duration) {\n frames.emplace_back(frame_index, x, y, width, height, duration);\n}\n\nvoid Animation::update(double delta_time) {\n if (!playing || frames.empty()) return;\n \n current_time += delta_time;\n \n while (current_time >= frames[current_frame].duration) {\n current_time -= frames[current_frame].duration;\n current_frame++;\n \n if (current_frame >= static_cast(frames.size())) {\n if (loop) {\n current_frame = 0;\n } else {\n current_frame = static_cast(frames.size()) - 1;\n playing = false;\n break;\n }\n }\n }\n}\n\nAnimationFrame Animation::get_current_frame_data() const {\n if (frames.empty()) {\n return AnimationFrame(0, 0, 0, 0, 0, 0);\n }\n return frames[current_frame];\n}\n\n// SpriteAnimationSystem implementation\nint SpriteAnimationSystem::create_sprite(const std::string& name, int texture_id, double width, double height) {\n int id = next_sprite_id++;\n auto sprite = std::make_shared(id, name, texture_id, width, height);\n sprites[id] = sprite;\n return id;\n}\n\nstd::shared_ptr SpriteAnimationSystem::get_sprite(int sprite_id) {\n auto it = sprites.find(sprite_id);\n return (it != sprites.end()) ? it->second : nullptr;\n}\n\nvoid SpriteAnimationSystem::destroy_sprite(int sprite_id) {\n sprites.erase(sprite_id);\n}\n\nint SpriteAnimationSystem::create_animation(const std::string& name, int sprite_id) {\n int id = next_animation_id++;\n auto animation = std::make_shared(id, name, sprite_id);\n animations[id] = animation;\n return id;\n}\n\nstd::shared_ptr SpriteAnimationSystem::get_animation(int animation_id) {\n auto it = animations.find(animation_id);\n return (it != animations.end()) ? it->second : nullptr;\n}\n\nvoid SpriteAnimationSystem::destroy_animation(int animation_id) {\n animations.erase(animation_id);\n}\n\nvoid SpriteAnimationSystem::play_animation(int sprite_id, int animation_id) {\n auto sprite = get_sprite(sprite_id);\n auto animation = get_animation(animation_id);\n \n if (sprite && animation && animation->get_sprite_id() == sprite_id) {\n sprite->current_animation_id = animation_id;\n animation->play();\n }\n}\n\nvoid SpriteAnimationSystem::stop_animation(int sprite_id) {\n auto sprite = get_sprite(sprite_id);\n if (sprite && sprite->current_animation_id != -1) {\n auto animation = get_animation(sprite->current_animation_id);\n if (animation) {\n animation->stop();\n }\n sprite->current_animation_id = -1;\n }\n}\n\nvoid SpriteAnimationSystem::pause_animation(int sprite_id) {\n auto sprite = get_sprite(sprite_id);\n if (sprite && sprite->current_animation_id != -1) {\n auto animation = get_animation(sprite->current_animation_id);\n if (animation) {\n animation->pause();\n }\n }\n}\n\nvoid SpriteAnimationSystem::resume_animation(int sprite_id) {\n auto sprite = get_sprite(sprite_id);\n if (sprite && sprite->current_animation_id != -1) {\n auto animation = get_animation(sprite->current_animation_id);\n if (animation) {\n animation->resume();\n }\n }\n}\n\nvoid SpriteAnimationSystem::update_all_animations(double delta_time) {\n for (auto& pair : animations) {\n pair.second->update(delta_time);\n }\n}\n\nvoid SpriteAnimationSystem::shutdown() {\n sprites.clear();\n animations.clear();\n}\n\n} // namespace bas\n"} {"text": "/// Цель урока: Понять, как замена контейнера map на unordered_map\r\n/// может значительно ускорить программу без изменения функциональности,\r\n/// и осознать компромиссы между разными структурами данных.\r\n\r\n//Подкючаем необходимые библиотеки\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\n// Класс, моделирующий копилку\r\nclass MoneyBox {\r\npublic:\r\n explicit MoneyBox(vector nominals)\r\n : nominals_(move(nominals))\r\n , counts_(nominals_.size()) {\r\n }\r\n\r\n const vector& GetCounts() const {\r\n return counts_;\r\n }\r\n \r\n\t// Метод для добавления монеты в копилку\r\n void PushCoin(int64_t value) {\r\n auto pos = GetIndex(value);\r\n assert(pos <= nominals_.size());\r\n ++counts_[pos];\r\n }\r\n\r\n\t// Метод для вывода содержимого копилки\r\n void PrintCoins(ostream& out) const {\r\n for (size_t i = 0; i < counts_.size(); ++i) {\r\n if (counts_[i] != 0) {\r\n out << nominals_[i] << \": \" << counts_[i] << endl;\r\n }\r\n }\r\n }\r\n\r\nprivate:\r\n\t// Метод для получения индекса номинала монеты\r\n size_t GetIndex(int64_t value) {\r\n return find(nominals_.begin(), nominals_.end(), value) - nominals_.begin();\r\n }\r\n\r\nprivate:\r\n const vector nominals_;\r\n vector counts_;\r\n};\r\n\r\nostream& operator<<(ostream& out, const MoneyBox& cash) {\r\n cash.PrintCoins(out);\r\n return out;\r\n}\r\n\r\nint main() {\r\n MoneyBox cash({ 1, 2, 5, 10, 20, 50, 100, 200 });\r\n\r\n int times;\r\n cout << \"Enter number of coins you have:\"s << endl;\r\n cin >> times;\r\n\r\n cout << \"Enter all nominals:\"s << endl;\r\n for (int i = 0; i < times; ++i) {\r\n int64_t value;\r\n cin >> value;\r\n cash.PushCoin(value);\r\n }\r\n\r\n cout << cash << endl;\r\n}"} {"text": "#include \n#include \n#include \n#include \n#include \n\nvoid* Worker(void* arg)\n{\n\tint id = *static_cast(arg);\n\tfor (int k = 0; k < 3; ++k)\n\t{\n\t\tstd::cout << \"Worker \" << id << \" iteration \" << k << \"\\n\";\n\t\tsched_yield(); // в духе pthread_yield\n\t}\n\treturn nullptr; // эквивалент pthread_exit(nullptr)\n}\n\nint main()\n{\n\tconstexpr int N = 4;\n\tpthread_attr_t attr;\n\tpthread_attr_init(&attr);\n\tpthread_attr_setstacksize(&attr, 1 << 20); // 1 МБ для примера\n\n\tstd::vector th(N);\n\tstd::vector ids(N);\n\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tids[i] = i;\n\t\tif (int rc = pthread_create(&th[i], &attr, &Worker, &ids[i]); rc != 0)\n\t\t{\n\t\t\tstd::cerr << \"pthread_create: \" << std::strerror(rc) << \"\\n\";\n\t\t\treturn 1;\n\t\t}\n\t\tstd::cout << \"main: started thread #\" << ids[i] << \"\\n\";\n\t}\n\n\tpthread_attr_destroy(&attr);\n\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tif (int rc = pthread_join(th[i], nullptr); rc != 0)\n\t\t{\n\t\t\tstd::cerr << \"pthread_join: \" << std::strerror(rc) << \"\\n\";\n\t\t}\n\t}\n\tstd::cout << \"main: all threads joined\\n\";\n}\n"} {"text": "#include \"./stdc++.h\"\n#include \n#include \n#include \nusing namespace std;\n\n// Multiplication modulo n (avoids overflow)\nlong long mulmod(long long a, long long b, long long mod) {\n __int128 res = (__int128)a * b % mod;\n return (long long)res;\n}\n\n// Fast modular exponentiation\nlong long modpow(long long base, long long exp, long long mod) {\n long long result = 1;\n while (exp > 0) {\n if (exp & 1) result = mulmod(result, base, mod);\n base = mulmod(base, base, mod);\n exp >>= 1;\n }\n return result;\n}\n\n// Miller–Rabin primality test\nbool isPrime(long long n) {\n if (n < 2) return false;\n for (long long p : {2,3,5,7,11,13,17,19,23,29,31,37}) {\n if (n % p == 0) return n == p;\n }\n\n long long d = n-1, s = 0;\n while ((d & 1) == 0) { d >>= 1; s++; }\n\n auto check = [&](long long a) {\n if (a % n == 0) return true;\n long long x = modpow(a, d, n);\n if (x == 1 || x == n-1) return true;\n for (int i = 1; i < s; i++) {\n x = mulmod(x, x, n);\n if (x == n-1) return true;\n }\n return false;\n };\n\n for (long long a : {2,325,9375,28178,450775,9780504,1795265022}) {\n if (!check(a)) return false;\n }\n return true;\n}\n\n// Pollard's Rho\nlong long rho(long long n) {\n if (n % 2 == 0) return 2;\n long long x = rand() % (n-2) + 2;\n long long y = x;\n long long c = rand() % (n-1) + 1;\n long long d = 1;\n while (d == 1) {\n x = (mulmod(x, x, n) + c) % n;\n y = (mulmod(y, y, n) + c) % n;\n y = (mulmod(y, y, n) + c) % n;\n d = gcd(abs(x-y), n);\n if (d == n) return rho(n);\n }\n return d;\n}\n\n// Recursive factorization\nvoid factorize(long long n, map& factors) {\n if (n == 1) return;\n if (isPrime(n)) {\n factors[n]++;\n return;\n }\n long long d = rho(n);\n factorize(d, factors);\n factorize(n/d, factors);\n}\n\nint main() {\n long long n;\n vector base;\n vector exponentsum;\n vector exponentsumout;\n vector> recordtime;\n //cout << \"Enter value: \";\n\n //cin >> n;\n\n //start timer\n auto started = chrono::high_resolution_clock::now();\n\n\n\n //For loop values to add exponent sum values betweeen 10^6 and 2x10^6\n for ( n = 1000000; n < 2000000; n++) {\n auto facstart = chrono::high_resolution_clock::now();\n\n map factors;\n factorize(n, factors);\n\n for (auto [p, e] : factors) {\n exponentsum.push_back(e);\n }\n exponentsumout.push_back(accumulate(exponentsum.begin(), exponentsum.end(), 0LL));\n exponentsum.clear();\n auto facend = chrono::high_resolution_clock::now();\n int time = chrono::duration_cast(facend - facstart).count();\n recordtime.push_back({time, n});\n\n }\n float totalavg = accumulate(exponentsumout.begin(), exponentsumout.end(), 0LL);\n float divisor = 1000000;\n float result = totalavg / divisor;\n cout << \"Average value of factorOut between 10^6 and 2 x 10^6: \" << totalavg << \"/\" << divisor << \"=\" << result << endl;\n auto ended = chrono::high_resolution_clock::now();\n cout << \"Process took \" << chrono::duration_cast(ended - started).count() << \" miliseconds\" <\n#include \n#include \n\nusing namespace std;\n\nclass AdventureGame {\n \nprivate:\n int playerHealth;\n int playerStrength;\n int playerAgility;\n int playerLevel;\n \npublic:\n AdventureGame() {\n playerHealth=100;\n playerStrength=10;\n playerAgility=10;\n playerLevel=1;\n }\n void startGame() {\n cout<< \"Welcome to the Fantasy Adventure Game!\"<< endl;\n }\n void ExploreLocation(){\n int randomEvent=rand() % 3 + 1;\n \n switch(randomEvent) {\n case 1:\n EncounterEnemy();\n break;\n case 2:\n FindTreasure();\n break;\n case 3:\n RestandHeal();\n break;\n }\n }\n\nvoid EncounterEnemy(){\n int enemyStrength=rand()%20+1;\n cout<<\"You encounter a fearsome enemy!\"<enemyStrength){\n cout<<\"You destroy the enemy and gained point!\"<