[Trial]Contest 1 - VB (.NET & Legacy) - Prime Numbers

Contest 1 - Prime Numbers
Please Note This Is A Trial Contest And Is A Basic Example :)

Before starting I recommend you take a look at the Faq located here

Language

VB (Legacy) and VB .NET (entries from the two languages will be judged seperatly)

Deadline

25\09\04 (25th September 2004) Noon (1200 Hours) (GMT) I will not accept entries after this date

After I\We have finished marking we will show you how I\we marked the entries and the scores each application recieved.

Main Aims

The aim of this contest is to design a program which generates the first 1000 prime numbers and displays them in a standard VB listbox. (Please note that 1 is excluded from being a prime number!). Please be aware that we only want one prime number per item in the listbox, So code like lstPrimes.AddItem Prime1 & " - " & Prime2 & " - " & ... will not be accepted. This is mainly to keep the contest fair and also to allow us to test the listbox is correct item by item instead of doing extra processing.

What Is A Prime Number?

'Any integer greater than 1 that is divisible only by 1 and itself'

How Is It To Be Marked?

Firstly I will make sure your code actually generates the first 1000 prime numbers and displays them into a standard VB listbox if it does not, it will be disqualified from the contest!

Primarily the application you submit will be tested on its speed (On my computer) to generate the first 1000 prime numbers and display them into a listbox!

If 2 sets of code run at the same speed then it will be down to the best designed code (Me and the moderator team will take a look) If no winner is decided from this the 2 contestents will take joint-1st place

What If My Code Has Problems?

If there are any compile errors with your code or it simply does not work, it will not be accepted into the contest (simply because I dont have the time to debug code as well as mark entries)

3rd Party Controls

We see no need for 3rd party controls to be used in this contest, if you find a reason why you would need one please PM me or one of the Admin team

What Do I Win?

The prize for first place is a custom name title for the period of 2 weeks so you can show your fellow VBForum members you have wona contest!

Where Do I Send My Work?

You just reply to the thread located here (waiting for mod to accept)

What Format Should My Work Be In?
It would be best if you could zip up your project using winzip or another similar program!

Source code only please i cannot accept exe's or any form of compiled code!

Final Note

Have fun please remember the aims of the contests are to have fun, also please note commented code is not required but prefered!

Pino, didn't you mjean the first 1000 primes rather than the primes up to 1000?

Am I supposed to see Martys post now....wasn't it supposed to be invisible? I though it should. If not...then everyone can steal code....:eek:

Maybe the attachments are invisible?

Quote:

---

Originally posted by NoteMe
Am I supposed to see Martys post now....wasn't it supposed to be invisible? I though it should. If not...then everyone can steal code....:eek:

---

I think only the posts made in the sub forum will be invisible, not this one.

Quote:

---

Posted by Danial
I think only the posts made in the sub forum will be invisible, not this one.

---

Thats the one, trust NoteMe to get confussed :D

I hadn't realised the forum was public now, has it been for long or just today?

Quote:

---

Originally posted by Electroman
Thats the one, trust NoteMe to get confussed :D

I hadn't realised the forum was public now, has it been for long or just today?

---

Brad made the change today.

1. Are we allowed to provide out own timing statistics (assuming we agree to have the method of which scrutinised)? This enables us to more accurately show you how fast our algorithms are.

2. My algorithm requires me to specify the first 2 primes (2 and 3) in order for the algorithm to work, is this legal and / or will i be required to generate 2 more primes to compensate?

Please reply promptly.

I'm taking this seriously :D Hope you guys have a strong alg, cos I have.

Plus, do we get points for originality and sexiness of coding technique?

My assumption is that if it isn't in the rules, then it is fair :D

I'm also assuming there *will* be points for sexiness of code and such.

Pino and Electroman; however, are running this so they are making the rules ;)

Brad!

Quote:

---

Originally posted by brad jones
My assumption is that if it isn't in the rules, then it is fair :D

I'm also assuming there *will* be points for sexiness of code and such.

Pino and Electroman; however, are running this so they are making the rules ;)

Brad!

---

[Monty Burns]Eeeeexcellent[/Monty burns]

By the way, I will be doing all of my coding while drunk, I expect favoritism for this. :lol:

Quote:

---

Originally posted by wossname

2. My algorithm requires me to specify the first 2 primes (2 and 3) in order for the algorithm to work, is this legal and / or will i be required to generate 2 more primes to compensate?

---

I was going to ask that next....after I got the rest of the answer, that I have not...:(....

do we have the same algorithm...;)....well BTW read an article on finding primes a year ago. An Indian guy found a new algo that was so good, and also so difficult that only a couple of the guys at MIT or what it is called in USA could follow his lecture...:D

And now I expect you want me to waste all my game time researching this mythical alg?

Dude, I didn't come down with the last service pack you know! :D

Nice try.

we will deal with all the timing, sure you can test it yourself, but i will set up a routine to time your apps

I will get back to you if it is allowed to use the first 2 prime numbers

yes you do get some marks for the presentaion and 'sexiness' of your code, allthough speed is the main concern :) but them few marks could be the differance between 1st and 2nd :)

Would we be able to know what the current fastest time submitted
is so we could have a target? Of course after you receive the first
project. :D

Also, it was the first 1000 Primes and not just Primes up to 1000.

Quote:

---

Originally posted by RobDog888
Would we be able to know what the current fastest time submitted
is so we could have a target? Of course after you receive the first
project. :D

---

What will that help? It is still two diffrent machines...and the speed will be very diffrent...

Ohhhh...one more Q....there is a large number of imperfect prime algorithms out there. Most of them will do the first 1000 primes perfect, but lets say they will add 649539 as a prime withch it is not because it is dividable by 3-3-3-3-3-3-3-3-3-3-11 , and it might skip an other one like 71202143 witch is a prime, but it will still do this test perfect. Will sutch an algorithm be allowed?

Should we count the number 1 as prime?

http://mathworld.wolfram.com/PrimeNumber.html

That states that it is neither prime nor composite.

Quote:

---

Originally posted by dsheller
Should we count the number 1 as prime?

http://mathworld.wolfram.com/PrimeNumber.html

That states that it is neither prime nor composite.

---

;)

Quote:

---

Main Aims

The aim of this contest is to design a program which generates the first 1000 prime numbers and displays them in a standard VB listbox. (Please note that 1 is excluded from being a prime number!)

---

Bah you can't expect me to read the main aims, the entire directive of the project can you. =)

it does this damn fast. Maybe we should do primes up to a bigger number. or did you mean the first 1000 primes instead?

Quote:

---

Originally posted by Acidic
it does this damn fast. Maybe we should do primes up to a bigger number. or did you mean the first 1000 primes instead?

---

Quote:

---

Main Aims

The aim of this contest is to design a program which generates the first 1000 prime numbers and displays them in a standard VB listbox. (Please note that 1 is excluded from being a prime number!)

---

:D::D:D:D:D:D

Hope no one thinks I am spamming now...but for a reference to everyone, here is a list over the first 1000primes, so you can check that your algorithm is right:

Quote:

---

2 3 5 7 11 13 17 19 23 29
31 37 41 43 47 53 59 61 67 71
73 79 83 89 97 101 103 107 109 113
127 131 137 139 149 151 157 163 167 173
179 181 191 193 197 199 211 223 227 229
233 239 241 251 257 263 269 271 277 281
283 293 307 311 313 317 331 337 347 349
353 359 367 373 379 383 389 397 401 409
419 421 431 433 439 443 449 457 461 463
467 479 487 491 499 503 509 521 523 541
547 557 563 569 571 577 587 593 599 601
607 613 617 619 631 641 643 647 653 659
661 673 677 683 691 701 709 719 727 733
739 743 751 757 761 769 773 787 797 809
811 821 823 827 829 839 853 857 859 863
877 881 883 887 907 911 919 929 937 941
947 953 967 971 977 983 991 997 1009 1013
1019 1021 1031 1033 1039 1049 1051 1061 1063 1069
1087 1091 1093 1097 1103 1109 1117 1123 1129 1151
1153 1163 1171 1181 1187 1193 1201 1213 1217 1223
1229 1231 1237 1249 1259 1277 1279 1283 1289 1291
1297 1301 1303 1307 1319 1321 1327 1361 1367 1373
1381 1399 1409 1423 1427 1429 1433 1439 1447 1451
1453 1459 1471 1481 1483 1487 1489 1493 1499 1511
1523 1531 1543 1549 1553 1559 1567 1571 1579 1583
1597 1601 1607 1609 1613 1619 1621 1627 1637 1657
1663 1667 1669 1693 1697 1699 1709 1721 1723 1733
1741 1747 1753 1759 1777 1783 1787 1789 1801 1811
1823 1831 1847 1861 1867 1871 1873 1877 1879 1889
1901 1907 1913 1931 1933 1949 1951 1973 1979 1987
1993 1997 1999 2003 2011 2017 2027 2029 2039 2053
2063 2069 2081 2083 2087 2089 2099 2111 2113 2129
2131 2137 2141 2143 2153 2161 2179 2203 2207 2213
2221 2237 2239 2243 2251 2267 2269 2273 2281 2287
2293 2297 2309 2311 2333 2339 2341 2347 2351 2357
2371 2377 2381 2383 2389 2393 2399 2411 2417 2423
2437 2441 2447 2459 2467 2473 2477 2503 2521 2531
2539 2543 2549 2551 2557 2579 2591 2593 2609 2617
2621 2633 2647 2657 2659 2663 2671 2677 2683 2687
2689 2693 2699 2707 2711 2713 2719 2729 2731 2741
2749 2753 2767 2777 2789 2791 2797 2801 2803 2819
2833 2837 2843 2851 2857 2861 2879 2887 2897 2903
2909 2917 2927 2939 2953 2957 2963 2969 2971 2999
3001 3011 3019 3023 3037 3041 3049 3061 3067 3079
3083 3089 3109 3119 3121 3137 3163 3167 3169 3181
3187 3191 3203 3209 3217 3221 3229 3251 3253 3257
3259 3271 3299 3301 3307 3313 3319 3323 3329 3331
3343 3347 3359 3361 3371 3373 3389 3391 3407 3413
3433 3449 3457 3461 3463 3467 3469 3491 3499 3511
3517 3527 3529 3533 3539 3541 3547 3557 3559 3571
3581 3583 3593 3607 3613 3617 3623 3631 3637 3643
3659 3671 3673 3677 3691 3697 3701 3709 3719 3727
3733 3739 3761 3767 3769 3779 3793 3797 3803 3821
3823 3833 3847 3851 3853 3863 3877 3881 3889 3907
3911 3917 3919 3923 3929 3931 3943 3947 3967 3989
4001 4003 4007 4013 4019 4021 4027 4049 4051 4057
4073 4079 4091 4093 4099 4111 4127 4129 4133 4139
4153 4157 4159 4177 4201 4211 4217 4219 4229 4231
4241 4243 4253 4259 4261 4271 4273 4283 4289 4297
4327 4337 4339 4349 4357 4363 4373 4391 4397 4409
4421 4423 4441 4447 4451 4457 4463 4481 4483 4493
4507 4513 4517 4519 4523 4547 4549 4561 4567 4583
4591 4597 4603 4621 4637 4639 4643 4649 4651 4657
4663 4673 4679 4691 4703 4721 4723 4729 4733 4751
4759 4783 4787 4789 4793 4799 4801 4813 4817 4831
4861 4871 4877 4889 4903 4909 4919 4931 4933 4937
4943 4951 4957 4967 4969 4973 4987 4993 4999 5003
5009 5011 5021 5023 5039 5051 5059 5077 5081 5087
5099 5101 5107 5113 5119 5147 5153 5167 5171 5179
5189 5197 5209 5227 5231 5233 5237 5261 5273 5279
5281 5297 5303 5309 5323 5333 5347 5351 5381 5387
5393 5399 5407 5413 5417 5419 5431 5437 5441 5443
5449 5471 5477 5479 5483 5501 5503 5507 5519 5521
5527 5531 5557 5563 5569 5573 5581 5591 5623 5639
5641 5647 5651 5653 5657 5659 5669 5683 5689 5693
5701 5711 5717 5737 5741 5743 5749 5779 5783 5791
5801 5807 5813 5821 5827 5839 5843 5849 5851 5857
5861 5867 5869 5879 5881 5897 5903 5923 5927 5939
5953 5981 5987 6007 6011 6029 6037 6043 6047 6053
6067 6073 6079 6089 6091 6101 6113 6121 6131 6133
6143 6151 6163 6173 6197 6199 6203 6211 6217 6221
6229 6247 6257 6263 6269 6271 6277 6287 6299 6301
6311 6317 6323 6329 6337 6343 6353 6359 6361 6367
6373 6379 6389 6397 6421 6427 6449 6451 6469 6473
6481 6491 6521 6529 6547 6551 6553 6563 6569 6571
6577 6581 6599 6607 6619 6637 6653 6659 6661 6673
6679 6689 6691 6701 6703 6709 6719 6733 6737 6761
6763 6779 6781 6791 6793 6803 6823 6827 6829 6833
6841 6857 6863 6869 6871 6883 6899 6907 6911 6917
6947 6949 6959 6961 6967 6971 6977 6983 6991 6997
7001 7013 7019 7027 7039 7043 7057 7069 7079 7103
7109 7121 7127 7129 7151 7159 7177 7187 7193 7207
7211 7213 7219 7229 7237 7243 7247 7253 7283 7297
7307 7309 7321 7331 7333 7349 7351 7369 7393 7411
7417 7433 7451 7457 7459 7477 7481 7487 7489 7499
7507 7517 7523 7529 7537 7541 7547 7549 7559 7561
7573 7577 7583 7589 7591 7603 7607 7621 7639 7643
7649 7669 7673 7681 7687 7691 7699 7703 7717 7723
7727 7741 7753 7757 7759 7789 7793 7817 7823 7829
7841 7853 7867 7873 7877 7879 7883 7901 7907 7919

---

Pino, do you mean the primes between 2 and 1000, or the first thousand primes. Those are two very different things.

Quote:

---

Originally posted by MartinLiss
Pino, do you mean the primes between 2 and 1000, or the first thousand primes. Those are two very different things.

---

Didn't you see he has edited the post...I have all ready higlighted it once...and I will do it again...:D

Quote:

---

Main Aims

The aim of this contest is to design a program which generates the first 1000 prime numbers and displays them in a standard VB listbox. (Please note that 1 is excluded from being a prime number!)

---

Are we allowed to assume that 7919 is the biggest of the primes we will find?

Not, I think we are. While not making perfect software you'll have filled all the criteria, which is what is needed.
So now to google for good ideas on improving this code.

Hehe well I got my code otpimized as much as I can.. wish I knew what other's speeds where.. lol I'd hate to submit mine only to discover I was three times slower than the winner... although I believe my speed is a descent speed for the job.

Er, how are you going to time the calculation. Because for the 1st 1000 primes, it's going to be so fast that I'm not sure the windows timer is going to be up for the job (unless you're going to test it on a slow machine). Maybe you should consider more than the 1st 1000.... just a thought.

Lots of questions here..:D Trying to bend the rules...;)


Are we allowed to asume that even numbers not are primes?

Quote:

---

Posted by NoteMe
Ohhhh...one more Q....there is a large number of imperfect prime algorithms out there. Most of them will do the first 1000 primes perfect, but lets say they will add 649539 as a prime withch it is not because it is dividable by 3-3-3-3-3-3-3-3-3-3-11 , and it might skip an other one like 71202143 witch is a prime, but it will still do this test perfect. Will sutch an algorithm be allowed?

---

Well I would have thought it was clear, thats why we said the first 1000, the algo must only work for the first 1000 after that who cares ;).

Quote:

---

Posted by NoteMe
Are we allowed to assume that even numbers not are primes?

---

Considering even numbers aren't prime :rolleyes:. The only thing we will be testing is the speed of the algo and the result is correct for the first 1000 primes.



BTW you may notice that the the contest is acceptign both VB.NET & VB6 so there should also be two winners because the speed of a VB.NET program and VB6 can't be compared fairly ;).

Quote:

---

Posted by RobDog888
Would we be able to know what the current fastest time submitted
is so we could have a target? Of course after you receive the first
project. :D

Also, it was the first 1000 Primes and not just Primes up to 1000.

---

None of the submitted projects will be viewed (by anyone) untill the closing date, and then all the entries will become visible to everyone while we judge.
Notice that this is due to change as we haven't fully decided if you will see the other entries as soon as the deadline is reached or will have to wait till we have judged them.

The times of every sample will be given at the end of it and will be tested on several different machines too. The VB6 & VB.NET ones may be tested on different machines to those aswell because like myself I only have VB6 & not VB.NET :(.

The GetTickCount() API should be suitable but if the length of time is below 100ms (or in that area) I suggest we chnage it to use the Performance Counter (if we don't use it anyway).

Quote:

---

Originally posted by Electroman

Considering even numbers aren't prime :rolleyes:. The only thing we will be testing is the speed of the algo and the result is correct for the first 1000 primes.

---

OK...have hardcoded the 1000 first primes into the listbox now....thanks and good bye...;)

Sexyness of code? What type of code 'turns you on'? Well commented? "l"s in front of longs? Really obsfucated code? (GOTO HEAVEN!)

Quote:

---

Originally posted by NoteMe
OK...have hardcoded the 1000 first primes into the listbox now....thanks and good bye...;)

---

NoteMe wins by being a cheater =)

Yea I think as a limitation we should limit the amount of hardcoded primes by saying it should be reasonable for the algorythm and no more than it requires. The other choice is limiting it to just two but I think this is more sensible.

BTW if your algorythm only works for the primes after the first 100 then you can't hardcode the first 100 you'll have to use two algorythms, the first to get the first 100 and if the other is faster you'll then want to make it switch over to the other one for the last 900 ;).

Quote:

---

Originally posted by Electroman

The GetTickCount() API should be suitable but if the length of time is below 100ms (or in that area) I suggest we chnage it to use the Performance Counter (if we don't use it anyway). [/B]

---

Thanks.

Sorry to add another question, but do you want us to include the timing code ourselves, and I'm assuming it's from when the user presses the Start button, or do you want it to start calculating in the load/sub_main event and display the results as soon as possible?

Quote:

---

Posted by alkatran
Sexyness of code? What type of code 'turns you on'? Well commented? "l"s in front of longs? Really obsfucated code? (GOTO HEAVEN!)

---

I dunno how that will work but myself I would recommend indenting your code (how much doesn't matter) but there is nothing I hate more than code that isn't indented. As for the hungarian notation I personally don't like it. I guess for appearance of code it will be marked by all the judges and then an average used.
I wouldn't down mark someone for using Hungarian notation but if they used silly names for the variables (e.g. BillyBob, SamFoo, NoteMe, Patato) then I would do though.

Saying that I don't even know if I will be judging this one, unsure if we decided that one yet :doh:. I guessed this one will be by the moderators and pino :DontQuoteMeOnThis:.

Quote:

---

Posted by Ex-FB
Thanks.

Sorry to add another question, but do you want us to include the timing code ourselves, and I'm assuming it's from when the user presses the Start button, or do you want it to start calculating in the load/sub_main event and display the results as soon as possible?

---

I think it'll be better if we add the timing code, that way it ensures its the same for every entry. If we create it as an extra module then it can be added and just a couple of lines in the submitted code will be it.

If we get this module made in time we could release it to you so you can't test yourselfs and find th optimium algo. Ofcourse the numbers are gonna be different for different machines but at least you'll be able to compare chnages you make to your own ;).

Quote:

---

Originally posted by Electroman
I dunno how that will work but myself I would recommend indenting your code (how much doesn't matter) but there is nothing I hate more than code that isn't indented. As for the hungarian notation I personally don't like it. I guess for appearance of code it will be marked by all the judges and then an average used.
I wouldn't down mark someone for using Hungarian notation but if they used silly names for the variables (e.g. BillyBob, SamFoo, NoteMe, Patato) then I would do though.

Saying that I don't even know if I will be judging this one, unsure if we decided that one yet :doh:. I guessed this one will be by the moderators and pino :DontQuoteMeOnThis:.

---

What if I do the opposite of indenting? You know, indenting the lines outside a loop? :afrog:

I'm including my own timing code, but it can be removed easily (only 3 lines, using gettickcount). Problem though, it doesn't always return the same value? Range from .47s to .58s, but I have things running. Will the timing tests be done multiple times, and the average taken?