[codeforces - 1517] Add C++ solution for C - Fillomino 2.

Author: abeaumont

codeforces/1517/c-1.ans

@@ -0,0 +1,3 @@
+2
+2 3
+3 3 1

codeforces/1517/c-1.in

@@ -0,0 +1,2 @@
+3
+2 3 1

codeforces/1517/c-2.ans

@@ -0,0 +1,5 @@
+1
+2 2
+3 3 3
+4 4 4 4
+5 5 5 5 5

codeforces/1517/c-2.in

@@ -0,0 +1,2 @@
+5
+1 2 3 4 5

codeforces/1517/c.cc

@@ -0,0 +1,36 @@
+// https://codeforces.com/contest/1517/problem/C
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 505;
+int xs[N][N];
+
+int main() {
+  cin.tie(0), ios::sync_with_stdio(0);
+  int n;
+  cin >> n;
+  for (int i = 0; i < n; i++) cin >> xs[i][i];
+  for (int ii = 0; ii < n; ii++) {
+    int k = xs[ii][ii];
+    int dy[4] = {0, 1, 0, -1};
+    int dx[4] = {-1, 0, 1, 0};
+    int y = ii, x = ii;
+    for (int j = 1; j < k; j++)
+      for (int i = 0; i < 4; i++) {
+        int yy = y + dy[i], xx = x + dx[i];
+        if (yy >= 0 && yy < n && xx >= 0 && xx < n && !xs[yy][xx]) {
+          xs[yy][xx] = k;
+          y = yy, x = xx;
+          break;
+        }
+      }
+  }
+  for (int i = 0; i < n; i++)
+    for (int j = 0; j <= i; j++)
+      if (!xs[i][j]) {
+        cout << "-1\n";
+        return 0;
+      }
+  for (int i = 0; i < n; i++)
+    for (int j = 0; j <= i; j++) cout << xs[i][j] << " \n"[j == i];
+}

codeforces/README.md

@@ -3,6 +3,7 @@
 There are solutions for the following [codeforces](http://codeforces.com/) problems:
 
 ### Contests ([problemset site](https://codeforces.com/problemset))
+1. [1517C - Fillomino 2](1517/c.cc) ([problem site](https://codeforces.com/contest/1517/problem/C))
 1. [1517B - Morning Jogging](1517/b.cc) ([problem site](https://codeforces.com/contest/1517/problem/B))
 1. [1517A - Sum of 2050](1517/a.cc) ([problem site](https://codeforces.com/contest/1517/problem/A))
 1. [1500B - Two chandeliers](1501/d.cc) ([problem site](https://codeforces.com/contest/1500/problem/B))