10127 - Ones

[Moni]

Code: Select all

#include<iostream.h>
#include<math.h>

int main()
{

unsigned long int n;

while(cin>>n)
{
	long double a=1;
	unsigned long int t=0;

	while(fmod(a,n)!=0)
	{
		a=(a*10)+1;
		t++;
	}

	cout << (t+1) << endl;
                n=0;
}

	return 0;
}

Hmm! I am tired what might be the answer without this !!!

[10153EN]

Hello, why do you think that a long double variable can store the value without overflow?

The answer may be of hundreds of digits actually.

[obayashi]

there's a simple solution;)

[Moni]

there's a simple solution;)

Can you present some of it's hints !!!

[Picard]

multiply as on paper (in school), but here you know the result digits

[Moni]

Can I use the basic rule of division ?
That is :

How many times you can subract one data from another and at the last subtraction you will get only zero, is the division.

What is you idea?

[obayashi]

do not think 2 much about the number of digits that requires storage.

just check the remainder and that will be ok.

this problem has just something to do with the remaider.

[Jalal]

U have made just a stupid mistake!!!!
try this

After a=(a*10)+1;
why like astupid dont wrote this
a=fmod(a,n);

#include<iostream.h>
#include<math.h>

int main()
{

unsigned long int n;

while(cin>>n)
{
long double a=1;
unsigned long int t=0;

while(fmod(a,n)!=0)
{
a=(a*10)+1;
a=fmod(a,n);
t++;
}

cout << (t+1) << endl;
n=0;
}

return 0;
}

[Maarten]

there's a simple solution;)

Does 'simple' mean O(1) solution? My solution is O(number of digits in result)

[neo_tohin]

Jalal bhai apna to er ekta stupid

Bhagsash upopado bhola gaachan

Moni, use this method

3 | 111 | 37
9
-----------------
21
21
--------------------
0


lala la la la

[jaywinyeah]

Why does that work? Why do we only need the remainder?

[Nishita]

Hello neo_tohin:

Could u tell me what is the "Bhagsash upopado". I want to know more about number theory.

Pease help me.

Nishita


Note: Please remove the code from board.

[Jalal]

neo_tohin!
its really nice to get a reply about 2 years later on a topic!
anyway i really never heard about Bhagsash upopado".
U should know I m not smart like u..............
wt is that plz. explain.......

[Navid666]

my code dont work for some input like 27 and i dont know what should i do to fix it???? :-/ please help me ... thanks

[Navid666]

the floor and ceil of one number is equal or differnce of them is one!!!
so when you compair last two digit it means you compair them...before this i compaired whole of them and got same answer!