CF 340A The Wall
2015-07-10 15:11
211 查看
题目链接:http://codeforces.com/problemset/problem/340/A
A. The Wall
time limit per test:1 second
memory limit per test:256 megabytes
input:standard input
output:standard output
Iahub and his friend Floyd have started painting a wall. Iahub is painting the wall red and Floyd is painting it pink. You can consider the wall being made of a very large number of bricks, numbered 1, 2, 3 and so on.
Iahub has the following scheme of painting: he skips x - 1 consecutive bricks, then he paints the x-th one. That is, he’ll paint bricks x, 2·x, 3·x and so on red. Similarly, Floyd skips y - 1 consecutive bricks, then he paints the y-th one. Hence he’ll paint bricks y, 2·y, 3·y and so on pink.
After painting the wall all day, the boys observed that some bricks are painted both red and pink. Iahub has a lucky number a and Floyd has a lucky number b. Boys wonder how many bricks numbered no less than a and no greater than b are painted both red and pink. This is exactly your task: compute and print the answer to the question.
Input
The input will have a single line containing four integers in this order: x, y, a, b. (1 ≤ x, y ≤ 1000, 1 ≤ a, b ≤ 2·109, a ≤ b).
Output
Output a single integer — the number of bricks numbered no less than a and no greater than b that are painted both red and pink.
Sample test(s)
Input
2 3 6 18
Output
3
Note
Let’s look at the bricks from a to b (a = 6, b = 18). The bricks colored in red are numbered 6, 8, 10, 12, 14, 16, 18. The bricks colored in pink are numbered 6, 9, 12, 15, 18. The bricks colored in both red and pink are numbered with 6, 12 and 18.
解题思路:求a到b内既能整除x,又能整除y的所有数的个数(包括a,b)
A. The Wall
time limit per test:1 second
memory limit per test:256 megabytes
input:standard input
output:standard output
Iahub and his friend Floyd have started painting a wall. Iahub is painting the wall red and Floyd is painting it pink. You can consider the wall being made of a very large number of bricks, numbered 1, 2, 3 and so on.
Iahub has the following scheme of painting: he skips x - 1 consecutive bricks, then he paints the x-th one. That is, he’ll paint bricks x, 2·x, 3·x and so on red. Similarly, Floyd skips y - 1 consecutive bricks, then he paints the y-th one. Hence he’ll paint bricks y, 2·y, 3·y and so on pink.
After painting the wall all day, the boys observed that some bricks are painted both red and pink. Iahub has a lucky number a and Floyd has a lucky number b. Boys wonder how many bricks numbered no less than a and no greater than b are painted both red and pink. This is exactly your task: compute and print the answer to the question.
Input
The input will have a single line containing four integers in this order: x, y, a, b. (1 ≤ x, y ≤ 1000, 1 ≤ a, b ≤ 2·109, a ≤ b).
Output
Output a single integer — the number of bricks numbered no less than a and no greater than b that are painted both red and pink.
Sample test(s)
Input
2 3 6 18
Output
3
Note
Let’s look at the bricks from a to b (a = 6, b = 18). The bricks colored in red are numbered 6, 8, 10, 12, 14, 16, 18. The bricks colored in pink are numbered 6, 9, 12, 15, 18. The bricks colored in both red and pink are numbered with 6, 12 and 18.
解题思路:求a到b内既能整除x,又能整除y的所有数的个数(包括a,b)
[code]#include<iostream> using namespace std; int f(int a ,int b) { int t ,x =a ,y =b; if(x <y) { t = x; x = y; y = t; } while(x % y!=0) { t = y; y = x % y; x = t; } return a * b /y; } int main() { int x ,y ,a ,b; while(cin>>x>>y>>a>>b) { int t= f(x ,y); int p; p =(a %t==0)? b/t-a/t+1 : b/t-a/t; cout <<p <<endl; } return 0; }
相关文章推荐
- 数据对齐
- C#流程控制语句
- C++学习网站总结[转]
- NYOJ5——Binary String Matching
- Android 开发新技术点评
- 悟空学Linux专栏----第19篇
- eclipse好用的快捷键
- 安装dlib python接口
- Hive去重复数据
- WCF技术剖析之二十四: ServiceDebugBehavior服务行为是如何实现异常的传播的?
- WCF技术剖析之二十三:服务实例(Service Instance)生命周期如何控制[下篇]
- golang版的crontab
- New Valid Tracking Metric Now Available in Seller Central
- Contains Duplicate
- ASIHTTPRequest-实现断点续传-2
- hdu1004字典树
- 创建自己的dll与lib:dll与lib文件的区别
- 股市 亏钱之道 十有九亏
- 应用服务器tomcat编码引起的JSP中汉字传到后台乱码问题
- 景深和焦距