Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit a9d4d98

Browse files
Added problems
1 parent 850002b commit a9d4d98

File tree

9 files changed

+230
-341
lines changed

9 files changed

+230
-341
lines changed

‎.gitignore‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -30,3 +30,5 @@
3030
*.exe
3131
*.out
3232
*.app
33+
34+
.vscode
Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
#include <bits/stdc++.h>
2+
3+
using namespace std;
4+
5+
typedef long long int lli;
6+
7+
void task()
8+
{
9+
10+
string a, b;
11+
cin >> a >> b;
12+
13+
int lenA = a.length();
14+
int lenB = b.length();
15+
16+
vector<vector<int>> dp(lenA + 1, vector<int>(lenB + 1, 0));
17+
18+
for (int i = 0; i <= lenA; i++)
19+
{
20+
21+
for (int j = 0; j <= lenB; j++)
22+
{
23+
24+
if (i == 0 || j == 0)
25+
{
26+
dp[i][j] = max(i, j);
27+
continue;
28+
}
29+
30+
if (a[i-1] == b[j-1])
31+
{
32+
dp[i][j] = dp[i - 1][j - 1];
33+
continue;
34+
}
35+
36+
dp[i][j] = min(dp[i - 1][j], min(dp[i - 1][j - 1], dp[i][j - 1])) + 1;
37+
}
38+
}
39+
40+
cout << dp[lenA][lenB] << '\n';
41+
}
42+
43+
int main()
44+
{
45+
46+
ios::sync_with_stdio(false);
47+
cin.tie(NULL);
48+
49+
task();
50+
51+
return 0;
52+
}

‎dynamic-programming/money-sums.cpp‎

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
#include <bits/stdc++.h>
2+
3+
using namespace std;
4+
5+
typedef long long int lli;
6+
typedef vector<lli> vi;
7+
typedef tuple<lli, lli> ii;
8+
typedef tuple<lli, lli, lli> iii;
9+
10+
void task()
11+
{
12+
13+
set<int> res;
14+
int lenNums;
15+
16+
cin >> lenNums;
17+
vector<int> nums(lenNums);
18+
19+
for (int i = 0; i < lenNums; i++)
20+
{
21+
cin >> nums[i];
22+
}
23+
24+
for (int i = 0; i < lenNums; i++)
25+
{
26+
int num = nums[i];
27+
28+
set<int> newNums;
29+
30+
for (auto it = res.begin(); it != res.end(); it++)
31+
{
32+
newNums.insert(*it + num);
33+
}
34+
35+
newNums.insert(num);
36+
37+
res.insert(newNums.begin(), newNums.end());
38+
}
39+
40+
cout << res.size() << '\n';
41+
for (auto it = res.begin(); it != res.end(); it++)
42+
{
43+
cout << *it << ' ';
44+
}
45+
cout << '\n';
46+
}
47+
48+
int main()
49+
{
50+
51+
ios::sync_with_stdio(0);
52+
cin.tie(0);
53+
54+
task();
55+
56+
return 0;
57+
}
Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
#include <bits/stdc++.h>
2+
3+
using namespace std;
4+
5+
int minimumCuts(int a, int b)
6+
{
7+
8+
vector<vector<int>> dp(a + 1, vector<int>(b + 1, 0));
9+
10+
for (int i = 1; i <= a; i++)
11+
{
12+
13+
for (int j = 1; j <= b; j++)
14+
{
15+
16+
if (i ^ j)
17+
{
18+
dp[i][j] = 1e9;
19+
}
20+
21+
for (int k = 1; k < i; k++)
22+
{
23+
24+
dp[i][j] = min(dp[i][j], dp[k][j] + dp[i - k][j] + 1);
25+
}
26+
27+
for (int k = 1; k < j; k++)
28+
{
29+
30+
dp[i][j] = min(dp[i][j], dp[i][k] + dp[i][j - k ] + 1);
31+
}
32+
}
33+
}
34+
35+
return dp[a][b];
36+
}
37+
38+
void task()
39+
{
40+
int a, b;
41+
cin >> a >> b;
42+
cout << minimumCuts(a, b) << '\n';
43+
}
44+
45+
int main()
46+
{
47+
48+
ios::sync_with_stdio(false);
49+
cin.tie(NULL);
50+
51+
task();
52+
53+
return 0;
54+
}

‎dynamic-programming/removal-game.cpp‎

Lines changed: 65 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,65 @@
1+
#include <bits/stdc++.h>
2+
3+
using namespace std;
4+
5+
typedef long long int lli;
6+
typedef vector<lli> vi;
7+
typedef tuple<lli, lli> ii;
8+
typedef tuple<lli, lli, lli> iii;
9+
10+
void task()
11+
{
12+
13+
lli n;
14+
cin >> n;
15+
vector<lli> nums(n, 0);
16+
17+
for (lli i = 0; i < n; i++)
18+
{
19+
cin >> nums[i];
20+
}
21+
22+
vector<vector<pair<lli, lli>>> dp(n, vector<pair<lli, lli>>(n, make_pair(0, 0)));
23+
24+
for (lli length = 1; length <= n; length++)
25+
{
26+
27+
for (lli i = 0; i <= n - length; i++)
28+
{
29+
30+
lli x = i;
31+
lli y = i + length - 1;
32+
33+
if (x == y)
34+
{
35+
dp[x][y] = make_pair(nums[x], 0);
36+
continue;
37+
}
38+
39+
if (dp[x][y - 1].second + nums[y] > dp[x + 1][y].second + nums[x])
40+
{
41+
42+
dp[x][y].first = dp[x][y - 1].second + nums[y];
43+
dp[x][y].second = dp[x][y - 1].first;
44+
}
45+
else
46+
{
47+
dp[x][y].first = dp[x + 1][y].second + nums[x];
48+
dp[x][y].second = dp[x + 1][y].first;
49+
}
50+
}
51+
}
52+
53+
cout << dp[0][n - 1].first << '\n';
54+
}
55+
56+
int main()
57+
{
58+
59+
ios::sync_with_stdio(0);
60+
cin.tie(0);
61+
62+
task();
63+
64+
return 0;
65+
}

‎experiments/multiset_test.cpp‎

Lines changed: 0 additions & 30 deletions
This file was deleted.

‎others/fenwick-tree.cpp‎

Lines changed: 0 additions & 49 deletions
This file was deleted.

‎others/word-break-ii.md‎

Lines changed: 0 additions & 45 deletions
This file was deleted.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /