pat:1048. Find Coins (25) (hash table method) AC

#include<stdio.h>#include<string.h>int harsh[1066];int main () {memset (HARSH,0,sizeof (HARSH));int n,m; scanf"%d%d", &n,&m);Forint i=0; I<n; ++i) {int tmp; scanf"%d", &tmp); ++HARSH[TMP]; }Forint i=0; i<1066; ++i) {if (harsh[i]==0" //this number does not continue; if (harsh[m-i]>0) {if (i==m-i && HARSH [I]<2) //these two numbers are the same time, but only one is available, also not continue ; printf ( "%d%d" I,m-i ); //has ruled out the possibility of output, the conditions are satisfied on the output return 0;} printf ( Span class= "string" >no solution"); return 0;}          

pat:1048. Find Coins (25) (hash table method) AC