PROGRAMMING CHALLENGE

This one should be difficult enough for you guys,

Write a function foo that takes a number n and returns a function that takes a number i, and returns n incremented by i.


My submission, in Scheme


(define (foo num)
  (lambda (x) (+ x num)))

>>6
>>11
int main()
{
    int (*my)(int) = foo(1);
    int (*mi)(int) = foo(2);
   
    printf(" my: %d \n mi: %d\n", my(0), mi(0));

    return 0;
}
my: 2
 mi: 2
EXPERT WINDOWS PROGRAMMERS