Find square difference: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
VincentARM (talk | contribs) (add task to aarch64 assembly raspberry pi) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 553:
repeat
i += 1
▲ until difference > 1000
.
print i
Line 1,059 ⟶ 1,058:
=={{header|Wren}}==
The solution '''n''' for some non-negative integer '''k''' needs to be such that: ''n² - (n² - 2n + 1) > k'' which reduces to: ''n > (k + 1)/2''.
<syntaxhighlight lang="
System.print(squareDiff.call(1000))</syntaxhighlight>
Line 1,075 ⟶ 1,074:
n > 500.5
n = 501
</pre>
=={{header|zig}}==
<syntaxhighlight lang="zig">
const std = @import("std");
const print = @import("std").debug.print;
pub fn main() !void {
var number: u64 = 2;
while(true) {
const sq= number * number;
const number1= number - 1;
const sq1= number1 * number1;
if (sq - sq1 > 1000 ) {
print("Result= {}\n", .{ number });
break;
}
number += 1;
if (number > 10000) {
print("No find ! \n",.{});
break;
}
}
}
</syntaxhighlight>
{{Out}}
<pre>
Result= 501
</pre>
[[Category:Simple]]
| |||