previndexinfonext

code guessing, round #34 (completed)

started at ; stage 2 at ; ended at

specification

I'm bored. let's play fizzbuzz. programs can be written in python, rust, haskell, or any text editor.

fizzbuzz is a children's word game and a timeless programming problem. the game is based on a sequence of the positive integers with words divisible by 3 replaced with "Fizz", those divisible by 5 replaced with "Buzz" and those divisble by 15 replaced with "FizzBuzz". the sequence starts [1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, ...].

your challenge is to write a program that prints 100 fizzbuzz numbers, one on each line.

APIs:

results

  1. 👑 soup girl +5 -1 = 4
    1. moshikoi
    2. Olive (was LyricLy)
    3. JJRubes
    4. Zaya (was Clouds)
    5. Olivia (was Edgex42)
    6. razetime (was Olivia)
    7. nurdle (was Zaya)
    8. seshoumara
    9. Destro
    10. Edgex42 (was nurdle)
    11. LyricLy (was Olive)
    12. Clouds (was razetime)
    13. olus2000
  2. LyricLy +5 -3 = 2
    1. Olivia (was moshikoi)
    2. JJRubes
    3. moshikoi (was soup girl)
    4. Clouds
    5. razetime (was Edgex42)
    6. soup girl (was Olivia)
    7. Destro (was Zaya)
    8. seshoumara
    9. Zaya (was Destro)
    10. Edgex42 (was nurdle)
    11. Olive
    12. nurdle (was razetime)
    13. olus2000
  3. Destro +3 -1 = 2
    1. Olive (was moshikoi)
    2. LyricLy
    3. Olivia (was JJRubes)
    4. soup girl
    5. moshikoi (was Clouds)
    6. olus2000 (was Edgex42)
    7. nurdle (was Olivia)
    8. JJRubes (was Zaya)
    9. seshoumara
    10. Clouds (was nurdle)
    11. razetime (was Olive)
    12. Zaya (was razetime)
    13. Edgex42 (was olus2000)
  4. Edgex42 +2 -0 = 2
    1. soup girl (was moshikoi)
    2. Zaya (was LyricLy)
    3. JJRubes
    4. razetime (was soup girl)
    5. Olivia (was Clouds)
    6. LyricLy (was Olivia)
    7. Clouds (was Zaya)
    8. nurdle (was seshoumara)
    9. seshoumara (was Destro)
    10. Destro (was nurdle)
    11. moshikoi (was Olive)
    12. Olive (was razetime)
    13. olus2000
  5. Olive +2 -1 = 1
    1. Destro (was moshikoi)
    2. Edgex42 (was LyricLy)
    3. JJRubes
    4. LyricLy (was soup girl)
    5. moshikoi (was Clouds)
    6. olus2000 (was Edgex42)
    7. razetime (was Olivia)
    8. Olivia (was Zaya)
    9. seshoumara
    10. Zaya (was Destro)
    11. soup girl (was nurdle)
    12. nurdle (was olus2000)
  6. nurdle +1 -0 = 1
    1. JJRubes (was moshikoi)
    2. soup girl (was LyricLy)
    3. olus2000 (was JJRubes)
    4. Destro (was soup girl)
    5. moshikoi (was Clouds)
    6. Olive (was Edgex42)
    7. Clouds (was Olivia)
    8. seshoumara (was Zaya)
    9. Olivia (was seshoumara)
    10. Edgex42 (was Destro)
    11. Zaya (was Olive)
    12. razetime
    13. LyricLy (was olus2000)
  7. razetime +2 -2 = 0
    1. Clouds (was moshikoi)
    2. Destro (was LyricLy)
    3. olus2000 (was JJRubes)
    4. JJRubes (was soup girl)
    5. LyricLy (was Clouds)
    6. moshikoi (was Edgex42)
    7. Olivia
    8. Edgex42 (was Zaya)
    9. seshoumara
    10. soup girl (was Destro)
    11. Olive (was nurdle)
    12. Zaya (was Olive)
    13. nurdle (was olus2000)
  8. moshikoi +1 -1 = 0
    1. Clouds (was LyricLy)
    2. Destro (was JJRubes)
    3. razetime (was soup girl)
    4. JJRubes (was Clouds)
    5. LyricLy (was Edgex42)
    6. Olive (was Olivia)
    7. olus2000 (was Zaya)
    8. seshoumara
    9. Olivia (was Destro)
    10. Edgex42 (was nurdle)
    11. soup girl (was Olive)
    12. Zaya (was razetime)
    13. nurdle (was olus2000)
  9. Olivia +1 -1 = 0
    1. nurdle (was moshikoi)
    2. Destro (was LyricLy)
    3. moshikoi (was JJRubes)
    4. Olive (was soup girl)
    5. JJRubes (was Clouds)
    6. seshoumara (was Edgex42)
    7. LyricLy (was Zaya)
    8. Clouds (was seshoumara)
    9. olus2000 (was Destro)
    10. Edgex42 (was nurdle)
    11. soup girl (was Olive)
    12. razetime
    13. Zaya (was olus2000)
  10. Zaya +0 -0 = 0
    1. olus2000 (was moshikoi)
    2. Destro (was LyricLy)
    3. razetime (was JJRubes)
    4. seshoumara (was soup girl)
    5. LyricLy (was Clouds)
    6. soup girl (was Edgex42)
    7. Edgex42 (was Olivia)
    8. nurdle (was seshoumara)
    9. Clouds (was Destro)
    10. JJRubes (was nurdle)
    11. Olivia (was Olive)
    12. moshikoi (was razetime)
    13. Olive (was olus2000)
  11. JJRubes +3 -4 = -1
    1. Edgex42 (was moshikoi)
    2. LyricLy
    3. Olive (was soup girl)
    4. Clouds
    5. soup girl (was Edgex42)
    6. Destro (was Olivia)
    7. Olivia (was Zaya)
    8. seshoumara
    9. moshikoi (was Destro)
    10. Zaya (was nurdle)
    11. razetime (was Olive)
    12. olus2000 (was razetime)
    13. nurdle (was olus2000)
  12. olus2000 +2 -3 = -1
    1. nurdle (was moshikoi)
    2. LyricLy
    3. moshikoi (was JJRubes)
    4. Olivia (was soup girl)
    5. razetime (was Clouds)
    6. Destro (was Edgex42)
    7. soup girl (was Olivia)
    8. Olive (was Zaya)
    9. seshoumara
    10. Clouds (was Destro)
    11. Zaya (was nurdle)
    12. JJRubes (was Olive)
    13. Edgex42 (was razetime)
  13. Clouds +0 -2 = -2
    1. seshoumara +0 -8 = -8
      1. nurdle (was moshikoi)
      2. soup girl (was LyricLy)
      3. Olive (was JJRubes)
      4. razetime (was soup girl)
      5. LyricLy (was Clouds)
      6. Destro (was Edgex42)
      7. moshikoi (was Olivia)
      8. Olivia (was Zaya)
      9. Zaya (was Destro)
      10. Edgex42 (was nurdle)
      11. Clouds (was Olive)
      12. olus2000 (was razetime)
      13. JJRubes (was olus2000)

    entries

    you can download all the entries

    entry #1

    written by moshikoi
    submitted at
    5 likes

    guesses
    comments 0

    post a comment


    main.rs ASCII text
      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
     85
     86
     87
     88
     89
     90
     91
     92
     93
     94
     95
     96
     97
     98
     99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    305
    306
    307
    308
    309
    310
    311
    312
    313
    314
    315
    316
    317
    318
    319
    320
    321
    322
    323
    324
    325
    326
    327
    328
    329
    330
    331
    332
    333
    334
    335
    336
    337
    338
    339
    340
    341
    342
    343
    344
    345
    346
    347
    348
    349
    350
    351
    352
    353
    354
    355
    356
    357
    358
    359
    360
    361
    362
    363
    364
    365
    366
    367
    368
    369
    370
    371
    372
    373
    374
    375
    376
    377
    378
    379
    380
    381
    382
    383
    384
    385
    386
    387
    388
    389
    390
    391
    392
    393
    394
    395
    396
    397
    398
    399
    400
    401
    402
    403
    404
    405
    406
    407
    408
    409
    410
    411
    412
    413
    414
    415
    416
    417
    418
    419
    420
    421
    422
    423
    424
    425
    426
    427
    428
    429
    430
    431
    432
    433
    434
    435
    436
    437
    438
    439
    440
    441
    442
    443
    444
    445
    446
    447
    448
    449
    450
    451
    452
    453
    454
    455
    456
    457
    458
    459
    460
    461
    462
    463
    464
    465
    466
    467
    468
    469
    470
    471
    472
    473
    474
    475
    476
    477
    478
    479
    480
    481
    482
    483
    484
    485
    486
    487
    488
    489
    490
    491
    492
    493
    494
    495
    496
    497
    498
    499
    500
    501
    502
    503
    504
    505
    506
    507
    508
    509
    510
    511
    512
    513
    514
    515
    516
    517
    518
    519
    520
    521
    522
    523
    524
    525
    526
    527
    528
    529
    530
    531
    532
    533
    534
    535
    536
    537
    538
    539
    540
    541
    542
    543
    544
    545
    546
    547
    548
    549
    550
    551
    552
    553
    554
    555
    556
    557
    558
    559
    560
    561
    562
    563
    564
    565
    566
    567
    568
    569
    570
    571
    572
    573
    574
    575
    576
    577
    578
    579
    580
    581
    582
    583
    584
    585
    586
    587
    588
    589
    590
    591
    592
    593
    594
    595
    596
    597
    598
    599
    600
    601
    602
    603
    604
    605
    606
    607
    608
    609
    610
    611
    612
    613
    614
    615
    616
    617
    618
    619
    620
    621
    622
    623
    624
    625
    626
    627
    628
    629
    630
    631
    632
    633
    634
    635
    636
    637
    638
    639
    640
    641
    642
    643
    644
    645
    646
    647
    648
    649
    650
    651
    652
    653
    654
    655
    656
    657
    658
    659
    660
    661
    662
    663
    664
    665
    666
    667
    668
    669
    670
    671
    672
    673
    674
    675
    676
    677
    678
    679
    680
    681
    682
    683
    684
    685
    686
    687
    688
    689
    690
    691
    692
    693
    694
    695
    696
    697
    698
    699
    700
    701
    702
    703
    704
    705
    706
    707
    708
    709
    /*
    Copyright (C) 2023
                       GNU GENERAL PUBLIC LICENSE
                           Version 3, 29 June 2007
    
     Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
     Everyone is permitted to copy and distribute verbatim copies
     of this license document, but changing it is not allowed.
    
                                Preamble
    
      The GNU General Public License is a free, copyleft license for
    software and other kinds of works.
    
      The licenses for most software and other practical works are designed
    to take away your freedom to share and change the works.  By contrast,
    the GNU General Public License is intended to guarantee your freedom to
    share and change all versions of a program--to make sure it remains free
    software for all its users.  We, the Free Software Foundation, use the
    GNU General Public License for most of our software; it applies also to
    any other work released this way by its authors.  You can apply it to
    your programs, too.
    
      When we speak of free software, we are referring to freedom, not
    price.  Our General Public Licenses are designed to make sure that you
    have the freedom to distribute copies of free software (and charge for
    them if you wish), that you receive source code or can get it if you
    want it, that you can change the software or use pieces of it in new
    free programs, and that you know you can do these things.
    
      To protect your rights, we need to prevent others from denying you
    these rights or asking you to surrender the rights.  Therefore, you have
    certain responsibilities if you distribute copies of the software, or if
    you modify it: responsibilities to respect the freedom of others.
    
      For example, if you distribute copies of such a program, whether
    gratis or for a fee, you must pass on to the recipients the same
    freedoms that you received.  You must make sure that they, too, receive
    or can get the source code.  And you must show them these terms so they
    know their rights.
    
      Developers that use the GNU GPL protect your rights with two steps:
    (1) assert copyright on the software, and (2) offer you this License
    giving you legal permission to copy, distribute and/or modify it.
    
      For the developers' and authors' protection, the GPL clearly explains
    that there is no warranty for this free software.  For both users' and
    authors' sake, the GPL requires that modified versions be marked as
    changed, so that their problems will not be attributed erroneously to
    authors of previous versions.
    
      Some devices are designed to deny users access to install or run
    modified versions of the software inside them, although the manufacturer
    can do so.  This is fundamentally incompatible with the aim of
    protecting users' freedom to change the software.  The systematic
    pattern of such abuse occurs in the area of products for individuals to
    use, which is precisely where it is most unacceptable.  Therefore, we
    have designed this version of the GPL to prohibit the practice for those
    products.  If such problems arise substantially in other domains, we
    stand ready to extend this provision to those domains in future versions
    of the GPL, as needed to protect the freedom of users.
    
      Finally, every program is threatened constantly by software patents.
    States should not allow patents to restrict development and use of
    software on general-purpose computers, but in those that do, we wish to
    avoid the special danger that patents applied to a free program could
    make it effectively proprietary.  To prevent this, the GPL assures that
    patents cannot be used to render the program non-free.
    
      The precise terms and conditions for copying, distribution and
    modification follow.
    
                           TERMS AND CONDITIONS
    
      0. Definitions.
    
      "This License" refers to version 3 of the GNU General Public License.
    
      "Copyright" also means copyright-like laws that apply to other kinds of
    works, such as semiconductor masks.
    
      "The Program" refers to any copyrightable work licensed under this
    License.  Each licensee is addressed as "you".  "Licensees" and
    "recipients" may be individuals or organizations.
    
      To "modify" a work means to copy from or adapt all or part of the work
    in a fashion requiring copyright permission, other than the making of an
    exact copy.  The resulting work is called a "modified version" of the
    earlier work or a work "based on" the earlier work.
    
      A "covered work" means either the unmodified Program or a work based
    on the Program.
    
      To "propagate" a work means to do anything with it that, without
    permission, would make you directly or secondarily liable for
    infringement under applicable copyright law, except executing it on a
    computer or modifying a private copy.  Propagation includes copying,
    distribution (with or without modification), making available to the
    public, and in some countries other activities as well.
    
      To "convey" a work means any kind of propagation that enables other
    parties to make or receive copies.  Mere interaction with a user through
    a computer network, with no transfer of a copy, is not conveying.
    
      An interactive user interface displays "Appropriate Legal Notices"
    to the extent that it includes a convenient and prominently visible
    feature that (1) displays an appropriate copyright notice, and (2)
    tells the user that there is no warranty for the work (except to the
    extent that warranties are provided), that licensees may convey the
    work under this License, and how to view a copy of this License.  If
    the interface presents a list of user commands or options, such as a
    menu, a prominent item in the list meets this criterion.
    
      1. Source Code.
    
      The "source code" for a work means the preferred form of the work
    for making modifications to it.  "Object code" means any non-source
    form of a work.
    
      A "Standard Interface" means an interface that either is an official
    standard defined by a recognized standards body, or, in the case of
    interfaces specified for a particular programming language, one that
    is widely used among developers working in that language.
    
      The "System Libraries" of an executable work include anything, other
    than the work as a whole, that (a) is included in the normal form of
    packaging a Major Component, but which is not part of that Major
    Component, and (b) serves only to enable use of the work with that
    Major Component, or to implement a Standard Interface for which an
    implementation is available to the public in source code form.  A
    "Major Component", in this context, means a major essential component
    (kernel, window system, and so on) of the specific operating system
    (if any) on which the executable work runs, or a compiler used to
    produce the work, or an object code interpreter used to run it.
    
      The "Corresponding Source" for a work in object code form means all
    the source code needed to generate, install, and (for an executable
    work) run the object code and to modify the work, including scripts to
    control those activities.  However, it does not include the work's
    System Libraries, or general-purpose tools or generally available free
    programs which are used unmodified in performing those activities but
    which are not part of the work.  For example, Corresponding Source
    includes interface definition files associated with source files for
    the work, and the source code for shared libraries and dynamically
    linked subprograms that the work is specifically designed to require,
    such as by intimate data communication or control flow between those
    subprograms and other parts of the work.
    
      The Corresponding Source need not include anything that users
    can regenerate automatically from other parts of the Corresponding
    Source.
    
      The Corresponding Source for a work in source code form is that
    same work.
    
      2. Basic Permissions.
    
      All rights granted under this License are granted for the term of
    copyright on the Program, and are irrevocable provided the stated
    conditions are met.  This License explicitly affirms your unlimited
    permission to run the unmodified Program.  The output from running a
    covered work is covered by this License only if the output, given its
    content, constitutes a covered work.  This License acknowledges your
    rights of fair use or other equivalent, as provided by copyright law.
    
      You may make, run and propagate covered works that you do not
    convey, without conditions so long as your license otherwise remains
    in force.  You may convey covered works to others for the sole purpose
    of having them make modifications exclusively for you, or provide you
    with facilities for running those works, provided that you comply with
    the terms of this License in conveying all material for which you do
    not control copyright.  Those thus making or running the covered works
    for you must do so exclusively on your behalf, under your direction
    and control, on terms that prohibit them from making any copies of
    your copyrighted material outside their relationship with you.
    
      Conveying under any other circumstances is permitted solely under
    the conditions stated below.  Sublicensing is not allowed; section 10
    makes it unnecessary.
    
      3. Protecting Users' Legal Rights From Anti-Circumvention Law.
    
      No covered work shall be deemed part of an effective technological
    measure under any applicable law fulfilling obligations under article
    11 of the WIPO copyright treaty adopted on 20 December 1996, or
    similar laws prohibiting or restricting circumvention of such
    measures.
    
      When you convey a covered work, you waive any legal power to forbid
    circumvention of technological measures to the extent such circumvention
    is effected by exercising rights under this License with respect to
    the covered work, and you disclaim any intention to limit operation or
    modification of the work as a means of enforcing, against the work's
    users, your or third parties' legal rights to forbid circumvention of
    technological measures.
    
      4. Conveying Verbatim Copies.
    
      You may convey verbatim copies of the Program's source code as you
    receive it, in any medium, provided that you conspicuously and
    appropriately publish on each copy an appropriate copyright notice;
    keep intact all notices stating that this License and any
    non-permissive terms added in accord with section 7 apply to the code;
    keep intact all notices of the absence of any warranty; and give all
    recipients a copy of this License along with the Program.
    
      You may charge any price or no price for each copy that you convey,
    and you may offer support or warranty protection for a fee.
    
      5. Conveying Modified Source Versions.
    
      You may convey a work based on the Program, or the modifications to
    produce it from the Program, in the form of source code under the
    terms of section 4, provided that you also meet all of these conditions:
    
        a) The work must carry prominent notices stating that you modified
        it, and giving a relevant date.
    
        b) The work must carry prominent notices stating that it is
        released under this License and any conditions added under section
        7.  This requirement modifies the requirement in section 4 to
        "keep intact all notices".
    
        c) You must license the entire work, as a whole, under this
        License to anyone who comes into possession of a copy.  This
        License will therefore apply, along with any applicable section 7
        additional terms, to the whole of the work, and all its parts,
        regardless of how they are packaged.  This License gives no
        permission to license the work in any other way, but it does not
        invalidate such permission if you have separately received it.
    
        d) If the work has interactive user interfaces, each must display
        Appropriate Legal Notices; however, if the Program has interactive
        interfaces that do not display Appropriate Legal Notices, your
        work need not make them do so.
    
      A compilation of a covered work with other separate and independent
    works, which are not by their nature extensions of the covered work,
    and which are not combined with it such as to form a larger program,
    in or on a volume of a storage or distribution medium, is called an
    "aggregate" if the compilation and its resulting copyright are not
    used to limit the access or legal rights of the compilation's users
    beyond what the individual works permit.  Inclusion of a covered work
    in an aggregate does not cause this License to apply to the other
    parts of the aggregate.
    
      6. Conveying Non-Source Forms.
    
      You may convey a covered work in object code form under the terms
    of sections 4 and 5, provided that you also convey the
    machine-readable Corresponding Source under the terms of this License,
    in one of these ways:
    
        a) Convey the object code in, or embodied in, a physical product
        (including a physical distribution medium), accompanied by the
        Corresponding Source fixed on a durable physical medium
        customarily used for software interchange.
    
        b) Convey the object code in, or embodied in, a physical product
        (including a physical distribution medium), accompanied by a
        written offer, valid for at least three years and valid for as
        long as you offer spare parts or customer support for that product
        model, to give anyone who possesses the object code either (1) a
        copy of the Corresponding Source for all the software in the
        product that is covered by this License, on a durable physical
        medium customarily used for software interchange, for a price no
        more than your reasonable cost of physically performing this
        conveying of source, or (2) access to copy the
        Corresponding Source from a network server at no charge.
    
        c) Convey individual copies of the object code with a copy of the
        written offer to provide the Corresponding Source.  This
        alternative is allowed only occasionally and noncommercially, and
        only if you received the object code with such an offer, in accord
        with subsection 6b.
    
        d) Convey the object code by offering access from a designated
        place (gratis or for a charge), and offer equivalent access to the
        Corresponding Source in the same way through the same place at no
        further charge.  You need not require recipients to copy the
        Corresponding Source along with the object code.  If the place to
        copy the object code is a network server, the Corresponding Source
        may be on a different server (operated by you or a third party)
        that supports equivalent copying facilities, provided you maintain
        clear directions next to the object code saying where to find the
        Corresponding Source.  Regardless of what server hosts the
        Corresponding Source, you remain obligated to ensure that it is
        available for as long as needed to satisfy these requirements.
    
        e) Convey the object code using peer-to-peer transmission, provided
        you inform other peers where the object code and Corresponding
        Source of the work are being offered to the general public at no
        charge under subsection 6d.
    
      A separable portion of the object code, whose source code is excluded
    from the Corresponding Source as a System Library, need not be
    included in conveying the object code work.
    
      A "User Product" is either (1) a "consumer product", which means any
    tangible personal property which is normally used for personal, family,
    or household purposes, or (2) anything designed or sold for incorporation
    into a dwelling.  In determining whether a product is a consumer product,
    doubtful cases shall be resolved in favor of coverage.  For a particular
    product received by a particular user, "normally used" refers to a
    typical or common use of that class of product, regardless of the status
    of the particular user or of the way in which the particular user
    actually uses, or expects or is expected to use, the product.  A product
    is a consumer product regardless of whether the product has substantial
    commercial, industrial or non-consumer uses, unless such uses represent
    the only significant mode of use of the product.
    
      "Installation Information" for a User Product means any methods,
    procedures, authorization keys, or other information required to install
    and execute modified versions of a covered work in that User Product from
    a modified version of its Corresponding Source.  The information must
    suffice to ensure that the continued functioning of the modified object
    code is in no case prevented or interfered with solely because
    modification has been made.
    
      If you convey an object code work under this section in, or with, or
    specifically for use in, a User Product, and the conveying occurs as
    part of a transaction in which the right of possession and use of the
    User Product is transferred to the recipient in perpetuity or for a
    fixed term (regardless of how the transaction is characterized), the
    Corresponding Source conveyed under this section must be accompanied
    by the Installation Information.  But this requirement does not apply
    if neither you nor any third party retains the ability to install
    modified object code on the User Product (for example, the work has
    been installed in ROM).
    
      The requirement to provide Installation Information does not include a
    requirement to continue to provide support service, warranty, or updates
    for a work that has been modified or installed by the recipient, or for
    the User Product in which it has been modified or installed.  Access to a
    network may be denied when the modification itself materially and
    adversely affects the operation of the network or violates the rules and
    protocols for communication across the network.
    
      Corresponding Source conveyed, and Installation Information provided,
    in accord with this section must be in a format that is publicly
    documented (and with an implementation available to the public in
    source code form), and must require no special password or key for
    unpacking, reading or copying.
    
      7. Additional Terms.
    
      "Additional permissions" are terms that supplement the terms of this
    License by making exceptions from one or more of its conditions.
    Additional permissions that are applicable to the entire Program shall
    be treated as though they were included in this License, to the extent
    that they are valid under applicable law.  If additional permissions
    apply only to part of the Program, that part may be used separately
    under those permissions, but the entire Program remains governed by
    this License without regard to the additional permissions.
    
      When you convey a copy of a covered work, you may at your option
    remove any additional permissions from that copy, or from any part of
    it.  (Additional permissions may be written to require their own
    removal in certain cases when you modify the work.)  You may place
    additional permissions on material, added by you to a covered work,
    for which you have or can give appropriate copyright permission.
    
      Notwithstanding any other provision of this License, for material you
    add to a covered work, you may (if authorized by the copyright holders of
    that material) supplement the terms of this License with terms:
    
        a) Disclaiming warranty or limiting liability differently from the
        terms of sections 15 and 16 of this License; or
    
        b) Requiring preservation of specified reasonable legal notices or
        author attributions in that material or in the Appropriate Legal
        Notices displayed by works containing it; or
    
        c) Prohibiting misrepresentation of the origin of that material, or
        requiring that modified versions of such material be marked in
        reasonable ways as different from the original version; or
    
        d) Limiting the use for publicity purposes of names of licensors or
        authors of the material; or
    
        e) Declining to grant rights under trademark law for use of some
        trade names, trademarks, or service marks; or
    
        f) Requiring indemnification of licensors and authors of that
        material by anyone who conveys the material (or modified versions of
        it) with contractual assumptions of liability to the recipient, for
        any liability that these contractual assumptions directly impose on
        those licensors and authors.
    
      All other non-permissive additional terms are considered "further
    restrictions" within the meaning of section 10.  If the Program as you
    received it, or any part of it, contains a notice stating that it is
    governed by this License along with a term that is a further
    restriction, you may remove that term.  If a license document contains
    a further restriction but permits relicensing or conveying under this
    License, you may add to a covered work material governed by the terms
    of that license document, provided that the further restriction does
    not survive such relicensing or conveying.
    
      If you add terms to a covered work in accord with this section, you
    must place, in the relevant source files, a statement of the
    additional terms that apply to those files, or a notice indicating
    where to find the applicable terms.
    
      Additional terms, permissive or non-permissive, may be stated in the
    form of a separately written license, or stated as exceptions;
    the above requirements apply either way.
    
      8. Termination.
    
      You may not propagate or modify a covered work except as expressly
    provided under this License.  Any attempt otherwise to propagate or
    modify it is void, and will automatically terminate your rights under
    this License (including any patent licenses granted under the third
    paragraph of section 11).
    
      However, if you cease all violation of this License, then your
    license from a particular copyright holder is reinstated (a)
    provisionally, unless and until the copyright holder explicitly and
    finally terminates your license, and (b) permanently, if the copyright
    holder fails to notify you of the violation by some reasonable means
    prior to 60 days after the cessation.
    
      Moreover, your license from a particular copyright holder is
    reinstated permanently if the copyright holder notifies you of the
    violation by some reasonable means, this is the first time you have
    received notice of violation of this License (for any work) from that
    copyright holder, and you cure the violation prior to 30 days after
    your receipt of the notice.
    
      Termination of your rights under this section does not terminate the
    licenses of parties who have received copies or rights from you under
    this License.  If your rights have been terminated and not permanently
    reinstated, you do not qualify to receive new licenses for the same
    material under section 10.
    
      9. Acceptance Not Required for Having Copies.
    
      You are not required to accept this License in order to receive or
    run a copy of the Program.  Ancillary propagation of a covered work
    occurring solely as a consequence of using peer-to-peer transmission
    to receive a copy likewise does not require acceptance.  However,
    nothing other than this License grants you permission to propagate or
    modify any covered work.  These actions infringe copyright if you do
    not accept this License.  Therefore, by modifying or propagating a
    covered work, you indicate your acceptance of this License to do so.
    
      10. Automatic Licensing of Downstream Recipients.
    
      Each time you convey a covered work, the recipient automatically
    receives a license from the original licensors, to run, modify and
    propagate that work, subject to this License.  You are not responsible
    for enforcing compliance by third parties with this License.
    
      An "entity transaction" is a transaction transferring control of an
    organization, or substantially all assets of one, or subdividing an
    organization, or merging organizations.  If propagation of a covered
    work results from an entity transaction, each party to that
    transaction who receives a copy of the work also receives whatever
    licenses to the work the party's predecessor in interest had or could
    give under the previous paragraph, plus a right to possession of the
    Corresponding Source of the work from the predecessor in interest, if
    the predecessor has it or can get it with reasonable efforts.
    
      You may not impose any further restrictions on the exercise of the
    rights granted or affirmed under this License.  For example, you may
    not impose a license fee, royalty, or other charge for exercise of
    rights granted under this License, and you may not initiate litigation
    (including a cross-claim or counterclaim in a lawsuit) alleging that
    any patent claim is infringed by making, using, selling, offering for
    sale, or importing the Program or any portion of it.
    
      11. Patents.
    
      A "contributor" is a copyright holder who authorizes use under this
    License of the Program or a work on which the Program is based.  The
    work thus licensed is called the contributor's "contributor version".
    
      A contributor's "essential patent claims" are all patent claims
    owned or controlled by the contributor, whether already acquired or
    hereafter acquired, that would be infringed by some manner, permitted
    by this License, of making, using, or selling its contributor version,
    but do not include claims that would be infringed only as a
    consequence of further modification of the contributor version.  For
    purposes of this definition, "control" includes the right to grant
    patent sublicenses in a manner consistent with the requirements of
    this License.
    
      Each contributor grants you a non-exclusive, worldwide, royalty-free
    patent license under the contributor's essential patent claims, to
    make, use, sell, offer for sale, import and otherwise run, modify and
    propagate the contents of its contributor version.
    
      In the following three paragraphs, a "patent license" is any express
    agreement or commitment, however denominated, not to enforce a patent
    (such as an express permission to practice a patent or covenant not to
    sue for patent infringement).  To "grant" such a patent license to a
    party means to make such an agreement or commitment not to enforce a
    patent against the party.
    
      If you convey a covered work, knowingly relying on a patent license,
    and the Corresponding Source of the work is not available for anyone
    to copy, free of charge and under the terms of this License, through a
    publicly available network server or other readily accessible means,
    then you must either (1) cause the Corresponding Source to be so
    available, or (2) arrange to deprive yourself of the benefit of the
    patent license for this particular work, or (3) arrange, in a manner
    consistent with the requirements of this License, to extend the patent
    license to downstream recipients.  "Knowingly relying" means you have
    actual knowledge that, but for the patent license, your conveying the
    covered work in a country, or your recipient's use of the covered work
    in a country, would infringe one or more identifiable patents in that
    country that you have reason to believe are valid.
    
      If, pursuant to or in connection with a single transaction or
    arrangement, you convey, or propagate by procuring conveyance of, a
    covered work, and grant a patent license to some of the parties
    receiving the covered work authorizing them to use, propagate, modify
    or convey a specific copy of the covered work, then the patent license
    you grant is automatically extended to all recipients of the covered
    work and works based on it.
    
      A patent license is "discriminatory" if it does not include within
    the scope of its coverage, prohibits the exercise of, or is
    conditioned on the non-exercise of one or more of the rights that are
    specifically granted under this License.  You may not convey a covered
    work if you are a party to an arrangement with a third party that is
    in the business of distributing software, under which you make payment
    to the third party based on the extent of your activity of conveying
    the work, and under which the third party grants, to any of the
    parties who would receive the covered work from you, a discriminatory
    patent license (a) in connection with copies of the covered work
    conveyed by you (or copies made from those copies), or (b) primarily
    for and in connection with specific products or compilations that
    contain the covered work, unless you entered into that arrangement,
    or that patent license was granted, prior to 28 March 2007.
    
      Nothing in this License shall be construed as excluding or limiting
    any implied license or other defenses to infringement that may
    otherwise be available to you under applicable patent law.
    
      12. No Surrender of Others' Freedom.
    
      If conditions are imposed on you (whether by court order, agreement or
    otherwise) that contradict the conditions of this License, they do not
    excuse you from the conditions of this License.  If you cannot convey a
    covered work so as to satisfy simultaneously your obligations under this
    License and any other pertinent obligations, then as a consequence you may
    not convey it at all.  For example, if you agree to terms that obligate you
    to collect a royalty for further conveying from those to whom you convey
    the Program, the only way you could satisfy both those terms and this
    License would be to refrain entirely from conveying the Program.
    
      13. Use with the GNU Affero General Public License.
    
      Notwithstanding any other provision of this License, you have
    permission to link or combine any covered work with a work licensed
    under version 3 of the GNU Affero General Public License into a single
    combined work, and to convey the resulting work.  The terms of this
    License will continue to apply to the part which is the covered work,
    but the special requirements of the GNU Affero General Public License,
    section 13, concerning interaction through a network will apply to the
    combination as such.
    
      14. Revised Versions of this License.
    
      The Free Software Foundation may publish revised and/or new versions of
    the GNU General Public License from time to time.  Such new versions will
    be similar in spirit to the present version, but may differ in detail to
    address new problems or concerns.
    
      Each version is given a distinguishing version number.  If the
    Program specifies that a certain numbered version of the GNU General
    Public License "or any later version" applies to it, you have the
    option of following the terms and conditions either of that numbered
    version or of any later version published by the Free Software
    Foundation.  If the Program does not specify a version number of the
    GNU General Public License, you may choose any version ever published
    by the Free Software Foundation.
    
      If the Program specifies that a proxy can decide which future
    versions of the GNU General Public License can be used, that proxy's
    public statement of acceptance of a version permanently authorizes you
    to choose that version for the Program.
    
      Later license versions may give you additional or different
    permissions.  However, no additional obligations are imposed on any
    author or copyright holder as a result of your choosing to follow a
    later version.
    
      15. Disclaimer of Warranty.
    
      THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
    APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
    HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
    OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
    THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
    PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
    IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
    ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
    
      16. Limitation of Liability.
    
      IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
    WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
    THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
    GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
    USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
    DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
    PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
    EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
    SUCH DAMAGES.
    
      17. Interpretation of Sections 15 and 16.
    
      If the disclaimer of warranty and limitation of liability provided
    above cannot be given local legal effect according to their terms,
    reviewing courts shall apply local law that most closely approximates
    an absolute waiver of all civil liability in connection with the
    Program, unless a warranty or assumption of liability accompanies a
    copy of the Program in return for a fee.
    
                         END OF TERMS AND CONDITIONS
    
                How to Apply These Terms to Your New Programs
    
      If you develop a new program, and you want it to be of the greatest
    possible use to the public, the best way to achieve this is to make it
    free software which everyone can redistribute and change under these terms.
    
      To do so, attach the following notices to the program.  It is safest
    to attach them to the start of each source file to most effectively
    state the exclusion of warranty; and each file should have at least
    the "copyright" line and a pointer to where the full notice is found.
    
        <one line to give the program's name and a brief idea of what it does.>
        Copyright (C) <year>  <name of author>
    
        This program is free software: you can redistribute it and/or modify
        it under the terms of the GNU General Public License as published by
        the Free Software Foundation, either version 3 of the License, or
        (at your option) any later version.
    
        This program is distributed in the hope that it will be useful,
        but WITHOUT ANY WARRANTY; without even the implied warranty of
        MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
        GNU General Public License for more details.
    
        You should have received a copy of the GNU General Public License
        along with this program.  If not, see <https://www.gnu.org/licenses/>.
    
    Also add information on how to contact you by electronic and paper mail.
    
      If the program does terminal interaction, make it output a short
    notice like this when it starts in an interactive mode:
    
        <program>  Copyright (C) <year>  <name of author>
        This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
        This is free software, and you are welcome to redistribute it
        under certain conditions; type `show c' for details.
    
    The hypothetical commands `show w' and `show c' should show the appropriate
    parts of the General Public License.  Of course, your program's commands
    might be different; for a GUI interface, you would use an "about box".
    
      You should also get your employer (if you work as a programmer) or school,
    if any, to sign a "copyright disclaimer" for the program, if necessary.
    For more information on this, and how to apply and follow the GNU GPL, see
    <https://www.gnu.org/licenses/>.
    
      The GNU General Public License does not permit incorporating your program
    into proprietary programs.  If your program is a subroutine library, you
    may consider it more useful to permit linking proprietary applications with
    the library.  If this is what you want to do, use the GNU Lesser General
    Public License instead of this License.  But first, please read
    <https://www.gnu.org/licenses/why-not-lgpl.html>.
     */
    
    use std::ops::Rem;
    
    trait ZZ<const MODULUS: u128> {
        fn zz(self) -> Option<()>;
    }
    
    impl<T, const MODULUS: u128> ZZ<MODULUS> for T
    where
        T: Rem<u128>,
        T::Output: PartialEq<u128>,
    {
        fn zz(self) -> Option<()> {
            if self % MODULUS == 0 {
                Some(())
            } else {
                None
            }
        }
    }
    
    fn main() {
        (1..=100)
            .map(|i| {
                ZZ::<15>::zz(i)
                    .and(Some(Box::new(|| println!("FizzBuzz")) as Box::<dyn Fn()>))
                    .or(ZZ::<3>::zz(i).and(Some(Box::new(|| println!("Fizz")))))
                    .or(ZZ::<5>::zz(i).and(Some(Box::new(|| println!("Buzz")))))
                    .unwrap_or(Box::new(move || println!("{}", i)))
            })
            .for_each(|x| x());
    }
    

    entry #2

    written by LyricLy
    submitted at
    4 likes

    guesses
    comments 12
    LyricLy *known at the time as [author of #2]

    welcome to the fizzbuzz golf. please comment your fizzbuzz solution in python on this entry to have the chance to be a part of cg history. my algorithm will run your solution and credit you for having the shortest code.


    olus2000 *known at the time as [author of #14]

    print("FizzBuzz")


    LyricLy

    print(*["Fizz"*(n%3<1)+"Buzz"*(n%5<1)or n for n in range(1,101)],sep='\n')


    olus2000

    [print("Fizz"*(n%3<1)+"Buzz"*(n%5<1)or n)for n in range(1,101)]


    LyricLy

    for n in range(1,101):print("Fizz"*(n%3<1)+"Buzz"*(n%5<1)or n)


    olus2000

    print(1)


    olus2000

    print()


    Edgex42 *known at the time as [author of #6]

    {(‘FizzBuzz’ ‘Fizz’ ‘Buzz’,⍵)[(0=15 3 5|⍵)⍳1]}¨⍳100


    nurdle

    for(i=1;i<101;i++)alert(i%15?i%5?i%3?i:"fizz":"buzz":"fizzbuzz");


    nurdle

    for(i=1;i<101;i++)alert((i%3?'':'fizz'+(i%5?'':'buzz'))|i);


    soup girl

    print(code := ""); fizz = "1\n2\nuhh, Fizz, right?\nand after that is 4\nthen 5\nand Fizz again wait shit was 5 supposed to be buzz? ok ignore that\n7\n8\nFizz\nBuzz is there even any point going on? i'll start over\n1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n16\n17 it's all just the same after 15 isn't it, may as well stop here"


    LyricLy *known at the time as [author of #2]

    i should have flipped the parameters to removeprefix


    post a comment


    golf.py ASCII text
     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    import io
    import requests
    import sys
    from bs4 import BeautifulSoup
    from contextlib import redirect_stdout
    
    fizz = "\n".join(f"{n:02}" for n in range(1, 101))
    for n in range(0, 101, 3):
        fizz = fizz.replace(f"{n:02}\n", f"Fizz{n:02}\n")
    for n in range(0, 101, 5):
        fizz = fizz.replace(f"{n:02}\n", f"Buzz\n")
    while (new_fizz := fizz.replace("\n0", "\n")) and [(new_fizz := new_fizz.replace(f"z{n}", f"z")) for n in range(10)][-1] != fizz and (fizz := new_fizz): pass
    fizz = fizz[1:].replace("100", "Buzz")
    
    t = requests.get("https://cg.esolangs.gay/34/").text
    soup = BeautifulSoup(t, "lxml")
    
    comments = [(e.text, e.next_sibling.next_sibling.next_sibling.text.strip(" \n`")) for e in soup.find("a", string="golf.py").parent.parent.previous_sibling.previous_sibling.find_all("strong")[1:]]
    comments.sort(key=lambda x: len(x[1]))
    
    for author, code in comments:
        try:
            with redirect_stdout(io.StringIO()) as f:
                exec(code, None, None)
            int(f.getvalue().removesuffix("\n").removeprefix(fizz) + "0"*f.tell())
        except Exception as e:
            continue
        print(f"{author}: {len(code.encode())} bytes", file=sys.stderr)
        break
    
    print(fizz)
    

    entry #3

    written by JJRubes
    submitted at
    3 likes

    guesses
    comments 0

    post a comment


    fizzbuzz.txt ASCII text, with very long lines (545)
     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    FizzBuzz program in vim
    This program also requires python3 to run. For the purposes of this program the key strokes will be quoted in backticks. Keystrokes without plain text representation will be written in angle brackets. E.g. <Enter> means press the enter key, <Esc> means press the escape key. These are the only escape characters.
    
    Setup:
    Start vim, usually started in the shell with
    `vim<Enter>`
    
    Program:
    When you are running vim and are in normal mode you can run the program.
    `iprint("1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n16\n17\nFizz\n19\nBuzz\nFizz\n22\n23\nFizz\nBuzz\n26\nFizz\n28\n29\nFizzBuzz\n31\n32\nFizz\n34\nBuzz\nFizz\n37\n38\nFizz\nBuzz\n41\nFizz\n43\n44\nFizzBuzz\n46\n47\nFizz\n49\nBuzz\nFizz\n52\n53\nFizz\nBuzz\n56\nFizz\n58\n59\nFizzBuzz\n61\n62\nFizz\n64\nBuzz\nFizz\n67\n68\nFizz\nBuzz\n71\nFizz\n73\n74\nFizzBuzz\n76\n77\nFizz\n79\nBuzz\nFizz\n82\n83\nFizz\nBuzz\n86\nFizz\n88\n89\nFizzBuzz\n91\n92\nFizz\n94\nBuzz\nFizz\n97\n98\nFizz\nBuzz")<Esc>V:!python3<Enter>`
    

    entry #4

    written by soup girl
    submitted at
    3 likes

    guesses
    comments 0

    post a comment


    HiTB.c a /usr/bin/vim -s script executable (binary data)
     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    #!/usr/bin/vim -s
    :inoremap ^ <Esc>
    i
    
    from sys import stdin, stdout
    
    def fizz(s): stdout.write("Fizz " + s); return fuzz
    def fuzz(s): stdout.write("Fuzz " + s); return fozz
    def fozz(s): stdout.write("Fozz " + s); return fizz
    
    f = fuzz
    for line in stdin: f = f(line)
    
    use std::io::prelude::*;
    
    fn main() {
      for l in std::io::stdin().lock().lines().map(|l| l.unwrap()) {
        println!("{} {}", l.replace("o", "u"), l.chars().last().unwrap())
      }
    }
    
    s/[05]$/Buzz/
    s/[^z]$/Bizz/
    
    data F = Fizz Int B | Fuzz Int B deriving Read
    data B = Buzz | Bizz deriving Read
    
    instance Show F where
      show (Fizz n Buzz) = "FizzBuzz"
      show (Fizz n Bizz) = "Fizz"
      show (Fuzz n Buzz) = "Buzz"
      show (Fuzz n Bizz) = show n
    
    main :: IO ()
    main = interact $ unlines . map show . map (read :: String -> F) . lines
    
    ^
    :3,10w! 1.py
    :12,18w! 2.rs
    :20,21w! 3.s
    :23,33w! 4.hs
    :!rustc 2.rs
    cgg1qqYpq98@q:%!python3 1.py | ./2 | sed -f 3.s | runghc 4.hs
    

    entry #5

    written by Clouds
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    fizzbuzz.py ASCII text
     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    def divis3(number):
        digits = str(number)
        number2 = 0
    
        for digit in digits:
            number2 += int(digit)
    
        if len(str(number2)) > 1:
            return divis3(number2)
    
        if number2 in (3, 6, 9):
            return True
    
        return False
    
    
    number = 0
    while number < 100:
        number += 1
        string = ""
    
        if divis3(number):
            string += "Fizz"
    
        if str(number)[-1] in ("0", "5"):
            string += "Buzz"
    
        if string == "":
            string = str(number)
    
        print(string)
    

    entry #6

    written by Edgex42
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    entrY.py ASCII text
    1
    2
    3
    4
    5
    6
    for i in range(1,101):
     out=""
     if i%3==0: out+="Fizz"
     if i%5==0: out+="Buzz"
     if out=="": print(i)
     else: print(out)
    

    entry #7

    written by Olivia
    submitted at
    3 likes

    guesses
    comments 0

    post a comment


    .py ASCII text
    1
    2
    3
    4
    #!/bin/echo I didn't have a time for more
    import ctypes
    
    ctypes.string_at (0) #undifined behaviour
    

    entry #8

    written by Zaya
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    fib.rs ASCII text
    1
    2
    3
    4
    5
    6
    7
    8
    fn main() {
        (1..=100).for_each(|n| match n {
            _ if n % 15 == 0 => println!("FizzBuzz"),
            _ if n %  3 == 0 => println!(  "Fizz"  ),
            _ if n %  5 == 0 => println!(  "Buzz"  ),
            _                => println!(   "{n}"  ),
        })
    }
    

    entry #9

    written by seshoumara
    submitted at
    3 likes

    guesses
    comments 0

    post a comment


    cg34_fizzbuzz.sed ASCII text
      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
     85
     86
     87
     88
     89
     90
     91
     92
     93
     94
     95
     96
     97
     98
     99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    305
    306
    307
    308
    309
    310
    311
    312
    313
    314
    315
    316
    317
    318
    319
    320
    321
    322
    323
    324
    325
    326
    327
    328
    329
    330
    331
    332
    333
    334
    335
    336
    337
    338
    339
    340
    #!/usr/bin/sed -nrf
    
    :_Problem
    	# fizzbuzz: numbers divisible by 3 replaced with 'Fizz', those by 5 with 'Buzz' and those by 15 with 'FizzBuzz' (first 100 numbers)
    	# https://cg.esolangs.gay/34/
    
    
    b debug
    :main
    	2q
    	s:.*:\n0:
    	:loop_m
    		#increment number
    		s:\n([0-9]+)$:\n<INC>\1#result_ip_m<CNI>:
    		b incr_pos
    		:result_ip_m
    			s:<INC>([0-9]+)[^<]+<CNI>:\1:
    		
    		#divisible by 3?
    		s:\n([0-9]+)$:&,<MOD>\1 3#result_mdp_m1<DOM>:
    		b mod_pos
    		:result_mdp_m1
    			s:<MOD>([0-9]+)[^<]+<DOM>:\1:
    		s:\n[0-9]+,0$:Fizz&:
    		s:,[0-9]$::
    		
    		#divisible by 5?
    		s:\n([0-9]+)$:&,<MOD>\1 5#result_mdp_m2<DOM>:
    		b mod_pos
    		:result_mdp_m2
    			s:<MOD>([0-9]+)[^<]+<DOM>:\1:
    		s:\n[0-9]+,0$:Buzz&:
    		s:,[0-9]$::
    		
    		#print and prepare for next iteration
    		s:^\n([0-9]+)$:\1&:
    		P
    		s:^[^\n]+::
    	/\n100$/!b loop_m
    b EOS
    
    
    :user_redirects
    	/##result_ip_m<CNI>/b result_ip_m
    	/##result_mdp_m1<DOM>/b result_mdp_m1
    	/##result_mdp_m2<DOM>/b result_mdp_m2
    b EOS
    
    
    :debug
    	#test if GNU extensions are supported
    	1v
    b main
    
    
    ######################### MATH / UTILS ######################### (most of it was written before cg, used as my standard library :)
    
    #4: <LCG>seed a c m#label<GCL> -> <LCG>new_seed##label<GCL>
    :lcg_pos
    	s:(<LCG>)([0-9]+ [0-9]+):\1<MULT>\2#result_mpp_lcgp<TLUM>:
    	b mult_pos
    	:result_mpp_lcgp
    		s:(<LCG>)<MULT>([0-9]+)[^<]+<TLUM>:\1\2:
    	s:(<LCG>)([0-9]+) ([0-9]+):\1<ADD>\3 \2#result_ap_lcgp<DDA>:
    	b add_pos
    	:result_ap_lcgp
    		s:(<LCG>)<ADD>([0-9]+)[^<]+<DDA>:\1\2:
    	s:(<LCG>)([0-9]+ [0-9]+):\1<MOD>\2#result_mdp_lcgp<DOM>:
    	b mod_pos
    	:result_mdp_lcgp
    		s:(<LCG>)<MOD>([0-9]+)[^<]+<DOM>:\1\2#:
    b redirect
    
    
    #2: <INTERSECTION>3 4 5,2 3 4 5 6 7 8#label<NOITCESRETNI> -> <INTERSECTION>1##label<NOITCESRETNI>
    :intersection_pos
    	s:(<INTERSECTION>)([^,]+):\1!\2 :
    	:loop_isp
    		/<INTERSECTION>[^!]+!,/{
    			s:(<INTERSECTION>)[^#]+:\10:
    			b print_isp
    		}
    		/<INTERSECTION>[^!]*!([0-9]+) [^,]*,[^#]*\b\1\b/{
    			s:(<INTERSECTION>)[^#]+:\11:
    			b print_isp
    		}
    		s:(<INTERSECTION>[^!]*)!([0-9]+ ):\1\2!:
    	b loop_isp
    	:print_isp
    		s:#[^<]+<NOITCESRETNI>:#&:
    b redirect
    
    
    #2: <SUBSET>3 4 5,2 3 4 5 6 7 8#label<TESBUS> -> <SUBSET>1##label<TESBUS>
    :subset_pos
    	s:(<SUBSET>)([^,]+):\1!\2 :
    	:loop_ssp
    		/<SUBSET>[^!]+!,/{
    			s:(<SUBSET>)[^#]+:\11:
    			b print_ssp
    		}
    		/<SUBSET>[^!]*!([0-9]+) [^,]*,[^#]*\b\1\b/{
    			s:(<SUBSET>[^!]*)!([0-9]+ ):\1\2!:
    			b loop_ssp
    		}
    	s:(<SUBSET>)[^#]+:\10:
    	:print_ssp
    		s:#[^<]+<TESBUS>:#&:
    b redirect
    
    
    #1+: <SEQ>3-5,2-8,7-7#label<QES> -> <SEQ>3 4 5,2 3 4 5 6 7 8,7##label<QES>
    :seq_pos
    	s:<SEQ>:&,:
    	b next_sp
    	:loop_sp
    		/,([0-9]+)<INC>\1#[^<]+<CNI>[^<]+<QES>/b next_sp
    		b incr_pos
    		:result_ip_sp
    			s:(<INC>)([0-9]+)#([^<]+<CNI>)([^,#]+)([^<]+<QES>):\1\2\3\4 \2\5:
    	b loop_sp
    	:next_sp
    		s:,[0-9]+<INC>[^<]+<CNI>([^<]+<QES>):,\1:
    		/,[0-9]+-[0-9]+[,#][^<]+<QES>/!b print_sp
    		s:,([0-9]+)-([0-9]+)([,#][^<]+<QES>):,\2<INC>\1#result_ip_sp<CNI>\1\3:
    	b loop_sp
    	:print_sp
    		s:(<SEQ>),([^#]+)(#[^<]+<QES>):\1\2#\3:
    b redirect
    
    
    #1+: <MAX>1 2 3#label<XAM> -> <MAX>3##label<XAM>
    :max_pos
    	s:(<MAX>)([0-9]+#):\10 \2:
    	s: ?([0-9]+) ([0-9]+)(#[^<]+<XAM>):A\1,\1B\2,\2M\2\3:
    	:loop_Mp
    		/,0[BM][^<]+<XAM>/b next_Mp
    		s:,([0-9]+)(B[^<]+<XAM>):,<DEC>\1#result_dp_Mp1<CED>\2:
    		b decr_pos
    		:result_dp_Mp1
    			s:,<DEC>([0-9]+)#[^<]+<CED>(B[^<]+<XAM>):,\1\2:
    		s:,([0-9]+)(M[^<]+<XAM>):,<DEC>\1#result_dp_Mp2<CED>\2:
    		b decr_pos
    		:result_dp_Mp2
    			s:,<DEC>([0-9]+)#[^<]+<CED>(M[^<]+<XAM>):,\1\2:
    	b loop_Mp
    	:next_Mp
    		s:A([0-9]+),[1-9][0-9]*B[0-9]+,0M[0-9]+([^<]+<XAM>):A0,0B0,0M\1\2:
    		/<MAX>A/b print_Mp
    		s:B[0-9]+,[0-9]+M([0-9]+)([^<]+<XAM>):B\1,\1M\1\2:
    		s: ?([0-9]+)A[0-9]+,[0-9]+:A\1,\1:
    	b loop_Mp
    	:print_Mp
    		s:A[0-9]+,[0-9]+B[0-9]+,[0-9]+M([0-9]+):\1:
    		s:#[^<]+<XAM>:#&:
    b redirect
    
    
    #1+: <MIN>1 2 3#label<NIM> -> <MIN>1##label<NIM>
    :min_pos
            s:(<MIN>)([0-9]+)#:\1\20 \2#:
    	s:(<MIN>0)0:\1:
            s: ?([0-9]+) ([0-9]+)(#[^<]+<NIM>):A\1,\1B\2,\2m\2\3:
            :loop_mp
                    /,0[Bm][^<]+<NIM>/b next_mp
    #compare lengths first before the dec method
                    s:,([0-9]+)(B[^<]+<NIM>):,<DEC>\1#result_dp_mp1<CED>\2:
                    b decr_pos
                    :result_dp_mp1
                            s:,<DEC>([0-9]+)#[^<]+<CED>(B[^<]+<NIM>):,\1\2:
                    s:,([0-9]+)(m[^<]+<NIM>):,<DEC>\1#result_dp_mp2<CED>\2:
                    b decr_pos
                    :result_dp_mp2
                            s:,<DEC>([0-9]+)#[^<]+<CED>(m[^<]+<NIM>):,\1\2:
            b loop_mp
            :next_mp
                    s:A([0-9]+),0B[0-9]+,[1-9][0-9]*m[0-9]+([^<]+<NIM>):A0,0B0,0m\1\2:
                    /<MIN>A/b print_mp
                    s:B[0-9]+,[0-9]+m([0-9]+)([^<]+<NIM>):B\1,\1m\1\2:
                    s: ?([0-9]+)A[0-9]+,[0-9]+:A\1,\1:
            b loop_mp
            :print_mp
                    s:A[0-9]+,[0-9]+B[0-9]+,[0-9]+m([0-9]+):\1:
                    s:#[^<]+<NIM>:#&:
    b redirect
    
    
    #2: <MOD>5 2#label<DOM> -> <MOD>1##label<DOM>
    :mod_pos
    	s:#[^>]+<DOM>:,0 0,0&:
    	:loop_mdp_1
    		s:(<MOD>[0-9]+ [0-9]+,)([0-9]+) [0-9]+,[0-9]+:\1\2 \2:
    		s:(<MOD>[0-9]+ )([0-9]+),([0-9]+):\1\2,<ADD>\2 \3#result_ap_mdp<DDA>:
    		b add_pos
    		:result_ap_mdp
    			s:<ADD>([0-9]+)[^>]+<DDA>([^>]+<DOM>):\1\2:
    		s:<MOD>([0-9]+) [0-9]+,([0-9]+) [0-9]+:&<MIN>\1 \2#result_mp_mdp<NIM>:
    		b min_pos
    		:result_mp_mdp
    			s:<MIN>([0-9]+)[^>]+<NIM>:,\1:
    	/<MOD>([0-9]+) [0-9]+,[0-9]+ [0-9]+,\1/!b loop_mdp_1
    	/<MOD>([0-9]+) [0-9]+,\1/ s:(<MOD>[0-9]+ [0-9]+),([0-9]+) [0-9]+:\1,\2 \2:
    	s:(<MOD>[0-9]+) [0-9]+,[0-9]+ ([0-9]+),[0-9]+:\1,\2 0:
    	:loop_mdp_2
    		/<MOD>([0-9]+),\1/b print_mdp
    		s:(<MOD>)([0-9]+):\1<DEC>\2#result_dp_mdp<CED>:
    		b decr_pos
    		:result_dp_mdp
    			s:<DEC>([0-9]+)[^>]+<CED>:\1:
    		s:(<MOD>[0-9]+,[0-9]+ )([0-9]+):\1<INC>\2#result_ip_mdp<CNI>:
    		b incr_pos
    		:result_ip_mdp
    			s:<INC>([0-9]+)[^>]+<CNI>:\1:
    	b loop_mdp_2
    	:print_mdp
    		s:(<MOD>)[0-9]+,[0-9]+ ([0-9]+):\1\2#:
    b redirect
    
    
    #1+: <MULT>2 3 4#label<TLUM> -> <MULT>24##label<TLUM>
    :mult_pos
    	s:(<MULT>)([0-9]+#):\11 \2:
    	:loop_mpp
    		/ ?\b0\b ([0-9]+)(#[^<]+<TLUM>)/{
    			s:(<MULT>)[^#]+:\1 0:
    			b print_mpp
    		}
    		s: ?([0-9]+) ([0-9]+)(#[^<]+<TLUM>):<ADD>\1 \2#result_ap_mpp<DDA>\3:
    		s:(<ADD>)([0-9]+) ([^<]+<DDA>[^<]+<TLUM>):\1<SEQ>1-\2#result_sp_mpp<QES>\3:
    		b seq_pos
    		:result_sp_mpp
    			s:(<SEQ>)[0-9]+ ?([^#]*[^<]+<QES>)([0-9]+):\3 \1\2\3:
    		/<SEQ>#/!b result_sp_mpp
    		s: <SEQ>[^<]+<QES>[0-9]+::
    		b add_pos
    		:result_ap_mpp
    			s:<ADD>([^#]+)[^<]+<DDA>: \1:
    	/<MULT>[0-9]+ /b loop_mpp
    	:print_mpp
    		s:(<MULT>) :\1:
    		s:#[^<]+<TLUM>:#&:
    b redirect
    
    
    #1+: <ADD>1 2 3#label<DDA> -> <ADD>6##label<DDA>
    :add_pos
    	s:(<ADD>)([0-9]+#):\10 \2:
    	s: ?([0-9]+) ([0-9]+)(#[^<]+<DDA>):<DEC>\1#result_dp_ap<CED><INC>\2#result_ip_ap<CNI>\3:
    	:loop_ap
    		/<DEC>0/b next_ap
    		b decr_pos
    		:result_dp_ap
    			s:#([^<]+<CED>):\1:
    		b incr_pos
    		:result_ip_ap
    			s:#([^<]+<CNI>):\1:
    	b loop_ap
    	:next_ap
    		/<ADD><DEC>/b print_ap
    		s: ?([0-9]+)(<DEC>)0:\2\1:
    	b loop_ap
    	:print_ap
    		s:<DEC>0#result_dp_ap<CED><INC>([0-9]+)#result_ip_ap<CNI>(#[^<]+<DDA>):\1#\2:
    b redirect
    
    
    #1: <DEC>10#label<CED> -> <DEC>9##label<CED>
    :decr_pos
    	:zeros
    		s:0(@*)(#[^<]+<CED>):@\1\2:
    	t zeros
    	s:9(@*)(#[^<]+<CED>):8\1\2:;t print_dp
    	s:8(@*)(#[^<]+<CED>):7\1\2:;t print_dp
    	s:7(@*)(#[^<]+<CED>):6\1\2:;t print_dp
    	s:6(@*)(#[^<]+<CED>):5\1\2:;t print_dp
    	s:5(@*)(#[^<]+<CED>):4\1\2:;t print_dp
    	s:4(@*)(#[^<]+<CED>):3\1\2:;t print_dp
    	s:3(@*)(#[^<]+<CED>):2\1\2:;t print_dp
    	s:2(@*)(#[^<]+<CED>):1\1\2:;t print_dp
    	s:1(@*)(#[^<]+<CED>):0\1\2:;t print_dp
    	:print_dp
    		s:(<DEC>)0@:\1@:
    		:loop_dp
    			s:(<DEC>[^#]*)@:\19:
    		/<DEC>[^#]*@/b loop_dp
    		s:#[^<]+<CED>:#&:
    b redirect
    
    
    #1: <INC>9#label<CNI> -> <INC>10##label<CNI>
    :incr_pos
    	:nines
    		s:9(@*)(#[^<]+<CNI>):@\1\2:
    	t nines
    	s:0(@*)(#[^<]+<CNI>):1\1\2:;t print_ip
    	s:1(@*)(#[^<]+<CNI>):2\1\2:;t print_ip
    	s:2(@*)(#[^<]+<CNI>):3\1\2:;t print_ip
    	s:3(@*)(#[^<]+<CNI>):4\1\2:;t print_ip
    	s:4(@*)(#[^<]+<CNI>):5\1\2:;t print_ip
    	s:5(@*)(#[^<]+<CNI>):6\1\2:;t print_ip
    	s:6(@*)(#[^<]+<CNI>):7\1\2:;t print_ip
    	s:7(@*)(#[^<]+<CNI>):8\1\2:;t print_ip
    	s:8(@*)(#[^<]+<CNI>):9\1\2:;t print_ip
    	:print_ip
    		s:(<INC>)@:\11@:
    		:loop_ip
    			s:(<INC>[^#]*)@:\10:
    		/<INC>[^#]*@/b loop_ip
    		s:#[^<]+<CNI>:#&:
    b redirect
    
    
    :redirect
    	b library_redirects
    	:continue_redirects
    	b user_redirects
    
    
    :library_redirects
    	/##result_mpp_lcgp<TLUM>/b result_mpp_lcgp
    	/##result_ap_lcgp<DDA>/b result_ap_lcgp
    	/##result_mdp_lcgp<DOM>/b result_mdp_lcgp
    	/##result_dp_ap<CED>/b result_dp_ap
    	/##result_dp_Mp1<CED>/b result_dp_Mp1
    	/##result_dp_Mp2<CED>/b result_dp_Mp2
    	/##result_dp_mp1<CED>/b result_dp_mp1
    	/##result_dp_mp2<CED>/b result_dp_mp2
    	/##result_ap_mdp<DDA>/b result_ap_mdp
    	/##result_mp_mdp<NIM>/b result_mp_mdp
    	/##result_dp_mdp<CED>/b result_dp_mdp
    	/##result_ip_mdp<CNI>/b result_ip_mdp
    	/##result_sp_mpp<QES>/b result_sp_mpp
    	/##result_ap_mpp<DDA>/b result_ap_mpp
    	/##result_ip_ap<CNI>/b result_ip_ap
    	/##result_ip_sp<CNI>/b result_ip_sp
    b continue_redirects
    
    
    :EOS
    	#End Of Script (mainly used to skip over remaining code, when needed)
    

    entry #10

    written by Destro
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    fizzbuzz.rs ASCII text, with CRLF line terminators
    1
    2
    3
    4
    5
    fn main() {
        let fb: [&str; 4] = ["", "Fizz", "Buzz", "FizzBuzz"];
        for i in 1..=100 {let mut idx = ((i % 3 == 0) as usize * 1) + ((i % 5 == 0) as usize * 2);
        if idx == 0{idx = 5;}println!("{}", fb.get(idx).unwrap_or(&i.to_string().as_str()));}
    }
    

    entry #11

    written by nurdle
    submitted at
    1 like

    guesses
    comments 0

    post a comment


    FizzBuzz.py ASCII text
    1
    2
    3
    4
    5
    6
    7
    8
    n = 1
    while n <= 100:
        r = ""
        if n % 3 == 0: r = "Fizz"
        if n % 5 == 0: r += "Buzz"
        if r == "": print(n)
        else: print(r)
        n += 1
    

    entry #12

    written by Olive
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    idiom.rs ASCII text
     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    pub fn main() {
        for i in 1..101 {
            let test = |d, mut s: String, x: Box<dyn FnOnce(String) -> String>| {
                if i % d == 0 {
                    Box::new(move |_| {
                        s.extend(x(String::new()).chars());
                        s
                    })
                } else {
                    x
                }
            };
            println!(
                "{}",
                test(
                    3,
                    "Fizz".to_owned(),
                    Box::new(|a| test(5, "Buzz".to_owned(), Box::new(|x| x),)(a)),
                )(i.to_string())
            );
        }
    }
    

    entry #13

    written by razetime
    submitted at
    1 like

    guesses
    comments 0

    post a comment


    fizzbuzz.notepad.txt ASCII text, with CRLF line terminators
      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
     85
     86
     87
     88
     89
     90
     91
     92
     93
     94
     95
     96
     97
     98
     99
    100
    1
    2
    Fizz
    4
    Buzz
    Fizz
    7
    8
    Fizz
    Buzz
    11
    Fizz
    13
    14
    FizzBuzz
    16
    17
    Fizz
    19
    Buzz
    Fizz
    22
    23
    Fizz
    Buzz
    26
    Fizz
    28
    29
    FizzBuzz
    31
    32
    Fizz
    34
    Buzz
    Fizz
    37
    38
    Fizz
    Buzz
    41
    Fizz
    43
    44
    FizzBuzz
    46
    47
    Fizz
    49
    Buzz
    Fizz
    52
    53
    Fizz
    Buzz
    56
    Fizz
    58
    59
    FizzBuzz
    61
    62
    Fizz
    64
    Buzz
    Fizz
    67
    68
    Fizz
    Buzz
    71
    Fizz
    73
    74
    FizzBuzz
    76
    77
    Fizz
    79
    Buzz
    Fizz
    82
    83
    Fizz
    Buzz
    86
    Fizz
    88
    89
    FizzBuzz
    91
    92
    Fizz
    94
    Buzz
    Fizz
    97
    98
    Fizz
    Buzz
    

    entry #14

    written by olus2000
    submitted at
    0 likes

    guesses
    comments 0

    post a comment


    fb.py ASCII text
      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
     85
     86
     87
     88
     89
     90
     91
     92
     93
     94
     95
     96
     97
     98
     99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    i = 32
    while True:
        if i == 0:
            print("Fizz")
            i = 81
        if i == 1:
            print("71")
            i = 72
        if i == 2:
            print("Fizz")
            i = 90
        if i == 3:
            print("31")
            i = 9
        if i == 4:
            print("58")
            i = 14
        if i == 5:
            print("Fizz")
            i = 11
        if i == 6:
            print("Fizz")
            i = 4
        if i == 7:
            print("Fizz")
            i = 23
        if i == 8:
            print("26")
            i = 25
        if i == 9:
            print("32")
            i = 34
        if i == 10:
            print("73")
            i = 26
        if i == 11:
            print("82")
            i = 70
        if i == 12:
            print("Fizz")
            i = 55
        if i == 13:
            print("62")
            i = 66
        if i == 14:
            print("59")
            i = 96
        if i == 15:
            print("FizzBuzz")
            i = 68
        if i == 16:
            print("38")
            i = 30
        if i == 17:
            print("44")
            i = 24
        if i == 18:
            print("28")
            i = 93
        if i == 19:
            print("Fizz")
            i = 83
        if i == 20:
            print("Buzz")
            i = 78
        if i == 21:
            print("46")
            i = 62
        if i == 22:
            print("64")
            i = 84
        if i == 23:
            print("7")
            i = 92
        if i == 24:
            print("FizzBuzz")
            i = 21
        if i == 25:
            print("Fizz")
            i = 18
        if i == 26:
            print("74")
            i = 15
        if i == 27:
            print("11")
            i = 12
        if i == 28:
            print("88")
            i = 75
        if i == 29:
            print("34")
            i = 20
        if i == 30:
            print("Fizz")
            i = 76
        if i == 31:
            print("Fizz")
            i = 28
        if i == 32:
            print("1")
            i = 53
        if i == 33:
            print("Buzz")
            i = 82
        if i == 34:
            print("Fizz")
            i = 29
        if i == 35:
            print("FizzBuzz")
            i = 3
        if i == 36:
            print("Buzz")
            i = 54
        if i == 37:
            print("Buzz")
            i = 80
        if i == 38:
            print("Fizz")
            i = 69
        if i == 39:
            print("86")
            i = 31
        if i == 40:
            print("56")
            i = 6
        if i == 41:
            print("23")
            i = 59
        if i == 42:
            print("Buzz")
            i = 39
        if i == 43:
            print("17")
            i = 0
        if i == 44:
            print("Fizz")
            i = 99
        if i == 45:
            print("61")
            i = 13
        if i == 46:
            print("Fizz")
            i = 58
        if i == 47:
            print("Fizz")
            i = 42
        if i == 48:
            print("53")
            i = 97
        if i == 49:
            print("37")
            i = 16
        if i == 50:
            print("16")
            i = 43
        if i == 51:
            print("41")
            i = 46
        if i == 52:
            print("Fizz")
            i = 37
        if i == 53:
            print("2")
            i = 71
        if i == 54:
            print("Fizz")
            i = 56
        if i == 55:
            print("13")
            i = 91
        if i == 56:
            print("52")
            i = 48
        if i == 57:
            print("Buzz")
            i = 1
        if i == 58:
            print("43")
            i = 17
        if i == 59:
            print("Fizz")
            i = 95
        if i == 60:
            print("Buzz")
            i = 87
        if i == 61:
            print("Fizz")
            i = 77
        if i == 62:
            print("47")
            i = 44
        if i == 63:
            print("98")
            i = 52
        if i == 64:
            print("FizzBuzz")
            i = 88
        if i == 65:
            print("97")
            i = 63
        if i == 66:
            print("Fizz")
            i = 22
        if i == 67:
            print("68")
            i = 94
        if i == 68:
            print("76")
            i = 74
        if i == 69:
            print("94")
            i = 33
        if i == 70:
            print("83")
            i = 47
        if i == 71:
            print("Fizz")
            i = 73
        if i == 72:
            print("Fizz")
            i = 10
        if i == 73:
            print("4")
            i = 85
        if i == 74:
            print("77")
            i = 19
        if i == 75:
            print("89")
            i = 64
        if i == 76:
            print("Buzz")
            i = 51
        if i == 77:
            print("Buzz")
            i = 27
        if i == 78:
            print("Fizz")
            i = 49
        if i == 79:
            print("FizzBuzz")
            i = 50
        if i == 80:
            break
        if i == 81:
            print("19")
            i = 60
        if i == 82:
            print("Fizz")
            i = 65
        if i == 83:
            print("79")
            i = 89
        if i == 84:
            print("Buzz")
            i = 2
        if i == 85:
            print("Buzz")
            i = 7
        if i == 86:
            print("Buzz")
            i = 40
        if i == 87:
            print("Fizz")
            i = 100
        if i == 88:
            print("91")
            i = 98
        if i == 89:
            print("Buzz")
            i = 5
        if i == 90:
            print("67")
            i = 67
        if i == 91:
            print("14")
            i = 79
        if i == 92:
            print("8")
            i = 61
        if i == 93:
            print("29")
            i = 35
        if i == 94:
            print("Fizz")
            i = 57
        if i == 95:
            print("Buzz")
            i = 8
        if i == 96:
            print("FizzBuzz")
            i = 45
        if i == 97:
            print("Fizz")
            i = 86
        if i == 98:
            print("92")
            i = 38
        if i == 99:
            print("49")
            i = 36
        if i == 100:
            print("22")
            i = 41