From af1befc64570360d4f1e6f85b94d2546612a8dd0 Mon Sep 17 00:00:00 2001
From: Santo Cariotti <sancn@live.com>
Date: Wed, 12 Apr 2017 20:07:35 +0200
Subject: OII 20

---
 lswf.cpp | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 lswf.cpp

(limited to 'lswf.cpp')

diff --git a/lswf.cpp b/lswf.cpp
new file mode 100644
index 0000000..573509b
--- /dev/null
+++ b/lswf.cpp
@@ -0,0 +1,53 @@
+/* INPUT: 
+ * 19
+ * 
+ * OUTPUT:
+ * 1000101
+ */
+#include <iostream>
+#include <fstream>
+#define MAXG 1000
+
+using namespace std;
+
+int fibonacci(int* fib, int N) 
+{
+	fib[0] = 1; fib[1] = 1;
+	int lst;
+	
+	for(int i = 2; i < N; i++) {
+		fib[i] = fib[i-1] + fib[i-2];
+		lst = i;
+		if(fib[i] > N) break;
+	}
+	
+	return lst;
+}
+
+int main()
+{
+	ifstream in("input.txt");
+	ofstream out("output.txt");
+	
+	int N, i;
+	in >> N;
+	int caracts[MAXG], somma = 0, potSomma;
+	int lastc = fibonacci(caracts, N);
+	int* seq = new int[lastc];
+	
+	//for(i = 0; i < lastc; i++) cout << caracts[i] << ' '; cout << endl;
+	
+	seq[0] = 1;
+	for(i = lastc; i > 0; i--) {
+		potSomma = somma + caracts[i];
+		if(potSomma < N) {
+			somma = potSomma;
+			seq[i] = 1;
+		} else seq[i] = 0;
+	}
+	for(i = 0; i < lastc; i++) out << seq[i];
+	delete[] seq;
+	in.close();
+	out.close();
+	return 0;
+}
-- 
cgit v1.2.3-18-g5258