• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 23:17
CEST 05:17
KST 12:17
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
[ASL22] Finals Preview: Sweet Victory!9[ASL22] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11[ASL22] Ro16 Preview: Holy Diver5
Community News
[$1250] International ShieldBattery League14Weekly Cups (October 5-11): Farewell to 5.0.162Rollback Netcode in Brood War1165.0.17 Patch Notes - October 7, 202624Weekly Cups Results (Sep 28-Oct 4)0
StarCraft 2
General
Server Blocker How do you feel about the mass reverts in the 5.0.17 PTR? Team Liquid Map Contest #22: Results and Winners SCII needs to put more weight on strategy and tact Stellar Fest 2 Replay Pack
Tourneys
Sparkling Tuna Cup - Weekly Open Tournament Master Swan Open (Global Bronze-Master 2) $3,500 WardiTV Not-Summer Championship Stellar Fest TWO the Moon (Dec 16-20) ISSL (IntoTheTV x SOOP SC2 League): Premier
Strategy
[H] ZvP Mid-Late Game: Stalkers Collossi HT
Custom Maps
[G] How to playtest arcade maps [A] Nemrods 1/4 players [M] (2) Sweltering Sands [M] (2) Frigid Storage
External Content
The PondCast: SC2 News & Results Mutation # 547 Temple Of Terror Mutation # 546 Catch the Train Mutation # 545 And Drops and Rifts
Brood War
General
[Recap] Hive ZvZ in MonstarZ vs Dreams [ASL22] Finals Preview: Sweet Victory! Rollback Netcode in Brood War [Megathread] Daily Funny Videos Bot on ladder
Tourneys
[ASL22] Grand Finals [$1250] International ShieldBattery League 2v2v2v2 Tournament Small VOD Thread 2.0
Strategy
Cliff Jump Revisited (1 in a 1000 strategy) Simple Questions, Simple Answers Replay Review Process - What do you do?
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Dawn of War IV General RTS Discussion Thread Warcraft III: The Frozen Throne
Dota 2
Dota 2 Champions League Season 3 Begins April 25!
League of Legends
[TL LoL EUW IHs] Teemo shall perish
Heroes of the Storm
Heroes of the Storm 2.0
Hearthstone
Deck construction bug
TL Mafia
TL Mafia Community Thread
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread Artificial Intelligence Thread The Chess Thread Things Aren’t Peaceful in Palestine
Fan Clubs
Serral Fan Club
Media & Entertainment
[Manga] One Piece Movie Discussion! Diablo Animated Series on Netflix
Sports
MLB/Baseball 2023 Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
Recent Gifted Posts
Blogs
The Link Between Gaming and …
TrAiDoS
[ASL22] Ro4 Day1 Ticket Giv…
bITt.mAN
38 yo Retired SWE loo…
PurE)Rabbit-SF
Can Bots Beat Pros?? Starcr…
namkraft
[meme] I finally understa…
LUCKY_NOOB
Customize Sidebar...

Website Feedback

Closed Threads



Active: 7327 users

The Big Programming Thread - Page 177

Forum Index > General Forum
Post a Reply
Prev 1 175 176 177 178 179 1032 Next
Thread Rules
1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution.
2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20)
3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible.
4. Use [code] tags to format code blocks.
white_horse
Profile Joined July 2010
1019 Posts
October 16 2012 01:31 GMT
#3521
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}


The program keeps outputting 9 and 15 as prime numbers. I can understand why they are both outputted (they both satisfy the conditions in the if statement) but I don't know how to check that they are not prime.
Translator
NeMeSiS3
Profile Blog Joined February 2012
Canada2972 Posts
Last Edited: 2012-10-16 01:55:49
October 16 2012 01:43 GMT
#3522
On October 15 2012 14:49 mmp wrote:
Try not to post full solutions to problems that are for classes.

It was a practice exam, not for my course (I took it today so it was a bit late, felt like I did good!) but yeah I've made note to ask for people not to post entire answers if I ask for help before. Sorry in advance if it came out that way.

On October 15 2012 14:59 Blisse wrote:
Show nested quote +
On October 15 2012 14:35 Amnesty wrote:
Derp posted too soon..
Anyway, i just made this last night for someone else so it seemed fitting to post it here since the disscussion about primes.
Finds primes from 2-4 million well under a second.
+ Show Spoiler +


#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <ctime>
#include <chrono>
#include <ppl.h>
#include <concurrent_vector.h>
int main()
{
std::chrono::time_point<std::chrono::system_clock> TimeStart;
std::chrono::time_point<std::chrono::system_clock> TimeEnd;

concurrency::concurrent_vector<int> primes;
primes.push_back(2);

TimeStart = std::chrono::system_clock::now();

int Start = 3;
int Stop = 4000000;
int Step = 2;

// Comment out the multi-threaded version and uncomment the single threaded version to see the difference
/// Multi-Threaded version
Concurrency::parallel_for(Start,Stop, Step, [&primes](int n)
{
auto prime = true;
int stop = sqrt(n);

for(auto j=2;j<stop;j++)
{
if(n%j==0)
{
prime = false;
break;
}
}

if(prime)
primes.push_back(n);
});

TimeEnd = std::chrono::system_clock::now();
auto millis = std::chrono::duration_cast<std::chrono::milliseconds>(TimeEnd-TimeStart).count();
auto seconds = std::chrono::duration_cast<std::chrono::seconds>(TimeEnd-TimeStart).count();
std::cout << "Milliseconds : "<< millis << std::endl;
std::cout << "Seconds : "<< seconds << std::endl;
return 0;
}


If this actually runs in less than a second, whoa, nice! I will save this somewhere XD

Show nested quote +
On October 15 2012 14:49 mmp wrote:
Try not to post full solutions to problems that are for classes.


He said it was for midterm studying so I thought it was okay.


I guess it could be that I'm lying and perhaps we can't go on trust but I like to think that we're acting in some form of mutual trust that we can rely that we're not cheating. For instance why would I cheat to get 10% mark on my end of the year but have no idea what I'm doing on my 60% final.

I can see his concern though, but I was definitely just studying and thank you by the way.
FoTG fighting!
mmp
Profile Blog Joined April 2009
United States2130 Posts
Last Edited: 2012-10-16 01:54:09
October 16 2012 01:45 GMT
#3523
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}


The program keeps outputting 9 and 15 as prime numbers. I can understand why they are both outputted (they both satisfy the conditions in the if statement) but I don't know how to check that they are not prime.


Okay, so walk through it for 9:


for (int j = 2; j <= 3; j++) {
if ((9 % j != 0) && (9 % 2 != 0)) {
... 9 is prime
}
}


j = 2: 9 % 2 != 0, 9 % 2 != 0, so it's prime
j = 3: 9 % 3 == 0, 9 % 2 != 0, so it's not prime

What went wrong?




Similarly, for 81, I bet it outputs "81 is prime" ... once, twice... two times, when 81 isn't prime at all!
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
white_horse
Profile Joined July 2010
1019 Posts
October 16 2012 01:54 GMT
#3524
well the program starts with 2, which screws up the whole thing, making 9 satisfy all the conditions so that its a "prime" number. If the program started with 3, everything would be ok.
Translator
JeanLuc
Profile Joined September 2010
Canada377 Posts
October 16 2012 02:00 GMT
#3525
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}


The program keeps outputting 9 and 15 as prime numbers. I can understand why they are both outputted (they both satisfy the conditions in the if statement) but I don't know how to check that they are not prime.


Well you are saying in that if condition that if there is a remainder for i % j for ANY value of j and its not an even number,
it is prime. Whereas, it should only be counted as prime if it meets that condition for EVERY value of j in the inner for loop. I hope you see what I mean. You could create a boolean/integer variable called isprime that you set to true before the beginning of the inner for loop. Then if anywhere in that for loop (i%j) divides evenly (with a remainder of 0) set isprime to false, and early exit the loop. Then after the inner for loop you can see if isprime is still true or not. If it is, print prime, otherwise print not prime.
If you can't find it within yourself to stand up and tell the truth-- you don't deserve to wear that uniform
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 16 2012 02:04 GMT
#3526
On October 16 2012 10:54 white_horse wrote:
well the program starts with 2, which screws up the whole thing, making 9 satisfy all the conditions so that its a "prime" number. If the program started with 3, everything would be ok.

That's fine for 9, but not 81. There is a flaw in your solution that can only be fixed by revising your solution strategy.

See JeanLuc's comment.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 16 2012 02:10 GMT
#3527
On October 16 2012 11:00 JeanLuc wrote:
Show nested quote +
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}


The program keeps outputting 9 and 15 as prime numbers. I can understand why they are both outputted (they both satisfy the conditions in the if statement) but I don't know how to check that they are not prime.


Well you are saying in that if condition that if there is a remainder for i % j for ANY value of j and its not an even number,
it is prime. Whereas, it should only be counted as prime if it meets that condition for EVERY value of j in the inner for loop. I hope you see what I mean. You could create a boolean/integer variable called isprime that you set to true before the beginning of the inner for loop. Then if anywhere in that for loop (i%j) divides evenly (with a remainder of 0) set isprime to false, and early exit the loop. Then after the inner for loop you can see if isprime is still true or not. If it is, print prime, otherwise print not prime.

If you don't like 'break' statements, you can also write an isprime? function that returns false early in the loop as soon as it knows the number is not a prime. So in the case of 9, you don't know that 9 isn't a prime until you get to j = 3, because 3 divides 9. As soon as you see this, you can stop iterating.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
Kich
Profile Joined April 2011
United States339 Posts
Last Edited: 2012-10-16 02:17:50
October 16 2012 02:16 GMT
#3528
On October 15 2012 10:56 white_horse wrote:
Ok guys I have this project where if I input two numbers anywhere between 4 and 1 million, the program outputs all the prime numbers between the two.

Well I got close to it but the program outputs but its really weird still....can you guys help me......

The professor talked about using square root function but I have no idea how.

Here is the computational part:



a is lower limit and b is upper limit.

for (int i = a; i <= b; i++)
{
for (int j = 2; j*j <= i; j++)
{
if (i%2 != 0)
{
cout << i << " is prime" << endl;
}
}


Try thinking about how Prime Numbers work--what are their qualities? Besides two, they are never even, and they are only divisible by themselves and one. That's going to be the premise of your loop.

The other interesting quality of prime numbers in programming is that generally, the only real way to determine them is to just grind it out--you have to do it iteratively.

So try something like this:

for (int i = A; i <= B; i++) {
boolean isPrime = true;
for (int k = 4; k < i; k++) {
if (k % i == 0) {
isPrime = false;
break;
}
}
if (isPrime == true) {
cout << i << " is prime" << endl;
}
}


What happens here is that "i" starts at A and iterates upward towards B. For each i, iterate from A to i (through k) and mod i. If k % i is ever 0, it means that k divides evenly into i, which means that i is not prime. When you exit the second loop, check to see if the number is still considered prime--if it wasn't prime it won't be. When you begin the loop again this check is reset back to true.

Note that you terminate the loop when k is equal to i, you don't want to do k % i when k == i, because if k == i and isPrime is still true then...hey, it's prime.

I recently had to do something similar when applying for me job, not quite this simple but, similar.
Kich
Profile Joined April 2011
United States339 Posts
October 16 2012 02:17 GMT
#3529
On October 16 2012 11:10 mmp wrote:
Show nested quote +
On October 16 2012 11:00 JeanLuc wrote:
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}


The program keeps outputting 9 and 15 as prime numbers. I can understand why they are both outputted (they both satisfy the conditions in the if statement) but I don't know how to check that they are not prime.


Well you are saying in that if condition that if there is a remainder for i % j for ANY value of j and its not an even number,
it is prime. Whereas, it should only be counted as prime if it meets that condition for EVERY value of j in the inner for loop. I hope you see what I mean. You could create a boolean/integer variable called isprime that you set to true before the beginning of the inner for loop. Then if anywhere in that for loop (i%j) divides evenly (with a remainder of 0) set isprime to false, and early exit the loop. Then after the inner for loop you can see if isprime is still true or not. If it is, print prime, otherwise print not prime.

If you don't like 'break' statements, you can also write an isprime? function that returns false early in the loop as soon as it knows the number is not a prime. So in the case of 9, you don't know that 9 isn't a prime until you get to j = 3, because 3 divides 9. As soon as you see this, you can stop iterating.



This is true, I would personally put a break in my loop to immediately terminate the second loop in the if statement. I knew I left something out.
frogmelter
Profile Blog Joined April 2009
United States971 Posts
Last Edited: 2012-10-16 06:11:25
October 16 2012 06:08 GMT
#3530
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}



Look up the Sieve of Eratosthenes

This is perfect for what you want
TL+ Member
Deleted User 101379
Profile Blog Joined August 2010
4849 Posts
October 16 2012 06:30 GMT
#3531
On October 16 2012 15:08 frogmelter wrote:
Show nested quote +
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}



Look up the Sieve of Eratosthenes

This is perfect for what you want


I don't agree, it would be overkill and make the solution more complex than neccessary. The simple brute-force method is more than enough for this case considering the highest number that can be entered is just 1 million.
rethos
Profile Joined April 2010
Romania103 Posts
October 16 2012 08:49 GMT
#3532
On October 16 2012 15:30 Morfildur wrote:
Show nested quote +
On October 16 2012 15:08 frogmelter wrote:
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}



Look up the Sieve of Eratosthenes

This is perfect for what you want


I don't agree, it would be overkill and make the solution more complex than neccessary. The simple brute-force method is more than enough for this case considering the highest number that can be entered is just 1 million.


Yes but the initial problem was (if I understood right) printing all prime numbers in a range. In that case printing all primes in range 2..1mil would actually take too much time with the brute force approach.
Flash is a beast... And we love it this way
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 16 2012 09:24 GMT
#3533
On October 16 2012 17:49 rethos wrote:
Show nested quote +
On October 16 2012 15:30 Morfildur wrote:
On October 16 2012 15:08 frogmelter wrote:
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}



Look up the Sieve of Eratosthenes

This is perfect for what you want


I don't agree, it would be overkill and make the solution more complex than neccessary. The simple brute-force method is more than enough for this case considering the highest number that can be entered is just 1 million.


Yes but the initial problem was (if I understood right) printing all prime numbers in a range. In that case printing all primes in range 2..1mil would actually take too much time with the brute force approach.

It's fine. It takes a couple of seconds if you use sqrt, a couple of minutes otherwise.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
Kich
Profile Joined April 2011
United States339 Posts
October 16 2012 23:52 GMT
#3534
On October 16 2012 17:49 rethos wrote:
Show nested quote +
On October 16 2012 15:30 Morfildur wrote:
On October 16 2012 15:08 frogmelter wrote:
On October 16 2012 10:31 white_horse wrote:
I think this is better


for (int i = b; i <= a; i++)
{
for (int j = 2; j <= sqrt(i); j++)
{
if ((i%j != 0) && (i%2 != 0))
{
cout << i << " is prime" << endl;
}
}
}



Look up the Sieve of Eratosthenes

This is perfect for what you want


I don't agree, it would be overkill and make the solution more complex than neccessary. The simple brute-force method is more than enough for this case considering the highest number that can be entered is just 1 million.


Yes but the initial problem was (if I understood right) printing all prime numbers in a range. In that case printing all primes in range 2..1mil would actually take too much time with the brute force approach.


Not really, slight optimizations can be made to drastically improve performance. I made slight errors in my loop, for instance--it shouldn't iterate through every number between 4 and 1 million, it should iterate through every odd number from 5 to 1 million (4 isn't a prime number), cutting the number of iterations in half (even numbers aren't prime except for 2). Breaking the moment you see a lack of primeness also improves performance of the brute force method.

If your computer isn't from the 60's, it can do basic arithmetic pretty quickly. In fact, the only numbers that may take awhile to print are numbers that are actually prime themselves, a lack of primeness will be determined very, very shortly if the number isn't prime.

for (int i = A; i <= B; i++) {
boolean isPrime = true;
for (int k = 4; k < i; k+2) {
if (k % i == 0) {
isPrime = false;
break;
}
}
if (isPrime == true) {
cout << i << " is prime" << endl;
}
}


We're talking about a freshman or sophomore level program here, this thing doesn't have to be optimized or operate at log(n) speed. I don't think he's being asked to cache all the prime numbers between 4 and 1 million and then print out values greater than i. On the flip side if you want to be awesome you could execute the loop to store all the prime numbers between 4-1,000,000 in an array (sorted least to greatest) and then given a number N perform a binary search and print out all the values greater than N. That would be logN. And boss.

Programming is awesome.

Blisse
Profile Blog Joined July 2010
Canada3710 Posts
Last Edited: 2012-10-17 01:18:38
October 17 2012 00:26 GMT
#3535
+ Show Spoiler +
Don't even need to do a binary search, representing the primes as a bitset of size 1,000,001 can print in N time. :D

In any case, generating the prime numbers is the only hard part. Shouldn't just give him the answer though, so I would hide that code.
There is no one like you in the universe.
Kich
Profile Joined April 2011
United States339 Posts
October 17 2012 00:51 GMT
#3536
On October 17 2012 09:26 Blisse wrote:
Don't even need to do a binary search, representing the primes as a bitset of size 1,000,001 can print in N time. :D

In any case, generating the prime numbers is the only hard part. Shouldn't just give him the answer though, so I would hide that code.


N time is pretty undesirable.
Blisse
Profile Blog Joined July 2010
Canada3710 Posts
Last Edited: 2012-10-17 01:19:09
October 17 2012 01:18 GMT
#3537
Sorry, I thought O(n) was better than O(logn) for some reason.

Oh, confused with O(nlogn). ~__~
There is no one like you in the universe.
Snuggles
Profile Blog Joined May 2010
United States1865 Posts
October 17 2012 15:36 GMT
#3538
For some reason my school decided to switch languages for my intro CS course, so instead of learning C++ we're starting out with Python. Then later on in the second semester of the intro course we get into C++ and Java. Any idea why they would do that? I would think that just jumping into C++ and Java would seem more beneficial. My father's friend is a software Architect of some sort and when I told him that I wanted to get into the technical side of things, I should devote time to learning Java @_@.

I really wish that I settled down and decided to go with CS as my minor right from the get go because writing up a program to solve stats or any homework that has to deal with math would've made life so much easier...
Freaky[x]
Profile Blog Joined August 2005
Canada995 Posts
October 17 2012 20:17 GMT
#3539
for the prime generation, efficient prime number generation algorithms can be used. Just look at this website. It will give you a good understanding of what and how you should do to generate prime numbers efficiently (it takes you step by step). It's a very guide to understanding where you can make adjustments in your algorithm to speed up the process.

I didn't really read what he was asking, but all I saw was that he wanted to generate primes, so I thought of that (sorry if off-topic).
Kambing
Profile Joined May 2010
United States1176 Posts
October 17 2012 21:11 GMT
#3540
On October 18 2012 00:36 Snuggles wrote:
For some reason my school decided to switch languages for my intro CS course, so instead of learning C++ we're starting out with Python. Then later on in the second semester of the intro course we get into C++ and Java. Any idea why they would do that? I would think that just jumping into C++ and Java would seem more beneficial. My father's friend is a software Architect of some sort and when I told him that I wanted to get into the technical side of things, I should devote time to learning Java @_@.

I really wish that I settled down and decided to go with CS as my minor right from the get go because writing up a program to solve stats or any homework that has to deal with math would've made life so much easier...


Python is far more friendly to new programmers than Java and C++. Among other things, you can emphasize good programming fundamentals in a simpler language like Python without having to also get bogged down in too many unnecessary details like with Java and C++.
Prev 1 175 176 177 178 179 1032 Next
Please log in or register to reply.
Live Events Refresh
Korean StarCraft League
12:00
KSL Week 92
davetesta40
Liquipedia
PSISTORM Gaming Misc
09:00
FSL draft
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
RuFF_SC2 241
ProTech122
PiLiPiLi 22
StarCraft: Brood War
Rain 875
Icarus 7
Dota 2
monkeys_forever535
NeuroSwarm217
febbydoto32
Counter-Strike
Fnx 1256
taco 518
Super Smash Bros
C9.Mang0322
Other Games
summit1g6892
JimRising 554
WinterStarcraft447
ViBE178
Livibee160
Organizations
Other Games
gamesdonequick876
[ Show 14 non-featured ]
StarCraft 2
• Sammyuel 26
• EnkiAlexander 10
• Nickrosys8
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• Azhi_Dahaki13
• Pr0nogo 5
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Other Games
• Shiphtur304
Upcoming Events
Afreeca Starleague
2h 43m
Rush vs Soulkey
CranKy Ducklings
6h 43m
WardiTV Invitational
7h 43m
AI Arena Tournament
12h 43m
BSL Open Qualifier
15h 43m
Sparkling Tuna Cup
1d 6h
OSC
1d 9h
IPSL
1d 12h
BSL Open Qualifier
1d 15h
WardiTV Weekly
2 days
[ Show More ]
IntoTheTV X SOOP
3 days
PiGosaur Cup
3 days
The PondCast
4 days
Kung Fu Cup
4 days
IntoTheTV X SOOP
5 days
Liquipedia Results

Completed

Super Anchor Qualifying S3
Blizzard Classic Cup 2026
Copium Cup

Ongoing

ASL Season 22
Acropolis #5
KCM Race Survival 2026 Season 4
Acropolis #5 - GSC
HCC Season 3
Thunderpick World Champ. '26
ESL Pro League Season 24
Stake Ranked Episode 4
1win Private Club #1
Logitech G Play Connect 2026
SL StarSeries Fall 2026
FISSURE Playground #3
BLAST Open Fall 2026
Esports World Cup 2026

Upcoming

BSL Season 23
SC4ALL II: Brood War
BSL 23: Non-Korean Championship
HSC XXX
Stellar Fest 2: Lunar Cup
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
eXTREMESLAND 2026
PGL Major Singapore 2026
Stake Ranked Episode 6
BLAST Rivals Fall 2026
IEM Beijing 2026
Stake Ranked Episode 5
PGL Masters Bucharest 2026
eXTREMESLAND '26: SEA 4th Place
1win Private Club #2
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2026 TLnet. All Rights Reserved.