#include <iostream>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define elif else if
#define ull unsigned long long
#define ui unsigned int
#define zelenskiy ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fori for (int i = 0; i < n; ++i)
#define forj for (int j = 0; j < n; ++j)
#define wt while(true)
int min1(int a, int b){
if (a < b) return a;
else return b;
}
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << min1(a,b);
}
Объяснение:
Все просто
#include <iostream>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define elif else if
#define ull unsigned long long
#define ui unsigned int
#define zelenskiy ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fori for (int i = 0; i < n; ++i)
#define forj for (int j = 0; j < n; ++j)
#define wt while(true)
int umnoj(int a){
return a*3;
}
using namespace std;
int main() {
int a;
cin >> a;
cout << umnoj(a);
}
Объяснение: