Python basic problems solved

Author: myhyper

cpp/a.out

@@ -0,0 +1,37 @@
+#include <iostream>
+#include <vector>
+#include <stdio.h>
+using namespace std;
+ 
+int main()
+{
+    // Create a vector containing integers
+    vector<int> v = {7, 5, 16, 8};
+ 
+    // Add two more integers to vector
+    v.push_back(25);
+    v.push_back(13);
+ 
+    // Iterate and print values of vector
+    for(int n : v) {
+        // cout << n << '\n';
+    }
+
+	vector<pair<int, int>> obj(2);
+    for(pair<int, int> n : obj) {
+        cout << n.first << '\n';
+        cout << n.second << '\n';
+    }
+
+    int m = 2;
+    int k = 3;
+    cout << '\n';
+    vector<vector<int>> vv(m + 1, vector<int>(k + 1));
+    cout << vv.size() << '\n';
+
+    cout << '\n';
+    for(vector<int> a : vv) {
+        cout << a.size() << '\n';
+    }
+
+}

cpp/test.cpp

@@ -0,0 +1,22 @@
+import sys
+f = sys.stdin.readline
+N = int(f())
+st = ''
+for n in range(2,N):
+  def foo(num):
+    if num > 1:
+      for i in range(2, num//2):
+        if (num % i) == 0:
+          #print(num, "is not a prime number")
+          return 0
+        else:
+          #print(num, "is a prime number")
+    else:
+      #print(num, "is not a prime number")
+      return 0
+    return 1
+  if foo(n):
+    if st != '':
+      st += ','
+    st += "%d" % (n)
+print(st)

python/10172/1978.py

@@ -0,0 +1,11 @@
+import sys
+M=0xf4240;e=[1 for i in range(M)]
+for i in range(2,M):
+  for j in range(i,M,i):
+    if j==i:continue
+    else:e[j]=0
+e[1]=0;f=sys.stdin.readline
+while 1:
+  n=int(f())
+  if n:print(sum(e[n+1:2*n+1]))
+  else:break

python/10172/2581.py

@@ -0,0 +1 @@
+a,b=int(input()),int(input());o=[_ for _ in range(a,b+1) if len([d for d in range(1,_+1) if _%d==0])==2];print(f'{sum(o)}\n{o[0]}' if o else -1)

python/10172/2581_.py

@@ -0,0 +1,16 @@
+ps = [0] + [1] * 246911
+for _ in range(2, 497):
+  i = _ - 1
+  if ps[i]:
+    for j in range(i + _, 246912, _):
+      ps[j] = 0
+T=int(input())
+for t in range(T):
+  n=int(input())
+  z=x=y=n
+  for i in range(n):
+    for j in range(n):
+      if n < i+j: break
+      if ps[i+1] and ps[j+1] and i+j==n:
+        if abs(i-j) < z: z=abs(i-j);x=i;y=j
+  print(x,y)

python/10172/9020.py

@@ -0,0 +1,41 @@
+import sys
+f = sys.stdin.readline
+T = int(f())
+ans=[0 for _ in range(50)]
+for _ in range(T):
+  arr = list(map(int,f().split()))
+  x,y = arr[0],arr[1]
+  tar = y-x
+  for tar in range(1,200):
+    dp=[]
+    for i in range(tar):
+      def foo():
+        for j in range(len(dp)-2,0,-1):
+          if dp[j-1] == dp[j] == dp[j+1]:
+            dp[j] += 1
+            return 1
+          if dp[j-1]-1 == dp[j] == dp[j+1]:
+            dp[j] += 1
+            return 1
+        return 0
+      if not foo():
+        dp.append(1)
+      #print(dp,sum(dp))
+    ans[len(dp)] += 1
+    #print(tar,len(dp))
+print(ans)
+
+#  1 1  1
+#  2 2  1 1
+#  3 3  1 1 1
+#  4 3  1 2 1
+#  5 4  1 2 1 1
+#  6 4  1 2 2 1
+#  7 5  1 2 2 1 1
+#  8 5  1 2 2 2 1
+#  9 5  1 2 3 2 1
+# 10 6  1 2 3 2 1 1
+# 11 6  1 2 3 2 2 1
+# 12 6  1 2 3 3 2 1
+# 13 7  1 2 3 3 2 1 1
+

python/10172/a.out

@@ -0,0 +1,19 @@
+import sys
+f = sys.stdin.readline
+T = int(f())
+for t in range(T):
+  x,y=map(int,f().split())
+  tar = y-x
+  s=0
+  spd=1
+  m=1
+  n=0
+  while s < tar:
+    s+= spd
+    print('spd',spd)
+    if not s < tar: break
+    s+= spd
+    print('spd',spd)
+    spd+=1
+
+  print(spd)

python/10172/first.py

@@ -0,0 +1,11 @@
+#include <stdio.h>
+
+int main()
+{
+    int a,b;
+    scanf("%d%d", &a, &b);
+
+    printf("%.0f\n", 1.0*a/b);
+
+    return 0;
+}

python/10172/second.py

@@ -0,0 +1,29 @@
+#include <stdio.h>
+
+int main(void)
+{
+  int num = 0;
+  int a[1000];
+  int count = 0;
+
+  scanf("%d", &num);
+  for (int i = 0; i < num; i++)
+  {
+    scanf("%d", &a[i]);
+    for (int j = 2; j <= a[i]; j++)
+    {
+      if (a[i] % j == 0)
+      {
+        if (a[i] == j)
+          count++;
+        else
+        {
+          break;
+        }
+      }
+    }
+  }
+  printf("%d", count);
+
+  return 0;
+}

python/10172/test.cpp

@@ -0,0 +1,17 @@
+import sys
+import math
+T = int(sys.stdin.readline())
+for t in range(T):
+  x, y = [int(k) for k in sys.stdin.readline().split()]
+  d = y - x
+  if d < 3:
+    print(d)
+  else:
+    p = int(math.sqrt(d))
+    if d > p*(p + 1):
+      p += 1
+    if d > p*p:
+      p *= 2
+    else:
+      p = p * 2 - 1
+    print(p)

python/10172/test2.cpp

@@ -0,0 +1,25 @@
+import sys
+f = sys.stdin.readline
+dbg = 1
+if dbg: f = open('24.txt').readline
+N,K = map(int, f().split())
+W = [0];V = [0];M=0
+for _ in range(N):
+  w, v = map(int, f().split())
+  if w <= K:
+    W.append(w);V.append(v)
+    M += 1
+arr = [[''] * (K+1) for _ in range(M+1)]
+def visit(i, j):
+  if arr[i][j] != '': return arr[i][j]
+  if i == 0 or j == 0: rtv = 0
+  elif j < W[i]: rtv = visit(i-1, j)
+  else:
+    a = visit(i-1, j)
+    b = V[i] + visit(i-1, j-W[i])
+    rtv = max(a, b)
+  arr[i][j] = rtv
+  return rtv
+print(visit(M, K))
+if dbg:
+  for a in arr: print(a)

python/10172/third.py

@@ -0,0 +1,18 @@
+import sys
+f = sys.stdin.readline
+dbg = 1
+if dbg: f = open('24.txt').readline
+N,K = map(int, f().split())
+W = [];V = []
+for n in range(N):
+  w,v = map(int, f().split())
+  if w <= K: W.append(w);V.append(v)
+  else: N -= 1
+dp = [ [ 0 for _ in range(N+1) ] for _ in range(K+1) ]
+for i in range(N-1,-1,-1):
+  for j in range(K+1):
+    dp[j][i] = max(dp[j][i], dp[j][i+1])
+    if W[i] <= j:
+      dp[j][i] = max(dp[j][i], V[i] + dp[j-W[i]][i+1])
+# for d in dp: print(d)
+print(max(dp[K]))

python/12865/fifth.py

@@ -0,0 +1,4 @@
+3 5
+4 10
+2 4
+3 7

python/12865/fourth.py

@@ -0,0 +1,56 @@
+# 해당문제 강의 https://www.youtube.com/watch?v=xOlhR_2QCXY
+# DP 강의 1 http://bopace.github.io/python/2016/04/27/python-and-dp/
+# DP 강의 2 https://skerritt.blog/dynamic-programming/
+
+
+# recursive solution
+
+# def KS(n, c):
+#     if n == 0 or c == 0:
+#         result = 0
+#     elif w[n] > c:
+#         result = KS(n-1, c)
+#     else:
+#         temp1 = KS(n-1, c)
+#         temp2 = v[n] + KS(n-1, c-w[n])
+#         result = max(temp1, temp2)
+#     return result
+#
+#
+# N, C = map(int, input().split())
+# w = [0]
+# v = [0]
+# for _ in range(N):
+#     a, b = map(int, input().split())
+#     w.append(a)
+#     v.append(b)
+# print(w)
+# print(v)
+# print(KS(N, C))
+
+# memorize intermediate results
+
+def KS(n, c):
+    if arr[n][c] != 'undefined': return arr[n][c]
+    if n == 0 or c == 0:
+        result = 0
+    elif w[n] > c:
+        result = KS(n-1, c)
+    else:
+        temp1 = KS(n-1, c)
+        temp2 = v[n] + KS(n-1, c-w[n])
+        result = max(temp1, temp2)
+    arr[n][c] = result
+    return result
+
+
+N, C = map(int, input().split())
+w = [0]
+v = [0]
+arr = [['undefined'] * (C+1) for _ in range(N+1)]
+
+for _ in range(N):
+    a, b = map(int, input().split())
+    w.append(a)
+    v.append(b)
+print(KS(N, C))

python/12865/j.txt

@@ -2,7 +2,7 @@
 dbg = 1
 prt = 0
 f = sys.stdin.readline
-if dbg: f = open('0.txt').readline
+if dbg: f = open('14.txt').readline
 N,K = map(int,f().split())
 
 W = [ 0 for _ in range(N) ]
@@ -12,7 +12,7 @@
 
 M = K + 10
 # if dbg: M = 11
-dp1 = [ 0 for _ in range(M) ]
+dp1 = [ 0 for _ in range(M) ] # 배운점 : 여기 초기화를 -1로 했었다가. 물건이 한개도 안넣어지는 경우 0이 나와야 하는데 -1이 나와서 WA가 떳다.
 dp2 = [ 0 for _ in range(M) ]
 
 if W[0] <= K:
@@ -30,7 +30,7 @@ def foo ():
     if w <= K: now[w] = max(prev[w], v)
     for j in range(0, K):
       now[j] = max(prev[j], now[j])
-      if j + w <= K and 0 != prev[j]:
+      if j + w <= K and 0 != prev[j]: # 배운점 : 앞노드가 존재 할때만(무게가0이 아닐때만 조건이 필요했다.)
         now[j+w] = max(now[j+w], prev[j] + v)
     if prt: print(prev);print(now)
 foo();print(max(max(dp1),max(dp2)))

python/12865/ks.py

@@ -0,0 +1,8 @@
+7 19
+9 89 1
+8 80 1
+1 32 1
+6 68 1
+2 74 1
+3 42 1
+7 2 1

python/12865/third.py

@@ -0,0 +1,3 @@
+2 3
+2 7 1
+1 9 3

python/12920/264.txt

@@ -0,0 +1,10 @@
+9 9
+2 9 1
+1 7 1
+3 10 1
+2 2 1
+3 3 1
+4 9 1
+2 10 1
+2 8 1
+3 2 1