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.
const
fi='lhcs.inp';
fo='lhcs.out';
a:array[0..9] of byte=(1,0,0,0,1,0,1,0,2,1);
var
f:text;
t,n:integer;
procedure inp;
begin
assign(F,fi);
reset(F);
read(f,n);
close(F);
end;
procedure out;
begin
assign(f,fo);
rewrite(F);
t:=0;
while n<>0 do
begin
t:= t+a[n mod 10];
n:= n div 10
end;
write(f,t);
close(F);
end;
BEGIN
INP;
OUT;
END.
const
fi='lohongcs.inp';
fo='lohongcs.out';
var
f:text;
i,s:integer;
n:longint;
a:array[0..9] of byte;
begin
assign(f,fi);
reset(f);
read(f,n);
for i:= 1 to n do
read(f,a[i]);
a[8]:=2;
a[0]:=1; a[4]:=1; a[6]:=1; a[9]:=1;
a[1]:=0; a[2]:=0; a[3]:=0; a[5]:=0; a[7]:=0;
close(F);
assign(f,fo);
rewrite(F);
s:=0;
repeat
i:=n mod 10;
s:=s+a[i];
n :=n div 10 ;
until n=0;
write(f,s);
close(F);
end.
uses crt;
var n,d,dem,i,x,y,t:integer;
st:string;
begin
clrscr;
repeat
write('Nhap n='); readln(n);
until (1000<=n) and (n<=9999);
if n mod 2=0 then
begin
str(n,st);
d:=length(st);
dem:=0;
for i:=1 to d do
begin
val(st[i],x,y);
if x=0 then inc(em);
end;
writeln('So chu so 0 co trong so ',n,' la: ',dem);
end
else begin
str(n,st);
t:=0;
d:=length(st);
for i:=1 to d do
begin
val(st[i],x,y);
t:=t+sqr(x);
end;
writeln('Tong binh phuong cac chu so trong so ',n,' la: ',t);
end;
readln;
end.
uses crt;
var n,d,dem,i,x,y,t:integer;
st:string;
begin
clrscr;
repeat
write('Nhap n='); readln(n);
until (1000<=n) and (n<=9999);
if n mod 2=0 then
begin
str(n,st);
d:=length(st);
dem:=0;
for i:=1 to d do
begin
val(st[i],x,y);
if x=0 then inc(em);
end;
writeln('So chu so 0 co trong so ',n,' la: ',dem);
end
else begin
str(n,st);
t:=0;
d:=length(st);
for i:=1 to d do
begin
val(st[i],x,y);
t:=t+sqr(x);
end;
writeln('Tong binh phuong cac chu so trong so ',n,' la: ',t);
end;
readln;
end.
Program HOC24;
var n,d,i: integer;
B: array[1..100] of integer;
t: longint;
begin
write('Nhap N: '); readln(n);
for i:=1 to n do
begin
write('B[',i,']='); readln(b[i]);
end;
d:=0; t:=0;
for i:=1 to n do
if b[i]>0 then
begin
d:=d+1;
t:=t+b[i];
end;
writeln('Tong cac so duong trong day so la: ',t);
write('Co ',d,' so duong trong day');
readln
end.
uses crt;
var b:array[1..100] of longint;
n,i,d,s:longint;
begin
clrscr;
write('n='); readln(n);
for i:=1 to n do
begin
write('a[',i,']: '); readln(b[i]);
if b[i]>0 then begin
inc(d);
inc(s,b[i]);
end;
end;
writeln('Tong cac so duong: ',s);
writeln('Co ',d,' so duong');
readln;
end.
uses crt;
var n,i,d,x,j,tam:longint;
a:array[1..11]of integer;
st:string;
begin
clrscr;
repeat
write('Nhap n='); readln(n);
until n>0;
str(n,st);
d:=length(st);
for i:=1 to d do
begin
val(st[i],a[i],x);
end;
for i:=1 to d-1 do
for j:=i+1 to d do
if a[i]<a[j] then
begin
tam:=a[i];
a[i]:=a[j];
a[j]:=tam;
end;
for i:=1 to d do
write(a[i]);
readln;
end.
#include <bits/stdc++.h>
using namespace std;
int n,kt,t;
int main()
{
cin>>n;
int t=0;
for (int i=1; i<=n; i++)
if (i%2==1) cout<<i<<" ";
cout<<endl;
for (int i=2; i<=n; i++)
{
kt=0;
for (int j=2; j*j<=i; j++)
if (i%j==0) kt=1;
if (kt==0) cout<<i<<" ";
}
return 0;
}
ta có n - k + 1 ô full k ô, k - 1 ô còn lại thì lần lượt là tổng từ 1->k - 1
Đây là đáp án đúng;
\(\left(k\times n\right)-\dfrac{\left(k-1\right)\times k}{2}\)
từ bàn phím và đưa ra màn hình thông tin sau :
const
nhap='bai1.inp';
xuat='bai1.out';
var n,m,u,d:int64;
begin
assign(input,nhap);reset(input);
assign(output,xuat);rewrite(output);
read(n);
while n<>0 do
begin
m:=n mod 10;
n:=n div 10;
if (m=1) or (m=2) or (m=3) or (m=5) or
(m=7) then d:=0;
if (m=0) or (m=4) or (m=6) or (m=9)
then d:=1;
if m=8 then d:=2;
u:=u+d;
end;
writeln(u);
close(input);close(output);
end.