CodeForces597ADivisibility(数学)
来源:互联网 发布:暗影精灵3 新机优化 编辑:程序博客网 时间:2024/06/01 07:53
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
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<iostream>#include<stdio.h>#include<math.h>#include<algorithm>#include<string.h>using namespace std;int main(){long long i,k,a,b;while(scanf("%lld %lld %lld",&k,&a,&b)!=EOF){long long ans,l,o;l=abs(a/k);o=abs(b/k);if(a<=0&&b>=0){ans=o+l+1;}else if(a<0&&b<0){ans=l-abs((b+1)/k);}else {ans=abs(o-(a-1)/k);}printf("%lld\n",ans);}return 0;}
题意:给你一个区域,问这里面有多少个可以对k整除的数
思路:注意分情况讨论,三种情况。符号相同时注意对小数-1计算,因为小数可能也可以对该数整除。(这道题分类很重要,分错类了很容易出错)
0 0
- CodeForces597ADivisibility(数学)
- 使用数学运算(数学对象)
- 数学常数(Wikipedia)
- 数学分支(整理)
- 转(acm数学)
- POJ数学(ZZ)
- 计算数学(转)
- ACM数学(转)
- Feynman(数学)
- ACMer(数学,有意思)
- Equations(数学,水)
- HDOJ2045(组合数学)
- hdu 1061(数学)
- hdu 4153(数学)
- hdu 1403 (数学)
- hdu 1027(数学)
- hdu 1071 (数学)
- poj 1840 (数学)
- OC语言5—封装
- android ethernet 代码分析
- Android 获取可用内存大小
- C++ Primer 学习笔记之 --- 学习总结
- linux后台运行程序
- CodeForces597ADivisibility(数学)
- 【整理】html5知识点2
- Java 8 Lambda表达式
- Android byte[]转为对象
- 指向成员函数的指针
- 设计模式笔记:命令模式
- Android 对象转为byte
- UITableView设置快速索引字体颜色
- 【整理】html5知识点3