ichirin2501

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;

class TheFansAndMeetingsDivTwo{
public:
    double find(vector <int> minJ, vector <int> maxJ, vector <int> minB, vector <int> maxB){
        double ret = 0.0;

ichirin2501

#!perl -apnF','
$c++,s/[^"]/$s+=(ord($&)-64)*$c/eg for sort@F;
$_=$s;

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;
use List::Util qw/sum/;

sub factor{
    my $n = shift;
    my %hash = ();

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;
use bigint;

my ($a, $b, $idx) = (1, 1, 1);
while(1){
    if( length($a) >= 1000 ){

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;

my $ans = -1;
my $mx = 0;

for(2..999){

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;

sub is_prime{
    my $n = shift;

    return 0 if $n < 2;

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;
use List::Util qw/sum/;

my $i;
my $res = 0;
for($i=1; $i<=999; $i+=2){

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;
use bigint;
use List::MoreUtils qw/uniq/;

my ($a, $b) = (100, 100);
my @res = uniq map{ my $t = $_; map{ $t ** $_ } 2..$b } 2..$a;

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;
use List::Util qw/sum/;

# (9^5) + (9^5) + (9^5) + (9^5) + (9^5) + (9^5) = 354294
my @res = grep{ my $t = $_; $t == sum map{$_ ** 5} split(//,$t) } 2..354294;
print sum @res;

ichirin2501

#!/usr/bin/perl

use strict;
use warnings;
use Data::Dumper;

sub calc{
    my $L = shift;
    my @coin = $#_ == 0 ? @{$_[0]} : @_;