|
Sorry, I don't understand what you mean.
|
|
|
|
|
You need to define the requirements properly, then employ a developer to write the code for you instead of looking for free solutions on here.
|
|
|
|
|
Hello, please I want to know the alogarithm for the huawei new algo unlcok code for modems. I want to make an offline calculator.
Thank you in advance.
|
|
|
|
|
Wrong place, we do not assist in hacking.
|
|
|
|
|
Oops! I don't really think this is hacking. This is something which is not ilegal because if you ask operators for the unlock code, they will give you but sometimes they want you to use their service for a long time and they will delay your time. Perhaps, I want to start with modem and later learn the ones for phones that are shipped outside their country of operation since some of these phones come to my country and some become useless because the relatives of those who shipped the phones have no knowledge of this.
Thank you.
|
|
|
|
|
It's still hacking; you are trying to find a way round the legal option.
|
|
|
|
|
Unlocking with any means is not ilegal. Please check your laws and the meaning of hacking and compare them if they have a link. There is a calculator for that but it is online and I want to do this to help people who do not have internet connectivity always get the chance of calculating unlock codes.
Please understand this is not for my own selfish need. I just want to put my programming skills into use by helping those people. Unlocking is neither ilegal nor hacking.
Thanks anyway.
|
|
|
|
|
You need to contact the manufacturer and ask them for the algorithm. You can then write a program to generate unlock codes based on that information.
|
|
|
|
|
Thank you for your suggestion but I don't really think they are going to give out that. If so, they are going to ask me for product details or question to verify I have bought from them which I don't have because when I use their products, I buy them from retailers who are not accredited dealers. Buddy, if you know this just help me out if you don't know too let me know.
Thank you.
|
|
|
|
|
MatGwet wrote: I don't really think they are going to give out that.
Probably for a good reason.
|
|
|
|
|
MatGwet wrote: I don't really think they are going to give out that. If so, they are going to ask me for product details or question to verify I have bought from them which I don't have because when I use their products, I buy them from retailers who are not accredited dealers
Whilst what you're doing might not be illegal (depending on your local laws), you do know that it is wrong and unethical. You're more likely to get answers to these kinds of questions on forums that are geared towards the lesser-ethical such as cracking forums and so on.
|
|
|
|
|
how to find the keyword relevance between two images using aggregate markov chain. plz help
|
|
|
|
|
|
Hi,
I'm looking to buid a program that works like a dating site and that matches you with the best options available for you. They usually show the results starting from the closest and then expanding the research larger and larger.
I'm doing my project in the US and Canada for my 1st test.
I'm woundering how can I set this up to be the smartest way possible.
Is it IP location, Latitude and Longitude, city....???
Do I need a complete database with all the distances between all the citites in the US and Canada?
Or maybe instead of a database with the cities, regroup the cities by urban Areas to make the matrix smaller?
I've been trying to work with a programmer and he says that to do what they do we would need a big computing power that for a little project can't be possible.
I'M confused and decided to come here for some help and see what you find coder have to say about all this.
Thank you for you help
|
|
|
|
|
Member 11406585 wrote: I've been trying to work with a programmer and he says that to do what they do we would need a big computing power that for a little project can't be possible
Not based on your description.
Basic steps
- Determine a location. Ask them or attempt a service look up for IP (ask is probably better.)
- Then use a zip code location match to find a geo location for the zip code.
- Then 'draw' a box around the zip code - maybe based on user input miles from location.
- Then do a database geo look up to find others based on whether they are in the box or not.
More complex stuff than that happens on my personal development box every day.
For that matter you could just based it on zip code.
|
|
|
|
|
For the record, when a dating site is trying to find the "closest match to you" they don't mean geographically! They mean in terms of interests, morals, religion etc etc etc .
Don't you watch the adverts? I'm of a certain age, anti-social, spit a lot and like walking on sand ... my closest match is a Camel
|
|
|
|
|
You'll need the lat and long of every zip code in the US\Canada\whatever. Where you get that data? I don't know, will it be free? Perhaps not. But that's beside the point.
If a user does a 10 mile search and their zip code is 1234 you find the lat\long of that zip, work out how much extra lat\long you add for 10 miles in all directions (you'll find the maths to convert lat\long to miles on-line if you search) and you search for users where the lat\long falls within this 10 mile "square" (eg if the user is at lat long 0,0 you search for users where the lat is between -10 and +10, and the long is between -10 and +10). That will give you all results in a 10 mile "square" around the user, but you *really* need a circle, not a square. You can leave the results as they are knowing some will be a little long, or you can do another set of processing on the initial results that fell within the "box" to eliminate the ones that are outside the 10 mile circle. You find this out using Pythagoras' theorem (again on-line if you need to search). Loop through every result and for each result calculate the "crow flies" distance between the two users using Pythagoras, and if that distance is > 10 remove it from the result set. If you want to show the exact distance between the user and the found user you'll need Pythagoras' theorem anyway. Doing this search as a two-step process will allow you to quickly eliminate most results using a standard, fast SQL query, and you then fine-tune the results in your code on that reduced result set.
|
|
|
|
|
Following function represents Sakamoto's Algorithm from Wikipedia page- http://en.wikipedia.org/wiki/Determination_of_the_day_of_the_week
int dow(int y, int m, int d) {
static int t[] = {0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4};
y -= m < 3;
return (y + y/4 - y/100 + y/400 + t[m-1] + d) % 7;
}
i do not understand how does the algorithm work? especially, the t[] array.
|
|
|
|
|
The t array holds constants for each month, so the day can be calculated based on some recurring pattern of days within months. A look at the calendar should show you what this pattern is. The calculation using year, month and day yields some value, which is then divided by 7, giving the day of the week in the range [0-6].
|
|
|
|
|
Hi, I would be very glad if someone can help me with algorithm to solve following task.
We have a convoy of cars that are lined up in a row and must cross the bridge. Cars can´t overtake each other.
The bridge has limited capacity, which may not be exceeded.
Find the algorithm, which divides cars into groups so that the entire convoy cross the bridge in the shortest time.
Another group is allowed to enter only when the entire previous group cross the bridge.
Weight and speed of each car is known. The speed of group is determined by the slowest of car in the group.
Sample data:
Input
Output
Thank you for your help, Petr
|
|
|
|
|
I see some homework but I don't see a real question, except perhaps to do the homework.
|
|
|
|
|
I can´t find the algorithm to solve this thing, so I ask if someone can help me..
I thought about it, but I didn´t find the solution.
|
|
|
|
|
We don't have ready made algorithms for each problem. You could try and come up with your own; keep adding cars to the current group until you reach a threshold - be it number of cars or total weight, if either one is reached, send the group.
Then find the slowest car in that group; that's the speed of that group.
For the fastest way of the group, you'd try to move as much slow vehicles together as possible.
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
Member 11345380 wrote: I can´t find the algorithm to solve this thing
However that looks exactly like what the homework is - to find the algorithm. Thus giving it to you would be doing the homework.
If you had an algorithm that you wanted others to review that would be a different matter.
|
|
|
|
|
hello guys. I'm newbies here since my friends promote to this forum.
can i know how to check 16 number of parity bits.
how to check the 16th parity bits?
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
