CF 340A The Wall
来源:互联网 发布:广场舞网络一线牵 编辑:程序博客网 时间:2024/05/17 07:10
题目链接: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)
#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;}
- CF 340A The Wall
- CF DIV.2 A. The Wall
- codeforces 340 A. The Wall
- CodeForces 340A The Wall
- Codeforces-340A-The Wall
- A. The Wall
- Codeforces Round #198 (Div. 2) / 340A The Wall (数论)
- cf 398B. Painting The Wall【期望dp】
- 快速幂+费马小定理 690D2 - The Wall (medium)CF
- Cf 406 A. The Monster
- 做一只墙上的苍蝇(a fly on the wall)
- |||A Patio Propane Wall Heater is the Way to Go_2622
- Codeforces Round #198 (Div. 2) A. The Wall
- Codeforces Round #198(Div. 2)A. The Wall
- CF - 266A - Stones on the Table
- cf 193 div2 A. Down the Hatch!
- cf——A. The Great Game
- cf——A. Down the Hatch!
- Hive去重复数据
- 用 union 将 单链表 模块化
- 安装dlib python接口
- 数据对齐
- Python函数式编程
- CF 340A The Wall
- 模拟新浪微博随便看看
- JSP——EL表达式
- 算法六:floyd-warshall和dijkstra
- 完美解决Android SDK Manager无法更新
- php调用webservice的几种方法
- Enea公司----OSE/OSEck RTOS
- 云端开源⾼性能技术架构调研分析报告
- 关于zabbix agent安装配置的一些心得