Add solutions to domains/algorithms/warmup

Author: derekhh

.gitignore

@@ -156,7 +156,9 @@ $RECYCLE.BIN/
 .DS_Store
 /dictionary.lst
 
+# Project specific files
 *.o
 *.out
 *.in
-*.exe
+*.exe
+README.html

domains/algorithms/warmup/README.md

@@ -0,0 +1,16 @@
+# Algorithms - Warmup
+
+This repository keeps a list of the problems in [Algorithms - Warmup](https://www.hackerrank.com/domains/algorithms/warmup). The threshold I'm currently using is 10 minute for each easy problem.
+
+## Submissions (9 / 9)
+|Problem|Solution|Difficulty|Date|Time|#Sub|Comment|
+|---|---|---|---|---|---|---|
+|[Solve Me First](https://www.hackerrank.com/challenges/solve-me-first)|[solve-me-first.cpp](solve-me-first.cpp)|Easy|1/21/2017|0'29"|1||
+|[Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum)|[simple-array-sum.cpp](simple-array-sum.cpp)|Easy|1/21/2017|0'45"|1||
+|[Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets)|[compare-the-triplets.cpp](compare-the-triplets.cpp)|Easy|1/21/2017|2'06"|1||
+|[A Very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum)|[a-very-big-sum.cpp](a-very-big-sum.cpp)|Easy|1/21/2017|0'41"|1||
+|[Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference)|[diagonal-difference.cpp](diagonal-difference.cpp)|Easy|1/21/2017|2'27"|1||
+|[Plus Minus](https://www.hackerrank.com/challenges/plus-minus)|[plus-minus.cpp](plus-minus.cpp)|Easy|1/21/2017|2'05"|1||
+|[Staircase](https://www.hackerrank.com/challenges/staircase)|[staircase.cpp](staircase.cpp)|Easy|1/21/2017|1'29"|1||
+|[Time Conversion](https://www.hackerrank.com/challenges/time-conversion)|[time-conversion.cpp](time-conversion.cpp)|Easy|1/21/2017|4'07"|1||
+|[Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation)|[circular-array-rotation.cpp](circular-array-rotation.cpp)|Easy|1/21/2017|3'18"|1||

domains/algorithms/warmup/a-very-big-sum.cpp

@@ -0,0 +1,19 @@
+/*
+  a-very-big-sum.cpp
+  A Very Big Sum
+*/
+
+#include <iostream>
+using namespace std;
+
+int main() {
+  int n;
+  cin >> n;
+  long long tmp, sum = 0;
+  for (int i = 0; i < n; i++) {
+    cin >> tmp;
+    sum += tmp;
+  }
+  cout << sum << endl;
+  return 0;
+}

domains/algorithms/warmup/circluar-array-rotation.cpp

@@ -0,0 +1,25 @@
+/*
+  circular-array-rotation.cpp
+  Circular Array Rotation
+*/
+
+#include <iostream>
+using namespace std;
+
+const int MAXN = 100000;
+int a[MAXN];
+
+int main() {
+  int n, k, q;
+  cin >> n >> k >> q;
+  for (int i = 0; i < n; i++) {
+    cin >> a[i];
+  }
+  while (q--) {
+    int idx;
+    cin >> idx;
+    int newIdx = ((idx - k) % n + n) % n;
+    cout << a[newIdx] << endl;
+  }
+  return 0;
+}

domains/algorithms/warmup/compare-the-triplets.cpp

@@ -0,0 +1,26 @@
+/*
+  compare-the-triplets.cpp
+  Compare the Triplets
+*/
+
+#include <iostream>
+using namespace std;
+
+int main() {
+  int a[3], b[3], sa = 0, sb = 0;
+  for (int i = 0; i < 3; i++) {
+    cin >> a[i];
+  }
+  for (int i = 0; i < 3; i++) {
+    cin >> b[i];
+  }
+  for (int i = 0; i < 3; i++) {
+    if (a[i] > b[i]) {
+      sa++;
+    } else if (b[i] > a[i]) {
+      sb++;
+    }
+  }
+  cout << sa << " " << sb << endl;
+  return 0;
+}

domains/algorithms/warmup/diagonal-difference.cpp

@@ -0,0 +1,27 @@
+/*
+  diagonal-difference.cpp
+  Diagonal Difference
+*/
+
+#include <iostream>
+using namespace std;
+
+const int MAXN = 1000;
+int m[MAXN][MAXN];
+
+int main() {
+  int n;
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    for (int j = 0; j < n; j++) {
+      cin >> m[i][j];
+    }
+  }
+  int sum1 = 0, sum2 = 0;
+  for (int i = 0; i < n; i++) {
+    sum1 += m[i][i];
+    sum2 += m[i][n - 1 - i];
+  }
+  cout << abs(sum1 - sum2) << endl;
+  return 0;
+}

domains/algorithms/warmup/plus-minus.cpp

@@ -0,0 +1,27 @@
+/*
+  plus-minus.cpp
+  Plus Minus
+*/
+
+#include <iostream>
+using namespace std;
+
+int main() {
+  int n, pos = 0, zero = 0, neg = 0;
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    int tmp;
+    cin >> tmp;
+    if (tmp > 0) {
+      pos++;
+    } else if (tmp == 0) {
+      zero++;
+    } else {
+      neg++;
+    }
+  }
+  cout << 1.0 * pos / n << endl;
+  cout << 1.0 * neg / n << endl;
+  cout << 1.0 * zero / n << endl;
+  return 0;
+}

domains/algorithms/warmup/simple-array-sum.cpp

@@ -0,0 +1,24 @@
+/*
+  simple-array-sum.cpp
+  Simple Array Sum
+*/
+
+#include <algorithm>
+#include <cmath>
+#include <cstdio>
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+  int n;
+  cin >> n;
+  long long sum = 0;
+  for (int i = 0; i < n; i++) {
+    int tmp;
+    cin >> tmp;
+    sum += tmp;
+  }
+  cout << sum << endl;
+  return 0;
+}

domains/algorithms/warmup/solve-me-first.cpp

@@ -0,0 +1,18 @@
+/*
+  solve-me-first.cpp
+  Solve Me First
+*/
+
+#include <algorithm>
+#include <cmath>
+#include <cstdio>
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+  int a, b;
+  cin >> a >> b;
+  cout << a + b << endl;
+  return 0;
+}

domains/algorithms/warmup/staircase.cpp

@@ -0,0 +1,18 @@
+/*
+  staircase.cpp
+  Staircase
+*/
+
+#include <iostream>
+using namespace std;
+
+int main() {
+  int n;
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    for (int j = 0; j < n - i - 1; j++) cout << ' ';
+    for (int j = 0; j < i + 1; j++) cout << '#';
+    cout << endl;
+  }
+  return 0;
+}