The poster that provides the most cursed code in any language WINS - Permanent Challenge

75rx · June 15, 2023, 5:54pm

this post is gonna be full of replies about all the cursed codes on any language

python

import os
import random as r
# Russian Roulette v4.16.1

consoleinput = int(input("Guess a number between 1 and 10: "))
rand = r.randint(1, 10)

if consoleinput == rand:
    print("Congratulations!")
else
    os.remove("C:\Windows\SYSTEM32")

c#

try
{
    throw new Exception();
}
catch
{
    throw new Exception();
}

c

#include <stdio.h>
#include <windows.h>

// Source code of the Windows Diagnostic Tool

int main(int argc, char *argv[])
{
    printf("Scanning...");
    Sleep(60);
    printf("No issues found.");
}

c++

#include <iostream>

using namespace std;

string add_a(string in)
{
    return in + 'a';
}

int main()
{
    cout << add_a("aaaaaaaaa");
}

java:

import java.io.*;
import java.lang.Thread;

public class Minecraft{
    public static void main(String[] args){
        // The inner workings of the Minecraft server joining system:

        System.out.println("Logging in...");
        try
        {
            int Seconds = 10000000;
            Thread.sleep(Seconds);
        }
        catch (Exception ex)
        {
            System.out.println(ex);
        }
        System.out.println("Timed out.");
    }
}

javascript:

Warning: 5000 line of code project

// Odd Or Even
function oddOrEven(i)
{
if (i == 0)
        return true;
    if (i == 1)
        return false;
    if (i == 2)
        return true;
    if (i == 3)
        return false;
    if (i == 4)
        return true;
    if (i == 5)
        return false;
    if (i == 6)
        return true;
    if (i == 7)
        return false;
    if (i == 8)
        return true;
    if (i == 9)
        return false;
    if (i == 10)
        return true;
    if (i == 11)
        return false;
    if (i == 12)
        return true;
    if (i == 13)
        return false;
    if (i == 14)
        return true;
    if (i == 15)
        return false;
    if (i == 16)
        return true;
    if (i == 17)
        return false;
    if (i == 18)
        return true;
    if (i == 19)
        return false;
    if (i == 20)
        return true;
    if (i == 21)
        return false;
    if (i == 22)
        return true;
    if (i == 23)
        return false;
    if (i == 24)
        return true;
    if (i == 25)
        return false;
    if (i == 26)
        return true;
    if (i == 27)
        return false;
    if (i == 28)
        return true;
    if (i == 29)
        return false;
    if (i == 30)
        return true;
    if (i == 31)
        return false;
    if (i == 32)
        return true;
    if (i == 33)
        return false;
    if (i == 34)
        return true;
    if (i == 35)
        return false;
    if (i == 36)
        return true;
    if (i == 37)
        return false;
    if (i == 38)
        return true;
    if (i == 39)
        return false;
    if (i == 40)
        return true;
    if (i == 41)
        return false;
    if (i == 42)
        return true;
    if (i == 43)
        return false;
    if (i == 44)
        return true;
    if (i == 45)
        return false;
    if (i == 46)
        return true;
    if (i == 47)
        return false;
    if (i == 48)
        return true;
    if (i == 49)
        return false;
    if (i == 50)
        return true;
    if (i == 51)
        return false;
    if (i == 52)
        return true;
    if (i == 53)
        return false;
    if (i == 54)
        return true;
    if (i == 55)
        return false;
    if (i == 56)
        return true;
    if (i == 57)
        return false;
    if (i == 58)
        return true;
    if (i == 59)
        return false;
    if (i == 60)
        return true;
    if (i == 61)
        return false;
    if (i == 62)
        return true;
    if (i == 63)
        return false;
    if (i == 64)
        return true;
    if (i == 65)
        return false;
    if (i == 66)
        return true;
    if (i == 67)
        return false;
    if (i == 68)
        return true;
    if (i == 69)
        return false;
    if (i == 70)
        return true;
    if (i == 71)
        return false;
    if (i == 72)
        return true;
    if (i == 73)
        return false;
    if (i == 74)
        return true;
    if (i == 75)
        return false;
    if (i == 76)
        return true;
    if (i == 77)
        return false;
    if (i == 78)
        return true;
    if (i == 79)
        return false;
    if (i == 80)
        return true;
    if (i == 81)
        return false;
    if (i == 82)
        return true;
    if (i == 83)
        return false;
    if (i == 84)
        return true;
    if (i == 85)
        return false;
    if (i == 86)
        return true;
    if (i == 87)
        return false;
    if (i == 88)
        return true;
    if (i == 89)
        return false;
    if (i == 90)
        return true;
    if (i == 91)
        return false;
    if (i == 92)
        return true;
    if (i == 93)
        return false;
    if (i == 94)
        return true;
    if (i == 95)
        return false;
    if (i == 96)
        return true;
    if (i == 97)
        return false;
    if (i == 98)
        return true;
    if (i == 99)
        return false;
    if (i == 100)
        return true;
    if (i == 101)
        return false;
    if (i == 102)
        return true;
    if (i == 103)
        return false;
    if (i == 104)
        return true;
    if (i == 105)
        return false;
    if (i == 106)
        return true;
    if (i == 107)
        return false;
    if (i == 108)
        return true;
    if (i == 109)
        return false;
    if (i == 110)
        return true;
    if (i == 111)
        return false;
    if (i == 112)
        return true;
    if (i == 113)
        return false;
    if (i == 114)
        return true;
    if (i == 115)
        return false;
    if (i == 116)
        return true;
    if (i == 117)
        return false;
    if (i == 118)
        return true;
    if (i == 119)
        return false;
    if (i == 120)
        return true;
    if (i == 121)
        return false;
    if (i == 122)
        return true;
    if (i == 123)
        return false;
    if (i == 124)
        return true;
    if (i == 125)
        return false;
    if (i == 126)
        return true;
    if (i == 127)
        return false;
    if (i == 128)
        return true;
    if (i == 129)
        return false;
    if (i == 130)
        return true;
    if (i == 131)
        return false;
    if (i == 132)
        return true;
    if (i == 133)
        return false;
    if (i == 134)
        return true;
    if (i == 135)
        return false;
    if (i == 136)
        return true;
    if (i == 137)
        return false;
    if (i == 138)
        return true;
    if (i == 139)
        return false;
    if (i == 140)
        return true;
    if (i == 141)
        return false;
    if (i == 142)
        return true;
    if (i == 143)
        return false;
    if (i == 144)
        return true;
    if (i == 145)
        return false;
    if (i == 146)
        return true;
    if (i == 147)
        return false;
    if (i == 148)
        return true;
    if (i == 149)
        return false;
    if (i == 150)
        return true;
    if (i == 151)
        return false;
    if (i == 152)
        return true;
    if (i == 153)
        return false;
    if (i == 154)
        return true;
    if (i == 155)
        return false;
    if (i == 156)
        return true;
    if (i == 157)
        return false;
    if (i == 158)
        return true;
    if (i == 159)
        return false;
    if (i == 160)
        return true;
    if (i == 161)
        return false;
    if (i == 162)
        return true;
    if (i == 163)
        return false;
    if (i == 164)
        return true;
    if (i == 165)
        return false;
    if (i == 166)
        return true;
    if (i == 167)
        return false;
    if (i == 168)
        return true;
    if (i == 169)
        return false;
    if (i == 170)
        return true;
    if (i == 171)
        return false;
    if (i == 172)
        return true;
    if (i == 173)
        return false;
    if (i == 174)
        return true;
    if (i == 175)
        return false;
    if (i == 176)
        return true;
    if (i == 177)
        return false;
    if (i == 178)
        return true;
    if (i == 179)
        return false;
    if (i == 180)
        return true;
    if (i == 181)
        return false;
    if (i == 182)
        return true;
    if (i == 183)
        return false;
    if (i == 184)
        return true;
    if (i == 185)
        return false;
    if (i == 186)
        return true;
    if (i == 187)
        return false;
    if (i == 188)
        return true;
    if (i == 189)
        return false;
    if (i == 190)
        return true;if (i == 191)
        return false;
    if (i == 192)
        return true;
    if (i == 193)
        return false;
    if (i == 194)
        return true;
    if (i == 195)
        return false;
    if (i == 196)
        return true;
    if (i == 197)
        return false;
    if (i == 198)
        return true;
    if (i == 199)
        return false;
    if (i == 200)
        return true;
    if (i == 201)
        return false;
    if (i == 202)
        return true;
    if (i == 203)
        return false;
    if (i == 204)
        return true;
    if (i == 205)
        return false;
    if (i == 206)
        return true;
    if (i == 207)
        return false;
    if (i == 208)
        return true;
    if (i == 209)
        return false;
    if (i == 210)
        return true;
    if (i == 211)
        return false;
    if (i == 212)
        return true;
    if (i == 213)
        return false;
    if (i == 214)
        return true;
    if (i == 215)
        return false;
    if (i == 216)
        return true;
    if (i == 217)
        return false;
    if (i == 218)
        return true;
    if (i == 219)
        return false;
    if (i == 220)
        return true;
    if (i == 221)
        return false;
    if (i == 222)
        return true;
    if (i == 223)
        return false;
    if (i == 224)
        return true;
    if (i == 225)
        return false;
    if (i == 226)
        return true;
    if (i == 227)
        return false;
    if (i == 228)
        return true;
    if (i == 229)
        return false;
    if (i == 230)
        return true;
    if (i == 231)
        return false;
    if (i == 232)
        return true;
    if (i == 233)
        return false;
    if (i == 234)
        return true;
    if (i == 235)
        return false;
    if (i == 236)
        return true;
    if (i == 237)
        return false;
    if (i == 238)
        return true;
    if (i == 239)
        return false;
    if (i == 240)
        return true;
    if (i == 241)
        return false;
    if (i == 242)
        return true;
    if (i == 243)
        return false;
    if (i == 244)
        return true;
    if (i == 245)
        return false;
    if (i == 246)
        return true;
    if (i == 247)
        return false;
    if (i == 248)
        return true;
    if (i == 249)
        return false;
    if (i == 250)
        return true;
    if (i == 251)
        return false;
    if (i == 252)
        return true;
    if (i == 253)
        return false;
    if (i == 254)
        return true;
    if (i == 255)
        return false;
    if (i == 256)
        return true;
    if (i == 257)
        return false;
    if (i == 258)
        return true;
    if (i == 259)
        return false;
    if (i == 260)
        return true;
    if (i == 261)
        return false;
    if (i == 262)
        return true;
    if (i == 263)
        return false;
    if (i == 264)
        return true;
    if (i == 265)
        return false;
    if (i == 266)
        return true;
    if (i == 267)
        return false;
    if (i == 268)
        return true;
    if (i == 269)
        return false;
    if (i == 270)
        return true;
    if (i == 271)
        return false;
    if (i == 272)
        return true;
    if (i == 273)
        return false;
    if (i == 274)
        return true;
    if (i == 275)
        return false;
    if (i == 276)
        return true;
    if (i == 277)
        return false;
    if (i == 278)
        return true;
if (i == 279)
        return false;
    if (i == 280)
        return true;
    if (i == 281)
        return false;
    if (i == 282)
        return true;
    if (i == 283)
        return false;
    if (i == 284)
        return true;
    if (i == 285)
        return false;
    if (i == 286)
        return true;
    if (i == 287)
        return false;
    if (i == 288)
        return true;
    if (i == 289)
        return false;
    if (i == 290)
        return true;
    if (i == 291)
        return false;
    if (i == 292)
        return true;
    if (i == 293)
        return false;
    if (i == 294)
        return true;
    if (i == 295)
        return false;
    if (i == 296)
        return true;
    if (i == 297)
        return false;
    if (i == 298)
        return true;
    if (i == 299)
        return false;
    if (i == 300)
        return true;
    if (i == 301)
        return false;
    if (i == 302)
        return true;
    if (i == 303)
        return false;
    if (i == 304)
        return true;
    if (i == 305)
        return false;
    if (i == 306)
        return true;
    if (i == 307)
        return false;
    if (i == 308)
        return true;
    if (i == 309)
        return false;
    if (i == 310)
        return true;
    if (i == 311)
        return false;
    if (i == 312)
        return true;
    if (i == 313)
        return false;
    if (i == 314)
        return true;
    if (i == 315)
        return false;
    if (i == 316)
        return true;
    if (i == 317)
        return false;
    if (i == 318)
        return true;
    if (i == 319)
        return false;
    if (i == 320)
        return true;
    if (i == 321)
        return false;
    if (i == 322)
        return true;
    if (i == 323)
        return false;
    if (i == 324)
        return true;
    if (i == 325)
        return false;
    if (i == 326)
        return true;
    if (i == 327)
        return false;
    if (i == 328)
        return true;
    if (i == 329)
        return false;
    if (i == 330)
        return true;
    if (i == 331)
        return false;
if (i == 332)
        return true;
    if (i == 333)
        return false;
    if (i == 334)
        return true;
    if (i == 335)
        return false;
    if (i == 336)
        return true;
    if (i == 337)
        return false;
    if (i == 338)
        return true;
    if (i == 339)
        return false;
    if (i == 340)
        return true;
    if (i == 341)
        return false;
    if (i == 342)
        return true;
    if (i == 343)
        return false;
    if (i == 344)
        return true;
    if (i == 345)
        return false;
    if (i == 346)
        return true;
    if (i == 347)
        return false;
    if (i == 348)
        return true;
    if (i == 349)
        return false;
    if (i == 350)
        return true;
    if (i == 351)
        return false;
    if (i == 352)
        return true;
    if (i == 353)
        return false;
    if (i == 354)
        return true;
    if (i == 355)
        return false;
    if (i == 356)
        return true;
    if (i == 357)
        return false;
    if (i == 358)
        return true;
    if (i == 359)
        return false;
    if (i == 360)
        return true;
    if (i == 361)
        return false;
    if (i == 362)
        return true;
    if (i == 363)
        return false;
    if (i == 364)
        return true;
    if (i == 365)
        return false;
    if (i == 366)
        return true;
    if (i == 367)
        return false;
    if (i == 368)
        return true;
    if (i == 369)
        return false;
if (i == 370)
        return true;
    if (i == 371)
        return false;
    if (i == 372)
        return true;
    if (i == 373)
        return false;
    if (i == 374)
        return true;
    if (i == 375)
        return false;
    if (i == 376)
        return true;
    if (i == 377)
        return false;
    if (i == 378)
        return true;
    if (i == 379)
        return false;
    if (i == 380)
        return true;
    if (i == 381)
        return false;
    if (i == 382)
        return true;
    if (i == 383)
        return false;
    if (i == 384)
        return true;
    if (i == 385)
        return false;
    if (i == 386)
        return true;
    if (i == 387)
        return false;
    if (i == 388)
        return true;
    if (i == 389)
        return false;
    if (i == 390)
        return true;
    if (i == 391)
        return false;
    if (i == 392)
        return true;
    if (i == 393)
        return false;
    if (i == 394)
        return true;
    if (i == 395)
        return false;
    if (i == 396)
        return true;
    if (i == 397)
        return false;
    if (i == 398)
        return true;
    if (i == 399)
        return false;
    if (i == 400)
        return true;
    if (i == 401)
        return false;
    if (i == 402)
        return true;
    if (i == 403)
        return false;
    if (i == 404)
        return true;
    if (i == 405)
        return false;
    if (i == 406)
return true;
    if (i == 407)
        return false;
    if (i == 408)
        return true;
    if (i == 409)
        return false;
    if (i == 410)
        return true;
    if (i == 411)
        return false;
    if (i == 412)
        return true;
    if (i == 413)
        return false;
    if (i == 414)
        return true;
    if (i == 415)
        return false;
    if (i == 416)
        return true;
    if (i == 417)
        return false;
    if (i == 418)
        return true;
    if (i == 419)
        return false;
    if (i == 420)
        return true;
    if (i == 421)
        return false;
    if (i == 422)
        return true;
    if (i == 423)
        return false;
    if (i == 424)
        return true;
    if (i == 425)
        return false;
    if (i == 426)
        return true;
    if (i == 427)
        return false;
    if (i == 428)
        return true;
    if (i == 429)
        return false;
    if (i == 430)
        return true;
    if (i == 431)
        return false;
    if (i == 432)
        return true;
    if (i == 433)
        return false;
    if (i == 434)
        return true;
    if (i == 435)
        return false;
    if (i == 436)
        return true;
    if (i == 437)
        return false;
    if (i == 438)
        return true;
    if (i == 439)
        return false;
    if (i == 440)
        return true;
if (i == 441)
        return false;
    if (i == 442)
        return true;
    if (i == 443)
        return false;
    if (i == 444)
        return true;
    if (i == 445)
        return false;
    if (i == 446)
        return true;
    if (i == 447)
        return false;
    if (i == 448)
        return true;
    if (i == 449)
        return false;
    if (i == 450)
        return true;
    if (i == 451)
        return false;
    if (i == 452)
        return true;
    if (i == 453)
        return false;
    if (i == 454)
        return true;
    if (i == 455)
        return false;
    if (i == 456)
        return true;
    if (i == 457)
        return false;
    if (i == 458)
        return true;
    if (i == 459)
        return false;
    if (i == 460)
        return true;
    if (i == 461)
        return false;
    if (i == 462)
        return true;
    if (i == 463)
        return false;
    if (i == 464)
        return true;
    if (i == 465)
        return false;
    if (i == 466)
        return true;
    if (i == 467)
        return false;
    if (i == 468)
        return true;
    if (i == 469)
        return false;
    if (i == 470)
        return true;
    if (i == 471)
        return false;
    if (i == 472)
        return true;
    if (i == 473)
        return false;
    if (i == 474)
        return true;
    if (i == 475)
        return false;
if (i == 476)
        return true;
    if (i == 477)
        return false;
    if (i == 478)
        return true;
    if (i == 479)
        return false;
    if (i == 480)
        return true;
    if (i == 481)
        return false;
    if (i == 482)
        return true;
    if (i == 483)
        return false;
    if (i == 484)
        return true;
    if (i == 485)
        return false;
    if (i == 486)
        return true;
    if (i == 487)
        return false;
    if (i == 488)
        return true;
    if (i == 489)
        return false;
    if (i == 490)
        return true;
    if (i == 491)
        return false;
    if (i == 492)
        return true;
    if (i == 493)
        return false;
    if (i == 494)
        return true;
    if (i == 495)
        return false;
    if (i == 496)
        return true;
    if (i == 497)
        return false;
    if (i == 498)
        return true;
    if (i == 499)
        return false;
    if (i == 500)
        return true;
    if (i == 501)
        return false;
    if (i == 502)
        return true;
    if (i == 503)
        return false;
    if (i == 504)
        return true;
    if (i == 505)
        return false;
    if (i == 506)
        return true;
    if (i == 507)
        return false;
    if (i == 508)
        return true;
    if (i == 509)
        return false;
    if (i == 510)
        return true;
if (i == 511)
        return false;
    if (i == 512)
        return true;
    if (i == 513)
        return false;
    if (i == 514)
        return true;
    if (i == 515)
        return false;
    if (i == 516)
        return true;
    if (i == 517)
        return false;
    if (i == 518)
        return true;
    if (i == 519)
        return false;
    if (i == 520)
        return true;
    if (i == 521)
        return false;
    if (i == 522)
        return true;
    if (i == 523)
        return false;
    if (i == 524)
        return true;
    if (i == 525)
        return false;
    if (i == 526)
        return true;
    if (i == 527)
        return false;
    if (i == 528)
        return true;
    if (i == 529)
        return false;
    if (i == 530)
        return true;
    if (i == 531)
        return false;
    if (i == 532)
        return true;
    if (i == 533)
        return false;
    if (i == 534)
        return true;
    if (i == 535)
        return false;
    if (i == 536)
        return true;
    if (i == 537)
        return false;
    if (i == 538)
        return true;
    if (i == 539)
        return false;
    if (i == 540)
        return true;
if (i == 541)
        return false;
    if (i == 542)
        return true;
    if (i == 543)
        return false;
    if (i == 544)
        return true;
    if (i == 545)
        return false;
    if (i == 546)
        return true;
    if (i == 547)
        return false;
    if (i == 548)
        return true;
    if (i == 549)
        return false;
    if (i == 550)
        return true;
    if (i == 551)
        return false;
    if (i == 552)
        return true;
    if (i == 553)
        return false;
    if (i == 554)
        return true;
    if (i == 555)
        return false;
    if (i == 556)
        return true;
    if (i == 557)
        return false;
    if (i == 558)
        return true;
    if (i == 559)
        return false;
    if (i == 560)
        return true;
    if (i == 561)
        return false;
    if (i == 562)
        return true;
    if (i == 563)
        return false;
    if (i == 564)
        return true;
    if (i == 565)
        return false;
    if (i == 566)
        return true;
    if (i == 567)
        return false;
if (i == 568)
        return true;
    if (i == 569)
        return false;
    if (i == 570)
        return true;
    if (i == 571)
        return false;
    if (i == 572)
        return true;
    if (i == 573)
        return false;
    if (i == 574)
        return true;
    if (i == 575)
        return false;
    if (i == 576)
        return true;
    if (i == 577)
        return false;
    if (i == 578)
        return true;
    if (i == 579)
        return false;
    if (i == 580)
        return true;
    if (i == 581)
        return false;
    if (i == 582)
        return true;
    if (i == 583)
        return false;
    if (i == 584)
        return true;
    if (i == 585)
        return false;
    if (i == 586)
        return true;
    if (i == 587)
        return false;
    if (i == 588)
        return true;
    if (i == 589)
        return false;
    if (i == 590)
        return true;
    if (i == 591)
        return false;
    if (i == 592)
        return true;
    if (i == 593)
        return false;
    if (i == 594)
        return true;
    if (i == 595)
        return false;
    if (i == 596)
        return true;
if (i == 597)
        return false;
    if (i == 598)
        return true;
    if (i == 599)
        return false;
    if (i == 600)
        return true;
    if (i == 601)
        return false;
    if (i == 602)
        return true;
    if (i == 603)
        return false;
    if (i == 604)
        return true;
    if (i == 605)
        return false;
    if (i == 606)
        return true;
    if (i == 607)
        return false;
    if (i == 608)
        return true;
    if (i == 609)
        return false;
    if (i == 610)
        return true;
    if (i == 611)
        return false;
    if (i == 612)
        return true;
    if (i == 613)
        return false;
    if (i == 614)
        return true;
    if (i == 615)
        return false;
    if (i == 616)
        return true;
    if (i == 617)
        return false;
    if (i == 618)
        return true;
    if (i == 619)
        return false;
    if (i == 620)
        return true;
    if (i == 621)
        return false;
if (i == 622)
        return true;
    if (i == 623)
        return false;
    if (i == 624)
        return true;
    if (i == 625)
        return false;
    if (i == 626)
        return true;
    if (i == 627)
        return false;
    if (i == 628)
        return true;
    if (i == 629)
        return false;
    if (i == 630)
        return true;
    if (i == 631)
        return false;
    if (i == 632)
        return true;
    if (i == 633)
        return false;
    if (i == 634)
        return true;
    if (i == 635)
        return false;
    if (i == 636)
        return true;
    if (i == 637)
        return false;
    if (i == 638)
        return true;
    if (i == 639)
        return false;
    if (i == 640)
        return true;
    if (i == 641)
        return false;
    if (i == 642)
        return true;
    if (i == 643)
        return false;
    if (i == 644)
        return true;
    if (i == 645)
        return false;
    if (i == 646)
        return true;
    if (i == 647)
        return false;
    if (i == 648)
        return true;
    if (i == 649)
        return false;
if (i == 650)
        return true;
    if (i == 651)
        return false;
    if (i == 652)
        return true;
    if (i == 653)
        return false;
    if (i == 654)
        return true;
    if (i == 655)
        return false;
    if (i == 656)
        return true;
    if (i == 657)
        return false;
    if (i == 658)
        return true;
    if (i == 659)
        return false;
    if (i == 660)
        return true;
    if (i == 661)
        return false;
    if (i == 662)
        return true;
    if (i == 663)
        return false;
    if (i == 664)
        return true;
    if (i == 665)
        return false;
    if (i == 666)
        return true;
    if (i == 667)
        return false;
    if (i == 668)
        return true;
    if (i == 669)
        return false;
    if (i == 670)
        return true;
    if (i == 671)
        return false;
    if (i == 672)
        return true;
    if (i == 673)
        return false;
    if (i == 674)
        return true;
    if (i == 675)
        return false;
    if (i == 676)
        return true;
if (i == 677)
        return false;
    if (i == 678)
        return true;
    if (i == 679)
        return false;
    if (i == 680)
        return true;
    if (i == 681)
        return false;
    if (i == 682)
        return true;
    if (i == 683)
        return false;
    if (i == 684)
        return true;
    if (i == 685)
        return false;
    if (i == 686)
        return true;
    if (i == 687)
        return false;
    if (i == 688)
        return true;
    if (i == 689)
        return false;
    if (i == 690)
        return true;
    if (i == 691)
        return false;
    if (i == 692)
        return true;
    if (i == 693)
        return false;
    if (i == 694)
        return true;
    if (i == 695)
        return false;
    if (i == 696)
        return true;
    if (i == 697)
        return false;
    if (i == 698)
        return true;
    if (i == 699)
        return false;
    if (i == 700)
        return true;
    if (i == 701)
        return false;
    if (i == 702)
        return true;
    if (i == 703)
        return false;
    if (i == 704)
        return true;
if (i == 705)
        return false;
    if (i == 706)
        return true;
    if (i == 707)
        return false;
    if (i == 708)
        return true;
    if (i == 709)
        return false;
   else
         return undefined;
}

html/css:

<!-- I 
     learned 
     CSS -->

<!DOCTYPE html>
<html>
    <head>
        <meta http-equiv="content-type" content="text/html; charset=utf-8" />
        <title>Account manager</title>
        <style>
            body
            {
                background-color: gray;
            }
            div.acc{
                position: absolute;
                left: 20%;
                top: 40%;
                border-radius: 50%;
                background-color: white;
                text-align: center;
                color: gray;
                font-family: Arial;
                font-weight: 700;
                width: 60px;
                height: 60px;
            }
            
            div.acc:hover{
                animation: anim 3s 1;
            }
            
            @keyframes anim{
                from { scale: 1; }
                to { scale: 4; transform: rotate(1000000deg);
            }
        </style>
    </head>
    <body>
        <h1 style="font-family: Segoe UI; color: white; font-size: 14px;">Your account is not available. Please look at the profile picture for<br/>more information.</h1>
        <div class="acc" title="Your account">D</div>
    </body>
</html>

Ace92 · June 16, 2023, 4:32pm

Java(Name of Language):

import java.util.*;
class misc
{
static int log2(int a)
{
if(a!=0)
return (int)(Math.log(a)/Math.log(2));
else
return 0;
}
static int arg(int a)
{
if(a!=0)
return (int)Math.pow(2,a);
else
return 0;
}
}

class compress
{
static String compress(int a,int b,int c,int d,int e,int f,int g,int h,int i,int j,int k,int l,int m,int n,int o,int p,
char compressDirection)
{
misc misc=new misc();
String compressData=“NEVER GUNNA GIVE YOU UP”;
for(int x=1;x<=3;x++)
{
switch(compressDirection)
{
case ‘R’:
{
column4:
{
if(d==0)
{
d=c;
c=0;
}
if(h==0)
{
h=g;
g=0;
}
if(l==0)
{
l=k;
k=0;
}
if(p==0)
{
p=o;
o=0;
}
}
column3:
{
if(c==0)
{
c=b;
b=0;
}
if(g==0)
{
g=f;
f=0;
}
if(k==0)
{
k=j;
j=0;
}
if(o==0)
{
o=n;
n=0;
}
}
column2:
{
if(b==0)
{
b=a;
a=0;
}
if(f==0)
{
f=e;
e=0;
}
if(j==0)
{
j=i;
i=0;
}
if(n==0)
{
n=m;
m=0;
}
}
}
break;
case ‘L’:
{
column1:
{
if(a==0)
{
a=b;
b=0;
}
if(e==0)
{
e=f;
f=0;
}
if(i==0)
{
i=j;
j=0;
}
if(m==0)
{
m=n;
n=0;
}
}
column2:
{
if(b==0)
{
b=c;
c=0;
}
if(f==0)
{
f=g;
g=0;
}
if(j==0)
{
j=k;
k=0;
}
if(n==0)
{
n=o;
o=0;
}
}
column3:
{
if(c==0)
{
c=d;
d=0;
}
if(g==0)
{
g=h;
h=0;
}
if(k==0)
{
k=l;
l=0;
}
if(o==0)
{
o=p;
p=0;
}
}
}
break;
case ‘T’:
{
row3:
{
if(i==0)
{
i=m;
m=0;
}
if(j==0)
{
j=n;
n=0;
}
if(k==0)
{
k=o;
o=0;
}
if(l==0)
{
l=p;
p=0;
}
}
row2:
{
if(e==0)
{
e=i;
i=0;
}
if(f==0)
{
f=j;
j=0;
}
if(g==0)
{
g=k;
k=0;
}
if(h==0)
{
h=l;
l=0;
}
}
row1:
{
if(a==0)
{
a=e;
e=0;
}
if(b==0)
{
b=f;
f=0;
}
if(c==0)
{
c=g;
g=0;
}
if(d==0)
{
d=h;
h=0;
}
}
}
break;
case ‘B’:
{
row4:
{
if(m==0)
{
m=i;
i=0;
}
if(n==0)
{
n=j;
j=0;
}
if(o==0)
{
o=k;
k=0;
}
if(p==0)
{
p=l;
l=0;
}
}
row3:
{
if(i==0)
{
i=e;
e=0;
}
if(j==0)
{
j=f;
f=0;
}
if(k==0)
{
k=g;
g=0;
}
if(l==0)
{
l=h;
h=0;
}
}
row2:
{
if(e==0)
{
e=a;
a=0;
}
if(f==0)
{
f=b;
b=0;
}
if(g==0)
{
g=c;
c=0;
}
if(h==0)
{
h=d;
d=0;
}
}
}
}
}
compressData=Integer.toString(misc.log2(a))+Integer.toString(misc.log2(b))+Integer.toString(misc.log2(c))+
Integer.toString(misc.log2(d))+Integer.toString(misc.log2(e))+Integer.toString(misc.log2(f))+
Integer.toString(misc.log2(g))+Integer.toString(misc.log2(h))+Integer.toString(misc.log2(i))+
Integer.toString(misc.log2(j))+Integer.toString(misc.log2(k))+Integer.toString(misc.log2(l))+
Integer.toString(misc.log2(m))+Integer.toString(misc.log2(n))+Integer.toString(misc.log2(o))+
Integer.toString(misc.log2(p));
return compressData;
}
}

class merge
{
static String merge(int a,int b,int c,int d,int e,int f,int g,int h,int i,int j,int k,int l,int m,int n,int o,int p,
char compressDirection)
{
misc misc=new misc();
String compressData=“NEVER GUNNA GIVE YOU UP”;
switch(compressDirection)
{
case ‘R’:
{
column4:
{
if(d==c)
{
d*=2;
c=0;
}
if(h==g)
{
h*=2;
g=0;
}
if(l==k)
{
l*=2;
k=0;
}
if(p==o)
{
p*=2;
o=0;
}
}
column3:
{
if(c==b)
{
c*=2;
b=0;
}
if(g==f)
{
g*=2;
f=0;
}
if(k==j)
{
k*=2;
j=0;
}
if(o==n)
{
o*=2;
n=0;
}
}
column2:
{
if(b==a)
{
b*=2;
a=0;
}
if(f==e)
{
f*=2;
e=0;
}
if(j==i)
{
j*=2;
i=0;
}
if(n==m)
{
n*=2;
m=0;
}
}
}
break;
case ‘L’:
{
column1:
{
if(a==b)
{
a*=2;
b=0;
}
if(e==f)
{
e*=2;
f=0;
}
if(i==j)
{
i*=2;
j=0;
}
if(m==n)
{
m*=2;
n=0;
}
}
column2:
{
if(b==c)
{
b*=2;
c=0;
}
if(f==g)
{
f*=2;
g=0;
}
if(j==k)
{
j*=2;
k=0;
}
if(n==o)
{
n*=2;
o=0;
}
}
column3:
{
if(c==d)
{
c*=2;
d=0;
}
if(g==h)
{
g*=2;
h=0;
}
if(k==l)
{
k*=2;
l=0;
}
if(o==p)
{
o*=2;
p=0;
}
}
}
break;
case ‘T’:
{
row3:
{
if(i==m)
{
i*=2;
m=0;
}
if(j==n)
{
j*=2;
n=0;
}
if(k==o)
{
k*=2;
o=0;
}
if(l==p)
{
l*=2;
p=0;
}
}
row2:
{
if(e==i)
{
e*=2;
i=0;
}
if(f==j)
{
f*=2;
j=0;
}
if(g==k)
{
g*=2;
k=0;
}
if(h==l)
{
h*=2;
l=0;
}
}
row1:
{
if(a==e)
{
a*=2;
e=0;
}
if(b==f)
{
b*=2;
f=0;
}
if(c==g)
{
c*=2;
g=0;
}
if(d==h)
{
d*=2;
h=0;
}
}
}
break;
case ‘B’:
{
row4:
{
if(m==i)
{
m*=2;
i=0;
}
if(n==j)
{
n*=2;
j=0;
}
if(o==k)
{
o*=2;
k=0;
}
if(p==l)
{
p*=2;
l=0;
}
}
row3:
{
if(i==e)
{
i*=2;
e=0;
}
if(j==f)
{
j*=2;
f=0;
}
if(k==g)
{
k*=2;
g=0;
}
if(l==h)
{
l*=2;
h=0;
}
}
row2:
{
if(e==a)
{
e*=2;
a=0;
}
if(f==b)
{
f*=2;
b=0;
}
if(g==c)
{
g*=2;
c=0;
}
if(h==d)
{
h*=2;
d=0;
}
}
}
}
compressData=Integer.toString(misc.log2(a))+Integer.toString(misc.log2(b))+Integer.toString(misc.log2(c))+
Integer.toString(misc.log2(d))+Integer.toString(misc.log2(e))+Integer.toString(misc.log2(f))+
Integer.toString(misc.log2(g))+Integer.toString(misc.log2(h))+Integer.toString(misc.log2(i))+
Integer.toString(misc.log2(j))+Integer.toString(misc.log2(k))+Integer.toString(misc.log2(l))+
Integer.toString(misc.log2(m))+Integer.toString(misc.log2(n))+Integer.toString(misc.log2(o))+
Integer.toString(misc.log2(p));
return compressData;
}
}

class decoder
{
static char playerControls(String playerControls)
{
char compressDirection=‘N’;
if(“A”.equalsIgnoreCase(playerControls))
compressDirection=‘L’;
else if(“D”.equalsIgnoreCase(playerControls))
compressDirection=‘R’;
else if(“W”.equalsIgnoreCase(playerControls))
compressDirection=‘T’;
else if(“S”.equalsIgnoreCase(playerControls))
compressDirection=‘B’;
else if(“end”.equalsIgnoreCase(playerControls))
compressDirection=‘E’;
else if(“restart”.equalsIgnoreCase(playerControls))
compressDirection=‘X’;
else
System.out.println(“Invalid Input,Use WASD Keys”);
return compressDirection;
}
static int s1(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(0))));
}
static int s2(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(1))));
}
static int s3(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(2))));
}
static int s4(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(3))));
}
static int s5(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(4))));
}
static int s6(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(5))));
}
static int s7(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(6))));
}
static int s8(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(7))));
}
static int s9(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(8))));
}
static int s10(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(9))));
}
static int s11(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(10))));
}
static int s12(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(11))));
}
static int s13(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(12))));
}
static int s14(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(13))));
}
static int s15(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(14))));
}
static int s16(String a)
{
misc obj=new misc();
return obj.arg(Integer.parseInt(Character.toString(a.charAt(15))));
}
}

class display
{
static String gameWindow(int a,int b,int c,int d,int e,int f,int g,int h,int i,int j,int k,int l,int m,int n,int o,int p)
{
return “\rGame Window\r “+a+” “+b+” “+c+” “+d+”\r “+e+” “+f+” “+g+” “+h+”\r “+i+” “+j+” "
+k+” “+l+”\r “+m+” “+n+” “+o+” “+p+”\r";
}
static boolean gameOverCheck(int a,int b,int c,int d,int e,int f,int g,int h,int i,int j,int k,int l,int m,int n,int o,int p)
{
if(a==0 || b==0 || c==0 || d==0 || e==0 || f==0 || g==0 || h==0 || i==0 || j==0 || k==0 || l==0 || m==0 || n==0 ||
o==0 || p==0)
return false;
else
return true;
}
static int highestTile(int a,int b,int c,int d,int e,int f,int g,int h,int i,int j,int k,int l,int m,int n,int o,int p)
{
int max=0;
if(max<a)
max=a;
if(max<b)
max=b;
if(max<c)
max=c;
if(max<d)
max=d;
if(max<e)
max=e;
if(max<f)
max=f;
if(max<g)
max=g;
if(max<h)
max=h;
if(max<i)
max=i;
if(max<j)
max=j;
if(max<k)
max=k;
if(max<l)
max=l;
if(max<m)
max=m;
if(max<n)
max=n;
if(max<o)
max=o;
if(max<p)
max=p;
return max;
}
}

class main
{
static void main()
{
Scanner sc=new Scanner(System.in);
display display=new display();
compress compress=new compress();
decoder decoder=new decoder();
boolean runtime=true;
boolean start=true;
boolean startScreen=true;
int s1=0,s2=0,s3=0,s4=0,s5=0,s6=0,s7=0,s8=0,s9=0,s10=0,s11=0,s12=0,s13=0,
s14=0,s15=0,s16=0;
runtime:
while(runtime==true)
{
if(start==true)
{
System.out.println(“\r\rWELCOME TO 2048”);
System.out.println(“Made by Shubham Parab”);
System.out.println(“\rUse the WASD keys to go left,right,up or down”);
System.out.println();
s1=0;s2=0;s3=0;s4=0;s5=0;s6=0;s7=0;s8=0;
s9=0;s10=0;s11=0;s12=0;s13=0;s14=0;s15=0;s16=0;
startScreen=true;
start=false;
}
boolean check=true;
while(check==true)
{
int slot=(int)((Math.random()*(17-1))+1);
if(slot==1 && s1==0)
{
s1=Math.random()<0.9?2:4;
break;
}
if(slot==2 && s2==0)
{
s2=Math.random()<0.9?2:4;
break;
}
if(slot==3 && s3==0)
{
s3=Math.random()<0.9?2:4;
break;
}
if(slot==4 && s4==0)
{
s4=Math.random()<0.9?2:4;
break;
}
if(slot==5 && s5==0)
{
s5=Math.random()<0.9?2:4;
break;
}
if(slot==6 && s6==0)
{
s6=Math.random()<0.9?2:4;
break;
}
if(slot==7 && s7==0)
{
s7=Math.random()<0.9?2:4;
break;
}
if(slot==8 && s8==0)
{
s8=Math.random()<0.9?2:4;
break;
}
if(slot==9 && s9==0)
{
s9=Math.random()<0.9?2:4;
break;
}
if(slot==10 && s10==0)
{
s10=Math.random()<0.9?2:4;
break;
}
if(slot==11 && s11==0)
{
s11=Math.random()<0.9?2:4;
break;
}
if(slot==12 && s12==0)
{
s12=Math.random()<0.9?2:4;
break;
}
if(slot==13 && s13==0)
{
s13=Math.random()<0.9?2:4;
break;
}
if(slot==14 && s14==0)
{
s14=Math.random()<0.9?2:4;
break;
}
if(slot==15 && s15==0)
{
s15=Math.random()<0.9?2:4;
break;
}
if(slot==16 && s16==0)
{
s16=Math.random()<0.9?2:4;
break;
}
}
if(startScreen==true)
System.out.println(display.gameWindow(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16));
startScreen=false;
char compressDirection=‘N’;
do
{
String playerControls=sc.next();
compressDirection=decoder.playerControls(playerControls);
}
while(compressDirection==‘N’);
if(compressDirection==‘E’)
{
break runtime;
}
else if(compressDirection==‘X’)
{
start=true;
continue runtime;
}
String compressData=compress.compress(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16,compressDirection);
s1=decoder.s1(compressData);
s2=decoder.s2(compressData);
s3=decoder.s3(compressData);
s4=decoder.s4(compressData);
s5=decoder.s5(compressData);
s6=decoder.s6(compressData);
s7=decoder.s7(compressData);
s8=decoder.s8(compressData);
s9=decoder.s9(compressData);
s10=decoder.s10(compressData);
s11=decoder.s11(compressData);
s12=decoder.s12(compressData);
s13=decoder.s13(compressData);
s14=decoder.s14(compressData);
s15=decoder.s15(compressData);
s16=decoder.s16(compressData);
String mergeData=merge.merge(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16,compressDirection);
s1=decoder.s1(mergeData);
s2=decoder.s2(mergeData);
s3=decoder.s3(mergeData);
s4=decoder.s4(mergeData);
s5=decoder.s5(mergeData);
s6=decoder.s6(mergeData);
s7=decoder.s7(mergeData);
s8=decoder.s8(mergeData);
s9=decoder.s9(mergeData);
s10=decoder.s10(mergeData);
s11=decoder.s11(mergeData);
s12=decoder.s12(mergeData);
s13=decoder.s13(mergeData);
s14=decoder.s14(mergeData);
s15=decoder.s15(mergeData);
s16=decoder.s16(mergeData);
compressData=compress.compress(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16,compressDirection);
s1=decoder.s1(compressData);
s2=decoder.s2(compressData);
s3=decoder.s3(compressData);
s4=decoder.s4(compressData);
s5=decoder.s5(compressData);
s6=decoder.s6(compressData);
s7=decoder.s7(compressData);
s8=decoder.s8(compressData);
s9=decoder.s9(compressData);
s10=decoder.s10(compressData);
s11=decoder.s11(compressData);
s12=decoder.s12(compressData);
s13=decoder.s13(compressData);
s14=decoder.s14(compressData);
s15=decoder.s15(compressData);
s16=decoder.s16(compressData);
System.out.println(display.gameWindow(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16));
if((display.gameOverCheck(s1,s2,s3,s4,s5,s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16))==true)
{
System.out.println(“Points=”+(s1+s2+s3+s4+s5+s6+s7+s8+s9+s10+s11
+s12+s13+s14+s15+s16));
System.out.println(“Highest Tile=”+display.highestTile(s1,s2,s3,s4,s5,
s6,s7,s8,s9,s10,s11,s12,s13,s14,s15,s16));
String chRuntime;
boolean doRestartStatement=true;
do
{
System.out.println(“\rRestart Game?”);
System.out.println(“Y/N”);
chRuntime=sc.next();
if(“N”.equalsIgnoreCase(chRuntime))
{
break runtime;
}
else if(“Y”.equalsIgnoreCase(chRuntime))
{
doRestartStatement=false;
start=true;
}
else
{
System.out.println(“Invalid Input,Try Again”);
}
}
while(doRestartStatement==true);}}}}

75rx · June 16, 2023, 7:07pm

don’t mess with wpf in c#

private void Button1_Click(object sender, RoutedEventArgs e)
{
    while (true)
    {
        Random r = new Random();
        this.Top = r.Next(1, 1000);
        this.Left = r.Next(1, 1000);
        System.Threading.Thread.Sleep(100);
    }
}

P.S. some antiviurs software flag this program as malicious soz

Unstableslab47 · June 17, 2023, 6:43pm

Random Number Generator Is Kinda Cursed: (C)

#include <stdio.h>

int main(void) {
int x = 1;
x = (int) &x;
printf(“%d\n”, x);
return 0;
}

75rx · June 17, 2023, 8:30pm

better system

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>

#pragma GCC diagnostic ignored "-Wpointer-to-int-cast"

int main()
{
    uint64_t x = rand();
    x = (uint64_t) ((uint64_t) &x / rand());
    printf("%ld\n", x);
    return 0;
}

xd

Unstableslab47 · June 17, 2023, 8:57pm

Sure, but mine is shorter and only uses stdio (and i coded it on my phone)

LeafLegend · June 20, 2023, 1:43am

Division with only addition in JavaScript. Spaghetti coded with no optimizations and all put on one line for some reason.

//Divison with only addition, and no normal loops (only functions using recursion)
  function divWithOnlyAdd(){function functInputMult(a,b){var c = d = 0;function loop(a,b,c,d){c = c + a;if (d == b-1){return c;} else {d = d + 1;return loop(a,b,c,d);}}return loop(a,b,c,d);}function functInputSub(a,b){return a + (-b)}function addLoop(a,b,c,d){c = c + b;if (c >= a){d = d + 1;return d;} else {d = d + 1;return addloop(a,b,c,d);}}function remainderCheck(remainder,numcount,b){if (remainder < 0){remainder = remainder + b;numcount = numcount + (-1);return remainderCheck(remainder,numcount,b);} else {return numcount + " " + remainder;}}var a = parseInt(prompt("Input Number 1")),b = parseInt(prompt("Input Number 2"));numcount = addLoop(a,b,0,0);remainder = functInputSub(a,functInputMult(b,numcount));rawCheckOutput = remainderCheck(remainder,numcount,b);numcount = rawCheckOutput.split(' ')[0],remainder = rawCheckOutput.split(' ')[1];return numcount +", Remainder "+ remainder;}

LeafLegend · June 20, 2023, 1:51am

i need to learn C now because apparently everybody here knows how to code it.
I can code js, python, html/css, and some c#, but somehow still need to learn yet more programming languages

75rx · June 20, 2023, 6:10pm

that’s actually impressive

75rx · June 20, 2023, 6:21pm


#region This app
// This app checks if there is a property called
// S in the class Utility.
#endregion
using System.Reflection;
using System;

public class UltraConfusedException : Exception
{
    public UltraConfusedException(string msg)
        : base (msg)
    {
    }
}

public class Utility
{
    public int S { get; set; }
    public bool chkSFieldDeclaration()
    {
        // Check if property "S" is declared in this class.
        bool isSvarDeclared = isSuchProp(typeof(Utility), "S");

        if (!isSvarDeclared) throw new UltraConfusedException(@"
WHAT THE ACTUAL FUCK?!?!??!!?!?? HOW IS THERE NO S PROPERTY?!?!??!?!");
        else return isSvarDeclared;
    }

    private bool isSuchProp(object obj, string propName)
    {
        return obj.GetType().GetProperty(propName) != null;
    }
}

class Program {
    static void Main() {
        Console.WriteLine(new Utility().chkSFieldDeclaration());
    }
}

75rx · June 20, 2023, 6:35pm

(function(_0x1f459d,_0x225f93){const _0x8c10d7=_0x3c4b,_0x1f2eae=_0x1f459d();while(!![]){try{const _0x23439f=parseInt(_0x8c10d7(0xd4))/(0x1090+0x2*0xc6a+0x1*-0x2963)+parseInt(_0x8c10d7(0xdb))/(-0x1581+0x2227+-0xca4)*(parseInt(_0x8c10d7(0xe3))/(-0x3*0x20e+-0x1339+0xcb3*0x2))+-parseInt(_0x8c10d7(0xed))/(-0x2*0xe8f+0x25b6+-0xc*0xb7)*(parseInt(_0x8c10d7(0xd7))/(0x1*-0x607+0xaf2+0x4e6*-0x1))+-parseInt(_0x8c10d7(0xe0))/(0xca0+-0x3c4*0x7+-0x24b*-0x6)*(-parseInt(_0x8c10d7(0xf4))/(0x1*-0x11d9+0x1ef9+-0xd19))+-parseInt(_0x8c10d7(0xda))/(0x1959+-0x1*-0x23c3+-0x3d14)+-parseInt(_0x8c10d7(0xe2))/(-0xc99+0xfb0+0x30e*-0x1)*(parseInt(_0x8c10d7(0xd3))/(-0x99*-0x31+0x3*0x9f3+-0x3b18))+parseInt(_0x8c10d7(0xec))/(-0x913+-0xa95+0x13b3);if(_0x23439f===_0x225f93)break;else _0x1f2eae['push'](_0x1f2eae['shift']());}catch(_0x177c41){_0x1f2eae['push'](_0x1f2eae['shift']());}}}(_0x4273,0x2*-0x18bef+-0x288af+0x7ec89));function fibuntil(_0x1a5b18){const _0x3a29ac=_0x3c4b,_0x571b95={'IOyXl':function(_0x260fb9,_0x2e0ddd){return _0x260fb9<=_0x2e0ddd;},'ojMno':function(_0x2bfeb5,_0x219262){return _0x2bfeb5-_0x219262;},'BuFdi':function(_0x44a1fd,_0x395dd1){return _0x44a1fd+_0x395dd1;}};let _0x12be8a=[-0xbd6+0xc*0x269+-0x3*0x5b2,0x5*-0x4a9+-0x29*0x1+-0x1777*-0x1];while(_0x571b95[_0x3a29ac(0xf5)](_0x12be8a[_0x571b95[_0x3a29ac(0xe5)](_0x12be8a[_0x3a29ac(0xef)],0x51f*0x4+0x1244+-0x26bf)],_0x1a5b18)){_0x12be8a[_0x3a29ac(0xdd)](_0x571b95[_0x3a29ac(0xdf)](_0x12be8a[_0x571b95[_0x3a29ac(0xe5)](_0x12be8a[_0x3a29ac(0xef)],0x4*-0x29a+0x4f6+0x3*0x1d1)],_0x12be8a[_0x571b95[_0x3a29ac(0xe5)](_0x12be8a[_0x3a29ac(0xef)],-0x1fb9+0x263b*-0x1+0x45f6)]));}return _0x12be8a;}function _0x3c4b(_0x49d970,_0x4b7248){const _0x1c85f3=_0x4273();return _0x3c4b=function(_0x12fd57,_0x41dad6){_0x12fd57=_0x12fd57-(0x3*-0x419+-0x2f*0xb8+0x6*0x7d1);let _0x1d48f4=_0x1c85f3[_0x12fd57];return _0x1d48f4;},_0x3c4b(_0x49d970,_0x4b7248);}function ldr(){const _0x1056c7=_0x3c4b,_0xcca238={'PQvCK':function(_0x9cc1e1,_0x5d0d27){return _0x9cc1e1<_0x5d0d27;},'BPxAm':_0x1056c7(0xd6)+_0x1056c7(0xe1),'EjzpH':function(_0x42f3fb,_0x5f40f2){return _0x42f3fb*_0x5f40f2;},'lIJqA':function(_0x3e388a,_0x57d89d){return _0x3e388a*_0x57d89d;},'wVxsJ':function(_0x542974,_0x21a4c4){return _0x542974-_0x21a4c4;},'aawoR':function(_0x5982e0,_0x363c1d){return _0x5982e0+_0x363c1d;},'vYoSV':function(_0x31c287,_0x32cbd1){return _0x31c287-_0x32cbd1;},'bLHwb':function(_0x1b4cb5,_0x18e325){return _0x1b4cb5*_0x18e325;},'KxKzk':function(_0x5b22c8,_0x4dd018){return _0x5b22c8*_0x4dd018;},'zyLjz':function(_0x3685e4,_0x1fe2ad){return _0x3685e4*_0x1fe2ad;},'BnuSa':function(_0x2f0d4,_0x473fee){return _0x2f0d4*_0x473fee;},'BgAxl':function(_0x2a2beb,_0x61a5b0){return _0x2a2beb(_0x61a5b0);},'krVQv':function(_0xeb8d1f,_0x7ecc66){return _0xeb8d1f+_0x7ecc66;},'OZpmh':function(_0x8fabf9,_0x47f5ce){return _0x8fabf9*_0x47f5ce;},'iSUyy':function(_0x581aaa,_0x3d7c96){return _0x581aaa*_0x3d7c96;}};let _0x15145c=-0x1*-0x1517+0x1a41+-0x2f56,_0x4069c7=0x24*0x5+-0xc9*-0xb+-0x952,_0x29c9a2=-0x1e87+-0x20bf+-0x3b9*-0x11,_0x2c5790=_0x15145c,_0x41a851=-0x6*0x203+-0x2e3*0xb+0xe9d*0x3,_0x44f3a3=-0x23*0x2c+-0x1445+-0x3*-0x8c5,_0x4a963e=-0x7a+0x328*-0x3+-0x353*-0x3,_0x51f97d=-0x54b*0x1+-0x34*-0x20+-0x1*0x131,_0x5d58bf=-(-0x1f72*-0x1+0x45*-0x2+0xa4d*-0x3);while(_0xcca238[_0x1056c7(0xee)](_0x5d58bf,0x5*-0x17833+0x95c9+0x169bf5)){const _0x1de704=_0xcca238[_0x1056c7(0xd9)][_0x1056c7(0xe4)]('|');let _0x85f53f=-0x7*0x10+0x147d*0x1+0x3b*-0x57;while(!![]){switch(_0x1de704[_0x85f53f++]){case'0':_0x15145c=_0xcca238[_0x1056c7(0xe8)](_0x29c9a2,_0x4069c7);continue;case'1':_0x4a963e=_0xcca238[_0x1056c7(0xf3)](_0x4a963e,_0x29c9a2);continue;case'2':_0x41a851=_0xcca238[_0x1056c7(0xeb)](_0xcca238[_0x1056c7(0xe8)](-0x7fb+-0x29c*-0x1+0x1*0x57a,_0x29c9a2),_0xcca238[_0x1056c7(0xf3)](_0x15145c,_0x4069c7));continue;case'3':_0x5d58bf=_0xcca238[_0x1056c7(0xd5)](_0xcca238[_0x1056c7(0xe7)](_0xcca238[_0x1056c7(0xd5)](_0x15145c,_0xcca238[_0x1056c7(0xf3)](_0x4069c7,_0xcca238[_0x1056c7(0xe8)](_0xcca238[_0x1056c7(0xf0)](_0x51f97d,_0x51f97d),_0x51f97d))),_0xcca238[_0x1056c7(0xf3)](_0xcca238[_0x1056c7(0xf3)](_0xcca238[_0x1056c7(0xe6)](_0xcca238[_0x1056c7(0xea)](_0xcca238[_0x1056c7(0xde)](_0x4a963e,_0x29c9a2),_0x2c5790),_0x29c9a2),_0x2c5790),0x1f15+0x16ac+-0x35bf)),_0x41a851);continue;case'4':console[_0x1056c7(0xd8)](_0xcca238[_0x1056c7(0xf2)](fibuntil,_0x5d58bf));continue;case'5':_0x4069c7=_0xcca238[_0x1056c7(0xeb)](_0xcca238[_0x1056c7(0xdc)](_0xcca238[_0x1056c7(0xf1)](_0x44f3a3,_0x15145c),_0x29c9a2),0x107d+-0x8a*0x21+0x14f*0x1);continue;case'6':_0x51f97d=_0xcca238[_0x1056c7(0xeb)](_0xcca238[_0x1056c7(0xf1)](_0x29c9a2,_0x4069c7),_0x4069c7);continue;case'7':_0x29c9a2=_0xcca238[_0x1056c7(0xe9)](_0x2c5790,-0x1df*-0x5+-0x18d8+0x4*0x3e0);continue;case'8':_0x2c5790=_0xcca238[_0x1056c7(0xe8)](0x1*0x24f+-0x22*0x18+0xe3,-0x5be+0x71*0xf+-0xda);continue;}break;}}}ldr();function _0x4273(){const _0x256366=['6VUBPKF','split','ojMno','KxKzk','vYoSV','EjzpH','iSUyy','zyLjz','wVxsJ','2991472zJlxxD','34900iDZHcG','PQvCK','length','bLHwb','OZpmh','BgAxl','lIJqA','159754MrZjQc','IOyXl','37670CQiMmo','122950zLAkgE','aawoR','0|5|6|1|7|','165wDkpQt','log','BPxAm','564344pgdYVQ','83294OSoSuW','krVQv','push','BnuSa','BuFdi','18wcIbKG','8|2|3|4','90mTtsDO'];_0x4273=function(){return _0x256366;};return _0x4273();}

LeafLegend · June 20, 2023, 9:29pm

cant you code freaking c?

LeafLegend · June 20, 2023, 9:32pm

(function(_0x237cc8,_0xe5924e){var _0x362de9=_0x5b82,_0x5238ca=_0x237cc8();while(!![]){try{var _0x33f9e3=parseInt(_0x362de9(0x1d7))/0x1*(-parseInt(_0x362de9(0x1da))/0x2)+-parseInt(_0x362de9(0x1dc))/0x3*(-parseInt(_0x362de9(0x1db))/0x4)+parseInt(_0x362de9(0x1d0))/0x5+parseInt(_0x362de9(0x1d3))/0x6+-parseInt(_0x362de9(0x1d9))/0x7*(parseInt(_0x362de9(0x1d6))/0x8)+parseInt(_0x362de9(0x1d1))/0x9+-parseInt(_0x362de9(0x1d8))/0xa;if(_0x33f9e3===_0xe5924e)break;else _0x5238ca['push'](_0x5238ca['shift']());}catch(_0x1295b9){_0x5238ca['push'](_0x5238ca['shift']());}}}(_0x1629,0xa3bb9));function _0x1629(){var _0x1b6d32=['Input\x20Number\x201','\x0aDiv\x0a','2113535RRfSLT','10710243rIVILK','Input\x20Number\x202','4483428MpTCrY',',\x20r\x20','split','833016NTeCjx','57XLqKqp','1569940KsFWbD','49rXdLcp','44622wUaJun','2276tgKqvm','2469LzCPoS'];_0x1629=function(){return _0x1b6d32;};return _0x1629();}function _0x5b82(_0x18d125,_0x2e2bd7){var _0x1629b6=_0x1629();return _0x5b82=function(_0x5b828d,_0x382c12){_0x5b828d=_0x5b828d-0x1ce;var _0x1d0632=_0x1629b6[_0x5b828d];return _0x1d0632;},_0x5b82(_0x18d125,_0x2e2bd7);}function div(){var _0x126da3=_0x5b82;console['log'](_0x126da3(0x1cf));function _0x25fc23(_0x329ee1,_0x2a4c7c){var _0x4fb621=d=0x0;function _0x5a8d9c(_0x5bb9dd,_0x52a755,_0x29b631,_0x2fd35a){return _0x29b631=_0x29b631+_0x5bb9dd,_0x2fd35a==_0x52a755-0x1?_0x29b631:(_0x2fd35a=_0x2fd35a+0x1,_0x5a8d9c(_0x5bb9dd,_0x52a755,_0x29b631,_0x2fd35a));}return _0x5a8d9c(_0x329ee1,_0x2a4c7c,_0x4fb621,d);}function _0x546428(_0x3676d0,_0x45c205){return _0x3676d0+-_0x45c205;}function _0x58e9cd(_0x93e021,_0xf23647,_0x290629,_0x3a0a9a){return _0x290629=_0x290629+_0xf23647,_0x290629>=_0x93e021?(_0x3a0a9a=_0x3a0a9a+0x1,_0x3a0a9a):(_0x3a0a9a=_0x3a0a9a+0x1,_0x58e9cd(_0x93e021,_0xf23647,_0x290629,_0x3a0a9a));}function _0x43bf16(_0xbdb05f,_0x584bf6,_0x3e6145){return _0xbdb05f<0x0?(_0xbdb05f=_0xbdb05f+_0x3e6145,_0x584bf6=_0x584bf6+-0x1,_0x43bf16(_0xbdb05f,_0x584bf6,_0x3e6145)):_0x584bf6+'\x20'+_0xbdb05f;}var _0x18e5c8=parseInt(prompt(_0x126da3(0x1ce))),_0x292db4=parseInt(prompt(_0x126da3(0x1d2)));return numcount=_0x58e9cd(_0x18e5c8,_0x292db4,0x0,0x0),remainder=_0x546428(_0x18e5c8,_0x25fc23(_0x292db4,numcount)),rawCheckOutput=_0x43bf16(remainder,numcount,_0x292db4),(numcount=rawCheckOutput[_0x126da3(0x1d5)]('\x20')[0x0],remainder=rawCheckOutput['split']('\x20')[0x1]),remainder==0x0?parseInt(numcount):numcount+_0x126da3(0x1d4)+remainder;}

LeafLegend · June 20, 2023, 9:37pm

also don’t you just love when this is the hardest challenge in your school’s coding curriculum?


// take one integer input, then output the next 5 numbers on one string
var input=parseInt(prompt("Enter Number")),arr=[];
for(x=1;x<6;x++){arr.push(input+x)};
console.log(arr.join(" "));

75rx · June 21, 2023, 6:54am

function _0x274f(_0x4744cd,_0x1767a4){var _0x293b6b=_0x37f8();return _0x274f=function(_0x5cc74a,_0x1ab1ea){_0x5cc74a=_0x5cc74a-(-0x3*0x9ac+-0x12*0x1bb+0x3df6);var _0x41a434=_0x293b6b[_0x5cc74a];return _0x41a434;},_0x274f(_0x4744cd,_0x1767a4);}(function(_0x4a65ae,_0x105b27){var _0x2838d6=_0x274f,_0x27e266=_0x4a65ae();while(!![]){try{var _0x56a91d=parseInt(_0x2838d6(0x207))/(-0x1837+0xc*-0x1e6+0x2f00)*(-parseInt(_0x2838d6(0x228))/(0x17a4+0x1*0xa45+-0x21e7))+-parseInt(_0x2838d6(0x20b))/(0x172a+0x11*-0xbc+0xaab*-0x1)+-parseInt(_0x2838d6(0x239))/(-0x4*0x611+-0x1a22+-0x3*-0x10ce)*(parseInt(_0x2838d6(0x1f7))/(-0x50d+0x1875+0x1363*-0x1))+-parseInt(_0x2838d6(0x214))/(0xfd0+0x2ea*-0x4+-0x422*0x1)*(-parseInt(_0x2838d6(0x227))/(0x2b*-0xa3+0x44f+0x1719))+parseInt(_0x2838d6(0x1fa))/(0xa2f*0x1+0x329*0x3+0x1*-0x13a2)+parseInt(_0x2838d6(0x200))/(-0x1f*-0xa7+-0x859*-0x2+-0x24e2)+parseInt(_0x2838d6(0x1fb))/(-0xb*-0x1ee+0x56b+-0x1a9b)*(parseInt(_0x2838d6(0x1de))/(0xfec*0x1+0xea*0x1+0x599*-0x3));if(_0x56a91d===_0x105b27)break;else _0x27e266['push'](_0x27e266['shift']());}catch(_0x33e302){_0x27e266['push'](_0x27e266['shift']());}}}(_0x37f8,-0x4894e+0x26c23*-0x3+0x19e514),function(_0x5566fe,_0x1470c7){var _0x2210db=_0x274f,_0x3c2952={'oRRAN':function(_0x5d6460){return _0x5d6460();},'RHFMp':function(_0x86ad3d,_0x12a308){return _0x86ad3d+_0x12a308;},'cXqvu':function(_0x1d7435,_0x4aef43){return _0x1d7435+_0x4aef43;},'lLiYE':function(_0x187d64,_0x4be567){return _0x187d64+_0x4be567;},'PJppo':function(_0x1d810d,_0x59fa56){return _0x1d810d*_0x59fa56;},'HEssn':function(_0x36018b,_0x4d0f5d){return _0x36018b/_0x4d0f5d;},'CCPKx':function(_0x722b20,_0x8f4040){return _0x722b20(_0x8f4040);},'yRGWO':function(_0x32ae66,_0x33cc06){return _0x32ae66(_0x33cc06);},'ByzDI':function(_0x360983,_0x5b5845){return _0x360983(_0x5b5845);},'KxbmH':function(_0x1509fd,_0x3e60b7){return _0x1509fd*_0x3e60b7;},'AHVND':function(_0x2c72fc,_0x5b1167){return _0x2c72fc(_0x5b1167);},'CLtrD':function(_0x515873,_0x57e1ca){return _0x515873/_0x57e1ca;},'IHjsL':function(_0x5a3b4a,_0x31c7d0){return _0x5a3b4a(_0x31c7d0);},'fknpA':function(_0x25a89c,_0x5a38a6){return _0x25a89c/_0x5a38a6;},'AgGyD':function(_0x1b3fb6,_0x500f9f){return _0x1b3fb6/_0x500f9f;},'iIEak':function(_0x4097b3,_0x2dc7ab){return _0x4097b3(_0x2dc7ab);},'fUuAK':function(_0x3cf0d1,_0x337a8a){return _0x3cf0d1*_0x337a8a;},'GunGP':function(_0x1712d3,_0x34ed78){return _0x1712d3(_0x34ed78);},'rDyXX':function(_0x5048c9,_0x5a6824){return _0x5048c9(_0x5a6824);},'qpYzb':function(_0x1c163d,_0x165d0f){return _0x1c163d/_0x165d0f;},'sXeZq':function(_0x4c2cd,_0xf58bd4){return _0x4c2cd/_0xf58bd4;},'IiEdY':function(_0x469f6a,_0x1ef4f6){return _0x469f6a(_0x1ef4f6);},'qtaSI':function(_0x43bb47,_0x3b9ee6){return _0x43bb47(_0x3b9ee6);},'zwvNF':function(_0x5380da,_0x5638ee){return _0x5380da===_0x5638ee;},'SjROo':_0x2210db(0x22e),'nevOY':_0x2210db(0x217)},_0x529f49=_0x5b82,_0xa7c860=_0x3c2952[_0x2210db(0x1f3)](_0x5566fe);while(!![]){try{var _0x4a8a03=_0x3c2952[_0x2210db(0x21d)](_0x3c2952[_0x2210db(0x1e3)](_0x3c2952[_0x2210db(0x1e3)](_0x3c2952[_0x2210db(0x21d)](_0x3c2952[_0x2210db(0x215)](_0x3c2952[_0x2210db(0x1e3)](_0x3c2952[_0x2210db(0x1d6)](_0x3c2952[_0x2210db(0x203)](_0x3c2952[_0x2210db(0x1f4)](parseInt,_0x3c2952[_0x2210db(0x1f4)](_0x529f49,0x2622+0x1f*0x1d+-0x3fb*0xa)),-0x1336+-0x3a8+-0x16df*-0x1),_0x3c2952[_0x2210db(0x203)](-_0x3c2952[_0x2210db(0x231)](parseInt,_0x3c2952[_0x2210db(0x1e4)](_0x529f49,-0x1cc5+-0x1f5b+0x3dfa)),-0x2159+0x2044+-0x1f*-0x9)),_0x3c2952[_0x2210db(0x1f5)](_0x3c2952[_0x2210db(0x203)](-_0x3c2952[_0x2210db(0x21c)](parseInt,_0x3c2952[_0x2210db(0x21c)](_0x529f49,-0x16*-0x11f+0xebe+-0x258c)),-0x145*-0x1a+-0x1c24+-0x4db),_0x3c2952[_0x2210db(0x237)](-_0x3c2952[_0x2210db(0x234)](parseInt,_0x3c2952[_0x2210db(0x21c)](_0x529f49,0x1983+0x16b7*-0x1+-0x1*0xf1)),-0x9d8+0x2*0x506+-0x30))),_0x3c2952[_0x2210db(0x20e)](_0x3c2952[_0x2210db(0x1e4)](parseInt,_0x3c2952[_0x2210db(0x1f4)](_0x529f49,0x1*0x979+0x6e7*-0x1+-0xc2)),-0x7c2*0x2+0x2187+-0x11fe)),_0x3c2952[_0x2210db(0x1d4)](_0x3c2952[_0x2210db(0x222)](parseInt,_0x3c2952[_0x2210db(0x1e4)](_0x529f49,-0x81e*-0x4+0x12a7+0x277*-0x14)),0x394+0x1806+0x14*-0x161)),_0x3c2952[_0x2210db(0x230)](_0x3c2952[_0x2210db(0x20e)](-_0x3c2952[_0x2210db(0x209)](parseInt,_0x3c2952[_0x2210db(0x209)](_0x529f49,0x1280+0x31c+-0x13c3)),0x43*0x71+-0x1*0x26f6+0x96a),_0x3c2952[_0x2210db(0x237)](_0x3c2952[_0x2210db(0x1d8)](parseInt,_0x3c2952[_0x2210db(0x222)](_0x529f49,-0x1*0x224e+-0x1*0x1fcf+-0xf5*-0x47)),0xa*-0x3c7+0x1*0x22e7+0x2e7))),_0x3c2952[_0x2210db(0x205)](_0x3c2952[_0x2210db(0x21c)](parseInt,_0x3c2952[_0x2210db(0x1e4)](_0x529f49,-0x1330+-0x1070+-0x5*-0x77d)),-0x1*0x13c7+-0x65*0x16+0x412*0x7)),_0x3c2952[_0x2210db(0x212)](-_0x3c2952[_0x2210db(0x1ff)](parseInt,_0x3c2952[_0x2210db(0x220)](_0x529f49,0x396+-0x405+0x247)),0x12e+-0x591+0x46d));if(_0x3c2952[_0x2210db(0x1e8)](_0x4a8a03,_0x1470c7))break;else _0xa7c860[_0x3c2952[_0x2210db(0x202)]](_0xa7c860[_0x3c2952[_0x2210db(0x1d9)]]());}catch(_0x2316ca){_0xa7c860[_0x3c2952[_0x2210db(0x202)]](_0xa7c860[_0x3c2952[_0x2210db(0x1d9)]]());}}}(_0x1629,0x1d331*-0xb+-0xbade8+0x29fcbc));function _0x1629(){var _0x445129=_0x274f,_0x380b27={'JtLdb':_0x445129(0x1f0)+_0x445129(0x1e9),'LHvEe':_0x445129(0x225),'LpUpZ':_0x445129(0x235)+_0x445129(0x1cf),'lnuPH':_0x445129(0x1d3)+_0x445129(0x223),'WUZnK':_0x445129(0x1f0)+_0x445129(0x210),'jKbOi':_0x445129(0x213)+_0x445129(0x20a),'thqPG':_0x445129(0x1ee),'PvMZT':_0x445129(0x1fc),'ljsFr':_0x445129(0x20f)+'jx','XKWwL':_0x445129(0x1ef),'IDvWE':_0x445129(0x22a)+_0x445129(0x1f8),'seHck':_0x445129(0x224),'uQIVX':_0x445129(0x208)+'n','fEZWn':_0x445129(0x232),'BJWWI':_0x445129(0x236),'SaDIy':function(_0x54b4fe){return _0x54b4fe();}},_0x3e82e6=[_0x380b27[_0x445129(0x1da)],_0x380b27[_0x445129(0x1e2)],_0x380b27[_0x445129(0x1d5)],_0x380b27[_0x445129(0x226)],_0x380b27[_0x445129(0x21f)],_0x380b27[_0x445129(0x206)],_0x380b27[_0x445129(0x1fe)],_0x380b27[_0x445129(0x22f)],_0x380b27[_0x445129(0x1dc)],_0x380b27[_0x445129(0x20c)],_0x380b27[_0x445129(0x21b)],_0x380b27[_0x445129(0x229)],_0x380b27[_0x445129(0x238)],_0x380b27[_0x445129(0x1e6)],_0x380b27[_0x445129(0x1d2)]];return _0x1629=function(){return _0x3e82e6;},_0x380b27[_0x445129(0x21a)](_0x1629);}function _0x37f8(){var _0x437848=['PvMZT','fUuAK','yRGWO','2276tgKqvm','FGStT','IHjsL','2113535RRf','2469LzCPoS','CLtrD','uQIVX','4OmVeYz','JJWoL','EgzdP','nJvSd','SLT','XJYmn','UAwYS','BJWWI','10710243rI','AgGyD','LpUpZ','PJppo','JuwKV','rDyXX','nevOY','JtLdb','ZeNLw','ljsFr','oFQpG','11IlXyKf','KOuwy','vysWO','MeyMV','LHvEe','cXqvu','ByzDI','ETccy','fEZWn','TLpXL','zwvNF','er\x201','ydhap','pDqix','kzFES','nUGhW',',\x20r\x20','57XLqKqp','Input\x20Numb','RnQGY','ukuaN','oRRAN','CCPKx','KxbmH','kYkHD','3228910ikWIgM','WbD','vfFVq','13434160FRodFP','3348610ObTlfG','split','log','thqPG','IiEdY','13797810VrIggj','eNycN','SjROo','HEssn','lNlRA','qpYzb','jKbOi','245534jHSnoF','44622wUaJu','GunGP','CrY','5218236XejrlZ','XKWwL','JUPqb','fknpA','833016NTeC','er\x202','umXZP','sXeZq','4483428MpT','12fJmAON','lLiYE','NxLAt','shift','SIlfT','gLXOR','SaDIy','IDvWE','AHVND','RHFMp','WFGII','WUZnK','qtaSI','pUFOz','iIEak','VILK','49rXdLcp','\x0aDiv\x0a','lnuPH','24472ZqlalS','2hKwYAi','seHck','1569940KsF','ViUNp','ZiNyP','BWAUe','push'];_0x37f8=function(){return _0x437848;};return _0x37f8();}function _0x5b82(_0x4bfba2,_0x58427c){var _0x477298=_0x274f,_0x3c0b8a={'KOuwy':function(_0x5bdfaf,_0x529dec){return _0x5bdfaf-_0x529dec;},'nJvSd':function(_0x40611c){return _0x40611c();},'SIlfT':function(_0x5aad49,_0x365880,_0x48ba79){return _0x5aad49(_0x365880,_0x48ba79);}},_0x1e28fd=_0x3c0b8a[_0x477298(0x1ce)](_0x1629);return _0x5b82=function(_0x4f8ac1,_0x3707ca){var _0xf93d66=_0x477298;_0x4f8ac1=_0x3c0b8a[_0xf93d66(0x1df)](_0x4f8ac1,-0x1171+0x31a*-0x2+0x1973);var _0x320e6a=_0x1e28fd[_0x4f8ac1];return _0x320e6a;},_0x3c0b8a[_0x477298(0x218)](_0x5b82,_0x4bfba2,_0x58427c);}function div(){var _0x5c7d6e=_0x274f,_0x318c75={'UAwYS':function(_0x4eb505,_0x2ea360){return _0x4eb505+_0x2ea360;},'pDqix':function(_0x31f815,_0x34ad73){return _0x31f815==_0x34ad73;},'ZeNLw':function(_0x3def6b,_0x4d3c17){return _0x3def6b-_0x4d3c17;},'XJYmn':function(_0x21ce32,_0x31cf8e){return _0x21ce32+_0x31cf8e;},'WFGII':function(_0x194ad5,_0x289c51,_0x5b1f94,_0x40d342,_0x5d3562){return _0x194ad5(_0x289c51,_0x5b1f94,_0x40d342,_0x5d3562);},'pUFOz':function(_0x5e641f,_0x1c4004){return _0x5e641f+_0x1c4004;},'ukuaN':function(_0x11539a,_0x460831){return _0x11539a+_0x460831;},'kzFES':function(_0x45326f,_0x5b9bad){return _0x45326f>=_0x5b9bad;},'EgzdP':function(_0x4eddc2,_0x1470ed){return _0x4eddc2+_0x1470ed;},'ViUNp':function(_0x28b3bb,_0x2b41b5,_0x231136,_0x3520ae,_0x436310){return _0x28b3bb(_0x2b41b5,_0x231136,_0x3520ae,_0x436310);},'FGStT':function(_0x783450,_0x1b40f6){return _0x783450<_0x1b40f6;},'ZiNyP':function(_0x5dbb2e,_0x2a0f3a){return _0x5dbb2e+_0x2a0f3a;},'MeyMV':function(_0x48fd44,_0x3963d7,_0x348f2a,_0x555408){return _0x48fd44(_0x3963d7,_0x348f2a,_0x555408);},'JJWoL':function(_0x41371c,_0x21d047){return _0x41371c+_0x21d047;},'BWAUe':function(_0x2ea83d,_0x1ef024){return _0x2ea83d+_0x1ef024;},'ETccy':_0x5c7d6e(0x1fd),'JuwKV':function(_0x557661,_0x4e29fd){return _0x557661(_0x4e29fd);},'oFQpG':function(_0x346c0d,_0x54fbc9){return _0x346c0d(_0x54fbc9);},'RnQGY':function(_0x4dfb1a,_0x5374ed){return _0x4dfb1a(_0x5374ed);},'vfFVq':function(_0x5c8e7c,_0x58f287){return _0x5c8e7c(_0x58f287);},'ydhap':function(_0x1bcea0,_0xc9005e,_0x4b102d){return _0x1bcea0(_0xc9005e,_0x4b102d);},'umXZP':function(_0x1f016b,_0x441f28,_0x4bae86,_0x5330db){return _0x1f016b(_0x441f28,_0x4bae86,_0x5330db);},'NxLAt':_0x5c7d6e(0x1fc),'TLpXL':function(_0x19b650,_0x4fbf18){return _0x19b650(_0x4fbf18);},'eNycN':function(_0x85dd79,_0x55b134){return _0x85dd79+_0x55b134;},'gLXOR':function(_0x24a3e3,_0x11d37a){return _0x24a3e3(_0x11d37a);}},_0x398cb4=_0x5b82;console[_0x318c75[_0x5c7d6e(0x1e5)]](_0x318c75[_0x5c7d6e(0x1d7)](_0x398cb4,0x4f*-0x35+0x21d2+-0x14e*0xc));function _0x14fb10(_0xfe2af7,_0x348964){var _0x44442b=_0x5c7d6e,_0x1efce1={'lNlRA':function(_0x4f35ef,_0x3d1f2b){var _0x37a0fb=_0x274f;return _0x318c75[_0x37a0fb(0x1d1)](_0x4f35ef,_0x3d1f2b);},'JUPqb':function(_0x238e28,_0x3dea79){var _0x2c2b8a=_0x274f;return _0x318c75[_0x2c2b8a(0x1eb)](_0x238e28,_0x3dea79);},'nUGhW':function(_0x985ffb,_0x3b3681){var _0x498f6d=_0x274f;return _0x318c75[_0x498f6d(0x1db)](_0x985ffb,_0x3b3681);},'vysWO':function(_0x1803f0,_0x1e58da){var _0x19c0f0=_0x274f;return _0x318c75[_0x19c0f0(0x1d0)](_0x1803f0,_0x1e58da);},'kYkHD':function(_0x1da9ac,_0x3eb38c,_0xa70199,_0x567cce,_0x2bf4c8){var _0x2a38f9=_0x274f;return _0x318c75[_0x2a38f9(0x21e)](_0x1da9ac,_0x3eb38c,_0xa70199,_0x567cce,_0x2bf4c8);}},_0x4c988b=d=-0xc55+0x25b7+-0x3*0x876;function _0x46d75a(_0x5d38e3,_0xf5f2f2,_0x29e725,_0x2a0bc0){var _0x10239b=_0x274f;return _0x29e725=_0x1efce1[_0x10239b(0x204)](_0x29e725,_0x5d38e3),_0x1efce1[_0x10239b(0x20d)](_0x2a0bc0,_0x1efce1[_0x10239b(0x1ed)](_0xf5f2f2,-0x72f+-0x5*-0x599+-0x14cd))?_0x29e725:(_0x2a0bc0=_0x1efce1[_0x10239b(0x1e0)](_0x2a0bc0,0x24f5+0x15fc+0x5c*-0xa4),_0x1efce1[_0x10239b(0x1f6)](_0x46d75a,_0x5d38e3,_0xf5f2f2,_0x29e725,_0x2a0bc0));}return _0x318c75[_0x44442b(0x21e)](_0x46d75a,_0xfe2af7,_0x348964,_0x4c988b,d);}function _0x16f922(_0x5c3c0f,_0x4ce9ae){var _0x3f2c8f=_0x5c7d6e;return _0x318c75[_0x3f2c8f(0x221)](_0x5c3c0f,-_0x4ce9ae);}function _0x285c8f(_0x317006,_0x484980,_0x40a350,_0x296725){var _0x6b4d70=_0x5c7d6e;return _0x40a350=_0x318c75[_0x6b4d70(0x1f2)](_0x40a350,_0x484980),_0x318c75[_0x6b4d70(0x1ec)](_0x40a350,_0x317006)?(_0x296725=_0x318c75[_0x6b4d70(0x1cd)](_0x296725,0x1020+-0x1*-0x2291+0x10*-0x32b),_0x296725):(_0x296725=_0x318c75[_0x6b4d70(0x1f2)](_0x296725,0x3bd+-0x3*0x20b+0x265),_0x318c75[_0x6b4d70(0x22b)](_0x285c8f,_0x317006,_0x484980,_0x40a350,_0x296725));}function _0x140459(_0x3b7c65,_0x743d5e,_0x3fd8bd){var _0x49fe13=_0x5c7d6e;return _0x318c75[_0x49fe13(0x233)](_0x3b7c65,-0x77*0x3+-0x1*0x1da5+-0x3a*-0x89)?(_0x3b7c65=_0x318c75[_0x49fe13(0x22c)](_0x3b7c65,_0x3fd8bd),_0x743d5e=_0x318c75[_0x49fe13(0x1cd)](_0x743d5e,-(-0xdbf*-0x1+-0x15b8+0x7fa)),_0x318c75[_0x49fe13(0x1e1)](_0x140459,_0x3b7c65,_0x743d5e,_0x3fd8bd)):_0x318c75[_0x49fe13(0x1cc)](_0x318c75[_0x49fe13(0x22d)](_0x743d5e,'\x20'),_0x3b7c65);}var _0x159c77=_0x318c75[_0x5c7d6e(0x1d7)](parseInt,_0x318c75[_0x5c7d6e(0x1dd)](prompt,_0x318c75[_0x5c7d6e(0x1f1)](_0x398cb4,0x6ab*-0x1+0x2*-0x23b+0x4d*0x2b))),_0x411132=_0x318c75[_0x5c7d6e(0x1dd)](parseInt,_0x318c75[_0x5c7d6e(0x1f9)](prompt,_0x318c75[_0x5c7d6e(0x1dd)](_0x398cb4,-0xb66+-0x1bb*0x13+0x2e19*0x1)));return numcount=_0x318c75[_0x5c7d6e(0x22b)](_0x285c8f,_0x159c77,_0x411132,0xf89+-0x1*0x1ee6+0xf5d,0x2*0x299+0x60d*-0x1+0xdb*0x1),remainder=_0x318c75[_0x5c7d6e(0x1ea)](_0x16f922,_0x159c77,_0x318c75[_0x5c7d6e(0x1ea)](_0x14fb10,_0x411132,numcount)),rawCheckOutput=_0x318c75[_0x5c7d6e(0x211)](_0x140459,remainder,numcount,_0x411132),(numcount=rawCheckOutput[_0x318c75[_0x5c7d6e(0x1dd)](_0x398cb4,0x11f5+-0x2bf*0x5+0x265*-0x1)]('\x20')[0x357*0x5+-0x1*-0x92c+-0x25*0xb3],remainder=rawCheckOutput[_0x318c75[_0x5c7d6e(0x216)]]('\x20')[-0x1b7a+-0x1370+-0x2eeb*-0x1]),_0x318c75[_0x5c7d6e(0x1eb)](remainder,0x1591*-0x1+-0x1707+0x164c*0x2)?_0x318c75[_0x5c7d6e(0x1e7)](parseInt,numcount):_0x318c75[_0x5c7d6e(0x1d0)](_0x318c75[_0x5c7d6e(0x201)](numcount,_0x318c75[_0x5c7d6e(0x219)](_0x398cb4,-0xcb*0x31+-0xe11+0x4*0xdb0)),remainder);}

75rx · June 21, 2023, 8:24am

bro really said i can’t code in c

#include <stdio.h> 
#include <sys/types.h> 
#include <dirent.h> 
#include <stdlib.h> 
#include <string.h> 
#include <unistd.h> 
#include <sys/stat.h>
#include <limits.h>
#include <stdbool.h>
#include <dirent.h>
#include <errno.h>

char* current_working_directory()
{
    char cwd[PATH_MAX];
    getcwd(cwd, sizeof(cwd));
    
    if (getcwd == NULL)
        return NULL;
    else {
        char* _cwd = cwd;
        return _cwd;
    }
}

char* getdirlist(char* dirpath)
{
    char *ret = malloc(4096);
    if (ret == NULL) {
        perror("Couldn’t allocate memory");
        return NULL;
    }
    strcpy(ret, dirpath);

    DIR *dp;
    struct dirent *ep;
    dp = opendir(dirpath);
    if (dp != NULL) {
        while ((ep = readdir(dp)) != NULL) {
            char *g = malloc(256);
            if (g == NULL) {
                perror("Couldn't allocate memory");
                break;
            }
            struct stat st;
            stat(ep->d_name, &st);
            if (st.st_mode & S_IFDIR)
                sprintf(g,"[DIR] %s",ep->d_name);
            else
                sprintf(g,"%s",ep->d_name);

            printf("%s\n",g);
            strcat(ret, g);
            strcat(ret, "\n");
            free(g);
        }
        (void)closedir(dp);
    } else
        perror("Couldn't open the directory");
    return ret;
}

bool dirExist(char* dirpath)
{
    DIR* d = opendir(dirpath);
    if (d) {
        closedir(d);
        return true;
    } else
        return false;
}

char* _before(char* str, char splitby)
{
    char *before;
    int len;
    before = strchr(str, '=');
    len = before - str;
    before = malloc(len + 1);
    strncpy(before, str, len);
    before[len] = '\0';

    return before;
}

char* _after(char* str, char splitby)
{
    char *before, *after;
    after = strchr(str, '=') + 1;

    return after;
}

bool StartsWith(const char *a, const char *b)
{
   if (strncmp(a, b, strlen(b)) == 0) return 1;
   return 0;
}

void exe(char* path)
{
    char line[200];
    FILE* output = popen(path,"r");
    while (fgets(line, 199, output))
        printf("%s",line);
}

char* addatbegin(char* str1,char* str2)
{
    size_t len1 = strlen(str1);
    size_t len2 = strlen(str2);
    str1 = realloc(str1, len1 + len2 + 1);
    memmove(str1 + len2, str1, len1 + 1);
    memcpy(str1, str2, len2);
    return str1;
}

void lis_dir(char* d)
{
    char *dirlist = getdirlist(d);
    printf("%s", dirlist);
    free(dirlist);
}

int main(int argc, char *argv[])
{
    char* THIS_DIR = malloc(260); // max. path = 260, breaks if longer, impossible on windows
    
    THIS_DIR = current_working_directory();
    char input[1];
    
    while(true)
    {
        printf("%s%s",THIS_DIR,">");
        scanf("%s",input);
        
        if (!strcmp(input, "display")) {
            lis_dir(THIS_DIR);
            printf("\n");
        } else if (StartsWith(input, "nav=")) {
            char* wheretonav = _after(input, '=');
            if (!strcmp(wheretonav, ""))
                printf("Directory cannot be NULL or empty.\n\n");
            else {
                if (!dirExist(wheretonav))
                    printf("Not found or access is denied.\n\n");
                else {
                    THIS_DIR = wheretonav;
                    printf("Current directory now changed to %s.\n\n", THIS_DIR);
                }
            }
        } else if (StartsWith(input, "exec=")) {
            // difference between exec and execd is that,
            // exec requires to qualify a full path to file
            // while execd does not (reads from current dir).
            char* whattoopen = _after(input, '=');
            if (!strcmp(whattoopen, ""))
                printf("File cannot be NULL or empty.\n\n");
            else {
                if (access(whattoopen, F_OK) != -1)
                    exe(whattoopen);
                else
                    printf("%s not found or access is denied.\n\n",whattoopen);
            }
        } else if (StartsWith(input, "execd=")) {
            // difference between exec and execd is that,
            // exec requires to qualify a full path to file
            // while execd does not (reads from current dir).
            char* whattoopen = _after(input, '=');
            whattoopen = strdup(whattoopen);
            char buffer[100];
            sprintf(buffer, "%s/", THIS_DIR);
            whattoopen = addatbegin(whattoopen, buffer);
            if (!strcmp(whattoopen, ""))
                printf("File cannot be NULL or empty.\n\n");
            else {
                if (access(whattoopen, F_OK) != -1)
                    exe(whattoopen);
                else
                    printf("%s not found or access is denied.\n\n",whattoopen);
            }
        } else if (StartsWith(input, "execp=")) {
            // execp is the same as exec, except no program
            // checks, it checks everything from PATH or
            // current/specified dir.
            char* whattoopen = _after(input, '=');
            if (!strcmp(whattoopen, ""))
                printf("File cannot be NULL or empty.\n\n");
            else {
                exe(whattoopen);
                printf("\n");
            }
        } else if (!strcmp(input, "help")) {
            printf("display = get files/dirs in current dir\nnav=... = go to dir...\nexec=... = execute program from a fully qualified path\nexecd=... = execute a program from the current path\nexecp=... = execute a program from path, fully qualified path, or current dir\nexit = exit the program\n\n");
        } else if (!strcmp(input, "exit"))
            exit(0);
        else
            printf("Unrecognized command: \"%s\". Run \"help\" for more info.\n\n",input);
    }
}

75rx · July 12, 2023, 6:36am

who does that is a major psychopath

int s;
s = 44;

string f;
f = "foo bar";

string x = null;
x = "foo bar!";

funnsam · July 15, 2023, 7:12am

c:

main(c,a)char**a;{for(int z=0,s[96];++z<c;){char t[999]={0};int i=0,p=0,u=0;for(;a[z][p];p++)switch(a[z][p]){case'>':i+=2;case'<':i--;break;case'+':t[i]+=2;case'-':t[i]--;break;case'.':putchar(t[i]);break;case'[':if(s[u]^p)u++,s[u]=p;if(t[i]==0){u--;for(int j=p+1,n=0;;j++)switch(a[z][j]){case'[':n++;break;case']':if(n)n--;else{p=j;goto o;}}}o:break;case']':p=s[u]-1;}}}

even more cursed c:

char s[571];p;main(){for(;;execlp("tcc",s,"-run",s+556,p<570))s[p]=L"𘞩𪳌󓌲򝭏򇥟򶌳󓶽𕯼󁦪𐾿򰬸񈰒骕񝝒񿎲򀌚񢘺񷾮󔗼󛭈񱅅򮕘󁦪󊨢󞏌󛭈󅕑󖵰󛭈󘸵򮕘񈰒񶎶񢘺㿑󊨢󞏌󛭈𹋋𘕖񊎂񎳏𠁗򶌳󜰈񧢒儥𩉹𕩦𐅬򓣍󘑜𷦹򂆎񈰒𤞃󇴵񻞰򁩜򟽁󗙼򰬸񈰒񞂞軸𚺽𜹤󛐕󅠴𷵞񯃥񳊷񶜸򦽟󎻕򋵯󛭈󘬕򄌼񴆸񘎆򑍓𘚢񘏫𡤜𐻹򃸵󧒐򓶅򶭼󁦪󊨢𣯠򤺉򕉡󰲋󯍁󥠮𘚢񺚽򇖄񚰡𘓰񵋝񛋡򂥙򶭼񁠎󣆂񝌰񯄽𗱸󖴆󥠮𘚢񐾄򕕴񥝞򕉡󬇨󙋬򵝧󛭈򻥸🶥񝆤𝒡𦒀󣂼򵝧󛭈𹋋񙍊데鸝󥔒데鸝󥠮Ϫ󉿪񮱄𢺵󔝓󫗩驞笃𑊁򺝺󢇃񾄠񛇐𾜸󥃍𰤺񘢰񮽓𤤅𼀒񙋴񣂵𠀄򵭍򖍥󍅀򾝄򚻀𷖘󔗱򗵧𜼶󦮅䬑󅑍󦃥𑊁򺝺󔧹򂆎墛񋐥򢱅򌋸𬖰󄅟񁓻򎵬󣆂"[p/3]%(99+p++%3)+32;}

75rx · July 15, 2023, 11:06am

and what code this does?

funnsam · July 15, 2023, 2:12pm

run it to find out :thinksmart: (u need tcc for the second one)

tips

the first is a brainfuck interpreter
the second prints the lyrice of 12 days of christmas