Largest proper divisor of n: Difference between revisions
Added Dart
(Added Applesoft BASIC, Chipmunk Basic, Gambas, Minimal BASIC, MSX Basic, Quite BASIC, Tiny BASIC and XBasic) |
(Added Dart) |
||
Line 957:
27 41 1 42 17 43 29 44 1 45
13 46 31 47 19 48 1 49 33 50</pre>
=={{header|Dart}}==
<syntaxhighlight lang="dart">import "dart:io";
num largest_proper_divisor(int n) {
assert(n > 0);
if ((n & 1) == 0) return n >> 1;
for (int p = 3; p * p <= n; p += 2) {
if (n % p == 0) return n / p;
}
return 1;
}
void main() {
print("El mayor divisor propio de n es:");
for (int n = 1; n < 101; ++n) {
stdout.write(largest_proper_divisor(n));
print(largest_proper_divisor(n) + n % 10 == 0 ? "\n" : " ");
}
}</syntaxhighlight>
{{out}}
<pre>Same as FreeBASIC entry.</pre>
=={{header|Delphi}}==
| |||