buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <iostream>
using namespace std;
#define NMAX 100
int calc_max(int c[], int n, int k) {
int sc = 1;
int max = -1;
for (int i = 0; i < n; i++) {
sc *= c[i];
if (i >= k - 1) {
if (sc > max) {
max = sc;
}
sc /= c[i - k + 1];
}
}
return max;
}
int main() {
int n, k;
int card[NMAX];
int chcard[NMAX];
int befmax, afmax;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> card[i];
}
befmax = calc_max(card, n, k);
afmax = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
break;
for (int k = 0; k < n; k++) {
if (k == i)
chcard[k] = card[j];
else if (k == j)
chcard[k] = card[i];
else
chcard[k] = card[k];
}
int tmp = befmax = calc_max(chcard, n, k);
if (tmp > afmax)
afmax = tmp;
}
}
if (afmax < befmax)
cout << "NO GAME" << endl;
else
cout << afmax - befmax << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define NMAX 100
int calc_max(int c[], int n, int k) {
int sc = 1;
int max = -1;
for (int i = 0; i < n; i++) {
sc *= c[i];
if (i >= k - 1) {
if (sc > max) {
max = sc;
}
sc /= c[i - k + 1];
}
}
return max;
}
int main() {
int n, k;
int card[NMAX];
int chcard[NMAX];
int befmax, afmax;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> card[i];
}
befmax = calc_max(card, n, k);
afmax = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
break;
for (int k = 0; k < n; k++) {
if (k == i)
chcard[k] = card[j];
else if (k == j)
chcard[k] = card[i];
else
chcard[k] = card[k];
}
int tmp = calc_max(chcard, n, k);
if (tmp > afmax)
afmax = tmp;
}
}
if (afmax < befmax)
cout << "NO GAME" << endl;
else
cout << afmax - befmax << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 11, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 11, 17, 32]]
| 1
| 334
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int data[101], i, j, k, result;
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (i = 0; i < N; i++)
cin >> data[i];
int maxv = -1;
for (i = 0; i <= N - K; i++) {
result = 1;
for (j = i; j < i + K; j++)
result *= data[j];
maxv = max(result, maxv);
}
int maxv2 = -1;
int result2;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
if (i != j) {
swap(data[i], data[j]);
for (k = 0; k <= N - K; k++) {
result2 = 1;
for (int l = k; l < k + K; l++)
result2 *= data[l];
maxv2 = max(result, maxv2);
}
swap(data[i], data[j]);
}
}
}
int ans = maxv2 - maxv;
if (ans >= 0)
cout << ans << endl;
else
cout << "NO GAME" << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int data[101], i, j, k, result;
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (i = 0; i < N; i++)
cin >> data[i];
int maxv = -1;
for (i = 0; i <= N - K; i++) {
result = 1;
for (j = i; j < i + K; j++) {
result *= data[j];
}
maxv = max(result, maxv);
}
int maxv2 = -1;
int result2;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
if (i != j) {
swap(data[i], data[j]);
for (k = 0; k <= N - K; k++) {
result2 = 1;
for (int l = k; l < k + K; l++) {
result2 *= data[l];
}
maxv2 = max(result2, maxv2);
}
swap(data[i], data[j]);
}
}
}
int ans = maxv2 - maxv;
if (ans >= 0)
cout << ans << endl;
else
cout << "NO GAME" << endl;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]]
| 1
| 290
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int a[101] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = -1;
for (int i = 0; i <= n - k; i++) {
int t = 1;
for (int j = 0; j < k; j++)
t *= a[j + i];
if (ck < t)
ck = t;
}
int ck2 = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
swap(a[i], a[j]);
for (int l = 0; l <= n - k; l++) {
int t = 1;
for (int m = 0; m < k; m++)
t *= a[m + l];
if (ck2 < t)
ck2 = t;
}
swap(a[i], a[j]);
}
}
// cout << ck <<" "<<ck2<<endl;
if (ck2 - ck)
cout << "NO GAME" << endl;
else
cout << ck2 - ck << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int a[101] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = -1;
for (int i = 0; i <= n - k; i++) {
int t = 1;
for (int j = 0; j < k; j++)
t *= a[j + i];
if (ck < t)
ck = t;
}
int ck2 = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
swap(a[i], a[j]);
for (int l = 0; l <= n - k; l++) {
int t = 1;
for (int m = 0; m < k; m++)
t *= a[m + l];
if (ck2 < t)
ck2 = t;
}
swap(a[i], a[j]);
}
}
// cout << ck <<" "<<ck2<<endl;
if (ck2 - ck < 0)
cout << "NO GAME" << endl;
else
cout << ck2 - ck << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 288
|
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX = 101;
int n, k, t;
vector<int> c;
int judge() {
int max_ = -1 << 28;
for (int i = 0; i <= n - k; i++) {
t = 1;
for (int j = i; j < i + k; j++) {
t *= c[j];
}
max_ = max(max_, t);
}
return max_;
}
int main() {
while (cin >> n >> k, n) {
int in;
c.clear();
for (int i = 0; i < n; i++) {
cin >> in;
c.push_back(in);
}
int tmx = judge(), smx = -1 << 28;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(c[i], c[j]);
smx = judge();
swap(c[i], c[j]);
}
}
if (tmx > smx)
cout << "NO GAME" << endl;
else
cout << smx - tmx << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX = 101;
int n, k, t;
vector<int> c;
int judge() {
int max_ = -1 << 28;
for (int i = 0; i <= n - k; i++) {
t = 1;
for (int j = i; j < i + k; j++) {
t *= c[j];
}
max_ = max(max_, t);
}
return max_;
}
int main() {
while (cin >> n >> k, n) {
int in;
c.clear();
for (int i = 0; i < n; i++) {
cin >> in;
c.push_back(in);
}
int tmx = judge(), smx = -1 << 28;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(c[i], c[j]);
smx = max(smx, judge());
swap(c[i], c[j]);
}
}
if (tmx > smx)
cout << "NO GAME" << endl;
else
cout << smx - tmx << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]]
| 1
| 262
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int a[100];
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = 1;
for (int i = 0; i < k; i++)
ck *= a[i];
int m = ck;
for (int i = k; i < n; i++) {
ck /= a[i - k];
ck *= a[i];
m = max(ck, m);
}
int ans = 0;
for (int i = 0; i + k <= n; i++) {
int x = 1, mi = 100, ma = 0;
for (int j = 0; j < n; j++) {
if (i <= j && j < i + k) {
mi = min(mi, a[j]);
x *= a[j];
} else
ma = max(ma, a[j]);
}
ans = max(ans, x / mi * ma - ck);
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int a[100];
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = 1;
for (int i = 0; i < k; i++)
ck *= a[i];
int m = ck;
for (int i = k; i < n; i++) {
ck /= a[i - k];
ck *= a[i];
m = max(ck, m);
}
int ans = 0;
for (int i = 0; i + k <= n; i++) {
int x = 1, mi = 100, ma = 0;
for (int j = 0; j < n; j++) {
if (i <= j && j < i + k) {
mi = min(mi, a[j]);
x *= a[j];
} else
ma = max(ma, a[j]);
}
ans = max(ans, x / mi * ma - m);
}
cout << ans << endl;
}
}
|
[["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]]
| 1
| 253
|
#include <iostream>
using namespace std;
int n, k;
int in[101];
int calc() {
int ans = 0;
for (int i = 0; i + k <= n; ++i) {
int tmp = 1;
for (int j = 0; j < k; ++j)
tmp *= in[i + j];
ans = max(ans, tmp);
}
return ans;
}
int main() {
while (cin >> n >> k, n | k) {
for (int i = 0; i < n; ++i)
cin >> in[i];
int ck = calc(), ans = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < i; ++j) {
swap(in[i], in[j]);
int t = calc();
if (t >= ck)
ans = max(ans, t);
swap(in[i], in[j]);
}
if (ans == 0)
cout << "NO GAME" << endl;
else
cout << ans << endl;
}
}
|
#include <iostream>
using namespace std;
int n, k;
int in[101];
int calc() {
int ans = 0;
for (int i = 0; i + k <= n; ++i) {
int tmp = 1;
for (int j = 0; j < k; ++j)
tmp *= in[i + j];
ans = max(ans, tmp);
}
return ans;
}
int main() {
while (cin >> n >> k, n | k) {
for (int i = 0; i < n; ++i)
cin >> in[i];
int ck = calc(), ans = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < i; ++j) {
swap(in[i], in[j]);
int t = calc();
if (t >= ck)
ans = max(ans, t);
swap(in[i], in[j]);
}
if (ans == 0)
cout << "NO GAME" << endl;
else
cout << ans - ck << endl;
}
}
|
[["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]]
| 1
| 237
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
typedef stringstream SS;
struct Edge {
int to, from, cost;
};
#ifdef DEBUG
#define debug cout
#else
SS ss;
#define debug ss
#endif
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repn(i, m, n) for (int i = (m); i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repnd(i, m, n) for (int i = (n); i >= (m); --i)
#define rep0(i, n) for (i = 0; i < (n); ++i)
#define repn0(i, m, n) for (i = (m); i <= (n); ++i)
#define repd0(i, n) for (i = (n)-1; i >= 0; --i)
#define repnd0(i, m, n) for (i = (n); i >= (m); --i)
#define all(n) n.begin(), n.end()
#define sz(n) ((int)(n).size())
#define IL for (;;)
#define MP make_pair
#define PB push_back
#define X second
#define Y first
#define PUTLINE debug << "LINE:" << __LINE__ << endl;
const int INF = 2147483647 / 3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
const int dy[] = {0, 0, 1, -1, 1, -1, -1, 1, 0};
int a[110];
int main() {
int n, k;
IL {
cin >> n >> k;
if (n == 0 && k == 0)
break;
rep(i, n) cin >> a[i];
int mx = 0;
rep(i, n - k) {
int m = 1;
rep(j, k) { m *= a[i + j]; }
chmax(mx, m);
}
int mm = 0;
rep(i, n) rep(c, n) if (i != c) {
swap(a[i], a[c]);
rep(b, n - k) {
int m = 1;
rep(j, k) { m *= a[b + j]; }
chmax(mm, m);
}
swap(a[i], a[c]);
}
if (mm < mx) {
cout << "NO GAME" << endl;
} else {
cout << mm - mx << endl;
}
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
typedef stringstream SS;
struct Edge {
int to, from, cost;
};
#ifdef DEBUG
#define debug cout
#else
SS ss;
#define debug ss
#endif
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repn(i, m, n) for (int i = (m); i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repnd(i, m, n) for (int i = (n); i >= (m); --i)
#define rep0(i, n) for (i = 0; i < (n); ++i)
#define repn0(i, m, n) for (i = (m); i <= (n); ++i)
#define repd0(i, n) for (i = (n)-1; i >= 0; --i)
#define repnd0(i, m, n) for (i = (n); i >= (m); --i)
#define all(n) n.begin(), n.end()
#define sz(n) ((int)(n).size())
#define IL for (;;)
#define MP make_pair
#define PB push_back
#define X second
#define Y first
#define PUTLINE debug << "LINE:" << __LINE__ << endl;
const int INF = 2147483647 / 3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
const int dy[] = {0, 0, 1, -1, 1, -1, -1, 1, 0};
int a[110];
int main() {
int n, k;
IL {
cin >> n >> k;
if (n == 0 && k == 0)
break;
rep(i, n) cin >> a[i];
int mx = 0;
rep(i, n - k + 1) {
int m = 1;
rep(j, k) { m *= a[i + j]; }
// cout<<i<<" "<<m<<endl;
chmax(mx, m);
}
int mm = 0;
rep(i, n) rep(c, n) if (i != c) {
swap(a[i], a[c]);
rep(b, n - k + 1) {
int m = 1;
rep(j, k) { m *= a[b + j]; }
chmax(mm, m);
}
swap(a[i], a[c]);
}
if (mm < mx) {
cout << "NO GAME" << endl;
} else {
cout << mm - mx << endl;
}
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 578
|
// 32
#include <iostream>
using namespace std;
int pt(int *c, int n, int k) {
int p = 0;
for (int i = 0; i < n - k + 1; i++) {
int cp = 1;
for (int j = 0; j < k; j++) {
cp *= c[i + j];
}
p = max(p, cp);
}
}
int main() {
for (int n, k; cin >> n >> k, n | k;) {
int c[100];
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int b = pt(c, n, k);
int cp = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(c[i], c[j]);
cp = max(cp, pt(c, n, k));
swap(c[i], c[j]);
}
}
if (cp < b) {
cout << "NO GAME" << endl;
} else {
cout << cp - b << endl;
}
}
return 0;
}
|
// 32
#include <iostream>
using namespace std;
int pt(int *c, int n, int k) {
int p = 0;
for (int i = 0; i < n - k + 1; i++) {
int cp = 1;
for (int j = 0; j < k; j++) {
cp *= c[i + j];
}
p = max(p, cp);
}
return p;
}
int main() {
for (int n, k; cin >> n >> k, n | k;) {
int c[100];
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int b = pt(c, n, k);
int cp = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(c[i], c[j]);
cp = max(cp, pt(c, n, k));
swap(c[i], c[j]);
}
}
if (cp < b) {
cout << "NO GAME" << endl;
} else {
cout << cp - b << endl;
}
}
return 0;
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]]
| 1
| 264
|
#include <iostream>
using namespace std;
int calc(int *, int, int);
int main() {
while (true) {
int n, k;
cin >> n >> k;
if (n == 0)
return 0;
int c[100];
for (int i = 0; i < n; i++)
cin >> c[i];
int nowc = calc(c, k, n);
int cmax = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
swap(c[i], c[j]);
int cprime = calc(c, k, n);
cmax = max(cprime, cmax);
swap(c[i], c[j]);
}
}
if (cmax < nowc)
cout << "NO GAME" << endl;
else
cout << cmax - nowc << endl;
}
return 0;
}
int calc(int *c, int k, int n) {
int m = 0;
for (int i = 0; i < n - k; i++) {
int v = 1;
for (int j = 0; j < k; j++) {
v *= c[i + j];
}
m = max(v, m);
}
return m;
}
|
#include <iostream>
using namespace std;
int calc(int *, int, int);
int main() {
while (true) {
int n, k;
cin >> n >> k;
if (n == 0)
return 0;
int c[100];
for (int i = 0; i < n; i++)
cin >> c[i];
int nowc = calc(c, k, n);
int cmax = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
swap(c[i], c[j]);
int cprime = calc(c, k, n);
cmax = max(cprime, cmax);
swap(c[i], c[j]);
}
}
if (cmax < nowc)
cout << "NO GAME" << endl;
else
cout << cmax - nowc << endl;
}
return 0;
}
int calc(int *c, int k, int n) {
int m = 0;
for (int i = 0; i < n - k + 1; i++) {
int v = 1;
for (int j = 0; j < k; j++) {
v *= c[i + j];
}
m = max(v, m);
}
return m;
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 286
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var I = 0;
while (true) {
var nS = Arr[I].split(" ").map(Number);
I++;
var n = nS[0];
var S = nS[1];
if (n == 0 && S == 0)
break;
var arr = [];
for (var i = 0; i < n; i++) {
var r = Arr[I] - 0;
I++;
arr.push(r);
}
arr.sort(function(a, b) { return a - b; });
var cnt = 0;
for (var i = 0; i < n; i++) {
for (var j = i + 1; j < n; j++) {
if (arr[i] + arr[j] > S) {
cnt += n - j;
continue;
}
}
}
console.log(cnt);
}
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var I = 0;
while (true) {
var nS = Arr[I].split(" ").map(Number);
I++;
var n = nS[0];
var S = nS[1];
if (n == 0 && S == 0)
break;
var arr = [];
for (var i = 0; i < n; i++) {
var r = Arr[I] - 0;
I++;
arr.push(r);
}
arr.sort(function(a, b) { return a - b; });
var cnt = 0;
for (var i = 0; i < n; i++) {
for (var j = i + 1; j < n; j++) {
if (arr[i] + arr[j] > S) {
cnt += n - j;
break;
}
}
}
console.log(cnt);
}
|
[["-", 8, 556, 0, 57, 64, 556, 0, 116, 0, 117], ["+", 8, 556, 0, 57, 64, 556, 0, 93, 0, 94]]
| 2
| 232
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int S = sc.nextInt();
if (n == 0 && S == 0) {
break;
}
int[] array = new int[n];
for (int i = 0; i < n; i++) {
array[i] = sc.nextInt();
}
Arrays.sort(array);
int count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i - 1; j >= 0; j--) {
if (array[i] + array[j] < S) {
break;
} else {
count++;
}
}
}
System.out.println(count);
}
}
}
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int S = sc.nextInt();
if (n == 0 && S == 0) {
break;
}
int[] array = new int[n];
for (int i = 0; i < n; i++) {
array[i] = sc.nextInt();
}
Arrays.sort(array);
int count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i - 1; j >= 0; j--) {
if (array[i] + array[j] <= S) {
break;
} else {
count++;
}
}
}
System.out.println(count);
}
}
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]]
| 3
| 201
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n, S, ans;
static int[] a;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (true) {
n = cin.nextInt();
S = cin.nextInt();
if (n + S == 0)
break;
a = new int[n];
ans = 0;
for (int i = 0; i < n; i++) {
a[i] = cin.nextInt();
}
Arrays.sort(a);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[j] > S - a[i] - 1) {
ans = ans + n - j;
break;
}
}
}
System.out.println(ans);
/*
for(int i=0;i<n;i++){
int s=Arrays.binarySearch(a,i,n, S-a[i]+1);
if(s<0){
s*=-1;
s--;
System.out.println("-");
}
else{
int tmp=s;
for(int j=s;j<n;j++){
if(S-a[i]<a[j]){
s=j;
break;
}
}
}
System.out.println(s);
ans+=n-s;
}
System.out.println(ans);
*/
}
}
}
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n, S, ans;
static int[] a;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (true) {
n = cin.nextInt();
S = cin.nextInt();
if (n + S == 0)
break;
a = new int[n];
ans = 0;
for (int i = 0; i < n; i++) {
a[i] = cin.nextInt();
}
Arrays.sort(a);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[j] > S - a[i]) {
ans = ans + n - j;
break;
}
}
}
System.out.println(ans);
/*
for(int i=0;i<n;i++){
int s=Arrays.binarySearch(a,i,n, S-a[i]+1);
if(s<0){
s*=-1;
s--;
System.out.println("-");
}
else{
int tmp=s;
for(int j=s;j<n;j++){
if(S-a[i]<a[j]){
s=j;
break;
}
}
}
System.out.println(s);
ans+=n-s;
}
System.out.println(ans);
*/
}
}
}
|
[["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499]]
| 3
| 206
|
#include <stdio.h>
int main() {
int n, s, i, j;
while (scanf("%d %d", &n, &s), n || s) {
int c = 0, d[20001];
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[i] * d[j - 1] > s)
c++;
}
}
printf("%d\n", c);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, s, i, j;
while (scanf("%d %d", &n, &s), n || s) {
int c = 0, d[20001];
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[i] + d[j - 1] > s)
c++;
}
}
printf("%d\n", c);
}
return 0;
}
|
[["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 48], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 72]]
| 0
| 121
|
#include <algorithm>
#include <iostream>
using namespace std;
int r[20000];
int main() {
int n, s;
while (cin >> n >> s && n) {
int ans = 0;
for (int i = 0; i < n; i++)
cin >> r[i];
sort(r, r + n);
for (int i = 0; i < n; i++) {
int *p = lower_bound(r, r + n, s - r[i]);
ans += r + n - p;
if (p <= r + i)
ans--;
}
cout << ans / 2 << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int r[20000];
int main() {
int n, s;
while (cin >> n >> s && n) {
int ans = 0;
for (int i = 0; i < n; i++)
cin >> r[i];
sort(r, r + n);
for (int i = 0; i < n; i++) {
int *p = upper_bound(r, r + n, s - r[i]);
ans += r + n - p;
if (p <= r + i)
ans--;
}
cout << ans / 2 << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22]]
| 1
| 138
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n || s) {
vector<int> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
sort(V.begin(), V.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = s - V[i];
int r = i + 1, l = n - 1;
while (l - r >= 1) {
int mid = (r + l) / 2;
if (V[mid] > t)
l = mid;
else
r = mid + 1;
}
cnt += n - r;
}
cout << cnt << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n || s) {
vector<int> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
sort(V.begin(), V.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = s - V[i];
int r = i + 1, l = n;
while (l - r >= 1) {
int mid = (r + l) / 2;
if (V[mid] > t)
l = mid;
else
r = mid + 1;
}
cnt += n - r;
}
cout << cnt << endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]]
| 1
| 177
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int main() {
int n, s;
while (cin >> n >> s) {
if (n == 0 && s == 0)
break;
vi in;
rep(i, n) {
int a;
cin >> a;
in.pb(a);
}
sort(all(in));
int sum = 0;
rep(i, n - 1) {
for (int j = i + 1; j < n; j++) {
if (in[i] + in[j] >= s) {
sum += n - j;
break;
}
}
}
cout << sum << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int main() {
int n, s;
while (cin >> n >> s) {
if (n == 0 && s == 0)
break;
vi in;
rep(i, n) {
int a;
cin >> a;
in.pb(a);
}
sort(all(in));
int sum = 0;
rep(i, n - 1) {
for (int j = i + 1; j < n; j++) {
if (in[i] + in[j] > s) {
sum += n - j;
break;
}
}
}
cout << sum << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 219
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
signed main() {
int n, s;
while (1) {
cin >> n >> s;
if (n + s == 0)
break;
vi r(n, 0);
rep(i, 0, n) cin >> r[i];
sort(all(r));
int ans = 0;
rep(i, 0, n - 1) {
int it =
max((int)(lower_bound(all(r), s - r[i]) - r.begin()), (int)(i + 1));
ans += n - it;
}
o(ans);
}
}
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
signed main() {
int n, s;
while (1) {
cin >> n >> s;
if (n + s == 0)
break;
vi r(n, 0);
rep(i, 0, n) cin >> r[i];
sort(all(r));
int ans = 0;
rep(i, 0, n - 1) {
int it =
max((int)(upper_bound(all(r), s - r[i]) - r.begin()), (int)(i + 1));
ans += n - it;
}
o(ans);
}
}
|
[["-", 0, 74, 51, 23, 0, 16, 31, 2, 63, 22], ["+", 0, 74, 51, 23, 0, 16, 31, 2, 63, 22]]
| 1
| 189
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, s;
while (cin >> n >> s) {
if (n == 0 && s == 0)
break;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(i, n) {
REP(j, i + 1, n) {
if (v[i] + v[j] >= s) {
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, s;
while (cin >> n >> s) {
if (n == 0 && s == 0)
break;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(i, n) {
REP(j, i + 1, n) {
if (v[i] + v[j] > s) {
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 171
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual
///Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int getnum(const vector<int> &as, int K) {
int ans = 0;
for (int l = 0; l <= as.size() - K; ++l) {
int num = 1;
for (int i = l; i < l + K; ++i) {
num *= as[i];
}
ans = max(ans, num);
}
return ans;
}
int main() {
while (1) {
int N, K;
cin >> N >> K;
if (!N)
break;
vector<int> ns(N);
for (int i = 0; i < N; ++i)
cin >> ns[i];
sort(ns.begin(), ns.end());
int ans = 0;
for (int i = 0; i < N; ++i) {
int rest = K - ns[i];
auto it = lower_bound(ns.begin() + i + 1, ns.end(), rest);
ans += ns.end() - it;
}
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual
///Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int getnum(const vector<int> &as, int K) {
int ans = 0;
for (int l = 0; l <= as.size() - K; ++l) {
int num = 1;
for (int i = l; i < l + K; ++i) {
num *= as[i];
}
ans = max(ans, num);
}
return ans;
}
int main() {
while (1) {
int N, K;
cin >> N >> K;
if (!N)
break;
vector<int> ns(N);
for (int i = 0; i < N; ++i)
cin >> ns[i];
sort(ns.begin(), ns.end());
int ans = 0;
for (int i = 0; i < N; ++i) {
int rest = K - ns[i] + 1;
auto it = lower_bound(ns.begin() + i + 1, ns.end(), rest);
ans += ns.end() - it;
}
cout << ans << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]]
| 1
| 279
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ cout << #a << " = " << a << endl; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
typedef long long ll;
int const inf = 1 << 29;
int main() {
for (int N, S; cin >> N >> S && (N | S);) {
int A[N + 1];
rep(i, N) { cin >> A[i]; }
sort(A, A + N);
A[N] = inf;
ll sum = 0;
rep(i, N - 1) {
int j = lower_bound(A + i + 1, A + N + 1, S - A[i]) - A;
sum += N - j;
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ cout << #a << " = " << a << endl; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
typedef long long ll;
int const inf = 1 << 29;
int main() {
for (int N, S; cin >> N >> S && (N | S);) {
int A[N + 1];
rep(i, N) { cin >> A[i]; }
sort(A, A + N);
A[N] = inf;
ll sum = 0;
rep(i, N - 1) {
int j = upper_bound(A + i + 1, A + N + 1, S - A[i]) - A;
sum += N - j;
}
cout << sum << endl;
}
return 0;
}
|
[["-", 0, 42, 0, 11, 12, 16, 31, 2, 63, 22], ["+", 0, 42, 0, 11, 12, 16, 31, 2, 63, 22]]
| 1
| 257
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e, c + a, b - c[e]);
}
printf("%d\n", s);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e + 1, c + a, b - c[e] + 1);
}
printf("%d\n", s);
}
}
|
[["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 137
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e, c + a, b - c[e]);
}
printf("%d\n", s);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - upper_bound(c + e + 1, c + a, b - c[e]);
}
printf("%d\n", s);
}
}
|
[["-", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 137
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define foreach(c, i) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
enum { kN = 20002 };
int N, S, R[kN];
int main() {
while (scanf("%d%d", &N, &S), N) {
rep(i, N) scanf("%d", R + i);
sort(R, R + N);
int ans = 0;
for (int i = 0; i < N - 1; ++i) {
if (R[i] >= S) {
ans += N - i;
} else {
ans += (R + N) - lower_bound(R + i + 1, R + N, S - R[i] + 1);
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define foreach(c, i) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
enum { kN = 20002 };
int N, S, R[kN];
int main() {
while (scanf("%d%d", &N, &S), N) {
rep(i, N) scanf("%d", R + i);
sort(R, R + N);
int ans = 0;
for (int i = 0; i < N - 1; ++i) {
if (R[i] >= S) {
ans += N - i - 1;
} else {
ans += (R + N) - lower_bound(R + i + 1, R + N, S - R[i] + 1);
}
}
printf("%d\n", ans);
}
return 0;
}
|
[["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 209
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, S, r[20001];
while (cin >> n >> S && (n | S)) {
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r, r + n);
int res = 0;
for (int i = 0; i < n; ++i) {
int begin = distance(r, lower_bound(r, r + n, S - r[i]));
res += n - begin - (begin <= i);
}
cout << res / 2 << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, S, r[20001];
while (cin >> n >> S && (n | S)) {
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r, r + n);
int res = 0;
for (int i = 0; i < n; ++i) {
int begin = distance(r, upper_bound(r, r + n, S - r[i]));
res += n - begin - (begin <= i);
}
cout << res / 2 << endl;
}
return 0;
}
|
[["-", 49, 50, 51, 2, 3, 4, 0, 2, 63, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 2, 63, 22]]
| 1
| 138
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, S, r;
while (cin >> n >> S, n | S) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<int>());
int ans = 0;
for (int i = 0; i < n - 1; i++) {
if (v[i] >= S) {
ans += n - i - 1;
continue;
}
if (v[i] + v[i + 1] < S)
break;
for (int j = i + 1; j < n; j++) {
if (v[i] + v[j] < S)
break;
ans++;
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, S, r;
while (cin >> n >> S, n | S) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<int>());
int ans = 0;
for (int i = 0; i < n - 1; i++) {
if (v[i] > S) {
ans += n - i - 1;
continue;
}
if (v[i] + v[i + 1] <= S)
break;
for (int j = i + 1; j < n; j++) {
if (v[i] + v[j] <= S)
break;
ans++;
}
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]]
| 1
| 196
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
for (;;) {
int n, s;
cin >> n >> s;
if (n == 0)
return 0;
vector<int> r(n);
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r.begin(), r.end());
int j = n - 1;
int ret = 0;
for (int i = 0; i < n; ++i) {
while (j >= 0 && r[i] + r[j] >= s)
--j;
ret += n - 1 - j;
if (r[i] + r[i] >= s)
--ret;
}
ret /= 2;
cout << ret << endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
for (;;) {
int n, s;
cin >> n >> s;
if (n == 0)
return 0;
vector<int> r(n);
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r.begin(), r.end());
int j = n - 1;
int ret = 0;
for (int i = 0; i < n; ++i) {
while (j >= 0 && r[i] + r[j] > s)
--j;
ret += n - 1 - j;
if (r[i] + r[i] > s)
--ret;
}
ret /= 2;
cout << ret << endl;
}
}
|
[["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 198
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s, a;
while (cin >> n >> s, n || s) {
int r[n];
a = 0;
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
sort(r, r + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (r[i] > s)
a += (n - (i + 1));
else
for (int j = i + 1; j < n; ++i) {
if (r[i] + r[j] <= s)
break;
else
++a;
}
}
cout << a << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s, a;
while (cin >> n >> s, n || s) {
int r[n];
a = 0;
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
sort(r, r + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (r[i] > s)
a += (n - (i + 1));
else
for (int j = i + 1; j < n; ++j) {
if (r[i] + r[j] <= s)
break;
else
++a;
}
}
cout << a << endl;
}
return 0;
}
|
[["-", 0, 57, 75, 76, 0, 7, 26, 27, 28, 22], ["+", 0, 57, 75, 76, 0, 7, 26, 27, 28, 22]]
| 1
| 169
|
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int tx[] = {0, 1, 0, -1};
int ty[] = {-1, 0, 1, 0};
static const double EPS = 1e-8;
ll dp[100][100];
ll nCr(int n, int r) {
return dp[n][r] != -1
? dp[n][r]
: dp[n][r] =
(r == 0 || n == r) ? 1 : nCr(n - 1, r) + nCr(n - 1, r - 1);
}
int main() {
int n, S;
memset(dp, -1, sizeof(dp));
while (~scanf("%d %d", &n, &S)) {
if (n == 0)
break;
vector<int> witch;
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
witch.push_back(m);
}
sort(witch.begin(), witch.end());
int res = 0;
for (int m1 = 0; m1 <= 100; m1++) {
for (int m2 = m1; m2 <= 100; m2++) {
if (m1 + m2 <= S)
continue;
int num1 = upper_bound(witch.begin(), witch.end(), m1) -
lower_bound(witch.begin(), witch.end(), m1);
int num2 = upper_bound(witch.begin(), witch.end(), m2) -
lower_bound(witch.begin(), witch.end(), m2);
if (m1 == m2 && num1 != 0)
res += nCr(num1, 2);
else
res += num1 * num2;
}
}
printf("%d\n", res);
}
}
|
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int tx[] = {0, 1, 0, -1};
int ty[] = {-1, 0, 1, 0};
static const double EPS = 1e-8;
ll dp[20000][3];
ll nCr(int n, int r) {
return dp[n][r] != -1
? dp[n][r]
: dp[n][r] =
(r == 0 || n == r) ? 1 : nCr(n - 1, r) + nCr(n - 1, r - 1);
}
int main() {
int n, S;
memset(dp, -1, sizeof(dp));
while (~scanf("%d %d", &n, &S)) {
if (n == 0)
break;
vector<int> witch;
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
witch.push_back(m);
}
sort(witch.begin(), witch.end());
ll res = 0;
for (int m1 = 0; m1 <= 100; m1++) {
for (int m2 = m1; m2 <= 100; m2++) {
if (m1 + m2 <= S)
continue;
int num1 = upper_bound(witch.begin(), witch.end(), m1) -
lower_bound(witch.begin(), witch.end(), m1);
int num2 = upper_bound(witch.begin(), witch.end(), m2) -
lower_bound(witch.begin(), witch.end(), m2);
if (m1 == m2 && num1 != 0)
res += nCr(num1, 2);
else
res += num1 * num2;
}
}
printf("%lld\n", res);
}
}
|
[["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 447
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int I, S;
cin >> I >> S;
if (I == 0 && S == 0) {
break;
}
int *r = new int[I];
int count = 0;
int low, hi, mid;
for (int i = 0; i < I; i++) {
cin >> r[i];
}
/* for(int i = 0; i < I; i++){
low = i + 1;
hi = I;
while(low / hi){
mid = (low + hi) / 2;
if(r[i]){
}
}
}*/
for (int i = 0; i < I - 1; i++) {
for (int j = i + 1; j < I; j++) {
if (r[i] + r[j] >= S) {
count++;
}
}
}
cout << count << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int I, S;
cin >> I >> S;
if (I == 0 && S == 0) {
break;
}
int *r = new int[I];
int count = 0;
int low, hi, mid;
for (int i = 0; i < I; i++) {
cin >> r[i];
}
/* for(int i = 0; i < I; i++){
low = i + 1;
hi = I;
while(low / hi){
mid = (low + hi) / 2;
if(r[i]){
}
}
}*/
for (int i = 0; i < I - 1; i++) {
for (int j = i + 1; j < I; j++) {
if (r[i] + r[j] > S) {
count++;
}
}
}
cout << count << endl;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 150
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(t, i, c) for (t::iterator i = (c).begin(); i != (c).end(); ++i)
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main() {
int n, s;
while (cin >> n >> s, n | s) {
vi r(n);
REP(i, n) { cin >> r[i]; }
sort(ALL(r));
int ans = 0;
REP(i, n) {
ans += r.end() - lower_bound(r.begin() + i + 1, r.end(), s - r[i]);
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(t, i, c) for (t::iterator i = (c).begin(); i != (c).end(); ++i)
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main() {
int n, s;
while (cin >> n >> s, n | s) {
vi r(n);
REP(i, n) { cin >> r[i]; }
sort(ALL(r));
int ans = 0;
REP(i, n) {
ans += r.end() - lower_bound(r.begin() + i + 1, r.end(), s - r[i] + 1);
}
cout << ans << endl;
}
}
|
[["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 304
|
R = 101
while True:
n,S = list(map(int,input().split()))
if n == 0: break
r = [0]*R
for i in range(n):
r[int(input())] += 1
ans = 0
for i in range(R):
if 2*i > S:
ans += r[i]*(r[i]-1)/2
ans += r[i]*sum([r[j] for j in range(max(i+1,S-j+1),R)])
print(ans)
|
R = 101
while True:
n,S = list(map(int,input().split()))
if n == 0: break
r = [0]*R
for i in range(n):
r[int(input())] += 1
ans = 0
for i in range(R):
if 2*i > S:
ans += r[i]*(r[i]-1)/2
ans += r[i]*sum([r[j] for j in range(max(i+1,S-i+1),R)])
print(ans)
|
[["-", 0, 652, 3, 4, 0, 657, 31, 657, 12, 22], ["+", 0, 652, 3, 4, 0, 657, 31, 657, 12, 22]]
| 5
| 132
|
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int C, D, W, X;
int E_table[15][30], F_table[15][30];
int dp[31][51][6];
bool rangeCheck(int area) {
if (area >= 0 && area <= C - 1) {
return true;
} else {
return false;
}
}
void func() {
for (int area = 0; area < C; area++) {
for (int day = 0; day < D; day++)
scanf("%d", &E_table[area][day]);
}
for (int area = 0; area < C; area++) {
for (int day = 0; day < D; day++)
scanf("%d", &F_table[area][day]);
}
for (int day = 0; day <= D; day++) {
for (int futan = 0; futan <= W; futan++) {
for (int num = 0; num <= X; num++) {
dp[day][futan][num] = -1;
}
}
}
dp[0][0][0] = 0;
int ans = 0;
bool FLG;
int tmp_futan, tmp_E;
for (int day = 0; day <= D - 1; day++) {
for (int futan = 0; futan <= W; futan++) {
for (int num = 0; num <= X; num++) {
if (dp[day][futan][num] == -1)
continue;
dp[day + 1][futan][num] =
max(dp[day + 1][futan][num], dp[day][futan][num]);
for (int area = 0; area <= C - 1; area++) {
if (E_table[area][day] == 0 || futan + F_table[area][day] > W)
continue;
dp[day + 1][futan + F_table[area][day]][num] =
max(dp[day + 1][futan + F_table[area][day]][num],
dp[day][futan][num] + E_table[area][day]);
ans = max(ans, dp[day + 1][futan + F_table[area][day]][num]);
if (num == X)
continue;
for (int count = 2; area + count <= C - 1; count++) {
FLG = true;
tmp_futan = 0;
tmp_E = 0;
for (int i = 0; i < count; i++) {
if (rangeCheck(area + i) == false ||
E_table[area + i][day] == 0) {
FLG = false;
break;
}
tmp_futan += F_table[area + i][day];
tmp_E += E_table[area + i][day];
}
if (FLG == false || futan + tmp_futan > W)
continue;
dp[day + 1][futan + tmp_futan][num + 1] =
max(dp[day + 1][futan + tmp_futan][num + 1],
dp[day][futan][num] + tmp_E);
ans = max(ans, dp[day + 1][futan + tmp_futan][num + 1]);
}
}
}
}
}
printf("%d\n", ans);
}
int main() {
while (true) {
scanf("%d %d %d %d", &C, &D, &W, &X);
if (C == 0 && D == 0 && W == 0 && X == 0)
break;
func();
}
return 0;
}
|
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int C, D, W, X;
int E_table[15][30], F_table[15][30];
int dp[31][51][6];
bool rangeCheck(int area) {
if (area >= 0 && area <= C - 1) {
return true;
} else {
return false;
}
}
void func() {
for (int area = 0; area < C; area++) {
for (int day = 0; day < D; day++)
scanf("%d", &E_table[area][day]);
}
for (int area = 0; area < C; area++) {
for (int day = 0; day < D; day++)
scanf("%d", &F_table[area][day]);
}
for (int day = 0; day <= D; day++) {
for (int futan = 0; futan <= W; futan++) {
for (int num = 0; num <= X; num++) {
dp[day][futan][num] = -1;
}
}
}
dp[0][0][0] = 0;
int ans = 0;
bool FLG;
int tmp_futan, tmp_E;
for (int day = 0; day <= D - 1; day++) {
for (int futan = 0; futan <= W; futan++) {
for (int num = 0; num <= X; num++) {
if (dp[day][futan][num] == -1)
continue;
dp[day + 1][futan][num] =
max(dp[day + 1][futan][num], dp[day][futan][num]);
for (int area = 0; area <= C - 1; area++) {
if (E_table[area][day] == 0 || futan + F_table[area][day] > W)
continue;
dp[day + 1][futan + F_table[area][day]][num] =
max(dp[day + 1][futan + F_table[area][day]][num],
dp[day][futan][num] + E_table[area][day]);
ans = max(ans, dp[day + 1][futan + F_table[area][day]][num]);
if (num == X)
continue;
for (int count = 2; area + count <= C; count++) {
FLG = true;
tmp_futan = 0;
tmp_E = 0;
for (int i = 0; i < count; i++) {
if (rangeCheck(area + i) == false ||
E_table[area + i][day] == 0) {
FLG = false;
break;
}
tmp_futan += F_table[area + i][day];
tmp_E += E_table[area + i][day];
}
if (FLG == false || futan + tmp_futan > W)
continue;
dp[day + 1][futan + tmp_futan][num + 1] =
max(dp[day + 1][futan + tmp_futan][num + 1],
dp[day][futan][num] + tmp_E);
ans = max(ans, dp[day + 1][futan + tmp_futan][num + 1]);
}
}
}
}
}
printf("%d\n", ans);
}
int main() {
while (true) {
scanf("%d %d %d %d", &C, &D, &W, &X);
if (C == 0 && D == 0 && W == 0 && X == 0)
break;
func();
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 814
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define tr(it, container) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); ++it)
#define mp(a, b) make_pair((a), (b))
#define eq ==
typedef long long ll;
typedef complex<double> point;
typedef pair<int, int> pii;
// →↑←↓
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
const double EPS = 1e-9;
int main() {
while (true) {
int C, D, W, X;
cin >> C >> D >> W >> X;
if (C == 0)
break;
vector<vector<int>> E(C, vector<int>(D + 1));
vector<vector<int>> F(C, vector<int>(D + 1));
// vector<vector<int> > E(max(C,D)+1,vector<int>(max(C,D)+1));
// vector<vector<int> > F(max(C,D)+1,vector<int>(max(C,D)+1));
for (int i = 0; i < C; i++) {
for (int j = 1; j <= D; j++) {
cin >> E[i][j];
}
}
for (int i = 0; i < C; i++) {
for (int j = 1; j <= D; j++) {
cin >> F[i][j];
}
}
vector<vector<vector<int>>> YOKARI(
D + 1, vector<vector<int>>(1000, vector<int>(100)));
for (int i = 1; i <= D; i++) {
for (int w = 0; w <= W; w++) {
for (int x = 0; x <= X; x++) {
YOKARI[i][w][x] = YOKARI[i - 1][w][x];
}
}
for (int j = 0; j < C; j++) {
if (E[j][i] == 0)
continue;
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
YOKARI[i][F[j][i] + k][l] =
max(YOKARI[i - 1][k][l] + E[j][i], YOKARI[i][F[j][i] + k][l]);
}
}
for (int typ = 0; typ < 2; typ++) {
int nowe = E[j][i], nowf = F[j][i];
if (typ == 0) {
for (int lef = j - 1; lef >= 0; lef--) {
if (E[lef][i] == 0)
continue;
nowe += E[lef][i];
nowf += F[lef][i];
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
// if(nowf + k > W) continue;
// if(l == X) continue;
YOKARI[i][nowf + k][l + 1] = max(YOKARI[i - 1][k][l] + nowe,
YOKARI[i][nowf + k][l + 1]);
}
}
}
} else {
for (int lef = j + 1; lef < C; lef++) {
if (E[lef][i] == 0)
continue;
nowe += E[lef][i];
nowf += F[lef][i];
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
// if(nowf + k > W) continue;
// if(l == X) continue;
YOKARI[i][nowf + k][l + 1] = max(YOKARI[i - 1][k][l] + nowe,
YOKARI[i][nowf + k][l + 1]);
}
}
}
}
}
}
}
int maxi = 0;
for (int i = 0; i <= W; i++) {
for (int j = 0; j <= X; j++) {
maxi = max(YOKARI[D][i][j], maxi);
}
}
cout << maxi << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define tr(it, container) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); ++it)
#define mp(a, b) make_pair((a), (b))
#define eq ==
typedef long long ll;
typedef complex<double> point;
typedef pair<int, int> pii;
// →↑←↓
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
const double EPS = 1e-9;
int main() {
while (true) {
int C, D, W, X;
cin >> C >> D >> W >> X;
if (C == 0)
break;
vector<vector<int>> E(C, vector<int>(D + 1));
vector<vector<int>> F(C, vector<int>(D + 1));
for (int i = 0; i < C; i++) {
for (int j = 1; j <= D; j++) {
cin >> E[i][j];
}
}
for (int i = 0; i < C; i++) {
for (int j = 1; j <= D; j++) {
cin >> F[i][j];
}
}
vector<vector<vector<int>>> YOKARI(
D + 1, vector<vector<int>>(1000, vector<int>(100)));
for (int i = 1; i <= D; i++) {
for (int w = 0; w <= W; w++) {
for (int x = 0; x <= X; x++) {
YOKARI[i][w][x] = YOKARI[i - 1][w][x];
}
}
for (int j = 0; j < C; j++) {
if (E[j][i] == 0)
continue;
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
YOKARI[i][F[j][i] + k][l] =
max(YOKARI[i - 1][k][l] + E[j][i], YOKARI[i][F[j][i] + k][l]);
}
}
for (int typ = 0; typ < 2; typ++) {
int nowe = E[j][i], nowf = F[j][i];
if (typ == 0) {
for (int lef = j - 1; lef >= 0; lef--) {
if (E[lef][i] == 0)
break;
nowe += E[lef][i];
nowf += F[lef][i];
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
// if(nowf + k > W) continue;
// if(l == X) continue;
YOKARI[i][nowf + k][l + 1] = max(YOKARI[i - 1][k][l] + nowe,
YOKARI[i][nowf + k][l + 1]);
}
}
}
} else {
for (int lef = j + 1; lef < C; lef++) {
if (E[lef][i] == 0)
break;
nowe += E[lef][i];
nowf += F[lef][i];
for (int k = 0; k <= W; k++) {
for (int l = 0; l <= X; l++) {
// if(nowf + k > W) continue;
// if(l == X) continue;
YOKARI[i][nowf + k][l + 1] = max(YOKARI[i - 1][k][l] + nowe,
YOKARI[i][nowf + k][l + 1]);
}
}
}
}
}
}
}
int maxi = 0;
for (int i = 0; i <= W; i++) {
for (int j = 0; j <= X; j++) {
maxi = max(YOKARI[D][i][j], maxi);
}
}
cout << maxi << endl;
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94]]
| 1
| 919
|
#include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // require memset
#include <ctime> // require srand
#include <deque>
#include <fstream> // require freopen
#include <functional>
#include <iomanip> // require setw
#include <iostream>
#include <limits>
#include <map>
#include <numeric> // require accumulate
#include <queue>
#include <set>
#include <sstream> // require stringstream
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int C, D, W, X; // C: 地域数 (1 ≦ C ≦ 15 ) D: ツアー数（1 ≦ D ≦ 30 )
// W:負担の合計の最大値 (0 ≦ W ≦ 50 )
// X:ツアー期間中ライブを同じ日に2度以上行える合計日数の上限 ( 0
// ≦ X ≦ 5 )
int E[32][32]; // E[i][j] 地域 i で j 日目にライブを行うことで期待される利益 ( 0
// ≦ E[i][j] ≦ 1000)
int F[32][32]; // F[i][j] 地域 i で j 日目にライブを行うことで掛かる負担 ( 0 ≦
// F[i][j] ≦ 10 )
vector<int> G; // 同じ日にライブを行える地域の取り方の状態
int CC; // 同じ日にライブを行える地域の取り方の状態数
int dp[32][51][6]; // dp[日時][負担数][2度以上行える合計日数]:= 最大の利益
int solve(int d, int w, int x) {
if (d >= D || x > X)
return 0;
if (dp[d][w][x] != -1)
return dp[d][w][x];
int res = solve(d + 1, w, x);
rep(i, CC) {
int cont = (__builtin_popcount(G[i]) > 1);
if (x == X && cont)
continue;
bool ok = true;
int curr_e = 0, curr_w = w;
rep(j, C) {
if (G[i] & (1 << j)) {
if (E[j][d] == 0 || curr_w + F[j][d] > W) {
ok = false;
break;
} else {
curr_e += E[j][d];
curr_w += F[j][d];
} // end if
} // end if
} // end rep
if (ok) {
res = max(res, solve(d + 1, w + curr_w, x + cont) + curr_e);
} // end if
} // end rep
return dp[d][w][x] = res;
}
// ツアーにおける地域の可能な状態を作成する
void calc_status(int C) {
G.clear();
G.push_back(0); // この日はステージはなし
for (int i = 1; i <= C; i++) {
int curr = (1 << C) - 1;
curr -= (1 << (i - 1)) - 1;
for (int j = 1; j <= i; j++) {
G.push_back(curr);
curr >>= 1;
} // end for
} // end for
sort(ALL(G));
CC = G.size();
}
int main() {
ios_base::sync_with_stdio(0);
while (cin >> C >> D >> W >> X, C) {
memset(E, 0, sizeof(E));
memset(F, 0, sizeof(F));
rep(i, C) rep(j, D) cin >> E[i][j];
rep(i, C) rep(j, D) cin >> F[i][j];
calc_status(C);
memset(dp, -1, sizeof(dp));
int res = solve(0, 0, 0);
cout << res << endl;
} // end while
return 0;
}
|
#include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // require memset
#include <ctime> // require srand
#include <deque>
#include <fstream> // require freopen
#include <functional>
#include <iomanip> // require setw
#include <iostream>
#include <limits>
#include <map>
#include <numeric> // require accumulate
#include <queue>
#include <set>
#include <sstream> // require stringstream
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int C, D, W, X; // C: 地域数 (1 ≦ C ≦ 15 ) D: ツアー数（1 ≦ D ≦ 30 )
// W:負担の合計の最大値 (0 ≦ W ≦ 50 )
// X:ツアー期間中ライブを同じ日に2度以上行える合計日数の上限 ( 0
// ≦ X ≦ 5 )
int E[32][32]; // E[i][j] 地域 i で j 日目にライブを行うことで期待される利益 ( 0
// ≦ E[i][j] ≦ 1000)
int F[32][32]; // F[i][j] 地域 i で j 日目にライブを行うことで掛かる負担 ( 0 ≦
// F[i][j] ≦ 10 )
vector<int> G; // 同じ日にライブを行える地域の取り方の状態
int CC; // 同じ日にライブを行える地域の取り方の状態数
int dp[32][51][6]; // dp[日時][負担数][2度以上行える合計日数]:= 最大の利益
int solve(int d, int w, int x) {
if (d >= D || x > X)
return 0;
if (dp[d][w][x] != -1)
return dp[d][w][x];
int res = solve(d + 1, w, x);
rep(i, CC) {
int cont = (__builtin_popcount(G[i]) > 1);
if (x == X && cont)
continue;
bool ok = true;
int curr_e = 0, curr_w = w;
rep(j, C) {
if (G[i] & (1 << j)) {
if (E[j][d] == 0 || curr_w + F[j][d] > W) {
ok = false;
break;
} else {
curr_e += E[j][d];
curr_w += F[j][d];
} // end if
} // end if
} // end rep
if (ok) {
res = max(res, solve(d + 1, curr_w, x + cont) + curr_e);
} // end if
} // end rep
return dp[d][w][x] = res;
}
// ツアーにおける地域の可能な状態を作成する
void calc_status(int C) {
G.clear();
G.push_back(0); // この日はステージはなし
for (int i = 1; i <= C; i++) {
int curr = (1 << C) - 1;
curr -= (1 << (i - 1)) - 1;
for (int j = 1; j <= i; j++) {
G.push_back(curr);
curr >>= 1;
} // end for
} // end for
sort(ALL(G));
CC = G.size();
}
int main() {
ios_base::sync_with_stdio(0);
while (cin >> C >> D >> W >> X, C) {
memset(E, 0, sizeof(E));
memset(F, 0, sizeof(F));
rep(i, C) rep(j, D) cin >> E[i][j];
rep(i, C) rep(j, D) cin >> F[i][j];
calc_status(C);
memset(dp, -1, sizeof(dp));
int res = solve(0, 0, 0);
cout << res << endl;
} // end while
return 0;
}
|
[["-", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 16, 31, 2, 3, 4, 0, 16, 17, 72]]
| 1
| 639
|
import java.util.ArrayList;
import java.util.Scanner;
/**
* Created by kosuke abe on 2014/10/29.
*/
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, Q;
int[] date_info = new int[101];
while (true) {
int result = 0;
Fill(date_info, 0);
N = scan.nextInt();
Q = scan.nextInt();
if (N == 0 && Q == 0) {
break;
}
Count(date_info, N);
System.out.println(Result(date_info, result, Q));
}
}
static void Fill(int[] list, int number) {
for (int i = 0; i < 101; i++) {
list[i] = number;
}
}
static void Count(int[] list, int member) {
for (int i = 0; i < member; i++) {
int day = scan.nextInt();
for (int j = 0; j < day; j++) {
list[scan.nextInt()] += 1;
}
}
}
static int Result(int[] list, int result, int min) {
for (int i = 1; i < 101; i++) {
if (list[i] >= min && list[i] > result) {
result = i;
}
}
return result;
}
}
|
import java.util.ArrayList;
import java.util.Scanner;
/**
* Created by kosuke abe on 2014/10/29.
*/
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, Q;
int[] date_info = new int[101];
while (true) {
int result = 0;
Fill(date_info, 0);
N = scan.nextInt();
Q = scan.nextInt();
if (N == 0 && Q == 0) {
break;
}
Count(date_info, N);
System.out.println(Result(date_info, result, Q));
}
}
static void Fill(int[] list, int number) {
for (int i = 0; i < 101; i++) {
list[i] = number;
}
}
static void Count(int[] list, int member) {
for (int i = 0; i < member; i++) {
int day = scan.nextInt();
for (int j = 0; j < day; j++) {
list[scan.nextInt()] += 1;
}
}
}
static int Result(int[] list, int result, int min) {
for (int i = 1; i < 101; i++) {
if (list[i] >= min && list[i] > list[result]) {
result = i;
}
}
return result;
}
}
|
[["+", 15, 15, 0, 16, 12, 16, 12, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 73]]
| 3
| 292
|
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, q, m, c, i, max;
int[] d;
d = new int[101];
for (;;) {
n = sc.nextInt();
q = sc.nextInt();
if (n == 0 && q == 0)
break;
for (i = 0; i < 101; i++)
d[i] = 0;
for (; n-- > 0;)
for (m = sc.nextInt(); m-- > 0;) {
c = sc.nextInt();
d[c]++;
}
max = 0;
for (i = 0; i < 101; i++)
if (d[i] >= q && max < d[i])
max = i;
out.println(max);
}
sc.close();
}
public static void main(String[] args) {
(new Main()).run(System.in, System.out);
}
}
|
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, q, m, c, i, max;
int[] d;
d = new int[101];
for (;;) {
n = sc.nextInt();
q = sc.nextInt();
if (n == 0 && q == 0)
break;
for (i = 0; i < 101; i++)
d[i] = 0;
for (; n-- > 0;)
for (m = sc.nextInt(); m-- > 0;) {
c = sc.nextInt();
d[c]++;
}
max = 0;
for (i = 0; i < 101; i++) {
if (d[i] >= q && d[max] < d[i])
max = i;
}
out.println(max);
}
sc.close();
}
public static void main(String[] args) {
(new Main()).run(System.in, System.out);
}
}
|
[["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 45], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 73], ["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46]]
| 3
| 244
|
import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
int n = kbd.nextInt();
int m = kbd.nextInt();
if (n != 0 && m != 0) {
int[] date = new int[101];
while (n != 0) {
int s = kbd.nextInt();
while (s != 0) {
int a = kbd.nextInt();
date[a]++;
s--;
}
n--;
}
int ans = 0;
for (int i = 0; i < date.length; i++) {
if (date[i] >= m && ans < date[i])
ans = i;
}
System.out.println(ans);
}
}
}
}
|
import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
int n = kbd.nextInt();
int m = kbd.nextInt();
if (n != 0 && m != 0) {
int[] date = new int[101];
while (n != 0) {
int s = kbd.nextInt();
while (s != 0) {
int a = kbd.nextInt();
date[a]++;
s--;
}
n--;
}
int ans = 0;
for (int i = 0; i < date.length; i++) {
if (date[i] >= m && date[ans] < date[i])
ans = i;
}
System.out.println(ans);
}
}
}
}
|
[["+", 15, 15, 0, 16, 12, 16, 31, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 73]]
| 3
| 185
|
#include <stdio.h>
#include <string.h>
int N, M, Q, i, j, D[101], t;
int main() {
for (; scanf("%d%d", &N, &Q), N;) {
memset(D, 0, sizeof(D));
for (i = 0; i < N; i++)
for (scanf("%d", &M); M--;) {
scanf("%d", &t);
D[t]++;
}
for (i = 0, t = -1; i <= 100; i++)
if ((t == -1 && D[i] >= Q) || (D[i] > D[t]))
t = i;
printf("%d\n", t == -1 ? 0 : t);
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int N, M, Q, i, j, D[101], t;
int main() {
for (; scanf("%d%d", &N, &Q), N;) {
memset(D, 0, sizeof(D));
for (i = 0; i < N; i++)
for (scanf("%d", &M); M--;) {
scanf("%d", &t);
D[t]++;
}
for (i = 0, t = -1; i <= 100; i++)
if ((t == -1 && D[i] >= Q) || (t != -1 && D[i] > D[t]))
t = i;
printf("%d\n", t == -1 ? 0 : t);
}
return 0;
}
|
[["+", 0, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 79], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 98]]
| 0
| 175
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, q;
while (cin >> n >> q, n + q) {
int s[10] = {};
rep(i, n) {
int m;
cin >> m;
rep(j, m) {
int d;
cin >> d;
s[d - 1]++;
}
}
int cnt = -1, p;
rep(i, 10) {
if (cnt < s[i]) {
cnt = s[i];
p = i + 1;
}
}
if (cnt >= q)
cout << p << endl;
else
cout << 0 << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, q;
while (cin >> n >> q, n + q) {
int s[100] = {};
rep(i, n) {
int m;
cin >> m;
rep(j, m) {
int d;
cin >> d;
s[d - 1]++;
}
}
int cnt = -1, p;
rep(i, 100) {
if (cnt < s[i]) {
cnt = s[i];
p = i + 1;
}
}
if (cnt >= q)
cout << p << endl;
else
cout << 0 << endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]]
| 1
| 181
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < n; i++)
#define Forini(i, s, n) for (int i = s; i < n; i++)
#define minusFor(i, n) for (int i = n - 1; i >= 0; i--)
#define minusForend(i, n, s) for (int i = n - 1; i >= s; i--)
const int INF = 10000000000;
using namespace std;
int main() {
int n, q;
while (cin >> n >> q && (n || q)) {
int f[1000];
memset(f, 0, sizeof(bool) * 1000);
for (int i = 0; i < n; i++) {
int tmp1;
cin >> tmp1;
for (int j = 0; j < tmp1; j++) {
int tmp2;
cin >> tmp2;
f[tmp2]++;
}
}
int k = 0;
int Max = -1;
for (int i = 0; i < 1000; i++) {
if (q <= f[i] && Max < f[i]) {
k = i;
Max = f[i];
}
}
cout << k << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < n; i++)
#define Forini(i, s, n) for (int i = s; i < n; i++)
#define minusFor(i, n) for (int i = n - 1; i >= 0; i--)
#define minusForend(i, n, s) for (int i = n - 1; i >= s; i--)
const int INF = 10000000000;
using namespace std;
int main() {
int n, q;
while (cin >> n >> q && (n || q)) {
int f[100];
memset(f, 0, sizeof(int) * 100);
for (int i = 0; i < n; i++) {
int tmp1;
cin >> tmp1;
for (int j = 0; j < tmp1; j++) {
int tmp2;
cin >> tmp2;
f[tmp2]++;
}
}
int k = 0;
int Max = -1;
for (int i = 0; i < 100; i++) {
if (q <= f[i] && Max < f[i]) {
k = i;
Max = f[i];
}
}
cout << k << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 3, 4, 0, 105, 51, 74, 39, 77, 39, 40], ["+", 3, 4, 0, 105, 51, 74, 39, 77, 39, 40], ["-", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["+", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 233
|
#include <iostream>
using namespace std;
int main() {
int n, q, m, i, j, memo;
while (1) {
int x[1000] = {0};
int day[150] = {0};
cin >> n >> q;
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 0; j < m; j++) {
cin >> x[j];
day[x[j]]++;
}
}
int min = 100;
memo = 0;
for (i = 1; i <= 150; i++) {
if (day[i] >= q) {
if (day[i] > memo) {
memo = day[i];
min = i;
}
}
}
if (min == 100) {
cout << "0" << endl;
} else {
cout << min << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, q, m, i, j, memo;
while (1) {
int x[1000] = {0};
int day[150] = {0};
cin >> n >> q;
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 0; j < m; j++) {
cin >> x[j];
day[x[j]]++;
}
}
int min = 100;
memo = 0;
for (i = 1; i <= 149; i++) {
if (day[i] >= q) {
if (day[i] > memo) {
memo = day[i];
min = i;
// break;
}
}
}
if (min == 100) {
cout << "0" << endl;
} else {
cout << min << endl;
}
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 204
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, m, date, ans, max;
while (true) {
cin >> n >> q;
int N[50] = {0};
if (n == 0 && q == 0) {
break;
}
for (int i = 0; i < n; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> date;
N[date - 1] += 1;
}
}
max = 0;
ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (N[i] >= max && N[i] >= q) {
max = N[i];
ans = i + 1;
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, m, date, ans, max;
while (true) {
cin >> n >> q;
int N[100] = {0};
if (n == 0 && q == 0) {
break;
}
for (int i = 0; i < n; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> date;
N[date - 1] += 1;
}
}
max = 0;
ans = 0;
for (int i = 99; i >= 0; --i) {
if (N[i] >= max && N[i] >= q) {
max = N[i];
ans = i + 1;
}
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 175
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define rep(i, n) REP(i, 0, n)
#define REPE(i, s, e) for (int i = s; i > e; i--)
#define repe(i, n) REPE(i, n, -1)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vii;
const int IMAX = ((1 << 30) - 1) * 2 + 1;
const int INF = 100000000;
const double EPS = 1e-10;
// int mod=1000000007
int main() {
int n, q;
while (cin >> n >> q) {
if (n == 0 && q == 0) {
int m, d;
map<int, int> dat;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
dat[d] += 1;
}
}
int Max = 0, ans = 0;
for (map<int, int>::iterator it = dat.begin(); it != dat.end(); it++) {
if (it->second > Max) {
Max = it->second;
ans = it->first;
}
}
if (Max < q)
cout << "0" << endl;
else
cout << ans << endl;
}
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define rep(i, n) REP(i, 0, n)
#define REPE(i, s, e) for (int i = s; i > e; i--)
#define repe(i, n) REPE(i, n, -1)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vii;
const int IMAX = ((1 << 30) - 1) * 2 + 1;
const int INF = 100000000;
const double EPS = 1e-10;
// int mod=1000000007
int main() {
int n, q;
while (cin >> n >> q) {
if (n == 0 && q == 0)
break;
int m, d;
map<int, int> dat;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
dat[d] += 1;
}
}
int Max = 0, ans = 0;
for (map<int, int>::iterator it = dat.begin(); it != dat.end(); it++) {
if (it->second > Max) {
Max = it->second;
ans = it->first;
}
}
if (Max < q)
cout << "0" << endl;
else
cout << ans << endl;
}
}
|
[["-", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 35], ["-", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 343
|
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int N, P;
cin >> N >> P;
if (!N)
break;
vector<int> aa(100);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
while (a--) {
int c;
cin >> c;
aa[c]++;
}
}
int amax = 0;
int ans = 0;
for (int i = 99; i >= 0; --i) {
if (amax <= aa[i]) {
amax = aa[i];
ans = i;
}
}
if (amax != N)
ans = 0;
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int N, P;
cin >> N >> P;
if (!N)
break;
vector<int> aa(100);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
while (a--) {
int c;
cin >> c;
aa[c]++;
}
}
int amax = 0;
int ans = 0;
for (int i = 99; i >= 0; --i) {
if (amax <= aa[i]) {
amax = aa[i];
ans = i;
}
}
if (amax < P)
ans = 0;
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]]
| 1
| 175
|
// 2016-12-01
#include <iostream>
using namespace std;
int main() {
int n, q, m, d;
while (cin >> n >> q, n) {
int c[100] = {};
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
c[d]++;
}
}
int x;
x = 0;
for (int i = 1; i < 100; i++) {
if (c[i] >= q && c[i] > x) {
x = i;
}
}
cout << x << endl;
}
return 0;
}
|
// 2016-12-01
#include <iostream>
using namespace std;
int main() {
int n, q, m, d;
while (cin >> n >> q, n) {
int c[100] = {};
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
c[d]++;
}
}
int x = 0;
for (int i = 1; i < 100; i++) {
if (c[i] >= q && c[i] > c[x]) {
x = i;
}
}
cout << x << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 73]]
| 1
| 143
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
while (cin >> n >> q, n, q) {
int mem[110] = {};
int maxv = -1;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int d;
cin >> d;
mem[d]++;
maxv = max(maxv, d);
}
}
int ans = 0, num = -1;
for (int i = 0; i <= maxv; i++) {
if (ans == -1) {
if (mem[i] >= q) {
ans = i;
num = mem[i];
}
} else if (mem[i] > num) {
ans = i;
num = mem[i];
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
while (cin >> n >> q, n, q) {
int mem[110] = {};
int maxv = -1;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int d;
cin >> d;
mem[d]++;
maxv = max(maxv, d);
}
}
int ans = 0, num = -1;
for (int i = 0; i <= maxv; i++) {
if (ans == 0) {
if (mem[i] >= q) {
ans = i;
num = mem[i];
}
} else if (mem[i] > num) {
ans = i;
num = mem[i];
}
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 192
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
while (N) {
int num[200] = {};
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> L;
num[L]++;
}
}
int box = 0;
for (int i = 1; i <= 100; i++) {
if (num[i] >= M && num[i] > box) {
box = i;
}
}
cout << box << endl;
cin >> N >> M;
}
return 0;
}
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
while (N) {
int num[200] = {};
for (int i = 0; i < N; i++) {
cin >> K;
for (int j = 0; j < K; j++) {
cin >> L;
num[L]++;
}
}
int box = 0;
for (int i = 1; i <= 100; i++) {
if (num[i] >= M && num[i] > num[box]) {
box = i;
}
}
cout << box << endl;
cin >> N >> M;
}
return 0;
}
|
[["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 73]]
| 1
| 236
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
while (1) {
cin >> n >> q;
if (!n && !q)
break;
vector<int> date(3000, 0);
int cou = 0, m;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
scanf("%d", &date[cou++]);
}
}
sort(date.begin(), date.begin() + cou);
int dacou = 1, mada = 0, day;
for (int i = 1; i < cou; i++) {
// cout << date[i-1] << " ";
if (date[i] == date[i - 1]) {
dacou++;
} else {
if (mada < dacou) {
mada = dacou;
day = date[i - 1];
}
dacou = 1;
}
}
// date.erase(date.begin(),date.end());
if (mada < q)
cout << "0\n";
else
cout << day << endl;
}
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
while (1) {
cin >> n >> q;
if (!n && !q)
break;
vector<int> date(100000, 0);
int cou = 0, m;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
scanf("%d", &date[cou++]);
}
}
sort(date.begin(), date.begin() + cou);
int dacou = 1, mada = 0, day;
for (int i = 1; i <= cou; i++) {
// cout << date[i-1] << " ";
if (date[i] == date[i - 1]) {
dacou++;
} else {
if (mada < dacou) {
mada = dacou;
day = date[i - 1];
}
dacou = 1;
}
}
// date.erase(date.begin(),date.end());
if (mada < q)
cout << "0\n";
else
cout << day << endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 226
|
#include <cstdio>
using namespace std;
int main() {
for (int n, q; scanf("%d%d", &n, &q), n;) {
int buc[101] = {};
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int d;
scanf("%d", &d);
buc[d]++;
}
}
int ans = 1;
for (int i = 1; i <= 100; i++) {
if (ans < buc[i])
ans = i;
}
printf("%d\n", buc[ans] < q ? 0 : ans);
}
return 0;
}
|
#include <cstdio>
using namespace std;
int main() {
for (int n, q; scanf("%d%d", &n, &q), n;) {
int buc[101] = {};
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int d;
scanf("%d", &d);
buc[d]++;
}
}
int ans = 1;
for (int i = 1; i <= 100; i++) {
if (buc[ans] < buc[i])
ans = i;
}
printf("%d\n", buc[ans] < q ? 0 : ans);
}
return 0;
}
|
[["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73]]
| 1
| 166
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, q;
for (; cin >> n >> q, n;) {
int day[1000];
memset(day, 0, sizeof(day));
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (; m--;) {
int t;
cin >> t;
day[t]++;
}
}
int out = 0;
for (int i = 1; i < 1000; i++)
if (day[i] >= q && out < day[i])
out = i;
cout << out << endl;
}
}
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, q;
for (; cin >> n >> q, n;) {
int day[100];
memset(day, 0, sizeof(day));
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (; m--;) {
int t;
cin >> t;
day[t]++;
}
}
int out = 0;
for (int i = 1; i < 100; i++)
if (day[i] >= q && day[out] < day[i])
out = i;
cout << out << endl;
}
}
|
[["-", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 73]]
| 1
| 141
|
#include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, Q;
//各テストケースについて
while (cin >> N >> Q) {
if (N == 0 && Q == 0) {
break;
}
vector<vector<int>> members;
int max_day = 0;
//各メンバーの情報について
rep(n, N) {
int m;
cin >> m;
vector<int> days;
rep(i, m) {
int tmp;
cin >> tmp;
days.push_back(tmp);
if (max_day < tmp) {
max_day = tmp;
}
}
members.push_back(days);
}
vector<int> attend;
attend.resize(max_day + 1, 0);
int index = 0;
rep(i, max_day) {
rep(j, N) {
rep(h, members[j].size()) {
if (members[j][h] == i) {
attend[i]++;
}
if (attend[i] > attend[index]) {
index = i;
}
}
}
}
// cout << "atend[]" << endl;
// rep(i, attend.size() ) { cout << attend[i] << " "; }
// cout << " " << endl;
sort(attend.rbegin(), attend.rend());
if (attend[0] < Q) {
index = 0;
}
cout << index << endl;
}
return 0;
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
|
#include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, Q;
//各テストケースについて
while (cin >> N >> Q) {
if (N == 0 && Q == 0) {
break;
}
vector<vector<int>> members;
int max_day = 0;
//各メンバーの情報について
rep(n, N) {
int m;
cin >> m;
vector<int> days;
//各日にちに対して
rep(i, m) {
int tmp;
cin >> tmp;
days.push_back(tmp);
if (max_day < tmp) {
max_day = tmp;
}
}
members.push_back(days);
}
vector<int> attend;
attend.resize(max_day + 1, 0);
int index = 0;
rep(i, max_day + 1) {
rep(j, N) {
rep(h, members[j].size()) {
if (members[j][h] == i) {
attend[i]++;
}
if (attend[i] > attend[index]) {
index = i;
}
}
}
}
// cout << "atend[]" << endl;
// rep(i, attend.size() ) { cout << attend[i] << " "; }
// cout << " " << endl;
sort(attend.rbegin(), attend.rend());
if (attend[0] < Q) {
index = 0;
}
cout << index << endl;
}
return 0;
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]]
| 1
| 307
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr) / sizeof(value), (value))
template <typename T> void FILL_(void *ptr, size_t size, T value) {
std::fill((T *)ptr, (T *)ptr + size, value);
}
// 4方向ベクトル→↑←↓
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
int n, q;
int day;
while (cin >> n >> q, n || q) {
int date[110] = {0};
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
cin >> day;
date[day]++;
}
}
int cday = 0;
int ans = 0;
for (int i = 1; i <= 110; i++) {
if (date[i] > cday && date[i] >= q) {
cday = date[i];
ans = i;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr) / sizeof(value), (value))
template <typename T> void FILL_(void *ptr, size_t size, T value) {
std::fill((T *)ptr, (T *)ptr + size, value);
}
// 4方向ベクトル→↑←↓
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
int n, q;
int day;
while (cin >> n >> q, n || q) {
int date[110] = {0};
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
cin >> day;
date[day]++;
}
}
int cday = 0;
int ans = 0;
for (int i = 1; i < 110; i++) {
if (date[i] > cday && date[i] >= q) {
cday = date[i];
ans = i;
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]]
| 1
| 309
|
#! /usr/bin/env python
# -*- coding: utf-8 -*-
(N, Q) = list(map(int, input().split()))
while N!=0 and Q!=0:
H=[0]*101
for i in range(N):
q = list(map(int, input().split()))
for j in range(len(q)):
H[q[j]] += 1
if Q <= max(H):
print(H.index(max(H)))
else:
print(0)
(N, Q) = list(map(int, input().split()))
|
#! /usr/bin/env python
# -*- coding: utf-8 -*-
(N, Q) = list(map(int, input().split()))
while N!=0 and Q!=0:
H=[0]*101
for i in range(N):
q = list(map(int, input().split()))
for j in range(1, len(q)):
H[q[j]] += 1
if Q <= max(H):
print(H.index(max(H)))
else:
print(0)
(N, Q) = list(map(int, input().split()))
|
[["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]]
| 5
| 131
|
while True:
N, Q = list(map(int, input().split()))
if N == 0 and Q == 0:
break
t = [list(map(int, input().split()))[1:] for _ in range(N)]
table = [[i, 0] for i in range(10)]
for i in t:
for j in i:
table[j][1] += 1
table.sort(reverse=True, key=lambda x: x[1])
print(table[0][0] if table[0][1] >= Q else 0)
|
while True:
N, Q = list(map(int, input().split()))
if N == 0 and Q == 0:
break
t = [list(map(int, input().split()))[1:] for _ in range(N)]
table = [[i, 0] for i in range(101)]
for i in t:
for j in i:
table[j][1] += 1
table.sort(reverse=True, key=lambda x: x[1])
print(table[0][0] if table[0][1] >= Q else 0)
|
[["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612]]
| 5
| 137
|
#include <memory.h>
#include <stdio.h>
int main(void) {
int N, W, H, i, x, y, map[100][100], S, T, o, sum, sum1, max, j;
for (; sum = 0, max = 0, memset(map, 0, sizeof(map)), scanf("%d", &N), N;) {
int W, H;
scanf("%d %d", &W, &H);
for (i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
map[y][x] = 1;
}
scanf("%d %d", &S, &T);
for (i = 1; i <= T; i++)
for (o = 1; o <= S; o++)
sum += map[i][o];
sum1 = sum;
for (i = 1;; max < sum ? (max = sum) : (max = max)) {
for (o = 2; o + S - 1 <= W; o++) {
for (j = 0; j < T; j++) {
sum -= map[i + j][o - 1];
sum += map[i + j][o + S - 1];
}
if (max < sum)
max = sum;
}
i++;
if (i + T - 1 > W)
break;
for (o = 1, j = 0; j < S; j++) {
sum1 -= map[i - 1][o + j];
sum1 += map[i + T - 1][o + j];
}
sum = sum1;
}
printf("%d\n", max);
}
return 0;
}
|
#include <memory.h>
#include <stdio.h>
int main(void) {
int N, W, H, i, x, y, map[100][100], S, T, o, sum, sum1, max, j;
for (; sum = 0, max = 0, memset(map, 0, sizeof(map)), scanf("%d", &N), N;) {
int W, H;
scanf("%d %d", &W, &H);
for (i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
map[y][x] = 1;
}
scanf("%d %d", &S, &T);
for (i = 1; i <= T; i++)
for (o = 1; o <= S; o++)
sum += map[i][o];
sum1 = max = sum;
for (i = 1;; max < sum ? (max = sum) : (max = max)) {
for (o = 2; o + S - 1 <= W; o++) {
for (j = 0; j < T; j++) {
sum -= map[i + j][o - 1];
sum += map[i + j][o + S - 1];
}
if (max < sum)
max = sum;
}
i++;
if (i + T - 1 > H)
break;
for (o = 1, j = 0; j < S; j++) {
sum1 -= map[i - 1][o + j];
sum1 += map[i + T - 1][o + j];
}
sum = sum1;
}
printf("%d\n", max);
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]]
| 0
| 373
|
#include <stdio.h>
#include <stdlib.h>
#define W 100
#define H 100
#define MAX(A, B) ((B) > (A) ? (B) : (A))
int main(int argc, char *argv[]) {
int i, j, k;
for (;;) {
int d[W + 1][H + 1] = {};
int w, h, s, t;
int res = 0;
int n;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d%d", &w, &h);
while (n--) {
int x, y;
scanf("%d%d", &x, &y);
d[x][y] = 1;
}
for (i = 1; i <= w; ++i)
for (j = 1; j <= h; ++j)
d[i][j] += d[i][j - 1];
scanf("%d%d", &s, &t);
for (i = 1; i + s <= w; ++i)
for (j = 0; j + t <= h; ++j) {
int tmp = 0;
for (k = i; k <= i + s; ++k)
tmp += d[k][j + t] - d[k][j];
res = MAX(res, tmp);
}
printf("%d\n", res);
}
return (EXIT_SUCCESS);
}
|
#include <stdio.h>
#include <stdlib.h>
#define W 100
#define H 100
#define MAX(A, B) ((B) > (A) ? (B) : (A))
int main(int argc, char *argv[]) {
int i, j, k;
for (;;) {
int d[W + 1][H + 1] = {};
int w, h, s, t;
int res = 0;
int n;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d%d", &w, &h);
while (n--) {
int x, y;
scanf("%d%d", &x, &y);
d[x][y] = 1;
}
for (i = 1; i <= w; ++i)
for (j = 1; j <= h; ++j)
d[i][j] += d[i][j - 1];
scanf("%d%d", &s, &t);
for (i = 1; i + s - 1 <= w; ++i)
for (j = 0; j + t <= h; ++j) {
int tmp = 0;
for (k = i; k <= i + s - 1; ++k)
tmp += d[k][j + t] - d[k][j];
res = MAX(res, tmp);
}
printf("%d\n", res);
}
return (EXIT_SUCCESS);
}
|
[["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 0
| 298
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int W, H, maze[110][110], sum[110][110] = {0}, S, T, x, y, ans = 0;
cin >> W >> H;
for (int i = 0; i < n; ++i) {
scanf("%d%d", &x, &y);
x--;
y--;
maze[y][x] = 1;
}
cin >> S >> T;
for (int i = 1; i <= H; ++i) {
for (int j = 1; j <= W; ++j) {
sum[i][j] = maze[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1] -
sum[i - 1][j - 1];
}
}
for (int i = 0; i + T <= H; ++i) {
for (int j = 0; j + S <= W; ++j) {
ans = max(ans, sum[i + T][j + S] - sum[i][j + S] - sum[i + T][j] +
sum[i][j]);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int W, H, maze[110][110] = {0}, sum[110][110] = {0}, S, T, x, y, ans = 0;
cin >> W >> H;
for (int i = 0; i < n; ++i) {
scanf("%d%d", &x, &y);
x--;
y--;
maze[y][x] = 1;
}
cin >> S >> T;
for (int i = 1; i <= H; ++i) {
for (int j = 1; j <= W; ++j) {
sum[i][j] = maze[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1] -
sum[i - 1][j - 1];
}
}
for (int i = 0; i + T <= H; ++i) {
for (int j = 0; j + S <= W; ++j) {
ans = max(ans, sum[i + T][j + S] - sum[i][j + S] - sum[i + T][j] +
sum[i][j]);
}
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]]
| 1
| 295
|
#include <algorithm>
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0) {
break;
} else {
int W, H, S, T;
cin >> W >> H;
int map[100][100];
REP(i, N) {
int x, y;
cin >> x >> y;
map[y - 1][x - 1] = 1;
}
cin >> S >> T;
int ans = 0;
for (int l = 0; l < H - T + 1; l++) {
for (int k = 0; k < W - S + 1; k++) {
int n = 0;
for (int i = l; i < l + T; i++) {
for (int j = k; j < k + S; j++) {
if (map[i][j] == 1)
n++;
}
}
ans = max(ans, n);
}
}
cout << ans << endl;
}
}
}
|
#include <algorithm>
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0) {
break;
} else {
int W, H, S, T;
cin >> W >> H;
int map[100][100] = {};
REP(i, N) {
int x, y;
cin >> x >> y;
map[y - 1][x - 1] = 1;
}
cin >> S >> T;
int ans = 0;
for (int l = 0; l < H - T + 1; l++) {
for (int k = 0; k < W - S + 1; k++) {
int n = 0;
for (int i = l; i < l + T; i++) {
for (int j = k; j < k + S; j++) {
if (map[i][j] == 1)
n++;
}
}
ans = max(ans, n);
}
}
cout << ans << endl;
}
}
}
|
[["+", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 46]]
| 1
| 227
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
int P[150][150] = {};
while (1) {
for (int i = 1; i <= 140; i++)
for (int j = 1; j <= 140; j++) {
P[j][i] = 0;
}
cin >> n;
if (n == 0)
break;
int A, B;
cin >> A >> B;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int y;
cin >> y;
P[x][y] = 1;
}
// int PP[505][505]={};
for (int i = 1; i <= B; i++)
for (int j = 2; j <= A; j++) {
P[j][i] += P[j - 1][i];
}
/*
for(int i=1;i<=B;i++){cout<<endl;
for(int j=1;j<=A;j++)
{
cout<<P[j][i];
}}
*/
int a, b;
cin >> a >> b;
int max = 0; /*
for(int i=1;i<=B;i++){cout<<endl;
for(int j=1;j<=A;j++)
{int S=0;//cout<<endl;
for(int I=i;I<=i+b&&I<=B;I++){
int SS=0;
for(int J=j;J<=J+a&&J<=A;J++)
SS+=P[J][I];
if(SS>max)max=SS;
cout<<SS;
}
}
}*/
for (int i = 1; i <= B; i++) { // cout<<endl;
for (int j = 1; j <= A; j++) {
int SS = 0;
for (int I = i; I <= B && I < i + b; I++) {
if (j + a <= A)
SS += P[j + a][I];
else
SS += P[A][I];
SS -= P[j - 1][I];
}
if (SS > max)
max = SS;
// cout<<SS;
}
}
cout << max << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
int P[150][150] = {};
while (1) {
for (int i = 1; i <= 140; i++)
for (int j = 1; j <= 140; j++) {
P[j][i] = 0;
}
cin >> n;
if (n == 0)
break;
int A, B;
cin >> A >> B;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int y;
cin >> y;
P[x][y] = 1;
}
// int PP[505][505]={};
for (int i = 1; i <= B; i++)
for (int j = 2; j <= A; j++) {
P[j][i] += P[j - 1][i];
}
/*
for(int i=1;i<=B;i++){cout<<endl;
for(int j=1;j<=A;j++)
{
cout<<P[j][i];
}}
*/
int a, b;
cin >> a >> b;
int max = 0; /*
for(int i=1;i<=B;i++){cout<<endl;
for(int j=1;j<=A;j++)
{int S=0;//cout<<endl;
for(int I=i;I<=i+b&&I<=B;I++){
int SS=0;
for(int J=j;J<=J+a&&J<=A;J++)
SS+=P[J][I];
if(SS>max)max=SS;
cout<<SS;
}
}
}*/
for (int i = 1; i <= B; i++) { // cout<<endl;
for (int j = 1; j <= A; j++) {
int SS = 0;
for (int I = i; I <= B && I < i + b; I++) {
if (j + a <= A)
SS += P[j + a - 1][I];
else
SS += P[A][I];
SS -= P[j - 1][I];
}
if (SS > max)
max = SS;
// cout<<SS;
}
}
cout << max << endl;
}
return 0;
}
|
[["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 332
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
int grid[101][101] = {0};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
grid[x][y] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 1; i <= w - s + 1; i++) {
for (int j = 1; j <= h - t + 1; j++) {
int sum = 0;
for (int k = 0; k < s; k++) {
for (int l = 0; l < t; l++) {
sum += grid[i + k][j + l];
}
}
ans = max(ans, sum);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int grid[101][101] = {0};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
grid[x][y] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 1; i <= w - s + 1; i++) {
for (int j = 1; j <= h - t + 1; j++) {
int sum = 0;
for (int k = 0; k < s; k++) {
for (int l = 0; l < t; l++) {
sum += grid[i + k][j + l];
}
}
ans = max(ans, sum);
}
}
cout << ans << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 213
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w;
cin >> h;
int area[100][100];
fill(area[0], area[99], 0);
int x, y;
for (int i = 0; i < n; i++) {
cin >> x;
cin >> y;
area[x - 1][y - 1] = 1;
}
int s, t, sum = 0, ans = 0;
cin >> s;
cin >> t;
for (int i = 0; i <= (h - t + 1); i++) {
for (int j = 0; j <= (w - s + 1); j++) {
// sum = 0;
for (int k = 0; k < t; k++) {
for (int l = 0; l < s; l++) {
if (area[i + l][j + k] == 1)
sum++;
}
}
// if(ans < sum) ans = sum;
ans = max(ans, sum);
}
sum = 0;
}
cout << ans << '\n';
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w;
cin >> h;
int area[100][100];
fill(area[0], area[99], 0);
int x, y;
for (int i = 0; i < n; i++) {
cin >> x;
cin >> y;
area[x - 1][y - 1] = 1;
}
int s, t, sum = 0, ans = 0;
cin >> s;
cin >> t;
for (int i = 0; i < (h - t + 1); i++) {
for (int j = 0; j < (w - s + 1); j++) {
for (int k = 0; k < t; k++) {
for (int l = 0; l < s; l++) {
if (area[j + l][i + k] == 1)
sum++;
}
}
ans = max(ans, sum);
sum = 0;
}
}
cout << ans << '\n';
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 246
|
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n && n;) {
int w, h, w0, h0, xy[500][500], r = 0;
cin >> w >> h;
for (int i = 0, a, b; i < n && cin >> a >> b; i++)
xy[b - 1][a - 1] = 1;
cin >> w0 >> h0;
for (int i = 0; i < h - h0 + 1; i++)
for (int j = 0; j < w - w0 + 1; j++) {
int r0 = 0;
for (int k = 0; k < h0; k++)
for (int l = 0; l < w0; l++)
r0 += xy[i + k][j + l];
r = max(r, r0);
}
cout << r << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n && n;) {
int w, h, w0, h0, xy[200][200] = {}, r = 0;
cin >> w >> h;
for (int i = 0, a, b; i < n && cin >> a >> b; i++)
xy[b - 1][a - 1] = 1;
cin >> w0 >> h0;
for (int i = 0; i < h - h0 + 1; i++)
for (int j = 0; j < w - w0 + 1; j++) {
int r0 = 0;
for (int k = 0; k < h0; k++)
for (int l = 0; l < w0; l++)
r0 += xy[i + k][j + l];
r = max(r, r0);
}
cout << r << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]]
| 1
| 201
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define LOOP(i, x, n) for (int i = x; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
signed main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w >> h;
int M[h][w] = {};
REP(i, n) {
int x, y;
cin >> x >> y;
x--;
y--;
M[y][x] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 0; i <= h - s; i++) {
for (int j = 0; j <= w - t; j++) {
int tmp = 0;
for (int y = i; y < i + t; y++) {
for (int x = j; x < j + s; x++) {
if (M[y][x] == 1)
tmp++;
}
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define LOOP(i, x, n) for (int i = x; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
signed main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w >> h;
int M[h][w] = {};
REP(i, n) {
int x, y;
cin >> x >> y;
x--;
y--;
M[y][x] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 0; i <= h - t; i++) {
for (int j = 0; j <= w - s; j++) {
int tmp = 0;
for (int y = i; y < i + t; y++) {
for (int x = j; x < j + s; x++) {
if (M[y][x] == 1)
tmp++;
}
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]]
| 1
| 248
|
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n;
int a[100][100];
cin >> n;
if (n == 0)
break;
lp(i, 100) {
lp(k, 100) { a[i][k] = 0; }
}
int w, h;
cin >> w >> h;
lp(i, n) {
int x, y;
cin >> x >> y;
a[x - 1][y - 1] = 1;
}
int aw, ah;
cin >> aw >> ah;
w -= aw;
h -= ah;
int sum = 0, ans = 0;
lp(i, w) {
lp(j, h) {
sum = 0;
lp(k, aw) {
lp(l, ah) { sum += a[i + h][j + l]; }
}
if (sum > ans)
ans = sum;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n;
int a[100][100];
cin >> n;
if (n == 0)
break;
lp(i, 100) {
lp(k, 100) { a[i][k] = 0; }
}
int w, h;
cin >> w >> h;
lp(i, n) {
int x, y;
cin >> x >> y;
a[x - 1][y - 1] = 1;
}
int aw, ah;
cin >> aw >> ah;
w -= aw;
h -= ah;
int sum = 0, ans = 0;
lp(i, w + 1) {
lp(j, h + 1) {
sum = 0;
lp(k, aw) {
lp(l, ah) { sum += a[i + k][j + l]; }
}
if (sum > ans)
ans = sum;
}
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 22]]
| 1
| 218
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXW = 110, MAXH = 110;
int main() {
int n, w, h, x, y, s, t;
while (cin >> n && n) {
int tile[MAXW][MAXH] = {}, dp[MAXW][MAXH] = {};
cin >> w >> h;
REP(n) {
cin >> x >> y;
tile[x - 1][y - 1] = 1;
}
int ans = 0;
cin >> s >> t;
rep(j, t) rep(i, s) dp[0][0] += tile[i][j];
rep(j, h - t) {
rep(i, w - s) {
dp[i + 1][j] = dp[i][j];
rep(k, t) dp[i + 1][j] -= tile[i][j + k];
rep(k, t) dp[i + 1][j] += tile[i + s][j + k];
}
dp[0][j + 1] = dp[0][j];
rep(k, s) dp[0][j + 1] -= tile[k][j];
rep(k, s) dp[0][j + 1] += tile[k][j + t];
}
rep(j, h - t + 1) rep(i, w - s + 1) ans = max(ans, dp[i][j]);
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXW = 110, MAXH = 110;
int main() {
int n, w, h, x, y, s, t;
while (cin >> n && n) {
int tile[MAXW][MAXH] = {}, dp[MAXW][MAXH] = {};
cin >> w >> h;
REP(n) {
cin >> x >> y;
tile[x - 1][y - 1] = 1;
}
int ans = 0;
cin >> s >> t;
rep(j, t) rep(i, s) dp[0][0] += tile[i][j];
rep(j, h - t + 1) {
rep(i, w - s + 1) {
dp[i + 1][j] = dp[i][j];
rep(k, t) dp[i + 1][j] -= tile[i][j + k];
rep(k, t) dp[i + 1][j] += tile[i + s][j + k];
}
dp[0][j + 1] = dp[0][j];
rep(k, s) dp[0][j + 1] -= tile[k][j];
rep(k, s) dp[0][j + 1] += tile[k][j + t];
}
rep(j, h - t + 1) rep(i, w - s + 1) ans = max(ans, dp[i][j]);
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 379
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
int field[105][105] = {{0}};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
field[y][x] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 1; i <= w - s + 1; i++) {
for (int j = 1; j <= h - t + 1; j++) {
int count = 0;
for (int k = 1; k <= s; k++) {
for (int l = 1; l <= t; l++) {
if (field[j + l][i + k]) {
count++;
}
}
}
ans = max(ans, count);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
int field[105][105] = {{0}};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
field[y][x] = 1;
}
int s, t;
cin >> s >> t;
int ans = 0;
for (int i = 1; i <= w - s + 1; i++) {
for (int j = 1; j <= h - t + 1; j++) {
int count = 0;
for (int k = 0; k < s; k++) {
for (int l = 0; l < t; l++) {
if (field[j + l][i + k]) {
count++;
}
}
}
ans = max(ans, count);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]]
| 1
| 226
|
import java.util.Scanner;
class Bot {
int x = 1, y = 1, dir = 0;
private int width, height;
private int[][] xy = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public Bot(int w, int h) {
width = w;
height = h;
}
public void forward(int step) {
x += xy[dir][0] * step;
y += xy[dir][1] * step;
beProperly();
}
public void backward(int step) {
x -= xy[dir][0] * step;
y -= xy[dir][1] * step;
}
public void right() { dir = (dir + 1) % 4; }
public void left() {
if (--dir == -1)
dir = 3;
}
private void beProperly() {
if (x > width)
x = width;
if (y > height)
y = height;
if (x < 1)
x = 1;
if (y < 1)
y = 1;
}
}
public class Main {
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
while (true) {
int w = sn.nextInt(), h = sn.nextInt();
if (w == 0 && h == 0)
break;
Bot bot = new Bot(w, h);
while (true) {
String cmd = sn.nextLine();
String[] go = cmd.split(" ");
String dir;
if (go.length == 2) {
int step = new Integer(go[1]);
if (go[0].equals("FORWARD"))
bot.forward(step);
else if (go[0].equals("BACKWARD"))
bot.backward(step);
} else {
if (go[0].equals("RIGHT"))
bot.right();
else if (go[0].equals("LEFT"))
bot.left();
else if (go[0].equals("STOP"))
break;
}
}
System.out.println(bot.x + " " + bot.y);
}
}
}
|
import java.util.Scanner;
class Bot {
int x = 1, y = 1, dir = 0;
private int width, height;
private int[][] xy = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public Bot(int w, int h) {
width = w;
height = h;
}
public void forward(int step) {
x += xy[dir][0] * step;
y += xy[dir][1] * step;
beProperly();
}
public void backward(int step) {
x -= xy[dir][0] * step;
y -= xy[dir][1] * step;
beProperly();
}
public void right() { dir = (dir + 1) % 4; }
public void left() {
if (--dir == -1)
dir = 3;
}
private void beProperly() {
if (x > width)
x = width;
if (y > height)
y = height;
if (x < 1)
x = 1;
if (y < 1)
y = 1;
}
}
public class Main {
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
while (true) {
int w = sn.nextInt(), h = sn.nextInt();
if (w == 0 && h == 0)
break;
Bot bot = new Bot(w, h);
while (true) {
String cmd = sn.nextLine();
String[] go = cmd.split(" ");
String dir;
if (go.length == 2) {
int step = new Integer(go[1]);
if (go[0].equals("FORWARD"))
bot.forward(step);
else if (go[0].equals("BACKWARD"))
bot.backward(step);
} else {
if (go[0].equals("RIGHT"))
bot.right();
else if (go[0].equals("LEFT"))
bot.left();
else if (go[0].equals("STOP"))
break;
}
}
System.out.println(bot.x + " " + bot.y);
}
}
}
|
[["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]]
| 3
| 489
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int m, n;
string q;
while (cin >> m >> n, m) {
int x = 1, y = 1, dir = 0, cnt;
while (getline(cin, q), q != "STOP") {
if (q[0] == 'F') {
cnt = atoi(q.substr(8).c_str());
if (dir % 2 == 0) {
cnt = dir == 0 ? cnt : -cnt;
y = min(n, max(0, y + cnt));
} else {
cnt = dir == 1 ? cnt : -cnt;
x = min(m, max(0, x + cnt));
}
} else if (q[0] == 'B') {
cnt = atoi(q.substr(9).c_str());
if (dir % 2 == 0) {
cnt = dir == 0 ? -cnt : cnt;
y = min(n, max(0, y + cnt));
} else {
cnt = dir == 1 ? cnt : cnt;
x = min(m, max(0, x + cnt));
}
} else if (q == "RIGHT")
dir = (dir + 5) % 4;
else if (q == "LEFT")
dir = (dir + 3) % 4;
}
cout << x << ' ' << y << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int m, n;
string q;
while (cin >> m >> n, m) {
int x = 1, y = 1, dir = 0, cnt;
while (getline(cin, q), q != "STOP") {
if (q[0] == 'F') {
cnt = atoi(q.substr(8).c_str());
if (dir % 2 == 0) {
cnt = dir == 0 ? cnt : -cnt;
y = min(n, max(1, y + cnt));
} else {
cnt = dir == 1 ? cnt : -cnt;
x = min(m, max(1, x + cnt));
}
} else if (q[0] == 'B') {
cnt = atoi(q.substr(9).c_str());
if (dir % 2 == 0) {
cnt = dir == 0 ? -cnt : cnt;
y = min(n, max(1, y + cnt));
} else {
cnt = dir == 1 ? -cnt : cnt;
x = min(m, max(1, x + cnt));
}
} else if (q == "RIGHT")
dir = (dir + 5) % 4;
else if (q == "LEFT")
dir = (dir + 3) % 4;
}
cout << x << ' ' << y << endl;
}
return 0;
}
|
[["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 41, 64, 91, 17, 33]]
| 1
| 347
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main() {
int w, h;
while (cin >> w >> h, w || h) {
string s;
int d = 0;
int x = 1, y = 1;
while (cin >> s, s != "STOP") {
int nx, ny;
if (s[0] == 'F') {
int dist;
cin >> dist;
nx = x + dist * dx[d];
ny = y + dist * dy[d];
} else if (s[0] == 'B') {
int dist;
cin >> dist;
nx = x + dist * dx[(d + 2) % 4];
ny = y + dist * dy[(d + 2) % 4];
} else if (s[0] == 'R') {
d = (d + 1) % 4;
} else {
d = (d + 3) % 4;
}
if (nx < 1)
nx = 1;
else if (nx > w)
nx = w;
if (ny < 1)
ny = 1;
else if (ny > h)
ny = h;
x = nx;
y = ny;
}
cout << x << " " << y << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main() {
int w, h;
while (cin >> w >> h, w || h) {
string s;
int d = 0;
int x = 1, y = 1;
while (cin >> s, s != "STOP") {
int nx = x, ny = y;
if (s[0] == 'F') {
int dist;
cin >> dist;
nx = x + dist * dx[d];
ny = y + dist * dy[d];
} else if (s[0] == 'B') {
int dist;
cin >> dist;
nx = x + dist * dx[(d + 2) % 4];
ny = y + dist * dy[(d + 2) % 4];
} else if (s[0] == 'R') {
d = (d + 1) % 4;
} else {
d = (d + 3) % 4;
}
if (nx < 1)
nx = 1;
else if (nx > w)
nx = w;
if (ny < 1)
ny = 1;
else if (ny > h)
ny = h;
x = nx;
y = ny;
}
cout << x << " " << y << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22]]
| 1
| 334
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
main() {
int fx, fy;
while (cin >> fx >> fy) {
if (fx == 0 && fy == 0)
break;
int x = 1, y = 1, dir = 0;
string com = "";
while (cin >> com) {
if (com == "STOP") {
break;
} else if (com == "FORWARD") {
int k;
cin >> k;
x += k * dx[dir];
y += k * dy[dir];
} else if (com == "BACKWORD") {
int k;
cin >> k;
x -= k * dx[dir];
y -= k * dy[dir];
} else if (com == "RIGHT") {
dir = (dir + 1) % 4;
} else if (com == "LEFT") {
dir = (dir + 3) % 4;
}
if (x < 1)
x = 1;
if (y < 1)
y = 1;
if (x > fx)
x = fx;
if (y > fy)
y = fy;
}
cout << x << " " << y << endl;
}
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
main() {
int fx, fy;
while (cin >> fx >> fy) {
if (fx == 0 && fy == 0)
break;
int x = 1, y = 1, dir = 0;
string com = "";
while (cin >> com) {
if (com == "STOP") {
break;
} else if (com == "FORWARD") {
int k;
cin >> k;
x += k * dx[dir];
y += k * dy[dir];
} else if (com == "BACKWARD") {
int k;
cin >> k;
x -= k * dx[dir];
y -= k * dy[dir];
} else if (com == "RIGHT") {
dir = (dir + 1) % 4;
} else if (com == "LEFT") {
dir = (dir + 3) % 4;
}
if (x < 1)
x = 1;
if (y < 1)
y = 1;
if (x > fx)
x = fx;
if (y > fy)
y = fy;
}
cout << x << " " << y << endl;
}
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 5, 0, 6], ["+", 0, 57, 15, 339, 51, 16, 12, 5, 0, 6]]
| 1
| 321
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, P> P2;
const int INF = 1 << 30;
const double EPS = 1E-9;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
int main() {
int w, h;
while (cin >> w >> h && (w || h)) {
string ord;
int y = 1;
int x = 1;
int d = 0;
int m = 0;
bool f = false;
while (cin >> ord && ord != "STOP") {
if (f)
continue;
if (ord == "RIGHT") {
d = (d + 1) % 4;
} else if (ord == "LEFT") {
d = (d + 3) % 4;
} else if (ord == "BACKWARD") {
cin >> m;
y -= m * dy[d];
if (y > h) {
f = true;
y = h;
}
if (y < 1) {
y = 1;
f = true;
}
x -= m * dx[d];
if (x > w) {
f = true;
x = w;
}
if (x < 1) {
f = true;
x = 1;
}
} else {
cin >> m;
y += m * dy[d];
if (y > h) {
f = true;
y = h;
}
if (y < 1) {
f = true;
y = 1;
}
x += m * dx[d];
if (x > w) {
f = true;
x = w;
}
if (x < 1) {
f = true;
x = 1;
}
}
}
cout << x << " " << y << endl;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, P> P2;
const int INF = 1 << 30;
const double EPS = 1E-9;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
int main() {
int w, h;
while (cin >> w >> h && (w || h)) {
string ord;
int y = 1;
int x = 1;
int d = 0;
int m = 0;
bool f = false;
while (cin >> ord && ord != "STOP") {
if (ord == "RIGHT") {
d = (d + 1) % 4;
} else if (ord == "LEFT") {
d = (d + 3) % 4;
} else if (ord == "BACKWARD") {
cin >> m;
y -= m * dy[d];
if (y > h) {
f = true;
y = h;
}
if (y < 1) {
y = 1;
f = true;
}
x -= m * dx[d];
if (x > w) {
f = true;
x = w;
}
if (x < 1) {
f = true;
x = 1;
}
} else {
cin >> m;
y += m * dy[d];
if (y > h) {
f = true;
y = h;
}
if (y < 1) {
f = true;
y = 1;
}
x += m * dx[d];
if (x > w) {
f = true;
x = w;
}
if (x < 1) {
f = true;
x = 1;
}
}
}
cout << x << " " << y << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 57, 15, 339, 51, 22], ["-", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24]]
| 1
| 427
|
#include <iostream>
using namespace std;
int main(void) {
int c, r;
while (cin >> c >> r) {
if (c == 0 && r == 0)
break;
int x = 1, y = 1, n;
int angle = 0;
const int POSX[] = {0, 1, 0, -1};
const int POSY[] = {1, 0, -1, 0};
string s;
while (cin >> s) {
if (s == "FORWARD") {
cin >> n;
int dx = n * POSX[angle];
int dy = n * POSY[angle];
int nx = dx + x;
if (nx < 1)
x = 1;
else if (nx > c)
x = c;
else
x = nx;
int ny = dy + y;
if (ny < 1)
y = 1;
else if (ny > r)
y = r;
else
y = dy;
} else if (s == "BACKWARD") {
cin >> n;
int dx = n * POSX[angle];
int dy = n * POSY[angle];
int nx = x - dx;
if (nx < 1)
x = 1;
else if (nx > c)
x = c;
else
x = nx;
int ny = y - dy;
if (ny < 1)
y = 1;
else if (ny > r)
y = r;
else
y = ny;
} else if (s == "RIGHT")
angle++;
else if (s == "LEFT")
angle--;
else if (s == "STOP")
break;
angle = (angle + 4) % 4;
}
cout << x << " " << y << "\n";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int c, r;
while (cin >> c >> r) {
if (c == 0 && r == 0)
break;
int x = 1, y = 1, n;
int angle = 0;
const int POSX[] = {0, 1, 0, -1};
const int POSY[] = {1, 0, -1, 0};
string s;
while (cin >> s) {
if (s == "FORWARD") {
cin >> n;
int dx = n * POSX[angle];
int dy = n * POSY[angle];
int nx = dx + x;
if (nx < 1)
x = 1;
else if (nx > c)
x = c;
else
x = nx;
int ny = dy + y;
if (ny < 1)
y = 1;
else if (ny > r)
y = r;
else
y = ny;
} else if (s == "BACKWARD") {
cin >> n;
int dx = n * POSX[angle];
int dy = n * POSY[angle];
int nx = x - dx;
if (nx < 1)
x = 1;
else if (nx > c)
x = c;
else
x = nx;
int ny = y - dy;
if (ny < 1)
y = 1;
else if (ny > r)
y = r;
else
y = ny;
} else if (s == "RIGHT")
angle++;
else if (s == "LEFT")
angle--;
else if (s == "STOP")
break;
angle = (angle + 4) % 4;
}
cout << x << " " << y << "\n";
}
return 0;
}
|
[["-", 0, 57, 75, 76, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 22]]
| 1
| 362
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
int mx = 1, my = 1;
int direction = 1;
while (1) {
string command;
int step;
cin >> command;
if (command == "FORWARD") {
cin >> step;
if (direction == 1)
my += step;
else if (direction == 2)
mx += step;
else if (direction == 3)
my -= step;
else if (direction == 4)
mx -= step;
} else if (command == "BACKWARD") {
cin >> step;
if (direction == 1)
my -= step;
else if (direction == 2)
mx -= step;
else if (direction == 3)
my += step;
else if (direction == 4)
mx += step;
} else if (command == "RIGHT") {
direction++;
if (direction == 5)
direction = 1;
} else if (command == "LEFT") {
direction--;
if (direction == 0)
direction = 4;
} else if (command == "STOP")
break;
if (mx < 1)
mx = 1;
else if (mx > n)
mx = m;
if (my < 1)
my = 1;
else if (my > m)
my = m;
}
cout << mx << " " << my << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
int mx = 1, my = 1;
int direction = 1;
while (1) {
string command;
int step;
cin >> command;
if (command == "FORWARD") {
cin >> step;
if (direction == 1)
my += step;
else if (direction == 2)
mx += step;
else if (direction == 3)
my -= step;
else if (direction == 4)
mx -= step;
} else if (command == "BACKWARD") {
cin >> step;
if (direction == 1)
my -= step;
else if (direction == 2)
mx -= step;
else if (direction == 3)
my += step;
else if (direction == 4)
mx += step;
} else if (command == "RIGHT") {
direction++;
if (direction == 5)
direction = 1;
} else if (command == "LEFT") {
direction--;
if (direction == 0)
direction = 4;
} else if (command == "STOP")
break;
if (mx < 1)
mx = 1;
else if (mx > n)
mx = n;
if (my < 1)
my = 1;
else if (my > m)
my = m;
}
cout << mx << " " << my << endl;
}
}
|
[["-", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22]]
| 1
| 291
|
while gets
n, m = $_.split.map(&:to_i)
break if n == 0 && m == 0
x = y = 1
rotate = [0,1]
loop do
str = gets.split
case str[0]
when "FORWARD"
x += rotate[0]*str[1].to_i
y += rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = n if y > n; y = 1 if y < 1
when "BACKWARD"
x -= rotate[0]*str[1].to_i
y -= rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = n if y > n; y = 1 if y < 1
when "RIGHT"
rotate = [rotate[1], -rotate[0]]
when "LEFT"
rotate = [-rotate[1], rotate[0]]
when "STOP"
puts "#{x} #{y}"
break
end
end
end
|
while gets
n, m = $_.split.map(&:to_i)
break if n == 0 && m == 0
x = y = 1
rotate = [0,1]
loop do
str = gets.split
case str[0]
when "FORWARD"
x += rotate[0]*str[1].to_i
y += rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = m if y > m; y = 1 if y < 1
when "BACKWARD"
x -= rotate[0]*str[1].to_i
y -= rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = m if y > m; y = 1 if y < 1
when "RIGHT"
rotate = [rotate[1], -rotate[0]]
when "LEFT"
rotate = [-rotate[1], rotate[0]]
when "STOP"
puts "#{x} #{y}"
break
end
end
end
|
[["-", 0, 763, 8, 749, 0, 751, 8, 662, 12, 22], ["+", 0, 763, 8, 749, 0, 751, 8, 662, 12, 22], ["-", 0, 763, 8, 749, 0, 751, 15, 738, 12, 22], ["+", 0, 763, 8, 749, 0, 751, 15, 738, 12, 22]]
| 4
| 222
|
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
new Main().cal();
}
private void cal() throws IOException {
while (true) {
st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
if (n == 0 && a == 0 && b == 0)
break;
int out = 0;
int temp;
if (a > b) {
temp = a;
a = b;
b = temp;
}
if (a == b || b % a == 0) {
out = n / a;
System.out.println(n - out);
continue;
}
if (a > n) {
System.out.println("0");
continue;
}
out += n / a;
int subs = n % a;
int til;
for (til = 1; til < a; til++) {
if ((til * b) > n || (til * b) % a == 0)
break;
}
for (int i = 1; i < til; i++) {
out += ((n - b * i) / a + 1);
}
System.out.println(n - out);
}
}
}
|
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
new Main().cal();
}
private void cal() throws IOException {
while (true) {
st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
if (n == 0 && a == 0 && b == 0)
break;
int out = 0;
int temp;
if (a > b) {
temp = a;
a = b;
b = temp;
}
if (a == b || b % a == 0) {
out = n / a;
System.out.println(n - out);
continue;
}
if (a > n) {
System.out.println(n);
continue;
}
out += n / a;
int subs = n % a;
int til;
for (til = 1; til < a; til++) {
if ((til * b) > n || (til * b) % a == 0)
break;
}
for (int i = 1; i < til; i++) {
out += ((n - b * i) / a + 1);
}
System.out.println(n - out);
}
}
}
|
[["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 64, 196, 0, 1, 0, 492, 3, 4, 0, 22]]
| 3
| 336
|
#include <stdio.h>
int main() {
int n, a, b, i, c;
while (scanf("%d %d %d", &n, &a, &b), n || a || b) {
char d[2000000] = {1};
for (i = c = 0; i < n; i++) {
if (d[i])
d[i + a] = d[i + b] = 1;
else
c++;
}
printf("%d\n", c);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, a, b, i, c;
while (scanf("%d %d %d", &n, &a, &b), n || a || b) {
char d[2000000] = {1};
for (i = c = 0; i <= n; i++) {
if (d[i])
d[i + a] = d[i + b] = 1;
else
c++;
}
printf("%d\n", c);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 0
| 112
|
#include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int ijk[1010000];
int v[1010000];
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c), a) {
if (b < c)
swap(c, b);
for (int i = 0; i < b; i++)
ijk[i] = 999999999;
for (int i = 0; i < b; i++)
v[i] = 0;
priority_queue<pair<int, int>> Q;
ijk[0] = 0;
Q.push(make_pair(0, 0));
while (Q.size()) {
int cost = -Q.top().first;
int at = Q.top().second;
Q.pop();
if (v[at])
continue;
v[at] = 1;
if (!v[(at + c) % b] && ijk[(at + c) % b] > cost + c) {
ijk[(at + c) % b] = cost + c;
Q.push(make_pair(-cost - c, (at + c) % b));
}
}
int ret = 0;
for (int i = 0; i < b; i++) {
// printf("%d ",ijk[i]);
ret += min((a + b - 1 - i) / b, (ijk[i]) / b);
}
printf("%d\n", ret);
}
}
|
#include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int ijk[1010000];
int v[1010000];
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c), a) {
if (b < c)
swap(c, b);
for (int i = 0; i < b; i++)
ijk[i] = 999999999;
for (int i = 0; i < b; i++)
v[i] = 0;
priority_queue<pair<int, int>> Q;
ijk[0] = 0;
Q.push(make_pair(0, 0));
while (Q.size()) {
int cost = -Q.top().first;
int at = Q.top().second;
Q.pop();
if (v[at])
continue;
v[at] = 1;
if (!v[(at + c) % b] && ijk[(at + c) % b] > cost + c) {
ijk[(at + c) % b] = cost + c;
Q.push(make_pair(-cost - c, (at + c) % b));
}
}
int ret = 0;
for (int i = 0; i < b; i++) {
// printf("%d ",ijk[i]);
ret += min((a + b - i) / b, (ijk[i]) / b);
}
printf("%d\n", ret);
}
}
|
[["-", 0, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33]]
| 1
| 322
|
// AOJ 1105
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef vector<int> Seq;
const int NMAX = 1e7;
int solve(int a, int b, int n) {
bool countable[NMAX];
REP(i, n + 1) { countable[i] = false; }
countable[0] = true;
int unables = 0;
REP(i, n + 1) {
if (countable[i]) {
countable[i + a] = true;
countable[i + b] = true;
} else {
unables++;
}
}
return unables;
}
int main() {
int a, b, n;
while (cin >> n >> a >> b and n + a + b) {
cout << solve(a, b, n) << endl;
}
}
|
// AOJ 1105
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef vector<int> Seq;
const int NMAX = 2000100;
int solve(int a, int b, int n) {
bool countable[NMAX];
REP(i, n + 1) { countable[i] = false; }
countable[0] = true;
int unables = 0;
REP(i, n + 1) {
if (countable[i]) {
countable[i + a] = true;
countable[i + b] = true;
} else {
unables++;
}
}
return unables;
}
int main() {
int a, b, n;
while (cin >> n >> a >> b and n + a + b) {
cout << solve(a, b, n) << endl;
}
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]]
| 1
| 171
|
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool f[1000001];
int main() {
int n, a, b, s, t;
while (cin >> n >> a >> b, n) {
rep(i, n) f[i] = 1;
rep(j, a) for (t = b * j; t <= n; t += a) f[t] = 0;
s = 0;
rep(i, n) s += f[i + 1];
cout << s << endl;
}
return 0;
}
|
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool f[1000001];
int main() {
int n, a, b, s, t;
while (cin >> n >> a >> b, n) {
rep(i, n + 1) f[i] = 1;
rep(j, a) for (t = b * j; t <= n; t += a) f[t] = 0;
s = 0;
rep(i, n) s += f[i + 1];
cout << s << endl;
}
return 0;
}
|
[["+", 31, 69, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 122
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int f[101];
int n, a, b, c;
int i, j;
while (cin >> n >> a >> b, n || a || b) {
memset(f, 1, sizeof(int) * 101);
for (i = 0; i <= n; i += a)
if (f[i])
for (j = i; j <= n; j += b)
f[j] = 0;
c = 0;
for (i = 1; i <= n; i++)
if (f[i])
c++;
cout << c << endl;
}
}
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int f[1000001];
int n, a, b, c;
int i, j;
while (cin >> n >> a >> b, n || a || b) {
memset(f, 1, sizeof(int) * 1000001);
for (i = 0; i <= n; i += a)
if (f[i])
for (j = i; j <= n; j += b)
f[j] = 0;
c = 0;
for (i = 1; i <= n; i++)
if (f[i])
c++;
cout << c << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["+", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13]]
| 1
| 141
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, a, b;
while (cin >> n >> a >> b && n != 0) {
bool ok[1000001];
memset(ok, false, sizeof(ok));
int ans = 0;
ok[0] = true;
for (int i = 0; i < n; i++) {
if (ok[i]) {
if (i + a <= n)
ok[i + a] = true;
if (i + b <= n)
ok[i + b] = true;
} else
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, a, b;
while (cin >> n >> a >> b && n != 0) {
bool ok[1000001];
memset(ok, false, sizeof(ok));
int ans = 0;
ok[0] = true;
for (int i = 0; i <= n; i++) {
if (ok[i]) {
if (i + a <= n)
ok[i + a] = true;
if (i + b <= n)
ok[i + b] = true;
} else
ans++;
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 139
|
#include <iostream>
using namespace std;
int main() {
int map[1500000];
long n, a, b, ans;
while (1) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
for (long i = 1; i < n + 1; i++) {
map[i] = 1;
}
map[0] = 0;
for (long i = 0; i < n + 1; i++) {
if (map[i] == 0) {
map[i + a] = 0;
map[i + b] = 0;
}
}
ans = 0;
for (long i = 0; i < n + 1; i++) {
ans += map[i];
}
cout << endl << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int map[1500000];
long n, a, b, ans;
while (1) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
for (long i = 1; i < n + 1; i++) {
map[i] = 1;
}
map[0] = 0;
for (long i = 0; i < n + 1; i++) {
if (map[i] == 0) {
map[i + a] = 0;
map[i + b] = 0;
}
}
ans = 0;
for (long i = 0; i < n + 1; i++) {
ans += map[i];
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 176
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, s, e) for (int i = int(s); i <= int(e); i++)
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define pi 3.14159265358979
int e[1000010];
int main(void) {
int n, a, b;
for (;;) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
if (a > b)
swap(a, b);
e[0] = 1;
for (int i = 0; i + a <= n; i++) {
if (e[i] == 1)
e[i + a] = 1;
}
for (int i = 0; i + b <= n; i++) {
if (e[i] == 1)
e[i + b] = 1;
}
int c = 0;
for (int i = 0; i < n; i++)
if (e[i] == 0)
c++;
cout << c << endl;
for (int i = 0; i < n; i++)
e[i] = 0;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, s, e) for (int i = int(s); i <= int(e); i++)
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define pi 3.14159265358979
int e[1000010];
int main(void) {
int n, a, b;
for (;;) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
if (a > b)
swap(a, b);
e[0] = 1;
for (int i = 0; i + a <= n; i++) {
if (e[i] == 1)
e[i + a] = 1;
}
for (int i = 0; i + b <= n; i++) {
if (e[i] == 1)
e[i + b] = 1;
}
int c = 0;
for (int i = 1; i <= n; i++)
if (e[i] == 0)
c++;
cout << c << endl;
for (int i = 1; i <= n; i++)
e[i] = 0;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 263
|
#include <algorithm>
#include <iostream>
using namespace std;
int n, a, b;
bool nr[1000003];
int main() {
cin >> n >> a >> b;
while (n + a + b > 0) {
fill(nr + 1, nr + n, 1);
for (int i = 0; i <= n; i++) {
if (!nr[i]) {
if (i + a <= n)
nr[i + a] = 0;
if (i + b <= n)
nr[i + b] = 0;
}
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
ans += nr[i];
}
cout << ans << endl;
cin >> n >> a >> b;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int n, a, b;
bool nr[1000003];
int main() {
cin >> n >> a >> b;
while (n + a + b > 0) {
fill(nr + 1, nr + n + 1, 1);
for (int i = 0; i <= n; i++) {
if (!nr[i]) {
if (i + a <= n)
nr[i + a] = 0;
if (i + b <= n)
nr[i + b] = 0;
}
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
ans += nr[i];
}
cout << ans << endl;
cin >> n >> a >> b;
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 167
|
#include <stdio.h>
/* 最大公約数を返す */
int gcd(int a, int b) {
int r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return (a < 0) ? -a : a;
}
/* 値を入れ換える */
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main(void) {
int a, b, c; /* 与えられる値 */
int p, q, r, s;
int f; /* 解が存在するか */
/* データセット毎の処理 */
while (scanf("%d%d%d", &a, &b, &c) == 3 && a > 0) {
int d = b * b - 4 * a * c; /* 二次方程式の判別式D */
f = 0;
if (d == 0) {
int g;
/* 重解 -b / 2a */
f = 1;
p = 2 * a;
q = b; /* 符号に注意 */
/* 約分 */
g = gcd(p, q);
p /= g;
q /= g;
r = p;
s = q;
} else if (d > 0) {
/* 異なる二つの実数解 (-b +- √d) / 2a */
int i;
for (i = 1; i * i < d; i++)
; /* D の正整数平方根を求める */
/* Dの平方根が整数であるなら整数 p, q, r, s が存在する */
if (i * i == d) {
int g;
f = 1;
p = 2 * a;
r = 2 * a;
q = -(-b - i);
s = -(-b + i);
/* 約分 */
g = gcd(p, q);
p /= g;
q /= g;
g = gcd(r, s);
r /= g;
s /= g;
/* 問題の条件に合わせて解の順番を入れ換える */
/* if (!(p > r || (p = r && q >= s))) { */
if (p > r || (p = r && q >= s)) {
swap(&p, &r);
swap(&q, &s);
}
}
}
/* 結果を出力する */
if (f)
printf("%d %d %d %d\n", p, q, r, s);
else
printf("Impossible\n");
}
return 0;
}
|
#include <stdio.h>
/* 最大公約数を返す */
int gcd(int a, int b) {
int r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return (a < 0) ? -a : a;
}
/* 値を入れ換える */
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main(void) {
int a, b, c; /* 与えられる値 */
int p, q, r, s;
int f; /* 解が存在するか */
/* データセット毎の処理 */
while (scanf("%d%d%d", &a, &b, &c) == 3 && a > 0) {
int d = b * b - 4 * a * c; /* 二次方程式の判別式D */
f = 0;
if (d == 0) {
int g;
/* 重解 -b / 2a */
f = 1;
p = 2 * a;
q = b; /* 符号に注意 */
/* 約分 */
g = gcd(p, q);
p /= g;
q /= g;
r = p;
s = q;
} else if (d > 0) {
/* 異なる二つの実数解 (-b +- √d) / 2a */
int i;
for (i = 1; i * i < d; i++)
; /* D の正整数平方根を求める */
/* Dの平方根が整数であるなら整数 p, q, r, s が存在する */
if (i * i == d) {
int g;
f = 1;
p = 2 * a;
r = 2 * a;
q = -(-b - i);
s = -(-b + i);
/* 約分 */
g = gcd(p, q);
p /= g;
q /= g;
g = gcd(r, s);
r /= g;
s /= g;
/* 問題の条件に合わせて解の順番を入れ換える */
if (!(p > r || (p == r && q >= s))) {
swap(&p, &r);
swap(&q, &s);
}
}
}
/* 結果を出力する */
if (f)
printf("%d %d %d %d\n", p, q, r, s);
else
printf("Impossible\n");
}
return 0;
}
|
[["+", 64, 9, 0, 57, 15, 23, 0, 91, 17, 111], ["+", 0, 57, 15, 23, 0, 91, 28, 23, 0, 24], ["-", 15, 23, 0, 16, 12, 23, 0, 11, 17, 32], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 0, 91, 28, 23, 0, 16, 12, 23, 0, 25]]
| 0
| 394
|
#include <assert.h>
main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (c == 0) {
if (a == 1 && b > 0)
printf("1 0 %d %d\n", a, b);
else
printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0) {
for (p = a / r, s = 1; s * s <= abs(c); s++)
if (c % s == 0) {
for (i = 0; i < 2; i++, s = -s)
if (q = c / s, p * s + q * r == b) {
if (p == r && q < s)
printf("%d %d %d %d\n", r, s, p, q);
else
printf("%d %d %d %d\n", p, q, r, s);
goto next;
}
}
}
puts("Impossible");
next:;
}
exit(0);
}
|
#include <assert.h>
main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 %d %d\n", a, b);
else
printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0) {
for (p = a / r, s = 1; s <= abs(c); s++)
if (c % s == 0) {
for (i = 0; i < 2; i++, s = -s)
if (q = c / s, p * s + q * r == b) {
if (p == r && q < s)
printf("%d %d %d %d\n", r, s, p, q);
else
printf("%d %d %d %d\n", p, q, r, s);
goto next;
}
}
}
puts("Impossible");
next:;
}
exit(0);
}
|
[["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 31, 22], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 17, 48]]
| 0
| 250
|
main(a, b, c, p, q, r, s, S, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (!c) {
a == 1 && b < 0 ? printf("1 0 %d %d\n", a, b)
: printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0)
for (p = a / r, S = 1; s <= abs(c); s++)
if (c % s == 0)
for (i = 0; i < 2; i++, s = -s)
if (q = c / s, p * s + q * r == b) {
if (p == r && q < s)
printf("%d %d %d %d\n", r, s, p, q);
else
printf("%d %d %d %d\n", p, q, r, s);
goto next;
}
puts("Impossible");
next:;
}
exit(0);
}
|
main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (!c) {
a == 1 && b < 0 ? printf("1 0 %d %d\n", a, b)
: printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0)
for (p = a / r, s = 1; s <= abs(c); s++)
if (c % s == 0)
for (i = 0; i < 2; i++, s = -s)
if (q = c / s, p * s + q * r == b) {
if (p == r && q < s)
printf("%d %d %d %d\n", r, s, p, q);
else
printf("%d %d %d %d\n", p, q, r, s);
goto next;
}
puts("Impossible");
next:;
}
exit(0);
}
|
[["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 57, 64, 7, 10, 34, 12, 11, 31, 22], ["+", 8, 57, 64, 7, 10, 34, 12, 11, 31, 22]]
| 0
| 240
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
const double EPS = 1e-6;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) a.rbegin(), a.rend()
#define FLL(a, b) memset((a), b, sizeof(a))
#define CLR(a) FLL(a, 0)
#define declare(a, it) __typeof(a) it = (a)
#define FOR(it, a) for (declare(a.begin(), it); it != a.end(); ++it)
#define FORR(it, a) for (declare(a.rbegin(), it); it != a.rend(); ++it)
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
return o << "(" << v.F << ", " << v.S << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
rep(i, SZ(v)) o << (i ? ", " : "") << v[i];
return o << "}";
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, -1, 1, 1, -1};
int s2i(string &a) {
stringstream ss(a);
int r;
ss >> r;
return r;
}
int geti() {
int n;
scanf("%d", &n);
return n;
}
int main(int argc, char *argv[]) {
ll a, b, c;
while (cin >> a >> b >> c && (a || b || c)) {
assert(a);
if (c == 0) {
if (a > 1)
cout << a << " " << b << " 1 0" << endl;
else
cout << a << " " << min(b, 0LL) << " 1 " << max(b, 0LL) << endl;
continue;
}
vector<int> dic;
for (int j = 1; j * j <= abs(c); ++j) {
if (c % j)
continue;
dic.pb(j);
dic.pb(c / j);
dic.pb(-j);
dic.pb(-c / j);
}
for (ll i = 1; i * i <= a; ++i) {
if (a % i)
continue;
ll p = a / i;
ll r = i;
for (int j = 0; j < (int)dic.size(); ++j) {
ll q = dic[j];
ll s = c / q;
if (p == r && q < s)
swap(q, s);
// cout << p << " " << q << " " << r << " " << s << endl;
if (p * s + q * r == b) {
assert((p > r) || (p == r && q >= s));
cout << p << " " << q << " " << r << " " << s << endl;
goto END;
}
}
}
cout << "Impossible" << endl;
END:;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
const double EPS = 1e-6;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) a.rbegin(), a.rend()
#define FLL(a, b) memset((a), b, sizeof(a))
#define CLR(a) FLL(a, 0)
#define declare(a, it) __typeof(a) it = (a)
#define FOR(it, a) for (declare(a.begin(), it); it != a.end(); ++it)
#define FORR(it, a) for (declare(a.rbegin(), it); it != a.rend(); ++it)
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
return o << "(" << v.F << ", " << v.S << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
rep(i, SZ(v)) o << (i ? ", " : "") << v[i];
return o << "}";
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, -1, 1, 1, -1};
int s2i(string &a) {
stringstream ss(a);
int r;
ss >> r;
return r;
}
int geti() {
int n;
scanf("%d", &n);
return n;
}
int main(int argc, char *argv[]) {
ll a, b, c;
while (cin >> a >> b >> c && (a || b || c)) {
assert(a);
if (c == 0) {
if (a > 1)
cout << a << " " << b << " 1 0" << endl;
else
cout << a << " " << max(b, 0LL) << " 1 " << min(b, 0LL) << endl;
continue;
}
vector<int> dic;
for (int j = 1; j * j <= abs(c); ++j) {
if (c % j)
continue;
dic.pb(j);
dic.pb(c / j);
dic.pb(-j);
dic.pb(-c / j);
}
for (ll i = 1; i * i <= a; ++i) {
if (a % i)
continue;
ll p = a / i;
ll r = i;
for (int j = 0; j < (int)dic.size(); ++j) {
ll q = dic[j];
ll s = c / q;
if (p == r && q < s)
swap(q, s);
// cout << p << " " << q << " " << r << " " << s << endl;
if (p * s + q * r == b) {
assert((p > r) || (p == r && q >= s));
cout << p << " " << q << " " << r << " " << s << endl;
goto END;
}
}
}
cout << "Impossible" << endl;
END:;
}
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["+", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22]]
| 1
| 660
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#define mp make_pair
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
using namespace std;
int D, a, b, c, p, q, r, s, g1, g2;
bool cek;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
/*bool cek()
{
for(int z=1;z*z<=D;z++)
{
if(z*z==D)
{
printf("tes\n");
return true;
}
}
return false;
}*/
int main() {
while (scanf("%d%d%d", &a, &b, &c), (a || b || c)) {
cek = true;
D = b * b - (4 * a * c);
if (a == 0 && b == 0 && c == 0)
break;
for (int z = 1; z * z <= D; z++) {
if (z * z == D) {
// printf("tes\n");
cek = false;
break;
}
}
if (D < 0 || cek) {
// printf("Impossible\n");
puts("Impossible");
continue;
}
// printf("%d\n",D);
else {
p = 2 * a;
q = -(-b + sqrt(D));
r = 2 * a;
s = -(-b - sqrt(D));
g1 = gcd(p, q);
g2 = gcd(r, s);
p /= g1;
q /= g1;
r /= g2;
s /= g2;
if (p < 0) {
p *= -1;
q *= -1;
}
if (r < 0) {
r *= -1;
s *= -1;
}
if (p < r || (p == r && q < s)) {
swap(p, r);
swap(q, s);
swap(g1, g2);
}
printf("%d %d %d %d\n", p, q, r, s);
}
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#define mp make_pair
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
using namespace std;
int D, a, b, c, p, q, r, s, g1, g2;
bool cek;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
/*bool cek()
{
for(int z=1;z*z<=D;z++)
{
if(z*z==D)
{
printf("tes\n");
return true;
}
}
return false;
}*/
int main() {
while (scanf("%d%d%d", &a, &b, &c), (a || b || c)) {
cek = true;
D = b * b - (4 * a * c);
if (a == 0 && b == 0 && c == 0)
break;
for (int z = 0; z * z <= D; z++) {
if (z * z == D) {
// printf("tes\n");
cek = false;
break;
}
}
if (D < 0 || cek) {
// printf("Impossible\n");
puts("Impossible");
continue;
}
// printf("%d\n",D);
else {
p = 2 * a;
q = -(-b + sqrt(D));
r = 2 * a;
s = -(-b - sqrt(D));
g1 = gcd(p, q);
g2 = gcd(r, s);
p /= g1;
q /= g1;
r /= g2;
s /= g2;
if (p < 0) {
p *= -1;
q *= -1;
}
if (r < 0) {
r *= -1;
s *= -1;
}
if (p < r || (p == r && q < s)) {
swap(p, r);
swap(q, s);
swap(g1, g2);
}
printf("%d %d %d %d\n", p, q, r, s);
}
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 387
|
#include <iostream>
#include <vector>
using namespace std;
int a, b, c;
vector<int> p, q;
int main() {
while (true) {
cin >> a >> b >> c;
p.clear();
q.clear();
if (a == 0)
break;
if (c == 0) {
if (b < 0)
cout << a << " "
<< "0"
<< " "
<< "1"
<< " " << b << endl;
else {
cout << a << ' ' << b << ' ' << "1" << ' ' << "0" << endl;
}
goto E;
}
for (int i = -10000; i <= 10000; i++) {
if (i == 0)
continue;
if (a % i == 0)
p.push_back(i);
if (c % i == 0)
q.push_back(i);
}
for (int i = 0; i < p.size(); i++) {
for (int j = 0; j < q.size(); j++) {
int sum = p[i] * (c / q[j]) + (a / p[i]) * q[j];
if (p[i] < a / p[i] || p[i] < 0 || a / p[i] < 0)
continue;
if (p[i] == a / p[i] && q[j] < c / q[j])
continue;
if (sum == b) {
cout << p[i] << ' ' << q[j] << ' ' << a / p[i] << ' ' << c / q[j]
<< endl;
goto E;
}
}
}
cout << "Impossible" << endl;
E:;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int a, b, c;
vector<int> p, q;
int main() {
while (true) {
cin >> a >> b >> c;
p.clear();
q.clear();
if (a == 0)
break;
if (c == 0) {
if (b < 0 && a == 1)
cout << a << " "
<< "0"
<< " "
<< "1"
<< " " << b << endl;
else {
cout << a << ' ' << b << ' ' << "1" << ' ' << "0" << endl;
}
goto E;
}
for (int i = -10000; i <= 10000; i++) {
if (i == 0)
continue;
if (a % i == 0)
p.push_back(i);
if (c % i == 0)
q.push_back(i);
}
for (int i = 0; i < p.size(); i++) {
for (int j = 0; j < q.size(); j++) {
int sum = p[i] * (c / q[j]) + (a / p[i]) * q[j];
if (p[i] < a / p[i] || p[i] < 0 || a / p[i] < 0)
continue;
if (p[i] == a / p[i] && q[j] < c / q[j])
continue;
if (sum == b) {
cout << p[i] << ' ' << q[j] << ' ' << a / p[i] << ' ' << c / q[j]
<< endl;
goto E;
}
}
}
cout << "Impossible" << endl;
E:;
}
return 0;
}
|
[["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 389
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, P> P2;
const int INF = 1 << 30;
const double EPS = 1E-9;
int main() {
int a, b, c;
while (cin >> a >> b >> c && (a || b || c)) {
vector<int> vp;
vector<int> vq;
for (int i = 1; i <= abs(a); i++) {
if (a % i == 0)
vp.push_back(i);
}
for (int i = 1; i <= abs(c); i++) {
if (abs(c) % i == 0)
vq.push_back(i);
}
int p, q, r, s;
bool f = false;
if (c != 0) {
for (int i = 0; i < (int)vp.size(); i++) {
p = vp[i];
r = a / p;
if (p < r)
continue;
for (int j = vq.size() - 1; j >= 0; j--) {
q = vq[j];
s = c / q;
if (b == p * s + q * r) {
f = true;
break;
}
}
if (f)
break;
for (int j = 0; j < (int)vq.size(); j++) {
q = -vq[j];
s = c / q;
if (b == p * s + q * r) {
f = true;
break;
}
}
if (f)
break;
}
if (f) {
cout << p << " " << q << " " << r << " " << s << endl;
} else {
cout << "Impossible" << endl;
}
} else {
if (b == 0) {
cout << a << " " << 0 << " " << 1 << " " << 0 << endl;
} else {
if (a == 1 && b < 0) {
cout << 1 << " " << 0 << " " << 1 << " " << -b << endl;
} else {
cout << a << " " << b << " " << 1 << " " << 0 << endl;
}
}
}
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, P> P2;
const int INF = 1 << 30;
const double EPS = 1E-9;
int main() {
int a, b, c;
while (cin >> a >> b >> c && (a || b || c)) {
vector<int> vp;
vector<int> vq;
for (int i = 1; i <= abs(a); i++) {
if (a % i == 0)
vp.push_back(i);
}
for (int i = 1; i <= abs(c); i++) {
if (abs(c) % i == 0)
vq.push_back(i);
}
int p, q, r, s;
bool f = false;
if (c != 0) {
for (int i = 0; i < (int)vp.size(); i++) {
p = vp[i];
r = a / p;
if (p < r)
continue;
for (int j = vq.size() - 1; j >= 0; j--) {
q = vq[j];
s = c / q;
if (b == p * s + q * r) {
f = true;
break;
}
}
if (f)
break;
for (int j = 0; j < (int)vq.size(); j++) {
q = -vq[j];
s = c / q;
if (b == p * s + q * r) {
f = true;
break;
}
}
if (f)
break;
}
if (f) {
cout << p << " " << q << " " << r << " " << s << endl;
} else {
cout << "Impossible" << endl;
}
} else {
if (b == 0) {
cout << a << " " << 0 << " " << 1 << " " << 0 << endl;
} else {
if (a == 1 && b < 0) {
cout << 1 << " " << 0 << " " << 1 << " " << b << endl;
} else {
cout << a << " " << b << " " << 1 << " " << 0 << endl;
}
}
}
}
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 12, 91, 17, 33]]
| 1
| 532
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
void solve(int a, int b, int c) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 1 %d\n", b);
else
printf("%d %d 1 0\n", a, b);
return;
}
vector<int> ps, qs;
for (int i = 1; i <= a; i++)
if (a % i == 0)
ps.push_back(i);
for (int i = 1; i <= c; i++)
if (c % i == 0) {
qs.push_back(i);
qs.push_back(-i);
}
sort(ps.begin(), ps.end(), greater<int>());
sort(qs.begin(), qs.end(), greater<int>());
for (int i = 0; i < ps.size(); i++)
for (int j = 0; j < qs.size(); j++) {
int p = ps[i], r = a / p;
int q = qs[j], s = c / q;
if (p * s + r * q == b) {
printf("%d %d %d %d\n", p, q, r, s);
return;
}
}
puts("Impossible");
}
int main() {
for (int a, b, c; cin >> a >> b >> c, a | b | c;)
solve(a, b, c);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
void solve(int a, int b, int c) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 1 %d\n", b);
else
printf("%d %d 1 0\n", a, b);
return;
}
vector<int> ps, qs;
for (int i = 1; i <= a; i++)
if (a % i == 0)
ps.push_back(i);
for (int i = 1; i <= abs(c); i++)
if (c % i == 0) {
qs.push_back(i);
qs.push_back(-i);
}
sort(ps.begin(), ps.end(), greater<int>());
sort(qs.begin(), qs.end(), greater<int>());
for (int i = 0; i < ps.size(); i++)
for (int j = 0; j < qs.size(); j++) {
int p = ps[i], r = a / p;
int q = qs[j], s = c / q;
if (p * s + r * q == b) {
printf("%d %d %d %d\n", p, q, r, s);
return;
}
}
puts("Impossible");
}
int main() {
for (int a, b, c; cin >> a >> b >> c, a | b | c;)
solve(a, b, c);
return 0;
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]]
| 1
| 336
|
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equal(a, b) (fabs(a - b) < EPS)
#define MAX_N 400
#define INF 1e9
#define lt(a, b) (a - b < -EPS)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }
Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }
Point operator*(const double &k) const { return Point(x * k, y * k); }
Point operator/(const double &k) const { return Point(x / k, y / k); }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
};
double dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }
double norm(const Point &p) { return dot(p, p); }
double abs(const Point &p) { return sqrt(norm(p)); }
double dist(const Point &a, const Point &b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }
typedef Point Vector;
struct Segment {
Point s, t;
Segment() {}
Segment(Point s, Point t) : s(s), t(t) {}
};
int main() {
int N;
while (cin >> N, N) {
Point np(0, 0);
Vector v(0, 1);
vector<Point> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
double res = 0;
bool visited[MAX_N] = {false};
for (int i = 0; i < N; i++) {
int idx = -1;
double min = INF, d = INF;
for (int j = 0; j < N; j++) {
if (visited[j]) {
continue;
}
Vector v2 = p[j] - np;
double angle = acos(dot(v, v2) / abs(v) / abs(v2));
if (lt(angle, min)) {
d = dist(np, p[j]);
min = angle;
idx = j;
} else if (equal(angle, min)) {
if (lt(dist(np, p[j]), d)) {
d = dist(np, p[j]);
min = angle;
idx = j;
}
}
}
visited[idx] = true;
res += dist(np, p[idx]);
v = p[idx] - np;
np = p[idx];
}
printf("%.10f\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equal(a, b) (fabs(a - b) < EPS)
#define MAX_N 400
#define INF 1e9
#define lt(a, b) (a - b < -EPS)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }
Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }
Point operator*(const double &k) const { return Point(x * k, y * k); }
Point operator/(const double &k) const { return Point(x / k, y / k); }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
};
double dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }
double norm(const Point &p) { return dot(p, p); }
double abs(const Point &p) { return sqrt(norm(p)); }
double dist(const Point &a, const Point &b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }
typedef Point Vector;
struct Segment {
Point s, t;
Segment() {}
Segment(Point s, Point t) : s(s), t(t) {}
};
int main() {
int N;
while (cin >> N, N) {
Point np(0, 0);
Vector v(0, 1);
vector<Point> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
double res = 0;
bool visited[MAX_N] = {false};
for (int i = 0; i < N; i++) {
int idx = -1;
double min = INF, d = INF;
for (int j = 0; j < N; j++) {
if (visited[j]) {
continue;
}
Vector v2 = p[j] - np;
double angle = acos(dot(v, v2) / abs(v) / abs(v2));
if (lt(angle, min)) {
d = dist(np, p[j]);
min = angle;
idx = j;
} else if (equal(angle, min)) {
if (lt(dist(np, p[j]), d)) {
d = dist(np, p[j]);
min = angle;
idx = j;
}
}
}
visited[idx] = true;
res += dist(np, p[idx]);
v = p[idx] - np;
np = p[idx];
}
printf("%.1f\n", res);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 682
|
#include <bits/stdc++.h>
#define N 401
using namespace std;
typedef complex<double> P;
P p[N];
int n;
const double EPS = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > EPS)
return 1;
if (cross(b, c) < -EPS)
return -1;
if (dot(b, c) < -EPS)
return 2;
if (norm(b) < norm(c))
return -2;
return 0;
}
bool check(P s, P t) {
if (t == P(-1, -1))
return 0;
for (int i = 0; i < n; i++) {
if (p[i] == P(-1, -1) || p[i] == t)
continue;
int r = ccw(s, p[i], t);
if (!(r == 1 || r == 0))
return 0;
}
return 1;
}
double solve() {
double res = 0;
P pos = P(0, 0);
for (int i = 0; i < n; i++)
if (check(pos, p[i])) {
res += abs(pos - p[i]);
pos = p[i];
p[i] = P(-1, -1);
i = -1;
}
return res;
}
int main() {
while (cin >> n, n) {
for (int i = 0, x, y; i < n; i++)
cin >> x >> y, p[i] = P(x, y);
printf("%.8f\n", solve());
}
return 0;
}
|
#include <bits/stdc++.h>
#define N 401
using namespace std;
typedef complex<double> P;
P p[N];
int n;
const double EPS = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > EPS)
return 1;
if (cross(b, c) < -EPS)
return -1;
if (dot(b, c) < -EPS)
return 2;
if (norm(b) < norm(c))
return -2;
return 0;
}
bool check(P s, P t) {
if (t == P(-1, -1))
return 0;
for (int i = 0; i < n; i++) {
if (p[i] == P(-1, -1) || p[i] == t)
continue;
int r = ccw(s, p[i], t);
if (!(r == 1 || r == 0))
return 0;
}
return 1;
}
double solve() {
double res = 0;
P pos = P(0, 0);
for (int i = 0; i < n; i++)
if (check(pos, p[i])) {
res += abs(pos - p[i]);
pos = p[i];
p[i] = P(-1, -1);
i = -1;
}
return res;
}
int main() {
while (cin >> n, n) {
for (int i = 0, x, y; i < n; i++)
cin >> x >> y, p[i] = P(x, y);
printf("%.1f\n", solve());
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 411
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
const double PI = 4 * atan(1.0);
typedef complex<double> P;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a.imag() * b.imag()); }
// OÏ
double cross(P a, P b) { return (a.real() * b.imag() - a.imag() * b.real()); }
// a©çbÖ¶üèŽx©
double diffAngle(P a, P b) {
// cos>0&&sin>0 -> 0 -> 90
// cos<0&&sin>0 -> 90->180
// cos<0&&sin<0 -> 180->270
// cos>0&&sin<0 -> 270 -> 359
// double cosn=dot(a,b)/(abs(a)*abs(b));
// double sinn=cross(a,b);
// double angle=acos(cosn);
// if(sinn>0||EQ(sinn,0))
// return angle;
// return 2*PI-angle;
double angle = atan2(cross(a, b), dot(a, b));
if (angle < 0)
return 2 * PI + angle;
return 0;
// return angle;
}
int main() {
int n;
while (cin >> n && n != 0) {
vector<P> points;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
points.push_back(P(x, y));
}
vector<bool> isUsed(points.size(), false);
double sum = 0;
P cp = P(0, 1);
P pp = P(0, 0);
int cnt = n;
while (cnt--) {
int idx = -1;
double minAngle = 100000000;
for (int i = 0; i < points.size(); i++) {
if (isUsed[i])
continue;
double ca = diffAngle(points[i] - pp, cp);
// cout<<ca<<endl;
if (EQ(minAngle, ca)) {
if (abs(points[idx] - pp) > abs(points[i] - pp))
idx = i;
} else if (minAngle > ca) {
idx = i;
minAngle = ca;
}
}
isUsed[idx] = true;
double inc = abs(points[idx] - pp);
sum += inc;
P p = (points[idx] - pp);
cp = p / abs(p);
pp = points[idx];
}
printf("%.1f\n", sum);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
const double PI = 4 * atan(1.0);
typedef complex<double> P;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a.imag() * b.imag()); }
// OÏ
double cross(P a, P b) { return (a.real() * b.imag() - a.imag() * b.real()); }
// a©çbÖ¶üèŽx©
double diffAngle(P a, P b) {
// cos>0&&sin>0 -> 0 -> 90
// cos<0&&sin>0 -> 90->180
// cos<0&&sin<0 -> 180->270
// cos>0&&sin<0 -> 270 -> 359
// double cosn=dot(a,b)/(abs(a)*abs(b));
// double sinn=cross(a,b);
// double angle=acos(cosn);
// if(sinn>0||EQ(sinn,0))
// return angle;
// return 2*PI-angle;
double angle = atan2(cross(a, b), dot(a, b));
if (angle < 0)
return 2 * PI + angle;
// return 0;
return angle;
}
int main() {
int n;
while (cin >> n && n != 0) {
vector<P> points;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
points.push_back(P(x, y));
}
vector<bool> isUsed(points.size(), false);
double sum = 0;
P cp = P(0, 1);
P pp = P(0, 0);
int cnt = n;
while (cnt--) {
int idx = -1;
double minAngle = 100000000;
for (int i = 0; i < points.size(); i++) {
if (isUsed[i])
continue;
double ca = diffAngle(points[i] - pp, cp);
// cout<<ca<<endl;
if (EQ(minAngle, ca)) {
if (abs(points[idx] - pp) > abs(points[i] - pp))
idx = i;
} else if (minAngle > ca) {
idx = i;
minAngle = ca;
}
}
isUsed[idx] = true;
double inc = abs(points[idx] - pp);
sum += inc;
P p = (points[idx] - pp);
cp = p / abs(p);
pp = points[idx];
}
printf("%.1f\n", sum);
}
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]]
| 1
| 474
|
def make_routes(ns,used, cur):
if all(used[cur]):
yield []
else:
for i in (d for d,s in zip(list(range(ns)), used[cur]) if not s):
used[cur][i] = used[i][cur] = True
for ret in make_routes(ns,used,i):
yield [[cur, i]] + ret
used[cur][i] = used[i][cur] = False
while True:
ns,nl = list(map(int, input().split()))
if ns == 0 and nl == 0:
break
costs = [[0]*(ns+1) for _ in range(ns+1)]
used = [[True]*(ns+1) for _ in range(ns+1)]
for _ in range(nl):
a, b, c = list(map(int, input().split()))
costs[a][b] = costs[b][a] = c
used[a][b] = used[b][a] = False
ans = [0,[]]
for i in range(1,ns): #not ns+1
for route in make_routes(ns, used, i):
cost = sum(costs[a][b] for a,b in route)
if ans[0] < cost:
ans[0] = cost
ans[1] = route
print(ans[0])
print("{} {}".format(str(ans[1][0][0])," ".join(str(a[1])for a in ans[1])))
|
def make_routes(ns,used, cur):
if all(used[cur]):
yield []
else:
for i in (d for d,s in zip(list(range(ns+1)), used[cur]) if not s):
used[cur][i] = used[i][cur] = True
for ret in make_routes(ns,used,i):
yield [[cur, i]] + ret
used[cur][i] = used[i][cur] = False
while True:
ns,nl = list(map(int, input().split()))
if ns == 0 and nl == 0:
break
costs = [[0]*(ns+1) for _ in range(ns+1)]
used = [[True]*(ns+1) for _ in range(ns+1)]
for _ in range(nl):
a, b, c = list(map(int, input().split()))
costs[a][b] = costs[b][a] = c
used[a][b] = used[b][a] = False
ans = [0,[]]
for i in range(1,ns): #not ns+1
for route in make_routes(ns, used, i):
cost = sum(costs[a][b] for a,b in route)
if ans[0] < cost:
ans[0] = cost
ans[1] = route
print(ans[0])
print("{} {}".format(str(ans[1][0][0])," ".join(str(a[1])for a in ans[1])))
|
[["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 370
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
if (n == 0) {
break;
}
long long int MAX = 0;
for (long long int i = n / 2; i < n; i++) {
for (long long int j = i; j < n; j++) {
if (i * i * i + j * j * j <= n * n * n) {
MAX = max(MAX, i * i * i + j * j * j);
} else {
break;
}
}
if (i * i * i * 2 >= n * n * n) {
break;
}
}
cout << n * n * n - MAX << endl;
}
return 0;
}
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
if (n == 0) {
break;
}
long long int MAX = 0;
for (long long int i = 1; i < n; i++) {
for (long long int j = i; j < n; j++) {
if (i * i * i + j * j * j <= n * n * n) {
MAX = max(MAX, i * i * i + j * j * j);
} else {
break;
}
}
if (i * i * i * 2 >= n * n * n) {
break;
}
}
cout << n * n * n - MAX << endl;
}
return 0;
}
|
[["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 85], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 163
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i * i * i < n * n * n; i++) {
for (int j = 0; i * i * i + j * j * j < n * n * n; j++) {
ans = max(ans, i * i * i + j * j * j);
}
}
cout << n * n * n - ans;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i * i * i < n * n * n; i++) {
for (int j = 0; i * i * i + j * j * j < n * n * n; j++) {
ans = max(ans, i * i * i + j * j * j);
}
}
cout << n * n * n - ans << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 115
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = {-1, 0, 1, 1};
const int dy[] = {1, 1, 1, 0};
int dfs(int t[5][4], int cnt) {
int ret = cnt;
rep(i, cnt) rep(j, 4) {
int x = i % 4, y = i / 4;
int tx = x + dx[j], ty = y + dy[j];
if (tx >= 0 && tx < 4 && ty < 5 && ty * 4 + tx < cnt &&
t[y][x] == t[ty][tx]) {
int nt[5][4], c = 0;
rep(k, cnt) {
int kx = (k - c) % 4, ky = (k - c) / 4;
int lx = k % 4, ly = k / 4;
if (lx == x && ly == y || lx == tx && ly == ty) {
++c;
continue;
}
nt[ky][kx] = t[ly][lx];
}
ret = dfs(nt, cnt - 2);
ret = min(ret, cnt);
if (ret == 0)
return 0;
}
}
return ret;
}
int main() {
int n, tbl[5][4];
cin >> n;
while (n--) {
rep(i, 5) rep(j, 4) cin >> tbl[i][j];
cout << dfs(tbl, 20) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = {-1, 0, 1, 1};
const int dy[] = {1, 1, 1, 0};
int dfs(int t[5][4], int cnt) {
int ret = cnt;
rep(i, cnt) rep(j, 4) {
int x = i % 4, y = i / 4;
int tx = x + dx[j], ty = y + dy[j];
if (tx >= 0 && tx < 4 && ty < 5 && ty * 4 + tx < cnt &&
t[y][x] == t[ty][tx]) {
int nt[5][4], c = 0;
rep(k, cnt) {
int kx = (k - c) % 4, ky = (k - c) / 4;
int lx = k % 4, ly = k / 4;
if (lx == x && ly == y || lx == tx && ly == ty) {
++c;
continue;
}
nt[ky][kx] = t[ly][lx];
}
int a = dfs(nt, cnt - 2);
ret = min(a, ret);
if (ret == 0)
return 0;
}
}
return ret;
}
int main() {
int n, tbl[5][4];
cin >> n;
while (n--) {
rep(i, 5) rep(j, 4) cin >> tbl[i][j];
cout << dfs(tbl, 20) << endl;
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]]
| 1
| 378
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool match(string s, string t) {
for (int i = 0; i < 8; i++) {
if (s[i] != '?' && s[i] != t[i])
return false;
}
return true;
}
int n, m;
bool x[1111];
string r1[1111], r2[1111], a, b, c;
int main() {
while (cin >> n >> m, n | m) {
for (int i = 0; i < n; i++) {
cin >> a >> r1[i] >> r2[i];
if (a == "permit")
x[i] = true;
else
x[i] = false;
}
int ret = 0;
vector<string> v1, v2, v3;
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
bool p1 = false, p2 = false;
for (int j = n - 1; j >= 0; j++) {
if (match(r1[j], a) && match(r2[j], b)) {
if (x[j])
p1 = true;
else
p2 = true;
break;
}
}
if (p1) {
v1.push_back(a);
v2.push_back(b);
v3.push_back(c);
ret++;
}
}
cout << ret << endl;
for (int i = 0; i < ret; i++) {
cout << v1[i] << ' ' << v2[i] << ' ' << v3[i] << endl;
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool match(string s, string t) {
for (int i = 0; i < 8; i++) {
if (s[i] != '?' && s[i] != t[i])
return false;
}
return true;
}
int n, m;
bool x[1111];
string r1[1111], r2[1111], a, b, c;
int main() {
while (cin >> n >> m, n | m) {
for (int i = 0; i < n; i++) {
cin >> a >> r1[i] >> r2[i];
if (a == "permit")
x[i] = true;
else
x[i] = false;
}
int ret = 0;
vector<string> v1, v2, v3;
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
bool p1 = false, p2 = false;
for (int j = n - 1; j >= 0; j--) {
if (match(r1[j], a) && match(r2[j], b)) {
if (x[j])
p1 = true;
else
p2 = true;
break;
}
}
if (p1) {
v1.push_back(a);
v2.push_back(b);
v3.push_back(c);
ret++;
}
}
cout << ret << endl;
for (int i = 0; i < ret; i++) {
cout << v1[i] << ' ' << v2[i] << ' ' << v3[i] << endl;
}
}
}
|
[["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68]]
| 1
| 352
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.