poj-2551-ones
2016-03-15 21:10
316 查看
Description
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?
Input
Each line contains a number n.
Output
Output the number of digits.
Sample Input
Sample Output
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?
Input
Each line contains a number n.
Output
Output the number of digits.
Sample Input
3 7 9901
Sample Output
3 6 12 题目大意: 输入n,求出不能整除3和5,却能整除d并且这个数各位都是1; 111111111111%9901==0;
#include <iostream> #include <cstdio> using namespace std; int main() { int n; while(~scanf("%d",&n))//EOF { int cnt=1; int num=1; while(num%n) { num=(num*10+1)%n;//直接找由1构成的数,判断是不是n的倍数 cnt++; } printf("%d\n",cnt); } return 0; }
相关文章推荐
- C++中拷贝构造函数
- spark streaming的有状态例子
- 策略模式(headfirst设计模式学习笔记)
- 写在结婚纪念日
- react-native 调用原生模块详解
- 为Web开发者准备的10个最新工具
- 蓝桥杯 ALGO-8(线段树)
- UML 部署图 deployment diagram
- UML 构件图 component diagram
- Dalvik与ART
- poj2923(状态压缩dp)
- Android待机及延时网路关闭的修改
- 2016年3月14日作业
- RMAN之恢复服务器参数文件
- 字符流缓冲区的使用之BufferedWriter和BufferedReader
- 带缓存的输入输出流
- extjs 组件与布局
- ios基础(二)
- UML 状态图 statechart diagram
- 分布式Web应用----基于Socket+动态代理实现简单RPC 生产者消费者模型