goorm 네 수의 곱, 비트연산 기본 2, Hello Goorm !

#include <iostream>
using namespace std;

int mul(int a, int b){
	return a*b;
}

int main(void){
	int n1, n2, n3, n4;
	cin >> n1 >> n2>> n3 >> n4;
	cout << mul(mul(n1, n2), mul(n3, n4));
	return 0;
}

 

#include <iostream>
using namespace std;
int main(void) {
	int a, b;
	cin >> a >> b;
	int rst1 = a>>b;
	int rst2 = a<<b;
	cout<<rst1<<endl<<rst2;
	return 0;
}

 

#include <iostream>
using namespace std;
int main() {
	int n;
	cin >> n;
	int i = 1;
	while(i<=n){
		cout<<"Hello Goorm !"<<endl;
		i++;
	}
	return 0;
}