Tom has
N
N songs and he would like to record them into CDs. A single CD can contain at most
K
K songs. In addition, Tom is very superstitious and he believes the number 13
would bring bad luck, so he will never let a CD contain exactly
13
13 songs. Tom wants to use as few CDs as possible to record all these songs. Please help him.
There are T T test cases. The first line gives T T, number of test cases. T T lines follow, each contains N N and K K, number of songs Tom wants to record into CDs, and the maximum number of songs a single CD can contain.
1≤N≤1000,1≤K≤1000 1≤N≤1000,1≤K≤1000
For each test case, output the minimum number of CDs required, if the above constraints are satisfied.
2 5 2 13 13
3 2
If Tom has 5 5 songs to record and a single CD can contain up to 2 2 songs, Tom has to use 3 3 CDs at minimum, each contains 2 2, 2 2, 1 1 songs, respectively.
In the second case, Tom wants to record 13 13 songs, and a single CD can hold 13 13 songs at most. He would have been able to use only 1 1 CD if he were not so superstitious. However, since he will not record exactly 13 13 songs into a single CD, he has to use 2 2 CDs at least, the first contains 12 12 songs and the second contains one(Other solutions to achieve 2 2 CDs are possible, such as ( 11 11, 2 2), ( 10 10, 3 3), etc.).
题目大意:
把n首歌放到CD中,每个CD最多放k首歌,但是每个CD不能放13首,给出n和k求需要的CD数;
思路:k=13时,把k--;k<13时,相除看余数是否进一;k>13时,看余数是否为13,考虑n/k是否为0;
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#define max_n 10010
typedef long long LL;
using namespace std;
int main()
{
int t,n,k;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&k);
if(k==13)
{
k--;
if(n%k==0)
printf("%d\n",n/k);
else printf("%d\n",n/k+1);
}
else if(n==13 && n<k) //特殊考虑
printf("2\n");
else
{
if(n%k==0)
printf("%d\n",n/k);
else if(n%k==13)
{
if(k==14)
printf("%d\n",n/k+2);
else printf("%d\n",n/k+1);
}
else printf("%d\n",n/k+1);
}
}
return 0;
}