bn o dau minh moi biet de lam

uses crt;

var st:string;

d,i,t,x,y,a,b:integer;

begin

clrscr;

readln(st);

d:=length(st);

for i:=1 to d do write(st[i]:4);

writeln;

t:=0;

for i:=1 to d do

begin

val(st[i],x,y);

t:=t+x;

end;

writeln(t);

val(st[d],a,b);

if (a mod 2=0) then write(1)

else write(-1);

readln;

end.

#include <bits/stdc++.h>

using namespace std;

long long a[1000],i,n,t,dem,t1;

int main()

{

cin>>n;

for (i=1; i<=n; i++) cin>>a[i];

t=0;

for (i=1; i<=n; i++) if (a[i]%2==0) t+=a[i];

cout<<t<<endl;

t1=0;

dem1=0;

for (i=1; i<=n; i++)

if (a[i]<0)

{

cout<<a[i]<<" ";

t1+=a[i];

dem1++;

}

cout<<endl;

cout<<fixed<<setprecision(1)<<(t1*1.0)/(dem1*1.0);

return 0;

}

#include <bits/stdc++.h>
using namespace std;
long long a,b;
//chuongtrinhcon
long long gcd(long long a,long long b)
{
    if (b==0) return(a);
    return gcd(b,a%b);
}
//chuongtrinhchinh
int main()
{
    cin>>a>>b;

cout<<max(a,b)<<endl;

cout<<gcd(a,b)<<endl;
    if ((a>0 && b>0) or (a<0 && b<0)) cout<<a/gcd(a,b)<<" "<<b/gcd(a,b);
    else cout<<"-"<<-a/gcd(-a,b)<<" "<<b/gcd(-a,b);
    return 0;
}

\(x.(x^2-2x+1)=x(x-1)^2\)

A d c b c

26. A

27. D

28. C

29. B

30. C