7000series

• The inner red circle represents what would be completely vaporized by the nuke.
  
• The second red circle represents what would be burnt to crisps by the fireball.
• The outer orange circle represents what would be mostly destroyed by the shock-wave.
  

int stopfact( int pier, int depth ) { int retval = 1; for( int i = 0; i < depth; ++i ) { retval *= pier; --pier; } return retval;}double power( double base, int exponent ) { double retval = 1.0; for( int i = 0; i < exponent; ++i ) { retval *= base; } return retval;}#include <stdio.h>#include <stdlib.h>int main() { int bucket_count = 0; double * buckets; double chance_total = 0.0; int copies; double frequency; while( scanf( "%i %lf", & copies, & frequency ) == 2 ) { buckets = realloc( buckets, sizeof( double ) * ( bucket_count + copies ) ); for( int i = 0; i < copies; ++i ) { buckets[ bucket_count ] = frequency; ++bucket_count; chance_total += frequency; } } int balls; int limit; double * chancetable; double * newtable; scanf( "?> %i %i", & balls, & limit ); chancetable = malloc( sizeof( double ) * ( balls + 1 ) ); newtable = malloc( sizeof( double ) * ( balls + 1 ) ); chancetable[ 0 ] = 1.0; for( int i = 1; i <= balls; ++i ) { chancetable[ i ] = 0.0; } for( int i = 0; i < bucket_count; ++i ) { for( int u = 0; u <= balls; ++u ) { newtable[ u ] = 0.0; } for( int u = 0; u < limit; ++u ) { for( int z = 0; z + u <= balls; ++z ) { newtable[ z + u ] += chancetable[ z ] * ( double )( stopfact( balls - z, u ) / stopfact( u, u ) ) * power( buckets[ i ] / chance_total, u ) * power( ( chance_total - buckets[ i ] ) / chance_total, ( balls - z ) - u ); } } for( int u = 0; u <= balls; ++u ) { chancetable[ u ] = newtable[ u ]; } chance_total -= buckets[ i ]; } printf( "%lf %\n", chancetable[ balls ] * 100.0 ); free( buckets ); free( chancetable ); return 0;}

365   4

1   1

?>   170   4

double sqrt( double whole ) {

     double accumulator = 1.0;

     double difference = whole - 1.0;

     for( int i = 0; i < 54; ++i ) {

          difference /= 2.0;

          if( whole < SQUARE( accumulator ) == whole < SQUARE( accumulator + difference ) ) {

               accumulator += difference;

          }

     }

     return accumulator;

}

#define ROOTSET 2 #include <stdlib.h>double power( double base, long exponent ) { double scraper = 1.0; while( exponent != 1 ) { if( exponent % 2 == 1 ) { scraper *= base; } base *= base; exponent /= 2; } return base * scraper;}typedef struct { double spacing; long tablesize; double * table;} RootTable;RootTable roottable_init( long mode, double spacing, long tablesize ) { RootTable retval; retval . spacing = power( spacing, mode ); retval . tablesize = tablesize; retval . table = malloc( sizeof( double ) * tablesize ); long index = 0; for( long i = 0; ; ++i ) { for( long u = 0; u < power( i + 1, mode ) - power( i, mode ); ++u ) { retval . table[ index ] = spacing * ( ( double )( i ) + ( double )( u ) / ( double )( power( i + 1, mode ) - power( i, mode ) ) ); if( ++index >= tablesize ) { return retval; } } }}#define ISPOS( X ) ( X + X > X )double roottable_get( RootTable self, double searchval ) { if( ISPOS( searchval ) && ( long )( searchval / self . spacing ) < self . tablesize ) { return self . table[ ( long )( searchval / self . spacing ) ]; } else { return 0.0; }}void roottable_free( RootTable self ) { free( self . table );}#include <stdio.h>int main() { double spacing; long tablesize; scanf( "%lf %ld", & spacing, & tablesize ); RootTable subject = roottable_init( ROOTSET, spacing, tablesize ); while( 1 ) { double searchval; if( scanf( "%lf", & searchval ) == 1 ) { printf( "%lf\n", roottable_get( subject, searchval ) ); } else { roottable_free( subject ); printf( "End Program\n" ); return 0; } }}

Semantics:

For those unfamiliar with the tier system, it ranks things on a 6 point scale, with the “S tier” being absolutely supreme, and with the “F tier” being absolutely dogwater. Right in the middle, there is the “B tier”, meaning “good”.

- - - > Is this an accurate representation of the tier system?

This means that if I prove that Dragonite is good, then I win the debate. However, if OPP proves that Dragonite is either better or worse than good, then OPP wins the debate.

To measure “good”, I will be using the metrics of gameplay and marketability.

- - - > Are these fair indicators of how "good" a Pokemon is, and is there anything missing?

The gameplay experience of dragonite is good, but not great:

In the games, Dragonite fills the role of a highly offensive physical attacker. Due to “dragon dance”, Dragonite can buff itself to sweep the opponent’s entire team. In generation one, Dragonite was one of the most competitive pokemon. But as the games kept evolving, power creep slowly pushed Dragonite out of the competitive spotlight. This all changed back in the eighth pokemon generation released in 2019, and now Dragonite is powerful once again.

- - - > Is this information accurate, and is there anything missing?

This brings me to my first problem with Dragonite. Across generations, Dragonite has been inconsistent. Is Dragonite defensive, offensive, or even good? Does Dragonite have many high accuracy attacks? Can Dragonite use dragon dance? The answers to all of these questions have changed across generations.

- - - > Does Dragonite encompass all versions of Dragonite from each generation, or does Dragonite only mean ninth generation Dragonite? If the former is true, could Dragonite's inconsistency actually be a strength rather than a weakness? If the latter is true, how does this impact the validity of what I just said?

The marketability of Dragonite is good, but not great:

Dragonite was the first dragon type pokemon, and so Gamefreak took extra time on its design. The design of dragonite was originally simplistic, with light oranges and round lines. This design emphasized that Dragonite was the good-guy dragon, in contrast to scarier dragons such as Rayquaza. Fans loved Dragonite, and throughout the Pokemon anime, Dragonite’s personality was fleshed out into a Dragonite of loyalty, friendship, selflessness, and honor.

- - - > Is this information accurate, and is there anything missing?

However, Dragonite is poised in the awkward limbo between a scary dragon powerhouse, and a Snorlax-esque cuddly pokemon. People who like big scary pokemon don’t choose Dragonite, they choose Gyrados. And people who like cuddly pokemon don’t choose Dragonite, they choose Snorlax or Pikachu. Ultimately, Dragonite proved to be not much more than a template for more unique later pokemon.

- - - > Is Dragonite really as unpopular as I make it seem?