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 |
|---|---|---|---|---|---|
/**
* author: tourist
* created: 28.11.2021 17:43:04
**/
#include <bits/stdc++.h>
using namespace std;
class dsu {
public:
vector<int> p;
int n;
vector<int> sz;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
sz.assign(n, 1);
}
inline int ... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 02272e3a79fb87767c96b21658a0673f | 1,600 | PASSED |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma optimize("jillzay, jillzay, paci, paci, gilzi, gilzi")
#pragma optimize("JARU SOSISONI")
using namespace __gnu_pbds;
using namespace std;
template <class T>
istream& operator >> (istream& in, vector<T>& v){ for(auto& e : v){ in >> e;} ... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 1169828b5f560bb4b0810b23a915781d | 1,600 | 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 int long long
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef pair<int,int> pii;
const int a... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | e7a744e28c1680cd8440f2219ab0b9db | 1,600 | PASSED |
/**************************************************************************************
* Coder : *
| Arnab048 ... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 494c9b2224e5d721a6efa6a7d3e250d1 | 1,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma,sse,sse2,sse3,sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef string str;
const i... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | c6e76e9d829940f9fa98b9d8d996422c | 1,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<cstdio>
#include<iomanip>
using namespace std;
const int N=300010;
typedef pair<double,double> PDD;
typedef pair<int,int> PII;
typedef long long ll;
int n,m,k;
vector<int> v;
int f... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 0abcc12075089722d9d0e2ff901f7201 | 1,600 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
struct DSU {
std::vector<int> f, siz;
DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); }
int leader(int x) {
while (x != f[x]) x = f[x] = f[f[x]];
return x;
}
bool same(int x, int y) { return leader(x) == leader(y); }
... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 79f5b2c8a64276eee0ea2cb0377cca0a | 1,600 | PASSED |
#include<bits/stdc++.h>
//#include "grader.h"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
const int N = 2e5 + 10;
pii rep[N];
int cnt = 1;
int fw[N], fwv[N... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 402ec2032b127c54a3462a6e74d8c007 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define vc vector
#define nd node*
#define pnd pair<nd, nd>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vc<pll> vpll;
typedef vc<vll> vvll;
typedef vc<vpll> vvpll;
template<const ll MOD>
struct mod_mul : std::multiplies<const ll> {
... | C++ | 29bc7a22baa3dc6bb508b00048e50114 | 6ed81f4b0c78a9d6bee28b0fa35b92e8 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 5966bbd71831169c39cbc243760f356c | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | cbb4c89c461265b93861c592701b9d5d | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 17759df6f114789f0337384defcbb536 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | c64d88edf19665da3adaad9be3ac6f58 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | b00e35cadce00a254b36c804ac8bb96e | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 00b410f49a0723d5dae626e0377ca270 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 4ca2108c51b38f97566417df8b28b06b | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 8d47733f4be1d23c669cf507ee8cb89b | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;;;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | 7fc9905871011e4697dc36debc937aab | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int T[400010][4][4];
char s[100010];
void push_up(int rt) {
for (int i = 0; i < 4; ++i) {
for (int j = i; j < 4; ++j) {
int temp = 0x3f3f3f3f;
for (int k = i; k <= j; ++k)
... | C++ | b431e4af99eb78e2c6e53d5d08bb0bc4 | d3d4404a20de012b82612fddec22b662 | 2,400 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragm... | C++ | 026a7c78986c67593dbb4603da73e7df | 29347a597a7617c1c88e315fed4ec043 | 2,800 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragm... | C++ | 026a7c78986c67593dbb4603da73e7df | a7304fadcb549de9a62ec9c97a52f658 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1000010;
const int N=maxn<<2;
const int inf=1e9;
inline char readchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++;
}
#def... | C++ | 026a7c78986c67593dbb4603da73e7df | 12f0bc442192ddc3a093d9b75acfd827 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1000010;
const int N=maxn<<2;
const int inf=1e9;
inline char readchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++;
}
#def... | C++ | 026a7c78986c67593dbb4603da73e7df | 1d317a811296f7305b7b73d5cf29bd01 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1000010;
const int N=maxn<<2;
const int inf=1e9;
inline char readchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++;
}
#define il inl... | C++ | 026a7c78986c67593dbb4603da73e7df | 5bea92cc20130b82a9f12d0f539ea10a | 2,800 | PASSED |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define I using
#define love namespace
#define Elaina std
#define ll long long
#define ls(k) (k<<1)
#define rs(k) (k<<1|1)
I love Elaina;
const int N=1000010;
namespace fast_IO {
char buf[400005], *s, *t;
char getchar() {
retu... | C++ | 026a7c78986c67593dbb4603da73e7df | c46b0cb1f85eab4c1df79650cb1fba1c | 2,800 | PASSED |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define I using
#define love namespace
#define Elaina std
#define ll long long
I love Elaina;
const int N=1000010;
/*ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0'&&c... | C++ | 026a7c78986c67593dbb4603da73e7df | 99a7b9ccaafbc2ef64c0bb36ac502b9b | 2,800 | PASSED |
#include<bits/stdc++.h>
//#define int long long
#define For(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define Rof(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define rep(i, a) for(int i=1,i##end=a;i<=i##end;i++)
using namespace std;
const int N=1e6+9;
char buf[(1<<21)+5],*p1,*p2;
#define getchar() (p1==p2&&(p2... | C++ | 026a7c78986c67593dbb4603da73e7df | 5c767b0bacae99bca5904efcb7139d67 | 2,800 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef u... | C++ | 026a7c78986c67593dbb4603da73e7df | ca13dc1ddf202bdeb37ff590ffb8a073 | 2,800 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1e6 + 50,maxk = 60;
int n,top1,top2,b[maxn],stk1[maxn],stk2[maxn];
long long ans,a[maxn];
long long read(){
long long x = 0;
char c = getchar();
while(c < '0' || c > '9') c = getchar();
whi... | C++ | 026a7c78986c67593dbb4603da73e7df | cb6218e7c313a507631f2ee5aa466605 | 2,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define gc() getchar()
#define pc(a) putchar(a)
inline ll read()
{
ll f=1,x=0;
char c=gc();
while(c>'9'||c<'0')
{
if(c=='-') f=-f;
c=gc();
}
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
return x*f;
}
int n... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | 60b110fc7917606d7ba5bded451dda1c | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define gc() getchar()
#define pc(a) putchar(a)
inline ll read()
{
ll f=1,x=0;
char c=gc();
while(c>'9'||c<'0')
{
if(c=='-') f=-f;
c=gc();
}
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
return x*f;
}
int n... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | c72122d1d7a50d03ab20b072e3dcec9c | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define gc() getchar()
#define pc(a) putchar(a)
inline ll read()
{
ll f=1,x=0;
char c=gc();
while(c>'9'||c<'0')
{
if(c=='-') f=-f;
c=gc();
}
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
return x*f;
}
int n... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | 0fce09e1aaf1b54c71f7d155dd871385 | 3,500 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define mod 1000000007
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : ... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | 47d856e4b20cb4c44a0ad9b4383844d3 | 3,500 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define mod 1000000007
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : ... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | cda7f92d606e1edc2a402f60951e1888 | 3,500 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define mod 1000000007
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : ... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | d2010667a0f91519d518e40c48a7d8da | 3,500 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | a318475627cbcc214a92c0e8cd51152f | 3,500 | PASSED |
#include <bits/stdc++.h>
#include <chrono>
#include <limits>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forrn(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define PYMOD(a, m) ((((a) % (m)... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | 5fc8200fc97be68795271c0779afdf32 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> ipos(n);
for(ll& x : ipos) cin >> x;
vector<vector<int> > force(k, vector<int>(n));
// turn bot
for(int i = 0; i < n; i++){
for(... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | 341b0d9a4798e3d25ca202c6cc59fb68 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> ipos(n);
for(ll& x : ipos) cin >> x;
vector<vector<int> > force(k, vector<int>(n));
// turn bot
for(int i = 0; i < n; i++){
for(... | C++ | 1881e52e92db48ae6a53a7fdcd1aa960 | dd34d1b391a8aa2ef0597f6a129dff37 | 3,500 | PASSED |
/**
* author: tourist
* created: 28.11.2021 18:24:02
**/
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, t... | C++ | 470ada4754e9601bc7a1548456dab8d7 | 8fe6c71cb2c5d63e11144f7a190bba51 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define db double
#define vc vector
#define debug(x) cout<<#x<<'='<<(x)<<' '
//#define int LL
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N=100+10,M=1e5+10,MOD=998244353;
const int inf=2e9;const LL INF=2e18... | C++ | 470ada4754e9601bc7a1548456dab8d7 | c128f440b50c35dc645730644c971a82 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e5 + 5;
const ll maxm = 1e3 + 5;
namespace IO{
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE],*oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;... | C++ | 470ada4754e9601bc7a1548456dab8d7 | 10994fcab3593ec060f706d6379f7045 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
const int inf = 1e9;
const ll inf64 = 1e18;
struct output {
vector<ll> res;
... | C++ | 470ada4754e9601bc7a1548456dab8d7 | 07a2027cea71b131671620ca13c963f8 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 102, M = 10000... | C++ | 470ada4754e9601bc7a1548456dab8d7 | de872ac3871bbd43b077bb718b65cb92 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 102, M = 10000... | C++ | 470ada4754e9601bc7a1548456dab8d7 | d283ab49fc7289ef8cbf6208ef8eb419 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 102, M = 10000... | C++ | 470ada4754e9601bc7a1548456dab8d7 | 7000e5d6452a272052cbba6b3ccd700a | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())
#define vi vector<int>
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
#define e... | C++ | 470ada4754e9601bc7a1548456dab8d7 | f613ceee9d4322c56cf5ecaebfa9f0c5 | 3,000 | PASSED |
// Super Idol的笑容
// 都没你的甜
// 八月正午的阳光
// 都没你耀眼
// 热爱105°C的你
// 滴滴清纯的蒸馏水
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespa... | C++ | 470ada4754e9601bc7a1548456dab8d7 | fdc623c651ace9c375fac3a169ddba40 | 3,000 | PASSED |
// Super Idol的笑容
// 都没你的甜
// 八月正午的阳光
// 都没你耀眼
// 热爱105°C的你
// 滴滴清纯的蒸馏水
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespa... | C++ | 470ada4754e9601bc7a1548456dab8d7 | 98268414bf6fb55d8ca735bd89167a5c | 3,000 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
const int N = 110;
int a[N];
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool flag = true;
for (int i = 0; i < n; i++) {
... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | 7837e39c67b1d6c9ec775a93d53e1d31 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void Solve(){
ll i, j, n, m;
cin >> n;
ll a[n + 10], h1 = 0;
for(i = 0; i < n; i++){
cin >> a[i];
ll sqRoot = sqrt(a[i]);
if(sqRoot * sqRoot != a[i]) h1 = 1;
}
if(h1){
cout << "YES\n";
}
... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | efc0235031731467abf1ef14fcd03d63 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
const int MOD = 1000000007;
using ld = long double;
using ll = long long;
using vi = vector<int> ;
using pii = pair<... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | 6550c240b3391af768623499ee2f4fb7 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
int a;
int arr[100];
bool y = false;
cin >> a;
for(int i = 0; i < a; i++) {
bool x = false;
cin >> arr[i];
int akar = sqrt(arr[i]);
if(akar * akar == arr[i]) x = true;
if(x == false) {
y = t... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | e08e0ad500915e742e256af8aaed8c00 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, n, x;
bool flag;
cin >> t;
while (t--)
{
flag = false;
cin >> n;
while (n--)
{
cin >> x;
if (int(sqrt(x))*int(sqrt(x)) != x)
flag = true;
}
... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | ffcdb127c9b5aa96a755041046d0e409 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N];
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
int falt=1,aaa=1;
sort(a,a+n);
for(int i=0;i<n;i++)
{
int ans=sqrt(a[i]);
if(ans*ans!=a[i]) falt=0;
}
if(falt==0) cout<<"YES... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | fb040c8b1b8cbb27cf1e0b6f4e287928 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N];
int main(){
int t;
cin >> t;
while(t--){
int flag = 0;
int n;
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
int h = (int)(sqrt(a[i]));
if(h * h != a[i]) flag = 1;
}
if(flag) cout << "YES" << endl;
else cout << "NO" <... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | c23a9a678a141d4261bb54b5cf8afacd | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
bool is_perfectsquare(long long n)
{
int cnt = 0;
for(long long i = 1; i * i <= n; i++)
{
if(n % i == 0)
{
if(n/i != i)
cnt+=2;
else
cnt++;
}
}
return cnt%2;
}
int main(... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | 0cfbde51c4a05be950ecef3919aed309 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--){
int n; cin>>n;
string ans="NO";
for(int i... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | 72fe456fbcd8783e361755ac600114c0 | 800 | PASSED |
#include <vector>
#include <cmath>
#include <iostream>
using namespace std;
int check_perfect_square(int n)
{
int a = (int) sqrt((double) n);
if(a * a == n || (a+1)*(a+1) == n)
return true;
return false;
}
int main()
{
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
int fl... | C++ | 33a31edb75c9b0cf3a49ba97ad677632 | ae18b73d2bbdde798efa1e2e7728e1b7 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define time cerr << "Time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" sec"<<endl;
#define ll long long int
#define ull unsigned long long
#define vi vector <int>
#define vll vector <long long int>
#defi... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | faf9f0c01fa1916620ba805ddd80795f | 1,600 | PASSED |
//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
#include<bits/stdc++.h>
using namespace std;
//debug..........
#define error(args...) {vector<string>_v=split(#args,',');err(_v.begin(),args);cout<<endl;}
vector<string> split(const string &s, char c) {vector<string>v; stringstream ss(s); string x;while (... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | d4a5adbc6168447800c81f379ad3273c | 1,600 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N=1e5+20;
int ans[N];
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
int n,base,i=0;
ll x=1;
scanf("%d",&n);
for(base=1;base<n;base++)
{
if(gcd(n,base)==1)
{
ans[i++]=base;
x... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | f6d8f1d526ef82d5230655ab8e180538 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define endl '\n'
#define r_all(v) v.rbegin(),v.re... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | 33de1b6925e289ecfb5b927e5777257e | 1,600 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=10000000;
signed main()
{
// freopen(".out","w",stdout);
int n;
cin>>n;
int tong[100005];
memset(tong,0,sizeof(tong));
int cheng=1;
int ans=0;
for(int i=1;i<n;i++){
if(__gcd(i,n)==1){
tong... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | 46c226e61574f72d712d671a6a4b0838 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 5;
int gcd(int a, int b) {
return b ? (gcd(b, a % b)) : a;
}
int b[maxn];
int main() {
int i, n, cnt = 0;
cin >> n;
long long sum = 1;
for(i = 1; i < n; i++) {
if(gcd(i, n) == 1) {
b[cnt] = i;
... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | 53e8a216dc36d460f4b583192109a201 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <int> v;
int gcd(int x,int y){
return x%y==0?y:gcd(y,x%y);
}
int main()
{
int n;
ll pro=1;
int len;
cin>>n;
for(int i=1;i<n;i++){
if(gcd(n,i)==1)
{
pro=(pro*i)%n;
v.push_back(i);
... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | 513ef4bbe6397f0024fafc7059e447e4 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n; cin >> n;
if(n == 2){
cout << 1 << endl;
cout << 1 << endl;
return 0;
}
// for(int n = 2;n <= 20;n ++ ){
int res = 1,cnt = 0;
vector<int>vec;
for(int i = 1;i < n - 1... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | aa3b16e8dbed5c18181e0df898b7c183 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define d1(a) {cout<<#a<<"="<<(a)<<'\n';}
#define d2(a,b) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<'\n';}
#define d3(a,b,c) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<" "<<#c<<"="<<(c)<<'\n';}
#define D1(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | e426c51873792d9e471efba5e6dfa1c1 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
void add(int &x, int y){
x += y;
while (x >= MOD) x -= MOD;
while (x < 0) x += MOD;
}
int fix(int x)... | C++ | d55afdb4a83aebdfce5a62e4ec934adb | 911b3d017bbb0083525be01339796025 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef long double ld ;
#define FAST ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define pb push_back
#define pi pair<ll,ll>
#define pll pair<ll,ll>
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define fr(i,a,b) for(ll i ... | C++ | d6c228bc6e4c17894d9e723ff980844f | f49a57846d455d15e42e91839084f48e | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef long double ld ;
#define FAST ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define pb push_back
#define pi pair<ll,ll>
#define pll pair<ll,ll>
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define fr(i,a,b) for(ll i ... | C++ | d6c228bc6e4c17894d9e723ff980844f | fc8fd7b2a49f9c253dd75768baaf1e9f | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef long double ld ;
#define FAST ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define pb push_back
#define pi pair<ll,ll>
#define pll pair<ll,ll>
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define fr(i,a,b) for(ll i ... | C++ | d6c228bc6e4c17894d9e723ff980844f | a13d4ecda332d11bfca0a4898c42bea7 | 2,000 | PASSED |
#include <bits/stdc++.h>
/*#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
*/
#pragma GCC ... | C++ | d6c228bc6e4c17894d9e723ff980844f | 37bdaff26ec54b7d30435229c47af9e1 | 2,000 | PASSED |
#include <bits/stdc++.h>
/*#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
*/
//#pragma GC... | C++ | d6c228bc6e4c17894d9e723ff980844f | 4257d2f105d903f906a75e811324d002 | 2,000 | PASSED |
#include <bits/stdc++.h>
//#define int long long
#define float double
#define sz 100005
#define all(a) a.begin(), a.end()
#define mod 1000000007
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int>>
#define debug cout << "here" << endl;
#define rep(i, n) for (int i = 0; i < n; ++i)
#def... | C++ | d6c228bc6e4c17894d9e723ff980844f | 3aaa8d3393de10f815cbfbbc90fe4809 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
//constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
const int N = 4e5 + 10;
int cnt[N], kind[N];
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];... | C++ | d6c228bc6e4c17894d9e723ff980844f | 7147923e0a79a5c9262f75715214e879 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
//constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
const int N = 4e5 + 10;
int cnt[N], kind[N];
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
... | C++ | d6c228bc6e4c17894d9e723ff980844f | 0609192a076fcf93812daed49515bc7c | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=4e5+10;
int a[N],unit;
int res[N];
int cnt[N],ans[N],maxn=0;
struct node
{
int l,r,id;
bool operator<(const node &x) const
{
if(l/unit!=x.l/unit) return l<x.l;
if((l/unit)&1) return r<x.r;
return r>x.r;
}
}q... | C++ | d6c228bc6e4c17894d9e723ff980844f | 2a8a023f5dc40762feabd6a33f6ca6f3 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=4e5+10;
int a[N],unit;
int res[N];
int cnt[N],ans[N],maxn=0;
struct node
{
int l,r,id;
bool operator<(const node &x) const
{
if(l/unit!=x.l/unit) return l<x.l;
if((l/unit)&1) return r<x.r;
return r>x.r;
}
}q... | C++ | d6c228bc6e4c17894d9e723ff980844f | 8f836e5f05eb0f61d94e3cf90ac721a4 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int i,j,k,n,m,t,a[150],ans[105][105],cnt;
bool ask(int x,int y){
printf("1 %d %d\n",a[x]-1,a[y]-1);fflush(stdout);
scanf("%d",&x);return x;
}
void sort2(int l,int r){
if(l>=r){return;}
int k=(r+l)/2,i=l,j=k+1,it=l-1,tmp[150];
sort2(l,k);sort2(k+1,r);
w... | C++ | beae75b649ca6ed26180954faf73e5a3 | 2873c1cc25362793d645c01b06f84a36 | 2,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<iomanip>
#include<stack>
#include<cmath>
using namespace std;
#ifndef POJ
#define Cpp11
#endif
#ifdef Cpp11
... | C++ | beae75b649ca6ed26180954faf73e5a3 | b4c22108c6bf5d6f89f5a46e08710266 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=105;
int T,n,e[N][N],E[N][N],t0,t1;
inline bool ask0(int x,int y){
#ifdef MRSRZ
return e[x][y];
#else
assert(++t0<=9*n);
cout<<"1 "<<x<<" "<<y<<endl;
cin>>x;
return x;
#endif
}
inline bool ask1(int x,vector<int>&vc){
#ifdef MRSRZ
for(int i:v... | C++ | beae75b649ca6ed26180954faf73e5a3 | 8883c877bc1958c703e51ca9574e62b4 | 2,700 | PASSED |
// Problem: E. Baby Ehab's Hyper Apartment
// Contest: Codeforces - Codeforces Round #716 (Div. 2)
// URL: http://codeforces.com/contest/1514/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define pb push_back
using name... | C++ | beae75b649ca6ed26180954faf73e5a3 | 259d9b1c0544a13a75b931e6ac161a32 | 2,700 | PASSED |
// Problem: E. Baby Ehab's Hyper Apartment
// Contest: Codeforces - Codeforces Round #716 (Div. 2)
// URL: http://codeforces.com/contest/1514/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define pb push_back
using name... | C++ | beae75b649ca6ed26180954faf73e5a3 | 6012e29d4579dd648c6743d1d1bd503f | 2,700 | PASSED |
#include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
... | C++ | beae75b649ca6ed26180954faf73e5a3 | cc5f9ab971e9a4240a28e42f3eebdff7 | 2,700 | PASSED |
#include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
... | C++ | beae75b649ca6ed26180954faf73e5a3 | 9b615605ef699555804d160f66a9780b | 2,700 | PASSED |
#include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
... | C++ | beae75b649ca6ed26180954faf73e5a3 | 5cd5f1aa21bc526e624d42775488f664 | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t,n,i,root,nr,ok,j,p,ne[104],pa[104],a[104],Max[104],mat[104][104];
void floyd ()
{
for (int k = 1 ; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
if (mat[i][k] && mat[k][j] && (no... | C++ | beae75b649ca6ed26180954faf73e5a3 | 73f748674dc6ecab021679b52b8086c3 | 2,700 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize ("O3", "unroll-all-loops")
#pragma GCC target ("sse4.2")
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
ifstream in;
ofstream out;
co... | C++ | beae75b649ca6ed26180954faf73e5a3 | 41f06698f24926e10c23bed905f7d1c8 | 2,700 | PASSED |
#include <iostream>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
string s;
cin >> s;
int start=0;
int c = 0;
while (n-start>1) {
int flag = 0;
if (s[start]=='('){
c++;
flag=1;
start+=2;
}
else{
for (in... | C++ | af3f3329e249c0a4fa14476626e9c97c | 2d96ca3cca2c9b70e949ad5f2ea64037 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
string s;
bool palindrome(string& s){
for(int i = 0 , j = s.size() - 1; i < j; i++ , j--){
if(s[i] != s[j]) return false;
}
return true;
}
bool valid(string & s){
stack<char> st;
for(int i = 0; i < s.size(); i++){
if(s[i] == '(') st... | C++ | af3f3329e249c0a4fa14476626e9c97c | 6a6b4270791c54f687b07572ad5e3d36 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
string s;
bool palindrome(string& s){
for(int i = 0 , j = s.size() - 1; i <= j; i++ , j--){
if(s[i] != s[j]) return false;
}
return true;
}
bool valid(string & s){
stack<char> st;
for(int i = 0; i < s.size(); i++){
if(s[i] == '(') s... | C++ | af3f3329e249c0a4fa14476626e9c97c | 87c61a062080dd30fe873ac4edef3c22 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define INF ((1<<31)-1)
#define inf (-1<<31)
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PI;
const int mod = 1000000007;
const int N = 5e5 + 10;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
//head
char... | C++ | af3f3329e249c0a4fa14476626e9c97c | d6f0fc5b8cdd817d890f7ecbf10b5a47 | 1,200 | PASSED |
//Hailin Luo
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int t,n;
cin>>t;
string s;
int ct;
while(t--)
{
ct=0;
cin>>n>>s;
int i=0,ft=0;
while( i<n-1)
{
if(s[i]=='(')
{
if(s[i+1]==')'||s[i+1]=='('&&i+1<n)
{
i+=2;
ct++;
}
}
else if(s[i]==')')
... | C++ | af3f3329e249c0a4fa14476626e9c97c | 727780c4e63e2edc0c7f14fe718868e5 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int T,n;
string s;
int main()
{
cin >> T;
while (T--)
{
cin >> n;
cin >> s;
int i = 0, k = 0,j;
while (i < n - 1)
{
if (s[i] == '(') i+=2,k++;
else
{
j = i + 1;
while (j < n && s[j] != ')') j++;
if (j == n) break;//注意：如果没有找到')'，应当break掉
... | C++ | af3f3329e249c0a4fa14476626e9c97c | 3c361d270af64817b947093f80944a38 | 1,200 | PASSED |
#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <set>
#include <queue>
using namespace std;
const int N = 1e6 + 10;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
string s;
cin >> s;
int w = 0;
int s... | C++ | af3f3329e249c0a4fa14476626e9c97c | f6b213257975fea4fdbce9749691eec7 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,a[399999],k;
int main() {
cin>>t;
while(t--){
cin>>n;
string s;
int c=0,l=0;
cin>>s;
for(l=0;l<n-1;c++){
if(s[l]=='('){
l+=2;
}
else{
k=l+1;
while(k<n&&s[k]!=')'){
k++;
}
if(k==n){
break;
}
else{
l=k+1;
... | C++ | af3f3329e249c0a4fa14476626e9c97c | edf31624db76e57545781731ae03f965 | 1,200 | PASSED |
#include <cstdio>
#define N 500100
using namespace std;
char s[N];
int main()
{
int t, n, ans, pre;
scanf("%d", &t);
while (t--)
{
ans = pre = 0;
scanf("%d", &n);
scanf("%s", s);
for (int i = 1; i < n; i++)
{
if (s[pre] == '(')
{
... | C++ | af3f3329e249c0a4fa14476626e9c97c | 7595a377b580203ab2d83ebe437e9fe3 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t, n, ans;
int x(string s){
int p = 0;
while(p < n - 1){
if(s[p] == '(') p += 2, ans++;
else{
int q = p;
p++;
while(p < n && s[p] == '(') p++;
if(p == n){
p = q;
break;
}
p++;
ans++;
}
}
return n - p;
}
int main(){
cin >> t;
whil... | C++ | af3f3329e249c0a4fa14476626e9c97c | e4ddd0f31d82bce7683336d92e217da3 | 1,200 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int x, y;
cin >> x >> y;
if(x == 0 && y == 0)
cout << 0 << endl;
else{
int d = x * x + y * y;
int f = 0;
... | C++ | fce6d690c2790951f7e04c622c3c2d44 | a82c6b510c1aa424462bf570fa626364 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.