プログラマ専用SNS ミクプラ

コード:

	/*多い要素から順につなげる*/
	printf( "-------------- ソート前 \n" );
	for(i=0;i<257;i++) {
		printf( "sublist[%d]=%p ", i, sublist[i] );
		printf( "sublist[%d]->data=%d ", i, sublist[i]->data );
		printf( "sublist[%d]->kosuu=%d \n", i, sublist[i]->kosuu );
	}
	for(i=256;i>0;i--) {
		temp=mycalloc(sizeof(bunpunode));
		temp->data=-2;
		temp->kosuu=sublist[i-1]->kosuu+sublist[i]->kosuu;
		temp->next[0]=sublist[i-1];
		temp->next[1]=sublist[i];
		sublist[i-1]->prev=temp;
		sublist[i]->prev=temp;
		for(j=i-2;j>=0;j--) {
			if(sublist[j]->kosuu>=temp->kosuu)break;
			sublist[j+1]=sublist[j];
		}
		sublist[j+1]=temp;
	}
	printf( "-------------- ソート後 \n" );
	for(i=0;i<257;i++) {
		printf( "sublist[%d]=%p ", i, sublist[i] );
		printf( "sublist[%d]->data=%d ", i, sublist[i]->data );
		printf( "sublist[%d]->kosuu=%d \n", i, sublist[i]->kosuu );
	}

コード:

#!/usr/local/bin/perl

open(IN,"< log.txt") or die("input file open error");

$a=<IN>;
open(OUT,"> row1.txt");
@row1=();
while(<IN>) {
	if($_ =~ /^ソ\/){last;}
	$_ =~ s/^sublist\[[0-9]+\]=([0-9a-zA-Z]+)/push(@row1,$1);print OUT $1 . "\n";/e;
}
close(OUT);
open(OUT,"> row2.txt");
@row2=();
while(<IN>) {
	if($_ =~ /^変換ツリ/){last;}
	$_ =~ s/^sublist\[[0-9]+\]=([0-9a-zA-Z]+)/push(@row2,$1);print OUT $1 . "\n";/e;
}
close(OUT);
open(OUT,"> row3.txt");
@row3=();
while(<IN>) {
	if($_ =~ /^変換/){last;}
	$_ =~ s/^ *address=([0-9a-zA-Z]+)/push(@row3,$1);print OUT $1 . "\n";/e;
}
close(OUT);
close(IN);

open(OUT,"> del2.txt");
foreach $data ( @row1) {
	if(grep(/$data/,@row2)==0) {
		print OUT $data . "\n";
	}
}
close(OUT);
open(OUT,"> new2.txt");
foreach $data ( @row2) {
	if(grep(/$data/,@row1)==0) {
		print OUT $data . "\n";
	}
}
close(OUT);
open(OUT,"> del3.txt");
foreach $data ( @row2) {
	if(grep(/$data/,@row3)==0) {
		print OUT $data . "\n";
	}
}
close(OUT);
open(OUT,"> new3.txt");
foreach $data ( @row3) {
	if(grep(/$data/,@row2)==0) {
		print OUT $data . "\n";
	}
}
close(OUT);