language stringclasses 5
values | dataset stringclasses 1
value | code stringlengths 26 25k | id stringlengths 10 10 | test_IO listlengths 1 1 |
|---|---|---|---|---|
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <uti... | s438435664 | [
{
"input": "5 2\n",
"output": "7\n"
}
] |
C++ | codenet | #pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include <math.h>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#in... | s634121896 | [
{
"input": "5\n1\n2\n1\n2\n2\n",
"output": "3\n"
}
] |
C++ | codenet | #include <stdio.h>
int main(void) {
int n, k, x, y, z;
scanf("%d", &n);
scanf("%d", &k);
x = n / k;
y = n % k;
if (y != 0) {
z = x + 1 - x;
} else {
z = x - x;
}
printf("%d\n", z);
return 0;
} | s800506321 | [
{
"input": "7 3\n",
"output": "1\n"
}
] |
C++ | codenet | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define ll long long
#define For(i, x, y) for (ll i = x; i <= y; ++i)
#define FOr(i, x, y) for (ll i = x; i >= y; --i)
using namespace std;
inline ll read() {
ll x = 0, f = 1;
char... | s447383972 | [
{
"input": "6\n3 1 2 4 2 1\n",
"output": "2\n"
}
] |
C++ | codenet | #include <stdio.h>
#include <string.h>
int main(void) {
char s[1000];
scanf("%s", s);
int i, flag = 0;
for (i = 0; i < strlen(s); i++) {
if (i % 2 == 0) {
switch (s[i]) {
case 'R':
break;
case 'U':
break;
... | s495283729 | [
{
"input": "RUDLUDR\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i... | s973217665 | [
{
"input": "8\n10 0\n0 2\n-3 0\n4 2\n0 -13\n-4 1\n-2 -1\n3 -1\n",
"output": "C\nC\nP\nC\nC\nP\nP\nC\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
bool debug = false;
int main() {
int n, k, x, y;
cin >> n >> k >> x >> y;
int sum = 0;
for (int... | s990022717 | [
{
"input": "5\n3\n10000\n9000\n",
"output": "48000\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long long> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
std::vector<long long> abs_a = a;
for (int i = 0; i < n; i++) {
if (abs_a[i] < 0) {
abs_a[i] = -abs_a[i];
... | s194793609 | [
{
"input": "3\n-10 5 -4\n",
"output": "19\n"
}
] |
C++ | codenet | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
const int inf = 1e9;
const int mod = 1e9 + 7;
bool is_prime(ll x) {
for (ll i = 2;... | s049366196 | [
{
"input": "3\n",
"output": "4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define MAX_V 100001
#define MOD 1000000007
typedef vector<vector<int> > Graph;
int main() {
... | s575944217 | [
{
"input": "5\n1 1 2 2\n",
"output": "2\n2\n0\n0\n0\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
vector<int> Y(N);
for (int i = 0; i < N; i++) {
cin >> X[i];
Y[i] = X[i];
}
sort(Y.begin(), Y.end());
int y = Y[N / 2];
for (int i = 0; ... | s107598592 | [
{
"input": "4\n2 4 4 3\n",
"output": "4\n3\n3\n4\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt++;
int j = i + 1;
for (; j < n; j++) {
if (s[i] != s[j]) {
break;
}
}
i = j - ... | s014089689 | [
{
"input": "10\naabbbbaaca\n",
"output": "5\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstring>
#include <iostream>
#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++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
rep(i,... | s700281300 | [
{
"input": "4\naa\nabba\nabcd\nabcde\n",
"output": "1\n6\n12\n18\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int A, B;
int ans = 0;
int out = 1;
cin >> A >> B;
while (out < B) {
out--;
out += A;
ans++;
}
cout << ans << endl;
return 0;
} | s934757053 | [
{
"input": "4 10\n",
"output": "3\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((100 * a + 10 * b + c) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | s218395502 | [
{
"input": "4 3 2\n",
"output": "YES\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
using namespace std;
long long N, A[1 << 18];
long long dp[1 << 18][2][20];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = 0; i <= N; i++) {
for (int j = 0; j < 20; j++) {
dp[i][0][j] = -(1LL << 60);
dp... | s395011148 | [
{
"input": "6\n1 2 3 4 5 6\n",
"output": "12\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
struct Node {
int x, y, id;
} node[maxn];
struct Edge {
int u, v, val;
bool operator<(const Edge &rhs) const { r... | s350755479 | [
{
"input": "3\n1 5\n3 9\n7 8\n",
"output": "3\n"
}
] |
C++ | codenet | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace ... | s579031873 | [
{
"input": "3 1000\n120\n100\n140\n",
"output": "9\n"
}
] |
C++ | codenet | #include <math.h>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string bstr = to_string(b);
int num = a * pow(10, bstr.length()) + b;
in... | s793402552 | [
{
"input": "1 21\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <math.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, x;
string s;
cin >> n;
for (int i = 1; i <= n; i++) {
x = i;
s = std::to_string(x);
if (x % 3 == 0 || x % 10 == 3) {
cout << " " << i;
continue;
... | s121463387 | [
{
"input": "30\n",
"output": " 3 6 9 12 13 15 18 21 23 24 27 30\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int n, a[101], i;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
cout << a[n - 1];
for (i = 1; i < n; i++) cout << " " << a[n - i - 1];
cout << endl;
return 0;
} | s654970460 | [
{
"input": "5\n1 2 3 4 5\n",
"output": "5 4 3 2 1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int NMAX = 1000010;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < NMAX;... | s582643375 | [
{
"input": "3 3\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const long long int MOD = 1e9 + 7;
int main() {
int r;
cin >> r;
cout << r * r << endl;
} | s938564096 | [
{
"input": "2\n",
"output": "4\n"
}
] |
C++ | codenet | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | s459892612 | [
{
"input": "50 100 120\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
int n, k, t;
std::vector<int> vec;
int ans = 1000000001;
int main() {
std::cin >> n >> k;
for (int i = 0; i < n; i++) {
std::cin >> t;
vec.push_back(t);
}
std::sort(vec.begin(), vec.end());
for (int i = 0; i + k - 1 < n; i++)... | s353226283 | [
{
"input": "5 3\n10\n15\n11\n14\n12\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef lo... | s247537353 | [
{
"input": "2 1 1 3\n",
"output": "2\n"
}
] |
C++ | codenet | #include <stdio.h>
int main() {
int n, k;
long long int l = 0, r = 0;
scanf("%d%d", &n, &k);
if (k % 2 == 0) {
for (int i = 1; i <= n; i++)
if (i % k == k / 2)
l++;
else if (i % k == 0)
r++;
printf("%lld\n", l * l * l + r * r * r);
... | s323607209 | [
{
"input": "3 2\n",
"output": "9\n"
}
] |
C++ | codenet | #include <stdlib.h>
#include <algorithm>
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
int R;
cin >> R;
if (R < 1200)
cout << "ABC" << endl;
else if (R >= 2800)
cout << "AGC" << endl;
else
... | s628121241 | [
{
"input": "1199\n",
"output": "ABC\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(100000);
int l;
for (int i = 0; i < N; i++) {
scanf("%d", &l);
L[i] = l;
}
... | s013321508 | [
{
"input": "3 3\n2 13 8\n",
"output": "9\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PP;
ll key[1005] = {0};
ll cost[1005] = {0};
ll dp[(1 << 12) + 5][1005] = {0};
const ll INF = 123456789012;
i... | s571001771 | [
{
"input": "2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n",
"output": "25\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdlib>
#include <iostream>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 2 * 1e5 + 10;
int a[MAXN], n, L[MAXN / 2], R[MAXN / 2];
LL merge(int left, int mid, int right) {
int i, j, k;
LL cnt = 0;
int n1 = mid - left;
int n2 = right - m... | s557795702 | [
{
"input": "5\n3 5 2 1 4\n",
"output": "6\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = ... | s098326932 | [
{
"input": "10\n",
"output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
static const int N = 100;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int M[N][N], n;
int color[N], d[N], f[N], tt;
void dfs_visit(int u) {
int v;
color[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v]... | s669128523 | [
{
"input": "4\n1 1 2\n2 1 4\n3 0\n4 1 3\n",
"output": "1 1 8\n2 2 7\n3 4 5\n4 3 6\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
#define MIN(a, b) ((a < b) ? a : b)
#define INF 1000000001
#define N 100000
using namespace std;
struct edge {
int source;
int target;
int weight;
};
vector<edge> edges;
int distances[N];
int prev_distances[N] = {0};
int main() {
int V, E, r;
cin >> V >> E... | s314711832 | [
{
"input": "4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n",
"output": "0\n1\n3\n4\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int mem[N + 1];
for (int i = 1; i <= N; ++i) {
int P;
cin >> P;
mem[P] = i;
}
int maxcnt = 1;
int cnt = 1;
for (int i = 1; i < N; ++i) {
if (mem[i] < mem[i + 1]) {
cn... | s501065052 | [
{
"input": "4\n1\n3\n2\n4\n",
"output": "2\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int result;
if (a > b) {
result = 2 * a - 1;
} else if (a == b) {
result = 2 * a;
} else {
result = 2 * b - 1;
}
cout << result << endl;
return ... | s299205600 | [
{
"input": "5 3\n",
"output": "9\n"
}
] |
C++ | codenet | #include <assert.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN... | s983388294 | [
{
"input": "3\n2 1 2\n",
"output": "1\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
char B, OUT;
cin >> B;
if (B == 'A')
OUT = 'T';
else if (B == 'T')
OUT = 'A';
else if (B == 'C')
OUT = 'G';
else
OUT = 'C';
cout << OUT << endl;
} | s074799395 | [
{
"input": "A\n",
"output": "T\n"
}
] |
C++ | codenet | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | s134430594 | [
{
"input": "4\n0\n1\n1\n2\n",
"output": "3\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
const ll dx = x2 - x1, dy = y2 - y1;
ll x3 = x2 - dy, y3 = y2 + dx;
ll x4 = x1 - dy, y4 = y1 + dx;
cout << x3 << ' ' << y3 << ' ' << x4 << ' ' << y4 << endl;
return 0... | s700369080 | [
{
"input": "0 0 0 1\n",
"output": "-1 1 -1 0\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <queue>
#include <string>
#include <vector>
#d... | s241624152 | [
{
"input": "8 6\n",
"output": "Alice\n"
}
] |
C++ | codenet | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | s509329039 | [
{
"input": "3 3\n1 7\n3 2\n1 7\n",
"output": "702\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int d;
string map[105];
int n;
void visit() {
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
int sum, flg = 0;
int x = 2, y = n;
map[y][x] = ' ';
int ab[4] = {2, 2, 2, 2};
while (1) {
sum = 0;
while (1) {
... | s102850254 | [
{
"input": "2\n5\n6\n",
"output": "#####\n# #\n# # #\n# # #\n# ###\n\n######\n# #\n# ## #\n# # #\n# # #\n# ####\n"
}
] |
C++ | codenet | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> m;
m.push_back(10);
m.push_back(50);
m.push_back(100);
m.push_back(500);
bool first = true;
for (int money; cin >> money, money;) {
... | s663381244 | [
{
"input": "160\n1 1 2 0\n160\n1 0 2 10\n0\n",
"output": "10 1\n50 1\n100 1\n\n10 1\n100 2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
... | s791749917 | [
{
"input": "4 5\n",
"output": "10\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
double a = d * 2 + 1;
cout << ceil(n / a) << endl;
return 0;
} | s465977291 | [
{
"input": "6 2\n",
"output": "2\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << x * x * x << endl;
} | s023383699 | [
{
"input": "2\n",
"output": "8\n"
}
] |
C++ | codenet | #include <cmath>
#include <iostream>
using namespace std;
int div(int n);
int main() {
int num;
cin >> num;
cout << num << ":";
while (num != 1) {
cout << " " << div(num);
num = num / div(num);
}
cout << endl;
}
int div(int n) {
if (n % 2 == 0) return 2;
int s = sqrt(... | s605014348 | [
{
"input": "12\n",
"output": "12: 2 2 3\n"
}
] |
C++ | codenet | #include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int s[11], i;
for (i = 0; i < 10; i++) {
scanf("%d", &s[i]);
}
sort(s, s + 10);
for (i = 9; i > 6; i--) {
printf("%d\n", s[i]);
}
return 0;
} | s954770518 | [
{
"input": "1819\n2003\n876\n2840\n1723\n1673\n3776\n2848\n1592\n922\n",
"output": "3776\n2848\n2840\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) cin >> L[i];
int i;
int d = 0;
for (i = 0; i < N; i++) {
d = d + L[i];
if (d > X) break;
}
cout << i + 1 << endl;
} | s978355948 | [
{
"input": "3 6\n3 4 5\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool check(int n, int wei, vector<int> book) {
int tmp = wei;
n--;
for (int i = 0; i < book.size(); i++) {
if (tmp < book[i]) {
if (n > 0) {
n--;
tmp = wei;
if ... | s847126533 | [
{
"input": "3 9\n500\n300\n800\n200\n100\n600\n900\n700\n400\n4 3\n1000\n1000\n1000\n0 0\n",
"output": "1800\n1000\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
for (int i = 0; i < N; ++i) cin >> v[i];
int count = ((N - 1) + ((K - 1) - 1)) / (K - 1);
cout << count << '\n';
} | s296046823 | [
{
"input": "4 3\n2 3 1 4\n",
"output": "2\n"
}
] |
C++ | codenet | #include <iostream>
#include <queue>
using namespace std;
int main() {
int train[2];
int bus[2];
cin >> train[0] >> train[1];
cin >> bus[0] >> bus[1];
cout << (train[0] < train[1] ? train[0] : train[1]) +
(bus[0] < bus[1] ? bus[0] : bus[1])
<< endl;
return 0;
} | s150958471 | [
{
"input": "600\n300\n220\n420\n",
"output": "520\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::cout << std::fixed << std:... | s085554271 | [
{
"input": "7\n500 600\n",
"output": "OK\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
std::string check(int x, int y) {
if (y % 2 == 0) {
int t = (int)(0.5 * y) - x;
if (t >= 0 && (x - t) >= 0) return "Yes";
}
return "No";
}
int main() {
int x, y;
std::cin >> x >> y;
std::cout << check(x, y) << std::endl;
return 0;
} | s472228164 | [
{
"input": "3 8\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int INF = 200000005;
int main() {
int a, b;
cin >> a >> b;
if (a <= 8 && b <= 8)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | s854821134 | [
{
"input": "5 4\n",
"output": "Yay!\n"
}
] |
C++ | codenet | #include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb ... | s661446851 | [
{
"input": "1\n",
"output": "0\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
typedef long long ll;
ll n, k, ans, L, ans2;
string s;
int main(void) {
cin >> n >> k;
cin >> s;
L = s[0];
ll cnt = 0;
for (int i = 1; i < n; i++) {
if (L == s[i])
cnt++;
else {
L = s[i];
ans += cnt;
... | s410514868 | [
{
"input": "6 1\nLRLRRL\n",
"output": "3\n"
}
] |
C++ | codenet | #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... | s683946919 | [
{
"input": "14\n04/21 09:00 I 000\n04/21 09:00 I 001\n04/21 09:15 I 002\n04/21 09:30 O 001\n04/21 09:45 O 000\n04/21 10:00 O 002\n04/28 09:00 I 003\n04/28 09:15 I 000\n04/28 09:30 I 004\n04/28 09:45 O 004\n04/28 10:00 O 000\n04/28 10:15 O 003\n04/29 20:00 I 002\n04/29 21:30 O 002\n20\n06/01 09:00 I 001\n06/01 0... |
C++ | codenet | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, m;
int k, a;
int x[31] = {};
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> a;
x[a]++;
}
}
... | s526060174 | [
{
"input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n",
"output": "1\n"
}
] |
C++ | codenet | #include <cassert>
#include <climits>
#include <iostream>
#include <vector>
struct TSize {
int r;
int c;
TSize() : r(0), c(0) {}
TSize(int Ar, int Ac) : r(Ar), c(Ac) {}
};
class TMcmSolver {
typedef std::vector<std::vector<int> > TMatrix;
TMatrix FMemo;
const std::vector<TSize>& FChain;
... | s792884768 | [
{
"input": "6\n30 35\n35 15\n15 5\n5 10\n10 20\n20 25\n",
"output": "15125\n"
}
] |
C++ | codenet | #include <iostream>
#include <map>
using namespace std;
int main() {
map<int, int> m;
for (int i = 0; i * 200 < 5001; i++) {
for (int j = 0; j * 300 < 5001; j++) {
for (int k = 0; k * 500 < 5001; k++) {
int w = i * 200 + j * 300 + k * 500;
int p = i / 5 * 5 *... | s323743606 | [
{
"input": "500\n2200\n0\n",
"output": "850\n3390\n"
}
] |
C++ | codenet | #include <iostream>
int main() {
int N, A;
std::cin >> N;
std::cin >> A;
std::cout << N * N - A << std::endl;
} | s855845406 | [
{
"input": "3\n4\n",
"output": "5\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define sz(a) int((a).size())
#define all... | s146561572 | [
{
"input": "3\n1 3\n2 3\n",
"output": "7\n"
}
] |
C++ | codenet | #include <iostream>
#include <map>
using namespace std;
int main() {
string str;
cin >> str;
int max = 0, cnt = 0;
for (auto sc : str) {
if (sc == 'A' || sc == 'C' || sc == 'G' || sc == 'T') {
cnt++;
} else {
cnt = 0;
}
max = max < cnt ? cnt : ma... | s472290172 | [
{
"input": "ATCODER\n",
"output": "3\n"
}
] |
C++ | codenet | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
cout << "Brown" << endl;
else
cout << "Alice" << endl;
} | s917269550 | [
{
"input": "2 1\n",
"output": "Brown\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a + b == c || b + c == a || a + c == b) ? "Yes" : "No") << endl;
} | s271114101 | [
{
"input": "10 30 20\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
char str[10], com[13];
map<string, bool> T;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%s%s", com, str);
if (com[0] == 'i')
T[string(str)] = true;
... | s129088151 | [
{
"input": "5\ninsert A\ninsert T\ninsert C\nfind G\nfind A\n",
"output": "no\nyes\n"
}
] |
C++ | codenet | #include <math.h>
#include <algorithm>
#include <bitset>
#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;
using ll = long long;
using vll = vector<long l... | s877835664 | [
{
"input": "4 5\n3 2 4 1\n",
"output": "4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int M = 1010;
char a[M], b[M];
int n, m, ans = M + 10;
int main() {
scanf("%s", a + 1);
n = strlen(a + 1);
scanf("%s", b + 1);
m = strlen(b + 1);
for (int i = 1; i + m - 1 <= n; i++) {
i... | s754383079 | [
{
"input": "cabacc\nabc\n",
"output": "1\n"
}
] |
C++ | codenet | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#de... | s814769071 | [
{
"input": "3 2\n",
"output": "10\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int N, ans, i, count;
cin >> N;
int A[N];
for (i = 0; i < N; i++) {
cin >> A[i];
}
i = 0;
ans = 0;
count = 0;
while (A[i + 1] != NULL) {
if (A[i] == A[i + 1]) {
count++;
if (count % 2 != 0) ... | s860472409 | [
{
"input": "5\n1 1 2 2 2\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | s765257696 | [
{
"input": "5\n1 3 5 4 2\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
bool d[10] = {0};
int n, k;
bool hantei = true;
int main() {
cin >> n >> k;
for (int i = 0; i < k; +... | s930643405 | [
{
"input": "1000 8\n1 3 4 5 6 7 8 9\n",
"output": "2000\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const double PI = acos(-1.0);
int sig(double d) { return fabs(d) < 1e-8 ? 0 : d < 0 ? -1 : 1; }
struct Point {
double x, y;
double k;
Point() {}
Point(double x, double... | s143031369 | [
{
"input": "2\n0 0\n1 1\n",
"output": "0.5\n0.5\n"
}
] |
C++ | codenet | #include <cstdio>
const int MAXN = 1E5 + 10;
int n, m, Q;
int a[MAXN];
int b[MAXN], id[MAXN];
bool vis[MAXN];
int cnt[MAXN];
int main() {
scanf("%d%d", &n, &m);
scanf("%d", &Q);
for (int i = 1; i <= Q; ++i) scanf("%d", &a[i]);
for (int k = 0, j = Q; j > 0; --j)
if (!vis[a[j]]) b[++k] = a[j], ... | s568362035 | [
{
"input": "2 2\n3\n2 1 2\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
char S;
while (true) {
cin >> a >> S >> b;
if (S == '+') cout << a + b << endl;
if (S == '-') cout << a - b << endl;
if (S == '*') cout << a * b << endl;
if (S == '/') cout << a / b << e... | s783753345 | [
{
"input": "1 + 2\n56 - 18\n13 * 2\n100 / 10\n27 + 81\n0 ? 0\n",
"output": "3\n38\n26\n10\n108\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
void A(void);
void B(void);
void C(void);
void D(void);
int main(void) { B(); }
void B(void) {
long long int x, sum;
cin >> x;
int i;
sum = 100;
for (i = 0; sum < x; ++i) {
sum += sum / 100;
}
cout << i << endl;
} | s914373115 | [
{
"input": "103\n",
"output": "3\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, a[100], b[100], sum = 0;
cin >> n;
... | s598010898 | [
{
"input": "3\n10 2 5\n6 3 4\n",
"output": "5\n"
}
] |
C++ | codenet | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h1, h2, m1, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int ans = h2 * 60 + m2 - (h1 * 60 + m1);
cout << ans - k << endl;
return 0;
} | s259332673 | [
{
"input": "10 0 15 0 30\n",
"output": "270\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (char i = 'a'; i <= 'z'; i++) {
int a = 0;
for (int j = 0; j < s.size(); j++) {
if (i == s.at(j)) {
a++;
}
}
... | s726701284 | [
{
"input": "atcoderregularcontest\n",
"output": "b\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << (a + (a * a) + (a * a * a)) << endl;
return 0;
} | s609497560 | [
{
"input": "2\n",
"output": "14\n"
}
] |
C++ | codenet | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N = 0;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) cin >> A[i];
int m = A[0];
int M = A[0];
for (int i = 0; i < N; i++) {
if (A[i] < m) m = A[i];
if (A[i] > M) M = A[i];
}
cout << M - m ... | s864662146 | [
{
"input": "4\n1 4 6 3\n",
"output": "5\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (i... | s329154546 | [
{
"input": "3 3\ndxx\naxx\ncxx\n",
"output": "axxcxxdxx\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int v[26] = {};
for (int i = 0; i < n; i++) v[s[i] - 'a']++;
string ans = "Yes";
for (int i = 0; i < 26; i++) {
if (v[i] % 2 != 0) {
ans = "No"... | s375006529 | [
{
"input": "abaccaba\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | s113620820 | [
{
"input": "3\n1 2 3\n",
"output": "9\n"
}
] |
C++ | codenet | #include <iostream>
#include <queue>
using namespace std;
struct task {
string name;
int time;
};
int main() {
int n, q;
int elaps = 0;
queue<task> Q;
cin >> n >> q;
for (int i = 0; i < n; i++) {
task tmp;
cin >> tmp.name >> tmp.time;
Q.push(tmp);
}
whil... | s525470559 | [
{
"input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n",
"output": "p2 180\np5 400\np1 450\np3 550\np4 800\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int maxn = 200000 + 10;
const int INF = int(1e8);
int maps[maxn];
int num[maxn];
int main() {
int n;
while (~scanf("%d", &... | s154250720 | [
{
"input": "4\n2 4 4 3\n",
"output": "4\n3\n3\n4\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, t = 0, h = 0, lt, lh, tt, hh, l;
cin >> a;
string taro, hana;
for (int i = 0; i < a; ++i) {
cin >> taro >> hana;
lt = taro.length();
lh = hana.length();
... | s589139355 | [
{
"input": "3\ncat dog\nfish fish\nlion tiger\n",
"output": "1 7\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int mul(const string& str, int& idx) {
int res = str[idx] - '0';
while (idx + 1 < str.size() && str[idx + 1] == '*') {
idx += 2;
res *= str[idx] - '0';
}
return res;
}
int add(const string& str, int& idx) {
int res = mul(s... | s611392782 | [
{
"input": "1+2*3+4\n11\n",
"output": "M\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main(void) {
unsigned long n;
cin >> n;
bool flg = false;
if (n < 4) {
cout << "No" << endl;
} else {
for (int i = 0; i <= (n / 4); i++) {
for (int j = 0; j <= (n / 7); j++) {
if ((i * 4 + j * 7) == n) {
... | s573429823 | [
{
"input": "11\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <bitset>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string source = "";
cin >> source;
if (source.length() > 10 || source.length() < 1) {
return -1;
}
int max_i = static_cast<int>(pow(2, source.length() - 1));
double sum = 0;
... | s522742913 | [
{
"input": "125\n",
"output": "176\n"
}
] |
C++ | codenet | #include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) { re... | s644382798 | [
{
"input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n",
"output": "p2 180\np5 400\np1 450\np3 550\np4 800\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
} | s786032937 | [
{
"input": "3\n",
"output": "180\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a;
cin >> a;
int sum = 0;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = n - 1; i > n - a - 1; i--) {
sum += s[i];
}
cout <... | s970063640 | [
{
"input": "5 3\n1 2 3 4 5\n",
"output": "12\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()... | s146177123 | [
{
"input": "3\n0\n5\n1\n1\n0\n-1\n",
"output": "0111111\n1010010\n1101011\n0111111\n"
}
] |
C++ | codenet | #include <iostream>
#include <map>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, std::vector<long long> T, long long M,
std::vector<long long> P, std::vector<long long> X) {
REP(i, M) {
long long ans = 0;
REP... | s615507008 | [
{
"input": "3\n2 1 4\n2\n1 1\n2 3\n",
"output": "6\n9\n"
}
] |
C++ | codenet | #include <iostream>
int main() {
int h, w, hh, ww;
std::cin >> h >> w >> hh >> ww;
std::cout << (h - hh) * (w - ww) << '\n';
return 0;
} | s391054810 | [
{
"input": "3 2\n2 1\n",
"output": "1\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main(void) {
long long int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << "\n";
} else {
cout << "IMPOSSIBLE\n";
}
} | s698030085 | [
{
"input": "2 16\n",
"output": "9\n"
}
] |
C++ | codenet | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
using namespace std;
long long a[200000];
int ind_a[200000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
... | s876796799 | [
{
"input": "3\n2 1 3\n",
"output": "9\n"
}
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.