patA1048 Find coins 用散列进行优化

#include <iostream> #include <cstdio>  using namespace std; const int maxn=10001; int hashT[maxn]={0}; int main(int argc, char** argv) { int n,m; scanf("%d %d",&n,&m); for(int i=0;i<n;i++){ int x; sca

>>阅读原文<<