Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed because of a cast error
Error code: DatasetGenerationCastError
Exception: DatasetGenerationCastError
Message: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 1 new columns ({'exec_outcom'}) and 1 missing columns ({'exec_outcome'}).
This happened while the json dataset builder was generating data using
hf://datasets/tobecold/new_metric/validation/C#.jsonl (at revision b49f03b553a337e2701ccefbbcc4be5535d9fa78)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)
Traceback: Traceback (most recent call last):
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 2011, in _prepare_split_single
writer.write_table(table)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/arrow_writer.py", line 585, in write_table
pa_table = table_cast(pa_table, self._schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2302, in table_cast
return cast_table_to_schema(table, schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2256, in cast_table_to_schema
raise CastError(
datasets.table.CastError: Couldn't cast
lang: string
source_code: string
lang_cluster: string
compilation_error: bool
code_uid: string
src_uid: string
difficulty: double
exec_outcom: string
input: string
output: list<item: string>
child 0, item: string
result: string
to
{'lang': Value(dtype='string', id=None), 'source_code': Value(dtype='string', id=None), 'lang_cluster': Value(dtype='string', id=None), 'compilation_error': Value(dtype='bool', id=None), 'code_uid': Value(dtype='string', id=None), 'src_uid': Value(dtype='string', id=None), 'difficulty': Value(dtype='int64', id=None), 'input': Value(dtype='string', id=None), 'output': Sequence(feature=Value(dtype='string', id=None), length=-1, id=None), 'result': Value(dtype='string', id=None), 'exec_outcome': Value(dtype='string', id=None)}
because column names don't match
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1316, in compute_config_parquet_and_info_response
parquet_operations, partial = stream_convert_to_parquet(
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 909, in stream_convert_to_parquet
builder._prepare_split(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1882, in _prepare_split
for job_id, done, content in self._prepare_split_single(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 2013, in _prepare_split_single
raise DatasetGenerationCastError.from_cast_error(
datasets.exceptions.DatasetGenerationCastError: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 1 new columns ({'exec_outcom'}) and 1 missing columns ({'exec_outcome'}).
This happened while the json dataset builder was generating data using
hf://datasets/tobecold/new_metric/validation/C#.jsonl (at revision b49f03b553a337e2701ccefbbcc4be5535d9fa78)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
lang string | source_code string | lang_cluster string | compilation_error bool | code_uid string | src_uid string | difficulty int64 | input string | output sequence | result string | exec_outcome string |
|---|---|---|---|---|---|---|---|---|---|---|
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=2e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i... | C++ | false | 550a52d33b3bf40ba7a2c73288fdb8f2 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
#define gg getchar();getchar();
typedef pair<int, int> ii;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
vector<int> add(vector<int> a, vector<int> b) {
int carry = 0;
vector<int> ans;
for(int i = 0; i < a.size(); i++) {
... | C++ | false | f629d0c36caa4441eebe929740c72aa4 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | ecca47df8160a8aa07a95d4ba17a5ef4 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
pii p[81];
int dp[200101];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d%d",&p[i].first,&p[i].second),p[i].first-=p[i].second,p[i].second=p[i].second*2+p[i].first;
sort(p+1,p+n+1);
memset(dp,0x3f,sizeo... | C++ | false | 9c6ad25f504f7dda44c7930e5f256353 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | bcc4d99e14a06652c4dbb89d0f019bcc | fa2d29150c27014ee7274d029f30b16a | 2,000 | 3 1
2 2 2 | [
"0"
] | 1 | WRONG_ANSWER |
GNU C++17 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <random>
#include <iomanip>
#include <algorithm>
... | C++ | false | ddff20eccfc774e44ba2b363bba56b16 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 5 240
13 0
50 25
60 5
155 70
165 70 | [
"26"
] | 29 | WRONG_ANSWER |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
int t,n;
int a[2][200009];
bool dp[3][200009][7];
int main()
{
cin>>t;
while(t--)
{
memset(dp,0,sizeof(dp));
cin>>n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
{
char s;cin>>s;
a[i][j]=s-'0';
}
if(a[1][1]<=2)
dp[1][1][2]=1;
else
dp[1][1][4]... | C++ | false | dd08d56973b96fb2c7aa7a0aa0e2c769 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | null | TIME_LIMIT_EXCEEDED |
GNU C++11 | /*
no pain, no gain
*/
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza432... | C++ | false | 97ae7f354ffc5434d1a4c2bdb83dd0dc | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn=1e5+100;
char ch[4][maxn];
int a[4][maxn];
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
cin>>ch[1];
cin>>ch[2];
for(int i=0;i<n;i++){
a[0][i... | C++ | false | 36dd1616760869e7eb926cf2d5fc206e | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=2e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i... | C++ | false | 550a52d33b3bf40ba7a2c73288fdb8f2 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | deb69a4e69b10bdbf2b6700b43f57974 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | bcc4d99e14a06652c4dbb89d0f019bcc | fa2d29150c27014ee7274d029f30b16a | 2,000 | 4 1
1 1 4 2 | [
"2"
] | 2 | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
pii p[81];
int dp[200101];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d%d",&p[i].first,&p[i].second),p[i].first-=p[i].second,p[i].second=p[i].second*2+p[i].first;
sort(p+1,p+n+1);
memset(dp,0x3f,sizeo... | C++ | false | 9c6ad25f504f7dda44c7930e5f256353 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | 281 | PASSED |
GNU C++17 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <random>
#include <iomanip>
#include <algorithm>
... | C++ | false | ddff20eccfc774e44ba2b363bba56b16 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 2 50
20 0
3 1 | [
"30"
] | 30 | PASSED |
GNU C++11 | //Head File
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
#include<ctime>
#include<set>
#include<cstdlib>
#include<vector>
#include<cassert>
#include<cmath>
#include<queue>
#include<iostream>
using namespace std;
#define il inline
//Variable
#define ll long long
#define ull unsigned long long
#... | C++ | false | 76e337df38ea0482927c7dc2af8e1664 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
3 4 2 6 5 1 | WRONG_ANSWER |
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=2e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i... | C++ | false | 550a52d33b3bf40ba7a2c73288fdb8f2 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | deb69a4e69b10bdbf2b6700b43f57974 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | 041e70dc299dea9ea2f46e1a019f09b9 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 3 1
2 2 2 | [
"0"
] | 0 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | df8e34063ca2472c2273f750548a18ed | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 5 240
13 0
50 25
60 5
155 70
165 70 | [
"26"
] | 26 | PASSED |
GNU C++17 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <random>
#include <iomanip>
#include <algorithm>
... | C++ | false | ddff20eccfc774e44ba2b363bba56b16 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++11 | //#include <bits/stdc++.h>
//
//using namespace std;
//
//#define mx 1000006
//
//vector<int>g[mx];
//int dis[mx],vis[mx];
//
////#define mxp 3003
////vector<int>prime;
////bool vis[mxp];
////
////void sieve(){
//// int root=sqrt(mxp);
//// for(int i=3;i<=root; i+=2){
//// for(int j=i*i;j<mxp;j+=i)
//// ... | C++ | false | 21daa46b1d37f4869090f4c1eeb5aa14 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for(ll i = a; i < b; i++)
#defi... | C++ | false | 3807b94b8f1848529cebf808e3da7ba0 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | deb69a4e69b10bdbf2b6700b43f57974 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | ecca47df8160a8aa07a95d4ba17a5ef4 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | 041e70dc299dea9ea2f46e1a019f09b9 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 4 1
1 1 4 2 | [
"2"
] | 2 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | df8e34063ca2472c2273f750548a18ed | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 2 50
20 0
3 1 | [
"30"
] | 30 | PASSED |
GNU C++17 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <random>
#include <iomanip>
#include <algorithm>
... | C++ | false | ddff20eccfc774e44ba2b363bba56b16 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | 281 | PASSED |
GNU C++11 | #include <bits/stdc++.h>
using namespace std;
#define mx 200005
vector<int>g[mx];
int dis[mx],par[mx];
bool vis[mx];
int sq;
void call(int u, int v){
cout<<2<<"\n"<<dis[u]-dis[v]+1<<"\n";
while(u!=v){
cout<<u<<" ";
u=par[u];
}
cout<<u<<endl;
}
vector<int>visited_order;
void dfs(int... | C++ | false | 1060fc1c1cd45b03ca0398d98f1f7a59 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for(ll i = a; i < b; i++)
#defi... | C++ | false | 3807b94b8f1848529cebf808e3da7ba0 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | C++ | false | a8eef25c3ffa7a3c5204a9b1147e2e4c | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
#define gg getchar();getchar();
typedef pair<int, int> ii;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
vector<int> add(vector<int> a, vector<int> b) {
int carry = 0;
vector<int> ans;
for(int i = 0; i < a.size(); i++) {
... | C++ | false | c6c76029e7413444737fa24b57579a7e | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | 9f817412783abb207092d3890be64ec0 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | df8e34063ca2472c2273f750548a18ed | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++11 | #include<bits/stdc++.h>
#define f(i,a,n) for(int i=a;i<n;i++)
#define S second
#define F first
#define Sc(n) scanf("%lld",&n)
#define scc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sp(a) scanf("%lld %lld",&a.first,&a.second)
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#d... | C++ | false | ca665672426a5990dfc7e5f2812589b1 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 3 1
2 2 2 | [
"0"
] | 0 | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef string st;
#define f first
#define s second
#define pb push_back
#define pf push_front
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MP make_pair
#define mem(a , v) memset(a , v , ... | C++ | false | 2603955a423729109ebdfe68485fb5ae | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <deque>... | C++ | false | fac1a226e7e24697992912d81fef0da1 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 5 240
13 0
50 25
60 5
155 70
165 70 | [
"26"
] | 26 | PASSED |
GNU C++11 | //Head File
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
#include<ctime>
#include<set>
#include<cstdlib>
#include<vector>
#include<cassert>
#include<cmath>
#include<queue>
#include<iostream>
using namespace std;
#define il inline
//Variable
#define ll long long
#define ull unsigned long long
#... | C++ | false | 52f2e980e6c60134e154a8dc8b513828 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
3 4 2 6 5 1 | WRONG_ANSWER |
GNU C++17 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for(ll i = a; i < b; i++)
#defi... | C++ | false | 3807b94b8f1848529cebf808e3da7ba0 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
main()
{
int q;
cin >> q;
while(q--)
{
int n;
cin >> n;
char a[2][n];
char id[2][n];
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
{
cin >> id[i][j];
if((id[i][j] - '0') >= 3)
{
a... | C++ | false | 06b1fe3a43e8fc75d573ff6a45440cb1 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YESYES
YESNO
YESNO | WRONG_ANSWER |
GNU C++11 | #include<bits/stdc++.h>
#define f(i,a,n) for(int i=a;i<n;i++)
#define S second
#define F first
#define Sc(n) scanf("%lld",&n)
#define scc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sp(a) scanf("%lld %lld",&a.first,&a.second)
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#d... | C++ | false | ca665672426a5990dfc7e5f2812589b1 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 4 1
1 1 4 2 | [
"2"
] | 2 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | df8e34063ca2472c2273f750548a18ed | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | 281 | PASSED |
GNU C++17 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <deque>... | C++ | false | fac1a226e7e24697992912d81fef0da1 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 2 50
20 0
3 1 | [
"30"
] | 30 | PASSED |
GNU C++11 | /*
no pain, no gain
*/
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza432... | C++ | false | 57874e2a42b68e1d1dc5ed9f78c88c95 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=1e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i>... | C++ | false | 96bb3cfe709720afef51ad12ce3c633e | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include<bits/stdc++.h>
#include<math.h>
#define lld long long int
#define mx 10000
using namespace std;
int main()
{
lld t,n,a,b,i,f,cnt,cnt2;
cin>>t;
while(t--)
{
cin>>n;
cin>>a;
cin>>b;
lld c[n],d[n];
i=n-1;
f=0;
cnt=0;
cnt2=0;
w... | C++ | false | 580f82464bff21ec5b587285fcd4a886 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | de1c0b6f33cc6a01f8d2a96de4af7d89 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 5 240
13 0
50 25
60 5
155 70
165 70 | [
"26"
] | 26 | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | fa1c1dee62ea3849b439a970d4d4fe08 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 3 1
2 2 2 | [
"0"
] | 0 | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn=1e5+100;
char ch[4][maxn];
int a[4][maxn];
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
cin>>ch[1];
cin>>ch[2];
for(int i=0;i<n;i++){
a[0][i... | C++ | false | 5859a4ad7b3b42de32f1ffe8cf9c0f8d | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <deque>... | C++ | false | fac1a226e7e24697992912d81fef0da1 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++11 | /*
no pain, no gain
*/
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza432... | C++ | false | 1fd4a041403958b7a663d14ba3458563 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=1e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i>... | C++ | false | 96bb3cfe709720afef51ad12ce3c633e | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
#define gg getchar();getchar();
typedef pair<int, int> ii;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
vector<int> add(vector<int> a, vector<int> b) {
int carry = 0;
vector<int> ans;
for(int i = 0; i < a.size(); i++) {
... | C++ | false | 5d08befb52f287eb9cf79328c5b8554a | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
main()
{
int q;
cin >> q;
while(q--)
{
int n;
cin >> n;
char a[2][n];
char id[2][n];
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
{
cin >> id[i][j];
if((id[i][j] - '0') >= 3)
{
a... | C++ | false | 6b08e84200f9b63894a73498acf36de1 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include<bits/stdc++.h>
#define N 200010
#define pb push_back
using namespace std;
int T,n,a[N],b[N],dp[N][2];
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%1d",&a[i]);
for(int i=1;i<=n;i++)
scanf("%1d",&b[i]);
... | C++ | false | 9d7aeab0637403a9df9e6c557b76d984 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | fa1c1dee62ea3849b439a970d4d4fe08 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 4 1
1 1 4 2 | [
"2"
] | 2 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | de1c0b6f33cc6a01f8d2a96de4af7d89 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 2 50
20 0
3 1 | [
"30"
] | 30 | PASSED |
GNU C++17 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <deque>... | C++ | false | fac1a226e7e24697992912d81fef0da1 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | 281 | PASSED |
GNU C++11 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int>pii;
typedef vector<int> vi;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fi first
#define se second
#define de(x) cout<<#x<<"="<<x<<"\n"
#define dd(x) cout<<#x<<"="<<x<<" "
#define pb(x) push_back(x)
#define all(x) x.begin(),... | C++ | false | 2603b4f4ad684bc98ec8bb2b146894df | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 1
2 3 5 | WRONG_ANSWER |
GNU C++17 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | C++ | false | 47a976bd8b7eb897bdc170ac3592d492 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include<bits/stdc++.h>
#define FOR(i,l,r) for(int (i)=l;(i)<=(r);(i)++)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn=1e5+233;
int k;
string s,t;
int a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin>>k;
cin>>s;
cin>>t;
for(int i=k-1;i>... | C++ | false | 96bb3cfe709720afef51ad12ce3c633e | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
int t,n;
int a[2][200009];
bool dp[3][200009][7];
int main()
{
cin>>t;
while(t--)
{
cin>>n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
{
char s;cin>>s;
a[i][j]=s-'0';
}
if(a[1][1]<=2)
dp[1][1][2]=1;
else
dp[1][1][4]=1;
if(a[2][1]<=2)
dp[... | C++ | false | 18a6e63133138e3f4728f98fc9a4acbf | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | null | TIME_LIMIT_EXCEEDED |
GNU C++17 | #include<bits/stdc++.h>
#include<math.h>
#define lld long long int
#define mx 10000
using namespace std;
int main()
{
lld t,n,i,f,cnt,cnt2;
string c,d;
cin>>t;
while(t--)
{
cin>>n;
cin>>c;
cin>>d;
i=n-1;
f=0;
cnt=0;
cnt2=0;
for(i=0;i<n;... | C++ | false | e891223d5f86419536f57705f4e70140 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef string st;
#define f first
#define s second
#define pb push_back
#define pf push_front
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MP make_pair
#define mem(a , v) memset(a , v , ... | C++ | false | 1a390d38a42eceebdd8b758d08fb3d15 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | //------Anivia_kid----------
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
const int MOD = 1e9 + 7;
ll fact(int n)
{
if(n == 0 || n == 1) return 1;
ll res = 1;
for(int i = 2; i <= n; i++)
res *= i;
return res;
}
ll comb(ll n, ll k)
{
if(n == k) retur... | C++ | false | abcd7ab96c9709b05a4aa185a1ad18c5 | 290d9779a6be44ce6a2e62989aee0dbd | 1,300 | 2 3 3
1 2 4
3 1 5
c 2 1
r 1 2
g 1 3 | [
"5"
] | 5 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | de1c0b6f33cc6a01f8d2a96de4af7d89 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++17 | #include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <climits>
using namespace std;
typedef long long li;
typedef... | C++ | false | 84fd70e7dc6d18846c5f5540aae52e59 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 5 240
13 0
50 25
60 5
155 70
165 70 | [
"26"
] | 26 | PASSED |
GNU C++11 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int>pii;
typedef vector<int> vi;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fi first
#define se second
#define de(x) cout<<#x<<"="<<x<<"\n"
#define dd(x) cout<<#x<<"="<<x<<" "
#define pb(x) push_back(x)
#define all(x) x.begin(),... | C++ | false | 7c80fce3f3f54d31d564f8ab3230b8fe | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | C++ | false | 79c26b367962331634e2cecfa766ce76 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
main()
{
int q;
cin >> q;
while(q--)
{
int n;
cin >> n;
char a[2][n];
char id[2][n];
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
{
cin >> id[i][j];
if((id[i][j] - '0') >= 3)
{
a... | C++ | false | c4b7b7bba298ad436673b3ecf8e25a54 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | //------Anivia_kid----------
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
const int MOD = 1e9 + 7;
ll fact(int n)
{
if(n == 0 || n == 1) return 1;
ll res = 1;
for(int i = 2; i <= n; i++)
res *= i;
return res;
}
ll comb(ll n, ll k)
{
if(n == k) retur... | C++ | false | abcd7ab96c9709b05a4aa185a1ad18c5 | 290d9779a6be44ce6a2e62989aee0dbd | 1,300 | 3 3 5
1 2 3
4 5 6
7 8 9
g 3 2
r 3 2
c 2 3
g 2 2
g 3 2 | [
"8\n9\n6"
] | 8
9
6 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb p... | C++ | false | de1c0b6f33cc6a01f8d2a96de4af7d89 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | 281 | PASSED |
GNU C++17 | #include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <climits>
using namespace std;
typedef long long li;
typedef... | C++ | false | 84fd70e7dc6d18846c5f5540aae52e59 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 2 50
20 0
3 1 | [
"30"
] | 30 | PASSED |
GNU C++11 | #include <cmath>
#include <vector>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int N = 1e5;
int n, m, stk[N + 5], top, dep[N + 5], d;
bool vis[N + 5], del[N + 5];
vector<int> ans, e[N + 5];
void dfs(int x, int fa) {
dep[x] = dep[fa] + 1;
stk[++top] = x;
vis[x] = 1;
int s = 0;
for (int to : e[... | C++ | false | 0c5acb47057a31cad92a0e086018ca29 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 2
6
5 6 2 4 3 1 | WRONG_ANSWER |
GNU C++17 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | C++ | false | 79c26b367962331634e2cecfa766ce76 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 5
afogk
asdji | [
"alvuw"
] | alvuw | PASSED |
GNU C++17 | #include <cstdio>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1, s2, s;
cin >> s1 >> s2;
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
char carry = 0;
char soma = 0;
for(int i = 0; i < n; i++) {
soma = s1[i] -... | C++ | false | 9f817412783abb207092d3890be64ec0 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 6
nijfvj
tvqhwp | [
"qoztvz"
] | qoztvz | PASSED |
GNU C++17 | #include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
main()
{
int q;
cin >> q;
while(q--)
{
int n;
cin >> n;
char a[2][n];
char id[2][n];
for(int i = 0; i < 2; i++)
{
for(int j = 0; j < n; j++)
{
cin >> id[i][j];
if((id[i][j] - '0') >= 3)
{
a... | C++ | false | 557dcc89770fd2c85baecd8de72fce39 | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include<bits/stdc++.h>
using namespace std;
const int maxn=85;
const int maxm=1e5+5;
int dp[maxm];
int n,m;
int a[maxn],s[maxn];
int l[maxn];
int r[maxn];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i],&s[i]);
l[i]=max(0,a[i]-s[i]);
r[i]=min(m,a[i]+s[i]);
}
dp[m+1]=0;
for(int j=... | C++ | false | 10117fb79f37ec3e743632e601ba2faa | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 3 595
43 2
300 4
554 10 | [
"281"
] | -224 | WRONG_ANSWER |
GNU C++11 | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
template<typename T>
int Max(T begin, T end) {
int ret = *begin;
while (begin != end) {
ret = max(ret, *begin);
++begin;
}
return ret;
}
template<typename T>
int Min(T begin, T end) {
in... | C++ | false | c716dd456f3c3d5642a6cef57c245929 | fa2d29150c27014ee7274d029f30b16a | 2,000 | 3 1
2 2 2 | [
"0"
] | 0 | PASSED |
GNU C++17 | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
using namespace std;
const int mod=1000000007;
const int N=1e5;
long long ans=1;
set<int>k[26];
int main()
{
int q;
cin>>q;
for(int i=0;i<q;i++)
{
int n;
cin>>n;
... | C++ | false | 8c7d4280058c69554152d0fdda119aed | f34cff4302e047b1e3bfc2c79aa57be3 | 1,500 | 6
7
2323216
1615124
1
3
4
2
13
24
2
12
34
3
536
345
2
46
54 | [
"YES\nYES\nYES\nNO\nYES\nNO"
] | YES
YES
YES
NO
YES
NO | PASSED |
GNU C++17 | #include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <climits>
using namespace std;
typedef long long li;
typedef... | C++ | false | 84fd70e7dc6d18846c5f5540aae52e59 | fccb8049e7b0f0bcd1dcd93620a86b5c | 2,200 | 1 1
1 1 | [
"0"
] | 0 | PASSED |
GNU C++11 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int>pii;
typedef vector<int> vi;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fi first
#define se second
#define de(x) cout<<#x<<"="<<x<<"\n"
#define dd(x) cout<<#x<<"="<<x<<" "
#define pb(x) push_back(x)
#define all(x) x.begin(),... | C++ | false | 082a8c5a921388b36e260141ce90f0d9 | f9ffc3ccb320c7a4ea95cbcca95f1abf | 2,500 | 6 6
1 3
3 4
4 2
2 6
5 6
5 1 | [
"1\n1 6 4"
] | 1
2 3 5 | WRONG_ANSWER |
GNU C++17 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | C++ | false | 79c26b367962331634e2cecfa766ce76 | 5f4009d4065f5ad39e662095f8f5c068 | 1,900 | 2
az
bf | [
"bc"
] | bc | PASSED |
End of preview.
README.md exists but content is empty.
- Downloads last month
- 39