OJ Board

Hy! Thanks a lot. I'll try. Charlla :D ---------- you'll have to spot the pattern. There is a 2 parameter recursion I know that works, but I dunno why. Furthermore, you can look into pell's equation, you can transform the problem into pell's equation and use the algorithm for pell to do it. you can ...

Hy! I understood the relation 1 + 2 + ... + (n-1) = (n+1) + (n+2) + ... + ,m that you said. But, how can I "guess" that after 6, the next number should be 35? Thanks, Charlla :roll: ========== Hi! I can give you a hint if you want. You should find first 10 pairs of numbers n, m with a prop...

Hy!


Can anyone help me? I need some critical input examples for problem 209.

Thanks,

Charlla

Hy! Thanks a lot! Charlla. :) ------------- When you have a really big number, let's say 1000 digit, the only way to keep it is an array. Now, if you want add, subrtact, multiplay or divide such numbers you have to write alogithms of addition, subtraction... Such procedures/methods are called "...

Hy!

How can I generate the next pair of numbers using the Pell's Formula
(if it is possible, of course.)?

Thanks,

Charlla

Hy!


There are a relantionship between [6 , 8] and [35, 49]
? I tried to find but I didn't get it.

If I find it, I will generate the other numbers in a easy way.



Thanks,

Charla

Hy! Thanks, Charlla :) -------------------- Actually, C does not have any built in big integer. I mean, if there were, how big it would be, 1000 digit ,10000 digit or maybe even bigger. The idea is to store numbers in string form, that is store them in a char array . Then you will have to create fun...

Hi Dmytro_Chernysh, I didn't understand your message. What is "long arigfmetic"??? Thanks, Charlla :roll: Hi Charlla, You do have a mistake -- you should have used "long arigfmetic" instead of just long long. For example, n=30 1186714748389 Obviously, for n=1000 the number is rea...

Hey!

How can I represent this big integer in C???

Thanks,

Charla.
---------------------

sohel wrote:Simple!

Use big integer.

Hey, How can I solve this problem??? I mean, what can I do when, after k becomes 70-80, and the numbers become very big (being 64 bit )???? Thanks, Charla -------------- My code is: #include <stdio.h> #include <stdlib.h> #include <fcntl.h> #include<io.h> unsigned long vetor_T[1000]; int cont; void c...

Hy Dmytro_Chernysh, I would like to know if you got Accepted using this recurence: f[1]:=2; f[2]:=5; f[3]:=13; f[n]:=2*f[n-1]+f[n-2]+f[n-3]. I'm asking because I tried do use it, but I got WA. Maybe, I am having problems like ravingavin. The numbers became very big and their representation can be do...

I'm trying to solve the problem n