2018/01/18까지 푼 소스코드 업로드

10844_쉬운계단수/stairs.cpp

@@ -3,35 +3,41 @@
 2018 Jan 17, made by Jeon
 
 */
+
 #include <cstdio>
+
 int main(void)
 {
- long long gds[101][10] = { 0 };
- long long res = 0;
- int N;
- scanf("%d", &N);
- for (int i = 1; i <= 9; i++)
-  gds[1][i] = 1;
- for (int i = 2; i <= N; i++)
- {
-  gds[i][0] = gds[i - 1][1];
-  gds[i][1] = gds[i - 1][2] + gds[i - 1][0];
-  gds[i][2] = gds[i - 1][3] + gds[i - 1][1];
-  gds[i][3] = gds[i - 1][4] + gds[i - 1][2];
-  gds[i][4] = gds[i - 1][5] + gds[i - 1][3];
-  gds[i][5] = gds[i - 1][6] + gds[i - 1][4];
-  gds[i][6] = gds[i - 1][7] + gds[i - 1][5];
-  gds[i][7] = gds[i - 1][8] + gds[i - 1][6];
-  gds[i][8] = gds[i - 1][9] + gds[i - 1][7];
-  gds[i][9] = gds[i - 1][8];
-  for (int j = 0; j <= 9; j++)
-   gds[i][j] %= 1000000000;
- }
+  long long gds[101][10] = { 0 };
+  long long res = 0;
+  int N;
+  scanf("%d", &N);
+
+  for (int i = 1; i <= 9; i++)
+    gds[1][i] = 1;
+
+  for (int i = 2; i <= N; i++)
+  {
+    gds[i][0] = gds[i - 1][1];
+    gds[i][1] = gds[i - 1][2] + gds[i - 1][0];
+    gds[i][2] = gds[i - 1][3] + gds[i - 1][1];
+    gds[i][3] = gds[i - 1][4] + gds[i - 1][2];
+    gds[i][4] = gds[i - 1][5] + gds[i - 1][3];
+    gds[i][5] = gds[i - 1][6] + gds[i - 1][4];
+    gds[i][6] = gds[i - 1][7] + gds[i - 1][5];
+    gds[i][7] = gds[i - 1][8] + gds[i - 1][6];
+    gds[i][8] = gds[i - 1][9] + gds[i - 1][7];
+    gds[i][9] = gds[i - 1][8];
+
+    for (int j = 0; j <= 9; j++)
+      gds[i][j] %= 1000000000;
+  }
+
  for (int i = 0; i <= 9; i++)
  {
-  res += gds[N][i];
-  res %= 1000000000;
+    res += gds[N][i];
+    res %= 1000000000;
  }
- printf("%lld\n", res);
- return 0;
-} 
+  printf("%lld\n", res);
+  return 0;
+} 

JEON's solutions/10039.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  int score, sum = 0;
+  for(int i = 0 ; i < 5 ; i++)
+  {
+    cin >> score;
+    if(score < 40)
+      score = 40;
+    sum += score;
+  }
+
+  cout << sum/5 << endl;
+}

JEON's solutions/10707.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  int a, b, c, d, p;
+  cin >> a >> b >> c >> d >> p;
+
+  int x,y;
+  x = a * p;
+
+  if(p <= c)
+    y = b;
+  else
+    y = b + (p-c)*d;
+
+  cout << min(x,y) << endl;
+  return 0;
+}

JEON's solutions/10787.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  int num;
+  int res = 0;
+  cin >> num;
+
+  for(int i = 0 ; i < 5 ; i++)
+  {
+      int car;
+      cin >> car;
+      if(num == car)
+        res++;
+  }
+
+  cout << res << endl;
+  return 0;
+}

JEON's solutions/10798.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  char input[5][16] = {0};
+
+  for(int i = 0 ; i < 5 ; i++)
+    cin >> input[i];
+
+  for(int i = 0 ; i < 16 ; i++)
+    for(int j = 0 ; j < 5 ; j++)
+    {
+      if(input[j][i] == 0)
+        continue;
+      else
+        cout << input[j][i];
+    }
+  cout << endl;
+  return 0;
+}

JEON's solutions/10813.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+	int N, M, i, j;
+	cin >> N >> M;
+
+	int* basket = new int [N+1];
+
+	for(int i = 1 ; i <= N ; i++)
+		basket[i] = i;
+
+	while(M--)
+	{
+		cin >> i >> j;
+		swap(basket[i], basket[j]);
+	}
+
+	for(int i = 1 ; i <= N ; i++)
+		cout << basket[i] << " ";
+	cout<<endl;
+	delete [] basket;
+	return 0;
+}

JEON's solutions/10828.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+
+using namespace std;
+
+int main(void)
+{
+  char command[12] = "";
+  vector<int> v;
+
+  int N;
+  cin >> N;
+  getchar();
+
+  while(N--)
+  {
+    cin.getline(command, 12, '\n');
+    if(!strcmp(command, "pop"))
+    {
+      if(v.size() == 0)
+        cout << -1 << endl;
+      else
+      {
+          cout << v.back() << endl;
+          v.pop_back();
+      }
+    }
+    else if(!strcmp(command, "size"))
+    {
+      cout << v.size() << endl;
+    }
+    else if(!strcmp(command, "empty"))
+    {
+      if(v.size() == 0)
+        cout << 1 << endl;
+      else
+        cout << 0 << endl;
+    }
+    else if(!strcmp(command, "top"))
+    {
+      if(v.size() == 0)
+        cout << -1 << endl;
+      else
+        cout << v.back() << endl;
+    }
+    else
+    {
+      char* token = strtok(command, " ");
+      token = strtok(NULL, " ");
+      v.push_back(atoi(token));
+    }
+  }
+  return 0;
+}

JEON's solutions/10845.cpp

@@ -0,0 +1,64 @@
+#include <iostream>
+#include <vector>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+
+using namespace std;
+
+int main(void)
+{
+  char command[12] = "";
+  vector<int> v;
+
+  int N;
+  cin >> N;
+  getchar();
+
+  while(N--)
+  {
+    cin.getline(command, 12, '\n');
+    if(!strcmp(command, "pop"))
+    {
+      if(v.size() == 0)
+        cout << -1 << endl;
+      else
+      {
+          cout << v.front() << endl;
+          v.erase(v.begin());
+      }
+    }
+    else if(!strcmp(command, "size"))
+    {
+      cout << v.size() << endl;
+    }
+    else if(!strcmp(command, "empty"))
+    {
+      if(v.size() == 0)
+        cout << 1 << endl;
+      else
+        cout << 0 << endl;
+    }
+    else if(!strcmp(command, "front"))
+    {
+      if(v.size() == 0)
+        cout << -1 << endl;
+      else
+        cout << v.front() << endl;
+    }
+    else if(!strcmp(command, "back"))
+    {
+      if(v.size() == 0)
+        cout << -1 << endl;
+      else
+        cout << v.back() << endl;
+    }
+    else
+    {
+      char* token = strtok(command, " ");
+      token = strtok(NULL, " ");
+      v.push_back(atoi(token));
+    }
+  }
+  return 0;
+}

JEON's solutions/10871.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  int N, X;
+  cin >> N >> X;
+  while(N--)
+  {
+    int num;
+    cin >> num;
+    if(X > num)
+      cout << num << " ";
+  }
+  cout << endl;
+  return 0;
+}

JEON's solutions/10872.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+
+int main(void)
+{
+  int fac[13] = {0};
+  int N;
+  cin >> N;
+
+  fac[0] = 1;
+  for(int i = 1 ; i <= N ; i++)
+  {
+    fac[i] = fac[i-1] * i;
+  }
+
+  cout << fac[N] << endl;
+  return 0;
+}

JEON's solutions/10886.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+
+using namespace std;
+
+int main(void)
+{
+  int N, num, zero = 0, one = 0;
+  cin >> N;
+  while(N--)
+  {
+    cin >> num;
+    if(num)
+      one++;
+    else
+      zero++;
+  }
+
+  if(one > zero)
+    cout << "Junhee is cute!" << endl;
+  else
+    cout <<"Junhee is not cute!" << endl;
+
+  return 0;
+}

JEON's solutions/10984.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cstdio>
+using namespace std;
+
+int main(void)
+{
+  int T, N, C;
+  double G;
+  cin >> T;
+  while(T--)
+  {
+    cin >> N;
+    int sum_C = 0;
+    double sum_G = 0;
+
+    for(int i = 0 ; i < N ; i++)
+    {
+      cin >> C >> G;
+      sum_C += C;
+      sum_G += (C*G);
+    }
+    printf("%d %.1f\n", sum_C, sum_G/sum_C);
+  }
+  return 0;
+}