Merge pull request #1 from geekcomputers/master

Merge with fork

Author: markmelnic

# Solve the quadratic equation ax**2 + bx + c = 0

@@ -0,0 +1,14 @@
+import cmath
+
+a = 1
+b = 5
+c = 6
+
+# calculate the discriminant
+d = (b**2) - (4*a*c)
+
+# find two solutions
+sol1 = (-b-cmath.sqrt(d))/(2*a)
+sol2 = (-b+cmath.sqrt(d))/(2*a)
+
+print('The solution are {0} and {1}'.format(sol1,sol2))

# Solve the quadratic equation ax**2 + bx + c = 0 # import complex math module import cmath a = 1 b = 5 c = 6 # calculate the discriminant d = (b**2) - (4*a*c) # find two solutions sol1 = (-b-cmath.sqrt(d))/(2*a) sol2 = (-b+cmath.sqrt(d))/Python Program to Solve Quadratic Equation

@@ -0,0 +1,17 @@
+# Solve the quadratic equation ax**2 + bx + c = 0
+
+# import complex math module
+import cmath
+
+a = 1
+b = 5
+c = 6
+
+# calculate the discriminant
+d = (b**2) - (4*a*c)
+
+# find two solutions
+sol1 = (-b-cmath.sqrt(d))/(2*a)
+sol2 = (-b+cmath.sqrt(d))/(2*a)
+
+print('The solution are {0} and {1}'.format(sol1,sol2))

.gitignore

@@ -1,2 +1,17 @@
 .idea
 *.pyc
+string=sorted(input())
+lower=""
+even=""
+odd=""
+upper=""
+for i in string:
+    if i.islower():
+        lower+=i
+    elif i.isupper():
+        upper+=i
+    elif int(i)%2==0:
+        even+=i
+    else:
+        odd+=i
+print(lower+upper+odd+even)

12

@@ -0,0 +1,5 @@
+import turtle 
+ t = turtle.Turtle() 
+t.circle(20) 
+t1=turtle.Turtle() 
+t1.circle(25) 

56

@@ -0,0 +1,2 @@
+t = turtle.Turtle()
+t.circle(50) 

A solution to project euler problem 3.py

@@ -0,0 +1,70 @@
+"""
+Problem:
+The prime factors of 13195 are 5,7,13 and 29. What is the largest prime factor
+of a given number N?
+
+e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.
+"""
+
+
+def solution(n: int) -> int:
+def solution(n: int = 600851475143) -> int:
+    """Returns the largest prime factor of a given number n.
+    >>> solution(13195)
+    29
+    >>> solution(10)
+    5
+    >>> solution(17)
+    17
+    >>> solution(3.4)
+    3
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    """
+    try:
+        n = int(n)
+    except (TypeError, ValueError):
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
+
+    i = 2
+    ans = 0
+
+    if n == 2:
+        return 2
+
+    while n > 2:
+        while n % i != 0:
+            i += 1
+
+        ans = i
+
+        while n % i == 0:
+            n = n / i
+
+        i += 1
+
+    return int(ans)
+
+
+if __name__ == "__main__":
+    # print(solution(int(input().strip())))
+    import doctest
+
+    doctest.testmod()
+    print(solution(int(input().strip())))

ABC

@@ -0,0 +1,12 @@
+# Python3 program to add two numbers 
+
+number1 = input("First number: ") 
+number2 = input("\nSecond number: ") 
+
+# Adding two numbers 
+# User might also enter float numbers 
+sum = float(number1) + float(number2) 
+
+# Display the sum 
+# will print value in float 
+print("The sum of {0} and {1} is {2}" .format(number1, number2, sum)) 

ARKA

@@ -0,0 +1,9 @@
+def sumOfSeries(n): 
+	x = (n * (n + 1) / 2) 
+	return (int)(x * x) 
+
+
+
+# Driver Function 
+n = 5
+print(sumOfSeries(n)) 

Add two numbers

@@ -0,0 +1,19 @@
+patch-1
+# This program adds two numbers
+
+num1 = 1.5
+num2 = 6.3
+
+# Add two numbers
+sum = num1 + num2
+
+# Display the sum
+=======
+num1 = 1.5
+num2 = 6.3
+
+
+sum = num1 + num2
+
+master
+print('The sum of {0} and {1} is {2}'.format(num1, num2, sum))

Area of triangle

@@ -0,0 +1,13 @@
+a = 5
+b = 6
+c = 7
+# a = float(input('Enter first side: '))
+# b = float(input('Enter second side: '))
+# c = float(input('Enter third side: '))
+
+# calculate the semi-perimeter
+s = (a + b + c) / 2
+
+# calculate the area
+area = (s*(s-a)*(s-b)*(s-c)) ** 0.5
+print('The area of the triangle is %0.2f' %area)

Armstrong number

@@ -0,0 +1,12 @@
+num=int(input("enter 1-digit number:"))
+f=num
+sum=0
+while (f>0):
+    a=f%10
+    f=int(f/10)
+    sum=sum+(a**3)
+if(sum==num):
+    print("it is an armstrong number:",num)
+else:
+    print("it is not an armstrong number:",num)
+

Assembler/GUIDE.txt

@@ -1,4 +1,4 @@
-# Guide for Python-Assembler
+# Guide for Python_Assembler
 
 ### Register
 

Automated Scheduled Call Reminders/caller.py

@@ -0,0 +1,53 @@
+#The project automates calls for people from the firebase cloud database and the schedular keeps it running and checks for entries
+#every 1 hour using aps scedular
+#The project can be used to set 5 min before reminder calls to a set of people for doing a particular job
+import os
+from firebase_admin import credentials, firestore, initialize_app
+from datetime import datetime,timedelta
+import time
+from time import gmtime, strftime
+import twilio
+from twilio.rest import Client
+#twilio credentials
+acc_sid=""
+auth_token=""
+client=Client(acc_sid, auth_token)
+
+#firebase credentials
+#key.json is your certificate of firebase project
+cred = credentials.Certificate('key.json')
+default_app = initialize_app(cred)
+db = firestore.client()
+database_reference = db.collection('on_call')
+
+#Here the collection name is on_call which has documents with fields phone , from (%H:%M:%S time to call the person),date 
+
+#gets data from cloud database and calls 5 min prior the time (from time) alloted in the database
+def search():
+
+    calling_time = datetime.now()
+    one_hours_from_now = (calling_time + timedelta(hours=1)).strftime('%H:%M:%S')  
+    current_date=str(strftime("%d-%m-%Y", gmtime()))
+    docs = db.collection(u'on_call').where(u'date',u'==',current_date).stream()
+    list_of_docs=[]
+    for doc in docs:
+        
+        c=doc.to_dict()
+        if (calling_time).strftime('%H:%M:%S')<=c['from']<=one_hours_from_now:
+            list_of_docs.append(c)
+    print(list_of_docs)
+
+    while(list_of_docs):
+        timestamp=datetime.now().strftime('%H:%M')
+        five_minutes_prior= (timestamp + timedelta(minutes=5)).strftime('%H:%M')
+        for doc in list_of_docs:
+            if doc['from'][0:5]==five_minutes_prior:
+                phone_number= doc['phone']
+                call = client.calls.create(
+                to=phone_number,
+                from_="add your twilio number",
+                url="http://demo.twilio.com/docs/voice.xml"
+                )
+                list_of_docs.remove(doc)
+
+

Automated Scheduled Call Reminders/schedular.py

@@ -0,0 +1,13 @@
+#schedular code for blocking schedular as we have only 1 process to run 
+
+from apscheduler.schedulers.blocking import BlockingScheduler
+
+from caller import search
+
+
+sched = BlockingScheduler()
+
+# Schedule job_function to be called every two hours
+sched.add_job(search, 'interval',hours=1) # for testing instead add hours =1
+
+sched.start()

Base Converter Number system

@@ -0,0 +1,74 @@
+def base_check(xnumber, xbase):
+    for char in xnumber[len(xnumber ) -1]:
+        if int(char) >= int(xbase):
+            return False
+    return True
+
+def convert_from_10(xnumber, xbase, arr, ybase):
+    if int(xbase) == 2 or int(xbase) == 4 or int(xbase) == 6 or int(xbase) == 8:
+
+        if xnumber == 0:
+            return arr
+        else:
+            quotient = int(xnumber) // int(xbase)
+            remainder = int(xnumber) % int(xbase)
+            arr.append(remainder)
+            dividend = quotient
+            convert_from_10(dividend, xbase, arr, base)
+    elif int(xbase) == 16:
+        if int(xnumber) == 0:
+            return arr
+        else:
+            quotient = int(xnumber) // int(xbase)
+            remainder = int(xnumber) % int(xbase)
+            if remainder > 9:
+                if remainder == 10: remainder = 'A'
+                if remainder == 11: remainder = 'B'
+                if remainder == 12: remainder = 'C'
+                if remainder == 13: remainder = 'D'
+                if remainder == 14: remainder = 'E'
+                if remainder == 15: remainder = 'F'
+            arr.append(remainder)
+            dividend = quotient
+            convert_from_10(dividend, xbase, arr, ybase)
+def convert_to_10(xnumber, xbase, arr, ybase):
+    if int(xbase) == 10:
+        for char in xnumber:
+            arr.append(char)
+        flipped = arr[::-1]
+        ans = 0
+        j = 0
+
+        for i in flipped:
+            ans = ans + (int(i) * (int(ybase) ** j))
+            j = j + 1
+        return ans
+arrayfrom = []
+arrayto = []
+is_base_possible = False
+number = input("Enter the number you would like to convert: ")
+
+while not is_base_possible:
+    base = input("What is the base of this number? ")
+    is_base_possible = base_check(number, base)
+    if not is_base_possible:
+        print(f"The number {number} is not a base {base} number")
+        base = input
+    else:
+        break
+dBase = input("What is the base you would like to convert to? ")
+if int(base) == 10:
+    convert_from_10(number, dBase, arrayfrom, base)
+    answer = arrayfrom[::-1]  # reverses the array
+    print(f"In base {dBase} this number is: ")
+    print(*answer, sep='')
+elif int(dBase) == 10:
+    answer = convert_to_10(number, dBase, arrayto, base)
+    print(f"In base {dBase} this number is: {answer} ")
+else:
+    number = convert_to_10(number, 10, arrayto, base)
+    convert_from_10(number, dBase, arrayfrom, base)
+    answer = arrayfrom[::-1]
+    print(f"In base {dBase} this number is: ")
+    print(*answer, sep='')
+© 2020 GitHub, Inc.