by: Federico Babelis |
last post by:
Hi:
Any could help my find how to create the code for the following algorythm:
In1: 10000000
In2: 00000000000
the algorythm runs and this is the output:
01A6DC6B07262F69
|
by: Materialised |
last post by:
Hi Everyone,
I am having a few issues while attempting to use Kevin Easton's base64
encryption algorythm. (See
http://groups.google.com/groups?selm=ahr1ji%246v3%241%40tomato.pcug.org.au)
...
|
by: Justin Robbs |
last post by:
I need to fill a number of character fields with spaces or zero's
depending on the field. Which method is faster.
char var = " ";
var = '\0';
or
char var;
sprintf( var, " ...
|
by: Earl Teigrob |
last post by:
Does someone have or know of an algorythm (method) that will delete all
files under a give directory and its subdirectories based on a wildcard
mask?
I can use this for one directory
for each...
|
by: Andrés Giraldo |
last post by:
Hi!
I'm trying to use a System.Security.Criptography function, it works on
my machine but when I publish the site, it gives me the following error:
Can't find a cryptographic service provider...
|
by: Bruce H |
last post by:
Hello,
I want to encrypt files using symmetric cryptography.
There are 4 algorythms that the frame supports.
Anybody knows which is the fastest algorythm?
(big files)
TIA
|
by: Bruce H |
last post by:
Hello,
what of the 4 algorythms provided by the frame is the fastest?
(for encrypting large files)
Tia
|
by: plisho |
last post by:
Hello,
I'm writting a program in C++.
One part of my program is to compare two strings and as a result I have to have a number (range:0-1) which represents a similarity between those two strings....
|
by: PBJ |
last post by:
ok i have a project where we have an amount of 2 dollars and 19 cents. we are trying to use dollars quarters nickles dimes and pennies and we have to find the minimum number of all to give back...
|
by: whitep8 |
last post by:
Hi all,
Im very new to java and getting there slowly.
Im working on basic class functions. Im totally fine with get and set, storing objects into an array and recalling them, but im totally...
|
by: DolphinDB |
last post by:
Tired of spending countless mintues downsampling your data? Look no further!
In this article, you’ll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
|
by: isladogs |
last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM).
In this month's session, we are pleased to welcome back...
|
by: isladogs |
last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM).
In this month's session, we are pleased to welcome back...
|
by: Vimpel783 |
last post by:
Hello!
Guys, I found this code on the Internet, but I need to modify it a little. It works well, the problem is this: Data is sent from only one cell, in this case B5, but it is necessary that data...
|
by: jfyes |
last post by:
As a hardware engineer, after seeing that CEIWEI recently released a new tool for Modbus RTU Over TCP/UDP filtering and monitoring, I actively went to its official website to take a look. It turned...
|
by: ArrayDB |
last post by:
The error message I've encountered is; ERROR:root:Error generating model response: exception: access violation writing 0x0000000000005140, which seems to be indicative of an access violation...
|
by: CloudSolutions |
last post by:
Introduction:
For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
|
by: Shællîpôpï 09 |
last post by:
If u are using a keypad phone, how do u turn on JavaScript, to access features like WhatsApp, Facebook, Instagram....
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome former...
|