Console.WriteLine("хуй");
string? input = Console.ReadLine();
Console.ReadLine();
if (Console.ReadLine() == "иди нахуй");
{
    Console.WriteLine("сам");
}

IT Оффтоп #237

Пиздец-оффтоп #131

Example #3: The ``Ultimate''
                      +-----------------------------+
                      |                  +---+      |
                      |  +---+           |+-+|      |
                      |  ^   |           |^ ||      |
                void (*signal(int, void (*fp)(int)))(int);
                 ^    ^      |      ^    ^  ||      |
                 |    +------+      |    +--+|      |
                 |                  +--------+      |
                 +----------------------------------+
Question we ask ourselves: What is `signal'?

function minifyJSCSS(&$content) {
	global $USER;
	global $APPLICATION;
	if (is_object($USER) && $USER->IsAdmin()) return;

	preg_match_all('/<link.+?href="\/bitrix\/cache[^>]+>/',$content, $result);

	foreach ($result[0] as $css)
	{
		preg_match('/(href)=("[^"]*")/i',$css, $file);

		$orig_file = reset(explode('?',str_replace('"','',$file[2])));

		if (stristr($orig_file,'.css') === false)
			continue;

		$min_file = str_replace('.css','.min.css',$orig_file);

		if (!file_exists($min_file))
		{
			$compress = file_get_contents($_SERVER["DOCUMENT_ROOT"].$orig_file);
			$compress = preg_replace("!/\*[^*]*\*+([^/][^*]*\*+)*/!", "", $compress);
			$compress = str_replace(array("\r\n", "\r", "\n", "\t", "  ", "    ", "    "), "", $compress);
			file_put_contents($_SERVER["DOCUMENT_ROOT"].$min_file, $compress);
		}

		$content = str_replace($orig_file,$min_file,$content);
	}



	if (strpos($_SERVER['HTTP_USER_AGENT'],'Lighthouse'))
	{
		preg_match_all('/<script.+?src="\/bitrix\/cache[^>]+>/',$content, $result);

		foreach ($result[0] as $js)
		{
			preg_match('/(src)=("[^"]*")/i',$js, $file);

			$orig_file = reset(explode('?',str_replace('"','',$file[2])));

			$orig_file = $orig_file;
			$min_file = str_replace('.js','.min.js',$orig_file);

			if (!file_exists($_SERVER["DOCUMENT_ROOT"].$min_file))
			{

				$url = 'https://javascript-minifier.com/raw';
				$js = file_get_contents($_SERVER["DOCUMENT_ROOT"].$orig_file);

				$ch = curl_init();

				curl_setopt_array($ch, [
					CURLOPT_URL => $url,
					CURLOPT_RETURNTRANSFER => true,
					CURLOPT_POST => true,
					CURLOPT_HTTPHEADER => ["Content-Type: application/x-www-form-urlencoded"],
					CURLOPT_POSTFIELDS => http_build_query([ "input" => $js ])
				]);

				$minified = curl_exec($ch);
				curl_close($ch);

				file_put_contents($_SERVER["DOCUMENT_ROOT"].$min_file,$minified);

				$gzdata = gzencode($minified, 9);
				file_put_contents($_SERVER["DOCUMENT_ROOT"].$min_file.'.gz', $gzdata);

			}

			$content = str_replace($orig_file,$min_file,$content);
		}
	}
}

IT Оффтоп #236

Пиздец-оффтоп #130

Lemma mfun_equiv_commut f g g1 g2 :
  mfun_equiv g (g2 ∘ g1) ->
  commute f g1 ->
  commute f g2 ->
  commute f g.
Proof.
  intros Hg Hcomm_g1 Hcomm_g2 a z.
  split; intros H; unfold mfun_equiv in Hg.
  - destruct H as [b [Hb Hz]].
    rewrite Hg in Hz.
    destruct Hz as [d [Hd Hz]].
    destruct (Hcomm_g1 a d) as [Hg1f Hfg1]. clear Hfg1.
    destruct Hg1f as [d' [Had' Hcd']]. { sauto. }
    morph_shift g2 d'.
    destruct Had' as [c' Hc'].
    destruct (Hcomm_g2 c' z') as [Hg2f Hfg2].
    destruct Hg2f as [z'' [Hz'' Hz'z'']]. { sauto. }
    destruct Hz'' as [e'' He''].
    exists z''.
    split.
    + exists e''.
      split.
      * rewrite Hg. sauto.
      * easy.
    + now rewrite Hequiv_z_z', Hz'z''.
  - destruct H as [c [Hc Hz]].
    rewrite Hg in Hc.
    destruct Hc as [b [Hb Hc]].
    destruct (Hcomm_g2 b z) as [Hg2f Hfg2]. clear Hg2f.
    destruct Hfg2 as [z' [Hbz' Hzz']]. { sauto. }
    destruct Hbz' as [d [Hdz' Hbd']].
    destruct (Hcomm_g1 a d) as [Hg1f Hfg1]. clear Hg1f.
    destruct Hfg1 as [d' [Had' Hdd']]. { sauto. }
    destruct Had' as [b' [Hab' Hb'd']].
    morph_shift g2 d'.
    exists z''.
    split.
    + exists b'.
      split.
      * easy.
      * rewrite Hg. exists d'. sauto.
    + now rewrite Hzz', Hequiv_z'_z''.
Qed.

Хрюкни #41
             ._     __,
              |\,../'\
            ,'. .     `.
           .--         '`.
          ( `' ,          ;
          ,`--' _,       ,'\
         ,`.____            `.
        /              `,    |
       '                \,   '
       |                /   /`,
       `,  .           ,` ./  |
       ' `.  ,'        |;,'   ,@
 ______|     |      _________,_____jv______
        `.   `.   ,'
         ,'_,','_,
         `'   `'

IT Оффтоп #235

try:
            # Get or create cached encoder/decoder pair atomically
            encoder_decoder = cls._encoder_cache.get(struct_cls)
            if encoder_decoder is None:
                encoder = msgspec.json.Encoder()
                decoder = msgspec.json.Decoder(type=struct_cls, dec_hook=_dec_hook)
                encoder_decoder = (encoder, decoder)
                cls._encoder_cache[struct_cls] = encoder_decoder
                cls._decoder_cache[struct_cls] = encoder_decoder
            else:
                encoder, decoder = encoder_decoder

...
    {ok, {attribute, _, BH, Behavior}} when BH =:= behavior; BH =:= behaviour ->
      process_attributes(OrigFile, EPP, [{behavior, Behavior} | Acc]);
...

IT Оффтоп #234

Бесконечный оффтоп имени Гологуба #10

Пиздец-оффтоп #129

IT Оффтоп #233

Пиздец-оффтоп #128

{-# LANGUAGE OverloadedStrings #-}
import qualified Data.Text.Lazy.IO as LIO
import GHC.IO.StdHandles
import Text.Regex.TDFA
import qualified Text.Regex.TDFA.Text.Lazy as RL
import Data.Array
import qualified Data.Text.Lazy as TL
import System.Environment
import System.Exit
import System.IO
import qualified Language.C.Syntax.Constants as CC
import Data.Char

printMatch t matches i =
    let (offset, len) = matches ! i in
    let offset' = fromIntegral offset in
    let len' = fromIntegral len in
    LIO.putStr $ TL.take len' $ TL.drop offset' t

printHead t matches =
    let (offset, len) = matches ! 0 in
    let offset' = fromIntegral offset in
    let len' = fromIntegral len in
    LIO.putStr $ TL.take offset' t

printTrail t matches =
    let (offset, len) = matches ! 0 in
    let offset' = fromIntegral offset in
    let len' = fromIntegral len in
    LIO.putStr $ TL.drop (offset' + len') t

need_capture_trail acc ".*" = (False, reverse acc)
need_capture_trail acc [] = (True, reverse acc)
need_capture_trail acc (c : rest) = need_capture_trail (c : acc) rest

getRE :: [String] -> Either String (RL.Regex, Bool, String)
getRE args =
    case args of
      (re_str : repl_str : _) ->
          let (trail_needed, re_str') = need_capture_trail [] re_str in
          let re_text = TL.pack $ CC.unescapeString re_str' in
          case RL.compile defaultCompOpt defaultExecOpt re_text of
            Right re ->
                Right (re, trail_needed, CC.unescapeString repl_str)
            Left err ->
                Left err
      _ ->
          Left "Regexp expected"

-- replacement :: TL.Text -> Int -> _ -> String -> IO ()
replacement _ _ _ [] = return ()
replacement t n_matches matches (c : rest)
    | ord c <= n_matches = do
           printMatch t matches (ord c)
           replacement t n_matches matches rest
    | True = do
        putChar c
        replacement t n_matches matches rest

exitError :: String -> IO ()
exitError msg = do
  hPutStrLn stderr msg
  exitWith (ExitFailure 1)

main :: IO ()
main = do
    args <- getArgs
    case getRE args of
      Right (re, trail_needed, repl) -> do
          t <- LIO.hGetContents stdin
          case RL.execute re t of
            Right (Just matches) ->
                do
                  let n_matches = snd $ bounds matches
                  -- print matches
                  printHead t matches
                  replacement t n_matches matches repl
                  if trail_needed then
                      printTrail t matches
                  else
                      return ()
            Right Nothing -> do
                exitError "Pattern not found"
            Left err -> do
                exitError err
      Left err -> do
         exitError err

IT Оффтоп #232

Пиздец-оффтоп #127

IT Оффтоп #231

Питушня #43

Пиздец-оффтоп #126

// ==UserScript==
// @name         BLS Spain
// @namespace    https://appointment.blsspainrussia.ru/
// @version      2025-06-15
// @description  try to take over the world!
// @author       You
// @match        https://appointment.blsspainrussia.ru/Global/Appointment/VisaType*
// @icon         https://www.google.com/s2/favicons?sz=64&domain=tampermonkey.net
// @grant        none
// ==/UserScript==


function doit() {
    let jQuery = window.jQuery;
    let a = jQuery.find("label:contains(Appointment For)").filter(el => el.offsetParent !== null);
    jQuery(a).parent().find(':contains(Family)').click();

    setTimeout(() => {
        jQuery(".btn-success").first().click()
        setTimeout(() => {

            let a = jQuery.find("label:contains(Number Of Members)").filter(el => el.offsetParent !== null);
            jQuery(a).parent().find('.k-dropdown').click();

            setTimeout(() => {
                jQuery.find("li:contains(2 Members)").forEach(x=>x.click())

                let a = jQuery.find("label:contains(Location)").filter(el => el.offsetParent !== null);
                jQuery(a).parent().find('.k-dropdown').click();

                setTimeout(() => {
                    jQuery.find("li:contains(Moscow)").forEach(x=>x.click())

                    let a = jQuery.find("label:contains(Visa Type)").filter(el => el.offsetParent !== null);
                    jQuery(a).parent().find('.k-dropdown').click();

                    setTimeout(() => {
                        jQuery.find("li:contains(Schengen Visa)").forEach(x=>x.click())

                        setTimeout(() => {
                            let a = jQuery.find("label:contains(Visa Sub Type)").filter(el => el.offsetParent !== null);
                            jQuery(a).parent().find('.k-dropdown').click();

                            setTimeout(() => {
                                jQuery.find("li:contains(Tourism)").forEach(x=>x.click())

                                setTimeout(() => {
                                    let a = jQuery.find("label:contains(Category)").filter(el => el.offsetParent !== null);
                                    jQuery(a).parent().find('.k-dropdown').click();

                                    setTimeout(() => {

                                        jQuery.find("li:contains(Normal)").forEach(x=>x.click());

                                        setTimeout(() => {
                                            jQuery("#btnSubmit").click();
                                        }, 200);
                                    }, 200);
                                }, 200);
                            }, 200);
                        }, 200);
                    }, 200);
                }, 200);
            }, 200);
        }, 200);
    }, 700);
}

(function() {
    'use strict';

    console.log("Hello!");
    setTimeout(function() {
        doit();
    }, 1000);
})();

char seq[32];
int s = 0;
seq[s++] = ':';
seq[s++] = ' ';
seq[s++] = 'i';
seq[s++] = 'c';
seq[s++] = 'm';
seq[s++] = 'p';
seq[s++] = '_';
seq[s++] = 's';
seq[s++] = 'e';
seq[s++] = 'q';
seq[s++] = '=';
seq[s++] = '0' + i;
seq[s++] = ' ';
seq[s++] = 't';
seq[s++] = 't';
seq[s++] = 'l';
seq[s++] = '=';
seq[s++] = '6';
seq[s++] = '4';
seq[s++] = ' ';
seq[s++] = 't';
seq[s++] = 'i';
seq[s++] = 'm';
seq[s++] = 'e';
seq[s++] = '=';
/* Random-ish time 10-50ms */
int time_ms = 15 + (i * 7) % 30;
seq[s++] = '0' + (time_ms / 10);
seq[s++] = '0' + (time_ms % 10);
seq[s++] = ' ';
seq[s++] = 'm';
seq[s++] = 's';
seq[s++] = '\n';
seq[s] = '\0';

IT Оффтоп #230

namespace arangodb {
class DatabaseFeature;

struct IDatabaseGuard {
  virtual ~IDatabaseGuard() = default;
  [[nodiscard]] virtual TRI_vocbase_t& database() const noexcept = 0;
};

struct VocbaseReleaser {
  void operator()(TRI_vocbase_t* vocbase) const noexcept;
};

using VocbasePtr = std::unique_ptr<TRI_vocbase_t, VocbaseReleaser>;

/// @brief Scope guard for a database, ensures that it is not
///        dropped while still using it.
class DatabaseGuard final : public IDatabaseGuard {
 public:
  /// @brief create guard on existing db
  explicit DatabaseGuard(TRI_vocbase_t& vocbase);

  /// @brief create guard from existing VocbasePtr
  explicit DatabaseGuard(VocbasePtr vocbase);

  /// @brief create the guard, using a database id
  DatabaseGuard(DatabaseFeature& feature, TRI_voc_tick_t id);

  /// @brief create the guard, using a database name
  DatabaseGuard(DatabaseFeature& feature, std::string_view name);

  /// @brief return the database pointer
  TRI_vocbase_t& database() const noexcept final { return *_vocbase; }
  TRI_vocbase_t const* operator->() const noexcept { return _vocbase.get(); }
  TRI_vocbase_t* operator->() noexcept { return _vocbase.get(); }

 private:
  VocbasePtr _vocbase;
};

}  // namespace arangodb

Пиздец-оффтоп #125

Именно поэтому я за «PHP» #9

Пиздец-оффтоп #124

<? // get current season for header styling
		$current_month = date("m");
		if($current_month >= "03" && $current_month <= "05") $season = "spring";
		elseif($current_month >= "06" && $current_month <= "08") $season = "spring";
		elseif($current_month >= "09" && $current_month <= "11") $season = "autumn";
		else $season = "winter";
  ?>

IT Оффтоп #229

#pragma GCC optimize("03")
#include <bits/stdc++.h>
#pragma GCC target("avx2,tune=native")
using namespace std;
int binxor(int a, int b) {
    if (b == 0) {
        return 0;
    }
    int t = binxor(a, b / 2);
    if (b % 2 == 0) {
        return t ^ t;
    } else {
        return t ^ t ^ a;
    }
}
vector<int> per(20);
vector<int> res(binxor(1 << 20, numeric_limits<int>::max() + 2), -1);
vector<int> need(binxor(1 << 20, numeric_limits<int>::max() + 2), 0);
vector<int> gp(binxor(1 << 20, numeric_limits<int>::max() + 2), 1 << 30);
int c = 0;
int Trump = 0;
inline void f(int i, int n, int w) {
    if (i == w) {
        for (int j = 0; j < w; j++) {
            if ((Trump >> (w - 1 - j)) & 1) {
                gp[Trump] = min(gp[Trump], gp[Trump ^ (1 << (w - 1 - j))]);
            }
        }
        return;
    }
    f(i + 1, n, w);
    Trump ^= 1 << (w - 1 - i);
    f(i + 1, n, w);
    Trump ^= 1 << (w - 1 - i);
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, q, w;
    cin >> n >> q >> w;
    vector<string> s(n);
    for (auto &x : s) {
        cin >> x;
    }
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int x, int y) {
        return s[x] < s[y];
    });
    for (int i = 0; i < n; i++) {
        int Trump = 0;
        for (auto ch : s[ord[i]]) {
            Trump |= 1 << (ch - 'a');
        }
        gp[Trump] = min(gp[Trump], i);
    }
    f(0, n, w);
    for (int i = 0; i < q; ++i) {
        string t;
        cin >> t;
        int Harris = 0;
        for (auto ch : t) {
            Harris |= 1 << (ch - 'a');
        }
        int val = gp[((1 << w) - 1) ^ Harris];
        cout << (val >= n ? -1 : 1 + ord[val]) << "\n";
    }
    return 0;
}

const std::string programPath =
    "/root/CLionProjects/PetukhPlusPlus/program.petukh";

const std::string lexerOutPath =
    "/root/CLionProjects/PetukhPlusPlus/res_lexer.txt";

const std::string syntaxOutPath =
    "/root/CLionProjects/PetukhPlusPlus/res_syntax.txt";

const std::string semanticOutPath =
    "/root/CLionProjects/PetukhPlusPlus/res_semantic.txt";

const std::string polizOutPath =
    "/root/CLionProjects/PetukhPlusPlus/res_poliz.txt";

Пиздец-оффтоп #123

ЗарплатныйПроект = Справочники.ЗарплатныеПроекты.ПустаяCсылка(); 
	Запрос = Новый Запрос();
	Запрос.Текст = "ВЫБРАТЬ ПЕРВЫЕ 1
	|	ЗарплатныеПроекты.Ссылка КАК ЗарплатныйПроект
	|ИЗ
	|	Справочник.ЗарплатныеПроекты КАК ЗарплатныеПроекты";
	Если НЕ Запрос.Выполнить().Пустой() Тогда
		Рез = Запрос.Выполнить().Выбрать();
		Рез.Следующий(); 
		ЗарплатныйПроект = Рез.ЗарплатныйПроект;
	КонецЕсли;

IT Оффтоп #228

echo first >first.txt
echo second >second.txt
ln -s first.txt second.txt
# Выведет: ln: cannot create symbolic link from 'first.txt' to 'second.txt': File exists
mount --bind first.txt second.txt
# А так работает.
cat second.txt
#Выведет first.

Бесконечный оффтоп имени Гологуба #9

diff -uwrd RedmiNote12/vendor_a/etc/usecaseKvManager.xml RedmiNote13/vendor_a/etc/usecaseKvManager.xml
...
-            <keys_and_values StreamType="PAL_STREAM_VOIP_TX" CustomConfig="dual-mic">>
+            <keys_and_values StreamType="PAL_STREAM_VOIP_TX" CustomConfig="dual-mic">

# -*- Mode: python; indent-tabs-mode: nil; tab-width: 40 -*-
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, You can obtain one at http://mozilla.org/MPL/2.0/.

if CONFIG['OS_ARCH'] == 'WINNT':
    DIRS += ['win']
elif CONFIG['MOZ_WIDGET_TOOLKIT'] == 'cocoa':
    DIRS += ['mac']
elif CONFIG['MOZ_WIDGET_TOOLKIT'] in ('gtk2', 'gtk3'):
    DIRS += ['unix']
else:
    DIRS += ['emacs']

cin >> N >> L >> T;
  total = 0;
  for (int i = 0; i < N; i++) {
    cin >> S[i] >> H[i] >> P[i];
    total += H[i] * P[i];
  }
  fix_order();
  for (int ind = 0; ind < N; ind++) {
    int len = ind + 1;
    set<pair<long long, int>> events, comps;
    vector<long long> sum_hp(len);
    copy(H, H + len, sum_hp.begin());
    sum_hp[ind] = 0;
    vector<int> ord(len);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int i, int j) {
      return S[i] < S[j];
    });
    comps.emplace(T, -1);
    for (int i = 0; i < len; i++) {
      int j = i + 1;
      while (j < len && S[ord[i]] == S[ord[j]]) {
        sum_hp[ord[i]] += sum_hp[ord[j]];
        ++j;
      }
      comps.emplace(S[ord[i]], ord[i]);
      i = j - 1;
    }
    for (auto it = comps.begin(); next(it) != comps.end(); ++it) {
      long long dist = next(it)->first - it->first;
      int idx = it->second;
      if (sum_hp[idx] > 0) {
        events.emplace((dist + sum_hp[idx] - 1) / sum_hp[idx], idx);
      }
    }
    vector<bool> visited(len);
    vector<bool> added(len);
    long long good_sum = 0, last_time = 0, govno = T, rakom_bokom = 0;
    for (auto [spawn, i] : comps) {
      if (spawn >= S[ind] && i != -1) {
        good_sum += sum_hp[i];
        added[i] = true;
      }
    }
    auto Upd = [&](long long time) -> void {
      long long F = govno - S[ind] - rakom_bokom;
      if (F <= 0) {
        return;
      }
      long long r1 = clamp(F / (H[ind] + good_sum) + 1, last_time, time);
      long long r2 = good_sum == 0 ? time : clamp(F / good_sum + 1, last_time, time);
      dp_diff_i[last_time] += H[ind] * P[ind];
      dp_diff_i[r1] -= H[ind] * P[ind];
      dp_diff[r1] += F * P[ind];
      dp_diff[r2] -= F * P[ind];
      dp_diff_i[r1] -= good_sum * P[ind];
      dp_diff_i[r2] += good_sum * P[ind];
      last_time = time;
    };
    vector<bool> skip(len), finished(len);
    while (!events.empty()) {
      auto [time, i] = *events.begin();
      events.erase(events.begin());
      if (time > L) {
        break;
      }
      if (skip[i] || sum_hp[i] == 0) {
        continue;
      }
      Upd(time);
      auto it = comps.upper_bound({S[i], INT_MAX});
      if (it->second == -1 || finished[it->second]) {
        good_sum -= sum_hp[i];
        finished[i] = true;
        govno = S[i];
        continue;
      }
      if (!added[i] && it->second + sum_hp[i] * time >= S[ind]) {
        added[i] = true;
        good_sum += sum_hp[i];
        rakom_bokom += S[i] - S[ind];
      }
      sum_hp[i] += sum_hp[it->second];
      skip[it->second] = true;
      long long next_pos = next(it)->first;
      comps.erase(it);
      events.emplace(time + (next_pos - S[i] - sum_hp[i] * time + sum_hp[i] - 1) / sum_hp[i], i);
    }
    Upd(L + 1);
  }
  long long cur_diff = 0, cur_diff_i = 0;
  for (int i = 0; i <= L; i++) {
    cur_diff += dp_diff[i];
    cur_diff_i += dp_diff_i[i];
    dp[i] = cur_diff + cur_diff_i * i;
  }