#include <stdio.h>
void nhap(int a[], int n, int i){
if(i == n) return;
scanf("%d", &a[i]);
nhap(a, n, i+1);
}
int max(int a[], int n, int i){
if(i == n-1) return a[i];
int m = max(a, n, i+1);
return a[i] > m ? a[i] : m;
}
int min(int a[], int n, int i){
if(i == n-1) return a[i];
int m = min(a, n, i+1);
return a[i] < m ? a[i] : m;
}
int main(){
int n, a[100];
scanf("%d", &n);
nhap(a, n, 0);
printf("%d\n%d", min(a, n, 0), max(a, n, 0));
return 0;
}
B
#include <stdio.h>
void hanoi(int n, int from, int aux, int to){
if(n == 1){
printf("Chuyen dia 1 tu cot %d sang cot %d\n", from, to);
return;
}
hanoi(n-1, from, to, aux);
printf("Chuyen dia %d tu cot %d sang cot %d\n", n, from, to);
hanoi(n-1, aux, from, to);
}
int main(){
int n;
scanf("%d", &n);
hanoi(n, 1, 2, 3);
return 0;
}