ÔN HSG TIN 2023 by Bùi Thị Phương Mai

BUỔI 1

maip1162 — 2023-02-08 06:48:27 UTC

Buổi 1

2023-02-08 07:26:27 UTC

Buoi 1

2023-02-08 08:02:43 UTC

BUỔI 2

maip1162 — 2023-02-08 08:16:00 UTC

Xau 22

2023-02-11 03:30:25 UTC

bai22

2023-02-13 08:01:17 UTC

bài tập xâu buổi 1

maip1162 — 2023-02-13 08:40:49 UTC

BAI 22

maip1162 — 2023-02-13 08:50:51 UTC

#include
using namespace std;
string s,m,t;
char s1;
int MAX;
int main()
{
getline(cin,s);
cin>>s1;
s+=" ";
while(s.find(" ")!=-1){
m=s.substr(0,s.find(" "));
if (m[0]==s1 && m.size()>t.size() )
{t=m;}
s.erase(0,s.find(" ")+1);
}
cout<}

Bai 35 ne hihi

2023-02-13 10:12:45 UTC

#include
using namespace std;
int n;
bool kt=0;
int main(){
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int l=1;l<=n;l++)
for(int k=1;k<=n;k++){
if (i*i+j*j+k*k+l*l==n) kt=1;
}
if (kt==0) cout<<"khong sieu chinh phuong";else cout<<"sieu chinh phuong";
}

Tram Nhi Phan ne

2023-02-14 09:37:58 UTC

#include
using namespace std;
int n,k,mid,s,a[100000];
int main(){
cin>>n>>k;
for (int i=1;i<=n;i++)
cin>>a[i];
for (int i=1;i<=n;i++){
s=k+i;
int d=1,c=n;
while(d mid=(d+c)/2;
if (a[mid]==s)
{
cout< break;
}
else if (s>a[mid]) d=mid+1;
else c=mid-1;
}
}
}

Bài tập xâu buổi 2

maip1162 — 2023-02-14 15:40:09 UTC

2023-02-15 07:48:27 UTC

Xau buoi 2

2023-02-15 08:45:18 UTC

Bài tập xâu buổi 3

maip1162 — 2023-02-15 09:06:12 UTC

xau buoi 3

2023-02-15 09:59:14 UTC

VT14

2023-02-17 09:01:25 UTC

#include
using namespace std;
int a[100000],t,n,m=0;
int main(){
cin>>n;
for (int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i for(int j=2;j<=n;j++){
t=a[i]*a[j];
if (t>m) m=t;

}
cout<}

2023-02-17 09:41:02 UTC

#include
using namespace std;
int uc(int a,int b){
if (b==0) return a;
return uc(b,a%b);
}
int a,b;
int main(){
cin>>a>>b;
int ucln = uc(a,b);
a=a/ucln;
b=b/ucln;
if (b==0) cout<<"INVALID";
else {if (b!=1)
{
if (b<0){
b*=-1;
a*=-1;
}
cout< }
else{
cout< }
return 0;
}
}

Bài tập cơ bản buổi 2_2

maip1162 — 2023-02-19 01:00:20 UTC

ĐỀ LAO CAI 20-21

maip1162 — 2023-02-19 02:21:50 UTC

21 2 2023

maip1162 — 2023-02-21 08:47:43 UTC

2023-02-21 10:12:30 UTC

Buổi 3

maip1162 — 2023-02-24 07:00:35 UTC

Buổi 4

maip1162 — 2023-02-24 07:05:06 UTC

43

2023-02-24 07:22:45 UTC

44

2023-02-24 07:33:23 UTC

di cho nhe

2023-02-27 09:33:11 UTC

#include
using namespace std;
int n,y,k,d;
int main()
{
cin>>y>>k>>n;
for(int i=1;i<=n;i++)
if((y+i)%k==0&&(i+y) d++;
cout< }
if(d==0) cout<<-1;
}

maip1162 — 2023-03-10 06:50:14 UTC

3 bài tập

maip1162 — 2023-03-10 06:51:58 UTC

Da Nang 2122

2023-03-10 08:27:38 UTC

câu 6

maip1162 — 2023-03-11 03:52:43 UTC

#include
using namespace std;
mapkt;
int n,a,b,d;
int main(){
cin>>n;
for (int i=1;i<=n;i++) {
cin>>a>>b;
for (int k=a;k<=b;k++)
kt[k]++;
}
for (auto i:kt) {
if (i.second>d) d=i.second;
}
cout<}

BÀI TẬP 12 3 2023

phamanhlc1992 — 2023-03-11 16:33:15 UTC

Bài tập mảng

maip1162 — 2023-03-25 06:58:38 UTC

bai 9

2023-08-10 12:18:36 UTC

bai 10

2023-08-10 12:18:47 UTC

bai 11

2023-08-10 12:18:59 UTC

bai 12

2023-08-11 13:21:44 UTC

bai 13

2023-08-11 13:21:54 UTC

bai 14

2023-08-11 13:22:37 UTC

2023-08-16 08:57:57 UTC

mang

2023-08-16 09:52:38 UTC

#include
using namespace std;
int n,a[10000],x;
int main() {
freopen("bai6.inp", "r", stdin);
freopen("bai6.out", "w", stdout);
cin >> n;
for (int i=1;i<=n;i++)
cin >>a[i]; cin >> x;
sort (a+1,a+1+n);
for (int i=1;i<=n;i++)
cout << a[i]<<" ";
cout << endl;
int c=1;
while((c<=n)&&(x>=a[c])) c++;
for(int j=n+1;j>c;j--){
a[j]=a[j-1]; }
a[c]=x;
n++;
for(int i=1;i<=n;i++){
cout<

2023-08-16 09:53:35 UTC

Đề Lào Cai 2022-2023

maip1162 — 2023-09-18 07:47:11 UTC

Luyện Code

2023-10-27 07:36:51 UTC

Đếm ước

maip1162 — 2023-11-29 07:20:14 UTC

Đề khảo sát lớp 9 lần 2 (2022-2023)

maip1162 — 2023-12-03 01:34:16 UTC

#include

maip1162 — 2023-12-07 12:58:49 UTC

#include

using namespace std;

long long n,a[10000000],d,x;

long long tong(int x,int y)

{long long t=0;

for(int i=x;i<=y;i++)

t=t+a[i];

return t;

}

int main()

{

cin>>n>>x;

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

cin>>a[i];

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

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

if(tong(i,j)==x) d++;

maip1162 — 2024-10-19 01:10:01 UTC

Đề pHú thọ 22-23

maip1162 — 2024-10-19 01:23:30 UTC

maip1162 — 2024-10-19 01:46:43 UTC

Thơm :3

anh_chi — 2024-10-19 02:35:25 UTC

M.Tuan (DorisYume)

2024-10-19 03:29:14 UTC

vietvipmax7 — 2024-10-19 03:30:31 UTC

hcbchc62 — 2024-10-19 03:32:42 UTC

Đề Quảng Trị 22-23

maip1162 — 2024-10-21 07:09:56 UTC

Trần Minh Tuấn

2025-01-17 09:45:25 UTC

de_khao_sat_lop_9_lan_2_2022_2023

anh_chi — 2025-01-17 09:47:26 UTC

Hải Vinh nộp ak

vinhtrankyvblc — 2025-01-18 03:50:39 UTC