We're Here To Help And Answer Any Question You Might Have. We Look Forward
- To Hearing from You 😊
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
SUBSCRIBE TO OUR NEWSLETTER
-
-
-
-
-
-
-
-
-
- Subscribe
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/Complex.java b/Complex.java
deleted file mode 100644
index 8d170ec..0000000
--- a/Complex.java
+++ /dev/null
@@ -1,117 +0,0 @@
-
-import java.util.*;
-
-public class Complex {
- float real;
- float imag;
- Scanner scn = new Scanner(System.in);
- void setdata() {
-
- System.out.println("enter the real value of complex number ");
- real= scn.nextFloat();
- System.out.println("enter the imaginary value of complex number ");
- imag= scn.nextFloat();
-
- }
-
- void add(float a,float b,float c,float d) {
- real= a+c;
- imag= b+d;
- }
-
- void substract(float a,float b,float c,float d) {
- real= a-c;
- imag= b-d;
- }
-
- void multiply(float a,float b,float c,float d) {
- real = (a*c)-(b*d);
- imag = (a*d)+(b*c);
- }
-
- void divide(float a,float b,float c,float d) {
- real = ((a*c)+(b*d))/((c*c)+(d*d));
- imag = ((b*c)-(a*d))/((c*c)+(d*d));
- }
-
- void getdata() {
- if(imag>=0) {
- System.out.println(real+"+"+imag+"i");
- }
- else {
- System.out.println(real+""+imag+"i");
- }
- }
-
- public static void main(String[] args) {
- try (Scanner scn1 = new Scanner(System.in)) {
- Complex x2 = new Complex();
- Complex x1= new Complex();
- Complex addition= new Complex();
- Complex substraction = new Complex();
- Complex division = new Complex();
- Complex multiplication = new Complex();
-
-
- x1.setdata();
- x2.setdata();
-
- System.out.println("complex number1 is ");
- x1.getdata();
- System.out.println("complex number 2 is ");
- x2.getdata();
-
-
- int ans=1;
- while(ans==1) {
- System.out.println("choose the operation to perform \n1.addtion\n2.substraction\n3.multiplication\n4.division");
- int a= scn1.nextInt();
- switch (a){
- case 1:
- addition.add(x1.real,x1.imag,x2.real,x2.imag);
- System.out.println("addition of complex1 and complex2 is ");
- addition.getdata();
- break;
-
- case(2):
- substraction.substract(x1.real,x1.imag,x2.real,x2.imag);
- System.out.println("substraction of complex2 from complex1 is ");
- substraction.getdata();
- break;
-
- case(3):
- multiplication.multiply(x1.real,x1.imag,x2.real,x2.imag);
- System.out.println("multiplication of comlex1 and complex2 is ");
- multiplication.getdata();
- break;
-
- case(4):
- division.divide(x1.real,x1.imag,x2.real,x2.imag);
- if((x2.real==0)&&(x2.imag==0)) {
- System.out.println("can't divide by zero");
- }
- else {
- System.out.println("on division of complex1 by complex2, we get ");
- division.getdata();
- }
-
- default:
- System.out.println("Invalid option choosen!!!!");
-
- }
-
-
-
- System.out.println("do you want to check more?\n(press 1 for yes/2 for no)");
- ans= scn1.nextInt();
- if(ans==2) {
- break;
- }
-
-}
- }
- //System.out.println("data type if marks is");
- System.out.println("\nThank you");
-
-}
-}
\ No newline at end of file
diff --git a/Connect 4/Connect Four.py b/Connect 4/Connect Four.py
deleted file mode 100644
index 5065783..0000000
--- a/Connect 4/Connect Four.py
+++ /dev/null
@@ -1,50 +0,0 @@
-from turtle import *
-
-from freegames import line
-
-turns = {'red': 'yellow', 'yellow': 'red'}
-state = {'player': 'yellow', 'rows': [0] * 8}
-
-
-def grid():
- """Draw Connect Four grid."""
- bgcolor('light blue')
-
- for x in range(-150, 200, 50):
- line(x, -200, x, 200)
-
- for x in range(-175, 200, 50):
- for y in range(-175, 200, 50):
- up()
- goto(x, y)
- dot(40, 'white')
-
- update()
-
-
-def tap(x, y):
- """Draw red or yellow circle in tapped row."""
- player = state['player']
- rows = state['rows']
-
- row = int((x + 200) // 50)
- count = rows[row]
-
- x = ((x + 200) // 50) * 50 - 200 + 25
- y = count * 50 - 200 + 25
-
- up()
- goto(x, y)
- dot(40, player)
- update()
-
- rows[row] = count + 1
- state['player'] = turns[player]
-
-
-setup(420, 420, 370, 0)
-hideturtle()
-tracer(False)
-grid()
-onscreenclick(tap)
-done()
\ No newline at end of file
diff --git a/Connect 4/readme b/Connect 4/readme
deleted file mode 100644
index 66f473e..0000000
--- a/Connect 4/readme
+++ /dev/null
@@ -1,10 +0,0 @@
-"""Connect Four
-
-Exercises
-
-1. Change the colors.
-2. Draw squares instead of circles for open spaces.
-3. Add logic to detect a full row.
-4. Create a random computer player.
-5. How would you detect a winner?
-"""
\ No newline at end of file
diff --git a/Convert Decimal to Binary, Octal and Hexadecimal b/Convert Decimal to Binary, Octal and Hexadecimal
deleted file mode 100644
index 34150ab..0000000
--- a/Convert Decimal to Binary, Octal and Hexadecimal
+++ /dev/null
@@ -1,22 +0,0 @@
-#include
-int main() {
- int n, reversed = 0, remainder, original;
- printf("Enter an integer: ");
- scanf("%d", &n);
- original = n;
-
- // reversed integer is stored in reversed variable
- while (n != 0) {
- remainder = n % 10;
- reversed = reversed * 10 + remainder;
- n /= 10;
- }
-
- // palindrome if orignal and reversed are equal
- if (original == reversed)
- printf("%d is a palindrome.", original);
- else
- printf("%d is not a palindrome.", original);
-
- return 0;
-}
diff --git a/CountdownTimer.py b/CountdownTimer.py
deleted file mode 100644
index c80b695..0000000
--- a/CountdownTimer.py
+++ /dev/null
@@ -1,27 +0,0 @@
-import time
-
-# The countdown function is defined below
-
-def countdown(t):
-
-while t:
-
-mins, secs = divmod(t, 60)
-
-timer = '{:02d}:{:02d}'.format(mins, secs)
-
-print(timer, end="\r")
-
-time.sleep(1)
-
-t -= 1
-
-print('Lift off!')
-
-# Ask the user to enter the countdown period in seconds
-
-t = input("Enter the time in seconds: ")
-
-# function call
-
-countdown(int(t))
diff --git a/DSA2.cpp b/DSA2.cpp
deleted file mode 100644
index f99c314..0000000
--- a/DSA2.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-#include
-using namespace std;
-#define size 50
-
-
-
-int main(){
- int i,j;
- char infix[100],postfix[100];
- cout<<"enter infix expression"<>infix;
- i=0;
-while(infix[i++]!='\0');
-infix[i+1]='\0';
-infix[i--]=')';
-while(i>0){
- infix[i]=infix[i-1];
-}
-infix[i]='(';
-
-
-
-
-
-
- return 0;
-}
-
diff --git a/DYNAQUE.C b/DYNAQUE.C
deleted file mode 100644
index e7cd97c..0000000
--- a/DYNAQUE.C
+++ /dev/null
@@ -1,80 +0,0 @@
-#include
-#include
-#include
-struct node
-{
- int info;
- struct node *next;
-}*rear=NULL,*front=NULL;
-void main()
-{
- int ch;
- clrscr();
- while(1)
- {
- printf("\n1.Insert item");
- printf("\n2.Delete item");
- printf("\n3.Display");
- printf("\n4.Quit");
- printf("\nEnter your choice=");
- scanf("%d",&ch);
- switch(ch)
- {
- case 1:
- insert_item();
- break;
- case 2:
- del_item();
- break;
- case 3:
- display();
- break;
- case 4:
- exit(1);
- default:
- printf("\n Wrong choice Try again!!!!");
- }
- }
-}
-insert_item()
-{
- struct node *temp;
- int item;
- temp=(struct node *)malloc(sizeof(struct node));
- printf("\n Enter item to be inserted= ");
- scanf("%d",&item);
- temp->info=item;
- temp->next=NULL;
- if(front==NULL)
- front=temp;
- else
- rear->next=temp;
- rear=temp;
-}
-del_item()
-{
- struct node *temp;
- if(front==NULL)
- printf("\n Queue underflow");
- else
- {
- temp=front;
- printf("\n Element after deletion is=%d",temp->info);
- front=front->next;
- free(temp);
- }
-}
-display()
-{
- struct node *trav;
- if(front==NULL)
- printf("\n Queue is empty");
- else
- {
- printf("\ncontents of queue are=\n");
- for(trav=front;trav!=NULL;trav=trav->next)
- {
- printf("%d",trav->info);
- }
- }
-}
\ No newline at end of file
diff --git a/Depth_First_Search.py b/Depth_First_Search.py
deleted file mode 100644
index ad4c23d..0000000
--- a/Depth_First_Search.py
+++ /dev/null
@@ -1,22 +0,0 @@
-graph={
-'A': ['B','C'],
-'B': ['D','E'],
-'C': ['F','G'],
-'D': ['B'],
-'E': ['B'],
-'F': ['C'],
-'G': ['C']
-}
-
-visited = set()
-
-def dfs(visited, graph, node):
-
- if node not in visited:
- print (node)
- visited.add(node)
- for neighbour in graph[node]:
- dfs(visited, graph, neighbour)
-
-print("Following is the Depth-First Search")
-dfs(visited, graph, 'A')
diff --git a/Dijkstra.py b/Dijkstra.py
deleted file mode 100644
index 9a99b22..0000000
--- a/Dijkstra.py
+++ /dev/null
@@ -1,39 +0,0 @@
-import sys
-
-class Graph(object):
- def __init__(self, nodes, init_graph):
- self.nodes = nodes
- self.graph = self.construct_graph(nodes, init_graph)
-
- def construct_graph(self, nodes, init_graph):
- '''
- This method makes sure that the graph is symmetrical. In other words, if there's a path from node A to B with a value V, there needs to be a path from node B to node A with a value V.
- '''
- graph = {}
- for node in nodes:
- graph[node] = {}
-
- graph.update(init_graph)
-
- for node, edges in graph.items():
- for adjacent_node, value in edges.items():
- if graph[adjacent_node].get(node, False) == False:
- graph[adjacent_node][node] = value
-
- return graph
-
- def get_nodes(self):
- "Returns the nodes of the graph."
- return self.nodes
-
- def get_outgoing_edges(self, node):
- "Returns the neighbors of a node."
- connections = []
- for out_node in self.nodes:
- if self.graph[node].get(out_node, False) != False:
- connections.append(out_node)
- return connections
-
- def value(self, node1, node2):
- "Returns the value of an edge between two nodes."
- return self.graph[node1][node2]
diff --git a/DinoGame.py b/DinoGame.py
deleted file mode 100644
index c69c4cb..0000000
--- a/DinoGame.py
+++ /dev/null
@@ -1,52 +0,0 @@
-import pyautogui # pip install pyautogui
-from PIL import Image, ImageGrab # pip install pillow
-# from numpy import asarray
-import time
-
-
-def hit(key):
- pyautogui.keyDown(key)
- return
-
-
-def isCollide(data):
- # Draw the rectangle for birds
- for i in range(300, 415):
- for j in range(410, 563):
- if data[i, j] < 100:
- hit("down")
- return
-
- for i in range(300, 415):
- for j in range(563, 650):
- if data[i, j] < 100:
- hit("up")
- return
- return
-
-
-if __name__ == "__main__":
- print("Hey.. Dino game about to start in 3 seconds")
- time.sleep(2)
- # hit('up')
-
- while True:
- image = ImageGrab.grab().convert('L')
- data = image.load()
- isCollide(data)
-
- # print(asarray(image))
- '''
- # Draw the rectangle for cactus
- for i in range(275, 325):
- for j in range(563, 650):
- data[i, j] = 0
-
- # Draw the rectangle for birds
- for i in range(250, 300):
- for j in range(410, 563):
- data[i, j] = 171
-
- image.show()
- break
- '''
\ No newline at end of file
diff --git a/Egg_Dropping_Puzzle.py b/Egg_Dropping_Puzzle.py
deleted file mode 100644
index 3e6952a..0000000
--- a/Egg_Dropping_Puzzle.py
+++ /dev/null
@@ -1,27 +0,0 @@
-INT_MAX = 32767
-
-def eggDrop(n, k):
-
- eggFloor = [[0 for x in range(k + 1)] for x in range(n + 1)]
-
- for i in range(1, n + 1):
- eggFloor[i][1] = 1
- eggFloor[i][0] = 0
-
- for j in range(1, k + 1):
- eggFloor[1][j] = j
-
- for i in range(2, n + 1):
- for j in range(2, k + 1):
- eggFloor[i][j] = INT_MAX
- for x in range(1, j + 1):
- res = 1 + max(eggFloor[i-1][x-1], eggFloor[i][j-x])
- if res < eggFloor[i][j]:
- eggFloor[i][j] = res
-
- return eggFloor[n][k]
-
-n = 2
-k = 36
-print("Minimum number of trials in worst case with" + str(n) + "eggs and "
- + str(k) + " floors is " + str(eggDrop(n, k)))
diff --git a/Exceptional Handling in Python b/Exceptional Handling in Python
deleted file mode 100644
index 561aca5..0000000
--- a/Exceptional Handling in Python
+++ /dev/null
@@ -1,292 +0,0 @@
-Exceptional Handling in Python :
-Exception Handling
-
-An Exception (error) is an event due to which the normal flow of the program's instructions gets disrupted.
-Errors in Python can be of the following two types i.e. Syntax errors and Exceptions.
-• While exceptions are raised when some internal events occur which changes the normal flow of the program.
-• On the other hand, Errors are those type of problems in a program due to which the program will stop the execution.
-
-Difference between Syntax Errors and Exceptions
-
-Syntax Error: As the name that it has suggests that this error is caused by the wrong syntax in the code. It leads to the termination of the program.
-
-Example:
-
-Consider the given code snippet:
-
-val = 10
-
-if(val > 20)
- print("Example")
-
-We will get the output as:
-
-Output:
-
-SyntaxError: invalid syntax
-
-The syntax error is because there should be a “:” (colon) at the end of an if statement. Since that is not present in the program, it gives a syntax error.
-
-Exceptions: Exceptions are raised when the program is syntactically correct but the code resulted in an error. This error does not stop the execution of the program, however, it changes the normal flow of the program.
-
-Example:
-
-Consider the given code snippet:
-
-balance = 10000
-rem = balance / 0
-print(rem)
-
-We will get the output as:
-
-Output:
-
-ZeroDivisionError: division by zero
-
-The above example raised the ZeroDivisionError exception, as we are trying to divide a number by 0 which is not defined and arithmetically not possible.
-
-
-Exceptions in Python
-
-• Python has many built-in exceptions that are raised when your program encounters an error (something in the program goes wrong).
-• When these exceptions occur, the Python interpreter stops the current process and passes it to the calling process until it is handled.
-• If not handled, the program will crash.
-• For example, let us consider a program where we have a function A that calls function B, which in turn calls function C. If an exception occurs in function C but is not handled in C, the exception passes to B and then to A.
-• If never handled, an error message is displayed and the program comes to a sudden unexpected halt.
-
-Some Common Exceptions
-
-A list of common exceptions that can be thrown from a standard Python program is given below.
-• ZeroDivisionError: This occurs when a number is divided by zero.
-• NameError: It occurs when a name is not found. It may be local or global.
-• IndentationError: It occurs when incorrect indentation is given.
-• IOError: It occurs when an Input-Output operation fails.
-• EOFError: It occurs when the end of the file is reached, and yet operations are being performed.
-
-Catching Exceptions
-
-In Python, exceptions can be handled using try-except blocks.
-• If the Python program contains suspicious code that may throw the exception, we must place that code in the try block.
-• The try block must be followed by the except statement, which contains a block of code that will be executed in case there is some exception in the try block.
-• We can thus choose what operations to perform once we have caught the exception.
-
-
-
-Syntax:
-
-try:
- # Some Code....
-
-except:
- # optional block
- # Handling of exception (if required)
-
-Example:
-
-l = ['a', 0, 2]
-
-for ele in l:
- try:
- print("The entry is", ele)
- r = 1/int(ele)
-
- except Exception as e: #Using Exception class
- print("Oops!", e.__class__, "occurred.")
- print("Next entry.")
- print()
-
- print("The reciprocal of", ele, "is", r)
-
-We get the output to this code as:
-
-The entry is a
-Oops! occurred.
-
-The entry is 0
-Oops! occured.
-
-The entry is 2 T
-The reciprocal of 2 is 0.5
-• In this program, we loop through the values of a list l.
-• As previously mentioned, the portion that can cause an exception is placed inside the try block.
-• If no exception occurs, the except block is skipped and normal flow continues(for last value).
-• But if any exception occurs, it is caught by the except block (first and second values).
-• Here, we print the name of the exception using the exc_info() function inside sys module.
-• We can see that element “a” causes ValueError and 0 causes ZeroDivisionError.
-
-Every exception in Python inherits from the base Exception class. Thus we can write the above code as:
-
-l = ['a', 0, 2]
-for ele in l:
- try:
- print("The entry is", ele)
- r = 1/int(ele)
-
- except Exception as e: #Using Exception class
-
- print("Oops!", e.__class__, "occurred.")
- print("Next entry.")
- print()
-
-print("The reciprocal of", ele, "is", r)
-
-Output:
-
-This program has the same output as the above program.
-
-Catching Specific Exceptions in Python
-
-• In the above example, we did not mention any specific exception in the except clause.
-• This is not a good programming practice as it will catch all exceptions and handle every case in the same way.
-• We can specify which exceptions an except clause should catch.
-• A try clause can have any number of except clauses to handle different exceptions, however, only one will be executed in case an exception occurs.
-• You can use multiple except blocks for different types of exceptions.
-• We can even use a tuple of values to specify multiple exceptions in an except clause. Here is an example to understand this better:
-
-Syntax:
-
-try:
- # Some Code....
-except:
- # optional block
- # Handling of exception (if required)
-
-Example:
-
-try:
- a=10/0
-
-except(ArithmeticError, IOError):
- print("Arithmetic Exception")
-
-Output:
-
-Arithmetic Exception
-
-
-try-except-else Statements
-
-We can also use the else statement with the try-except statement in which, we can place the code which will be executed in the scenario if no exception occurs in the else block. The syntax is given below:
-
-
-
-Syntax:
-
-try:
- # Some Code....
-
-except:
- # optional block
- # Handling of exception (if required)
-
-else:
- # execute if no exception
-Consider the example code to understand this better:
-
-Example:
-
-try:
- c = 2/1
-
-except Exception as e:
- print("can't divide by zero")
- print(e)
-
-else:
- print("Hi I am else block")
-
-Output:
-
-Hi I am else block
-
-We get this output because there is no exception in the try block and hence the else block is executed. If there was an exception in the try block, the else block will be skipped and except block will be executed.
-
-
-finally Statement
-
-
-Syntax:
-
-try:
- # Some Code....
-
-except:
- # optional block
- # Handling of exception (if required)
-
-else:
- # execute if no exception
-
-finally:
- # Some code .....(always executed)
-
-The try statement in Python can have an optional finally clause. This clause is executed no matter what and is generally used to release external resources. Here is an example of file operations to illustrate this:
-
-Let’s first understand how the try and except works –
-• First, the try clause is executed i.e. the code between try and except clause.
-• If there is no exception, then only the try clause will run, except the clause will not get executed.
-• If any exception occurs, the try clause will be skipped and except clause will run.
-• If any exception occurs, but the except clause within the code doesn’t handle it, it is passed on to the outer try statements. If the exception is left unhandled, then the execution stops.
-• A try statement can have more than one except clause.
-
-Example: Let us try to take user integer input and throw the exception in except block.
-
-# Python code to illustrate
-# working of try()
-
-def divide(x, y):
-
- try:
- # Floor Division : Gives only Fractional
- # Part as Answer
- result = x // y
-
- except ZeroDivisionError:
- print("Sorry ! You are dividing by zero ")
- else:
- print("Yeah ! Your answer is :", result)
- finally:
- # this block is always executed
- # regardless of exception generation.
- print('This is always executed')
-
-# Look at parameters and note the working of Program
-divide(3, 2)
-divide(3, 0)
-
-Output:
-
-Yeah! Your answer is: 1
-This is always executed
-Sorry! You are dividing by zero
-This is always executed
-
-Raising Exceptions in Python
-
-In Python programming, exceptions are raised when errors occur at runtime. We can also manually raise exceptions using the raise keyword. We can optionally pass values to the exception to clarify why that exception was raised. Given below are some examples to help you understand this better
-
->>> raise KeyboardInterrupt
-Traceback (most recent call last):
-...
-KeyboardInterrupt
-
->>> raise MemoryError("This is an argument")
-Traceback (most recent call last):
-...
-MemoryError: This is an argument
-
-Now, consider the given code snippet:
-
-Example:
-
-try:
- a = -2
- if a <= 0:
- raise ValueError("That is not a positive number!")
-
-except ValueError as ve:
- print(ve)
-
-Output:
-
-That is not a positive number!
diff --git a/Fibonacci.py b/Fibonacci.py
deleted file mode 100644
index ffbdece..0000000
--- a/Fibonacci.py
+++ /dev/null
@@ -1,25 +0,0 @@
-# Program to display the Fibonacci sequence up to n-th term
-
-nterms = int(input("How many terms? "))
-
-# first two terms
-n1, n2 = 0, 1
-count = 0
-
-# check if the number of terms is valid
-if nterms <= 0:
- print("Please enter a positive integer")
-# if there is only one term, return n1
-elif nterms == 1:
- print("Fibonacci sequence upto",nterms,":")
- print(n1)
-# generate fibonacci sequence
-else:
- print("Fibonacci sequence:")
- while count < nterms:
- print(n1)
- nth = n1 + n2
- # update values
- n1 = n2
- n2 = nth
- count += 1
diff --git a/Flappy Bird Game b/Flappy Bird Game
deleted file mode 100644
index 895207e..0000000
--- a/Flappy Bird Game
+++ /dev/null
@@ -1,222 +0,0 @@
-import random # For generating random numbers
-import sys # We will use sys.exit to exit the program
-import pygame
-from pygame.locals import * # Basic pygame imports
-
-# Global Variables for the game
-FPS = 32
-SCREENWIDTH = 289
-SCREENHEIGHT = 511
-SCREEN = pygame.display.set_mode((SCREENWIDTH, SCREENHEIGHT))
-GROUNDY = SCREENHEIGHT * 0.8
-GAME_SPRITES = {}
-GAME_SOUNDS = {}
-PLAYER = 'gallery/sprites/bird.png'
-BACKGROUND = 'gallery/sprites/background.png'
-PIPE = 'gallery/sprites/pipe.png'
-
-def welcomeScreen():
- """
- Shows welcome images on the screen
- """
-
- playerx = int(SCREENWIDTH/5)
- playery = int((SCREENHEIGHT - GAME_SPRITES['player'].get_height())/2)
- messagex = int((SCREENWIDTH - GAME_SPRITES['message'].get_width())/2)
- messagey = int(SCREENHEIGHT*0.13)
- basex = 0
- while True:
- for event in pygame.event.get():
- # if user clicks on cross button, close the game
- if event.type == QUIT or (event.type==KEYDOWN and event.key == K_ESCAPE):
- pygame.quit()
- sys.exit()
-
- # If the user presses space or up key, start the game for them
- elif event.type==KEYDOWN and (event.key==K_SPACE or event.key == K_UP):
- return
- else:
- SCREEN.blit(GAME_SPRITES['background'], (0, 0))
- SCREEN.blit(GAME_SPRITES['player'], (playerx, playery))
- SCREEN.blit(GAME_SPRITES['message'], (messagex,messagey ))
- SCREEN.blit(GAME_SPRITES['base'], (basex, GROUNDY))
- pygame.display.update()
- FPSCLOCK.tick(FPS)
-
-def mainGame():
- score = 0
- playerx = int(SCREENWIDTH/5)
- playery = int(SCREENWIDTH/2)
- basex = 0
-
- # Create 2 pipes for blitting on the screen
- newPipe1 = getRandomPipe()
- newPipe2 = getRandomPipe()
-
- # my List of upper pipes
- upperPipes = [
- {'x': SCREENWIDTH+200, 'y':newPipe1[0]['y']},
- {'x': SCREENWIDTH+200+(SCREENWIDTH/2), 'y':newPipe2[0]['y']},
- ]
- # my List of lower pipes
- lowerPipes = [
- {'x': SCREENWIDTH+200, 'y':newPipe1[1]['y']},
- {'x': SCREENWIDTH+200+(SCREENWIDTH/2), 'y':newPipe2[1]['y']},
- ]
-
- pipeVelX = -4
-
- playerVelY = -9
- playerMaxVelY = 10
- playerMinVelY = -8
- playerAccY = 1
-
- playerFlapAccv = -8 # velocity while flapping
- playerFlapped = False # It is true only when the bird is flapping
-
-
- while True:
- for event in pygame.event.get():
- if event.type == QUIT or (event.type == KEYDOWN and event.key == K_ESCAPE):
- pygame.quit()
- sys.exit()
- if event.type == KEYDOWN and (event.key == K_SPACE or event.key == K_UP):
- if playery > 0:
- playerVelY = playerFlapAccv
- playerFlapped = True
- GAME_SOUNDS['wing'].play()
-
-
- crashTest = isCollide(playerx, playery, upperPipes, lowerPipes) # This function will return true if the player is crashed
- if crashTest:
- return
-
- #check for score
- playerMidPos = playerx + GAME_SPRITES['player'].get_width()/2
- for pipe in upperPipes:
- pipeMidPos = pipe['x'] + GAME_SPRITES['pipe'][0].get_width()/2
- if pipeMidPos<= playerMidPos < pipeMidPos +4:
- score +=1
- print(f"Your score is {score}")
- GAME_SOUNDS['point'].play()
-
-
- if playerVelY GROUNDY - 25 or playery<0:
- GAME_SOUNDS['hit'].play()
- return True
-
- for pipe in upperPipes:
- pipeHeight = GAME_SPRITES['pipe'][0].get_height()
- if(playery < pipeHeight + pipe['y'] and abs(playerx - pipe['x']) < GAME_SPRITES['pipe'][0].get_width()):
- GAME_SOUNDS['hit'].play()
- return True
-
- for pipe in lowerPipes:
- if (playery + GAME_SPRITES['player'].get_height() > pipe['y']) and abs(playerx - pipe['x']) < GAME_SPRITES['pipe'][0].get_width():
- GAME_SOUNDS['hit'].play()
- return True
-
- return False
-
-def getRandomPipe():
- """
- Generate positions of two pipes(one bottom straight and one top rotated ) for blitting on the screen
- """
- pipeHeight = GAME_SPRITES['pipe'][0].get_height()
- offset = SCREENHEIGHT/3
- y2 = offset + random.randrange(0, int(SCREENHEIGHT - GAME_SPRITES['base'].get_height() - 1.2 *offset))
- pipeX = SCREENWIDTH + 10
- y1 = pipeHeight - y2 + offset
- pipe = [
- {'x': pipeX, 'y': -y1}, #upper Pipe
- {'x': pipeX, 'y': y2} #lower Pipe
- ]
- return pipe
-
-
-
-
-
-
-if __name__ == "__main__":
- # This will be the main point from where our game will start
- pygame.init() # Initialize all pygame's modules
- FPSCLOCK = pygame.time.Clock()
- pygame.display.set_caption('Flappy Bird by CodeWithHarry')
- GAME_SPRITES['numbers'] = (
- pygame.image.load('gallery/sprites/0.png').convert_alpha(),
- pygame.image.load('gallery/sprites/1.png').convert_alpha(),
- pygame.image.load('gallery/sprites/2.png').convert_alpha(),
- pygame.image.load('gallery/sprites/3.png').convert_alpha(),
- pygame.image.load('gallery/sprites/4.png').convert_alpha(),
- pygame.image.load('gallery/sprites/5.png').convert_alpha(),
- pygame.image.load('gallery/sprites/6.png').convert_alpha(),
- pygame.image.load('gallery/sprites/7.png').convert_alpha(),
- pygame.image.load('gallery/sprites/8.png').convert_alpha(),
- pygame.image.load('gallery/sprites/9.png').convert_alpha(),
- )
-
- GAME_SPRITES['message'] =pygame.image.load('gallery/sprites/message.png').convert_alpha()
- GAME_SPRITES['base'] =pygame.image.load('gallery/sprites/base.png').convert_alpha()
- GAME_SPRITES['pipe'] =(pygame.transform.rotate(pygame.image.load( PIPE).convert_alpha(), 180),
- pygame.image.load(PIPE).convert_alpha()
- )
-
- # Game sounds
- GAME_SOUNDS['die'] = pygame.mixer.Sound('gallery/audio/die.wav')
- GAME_SOUNDS['hit'] = pygame.mixer.Sound('gallery/audio/hit.wav')
- GAME_SOUNDS['point'] = pygame.mixer.Sound('gallery/audio/point.wav')
- GAME_SOUNDS['swoosh'] = pygame.mixer.Sound('gallery/audio/swoosh.wav')
- GAME_SOUNDS['wing'] = pygame.mixer.Sound('gallery/audio/wing.wav')
-
- GAME_SPRITES['background'] = pygame.image.load(BACKGROUND).convert()
- GAME_SPRITES['player'] = pygame.image.load(PLAYER).convert_alpha()
-
- while True:
- welcomeScreen() # Shows welcome screen to the user until he presses a button
- mainGame() # This is the main game function
diff --git a/GCD.py b/GCD.py
deleted file mode 100644
index e506a0d..0000000
--- a/GCD.py
+++ /dev/null
@@ -1,12 +0,0 @@
-def gcd(x, y):
- gcd = 1
- if x % y == 0:
- return y
- for k in range(int(y / 2), 0, -1):
- if x % k == 0 and y % k == 0:
- gcd = k
- break
- return gcd
-print("GCD of 12 & 17 =",gcd(12, 17))
-print("GCD of 4 & 6 =",gcd(4, 6))
-print("GCD of 336 & 360 =",gcd(336, 360))
diff --git a/GOLDEN RATIO(VA).py b/GOLDEN RATIO(VA).py
deleted file mode 100644
index 5e2a8ec..0000000
--- a/GOLDEN RATIO(VA).py
+++ /dev/null
@@ -1,313 +0,0 @@
-#GOLDEN RATIO Perfecto
-# importing libraries
-from PyQt5.QtWidgets import *
-from PyQt5 import QtCore, QtGui
-from PyQt5.QtGui import *
-from PyQt5.QtCore import *
-import datetime
-import sys
-
-
-class Window(QMainWindow):
-
- def __init__(self):
- super().__init__()
-
- # setting title
- self.setWindowTitle("Python ")
-
- # width of window
- self.w_width = 400
-
- # height of window
- self.w_height = 430
-
- # setting geometry
- self.setGeometry(100, 100, self.w_width, self.w_height)
-
- # calling method
- self.UiComponents()
-
- # showing all the widgets
- self.show()
-
- # method for components
- def UiComponents(self):
-
- # creating head label
- head = QLabel("Golden Ratio Calculator", self)
-
- head.setWordWrap(True)
-
- # setting geometry to the head
- head.setGeometry(0, 10, 400, 60)
-
- # font
- font = QFont('Times', 15)
- font.setBold(True)
- font.setItalic(True)
- font.setUnderline(True)
-
- # setting font to the head
- head.setFont(font)
-
- # setting alignment of the head
- head.setAlignment(Qt.AlignCenter)
-
- # setting color effect to the head
- color = QGraphicsColorizeEffect(self)
- color.setColor(Qt.darkCyan)
- head.setGraphicsEffect(color)
-
-
- # creating a radio button
- self.length1 = QRadioButton("First Length (A)", self)
-
- # setting geometry
- self.length1.setGeometry(50, 90, 140, 40)
-
- # setting font
- self.length1.setFont(QFont('Times', 9))
-
- # creating a spin box
- self.l1 = QSpinBox(self)
- self.l1.setMaximum(999999)
-
- # setting geometry to the spin box
- self.l1.setGeometry(200, 90, 160, 40)
-
- # setting font
- self.l1.setFont(QFont('Times', 9))
-
- # setting alignment
- self.l1.setAlignment(Qt.AlignCenter)
-
- # creating a radio button
- self.length2 = QRadioButton("Second Length (B)", self)
-
- # setting geometry
- self.length2.setGeometry(50, 150, 145, 40)
-
- # setting font
- self.length2.setFont(QFont('Times', 9))
-
- # creating a spin box
- self.l2 = QSpinBox(self)
- self.l2.setMaximum(999999)
-
- # setting geometry to the spin box
- self.l2.setGeometry(200, 150, 160, 40)
-
- # setting font
- self.l2.setFont(QFont('Times', 9))
-
- # setting alignment
- self.l2.setAlignment(Qt.AlignCenter)
-
- # creating a radio button
- self.length_sum = QRadioButton("First + Second ", self)
-
- # setting geometry
- self.length_sum.setGeometry(50, 200, 140, 40)
-
- # setting font
- self.length_sum.setFont(QFont('Times', 9))
-
- # creating a spin box
- self.l_s = QSpinBox(self)
- self.l_s.setMaximum(999999)
-
- # setting geometry to the spin box
- self.l_s.setGeometry(200, 200, 160, 40)
-
- # setting font
- self.l_s.setFont(QFont('Times', 9))
-
- # setting alignment
- self.l_s.setAlignment(Qt.AlignCenter)
-
- # adding same action to all the radio button
- self.length1.clicked.connect(self.radio_method)
- self.length2.clicked.connect(self.radio_method)
- self.length_sum.clicked.connect(self.radio_method)
-
- # adding same action to all the spin box
- self.l1.valueChanged.connect(self.spin_method)
- self.l2.valueChanged.connect(self.spin_method)
- self.l_s.valueChanged.connect(self.spin_method)
-
- # making all the spin box disabled
- self.l1.setDisabled(True)
- self.l2.setDisabled(True)
- self.l_s.setDisabled(True)
-
-
-
- # creating a push button
- calculate = QPushButton("Calculate", self)
-
- # setting geometry to the push button
- calculate.setGeometry(100, 270, 200, 40)
-
- # adding action to the button
- calculate.clicked.connect(self.calculate)
-
- # adding color effect to the push button
- color = QGraphicsColorizeEffect()
- color.setColor(Qt.blue)
- calculate.setGraphicsEffect(color)
-
-
- # creating a label to show result
- self.result = QLabel(self)
-
- # setting properties to result label
- self.result.setAlignment(Qt.AlignCenter)
-
- # setting geometry
- self.result.setGeometry(50, 330, 300, 70)
-
- # making it multi line
- self.result.setWordWrap(True)
-
- # setting stylesheet
- # adding border and background
- self.result.setStyleSheet("QLabel"
- "{"
- "border : 3px solid black;"
- "background : white;"
- "}")
-
- # setting font
- self.result.setFont(QFont('Arial', 11))
-
-
- # method called by the radio buttons
- def radio_method(self):
-
- # checking who is checked and who is unchecked
- # if first radio button is checked
- if self.length1.isChecked():
-
- # making first spin box enable
- self.l1.setEnabled(True)
-
- # making rest two spin box disable
- self.l2.setDisabled(True)
- self.l_s.setDisabled(True)
-
-
- # assigning flags
- self.check1 = True
- self.check2 = False
- self.check_sum = False
-
- elif self.length2.isChecked():
-
- # making second spin box enable
- self.l2.setEnabled(True)
-
- # making rest two spin box disable
- self.l1.setDisabled(True)
- self.l_s.setDisabled(True)
-
-
- # assigning flags
- self.check1 = False
- self.check2 = True
- self.check_sum = False
-
-
- elif self.length_sum.isChecked():
-
- # making third spin box enable
- self.l_s.setEnabled(True)
-
- # making rest two spin box disable
- self.l1.setDisabled(True)
- self.l2.setDisabled(True)
-
-
- # assigning flags
- self.check1 = False
- self.check2 = False
- self.check_sum = True
-
- def spin_method(self):
-
- # finding who called the method
- if self.l1.isEnabled():
-
- # setting current values
- self.l2.setValue(0)
- self.l_s.setValue(0)
-
-
- elif self.l2.isEnabled():
-
- # setting current values
- self.l1.setValue(0)
- self.l_s.setValue(0)
-
- else:
- # setting current values
- self.l2.setValue(0)
- self.l1.setValue(0)
-
- def calculate(self):
-
-
-
- golden = 1.61803398875
-
-
- # if first value is selected
- if self.check1 == True:
-
- # getting spin box value
- A = self.l1.value()
-
- B = A / golden
-
- Sum = A + B
-
- elif self.check2 == True:
-
- # getting spin box value
- B = self.l2.value()
-
- A = B * golden
-
- Sum = A + B
-
- else:
- # getting spin box value
- Sum = self.l_s.value()
-
- A = Sum / golden
-
- B = Sum - A
-
-
-
- # formatting values upto two decimal
- A = "{:.2f}".format(A)
- B = "{:.2f}".format(B)
- Sum = "{:.2f}".format(Sum)
-
- # setting text to the label
- self.result.setText("A = " + str(A) + ", B = " + str(B) +
- " and Sum = " + str(Sum))
-
-
-
-
-
-# create pyqt5 app
-App = QApplication(sys.argv)
-
-# create the instance of our Window
-window = Window()
-
-# start the app
-sys.exit(App.exec())
diff --git a/Hack.c b/Hack.c
deleted file mode 100644
index dfcce05..0000000
--- a/Hack.c
+++ /dev/null
@@ -1,5 +0,0 @@
-#include
-void main()
-{
- printf("hello world");
-}
diff --git a/Hackk.py b/Hackk.py
deleted file mode 100644
index 0fa455a..0000000
--- a/Hackk.py
+++ /dev/null
@@ -1 +0,0 @@
-print(hello world)
diff --git a/Hackkk.py b/Hackkk.py
deleted file mode 100644
index 0fa455a..0000000
--- a/Hackkk.py
+++ /dev/null
@@ -1 +0,0 @@
-print(hello world)
diff --git a/Hacktoberfest.py b/Hacktoberfest.py
deleted file mode 100644
index 0fa455a..0000000
--- a/Hacktoberfest.py
+++ /dev/null
@@ -1 +0,0 @@
-print(hello world)
diff --git a/Hacktoberfest2022.py b/Hacktoberfest2022.py
deleted file mode 100644
index cc66bec..0000000
--- a/Hacktoberfest2022.py
+++ /dev/null
@@ -1,11 +0,0 @@
-# If the number is positive, we print an appropriate message
-
-num = 3
-if num > 0:
- print(num, "is a positive number.")
-print("This is always printed.")
-
-num = -1
-if num > 0:
- print(num, "is a positive number.")
-print("This is also always printed.")
diff --git a/Hamiltonian_Cycle.py b/Hamiltonian_Cycle.py
deleted file mode 100644
index ba6cdc3..0000000
--- a/Hamiltonian_Cycle.py
+++ /dev/null
@@ -1,109 +0,0 @@
-# Python program for solution of
-# hamiltonian cycle problem
-
-class Graph():
- def __init__(self, vertices):
- self.graph = [[0 for column in range(vertices)]
- for row in range(vertices)]
- self.V = vertices
-
- ''' Check if this vertex is an adjacent vertex
- of the previously added vertex and is not
- included in the path earlier '''
- def isSafe(self, v, pos, path):
- # Check if current vertex and last vertex
- # in path are adjacent
- if self.graph[ path[pos-1] ][v] == 0:
- return False
-
- # Check if current vertex not already in path
- for vertex in path:
- if vertex == v:
- return False
-
- return True
-
- # A recursive utility function to solve
- # hamiltonian cycle problem
- def hamCycleUtil(self, path, pos):
-
- # base case: if all vertices are
- # included in the path
- if pos == self.V:
- # Last vertex must be adjacent to the
- # first vertex in path to make a cycle
- if self.graph[ path[pos-1] ][ path[0] ] == 1:
- return True
- else:
- return False
-
- # Try different vertices as a next candidate
- # in Hamiltonian Cycle. We don't try for 0 as
- # we included 0 as starting point in hamCycle()
- for v in range(1,self.V):
-
- if self.isSafe(v, pos, path) == True:
-
- path[pos] = v
-
- if self.hamCycleUtil(path, pos+1) == True:
- return True
-
- # Remove current vertex if it doesn't
- # lead to a solution
- path[pos] = -1
-
- return False
-
- def hamCycle(self):
- path = [-1] * self.V
-
- ''' Let us put vertex 0 as the first vertex
- in the path. If there is a Hamiltonian Cycle,
- then the path can be started from any point
- of the cycle as the graph is undirected '''
- path[0] = 0
-
- if self.hamCycleUtil(path,1) == False:
- print ("Solution does not exist\n")
- return False
-
- self.printSolution(path)
- return True
-
- def printSolution(self, path):
- print ("Solution Exists: Following",
- "is one Hamiltonian Cycle")
- for vertex in path:
- print (vertex, end = " ")
- print (path[0], "\n")
-
-# Driver Code
-
-''' Let us create the following graph
- (0)--(1)--(2)
- | / \ |
- | / \ |
- | / \ |
- (3)-------(4) '''
-g1 = Graph(5)
-g1.graph = [ [0, 1, 0, 1, 0], [1, 0, 1, 1, 1],
- [0, 1, 0, 0, 1,],[1, 1, 0, 0, 1],
- [0, 1, 1, 1, 0], ]
-
-# Print the solution
-g1.hamCycle();
-
-''' Let us create the following graph
- (0)--(1)--(2)
- | / \ |
- | / \ |
- | / \ |
- (3) (4) '''
-g2 = Graph(5)
-g2.graph = [ [0, 1, 0, 1, 0], [1, 0, 1, 1, 1],
- [0, 1, 0, 0, 1,], [1, 1, 0, 0, 0],
- [0, 1, 1, 0, 0], ]
-
-# Print the solution
-g2.hamCycle();
diff --git a/Harshpreet Singh5 b/Harshpreet Singh5
deleted file mode 100644
index 215c790..0000000
--- a/Harshpreet Singh5
+++ /dev/null
@@ -1,24 +0,0 @@
-def factorial(x):
-
- """This is a recursive function
-
- to find the factorial of an integer"""
-
- if x == 1:
-
- return 1
-
- else:
-
- return (x * factorial(x-1))
-
-num = 3
-
-print("The factorial of", num, "is", factorial(num))
-
-
-
-
-
-
-
diff --git a/Heap_sort.py b/Heap_sort.py
deleted file mode 100644
index a8c806b..0000000
--- a/Heap_sort.py
+++ /dev/null
@@ -1,52 +0,0 @@
-# Python program for implementation of heap Sort
-
-# To heapify subtree rooted at index i.
-# n is size of heap
-
-
-def heapify(arr, n, i):
- largest = i # Initialize largest as root
- l = 2 * i + 1 # left = 2*i + 1
- r = 2 * i + 2 # right = 2*i + 2
-
- # See if left child of root exists and is
- # greater than root
- if l < n and arr[largest] < arr[l]:
- largest = l
-
- # See if right child of root exists and is
- # greater than root
- if r < n and arr[largest] < arr[r]:
- largest = r
-
- # Change root, if needed
- if largest != i:
- arr[i], arr[largest] = arr[largest], arr[i] # swap
-
- # Heapify the root.
- heapify(arr, n, largest)
-
-# The main function to sort an array of given size
-
-
-def heapSort(arr):
- n = len(arr)
-
- # Build a maxheap.
- for i in range(n//2 - 1, -1, -1):
- heapify(arr, n, i)
-
- # One by one extract elements
- for i in range(n-1, 0, -1):
- arr[i], arr[0] = arr[0], arr[i] # swap
- heapify(arr, i, 0)
-
-
-# Driver code
-arr = [12, 11, 13, 5, 6, 7]
-heapSort(arr)
-n = len(arr)
-print("Sorted array is")
-for i in range(n):
- print("%d" % arr[i]),
-# This code is contributed by Mohit Kumra
diff --git a/IP_Address_HostName.py b/IP_Address_HostName.py
deleted file mode 100644
index 73d9d00..0000000
--- a/IP_Address_HostName.py
+++ /dev/null
@@ -1,13 +0,0 @@
-import socket;
-
-def host_IP():
- try:
- host_name = socket.gethostname()
- host_ip = socket.gethostbyname(host_name)
- print("Hostname : ",host_name)
- print("IP Address : ",host_ip)
- except:
- print("Unable to get Hostname and IP")
-
-
-host_IP()
\ No newline at end of file
diff --git a/ImageCompress.py b/ImageCompress.py
deleted file mode 100644
index aeb3893..0000000
--- a/ImageCompress.py
+++ /dev/null
@@ -1,59 +0,0 @@
-
-# import required libraries
-import os
-import sys
-from PIL import Image
-
-# define a function for
-# compressing an image
-def compressMe(file, verbose = False):
-
- # Get the path of the file
- filepath = os.path.join(os.getcwd(),
- file)
-
- # open the image
- picture = Image.open(filepath)
-
- # Save the picture with desired quality
- # To change the quality of image,
- # set the quality variable at
- # your desired level, The more
- # the value of quality variable
- # and lesser the compression
- picture.save("Compressed_"+file,
- "JPEG",
- optimize = True,
- quality = 10)
- return
-
-# Define a main function
-def main():
-
- verbose = False
-
- # checks for verbose flag
- if (len(sys.argv)>1):
-
- if (sys.argv[1].lower()=="-v"):
- verbose = True
-
- # finds current working dir
- cwd = os.getcwd()
-
- formats = ('.jpg', '.jpeg')
-
- # looping through all the files
- # in a current directory
- for file in os.listdir(cwd):
-
- # If the file format is JPG or JPEG
- if os.path.splitext(file)[1].lower() in formats:
- print('compressing', file)
- compressMe(file, verbose)
-
- print("Done")
-
-# Driver code
-if __name__ == "__main__":
- main()
diff --git a/Jump_search.py b/Jump_search.py
deleted file mode 100644
index 80f0868..0000000
--- a/Jump_search.py
+++ /dev/null
@@ -1,42 +0,0 @@
-# Jump Search
-import math
-
-def jumpSearch( arr , x , n ):
-
- # Find block size
- step = math.sqrt(n)
-
- # block where element is
- prev = 0
- while arr[int(min(step, n)-1)] < x:
- prev = step
- step += math.sqrt(n)
- if prev >= n:
- return -1
-
- # linear search for x
- while arr[int(prev)] < x:
- prev += 1
-
- #If we reach next block or end
- # of array, and element is not present.
- if prev == min(step, n):
- return -1
-
- # element found
- if arr[int(prev)] == x:
- return prev
-
- return -1
-
-# Driver code
-arr = [ 0, 1, 1, 2, 3, 5, 8, 13, 21,
- 34, 55, 89, 144, 233, 377, 610 ]
-x = 55
-n = len(arr)
-
-# finding the index of 'x'
-index = jumpSearch(arr, x, n)
-
-# where 'x' is located
-print("Number" , x, "is at index" ,"%.0f"%index)
diff --git a/Keshavgl.py b/Keshavgl.py
deleted file mode 100644
index a17a944..0000000
--- a/Keshavgl.py
+++ /dev/null
@@ -1,15 +0,0 @@
-class Factorial {
-
- static int factorial( int n ) {
- if (n != 0) // termination condition
- return n * factorial(n-1); // recursive call
- else
- return 1;
- }
-
- public static void main(String[] args) {
- int number = 4, result;
- result = factorial(number);
- System.out.println(number + " factorial = " + result);
- }
-}
diff --git a/KnapsackProblem b/KnapsackProblem
deleted file mode 100644
index d397936..0000000
--- a/KnapsackProblem
+++ /dev/null
@@ -1,36 +0,0 @@
-class KnapsackPackage(object):
- """ Knapsack Package Data Class """
- def __init__(self, weight, value):
- self.weight = weight
- self.value = value
- self.cost = value / weight
- def __lt__(self, other):
- return self.cost < other.cost
- if __name__ == "__main__":
- W = [15, 10, 2, 4]
- V = [30, 25, 2, 6]
- M = 37
- n = 4
- proc = FractionalKnapsack()
- proc.knapsackGreProc(W, V, M, n)
- class FractionalKnapsack(object):
- def __init__(self):
- def knapsackGreProc(self, W, V, M, n):
- packs = []
- for i in range(n):
- packs.append(KnapsackPackage(W[i], V[i]))
- packs.sort(reverse = True)
- remain = M
- result = 0
- i = 0
- stopProc = False
- while (stopProc != True):
- if (packs[i].weight <= remain):
- remain -= packs[i].weight;
- result += packs[i].value;
- print("Pack ", i, " - Weight ", packs[i].weight, " - Value ", packs[i].value)
- if (packs[i].weight > remain):
- i += 1
- if (i == n):
- stopProc = True
- print("Max Value:t", result)
diff --git a/LongestCommonSubsequence.cpp b/LongestCommonSubsequence.cpp
new file mode 100644
index 0000000..d51eaec
--- /dev/null
+++ b/LongestCommonSubsequence.cpp
@@ -0,0 +1,50 @@
+image.png// { Driver Code Starts
+#include
+using namespace std;
+
+ // } Driver Code Ends
+class Solution{
+ public:
+
+ int longestCommonSubstr (string S1, string S2, int n, int m)
+ {
+ int max_val=0;
+ vector> dp(n+1 ,vector (m+1 , 0));
+
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ if(S1[i-1] == S2[j-1])
+ {
+ dp[i][j] = dp[i-1][j-1] + 1;
+ max_val = max(max_val,dp[i][j]);
+ }else dp[i][j] = 0;
+
+
+ }
+
+ }
+ return max_val;
+
+
+ }
+};
+
+// { Driver Code Starts.
+
+int main()
+{
+ int t; cin >> t;
+ while (t--)
+ {
+ int n, m; cin >> n >> m;
+ string s1, s2;
+ cin >> s1 >> s2;
+ Solution ob;
+
+ cout << ob.longestCommonSubstr (s1, s2, n, m) << endl;
+ }
+}
+// Contributed By: Pranay Bansal
+ // } Driver Code Ends
\ No newline at end of file
diff --git a/Longest_Common_Subsequence.py b/Longest_Common_Subsequence.py
deleted file mode 100644
index bdf7405..0000000
--- a/Longest_Common_Subsequence.py
+++ /dev/null
@@ -1,23 +0,0 @@
-def lcs(X, Y):
- m = len(X)
- n = len(Y)
-
- L = [[None]*(n + 1) for i in range(m + 1)]
-
-
- for i in range(m + 1):
- for j in range(n + 1):
- if i == 0 or j == 0 :
- L[i][j] = 0
- elif X[i-1] == Y[j-1]:
- L[i][j] = L[i-1][j-1]+1
- else:
- L[i][j] = max(L[i-1][j], L[i][j-1])
-
- return L[m][n]
-
-
-
-X = "AGGTAB"
-Y = "GXTXAYB"
-print("Length of LCS is ", lcs(X, Y))
diff --git a/Magnet_puzzle.py b/Magnet_puzzle.py
deleted file mode 100644
index b732174..0000000
--- a/Magnet_puzzle.py
+++ /dev/null
@@ -1,197 +0,0 @@
-# Question link: https://people.eecs.berkeley.edu/~hilfingr/programming-contest/f2012-contest.pdf
-
-# THE SOLUTION:
-
-M = 5
-N = 6
-top = [ 1, -1, -1, 2, 1, -1 ]
-bottom = [ 2, -1, -1, 2, -1, 3 ]
-left = [ 2, 3, -1, -1, -1 ]
-right = [ -1, -1, -1, 1, -1 ]
-
-rules = [["L","R","L","R","T","T" ],
- [ "L","R","L","R","B","B" ],
- [ "T","T","T","T","L","R" ],
- [ "B","B","B","B","T","T" ],
- [ "L","R","L","R","B","B" ]];
-
-
-
-def canPutPatternHorizontally(rules,i,j,pat):
-
- if j-1>=0 and rules[i][j-1] == pat[0]:
- return False
- elif i-1>=0 and rules[i-1][j] == pat[0]:
- return False
- elif i-1>=0 and rules[i-1][j+1] == pat[1]:
- return False
- elif j+2 < len(rules[0]) and rules[i][j+2] == pat[1]:
- return False
-
- return True
-
-
-def canPutPatternVertically(rules,i,j,pat):
-
- if j-1>=0 and rules[i][j-1] == pat[0]:
- return False
- elif i-1>=0 and rules[i-1][j] == pat[0]:
- return False
- elif j+1 < len(rules[0]) and rules[i][j+1] == pat[0]:
- return False
-
- return True
-
-def doTheStuff(rules,i,j):
-
- if rules[i][j] == "L" or rules[i][j] == "R":
-
- # option 1 +-
- if canPutPatternHorizontally(rules,i,j,"+-"):
- rules[i][j] = "+"
- rules[i][j+1] = "-"
-
- solveMagnets(rules,i,j)
- # option 2 -+
-
- # option 3 xx
-
-def checkConstraints(rules):
-
- pCountH = [0 for i in range(len(rules))]
- nCountH = [0 for i in range(len(rules))]
- for row in range(len(rules)):
- for col in range(len(rules[0])):
- ch = rules[row][col]
- if ch == "+":
- pCountH[row] += 1
- elif ch == "-":
- nCountH[row] += 1
-
-
- pCountV = [0 for i in range(len(rules[0]))]
- nCountV = [0 for i in range(len(rules[0]))]
- for col in range(len(rules[0])):
- for row in range(len(rules)):
- ch = rules[row][col]
- if ch == "+":
- pCountV[col] += 1
- elif ch == "-":
- nCountV[col] += 1
-
-
- for row in range(len(rules)):
- if left[row] != -1:
- if pCountH[row] != left[row]:
- return False
- if right[row] != -1:
- if nCountH[row] != right[row]:
- return False
-
-
-
- for col in range(len(rules[0])):
- if top[col] != -1:
- if pCountV[col] != top[col]:
- return False
- if bottom[col] != -1:
- if nCountV[col] != bottom[col]:
- return False
- #
- # if (top[col] != -1 and pCountH[col] != top[col]) or (bottom[col] != -1 and nCountH[col] != bottom[col]) :
- # return False
-
- return True
-
-
-
-
-
-
-
-def solveMagnets(rules,i,j):
-
- if i == len(rules) and j == 0:
-
- # check the constraint before printing
- if checkConstraints(rules):
- print(rules)
- elif j >= len(rules[0]):
-
- solveMagnets(rules,i+1,0)
-
- # normal cases
- else:
-
- if rules[i][j] == "L":
-
- # option 1 +-
- if canPutPatternHorizontally(rules,i,j,"+-"):
- rules[i][j] = "+"
- rules[i][j+1] = "-"
-
- solveMagnets(rules,i,j+2)
-
- rules[i][j] = "L"
- rules[i][j+1] = "R"
-
- # option 2 -+
- if canPutPatternHorizontally(rules,i,j,"-+"):
- rules[i][j] = "-"
- rules[i][j+1] = "+"
-
- solveMagnets(rules,i,j+2)
-
- rules[i][j] = "L"
- rules[i][j+1] = "R"
-
- # option 3 xx
- if True or canPutPatternHorizontally(rules,i,j,"xx"):
- rules[i][j] = "x"
- rules[i][j+1] = "x"
-
- solveMagnets(rules,i,j+2)
-
- rules[i][j] = "L"
- rules[i][j+1] = "R"
-
- # vertical check
- elif rules[i][j] == "T":
-
- # option 1 +-
- if canPutPatternVertically(rules,i,j,"+-"):
- rules[i][j] = "+"
- rules[i+1][j] = "-"
-
- solveMagnets(rules,i,j+1)
-
- rules[i][j] = "T"
- rules[i+1][j] = "B"
-
- # option 2 -+
- if canPutPatternVertically(rules,i,j,"-+"):
- rules[i][j] = "-"
- rules[i+1][j] = "+"
-
- solveMagnets(rules,i,j+1)
-
- rules[i][j] = "T"
- rules[i+1][j] = "B"
-
- # option 3 xx
-
- if True or canPutPatternVertically(rules,i,j,"xx"):
- rules[i][j] = "x"
- rules[i+1][j] = "x"
-
- solveMagnets(rules,i,j+1)
-
- rules[i][j] = "T"
- rules[i+1][j] = "B"
-
- else:
- solveMagnets(rules,i,j+1)
-
-
-# Driver code
-solveMagnets(rules,0,0)
diff --git a/Matrix_Chain_Multiplication.py b/Matrix_Chain_Multiplication.py
deleted file mode 100644
index 6c00ecd..0000000
--- a/Matrix_Chain_Multiplication.py
+++ /dev/null
@@ -1,59 +0,0 @@
-def matrix_product(p):
-
- length = len(p) # len(p) = number of matrices + 1
-
- m = [[-1]*length for _ in range(length)]
- s = [[-1]*length for _ in range(length)]
-
- matrix_product_helper(p, 1, length - 1, m, s)
-
- return m, s
-
-
-def matrix_product_helper(p, start, end, m, s):
-
- if m[start][end] >= 0:
- return m[start][end]
-
- if start == end:
- q = 0
- else:
- q = float('inf')
- for k in range(start, end):
- temp = matrix_product_helper(p, start, k, m, s) \
- + matrix_product_helper(p, k + 1, end, m, s) \
- + p[start - 1]*p[k]*p[end]
- if q > temp:
- q = temp
- s[start][end] = k
-
- m[start][end] = q
- return q
-
-
-def print_parenthesization(s, start, end):
-
- if start == end:
- print('A[{}]'.format(start), end='')
- return
-
- k = s[start][end]
-
- print('(', end='')
- print_parenthesization(s, start, k)
- print_parenthesization(s, k + 1, end)
- print(')', end='')
-
-
-n = int(input('Enter number of matrices: '))
-p = []
-for i in range(n):
- temp = int(input('Enter number of rows in matrix {}: '.format(i + 1)))
- p.append(temp)
-temp = int(input('Enter number of columns in matrix {}: '.format(n)))
-p.append(temp)
-
-m, s = matrix_product(p)
-print('The number of scalar multiplications needed:', m[1][n])
-print('Optimal parenthesization: ', end='')
-print_parenthesization(s, 1, n)
diff --git a/Merge2List_Ascending.py b/Merge2List_Ascending.py
deleted file mode 100644
index 2b16669..0000000
--- a/Merge2List_Ascending.py
+++ /dev/null
@@ -1,26 +0,0 @@
-def merge2ListAsc(A,B) :
- la = len(A); lb = len(B)
- C = list()
- i = 0; j = 0
-
- # Merge2List
- while i < la and j < lb :
- if A[i] < B[j] :
- C.append(A[i])
- i += 1
- else :
- C.append(B[j])
- j += 1
-
- while i < la :
- C.append(A[i])
- i += 1
- while j < lb :
- C.append(B[j])
- j += 1
- return C
-
-A = [2,3,8,15,23,37]
-B = [4,6,12,15,20]
-C = merge2ListAsc(A, B)
-print(C)
diff --git a/Microsoft_logo_using_python.py b/Microsoft_logo_using_python.py
deleted file mode 100644
index 65300e6..0000000
--- a/Microsoft_logo_using_python.py
+++ /dev/null
@@ -1,63 +0,0 @@
-from turtle import *
-
-#change the pen speed
-
-speed(1)
-
-#change the screen color
-
-bgcolor("black")
-
-penup()
-
-#change the pen position
-
-goto(-50,60)
-
-pendown()
-
-color('#00adef')
-
-begin_fill()
-
-#change the position
-
-goto(100,100)
-
-goto(100,-100)
-
-goto(-50,-60)
-
-
-
-goto(-50,60)
-
-end_fill()
-
-
-
-color("black")
-
-goto(15,100)
-
-color("black")
-
-width(10)
-
-goto(15,-100)
-
-penup()
-
-
-
-goto(100,0)
-
-pendown()
-
-
-
-goto(-100,0)
-
-
-
-done()
diff --git a/Minimum Difficulty of a Job Schedule b/Minimum Difficulty of a Job Schedule
deleted file mode 100644
index b561e10..0000000
--- a/Minimum Difficulty of a Job Schedule
+++ /dev/null
@@ -1,19 +0,0 @@
-class Solution:
- def minDifficulty(self, jobDifficulty: List[int], d: int) -> int:
-
- if len(jobDifficulty) < d: return -1
- n = len(jobDifficulty)
-
- @lru_cache(None)
- def dp(cur_difficulty, i, d):
- if d == 1: return max(jobDifficulty[i:])
- if i == n-1: return inf
-
- cur_difficulty = max(cur_difficulty, jobDifficulty[i])
-
- change = cur_difficulty + dp(jobDifficulty[i+1], i+1, d-1)
- dont = dp(cur_difficulty, i+1, d)
-
- return min(change, dont)
-
- return dp(jobDifficulty[0], 0, d)
diff --git a/N-Queen4(FSS).cpp b/N-Queen4(FSS).cpp
deleted file mode 100644
index f7cfa58..0000000
--- a/N-Queen4(FSS).cpp
+++ /dev/null
@@ -1,74 +0,0 @@
-//This how to solve the N-Queen problem
-//grid[][] is represent the 2-d array with value(0 and 1) for grid[i][j]=1 means queen i are placed at j column.
-//we can take any number of queen , for this time we take the atmost 10 queen (grid[10][10]).
-#include
-using namespace std;
-int grid[10][10];
-
-//print the solution
-void print(int n) {
- for (int i = 0;i <= n-1; i++) {
- for (int j = 0;j <= n-1; j++) {
-
- cout <= 0 && j >= 0; i--,j--) {
- if (grid[i][j]) {
- return false;
- }
- }
- //check for upper right diagonal
- for (int i = row, j = col; i >= 0 && j < n; j++, i--) {
- if (grid[i][j]) {
- return false;
- }
- }
- return true;
-}
-
-//function to find the position for each queen
-//row is indicates the queen no. and col represents the possible positions
-bool solve (int n, int row) {
- if (n == row) {
- print(n);
- return true;
- }
- //variable res is use for possible backtracking
- bool res = false;
- for (int i = 0;i <=n-1;i++) {
- if (isSafe(i, row, n)) {
- grid[row][i] = 1;
- //recursive call solve(n, row+1) for next queen (row+1)
- res = solve(n, row+1) || res;//if res ==false then backtracking will occur
- //by assigning the grid[row][i] = 0
-
- grid[row][i] = 0;
- }
- }
- return res;
-}
-
-int main()
-{
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- int n;
- cout<<"Enter the number of queen"<> n;
diff --git a/N-Queen4(SSF).cpp b/N-Queen4(SSF).cpp
deleted file mode 100644
index 182b94f..0000000
--- a/N-Queen4(SSF).cpp
+++ /dev/null
@@ -1,87 +0,0 @@
-//MY Program to solve the N-Queen problem
-//grid[][] is represent the 2-d array with value(0 and 1) for grid[i][j]=1 means queen i are placed at j column.
-//we can take any number of queen , for this time we take the atmost 10 queen (grid[10][10]).
-#include
-using namespace std;
-int grid[10][10];
-
-//print the solution
-void print(int n) {
- for (int i = 0;i <= n-1; i++) {
- for (int j = 0;j <= n-1; j++) {
-
- cout <= 0 && j >= 0; i--,j--) {
- if (grid[i][j]) {
- return false;
- }
- }
- //check for upper right diagonal
- for (int i = row, j = col; i >= 0 && j < n; j++, i--) {
- if (grid[i][j]) {
- return false;
- }
- }
- return true;
-}
-
-//function to find the position for each queen
-//row is indicates the queen no. and col represents the possible positions
-bool solve (int n, int row) {
- if (n == row) {
- print(n);
- return true;
- }
- //variable res is use for possible backtracking
- bool res = false;
- for (int i = 0;i <=n-1;i++) {
- if (isSafe(i, row, n)) {
- grid[row][i] = 1;
- //recursive call solve(n, row+1) for next queen (row+1)
- res = solve(n, row+1) || res;//if res ==false then backtracking will occur
- //by assigning the grid[row][i] = 0
-
- grid[row][i] = 0;
- }
- }
- return res;
-}
-
-int main()
-{
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- int n;
- cout<<"Enter the number of queen"<> n;
- for (int i = 0;i < n;i++) {
- for (int j = 0;j < n;j++) {
- grid[i][j] = 0;
- }
- }
- bool res = solve(n, 0);
- if(res == false) {
- cout << -1 << endl; //if there is no possible solution
- } else {
- cout << endl;
- }
- return 0;
-}
diff --git a/N-Queen5(SFS).cpp b/N-Queen5(SFS).cpp
deleted file mode 100644
index 2319fec..0000000
--- a/N-Queen5(SFS).cpp
+++ /dev/null
@@ -1,71 +0,0 @@
-//Program to solve the N-Queen problem
-//grid[][] is represent the 2-d array with value(0 and 1) for grid[i][j]=1 means queen i are placed at j column.
-//we can take any number of queen , for this time we take the atmost 10 queen (grid[10][10]).
-#include
-using namespace std;
-int grid[10][10];
-
-//print the solution
-void print(int n) {
- for (int i = 0;i <= n-1; i++) {
- for (int j = 0;j <= n-1; j++) {
-
- cout <= 0 && j >= 0; i--,j--) {
- if (grid[i][j]) {
- return false;
- }
- }
- //check for upper right diagonal
- for (int i = row, j = col; i >= 0 && j < n; j++, i--) {
- if (grid[i][j]) {
- return false;
- }
- }
- return true;
-}
-
-//function to find the position for each queen
-//row is indicates the queen no. and col represents the possible positions
-bool solve (int n, int row) {
- if (n == row) {
- print(n);
- return true;
- }
- //variable res is use for possible backtracking
- bool res = false;
- for (int i = 0;i <=n-1;i++) {
- if (isSafe(i, row, n)) {
- grid[row][i] = 1;
- //recursive call solve(n, row+1) for next queen (row+1)
- res = solve(n, row+1) || res;//if res ==false then backtracking will occur
- //by assigning the grid[row][i] = 0
-
- grid[row][i] = 0;
- }
- }
- return res;
-}
-
-int main()
-{
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
diff --git a/New b/New
deleted file mode 100644
index d3b6be4..0000000
--- a/New
+++ /dev/null
@@ -1,12 +0,0 @@
-def factorial(x):
- """This is a recursive function
- to find the factorial of an integer"""
-
- if x == 1:
- return 1
- else:
- return (x * factorial(x-1))
-
-
-num = 3
-print("The factorial of", num, "is", factorial(num))
diff --git a/Number b/Number
deleted file mode 100644
index cd94c89..0000000
--- a/Number
+++ /dev/null
@@ -1,75 +0,0 @@
-def power_1(A, B):
-
-
-
- if B == 0:
-
- return 1
-
- if B % 2 == 0:
-
- return power_1(A, B // 2) * power(A, B // 2)
-
-
-
- return A * power(A, B // 2) * power(A, B // 2)
-
-
-
-# Function for calculating "order of the number"
-
-def order_1(A):
-
-
-
- # Variable for storing the number
-
- N = 0
-
- while (A != 0):
-
- N = N + 1
-
- A = A // 10
-
-
-
- return N
-
-
-
-# Function for checking if the given number is Armstrong number or not
-
-def is_Armstrong(A):
-
-
-
- N = order_1(A)
-
- temp_1 = A
-
- sum_1 = 0
-
-
-
- while (temp_1 != 0):
-
- R_1 = temp_1 % 10
-
- sum_1 = sum_1 + power_1(R_1, N)
-
- temp_1 = temp_1 // 10
-
-
-
- # If the above condition is satisfied, it will return the result
-
- return (sum_1 == A)
-
-
-
-# Driver code
-
-A = int(input("Please enter the number to be checked: "))
-
-print(is_Armstrong(A))
diff --git a/OTP Verification Feature/verify_otp.py b/OTP Verification Feature/verify_otp.py
deleted file mode 100644
index ab562b4..0000000
--- a/OTP Verification Feature/verify_otp.py
+++ /dev/null
@@ -1,21 +0,0 @@
-import os
-import math
-import random
-import smtplib
-
-digits="0123456789"
-OTP=""
-for i in range(6):
- OTP+=digits[math.floor(random.random()*10)]
-otp = OTP + " is your OTP. Please verify it."
-msg= otp
-s = smtplib.SMTP('smtp.gmail.com', 587)
-s.starttls()
-s.login("Your_Gmail_Account", "You_app_password")
-emailid = input("Enter your Email Id: ")
-s.sendmail('&&&&&&&&&&&',emailid,msg)
-a = input("Enter Your OTP >>: ")
-if a == OTP:
- print("Verified Successfully")
-else:
- print("Please Check your OTP again. Verification failed.")
diff --git a/Occuring b/Occuring
deleted file mode 100644
index aaaaa40..0000000
--- a/Occuring
+++ /dev/null
@@ -1,43 +0,0 @@
-# Python program to find the most occurring
-
-# character and its count
-
-from collections import Counter
-
-
-
-def find_most_occ_char(input):
-
-
-
- # now create dictionary using counter method
-
- # which will have strings as key and their
-
- # frequencies as value
-
- wc = Counter(input)
-
-
-
- # Finding maximum occurrence of a character
-
- # and get the index of it.
-
- s = max(wc.values())
-
- i = wc.values().index(s)
-
-
-
- print wc.items()[i]
-
-
-
-# Driver program
-
-if __name__ == "__main__":
-
- input = 'geeksforgeeks'
-
- find_most_occ_char(input)
diff --git a/PR b/PR
deleted file mode 100644
index b2bd1a5..0000000
--- a/PR
+++ /dev/null
@@ -1 +0,0 @@
-hello world
diff --git a/PYthon.2009 b/PYthon.2009
deleted file mode 100644
index 57d8c08..0000000
--- a/PYthon.2009
+++ /dev/null
@@ -1,61 +0,0 @@
-# Priority Queue implementation in Python
-
-
-# Function to heapify the tree
-def heapify(arr, n, i):
- # Find the largest among root, left child and right child
- largest = i
- l = 2 * i + 1
- r = 2 * i + 2
-
- if l < n and arr[i] < arr[l]:
- largest = l
-
- if r < n and arr[largest] < arr[r]:
- largest = r
-
- # Swap and continue heapifying if root is not largest
- if largest != i:
- arr[i], arr[largest] = arr[largest], arr[i]
- heapify(arr, n, largest)
-
-
-# Function to insert an element into the tree
-def insert(array, newNum):
- size = len(array)
- if size == 0:
- array.append(newNum)
- else:
- array.append(newNum)
- for i in range((size // 2) - 1, -1, -1):
- heapify(array, size, i)
-
-
-# Function to delete an element from the tree
-def deleteNode(array, num):
- size = len(array)
- i = 0
- for i in range(0, size):
- if num == array[i]:
- break
-
- array[i], array[size - 1] = array[size - 1], array[i]
-
- array.remove(size - 1)
-
- for i in range((len(array) // 2) - 1, -1, -1):
- heapify(array, len(array), i)
-
-
-arr = []
-
-insert(arr, 3)
-insert(arr, 4)
-insert(arr, 9)
-insert(arr, 5)
-insert(arr, 2)
-
-print ("Max-Heap array: " + str(arr))
-
-deleteNode(arr, 4)
-print("After deleting an element: " + str(arr))
diff --git a/Pattern.py b/Pattern.py
deleted file mode 100644
index 8809038..0000000
--- a/Pattern.py
+++ /dev/null
@@ -1,12 +0,0 @@
-# Python 3.x code to demonstrate star pattern
-
-# Function to demonstrate printing pattern
-def pypart(n):
- myList = []
- for i in range(1,n+1):
- myList.append("*"*i)
- print("\n".join(myList))
-
-# Driver Code
-n = 5
-pypart(n)
diff --git a/Perfect_number.py b/Perfect_number.py
deleted file mode 100644
index 6aea119..0000000
--- a/Perfect_number.py
+++ /dev/null
@@ -1,9 +0,0 @@
-n = int(input("Enter any number: "))
-sum1 = 0
-for i in range(1, n):
- if(n % i == 0):
- sum1 = sum1 + i
-if (sum1 == n):
- print("The number is a Perfect number!")
-else:
- print("The number is not a Perfect number!")
diff --git a/PongGame.py b/PongGame.py
deleted file mode 100644
index e2afeed..0000000
--- a/PongGame.py
+++ /dev/null
@@ -1,121 +0,0 @@
-import turtle as t
-playerAscore=0
-playerBscore=0
-
-#create a window and declare a variable called window and call the screen()
-window=t.Screen()
-window.title("The Pong Game")
-window.bgcolor("green")
-window.setup(width=800,height=600)
-window.tracer(0)
-
-#Creating the left paddle
-leftpaddle=t.Turtle()
-leftpaddle.speed(0)
-leftpaddle.shape("square")
-leftpaddle.color("white")
-leftpaddle.shapesize(stretch_wid=5,stretch_len=1)
-leftpaddle.penup()
-leftpaddle.goto(-350,0)
-
-#Creating the right paddle
-rightpaddle=t.Turtle()
-rightpaddle.speed(0)
-rightpaddle.shape("square")
-rightpaddle.color("white")
-rightpaddle.shapesize(stretch_wid=5,stretch_len=1)
-rightpaddle.penup()
-rightpaddle.goto(-350,0)
-
-#Code for creating the ball
-ball=t.Turtle()
-ball.speed(0)
-ball.shape("circle")
-ball.color("red")
-ball.penup()
-ball.goto(5,5)
-ballxdirection=0.2
-ballydirection=0.2
-
-#Code for creating pen for scorecard update
-pen=t.Turtle()
-pen.speed(0)
-pen.color("Blue")
-pen.penup()
-pen.hideturtle()
-pen.goto(0,260)
-pen.write("score",align="center",font=('Arial',24,'normal'))
-
-#code for moving the leftpaddle
-def leftpaddleup():
- y=leftpaddle.ycor()
- y=y+90
- leftpaddle.sety(y)
-
-def leftpaddledown():
- y=leftpaddle.ycor()
- y=y+90
- leftpaddle.sety(y)
-
-#code for moving the rightpaddle
-def rightpaddleup():
- y=rightpaddle.ycor()
- y=y+90
- rightpaddle.sety(y)
-
-def rightpaddledown():
- y=rightpaddle.ycor()
- y=y+90
- rightpaddle.sety(y)
-
-#Assign keys to play
-window.listen()
-window.onkeypress(leftpaddleup,'w')
-window.onkeypress(leftpaddledown,'s')
-window.onkeypress(rightpaddleup,'Up')
-window.onkeypress(rightpaddledown,'Down')
-
-while True:
- window.update()
-
- #moving the ball
- ball.setx(ball.xcor()+ballxdirection)
- ball.sety(ball.ycor()+ballxdirection)
-
- #border set up
- if ball.ycor()>290:
- ball.sety(290)
- ballydirection=ballydirection*-1
- if ball.ycor()<-290:
- ball.sety(-290)
- ballydirection=ballydirection*-1
-
- if ball.xcor() > 390:
- ball.goto(0,0)
- ball_dx = ball_dx * -1
- player_a_score = player_a_score + 1
- pen.clear()
- pen.write("Player A: {} Player B: {} ".format(player_a_score,player_b_score),align="center",font=('Monaco',24,"normal"))
- os.system("afplay wallhit.wav&")
-
-
-
- if(ball.xcor()) < -390: # Left width paddle Border
- ball.goto(0,0)
- ball_dx = ball_dx * -1
- player_b_score = player_b_score + 1
- pen.clear()
- pen.write("Player A: {} Player B: {} ".format(player_a_score,player_b_score),align="center",font=('Monaco',24,"normal"))
- os.system("afplay wallhit.wav&")
-
- # Handling the collisions with paddles.
-
- if(ball.xcor() > 340) and (ball.xcor() < 350) and (ball.ycor() < rightpaddle.ycor() + 40 and ball.ycor() > rightpaddle.ycor() - 40):
- ball.setx(340)
- ball_dx = ball_dx * -1
- os.system("afplay paddle.wav&")
-
- if(ball.xcor() < -340) and (ball.xcor() > -350) and (ball.ycor() < leftpaddle.ycor() + 40 and ball.ycor() > leftpaddle.ycor() - 40):
- ball.setx(-340)
- ball_dx = ball_dx * -1
- os.system("afplay paddle.wav&")
diff --git a/Port Scanner/README.md b/Port Scanner/README.md
deleted file mode 100644
index 9af626a..0000000
--- a/Port Scanner/README.md
+++ /dev/null
@@ -1,16 +0,0 @@
-# Simple Port Scanner in python
-
-This is a simple port scanner script written in python which can be used as a project for beginners
-
-## Setup
-1. Python3.x version should be installed in your system.
-2. Just download the python file and run it or open in any code editor if you want to edit it according to you.
-3. Command for running the script:
-* python3 port_scaner.py TARGET START_PORT END_PORT
- * "port_scanner.py" is the file name
- * TARGET - paste Ip address or domain name here
- * START_PORT END_PORT - range of port no. (from - to) which you want to scan.
- * See the demo picture below for more understanding.
-
-## Demo!
-
diff --git a/Port Scanner/port_scanner.py b/Port Scanner/port_scanner.py
deleted file mode 100644
index 6efdac6..0000000
--- a/Port Scanner/port_scanner.py
+++ /dev/null
@@ -1,38 +0,0 @@
-import socket
-import sys
-import time
-import threading
-
-usage = "python3 port_scaner.py TARGET START_PORT END_PORT"
-print("*"*70)
-print("Port Scanner")
-print("*"*70)
-start_time = time.time()
-
-# if user is not giving 4 arguments, then print the usage and exit
-if (len(sys.argv) != 4):
- print(usage)
- sys.exit()
-
-try:
- target = socket.gethostbyname(sys.argv[1])
-except socket.gaierror:
- print("Name Resolution Error")
- sys.exit()
-
-start_port = int(sys.argv[2])
-end_port = int(sys.argv[3])
-print("Scanning target", target)
-def scan_port(port):
- # print("Scanning", port)
- s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
- conn = s.connect_ex((target, port))
- if(not conn):
- print("Port {} is OPEN".format(port))
- s.close()
-for port in range(start_port, end_port + 1):
- thread = threading.Thread(target = scan_port, args = (port,))
- thread.start()
-
-end_time = time.time()
-print("Time Ellapsed:", end_time - start_time, "sec")
diff --git a/Position of element in array of infinite numbers.java b/Position of element in array of infinite numbers.java
deleted file mode 100644
index 82f3c3a..0000000
--- a/Position of element in array of infinite numbers.java
+++ /dev/null
@@ -1,31 +0,0 @@
-public class InfiniteArray {
- public static void main(String[] args) {
- int[] arr = {2,5,9,15,18,25,29,37,42,47,49,59,67,79,89,90,93,95,99,107};
- int target = 29;
- System.out.println(ans(arr, target));
- }
- static int ans(int[] arr, int target) {
- int start = 0;
- int end = 1;
- while (target > arr[end]) {
- int temp = end + 1;
- end = end + (end - start + 1) * 2;
- start = temp;
- }
- return binarySearch(arr, target, start, end);
-
- }
- static int binarySearch(int[] arr, int target, int start, int end) {
- while(start <= end) {
- int mid = start + (end - start) / 2;
- if (target < arr[mid]) {
- end = mid - 1;
- } else if (target > arr[mid]) {
- start = mid + 1;
- } else {
- return mid;
- }
- }
- return -1;
- }
-}
diff --git a/PyBinarySearch.py b/PyBinarySearch.py
deleted file mode 100644
index f0f5524..0000000
--- a/PyBinarySearch.py
+++ /dev/null
@@ -1,39 +0,0 @@
-# Iterative Binary Search Function
-# It returns index of x in given array arr if present,
-# else returns -1
-def binary_search(arr, x):
- low = 0
- high = len(arr) - 1
- mid = 0
-
- while low <= high:
-
- mid = (high + low) // 2
-
- # If x is greater, ignore left half
- if arr[mid] < x:
- low = mid + 1
-
- # If x is smaller, ignore right half
- elif arr[mid] > x:
- high = mid - 1
-
- # means x is present at mid
- else:
- return mid
-
- # If we reach here, then the element was not present
- return -1
-
-
-# Test array
-arr = [ 2, 3, 4, 10, 40 ]
-x = 10
-
-# Function call
-result = binary_search(arr, x)
-
-if result != -1:
- print("Element is present at index", str(result))
-else:
- print("Element is not present in array")
diff --git a/Pyramid_1.py b/Pyramid_1.py
deleted file mode 100644
index 1d03390..0000000
--- a/Pyramid_1.py
+++ /dev/null
@@ -1,22 +0,0 @@
-# Python 3.x code to demonstrate star pattern
-
-# Function to demonstrate printing pattern
-def pypart(n):
-
- # outer loop to handle number of rows
- # n in this case
- for i in range(0, n):
-
- # inner loop to handle number of columns
- # values changing acc. to outer loop
- for j in range(0, i+1):
-
- # printing stars
- print("* ",end="")
-
- # ending line after each row
- print("\r")
-
-# Driver Code
-n = 5
-pypart(n)
diff --git a/Python.py b/Python.py
deleted file mode 100644
index 7cb4596..0000000
--- a/Python.py
+++ /dev/null
@@ -1,80 +0,0 @@
-# Import random module
-import random
-print('Snake - Water - Gun')
-
-
-# Input no. of rounds
-n = int(input('Enter number of rounds: '))
-
-
-# List containing Snake(s), Water(w), Gun(g)
-options = ['s', 'w', 'g']
-
-# Round numbers
-rounds = 1
-
-# Count of computer wins
-comp_win = 0
-
-# Count of player wins
-user_win = 0
-
-
-# There will be n rounds of game
-while rounds <= n:
-
- # Display round
- print(f"Round :{rounds}\nSnake - 's'\nWater - 'w'\nGun - 'g'")
-
- # Exception handling
- try:
- player = input("Choose your option: ")
- except EOFError as e:
- print(e)
-
- # Control of bad inputs
- if player != 's' and player != 'w' and player != 'g':
- print("Invalid input, try again\n")
- continue
-
- # random.choice() will randomly choose
- # item from list- options
- computer = random.choice(options)
-
- # Conditions based on the game rule
- if computer == 's':
- if player == 'w':
- comp_win += 1
- elif player == 'g':
- user_win += 1
-
- elif computer == 'w':
- if player == 'g':
- comp_win += 1
- elif player == 's':
- user_win += 1
-
- elif computer == 'g':
- if player == 's':
- comp_win += 1
- elif player == 'w':
- user_win += 1
-
- # Announce winner of every round
- if user_win > comp_win:
- print(f"You Won round {rounds}\n")
- elif comp_win > user_win:
- print(f"Computer Won round {rounds}\n")
- else:
- print("Draw!!\n")
-
- rounds += 1
-
-
-# Final winner based on the number of wons
-if user_win > comp_win:
- print("Congratulations!! You Won")
-elif comp_win > user_win:
- print("You lose!!")
-else:
- print("Match Draw!!")
diff --git a/Python111.py b/Python111.py
deleted file mode 100644
index 7e2a8b4..0000000
--- a/Python111.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Python program to check if year is a leap year or not
-
-year = 2000
-
-# To get year (integer input) from the user
-# year = int(input("Enter a year: "))
-
-# divided by 100 means century year (ending with 00)
-# century year divided by 400 is leap year
-if (year % 400 == 0) and (year % 100 == 0):
- print("{0} is a leap year".format(year))
-
-# not divided by 100 means not a century year
-# year divided by 4 is a leap year
-elif (year % 4 ==0) and (year % 100 != 0):
- print("{0} is a leap year".format(year))
-
-# if not divided by both 400 (century year) and 4 (not century year)
-# year is not leap year
-else:
- print("{0} is not a leap year".format(year))
diff --git a/Python2.0 b/Python2.0
deleted file mode 100644
index 63b4e58..0000000
--- a/Python2.0
+++ /dev/null
@@ -1,17 +0,0 @@
-def factorial(x):
-
- """This is a recursive function
-
- to find the factorial of an integer"""
-
- if x == 1:
-
- return 1
-
- else:
-
- return (x * factorial(x-1))
-
-num = 3
-
-print("The factorial of", num, "is", factorial(num))
diff --git a/Qrgen.py b/Qrgen.py
deleted file mode 100644
index 443c2bd..0000000
--- a/Qrgen.py
+++ /dev/null
@@ -1,22 +0,0 @@
-import os
-import pyqrcode
-from PIL import Image
-
-class QR_Gen(object):
- def __init__(self,text):
- sefl.qr_image = self.qr_generator(text)
-
- @staticmethod
- def qr_generator(text):
- qr_code = pyqrcode.create(text)
- file_name = "QR Code Result"
- save_path = os.path.join(os.path.expanduser('~'),'Desktop')
-
- name = f"{save_path}{file_name}.png"
- qr_code.png(name, scale=10)
- image = Image.open(name)
- image = image.resize((400,400),Image.ANTIALIAS)
- image.show()
-
- if __name__ == "__main__":
- QR_Gen(input("[QR] Enter text or link: "))
diff --git a/README.md b/README.md
deleted file mode 100644
index 82680c5..0000000
--- a/README.md
+++ /dev/null
@@ -1,140 +0,0 @@
-# accepts
-
-[![NPM Version][npm-version-image]][npm-url]
-[![NPM Downloads][npm-downloads-image]][npm-url]
-[![Node.js Version][node-version-image]][node-version-url]
-[![Build Status][github-actions-ci-image]][github-actions-ci-url]
-[![Test Coverage][coveralls-image]][coveralls-url]
-
-Higher level content negotiation based on [negotiator](https://www.npmjs.com/package/negotiator).
-Extracted from [koa](https://www.npmjs.com/package/koa) for general use.
-
-In addition to negotiator, it allows:
-
-- Allows types as an array or arguments list, ie `(['text/html', 'application/json'])`
- as well as `('text/html', 'application/json')`.
-- Allows type shorthands such as `json`.
-- Returns `false` when no types match
-- Treats non-existent headers as `*`
-
-## Installation
-
-This is a [Node.js](https://nodejs.org/en/) module available through the
-[npm registry](https://www.npmjs.com/). Installation is done using the
-[`npm install` command](https://docs.npmjs.com/getting-started/installing-npm-packages-locally):
-
-```sh
-$ npm install accepts
-```
-
-## API
-
-```js
-var accepts = require('accepts')
-```
-
-### accepts(req)
-
-Create a new `Accepts` object for the given `req`.
-
-#### .charset(charsets)
-
-Return the first accepted charset. If nothing in `charsets` is accepted,
-then `false` is returned.
-
-#### .charsets()
-
-Return the charsets that the request accepts, in the order of the client's
-preference (most preferred first).
-
-#### .encoding(encodings)
-
-Return the first accepted encoding. If nothing in `encodings` is accepted,
-then `false` is returned.
-
-#### .encodings()
-
-Return the encodings that the request accepts, in the order of the client's
-preference (most preferred first).
-
-#### .language(languages)
-
-Return the first accepted language. If nothing in `languages` is accepted,
-then `false` is returned.
-
-#### .languages()
-
-Return the languages that the request accepts, in the order of the client's
-preference (most preferred first).
-
-#### .type(types)
-
-Return the first accepted type (and it is returned as the same text as what
-appears in the `types` array). If nothing in `types` is accepted, then `false`
-is returned.
-
-The `types` array can contain full MIME types or file extensions. Any value
-that is not a full MIME types is passed to `require('mime-types').lookup`.
-
-#### .types()
-
-Return the types that the request accepts, in the order of the client's
-preference (most preferred first).
-
-## Examples
-
-### Simple type negotiation
-
-This simple example shows how to use `accepts` to return a different typed
-respond body based on what the client wants to accept. The server lists it's
-preferences in order and will get back the best match between the client and
-server.
-
-```js
-var accepts = require('accepts')
-var http = require('http')
-
-function app (req, res) {
- var accept = accepts(req)
-
- // the order of this list is significant; should be server preferred order
- switch (accept.type(['json', 'html'])) {
- case 'json':
- res.setHeader('Content-Type', 'application/json')
- res.write('{"hello":"world!"}')
- break
- case 'html':
- res.setHeader('Content-Type', 'text/html')
- res.write('hello, world!')
- break
- default:
- // the fallback is text/plain, so no need to specify it above
- res.setHeader('Content-Type', 'text/plain')
- res.write('hello, world!')
- break
- }
-
- res.end()
-}
-
-http.createServer(app).listen(3000)
-```
-
-You can test this out with the cURL program:
-```sh
-curl -I -H'Accept: text/html' http://localhost:3000/
-```
-
-## License
-
-[MIT](LICENSE)
-
-[coveralls-image]: https://badgen.net/coveralls/c/github/jshttp/accepts/master
-[coveralls-url]: https://coveralls.io/r/jshttp/accepts?branch=master
-[github-actions-ci-image]: https://badgen.net/github/checks/jshttp/accepts/master?label=ci
-[github-actions-ci-url]: https://github.com/jshttp/accepts/actions/workflows/ci.yml
-[node-version-image]: https://badgen.net/npm/node/accepts
-[node-version-url]: https://nodejs.org/en/download
-[npm-downloads-image]: https://badgen.net/npm/dm/accepts
-[npm-url]: https://npmjs.org/package/accepts
-[npm-version-image]: https://badgen.net/npm/v/accepts
diff --git a/Rat_in_maze.py b/Rat_in_maze.py
deleted file mode 100644
index 4ccd9bf..0000000
--- a/Rat_in_maze.py
+++ /dev/null
@@ -1,85 +0,0 @@
-""" Python3 program to solve Rat in a
-Maze problem using backtracking """
-
-# Maze size
-N = 4
-
-""" A utility function to print solution matrix
-sol """
-def printSolution(sol):
- for i in range(N):
- for j in range(N):
- print(sol[i][j], end = " ")
- print()
-
-""" A utility function to check if
-x, y is valid index for N*N maze """
-def isSafe(maze, x, y):
-
- # if (x, y outside maze) return false
- if (x >= 0 and x < N and y >= 0 and
- y < N and maze[x][y] != 0):
- return True
- return False
-
-""" This function solves the Maze problem using
-Backtracking. It mainly uses solveMazeUtil() to
-solve the problem. It returns false if no path
-is possible, otherwise return True and prints
-the path in the form of 1s. Please note that
-there may be more than one solutions,
-this function prints one of the feasible solutions."""
-def solveMaze(maze):
- sol = [[0, 0, 0, 0],
- [0, 0, 0, 0],
- [0, 0, 0, 0],
- [0, 0, 0, 0]]
- if (solveMazeUtil(maze, 0, 0, sol) == False):
- print("Solution doesn't exist")
- return False
- printSolution(sol)
- return True
-
-""" A recursive utility function
-to solve Maze problem """
-def solveMazeUtil(maze, x, y, sol):
-
- # if (x, y is goal) return True
- if (x == N - 1 and y == N - 1) :
- sol[x][y] = 1
- return True
-
- # Check if maze[x][y] is valid
- if (isSafe(maze, x, y) == True):
-
- # mark x, y as part of solution path
- sol[x][y] = 1
-
- """ Move forward in x direction """
- for i in range(1, N):
- if (i <= maze[x][y]):
-
- """ Move forward in x direction """
- if (solveMazeUtil(maze, x + i,
- y, sol) == True):
- return True
-
- """ If moving in x direction doesn't give
- solution then Move down in y direction """
- if (solveMazeUtil(maze, x,
- y + i, sol) == True):
- return True
-
- """ If none of the above movements work then
- BACKTRACK: unmark x, y as part of solution
- path """
- sol[x][y] = 0
- return False
- return False
-
-# Driver Code
-maze = [[2, 1, 0, 0],
- [3, 0, 0, 1],
- [0, 1, 0, 1],
- [0, 0, 0, 1]]
-solveMaze(maze)
diff --git a/Rectangle_area.py b/Rectangle_area.py
deleted file mode 100644
index 2db279d..0000000
--- a/Rectangle_area.py
+++ /dev/null
@@ -1,6 +0,0 @@
-len,breadth = input().split()
-a = int(len)
-b = int(breadth)
-
-res = a*b
-print(res)
diff --git a/Rock_Paper_Scissor.py b/Rock_Paper_Scissor.py
deleted file mode 100644
index 6c8cbf2..0000000
--- a/Rock_Paper_Scissor.py
+++ /dev/null
@@ -1,67 +0,0 @@
-""" Rock Paper Scissors
-
--------------------------------------------------------------
-
-"""
-
-import random
-
-import os
-
-import re
-
-os.system('cls' if os.name=='nt' else 'clear')
-
-while (1 < 2):
-
-print ("\n")
-
-print ("Rock, Paper, Scissors - Shoot!")
-
-userChoice = input("Choose your weapon [R]ock], [P]aper, or [S]cissors: ")
-
-if not re.match("[SsRrPp]", userChoice):
-
-print ("Please choose a letter:")
-
-print ("[R]ock, [S]cissors or [P]aper.")
-
-continue
-
-# Echo the user's choice
-
-print ("You chose: " + userChoice)
-
-choices = ['R', 'P', 'S']
-
-opponenetChoice = random.choice(choices)
-
-print ("I chose: " + opponenetChoice)
-
-if opponenetChoice == str.upper(userChoice):
-
-print ("Tie! ")
-
-#if opponenetChoice == str("R") and str.upper(userChoice) == "P"
-
-elif opponenetChoice == 'R' and userChoice.upper() == 'S':
-
-print ("Scissors beats rock, I win! ")
-
-continue
-
-elif opponenetChoice == 'S' and userChoice.upper() == 'P':
-
-print ("Scissors beats paper! I win! ")
-
-continue
-
-elif opponenetChoice == 'P' and userChoice.upper() == 'R':
-
-print ("Paper beat rock, I win!")
-
-continue
-
-else:
-
-print ("You win!")
diff --git a/SWITCH.java b/SWITCH.java
deleted file mode 100644
index 11e9625..0000000
--- a/SWITCH.java
+++ /dev/null
@@ -1,23 +0,0 @@
-import java.util.*;
-
-public class SWITCH {
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int button = sc.nextInt();
- switch (button) {
- case 1:
- System.out.println("hello");
- break;
- case 2:
- System.out.println("Namaste");
- break;
- case 3:
- System.out.println("Bonjour");
- break;
- default:
- System.out.println("Error Button");
- }
-
- }
-
-}
diff --git a/Shell_sort.py b/Shell_sort.py
deleted file mode 100644
index 27197eb..0000000
--- a/Shell_sort.py
+++ /dev/null
@@ -1,48 +0,0 @@
-
-# Python program for implementation of Shell Sort.
-
-def shellSort(arr):
-
- # Start with a big gap, then reduce the gap
- n = len(arr)
- gap = n/2
-
- # Do a gapped insertion sort for this gap size.
- # The first gap elements a[0..gap-1] are already in gapped
- # order keep adding one more element until the entire array
- # is gap sorted
- while gap > 0:
-
- for i in range(gap,n):
-
- # add a[i] to the elements that have been gap sorted
- # save a[i] in temp and make a hole at position i
- temp = arr[i]
-
- # shift earlier gap-sorted elements up until the correct
- # location for a[i] is found
- j = i
- while j >= gap and arr[j-gap] >temp:
- arr[j] = arr[j-gap]
- j -= gap
-
- # put temp (the original a[i]) in its correct location
- arr[j] = temp
- gap /= 2
-
-
-# Driver code to test above
-arr = [ 12, 34, 54, 2, 3]
-
-n = len(arr)
-print ("Array before sorting:")
-for i in range(n):
- print(arr[i]),
-
-shellSort(arr)
-
-print ("\nArray after sorting: ")
-for i in range(n):
- print(arr[i]),
-
-# This code is contributed by Nishant Singh
diff --git a/Shut down your Computer b/Shut down your Computer
deleted file mode 100644
index db1d0c0..0000000
--- a/Shut down your Computer
+++ /dev/null
@@ -1,6 +0,0 @@
-import os
-shutdown = input("Do you want to shutdown your computer (yes / no): ")
-if shutdown == 'yes':
- os.system("shutdown /s /t 1")
-else:
- print('Shutdown is not requested')
diff --git a/Star Diamond.py b/Star Diamond.py
deleted file mode 100644
index 6bdedb3..0000000
--- a/Star Diamond.py
+++ /dev/null
@@ -1,19 +0,0 @@
-def pattern(n):
- k = 2 * n - 2
- for i in range(0, n):
- for j in range(0 , k):
- print(end=" ")
- k = k - 1
- for j in range(0 , i + 1 ):
- print("* ", end="")
- print(" ")
- k = n - 2
- for i in range(n , -1, -1):
- for j in range(k , 0 , -1):
- print(end=" ")
- k=k+1
- for j in range(0 , i + 1):
- print("* ", end="")
- print(" ")
-
-pattern(5)
diff --git a/Steganography/LICENSE b/Steganography/LICENSE
deleted file mode 100644
index f288702..0000000
--- a/Steganography/LICENSE
+++ /dev/null
@@ -1,674 +0,0 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc.
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
- The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works. By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users. We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors. You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
- To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights. Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received. You must make sure that they, too, receive
-or can get the source code. And you must show them these terms so they
-know their rights.
-
- Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
- For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software. For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
- Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so. This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software. The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable. Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products. If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
- Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary. To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-
- TERMS AND CONDITIONS
-
- 0. Definitions.
-
- "This License" refers to version 3 of the GNU General Public License.
-
- "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
- "The Program" refers to any copyrightable work licensed under this
-License. Each licensee is addressed as "you". "Licensees" and
-"recipients" may be individuals or organizations.
-
- To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy. The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
- A "covered work" means either the unmodified Program or a work based
-on the Program.
-
- To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy. Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
- To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies. Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
- An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License. If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
- 1. Source Code.
-
- The "source code" for a work means the preferred form of the work
-for making modifications to it. "Object code" means any non-source
-form of a work.
-
- A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
- The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form. A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
- The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities. However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work. For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
- The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
- The Corresponding Source for a work in source code form is that
-same work.
-
- 2. Basic Permissions.
-
- All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met. This License explicitly affirms your unlimited
-permission to run the unmodified Program. The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work. This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
- You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force. You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright. Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
- Conveying under any other circumstances is permitted solely under
-the conditions stated below. Sublicensing is not allowed; section 10
-makes it unnecessary.
-
- 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
- No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
- When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
- 4. Conveying Verbatim Copies.
-
- You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
- You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
- 5. Conveying Modified Source Versions.
-
- You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
- a) The work must carry prominent notices stating that you modified
- it, and giving a relevant date.
-
- b) The work must carry prominent notices stating that it is
- released under this License and any conditions added under section
- 7. This requirement modifies the requirement in section 4 to
- "keep intact all notices".
-
- c) You must license the entire work, as a whole, under this
- License to anyone who comes into possession of a copy. This
- License will therefore apply, along with any applicable section 7
- additional terms, to the whole of the work, and all its parts,
- regardless of how they are packaged. This License gives no
- permission to license the work in any other way, but it does not
- invalidate such permission if you have separately received it.
-
- d) If the work has interactive user interfaces, each must display
- Appropriate Legal Notices; however, if the Program has interactive
- interfaces that do not display Appropriate Legal Notices, your
- work need not make them do so.
-
- A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit. Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
- 6. Conveying Non-Source Forms.
-
- You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
- a) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by the
- Corresponding Source fixed on a durable physical medium
- customarily used for software interchange.
-
- b) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by a
- written offer, valid for at least three years and valid for as
- long as you offer spare parts or customer support for that product
- model, to give anyone who possesses the object code either (1) a
- copy of the Corresponding Source for all the software in the
- product that is covered by this License, on a durable physical
- medium customarily used for software interchange, for a price no
- more than your reasonable cost of physically performing this
- conveying of source, or (2) access to copy the
- Corresponding Source from a network server at no charge.
-
- c) Convey individual copies of the object code with a copy of the
- written offer to provide the Corresponding Source. This
- alternative is allowed only occasionally and noncommercially, and
- only if you received the object code with such an offer, in accord
- with subsection 6b.
-
- d) Convey the object code by offering access from a designated
- place (gratis or for a charge), and offer equivalent access to the
- Corresponding Source in the same way through the same place at no
- further charge. You need not require recipients to copy the
- Corresponding Source along with the object code. If the place to
- copy the object code is a network server, the Corresponding Source
- may be on a different server (operated by you or a third party)
- that supports equivalent copying facilities, provided you maintain
- clear directions next to the object code saying where to find the
- Corresponding Source. Regardless of what server hosts the
- Corresponding Source, you remain obligated to ensure that it is
- available for as long as needed to satisfy these requirements.
-
- e) Convey the object code using peer-to-peer transmission, provided
- you inform other peers where the object code and Corresponding
- Source of the work are being offered to the general public at no
- charge under subsection 6d.
-
- A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
- A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling. In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage. For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product. A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
- "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source. The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
- If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information. But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
- The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed. Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
- Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
- 7. Additional Terms.
-
- "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law. If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
- When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it. (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.) You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
- Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
- a) Disclaiming warranty or limiting liability differently from the
- terms of sections 15 and 16 of this License; or
-
- b) Requiring preservation of specified reasonable legal notices or
- author attributions in that material or in the Appropriate Legal
- Notices displayed by works containing it; or
-
- c) Prohibiting misrepresentation of the origin of that material, or
- requiring that modified versions of such material be marked in
- reasonable ways as different from the original version; or
-
- d) Limiting the use for publicity purposes of names of licensors or
- authors of the material; or
-
- e) Declining to grant rights under trademark law for use of some
- trade names, trademarks, or service marks; or
-
- f) Requiring indemnification of licensors and authors of that
- material by anyone who conveys the material (or modified versions of
- it) with contractual assumptions of liability to the recipient, for
- any liability that these contractual assumptions directly impose on
- those licensors and authors.
-
- All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10. If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term. If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
- If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
- Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
- 8. Termination.
-
- You may not propagate or modify a covered work except as expressly
-provided under this License. Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
- However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
- Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License. If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
- 9. Acceptance Not Required for Having Copies.
-
- You are not required to accept this License in order to receive or
-run a copy of the Program. Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance. However,
-nothing other than this License grants you permission to propagate or
-modify any covered work. These actions infringe copyright if you do
-not accept this License. Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
- 10. Automatic Licensing of Downstream Recipients.
-
- Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License. You are not responsible
-for enforcing compliance by third parties with this License.
-
- An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations. If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
- You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License. For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
- 11. Patents.
-
- A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based. The
-work thus licensed is called the contributor's "contributor version".
-
- A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version. For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
- Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
- In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement). To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
- If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients. "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
- If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
- A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License. You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
- Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
- 12. No Surrender of Others' Freedom.
-
- If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all. For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
- 13. Use with the GNU Affero General Public License.
-
- Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work. The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
- 14. Revised Versions of this License.
-
- The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
- Each version is given a distinguishing version number. If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation. If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
- If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
- Later license versions may give you additional or different
-permissions. However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
- 15. Disclaimer of Warranty.
-
- THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. Limitation of Liability.
-
- IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
- 17. Interpretation of Sections 15 and 16.
-
- If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-
- Copyright (C)
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program. If not, see .
-
-Also add information on how to contact you by electronic and paper mail.
-
- If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
- Copyright (C)
- This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
- You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-.
-
- The GNU General Public License does not permit incorporating your program
-into proprietary programs. If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library. If this is what you want to do, use the GNU Lesser General
-Public License instead of this License. But first, please read
-.
diff --git a/Steganography/README.md b/Steganography/README.md
deleted file mode 100644
index 2514fc1..0000000
--- a/Steganography/README.md
+++ /dev/null
@@ -1,2 +0,0 @@
-# Steganography
-Python Steganography
diff --git a/Steganography/build/lib.linux-x86_64-2.7/steganography/__init__.py b/Steganography/build/lib.linux-x86_64-2.7/steganography/__init__.py
deleted file mode 100644
index 417be41..0000000
--- a/Steganography/build/lib.linux-x86_64-2.7/steganography/__init__.py
+++ /dev/null
@@ -1,3 +0,0 @@
-# -*- coding: utf-8 -*-
-from __future__ import absolute_import, unicode_literals
-__version__ = '0.1.1'
diff --git a/Steganography/build/lib.linux-x86_64-2.7/steganography/steganography.py b/Steganography/build/lib.linux-x86_64-2.7/steganography/steganography.py
deleted file mode 100644
index a5bf109..0000000
--- a/Steganography/build/lib.linux-x86_64-2.7/steganography/steganography.py
+++ /dev/null
@@ -1,203 +0,0 @@
-# -*- coding: utf-8 -*-
-from __future__ import absolute_import, unicode_literals
-
-import sys
-from PIL import Image
-import random
-
-DIST = 8
-
-
-def normalize_pixel(r, g, b):
- """
- pixel color normalize
- :param r: int
- :param g: int
- :param b: int
- :return: (int, int, int)
- """
- if is_modify_pixel(r, g, b):
- seed = random.randint(1, 3)
- if seed == 1:
- r = _normalize(r)
- if seed == 2:
- g = _normalize(g)
- if seed == 3:
- b = _normalize(b)
- return r, g, b
-
-
-def modify_pixel(r, g, b):
- """
- pixel color modify
- :param r: int
- :param g: int
- :param b: int
- :return: (int, int, int)
- """
- return map(_modify, [r, g, b])
-
-
-def is_modify_pixel(r, g, b):
- """
- :param r: int
- :param g: int
- :param b: int
- :return: bool
- """
- return r % DIST == g % DIST == b % DIST == 1
-
-
-def _modify(i):
- if i >= 128:
- for x in xrange(DIST + 1):
- if i % DIST == 1:
- return i
- i -= 1
- else:
- for x in xrange(DIST + 1):
- if i % DIST == 1:
- return i
- i += 1
- raise ValueError
-
-
-def _normalize(i):
- if i >= 128:
- i -= 1
- else:
- i += 1
- return i
-
-
-def normalize(path, output):
- """
- normalize image
- :param path: str
- :param output: str
- """
- img = Image.open(path)
- img = img.convert('RGB')
- size = img.size
- new_img = Image.new('RGB', size)
-
- for y in range(img.size[1]):
- for x in range(img.size[0]):
- r, g, b = img.getpixel((x, y))
- _r, _g, _b = normalize_pixel(r, g, b)
- new_img.putpixel((x, y), (_r, _g, _b))
- new_img.save(output, "PNG", optimize=True)
-
-
-def hide_text(path, text):
- """
- hide text to image
- :param path: str
- :param text: str
- """
- text = str(text)
-
- # convert text to hex for write
- write_param = []
- _base = 0
- for _ in to_hex(text):
- write_param.append(int(_, 16) + _base)
- _base += 16
-
- # hide hex-text to image
- img = Image.open(path)
- counter = 0
- for y in range(img.size[1]):
- for x in range(img.size[0]):
- if counter in write_param:
- r, g, b = img.getpixel((x, y))
- r, g, b = modify_pixel(r, g, b)
- img.putpixel((x, y), (r, g, b))
- counter += 1
-
- # save
- img.save(path, "PNG", optimize=True)
-
-
-def to_hex(s):
- return s.encode("hex")
-
-
-def to_str(s):
- return s.decode("hex")
-
-
-def read_text(path):
- """
- read secret text from image
- :param path: str
- :return: str
- """
- img = Image.open(path)
- counter = 0
- result = []
- for y in range(img.size[1]):
- for x in range(img.size[0]):
- r, g, b = img.getpixel((x, y))
- if is_modify_pixel(r, g, b):
- result.append(counter)
- counter += 1
- if counter == 16:
- counter = 0
- return to_str(''.join([hex(_)[-1:] for _ in result]))
-
-
-class Steganography(object):
- @classmethod
- def encode(cls, input_image_path, output_image_path, encode_text):
- """
- hide text to image
- :param input_image_path: str
- :param output_image_path: str
- :param encode_text: str
- """
- normalize(input_image_path, output_image_path)
- hide_text(output_image_path, encode_text)
- assert read_text(output_image_path) == encode_text, read_text(output_image_path)
-
- @classmethod
- def decode(cls, image_path):
- """
- read secret text from image
- :param image_path: str
- :return: str
- """
- return read_text(image_path)
-
-
-# Main program
-def main():
- if len(sys.argv) == 5 and sys.argv[1] == '-e':
- # encode
- print("Start Encode")
- input_image_path = sys.argv[2]
- output_image_path = sys.argv[3]
- text = sys.argv[4]
- Steganography.encode(input_image_path, output_image_path, text)
- print("Finish:{}".format(output_image_path))
- return
- if len(sys.argv) == 3 and sys.argv[1] == '-d':
- # decode
- input_image_path = sys.argv[2]
- print(Steganography.decode(input_image_path))
- return
- print_help_text()
-
-
-def print_help_text():
- print("ERROR: not steganography command")
- print("--------------------------------")
- print("# encode example: hide text to image")
- print("steganography -e /tmp/image/input.jpg /tmp/image/output.jpg 'The quick brown fox jumps over the lazy dog.'")
- print("")
- print("# decode example: read secret text from image")
- print("steganography -d /tmp/image/output.jpg")
- print("")
-
-if __name__ == "__main__":
- main()
diff --git a/Steganography/requirements.txt b/Steganography/requirements.txt
deleted file mode 100644
index bb6991b..0000000
--- a/Steganography/requirements.txt
+++ /dev/null
@@ -1 +0,0 @@
-pillow>=3.1.1
diff --git a/Steganography/setup.py b/Steganography/setup.py
deleted file mode 100644
index e8f9386..0000000
--- a/Steganography/setup.py
+++ /dev/null
@@ -1,36 +0,0 @@
-from setuptools import setup
-from steganography import __version__
-import os
-
-f = open(os.path.join(os.path.dirname(__file__), 'README.rst'))
-long_description = f.read()
-f.close()
-
-setup(
- name='steganography',
- version=__version__,
- description="Digital image steganography of encrypted text",
- long_description=long_description,
- author='haminiku',
- author_email='ferdi.kennedy@protonmail.com',
- url='https://github.com/kennedy69/steganography',
- packages=['steganography'],
- package_dir={'steganography': 'steganography'},
- include_package_data=True,
- install_requires=["pillow"],
- license='MIT License',
- zip_safe=False,
- keywords=["Implementation Hide Text In Image with encryption", "stegano", "steganography",
- "Digital image steganography of encrypted text"],
- classifiers=(
- 'License :: OSI Approved :: MIT License',
- 'Programming Language :: Python',
- 'Programming Language :: Python :: 2.6',
- 'Programming Language :: Python :: 2.7',
- ),
- entry_points={
- 'console_scripts': [
- 'steganography = steganography.steganography:main',
- ],
- },
-)
diff --git a/Steganography/steganography.egg-info/PKG-INFO b/Steganography/steganography.egg-info/PKG-INFO
deleted file mode 100644
index 7706646..0000000
--- a/Steganography/steganography.egg-info/PKG-INFO
+++ /dev/null
@@ -1,74 +0,0 @@
-Metadata-Version: 1.1
-Name: steganography
-Version: 0.1.1
-Summary: Digital image steganography of encrypted text
-Home-page: https://github.com/subc/steganography
-Author: haminiku
-Author-email: haminiku1129@gmail.com
-License: MIT License
-Description: Digital image steganography of encrypted text
- ========================================================================
- JPG, GIF, PNG, BMP.
-
- 日本語ドキュメント: `Japanese Document`_
-
-
- Installation
- -----------------
-
- .. code-block:: bash
-
- $ pip install steganography
-
-
- Example Image
- -----------------
-
- .. image:: http://subc.github.io/image/pypi/steganography.png
- :alt: HTTPie compared to cURL
- :align: center
-
-
- Sample Command
- -----------------
-
- .. code-block:: bash
-
- # encode example: hide text to image
- >>>steganography -e /tmp/image/input.jpg /tmp/image/output.jpg 'The quick brown fox jumps over the lazy dog.'
-
- # decode example: read secret text from image
- >>>steganography -d /tmp/image/output.jpg
- The quick brown fox jumps over the lazy dog.
-
- Sample Code
- -----------------
-
- .. code-block:: python
-
- # -*- coding: utf-8 -*-
- from __future__ import absolute_import, unicode_literals
- from steganography.steganography import Steganography
-
- # hide text to image
- path = "/tmp/image/input.jpg"
- output_path = "/tmp/image/output.jpg"
- text = 'The quick brown fox jumps over the lazy dog.'
- Steganography.encode(path, output_path, text)
-
- # read secret text from image
- secret_text = Steganography.decode(output_path)
-
- Documentation
- -----------------
-
- - 日本語ドキュメント: `Japanese Document`_
-
- .. _`Japanese Document`: http://qiita.com/haminiku/items/2e623caab751f25a382e
-
-Keywords: Implementation Hide Text In Image with encryption,stegano,steganography,Digital image steganography of encrypted text
-Platform: UNKNOWN
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Programming Language :: Python
-Classifier: Programming Language :: Python :: 2.6
-Classifier: Programming Language :: Python :: 2.7
diff --git a/Steganography/steganography.egg-info/SOURCES.txt b/Steganography/steganography.egg-info/SOURCES.txt
deleted file mode 100644
index 39f3544..0000000
--- a/Steganography/steganography.egg-info/SOURCES.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-README.rst
-setup.py
-steganography/__init__.py
-steganography/steganography.py
-steganography.egg-info/PKG-INFO
-steganography.egg-info/SOURCES.txt
-steganography.egg-info/dependency_links.txt
-steganography.egg-info/entry_points.txt
-steganography.egg-info/not-zip-safe
-steganography.egg-info/requires.txt
-steganography.egg-info/top_level.txt
\ No newline at end of file
diff --git a/Steganography/steganography.egg-info/dependency_links.txt b/Steganography/steganography.egg-info/dependency_links.txt
deleted file mode 100644
index 8b13789..0000000
--- a/Steganography/steganography.egg-info/dependency_links.txt
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/Steganography/steganography.egg-info/entry_points.txt b/Steganography/steganography.egg-info/entry_points.txt
deleted file mode 100644
index 40c9ffd..0000000
--- a/Steganography/steganography.egg-info/entry_points.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-[console_scripts]
-steganography = steganography.steganography:main
-
diff --git a/Steganography/steganography.egg-info/not-zip-safe b/Steganography/steganography.egg-info/not-zip-safe
deleted file mode 100644
index 8b13789..0000000
--- a/Steganography/steganography.egg-info/not-zip-safe
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/Steganography/steganography.egg-info/requires.txt b/Steganography/steganography.egg-info/requires.txt
deleted file mode 100644
index 3868fb1..0000000
--- a/Steganography/steganography.egg-info/requires.txt
+++ /dev/null
@@ -1 +0,0 @@
-pillow
diff --git a/Steganography/steganography.egg-info/top_level.txt b/Steganography/steganography.egg-info/top_level.txt
deleted file mode 100644
index 20f36be..0000000
--- a/Steganography/steganography.egg-info/top_level.txt
+++ /dev/null
@@ -1 +0,0 @@
-steganography
diff --git a/Steganography/steganography/__init__.py b/Steganography/steganography/__init__.py
deleted file mode 100644
index 417be41..0000000
--- a/Steganography/steganography/__init__.py
+++ /dev/null
@@ -1,3 +0,0 @@
-# -*- coding: utf-8 -*-
-from __future__ import absolute_import, unicode_literals
-__version__ = '0.1.1'
diff --git a/Steganography/steganography/__init__.pyc b/Steganography/steganography/__init__.pyc
deleted file mode 100644
index e61eac5b13e912acbe5c845fbc320b3da8e78b6f..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 269
zcmZ8b%?iRW3{E!%QAAIkJ?^wk&mum72fYm>Oj}){T}PV=zO~>Bn28`5k}vtb{E+lD
z9hcSfbb+rWoOinf!jcQgF2Dd-0hIuoK$U=yoKlb}9J2urX%5KxJ(@Ap=ip2vh1zz`
z6U|wRt-d&^&}dS=HX#mKEb~>q+J8>am^tD#QuGS(zzhz8fhM2EUHPD0i^}SKv-`%p*HXcIMfK{%ix+rms)`?8yg*ZZ@d9-k>m~9I
zw*Vso`GM~BR!t8JxxiR9(a7)E?y5#!FJ9pH{<~08x$voxHz~c9fZn=pcHVxLp0+Ri
z{QP(wU7fwGE!}N--8}8HkEN+zyr6%frYNuHpL4h}3}IGD+qr!v($R0Z;R$aT*An%J33yb>@3-82Nl
zLj-j76NPYeM08skqf`7HoV0|CJTO8?a+E^C@RS-{{Qv=E%5(lfh|0n%4SqX
zM#eMnhQ8qVtJB?cvd3LwD&1re}&`xo47RJ&E?kokn67qJQgFYk^rof$=q<@(H_=
zrV`-BYF@K;2LG~&155Ad(U$E?f5yotuq{YJKAt!q|KveN)Wilu>lv720~5=xqoMuT
zayF-EXY6EYRFM2kyBAq$vu^QJo)Zxr9lflEofJJFgIgeTN`kdZ7-~wKPnCg!w+%(}
zMWeLPAub5K`I>UXAffB
zSSX!76-5D4cgv#=N|;r}Iz>)MtL|7Xp2?Y6)R6zU(%`a$i=OeU`CjEo;Nev_obb7s
zSwYAGI|uFC#;!+J?yT*r-0S!H?oJli+-ZuxF)KdVcN&Vl!MP#m}t7x|_E4*RKoDc2&=#KJg
zpLRZd@yt!69tjl3dqd#!La-M&G>)d{L+OFK_k_L=*b711P>|JtoTEQ@Q0jd6@y|j$
z@57lHt9wR=FEdZqzTcg0Wfh3zj95(eRCCVL<-SiUv^6I#Wchi*iAI@41C;DVuaie)
zF1&T<6e@hdHS`wG5b*}Jk$qmW?#-Q2rf+%(%EGa2!MhBkdp)6g7XXP8yJ-lXYunO(
z-FakE&A)Hwi*)q)_9_iqOIIynr<1XV5%VuP8<&5=MlDW`Mlf?jePFDWsPg(agGLzz{IvB&O`=tTxIF4J}g%hb}GVSn|M)2w(4K6KGz4pUy^
zx5h1GdCC>0S)yY{8(QEk|A
zvm=c2v0fOd`e|8ADTStmCnePF7bTxR@;V-2x^vqiBdz+(J$U5D7Fum
zc`I#TYvZnyKXk+L<#skl5zkDtw=gh&z(b67{@Ue+%+PYfaEb5>lFGJ@HGvyGTnKY%%9{@#C`F@K*%d_zx|cKiG%$$!A*v?MfKz6#(nMb
zV|{Qk)OGEu`u^it+T+>-zbSv|lh|tcGa6!?Y{YI?m@QFUy|Dk6wGze!1F^P{FHw~c
zY&=eUd_tW2j*y%uV3JakPTJSz^BZ)rk!%e?Hp2t`J5?tUkv{H0&(8H
zvO)$o0M|Bvz+mY)ST=?AAlw=>91Cq<$APa@-cZV&kKc^QZtFgW^BwX()!MPFnsd&1
zcT`e48z0}lK3Hg4r0(tytMQ?y-qNAmE|mD_I15x7F6o%kG8tZ8xvDz$f**
zqX)nZiro73L$M)6V2y@{DzNAb-0t(MVJj^8HJYPtQ)C_#W*yM<`Jkkq#bqu%VV
zL&OG355gbhRNaZN>o$jJP2OTrx?yz%p1FWT55o1G53JkP6~|sA^2%&GHgB*#LP{^}
z^NP~s3ZLVtqvWb=ZtJ9iigWH*($@w$$oYs50&F|tfUtVG&CGnSrzvRBc!x`w^?2wC
zP|T6(Mh;^Yv%hirDsa+2|BM51{h|viJr8x-+Fxkr>2+g<
zB6WVg0G*X)yhu4(LqAmqqTd+sXyVr|LEdWEG5jOo+x5<_@Gxb~ZLD3Bg-4PqS=GWs
zt8)ZSLHodh8l3|wZ7v}@lM>1a`sh&W{z$3*-k+trbq15v0?c^YPn;%s0kitRl3d?N
zbCWT{unT?GHS|W~$w!W9nUB!GITV>-`;5BA>x>;&_&t1liX8{j=p&Ql*<%s9
z+E$CDDnwLwAN4{1lc?#rt&8Iyv@z7e2~QGBA}Y=Uhw_4ImKS2)y+MzfztmPIjf^&^
zhRVSf*QX!HHLYiR^q{VYh4atV*QF*1z^vDJL2-?rL|s<$&d0GVoK>@&DpT$Z9z18Q
zOg`$rnIu|Ve+XiCj$XU0T7FwC`>x?p;}T}1l}qGFpzmyEf9_9u*I2JFjB{}@V;1lO
zPbk0GsKQezmCO}%)Lya9x${&FbIUnCPrL9Q9j%F7L+7q=lw#XeY|)BHQDaCJx_HdW
z5jt?yyi%`NB0Z?JO08(riYfILsvSIE+RWNu)$)@b_ZnKBpO2fJT)b(&EwcKkZM@zN
zt!T27;E;){v$*4t!z)F{dZ>3@l2WAyd
zi}^7yvs}cM=g4}yXnX}wn%mo4ZkEjynI*|>6gi;gr7RRQu;`-YHN{`*l$DGziXCwm
zaZ4byVTphFxo-ECbIQN7Id(gN$HryDXU)bKHrQp&8bN)qsoz>w-BdRRWt{Y{rSviL
zPfq`>B~;mx371SV*m@fN)Brf(6S^(=X?|JgqeL1shh2u)GXOLl8Ts)@P=nxTTz50m
z#d$t{gSKlVca@DAnberW6V)#nakQCDk{+^b68CVAT4WtI&mNAw4mO(prUlQBWB_7(
zKrhtO+E;_>Y3wEO-0#6LKES7XAZhC5MSC!;6T`iIX7$1_vu4(^!J1*JIkWVKPZhZ}zed9)k
zZqtT5_H~n@*ri;*s7pAfXJc5E@33f5yUr$bG$L|4urpnHh-YU~vM*mh?i8zv{$k(0
zQ_EZt-y9EHzdSj2ZFPzkNgEEKD9xJTa{G%hOXzG|DI7y824(C*^@)x6n`5i5Dm+|tm&FtsAsz!)oeYI@GA4!`WjrySiv8FLEx2bLgROt;5
zz}>=RRB0o=^FcEe^)aL%V*)v;8PR)_6U-JwSDspGoriM=RwckN10XUTA@+#WR
z?+TBzT-*NKRnrwMvJhu3+uwzZHXrOwWzE=E+Z&rt-?<-WYniExU(}5TRX)zuFJJg9
zr?Wy~*S!~)8L!Ygcnri^leU9D)YySUE}=j8UYE{r8LPlRr%0sg&+c!o`{396j+vT#
zfnqpit?O{jpl$tX-jnJe;3(9v?7lvj9=9VK_T=dTP^X7UYF)4KiAm(=4ANp@?*R~8
zB^3n+PJb)D@8_MCVds_f^9iwM>~`izEz3TjE!+nUAo(J3uy5Va3YrQT{bFQz7L@fy2!R@Jhl
za<%%}j;5vbibtQBh}@T5_TH?LIyab2`#b862?#9*PltU|w8EO1O)4^*5LS*A(f_C`
zMih^C-WMCVI*~Is<3>Gdt$1u$
zR#DN|%&U9En3*Fr7hH58)a2$Uq(}@p_TbA^klS0g9T9Tfy_
zBO!Ta>x*nm&&@4X!V-nKBy@6i_fAqi-fH{sG3uTXz>ys-4Q10QCWXDZU;!=p+9
zGrWHk$;9&CE=DO1vW=(mObc4Kb)SeMW`}(t8x({BBb}e+%b-|hei!<^rJqC~DoiHf
zMnB}#Zj`j!2j=)%EWVLSnALn0tFIRU?I%c5gt<5eW(O#2;{1KR+*`x?5@oNJ6|p
zX=rqt(haAITT=2&s*G+$qd#!vHou*WgUQycbyT#nBF3q*zN9)Ar$^?$Ji}fP>=Lx{
z8qkcCw1Ad%roG*tX$B?7fu>Ha%|{#P`r+sjmVuSB2-Y582dJ8>YDDu7YicO3JG39DI_3=jmU?07hRG1Z7!O
zt*4~T^1TmzXh?pwMZlQ^r1AtMFy5vQ9;lkKOmPxcpl)y`SF$^+n3{XkeeJ!>3AmQX
z_j5bs_NDuMcKZgbmWM!4g}mgV?RZ7YB;2QqB55%vnCnPy0c3rBmqI
zcLm#qy;xbQa#UqmKh#f0yK2aGtwFHTY??H5mfQIb=~0#_Ichg3M0v!H%_9?*`{$>Q
zLj>Z!KM*?KW$b(1!?J0w2imh?(}Lz=b5}HeR_O4Y(#1kep7eRk=}(&uQJaVJ_6<4^
zHfY0a5cs&t!%aOB0lEEg87QAjq@4ZGfA1eVx_Rp7meVXA>}s5U7SbT-ZEP1gzn$mc*QhAV*R%x4iwNRiY5Rl{bKXn{)s6pP|DlQLqW8d4GE7P6`ZjX`pzeF(j#iS57
zd3{J92xhFK)YcN^D-ciaW!@G%OA+c(`l|o~PqkcH+OXp0ny;zRyrYJwy;d=QTmf3c
zybl|z=ezp5`R9-M(=?xTmSQPZQftvsWhL_ARszg))4+SVHLs%emsGw@I?
z6#NOn-lIX_ws<`BpANsd8LBFdx!@+uW1TXDm>cLB;*Dymx5)0cN^KNABOb0FqE#x8
zG0>v@F9u*o3L&(#XZ$%Qp?c(cA|qLl5FOpzH$G0@f<@!!u6w!A<6MXHM8~`F`nXPrWuockOMOoo7XyYe+
z%YRe>Zi-hMxxyGvp6k%=Kva!b-Ua51!-@@DD?^*g4_m0$$8^x-i7m}Fvoxi91>q9ihYyWiRogx&uMtO
zB@gtV+^yBr%wReD!I~?6`g*F#k{lu@d>GcHlBvEfz73w}Y)kEZ`*O)IvL&+{WM~B<(=Al$sJ)45e;h#y*T4NOAt=$u7Vx
zj$UN}zbG03f8L828knrwBaE|%alvP%OUI*2!uA?E+uPanQFZhhRa8^xkL3+&Qf9Ld
zA9KGXj>IcalJz~ISun*Bj=k90n7+0AnuE9IMO9I{H-wdFjm|ghXv40SN^qZw`g2+)
zgbe`5q%`q<7J6`m`8I5;m#r}S8mh7Nbm@vJUgho%5s!&_d;00Ffku7Tlr}9J#&6a8
zC9jt2D|6pf3&r^OyV%nd;%sJ53A*+$^ABe`$R6&bB+9^|v@-{3K=^rnKb3hg`8S_dv-_f$@e`fyRns@raEG!Lv;TTBq6%CXbVH(wbPo+6
z<6)VWvo?@l5%jbfoMdyTkNZyF32Y
zG8(LdvGmdok3YUw$(+nq{Ifgl3C?==DdtP^m&F$9QATPB(&4Zqnp-<6;BEVTC_Hx4
zMGn5Ioo7LDMZtIDccrYudhSsa-{$@Ix}~zGPtf*V+Wm<@(9*YU6|38ffyAKzqkWWZ
zLhK#L7r{E*NL+00Mxxx;AR0Z+nB=ga)r-erv*Q5qagU}Q4~$M1QC1m+niLM-uIZg7
z51vNo@QDA>WaF0)C|(Uv65|R1&(7tV&*{DFY;3zp;@hKC*!X!e@s)b35Z+YF-$&|V
zqvqFMKU+adM;m^_aU?Kzcz}F;<)0#rEEg+>WDkX<6zX9cc>j`|nUP6lEA!^rB7C#m
zzwA4&Yz{0J`ala69mZSOA{FTw@r6m0wbl%Wou7}&LE{TM3?*GPCG23vb#?HlH6h!l25_iX^&r*
z?wo+S^}gS6IWi=%WqZ`3Q#`FUQ@L)QZ^73IoNN?J2X`%A0IX_wQoF&67x~O(vH5KA
z`S7pXfTA%XArsCE?s%&EgH510bl!W4o^zSS?j5VZ*fTG+m`Jk)UmFKijHsa2o1FnT
zZ#KbjcKQV$0bN4z(FGm#!ExG)nls0T6XHYg8Es@ffGy)zTvD(4hqT$A+))JnpgyG!
zCnY4k;&1JS=uw^2hwA%R0<7woN3!~9<|k6aDW03`R(2ZV*K0H_&>~nJ)Am(-gUN9S
zbZS1fuP|pbQd32@U*{_W-k>K&qs({1?s$1@OtmlZfEcv>2PvrE
z#mc-|zx9rtLOe%5gpT@r?Y)o+Nl)i~M2fMy4>Yjzlj5x_v6kr8M5KV-D$q~eJ=V>_
z2DSP)D*iiYDN|>Zsr|oL!d$zDkt(mAv9KE4;`L&bG<=-@1bz+G3KD#3N+lv~a8cL|
z5;_y|R+ml{Acuo}rESRJl6NQAUIM1j(BWv*3yUtlNPgeNE0TRn?(Ko%3E5sxYDr~G
za<>Imj%v-eei=48Z|eF?C*3D8tq`~`S8(yBoeL|K)^mr1w#)tg!-ho3>-enj50;hzUWDY(x_>e>i
zX7ipNOW6e--)k>ZIaedfp$ox(FszSygJOW$ls<=}AL~}q1H~iV=
zl=atnjc#RUW`I@rrWI}br+X|ZYT
z;&Lr=w6!jS3*#*A8}F_tj@5shChq0PkI4s#==>U7`t$y@>ewGemU@{c;g=0f49n(raguLW`owCJ*8mj9WQIp-;m<{wU|E(
zZwcy~wp~w-@EnIn{XB%uwZCT9
z<+i@dY+z@(vYo9IpsQ_N+9TDFPr+l7ru^UdOYMLFY|S6JXzC}rY`H9l%j+XmLOohE
zawusi*#zXQVhZ7}S3KECY=^R(d!C0w6`E@SDrZM}nYpybX8HC~%wB~Jq8HDg`{jDB
zVE7^ewj{T@5jENnG9c%@;HymK>(plQ+{2`0Y?VxgzbV~gmi;?I;ct!F3^-{$6}`XT
zF~ANExT-GQ(88QY}a?z?a1->u^~5)99;5LQ0`N0cdl!i
zn)j};I|0B#7MmUt+ldyRy|P%Ex;NA@Al7)@<3Re$i+~)bYp#$!a&Th)iA`C0G+5;y
z+_z?QO@DQZ6{zC4$-GRh?Ni(Nt(|r1Goqsd(ihHDxoyV1MuWJ8@@Lo2
zy`Mi@dEr%1MnTC<7;RHxS@O|aj14F(v|O{X7?nM+RK<=qfzd6QY|=B=*<6eeY(nhc
ztB!;v6zLuv<5;p2{x=;B77js71S2i-4iq#(I9Bz`LV>ax)tiK0}
z*xHV$gv?rnM)M&b6ROCa{mzoyth%0x$Hu?uOKOA^nprn71^ZBAS}$n3}cUYxL0i(MHGVsRjJFu$edJJ`q3f(NWzk~uP?-3oqO%kQBb3%0U_Lz
z%N^>P9ZWDbD=IX8mA^EY_IM+3J??iFNEa`{;pdmR$;3Q9dgyivh`G#3xOSW0ojp*M
zpkC#*4u3s@MaxYbO&g6)oR}58$$;J&}2_w(mUi2R=>Uwvm}bG1V7Ql43t_TW1j9L?2#bEa1>}r%BD#_
zCUja@B;{3tvtItG18*bu1p*Zz{#4(Ew$8X&+}V9f>7UDO81q_aFmQOz#J=tF;=9#SoR3I
z{ym?V_@(8qq-%$En{WN?u{A54;HoC5Rrwz3A~v@glI-XV2i-sRFzvRrRKu#KZ7k*F
z>eqOndFh=L$b2GS&s-_(gMmk&pv1rxE{R)K>$W!^uMNOWhF~uWwz)4G
zT!Cs3PR3NsN|_G#BqFgcV^^rw`;eETzGd7VBX
zT{>VW^N2T*=e7DM^qfO`${yN@`GlPxE0&mBpB3F|DU9^NK&qm-$7R`Vm5m5l#j#R}
zrsHT$%{<#bj8<%&*uB$lXvu8XXDn!BvQXkS>l9K41(Fq52?lk36ciT}-~n>+%r7qH
zgtS_y`Ftb4Pm5J7+rjb6k9^u2V(>9@J?sUk1YF_0OD$VLhr$83?143#th;AYRsdEL
zIFQDB;<#e|8>~B0l0d$G*uaq3fOm#ak%VArAmM(O@1D4~06qRV&{@Ux|Jk8w})
zo4rr66Kt>#N~yaezkl6mKd@Ab&`|^RqF^haj*xuIq4#TFX
zne)t~u`?jIt}Lq3S2d|$r_jbRnLaM}NwYW@JR%y9;R@HLy;8|53f^A4*;TdN+`7WLJ~T`kAX)I?kDXOB!zD>ZNykr>r|ZLFU%5UlH2N!+I~65zUE}h
z!Wh@W2U>5FVYON2S{`VaNv*zoOC3|b*+$axCY4OD-J&ZtQ)bKZ1}&7I{y8Fl!R;na
z?vKt>0)bEh%&)|tnIypLU!Hk%A+z)ErR#x@Fq#?)Wl>orpGe#YTC-U;UJVQsryRs<
zefpUyaVZ3gI)FrP4}(mTzSrbI^5%@^zT1Kh&Pd;N&u9`Cp1xy-`6;v2i`XrBt;*K7
zy}f5bmAYT4K60{O*LdJ;2Asr1ck2CU1jTtkpnr_
z_OHgKq9V8Z#A>SBr&?yOr^!6}31dOfg3Z7cHAtCKLJ~tt0GtSw@JBPdckd{03GmX_
zQK`<$OnEcTJ?D0YFTi)
znf9XD_u%w{Ploqid|EauZcy9CV?ac9b%UX!3Aj?`TF!RO@!8|P)?QAHwL4Mqd{3a5
zpa>*RYklwT#SCBk>=<-(*krWtDwlRN6X;U2LV9>*?crSJG3@=beRL5avU_d?I;f*N
zNNd*oYk^r=2QqIPm1uV;``~MDdwAcwbQnZ&5OTRx7T+*$2eZPfJl|^T=%CuzaEh9~
zq6>BNHRq;&he4ny#2J4=>*?u*^c$^A%n$@D@ENUMTx_K1Iy>I8sNeH+Y>Pdxg2#6EiywqR+J7qK
zq#4g7|7H6?=>Lp&bcPHdx>>&Y50Q(Q&d6B4JVNcRhH0bia}#Ufjj@}vLHGbB6ahQ$
zrOdWHg%;K~Jy+BA%8TnDX^=XfvNBs+7I`Oy;iaKeHCuGYpo4|ccfR-6LbjDbPdQId
z_0xTmnZ{DKZgC<H-t1xZu%U?jbuk!4ZMAres@BGW^RDqGWz`YRSc#PVY~KWB1;)@e!N-^wtsZ
zQ`^?nPbfysGgUOW(~A3v)*fr%X+UCJxG4*H`>Hbi2vEKnvlQ$=up5s%~g^Vmu4{
zXX&il41zPW8OFQrRtu=$G-x0&gF%v3a67Up
zQ$vhs@M1lMnOQ3Q+*!$S
z6X>zA_WunR@)GjWTxUsQVxcs!un8pQt+-nwPR8I!CA#`Vqus1Jmdij)$nI9`A(FDD
zekQ!rU2|&eF&yFQPZWUhucW0N@yI*rUH|xbEdnQmX5-skmXB9IIBn=LR*Nwt3Co^{
zF1bLLDd!WPpsZNN?Ny$NK>8O-)wHq(MWdz)jqlFoKk<$dUW3RT9m<&|(BtBh~uEOVPZ2_{hD{y^?hKF6daoU3eiU2z!T*E
zo{}yJy6au#XI9|GHdnva63TmT3+c;BlOsE*-weKo;+t=z$MkIld#nL_>NSmpWp&NE
zG@4%iRs^hibX7^Ss&<8A#M_Y#C9TaV@QaBRyfT~fj0VzS+p`>@(qo{85t=Od_I=ID
z@)}$7cpx6Yv8u6qlg+WuBZ
z@)_Js*TWL}l~l}!ehx1nZI66?SkUve)~36{!p6bO@I~{N)Gw4yqVoW}0u>es&f!24
z`;`Rrx;c?9zKOyFJzd72B}LSh#QE%k=@ac@@c86}gpm?I!Y=?WpX$U5Cu{*vmRd
zlbht!8K}3}o>Kh7afS9B8~kc0g{Takl-~x+b~opnJN4u<;e*6FfRmw+lzUd|6^U21
zEBAe71?h2hEA>3rp3r)=5A=xDI*=}722nY)_GEaU1+8b5s(TOjI)k{4S9pums*NXp
z0wbyIS)P8_do&Qe>C3lXgWIFweM$;K=FmH<{zJ*c_QU;50d<+jzd7d*l=)xiP759w
z=pr}J9|i`a2b|v`dl;n+e&YqDHwsUp%(9gg193W|B#t^dJh|QBhA+Lbymsy1LrN9QS%}H-kK91Xu5W72p6?5@;?je%4sRkNdC8&!lH)d@CI@d~>dc
z50%CJ!NPMP>PN7p=iX;v6M5Wat7k(BrJO-WX~+38Fj;#S;RP7ZwLKd?Z~J%Z#FMz@mv3oqlB@F3c@
zKFu4UXRg%~7?qZj_3R5TCSH;iNBTUwLvD*=NIn%e2a~!Nj8!b+QdO;$JF%?BrtNYL
zk87r`=dX|T4?Tl&YFB*cs6n08Ow{`8{lhN$UeU!9lVSJwJMG($^ug=sZA`f~a2up|
z=>c&icpX=VcjF1g5B$hSbC4!^^coBmn=vBTm=XD*h-GG4o=WQUUc%$@&*q?y@M#4S^wKS2WH+$0-xx$
z^t%h6zLGHEc;Rmvp{N_L#qqNB55z^pQPMh>Enni6&TVI$CPYmZRG0Z>D$Z+F%2)+;
z6y)XE*y=JKbS;FX}S2Z(p0^@A7hQOrhM*T
zs`ha}N_nAl+okOV`vpAp0HRq=&FeNMg(J9pEo4rVXgD6lJQ#dW&Yif27fxM{f%@pK
zu=t+LwQ6Hk6&;77EA9>F!5U@8e9x?=7I#B#o#Iy+$GNFG(vN#s5>^LU86*sb37jPq
zSo&xJ$p?8)rK%boJM$anH{>5bBRT6o;yNTwckXphDOclF(Jk~gLeFsIKtt?v6>?0K
zKL6!m>_)pvWIig}Iu6WEbeS;iEZ&`)NoBELe{Tp7@2e8uZ`%(0?bD`dP)1!GmGN{*
zmMErUbn<ZBu-R3S??M_HAr*q9O1@1*Gt{j;-*eR
z6-bZIakhaYlT=uU}io{R7G{7t%oP^=Tfx0gYjpyDyoTy
zIqVL~Yi!Cd%gXCSYs*|lC1cIE^Herpw+OSU*0&w2DsIKq8}*HK_UrYE!poM$eJR8Q
zt(wBPyU;|L)vQza%f6A7|M@VfgngsUqSJbpM3?yH9Icu-XriXO-wqfC3cIve0g9=^ld
zE?T6RM9anaajDlcwHEe<-4T*r`1@)vyCY!-$Uh?0T%y>J)3t*1aIUu{(iM_(HHu<5
z5ldA@^bwE>vzi@0@9#T{{NF5eKN1DRAxrYxs|+-`U9_NHHp@}&roPzmgE}Iq`6?BN7;}P?Y%YcZpwx!Rs;!J
zERK4fOpH5ZIa^J?ALo2af^{h}k4MN^a>pZm&E5Pw_&hUerDUd?WyN+@?r|TH9~A{A
z8@p+_p*0W@77?y_G5kgx&)u~b2a5nN$RQ$XouHGqGtxN$m~v0My>vQMzI@GYR6UmD
zGq;Fzg(ZzrxK@p`f(k5y=BK3*;$fM(`)hQoLa2(`ZCGMb+Bz4jct>G-Hh7%{M#b|&?^0NRo^Vzb8sYjTUo!IPKl^;b?F;0bm<
zc(|OAar_?y!!6?l?jx?d?;rF>xJ%QDjxBZyl|CiE5!ZCLjKH)Yz@&xXpmM-s{i+E@;T9TMy2s_}WaOrTT-71SyTMc;%RW+jPkE8uELE?IjnBtQ9Y
zIluA8&NF@i-Rbd)Q&nhKW%!EG_DWl<5_-`y_ef%WWL;sNO0}GisWq!{HCbveP)D4(
z{@v?OJ-ko>Zix_^`Curv)8)k9c0Q%i87a|eVV~wS3%<4H*B&9G)auj{+Aq_nJQq6A
z#Zv$L#Zu@$6sHsM3gh&l;P}1a6?l0~i06uqir6wmJ+tx(tH2Txxe8Pm&sJ)UeES!`
z^eKZqby=CK#M_9S6D8PEprpF@ce)}THg)merlU4y73;W}uLD2qwUq`om;8KwUJS}M
z9~?Vqy>6Im@e7{6wMhQjM=^&9{_-Dnq{qe<1T_OCN9_ecpNAdFgZ8ic{1fSE^>Lx5
zH|#cq{{OvDp6JE15Kkgj8v`Ym+lA&V1$7{d{Z86jO0;x6*}v)~A6{}D)|CFunP#UU
zth=45nLEE&EDo_U)xiB0w$3$A{DV$B9qVpAG7@Scm6g?Sp6V6aO+XEXf+mif~E5
zaHS3Z9mtEYnIL+wSkPpZ<4fu36>eMatFp<&=|i}~osgFhQcwpkGeq?!%Y}Xei!>{JL1#OiyO|Q357s6aR4Sj0I0%6H9Kf~1k
z<->ye?4M(CC226GqJTAasrj|P|>
zx1r2QwI^=Xr8r+1M7HsJ^gZ}8$lqmA+~?`B7GkE=F1>^`WVZTF4P}z?%<}qq-=gIm
zjNdlN?Lftk^_%;$y$D<1b;~1d`kMU4GB8_7Q1m0?wX+L$y)PKYH*wE|!=>4?u>u9p
z6WjEY3x+79l7=ku8vnPdnn9n=iqsU8v^x(HQ0q$e4tC6RC~hV;zJ)1I*osdRbvTxM
zB%A0YR=k+|;pp{u<&e+xKaTt^M#84Z5EC@ax;Chu-&+S3x}Z>gJd)``hk&kchmF|I
zL1WKn&tsw2`6tPXN?&se>HWV%e145?j{8TP;7!Pw*w0O4zr!h^r|-_b&LOQ_l|ca!0UxJym7;;d%ow3-RaRx?A|Xq?EdH}}<%4i~EHk!}
zZ{Dw5-3u{9KSh6kO+3V$spyk9bLlS^KqBwTGd@PB*d>#^zsHl@5^+V+>iV<8q3tHw+&3Wp(S15N3bD{>fjpZgX~uk^L)iM^pC!lhCI6bq{g{!_ZXx~V
zx;}_H^=`sPWeGJXic7u{*R2cJ6T?)pIk`E%mdM6PiFkh|AjLL`yC8N}MzUEs%H(*G
zJArl3K363KoVr1aA%7z2iF+$s6q+y1oY=&*?<SO~;W_bn0FAb_S?)by>yF}xA0ZfJdAEIe
zyP}inix_F1pZeTm(GhJJNU$0WPT4-cLlY2px2pO$wxXcLfzYh_q3yPzR!ZGloKfuO(~LADLPKzHB&&H^|g
zN{!yZcM98ubaxgI6&4@u{<0Re^Yg^DdV$?EsI8aST+G=^-x}F?8nUl+Cdh8}=v4xc
zj`TmiIZp18LwBZdOWkY(UMSzY3#;A(mi_1QdNJ&{i%;If6HrcLz)N#ADq}p^O-Z9Z
zhyEe%vZ6spWoM;;T80M45|gsz{gg(csZ{({ZP4pK>{#LR0Ey>71LmN2wWVv7EvkV_
zYLfjSIDclKaHMKcZ|h{WscsydC7ChI?owP#5N*<3)zkmssG1_+oY
zd9lnG{sGas(#~Y_QoxL#`=no?ZBbdOE6!mTFGdAM(^X)5Nx0e-y~#NlD!~S(95Jk7ZF8m%gFUk@#C=TjvSzJf^^m(N)TT
z{(%r2621Ar5`RJ6nkuTXg6Aj6#+U2LlM>gxy8brHdP`NkeDl>7stsoQCE3x@#OSfk
zcL!&1x*8^>t<6ND0*NvvfWoG=F38(6e#atmLF!dFeMZwtoOg4m3C*Ay^Qe>>@2IY1
zy0WYrM}Sw-vPZ!&Rq767YPhz@WQB%IuxQ!EMZJxqPpH~M{0&o3{`GCc1Kd3+e4UgK
zl>LK&Is5WIlWFtg6ePQO2ZGJexz2yB1fYv^{-tO1GCA_*rmHmN~Cj_lvo8R7nT+Y
z>F!QhLPA05Zjf#SRK9Ru{M~zJm~qCx&Ybg}=lRrmmg+@WtXusT-y_PlM|Kw^Loz~3eWf?E_G1!3+=V)nyRs*s$JFTTGVuBY9UrrnKs*}o)r
z7v?Qb-oyKhRcV@kDe6HSaK96O@gC0$f3G-RN_F+<*gCsoL6{IckiX$eJ<)1^S>h9VElW>oGDP`VT$Qf2u;B#{Ahjhsv{%5<6I2|L!!MH0B0G;sQQNPlo-*~=oOyWkl
zl;09#wSm@W{%W-=1|Yi4qhuzC&6gG?J1}KU+=+EWe5B4R$sb;BBAob=);`{o3L3D&
zB>E|bFn_+U8py6#e>2(vwsghFJK8xd@nGb0QKUE;5@a*M-|#wrBRVpAB{KhF{2QJ6
z7)}akRSr
zY@IC5fu{2)=rQVJI^RKEG^FT7k}1(wNVtx09tGa;!A&phWx_Z8vKFp2Z;htMDfD|_
ztH+J^5f54pcb50JJJB%r^YiH_p9e0=UnY@#P8gd+*w<$!ZnFpw)z1Bg=lIv5zWzoI
zsoSrYQa^9Hlf$_=Uw7e0{kipxN~xR^D_>i$Wx7i0jkI_agaDvt_U-_CN8hsVcN6}%
z_4_8}QZ9SjmM5Ti9>q#r*YN71QK_;_sMdjhskomVc?u--bH)}xI{X9h
zPYQhrT;UPUXWVXo&;6i;iv^SGrsa_ewF(0jQ^)=G4t?^&UAwGYES4w;vN$&j_5{C#
zMvPMRejz1K=-4P47TlN2kw8Hh@{REfdX4TJo!3Yrk)BHq1YE
zEddlFh1eNfjKdfIfk3Rd^Gk)>FauweX)q_KI(f9hdA012Xr8ANdpQsuFUI7$1p|N-
z%2$~Z${tLgR(7KUk5;Cog=?16eUMPAOdN|)xZbCq?g75{<+rmcPU8qZdkiN(XE<*+
zU
z22-8J#3(^6sf?#JSrHKjdf<|I?6xU*y^zbn6((}c*~Oe1D1dT2!7}aPixR(NX9s3xi!ENtpynu*y~=Dk?HrHRDY$g&-6B%#
zl9o7ukA$ufpFd2TY-gCH1(yGs<$!2DHnvUOQg(e7YnzY_Fxmf*-)vlOGT@GaEN9}b
zMo;Lx0!#Vt7Oh8i*Hg$Zaep+mQ2FWQ9KGEF84J7(#%=Tr0u>xE)D%fU=UW3IJZyaQ
zk_d)LNjNpR^PvtrqEyd^40`6tQ=_T*8d~R0ai{~-KnI7V1tEIps81Tl6Shn82~j%2
zZ`9RI(;#Xoe?%%0HNA-EN0E-0R&^5!7Zc9Cs9L_6r4#2BK7~U9uY;?p6N8-dXawV#
zr!cRDSIKSI?WcQM{<}vfOBr0&zAesL{sCjYLC+unwBw2d12u9OeRP)c^2Yc*ylG8I
zo+*ZH(W^^bbr#fWG*+-W{h$M{a+f)kNxC$q-YaP5$D0C{%J5vJTDw8vLC!oB{AinZ
zEbzx_3XFTwJ$mu3AAbL!M@QD54w0N!B*SrRgKhl>Tk~2_l#&hkdwGvS^nM;{#=alg
z|1bhfXpd8C9nKx9$}$U#X9-_(KWn@N-Gnc%FI7xmyLJ+
zX?IsUfyshh0LKK2M=_=1kF~f^1*L_Cx;Tg`hV3hx;35#==DK|n7yE}i*yf>s@$zQd
zjqmlMr@+qNpyiG8)754TN*qiP+Z_^eDiuHDKY9@K3Hxh3(&y7&7ZtMVlS_T8qICZS
zNuYw+7Aal-R98Z}@w9YSJ0YuR>@()XL8(C>=lsfW;cqoduJvx6{`>z5qk_Ku`e9mV
zvks0h@)=(=C7VtgT0d!{B-4OwjeAl>SiF{kvY&VoOC`QiA2ZS9xi?ZB&eXy5U)K)~
z-On#-wzp4N8IplG!+~^AzwiFg@`-PIpBdJ1B=qwx@QyNq>5BM47|`5NCiFX^alc$U
z3k0ftm@difXUD4orpo3#SEb8dLjx5MU79b}2b6yltb^VyF;D6mPa{>(rl5~o+7V|P
zQna*=fl$|4*+h3Z!|>Zc3ZNDJUURT2gE{38PuR7oh?H=aP!1qUA$kESkhdFA>TW_S
z>=CM8CYTj8pK=Uz?^=$jj%wtT3|Dcsxs!}c}kowR@dND42wTJ~=$&X^1Z
z4fR{5E8bobV28QQ-{PN=xDSRk$n~`L=87Aty=jPVLhj>!_GnfepuB3BKBN2o!<5(G@*;XF;ts1u$O^{pbw^pm}TxhDY
z3CJJhi0`;{#oz;df4M|Z-jRagH_Hofh$otERnjMqV`rz0LoYS?qJDPf*?NH;);OgA
z<$$15P_qptI!WT$>)dK_fnG00S8FAT&JMF4UPH~~Bjkr0X{NsF)!xZ<{lBb8%}pQjX@{=8Kv7r4iD(lR
z&=}$jMkHgu8ylYoAEsGv+R9yE=mX{p$X!mNrRaej
zN&UI!-cu^mDsrAO1^GAY`0>o>2r-1XgdV@1iZKJZK3#Avc}n`O26*uJaji9Ll0m_>wz0#Nt3%E~@5-LDFz|e=@
z)`5W)=`s)!HY@C~6U0x>w1Mc9XIxQs5g(ZB`-W~ox8b*#+vAYI&l}iskui#ouBq-I
z*)=P`jjn0qe%)?fJ~_!Z8~s&n>T^}Q;@saDyMn6gzw4YEO}jXQRNIQdyFo+wc+BniT;
zQp%(XnE-LK>~iL2O37AJ*kQ5vu)j!<<4PBi1PKEZZure-knVqd{oUgH
zAPrN7EI*|Q3EAp*;C@H
z$3FKP@9oehsHs&X0@E9OTI&{BWwn5zK~5HXvbD3aQkE#-fRRSwO;{#pb^6lfhb&Qo
ztqG94T%UT2{HeI4ATmmYMg8a7^wcV{hwL*$&QE)AV!Jp8wy$2y%pej9abtuM`*C9&
zyG|(uTBGn?|Ah!7c%IN$qbJ9;XoBH#JCn}F0){E@o^LR{d1SN2NSsJkKWAYOC3Ts!*V#&DI30l
z%xbue%xAMYmNzSJDMR}Hw%@AW@GBe}Z~*OdL79F_;J4a;xbAyd@-Xc`VLdiB9azhp
z<4dC;B?02khUbLWrYou|wS_Y^xK@(9p-a6|)Z;9LziGY+PAulN5E(wC-_Y*U@lJI6
z#h?P#$;Q=%<=<`U*ODiOnsFm<$vhSm$V#MPC4E8P*CGQh5(P`$kLR%Hirp{zPOvDH
zKyYd1PV%dG)>
zMBFp_JN82>p^`WMeQ2L|SUh|D!0nw_Mmrm|+Xb{!Zqa0!Yf!>Myngi19-up5E-+q7`tG~Y0D@I83%ob>>>(MJvIXE3wnhBkfiYpC#GGy!<=QKU~;mwoXAJNuD>E_c?ai}}!
ztZ-alyQCzQxj}LHdMd`p2lcb24WSuX%tMe{@p)B05yIYlHpZYU?M2tZgG_o>quz)b
z5qIHDoUKcpdQU-(2B_a%35@P~{Tp;R^gk?N)`9U-u%xyt6D>I$Gh=oEL~@?pSBtn;
zBQLPa0lFT+Mm^1&_%b?HN@$2PZ=w^RfBpaEDMU2-KFPd5aW+ZC{ja5XdGQDx7P#fl
zj}rImv{B7y_o2I0#D?cpT*aeIh4(U^(M2=k?i;f>|LWv324r1U*3ZBIIl0eAAtTv=
z`z*MaqPx4Gzw!4v{04bcdeYpsQYtOTds&@s>{kB8*NQWsWILH@nq(S&1mh2tt%e&*
zHsVMf+u4|Mn&uBc676X1Cr%)-8$XRn0_AMP+n~XncfjmXPzicgsq~@5AZz;hYD!Gf
zi0-~-B^j*l(}*n{y=MuAcv$E(FXlPOb9;v`5j5#q+vGq0xv%LOz>i0s0$6nam;Iy%
zp7Z;{H&j|*?&G=K?^GQyMO)=Nt~9#6^c
zGAVk;m3lv+U(B;T8l8Q$*d9iKAp*dcRq#kSnm${?U&Z^=r4B^py@N!-9C-cn-WiK<
zlhiBO@95>JjJ&mGNlS|1h-BQD+7~($4Rmh2iT}M`+9HjU(LF$}jFU1GE8GjpZaa;K
z2E@Vtu)X%}n_z^2U}aJ5Dg#tL4p*IoEC{3RPyJ3
z^5$)paO97#*sN*AV-FuZA*G?n#HPpV=jdTq5Y|rmdWy7~OR0GM(VcDutqgC`qEDSmdP+N8OFiHn$@OcB3Nc+)j);dQ?MBV$I%>(WgUKYtNLv{a+Hiz8vW)V?`ACIkuKsg+sl+~~Z~YMs&16Hkl{_ke!2jvrd2Wq&3a
zcrS2tA{#QG=(*q?4)}*2F^^!Fy=aMJw>_E1ei=7mz?`l_>hl<6IjB}8$(7|mxKqou
zo+OB4053>`9E$RJk-6%WHuCX#3(2&>R%G3Y6gbXv=}gNoYyuEl^*$mx-~Tj~avWMBEHf
zm6VH8twzo29=O2=d>xwcYQQscaJ8r1jxn*rBQ=yGx?B%jZkv>H)grFq6%lG1eXI0HI-=gME
zmRa?f8?kaCq7)cg;=u#0Ae&RL^sVzv`opWxOMiKOF@BdE@dNF4V
z_ENvVVDi2FZE(269Shh!^D4D)4G@i1%t}0{|1qntcQBV`LF}xp)0{5K9}EO{NKo+
zF4or{%Y24sFs1VGMt7EWBT3*pHTeth?}ksQSgBo|Y_k<$D=bjI6t&tNT$tO=h!q|x
zey7J(zU1+0WVD2$@qp19ehVv=0oF;-8By;AxN}$t{&-imTCd%wW4ru==8S}JomMCx35Wj_n9B&(Qy$3;{tGXnkco&FaMU>y}&A=Rd(!h
zhNXv_)vW)b1ogv$Z9{d%6lN4*0dlm0?%83Nccn)B!W-<>&4HnL^Xy7kwwdx6B)(y(
zI0@|+H>p{_AN#U*O@6X;$DpU*irI2N;UaO1qNA)1wg@jWm1x-MMRW2uhL~4nf>LyK
zc`$f5A>610qAONz=jFK|JnPn66E#Ra7&4>