C :

#include<stdio.h>
void main()
{
	int m,n,h,i=1;
	scanf("%d%d%d",&m,&n,&h);
	while(h>0){
		h-=m;
		if(h>0){
			i++;
			h+=n;
		}else{
			break;	
		}	
	}					
	printf("%d",i);							 
} 

C++ :

#include<iostream>
using namespace std;

int main(){
	int m,n,h,i,j;
	cin>>m>>n>>h;
	i=0;
	j=0; 
	while(true){
		i=i+m;
		j++;
		
		if(i>=h){
			break;
		}
		
		i=i-n;
	}
	
	cout<<j<<endl;	
}

Pascal :

var a,b,c,s,p:longint;
begin
  s:=0;
  p:=0;
  read(a,b,c);
  while s<c do
   begin
    s:=s+a;
    if s>=c then break;
    s:=s-b;
    inc(p);
   end;
  writeln(p+1);
end.

Java :

import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		String[] strArray=new Scanner(System.in).nextLine().split(" ");
		int m=Integer.valueOf(strArray[0]);
		int n=Integer.valueOf(strArray[1]);
		int h=Integer.valueOf(strArray[2]);
		for(int i=1;i<=200;i++){
			if((m-n)*i>=h-m){
				System.out.println(i+1);
				break;
			}
		}
	}
}

Python :

m, n, h = map(int,input().split());
d = 1
s = 0
while s <= h:
    s = d*(m-n) 
    if s < (h-m):
        d += 1
    elif s >= (h-m):
        print(d+1) 
        break;