admin - 29/03/2024
https://docs.google.com/forms/d/1DQYpYW9FM2ievvzeY2a-l4skmoZ3UMe6FuQLUDhmDH8/edit
(xem thêm)admin - 23/03/2024
bài số 1: https://docs.google.com/forms/d/1r5Y7glsGAcXWknNM4MShj9_WOpuL4JGx5ptPVBIW5KA/edit
bài số 2:
https://docs.google.com/forms/d/1Ti72brSA64hC161XRlOc30XyqN96W_KzMYxoiAra1EU/edit
(xem thêm)admin - 22/03/2024
https://docs.google.com/forms/d/1jrCaPPqpOyfUJSFRv6h9NnfJwMRB9VFa2JxZVC7GBBE/edit
(xem thêm)
admin - 12/01/2024
https://docs.google.com/forms/d/1Tb1jdyZLLpwmOt_M5LyTv473LM0EflmrgTeiNJOt_8A/edit
(xem thêm)admin - 08/01/2024
https://docs.google.com/forms/d/1f_rjU3R7haM4QVU-6hnqv2kwMzrAP0QQdJdF-z9bmi0/edit
<br>
https://docs.google.com/forms/d/e/1FAIpQLSd8BvUUgrOr0dDETUYYPOtL5lcN_8bmVg_MMvYNwn_diLY_Dw/viewform
(xem thêm)Bài tập ngày 19 tháng 08 năm 2023_Lớp 11 Chuyên Tin
admin - 19/08/2023
https://app.box.com/s/j3wh2rcpybeykq249mqrmowy23c2fjf5
(xem thêm)Khai báo tên nick trên trang lehongphong.ntucoder.net
admin - 19/08/2023
Tên nick trên trang lehongphong.ntucoder.net - Google Biểu mẫu
(xem thêm)admin - 24/11/2018
/* C program for Merge Sort */
#include<stdlib.h>
#include<stdio.h>
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */
int L[n1], R[n2];
/* Copy data to temp arrays L[] and R[] */
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/
i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of me...
(xem thêm)
admin - 24/11/2018
// C++ program for implementation of Heap Sort
#include <iostream>
using namespace std;
void heapify(int arr[], int n, int i)
{
// Find largest among root, left child and right child
int largest = i;
int l = 2*i + 1;
int r = 2*i + 2;
if (l < n && arr[l] > arr[largest])
largest = l;
if (r < n && arr[r] > arr[largest])
largest = r;
// Swap and continue heapifying if root is not largest
if (largest != i)
{
swap(arr[i], arr[largest]);
heapify(arr, n, largest);
}
}
// main function to do heap sort
void heapSort(int arr[], int n)
{
// Build max heap
...
(xem thêm)
admin - 19/11/2018
#include <iostream>
#include<stdio.h>
using namespace std;
long long a[1000001],n;
void vaora()
{freopen("quicksort.inp","r",stdin);
freopen("quicksort.out","w",stdout);
}
void nhapmang()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
}
void sxn(int l, int r)
{ int i=l,j=r;
int mid=(l+r)/2;
while(i<=j)
{
while(a[i]<a[mid]) i++;
while(a[j]>a[mid]) j--;
if(i<=j)
{
if(i<j) swap(a[i],a[j]);
i++;
j...
(xem thêm)