main 함수명 변

Author: wh2per

Programmers/Lv1/Lv1_2016년.cpp

@@ -3,7 +3,7 @@
 #include <iostream>
 using namespace std;
 
-string solution1(int a, int b) {
+string solution(int a, int b) {
 	vector<string> v = { "SUN","MON","TUE","WED","THU","FRI","SAT" };
 	int index = 0;
 	if (a == 1 || a==4 || a==7) index = 5;

Programmers/Lv1/Lv1_K번째수.cpp

@@ -3,7 +3,7 @@
 #include <algorithm>
 using namespace std;
 
-vector<int> solution2(vector<int> array, vector<vector<int>> commands) {
+vector<int> solution(vector<int> array, vector<vector<int>> commands) {
 	vector<int> answer;
 	for (int i = 0; i < commands.size(); i++) {
 		int begin = commands[i][0];

Programmers/Lv1/Lv1_N으로표현.cpp

@@ -25,7 +25,7 @@ void go(int N, int number, int result, int count) {
 
 	}
 }
-int solution3(int N, int number) {
+int solution(int N, int number) {
 	go(N, number, 0, 0);
 	return mincount;
 }

Programmers/Lv1/Lv1_x만큼간격이있는n개의숫자.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-vector<long long> solution33(int x, int n) {
+vector<long long> solution(int x, int n) {
 	vector<long long> answer;
 	long long temp = 0;
 	for (int i = 0; i < n; i++) {

Programmers/Lv1/Lv1_가운데글자가져오기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution4(string s) {
+string solution(string s) {
 	string answer = "";
 	if (s.length() % 2 == 0)
 		answer.push_back(s[(s.length() / 2) - 1]);

Programmers/Lv1/Lv1_같은숫자는싫어.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-vector<int> solution5(vector<int> arr)
+vector<int> solution(vector<int> arr)
 {
 	vector<int> answer;
 	int prev = arr[0];

Programmers/Lv1/Lv1_나누어떨어지는숫자배열.cpp

@@ -3,7 +3,7 @@
 #include <algorithm>
 using namespace std;
 
-vector<int> solution6(vector<int> arr, int divisor) {
+vector<int> solution(vector<int> arr, int divisor) {
 	vector<int> answer;
 
 	if (divisor == 1) {

Programmers/Lv1/Lv1_두정수사이의합.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-long long solution34(int a, int b) {
+long long solution(int a, int b) {
 	long long answer = 0;
 	int temp=0;
 	if (a > b) {

Programmers/Lv1/Lv1_모의고사.cpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-vector<int> solution7(vector<int> answers) {
+vector<int> solution(vector<int> answers) {
 	vector<int> answer;
 	int a = 0, b = 0, c = 0;
 	int size = answers.size();

Programmers/Lv1/Lv1_문자열내p와y의개수.cpp

@@ -2,7 +2,7 @@
 #include <iostream>
 using namespace std;
 
-bool solution36(string s)
+bool solution(string s)
 {
 	bool answer = true;
 	int p = 0;

Programmers/Lv1/Lv1_문자열내림차순으로배치하기.cpp

@@ -3,7 +3,7 @@
 #include <algorithm>
 using namespace std;
 
-string solution37(string s) {
+string solution(string s) {
 	string answer = "";
 	vector<char> v;
 	for (int i = 0; i < s.length(); i++)

Programmers/Lv1/Lv1_문자열내마음대로정렬하기.cpp

@@ -10,7 +10,7 @@ bool compare(string a, string b) {
 		return a[index] < b[index];
 }
 
-vector<string> solution35(vector<string> strings, int n) {
+vector<string> solution(vector<string> strings, int n) {
 
 	index = n;
 	sort(strings.begin(), strings.end(), compare);

Programmers/Lv1/Lv1_문자열다루기기본.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-bool solution38(string s) {
+bool solution(string s) {
 	if (s.length() != 4 && s.length() != 6)
 		return false;;
 

Programmers/Lv1/Lv1_문자열을정수로바꾸기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-int solution41(string s) {
+int solution(string s) {
 	int answer = 0;
 	char temp;
 	if (s[0] == '-') {

Programmers/Lv1/Lv1_서울에서김서방찾기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution39(vector<string> seoul) {
+string solution(vector<string> seoul) {
 	string answer = "±è¼­¹æÀº ";
 	for (int i = 0; i < seoul.size(); i++) {
 		if (seoul[i] == "Kim")

Programmers/Lv1/Lv1_소수의합.cpp

@@ -2,7 +2,7 @@
 using namespace std;
 
 
-long long solution8(int N) {
+long long solution(int N) {
 	long long answer = 0;
 	const long long MAX = 10000000;
 	vector<bool> check(MAX + 1);

Programmers/Lv1/Lv1_소수찾기.cpp

@@ -2,7 +2,7 @@
 #include <vector>
 using namespace std;
 
-int solution40(int n) {
+int solution(int n) {
 	vector<int> p(1000001);
 	vector<bool> check(1000001);
 	int pn = 0;

Programmers/Lv1/Lv1_수박수박수박수박수박수.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution41(int n) {
+string solution(int n) {
 	string answer = "";
 	string a = "¼ö¹Ú";
 	string b = "¼ö";

Programmers/Lv1/Lv1_시저암호.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution42(string s, int n) {
+string solution(string s, int n) {
 	string answer = "";
 	for (int i = 0; i < s.length(); i++) {
 		if (s[i] != ' ') {

Programmers/Lv1/Lv1_약수의합.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-int solution44(int n) {
+int solution(int n) {
 	int answer = 0;
 
 	for (int i = 1; i <= n; i++) {

Programmers/Lv1/Lv1_예산.cpp

@@ -5,7 +5,7 @@
 #include <algorithm>
 using namespace std;
 
-int solution9(vector<int> d, int budget) {
+int solution(vector<int> d, int budget) {
 	int answer = 0;
 	sort(d.begin(), d.end());
 	for (int i = 0; i < d.size(); i++) {

Programmers/Lv1/Lv1_완주하지못한선수.cpp

@@ -3,7 +3,7 @@
 #include <set>
 using namespace std;
 
-string solution10(vector<string> participant, vector<string> completion) {
+string solution(vector<string> participant, vector<string> completion) {
 	string answer = "";
 	multiset<string> s;
 

Programmers/Lv1/Lv1_이상한문자만들기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution45(string s) {
+string solution(string s) {
 	string answer = "";
 	int index = 0;
 

Programmers/Lv1/Lv1_자릿수더하기.cpp

@@ -2,7 +2,7 @@
 #include <string>
 using namespace std;
 
-int solution46(int n)
+int solution(int n)
 {
 	int answer = 0;
 	string s = to_string(n);

Programmers/Lv1/Lv1_자연수뒤집어배열로만들기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-vector<int> solution47(long long n) {
+vector<int> solution(long long n) {
 	vector<int> answer;
 	while (n > 10) {
 		answer.push_back(n % 10);

Programmers/Lv1/Lv1_정수내림차순으로배치하기.cpp

@@ -3,7 +3,7 @@
 #include <algorithm>
 using namespace std;
 
-long long solution48(long long n) {
+long long solution(long long n) {
 	long long answer = 0;
 	vector<int> v;
 	int ten = 1;

Programmers/Lv1/Lv1_정수제곱근판별.cpp

@@ -3,7 +3,7 @@
 #include <math.h>
 using namespace std;
 
-long long solution49(long long n) {
+long long solution(long long n) {
 	long long answer = 0;
 	long long temp = sqrt(n);
 	if (temp*temp == n)

Programmers/Lv1/Lv1_제일작은수제거하기.cpp

@@ -3,7 +3,7 @@
 #include <list>
 using namespace std;
 
-vector<int> solution50(vector<int> arr) {
+vector<int> solution(vector<int> arr) {
 	vector<int> answer;
 	list<int> l(arr.begin(), arr.end());
 	int min = 99999999;

Programmers/Lv1/Lv1_직사각형별찍기.cpp

@@ -2,7 +2,7 @@
 
 using namespace std;
 
-void solution11(void) {
+void solution(void) {
 	int a;
 	int b;
 	cin >> a >> b;

Programmers/Lv1/Lv1_짝수와홀수.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution51(int num) {
+string solution(int num) {
 	string answer = "";
 	if (num % 2 == 0)
 		answer = "Even";

Programmers/Lv1/Lv1_체육복.cpp

@@ -3,7 +3,7 @@
 #include <list>
 using namespace std;
 
-int solution12(int n, vector<int> lost, vector<int> reserve) {
+int solution(int n, vector<int> lost, vector<int> reserve) {
 	int answer = n - lost.size();
 	list<int> l(begin(reserve), end(reserve));
 

Programmers/Lv1/Lv1_최대공약수와최소공배수.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-vector<int> solution52(int n, int m) {
+vector<int> solution(int n, int m) {
 	vector<int> answer;
 	int max = 1;
 	int min = m;

Programmers/Lv1/Lv1_콜라츠추측.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-int solution53(int num) {
+int solution(int num) {
 	int answer = 0;
 	long n = num;
 	while (n != 1) {

Programmers/Lv1/Lv1_평균구하기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-double solution54(vector<int> arr) {
+double solution(vector<int> arr) {
 	double answer = 0;
 
 	return answer;

Programmers/Lv1/Lv1_하샤드수.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-bool solution55(int x) {
+bool solution(int x) {
 	bool answer = true;
 	int num = x;
 	int sum = 0;

Programmers/Lv1/Lv1_핸드폰번호가리기.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-string solution56(string phone_number) {
+string solution(string phone_number) {
 	for (int i = phone_number.length() - 5; i >= 0; i--)
 		phone_number[i] = '*';
 	return phone_number;

Programmers/Lv1/Lv1_행렬의덧셈.cpp

@@ -3,7 +3,7 @@
 
 using namespace std;
 
-vector<vector<int>> solution57(vector<vector<int>> arr1, vector<vector<int>> arr2) {
+vector<vector<int>> solution(vector<vector<int>> arr1, vector<vector<int>> arr2) {
 	vector<vector<int>> answer;
 	for (int i = 0; i < arr1.size(); i++) {
 		vector<int> temp;

Programmers/Lv1_문자열압축.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+#include <string >
+using namespace std;
+
+int main() {
+	string s;
+	cin >> s;
+
+
+
+	return 0;
+}

Programmers/Lv2/Lv2_124나라의숫자.cpp

@@ -4,7 +4,7 @@
 #include <algorithm>
 using namespace std;
 
-string solution13(int n) {
+string solution(int n) {
 	string answer = "";
 	int arr[3] = { 1,2,4 };
 	int r = -1;

Programmers/Lv2/Lv2_H-Index.cpp

@@ -4,7 +4,7 @@
 
 using namespace std;
 
-int solution14(vector<int> citations) {
+int solution(vector<int> citations) {
     sort(citations.begin(), citations.end(), greater<int>());
 
     for (int i = 0; i < citations.size(); ++i) {

Programmers/Lv2/Lv2_JadenCase문자열만들기.cpp

@@ -4,7 +4,7 @@
 #include <sstream>
 using namespace std;
 
-string solution69(string s) {
+string solution(string s) {
 	bool check = true;
 	for (int i = 0; i < s.length(); i++) {
 		if (s[i] != ' ') {

Programmers/Lv2/Lv2_N개의최소공배수.cpp

@@ -3,7 +3,7 @@
 #include <algorithm>
 using namespace std;
 
-int solution70(vector<int> arr) {
+int solution(vector<int> arr) {
 	sort(arr.begin(), arr.end());
 	int answer = arr[0];
 

Programmers/Lv2/Lv2_가장큰수.cpp

@@ -16,7 +16,7 @@ bool Comp(const string& a, const string& b)
 }
 
 
-string solution15(vector<int> numbers) {
+string solution(vector<int> numbers) {
 	string answer = "";
 	int zero = 0;
 	vector<string> temp;