第三方库:
在mvn中央仓库(mvnrepository.com)中搜索Commons Math
Maven Repository: Search/Browse/Explore (mvnrepository.com)
将Apache Commons Math 依赖文本加到项目pom.xml中
Maven编译和运行:右键项目->Run as->Maven Build
import org.apache.commons.math3.util.ArithmeticUtils; public class GcdTest{ public static void main(String[] args){ //计算两个整数的公约数 int a = ArithmeticUtils.gcd(316,285); System.out.println(a); } }
<dependencies> <dependency> <groupId>prg.apache.commons</groupId> <artifactId>commons-math3</artifactId> <version>3.6.1</version> </dependency>
</dependencies>
~~~
简化繁
<dependencies> <dependency> <groupId>com.github.houbb</groupId> <artifactId>opencc4j</artifactId> <version>1.0.2</version> </dependency> </dependencies>
import com.github.houbb.opencc4j.util.ZhConverterUtil; public class ChineseTest{ public static void main(String[] args){ String original = "生命在于运动“; //简化繁 String result = ZhConverterUtil.convertToTraditional(original); System.out.println(result); } }
=======================================
C语言:
求最大公约数之穷举法
求最大公约数之穷举法 int a,b,c,gcd; scanf("%d%d",&a,&b); c = a<b?a:b; int i=1; for(i=c;i>=1;i--){ if(a%i==0 && b%i==0){ gcd=i; printf("GCD=%d\n",gcd); break; } } return 0;
求最大公约数之更相减损术
求最大公约数之更相减损术 int a,b,c,d,gcd; scanf("%d%d",&a,&b); if(a%2==0&&b%2==0){ c=a<b?a:b; gcd=c/2; printf("1\n%d",gcd); }else{ while(a!=b){ d = a>b?b:a; a = a>b?a-b:b-a; b=d; } gcd = a; printf("2\n%d",gcd); } return 0;
求最大公约数之辗转相除法
求最大公约数之辗转相除法 int a,b,c,d,gcd; scanf("%d%d",&a,&b); c = a<b?b%a:a%b; d = a<b?a:b; if(c==0){ gcd=a<b?a:b; printf("gcd=%d\n",gcd); }else{ while(c!=0){ int i; i = c; c=d%c; d = i; } printf("gcd=%d",d); } return 0; }