uses crt;
var n,i,s:longint;
begin
readln(n);
if n mod 2 =0 then writeln(n,' la so chan') else writeln(n,' la so le');
begin
for i:= 1 to trunc(sqrt(n)) do
if n mod i=0 then
writeln(n,' la hop so')
else
writeln(n,' la so nguyen to');
begin
s:=0;
for i:=1 to n div 2 do
if n mod i=0 then
s:=s+i;
if s=n then
writeln(n,' la so hoan hao') else writeln(n,' ko la so hoan hao');
end;
end;
readln;
end.

???

🗣️ BÁ VÔ MÀ NÚP 🤫

Hồ Minh Nguyên
19/10/2011

Đẹp trai vl

include<bits/stdc++.h>

using namespace std;
int tmp=0;
bool dequy(string s,int i)
{
if(s[i]==s[i+1]){
return dequy(s,i+2);
tmp++;
}
if(tmp%2==1)
return false;
else
return true;
}

int main()
{
string s;
cin>>s;
if(dequy(s,0))
cout<<"Yes";
else
cout<<"No";
}

Nguyen Thanh Danh 11A1 LHP QB

include<bits/stdc++.h>

using namespace std;
const int dd=2e5+7;

define int long long

int a[dd],b[dd],n,m,l,r;
int vt(int x)
{
l=1; r=n;
while(l<=r)
{
int mid=(l+r)/2;
if (a[mid]==x) return mid;
if (a[mid]>x) r=mid-1; else l=mid+1;
}
return -1;
}
void xuli()
{
cin>>n>>m;
for (int i=1; i<=n; ++i) cin>>a[i];
for (int i=1; i<=m; ++i) cin>>b[i];
sort(a+1,a+n+1);
for (int i=1; i<=m; ++i)
{
l=1; r=n; int kq=-2e9;
while(l<=r)
{
int mid=(l+r)/2;
if (a[mid]==b[i])
{
kq=a[mid];
break;
}
if (a[mid]<=b[i])
{
l=mid+1;
kq=max(kq,a[mid]);
} else if (a[mid]>b[i]) r=mid-1;
}
if (kq!=-2e9)
{
cout<<kq<<"\n";
if (vt(kq)!=-1) a[vt(kq)]=2e9;
} else cout<<"-1\n";
}
}
signed main()
{
ios::sync_with_stdio(0); cin.tie(0);
xuli();
}