Search found 12 matches

by Charlla
Sun Dec 21, 2003 4:11 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7107

Problem 138 - Pell's Equation

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 ...
by Charlla
Fri Dec 19, 2003 5:08 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7107

138 - Understanding

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 property that ...
by Charlla
Sat Dec 13, 2003 5:46 am
Forum: Volume 2 (200-299)
Topic: 209 - Triangular Vertices
Replies: 51
Views: 6992

Problem 209 - Input Examples

Hy!


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

Thanks,

Charlla
by Charlla
Sat Dec 13, 2003 5:10 am
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

10198

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 "long ...
by Charlla
Fri Dec 05, 2003 3:41 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7107

Problem 138 - Pell's Formula

Hy!

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

Thanks,

Charlla :roll:
by Charlla
Thu Dec 04, 2003 12:26 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7107

Problem 138

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 :roll:
by Charlla
Sun Nov 30, 2003 3:17 pm
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

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...
by Charlla
Sun Nov 30, 2003 2:21 am
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

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 really huge Hope you un...
by Charlla
Sat Nov 29, 2003 3:44 pm
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

Hey!

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

Thanks,

Charla.
---------------------
sohel wrote:Simple!

Use big integer.

:wink:
by Charlla
Fri Nov 28, 2003 5:04 pm
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

Re: big nubmers

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...
by Charlla
Fri Nov 28, 2003 4:59 pm
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

The recurrence of 10198

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...
by Charlla
Mon Oct 13, 2003 1:44 am
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14326

10198 - Counting

I'm trying to solve the problem n

Go to advanced search