Авторські розв'язки задач 1 туру

******************** Задача t1z1 ********************

VAR i, count:longint;
    s:string;
function check (st:string):boolean;
var t, j:longint;
    flag:boolean;
begin
     if st='' then begin check:=false; exit; end;
     t:=length(st);
     flag:=true;
     j:=1;
     while flag and (j<=t div 2) do
     begin
         if st[j]<>st[t-j+1] then flag:=false;
         inc(j);
     end;
     check:=flag;
end;
begin
     count:=0;
     while not eof do
     begin
          readln (s);
          if check (s) then inc(count);
     end;
     writeln (count);
end.

******************** Задача t1z2 ********************

VAR n, i:longint;
    s, st:string;
function check (sts:string):boolean;
var t, j:longint;
    flag:boolean;
begin
     t:=length(sts);
     flag:=true;
     j:=1;
     while flag and (j<=t div 2) do
     begin
         if sts[j]<>sts[t-j+1] then flag:=false;
         inc(j);
     end;
     check:=flag;
end;
procedure dectobin(p:longint; var si:string);
var ost:integer;
begin
      si:='';
      while p>1 do
      begin
           ost:=p mod 2;
           str(ost, st);
           si:=st+si;
           p:=p div 2;
      end;
      si:='1'+si;
end;
begin
     readln (n);
     if n mod 2 =0 then i:=n+1
		   else i:=n;
     while i<=2*n-1 do
         begin
              dectobin (i,s);
              if check (s) then writeln (s);
              inc (i, 2);
         end;
end.

******************** Задача t1z3 ********************

#include <iostream>
#include <fstream>

using namespace std;

int main()
{
	ifstream fin("palindrome1.dat");
	ofstream fout("palindrome1.sol");

	char s[50];
	fin >> s;
	
	int len = strlen(s),i,j,k;
	
	long kol[30][30];

	
	for (i=0; i<len; i++) {
		kol[i][0] = 0;
		kol[i][1] = 1;
	}

	for (k=2; k<=len; k++) {
		for (i=0; i<=len-k; i++) {
			
			kol[i][k] = kol[i][k-1]+1;
		
			char c = s[i+k-1];

						
			for (j=i; j<i+k-2; j++) {
				if (s[j] == c) {
					kol[i][k] += (kol[j+1][i+k-j-2] + 1);
				}
			}
			if (s[i+k-2] == s[i+k-1]) {
				kol[i][k]++;
			}
		}
	}
	

	fout << kol[0][len] << '\n';


	return 0;
}

******************** Задача t1z4 ********************

#include <iostream>
#include <fstream>
#define N 2000
using namespace std;


int main()
{
	ifstream fin("Palindrome2.dat");
	ofstream fout("Palindrome2.sol");

	char s[N];

	bool* Pal[N];
	for (int r=0; r<N; r++) {
		Pal[r] = new bool[N];
	}


	int res[N];
	fin >> s;
	
	int len = strlen(s),i,j;

	for (i=0; i<len; i++) {
		Pal[i][i] = true;
	}

	for (i=0; i<len-1; i++) {
		if (s[i] == s[i+1]) {
			Pal[i][i+1] = true; 
		}
	}

	for (j=2; j<=len; j++) {
		for (i=0; i<=len-j; i++) {
			if ((s[i] == s[i+j-1]) && (Pal[i+1][i+j-2])) {
				Pal[i][i+j-1] = true;
			} else {
				Pal[i][i+j-1] = false;
			}
		}
	}

	res[0] = 1;
	for (int i=1; i<len; i++) {
		if (Pal[0][i]) {
			res[i] = 1;
		} else {
			res[i] = i+1;
			for (int j=0; j<i; j++) {
				if (Pal[j+1][i] && (res[j] + 1 < res[i])) {
					res[i] = res[j] + 1;
				}
			}
		}
	}
	fout << res[len-1];
	fout.close();

	return 0;
}