C :

#include <stdio.h>
int main(){
int n,x,c;
scanf("%d%d",&n,&x);    
c=(n*1000)/x;
if((n*1000)%x==0)
  printf("%d",c);
else 
  printf("%d",c+1);
}

C++ :

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n,x;
	cin>>n>>x;
	n = n * 1000;
	cout<<(int)ceil(n * 1.0 / x)<<endl;

	return 0;
}

Pascal :

var a,b,c:longint;
begin
read(a,b);
a:=a*1000;
if a mod b=0 then c:=a div b
             else c:=a div b+1;
             write(c);
             end.

Java :

import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int x = sc.nextInt();
		int s = 0;
		int l = 1000 * n;
		if(l % x == 0){
			s = l / x;
		}else{
			s = (l / x) + 1 ;
		}
		System.out.println(s);
	}
}	

Python :

n,m = map(int,input().split()) 
n=n*1000
if n%m==0:
    print(n//m)
else:
    print(n//m+1)