Codeforces Round #450 (Div. 2) B

最新推荐文章于 2020-11-08 20:40:27 发布

原创最新推荐文章于 2020-11-08 20:40:27 发布 · 275 阅读

0 ·

CC 4.0 BY-SA版权

codeforces 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种通过模拟除法过程来寻找特定数字在分数小数表示中首次出现位置的方法。给定分数a/b和目标数字c，算法将确定c在小数点后的位置，并在未找到时返回-1。

You have a fraction $\text{[math]}$ . You need to find the first occurrence of digit c into decimal notation of the fraction after decimal point.

Input

The first contains three single positive integers a, b, c (1 ≤ a < b ≤ 105, 0 ≤ c ≤ 9).

Output

Print position of the first occurrence of digit c into the fraction. Positions are numbered from 1 after decimal point. It there is no such position, print -1.

Examples

input
1 2 0

output
2

input
2 3 7

output
-1

Note

The fraction in the first example has the following decimal notation: $\text{[math]}$ . The first zero stands on second position.

The fraction in the second example has the following decimal notation: $\text{[math]}$ . There is no digit 7 in decimal notation of the fraction.

模拟一下除法

#include<bits/stdc++.h>
using namespace std;
int main(){
  int a,b,c;
  cin>>a>>b>>c;
  int k=0,i;
  for(int j=1;j<=100000;j++){
     if(a*10<b&&a!=0){
        i=0;
        a=a*10;
     }
     else{
         a=a*10;
         i=a/b;
         a=a%b;
     }
     //cout<<a<<" "<<i<<endl;
     if(i==c){
        cout<<j<<endl;
        return 0;
     }

  }
  cout<<"-1"<<endl;

  return 0;
}