1048 Find Coins (25 分)

版权声明:如果喜欢的话,请点击一波关注把,谢谢你,么么哒!转载留名即可 ^_^ https://blog.csdn.net/qq_33375598/article/details/88071834

 

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 10​5​​ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤10​5​​, the total number of coins) and M (≤10​3​​, the amount of money Eva has to pay). The second line contains N face values(币值) of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the two face values V​1​​ and V​2​​ (separated by a space) such that V​1​​+V​2​​=M and V​1​​≤V​2​​. If such a solution is not unique, output the one with the smallest V​1​​. If there is no solution, output No Solution instead.

Sample Input 1:

8 15
1 2 8 7 2 4 11 15

Sample Output 1:

4 11

Sample Input 2:

7 14
1 8 7 2 4 11 15

Sample Output 2:

No Solution

参考代码:

 

//甲 Find Coins
#include<cstdio>
const int maxn = 1005;
int hashTable[maxn] = {0};

int main(int argc, char const *argv[])
{
  int n,m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i)
  {
    int a;
    scanf("%d", &a);
    hashTable[a]++;
  }

for (int i = 0; i < m; ++i)
{
  if(hashTable[i] > 0 && hashTable[m - i] > 0){
    if(i == m - i && hashTable[i] < 2){
      continue;
    }
    printf("%d %d\n", i, m - i);
    return 0;
  }
}

printf("No Solution\n");
return 0;
}

参考代码二(二分法):

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int A[maxn];

int binarySearch(int left, int right, int x){
    int mid;
    while(left <= right){
        mid = (left + right) / 2;
        if(A[mid] == x) return mid;
        else if(A[mid] > x){
            right = mid - 1;
        }else{
            left = mid + 1;
        }
    }
    return  -1;
}

int main(){
    int N, M;
    scanf("%d%d", &N, &M);
    for (int i = 0; i < N; ++i) {
        scanf("%d", &A[i]);
    }

    sort(A, A + N);
    int j;
    for (j = 0; j < N; ++j) {
        int pos = binarySearch(0 , N - 1, M - A[j]);
        if(pos != -1 && j != pos){
            printf("%d %d\n", A[j], A[pos]);
            break;
        }
    }

    if(j == N) printf("No Solution\n");

    return 0;
}

 

没有更多推荐了,返回首页