int a,b,c;
cin >> a;
cin >> b;
cin >> c;
if ( (a + b + c ) % 3 >= 8 ) cout << " GIOI ";
if ( ( a + b + c ) % 3 >= 6.5 && ( a + b + c ) % 3 < 8 ) cout << " KHA BANH";
if ( ( a + b + c ) % 3 >= 5 && ( a + b + c ) % 3 < 6.5 ) cout << " TRUNG BINH ";
if ( ( a + b + c ) % 3 < 5 ) cout << " YEU ";

def DocTep():
fi=open("DaySo.inp",'r')
n=int(fi.readline())
a =str(fi.readline())
fi.close()
return n,a
def XuLi(n,a):
if not a:
return 0
l = [1] * n
for i in range (1 , n):
for j in range(i):
if a[i] > a[j] and l[i]< l[j] + 1 :
l[i] = l[j]+1
maximum = max(l)
return maximum
def GhiTep(m):
fo=open("DaySo.out",'w')
print(m,file=fo)
fo.close()
n,a=DocTep()
m=XuLi(n,a)
GhiTep(m)

hi

include <bits/stdc++.h>

using namespace std;
int n, L, R, M;
string s;
int P[10004];
int tim(int k)
{
int dem, d, c;
if(k%2==0) dem = 0;
else dem = 1;
d = k/2-1;
c = k-1-d;
while(d>=0 && c<n) { if(s[d]==s[c]) dem = dem + 1; else break; d = d-1; c = c+1; } L = d++; R = c--; M = k; return dem; } int main() { //freopen("maxpalin.inp","r",stdin); //freopen("maxpalin.out","w",stdout); cin >> n >> s;
int m = 2n;
fill(P,P+10004,0);
P[1] = 1;
P[m-1] = 1;
L=1; R=0;
for(int i=2; i<=m-2; i++)
{
if(i>=R) P[i] = tim(i);
else
{
int dx = M - (i-M);
if(P[dx]<M-L) P[i]=P[dx];
else P[i] = tim(i);
}
}
int maxx = 1, vt = 1;
for(int i=1; i<=m-1; i++)
if(maxx<P[i]) { maxx=P[i]; vt = i;}
if (vt%2==1)
cout << 2maxx-1;
else cout << 2*maxx;

return 0;

}

ffdfdsfsdfsdf

1

mine altcoins