hacktoberfst

code/12Hr-to-24hr-Time

@@ -0,0 +1,14 @@
+print("Enter Time in 12hr Format (HR:MN:SCAM/PM)")
+s=input()
+l=s.split(":")
+if "PM" in l[2]:
+
+    if (int(l[0])+12)==24:
+        l[0]="00"
+    else:
+        l[0]=str(int(l[0])+12)
+    l[2]=l[2].split("P")[0]
+else:
+    l[2]=l[2].split("A")[0]
+
+print(":".join(l))

code/ATM MACHINE IN CC.c

@@ -0,0 +1,125 @@
+#include<stdio.h>
+int main()
+{
+	char name;
+	unsigned int number;
+	unsigned int withdraw,amount,transfer;
+	unsigned int character;
+   	char c;
+
+	printf("%c", c=201);
+	for(character = 1; character <= 40; character++) {
+		printf("%c", c=205);
+	}							
+			printf("%c\n", c=187);
+
+			printf("%c\t\t\t\t\t %c\n", c=186, c=186);
+			printf("%c\t**Welcome to ATM Machine**\t %c\n", c=186,c=186);
+			printf("%c\t\t\t\t\t %c\n", c=186, c=186);
+
+		//	printf("%c\n", c=186);
+		//	printf("%c", c=186);
+		//	printf("%c",  c=186);
+
+			printf("%c",200);
+	for(character = 1; character <= 40; character++) {
+		printf("%c", c=205);
+	}
+		//printf("%c", c=186);
+		printf("%c", c=188);	
+
+
+		///////////////////////////////////////////////////////////////////////////////////
+
+		//***************************** THIS IS ATM CODE.********************************//
+
+		//////////////////////////////////////////////////////////////////////////////////
+
+
+
+			printf("\n\n\n Please Enter The Name: ");
+			scanf("%s", &name);
+			error:
+			printf(" Please Enter The Amount: ");
+			scanf("%d", &amount);
+			printf("\n\t\t\t \"Welcome %s\"\n",&name);
+	if(amount <= 0)
+	{
+		printf(" ERROR!!!!!!!\n\"BHAI ATM PAGAL NH HAI\"\nNeechy Paise Daal\"\n  ");
+		goto error;
+	}		
+	else {
+		 	abc:
+			printf("\n 1)  Check Balance:\n ");
+			printf("2)  Cash Withdraw:\n");
+			printf(" 3)  Transfer Balance:\n\n ");
+			printf("Enter a Number: ");
+			scanf("%d",&number);
+
+				if(number == 1)
+				{
+					printf("\n Your Current Balance is %d\n",amount);
+					goto abc;
+				}
+
+				if(number == 2)
+				{
+					Withdraw:
+					printf("\nEnter your amount to withdraw: ");
+					scanf("%d",&withdraw);
+					//amount-=withdraw;
+					//printf("You Withdraw: %d\n",withdraw);
+					//printf("Your current balance is: %d",amount);
+					if (withdraw > amount )
+					{
+						printf("\nError!!!!! \nPlease enter valid balance to withdraw\n\n ");
+						goto Withdraw;
+					}
+
+					else
+					{
+					//printf("\n\nEnter your correct amount to withdraw: ");
+					//scanf("%d",&withdraw);
+					amount -= withdraw;
+					printf("You Withdraw: %d\n",withdraw);
+					printf("Your Now balance is: %d",amount);
+					goto abc;
+					}
+
+				}
+				if(number == 3)
+				{
+					printf("Which Bank do you transfer the amount \n");
+					printf("1) Bank AL-Habib \n");
+					printf("2) Meezan Bank   \n");
+					printf("3) National Bank \n\n");
+					printf("Choose Your Bank: ");
+					scanf("%d",&number);
+
+					printf("\n\n");
+					transfer:
+					printf("\nEnter your amount to Transfer: ");
+					scanf("%d",&transfer);
+
+					if(amount < transfer)
+					{
+						printf("\nError!!!!! \nPlease enter valid balance to Transfer\n\n ");
+						goto transfer;
+					}
+
+					//else if(transfer > withdraw)
+					//{
+					//	printf("\nError!!!!! \nPlease enter valid balance to Transfer\n\n ");
+					//}
+					else
+					{
+					amount-=transfer;
+					printf("You Amount has been transfered : %d\n",transfer);
+					printf("Your Now balance is: %d",amount);
+					goto abc;
+					}
+
+				}
+		}
+	return 0;    
+}

code/Array Multiplication.cpp

@@ -0,0 +1,52 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+int a[5][4], b[4][3];
+
+// This takes input for matrix A
+for(int i=0;i<5;i++)
+{
+	for(int j=0;j<4;j++)
+	{
+		cin>>a[i][j];
+	}
+}
+
+// This takes input for matrix B
+for(int i=0;i<4;i++)
+{
+	for(int j=0;j<3;j++)
+	{
+		cin>>b[i][j];
+	}
+}
+
+int multiply[5][3]; // The multiplied Matrix
+int sum=0; // This will give an element which we will put in multiply[][]
+
+for(int i=0;i<5;i++)
+{
+	for(int j=0;j<3;j++)
+	{
+		for(int k=0;k<4;k++)
+		{
+			sum+=a[i][k]*b[k][j];   // The main algo
+		}
+		multiply[i][j]=sum;
+		sum=0;	// Note this, you made an error in this!
+	}
+}
+
+//This will display the multiplied matrix
+for(int i=0;i<5;i++)
+{
+	for(int j=0;j<3;j++)
+	{
+		cout<<multiply[i][j]<<" ";
+	}
+	cout<<endl;
+}
+
+}
+

code/BaiTap1.java

@@ -0,0 +1,17 @@
+package com.basic;
+
+/*Bài tập 1: Tính S(n) = 1 + 2 + 3 + … + n.
+* O(1) : ∑n=1∞n=n(n+1)/2
+* */
+
+import java.util.Scanner;
+
+public class BaiTap1 {
+
+    public static void main(String[] args) {
+        System.out.print("Nhap n: ");
+        int n = new Scanner(System.in).nextInt();
+        int sum = n*(n+1)/2;
+        System.out.println(sum);
+    }
+}

code/BoundedQueue.java

@@ -0,0 +1,74 @@
+import java.util.concurrent.locks.*;
+
+/** 
+    A first-in, first-out bounded collection of objects. 
+*/ 
+public class BoundedQueue<E>
+{ 
+   /** 
+       Constructs an empty queue. 
+       @param capacity the maximum capacity of the queue 
+   */ 
+   public BoundedQueue(int capacity) 
+   { 
+      elements = new Object[capacity]; 
+      head = 0; 
+      tail = 0; 
+      size = 0;
+   } 
+
+   /** 
+       Removes the object at the head. 
+       @return the object that has been removed from the queue
+   */ 
+   public E remove() throws InterruptedException
+   { 
+      queueLock.lock();
+      try
+      {         
+         while (size == 0) 
+            valueAvailableCondition.await();
+         E r = (E) elements[head]; 
+         head++;
+         size--;
+         if (head == elements.length) 
+            head = 0; 
+         spaceAvailableCondition.signalAll();
+         return r; 
+      }
+      finally
+      {
+         queueLock.unlock();
+      }
+   } 
+   public void add(E newValue) throws InterruptedException
+   { 
+      queueLock.lock();
+      try
+      {         
+         while (size == elements.length) 
+            spaceAvailableCondition.await();
+         elements[tail] = newValue; 
+         tail++;
+         size++;
+         if (tail == elements.length) 
+            tail = 0; 
+         valueAvailableCondition.signalAll();
+      }
+      finally
+      {
+         queueLock.unlock();
+      }
+   } 
+
+   private Object[] elements; 
+   private int head; 
+   private int tail; 
+   private int size;
+
+   private Lock queueLock = new ReentrantLock();
+   private Condition spaceAvailableCondition 
+         = queueLock.newCondition();
+   private Condition valueAvailableCondition 
+         = queueLock.newCondition();
+}