"Guerrilla Radio" is the second track from the 1999 album The Battle of Los Angeles by the band Rage Against the Machine. The band won the Grammy Award for Best Hard Rock Performance for this song. It has remained one of their signature tracks. "Guerrilla Radio" was also featured on the soundtracks for video games such as Tony Hawk's Pro Skater 2, Madden NFL 10 and Guitar Hero Live, as well as being a downloadable track for the Rock Band series.
== History ==
"Guerrilla Radio" was performed live on the Late Show with David Letterman in 1999. During the commercial break, "Bulls on Parade" was played...
Python 2, 61 bytes
from time import*
while 1:print strftime("%H:%M:%S");sleep(1)
No online link because ideone times out (huehuehue) before printing anything.
Introduction
The LaTeX typesetting system uses macros for defining accents.
For example, the letter ê is produced by \hat{e}.
In this challenge, your task is to implement an ASCII version of this functionality.
Input
Your input is a non-empty string of printable ASCII characters.
It will not c...
C/C++, 219 Bytes
Here is a first pass attempt. It is written in C++ but uses only C functionalities, so it could be used as C code with only changes to the include statements (I think).
#include<stdio.h>
#include<ctime>
time_t r;struct tm*x;int main(){char c[9],b[9];time(&r);x=localtime(&r);str...
Vending Machine 🍏🍘🍙
You will simulate a vending machine. The items are 56 different emojis, which are composed of two unicode characters, from: 🍅(U+D83C U+DF45) to 🍼
(U+D83C U+DF7C). In base 10 the first character has value 55356. The value of the second character ranges from 57157 to 57212...
Ruby, 29 bytes
loop{print`date +%T;sleep 1`}
Not bad.
Python 2, 60 bytes
from time import*
while[sleep(1)]:print strftime("%H:%M:%S")
This works because [sleep(1)] is a truthy value.
AppleScript, 51 35 bytes
repeat
log current date
delay 1
end
Pretty dang obvious. Prints the current date, which contains the time, delays a second, then continues.
Brainfuck, 40 bytes
,[>>+>>,]<<[[<<]>>[-[<]>>[.<<->]>+>>]<<]
This uses the counting sort algorithm, which makes this an O(n) solution.
The code requires a left-infinite or wrapping tape of 8 bit cells. You can try it on brainfuck.tk.
How it works
, Read a char from STDIN.
[ ...
Ostrich, 2 bytes
G$
In Ostrich G reads a line of input from STDIN and $ sorts it.
I have a try{} catch{} block in my program in visual studio. in try{} block i have a code to connect DB and when run that program return error. Whatever in this situation program must execute catch{} block but the error returns from try block and program stoped
A man has two devices.
A time machine - He can control this machine by thinking. It allows him to travel from any point in time to another point in time in the past or future (or even the present point in time) in no time at all. Note that if he travels to the past from B to A, then all normal ...
Pretty simple challenge today:
Write a program or function that takes in a positive integer N and prints or returns a sorted list of the unique numbers that appear in the multiplication table whose row and column multiplicands both range from 1 to N inclusive.
The list may be sorted in ascendin...
There have been many day of the week challenges on this site. This is just one example.
This challenge is to make a game, where you randomly select a valid date on the proleptic Gregorian calendar, print that date, take a player's guess as to what day of the week that was, and then verify that g...
