import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CoinChaging {
static int[] coins = {1,5,10,50,100};
static int[] coinsNums = new int[5];
static int res = Integer.MAX_VALUE;
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int money = Integer.parseInt(br.readLine().trim().split(" ")[0]);
String[] strs = br.readLine().trim().split(" ");
for(int i = 0; i < 5; i++) {
coinsNums[i] = Integer.parseInt(strs[i]);
}
dfsMinCoins(money,0,4);
System.out.println(res == Integer.MAX_VALUE ? -1 : res);
}
public static void dfsMinCoins(int money, int count, int start ) {
if(money == 0) {
res = Math.min(res, count);
return;
}else {
for(int i = start; i >= 0; i--) {
if(coins[i]<=money && coinsNums[i] != 0) {
int remainMoney = 0;
if(coinsNums[i]*coins[i]<=money) {
count+=coinsNums[i];
remainMoney = money-coins[i]*coinsNums[i];
}else {
int q = money/coins[i];
count += q;
coinsNums[i] -= q;//
remainMoney = money - q * coins[i];
}
dfsMinCoins(remainMoney, count, start-1);
return;
}
}
}
}
}
2.
package com.kedaxunfei;
import java.util.Arrays;
public class Sort {
public static void main(String[] args) {
int[] arr = {25,84,21,47,15,27,68,35,20};
quickSort(arr, 0, arr.length - 1);
}
public static void quickSort(int[] arr, int low, int high) {
//!!!!!
if(low >= high) return;//这里一定是大于等于 不然和答案不一致
int left = low, right = high;
int base = arr[low]; //还有这里
while(left < right) {
while(arr[right] >= base && left < right) right--;
while(arr[left] <= base && left < right) left++;
if(left < right) swap(arr, left, right);
}
arr[low] = arr[left];
arr[left] = base;
System.out.println(Arrays.toString(arr));
quickSort(arr, low, left-1);
quickSort(arr, left+1, high);
}
public static void swap(int[] arr, int i, int j ) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
3.
import java.util.Arrays;
public class Sort {
public static void main(String[] args) {
int[] arr = {25,84,21,47,15,27,68,35,20};
quickSort(arr, 0, arr.length - 1);
}
public static void quickSort(int[] arr, int low, int high) {
//!!!!!
if(low >= high) return;//这里一定是大于等于 不然和答案不一致
int left = low, right = high;
int base = arr[low]; //还有这里
while(left < right) {
while(arr[right] >= base && left < right) right--;
while(arr[left] <= base && left < right) left++;
if(left < right) swap(arr, left, right);
}
arr[low] = arr[left];
arr[left] = base;
System.out.println(Arrays.toString(arr));
quickSort(arr, low, left-1);
quickSort(arr, left+1, high);
}
public static void swap(int[] arr, int i, int j ) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
3.
package com.kedaxunfei;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
艹....
**/
public class RectangleInsection {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] axis = br.readLine().trim().split(" ");
int[] rectangle1 = new int[4];//x1 y1 x2 y2
int[] rectangle2 = new int[4];
for(int i = 0; i < 4; i++) {
rectangle1[i] = Integer.parseInt(axis[i]);
}
int aminx = Math.min(rectangle1[0], rectangle1[2]);
int amaxx = Math.max(rectangle1[0], rectangle1[2]);
int aminy = Math.min(rectangle1[1], rectangle1[3]);
int amaxy = Math.max(rectangle1[1], rectangle1[3]);
for(int i = 0; i < 4; i++) {
rectangle2[i] = Integer.parseInt(axis[i+4]);
}
int bminx = Math.min(rectangle2[0], rectangle2[2]);
int bmaxx = Math.max(rectangle2[0], rectangle2[2]);
int bminy = Math.min(rectangle2[1], rectangle2[3]);
int bmaxy = Math.max(rectangle2[1], rectangle2[3]);
boolean ans = insection(aminx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(amaxx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(aminx, amaxy, bminx, bmaxx, bminy, bmaxy) ||
insection(amaxx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy);
System.out.println(ans?1:0);
}
public static boolean insection(int x, int y, int minx, int maxx, int miny, int maxy) {
return (x>=minx && x<maxx && y>=miny && y<=maxy)? true : false;
}
}
4.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
艹....
**/
public class RectangleInsection {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] axis = br.readLine().trim().split(" ");
int[] rectangle1 = new int[4];//x1 y1 x2 y2
int[] rectangle2 = new int[4];
for(int i = 0; i < 4; i++) {
rectangle1[i] = Integer.parseInt(axis[i]);
}
int aminx = Math.min(rectangle1[0], rectangle1[2]);
int amaxx = Math.max(rectangle1[0], rectangle1[2]);
int aminy = Math.min(rectangle1[1], rectangle1[3]);
int amaxy = Math.max(rectangle1[1], rectangle1[3]);
for(int i = 0; i < 4; i++) {
rectangle2[i] = Integer.parseInt(axis[i+4]);
}
int bminx = Math.min(rectangle2[0], rectangle2[2]);
int bmaxx = Math.max(rectangle2[0], rectangle2[2]);
int bminy = Math.min(rectangle2[1], rectangle2[3]);
int bmaxy = Math.max(rectangle2[1], rectangle2[3]);
boolean ans = insection(aminx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(amaxx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(aminx, amaxy, bminx, bmaxx, bminy, bmaxy) ||
insection(amaxx, aminy, bminx, bmaxx, bminy, bmaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy) ||
insection(bmaxx, bminy, aminx, amaxx, aminy, amaxy);
System.out.println(ans?1:0);
}
public static boolean insection(int x, int y, int minx, int maxx, int miny, int maxy) {
return (x>=minx && x<maxx && y>=miny && y<=maxy)? true : false;
}
}
4.
package com.kedaxunfei;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/*我把这个想的太复杂了... 你看别人这个多简洁
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/*我把这个想的太复杂了... 你看别人这个多简洁
*/
public class StrToInt {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
for(int i = 0; i < str.length(); i++) {
if(i==0 && str.charAt(i)=='-') System.out.print("-");
if(str.charAt(i) >= '0' && str.charAt(i) <= '9') System.out.print(str.charAt(i));
}
}
}
自动判断中文中文(简体)中文(香港)中文(繁体)英语日语朝鲜语德语法语俄语泰语南非语阿拉伯语阿塞拜疆语比利时语保加利亚语加泰隆语捷克语威尔士语丹麦语第维埃语希腊语世界语西班牙语爱沙尼亚语巴士克语法斯语芬兰语法罗语加里西亚语古吉拉特语希伯来语印地语克罗地亚语匈牙利语亚美尼亚语印度尼西亚语冰岛语意大利语格鲁吉亚语哈萨克语卡纳拉语孔卡尼语吉尔吉斯语立陶宛语拉脱维亚语毛利语马其顿语蒙古语马拉地语马来语马耳他语挪威语(伯克梅尔)荷兰语北梭托语旁遮普语波兰语葡萄牙语克丘亚语罗马尼亚语梵文北萨摩斯语斯洛伐克语斯洛文尼亚语阿尔巴尼亚语瑞典语斯瓦希里语叙利亚语泰米尔语泰卢固语塔加路语茨瓦纳语土耳其语宗加语鞑靼语乌克兰语乌都语乌兹别克语越南语班图语祖鲁语自动选择中文中文(简体)中文(香港)中文(繁体)英语日语朝鲜语德语法语俄语泰语南非语阿拉伯语阿塞拜疆语比利时语保加利亚语加泰隆语捷克语威尔士语丹麦语第维埃语希腊语世界语西班牙语爱沙尼亚语巴士克语法斯语芬兰语法罗语加里西亚语古吉拉特语希伯来语印地语克罗地亚语匈牙利语亚美尼亚语印度尼西亚语冰岛语意大利语格鲁吉亚语哈萨克语卡纳拉语孔卡尼语吉尔吉斯语立陶宛语拉脱维亚语毛利语马其顿语蒙古语马拉地语马来语马耳他语挪威语(伯克梅尔)荷兰语北梭托语旁遮普语波兰语葡萄牙语克丘亚语罗马尼亚语梵文北萨摩斯语斯洛伐克语斯洛文尼亚语阿尔巴尼亚语瑞典语斯瓦希里语叙利亚语泰米尔语泰卢固语塔加路语茨瓦纳语土耳其语宗加语鞑靼语乌克兰语乌都语乌兹别克语越南语班图语祖鲁语有道翻译百度翻译谷歌翻译谷歌翻译（国内）翻译朗读复制正在查询，请稍候……重试朗读复制复制朗读复制via 谷歌翻译（国内）译
public class StrToInt {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
for(int i = 0; i < str.length(); i++) {
if(i==0 && str.charAt(i)=='-') System.out.print("-");
if(str.charAt(i) >= '0' && str.charAt(i) <= '9') System.out.print(str.charAt(i));
}
}
}
全部评论
(2) 回帖