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>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | c43d3de73e6cd8ee52db0d25ae2cb82f | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | b3a65d6cd8f3d2d56bb5bcb6fc5e2c9d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | 151ac1db6a8dd5089144d34ba68a64d5 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | 76d3778793a96fd973981e88dd6dfc24 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | 09b1732ad0f793e4db0c908fee5dbd50 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | 48748ba60678b22bab2937e5d036f9df | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | a450294f4f6689b3ee11fe2e67c69896 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx,ccc=0,prev;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
sor... | C++ | d54205c8096408ae64b15ab0a344582e | 4579ce3fbd1973397f4b22248685ec4c | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int t;
cin >>t;
while (t--){
int x,n,mx;
cin >> n;
vector <int> a(2*n);
multiset <int> ss;
for (int i=0;i<2*n;i++){
cin >> a[i];
ss.insert(a[i]);
}
if (t==0 & a[0]=... | C++ | d54205c8096408ae64b15ab0a344582e | 889d95f497f060f77d8e2d6cb49dfa8d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--) {
int n;
string b,a;
cin >> n >> b;
a.push_back('1');
for (int i = 1; i < b.size(); i++) {
if (b[i - 1] + a[i - 1] == b[i] + '1') {
a.push_back('0');
}
else {
a.push_back('1');
}
}
cout << ... | C++ | e27620d3a43ab42edf930b37ce214c9e | 1950b2f809d5b65169a3da4a51612c95 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
// string s; cin>>s;
// int ch=0;
// for(int i=0; i<(int)s.size();i++) {
// if (s[i]=='0') {
// ch=1;
// s.erase(s.begin()+i);
// break;
// ... | C++ | e27620d3a43ab42edf930b37ce214c9e | b6d4d29ce7a4d96484a2c723801dac63 | 800 | PASSED |
#include <bits/stdc++.h>
#define loop(n) for (int i=1;i<n ;i++)
#define endl '\n'
#define ll long long
using namespace std;
void init()
{
cin.tie(0);
cin.sync_with_stdio(0);
}
int main()
{
init() ;
ll n , x ,t ,b, c ,mx=0 ,index ;
char ch ;
cin >> t ;
while (t--)
{
cin ... | C++ | e27620d3a43ab42edf930b37ce214c9e | 8470f7499db9ab167c3e403d8afec894 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
char b[100000];
cin >> n;
while (n--)
{
int n;
cin >> n >> b + 1;
int f = -1;
for (int i = 1; i <= n; i++)
{
if (b[i] - '0' + 1 != f)
{
cout << 1;
f = b[i] - '0' + 1;
}
else
{
cout << 0;
f = b[i] - '0';
... | C++ | e27620d3a43ab42edf930b37ce214c9e | b1a16dc79b8c8bdbe5d3a7dec833cc89 | 800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define el '\n'
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//typedef tree<pair<long long, int>, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
bool dense(int x , int y)
{
return (min(x ... | C++ | e27620d3a43ab42edf930b37ce214c9e | 930783e162beb5c67b3327b0e545f7b3 | 800 | PASSED |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
//typedef tree<pair<ll, int>, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define e '\n'
#define spc ' '
#define speed ios_base::sync_with_st... | C++ | e27620d3a43ab42edf930b37ce214c9e | 51944f5150709dcad2a1ab9bdb8a7301 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void Alien35() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("test.in", "rt", stdin);
freopen("test.out", "wt", stdout);
#endif
}
const int N = 5e3 + 5, M = 1e4 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + ... | C++ | e27620d3a43ab42edf930b37ce214c9e | 4065e799280db6f897e271b71b01a742 | 800 | PASSED |
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <unordered_set>
#include <iomanip>
#include <sstream>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <unordered_map>
using namespace std;
int main(int argc, const char * argv[]) {
... | C++ | e27620d3a43ab42edf930b37ce214c9e | 6b82b7acd69769404866ac896793e384 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define Panda std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i) {
a[i] = s[i] - '0... | C++ | e27620d3a43ab42edf930b37ce214c9e | 62367e9eb0e3a9d95bceae4102b411c4 | 800 | PASSED |
#include <iostream>
#include<bits\stdc++.h>
using namespace std;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const double pi = 3.141592653;
const int mx = INT_MAX;
const int mn = INT_MIN;
int main(){
init();
int t; cin >> t;
while(t--)
{
int n;
string s, ans = "1";
cin >> n;
... | C++ | e27620d3a43ab42edf930b37ce214c9e | c8468079f919f5933db9379434018c8c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e5 + 5;
int a[MAXN];
int pfs[MAXN], sfs[MAXN];
void solve()
{
int n;
cin >> n;
n += 2;
a[0] = a[n-1] = 0;
for (int i = 1; i < n-1; i++)
{
cin >> a[i];
}
pfs[0] = 0;
bool ok = 1;
for (i... | C++ | 2515630678babfa39f606d535948abf7 | 27f40c0ba209a674225fcd531de2e1ac | 2,200 | PASSED |
// SmartCoder
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).... | C++ | 2515630678babfa39f606d535948abf7 | a18b3e8169688279bc7ed9f7e02453e5 | 2,200 | PASSED |
// SmartCoder
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).... | C++ | 2515630678babfa39f606d535948abf7 | 7f6287f4ca38c38c10fd39911f7d914b | 2,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int check(vector<long long> a) {
for (int i = 0; i + 1 < a.size(); i++) {
if (a[i] > a[i + 1]) {
return 0;
}
a[i + 1] -= a[i];
a[i] = 0;
}
if (a.back() == 0)
return 1;
return 0... | C++ | 2515630678babfa39f606d535948abf7 | be102a85e18cc18c3d821ef95798fa92 | 2,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int check(vector<long long> a) {
for (int i = 0; i + 1 < a.size(); i++) {
if (a[i] > a[i + 1]) {
return 0;
}
a[i + 1] -= a[i];
a[i] = 0;
}
if (a.back() == 0)
return 1;
return 0... | C++ | 2515630678babfa39f606d535948abf7 | dc87e80fefb13167d010f710feec81fc | 2,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int check(vector<long long> a) {
for (int i = 0; i + 1 < a.size(); i++) {
if (a[i] > a[i + 1]) {
return 0;
}
a[i + 1] -= a[i];
a[i] = 0;
}
if (a.back() == 0)
return 1;
return 0... | C++ | 2515630678babfa39f606d535948abf7 | 0631468aaf3622d1cc720f21ca5d4978 | 2,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int check(vector<long long> a) {
for (int i = 0; i + 1 < a.size(); i++) {
if (a[i] > a[i + 1]) {
return 0;
}
a[i + 1] -= a[i];
a[i] = 0;
}
if (a.back() == 0)
return 1;
return 0... | C++ | 2515630678babfa39f606d535948abf7 | ffe4b89f6dfefb5685d471b1d9780af6 | 2,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int check(vector<long long> a) {
for (int i = 0; i + 1 < a.size(); i++) {
if (a[i] > a[i + 1]) {
return 0;
}
a[i + 1] -= a[i];
a[i] = 0;
}
if (a.back() == 0)
return 1;
return 0... | C++ | 2515630678babfa39f606d535948abf7 | 645937e8a6e701e007c7fcd3738d2691 | 2,200 | PASSED |
#include <vector>
#include <chrono>
#include <iostream>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <cassert>
#include <queue>
#include <algorithm>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
... | C++ | 2515630678babfa39f606d535948abf7 | e404b6a377304e77ae890b15a532e457 | 2,200 | PASSED |
#include <vector>
#include <chrono>
#include <iostream>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <cassert>
#include <queue>
#include <algorithm>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
... | C++ | 2515630678babfa39f606d535948abf7 | b00afc82b164270cf6be02e38dd73402 | 2,200 | PASSED |
//Srayan Bhattachrayya JU EE
#include<bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " = " << (x) << endl
#define PI double(2 * acos(0.0))
#define LL long long
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
#define INF 1e15
int main() {
ios_base::sync_with_stdio(0);
... | C++ | edfb45e063424a97581d86e9f99f3a97 | 558a78f20f71313e1a81b7a2cdae41f5 | 2,500 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define x first
#define y second
#define debug if(0)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
using namespace std;
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double ld;
c... | C++ | edfb45e063424a97581d86e9f99f3a97 | 0bad79bd2912ef8547db95759f753987 | 2,500 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define x first
#define y second
#define debug if(0)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
using namespace std;
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double ld;
c... | C++ | edfb45e063424a97581d86e9f99f3a97 | 24212eab218a8e81e10946ac8c958baa | 2,500 | PASSED |
#include<iostream>
#include<iterator>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef std::vector<int> vi;
typedef std::vector<ll> vll;
typedef std::vector<ld> vld;
typedef std::vector<std::vector<ll> > vvll;
typedef std::vecto... | C++ | edfb45e063424a97581d86e9f99f3a97 | 09822e075873415d527933c1d155deea | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 100001
int p[N];
void solve(){
int n; cin >> n;
if (n == 2){
cout << 1 << endl;
cout << "2 1" << endl;
cout << 1 << endl;
cout << "1 2" << endl;
return;
}
for (int i =... | C++ | edfb45e063424a97581d86e9f99f3a97 | 939c302a7d85d47bb0c673f09a54cdaa | 2,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
typedef unsigned long long ull;
typedef __uint128_t L;
using namespace std;
const ll N=1e5+7;
namespace IO{
const int sz=1<<20;
char a[sz+5],b[sz+5],*p1=a,*p2=a,*t=b,p[105];
inline char gc(){
return p1==p2?(p2=(p1=a)+fread(a,1,sz,stdin),p1==p2?EOF:*p1++):*p1++... | C++ | edfb45e063424a97581d86e9f99f3a97 | 1a1fb5eebb33d48003fdbff3970bc1a5 | 2,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
long long ret;
signed main()
{
int T;
scanf("%lld",&T);
while(T--)
{
scanf("%d",&n);
ret=0;
for (int i=3;i<=n+1;i++)
ret+=(n-i/2)*(n-i/2);
printf("%lld\n%lld",ret,n/2+1);
for (int i=1;i<n/2;i++)
printf(" %... | C++ | edfb45e063424a97581d86e9f99f3a97 | 94c07519117084d72b651249726c9ddc | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
long long ret;
int main()
{
int T;
scanf("%d",&T);
while (T--)
{
ret=0;
scanf("%d",&n);
for (int i=3;i<=n+1;i++)
ret+=1ll*(n-i/2)*(n-i/2);
printf("%lld\n%d",ret,n/2+1);
for (int i=1;i<n/2;i++)
printf(" %d",i);
for (int i=n/2+... | C++ | edfb45e063424a97581d86e9f99f3a97 | bf16f33e7d35af3549a43ca73a1f0de5 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
long long ret;
int main()
{
int T;
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
ret=0;
for (int i=3;i<=n+1;i++)
ret+=1ll*(n-i/2)*(n-i/2);
printf("%lld\n%d",ret,n/2+1);
for (int i=1;i<n/2;i++)
printf(" %d",i);
for (int i=n/2+... | C++ | edfb45e063424a97581d86e9f99f3a97 | 1dc8f621810035b7c289de95eca483a2 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define ull unsigned ll
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
... | C++ | edfb45e063424a97581d86e9f99f3a97 | b22a12b4c434ba0d78e58787c9b2c76c | 2,500 | PASSED |
#include <bits/stdc++.h>
#define fp( i , x , y ) for( int i=(x); i<=(y); ++i )
#define fq( i , x , y ) for( int i=(y); i>=(x); --i )
#define ft( i , x ) for( int i=hd[x]; i ; i=nxt[i] )
#define fv( i , x ) for( int i=0; i<v[x].size(); ++i )
#define i60 long long
#define i128 __int128
#define ls ch[x][0]
... | C++ | 3317413b2c38fff76f7816c3554e9862 | 020e146fd534813ac1212ec819ec6f47 | 3,000 | PASSED |
#include <bits/stdc++.h>
#define I inline
#define fi first
#define se second
#define LL long long
#define mp make_pair
#define reg register int
#define pii pair<int,int>
#define fo(i, a, b) for(reg i = a; i <= b; i++)
#define fd(i, a, b) for(reg i = a; i >= b; i--)
#define bp __builtin_popcount
#define vi ... | C++ | 3317413b2c38fff76f7816c3554e9862 | fa8186eb7cd0b0635009522bab118de6 | 3,000 | PASSED |
#line 1 "library/my_template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc =... | C++ | 3317413b2c38fff76f7816c3554e9862 | 626441575c1b216a2785449ee06c04b3 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
struct mint{
int a;
mint()=default;
mint(int x):a((x%mod+mod)%mod){}
mint operator+(const mint &x)const{return this->a+x.a;}
mint operator-(const mint &x)const{return this->a-x.a;}
mint operator*(const mint &x... | C++ | 3317413b2c38fff76f7816c3554e9862 | fb6b1afd9fbfc2baff5880796d9bd114 | 3,000 | PASSED |
// LUOGU_RID: 94296066
#include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
const int mod = 998244353;
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int dec(int a, int b) { return a < b ? a - b + mod : a - b; }
int mu... | C++ | 3317413b2c38fff76f7816c3554e9862 | 50c5482a30bdfabe494b15d64ba25052 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// based on https://codeforces.com/contest/1474/submission/149248060
const int MOD = 998244353;
const int N = 52;
int inv[N];
using state = pair<long long, long long>;
// first: length of longest increasing subsequence ending here
// second: number of such sequences
int ... | C++ | 3317413b2c38fff76f7816c3554e9862 | a547c653267cb0bec50a6eeeee684aed | 3,000 | PASSED |
// LUOGU_RID: 94247140
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=55;
const int p=998244353;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
... | C++ | 3317413b2c38fff76f7816c3554e9862 | d23ca89d34a6057f9c5182038534904e | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 55, P = 998244353;
int n, ans, finv[maxn], b[maxn];
ll a[maxn];
pair<ll, ll> f[maxn][maxn], g[maxn * maxn];
int qp(int x, int y) {
int z = 1;
for (; y; y >>= 1, x = 1LL * x * x % P) {
if (y & 1) z = 1LL * ... | C++ | 3317413b2c38fff76f7816c3554e9862 | 1622dfccae66198afe8f882b16ecc9a9 | 3,000 | PASSED |
#include <stdio.h>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
const long long mod = 998244353;
typedef long long ll;
class MatrixG { // 用来快速递推转移的矩阵，压缩存储
private:
vector<ll> matrix;
ll inline get_element(const vector<ll>& m, int i, int j) {
if(i % 2 == 0) {
... | C++ | 3317413b2c38fff76f7816c3554e9862 | 2a07773424adb8ea3ae05fcf4aa50572 | 3,000 | PASSED |
#include <stdio.h>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
const long long mod = 998244353;
typedef long long ll;
class MatrixG { // 用来快速递推转移的矩阵，压缩存储
private:
vector<ll> matrix;
ll inline get_element(const vector<ll>& m, int i, int j) {
if(i % 2 == 0) {
... | C++ | 3317413b2c38fff76f7816c3554e9862 | 24e47ec31251ad18e912dcef8146e90e | 3,000 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e5+5;
int a[N];
int ans;
int len;
struct node{
int x;//最小初始战斗力
int y;//怪物数
};
node b[N];
void f(int s){
int n;
cin>>n;
int ma=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]-i>ma){
ma=a[i]-i;
}
}
b[s].x=ma+1;
b[s].y=n;
}
in... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | e7c8101c671af4d6486ea021e0f14ec1 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
struct NODE
{
int power;
int k;
}ans[100000];
bool cmp(NODE a,NODE b)
{
return a.power<b.power;
}
long long number[100100]; int T; int n;
int main()
{
cin>>T;
while(T--)
{
cin>>n;
for(int i=1;i<=n;i++)
{
int m;
cin>>m;
ans[i].k = m;
ans[i].power =... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | 1d526f2935e2a1d38d437f92d7f81483 | 1,300 | PASSED |
#include<bits/stdc++.h>
#pragma warning(disable:4996)
using namespace std;
long long t,n;
struct CAVE {
long long k;
long long minn;
}c[100010];
bool cmp1(CAVE& x, CAVE& y) {
return x.minn < y.minn;
}
int main() {
cin >> t;
while (t--) {
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> c[i].k;
long ... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | db33aa90fa613974f64b97c2db1ef7cf | 1,300 | PASSED |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int T, n, x;
struct node {
int b, k;
}a[maxn];
bool cmp(node x, node y) {
return x.b<y.b;
}
int main()
{
cin>>T;
for(int i=0;i<T;i++) {
cin>>n;
for(int i=1;i<=n;i++){
a[i].b=-2e9;
cin>>a[i].k;
for(int j=... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | c746ed804719ea627a33a5041cd696a6 | 1,300 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
typedef struct Point
{
long long x;
long long y;
};
bool cmp(Point p1,Point p2)
{
return p1.x < p2.x;
}
Point a[100001];
int main()
{
long long u;
cin >> u;
while (u--)
{
... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | 016e3487e4446b4c189210e1b76e5d3b | 1,300 | PASSED |
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#define Max 100005
typedef long long ll;
using namespace std;
int a[Max],n;;
int ans;
int len;
typedef struct s
{
int x;
int y;
} hero;
hero h[Max];
void f(int x)
{
int k;
cin>>k;
int ma=0;
for(int i=0; i<k; i++)
... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | 2f362ed189344c6a1ecd310c4624ba56 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 6050
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define For(a,b,i) for(int i=a;i<=b;i++)
typedef long long ll;
int ans[100102],n;
class PPP{
public:
int left;
int right;
}a[100102];
bool cmpWithPPP(PPP &a,PPP &b){
return a.left<b.left;
}
void printAns(){}
type... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | b9cfb23c67c9a7004c655afa55e57cc1 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int qqq=1111111;
const int qqqqqq= 111111;
const double yyyyy = 42441135;
const double efwdfdw = 4144212;
const float dsjdd = 12343241556456;
const int asd = 454531313124;
const int assd =... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | 0e85123738a99fb272dc096abb83a944 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
void solve() {
int n;
cin >> n;
vector<pll> V(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
ll maxx = -10;
for (int j = 0; j < k; j++) {
ll t;
cin >>... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | afdafbc466d3017256c436a795b43b90 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int cou[100040];
int k[100040];
struct node{
int carvy,num;
}enemy[100040];
struct no{
int val,cnt;
}carvy[100040];
int cnt=0;
map<int,int>semyu;
bool cmp(node a,node b){
return a.carvy<b.carvy;
}
int main(){
int N;
scanf("%d",&N);
while(N--){
int answerss... | C++ | 88488ff074bc25a6cf925c8a07a1d8c6 | 73914fe71e5523c38e0d19cd3c960fa6 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define Max 100000000000000
#define min_heap priority_qu... | C++ | 77443424be253352aaf2b6c89bdd4671 | f63648589981a17468eb2aab3adfa0f0 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 376b3aaf7c75f49dec30cb19094ac896 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 4e5d30ce740c5dcc53189558a8bf986b | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 3064cc9021f3e49852d4b522f9df1850 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 2a051be035baaedbaee6644d30cf1af5 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 3afbb1a4181318eda5a1bdc4d23c3f51 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | f2edb44aad24e2dd2f8d8dc49cdd21d5 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 6c9d077b03ff89cb90b3872bfbadf9e7 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 1927666683ca682a631992d8a68c5cec | 1,900 | PASSED |
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%lld", &(z))
#define _ff(i, a, b) for (int i = a; i <= b; ++i)
#define _rr(i, a, b) for (int i = b; i >= a; --i)
#define _f(i, a, b) for (int i = a; i < b; ++i)
#define _r(i, a, b) for (int i = b - 1; i >= a; --i)
#define mkp make_pair... | C++ | 77443424be253352aaf2b6c89bdd4671 | 6bad9c41fcf044629785d75913996cc2 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long N=1e6+5,mod=998244353;
long long mul[N],inv[N];
long long ksm(long long f,long long x){
long long tot=1;
while(x){
if(x & 1ll) tot=tot*f%mod;
f=f*f%mod;
x>>=1ll;
}
return tot;
}
long long ID(long long x){
if(x & 1ll) return mod-1;
e... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 6b4e44d208be7ea3bf2b1e4ce3b12ee4 | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long N=1e6+5,mod=998244353;
long long mul[N],inv[N];
long long ksm(long long f,long long x){
long long tot=1;
while(x){
if(x & 1ll) tot=tot*f%mod;
f=f*f%mod;
x>>=1ll;
}
return tot;
}
long long ID(long long x){
if(x & 1ll) return mod-1;
e... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 75c8053c29de7409f43723de68f6b20d | 2,900 | PASSED |
#include<cstdio>
#include<cstring>
#define N 1100000
using namespace std;
typedef long long LL;
const LL mod=998244353;
inline int gcd(int x,int y){
if(!x)return y;
else return gcd(y%x,x);
}
inline LL ksm(LL x,LL y){
LL ans=1;
while(y){
if(y&1)ans=ans*x%mod;
x=x*x%mod;y>>=1;
}
return ans;
}
... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 19060d14ceadb64df9bd262286f49380 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; i++)
#define debug(a) cerr << #a << ": " << (a) << '\n';
#define debug_arr(a, n) { cerr << #a << " "; rep(i, 0, n) cerr << a[i] << ' '; cerr << '\n'; }
#define debug_vec(a) { cerr << #a << " "; for(auto x : a) ... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | f505cc422fd2fe4bbba7510daba74ad1 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; i++)
#define debug(a) cerr << #a << ": " << (a) << '\n';
#define debug_arr(a, n) { cerr << #a << " "; rep(i, 0, n) cerr << a[i] << ' '; cerr << '\n'; }
#define debug_vec(a) { cerr << #a << " "; for(auto x : a) ... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 37a92e657c94f849ba32d9a1bcae226f | 2,900 | PASSED |
#include <iostream>
#include <cstdio>
#define mod 998244353
#define int long long
using namespace std;
int read(){
int x=0;
char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x;
}
int Qpow(int a,int p){
if (p==0)return 1;
int t=Qpow(a,p/2);
t=t*t%mod;... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | d0558bf88283bcadf700a37397f9f528 | 2,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
const int nn = 1e6 + 5;
const int mod = 998244353;
int add(int a, int b) {
return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b) {
return a < b ? a - b + mod : a - b;
}
int mul(int a, int b) {
return 1ll * a * b % mod;
}
int ksm(in... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 8ebee04cc0ef7f84ae347daa8fb35dcb | 2,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
const int nn = 1e6 + 5;
const int mod = 998244353;
int add(int a, int b) {
return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b) {
return a < b ? a - b + mod : a - b;
}
int mul(int a, int b) {
return 1ll * a * b % mod;
}
int ksm(in... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 093c5eeba2a5a19ca7f9bcfb00e9dea4 | 2,900 | PASSED |
#include<cstdio>
#include<vector>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define KFOR(i,a,b) for(int i=(a),HOHOlim=(b);i<=HOHOlim;++i)
#define ROF(i,a,b) for(int i=(a);i>=(b);--i)
#define go(p,u) for(int p=head[u];p;p=edge[p].nxt)
using namespace std;
typedef long long LL;
const int NN=1e6+5,RN=1e6,Mod=998244353;... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 8a092657e7b63f0f48d85622dae257d1 | 2,900 | PASSED |
#include<cstdio>
#include<vector>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define KFOR(i,a,b) for(int i=(a),HOHOlim=(b);i<=HOHOlim;++i)
#define ROF(i,a,b) for(int i=(a);i>=(b);--i)
#define go(p,u) for(int p=head[u];p;p=edge[p].nxt)
using namespace std;
typedef long long LL;
const int NN=1e6+5,RN=1e6,Mod=998244353;... | C++ | 0337ff9d7c3d8e0813ab4d47736308e5 | 54500098e03b6d19b94234ee9d70ff80 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define rnt register int
using namespace std;
const int maxn=50010,maxe=1000010,inf=1e18;
inline int read()
{
int x=0,f=1;char c;
for(;!isdigit(c);c=getchar()) if(c=='-') f=-f;
for(;isdigit(c);c=getchar()) x=(x<<1)+(x<<3)+(c^48);
return x*f;
}
class Netflow
... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 83df5f897d06d90928a22541eadb480c | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
const int inf=1e18;
const int maxm=1000010;
const int maxn=50010;
int n,m... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 6735b8c4081d34f2126289322e57752c | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
const int inf=1e18;
const int maxm=1000010;
const int maxn=50010;
int n,m... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 51a6d0705ed249e036fbd50ace10e3eb | 3,400 | PASSED |
/*
((O A O))
// 0-0 \\
\ w w /
*/
#include <bits/stdc++.h>
const int B = 100;
const int N = 50000;
const int inf = 0x3f3f3f3f;
int n;
int T;
int a[N + 10], id[N + 10];
int s, t;
int head[4 * N + 10], nxt[4 * N * 100 + 10], to[4 * N * 100 + 10], c[4 * N * 100 + 10], e_tot = 1;
std::queue<int> q;
int dep[4 * N ... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 58da2b29fc9254c64096cb6cce49f6fe | 3,400 | PASSED |
/*
((O A O))
// 0-0 \\
\ w w /
*/
#include <bits/stdc++.h>
const int B = 100;
const int N = 50000;
const int inf = 0x3f3f3f3f;
int n;
int T;
int a[N + 10], id[N + 10];
int s, t;
int head[4 * N + 10], nxt[4 * N * 100 + 10], to[4 * N * 100 + 10], c[4 * N * 100 + 10], e_tot = 1;
std::queue<int> q... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 05a31c54b13af85a80199114ecb9bb95 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace my_std
{
typedef long long ll;
const int inf=1e9;
#define fr(i,x,y) for(int i=(x);i<=(y);++i)
#define pfr(i,x,y) for(int i=(x);i>=(y);--i)
#define space putchar(' ')
#define enter putchar('\n')
inline int read()
{
int sum=0,f=1;char ch=0;
w... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | c11c62d738516a9dc92327c3a156e21c | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace my_std
{
typedef long long ll;
const int inf=1e9;
#define fr(i,x,y) for(int i=(x);i<=(y);++i)
#define pfr(i,x,y) for(int i=(x);i>=(y);--i)
#define space putchar(' ')
#define enter putchar('\n')
inline int read()
{
int sum=0,f=1;char ch=0;
w... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | d27fc6c3c86ad066ad44726ba6881299 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace my_std
{
typedef long long ll;
const int inf=1e9;
#define fr(i,x,y) for(int i=(x);i<=(y);++i)
#define pfr(i,x,y) for(int i=(x);i>=(y);--i)
#define space putchar(' ')
#define enter putchar('\n')
inline int read()
{
int sum=0,f=1;char ch=0;
while(!isdigit... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 0e58bbe7bf39a3431d2feab30f8d3726 | 3,400 | PASSED |
#include<bits/stdc++.h>
#define N 200010
#define M 4000010
using namespace std;
int cnt=1,head[N],cur[N],dep[N],to[M],nxt[M],val[M];
int S,T,INF=0x3f3f3f3f;
void insert(int u,int v,int w) {
cnt++;
to[cnt]=v;
val[cnt]=w;
nxt[cnt]=head[u];
head[u]=cnt;
}
void ins(int u,int v,int w) {
insert(u,v,w);
... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | f4e51ab283acc7d93830bcbace760a5e | 3,400 | PASSED |
/*
Author: cnyz
----------------
Looking! The blitz loop this planet to search way.
Only my RAILGUN can shoot it. 今すぐ
*/
#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define fi first
#define se second
const int N=1e6,... | C++ | 572138ac4a13090bcbe5eb3a0a601033 | 63805cf0a80a78bb664c5a586146fa4d | 3,400 | PASSED |
//https://codeforces.com/contest/1670/problem/B
//bpm-22-2 elnur israilov
#include <iostream>
#include <set>
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
int t;
int a;
int n;
int i;
int max = 0;
std::string s;
char tmp;
std::cin >> t;
... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | dda2113d788d6820668f71f407e2d567 | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
int t;
int a;
int n;
int i;
std::string s;
std::string x;
std::cin >> t;
while (t--) {
std::cin >> a >> s >> n... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | a23a35f87595223dee9c3a0401ee9187 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+500;
int T,n,k,is[128];
string s;
main()
{
cin>>T;
while(T--)
{
memset(is,0,sizeof is);
cin>>n>>s>>k;char z;int res=0;
for(int i=1;i<=k;i++)cin>>z,is[z]=1;
for(int i=0,la=-1;i<n;i++)if(is[s[i]])
{
if(la==-1){res=i;la=i;conti... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | f7dbea568c141462f77127f2234e1052 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define JUDGE(X) ISIN[X-'a']
int t,n,k,ISIN[27],RES,p,debug;
string s;
char tt;
int main()
{
cin>>t;
if(t==11)debug=1;
while(t--)
{
cin>>n>>s>>k;
// if(debug&&t<4)
// {
// cout<<s<<"____________________... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | 9e1b2d535ca1006cad91e145affe2d43 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+19;
int p[N];
int a[26];
int main()
{
int T;cin>>T;
while(T--){
for(int i=0;i<26;i++) a[i]=0;
int n ;cin>>n;
for(int i=0;i<n;i++)p[i]=0;
string s; cin>>s;
int t; cin>>t;
int res=0;
for(int i=1;i<=t;i++){
char k;
... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | 6fb49126f9ed675b1c2a6cf205c1d987 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+19;
int p[N];
int a[26];
int main()
{
int T;cin>>T;
while(T--){
for(int i=0;i<26;i++) a[i]=0;
int n ;cin>>n;
string s; cin>>s;
int t; cin>>t;
int res=0;
for(int i=1;i<=t;i++){
char k;
cin>>k;
a[k-'a']=1;
}
f... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | fe233ea7a258a4ef1cc6888e1d1c55d5 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+19;
int p[N];
int a[26];
int main()
{
int T;cin>>T;
while(T--){
for(int i=0;i<26;i++) a[i]=0;
int n ;cin>>n;
string s; cin>>s;
int t; cin>>t;
int res=0;
for(int i=1;i<=t;i++){
char k;
cin>>k;
a[k-'a']=1;
}
... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | 99aac90fdd253dd697e130623aa78881 | 1,100 | PASSED |
#include"bits/stdc++.h"
#include<cstdio>
#include<cstring>
#include <string>
#include<algorithm>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <utility>
#define LL long long
// for(int i=0;i<n;i++){
// }
using namespace std;
int main() {
ios_base:... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | bced6819787406dd6515b9f24f0f1464 | 1,100 | PASSED |
#include"bits/stdc++.h"
// #include<cstdio>
// #include<cstring>
// #include <string>
// #include<algorithm>
// #include <iostream>
// #include <cmath>
// #include <iomanip>
// #include <vector>
// #include <utility>
#define LL long long
// for(int i=0;i<n;i++){
// }
using namespace std;
... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | fb00ff62e32970c06b7ada45ba8961db | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t,n,k;
bool sc[26];
char key[200005],ch;
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>t;
while(t--){
memset(sc,false,sizeof(sc));
cin>>n;
cin>>key;
cin>>k;
for(int i=1;i<=k;i++){
... | C++ | 7374246c559fb7b507b0edeea6ed0c5d | 574eabf936aea932cf489c348fb87128 | 1,100 | PASSED |
print(*[1+int((int(input())*1.5)**0.5-9e-9)for _ in range(int(input()))]) | Python | fbc8d6564905fbe82f9f612b2da3484d | d811673cee4a5737838db323bc9c90d8 | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.