![](https://rs.olm.vn/images/avt/0.png?1311)
Hãy nhập câu hỏi của bạn vào đây, nếu là tài khoản VIP, bạn sẽ được ưu tiên trả lời.
![](https://rs.olm.vn/images/avt/0.png?1311)
![](https://rs.olm.vn/images/avt/0.png?1311)
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.
![](https://rs.olm.vn/images/avt/0.png?1311)
Ngôn ngữ: C++
#include <bits/stdc++.h>
using namespace std;
long long n;
long long minx=LLONG_MAX;
long long a[100000];
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=2;i<=n;i++){
minx=min(minx,a[i]-a[i-1]);
}
cout<<minx;
return 0;
}
![](https://rs.olm.vn/images/avt/0.png?1311)
program tong;
uses crt;
var M, N, S, i: integer;
begin
clrscr;
write ('Nhap M= '); readln(M);
write ('Nhap N= '); readln(N);
s : = 0;
for i := M to N do if (i mod 2 = 0) then s:= s + i;
write (T'ong cac so chan trong pham vi tu M den N = ',s);
readln;
end.
mk mới làm tổng thui nghen
![](https://rs.olm.vn/images/avt/0.png?1311)
#include <bits/stdc++.h>
using namespace std;
long long m,n;
//chuongtrinhcon
long long ucln(long long m,long long n)
{
if (n==0) return(m);
else return(ucln(n,m%n));
}
//chuongtrinhchinh
int main()
{
cin>>n>>m;
cout<<ucln(n,m);
return 0;
}
![](https://rs.olm.vn/images/avt/0.png?1311)
uses crt;
var a,b,k,dem,x,y:longint;
begin
clrscr;
readln(a,b,k);
dem:=0;
for x:=1 to k do
for y:=1 to k do
if ((a<=b) and (a<=x*x) and (a<=y*y*y)) then dem:=dem+1;
writeln(dem);
readln;
end.
![](https://rs.olm.vn/images/avt/0.png?1311)
#include <bits/stdc++.h>
using namespace std;
long long a,b,k,x,y,dem=0;
int main()
{
cin>>a>>b>>k;
for (x=1; x<=k; x++)
{
for (y=1; y<=k; y++)
{
if (a<=x*x && a<=b && a<=y*y*y && a<=b) dem++;
}
}
cout<<dem;
return 0;
}