exec puzzle gauntlet

This challenge consists of multiple puzzles. Each solution should take up exactly one line (you may need to use semicolons). To admit defeat to a puzzle, submit one hundred hashes (#) in a row as the solution.

Puzzle one

i=100;exec(________________*_)

In the code above, you can replace each underscore with any byte (you can’t replace an underscore with nothing). Can you make the code above print only the integers from 99 to 1, descending?

Puzzle two (orthoplex)

Same set up as problem 1, but additionally your code must not contain the string print.

Puzzle three (Sisyphus)

Format:

i=100;exec(_________________*_)

Output: 99-1 descending, but with 1 printed twice.

Puzzle four (biz)

Format:

i=100;eval(___________________*_)

Print 99-1 descending

Puzzle five (khvdm)

Format

i=1000;exec(__________________*_)

Output: all evens between 999 and 1, descending (998, 996, 994, …, 6, 4, 2)

Puzzle six (khvdm2)

Format

i=1000;exec(_________________*_)

Output: all evens between 999 and -1, descending (998, 996, 994, …, 4, 2, 0)