Merge pull request larissalages#234 from ashutosh321607/master

Added Codechef and project Euler problem

Author: larissalages

CodeChef_problems/Long_contest_and_cook_off_overlaps.py

@@ -0,0 +1,13 @@
+t = int(input())
+year = [0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0]
+
+for _ in range(t):
+  m1,y1 = map(int,input().split())
+  m2,y2 = map(int,input().split())
+  if(m1<=2):
+    y1-=1
+  if(m2<2):
+    y2-=1
+  value1 = (y1//400)*101 + sum(year[:y1%400]) 
+  value2 = (y2//400)*101 + sum(year[:y2%400]) 
+  print(value2 - value1)

CodeChef_problems/expected_change.py

@@ -0,0 +1,28 @@
+def fun(s):
+  ans = 0
+  o = 0
+  c = 0
+  for i in s:
+    if(i=="("):
+      o+=1
+    elif(i==")"):
+      c+=1
+    if(c>o):
+      c-=1
+      o+=1
+      ans+=1
+  return ans
+
+t = int(input())
+
+for _ in range(t):
+  n = int(input())
+  s = input()
+  ans = 0
+  N = 10**9+7
+  value = ((n+1)*n)//2
+  value = pow(value,N-2,N)
+  print(value)
+  for i in range(n):
+    ans+=fun(s[i:])
+  print((ans*value)%N)

CodeChef_problems/the_theatre_problem.py

@@ -0,0 +1,72 @@
+# def fun(mymatrix,col,row,xvalue):
+#   ans = 0
+#   maximum = 0
+#   #itration 1
+#   for i in range(4):
+#     if(row[i]==1):
+#       for j in range(4):
+#         if(col[j]==1):
+#           if(mymatrix[i][j]>maximum):
+#             maximum = mymatrix[i][j]
+#   if(maximum==0):
+#     ans-=(5-xvalue)*100
+#     return ans
+#   ans+=maximum*(5*xvalue)*25
+#   value = []
+#   for i in range(4):
+#     flag = 0
+#     if(row[i]==1):
+#       for j in range(4):
+#         if(col[j]==1):
+#           if(mymatrix[i][j]==maximum):
+#             col[j] = 0
+#             row[i] = 0
+#             value.append(fun(mymatrix,col,row,xvalue+1))
+#             col[j] = 1
+#             row[i] = 1
+            
+#   return ans + max(value)
+
+t = int(input())
+myans = 0
+for _ in range(t):
+  n = int(input())
+  # col = [1 for i in range(4)]
+  # row = [1 for i in range(4)]
+  mymatrix = [[0 for i in range(4)] for i in range(4)]
+  for i in range(n):
+    [a,b] = input().split()
+    if(a=='A'):
+      mymatrix[0][(int(b)//3)%4]+=1
+    elif(a=='B'):
+      mymatrix[1][(int(b)//3)%4]+=1
+    elif(a=='C'):
+      mymatrix[2][(int(b)//3)%4]+=1
+    else:
+      mymatrix[3][(int(b)//3)%4]+=1
+  value = []
+  for a in range(4):
+    for b in range(4):
+      for c in range(4):
+        for d in range(4):
+          if(a!=b and a!=c and a!=d and b!=c and b!=d and c!=d):
+            mylist = [mymatrix[0][a],mymatrix[1][b],mymatrix[2][c],mymatrix[3][d]]
+            mylist.sort()
+            if(mylist[0]!=0):
+              value.append(mylist[0]*25 + mylist[1]*50 + mylist[2]*75 + mylist[3]*100)
+            elif(mylist[1]!=0):
+              value.append(mylist[3]*100 + mylist[1]*50 + mylist[2]*75 -100)
+            elif(mylist[2]!=0):
+              value.append(mylist[2]*75 + mylist[3]*100 -200)
+            elif(mylist[3]!=0): 
+              value.append(mylist[3]*100 - 300)
+            else:
+              value.append(-400)
+
+  value = max(value)
+  myans += value
+  print(value)
+print(myans)
+  
+  
+

Project Euler/python/problem44.py

@@ -0,0 +1,22 @@
+import math
+
+def pantaNumber(ver):
+  return (ver*(3*ver-1))/2
+
+n =  2500
+
+panta = []
+
+for i in range(1,n+1):
+  panta.append(pantaNumber(i))
+
+for i in range(1,n):
+  print("value of i =",i)
+  for j in range(n-i):
+    print("value of (i,j)",(i,j))
+    if panta[j+i]+panta[j] in panta:
+      if panta[j+i]-panta[j] in panta:
+        print("the smallest value D =",panta[j+i]-panta[i])
+        quit()
+
+        

Project Euler/python/problem45.py

@@ -0,0 +1,41 @@
+# n = int(input("Give the value of n "))
+
+n = 1000000
+
+prime = [True for i in range(n+1)] 
+p = 2
+while (p * p <= n): 
+  if (prime[p] == True):
+    for i in range(p * 2, n+1, p): 
+      prime[i] = False
+  p += 1
+
+primeNum = []
+for p in range(2, n): 
+  if prime[p]: 
+    primeNum.append(p)
+
+
+def NumOfPrimeFact(n):
+  count=0
+  j = 0
+  while(n!=1):
+    if(n%primeNum[j]==0):
+      count+=1
+      while(n%primeNum[j]==0):
+        n/=primeNum[j]
+    j+=1
+  return count
+
+k  = int(input("give the value of prime factors: "))
+
+i = 1
+flag = 0
+while(flag<k):
+  if(NumOfPrimeFact(i)==k):
+    flag+=1
+  else:
+    flag = 0
+  i+=1
+
+print("\n\n\t\t*****first number is =",i-k,"*****\n\n")

Project Euler/python/problem668.py

@@ -0,0 +1,72 @@
+import math
+import time
+start_time = time.time()
+
+n = int(input("Give the value of n : "))
+k = math.ceil(math.sqrt(n))
+
+#genrating prime numbers
+
+prime = [True for i in range(k+1)] 
+p = 2
+while (p * p <= k): 
+  if (prime[p] == True):
+    for i in range(p * 2, k+1, p): 
+      prime[i] = False
+  p += 1
+
+#storing numbers in a list
+primeNum = []
+
+for p in range(2, k): 
+  if prime[p]: 
+    primeNum.append(p)
+
+count = 0
+
+# test Code
+
+
+# for i in range(1,n+1):
+#   j = 0
+#   temp = i
+#   while(temp!=1):
+#     if(primeNum[j]>=math.sqrt(i)):
+#       break
+#     if(temp%primeNum[j]==0):
+#       temp//=primeNum[j]
+#     else:
+#       j+=1
+#       if(j==len(primeNum)):
+#         break
+#     if(temp==1):
+#       count+=1
+#       print(i) # printing value of smooth sqrt numbers
+
+#Adding 1 because of the number 1 is a smooth sqrt number 
+
+# print("\n\t**Value of smooth square root number below",n,"=",count+1,"**")
+
+
+#Optimised code
+x = 0
+for i in range(1,n+1):
+  if(primeNum[x]<math.sqrt(i)):
+    x+=1
+  j = x
+  while(j<k-1):
+    if(primeNum[j]<=i):
+      if(i%primeNum[j]==0):
+        count-=1
+        print("in")
+        break
+    else:
+      break
+    j+=1
+  count+=1
+  print("out")
+
+  
+print("\n\t**Value of smooth square root number below",n,"=",count,"**")
+
+print("--- %s seconds ---" % (time.time() - start_time))

Project Euler/python/problem686.py

@@ -0,0 +1,15 @@
+a = int(input())
+
+n = 2
+myvalue = 0
+i = 1
+while(True):
+  i+=1
+  n*=2
+  n = int(str(n)[:15])
+  if(str(n)[:3]=='123'):
+    myvalue+=1
+  if(myvalue==a):
+    break
+print(i)
+