-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLightOj-1033 - Generating Palindromes.cpp
More file actions
70 lines (56 loc) · 1.2 KB
/
LightOj-1033 - Generating Palindromes.cpp
File metadata and controls
70 lines (56 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
UserId: imranRNKENT
Problem: Generating Palindromes
Language: C++
Catagory: DP
*/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define maxn 100010
#define ints size_t
#define pbk push_back
#define intl long long
#define mod 1000000007
#define pi 2 * acos(0.0)
#define sf(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define sl(n) scanf("%lld", &n)
#define sc(c) scanf(" %c", &c)
#define ss(str) scanf("%s", str)
#define pc(c) printf("%c\n", c)
#define pf(n) printf("%d\n", n)
#define pd(n) printf("%lf\n", n)
#define pl(n) printf("%lld\n", n)
#define ps(str) printf("%s\n", str)
#define ms(n, m) memset(n, m, sizeof(n))
char str[200];
int dp[105][105];
int solve(int i, int j)
{
if(i >= j)
return 0;
if(dp[i][j] != -1)
return dp[i][j];
if(str[i] == str[j])
dp[i][j] = solve(i + 1, j - 1);
else
dp[i][j] = 1 + min(solve(i + 1, j), solve(i, j - 1));
return dp[i][j];
}
int main()
{
int test, cs = 1;
sf(test);
while(test--)
{
ms(dp, -1);
ss(str);
printf("Case %d: %d\n", cs++, solve(0, strlen(str) - 1));
}
/*cin.clear();
cin.ignore();
cin.get();*/
return 0;
}