2025.2.16 반복문 진행 중

Author: ruk13xa

StepsBySteps/반복문/10950.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int T;
+
+	cin >> T;
+
+	for(int i = 0; i < T; i++) {
+		int A, B;
+		cin >> A >> B;
+		cout << A + B << "\n";
+	}
+
+	return 0;
+}

StepsBySteps/반복문/11021.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int T;
+
+	cin >> T;
+
+	for(int i = 1; i <= T; i++) {
+		int A, B;
+
+		cin >> A >> B;
+
+		cout << "Case #" << i << ": " << A + B << "\n";
+	}
+
+	return 0;
+}

StepsBySteps/반복문/11022.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int T;
+
+	cin >> T;
+
+	for(int i = 1; i <= T; i++) {
+		int A, B;
+
+		cin >> A >> B;
+
+		cout << "Case #" << i << ": " << A << " + " << B << " = " << A + B << "\n";
+	}
+
+	return 0;
+}

StepsBySteps/반복문/15552.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int T;
+
+	cin.tie(NULL);
+	ios_base::sync_with_stdio(false);
+
+	cin >> T;
+
+	for(int i = 0; i < T; i++) {
+		int A, B;
+		
+		cin >> A >> B;
+
+		cout << A + B << "\n";
+	}
+
+	return 0;
+}

StepsBySteps/반복문/25304.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int X, N, sum = 0;
+
+	cin >> X >> N;
+
+	for (int i = 0;i < N;i++) {
+		int a, b;
+
+		cin >> a >> b;
+
+		sum += a * b;
+	}
+
+	if(X == sum) cout << "Yes";
+	else cout << "No";
+
+	return 0;
+}

StepsBySteps/반복문/25314.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int N;
+
+	cin >> N;
+
+	for (int i = 0;i < N/4;i++) cout << "long ";
+	cout << "int";
+	
+	return 0;
+}

StepsBySteps/반복문/2739.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int N;
+
+	cin >> N;
+
+
+	for (int i = 1; i <= 9; i++) cout << N << " * " << i << " = " << N * i << "\n";
+
+	return 0;
+}

StepsBySteps/반복문/8393.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+	int n;
+
+	cin >> n;
+
+	cout << n * (n + 1) / 2;
+
+	return 0;
+}