Find all palindromic words in a file
#!/usr/bin/python3
def words(fileobj):
for line in fileobj:
for word in line.split():
yield word
with open("words.txt") as wordfile:
wordgen = words(wordfile)
for word in wordgen:
if word == word[::-1]:
print(word, end=" ")
print()
Palindate
Palindromic primes
20 FOR N=2 TO 100000
30 I=N
35 J=0
40 J=J*10+I-INT(I/10)*10
43 I=INT(I/10)
47 IF I>0 THEN 40
50 IF J<>N THEN 80
52 IF N=2 THEN 75
60 FOR I=2 TO SQR(N)
65 IF N-INT(N/I)*I=0 THEN 80
70 NEXT I
75 PRINT N;” “;
80 NEXT N
85 PRINT
\
Pay
#!/usr/bin/env python3
import sys
from num2words import num2words
def spell_number(my_number):
my_number = my_number.strip()
if not my_number:
return ""
result = num2words(
float(my_number),
to="currency",
currency="USD"
)
result = result.replace(",", "")
result = result.replace(" and ", " ")
result = result.replace("-", " ")
result = result.title()
result = result.replace(" Dollars ", " Dollars And ")
result = result.replace(" Dollar ", " Dollar And ")
return result
def main():
for line in sys.stdin:
result = spell_number(line)
if result:
print(result)
if __name__ == "__main__":
main()
perfect
#include <stdio.h>
int main(void)
{
for (unsigned int p = 2; p <= 23; p++) {
unsigned long long m = (1ULL << p) - 1;
int prime = 1;
for (unsigned long long i = 2; i * i <= m; i++) {
if (m % i == 0) {
prime = 0;
break;
}
}
if (prime)
printf("%llu\n", (1ULL << (p - 1)) * m);
}
}



