abc108

Author: proton

abc108/a.py

@@ -0,0 +1,10 @@
+ri = lambda: int(input())
+rl = lambda: list(map(int,input().split()))
+rr = lambda N: [ri() for _ in range(N)]
+YN = lambda b: print('YES') if b else print('NO')
+yn = lambda b: print('Yes') if b else print('No')
+OE = lambda x: print('Odd') if x%2 else print('Even')
+INF = 10**18
+
+K=ri()
+print(K//2 * (K-K//2))

abc108/b.py

@@ -0,0 +1,17 @@
+ri = lambda: int(input())
+rl = lambda: list(map(int,input().split()))
+rr = lambda N: [ri() for _ in range(N)]
+YN = lambda b: print('YES') if b else print('NO')
+yn = lambda b: print('Yes') if b else print('No')
+OE = lambda x: print('Odd') if x%2 else print('Even')
+INF = 10**18
+
+a,b,c,d=rl()
+v2_1 = [a-c,b-d]
+v2_3 = [v2_1[1],-v2_1[0]]
+x3 = c+v2_3[0]
+y3 = d+v2_3[1]
+x4 = x3+v2_1[0]
+y4 = y3+v2_1[1]
+
+print(x3,y3,x4,y4)

abc108/c.py

@@ -0,0 +1,15 @@
+ri = lambda: int(input())
+rl = lambda: list(map(int,input().split()))
+rr = lambda N: [ri() for _ in range(N)]
+YN = lambda b: print('YES') if b else print('NO')
+yn = lambda b: print('Yes') if b else print('No')
+OE = lambda x: print('Odd') if x%2 else print('Even')
+INF = 10**18
+
+N,K=rl()
+ans = 0
+ans += (N//K)**3
+if K%2==0:
+    ans += ((N+K//2)//K)**3
+
+print(ans)

abc108/d.py

@@ -0,0 +1,43 @@
+ri = lambda: int(input())
+rl = lambda: list(map(int,input().split()))
+rr = lambda N: [ri() for _ in range(N)]
+YN = lambda b: print('YES') if b else print('NO')
+yn = lambda b: print('Yes') if b else print('No')
+OE = lambda x: print('Odd') if x%2 else print('Even')
+INF = 10**18
+
+#L=ri()
+N_max = 20
+M_max = 60
+
+#2^n+3^m+... ([2,n],[3,m],...) List[Tuple[int, int]]
+def factorize(n):
+    fct = []  # prime factor
+    b, e = 2, 0  # base, exponent
+    while b * b <= n:
+        while n % b == 0:
+            n = n // b
+            e = e + 1
+        if e > 0:
+            fct.append((b, e))
+        b, e = b + 1, 0
+    if n > 1:
+        fct.append((n, 1))
+    return fct 
+for L in range(2,101):
+    if L<=M_max:
+        1
+        #print(2,L)
+        #for i in range(L):
+            #print(1,2,i)
+    else:
+        fct = factorize(L)
+        N = sum(map(lambda x:x[1],fct))
+        M = sum(map(lambda x: x[0]*x[1],fct))
+        if N<=N_max and M<=M_max:
+            1
+            #print(N,M)
+        else:
+            
+            print(L, end=' ')
+    

temp/factorize.py

@@ -1,4 +1,4 @@
-#素因数分解 List[int] 型
+#2^2+3^1+... [2,2,3,...] List[int]
 def factorize(n):
     b = 2
     fct = []
@@ -12,7 +12,7 @@ def factorize(n):
     return fct
 
 
-#素因数分解 List[Tuple[int, int]]型
+#2^n+3^m+... ([2,n],[3,m],...) List[Tuple[int, int]]
 def factorize(n):
     fct = []  # prime factor
     b, e = 2, 0  # base, exponent

temp/gcd_lcm.py

@@ -1,21 +1,21 @@
-#最大公約数
+#Å‘åŒö–ñ” O(log(max(a,b)))
 def gcd(a, b):
     while b > 0:
         a, b = b, a%b
     return a
 
-#最大公約数_list
+#Å‘åŒö–ñ”_list O(Nlog(max(L)))
 def gcd_list(L):
     v = L[0]
     for i in range(1, len(L)):
         v = gcd(v, L[i])
     return v
 
-#最小公約数
+#Å¬Œö–ñ”
 def lcm(a,b):
     return a*b//gcd(a,b)
 
-#最小公約数_list
+#Å¬Œö–ñ”_list
 def lcm_list(L):
     v = L[0]
     for i in range(1,len(L)):