Найти все симметричные натуральные числа (палиндромы) из промежутка от А до В (А...

July 2022 1 14 Report

Найти все симметричные натуральные числа (палиндромы) из промежутка от А до В (А и В вводятся с клавиатуры) Решать через массив.

Answers & Comments

morgan2014 // #includes {{{
#include <stdio.h>#include <iostream>#include <cmath>#include <algorithm>#include <fstream>#include <vector>#include <complex>#include <queue>#include <set>#include <map>#include <cstdlib>#include <cstdio>#include <cstring>#include <cassert>#include <ctime>#include <cmath>#include <string>#include <deque>#include <list>#include <math.h>#include <fstream>#include <stack>#include <iomanip>#include <bitset>#include <memory.h>#include <bitset>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <ctime>#include <assert.h>#include <stdarg.h>#include <time.h>#include <limits.h>#include <ctype.h>#include <complex>#include <bits/stdc++.h>// }}} // #defines {{{#define exp 1e-10#define sc scanf#define pr printf#define mk make_pair#define pb push_back#define pf push_front#define ll long long#define fi first#define se second#define eps 0.000000001#define INF 1000000007#define file "management"#define eps 0.000000001#define cmd 1000000009#define PI 3.14159265#define MOD 1000000007#define sz(x) ((int)(x).size())#define in(s) freopen(s, "r", stdin);#define pi 3.1415926535897#define rep(i, n) for(__typeof(n) i = 0; i < (n); i++)#define out(s) freopen(s, "w", stdout);#define sync ios_base::sync_with_stdio( 0 )// }}} using namespace std; typedef long long lglg;const int inf = 1<<30, maxN = 1000;int ax[] = {0, 1, -1, 0, 0};int ay[] = {0, 0, 0, -1, 1}; int main(){ string a; int n, dp[102][102], i, j, px[102][102], py[102][102]; cin >> a; memset(dp, 0, sizeof(dp)); memset(px, -1, sizeof(px)); a = "." + a; n = a.size() - 1; for (i = 1; i <= n; i++) dp[i][i] = 1; for (i = n; i >= 1; i--) for (j = i + 1; j <= n; j++) { if (a[i] == a[j] && dp[i][j] < 2 + dp[i + 1][j - 1]) { dp[i][j] = 2 + dp[i + 1][j - 1]; px[i][j] = i + 1; py[i][j] = j - 1; } if (dp[i][j] < dp[i + 1][j]) { dp[i][j] = dp[i + 1][j]; px[i][j] = i + 1; py[i][j] = j; } if (dp[i][j] < dp[i][j - 1]) { dp[i][j] = dp[i][j - 1]; px[i][j] = i; py[i][j] = j - 1; } } cout << dp[1][n] <<'\n'; int x = 1, y = n, q, w; vector<char> ans; char z = 0; while (px[x][y] != -1) { if (px[x][y] == x + 1 && py[x][y] == y - 1) ans.push_back(a[x]); q = px[x][y]; w = py[x][y]; x = q; y = w; } if (x == y) z = a[x]; for (i = 0; i< ans.size(); i++) cout << ans[i]; if (z != 0) cout<< z; for (i = ans.size() - 1; i >= 0; i--) cout<< ans[i]; return 0; }

0 votes Thanks 0

dve mashiny odnovremenno vyshli iz punktov a i b pri etom do punkta s pervaya mashidde1288c028a4717f11acaaaa7b3f257 23551

Answer

Lena1867 August 2022 | 0 Ответы

Answers & Comments

dve mashiny odnovremenno vyshli iz punktov a i b pri etom do punkta s pervaya mashidde1288c028a4717f11acaaaa7b3f257 23551

v treugolnike dve storony ravny 12sm i 8sm a ugol mezhdu nimi 60 najdite plo

dopolnite tekst neobhodimymi slovami

tex]...

ch i k otpravleniyu avtobusa uspeli rasstoyanie ot derevni do stancii ravno 6 km

tex]...

soznymi slovami nuzhno sostavit predlozhenie

dopolnite predlozheniya pridatochnymi i opredelite ih vid 1v gorodeshiroko raz

vstavte propushennye slova084724d026dd686f2cb044fc5c7486b1 82957

ispravit oshibki dopushennye v upotreblenii chislitelnyh

рекомендуемые вопросы

Helpful Links

Helpful Social