悲催博士僧

关注

Educational Codeforces Round 103 (Rated for Div. 2)A

悲催博士僧

关注

阅读 134

2022-11-07


分n>k和n<k和n==k三种情况讨论

#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
if(n>k)
{
int mo=n%k;
int ans=n/k;
if(mo==0)
{
printf("1\n");
continue;
}
else
{
printf("2\n");
}
}
else if(n<k)
{
double ans=k*1.0/n*1.0;
if(ans!=(int)ans)
{
printf("%d\n",(int)ans+1);
}
else
{
printf("%d\n",(int)ans);
}
}
else
{
printf("1\n");
}
}
}


相关推荐

奋斗De奶爸

Educational Codeforces Round 103 (Rated for Div. 2)B. Inflation

奋斗De奶爸 74 0 0

小桥流水2016

Educational Codeforces Round 126 (Rated for Div. 2)

小桥流水2016 60 0 0

waaagh

Educational Codeforces Round 69 (Rated for Div. 2)

waaagh 101 0 0

芭芭蘑菇

Educational Codeforces Round 82 (Rated for Div. 2)

芭芭蘑菇 171 0 0

浮游图灵

Educational Codeforces Round 73 (Rated for Div. 2)

浮游图灵 92 0 0

陆公子521

Educational Codeforces Round 122 (Rated for Div. 2)

陆公子521 104 0 0

zidea

Educational Codeforces Round 123 (Rated for Div. 2)

zidea 88 0 0

菜头粿子园

Educational Codeforces Round 123 (Rated for Div. 2)(A~C)

菜头粿子园 70 0 0

看山远兮

Educational Codeforces Round 115 (Rated for Div. 2) D

看山远兮 57 0 0

嚯霍嚯

Educational Codeforces Round 122 (Rated for Div. 2) A ~ D

嚯霍嚯 76 0 0

精彩评论(0)

0 0 举报