language stringclasses 5
values | dataset stringclasses 1
value | code stringlengths 26 25k | id stringlengths 10 10 | test_IO listlengths 1 1 |
|---|---|---|---|---|
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int kekka[2];
int prime_or_not[1001];
int prime_list[1001];
int prime_num[1001];
int prime_counter = 0;
void sosuubunnpu() {
for (int i = 1; i <= 1000; ++i) {
prime_or_not[i] = 0;
}
for (int i = 2; i <= 1000; ++i) {
for (int j = 2; j... | s539273394 | [
{
"input": "3\n",
"output": "4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define ll long long int
using namespace std;
int h[6], w[6];
int main() {
int x, ans = 0;
cin >> x;
ans = x + x * x + x * x * x;
cout << ans << endl;
return 0;
} | s837925207 | [
{
"input": "2\n",
"output": "14\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A + B;
if (A % 3 != 0 && B % 3 != 0 && C % 3 != 0) {
cout << "Impossible" << endl;
} else {
cout << "Possible" << endl;
}
return 0;
} | s275739084 | [
{
"input": "4 5\n",
"output": "Possible\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
void sort(vector<int>& a_rvecIntValue);
int main(void) {
int iNum = 0;
cin >> iNum;
vector<int> vecIntValue;
while (iNum) {
int iIntValue = 0;
cin >> iIntValue;
vecIntValue.push_back(iIntValue);
iNum--;
}
... | s110965154 | [
{
"input": "6\n5 2 4 6 1 3\n",
"output": "5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n"
}
] |
C++ | codenet | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | s480704678 | [
{
"input": "3\n1 2 3\n",
"output": "11\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
string str;
int main() {
cin >> str;
if (str[2] == str[3] && str[4] == str[5])
cout << "Yes\n";
else
cout << "No\n";
} | s275513165 | [
{
"input": "sippuu\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x >= 1200)
cout << "ARC" << endl;
else
cout << "ABC" << endl;
return 0;
} | s263967574 | [
{
"input": "1000\n",
"output": "ABC\n"
}
] |
C++ | codenet | #include <assert.h>
#include <math.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#includ... | s744854383 | [
{
"input": "3\n2 1 2\n",
"output": "1\n"
}
] |
C++ | codenet | #include <iostream>
typedef long long ll;
int mat[3000][3000];
ll dp[3000][3000][4];
ll dpl[3000];
int main(int argc, char **argv) {
int rr, cc, k;
std::cin >> rr >> cc >> k;
for (int i = 1; i <= k; i++) {
int r, c, v;
std::cin >> r >> c >> v;
mat[r - 1][c - 1] = v;
}
dp... | s035123609 | [
{
"input": "2 2 3\n1 1 3\n2 1 4\n1 2 5\n",
"output": "8\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, z;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
a = i;
break;
}
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'Z') {
... | s907227314 | [
{
"input": "QWERTYASDFZXCV\n",
"output": "5\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a * b % 2 == 1 && (c + d) % 2 == 1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | s531853923 | [
{
"input": "3 5 1 4\n",
"output": "No\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int M, m, addup, i;
M = -1;
m = 1001;
addup = 0;
for (i = 0; i < N; i++) {
cin >> S;
addup += S;
if (S > M) M = S;
if (S < m) m = S;
... | s992338735 | [
{
"input": "3\n1000\n342\n0\n5\n2\n2\n9\n11\n932\n5\n300\n1000\n0\n200\n400\n8\n353\n242\n402\n274\n283\n132\n402\n523\n0\n",
"output": "342\n7\n300\n326\n"
}
] |
C++ | codenet | #include <limits.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#incl... | s129191754 | [
{
"input": "5\n2 6 1 4 5\n",
"output": "YES\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
unsigned long a[100100];
int main(void) {
int k;
unsigned long min, max;
scanf("%d", &k);
for (int i = 0; i < k; i++) scanf("%ld", &a[i]);
max = 3, min = 2;
if (a[k - 1] != 2) {
cout << -1 << endl;
return 0;
}
for (int i = k... | s028542090 | [
{
"input": "4\n3 4 3 2\n",
"output": "6 8\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string str1, str2;
cin >> str1 >> str2;
sort(str1.begin(), str1.end());
sort(str2.rbegin(), str2.rend());
int loop = str1.length() > str2.length() ? str2.length() : str1.length();
bool flag = false;
... | s240156356 | [
{
"input": "yx\naxy\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <stdlib.h>
#include <iostream>
using namespace std;
int main() {
string str;
string tmp;
int sum;
while (1) {
cin >> str;
if (str == "0") break;
sum = 0;
for (int i = 0; i < str.size(); i++) {
tmp = str[i];
int num = atoi(tmp.c_str());
... | s074619936 | [
{
"input": "123\n55\n1000\n0\n",
"output": "6\n10\n1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1 << 29
#define LL long long int
LL const MOD = 1000000007;
int main() {
cin... | s343280137 | [
{
"input": "3 20\n2 80\n9 120\n16 1\n",
"output": "191\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, ii, a, b;
cin >> n;
long long cnt[10][10];
REP(i, 100) cnt[i % 10][i / 10] = 0... | s324508229 | [
{
"input": "25\n",
"output": "17\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstring>
#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;
#define fi first
#define se second
#define mp make_pair
#define r... | s240627521 | [
{
"input": "5\n6 9 4 2 11\n",
"output": "11 6\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#defin... | s345215315 | [
{
"input": "...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n...............\n......O....... |
C++ | codenet | #include <iostream>
#include <vector>
#define rep(i, k, n) for (int i = k; i < n; ++i)
using namespace std;
template <class T>
inline void chmin(T &a, T b) {
if (a > b) a = b;
return;
}
const int INF = 1 << 30;
int main() {
vector<int> dp(101000, INF);
dp.at(0) = 0;
int N, K;
cin >> N >> K;
... | s189738089 | [
{
"input": "5 3\n10 30 40 50 20\n",
"output": "30\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
s += s;
puts(s.find(t) + 1 ? "Yes" : "No");
} | s807902500 | [
{
"input": "kyoto\ntokyo\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
#define MOD 7007
struct QUEUE {
int a, b, c, tot;
} Push;
int F[6][3] = {{1, 1, 0}, {1, 0, 1}, {0, 1, 1},
{2, 0, 0}, {0, 2, 0}, {0, 0, 2}};
vector<int> Hash[MOD];
bool HASH(int n) {
f... | s085712108 | [
{
"input": "2 5 4\n",
"output": "2\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int n;
int array[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
sum += array[i] * array[j];
}
}
... | s780006912 | [
{
"input": "3\n3 1 2\n",
"output": "11\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main(void) {
int i, t, n;
for (i = 0; i < 4; i++) {
cin >> t >> n;
if (t == 1) {
cout << 6000 * n << endl;
} else if (t == 2) {
cout << 4000 * n << endl;
} else if (t == 3) {
cout << 3000 * n << endl... | s475106338 | [
{
"input": "3 10\n1 4\n4 1\n2 5\n",
"output": "30000\n24000\n2000\n20000\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
long long a[200005];
long long pre[200005];
long long last[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a... | s422352362 | [
{
"input": "6\n1 2 3 4 5 6\n",
"output": "1\n"
}
] |
C++ | codenet | #ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <unordered_map>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | s976558978 | [
{
"input": "4 3\n",
"output": "3333\n"
}
] |
C++ | codenet | #include <ctype.h>
#include <math.h>
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string N;
cin >> N;
int S = 0;
for ... | s527973537 | [
{
"input": "12\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
int ans = 0;
for (int i = 0; i < k; i++) {
ans += l[n - 1 - i]... | s623008479 | [
{
"input": "5 3\n1 2 3 4 5\n",
"output": "12\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
bool isPalindrome(string s) {
for (int i = 0; i < s.length() / 2; i++) {
if (s[i] == s[s.length() - 1 - i])
continue;
else
return false;
}
return true;
}
int main() {
string s;
cin >> s;
if (isPalindrome(s) && isP... | s221616550 | [
{
"input": "akasaka\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (b > c) {
swap(b, c);
}
if (a > b) {
swap(a, b);
}
cout << a << " " << b << " " << c << endl;
} | s661916956 | [
{
"input": "3 8 1\n",
"output": "1 3 8\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
} | s300263829 | [
{
"input": "2 5\n",
"output": "10\n"
}
] |
C++ | codenet | #include <cstdio>
#define int long long
int n, m, mod, C[310][310], pre[310][310], f[310][310];
using namespace std;
signed main() {
scanf("%lld%lld%lld", &n, &m, &mod);
C[0][0] = 1;
for (int i = 1; i <= n; i++) {
C[i][0] = C[i][i] = 1;
for (int j = 1; j < i; j++)
C[i][j] = (C[i ... | s343804973 | [
{
"input": "2 2 100\n",
"output": "5\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int N, A;
int main() {
cin >> N >> A;
cout << (N % 500 <= A ? "Yes" : "No") << endl;
return 0;
} | s208784214 | [
{
"input": "2018\n218\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
template <int V>
struct BitMatching {
vector<int> G[2 * V];
int match[2 * V];
bool used[2 * V];
void init() {
for (int i = 0; i < 2 * V; i++) {
G[i].clear();
}
}
vo... | s620821061 | [
{
"input": "4 3\n2 6 6 15\n2 3 5\n2 3\n4 9\n8 16 32\n4 2\n4 9 11 13\n5 7\n5 5\n2 3 5 1001 1001\n7 11 13 30 30\n10 10\n2 3 5 7 9 11 13 15 17 29\n4 6 10 14 18 22 26 30 34 38\n20 20\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 ... |
C++ | codenet | #define _USE_MATH_DEFINES
#include <assert.h>
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random... | s853750785 | [
{
"input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int64_t> A(N);
rep(i, N) cin >> A[i];
int64_t answer = 0;
for (int i = 0; i < N - 1; ++i) {
... | s495709932 | [
{
"input": "4\n1 4 6 3\n",
"output": "5\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 13 && A >= 6) {
cout << B / 2 << endl;
}
if (A < 6) {
cout << 0 << endl;
}
if (A >= 13) {
cout << B << endl;
}
} | s387994967 | [
{
"input": "30 100\n",
"output": "100\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int minA = pow(10, 9) + 1;
int num = 0;
int n, t, f = 0;
cin >> n >> t;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int... | s107204188 | [
{
"input": "3 2\n100 50 200\n",
"output": "1\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
class Cube {
public:
int f[6];
Cube() {}
void roll_z() { roll(1, 2, 4, 3); }
void roll_y() { roll(0, 2, 5, 3); }
void roll_x() { roll(0, 1, 5, 4); }
void roll(int i, int j, int k, int l) {
int t = f[i];
f[i] = f[j];
f[j] = f[k]... | s367896206 | [
{
"input": "1 2 3 4 5 6\n6 2 4 3 5 1\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n, ans;
cin >> n;
vector<int> p(n);
for (i = 0; i < n; i++) {
cin >> p[i];
}
ans = 0;
for (i = 0; i < n - 1; i++) {
if (p[i] == i + 1) {
p[i + 1] = p[i];
ans += 1;
}... | s064900223 | [
{
"input": "5\n1 4 3 5 2\n",
"output": "2\n"
}
] |
C++ | codenet | #include <math.h>
#include <iostream>
using namespace std;
typedef long long ll;
int n, a[50], p, b = 0, c = 0;
ll nPr(ll n, ll r) {
ll res = 1;
for (int i = 0; i < r; i++) {
res *= (n - i);
}
return res;
}
ll nCr(ll n, ll r) {
double res = 1;
for (int i = 0; i < r; i++) {
r... | s788730767 | [
{
"input": "2 0\n1 3\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, string> P;
P v[22];
vector<int> d[33];
int main(void) {
int n;
while (cin >> n && n) {
int m;
for (int i = 0; i < 33; i++) d[i].clear();
for (int i = 0; i... | s814403222 | [
{
"input": "4\nakzakr 2 1 8\nfnmyi 5 2 3 4 6 9\ntsnukk 5 2 3 4 7 9\nyskwcnt 6 3 4 7 8 9 10\n4\nakzakr 1 2\nfnmyi 3 10 11 12\ntsnukk 2 1 8\nyskwcnt 2 1 8\n5\nknmmdk 2 13 19\nakmhmr 4 13 15 19 22\nmksyk 6 3 7 12 13 15 19\nskrkyk 3 1 4 8\ntmemm 3 1 17 24\n5\nknmmdk 5 5 6 16 18 26\nakmhmr 9 3 4 7 11 14 15 17 18 20\... |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int A[N];
vector<int> B(N);
for (int i = 0; i < N; i++) cin >> A[i];
int m = A[0];
B[1] = A[1] - m;
m = min(m, A[1]);
for (int i = 2; i < N; i++) {
B[i] = A[... | s798522572 | [
{
"input": "3 2\n100 50 200\n",
"output": "1\n"
}
] |
C++ | codenet | #include <math.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long lon... | s166776347 | [
{
"input": "2 2\n2 1\n",
"output": "3\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
int main() {
using namespace std;
string s, t;
cin >> s;
t = s[0];
t += to_string(s.size() - 2);
t += s[s.size() - 1];
cout << t << endl;
} | s628937234 | [
{
"input": "internationalization\n",
"output": "i18n\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
using namespace std;
bool solve() {
int maxsize = 0;
int maxcnt = 0;
in... | s794872785 | [
{
"input": "Thank you for your mail and your lectures\n",
"output": "your lectures\n"
}
] |
C++ | codenet | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int gcd(int a, int b) {
if (a < b) swap... | s208096306 | [
{
"input": "4\n2 10 8 40\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy[4] = {-1, 0, +1, 0};
int dx[4] = {0, +1, 0, -1};... | s353737529 | [
{
"input": "-9\n",
"output": "1011\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#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;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
in... | s929864256 | [
{
"input": "-13 3\n",
"output": "-10\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD2 1000000007
#define MOD 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#defi... | s338629964 | [
{
"input": "2\n1 1\n1 1\n",
"output": "3\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int SIZE = (1e5 * 2) + 13;
vector<int> a;
vector<int> cnt(SIZE);
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
cnt[x]++;
}
for (int i = 0; i < cnt.... | s684825280 | [
{
"input": "5 2\n1 1 2 2 5\n",
"output": "1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int r;
cin >> r;
cout << (r * r) << endl;
} | s397891977 | [
{
"input": "2\n",
"output": "4\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll pow(ll a, ll n) {
ll r... | s950360470 | [
{
"input": "3 5\n",
"output": "10\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
int here[100001];
int dp1[100001];
int dp2[100001];
int main() {
while (1) {
int n... | s970719454 | [
{
"input": "7 5\n6\n2\n4\n7\n1\n7 5\n6\n2\n0\n4\n7\n0 0\n",
"output": "2\n4\n"
}
] |
C++ | codenet | #include <cstdio>
#include <iostream>
using namespace std;
inline int read() {
int k = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
k = k * 10 + ch - '0';
ch = getchar();
}... | s448220316 | [
{
"input": "3 3\n1 2 1\n2 3 1\n1 3 2\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <stdio.h>
int main() {
int A[100], n, i, j, t, sw = 0, mini;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (A[j] < A[mini]) mini = j;
}
t = A[i];
A[i] = A[mini]... | s151802561 | [
{
"input": "6\n5 6 4 2 1 3\n",
"output": "1 2 3 4 5 6\n4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
} | s680076196 | [
{
"input": "3 2\n2 1\n",
"output": "1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define int long long int
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string str;
cin >> str;
int sum = 0;
for (char x : str) {... | s257064825 | [
{
"input": "123456789\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
long long Euclid(long long x, long long y) {
long long tmp;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
if (!(x % y)) return y;
return Euclid(y, x % y);
}
int main() {
long long A, B;
cin >> A >> B;
cout << (A * B) / Eucli... | s097779718 | [
{
"input": "2 3\n",
"output": "6\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iostream>
using namespace std;
int main(void) {
int n, a[100];
double avg = 0, s, ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
avg += a[i];
}
avg /= n;
s =... | s716198307 | [
{
"input": "3\n1 2 3\n",
"output": "1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
... | s569774535 | [
{
"input": "3\n8 12 40\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define rep(i, n... | s285212630 | [
{
"input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n",
"output": "3\n2\n4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | s501882481 | [
{
"input": "Sunny\n",
"output": "Cloudy\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#include <set>
int main(void) {
int n, m;
... | s531812249 | [
{
"input": "2 1\n",
"output": "1\n"
}
] |
C++ | codenet | #pragma GCC optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
#define mod9 998244353
#define ld long d... | s968402497 | [
{
"input": "7\n500 600\n",
"output": "OK\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
long long int a, b, x;
scanf("%lld%lld%lld", &a, &b, &x);
long long int s = (b / x - a / x);
if (a % x == 0) s++;
... | s452437940 | [
{
"input": "4 8 2\n",
"output": "3\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> foods(m);
for (int i = 0; i < n; i++) {
int k;
std::cin >> k;
for (int j = 0; j < k; j++) {
int temp;
std::cin >> temp;
temp--;
f... | s571373151 | [
{
"input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n",
"output": "1\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (cin >> m >> f >> r && (m != -1 || f != -1 || r != -1)) {
if (m == -1 || f == -1)
cout << "F";
else if (m + f >= 80)
cout << "A";
else if (m + f >= 65)
cout << "B";
else... | s698205968 | [
{
"input": "40 42 -1\n20 30 -1\n0 2 -1\n-1 -1 -1\n",
"output": "A\nC\nF\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define int long long
#define REP(i, s, e) for ((i) = (s); (i) < (e); (i)++)
#define RREP(i, s, e) for ((i) = ((s)-1); (i) >= (e); (i)--)
#define FOR(i, n) for ((i) = (0); (i) < (n); (i)++)... | s672953945 | [
{
"input": "3 3\ndxx\naxx\ncxx\n",
"output": "axxcxxdxx\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string W;
cin >> W;
sort(W.begin(), W.end());
for (string::iterator itr = W.begin(); itr != W.end(); itr += 2) {
if (*itr != *(itr + 1)) {
cout << "No" << endl;
... | s941927127 | [
{
"input": "abaccaba\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> ... | s050708710 | [
{
"input": "1 2 3 4\n",
"output": "4\n"
}
] |
C++ | codenet | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int ac_count = 0;
int wa_count = 0;
int tle_count = 0;
int re_count = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
if (s == "AC") {
ac_count += 1;
} ... | s173139590 | [
{
"input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n",
"output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"
}
] |
C++ | codenet | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | s123678341 | [
{
"input": "2 2 2 8\n4 6\n1 5\n3 8\n",
"output": "19\n17\n15\n14\n13\n12\n10\n8\n"
}
] |
C++ | codenet | #include <math.h>
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e8, cnt = 1;
int main() {
ll h;
cin >> h;
while (h != 1) {
if (h % 2 != 0) h--;
... | s984540390 | [
{
"input": "2\n",
"output": "3\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
cout << a / (60 * 60) << ":" << a % (60 * 60) / 60 << ":"
<< a % (60 * 60) % 60 << endl;
return 0;
} | s844285682 | [
{
"input": "46979\n",
"output": "13:2:59\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int sq[10000], fr[5000];
vector<int> com;
int tmp;
while (1) {
cin >> n;
if (!n) break;
for (int i = 1; i < n; i++) sq[i] = (i * i) % n;
com.clear();
for (int i = 1; i < n; i++)... | s391929974 | [
{
"input": "11\n15\n0\n",
"output": "4\n4\n4\n4\n4\n2\n2\n4\n2\n4\n4\n2\n"
}
] |
C++ | codenet | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
... | s209567491 | [
{
"input": "3\n7 1\n2\n5\n10\n",
"output": "8\n"
}
] |
C++ | codenet | #include <math.h>
#include <stdio.h>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long l... | s466967233 | [
{
"input": "4 5\n3 2 4 1\n",
"output": "4\n"
}
] |
C++ | codenet | #include <cstdio>
#include <iostream>
using namespace std;
void binPrint(int x, int bits) {
for (int i = bits - 1; i >= 0; i--) {
cout << (x & (1 << i) ? 1 : 0);
}
cout << endl;
}
int main(void) {
unsigned a, b;
cin >> a >> b;
binPrint(a & b, 32);
binPrint(a | b, 32);
binPrint... | s575600334 | [
{
"input": "8 10\n",
"output": "00000000000000000000000000001000\n00000000000000000000000000001010\n00000000000000000000000000000010\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
string input, ss;
int a[3], it, cnt;
int Not(int x) { return 2 - x; }
int And(int x, int y) {
if (x * y == 0) return 0;
if (x == 2 && y == 2) return 2;
return 1;
}
int Or(i... | s469969316 | [
{
"input": "(P*Q)\n(--R+(P*Q))\n(P*-P)\n2\n1\n(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))\n.\n",
"output": "3\n11\n0\n27\n0\n7\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, ans = 0;
string a, b, c;
cin >> n;
cin >> a >> b >> c;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && b[i] == c[i]) {
} else if (a[i] == b[i] || b[i] == c[i] || a[i] == c[i]) {
ans++;
... | s812763520 | [
{
"input": "4\nwest\neast\nwait\n",
"output": "3\n"
}
] |
C++ | codenet | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define intmax IN... | s144923291 | [
{
"input": "15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake s... |
C++ | codenet | #include <algorithm>
#include <cstdio>
using std::sort;
int main(void) {
int *a, *b, i, N;
int frontHalf, backHalf;
scanf("%d", &N);
a = new int[N];
b = new int[N];
for (i = 0; i < N; i++) {
scanf("%d", a + i);
b[i] = a[i];
}
sort(b, b + N);
frontHalf = b[N / 2 - 1];
... | s360529905 | [
{
"input": "4\n2 4 4 3\n",
"output": "4\n3\n3\n4\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
int m1 = 0, m2 = 0;
float maxD = 0.f;
for (size_t i = 0; 100 * A * i <= F; i++) {
int mA = 100 * A * i;
for (size... | s438448326 | [
{
"input": "1 2 10 20 15 200\n",
"output": "110 10\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int A, B, C, X;
cin >> A >> B >> C >> X;
int cnt = 0;
for (int a = 0; a <= A; a++) {
for (int b = 0; b <= B; b++) {
for (int c = 0; c <= C; c++) {
int total = 500 * a + 100 * b + 50 * c;
if (total... | s593850729 | [
{
"input": "2\n2\n2\n100\n",
"output": "2\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if (x - r < 0 || x + r > W || y - r < 0 || y + r > H) {
cout << "No" << endl;
} else if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= W) {
cout << "Yes" << endl;
}
return... | s330459995 | [
{
"input": "5 4 2 2 1\n",
"output": "Yes\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin, (v).end()
#define INF 1e9
#define MOD 1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(26, 1);
vector... | s384319383 | [
{
"input": "4\nabcd\n",
"output": "15\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
#define MOD 1000000007
LL mod_pow(LL x, LL n) {
LL ans = 1;
while (n > 0) {
if ((n & 1) == 1) {
ans = ans * x % MOD;
}
x = x * x % MOD;
n >>= 1;
}
return ans;
}
LL comb_s(LL ... | s789380051 | [
{
"input": "4 1 3\n",
"output": "7\n"
}
] |
C++ | codenet | #include <iostream>
#include <vector>
using namespace std;
vector<int> G[100000];
bool used[100000];
int grundy[100000];
void dfs(int v) {
used[v] = true;
grundy[v] = 0;
for (int i = 0; i < G[v].size(); i++) {
if (!used[G[v][i]]) {
dfs(G[v][i]);
grundy[v] ^= (grundy[G[v][i... | s772335512 | [
{
"input": "5\n1 2\n2 3\n2 4\n4 5\n",
"output": "Alice\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << 6 - a - b << endl;
} | s659042676 | [
{
"input": "3\n1\n",
"output": "2\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vi2 = vector<vi>;
int pow2(int a) {
int ret = 1;
for (int i = 0; i < a; i++) ret *= 2;
return ret;
}
int count(vi2 hw, int a, int b) {
int sum = 0;
for (int i = 0; i < hw.size(); i++) {
... | s612033342 | [
{
"input": "2 3 2\n..#\n###\n",
"output": "5\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
for (int i = 0; i < 4; ++i) reverse(divide[i].begin(), divide[i].end());
bool can = true;
... | s023282516 | [
{
"input": "erasedream\n",
"output": "YES\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
int main() {
int n, m, x;
int a[105] = {};
scanf("%d %d %d", &n, &m, &x);
for (int i = 0; i < m; ++i) {
int temp;
scanf("%d", &temp);
a[temp] = 1;
}
int ansl = 0, ansr = 0, i;
for (i = x; i <= n; ++i) {
ansr += a[i];
... | s778828888 | [
{
"input": "5 3 3\n1 2 4\n",
"output": "1\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? "Yay!" : ":(") << endl;
return 0;
} | s956589471 | [
{
"input": "1\n2\n4\n8\n9\n15\n",
"output": "Yay!\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (1 ? 1e9 + 7 : 998244353);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c, d, e, f, g, T;
string z;
cin >> z;
a =... | s559238064 | [
{
"input": "3776\n",
"output": "Bad\n"
}
] |
C++ | codenet | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define dep(i, a, b) for (int i = a; i >= b; i--)
#define Rep(i, a) for (int i = 0; i < a; i++)
#define pb(a... | s003531724 | [
{
"input": "3 2\n1 2\n2 3\n",
"output": "3\n"
}
] |
C++ | codenet | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int s, x, d = 2;
cin >> s;
set<int> a;
a.insert(s);
while (1) {
if (s % 2 == 0) {
x = s / 2;
if (a.find(x) != a.end()) {
cout << d << endl;
retu... | s550008428 | [
{
"input": "8\n",
"output": "5\n"
}
] |
C++ | codenet | #include <iostream>
using namespace std;
const int MAX_N = 1e3;
int data[MAX_N];
int main() {
int m, nmi, nma;
while (cin >> m >> nmi >> nma && nmi != 0) {
for (int i = 0; i < m; i++) cin >> data[i];
int ma = 0;
int ans = 0;
for (int i = nmi - 1; i < nma; i++) {
if (... | s798006876 | [
{
"input": "5 2 4\n100\n90\n82\n70\n65\n5 2 4\n100\n90\n80\n75\n65\n3 1 2\n5000\n4000\n3000\n4 2 3\n10000\n10000\n8000\n8000\n4 2 3\n10000\n10000\n10000\n8000\n5 2 3\n100\n80\n68\n60\n45\n0 0 0\n",
"output": "3\n4\n2\n2\n3\n2\n"
}
] |
C++ | codenet | #include <iostream>
#include <map>
using u64 = unsigned long long;
const u64 B = 13131;
const int N = 500000 + 7;
int n;
char s[N];
u64 f[N];
int g[N];
std::map<u64, u64> map;
u64 cnt;
u64 pow(u64 a, u64 k) {
if (k < 0) k += (1llu << 63) - 1;
u64 t = 1;
for (; k; a = a * a, k >>= 1)
if (k & 1) t... | s615050061 | [
{
"input": "5\n+>+<-\n",
"output": "3\n"
}
] |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 24