package Max_Min;

import java.util.*;

public class beak_달팽이는올라가고싶다 {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int a = sc.nextInt();
		int b = sc.nextInt();
		int v = sc.nextInt();
		
		int num = 0;	double day = 0;
		day = (v-b)/ (a-b);

		if((v-b)%(a-b) !=0)
			day++;
		
		System.out.println(day);
        
//      int num = 0;	
//		while(num <v) {
//			day++;
//			
//			num = num + a;
//			if(num >= v)
//				break;
//			
//			num = num - b;
//		}
        
	}
}

package Dfs_Bfs;

import java.util.*;

public class beak_유기농배추 {
	
	static int dx[] = {0,0,1,-1};
	static int dy[] = {1,-1,0,0};
	
	public static void dfs(int arr[][], int i, int j) {
		arr[i][j] = 0; // 방문한 것으로 바꿈
		
		for(int k=0;k<4; k++) {
			int nowi = i + dx[k];
			int nowj = j + dy[k];
			
			if(nowi>=0 && nowi<arr.length && nowj>=0 && nowj<arr[0].length && arr[nowi][nowj] == 1) {
				dfs(arr,nowi,nowj);
			}
			
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int t = sc.nextInt();
		
		for(int tt=0;tt<t;tt++) {
			int m = sc.nextInt();
			int n = sc.nextInt();
			int k = sc.nextInt();
			int answer = 0;
			
			int arr[][] = new int[m][n];
			
			for(int i=0; i<k; i++) {
				arr[sc.nextInt()][sc.nextInt()] = 1;
			}
					
			for(int i=0;i<m; i++) {
				for(int j=0;j<n;j++) {
					if(arr[i][j] == 1) {
						dfs(arr,i,j);
						answer++;
					}
				}
			}

			System.out.println(answer);
		}
		
	}
	
}

package Dfs_Bfs;

import java.util.*;

public class beak_미로탐색 {

	static class Pos{
		int x;
		int y;
		int count = 0;
		
		Pos(int x,int y,int count){
			this.x = x;
			this.y = y;
			this.count = count;
		}
	}
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int m = sc.nextInt();
		
		int arr[][] = new int[n+1][m+1];
		
		for(int i=1;i<n+1; i++) {
			String a = sc.next();
			String s[] = a.split("");
			for(int j=1;j<m+1;j++)
				arr[i][j] = Integer.parseInt(String.valueOf(a.charAt(j-1)));
		}
		
		Queue<Pos> qu = new LinkedList<Pos>();
		int dx[] = {0, 0, 1,-1};
		int dy[] = {1,-1, 0, 0};
		

		qu.add(new Pos(1,1,1));
		arr[1][1] = 0;

		int answer = 0;
		
		while(!qu.isEmpty()) {
			Pos now = qu.poll();
			int x = now.x;
			int y = now.y;
			
			
			if(x == n && y == m){
				answer = now.count;
				break;
			}

			for(int k=0; k<4; k++) {
				int xx = x + dx[k];
				int yy = y + dy[k];
				if(xx>0 && xx<n+1 && yy>0 && yy<m+1 && arr[xx][yy] == 1) {
					qu.add(new Pos(xx,yy,now.count+1));
					arr[xx][yy] = 0;
				}
			}//for
		}//while
		
		System.out.println(answer);
	}
	
}

package Dfs_Bfs;

import java.util.*;

class Pos{
	int x;
	int y;
	
	Pos(int x,int y){
		this.x = x;
		this.y = y;
	}
}

public class beak_단지번호붙이기 {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int arr[][] = new int[n+1][n+1];
		
		for(int i=1;i<n+1; i++) {
			String a = sc.next();
			String aa[] = a.split("");
			for(int j=1;j<n+1; j++)
				arr[i][j] = Integer.parseInt(String.valueOf(aa[j-1]));
		}
		
		Queue<Pos> qu = new LinkedList<Pos>();
		ArrayList<Integer> list = new ArrayList<Integer>();
		int dx[] = {-1, 0, 0, 1};
		int dy[] = { 0,-1, 1, 0};
		
		//겹치는 부분이 없을테니까 1을 0으로 만들어서 0인부분은 방문 안하는걸로 처리한다.
		for(int i=1; i<n+1; i++) {
			for(int j=1; j<n+1; j++) {
				//한번 만나면 다 돌떄까지 bfs -> 나와서 다시 다른 1찾는다.. 반복
				if(arr[i][j] == 1) {
					qu.offer(new Pos(i,j));
					arr[i][j] = 0;
					int answer = 0;
					
					while(!qu.isEmpty()) {
						Pos now = qu.poll(); //넣을 때 말고 poll할때 집의 수 하나찍 check & answer++
						answer++;
						
						for(int k=0;k<4;k++) {
							int new_x = now.x + dx[k];
							int new_y = now.y + dy[k];
							
							if(new_x >0 && new_x<n+1 && new_y >0 && new_y<n+1 && arr[new_x][new_y] == 1) {
								qu.add(new Pos(new_x, new_y));
								arr[new_x][new_y] = 0;
							}
						}
						
					}
					
					list.add(answer);
				}
			}//-in for
		}//-out for
		
		list.sort(null);
		System.out.println(list.size());
		for(int i=0;i<list.size();i++) {
			System.out.println(list.get(i));
		}
		
	}
}

	static public void dfs(int arr[][], boolean check[], int idx) {
		check[idx] = true;
		
		for(int i=1;i<arr.length; i++) {
			if(arr[idx][i] == 1 && check[i]==false)
				dfs(arr,check,i);
		}
	}
	
    static public int solution(int n, int[][] computers) {
    	int arr[][] = new int [n+1][n+1];
    	int answer = 0;
    	
    	for(int i=0; i<n; i++) {
    		for(int j=0; j<n; j++) {
    			if(computers[i][j] == 1) {
    				arr[i+1][j+1] = 1;
    				arr[j+1][i+1] = 1;
    			}
    		}
    	}
    	
    	boolean check[] = new boolean[n+1];
    	
    	for(int i=1; i<check.length; i++) { // 이 부분 생각해 내는게 포인트!
    		if(check[i] == false) {//돌고 나올때 마다 연결돼있는 부분 true로 만들어주니까
    			dfs(arr,check,i);	
    			answer++; // 돌고 나왔다는거는 연결된 덩어리가 1개 존재한다는 뜻!
    		}
    	}
    	
    	return answer;
    }