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.
1:
uses crt;
var t,x,i,n:integer;
begin
clrscr;
t:=0;
n:=10;
for i:=1 to n do
begin
readln(x);
t:=t+x;
end;
write(t);
readln;
end.
2:
uses crt;
var dem,x,i,n:integer;
begin
clrscr;
dem:=0;
n:=10;
for i:=1 to n do
begin
readln(x);
if x mod 2=0 then inc(dem);
end;
write(dem);
readln;
end.
3
program Cacsole;
uses crt;
var M, N, i: integer;
begin
clrscr;
write ('Nhap M= '); readln(M);
write ('Nhap N= '); readln(N);
for i := M to N do
if i mod 2 = 1 then
write (i,' ');
readln;
end.
giúp mk vs( một câu cũng đc)1)
var a,b : integer;
begin
writeln('nhap a va b =');
readln(a,b);
if a>b then writeln('So lon hon la a') else writeln('so lon hon la b');
if a=b then writeln('a va b bang nhau');
readln
end.
uses crt;
var n,i:integer;
m:real;
begin
clrscr;
repeat
write('Nhap n='); readln(n);
until (1<=n) and (n<=30000);
m:=0;
for i:=1 to n do
m:=m+sqrt(i);
writeln('m=',m:4:2);
readln;
end.
#include <iostream>
using namespace std;
int main() {
int n;
cout << "Nhap vao mot so nguyen khong am: ";
cin >> n;
int count = 0;
for (int i = n + 1; i <= n * n; i++) {
if (i > 0) {
count++;
}
}
cout << "So luong so duong lon hon " << n << " va nho hon hoac bang " << n * n << " la: " << count << endl;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
long long m,n;
int main()
{
cin>>m>>n;
cout<<m*n;
return 0;
}
Câu 1:
uses crt;
var n,i,t1,t2:integer;
begin
clrscr;
write('Nhap n='); readln(n);
t1:=0;
t2:=0;
for i:=1 to n do
begin
t1:=t1+i;
if i mod 2=0 then t2:=t2+i;
end;
writeln('Tong cac so tu 1 den ',n,' la: ',t1);
writeln('Tong cac so chan tu 1 den ',n,' la: ',t2);
readln;
end.
Câu 2:
uses crt;
var a,b,i,bcnn:longint;
begin
clrscr;
write('Nhap a='); readln(a);
write('Nhap b='); readln(b);
bcnn:=a*b;
for i:=a*b-1 downto 1 do
if (i mod a=0) and (i mod b=0) then
begin
if bcnn>i then bcnn:=i;
end;
writeln(bcnn);
readln;
end.
#include <bits/stdc++.h>
using namespace std;
long long a[4],i,n;
int main()
{
n=4;
for (i=1; i<=n; i++) cin>>a[i];
for (i=1; i<=n; i++)
a[i]=abs(a[i]);
sort(a+1,a+n+1);
cout<<a[n-1]*a[n];
return 0;
}