• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 03:16
CEST 09:16
KST 16:16
  • 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] Ro24 Preview: Siren's Call8[ASL22] Ro24 Preview: Summer's End9Serral wins HomeStory Cup 2915Serral wins Maestros of the Game 244ByuL, and the Limitations of Standard Play3
Community News
Stellar Fest TWO the Moon (Dec 16-20)8Weekly Cups (August 24-30): Patches' balance mod takes over2New 3v3 BGH Ladder (and more) on ShieldBattery!39Weekly Cups (August 17-23): Zerg dominate the week6Weekly Cups (August 10-16): SHIN doubles3
StarCraft 2
General
SC4ALL II: SC2 Player Announcement 6/8 - Maru Weekly Cups (August 10-16): SHIN doubles Weekly Cups (August 24-30): Patches' balance mod takes over How would you feel about frequent/monthly balance patches for SC2? Weekly Cups (August 17-23): Zerg dominate the week
Tourneys
Stellar Fest TWO the Moon (Dec 16-20) 2026 GSTL Announcement PIG STY FESTIVAL 8.0! (13 - 23 August) Sparkling Tuna Cup - Weekly Open Tournament IntoTheTV X SOOP SC2 League : Weekly & Monthly
Strategy
[G] Having the right mentality to improve
Custom Maps
Nexus Wars 2021 GUIDE [M] (2) Industrial Park
External Content
Mutation # 541 Binary Choice The PondCast: SC2 News & Results Mutation # 540 Dodge This Mutation # 539 Thunder Dome
Brood War
General
Which box art did your first copy of StarCraft 1 have? New 3v3 BGH Ladder (and more) on ShieldBattery! ASL22 General Discussion [Personal Project Share] Terran Defense v0.60 BW General Discussion
Tourneys
BSL LAN Party - Kraków 29-30 August - OPEN SIGNUPS [ASL22] Ro24 Group F [Megathread] Daily Proleagues Small VOD Thread 2.0
Strategy
Replay Review Process - What do you do? Game Theory for Starcraft Odyssey Mineral Stack Saturation Fighting Spirit mining rates
Other Games
General Games
Stratus: Battle for the sky now on steam Early acc General RTS Discussion Thread Nintendo Switch Thread Stormgate/Frost Giant Megathread Anyone here play Quakeworld back in the day?
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
[TL LoL EUW IHs] Teemo shall perish TSM pausing esports and CLG Dead
Heroes of the Storm
Heroes of the Storm 2.0
Hearthstone
Deck construction bug
TL Mafia
TL Mafia Power Rank TL Mafia Community Thread NeO.D_StephenKing vs This Guy From 1 Million Dance
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread Things Aren’t Peaceful in Palestine Canadian Politics Mega-thread European Politico-economics QA Mega-thread
Fan Clubs
MarineLorD Fan Club The Creator Fan Club The ShoWTimE Fan Club
Media & Entertainment
Movie Discussion! Anime Discussion Thread
Sports
Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023 MLB/Baseball 2023 NBA General Discussion
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Northern Ireland Global Starcraft
Blogs
Regacy Esports: The Bh…
regacyesports
Violent Games and Crime Rate…
TrAiDoS
LOCKPICKING NOOB
LUCKY_NOOB
Cathedral Of CS And NY pizza a…
FuDDx
Please support my new stand…
Peanutsc
Customize Sidebar...

Website Feedback

Closed Threads



Active: 4906 users

The Big Programming Thread - Page 176

Forum Index > General Forum
Post a Reply
Prev 1 174 175 176 177 178 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.
lolmlg
Profile Joined November 2011
619 Posts
October 15 2012 02:08 GMT
#3501
Did you mean to test i % j, white_horse?
white_horse
Profile Joined July 2010
1019 Posts
Last Edited: 2012-10-15 02:43:25
October 15 2012 02:42 GMT
#3502
On October 15 2012 11:08 lolmlg wrote:
Did you mean to test i % j, white_horse?


Yeah. The first code I put up was really bad. It was my first try. I worked on it after I put a post, and I have something like this now:


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;
}
}
}


But its still weird. Can somebody help me -_______________- thank you very much
Translator
lolmlg
Profile Joined November 2011
619 Posts
October 15 2012 02:59 GMT
#3503
Two things. First, as the value of sqrt(i) doesn't change within your inner loop, you don't need to compute it over and over again. You can compute it once and use that value for the second loop, right?

Second, you need to think a little bit more about the test you want to use to check for primality. When j is equal to 2, 15 % 2 != 0 and 15 % 2 != 0. Is 15 prime?
mmp
Profile Blog Joined April 2009
United States2130 Posts
Last Edited: 2012-10-15 04:05:03
October 15 2012 04:01 GMT
#3504
I would structure the program up into functions:

int is_prime(unsigned number) {
... is the number prime?
}

for /* number in low to high */ {
if (is_prime(number)) {
...
}
}


The use of a square root function saves you time, because consider any factor of a number N, call it a. Its cofactor, b, (a * b == N), is such that a <= sqrt(N) or b <= sqrt(N), but not both. Does that make sense?

So when you're looking for all of the factors of a number N, you can iterate up to sqrt(N), checking a < sqrt(N), and its cofactor b = N/a. This is faster than iterating all the way to N.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 15 2012 04:07 GMT
#3505
If you want to be really pro, you can use Fermat's Probable Prime method, and load a table of Carmichael numbers (numbers that resist Fermat's theorem) under one million. This method is usually provided in BigNumber libraries.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
Cambium
Profile Blog Joined June 2004
United States16368 Posts
Last Edited: 2012-10-15 04:14:19
October 15 2012 04:14 GMT
#3506
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;
}
}



But its still weird. Can somebody help me -_______________- thank you very much


Have you heard of this?

http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

This is basically a textbook problem asking to be solved with Sieve of Eratosthenes. You just use the bigger number, then loop through the values between the two and output the ones that are true.
When you want something, all the universe conspires in helping you to achieve it.
Cambium
Profile Blog Joined June 2004
United States16368 Posts
Last Edited: 2012-10-15 05:35:05
October 15 2012 04:23 GMT
#3507
The only 'solution' i can think of that involves an sqrt is creating a function that returns whether a number is prime:


private static boolean isPrime(final int x){
if( y < 2 )
return false;
if( y == 2 )
return true;
if( y % 2 == 0 )
return false;
int t = sqrt(x);
for(int i = 3; i < t; i+=2 ) // you don't need to worry about other evens
if( x % i == 0 )
return false;
return true;
}


You then call it with the range of the two numbers you are given, which makes this horribly inefficient.
When you want something, all the universe conspires in helping you to achieve it.
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 15 2012 04:38 GMT
#3508
Eratosthenes' Sieve is good for getting primes up to a number that isn't too large, but less good for random primality tests (compare O(NloglogN) vs O(sqrt(N)). Fermat's test is constant time, with the caveat that you need to repeat the test for greater confidence, you need to except known Carmichaels, and you need to keep in mind the density of Carmichael numbers for big numbers.

In practice, big prime factorization (cryptographic standard) is done using sieve techniques.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
mmp
Profile Blog Joined April 2009
United States2130 Posts
October 15 2012 04:43 GMT
#3509
For white_horse's concerns, the naive method is probably good enough.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
DeltaX
Profile Joined August 2011
United States287 Posts
October 15 2012 05:14 GMT
#3510
On October 15 2012 10:54 NeMeSiS3 wrote:
gah help!!!!

I have my midterm tmr and I've been stressing all night going over previous notes but I'm stuck, this is a previous midterm. (the other questions I got relatively easy)

+ Show Spoiler +
A company sells auto insurance has hired you to write a Java program to help with this.

You decide to begin by writing two java classes. First, you must write a class that can be used to represent the diriver of an automobile; you decide to call that class "Driver" (not to be confused with a "test" driver). For each Driver, you need to know their name and their age.
When a Driver object is first created you must always record their name and their current age.

Provide accessor methods for both Driver attributes. Also provide a mutator method to record the fact that the driver has just had a birthday ( i.e. they are now one year older).

You must also create and automobile class. This class will be used to represent and automobile that is insured by your client's company. For each automobile we need to record the model year (e.g. 2005), and name of the manufacturer(e.g. General Motors). We also need to know who will be the primary driver for the automobile. Include three (and only three) instance variables in the automobile class.

A constructor method should be provided for the automobile class; the constructor willl accept three parameters and use them to inialize the instance variables.

You do NOT need to write the accessor and mutator methods for each instance variable in the automobile class, and you do NOT need to include a toString() method.

However, you do need to provide one accessor method that will calculate and retrieve the insurance amount for the automobile. The base amount that your client's company charges for auto insurance is $900. However, for older automobiles the cost is higher; specifically, for an automobile with a model year prior to 2002 they charge an extra $50. Driver age is also a factor, if the primary driver is under 25 years of age, the company charges an additional $200.

You DO NOT need a test driver program.


I have no idea how to approach the automobile class. Here's what I got so far.

DRIVER
+ Show Spoiler +

public class driver
{      private String name;
      private int age;

      public driver(String nameIn, int ageIn)
       {       name = nameIn;
            age = ageIn;
       }

      public String getName()
      {       return name;
      }      

      public int getAge()
      {       return age;
      }

      public void setAGE(int age)
      { age = age++;
      }



}


AUTOMOBILE
+ Show Spoiler +

public class Automobile {
      private int model;
      private String manufacturer;

      public Automobile(int modelIn, String manufacturerIn)
      {       model = modelIn;
      manufacturer = manufacturerIn;
      }
}


First off I would say your driver class is pretty close, but
age = age++;
should prolly be
age = age + 1;
or just
age++;
(I was actually not sure if what you had would work or not, so I tried it and it didn't)

For your automobile class, it needs 3 (and only 3) instance variables, but you only have 2. You need a 3rd that will represent a driver of said car. (where could we get one of these?) Once you get this the rest of the problem should be straightforward.
mmp
Profile Blog Joined April 2009
United States2130 Posts
Last Edited: 2012-10-15 05:31:02
October 15 2012 05:22 GMT
#3511
On October 15 2012 10:54 NeMeSiS3 wrote:
+ Show Spoiler +

public class Automobile {
      private int model;
      private String manufacturer;

      public Automobile(int modelIn, String manufacturerIn)
      {       model = modelIn;
      manufacturer = manufacturerIn;
      }
}

What you're doing with modelln to avoid name collision suggests you don't understand how scope works.

public Automobile(int model, String manufacturer) {
this.model = model;
this.manufacturer = manufacturer;
}

Your instructor shouldn't take off points for that, but it will raise an eyebrow.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
n.DieJokes
Profile Blog Joined November 2008
United States3443 Posts
Last Edited: 2012-10-15 05:35:36
October 15 2012 05:31 GMT
#3512
MyLove + Your Love= Supa Love
Amnesty
Profile Joined April 2003
United States2054 Posts
Last Edited: 2012-10-15 05:41:10
October 15 2012 05:35 GMT
#3513
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.

You will need Visual Studio 2012
If you are a student, and i imagine you are since you said it was a project you can download VS2012 for free at https://www.dreamspark.com/ after you register with your school email address.


#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;
}
The sky just is, and goes on and on; and we play all our BW games beneath it.
Blisse
Profile Blog Joined July 2010
Canada3710 Posts
Last Edited: 2012-10-15 05:41:08
October 15 2012 05:37 GMT
#3514
+ Show Spoiler +

A company sells auto insurance has hired you to write a Java program to help with this.

You decide to begin by writing two java classes. First, you must write a class that can be used to represent the diriver of an automobile; you decide to call that class "Driver" (not to be confused with a "test" driver). For each Driver, you need to know their name and their age.
When a Driver object is first created you must always record their name and their current age.

Provide accessor methods for both Driver attributes. Also provide a mutator method to record the fact that the driver has just had a birthday ( i.e. they are now one year older).

You must also create and automobile class. This class will be used to represent and automobile that is insured by your client's company. For each automobile we need to record the model year (e.g. 2005), and name of the manufacturer(e.g. General Motors). We also need to know who will be the primary driver for the automobile. Include three (and only three) instance variables in the automobile class.

A constructor method should be provided for the automobile class; the constructor willl accept three parameters and use them to inialize the instance variables.

You do NOT need to write the accessor and mutator methods for each instance variable in the automobile class, and you do NOT need to include a toString() method.

However, you do need to provide one accessor method that will calculate and retrieve the insurance amount for the automobile. The base amount that your client's company charges for auto insurance is $900. However, for older automobiles the cost is higher; specifically, for an automobile with a model year prior to 2002 they charge an extra $50. Driver age is also a factor, if the primary driver is under 25 years of age, the company charges an additional $200.

You DO NOT need a test driver program.



public Automobile(int modelYear, String manufacturer, Driver driver) {
this.modelYear = modelYear;
this.manufacturer = manufacturer;
this.driver = driver;
}

int calculateInsurance(){
int extra = 0;
if ( this.getModelYear < 2002 ) extra += 50;
if ( this.driver.getAge() < 25 ) extra += 200;
return 900 + extra;
}


This really shouldn't have given you any trouble.


This is the reason I don't like Java as a first language. You're throwing people head first into Classes without teaching them how to problem solve in the first place. Teach them to solve problems first, then add Classes and OOP as different methods of solving problems, instead of confusing students with both.
There is no one like you in the universe.
Amnesty
Profile Joined April 2003
United States2054 Posts
Last Edited: 2012-10-15 05:41:34
October 15 2012 05:39 GMT
#3515
double post
The sky just is, and goes on and on; and we play all our BW games beneath it.
mmp
Profile Blog Joined April 2009
United States2130 Posts
Last Edited: 2012-10-15 05:51:29
October 15 2012 05:49 GMT
#3516
Try not to post full solutions to problems that are for classes.
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
Blisse
Profile Blog Joined July 2010
Canada3710 Posts
Last Edited: 2012-10-15 05:59:58
October 15 2012 05:59 GMT
#3517
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

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.
There is no one like you in the universe.
WerderBremen
Profile Joined September 2011
Germany1070 Posts
October 15 2012 06:26 GMT
#3518
On October 15 2012 14:37 Blisse wrote:
+ Show Spoiler +

A company sells auto insurance has hired you to write a Java program to help with this.

You decide to begin by writing two java classes. First, you must write a class that can be used to represent the diriver of an automobile; you decide to call that class "Driver" (not to be confused with a "test" driver). For each Driver, you need to know their name and their age.
When a Driver object is first created you must always record their name and their current age.

Provide accessor methods for both Driver attributes. Also provide a mutator method to record the fact that the driver has just had a birthday ( i.e. they are now one year older).

You must also create and automobile class. This class will be used to represent and automobile that is insured by your client's company. For each automobile we need to record the model year (e.g. 2005), and name of the manufacturer(e.g. General Motors). We also need to know who will be the primary driver for the automobile. Include three (and only three) instance variables in the automobile class.

A constructor method should be provided for the automobile class; the constructor willl accept three parameters and use them to inialize the instance variables.

You do NOT need to write the accessor and mutator methods for each instance variable in the automobile class, and you do NOT need to include a toString() method.

However, you do need to provide one accessor method that will calculate and retrieve the insurance amount for the automobile. The base amount that your client's company charges for auto insurance is $900. However, for older automobiles the cost is higher; specifically, for an automobile with a model year prior to 2002 they charge an extra $50. Driver age is also a factor, if the primary driver is under 25 years of age, the company charges an additional $200.

You DO NOT need a test driver program.



public Automobile(int modelYear, String manufacturer, Driver driver) {
this.modelYear = modelYear;
this.manufacturer = manufacturer;
this.driver = driver;
}

int calculateInsurance(){
int extra = 0;
if ( this.getModelYear < 2002 ) extra += 50;
if ( this.driver.getAge() < 25 ) extra += 200;
return 900 + extra;
}


This really shouldn't have given you any trouble.


This is the reason I don't like Java as a first language. You're throwing people head first into Classes without teaching them how to problem solve in the first place. Teach them to solve problems first, then add Classes and OOP as different methods of solving problems, instead of confusing students with both.


I think you get a good point, I would highly recommend everybody to start even with the basics of C (simple programs, loops, functions etc) and then switch to C++ (classes, methods, heredity, working with files, space management) and realize the diffenrences. Then you've got a good understanding what you are actually doing. Thats at least my point of view, but I'm electrical engineer and not a pure programmer though.
"Thats the moment you send the kids outta the room - when you get contained by MarineKing." Tasteless
white_horse
Profile Joined July 2010
1019 Posts
October 16 2012 00:31 GMT
#3519
Thanks for the suggestions guys

I got this far now:


for (int i = lower limit; i <= upper limit; i++) //user inputs two numbers and looks for prime numbers between the two
{
for (int j = 2; j <= sqrt(i); j++)
{
if (i%j == 0 && i%2 == 0)
{
cout << i + 1 << " is prime" << endl;
}
}
}


but its still not working. could you guys let me know what I'm doing wrong?
Translator
mmp
Profile Blog Joined April 2009
United States2130 Posts
Last Edited: 2012-10-16 01:12:46
October 16 2012 01:11 GMT
#3520
On October 16 2012 09:31 white_horse wrote:

for (int i = lower limit; i <= upper limit; i++) //user inputs two numbers and looks for prime numbers between the two
{
for (int j = 2; j <= sqrt(i); j++)
{
if (i%j == 0 && i%2 == 0)
{
cout << i + 1 << " is prime" << endl;
}
}
}

its still not working


What happens when i = 5?


for (int j = 2; j <= sqrt(5); j++) {
if (5 % j == 0 && 5 % 2 == 0) {
... 6 is prime
}
}


Do you see something wrong here? o_O

+ Show Spoiler +

What does the modulo (%) operator do?
+ Show Spoiler +

Why must 5 be divisible by 2 to be prime?


+ Show Spoiler +
Why do you print out (i + 1) is prime instead of i itself?
I (λ (foo) (and (<3 foo) ( T_T foo) (RAGE foo) )) Starcraft
Prev 1 174 175 176 177 178 1032 Next
Please log in or register to reply.
Live Events Refresh
Next event in 3h 45m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
ProTech140
EnDerr 6
StarCraft: Brood War
Hyuk 855
Shinee 162
Yoon 98
910 35
NaDa 24
ajuk12(nOOB) 10
League of Legends
JimRising 701
Counter-Strike
Coldzera 1236
Other Games
summit1g6081
ceh9498
XaKoH 413
Happy186
Livibee131
[ Show 13 non-featured ]
StarCraft 2
• Berry_CruncH377
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• iopq 7
• Light_VIP 7
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• Rush1317
• Lourlo1224
Upcoming Events
Kung Fu Cup
3h 45m
RotterdaM Event
9h
Replay Cast
16h 45m
The PondCast
1d 2h
IntoTheTV X SOOP
2 days
CranKy Ducklings
3 days
Sparkling Tuna Cup
4 days
OSC
4 days
Shopify Rebellion Sundays
4 days
Mixu vs TBD
Spirit vs TBD
Clem vs TBD
Afreeca Starleague
5 days
Soma vs Shuttle
BeSt vs Rush
[ Show More ]
WardiTV Weekly
5 days
Afreeca Starleague
6 days
Leta vs ggaemo
Jaedong vs Queen
GSL
6 days
PiGosaur Cup
6 days
Liquipedia Results

Completed

KCM Special KOR vs CHN
PiG Sty Festival 8.0
Light Tournament 2026

Ongoing

KCM Race Survival 2026 Season 3
K-JUNGMAN
ASL Season 22
Super Anchor Qualifying S3
CSL 2026 AUTUMN (S22)
RSL Revival: Season 6
Calamity Invitational
Big Dog Cup 2026 Div 1
BLAST Open Fall 2026
Esports World Cup 2026
Esports World Cup 2026: LCQ
BLAST Bounty Summer 2026
BLAST Bounty Summer Qual
Stake Ranked Episode 3
XSE Pro League 2026
IEM Cologne Major 2026

Upcoming

Acropolis #5
Acropolis #5 - TRS
Escore Tournament S3: King of Kings
Blizzard Classic Cup 2026
Acropolis #5 - GSA
Acropolis #5 - GSB
Acropolis #5 - GSC
HSC XXX
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
BLAST Rivals Fall 2026
IEM Beijing 2026
Stake Ranked Episode 5
PGL Masters Bucharest 2026
1win Private Club #2
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
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.