C :

#include<stdio.h>

int main()
{
	int b,i,k;
	char a[1001];
	while(scanf("%s%d",a,&b)!=EOF)
	{
		for(k=i=0;a[i]!='\0';i++)
			k=(k*10%b+(a[i]-'0')%b)%b;
		printf("%d\n",k);
	}
	return 0;
}

C++ :

#include<stdio.h>

int main()
{
	int b,i,k;
	char a[1001];
	while(scanf("%s%d",a,&b)!=EOF)
	{
		for(k=i=0;a[i]!='\0';i++)
			k=(k*10%b+(a[i]-'0')%b)%b;
		printf("%d\n",k);
	}
	return 0;
}

Pascal :

var
 st,st1:ansistring;
 a:array[1..1001] of longint;
 i,b,p:longint;
begin
 while not eof do begin
  readln(st);
  p:=pos(' ',st);
  for i:=1 to 1001 do a[i]:=0;
  b:=0;
  for i:=1 to p-1 do val(st[i],a[i]);
  st1:='';
  for i:=p+1 to length(st) do st1:=st1+st[i];
  val(st1,b);
  for i:=1 to p-2 do a[i+1]:=a[i+1]+(a[i] mod b)*10;
  writeln(a[p-1] mod b);
 end;
end.

Java :

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {
	public static void main(String[] args){
		Scanner sf=new Scanner(System.in);
		BigInteger a,b;
		while(sf.hasNext()){
			a=sf.nextBigInteger();
			b=sf.nextBigInteger();
			a=a.mod(b);
			System.out.println(a);
		}
	}
}

Python :

while True:
    a,b=raw_input().split(' ')
    print(int(a)%int(b))