java四则运算

标签：ring   system   generate   top   add   一个   logs   todo   detail   

 我个人没有足够的能力完整写出这些代码所以从网上复制了一个http://blog.csdn.net/wfzczangpeng/article/details/7983731

所以还在认真的观看研习！

1. public class Demo01 {  
2.   
3.     /** 
4.      * @param args 
5.      */  
6.     public static void main(String[] args) {  
7.         // TODO Auto-generated method stub  
8.         fracAdd(1,5,7,20);//结果为：11/20  
9.         fracSub(1,5,7,20);//分数相减  
10.         fracMul(1,5,7,20);//分数相乘  
11.         fractDiv(1,5,7,20);//分数相除  
12.   
13.     }  
14.     static void fracAdd(int first_numerator,int first_denominator,int second_numrator,int second_denominator){  
15.         //以下代码能够在控制台上显示结果  
16.         //需要调用求最大公约数的函数  
17.         //需要调用求最小公倍数的函数  
18.         int denominator;  
19.         int numerator;  
20.           
21.         if(first_denominator==second_denominator)  //分母相同时加分子       
22.         {        
23.              denominator=first_denominator;        
24.              numerator=first_numerator+second_numrator;        
25.         }        
26.         else  //否则同分比较分子       
27.         {        
28.             denominator=first_denominator*second_denominator;        
29.             numerator=first_numerator*second_denominator+first_denominator*second_numrator;        
30.         }      
31.         int gcd = gcd(numerator,denominator);  
32.         denominator = denominator / gcd;  
33.         numerator = numerator / gcd;          
34.         System.out.println("输出的结果是"+numerator+"/"+denominator);   
35.         return ;        
36.   
37.     }  
38.     static void fracSub(int first_numerator,int first_denominator,int second_numrator,int second_denominator){  
39.         //以下代码能够在控制台上显示结果  
40.         //需要调用求最大公约数的函数  
41.           
42.         int denominator;  
43.         int numerator;  
44.           
45.         if(first_denominator==second_denominator)  //分母相同时加分子       
46.         {        
47.              denominator=first_denominator;        
48.              numerator=first_numerator-second_numrator;        
49.         }        
50.         else  //否则同分比较分子       
51.         {        
52.             denominator=first_denominator*second_denominator;        
53.             numerator=first_numerator*second_denominator-first_denominator*second_numrator;        
54.         }      
55.         int gcd = gcd(numerator,denominator);  
56.         denominator = denominator / gcd;  
57.         numerator = numerator / gcd;          
58.         System.out.println("输出的结果是"+numerator+"/"+denominator);   
59.         return ;        
60.   
61.     }  
62.     static void fracMul(int first_numerator,int first_denominator,int second_numerator,int second_denominator){  
63.         //以下代码能够在控制台上显示结果  
64.         //需要调用求最大公约数的函数  
65.           
66.         int denominator;  
67.         int numerator;  
68.           
69.          
70.             denominator=first_denominator*second_denominator;        
71.             numerator=first_numerator*second_numerator;   
72.             
73.         int gcd = gcd(numerator,denominator);  
74.         denominator = denominator / gcd;  
75.         numerator = numerator / gcd;          
76.         System.out.println("输出的结果是"+numerator+"/"+denominator);   
77.         return ;        
78.   
79.     }  
80.     static void fractDiv(int first_numerator,int first_denominator,int second_numerator,int second_denominator){  
81.         //以下代码能够在控制台上显示结果  
82.         //需要调用求最大公约数的函数  
83.           
84.         int denominator;  
85.         int numerator;  
86.           
87.         numerator = first_numerator*second_denominator;  
88.         denominator = first_denominator*second_numerator;  
89.           
90.               
91.             
92.         int gcd = gcd(numerator,denominator);  
93.         denominator = denominator / gcd;  
94.         numerator = numerator / gcd;          
95.         System.out.println("输出的结果是"+numerator+"/"+denominator);   
96.         return ;        
97.   
98.     }  
99.     static int gcd(int x,int y){  
100.          int r;        
101.             while( y!= 0)        
102.             {        
103.                 r = x%y;        
104.                 x = y;        
105.                 y = r;        
106.             }        
107.   
108.         return x;  
109.           
110.     }  
111.       
112. }  
113. 

java四则运算

标签：ring   system   generate   top   add   一个   logs   todo   detail   

原文地址：http://www.cnblogs.com/7inkoo/p/7571724.html