From e5ecb183fa1df79ae76086d81780c66cdd9d69b7 Mon Sep 17 00:00:00 2001
From: Aditya Naik
Date: Sat, 2 Mar 2019 04:38:17 -0500
Subject: Starting 924

---
 924/news.cpp | 14 ++++++++++++++
 log.org      |  5 ++++-
 2 files changed, 18 insertions(+), 1 deletion(-)
 create mode 100644 924/news.cpp

diff --git a/924/news.cpp b/924/news.cpp
new file mode 100644
index 0000000..e48d241
--- /dev/null
+++ b/924/news.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+using namespace std;
+
+int main(){
+    int num_emps;
+    cin>>num_emps;
+    int *adj[num_emps];
+    
+    for(int i=0; i<num_emps; i++){
+	arr[i] = (int*)malloc(num_emps*sizeof(int));
+    }
+}
diff --git a/log.org b/log.org
index eacb8f5..a5ce622 100644
--- a/log.org
+++ b/log.org
@@ -3,7 +3,7 @@
 
 * DONE 146
 - Supposed to be solved with cpp stl, perhaps a c implementation of next_permutation will be more exciting?
-* WORKING 429
+* DONE 429
 - Word transformation: looks like a graph problem
   - Appears under 'easy BFS' 
 - Needs to be revisited
@@ -12,3 +12,6 @@
   - A segment tree perhaps?
 - Attempting a (naive) linear array first to see if it works (half expecting it to fail on time limit)
   - Failed on TLE
+* TODO 924
+- Involves finding the graph depth maximum number of nodes from a given node
+- BFS with keeping track of queue size at each depth
-- 
cgit v1.2.3