Skip to main content

Untitled

• Jan 10, 2025 •alexandr.zaikin.9999-c10d
Loading...

More Plaintext Posts

Untitled

• Jun 1, 2025 •abeRodrz99

0 likes • 3 views

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>
<body>
    
</body>
</html>

Untitled

• Aug 27, 2024 •vercetti322

0 likes • 6 views

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <ctime>

using namespace std;

// Function to generate random numbers
vector<int> generateRandomNumbers(int count, int minValue, int maxValue) {
    vector<int> numbers;
    for (int i = 0; i < count; ++i) {
        numbers.push_back(rand() % (maxValue - minValue + 1) + minValue);
    }
    return numbers;
}

// Function to print a vector of integers
void printVector(const vector<int>& vec) {
    for (int num : vec) {
        cout << num << " ";
    }
    cout << endl;
}

// Function to sort and display numbers
void sortAndDisplayNumbers(vector<int>& numbers) {
    sort(numbers.begin(), numbers.end());
    cout << "Sorted numbers: ";
    printVector(numbers);
}

int main() {
    // Seed the random number generator
    srand(static_cast<unsigned int>(time(0)));

    int count, minValue, maxValue;
    
    cout << "Enter the number of random numbers to generate: ";
    cin >> count;
    
    cout << "Enter the minimum value: ";
    cin >> minValue;
    
    cout << "Enter the maximum value: ";
    cin >> maxValue;
    
    // Generate random numbers
    vector<int> numbers = generateRandomNumbers(count, minValue, maxValue);
    
    // Display unsorted numbers
    cout << "Unsorted numbers: ";
    printVector(numbers);
    
    // Sort and display sorted numbers
    sortAndDisplayNumbers(numbers);

    return 0;
}

Untitled

• May 13, 2025 •rejordon17-9956

0 likes • 0 views

fsfsdfsdfdsfsdf

Lorem Ipsum Plaintext

• Oct 15, 2022 •CodeCatch

0 likes • 1 view

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

Untitled

• Jan 9, 2026 •CodeCatch

0 likes • 1 view

{
    "bindAddress": "",
    "bindPort": 2001,
    "publicAddress": "",
    "publicPort": 2001,
    "a2s": {
        "address": "0.0.0.0",
        "port": 17777
    },
    "rcon": {
        "address": "0.0.0.0",
        "port": 19999,
        "password": "fobarma1234!",
        "permission": "admin",
        "blacklist": [],
        "whitelist": []
    },
    "game": {
        "name": "[NA1] FOB Arma | Arland Game Master | fobarma.com",
        "password": "",
        "passwordAdmin": "fobarma1234!",
        "admins": [
            "76561198054239558",
            "76561198097176793",
            "76561198968225358",
            "76561199833357392",
            "76561198073098171"
        ],
        "scenarioId": "{2BBBE828037C6F4B}Missions/22_GM_Arland.conf",
        "maxPlayers": 128,
        "visible": true,
        "crossPlatform": true,
        "gameProperties": {
            "serverMaxViewDistance": 2500,
            "serverMinGrassDistance": 150,
            "networkViewDistance": 1500,
            "disableThirdPerson": true,
            "fastValidation": true,
            "battlEye": true,
            "VONDisableUI": false,
            "VONDisableDirectSpeechUI": false,
            "VONCanTransmitCrossFaction": false
        },
"mods": [
                {
                "modId": "595F2BF2F44836FB",
                "name": "RHS - Status Quo"
            }
]
},
    "operating": {
        "lobbyPlayerSynchronise": true,
        "joinQueue": {
            "maxSize": 50
        }
    }
}

Untitled

• Mar 12, 2026 •prakhar.dev101-263b

0 likes • 1 view

class Solution {
public:
    bool isGoodLength(int len, string& s) {
        
    }

    string longestPalindrome(string s) {
        int l = 1; // a string of length 1 can always be a pallindrome
        int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic

        while(r > l + 1) {
            int mid = l + (r - l) / 2;

            if(isGoodLength(mid, s)) {
                l = mid;
            } else {
                r = mid;
            }
        }
    }
};