• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 09:37
CET 15:37
KST 23:37
  • 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
RSL Season 3 - Playoffs Preview0RSL Season 3 - RO16 Groups C & D Preview0RSL Season 3 - RO16 Groups A & B Preview2TL.net Map Contest #21: Winners12Intel X Team Liquid Seoul event: Showmatches and Meet the Pros10
Community News
Weekly Cups (Nov 24-30): MaxPax, Clem, herO win2BGE Stara Zagora 2026 announced15[BSL21] Ro.16 Group Stage (C->B->A->D)4Weekly Cups (Nov 17-23): Solar, MaxPax, Clem win3RSL Season 3: RO16 results & RO8 bracket13
StarCraft 2
General
Chinese SC2 server to reopen; live all-star event in Hangzhou Maestros of the Game: Live Finals Preview (RO4) BGE Stara Zagora 2026 announced Weekly Cups (Nov 24-30): MaxPax, Clem, herO win SC2 Proleague Discontinued; SKT, KT, SGK, CJ disband
Tourneys
Sparkling Tuna Cup - Weekly Open Tournament RSL Offline Finals Info - Dec 13 and 14! StarCraft Evolution League (SC Evo Biweekly) Sea Duckling Open (Global, Bronze-Diamond) $5,000+ WardiTV 2025 Championship
Strategy
Custom Maps
Map Editor closed ?
External Content
Mutation # 502 Negative Reinforcement Mutation # 501 Price of Progress Mutation # 500 Fright night Mutation # 499 Chilling Adaptation
Brood War
General
The top three worst maps of all time Foreign Brood War BGH Auto Balance -> http://bghmmr.eu/ Data analysis on 70 million replays BW General Discussion
Tourneys
Small VOD Thread 2.0 [Megathread] Daily Proleagues [BSL21] RO16 Group D - Sunday 21:00 CET [BSL21] RO16 Group A - Saturday 21:00 CET
Strategy
Current Meta Game Theory for Starcraft How to stay on top of macro? PvZ map balance
Other Games
General Games
Nintendo Switch Thread Stormgate/Frost Giant Megathread Path of Exile ZeroSpace Megathread The Perfect Game
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Deck construction bug Heroes of StarCraft mini-set
TL Mafia
Mafia Game Mode Feedback/Ideas TL Mafia Community Thread
Community
General
US Politics Mega-thread European Politico-economics QA Mega-thread Things Aren’t Peaceful in Palestine Russo-Ukrainian War Thread The Big Programming Thread
Fan Clubs
White-Ra Fan Club
Media & Entertainment
Anime Discussion Thread [Manga] One Piece Movie Discussion!
Sports
Formula 1 Discussion 2024 - 2026 Football Thread
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
Where to ask questions and add stream? The Automated Ban List
Blogs
I decided to write a webnov…
DjKniteX
Physical Exertion During Gam…
TrAiDoS
James Bond movies ranking - pa…
Topin
Thanks for the RSL
Hildegard
Customize Sidebar...

Website Feedback

Closed Threads



Active: 1459 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
WardiTV 2025
12:00
Group Stage 1 - Group B
WardiTV1334
ComeBackTV 555
TaKeTV 321
IndyStarCraft 222
Rex141
LiquipediaDiscussion
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
IndyStarCraft 227
Rex 141
StarCraft: Brood War
Britney 45175
EffOrt 1515
Hyuk 869
Stork 719
Jaedong 564
BeSt 272
firebathero 234
Mini 210
Last 157
910 151
[ Show more ]
ggaemo 146
Killer 123
Hyun 116
sorry 114
Barracks 60
Sea.KH 56
Shinee 52
LaStScan 45
Mind 36
sas.Sziky 34
ToSsGirL 31
HiyA 23
Noble 19
Terrorterran 15
Icarus 9
Dota 2
qojqva3274
Gorgc2382
syndereN568
Counter-Strike
fl0m2522
zeus1217
chrisJcsgo61
Super Smash Bros
Mew2King91
Chillindude22
Heroes of the Storm
Khaldor259
Liquid`Hasu111
Other Games
singsing3687
B2W.Neo1207
XcaliburYe288
XaKoH 70
ArmadaUGS61
nookyyy 45
Organizations
StarCraft: Brood War
Kim Chul Min (afreeca) 7
lovetv 6
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 14 non-featured ]
StarCraft 2
• Reevou 12
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• blackmanpl 11
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• C_a_k_e 3780
League of Legends
• Jankos3203
Upcoming Events
OSC
23m
IPSL
2h 23m
Bonyth vs KameZerg
BSL 21
5h 23m
Bonyth vs StRyKeR
Tarson vs Dandy
Replay Cast
18h 23m
Wardi Open
21h 23m
StarCraft2.fi
1d 1h
Monday Night Weeklies
1d 2h
Replay Cast
1d 9h
WardiTV 2025
1d 21h
StarCraft2.fi
2 days
[ Show More ]
PiGosaur Monday
2 days
StarCraft2.fi
3 days
Tenacious Turtle Tussle
3 days
The PondCast
3 days
WardiTV 2025
3 days
StarCraft2.fi
4 days
WardiTV 2025
4 days
StarCraft2.fi
5 days
RSL Revival
5 days
IPSL
6 days
Sziky vs JDConan
RSL Revival
6 days
Classic vs TBD
herO vs Zoun
WardiTV 2025
6 days
Liquipedia Results

Completed

Proleague 2025-12-04
RSL Revival: Season 3
Light HT

Ongoing

C-Race Season 1
IPSL Winter 2025-26
KCM Race Survival 2025 Season 4
YSL S2
BSL Season 21
CSCL: Masked Kings S3
Slon Tour Season 2
Acropolis #4 - TS3
WardiTV 2025
META Madness #9
Kuram Kup
SL Budapest Major 2025
ESL Impact League Season 8
BLAST Rivals Fall 2025
IEM Chengdu 2025
PGL Masters Bucharest 2025
Thunderpick World Champ.
CS Asia Championships 2025
ESL Pro League S22

Upcoming

BSL 21 Non-Korean Championship
Acropolis #4
IPSL Spring 2026
Bellum Gens Elite Stara Zagora 2026
HSC XXVIII
Big Gabe Cup #3
RSL Offline Finals
PGL Cluj-Napoca 2026
IEM Kraków 2026
BLAST Bounty Winter 2026
BLAST Bounty Winter Qual
eXTREMESLAND 2025
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 © 2025 TLnet. All Rights Reserved.