begin readln(a, b); for i := a to b do begin l := i.ToString(); l2 := ''; for j := 1 to length(l) do l2 := l[j] + l2; if (l = l2) then writeln(l); end; end.
#include <iostream> #include <vector> #include <algorithm> using namespace std;
int main() { long long n, m, i, j, k; cin >> n >> m; vector < long long > plot, mesk;
for (i = 0; i < n; i++) for (j = 0; j < m; j++) { long long x; cin >> x; plot.push_back(x); } cin >> k; for (i = 0; i < k; i++) { long long x; cin >> x; mesk.push_back(x); } sort(plot.begin(), plot.end()); sort(mesk.begin(), mesk.end());
k = 0; i = plot.size() - 1; j = mesk.size() - 1; while (i * j > 0) { if (plot[i] >= mesk[j]) { k++; i--; j--; } else j--; } cout << k << endl; }
a, b, i, j: integer;
l, l2: string;
begin
readln(a, b);
for i := a to b do
begin
l := i.ToString();
l2 := '';
for j := 1 to length(l) do
l2 := l[j] + l2;
if (l = l2) then writeln(l);
end;
end.