dohatsutsu

週間報告

競技プログラミング

• AOJ1242 Area of Polygons ( 幾何 ) http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1242

• AOJ2698 Wall Making Game ( ゲーム理論 ) http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2698

• AOJ2632 Last One ( ゲーム理論 )

dohatsutsu

WeeklyReport

Competative Programming Problems

• AOJ2537 Billiard ( Category : geometory )
• AOJ2690 Content Delivery ( Category : graph )
• AOJ2632 Dense Amidakuji ( Category : puzzle )
• Google Code Jam Round1A ( rank : 193 / 10149 )
• AtCoder Regular Contest 051 ( rank : 27 / 277 )

ICPC club

dohatsutsu

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;

int n,ans;
int G[100][100];
int pre[100];
vector<int> ansv;

dohatsutsu

#include<bits/stdc++.h>
using namespace std;

int N,M;
int W[30][30];
const int INF = (1<<28);
int dp1[(1<<20)][22];
int dp2[(1<<20)][22];
void jsl(int (*dp)[22],int s){
  fill(dp[0],dp[(1<<N)],INF);

dohatsutsu

#include<bits/stdc++.h>
using namespace std;

int N,M;
int W[30][30];
const int INF = (1<<28);
int dp1[(1<<20)][22];
int dp2[(1<<20)][22];
void jsl(int (*dp)[22],int s){
  fill(dp[0],dp[(1<<N)],INF);