source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define rep(i, a, b) for(int i = (a); i <= int(b); i ++)
#define per(i, a, b) for(int i = (a); i >= int(b); i --)
#define fi ... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 2ad231f3007bf4331df296acd6bd0400 | 3,500 | PASSED |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define rep(i, a, b) for(int i = (a); i <= int(b); i ++)
#define per(i, a, b) for... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 0237286859cd30d3484d88e79cd86f72 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 12dbaac6959ae479728a83d539c0766a | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | ed021b81a81bcee8551936154d62f25c | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 20de4bfcc39315a3a0afc5f73ff6717d | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 0287e593c0462ca8c1411a71dff861b7 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 8593253a4703d6ed6d1a76db1e871509 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 0f0432c669a2c199eaea5a5ffc3d5985 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<class T,class S=T>inline bool umin(T&m,S&&x){return x<m?m=x,1:0;}
template<class T,class S=T>inline bool umax(T&m,S&&x){return m<x?m=x,1:0;}
auto operator<<(ostream&o,auto&&v)->enable_if_t<!is_constructible_v<string,decltype(v)>,decltype(o<<*end(v))>{int f=0,u=&o==&... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | 63780f2cf390d18a33062d66e1e729f0 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 105;
int a[maxn], d[maxn];
int n;
void sovle()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>d[i];
}
int flag=0;
for(int i=1;i<=n;i++){
a[i]=a[i-1]+d[i];
if(d[i+1]!=0&&i!=n&&a[i]>=d[i+1]){
flag=1;
}
}
i... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | 19c06fc6025a2b9c2525670fd2a7aed2 | 1,100 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t,n;
cin>>t;
for(int i=0; i<t; i++){
cin>>n;
int a[n],d[n];
int flag=0;
for(int i =1; i<=n; i++){
cin>>d[i];
}
a[1]=d[1];
for(int j=2; j<=n; j++){
... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | b8d1e1d2099f38cfcf4296804cecb865 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin >> n;
bool ok = 1;
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 1;i < n;i++){
if(a[i] && a[i-1] - a[i] >= 0) {
cout << -1 << endl;
return;
... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | dab03ef39ed863cce853619283617f87 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
int main()
{
int t;cin>>t;
while(t--)
{
int n;cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
vector<int> v1(n);
v1[0]=v[0];
int flag=0;
for(in... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | 5b13e03da81b575cd22095dcdf6cac8b | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define endl "\n"
#define pb push_back
#define co continue
#define pq priority_queue<int>
#define pqr priority_queue<int, std::vector<int>, std::greater<int>>
#define N s.size()-1
#define sz(a) a.size()
... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | f7a71c4f8f364d9bc73d478445db3102 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,a,b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int N =0;
char D[N], A[N];... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | 2bf85da7fabfc40433618932974d32e3 | 1,100 | PASSED |
#include <iostream>
using namespace std;
int main (){ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;cin>>t;
while(t--){
int n;cin>>n;
int d[100]{};
for (int i=0;i<n;i++) cin>>d[i];
int temp{d[0]};
bool k{};
for (int i=0;i<n-1;i+... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | 6b1739f2c3069855a3a59c51927cfd7d | 1,100 | PASSED |
#include <iostream>
using namespace std;
int main (){ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;cin>>t;
while(t--){
int n;cin>>n;
int d[100]{};
for (int i=0;i<n;i++) cin>>d[i];
int temp{d[0]};
bool k{};
if (d[0]>=d[1]&&d[1]!=0) ... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | bdef6e46a335a0816230928ebe42c2bc | 1,100 | PASSED |
// Botat' every day
#include <bits/stdc++.h>
#define endl '\n'
#define all(x) x.begin(), x.end()
typedef long long ll;
using namespace std;
void solve(){
ll n;
cin >> n;
vector <int> v(200);
cin >> v[0];
bool b = false;
for (int i = 1; i < n; ++i){
int a;
cin >> a;
if (v[i-1] - a < 0 || a =... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | c2ef3bf25548ec4c2d59b1e3f7b7d1df | 1,100 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <stdlib.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <ra... | C++ | f4b790bef9a6cbcd5d1f9235bcff7c8f | d5978eb4c11e4b5601439783cdd6c43c | 1,100 | PASSED |
/*
██╗░░░██╗░█████╗░██╗░░░██╗░██████╗░██████╗███████╗███████╗
╚██╗░██╔╝██╔══██╗██║░░░██║██╔════╝██╔════╝██╔════╝██╔════╝
░╚████╔╝░██║░░██║██║░░░██║╚█████╗░╚█████╗░█████╗░░█████╗░░
░░╚██╔╝░░██║░░██║██║░░░██║░╚═══██╗░╚═══██╗██╔══╝░░██╔══╝░░
░░░██║░░░╚█████╔╝╚██████╔╝██████╔╝██████╔╝███████╗██║░░░░░
░░░╚═╝░░░░╚═══... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | fa7301c27a1f8ad5fba7d6e9eceff4f3 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t; cin >> t;
while (t--) {
int n, m; cin >> n >> m;
if (n == 1 || m == 1)
cout << n << " " << m << endl;
else if (n == 3 && m == 3)
cout << 2 << " " << 2 << endl;
else if (n == 2 && m == 3)
... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | 1e8b188831dcf1519a2883fef2a5dbda | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
long long testCase;
cin>>testCase;
while(testCase--){
int n,m;
cin>>n>>m;
if(max(n,m)==3){
if(min(n,m)==1){
cout<<"1 1"<<endl;
}
else{
... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | a15f9f9799494db21df42093d41a9a13 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define point complex<ll>
#define X real()
#define Y imag()
#define polar(r,t) ((r)*exp(point(0,(t))))
#define pi 3.141592654
#define length(a) hypot((a).X,(a).Y)
#define... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | bd4e6426269657b3ea997faaac69bdb7 | 800 | PASSED |
/*********/ #include <set>
/*********/ #include <map>
/*******/ #include <cmath>
/*******/ #include <queue>
/*******/ #include <ctime>
/*******/ #include <array>
/******/ #include <cstdio>
/******/ #include <string>
/******/ #include <chrono>
/******/ #include <random>
/******/ #... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | ca205343c9088d7cac6c3f3cbf10913c | 800 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,t;
cin>>t;
for(i=0;i<t;i++)
{
int n,m;
cin>>n;
cin>>m;
if(n>=4)
{
cout<<"1 1"<<endl;
}
else if(n==3)
{
if(m>=4||m==1)
cout<<"1 1";
if(m... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | 4da7928e811f6cd58a38f6c60daf159b | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int m,n;
cin>>n>>m;
cout<<n/2 + 1 <<" "<<m/2 + 1<<endl;
}
return 0;
} | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | af57ab3848f24a4c77f3430e630a3432 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void doWork() {
int n, m;
cin >> n >> m;
if (n <= 3 && m <= 3)
cout << max(1, n - 1) << ' ' << max(1, m - 1) << '\n';
else cout << n << ' ' << m << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifdef ONLINE_JUDGE
#... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | c52c7f028721f10f12b9bb6fdd8d8aed | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void doWork() {
int n, m;
cin >> n >> m;
if (m == 3) {
if (n <= 2)
cout << "1 2\n";
else if (n == 3)
cout << "2 2\n";
else cout << n << ' ' << m << '\n';
}
else if (n == 3) {
if (m <= 2)
... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | eaff22d28c60fe286322c137dc23e1ca | 800 | PASSED |
#include<iostream>
#include<map>
#include<set>
#include<unordered_map>
#include<queue>
#include<string>
#include<string.h>
#include<bitset>
#include<math.h>
#include<vector>
#include<numeric>
#include<functional>
#include<stack>
#define ll long long
#define ull unsigned long long
#define LL_MAX 0x7ffffff... | C++ | e6753e3f71ff13cebc1aaf04d3d2106b | f0158ac4b2161bc0ebf95c8659edd81b | 800 | PASSED |
#include<bits/stdc++.h>
#define N 200010
#define INF 0x3f3f3f3f
#define ll unsigned long long
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
typedef pair<int, int> PII;
const double pi = acos(-1.0);
const double eps = 1e-6;
vector<int > vec[N];
int fa[N]... | C++ | f260d0885319a146904b43f89e253f0c | c8f3002ed41562249f4a1ce9c26cb2b0 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define N 200010
#define INF 0x3f3f3f3f
#define ll unsigned long long
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
typedef pair<int, int> PII;
const double pi = acos(-1.0);
const double eps = 1e-6;
vector<int > vec[N];
int a[N],... | C++ | f260d0885319a146904b43f89e253f0c | d341fcb0ccc652de4d50505c5fb32cfe | 1,900 | PASSED |
#include<bits/stdc++.h>
#define N 200010
#define INF 0x3f3f3f3f
#define ll unsigned long long
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
typedef pair<int, int> PII;
const double pi = acos(-1.0);
const double eps = 1e-6;
vector<int > vec[N];
int a[N],... | C++ | f260d0885319a146904b43f89e253f0c | d3a3b79e5421b56cea627400aeb2f0c0 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for (int i = 0; i < t; i++){
int n, k;
cin >> n >> k;
vector<int> p(n);
for (int j = 1; j < n; j++){
cin >> p[j];
p[j]--;
}
int tv = n, fv = 0;
while (tv - fv > 1){
int mid = (tv... | C++ | f260d0885319a146904b43f89e253f0c | e221beec59e9a821eb472bbfa8f85451 | 1,900 | PASSED |
// LUOGU_RID: 90306813
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
struct node {
vector<int> son;
} a[maxn];
int n, k;
void init(){
cin >> n >> k;
for (int i = 1; i <= n; i ++){
a[i].son.clear();
}
for (int i = 2; i <= n; i ++){
int ... | C++ | f260d0885319a146904b43f89e253f0c | 8bd55b16d735619887259f6ed4c7d05f | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
struct node {
vector<int> son;
} a[maxn];
int n, k;
void init(){
cin >> n >> k;
for (int i = 1; i <= n; i ++){
a[i].son.clear();
}
for (int i = 2; i <= n; i ++){
int x;
cin >> x;
... | C++ | f260d0885319a146904b43f89e253f0c | d51bdd574401517b07e70933dd093c93 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
struct node {
vector<int> son;
} a[maxn];
int n, k;
void init(){
cin >> n >> k;
for (int i = 1; i <= n; i ++){
a[i].son.clear();
}
for (int i = 2; i <= n; i ++){
int x;
cin >> x;
... | C++ | f260d0885319a146904b43f89e253f0c | 69c270b7a7b7e629edd39be70ceac92c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
struct node {
vector<int> son;
} a[maxn];
int n, k;
void init()
{
cin >> n >> k;
for (int i = 1; i <= n; i ++){
a[i].son.clear();
}
for (int i = 2; i <= n; i ++){
int x;
cin >> x... | C++ | f260d0885319a146904b43f89e253f0c | cb286ac2a2952acf801c2be8e2247c4f | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
struct node {
vector<int> son;
} a[maxn];
int n, k;
void init()
{
cin >> n >> k;
for (int i = 1; i <= n; i ++){
a[i].son.clear();
}
for (int i = 2; i <= n; i ++){
int x;
cin >> x... | C++ | f260d0885319a146904b43f89e253f0c | 36032ffc7cc99c494fe41f854b2dede4 | 1,900 | PASSED |
// ,;;;;;;,
// ,;;;'""`;;\
// ,;;;/ .'`',;\
// ,;;;;/ | \|_
// /;;;;; \ / .\
// ,;;;;;;| '. \/_/
// /;;;;... | C++ | f260d0885319a146904b43f89e253f0c | 4b6ac87093213658a995674755608eb2 | 1,900 | PASSED |
//1
#include <bits/stdc++.h>
#define for1(i,a,b) for (int i = a; i <= b; i++)
#define for2(i,a,b) for (int i = a; i >= b; i--)
#define loga(a,b) log(b) / log(a)
#define int long long
#define ll long long
#define dl double long
#define cendl() cout << endl
#define ull unsigned long long
#define cendl() c... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | ed1066e34199f7a566857d8c65367169 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b, long long mod)
{
long long ans=1;
while(b!=0)
{
if(b%2==0)
{
b/=2;
a= (a*a)%mod;
}
else
{
ans= (ans*a)%mod;
b--;
}
... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | f6b1ea55fd66f82d2015061ada16c408 | 1,500 | PASSED |
//#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <map>
#include <iomanip>
#include <cstring>
#include <string>
#include <fstream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <array>
#include <ratio>
#include <set>
#include <list>
#include <unordered_set>
#in... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 6834dcd39579bccfddbceedc452c9b02 | 1,500 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t,n,i;
scanf("%d", &t);
while (t--)
{
long long x=1, y=0,mid=2;
scanf("%d", &n);
for (i = 4; i <= n; i = i + 2)
{
mid = mid * 2 * (i - 1) / i * 2;
x = mid / 2 + y;
y = mid - x - 1;
}
cout<<x%998244353<<" "<<y%9... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 426ed9e8b662f377ae9f09c057c67368 | 1,500 | PASSED |
#include <iostream>
#define ll long long
using namespace std;
const int N = 65, mod = 998244353;
int c[N][N];
int f[N];
void solve()
{
int n;
cin >> n;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= i; j++) {
if (!j) c[i][j] = 1;
else c[i][j] = (c... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 51a832885d85a4662227fbf16689320c | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 65, mod = 998244353;
int c[N][N];
int f[N];
void solve()
{
int n;
cin >> n;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= i; j++) {
if (!j) c[i][j] = 1;
else c[i][j]... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | aa566d7c81f0aad17d656802bf6e3125 | 1,500 | PASSED |
#include <bits/stdc++.h>
using ll = long long;
const ll MOD = 998244353;
using namespace std;
namespace Combo {
vector<ll> fact = {1};
vector<ll> inv = {1};
ll binexp(ll a, ll b) {
if (b == 0) return 1ll;
if (b == 1) return a % MOD;
if (b % 2) return (a * binexp(a, b - 1)) % MOD;
return b... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 7981191e6f29dd3be6857a1a11fb02ea | 1,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll MOD = 998244353;
namespace Combo {
vector<ll> fact = {1};
vector<ll> inv = {1};
ll binexp(ll a, ll b) {
if (b == 0) return 1ll;
if (b == 1) return a % MOD;
if (b % 2) return (a * binexp(a, b - 1)) % MOD;
return b... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | a06ca3743b5054b7c5829db491322192 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// An example of a "macro" you can use to write code faster.
#define forn(i, a, n) for (long long i = a; i < n; i++)
#define endl "\n"
#define int long long
#define pb push_back
#define print(v) for (auto x: v)cout<<x<<' ';cout<<endl;
// Examples of commonly us... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 151f89be4f266b0bc357ec00a162f412 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
ll c[61][61];
ll f[31];
void C()
{
for (int i = 0; i <= 60; i ++ )
for (int j = 0; j <= i; j ++ )
if (!j) c[i][j] = 1;
else c[i][j] = (c[i - 1][j] + c[i - 1][j - 1] + mod) % mod;
}
i... | C++ | 63fc2fb08d248f8ccdb3f5364c96dac1 | 32214d469f44131ab69bd182bf5f8d29 | 1,500 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 3e5+5;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int main(){
/*std::ios::sync_with_stdio(false);
cin.tie(0);
... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 71354c9e8c54520ebf0632e179d78a0e | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n;
cin >> n;
string s[2];
cin >> s[0] >> s[1];
s[0] += '0', s[1] += '0';
int dp[2][n + 1];
for(int i = 0; i < 2; i ++)
for(int j = 0; j < n + 1; j ++)
dp[i][j] ... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | d1dfa2ba444b935925b6a1ea2587c328 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
int n;
cin >> n;
vector<string> s(2);
cin >> s[0];
cin >> s[1];
s[0] += '0';
s[1] += '0';
vector<vector<int>> dp(n + 1, vector<int>(2, -INF));
dp[0][0] = 0;
for (int i = 0; i < n; i++){
for (int j... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | ba752f4f49cea79dbc061f25177fc1e2 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
string s[2];
cin >> n >> s[0] >> s[1];
array<array<int, 2>, 2> dp, newdp;
for (int j=0; j<2; j++)
for (int k=0; k<2; k++)
dp[j][k] = newdp[j][k] = INT_MIN;
dp[0][0] = 0;
dp[0][s[1][0] == '1'] = s[1][0] == '1';
for... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 554731ce50a7ae3764bf587a6a49e02c | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
string s[2];
cin >> n >> s[0] >> s[1];
vector<array<array<int, 2>, 2>> dp(n+1);
for (int i=0; i<n; i++)
for (int j=0; j<2; j++)
for (int k=0; k<2; k++)
dp[i][j][k] = INT_MIN;
dp[0][0][0] = 0;
dp[0][0][s[1][0] ... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 694e9bdfaa76201e2d88694cc58147f2 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, sum = 0;
string s[2];
cin >> n >> s[0] >> s[1];
for (int i=0; i<n; i++) {
sum += s[0][i] + s[1][i] - 2*'0';
}
s[0] = '0' + s[0] + '0';
s[1] = '0' + s[1] + '0';
// 0 - vertical; 1 - rdy for vertical
int dp[3][2][2];
f... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | b9c1dd9f6a766ada33bede922d71c267 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, sum = 0;
string s[2];
cin >> n >> s[0] >> s[1];
for (int i=0; i<n; i++) {
sum += s[0][i] + s[1][i] - 2*'0';
}
s[0] = '0' + s[0] + '0';
s[1] = '0' + s[1] + '0';
// 0 - vertical; 1 - rdy for vertical
vector<vector<vecto... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 9639d798d2301865bf8a53a9da4a8555 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, sum = 0;
string s[2];
cin >> n >> s[0] >> s[1];
for (int i=0; i<n; i++) {
sum += s[0][i] + s[1][i] - 2*'0';
}
s[0] = '0' + s[0] + '0';
s[1] = '0' + s[1] + '0';
// 0 - vertical; 2 - rdy for next vertical
vector<vector<... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 2ff45a5fb75dc6204457a7693e635c41 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, sum = 0;
string s[2];
cin >> n >> s[0] >> s[1];
for (int i=0; i<n; i++) {
sum += s[0][i] + s[1][i] - 2*'0';
}
s[0] = '0' + s[0] + '0';
s[1] = '0' + s[1] + '0';
// 0 - vertical; 1 - one from left vertical; 2 - rdy for n... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | c048f598b893f9964cadeb0a6c189716 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, sum = 0;
string s[2];
cin >> n >> s[0] >> s[1];
if (n == 1) {
cout << "0\n";
return;
}
s[0] = '0' + s[0] + "00";
s[1] = '0' + s[1] + "00";
vector<vector<int>> next(2, vector<int> (n+1));
next[0][n] = next[1][n] =... | C++ | a04cfd22f90b2b87f7c5b48dfe3de873 | 2783eb1189b5c320dafd21c84948bcf2 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define rand() rnd()
using namespace std;
string out(int id,int flag);
mt19937 rnd(time(NULL)^clock());
basic_string<pair<int,int>> edge[1005];
int siz[1005];
int ct[1005][14][14];
int n,c[1005];
string s[1005];
int equal(int x,int y)
{
if (edge[x].size()!=edge[y].size()) return 0;
... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 3a34588273ab63d9c81ceb8e0a40e7b2 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MATVEY
#define _dbg(x) do { cout << #x << "=" << x << "; "; } while (0)
#define _name(name, _1, _2, _3, _4, N, ...) name ## N
#define _dbg1(x) _dbg(x)
#define _dbg2(x, ...) _dbg(x); _dbg1(__VA_ARGS__)
#define _dbg3(x, ...) _dbg(x); _dbg2(__VA_ARGS__)
#def... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 3cbe91962bf056c1cd97cdd801bb270a | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MATVEY
#define _dbg(x) do { cout << #x << "=" << x << "; "; } while (0)
#define _name(name, _1, _2, _3, _4, N, ...) name ## N
#define _dbg1(x) _dbg(x)
#define _dbg2(x, ...) _dbg(x); _dbg1(__VA_ARGS__)
#define _dbg3(x, ...) _dbg(x); _dbg2(__VA_ARGS__)
#def... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 44c26e789e5dfeb37c8b77193097530e | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MATVEY
#define _dbg(x) do { cout << #x << "=" << x << "; "; } while (0)
#define _name(name, _1, _2, _3, _4, N, ...) name ## N
#define _dbg1(x) _dbg(x)
#define _dbg2(x, ...) _dbg(x); _dbg1(__VA_ARGS__)
#define _dbg3(x, ...) _dbg(x); _dbg2(__VA_ARGS__)
#def... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 547b4570681990c02712b2ab4f555c85 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MATVEY
#define _dbg(x) do { cout << #x << "=" << x << "; "; } while (0)
#define _name(name, _1, _2, _3, _4, N, ...) name ## N
#define _dbg1(x) _dbg(x)
#define _dbg2(x, ...) _dbg(x); _dbg1(__VA_ARGS__)
#define _dbg3(x, ...) _dbg(x); _dbg2(__VA_ARGS__)
#def... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 4a313cef33463e8dce9b40a10327aec0 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define re register
#define F(i,a,b) for(int re i=a;i<=b;i++)
#define D(i,a,b) for(int re i=a;i>=b;i--)
#define ll long long
#define mp make_pair
using namespace std;
const int N=6e3+5,M=N;
int n,ans=0;
inline int red(){
char ch=getchar();
int data=0,w=0;
while(ch!='-'&&(ch<'0'||c... | C++ | 33d2976434fa3c7af4694172f13b1b31 | b0fafb6dbfa861607b0ac5a4a8c81acb | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FASTIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define PB push_back
#define lp(i, n) for (int i = 0; i < n; i++)
#define lp2(i, j, n) for (int i = j; i <= n; i++)
#define rlp(i, n) for (int i = n - 1; i >= 0; i--)
... | C++ | 33d2976434fa3c7af4694172f13b1b31 | c55bf5b82379b80c8b6f452497bc7b15 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FASTIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define PB push_back
#define lp(i, n) for (int i = 0; i < n; i++)
#define lp2(i, j, n) for (int i = j; i <= n; i++)
#define rlp(i, n) for (int i = n - 1; i >= 0; i--)
... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 94a664cbc8a4e50045eee54ec7f50234 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin())
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define ls (u<<1)
#define rs (u<<1|... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 17e988f98135261ee139e3ee105ea749 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin())
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define ls (u<<1)
#define rs (u<<1|... | C++ | 33d2976434fa3c7af4694172f13b1b31 | 621b41ba740b6adf12f1cd5830a9fdcd | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define Ones(n) __builtin_popcount(n)
#define ll long long
#define ull unsigned long long
#define ld long double
#defin... | C++ | f0402399cbaf8997993ac2ee59a60696 | 3ad2d9e9dcf32532d71f5eab95c2e926 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define Ones(n) __builtin_popcount(n)
#define ll long long
#define ull unsigned long long
#define ld long double
#defin... | C++ | f0402399cbaf8997993ac2ee59a60696 | c82e9cd28820aa1fd04282c7321eab75 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define Ones(n) __builtin_popcount(n)
#define ll long long
#define ull unsigned long long
#define ld long double
#defin... | C++ | f0402399cbaf8997993ac2ee59a60696 | 4d3e813715fc1e88d41003c1d753cb35 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define YoussefMorad1 ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define FOR(i, a, b) for(int i = int(a); i < int(b); i++)
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define ll long long
#define pb(x) push_back(x)
#define MP(x,... | C++ | f0402399cbaf8997993ac2ee59a60696 | 190243cf937e77c0104c99929cefdcd1 | 1,100 | PASSED |
//#include <bits/stdc++.h>
//using namespace std;
//#define FastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define all(x) (x).begin(), (x).end()
//#define allr(x) (x).rbegin(),(x).rend()
//#define Ones(n) __builtin_popcount(n)
//#define ll long long
//#define ull unsigned long long
//#define ld l... | C++ | f0402399cbaf8997993ac2ee59a60696 | 2198695eeeb739f0f7866a0f3a5dc411 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
long long cnt = 0;
string s;
scanf("%d", &n);
cin >> s;
for(int i = 0; i < n; ++i) {
if(s[i] == 'L') {
cnt += i;
} else {
cnt += n - i - 1;
}
}
int k = 1;
for(int i = 0; i < n / 2; ++i) {
if(s[i] == 'L') {
... | C++ | f0402399cbaf8997993ac2ee59a60696 | ee72885f14955c53f4be7946d4638459 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10;
void solve()
{
int n;
cin >> n;
string s;
cin >> s;
s = ' ' + s;
ll ans = 0;
for (int i = 1; i <= n; i++){
if (s[i] == 'L')
ans += (i - 1);
if (s[i] == 'R... | C++ | f0402399cbaf8997993ac2ee59a60696 | 31d10ba87806114e9b538cc442746039 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10;
void solve()
{
int n;
cin >> n;
string s;
cin >> s;
s = ' ' + s;
ll ans = 0;
for (int i = 1; i <= n; i++){
if (s[i] == 'L')
ans += (i - 1);
if (s[i] == 'R... | C++ | f0402399cbaf8997993ac2ee59a60696 | 0e73b9d5db818c65d0c3d26b60306d6e | 1,100 | PASSED |
#include "bits/stdc++.h"
#define filei {freopen("c_c++_intput.txt", "r", stdin);}
#define fileo {freopen("c_c++_output.txt", "w", stdout);}
#define FIO { ios::sync_with_stdio(false);cin.tie(0);}
#define int long long
//#define ll long long
//__builtin_popcount
//cerr
#define mod 1000000007
#define amax 10... | C++ | f0402399cbaf8997993ac2ee59a60696 | 2082d0b17cfdf088b2b844eb54dd27d9 | 1,100 | PASSED |
#include "bits/stdc++.h"
#define filei {freopen("c_c++_intput.txt", "r", stdin);}
#define fileo {freopen("c_c++_output.txt", "w", stdout);}
#define FIO { ios::sync_with_stdio(false);cin.tie(0);}
#define int long long
//#define ll long long
//__builtin_popcount
//cerr
#define mod 1000000007
#define amax 10... | C++ | f0402399cbaf8997993ac2ee59a60696 | dfa574f835a50c8c3b963dbe65cb9cf6 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
for(int i = 0; i < t; i++){
int n;
cin>>n;
string s;
cin>>s;
if(s.length()==5){
set<char>words;
for(int j = 0; j < n; j++){
if(s.at(j)=='T'||s.at(j)=='i'|... | C++ | 6c137a74b36dede61037cb3b05167329 | 58d200042dccc72ba3a2838a8b7a0fdf | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long t;
cin>>t;
while(t--)
{
int n;
string s;
cin>>n>>s;
if(s.length()!=5){cout<<"NO"<<endl;}
else{
int T=0,I=0,m=0,u=0,r=0;
for(int i=0;i<5;i++)
{
i... | C++ | 6c137a74b36dede61037cb3b05167329 | 312cf5fb674deb7fff8358cb0a2d7852 | 800 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int t;
cin>>t;
while (t--) {
int n;
cin>>n;
string s;
cin>>s;
map<char,int> ma;
for (int i=0;i<s.length();i++)
ma[s[i]]++;
if (ma['T']==1&&ma['i']==1&&ma['m']==1&&ma['u']==1&&ma['r']==1&&s.length()==5) cout<<"yes\n";... | C++ | 6c137a74b36dede61037cb3b05167329 | 61f161018f4005fc848b591457c41e6b | 800 | PASSED |
#include <iostream>
#include <cstring>
using namespace std;
const int N = 1010;
int a[N];
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
string s;
cin >> n >> s;
memset(a, 0, sizeof a);
if (s.size() != 5)
{
cout << "NO" << endl;
continue;
}
for (int i = 0; i < s.size(); i++) a[s[i]... | C++ | 6c137a74b36dede61037cb3b05167329 | 8700d8b78ec3dd260cc22024b4d70668 | 800 | PASSED |
#include<stdio.h>
int main()
{
int n,number,count=0,i,j,w,k,x;
char tt[100];
scanf("%d",&n);
gets(tt);
char str[5],str2[5];
for(i=1;i<=n;i++)
{
scanf("%d",&number);
gets(tt);
if(number!=5)
{
char xu[number];
for(x=0;x<number;x++)
{
scanf("%c",&xu[x]);
}
gets(tt);
printf("NO\n");
}... | C++ | 6c137a74b36dede61037cb3b05167329 | c7eb57285af79b98414f9f60f448d93e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define sz(v) (int) (v).size()
#define all(v) (v).begin(), (v).end()
#define r_all(v) (v).rbegin(), (v).rend()
#define bit_count(v) __builtin_... | C++ | 6c137a74b36dede61037cb3b05167329 | eca3e14e2b3aab87b06700e0863c7a62 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1100;
int a[N];
signed main()
{
int T;
cin >> T;
while (T--)
{
int n;
string s;
cin >> n >> s;
memset(a, 0, sizeof a);
if (s.size() != 5)
{
cout << "NO" << endl;
continue;
}
for (int i = 0; i < s.size(); i++)
{
a[s[i]]++;
... | C++ | 6c137a74b36dede61037cb3b05167329 | 2ab92a8620be3088fa9f19b275b587fe | 800 | PASSED |
#include<stdio.h>
#include<string.h>
void solve();
int main(void)
{
int m;
scanf("%d", &m);
while (m--)
{
solve();
}
return 0;
}
void solve()
{
char str[15], visit[128] = { 0 };//定义放到循环里是为了初始化，每一次循环visit数组里的值都是0
char name[] = "Timur";
int i, n;
scanf("%d", &n);
getchar();
gets(str);
if (n != 5)
{
pr... | C++ | 6c137a74b36dede61037cb3b05167329 | 93e8ec0dbad047b117c77712b26974aa | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
string s;
cin>>n>>s;
if(n!=5)
{ cout<<" NO"<<"\n";}
else
{ sort (s.begin(),s.end());
if(s[0]=='T' && s[1]=='i' && s[2]=='m' && s[3]=='r' && s[4]=='u')
{ cout<<"YES"<<"\n";}
else
{ cout<<"NO"<<"\n";}
}
}
}
... | C++ | 6c137a74b36dede61037cb3b05167329 | 958e5a6ffb572b1c0bc9a9d5104b40c1 | 800 | PASSED |
#include <iostream>
#include <string.h>
#include <bitset>
#include <unordered_map>
using namespace std;
int n;
char s[15];
int main(void)
{
int t;
scanf("%d", &t);
while (t--)
{
scanf("%d", &n);
scanf("%s", s);
if (n != 5)
{
puts("NO");
conti... | C++ | 6c137a74b36dede61037cb3b05167329 | d39d205ae87f08bb3591a494915a52d9 | 800 | PASSED |
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
while(n--){
int k=0;
int t;
scanf("%d",&t);
char a[100];
char b[100];
scanf("%s",a);
scanf("%s",b);
// int l=strlen(a);
for(in... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 7494e36bf5bf58daa51a2312ba852a4a | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
char a[101];
char b[101];
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cin>>a;cin>>b;
int flag=0;
for(int i=0;i<n;i++)
{
if(a[i]=='G') a[i]=a[i]-5;
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 37bcb070c056d99b8e6d78f25ad23e2b | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
char a[101];
char b[101];
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cin>>a;cin>>b;
int flag=0;
for(int i=0;i<n;i++)
{
if(a[i]=='G') a[i]=a[i]-5;
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 3c4a8340c233762c08b2a151e763c662 | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
char a[101];
char b[101];
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cin>>a;cin>>b;
int flag=1;
for(int i=0;i<n;i++)
{
if(a[i]=='G') a[i]=a[i]-5;
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 8a7023223fd3c98ea019bdc8ec28ecaa | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
char a[101];
char b[101];
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cin>>a;cin>>b;
int flag=1;
for(int i=0;i<n;i++)
{
if(a[i]=='G') a[i]='B';
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | d889e30efee7b19a3affe55a50f05110 | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
char a[101];
char b[101];
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cin>>a;cin>>b;
int flag=1;
for(int i=0;i<n;i++)
{
if(a[i]=='G') a[i]='B';
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 866c9337dbbf8a018ceeed1112439fdc | 800 | PASSED |
#include <iomanip>
#include<iostream>
#include<math.h>
#include <string>
#include<algorithm>
#include<map>
#include<string.h>
using namespace std;
char s1[105];
char s2[105];
map<int, int>mp;
int main()
{
int n,i,m,s;
cin >> n;
while (n--)
{
s = 1;
cin >> m;
for (i = 0; i < m; i++)
{
cin >> s1[i];
}
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | e5c5120bc988efd0937f3ea083633a75 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t;int f;
cin>>t;
while(t--){
int n;char s[210];
cin>>n;
f=0;
for(int i=1;i<=2*n;i++)
cin>>s[i];
for(int i=1;i<=2*n;i++)
if(s[i]=='G'){
s[i]='B';
}
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | b43af1a86ea6382418ee6f38d1bdd063 | 800 | PASSED |
#include<iostream>
#include<stdlib.h>
#include<time.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#define PI 3.1415926
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
int m,flag=0;
cin>>m;
char a[m],b[m];
for(int j=0;j<m;j++){
cin>>a[j];
}
for(int j=0;j<m;j++){
... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 43fc9b56810eda8c27886fd8e5793cb2 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int x,y=0;
cin>>x;
char a[105],b[105];
cin>>a>>b;
for(int i=0;i<x;i++)
{
if(a[i]==b[i]||a[i]+5==b[i]||a[i]-5==b[i])
{y++;}
}
if(y==x)co... | C++ | 86a2e0854f9faf0b119d0d5e4b8fe952 | 81883c2b28854b8e6443a78488b4da6c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxx 1001
long long int grid[maxx][maxx];
main()
{
int t;
cin >> t;
while(t--)
{
int n,q;
cin >> n >> q;
memset(grid,0,sizeof(grid));
for(int i=0;i<n;i++)
{
int h,w;
c... | C++ | 9e9c7434ebf0f19261012975fe9ee7d0 | 02ae608f79f742ee6ed0bd6d0e084b36 | 1,600 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.