【codeforces】数学
2016-08-23 20:53
344 查看
B - B 使用long long
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
597A
Description
Find the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer
values x that a ≤ x ≤ b and x is divisible
by k.
Input
The only line contains three space-separated integers k, a and b (1 ≤ k ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).
Output
Print the required number.
Sample Input
Input
Output
Input
Output
分类讨论,数据类型别搞错就行了
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
int main(){
LL k,a,b;
while(scanf("%lld%lld%lld",&k,&a,&b)!=EOF){
LL ans;
if(a>0&&b>0){
ans=b/k-(a-1)/k;
// printf("---\n");
}
else if(a<0&&b<0){
ans=abs(a)/k-abs(b+1)/k;
}
else{
ans=b/k+abs(a)/k+1;
}
printf("%lld\n",ans);
}
return 0;
}
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
597A
Description
Find the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer
values x that a ≤ x ≤ b and x is divisible
by k.
Input
The only line contains three space-separated integers k, a and b (1 ≤ k ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).
Output
Print the required number.
Sample Input
Input
1 1 10
Output
10
Input
2 -4 4
Output
5
分类讨论,数据类型别搞错就行了
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
int main(){
LL k,a,b;
while(scanf("%lld%lld%lld",&k,&a,&b)!=EOF){
LL ans;
if(a>0&&b>0){
ans=b/k-(a-1)/k;
// printf("---\n");
}
else if(a<0&&b<0){
ans=abs(a)/k-abs(b+1)/k;
}
else{
ans=b/k+abs(a)/k+1;
}
printf("%lld\n",ans);
}
return 0;
}
相关文章推荐
- Codeforces - 551D. GukiZ and Binary Operations - 数学+矩阵快速幂
- CodeForces 626B Cards(数学思维)
- CodeForces 707C Pythagorean Triples(数学 构造)
- CodeForces 630J:Divisibility 【数学】
- CodeForces 630F-Selection of Personnel【组合数学】
- CodeForces-630 B. Moore's Law【数学】
- Codeforces Codeforces Round #319 (Div. 2) C. Vasya and Petya's Game 数学
- Codeforces--596A--Wilbur and Swimming Pool(数学)
- 4000 CodeForces 810A Straight <<A>> 【数学】【模拟】
- Codeforces 336D Vasily the Bear and Beautiful Strings 组合数学
- CodeForces - 899D Shovel Sale 数学+思维
- CodeForces 382B Number Busters(数论-数学推理)
- codeforces 900D(组合数学+剪枝)
- codeforces 851C 数学
- CodeForces 123 C.Brackets(组合数学+dp)
- CodeForces 145 C.Lucky Subsequence(组合数学+dp)
- Codeforces_765_D. Artsem and Saunders_(数学)
- Codeforces 233B Non-square Equation (数学+思维)
- Codeforces 233B Non-square Equation(数学)
- Codeforces 57 C Array ——组合数学