-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
110 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,110 @@ | ||
String times10(String nstring) { | ||
if(nstring.contains(".") && nstring.indexOf(".")==nstring.length - 2) | ||
return nstring.replaceFirst(".", ""); | ||
if(nstring.contains(".")) | ||
return nstring.split(".")[0]+nstring.split(".")[1][0]+"."+nstring.split(".")[1].substring(1); | ||
return nstring+"0"; | ||
} | ||
String? advdiv(double n1d, double n2d, int ri, [final String rstr1 = "[", final String rstr2 = "]"]) { | ||
bool over = false; | ||
int carry = 0, newcarry = 0, x, d; | ||
int? rcount = null; | ||
String n1string, n2string, r, res = ""; | ||
List<int> carries; | ||
List<String> n1s; | ||
late final int n1, n2, dotx; | ||
late final String sign; | ||
late final List<String> n1s1; | ||
|
||
if(n2d==0) | ||
return null; | ||
sign = (n1d < 0 ? n2d >= 0 : n2d < 0) ? "-" : ""; | ||
n1d = n1d.abs(); | ||
n2d = n2d.abs(); | ||
ri = ri.abs(); | ||
r = ri.toString(); | ||
n1string = n1d.toString(); | ||
n2string = n2d.toString(); | ||
|
||
while(n1string.contains(".") || n2string.contains(".")) { | ||
if(!n1string.contains(".")) { | ||
n1string+= r[0]; | ||
if(r.length > 1) | ||
r = r.substring(1)+r[0]; | ||
} | ||
else { | ||
n1string = times10(n1string); | ||
if(n1string.contains(".")) { | ||
n1string+= r[0]; | ||
if(r.length > 1) | ||
r = r.substring(1)+r[0]; | ||
}; | ||
}; | ||
n2string = times10(n2string); | ||
}; | ||
|
||
n1 = int.parse(n1string); | ||
n2 = int.parse(n2string); | ||
n1s = n1string.split(""); | ||
n1s1 = n1string.split(".")[0].split(""); | ||
|
||
for(x = 0; x < n1s1.length; x++) { | ||
d = (int.parse(times10(carry.toString())) + int.parse(n1s1[x])) ~/ n2; | ||
res+= d.toString(); | ||
carry = int.parse(times10(carry.toString())) + int.parse(n1s1[x]) - n2 * d; | ||
}; | ||
|
||
if(res.length==0) { | ||
res = "0"; | ||
x++; | ||
}; | ||
|
||
dotx = x; | ||
res+= "."; | ||
carries = [carry]; | ||
|
||
while(n1s.length <= x) | ||
n1s.add(""); | ||
|
||
while(true) { | ||
x++; | ||
if(x >= n1s.length) { | ||
if(rcount==null) | ||
rcount = 0; | ||
else | ||
rcount++; | ||
over = true; | ||
n1s.add(r[rcount % r.length]); | ||
}; | ||
|
||
newcarry = (int.parse(times10(carry.toString())) + int.parse(n1s[x])) - n2 * ((int.parse(times10(carry.toString())) + int.parse(n1s[x])) ~/ n2); | ||
|
||
if((newcarry==0 && r=="0") || List.generate(carries.length, (int y) => y).any((y) => carries[y]==newcarry && (y % r.length)==((x - dotx) % r.length))) | ||
res+= ((int.parse(times10(carry.toString())) + int.parse(n1s[x])) ~/ n2).toString(); | ||
if(newcarry==0 && r=="0") | ||
return sign+res.replaceAll(RegExp(r'^0+|0$'), "").replaceFirst(RegExp(r'^\.'), "0.").replaceFirst(RegExp(r'\.$'), ""); | ||
if(List.generate(carries.length, (int y) => y).any((y) => carries[y]==newcarry && (y % r.length)==((x - dotx) % r.length))) | ||
return sign+(res.substring(0, dotx + List.generate(carries.length, (int y) => y).firstWhere((y) => carries[y]==newcarry && (y % r.length)==((x - dotx) % r.length)) + 1)+rstr1+res.substring(dotx + List.generate(carries.length, (int y) => y).firstWhere((y) => carries[y]==newcarry && (y % r.length)==((x - dotx) % r.length)) + 1)+rstr2).replaceFirst(RegExp(r'^0+'), "").replaceFirst(RegExp(r'^\.'), "0."); | ||
|
||
res+= ((int.parse(times10(carry.toString())) + int.parse(n1s[x])) ~/ n2).toString(); | ||
carry = newcarry; | ||
if(over) | ||
carries.add(carry); | ||
}; | ||
} | ||
|
||
void main(List<String> args) { | ||
int r; | ||
double n1, n2; | ||
|
||
if(args.length < 2 || !RegExp(r'^\d*\.?\d+$').hasMatch(args[0]) || !RegExp(r'^\d*\.?\d+$').hasMatch(args[1]) || (args.length > 2 && !RegExp(r'^\d+$').hasMatch(args[2]))) { | ||
print("Usage: advdiv n1 n2[ r]"); | ||
return; | ||
}; | ||
|
||
n1 = double.parse(args[0]); | ||
n2 = double.parse(args[1]); | ||
r = args.length < 3 ? 0 : int.parse(args[2]); | ||
|
||
print(advdiv(n1, n2, r) ?? "Error"); | ||
} |