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 | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct data {
int pq, p, q;
};
const int MAX_N = 50000;
bool prime[MAX_N + 1];
void sieve() {
fill(prime, prime + MAX_N + 1, true);
prime[0] = prime[1] = false;
for (int i = 2; i <= MAX_N; i++)
if (prime[i])
for (int j ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct data {
int pq, p, q;
};
const int MAX_N = 50000;
bool prime[MAX_N + 1];
void sieve() {
fill(prime, prime + MAX_N + 1, true);
prime[0] = prime[1] = false;
for (int i = 2; i <= MAX_N; i++)
if (prime[i])
for (int j ... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 288 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const double EPS = 1.0e-9;
int main() {
vector<int> prime;
prime.push_back(2);
prime.push_back(3);
for (int i = 4; i < 100000; i++) {
bool flag = true;
for (int j = 0; j < prime.... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const double EPS = 1.0e-9;
int main() {
vector<int> prime;
prime.push_back(2);
prime.push_back(3);
for (int i = 4; i < 10000; i++) {
bool flag = true;
for (int j = 0; j < prime.s... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 342 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;
const int kN = 10000;
void primeNumber(bool prime[kN]) {
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;
const int kN = 100000;
void primeNumber(bool prime[kN]) {... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22]] | 1 | 297 | 4 |
#include <bits/stdc++.h>
using namespace std;
int M, A, B;
vector<int> primes;
bool flgs[100001];
int main() {
for (int i = 2; i <= 100000; i++) {
flgs[i] = true;
}
for (int i = 2; i <= 100000; i++) {
if (flgs[i]) {
primes.push_back(i);
for (int j = i + i; j <= 100000; j += i) {
flg... | #include <bits/stdc++.h>
using namespace std;
int M, A, B;
vector<long long> primes;
bool flgs[100001];
int main() {
for (int i = 2; i <= 100000; i++) {
flgs[i] = true;
}
for (int i = 2; i <= 100000; i++) {
if (flgs[i]) {
primes.push_back(i);
for (int j = i + i; j <= 100000; j += i) {
... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 267 | 3 |
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << endl; ... | #include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << endl; ... | [["+", 3, 4, 0, 16, 31, 16, 31, 74, 0, 24], ["+", 0, 16, 31, 16, 31, 74, 39, 77, 39, 40], ["+", 3, 4, 0, 16, 31, 16, 31, 74, 0, 25]] | 1 | 389 | 3 |
///
// File: 1232.cpp
// Author: ymiyamoto
//
// Created on Sat Nov 25 19:23:48 2017
//
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(uint32_t n) {
for (uint32_t i = 2; i <= (uint32_t)sqrt(n); i++) {
if (n % i == 0) {
re... | ///
// File: 1232.cpp
// Author: ymiyamoto
//
// Created on Sat Nov 25 19:23:48 2017
//
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(uint32_t n) {
for (uint32_t i = 2; i <= (uint32_t)sqrt(n); i++) {
if (n % i == 0) {
re... | [["+", 49, 50, 51, 2, 3, 4, 0, 2, 63, 22], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 3, 4, 0, 16, 31, 16, 31, 74, 0, 24], ["+", 0, 16, 31, 16, 31, 74, 39, 77, 39, 40], ["+", 3, 4, 0, 16, 31, 16, 31, 74, 0, 25], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 326 | 6 |
#include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// sieve of eratosthenes
vector<int> pnums(1000000, 0);
for (int i = 2; i < 1000000; i++)
pnums[i] = 1;
for (int i = 2; i * i < 1000000; i++) {
if (pnums[i]) {
for (int j = i * i; j < 1000000... | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// sieve of eratosthenes
vector<int> pnums(1000000, 0);
for (int i = 2; i < 1000000; i++)
pnums[i] = 1;
for (int i = 2; i * i < 1000000; i++) {
if (pnums[i]) {
for (int j = i * i; j < 1000000... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 318 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 100001;
vector<int> prime;
bool is_prime(int n) {
if (n == 2 || n == 3)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 50000;
vector<int> prime;
bool is_prime(int n) {
if (n == 2 || n == 3)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 289 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int N = 100000;
int m, a, b, aw, ah /*, aw2, ah2*/;
vector<int> prime;
bool is_prime[N + 1];
void sieve() {
fill(is_prime, is_prime + N + 1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= N; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int N = 100000;
int m, a, b, aw, ah /*, aw2, ah2*/;
vector<int> prime;
bool is_prime[N + 1];
void sieve() {
fill(is_prime, is_prime + N + 1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= N; ... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 281 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> p;
for (int i = 2; i <= 100000; i++) {
int f = true;
for (int j = 2; j * j <= i; j++)
if (i % j == 0) {
f = 0;
break;
}
if (f) {
p.push_back(i);
}
}
long lo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> p;
for (int i = 2; i <= 100000; i++) {
int f = true;
for (int j = 2; j * j <= i; j++)
if (i % j == 0) {
f = 0;
break;
}
if (f) {
p.push_back(i);
}
}
l... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 260 | 3 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 373 | 2 |
#include <stdio.h>
#define N 100000
int main(void) {
int i, j, n, ans = 0, prime[N + 1];
prime[0] = 0;
prime[1] = 0;
for (i = 2; i <= N; i++)
prime[i] = 1;
for (i = 2; i * i <= N; i++) {
if (prime[i] == 1) {
for (j = i * i; j <= N; j += i)
prime[j] = 0;
}
}
int cnt = 0;
for (i ... | #include <stdio.h>
#define N 100000
int main(void) {
int i, j, n, ans = 0, prime[N + 1];
prime[0] = 0;
prime[1] = 0;
for (i = 2; i <= N; i++)
prime[i] = 1;
for (i = 2; i * i <= N; i++) {
if (prime[i] == 1) {
for (j = i * i; j <= N; j += i)
prime[j] = 0;
}
}
int cnt = 0;
for (i ... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 342 | 3 |
#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 <st... | #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 <st... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 0, 52, 8, 9, 0, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 9, 0, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 9, 0, 9, 0, 43, 39, 78]] | 1 | 478 | 6 |
#include <cstdlib>
#include <iostream>
#include <map>
using namespace std;
char s[1234567];
char *p;
typedef map<map<char, int>, int> E;
E exp();
E mul() {
while (*p == ' ') {
p++;
}
if (isdigit(*p)) {
E e;
e[map<char, int>()] = strtol(p, &p, 10);
return e;
} else if (*p == '(') {
p++;
... | #include <cstdlib>
#include <iostream>
#include <map>
using namespace std;
char s[1234567];
char *p;
typedef map<map<char, int>, int> E;
E exp();
E mul() {
while (*p == ' ') {
p++;
}
if (isdigit(*p)) {
E e;
e[map<char, int>()] = strtol(p, &p, 10);
return e;
} else if (*p == '(') {
p++;
... | [["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 656 | 3 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reg(i, a, b) for (int i = (a); i <= (b); i++)
#define irep(i, n) for (int i = ((int)(n)) - 1; i ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reg(i, a, b) for (int i = (a); i <= (b); i++)
#define irep(i, n) for (int i = ((int)(n)) - 1; i ... | [["-", 3, 4, 0, 41, 15, 16, 31, 16, 31, 22], ["+", 3, 4, 0, 41, 15, 16, 31, 16, 31, 22]] | 1 | 436 | 2 |
#include <algorithm>
#include <cctype>
#include <iostream>
#include <string>
#define all(c) (c).begin(), (c).end()
using namespace std;
void J(string &s) {
string a = "";
a += s.substr(1, s.size() - 1);
a += s[0];
s = a;
}
void C(string &s) {
string a = "";
a += s[s.size() - 1];
a += s.substr(0, s.siz... | #include <algorithm>
#include <cctype>
#include <iostream>
#include <string>
#define all(c) (c).begin(), (c).end()
using namespace std;
void J(string &s) {
string a = "";
a += s.substr(1, s.size() - 1);
a += s[0];
s = a;
}
void C(string &s) {
string a = "";
a += s[s.size() - 1];
a += s.substr(0, s.siz... | [["-", 0, 11, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 548 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
string o, k;
cin >> n;
while (n--) {
cin >> o >> k;
int l = k.size();
for (int i = o.size() - 1; i >= 0; i--) {
if (o[i] == 'J')
k = k[l - 1] + k.substr(0, l - 1);
else if (o[i]... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
string o, k;
cin >> n;
while (n--) {
cin >> o >> k;
int l = k.size();
for (int i = o.size() - 1; i >= 0; i--) {
if (o[i] == 'J')
k = k[l - 1] + k.substr(0, l - 1);
else if (o[i]... | [["+", 0, 57, 64, 1, 0, 11, 12, 103, 0, 104]] | 1 | 397 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s, ss;
cin >> s >> ss;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'P')
for (int j = 0; j < ss.size(); j++)
if (ss[j] >= '0' && ss[j] <= '9')
ss[j] = (ss[j] - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s, ss;
cin >> s >> ss;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'P')
for (int j = 0; j < ss.size(); j++)
if (ss[j] >= '0' && ss[j] <= '9')
ss[j] = (ss[j] - ... | [["-", 3, 4, 0, 16, 31, 2, 63, 118, 28, 22], ["+", 3, 4, 0, 16, 31, 2, 63, 118, 28, 22], ["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 64, 1, 0, 11, 12, 16, 12, 69, 28, 22], ["+", 64, 1, 0, 11, 12, 16, 12, 69, 28, 22]] | 1 | 365 | 8 |
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [["-", 75, 76, 0, 57, 64, 1, 0, 16, 17, 60], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 32]] | 1 | 1,063 | 2 |
#include <bits/stdc++.h>
using namespace std;
string J(const string &s) {
int lasti = s.size() - 1;
return s[lasti] + s.substr(0, lasti);
}
string C(const string &s) { return s.substr(1) + s[0]; }
string E(const string &s) {
int size = s.size();
int hsize = size / 2;
if (size & 1)
return s.substr(hsiz... | #include <bits/stdc++.h>
using namespace std;
string J(const string &s) {
int lasti = s.size() - 1;
return s[lasti] + s.substr(0, lasti);
}
string C(const string &s) { return s.substr(1) + s[0]; }
string E(const string &s) {
int size = s.size();
int hsize = size / 2;
if (size & 1)
return s.substr(hsiz... | [["-", 8, 9, 0, 7, 10, 43, 39, 343, 141, 78], ["+", 8, 9, 0, 7, 10, 43, 39, 343, 141, 78], ["-", 10, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 10, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["-", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120]] | 1 | 482 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int cs, s;
string ord, st;
void op(char o) {
if (o == 'A')
reverse(st.begin(), st.end());
if (o == 'J')
rotate(st.rbegin(), st.rbegin() + 1, st.rend());
if (o == 'C')
rotate(st... | #include <algorithm>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int cs, s;
string ord, st;
void op(char o) {
if (o == 'A')
reverse(st.begin(), st.end());
if (o == 'J')
rotate(st.rbegin(), st.rbegin() + 1, st.rend());
if (o == 'C')
rotate(st... | [["-", 31, 23, 0, 16, 12, 23, 0, 41, 64, 13], ["+", 31, 23, 0, 16, 12, 23, 0, 41, 64, 13]] | 1 | 303 | 2 |
#include <algorithm>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s, m;
cin >> s >> m;
int len = m.length();
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == 'J')
rotate(m.begin(), m.begin() +... | #include <algorithm>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s, m;
cin >> s >> m;
int len = m.length();
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == 'J')
rotate(m.begin(), m.begin() +... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 389 | 4 |
#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>
#inc... | #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>
#inc... | [["-", 0, 11, 12, 23, 0, 41, 75, 103, 0, 125], ["+", 0, 11, 12, 23, 0, 41, 75, 103, 0, 125]] | 1 | 619 | 2 |
n = gets.to_i
n.times do
order = gets.chomp
s = gets.chomp
order.reverse.each_char do |c|
case c
when ?J
s = s[-1] + s[0..-2]
when ?C
s = s[1..-1] + s[0]
when ?E
s = s[-(s.size/2)..-1] + s[s.size/2..s.size-1-s.size/2] + s[0..s.size/2-1] if ... | n = gets.to_i
n.times do
order = gets.chomp
s = gets.chomp
order.reverse.each_char do |c|
case c
when ?J
s = s[-1] + s[0..-2]
when ?C
s = s[1..-1] + s[0]
when ?E
s = s[-(s.size/2)..-1] + s[s.size/2..s.size-1-s.size/2] + s[0..s.size/2-1] if ... | [["-", 8, 749, 0, 751, 15, 738, 31, 652, 486, 22], ["+", 8, 749, 0, 751, 15, 738, 31, 652, 486, 22]] | 4 | 199 | 2 |
import java.io.IOException;
import java.util.InputMismatchException;
public class Main {
void run() {
MyScanner sc = new MyScanner();
while (true) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int ans = 0;
for (int i = 1; i < 200; i++) {
if (n < i * i)
... | import java.io.IOException;
import java.util.InputMismatchException;
public class Main {
void run() {
MyScanner sc = new MyScanner();
while (true) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int ans = 0;
for (int i = 0; i < 200; i++) {
if (n < i * i)
... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 804 | 2 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
public cla... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
public cla... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 983 | 4 |
// AOJ 1241: Lagrange's Four-Square Theorem
// 2017.10.12 bal4u@uu
#include <math.h>
#include <stdio.h>
#define MAX 32768 // 2^15
int a[185];
char f1[34000];
char f2[34000], c2[34000][9], w2[34000];
int main() {
int n, i, j, k, s, sq, ans;
sq = 1 + (int)sqrt(MAX);
for (i = 1; i <= sq; i++)
a[i] = i * i, f... | // AOJ 1241: Lagrange's Four-Square Theorem
// 2017.10.12 bal4u@uu
#include <math.h>
#include <stdio.h>
#define MAX 32768 // 2^15
int a[185];
char f1[34000];
char f2[34000], c2[34000][9], w2[34000];
int main() {
int n, i, j, k, s, sq, ans;
sq = 1 + (int)sqrt(MAX);
for (i = 1; i <= sq; i++)
a[i] = i * i, f... | [["-", 0, 7, 15, 16, 12, 16, 31, 23, 0, 24], ["-", 15, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 15, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["-", 0, 7, 15, 16, 12, 16, 31, 23, 0, 25], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 367 | 6 |
i, z = 256, t[65536];
main(i, j, k, l, x) {
for (; i < z; i++)
for (j = i; j < z; j++)
for (k = j; k < z; k++)
for (l = k; l < z; l++) {
if ((x = i * i + j * j + k * k + l * l) >= z * z)
break;
t[x]++;
}
while (scanf("%d", &x), x)
printf("%d\n", t[x]);
... | i, z = 256, t[65536];
main(j, k, l, x) {
for (; i < z; i++)
for (j = i; j < z; j++)
for (k = j; k < z; k++)
for (l = k; l < z; l++) {
if ((x = i * i + j * j + k * k + l * l) >= z * z)
break;
t[x]++;
}
while (scanf("%d", &x), x)
printf("%d\n", t[x]);
re... | [["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21]] | 0 | 141 | 8 |
i, z = 256, t[65536];
main(i, j, k, l, x) {
for (; i < z; i++)
for (j = i; j < z; j++)
for (k = j; k < z; k++)
for (l = k; l < z; l++) {
if ((x = i * i + j * j + k * k + l * l) >= z * z)
break;
t[x]++;
}
while (scanf("%d", &x), x)
printf("%d\n", t[x]);
... | i, z = 256, t[65536];
main(j, k, l, x) {
for (; i < z; i++)
for (j = i; j < z; j++)
for (k = j; k < z; k++)
for (l = k; l < z; l++) {
if ((x = i * i + j * j + k * k + l * l) < z * z)
t[x]++;
}
while (scanf("%d", &x), x)
printf("%d\n", t[x]);
return 0;
} | [["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 8, 7, 8, 9, 0, 57, 64, 93, 0, 94], ["-", 8, 7, 8, 9, 0, 57, 64, 93, 0, 35]] | 0 | 141 | 8 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 266 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 309 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 328 | 2 |
// Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | // Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 216 | 3 |
// Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | // Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | [["-", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13], ["+", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 239 | 4 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
// long INF = 1L << 62;
double EPS = 1e-10;
int[] ps = new int[100000];
void prime() {
boolean[] p = new boolean[1500000... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
// long INF = 1L << 62;
double EPS = 1e-10;
int[] ps = new int[100000];
void prime() {
boolean[] p = new boolean[1500000... | [["-", 8, 196, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 196, 0, 7, 15, 16, 31, 16, 12, 499]] | 3 | 371 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
bool a[1300000] = {0};
a[1] = 1;
for (int i = 2; i < 650001; i++) {
if (a[i] == 1)
continue;
int j = 2 * i;
while (j < 1300000) {
a[j] = 1;
j = j + i;
}
}
int k;
while (cin >> k &&... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
bool a[1300000] = {0};
a[1] = 1;
for (int i = 2; i < 650001; i++) {
if (a[i] == 1)
continue;
int j = 2 * i;
while (j < 1300000) {
a[j] = 1;
j = j + i;
}
}
int k;
while (cin >> k &&... | [["-", 0, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 0, 9, 0, 52, 15, 339, 51, 16, 12, 13]] | 1 | 172 | 4 |
#include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int max = 1299710;
vector<int> mat(max, 1);... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int max = 1299710;
vector<int> mat(max, 1);... | [["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22]] | 1 | 217 | 2 |
#include <iostream>
#include <vector>
using namespace std;
vector<bool> Eratos(1299710, true);
int main() {
int N, min, max;
for (int i = 2; i < 1142;) {
for (int j = 1; j <= 1299710; j += i) {
if (j % i == 0) {
Eratos[j] = false;
}
}
for (i++; !Eratos[i]; i++)
;
}
while ... | #include <iostream>
#include <vector>
using namespace std;
vector<bool> Eratos(1299710, true);
int main() {
int N, min, max;
for (int i = 2; i < 1142;) {
for (int j = i * 2; j <= 1299710; j += i) {
if (j % i == 0) {
Eratos[j] = false;
}
}
for (i++; !Eratos[i]; i++)
;
}
wh... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 48], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 148 | 4 |
#define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std... | #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std... | [["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 282 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define each(a, b) for (auto(a) : (b))
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define each(a, b) for (auto(a) : (b))
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 301 | 2 |
#include <math.h>
#include <stdio.h>
#define MAXNUM 1299709
int main(void) {
int flag[MAXNUM + 1], i, j, n;
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j = i * 2; j <= MAXNUM; j += i)
flag[j] = 0;
}
flag[0] = flag[1] = 0;
while (1) {
scanf... | #include <math.h>
#include <stdio.h>
#define MAXNUM 1299709
int main(void) {
int flag[MAXNUM + 1], i, j, n;
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j = i * 2; j <= MAXNUM; j += i)
flag[j] = 0;
}
flag[0] = flag[1] = 0;
while (1) {
scanf... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 174 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> P;
const int pmax = 1299709;
bool iscomp[pmax + 1];
void init() {
P.reserve(100000);
for (int i = 2; i < pmax + 1; i++) {
if (iscomp[i])
continue;
P.push_back(i);
for (int j = 2; i * j < pmax + 1; j++)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> P;
const int pmax = 1299709;
bool iscomp[pmax + 1];
void init() {
P.reserve(100000);
for (int i = 2; i < pmax + 1; i++) {
if (iscomp[i])
continue;
P.push_back(i);
for (int j = 2; i * j < pmax + 1; j++)
... | [["-", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 196 | 4 |
main(n) {
int t, l, b, a, i, j, I, J, s;
while (scanf("%d%d%d%d", &n, &t, &l, &b), n) {
double d[101][101] = {{}}, o = 0;
int f[101];
while (l--)
scanf("%d", &a), f[a] = 1;
while (b--)
scanf("%d", &a), f[a] = 2;
d[0][0] = 1;
for (i = 0; i <= t; i++) {
o += d[i][n];
d[... | main(n) {
int t, l, b, a, i, j, I, J, s;
while (scanf("%d%d%d%d", &n, &t, &l, &b), n) {
double d[101][101] = {{}}, o = 0;
int f[101] = {};
while (l--)
scanf("%d", &a), f[a] = 1;
while (b--)
scanf("%d", &a), f[a] = 2;
d[0][0] = 1;
for (i = 0; i <= t; i++) {
o += d[i][n];
... | [["+", 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, 46]] | 0 | 281 | 28 |
def solve(n, k, q, a)
return if k == 0
(t = [q, a].min).downto(t/k) do |x|
if n - x * x == 0 then @ans += 1
else solve(n - x * x, k + 1, Math.sqrt(n - x * x).to_i, x)
end
end
end
while n = gets.to_i
break if n == 0
@ans = 0
solve(n, 4, Math.sqrt(n).to_i, n)
puts @ans
end | def solve(n, k, q, a)
return if k == 0
(t = [q, a].min).downto(t/k) do |x|
if n - x * x == 0 then @ans += 1
else solve(n - x * x, k - 1, Math.sqrt(n - x * x).to_i, x)
end
end
end
while n = gets.to_i
break if n == 0
@ans = 0
solve(n, 4, Math.sqrt(n).to_i, n)
puts @ans
end | [["-", 75, 95, 0, 652, 3, 4, 0, 738, 17, 72], ["+", 75, 95, 0, 652, 3, 4, 0, 738, 17, 33]] | 4 | 115 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long double e = 0.000000001;
long double f(long double x1, long double y1, long double x2, long double y2,
long double X) {
return (y1 * (x2 - X) + y2 * (X - x1)) / (x2 - x1);
}
int main() {
while (1) {
int m;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long double e = 0.0000001;
long double f(long double x1, long double y1, long double x2, long double y2,
long double X) {
return (y1 * (x2 - X) + y2 * (X - x1)) / (x2 - x1);
}
int main() {
while (1) {
int m;
... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 564 | 2 |
#include <bits/stdc++.h>
using namespace std;
struct state {
int p, x, y, a, b, c, d;
};
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
int n;
int t[367][4][4];
bool visited[367][3][3][8][8][8][8];
int solve() {
int K = 7;
if (t[0][1][1] || t[0][1][2] || t[0][2][1] || t[0][2][2])
return 0;
memset(vi... | #include <bits/stdc++.h>
using namespace std;
struct state {
int p, y, x, a, b, c, d;
};
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
int n;
int t[367][4][4];
bool visited[367][3][3][8][8][8][8];
int solve() {
int K = 7;
if (t[0][1][1] || t[0][1][2] || t[0][2][1] || t[0][2][2])
return 0;
memset(vi... | [["-", 0, 30, 0, 122, 8, 123, 0, 124, 49, 120], ["-", 0, 30, 0, 122, 8, 123, 0, 124, 0, 21], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 0, 21], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 49, 120]] | 1 | 690 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400;
const int R = 4;
const int W = 7;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
int N;
int F[MAXN][R][R];
bool dp[MAXN][R][R][W][W][W][W];
int main() {
while (cin >> N && N) {
for (int k = 0; k < N; ++k)
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 400;
const int R = 4;
const int W = 7;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
int N;
int F[MAXN][R][R];
bool dp[MAXN][R][R][W][W][W][W];
int main() {
while (cin >> N && N) {
for (int k = 0; k < N; ++k)
for (int i = 0; ... | [["-", 28, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 28, 69, 28, 69, 28, 69, 341, 342, 0, 13]] | 1 | 659 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct D {
char S[20];
int w;
} D;
D A[1005];
int i, j, N, t;
char M[100];
int cmp(const void *a, const void *b) {
D *x = ((D *)a), *y = ((D *)b);
return strlen(x->S) < strlen(y->S);
}
int CN(char a) { return '0' <= a && a <= '9'; }
int dfs(... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct D {
char S[20];
int w;
} D;
D A[1005];
int i, j, N, t;
char M[100];
int cmp(const void *a, const void *b) {
D *x = ((D *)a), *y = ((D *)b);
return strlen(x->S) < strlen(y->S);
}
int CN(char a) { return '0' <= a && a <= '9'; }
int dfs(... | [["-", 12, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["-", 12, 23, 0, 16, 31, 69, 71, 16, 12, 13]] | 0 | 576 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const int inf = 1LL << 55;
const int mod = 1e9 + 7;
map<string, int> table;
string mole;
int idx;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const int inf = 1LL << 55;
const int mod = 1e9 + 7;
map<string, int> table;
string mole;
int idx;
... | [["-", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 424 | 7 |
#include <bits/stdc++.h>
using namespace std;
string s;
int i;
map<string, int> chem;
int inner_morecule();
int number();
int atom();
int morecule() {
int ret = inner_morecule();
while (s[i] != '$' && s[i] != ')') {
// cout<<s.substr(i)<<endl;
int val = inner_morecule();
if (val == -1) {
return... | #include <bits/stdc++.h>
using namespace std;
string s;
int i;
map<string, int> chem;
int inner_morecule();
int number();
int atom();
int morecule() {
int ret = 0;
while (s[i] != '$' && s[i] != ')') {
// cout<<s.substr(i)<<endl;
int val = inner_morecule();
if (val == -1) {
return -1;
}
... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 390 | 33 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 548 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
struct PrimalDual {
const int INF = 1 << 28;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
edge() {}
edge(int to, int cap, int cost, int rev)
: to(to), cap(cap), cost(cost), rev(rev) {}... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
struct PrimalDual {
const int INF = 1 << 28;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
edge() {}
edge(int to, int cap, int cost, int rev)
: to(to), cap(cap), cost(cost), rev(rev) {}... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 772 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, ... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, ... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 464 | 1 |
def string_to_complex(s):
a, b, c, d = map(int, s.split())
return (a + b * 1j, c + d * 1j)
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def cross_point(p1, p2, p3, p4):
crs1 = cross(p2 - p1, p3 - p1)
crs2 = cross... | def string_to_complex(s):
a, b, c, d = map(int, s.split())
return (a + b * 1j, c + d * 1j)
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def cross_point(p1, p2, p3, p4):
crs1 = cross(p2 - p1, p3 - p1)
crs2 = cross... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22]] | 5 | 696 | 2 |
main(a, b, c, X, Y, A, f, i, j) {
for (; scanf("%d%d%d", &a, &b, &c), a | b | c; printf("%d %d\n", X, Y))
for (A = 2147483647, f = i = 0; !f; i++)
for (j = 0; j <= i; j++)
if (a * j + b * (i - j) == c || a * j == b * (i - j) + c ||
a * j + c == b * (i - j))
if (f = 1, A > a * i... | main(a, b, c, X, Y, A, f, i, j) {
for (; scanf("%d%d%d", &a, &b, &c), a; printf("%d %d\n", X, Y))
for (A = 2147483647, f = i = 0; !f; i++)
for (j = 0; j <= i; j++)
if (a * j + b * (i - j) == c || a * j == b * (i - j) + c ||
a * j + c == b * (i - j))
if (f = 1, A > a * j + b * (... | [["-", 0, 7, 15, 34, 12, 16, 31, 16, 17, 139], ["-", 0, 7, 15, 34, 12, 16, 31, 16, 12, 22], ["-", 0, 9, 0, 7, 15, 34, 12, 16, 17, 139], ["-", 0, 9, 0, 7, 15, 34, 12, 16, 12, 22], ["-", 0, 34, 12, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 34, 12, 16, 12, 16, 31, 16, 12, 22], ["-", 0, 34, 31, 11, 12, 16, 31, 16, 12, 22], ["+... | 0 | 184 | 8 |
#include <stdio.h>
#define m(a, b) (a < b ? a : b)
#define INF 10000000
int A, B, D, i, j;
int main() {
for (; scanf("%d%d%d", &A, &B, &D), A + B + D;) {
int b1 = INF, b2 = INF, b3 = INF, Ra = INF, Rb = INF, x;
for (i = 0; i < INF; i++) {
b1 = (i * A + D) % B == 0 ? m((i * A + D) / B, b1) : b1;
... | #include <stdio.h>
#define m(a, b) (a < b ? a : b)
#define INF 999999999
int A, B, D, i, j;
int main() {
for (; scanf("%d%d%d", &A, &B, &D), A + B + D;) {
int b1 = INF, b2 = INF, b3 = INF, Ra = INF, Rb = INF, x;
for (i = 0; i < 10000; i++) {
b1 = (i * A + D) % B == 0 ? m((i * A + D) / B, b1) : b1;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 280 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int a, b, c;
while (cin >> a >> b >> c, a != 0) {
int min_sum_xy = 1L << 30, min_sum = 1L << 30, ans_x = -1, ans_y = -1;
auto update = [&](int x, int y) {
if (min_sum_xy > x + y) {
... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int a, b, c;
while (cin >> a >> b >> c, a != 0) {
int min_sum_xy = 1L << 30, min_sum = 1L << 30, ans_x = -1, ans_y = -1;
auto update = [&](int x, int y) {
if (min_sum_xy > x + y) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20]] | 1 | 266 | 4 |
#include <bits/stdc++.h>
#define mp make_pair
#define eps 1e-8
using namespace std;
typedef pair<int, int> pii;
int main() {
int a, b, d;
while (cin >> a >> b >> d, a) {
int x = 0, y = 0;
pii ans = mp(1e9, 1e9);
for (int i = -(d / b) - b; i <= 1; i++) {
x = i;
if ((a * x + d) % b != 0)
... | #include <bits/stdc++.h>
#define mp make_pair
#define eps 1e-8
using namespace std;
typedef pair<int, int> pii;
int main() {
int a, b, d;
while (cin >> a >> b >> d, a) {
int x = 0, y = 0;
pii ans = mp(1e9, 1e9);
for (int i = -(d / b) - 2 - b; i <= 100000; i++) {
x = i;
if ((a * x + d) % b !=... | [["+", 10, 43, 49, 50, 51, 16, 31, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 244 | 4 |
#include <cmath>
#include <cstdio>
int abs(int x) {
if (x < 0)
return -x;
return x;
}
#define INF 5e4
int extgcd(int a, int b, int &x, int &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int a, b, d;
int main(void) {... | #include <cmath>
#include <cstdio>
int abs(int x) {
if (x < 0)
return -x;
return x;
}
#define INF 5e4
int extgcd(int a, int b, int &x, int &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int a, b, d;
int main(void) {... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 461 | 2 |
#include <cmath>
#include <iostream>
#define LIMIT 50000
using namespace std;
int a, b, d, mx, my;
void update(int x, int y, int &mx, int &my) {
if (y < 0)
return;
if (x + y == mx + my && a * x + b * y < a * mx + b * my) {
mx = x;
my = y;
} else if (x + y < mx + my) {
mx = x;
my = y;
}
}
m... | #include <cmath>
#include <iostream>
#define LIMIT 50000
using namespace std;
int a, b, d, mx, my;
void update(int x, int y, int &mx, int &my) {
if (y < 0)
return;
if (x + y == mx + my && a * x + b * y < a * mx + b * my) {
mx = x;
my = y;
} else if (x + y < mx + my) {
mx = x;
my = y;
}
}
m... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 284 | 22 |
#include <iostream>
main() {
for (int a, b, d, x, y, i, t; std::cin >> a >> b >> d, d;
printf("%d %d\n", x, y)) {
x = y = 1 << 29;
for (i = 1 << 17; i-- > 0;) {
t = d - a * i;
if (!(d < a * i | t % b) & x + y > i + t / b |
(x + y == i + t / b & a * x + b * y > a * i + t)) {
... | #include <iostream>
main() {
for (int a, b, d, x, y, i, t; std::cin >> a >> b >> d, d;
printf("%d %d\n", x, y)) {
x = y = 1 << 29;
for (i = 1 << 17; i-- > 0;) {
t = d - a * i;
if (!(d < a * i | t % b) &&
x + y > i + t / b |
(x + y == i + t / b & a * x + b * y > a * i... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 67], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 280 | 6 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int a, b, d;
struct P {
int x, y;
P(int x = -1, int y = -1) : x(x), y(y) {}
bool operator<(const P &p) const {
if (x + y != p.x + p.y)
return x + y < p.x + p.y;
if (a * x + b * y != a... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int a, b, d;
struct P {
int x, y;
P(int x = -1, int y = -1) : x(x), y(y) {}
bool operator<(const P &p) const {
if (x + y != p.x + p.y)
return x + y < p.x + p.y;
if (a * x + b * y != a... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 446 | 2 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdin.... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdin.... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 48], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 570 | 4 |
#include <bits/stdc++.h>
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();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | #include <bits/stdc++.h>
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();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 729 | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
int x[100], y[100];
int pegs[10][10][10];
int z_idx[10][10];
int dx[] = {0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int dy[] = {0, -1, -1, -1, -1, -1, -1, 0, 0, 0, 1, 1, 1};
int dz[] = {-1, -1, 0, 1, -1, 0, 1, -1, 0, 1, -1, 0, 1};
bool sequence(int x, int y, i... | #include <bits/stdc++.h>
using namespace std;
int n, m, p;
int x[500], y[500];
int pegs[10][10][10];
int z_idx[10][10];
int dx[] = {0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int dy[] = {0, -1, -1, -1, -1, -1, -1, 0, 0, 0, 1, 1, 1};
int dz[] = {-1, -1, 0, 1, -1, 0, 1, -1, 0, 1, -1, 0, 1};
bool sequence(int x, int y, i... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 1 | 639 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, M, P;
int field[10][10][10];
int diff[13][3] = {{0, 0, 1}, {0, 1, 0}, {1, 0, 0}, {1, 1, 0}, {1, -1, 0},
{1, 0, 1}, {1, 0, -1}, {0, 1, 1}, {0, 1, -1}, {1, 1, 1},
{1, 1, -1}, {1, -1, 1}, {1, -1, -1}};
int sequence(int num)... | #include <bits/stdc++.h>
using namespace std;
int N, M, P;
int field[10][10][10];
int diff[13][3] = {{0, 0, 1}, {0, 1, 0}, {1, 0, 0}, {1, 1, 0}, {1, -1, 0},
{1, 0, 1}, {1, 0, -1}, {0, 1, 1}, {0, 1, -1}, {1, 1, 1},
{1, 1, -1}, {1, -1, 1}, {1, -1, -1}};
int sequence(int num)... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 545 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
char field[7][7][7];
int dp[7][7][7][13];
int N;
char get(int x, int y, int z) {
if (x < 0 || N <= x || y < 0 || N <= y || z < 0 || N <= z)
return '.';
return field[x][y][z];
}
int dpget(int x, int y, int z, i... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
char field[7][7][7];
int dp[7][7][7][13];
int N;
char get(int x, int y, int z) {
if (x < 0 || N <= x || y < 0 || N <= y || z < 0 || N <= z)
return '.';
return field[x][y][z];
}
int dpget(int x, int y, int z, i... | [["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 940 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
const int SPACE = 0;
const int BLACK = 1;
const int WHITE = 2;
const int MAXN = 8;
int N, M, P;
int G[MAXN][MAXN][MAXN];
int count(int x, int y, int z, int dx, int dy, int dz) {
int c = G[z][y][x];
int res;
res = 1;
for (int i = 0; i < 2; ++i) {
... | #include <algorithm>
#include <iostream>
using namespace std;
const int SPACE = 0;
const int BLACK = 1;
const int WHITE = 2;
const int MAXN = 8;
int N, M, P;
int G[MAXN][MAXN][MAXN];
int count(int x, int y, int z, int dx, int dy, int dz) {
int c = G[z][y][x];
int res;
res = 1;
for (int i = 0; i < 2; ++i) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 548 | 4 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORa(i, c) ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORa(i, c) ... | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 542 | 2 |
#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>
#in... | #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>
#in... | [["-", 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]] | 1 | 400 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 624 | 2 |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.List;
/**
* Problem A: And Then There Was One
*/
public class Main {
public static void main(String[] args) throws IOException {
... | import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.List;
/**
* Problem A: And Then There Was One
*/
public class Main {
public static void main(String[] args) throws IOException {
... | [["-", 15, 15, 0, 16, 12, 16, 31, 16, 12, 22], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 72]] | 3 | 308 | 2 |
#include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n);... | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n);... | [["-", 15, 339, 51, 34, 31, 16, 31, 16, 12, 22], ["-", 0, 52, 15, 339, 51, 34, 31, 16, 17, 152], ["+", 0, 52, 15, 339, 51, 34, 31, 16, 17, 152], ["+", 0, 52, 15, 339, 51, 34, 31, 16, 12, 22], ["-", 15, 339, 51, 34, 12, 16, 31, 16, 17, 139], ["-", 15, 339, 51, 34, 12, 16, 31, 16, 12, 22], ["+", 0, 52, 15, 339, 51, 34, 1... | 1 | 298 | 8 |
#include <bits/stdc++.h>
#include <stdint.h>
typedef uint32_t u32;
typedef uint64_t u64;
typedef std::pair<int, int> pii;
int main() {
for (;;) {
int n, k, m;
std::cin >> n >> k >> m;
if (n == 0 and k == 0 and m == 0)
break;
int dp[20000];
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
... | #include <bits/stdc++.h>
#include <stdint.h>
typedef uint32_t u32;
typedef uint64_t u64;
typedef std::pair<int, int> pii;
int main() {
for (;;) {
int n, k, m;
std::cin >> n >> k >> m;
if (n == 0 and k == 0 and m == 0)
break;
long dp[20000];
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 31, 16, 31, 23, 0, 16, 12, 16, 31, 13], ["+", 31, 16, 31, 23, 0, 16, 12, 16, 31, 13], ["+", 31, 23, 0, 16, 12, 16, 12, 74, 0, 24], ["+", 12, 16, 12, 74, 39, 77, 39, 86, 0, 96], ["+", 31, 23, 0, 16, 12, 16, 12, 74, 0, 25]] | 1 | 146 | 7 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
typedef long double ld;
typedef complex<ld> Point;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const ld eps = 1e-9, pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld p... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
typedef long double ld;
typedef complex<ld> Point;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const ld eps = 1e-9, pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld p... | [["-", 0, 16, 31, 16, 12, 23, 0, 41, 75, 13], ["+", 0, 16, 31, 16, 12, 23, 0, 41, 75, 22]] | 1 | 212 | 2 |
#define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#in... | #define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#in... | [["-", 8, 9, 0, 57, 64, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 1 | 282 | 5 |
#include "bits/stdc++.h"
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, k, m;
while (scanf("%d %d %d", &n, &k, &m), n) {
printf("%d\n", (m + f(n, k)) % n + 1);
}
} | #include "bits/stdc++.h"
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, k, m;
while (scanf("%d %d %d", &n, &k, &m), n) {
printf("%d\n", (m + f(n - 1, k)) % n + 1);
}
} | [["+", 0, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 102 | 2 |
#include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... | [["-", 31, 23, 0, 16, 31, 16, 31, 16, 31, 13], ["+", 31, 23, 0, 16, 31, 16, 31, 16, 31, 13]] | 1 | 223 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, m, k;
while (cin >> n >> k >> m, n) {
m = (m - k + 1 + n) % n;
cout << (f(n, k) + m - 1) % n + 1 << endl;
}
} | #include <cstring>
#include <iostream>
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, m, k;
while (cin >> n >> k >> m, n) {
m = (m - k + 1 + n) % n;
cout << (f(n, k) + m - 1 + n) % n + 1 << endl;
}
} | [["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22]] | 1 | 106 | 2 |
#include <iostream>
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, k, m;
while (cin >> n >> k >> m, n | k | m) {
m = (m - k + 1) % n;
cout << (f(n, k) + m - 1) % n + 1 << endl;
}
} | #include <iostream>
using namespace std;
int f(int n, int k) {
if (n == 1)
return 0;
return (f(n - 1, k) + k) % n;
}
int main() {
int n, k, m;
while (cin >> n >> k >> m, n | k | m) {
m = (m - k + 1 + n) % n;
cout << (f(n, k) + m - 1 + n) % n + 1 << endl;
}
} | [["+", 0, 11, 12, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 12, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22]] | 1 | 106 | 4 |
// Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | // Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | [["-", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]] | 1 | 188 | 2 |
//?????????????????????(8??????????????????????????´??°??¨1?????????????????????????????§????????????)???????????????????????§,
//???????±?????????? ?£(N[i]^K) = N9^K
//(1???i???8)??¨??????K????±?????????°????????? 1??????????¢???????????????°OK
// reading hard
#include <stdio.h>
#define int long long
int T;
int N[9];... | //?????????????????????(8??????????????????????????´??°??¨1?????????????????????????????§????????????)???????????????????????§,
//???????±?????????? ?£(N[i]^K) = N9^K
//(1???i???8)??¨??????K????±?????????°????????? 1??????????¢???????????????°OK
// reading hard
#include <stdio.h>
#define int long long
int T;
int N[9];... | [["-", 0, 1, 0, 11, 12, 23, 0, 16, 31, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 31, 13]] | 1 | 209 | 2 |
#include <cstdio>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int cc;
scanf("%d", &cc);
while (cc-- > 0) {
unsigned int n[9];
REP(i, 9) scanf("%xu", n + i);
unsigned int key = 0;
REP(i, 32) {
long long sum = 0;
REP(j, 8) { ... | #include <cstdio>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int cc;
scanf("%d", &cc);
while (cc-- > 0) {
unsigned int n[9];
REP(i, 9) scanf("%xu", n + i);
unsigned int key = 0;
REP(i, 32) {
long long sum = 0;
REP(j, 8) { ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 162 | 2 |
#include <cstdio>
using namespace std;
int main() {
unsigned n[9], k, t;
int s;
for (scanf("%d", &s); s--;) {
for (int i = 0; i < 9; ++i) {
scanf("%x", &n[i]);
}
k = 0;
for (int i = 0; i < 32; ++i) {
t = 0;
for (int j = 0; j < 8; ++j) {
t += n[j] ^ k;
}
k |=... | #include <cstdio>
using namespace std;
int main() {
unsigned n[9], k, t;
int s;
for (scanf("%d", &s); s--;) {
for (int i = 0; i < 9; ++i) {
scanf("%x", &n[i]);
}
k = 0;
for (int i = 0; i < 32; ++i) {
t = 0;
for (int j = 0; j < 8; ++j) {
t += n[j] ^ k;
}
k |=... | [["-", 0, 11, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 17, 140]] | 1 | 148 | 2 |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
/**
* Pathological Paths - Wrong Answer
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new Buffere... | import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
/**
* Pathological Paths - Wrong Answer
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new Buffere... | [["+", 0, 57, 75, 57, 64, 196, 0, 57, 0, 95], ["+", 75, 57, 64, 196, 0, 57, 75, 196, 0, 45], ["+", 64, 196, 0, 57, 75, 196, 0, 37, 0, 38], ["+", 0, 57, 75, 196, 0, 37, 0, 5, 0, 62], ["+", 64, 196, 0, 57, 75, 196, 0, 37, 0, 35], ["+", 0, 520, 0, 57, 75, 57, 64, 196, 0, 46]] | 3 | 853 | 7 |
N, M = list(map(int, input().split() ))
TimeStamp = 0
Stamp = "&Stamp&"
while N+M:
not_found = {}
Root = {}
Root[Stamp] = TimeStamp
TimeStamp+=1
not_found[Stamp] = TimeStamp
TimeStamp+=1
Root["."] = Root
Root[".."] = not_found
for i in range(N):
url = input()
content... | N, M = list(map(int, input().split() ))
TimeStamp = 0
Stamp = "&Stamp&"
while N+M:
not_found = {}
Root = {}
Root[Stamp] = TimeStamp
TimeStamp+=1
not_found[Stamp] = TimeStamp
TimeStamp+=1
Root["."] = Root
Root[".."] = not_found
for i in range(N):
url = input()
content... | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 449 | 4 |
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n, d;
vector<string> vec;
bool contain(string &a, string &b) {
string s, t;
if (a.size() > b.size())
s = a, t = b;
else
s = b, t = a;
int pos = 0;
for (int i = 0; i < s.size();... | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n, d;
vector<string> vec;
bool contain(string &a, string &b) {
string s, t;
if (a.size() > b.size())
s = a, t = b;
else
s = b, t = a;
int pos = 0;
for (int i = 0; i < s.size();... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 147], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 1,125 | 3 |
#include <bits/stdc++.h>
using namespace std;
struct die {
int p[6];
void init() {
for (int i = 0; i < 6; i++)
p[i] = i + 1;
}
void roll(int a, int b, int c, int d) {
int tmp = p[a];
p[a] = p[b];
p[b] = p[c];
p[c] = p[d];
p[d] = tmp;
}
void ra() { roll(0, 4, 5, 1); }
void rb... | #include <bits/stdc++.h>
using namespace std;
struct die {
int p[6];
void init() {
for (int i = 0; i < 6; i++)
p[i] = i + 1;
}
void roll(int a, int b, int c, int d) {
int tmp = p[a];
p[a] = p[b];
p[b] = p[c];
p[c] = p[d];
p[d] = tmp;
}
void ra() { roll(0, 4, 5, 1); }
void rb... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 929 | 3 |
#include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
#define X real()
#define Y imag()
const double EPS = (1e-7);
const int INF = 1 << 20;
double dot(P &a, P &b) { return a.X * b.X + a.Y * b.Y; }
double cross(P &a, P &b) { return a... | #include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
#define X real()
#define Y imag()
const double EPS = (1e-7);
const int INF = 1 << 20;
double dot(P &a, P &b) { return a.X * b.X + a.Y * b.Y; }
double cross(P &a, P &b) { return a... | [["-", 0, 57, 15, 339, 51, 16, 12, 91, 17, 33]] | 1 | 846 | 1 |
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const double eps = 1e-9;
typedef complex<double> P;
typedef vector<P> Polygon;
typedef vector<Polygon> Country;
double cross(P a, P b) { return (conj(a) * b).imag(); }
double dot(P a, P b)... | #include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const double eps = 1e-9;
typedef complex<double> P;
typedef vector<P> Polygon;
typedef vector<Polygon> Country;
double cross(P a, P b) { return (conj(a) * b).imag(); }
double dot(P a, P b)... | [["+", 51, 16, 12, 16, 31, 2, 3, 4, 0, 25], ["-", 15, 339, 51, 16, 12, 2, 3, 4, 0, 25]] | 1 | 777 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define pb push_back
#define sz size()
using namespace std;
typedef pair<int, int> P;
typedef pair<P, P> L;
typedef vector<int> vi;
inline int dot(const P &a, const P... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define pb push_back
#define sz size()
using namespace std;
typedef pair<int, int> P;
typedef pair<P, P> L;
typedef vector<int> vi;
inline int dot(const P &a, const P... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 1,066 | 4 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [["-", 0, 42, 0, 16, 12, 16, 31, 118, 119, 120], ["+", 0, 42, 0, 16, 12, 16, 31, 118, 119, 120], ["-", 49, 185, 54, 55, 0, 356, 0, 42, 0, 40], ["+", 49, 185, 54, 55, 0, 356, 0, 42, 0, 40]] | 1 | 1,143 | 4 |
#include <bits/stdc++.h>
#define EPS (1e-8)
#define INF (1e9)
#define X real()
#define Y imag()
#define N 105
#define M 15
using namespace std;
typedef pair<string, string> P1;
typedef complex<double> P;
int n, a, b, Slen, mark[M], ans;
vector<P> v[N];
set<string> S;
string s[N];
string d[M];
set<P1> z;
double dot(P A... | #include <bits/stdc++.h>
#define EPS (1e-8)
#define INF (1e9)
#define X real()
#define Y imag()
#define N 105
#define M 15
using namespace std;
typedef pair<string, string> P1;
typedef complex<double> P;
int n, a, b, Slen, mark[M], ans;
vector<P> v[N];
set<string> S;
string s[N];
string d[M];
set<P1> z;
double dot(P A... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 1,052 | 2 |
import java.awt.geom.*;
import java.util.*;
public class Main {
// 0945 start
ArrayList<Integer> list;
int MAX = 10000;
private void doit() {
Scanner sc = new Scanner(System.in);
eratos();
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int count = 0;
int len... | import java.awt.geom.*;
import java.util.*;
public class Main {
// 0945 start
// 0952 WA
ArrayList<Integer> list;
int MAX = 10000;
private void doit() {
Scanner sc = new Scanner(System.in);
eratos();
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int count = 0;
... | [["-", 8, 196, 0, 7, 15, 16, 31, 16, 17, 48], ["-", 8, 196, 0, 7, 15, 16, 31, 16, 12, 22]] | 3 | 322 | 2 |
import java.util.*;
public class Main {
int n;
int[] p;
int MAX = 2001;
void solve() {
Scanner sc = new Scanner(System.in);
p = new int[MAX];
for (int i = 2; i < p.length; i++)
p[i] = 1;
for (int i = 2; i < Math.sqrt(MAX) + 1; i++) {
for (int j = i * 2; j < MAX; j += i) {
... | import java.util.*;
public class Main {
int n;
int[] p;
int MAX = 10001;
void solve() {
Scanner sc = new Scanner(System.in);
p = new int[MAX];
for (int i = 2; i < p.length; i++)
p[i] = 1;
for (int i = 2; i < Math.sqrt(MAX) + 1; i++) {
for (int j = i * 2; j < MAX; j += i) {
... | [["-", 0, 235, 8, 498, 0, 124, 49, 200, 51, 499], ["+", 0, 235, 8, 498, 0, 124, 49, 200, 51, 499]] | 3 | 263 | 2 |
#include <stdio.h>
int prime[2000];
int c;
int count;
int isPrime(int n) {
int i;
if (n == 2)
return 1;
if (n == 1)
return 0;
if (!(n % 2))
return 0;
for (i = 1; i < c; i++) {
if (n == prime[i])
return 1;
if (!(n % prime[i]))
return 0;
}
for (i = prime[c - 1]; i < n / 2; i ... | #include <stdio.h>
int prime[2000];
int c, count;
int isPrime(int n) {
int i;
if (n == 2)
return 1;
if (n == 1)
return 0;
if (!(n % 2))
return 0;
for (i = 1; i < c; i++) {
if (n == prime[i])
return 1;
if (!(n % prime[i]))
return 0;
}
for (i = prime[c - 1]; i < n / 2; i += 2... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 350 | 7 |
#include <algorithm>
#include <iostream>
using namespace std;
int prime[200];
int main() {
int top = 0;
for (int i = 2; i < 1000; i++) {
bool ok = true;
for (int j = 0; j < top; j++)
if (i % prime[j] == 0)
ok = false;
if (ok) {
prime[top] = i;
top++;
}
}
int n;
while ... | #include <algorithm>
#include <iostream>
using namespace std;
int prime[2000];
int main() {
int top = 0;
for (int i = 2; i < 10000; i++) {
bool ok = true;
for (int j = 0; j < top; j++)
if (i % prime[j] == 0)
ok = false;
if (ok) {
prime[top] = i;
top++;
}
}
int n;
whil... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 198 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 332 | 2 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, w;
while (scanf("%d %d", &n, &w), n) {
int cnt[11] = {0};
int m = 0, h = 0;
for (int i = 0; i < n; i++) {
int v;
scanf("%d", &v);
cnt[v / w]++;
m = max(m, v / w);
}
for (int i = 0; i < n; i++) {
h = m... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, w;
while (scanf("%d %d", &n, &w), n) {
int cnt[11] = {0};
int m = 0, h = 0;
for (int i = 0; i < n; i++) {
int v;
scanf("%d", &v);
cnt[v / w]++;
m = max(m, v / w);
}
for (int i = 0; i <= m; i++) {
h = ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 191 | 4 |
#include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
for (int n, w; scanf("%d%d", &n, &w), n;) {
int hist[10] = {}, m = 1;
rep(i, n) {
int v;
scanf("%d", &v);
hist[v / w]++;
m = max(m, v / w + 1);
}
int hmax =... | #include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
for (int n, w; scanf("%d%d", &n, &w), n;) {
int hist[11] = {}, m = 1;
rep(i, n) {
int v;
scanf("%d", &v);
hist[v / w]++;
m = max(m, v / w + 1);
}
int hmax =... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 164 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.