Results 1 to 11 of 11
Thread: JAVA>
Hybrid View
-
28th April 2006 18:19 #1
JAVA>
% , . . 1184 " ". , , .. , , ...
... ... /....i7 9700K | Noctua NH-D14 | Asus ROG Strix Z390-F | Vengeance LPX 16GB 3200 | Asus TUF 4070 Ti | couple of M.2 | Sound Blaster Z | CM V850 | Be Quiet Silent Base 601 | Asus ROG Swift PG278Q | Razer Blackwidow | Razer Viper | Sennheiser GSP 600
-
29th April 2006 00:50 #2
-
4th May 2006 15:33 #3
Code:public String NumberToText(int n) { if(n == 0) { return ""; } else if(n>=1 && n<=19) { String[] arr = new String[] { "", "", "", "", "", "", "", "", "", "", "", "", "","", "", "", "", "", "" }; return arr[n-1]; } else if(n>=20 && n<=99) { String[] arr = new String[]{ "", "", "", "", "", "", "", "" }; if ((n%10)==0) return arr[n/10-2] + NumberToText(n%10); else return arr[n/10-2] + " " + NumberToText(n%10); } else if(n>=100 && n<=199) { if (n%100==0) return "" + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return "" + NumberToText(n%100); } else if(n>=200 && n<=299) { if (n%100==0) return " " + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return " " + NumberToText(n%100); } else if (n>=300 && n<=399) { if (n%100==0) return " " + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return " " + NumberToText(n%100); } else if (n>=400 && n<=999) { if (n%100==0) return NumberToText(n/100) + " " + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return NumberToText(n/100) + " " + NumberToText(n%100); else return NumberToText(n/100) + " ÑÒÎÒÈÍ " + NumberToText(n%100); // 1000 - 1999 } else if (n>=1000 && n<=1999) { if (n%1000==0) return " " + NumberToText(n%1000); if (n%1000<=99) { if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%1000); else return " " + NumberToText(n%1000); } else { if (n%100==0) return " " + NumberToText(n%1000); else return " " + NumberToText(n%1000); } // 2000 - 999,999 } else { if (n%1000==0) return NumberToText(n/1000) + " " + NumberToText(n%1000); if (n%1000<=99) { if (((n%100)<=19)||((n%10)==0)) return NumberToText(n/1000) + " " + NumberToText(n%1000); else return NumberToText(n/1000) + " " + NumberToText(n%1000); } else { if (n%100==0) return NumberToText(n/1000) + " " + NumberToText(n%1000); else return NumberToText(n/1000) + " " + NumberToText(n%1000); } } }Last edited by spritable; 4th May 2006 at 15:43.
i7 9700K | Noctua NH-D14 | Asus ROG Strix Z390-F | Vengeance LPX 16GB 3200 | Asus TUF 4070 Ti | couple of M.2 | Sound Blaster Z | CM V850 | Be Quiet Silent Base 601 | Asus ROG Swift PG278Q | Razer Blackwidow | Razer Viper | Sennheiser GSP 600
-
23rd March 2016 15:02 #4Registered User
Join Date: Mar:2016
Location:
Posts: 2
10 spritable, ! . . - () .
" ", " " . :
JAVA
:Code:public class ConvertAmountToWords { public static void main(String[] args) { ConvertAmountToWords e = new ConvertAmountToWords(); System.out.println(e.convertAmountToWords(221198, 23)); } public String convertAmountToWords(int numberLv, int numberSt) { String totalText = ""; String newNumberLv = ""; String newNumberSt = ""; if(numberLv >= 2000 && numberLv <= 2999) { newNumberLv = NumberToText(numberLv).replaceFirst("", "") + " ."; } else { newNumberLv = NumberToText(numberLv) + " ."; } if(newNumberLv.contains(" ")){ newNumberLv = newNumberLv.replaceFirst(" ", " "); newNumberLv = newNumberLv.replaceFirst(" ", " "); } else { newNumberLv = newNumberLv.replaceFirst(" ", " "); } newNumberSt = NumberToTextStotinki(numberSt) + " ."; totalText = newNumberLv + " " + newNumberSt; return totalText; } private String NumberToText(int n) { if(n == 0) { return ""; } else if(n>=1 && n<=19) { String[] arr = new String[] { "", "", "", "", "", "", "", "", "", "", "", "", "","", "", "", "", "", "" }; return arr[n-1]; } else if(n>=20 && n<=99) { String[] arr = new String[]{ "", "", "", "", "", "", "", "" }; if ((n%10)==0) return arr[n/10-2] + NumberToText(n%10); else return arr[n/10-2] + " " + NumberToText(n%10); } else if(n>=100 && n<=199) { if (n%100==0) return "" + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return " " + NumberToText(n%100); } else if(n>=200 && n<=299) { if (n%100==0) return "" + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return " " + NumberToText(n%100); } else if (n>=300 && n<=399) { if (n%100==0) return "" + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%100); else return " " + NumberToText(n%100); } else if (n>=400 && n<=999) { if (n%100==0) return NumberToText(n/100) + "" + NumberToText(n%100); if (((n%100)<=19)||((n%10)==0)) return NumberToText(n/100) + " " + NumberToText(n%100); else return NumberToText(n/100) + " " + NumberToText(n%100); // 1000 - 1999 } else if (n>=1000 && n<=1999) { if (n%1000==0) return " " + NumberToText(n%1000); if (n%1000<=99) { if (((n%100)<=19)||((n%10)==0)) return " " + NumberToText(n%1000); else return " " + NumberToText(n%1000); } else { if (n%100==0) return " " + NumberToText(n%1000); else return " " + NumberToText(n%1000); } // 2000 - 999,999 } else { if (n%1000==0) return NumberToText(n/1000) + " " + NumberToText(n%1000); if (n%1000<=99) { if (((n%100)<=19)||((n%10)==0)) return NumberToText(n/1000) + " " + NumberToText(n%1000); else return NumberToText(n/1000) + " " + NumberToText(n%1000); } else { if (n%100==0) return NumberToText(n/1000) + " " + NumberToText(n%1000); else return NumberToText(n/1000) + " " + NumberToText(n%1000); } } } private String NumberToTextStotinki(int n) { if(n == 0) { return ""; } else if(n>=1 && n<=19) { String[] arr = new String[] { "", "", "", "", "", "", "", "", "", "", "", "", "","", "", "", "", "", "" }; return arr[n-1]; } else { String[] arr = new String[]{ "", "", "", "", "", "", "", "" }; if ((n%10)==0) return arr[n/10-2] + NumberToText(n%10); else return arr[n/10-2] + " " + NumberToText(n%10); } } }
Code:. .
Last edited by rumenrs; 23rd March 2016 at 17:54.
-
23rd March 2016 15:18 #5
-
23rd March 2016 16:13 #6Registered User
Join Date: Mar:2016
Location:
Posts: 2




Reply With Quote


LOG
06.05.23 ., 12:03 in