#include <bits/stdc++.h>

using namespace std;

int main () { int a[1000],n,i;

cin >> n;

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

cin >> a[i];

for (int i=2;i<=n;i++)

if (((a[i]<0) and (a[i-1]<0)) or ((a[i]>0) and (a[i-1]>0))) {

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

break; }

return 0;

}

#include <bits/stdc++.h>

using namespace std;

int main() {

long long n;

cin >> n;

int can = (long long)(sqrt(n));

cout << n + can;

return 0; 

 } 

Program HOC24;

var a: array[1..32000] of string;

d,i,n: integer;

begin

write('Nhap N: '); readln(n);

for i:=1 to n do

begin

 write('a[',i,']='); readln(a[i]);

end;

d:=0;

for i:=1 to n do

if length(a[i]) = 3 then d:=d+1;

write('Co ',d,' so co 3 chu so trong day');

readln

end.

\(a,\Rightarrow n-2+5⋮n-2\\ \Rightarrow n-2\inƯ\left(5\right)=\left\{-5;-1;1;5\right\}\\ \Rightarrow n\in\left\{-3;1;3;7\right\}\\ b,\Rightarrow2\left(n-4\right)+13⋮n-4\\ \Rightarrow n-4\inƯ\left(13\right)=\left\{-13;-1;1;13\right\}\\ \Rightarrow n\in\left\{-9;3;5;17\right\}\\ c,\Rightarrow6n-9⋮3n+1\\ \Rightarrow2\left(3n+1\right)-12⋮3n+1\\ \Rightarrow3n+1\inƯ\left(12\right)=\left\{-12;-6;-4;-3;-2;-1;1;2;3;4;6;12\right\}\\ \Rightarrow n\in\left\{-1;0;1\right\}\left(n\in Z\right)\\ d,\Rightarrow n^2+2n-n-2+3⋮n+2\\ \Rightarrow n\left(n+2\right)-\left(n+2\right)+3⋮n+2\\ \Rightarrow n+2\inƯ\left(3\right)=\left\{-3;-1;1;3\right\}\\ \Rightarrow n\in\left\{-5;-3;-1;1\right\}\)

ai làm giúp mình

\(n+1;n;n-1\)

n+1;n;n−1

uses crt;

var n,i,d,max,x,y:integer;

st:string;

begin

clrscr;

write('Nhap n='); readln(n);

str(n,st);

d:=length(st);

max:=0;

for i:=1 to d do 

  begin

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

if max<x then max:=x;

end;

writeln(max);

readln;

end.

a: Để B là số nguyên thì \(n+1⋮n-2\)

\(\Leftrightarrow n-2\in\left\{1;-1;3;-3\right\}\)

hay \(n\in\left\{3;1;5;-1\right\}\)

b: \(B=\dfrac{n-2+3}{n-2}=1+\dfrac{3}{n-2}\)

Để B có giá trị lớn nhất thì n-2=-1

hay n=1