This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/python | |
| import subprocess | |
| objects=[] | |
| for i in range(1000): | |
| output = subprocess.check_output("curl https://graph.facebook.com/" + str(i),shell=True) | |
| if not "\"code\":100" in output: | |
| objects.append(output) | |
| for each in objects: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/python | |
| """ | |
| trees.py | |
| Recursion! | |
| """ | |
| from turtle import * | |
| import random |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| primes.py | |
| Peter Muller | |
| Generates and prints prime numbers after 2 until | |
| you kill the program with Ctrl + C | |
| Works by checking to see if a number is divisible by any other number in | |
| the list of prime numbers. If not, it is prime and added to the list of | |
| prime numbers to check future numbers against. |