K

Google is the common platform of all to search for the information and it is easy. But it is very difficult to find the exact information in a less time. So there some trick to search your thing in GOOGLE. Do not search by writing a question in the google search box,instead always think for its answer and try to search for its possible answer's phrases. Use site: in front of the related site you are searching for that will only search the pages of that sites. example: site:kantipur.com, this will search your phrases in this site only Use " " to find for the exact phrase inside it. eg: "cricket scores" , looks for the cricket scores  Use -  to exclude the term from the search. eg: "cricket score"-IPL, means cricket score of all matches but not of IPL. Use ~ to search for the relating field.eg:"cricket score"~college this will look of the universities and higher education Use .. in between to get the result within that period of

We have the following constraint:           S      E      N      D      +  M     O      R      E                                           M     O      N      E      Y the value assigned to each alphabets differs from each other. -Solution: This code is written in visual prolog and the output is at the end of this code. DOMAINS  int_list=integer* PREDICATES solution(int_list) member(integer,int_list) CLAUSES solution ([]). solution ([S,E,N,D,M,O,R,Y]):- C4=1, member(C1,[0,1]), member(C2,[0,1]), member(C3,[0,1]), member(S,[0,1,2,3,4,5,6,7,8,9]), member(E,[0,1,2,3,4,5,6,7,8,9]), member(N,[0,1,2,3,4,5,6,7,8,9]), member(D,[0,1,2,3,4,5,6,7,8,9]), member(M,[0,1,2,3,4,5,6,7,8,9]), member(O,[0,1,2,3,4,5,6,7,8,9]), member(R,[0,1,2,3,4,5,6,7,8,9]), member(Y,[0,1,2,3,4,5,6,7,8,9]), S<>E,S<>N,S<>D,S<>M,S<>O,S<>R,S<>Y, E<>N,E<>D,E<>M,E<>O,E<>R,E<>Y, N<>D,N<>M,N<>

PREDICATES hcf(integer,integer,integer) CLAUSES hcf(X, Y, G) :- X = Y, G = X. hcf(X, Y, G) :- X < Y, Y1= Y-X, hcf(X, Y1, G). hcf(X, Y, G) :- X > Y, hcf(Y, X, G). GOAL hcf(17,19,G).