주최자의 주관적인 기준으로 선발한 best submission
A. Hanafuda Shuffle - by zizavino
[code c++]
#include
using namespace std;
int data[50];
int temp[50];
int i, j, n, r, p, c;
int main() {
while(true) {
scanf("%d %d", &n, &r);
if(n == 0) break;
for(i = 0; i < 50; ++ i) {
data[i] = n - i;
}
for(i = 0; i < r; ++ i) {
scanf("%d %d", &p, &c);
-- p;
for(j = 0; j < c; ++ j) {
temp[j] = data[p + j];
}
for(j = p - 1; j > -1; -- j) {
data[j + c] = data[j];
}
for(j = 0; j < c; ++ j) {
data[j] = temp[j];
}
}
printf("%d\n", data[0]);
}
return 0;
}
[/code]
B. Red and Black - by undergirls
[code c++]
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int inf = 987654321;
const double eps = 1e-10;
const double pi = acos(-1.0);
typedef long long ll;
typedef pair ii;
typedef vector vi;
#define ITERLOOP(i,x) for(i=x.begin();i!=x.end();i++)
#define GETI(x) scanf("%d",&x)
#define PUTI(x) printf("%d\n",(x))
#define clr(x,v) memset(x,(v),sizeof(x))
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
#define sz size()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define REP(i,n) FOR(i,0,n)
#define REPD(i,n) FORD(i,n,0)
#define EXIST(s,x) (s.find(all(s),x)!=s.end())
template string tostr(T x) { ostringstream ret; ret << x; return ret.str(); }
template void setMax(T &a, T b) { if(a template void setMin(T &a, T b) { if(a>b) a = b; }
int N, M;
int sy, sx;
int cnt;
string map[30];
void solve(int r, int c) {
if(r<0||r>=N) return;
if(c<0||c>=M) return;
if(map[r][c]!='.'&&map[r][c]!='@') return;
++cnt;
map[r][c] = '!';
solve(r+1,c);
solve(r-1,c);
solve(r,c-1);
solve(r,c+1);
}
int main() {
while(cin>>M>>N) {
if(!M&&!N) break;
REP(i,N) cin >> map[i];
REP(i,N) REP(j,M) if(map[i][j]=='@') { sy = i; sx = j; }
cnt = 0;
solve(sy,sx);
cout << cnt << endl;
}
}
[/code]
C. Unit Fraction Partition - by Ainu7
[code c++]
#include
#include
#include
using namespace std;
int p, q, a, n;
int cnt = 0;
void search(int mult, int up, int now, int starter, int last)
{
int i;
if (up*q == p*mult) cnt ++;
if (up*q > p*mult) return;
if ( now >= n ) return;
if ((up+last*(n-now))*q < p*mult ) return;
int limit = a / mult;
for (i=starter; i<=limit; i++)
{
search(mult*i, up*i+mult, now+1, i, mult);
}
return;
}
int main()
{
while (!feof(stdin))
{
// max answer = 103
scanf("%d %d %d %d", &p, &q, &a, &n);
// p=10; q=1; a = 12000; n= 7;
if (p+q+a+n==0 || a==0 || n==0 || p==0 || q==0) break;
if ( p<0 || q<0 || a<0 || a>12000 || n<0 || n>7 ) break;
cnt = 0;
search(1, 0, 0, 1, 1);
printf("%d\n", cnt);
}
return 0;
}
[/code]
D. Circle and Point - by fireduck

• 대회 도중에는 풀리지 않았던 문제인데 fireduck님께서 후에 AC를 받으셔서 첨부합니다 :) [code c++] #include #include #include #include #include using namespace std; #define MAXN 302 #define EPS 0.000000001 struct P { double x, y; }; bool operator < (const P& a, const P& b) { return (a.x < b.x); } int answer; int n; P a[MAXN]; inline double dist2(const P& a, const P& b) { double dx = a.x - b.x; double dy = a.y - b.y; return dx * dx + dy * dy; } void update(const P& o, int ia, int ib) { int count = 2; for (int i = ia - 1; i >= 0; i--) { if (o.x - a[i].x > 1.0 + EPS) break; if (dist2(o, a[i]) <= 1.0 + EPS) { count++; } } for (int i = ia + 1; i < ib; i++) { if (dist2(o, a[i]) <= 1.0 + EPS) { count++; } } for (int i = ib + 1; i < n; i++) { if (a[i].x - o.x > 1.0 + EPS) break; if (dist2(o, a[i]) <= 1.0 + EPS) { count++; } } if (count > answer) { answer = count; } } void check(int i, int j) { P& pa = a[i]; P& pb = a[j]; if (dist2(pa, pb) > 4.0) return; P m, o; m.x = (pa.x + pb.x) / 2.0; m.y = (pa.y + pb.y) / 2.0; double len1 = sqrt(1.0 - dist2(m, pa)); double dx = pa.x - pb.x, dy = pa.y - pb.y; double len2 = sqrt(dx * dx + dy * dy); double ratio = len1 / len2; o.x = m.x + dy * ratio; o.y = m.y - dx * ratio; // printf("%.8lf %.8lf\n", dist2(o, pa), dist2(o, pb)); update(o, i, j); o.x = m.x - dy * ratio; o.y = m.y + dx * ratio; // printf("%.8lf %.8lf\n", dist2(o, pa), dist2(o, pb)); update(o, i, j); } void process() { answer = 1; sort(a, a + n); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { check(i, j); } } } int main() { // double t = clock(); while(1) { scanf("%d", &n); if (n == 0) break; for (int i = 0; i < n; i++) { scanf("%lf %lf", &(a[i].x), &(a[i].y)); } answer = 1; process(); cout << answer << endl; } // printf("%.4lf\n", (clock() - t) / 1000.0); } [/code] E. Name the Crossing - by normit [code c++] #include #include #include #include