Add solution to project euler's problem 3

On x64 the only instruction supporting imm64 is mov rXX,
imm64 so there has to be a special case for those numbers

project_euler/problem3.qbl

@@ -0,0 +1,56 @@
+//valid,6857
+//:END:
+import "../std.qbl"
+
+600851475143 2 divHasLargerPF 3
+while
+{
+	// n p
+	req dup 2 req req +
+	// p n p+2
+	swp req
+	// n p p+2
+	divHasLargerPF
+	// p+2 hasLPF newN
+	req
+}
+deq 2 - intToStr println
+
+function int int => bool int divHasLargerPF
+{
+	req dup req divIfDivisible
+	// n newN
+	1 req dup
+	// newN 1 n newN
+	== req req
+	// is1 n newN
+	if
+	{
+		false req deq
+	}
+	else
+	{
+		true deq req
+	}
+}
+
+function int int => int divIfDivisible
+{
+	// p n
+	dup req dup swp
+	// p n p n
+	divmod 0
+	// p n p/n p%n 0
+	req req req ==
+	// p n p/n isDiv
+	req req req
+	if
+	{
+		deq req divIfDivisible
+	}
+	else
+	{
+		req deq deq
+	}
+}
+

src/main.rs

@@ -500,9 +500,17 @@ fn generate_assembly_linux_x64_block(operations: &Vec<Operation>, functions: &Ve
 				match datatype
 				{
 					Datatype::Int =>
+					{
+						if value.parse::<i64>().unwrap() > u32::MAX as i64
+						{
+							data.code += format!("\tmov rax, {}\n", value).as_str();
+							data.code += "\tmov qword [queue+8*r13], rax\n";
+						}
+						else
 						{
 							data.code += format!("\tmov qword [queue+8*r13], {}\n", value).as_str();
 						}
+					}
 					Datatype::Bool =>
 					{
 						data.code += format!("\tmov qword [queue+8*r13], {}\n", if value == "true" { 1 } else { 0 }).as_str();

std.qbl

@@ -24,3 +24,7 @@ function int => int decrement
 {
 	1 -
 }
+function int => int increment
+{
+	1 +
+}