Mingming loves drinking water

describe

Obviously, he is a water crazy devil , He went to the convenience store to buy n A bottle of water , Each bottle of water m element . It is known that 3 An empty bottle can be changed into a bottle of water ,7 A bottle cap can also be changed into a bottle of water . Beg Mingming to drink a few bottles of water at most ？

Output

The maximum number of bottles changed .

sample input 1

3 2
3 3
3 10

sample output 1

0
1
4

#include<stdio.h>

int ps(int eb,int pg,int p){
    		// Find the function of the number of bottles that can be replaced by empty bottles and bottle caps 
	if(eb<3&&pg<7){
    			// Two requirements are not met , Exit loop 
		return p;
	}else{
    
		return ps(eb/3+eb%3+pg/7,pg/7+pg%7+eb/3,eb/3+pg/7+p);			// recursive  
// The number of empty bottles that can be exchanged =3 Change an empty bottle 1 A bottle of water + Replace the empty bottle with more water + The water from the bottle cap 
// The number of bottle caps that can be changed =7 A bottle cap for 1 A bottle of water + Change the bottle cap to get more water + Empty bottle of water  
	}
}

int main(){
    
	int m,n;
	int p;
	while(scanf("%d%d",&m,&n)!=EOF){
    
		if(m>n){
    
			p = 0;
		}
		else if(m==n){
    
			p = 1;
		}
		else{
    
			p = ps(n/m,n/m,0);		// The initial number of empty bottles and caps is n/m 
		}
		printf("%d\n",n/m+p);		// Buy water + Changed water 
	}
}