알고리즘
2839 설탕배달 (구현)
ok4u
2018. 12. 31. 12:05
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
if(n%5==0){
printf("%d",n/5);
}else{
int num_5kg = n/5;
int num_3kg = 0;
for(int i=num_5kg; i>=0; i--){
if((n-5*i)%3==0){
num_5kg = i;
num_3kg = (n-5*i)/3;
break;
}
else{
num_5kg = -1;
}
}
printf("%d", num_5kg + num_3kg);
}
}