This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
check_and_read(10, [] ,_):- | |
!. | |
check_and_read(13, [], _):- | |
!. | |
check_and_read(32, [], _):- | |
!. | |
check_and_read(end_of_file, [], _):- | |
!. | |
check_and_read(Char, [Char|Chars], Stream):- | |
get_code(Stream, NextChar), |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use strict; | |
use warnings; | |
## | |
# You are given 2 positive numbers $M and $N. | |
# Write a script to list all common factors of the given numbers. | |
## | |
sub factor{ | |
my($n) = @_; | |
my @factors = (1); | |
foreach my $j (2..sqrt($n)){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use strict; | |
use warnings; | |
## | |
# You are given 2 strings, $A and $B. | |
# Write a script to find out common base strings in $A and $B. | |
## | |
use boolean; | |
sub contains{ | |
my($s0) = @_; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <algorithm> | |
#include <vector> | |
/* | |
* You are given an unsorted list of integers @N. | |
* Write a script to find out the smallest positive number missing. | |
*/ | |
int least_missing(int n[]){ | |
std::sort (n, n + 4); | |
std::vector<int> numbers (n, n + 4); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
int count_bits(int n){ | |
int set_bits = 0; | |
for(int i = 1; i <= n; i++){ | |
int x = i; | |
while(x > 0){ | |
int b = x & 1; | |
set_bits += b; | |
x = x >> 1; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use strict; | |
use warnings; | |
## | |
# You are given an array @A containing distinct integers. | |
# Write a script to find all leader elements in the array @A. | |
# Print (0) if none found. | |
## | |
use boolean; | |
sub is_leader{ | |
my(@a) = @_; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use strict; | |
use warnings; | |
## | |
# You are given a positive integer $N. | |
# Write a script to find out all possible combination | |
# of Fibonacci Numbers required to get $N on addition. | |
# Repeated numbers are not allowed. Print 0 if none found. | |
## | |
sub nearest_fibonacci{ | |
my($n) = @_; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
primes([2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83 | |
,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179, | |
181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277, | |
281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389, | |
397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499, | |
503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617, | |
619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739, | |
743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859, | |
863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991, | |
997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
member(X,[X|_]). | |
member(X,[_|T]) :- member(X,T). | |
coins([1,2,4]). | |
sum(Coins):- | |
sum([], Coins, 0). | |
sum(Coins, Coins, 6). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
number_column-label(X, L):- | |
number_column-label(X, "", L). | |
number_column-label(0, L, L). | |
number_column-label(X, C, L):- | |
(X > 26) -> | |
string_concat(C, "A", CAlpha), | |
number_column-label(X - 26, CAlpha, L); | |
M is rem(X, 26), | |
N is X - 26, | |
max_list([N, 0], X0), |
NewerOlder