code

Author: KB-perByte

Gen2_0_PP/Homeworks/codeforces_1034A.cpp

@@ -0,0 +1,48 @@
+#include <stdio.h>
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+ 
+const int INF = 0x3f3f3f3f;
+const int MAXN = 1.5e7 + 10;
+int pri[MAXN], a[MAXN];
+ 
+int gcd(int a, int b)
+{
+	if (!b)
+		return a;
+	return gcd(b, a % b);
+}
+int main()
+{
+#ifdef LOCAL
+	freopen("C:/input.txt", "r", stdin);
+#endif
+	int n, g = 0;
+	cin >> n;
+	for (int i = 0; i < n; i++)
+	{
+		int t;
+		scanf("%d", &t);
+		a[t]++;
+		if (!g)
+			g = t;
+		else
+			g = gcd(g, t);
+	}
+	int ans = n;
+	for (int i = g + 1; i < MAXN; i++) 
+		if (!pri[i])
+		{
+			int cnt = 0, j;
+			for (j = i; j < MAXN; j += i)
+				pri[j] = 1, cnt += a[j];
+			ans = min(ans, n - cnt);
+		}
+	if (ans < n)
+		cout << ans << endl;
+	else
+		cout << -1 << endl;
+ 
+	return 0;
+}

Gen2_0_PP/Homeworks/codeforces_55B.py

@@ -1,3 +1,48 @@
-num = [1,1,1,1]
-op = ['-','+','+']
-#TODO
+
+ans = float('inf')
+
+op = {'+': lambda x, y: x + y,
+      '-': lambda x, y: x - y,
+      '/': lambda x, y: x / y,
+      '*': lambda x, y: x * y}
+
+def rec_3(a, b):
+    global ans
+    temp=0
+    temp = op[st[2]](a,b) if( st[2]=='+') else op['*'](a,b)
+    ans=min(ans,temp)
+
+def rec_2(a, b, c):
+
+    if( st[1]=='+'):
+        rec_3(a+b,c)
+        rec_3(a+c,b)
+        rec_3(b+c,a)
+    
+    else:    
+        rec_3(a*b,c)
+        rec_3(a*c,b)
+        rec_3(b*c,a)
+    
+def rec_1( a, b, c, d):
+    if( st[0]=='+'):
+        rec_2(a+b,c,d)
+        rec_2(a+c,b,d)
+        rec_2(a+d,b,c)
+        rec_2(b+c,a,d)
+        rec_2(b+d,a,c)
+        rec_2(c+d,a,b)
+    
+    else:
+        rec_2(a*b,c,d)
+        rec_2(a*c,b,d)
+        rec_2(a*d,b,c)
+        rec_2(b*c,a,d)
+        rec_2(b*d,a,c)
+        rec_2(c*d,a,b)
+
+
+nom = list(map(int,input().split()))
+st = list(map(str,input().split()))
+rec_1(nom[0],nom[1],nom[2],nom[3])
+print(ans)

Gen2_0_PP/Homeworks/codeforces_55Brec.cpp

@@ -0,0 +1,62 @@
+#include<stdio.h>
+#include<iostream>
+#include<algorithm>
+#include<math.h>
+#include<string.h>
+#define LL long long
+using namespace std;
+long long int ans=1LL<<60;
+char str[4];
+void DFS_3(long long int a,long long int b)
+{
+    long long int temp=0;
+    if(str[2]=='+')
+        temp=a+b;
+    else
+        temp=a*b;
+    ans=min(ans,temp);
+}
+void DFS_2(long long int a,long long int b,long long int c)
+{
+    if(str[1]=='+')
+    {
+        DFS_3(a+b,c);
+        DFS_3(a+c,b);
+        DFS_3(b+c,a);
+    }
+    else
+    {
+        DFS_3(a*b,c);
+        DFS_3(a*c,b);
+        DFS_3(b*c,a);
+    }
+}
+void DFS_1(long long int a,long long int b,long long int c,long long int d)
+{
+    if(str[0]=='+')
+    {
+        DFS_2(a+b,c,d);
+        DFS_2(a+c,b,d);
+        DFS_2(a+d,b,c);
+        DFS_2(b+c,a,d);
+        DFS_2(b+d,a,c);
+        DFS_2(c+d,a,b);
+    }
+    else
+    {
+        DFS_2(a*b,c,d);
+        DFS_2(a*c,b,d);
+        DFS_2(a*d,b,c);
+        DFS_2(b*c,a,d);
+        DFS_2(b*d,a,c);
+        DFS_2(c*d,a,b);
+    }
+}
+int main()
+{
+    long long int a,b,c,d;
+    cin>>a>>b>>c>>d;
+    cin>>str[0]>>str[1]>>str[2];
+    DFS_1(a,b,c,d);
+    cout<<ans<<endl;
+}

Gen2_0_PP/Homeworks/codeforces_55Brec2.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+#include<cstdio>
+#include<cstdlib>
+#include<cstring>
+#include<algorithm>
+#include<list>
+#include<queue>
+#include<cmath>
+#include<vector>
+using namespace std;
+char oper[5];
+long long num[5],ans=1000000000000000ll;
+long long calu(long long a,long long b,char o){
+	if(o=='+')return a+b;
+	if(o=='*')return a*b;
+}
+int main()
+{
+	scanf("%lld%lld%lld%lld",&num[0],&num[1],&num[2],&num[3]);
+	getchar();
+	scanf("%c %c %c",&oper[0],&oper[1],&oper[2]);
+	int id[5];id[0]=0;id[1]=1;id[2]=2;id[3]=3;
+	do
+	{
+		long long a=calu(num[id[0]],num[id[1]],oper[0]);
+		long long b=calu(a,num[id[2]],oper[1]);
+		long long temp=calu(b,num[id[3]],oper[2]);
+		a=calu(num[id[0]],num[id[1]],oper[0]);
+		b=calu(num[id[2]],num[id[3]],oper[1]);
+		long long temp1=calu(a,b,oper[2]);
+		ans=min(ans,min(temp,temp1));
+	}while(next_permutation(id,id+4));
+	printf("%lld\n",ans);
+	return 0;
+}

Leetcode_30daysJune/day8_coinChange2.py

@@ -0,0 +1,9 @@
+class Solution:
+    def change(self, amount: int, coins: List[int]) -> int:
+        dp = [1] + [0] * amount
+        
+        for coin in coins:
+            for i in range(coin, amount+1):
+                dp[i] += dp[i-coin]
+                
+        return dp[-1]

local/rec1.py

@@ -0,0 +1,31 @@
+def recList(li, i):
+    if i < len(li)-1:
+        li[i], li[i+1] = li[i+1], li[i]
+        recList(li, i+2)
+    return li
+
+#print(recList([1,2,3,4,5,6,7],0))
+
+mt2d = [[0,0,1,0,0,0],
+        [0,0,0,0,0,0],
+        [0,0,0,0,0,0],
+        [0,0,0,0,0,1],
+        [0,0,1,0,0,1],
+        [0,0,1,0,0,1]]
+
+#TODO
+def rec2d(x, i, j):
+    
+    if x[i][j] == 1 or i == len(mt2d)-1 or j == len(mt2d)-1:
+        print('done')
+        return
+    print(x[i][j], i, j , end = ' -> ')
+    rec2d(x, i, j+1)
+    rec2d(x, i+1, j)
+
+#rec2d(mt2d, 0, 0)
+
+
+
+    
+