lotabout

#include <stdio.h>


int multi(char *a, int len, int b)
{
    int i;
    int carry = 0;
    for (i = 0; i < len; i++) {
        int tmp = (a[i] - '0') * b + carry;
        a[i] = tmp % 10 + '0';

lotabout

#include <stdio.h>
#include <string.h>
#include <malloc.h>


int *build_next(const char *pat, int pat_len)
{ int i;
    int *next = (int *)malloc(pat_len * sizeof(*next));

    next[0] = -1;

lotabout

#include <stdio.h>
#include <malloc.h>
#include <string.h>

/* two solution:
 * 1. function "perm"
 * 2. function "print_permutation"
 */

void swap(int data[], int a, int b)

lotabout

package demo;

import java.util.ArrayList;
import java.util.List;

public class demo {

	static List<String> cout(List<String> one,String str){
		
		List<String> t = new ArrayList<String>();

lotabout

magic :: Int -> Int -> [Int]
	magic 0 _ = []
	magic m n = m : (magic n (m+n))

	getIt :: [Int] -> Int -> Int
	getIt [] _ = 0
	getIt (x:xs) 1 = x
	getIt (x:xs) n = getIt xs (n-1)