 |
| soccerwindow2によるagent2D同士の対戦模様 |
 |
| localhostでのjagoと端末での対局の様子 |
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)と，logfileがないと言われますが，NNGSの起動はでき，実際にtelnetとjagoでそれぞれlocalhostの9696ポートに接続（ログイン）して，上の図のように対局を行うことができました．
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)
Fork1 = 27976
hikaru@HARU:~/go/nngs/bin$ Fork2 = 27977
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)
NNGS: can't bind local address. errno=98(Address already in use)
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)
NNGS: can't bind local address. errno=98(Address already in use)
Error opening logfile '/home/hikaru/go/nngs/nngssrv/stats/logfile': 2(No such file or directory)
Network initialize failed on ports 6969,9696.
 |
| 謎のGUI |
#include<iostream>
int main()
{
for (int n; std::cin >> n, n;)
{
int s = 1, d[] = {2, 3, 5, 4, 1}, i, t, a, b;
for (i = 0; i++ < n; s += d[4])
{
char c[9], e;
std::cin >> c;
e = *c;
a = 0;
if (e != 'R' && e != 'L')
{
e == 'N' ? a = 2, b = 0 : e == 'E' ? a = 1, b = 3
: e == 'W' ? a = 3, b = 1 : b = 2;
d[a] = d[4];
d[4] = d[b];
d[b] = 7 - d[a];
}
else
{
e == 'R' ? : a = 2;
t = *d;
*d = d[1 + a];
d[1 + a] = d[2];
d[2] = d[3 - a];
d[3 - a] = t;
}
}
std::cout << s << '\n';
}
return 0;
}
バリンバリンの自分なりのショートコーディング．#include <iostream>
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/io.hpp>
using namespace std;
using namespace boost::numeric::ublas;
int main()
{
matrix<int> A(2, 2), B(2, 2);
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
A(i, j) = i * 2 + j + 1;
B(i, j) = i * 2 + j + 2;
}
}
cout << A << endl;
cout << B << endl;
cout << prod(A, trans(B)) << endl;
return 0;
}
/* execution result
[2,2]((1,2),(3,4))
[2,2]((2,3),(4,5))
[2,2]((8,14),(18,32))
*/
 |
| 3層階層型ニューラルネットワーク |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int num = 5;
vector<int*> v;
v.push_back(&num);
cout << "num = " << num << endl;
cout << "*v[0] = " << *v[0] << endl;
*v[0] = 15;
cout << "num = " << num << endl;
cout << "*v[0] = " << *v[0] << endl;
return 0;
}
// execution result
/*
num = 5
*v[0] = 5
num = 15
*v[0] = 15
*/
個人的なメモ．
です．と言ってもあんまり読んでないんですが，たぶん王道？だと思います．
#include<iostream>
using namespace std;
int main()
{
for (int n, m, i, j, c; cin >> n >> m, i = n;)
{
int r[101] = {0};
for (; i--;)
for (j = 0; ++j <= m; !c ? : r[j]++)
cin >> c;
for (i = n + 1, c = 0; --i;)
for (j = 0; ++j <= m;)
r[j] != i ? : cout << j << (++c == m ? '\n' : ' ');
}
return 0;
}
若干ショートコーディング気味のコード．
 |
| モンテカルロ法を用いた円周率の算出中の画像 実際はリアルタイムで点が増えてきます |
#include <iostream>
using namespace std;
int main()
{
int n;
while (cin >> n, n)
{
char name[10];
int win[10] = {0};
int lose[10] = {0};
for (int i = 0; i < n; i++)
{
cin >> name[i];
for (int j = 0; j < n - 1; j++)
{
int s;
cin >> s;
if (s == 0)
win[i]++;
if (s == 1)
lose[i]++;
}
}
for (int i = n - 1; i > -1; i--)
for (int j = 0; j < n - i; j++)
for (int k = 0; k < n; k++)
if (win[k] == i && lose[k] == j)
cout << name[k] << endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
using namespace std;
void Compress(string inputFileName, string outputFileName);
void UnCompress(string inputFileName, string outputFileName);
int main(int argc, char** argv)
{
if (argc < 3)
return 0;
if (! strcmp(argv[1], "nz"))
{
Compress(argv[2], argv[2]);
cout << "Compressed file is " << argv[2] << ".nz" << endl;
}
else if (! strcmp(argv[1], "unz"))
{
string outputFileName(argv[2]);
string::size_type index = outputFileName.rfind(".nz");
if (index != string::npos)
outputFileName = "Unz" + outputFileName.substr(0, index);
else
return 1;
UnCompress(argv[2], outputFileName);
cout << "Extracting file is " << outputFileName << endl;
}
return 0;
}
void Compress(string inputFileName, string outputFileName)
{
outputFileName += ".nz";
ifstream fin(inputFileName.c_str(), ios::in | ios::binary);
ofstream fout(outputFileName.c_str(), ios::out | ios::binary);
if (! fin || ! fout)
return;
int delimiterPre = 0;
int delimiterPost = 0;
int rawByte, preByte, num = 0;
preByte = fin.get();
while ((rawByte = fin.get()) != EOF)
{
if(rawByte != preByte || num == 255)
{
if (num > 1)
{
fout.write((char*) &delimiterPre, sizeof(char));
fout.write((char*) &delimiterPost, sizeof(char));
fout.write((char*) &num, sizeof(char));
}
fout.write((char*) &preByte, sizeof(char));
preByte = rawByte;
num = 1;
}
else if (rawByte == preByte)
num++;
}
if (num > 1)
{
fout.write((char*) &delimiterPre, sizeof(char));
fout.write((char*) &delimiterPost, sizeof(char));
fout.write((char*) &num, sizeof(char));
}
fout.write((char*) &preByte, sizeof(char));
fin.close();
fout.close();
}
void UnCompress(string inputFileName, string outputFileName)
{
ifstream fin(inputFileName.c_str(), ios::in | ios::binary);
ofstream fout(outputFileName.c_str(),ios::out | ios::binary);
if (! fin || ! fout)
return;
int rawByte, preByte;
preByte = fin.get();
while ((rawByte = fin.get()) != EOF)
{
if (preByte == 0 && rawByte == 0)
{
while ((preByte = fin.get()) == 0)
fout.write((char*) &preByte, sizeof(char));
rawByte = fin.get();
for (int i = 0; i < preByte; i++)
fout.write((char*) &rawByte, sizeof(char));
if ((preByte = fin.get()) == EOF)
break;
}
else
{
fout.write((char*) &preByte, sizeof(char));
preByte = rawByte;
}
}
if (preByte != EOF)
fout.write((char*) &preByte, sizeof(char));
fin.close();
fout.close();
}
 | |
| 5五将棋 （Minishogi） の初期配置 |
#include <iostream>
using namespace std;
int main()
{
char ch, n;
while (cin.get(ch))
{
n = '1';
if (ch == '@')
cin >> n >> ch;
for (int i = 0; i < n - '0'; ++i)
cout << ch;
}
return 0;
}
#include <iostream>
#include <string>
#include <set>
#include <map>
using namespace std;
int main()
{
int n;
string str;
map<string, set<int> > m;
map<string, set<int> >::iterator p;
while (cin >> str>> n)
m[str].insert(n);
for (p = m.begin(); p != m.end(); p++)
{
cout << p->first << endl;
set<int>::iterator q = (p->second).begin();
for (; q != (p->second).end(); )
{
cout << *q;
cout << (++q != (p->second).end() ? ' ' : '\n');
}
}
return 0;
}
一つの書き方としてありかも．#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
map<char, char> conversion;
map<char, char>::iterator p;
for (int i = 0; i < n; i++) {
char pre, post;
cin >> pre >> post;
conversion[pre] = post;
}
cin >> n;
for (int i = 0; i < n; i++) {
char ch;
cin >> ch;
p = conversion.find(ch);
cout << (p == conversion.end() ? ch : p->second);
}
cout << endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n, min;
cin >> n;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
min = atoi(str.c_str());
sort(str.rbegin(), str.rend());
cout << atoi(str.c_str()) - min << endl;
}
return 0;
}
#include <iostream>
#include <map>
using namespace std;
int main()
{
int n, r, h;
while (cin >> n, n)
{
// longest increasing subsequence: lis
int k = 0, lis[200] = {0};
multimap<int, int> dolls;
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < n; j++)
{
cin >> r >> h;
dolls.insert(pair<int, int>(r, h));
}
if (! i)
cin >> n;
}
for (multimap<int, int>::iterator p = dolls.begin();
p != dolls.end(); p++)
{
for (multimap<int, int>::iterator q = dolls.begin();
q != p; q++)
{
if (p->first > q->first && p->second > q->second)
{
if (lis[distance(dolls.begin(), p)]
<= lis[distance(dolls.begin(), q)])
{
lis[distance(dolls.begin(), p)]
= lis[distance(dolls.begin(), q)] + 1;
if (k < lis[distance(dolls.begin(), p)])
k = lis[distance(dolls.begin(), p)];
}
}
}
}
cout << k + 1 << endl;
}
return 0;
}
 | |||
| GoGuiを用いたデバック風景 黒番が自分で白番が作成中の囲碁プログラムによるもの |