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 <iostream>
using namespace std;
int main()
{
long long t, n;
string S;
cin >> t;
while (t--)
{
cin >> n;
cin >> S;
int Q = 0, A = 0;
if (S[n - 1] != 'A')
{
cout << "No" << endl;
}
else
{
int fla... | C++ | c5389b39312ce95936eebdd83f510e40 | 811b5d559f1eee7d0043619dc9c74f9b | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
long long t, n;
string S;
cin >> t;
while (t--)
{
cin >> n;
cin >> S;
int Q = 0, A = 0;
if (S[n - 1] != 'A')
{
cout << "No" << endl;
}
else
{
int flag = 0;... | C++ | c5389b39312ce95936eebdd83f510e40 | ebbf863877bb446495d25a1218f2feb9 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
long long t, n;
string S;
cin >> t;
while (t--)
{
cin >> n;
cin >> S;
int Q = 0, A = 0;
if (S[n - 1] != 'A')
{
cout << "No" << endl;
}
else
{
int flag = 0;... | C++ | c5389b39312ce95936eebdd83f510e40 | 7b0a184b109ba0ae539981e917784ef2 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
long long t, n;
string S;
cin >> t;
while (t--)
{
cin >> n;
cin >> S;
int Q = 0, A = 0;
if (S[S.length() - 1] != 'A')
{
cout << "No" << endl;
}
else
{
int ... | C++ | c5389b39312ce95936eebdd83f510e40 | 5c63c1f39569182eaf667b37e1dc32b1 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void
solve()
{
int n;
cin >> n;
string s;
cin >> s;
if (s[s.length() - 1] == 'Q') {
cout << "no\n";
return;
}
int contq = 0;
int conta = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'Q')
contq++;
... | C++ | c5389b39312ce95936eebdd83f510e40 | 820a4078de6c5fa6fd4fac3263588063 | 800 | PASSED |
#include <bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long
void file(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
file();
int t;cin>>t;
... | C++ | c5389b39312ce95936eebdd83f510e40 | 588aa9ed1e434c65264af92886a2d2be | 800 | PASSED |
#include <iostream>
#include<string.h>
using namespace std;
int main() {
int t;
cin>>t;
int i,j;
while(t--) {
int n;
cin>>n;
string s;
cin>>s;
int c=0;
for(i=0;i<n;i++) {
if(s[i]=='Q') {
c++;
}else ... | C++ | c5389b39312ce95936eebdd83f510e40 | 4f59cacf1219e0c25affdba6072d28c9 | 800 | PASSED |
#include <iostream>
using namespace std;
int main ()
{
int n, m, x, q, y;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
cin >> m;
x = 0;
q = 0;
cin >> s;
for (int j = 0; j < m; j++) {
for (int k = j + 1; k < m; k++) {
... | C++ | c5389b39312ce95936eebdd83f510e40 | 71d1dd5e1984c0b03bb73f0b255baafa | 800 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 15100e231c43329f43492f74dea904c4 | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 90da577e7ac7eb40cf94c78972500c28 | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | e927e2046a8d4b69581a44628ecb43f9 | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | d231ca875a5e58626699be2e12b4f45c | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 4521f63b2f2306367aec2042f1e59808 | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | fb80febf4a755ac49a3753373ffeba8a | 1,500 | 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 endl "\n"
#define ll long long
#define int long long
#define ff first
#define ss ... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 3964e24d37c7876be3df6d2f7abf640b | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, c[100005], mini[2], cnt[2], ans[2], tot[2], nyem;
void solve(){
cin >> n;
for(ll i=1; i<=n; i++) cin >> c[i];
for(ll i=1; i<=n; i++){
ll id = i%2;
if(i <= 2){
tot[id] = c[i];
mini[id] = c[i];
... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | e9281e88ea3db9793a13ed8bb9adb96f | 1,500 | PASSED |
#include <bits/stdc++.h>
#define Heyyy ios_base::sync_with_stdio(0);\
cin.tie(0);\
cout.tie(0);
#define ll long long
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define per(i, a, b) for (ll i = a; i > b; i--)
#define vi vector<int>
#define vii vector<vi>
#define vl vector<ll>
#define vll vec... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 61350df74308e4251de87d27599fa9d3 | 1,500 | PASSED |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ull unsigned long long
#define PII pair<int, int>
#define endl "\n"... | C++ | fe9279aa95148f0887cc7eeb89afbac6 | 604cd5e19133112a4ca9339e50dd5124 | 1,500 | PASSED |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4", "avx")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define ull unsigned long long
#define YES puts("YES")
#define NO puts("NO")
#define Yes puts("Yes")
#define No puts("No")
#define... | C++ | 373412134b2afd00618b19e4bf652d26 | fc3b74eecce1d522fc67f205425541e1 | 2,400 | PASSED |
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("... | C++ | 373412134b2afd00618b19e4bf652d26 | 37eda490f017313e08f4c20b399ea293 | 2,400 | PASSED |
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("... | C++ | 373412134b2afd00618b19e4bf652d26 | 8e184bc88572c2c300e1bb4730da0400 | 2,400 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int MAXN = 5000;
int n, k;
int dp[MAXN][MAXN];
int t[MAXN];
// int sz[MAXN];
vector<int> adj[MAXN];
int mul(int i, int j) { return ... | C++ | 373412134b2afd00618b19e4bf652d26 | 21a4f2c0e280fecce6d2f9e02b4eca41 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
const int inf = 1e9; const ll infll = 1e18;
int n; int k;
int a[5002][5001];
void dfs(int x, vector<vector<int>>& adj_list, vector<vector<int>>& dp, int p) {
int cnt = 0;
for(auto v:adj_list[x]) {
... | C++ | 373412134b2afd00618b19e4bf652d26 | c58e414e7a5a050b7ca2e08b83521648 | 2,400 | PASSED |
#include <algorithm>
#include <cstring>
#include <cstdio>
#define ll long long
#define mod 998244353
inline void read(int& x){
char ch = getchar();
int t = 1;x = 0;
while (ch < '0' || ch > '9') t = (ch == '-' ? -1 : t), ch = getchar();
while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch ... | C++ | 373412134b2afd00618b19e4bf652d26 | 485a2b69875add5d2c31804db53ae5f1 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define REP(u) for(int i=p[u];i!=-1;i=e[i].nxt)
#define PII pair<int,int>
#define ll long long
#define pb push_back
#define PLL pair<ll,ll>
#define fi first
#define se second
#define sz(x) (int)(x.size())
#define rd (rand()<<16^rand())
#define ... | C++ | 373412134b2afd00618b19e4bf652d26 | c2999a28bbcf3bdb9bdb5226efc0af8b | 2,400 | PASSED |
#include<bits/stdc++.h>
/* ordered_set
#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<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define int long long
#define pb push_back
#define fi first
#defin... | C++ | 373412134b2afd00618b19e4bf652d26 | eb68978b0a95edd309693c5c339dc129 | 2,400 | PASSED |
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
const int maxn = 5005;
int h[maxn], e[maxn * 2], ne[maxn * 2], idx;
int sz[maxn];
int n, k;
template<const int T>
struct ModInt {
const static int mod = T;
int x;
ModInt(int x = 0) : x(x % mod) {}... | C++ | 373412134b2afd00618b19e4bf652d26 | cc7ebda22c5c1008a1c9ad6cf83438a5 | 2,400 | PASSED |
#include<iostream>
using namespace std;
const int mod=998244353;
int n,k,dp[5005][5005],head[10005],tot,sum[5005][5005],tmp[5005];
struct node
{
int y,nex;
}s[10005];
void add(int i,int j)
{
s[++tot].y=j,s[tot].nex=head[i];
head[i]=tot;
}
int query(int now){return (now<0?k+1:now);}
void dfs(int now,int... | C++ | 373412134b2afd00618b19e4bf652d26 | 3439a2ffebb3eb5956e6d6d353e16dc6 | 2,400 | PASSED |
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <array>
#include... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | 2ac5ebde6d451754820e36660d3edbce | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e7 + 13;
int main() {
vector<int> mind(N, -1), val(N);
mind[1] = 1;
for (int i = 2; i < N; ++i) if (mind[i] == -1)
for (int j = i; j < N; j += i) if (mind[j] == -1)
mind[j] = i;
for (int i = 2; i < N; ++i) {
int j = i / m... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | 3b84a3cbd9180a8f06235457b9682404 | 2,100 | PASSED |
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <array>
#include... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | 38914068a4c7bda66ce1a011bf8c8b98 | 2,100 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int mxN = 2e7+7;
int c, d, x;
int64_t cnt[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
for(int i=2; i<mxN; ++i) {
if(cnt[i] == 0) {
for(int j=i; j<mxN; j+=i) {
++cnt[j];
}
... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | 08fec67ee63c940fc9f96f30e3f20503 | 2,100 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 69
#endif
const int N = 20000002;
int cnt[N];
int32_t main() {
std::cin.tie(0)->sync_with_stdio(0);
std::cin.exceptions(std::cin.failbit);
int tt = 1;
std::cin >> tt;
for (int i = 2; i < ... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | c3cd596fab8082c1342707acbafac819 | 2,100 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 69
#endif
const int N = 20000002;
int leastFac[N + 1];
int mobius[N + 1];
std::vector<int> prime;
void sieve() {
mobius[1] = 1;
for (int i = 2; i <= N; ++i) {
if (leastFac[i] == 0) {
... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | ffc636aa8040dee33878c35277dae34e | 2,100 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define ll long long int
#define pb push_back
#define mod 1000000007
#define inarr(i,arr,n); for(ll i=0;i<n;i++) cin >> arr[i];
#define outarr(i,arr,... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | f4feb1d881c3802abf52804bd221a790 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#define _USE_MATH_DEFINES
#ifdef DEBUG
#include "debug.h"
#endif
#define lsb(x) ((x)&(-x))
#define siz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define setprec(x) cout << fixed << showpoint << setprecision(x);
typedef long double ... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | bfce154ff7f5340c09a41027724d0397 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#define _USE_MATH_DEFINES
#ifdef DEBUG
#include "debug.h"
#endif
#define lsb(x) ((x)&(-x))
#define siz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define setprec(x) cout << fixed << showpoint << setprecision(x);
typedef long double ... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | b20badb7a713aedb5668f3e5fbe470a5 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
template <class T> vector<T> create(size_t size, T initialValue) { return vector<T>(size, initialValue); }
template <class T, class... Args> auto create(size_t head, Args&&... tail) { auto inner = create<T>(tail...); return vector<decltype(inner)>(... | C++ | 2b611e202c931d50d8a260b2b45d4cd7 | 56423b4bce973a0f9c16c558f1ee001c | 2,100 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long ll;
template <class T> void chmax(T &x,T y) {x=x>y?x:y;}
template <class T> void chmin(T &x,T y) {x=x<y?x:y;... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | 1f91c2cb8036ec5dc95041463087ad89 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
signed main(){
int t;
cin>>t;
while(t--){
string s;
cin>>s;
vector<int> v;
bool flag=true;
int sum=0;
for(int i=0;i<s.size();i++){
if(s[i]=='0'){
v.push_back(i);
... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | a9946cd961642f533da529054a53db8e | 1,000 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | db41bfe2e81f9c0bbbca30ccb22c232a | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define forr(i,a,n) for(int i=a;i<n;i++)
#define rep(i,n) forr(i,0,n)
#define repp(i,n) forr(i,1,n+1)
#define foreach(it,t) for(__typeof(t) it=t.begin();it!=t.end();it++)
#define pb push_back
#define mp... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | e04dd4d60d837013601de1b47df2bce5 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, now=0;
cin >> n;
string a[n];
for(int k=0; k<n; k++){
cin >> a[k];
a[k] += " ";
bool f=0, out=1;
for(int i=0; i<a[k].size(); i++){
if(a[k][i]==' ') break;
if(f&&a[k][i]=='0' && a[k][i+1]=='0'){
cout << "NO\n";
out... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | d23dc8090a368076c7df33694915f4fa | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while (t--)
{
string a;
int ones=-1e9,zeros=-1e9;
cin>>a;
for (int i=0;i<a.size()-1;i++)
{
if (a[i]=='1'&&a[i+1]=='1'&&ones==-1e9)
{
ones=i;
}
if (a[i]=='0'&&a[i+1]=='0')
{
zeros=i;
}
... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | 4a29845a77bb9e186ca50348f0f22d36 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string s;
bool p=0,q=0;
int i=1;
cin>>s;
for(;i<s.size();i++)
if(s[i]=='1'&&s[i-1]=='1'){
p=1;
break;
}
for(;i<s.size();i++)
if(p==1&&s[i]=='0'&&s[i-1]=='0'){
q=1;
cout<<"NO"<<en... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | aad01235adf64d7d47f49ade49971384 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define N 1005
#define M 5001
#define R register
#define INFI 0x7fffffff
#define INFL 0x7fffffffffffffff
#define F(i,start,end) for(R int (i)=(start);(i)<=(end);i++)
#define T(i,end,start) for(R int (i)=(start);(i)>=(end);i--)
using namespace std;
template<typename T> void read(T &x)
{... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | 3e25f542c5c5b400c8d2ba4b6e555e86 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
string s;
cin>>s;
bool f0=0,f1=0,chk=0;
for(int i=0;i<s.size();i++){
if(s[i]=='0') f0=1;
else f1=1;
}
if((f0)+(f1)<=1) chk=1;
for(int i=0;i<s.size();i++){
int lst=-2;
bool f=1;
for(int j=0;j<=i;j++){
if(... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | 64a3c08d7c6efcde3d3b2e9dab6757ba | 1,000 | PASSED |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pi pair<int,int>
#define rep(i,c,n) for(int i=c;i<n;i++)
#define rtp(i,c,n) for(int i=c;i<c+n;i++)
#define forn(i,n) for(int i=0;i<n;i++)
#define fore(i,n) for(int i=1;i<=n;i++)
#define mp make_pair
#defin... | C++ | 357dcc8fb7783d878cd2c4ed34eb437e | bb3e20a5ffb44575e14f1e2e3a7d83e4 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 1010;
const int mod = 998244353;
char x[NN], y[NN];
INT dp[NN][NN][2], c1[NN], c2[NN];
INT add(INT p, INT d){
return (p + d)%mod;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", s... | C++ | 51406f6578e8de38100c6af082bfb05e | 6c652c4acd26f72c0270333019e35cc4 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define NN 1100
#define INT long long
#define mod 998244353
using namespace std;
char a[NN],b[NN];
int x[NN],y[NN];
INT dp[NN][NN][5];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
scanf("%s%s",a+1,b+1);
int n = strlen(a+1);
int m = strlen(b+1);
for(in... | C++ | 51406f6578e8de38100c6af082bfb05e | b576161710261e0ba6d1714fedae8e3c | 2,400 | PASSED |
#include<bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 1010;
int A[NN],B[NN];
char str[NN];
char x[NN];
int pre[NN][NN];
int ans[NN];
const int mod = 998244353;
int dp[NN][NN][2];
char y[NN];
int tar[NN];
int pos[NN];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin... | C++ | 51406f6578e8de38100c6af082bfb05e | 29535f673e29b97da5178931653f9dd8 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define debug(X) { auto _X = (X); cout << "L" << __LINE__ << ": " << #X << " = " << (_X) << endl; }
#define pr(A, a, b) { cout << "L" << __LINE__ << ": " << #A << " = "; for(int i = (a); i <= (b); i ++) cout << A[i] << ' '; cout << endl; }
#define enter {cout << endl;}
using namespace std;
... | C++ | 51406f6578e8de38100c6af082bfb05e | e2f3a7948220756db5ae490243d23824 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 2020;
const int mod = 998244353;
int A[NN], B[NN];
char s[NN], c[NN];
int dp[NN][NN][2];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
scanf("%s", s + 1);
scanf("%s", c + 1);
int n... | C++ | 51406f6578e8de38100c6af082bfb05e | c2aa1512224bc8535f091b07dbd89f70 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define NN 1100
using namespace std;
using INT=long long;
const int mod = 998244353;
int dp[NN][NN][2];
int nxta[NN], nxtb[NN];
char a[NN], b[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
scanf("%s", a + 1);
s... | C++ | 51406f6578e8de38100c6af082bfb05e | 8e0e9cff81d4b0c22968897a3909964b | 2,400 | PASSED |
#include<bits/stdc++.h>
#define NN 1100
using namespace std;
using INT=long long;
const int mod = 998244353;
int dp[NN][NN][2];
char a[NN], b[NN];
int nxt[NN][2];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
cin >> (a + 1);
cin >> (b + 1);
int n = strl... | C++ | 51406f6578e8de38100c6af082bfb05e | 53e14718bb240eb09372cd48500aa130 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define NN 1100
using namespace std;
using INT=long long;
const int mod = 998244353;
int dp[NN][NN][2];
char a[NN], b[NN];
int nxt[NN][2];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
cin >> (a + 1);
cin >> (b + 1);
int n = strl... | C++ | 51406f6578e8de38100c6af082bfb05e | be7c07ff303327c040cd2d9f4c3d29ec | 2,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define INT_MAX INT64_MAX
#define INT_MIN INT64_MIN
#define ll long long
#define PI 3.14159265358979323846
#define CLK clock_t clk = clock();//Start of main
#define OCLK cerr << "Time (in ms): " << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << '\n';//End of m... | C++ | 51406f6578e8de38100c6af082bfb05e | befd95d6bf7f2bf49ebfdb67f41cb0c3 | 2,400 | PASSED |
#include <bits/stdc++.h>
//#define int long long
//#define INT_MAX INT64_MAX
//#define INT_MIN INT64_MIN
#define ll long long
#define PI 3.14159265358979323846
#define CLK clock_t clk = clock();//Start of main
#define OCLK cerr << "Time (in ms): " << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << '\n';//En... | C++ | 51406f6578e8de38100c6af082bfb05e | 303631dce935ca83641f7814e41729a3 | 2,400 | PASSED |
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
#define endl '\n'
#define pb push_back
#define mp ma... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 9b8e2b0f37123ad4e882af1e7d0d1005 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
lli t, n, x, y, w, b, i, j;
cin >> t;
while (t--){
cin >> n >> x >> y;
cin >> w >> b;
lli minw = min(x, y);
lli sisaw = max(x, y)-minw;
sisaw /= 2;
lli minb = min(n-x, n-y);
lli sisab = max(n-x, n-y)-minb... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 6cd2d21c7306b4355be7199c6e735b72 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define llu unsigned long long int
#define FOR(i, t) for(int i = 0; i < (t); i++)
using namespace std;
//
void solve(){
int n, k1, k2, w, b;
cin >> n >> k1 >> k2;
cin >> w >> b;
int cntW = min(k1, k2) + (max(k1,k2) - min(k1, k2)) / 2;
int cntB = min(n-k1, n-k2) +... | C++ | 26354d2628f26eb2eff9432bd46400d5 | c01c6eefaa7782726fbe02f5bc5a8442 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define int long long
#define lb(x) x&(-x)
#define pi acos(-1)
using namespace std;
const int maxn = 1e6+10;
const int mod = 1e17+7;
int t,n,m,x,y,z,l,r,k,ans;
int a[maxn],sum[maxn];
signed main()
{
IOS;
... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 10b7b3a1bb6cc6ce491a9fbbede16a23 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,k1,k2;
cin>>n>>k1>>k2;
int w,b;
cin>>w>>b;
int w1,b1;
w1=k1+k2;
b1=2*n-w1;
if(w1/2 >= w&&b1/2 >= b)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
| C++ | 26354d2628f26eb2eff9432bd46400d5 | e5fb59b1f2d9b514deb913d1912d1593 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n,k1,k2,k3,k4;
cin>>n>>k1>>k2;
k3=n-k1;
k4=n-k2;
int x,y;
cin>>x>>y;
int w=(k1/2)+(k2/2);
if(k1%2 && k2%2)w++;
int b=(k3/2)+(k4/2);
if(k3%2 &... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 55b5e5a067a9b62d1f14409c82802735 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int test;
cin>>test;
while(test--){
int w, b, k1, k2, n;
cin>>n>>k1>>k2>>w>>b;
if(w*2 <= k1 + k2&&b*2 <= n * 2 - k1 - k2)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
| C++ | 26354d2628f26eb2eff9432bd46400d5 | 9f93bbe4a371b04753e2d4a84cf87847 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int N=200010;
int t,n,k,kk,a,b;
int main()
{
cin>>t;
while(t--)
{
int aa=0,bb=0;
cin>>n>>k>>kk;
cin>>a>>b;
if(abs(k-kk)%2==0) aa=(k+kk)/2,bb=n-aa;
else aa=k/2+kk/2,bb=n-aa-1;
if(aa>=a&&bb>=b) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 0c6241ff624c7a4ffe76e7a24d8e661f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef double dl;
#define endl "\n"
#define Y cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define sp " "
#define PB push_back
#define F first... | C++ | 26354d2628f26eb2eff9432bd46400d5 | d8035b1fbbb1144367cff620dcb43d1e | 800 | PASSED |
#include <iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int t,n,w,b,k1,k2;
scanf("%d",&t);
while(t--)
{
cin>>n>>k1>>k2>>w>>b;
int l1=n-k1;
int l2=n-k2;
int num_1=min(k1,k2)+(max(k1,k2)-min(k1,k2))/2;
int num_2=mi... | C++ | 26354d2628f26eb2eff9432bd46400d5 | 6f92019d6ba2a319eb7140ca74f8c1b3 | 800 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=400005,P=998244353;
int n1,n2,m,q,w=1,ans,col[N],fa[N],val[N],sum[N][2];
void Inc(int&x,int y){
if((x+=y)>=P) x-=P;
}
void Dec(int&x,int y){
if((x-=y)<0) x... | C++ | 263184829929376c974451f123dfe0b6 | d80b85b3022d268295c48b93459a7335 | 3,100 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=400005,P=998244353;
int n1,n2,m,q,w=1,ans,col[N],fa[N],val[N],sum[N][2];
void Inc(int&x,int y){
if((x+=y)>=P) x-=P;
}
void Dec(int&x,int y){
if((x-=y)<0) x... | C++ | 263184829929376c974451f123dfe0b6 | 5e9af0ae9b1223af744fbe2790c9da3f | 3,100 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=400005,P=998244353;
int n1,n2,m,q,w=1,ans,col[N],fa[N],val[N],sum[N][2];
void Inc(int&x,int y){
if((x+=y)>=P) x-=P;
}
void Dec(int&x,int y){
if((x-=y)<0) x... | C++ | 263184829929376c974451f123dfe0b6 | cc07c9af0eab177f3e2de69f257c144f | 3,100 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=400005,P=998244353;
int n1,n2,m,q,w=1,ans,col[N],fa[N],val[N],sum[N][2];
void Inc(int&x,int y){
if((x+=y)>=P) x-=P;
}
void Dec(int&x,int y){
if((x-=y)<0) x... | C++ | 263184829929376c974451f123dfe0b6 | 6af19abaca30b3e864eb79a14c44fe2c | 3,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))... | C++ | 263184829929376c974451f123dfe0b6 | cc1c0f924207a46aaf609b4aa18944f7 | 3,100 | PASSED |
// Retired?
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = long unsigned long;
using ld = double long;
#ifdef LOCAL
const int N = 45;
#else
const int N = 400005;
#endif
template<int m>
struct modint {
unsigned x;
modint() : x(0) {}
modint(long long arg... | C++ | 263184829929376c974451f123dfe0b6 | 4d120a7c3d712971822bb99b9e390ef2 | 3,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
struct node{
node *succ[2];
bool flag;
int id[2],head;
int val[2];
} vett[1000005];
node* cont=vett;
node* getnode(int x){
node *tmp=cont;
tmp->flag=false;
tmp->id[0]=tmp->id[1]=-1;
tmp->head=x;
tmp->val[0]=tmp->val[1]=0;
tmp->succ[0]=tmp->succ[1... | C++ | 263184829929376c974451f123dfe0b6 | ffd43cefb1a3ea34b916917d4285b05c | 3,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
struct node{
node *succ[2];
bool flag;
int id[2],head;
int val[2];
} vett[1000005];
node* cont=vett;
node* getnode(int x){
node *tmp=cont;
tmp->flag=false;
tmp->id[0]=tmp->id[1]=-1;
tmp->head=x;
tmp->val[0]=tmp->val[1]=0;
tmp->succ[0]=tmp->succ[1... | C++ | 263184829929376c974451f123dfe0b6 | b3e671900c243d6806f1dccd81379914 | 3,100 | PASSED |
/*
在那理想的彼岸，
等待着我们所希冀的勇气。
在拥有了它的瞬间，
便能看见梦境的终结。
*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define debug(...) fprintf (stderr, __VA_ARGS__)
#define fi first
#define se sefaild
#define lep(i, l, r) for (int i = (l), i##_end = (r); i <= i##_end; ++ i)
#define rep(i, r, l) for (i... | C++ | 263184829929376c974451f123dfe0b6 | 16c50809b87cbb08f6bbc0a0ab422685 | 3,100 | PASSED |
/*
在那理想的彼岸，
等待着我们所希冀的勇气。
在拥有了它的瞬间，
便能看见梦境的终结。
*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define debug(...) fprintf (stderr, __VA_ARGS__)
#define fi first
#define se sefaild
#define lep(i, l, r) for (int i = (l), i##_end = (r); i <= i##_end; ++ i)
#define rep(i, r, l) for (i... | C++ | 263184829929376c974451f123dfe0b6 | 6767e1fe0353288199926c94488491f9 | 3,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(s) int(s.size())
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
int main ()
{
FIO
int n;
cin >> n;
ll s[n+3];
for(int i = 0; i< n; i++)
cin >> s[i];
priority_queue<int, vector<int>, greater<int>> pq;
... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | a2383bc28cb5871ce521be3bfb14b9e2 | 1,600 | PASSED |
#include <iostream>
#include <queue>
using namespace std;
#define Fast ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int main() {
Fast
long long sum = 0,value;
int n, cnt = 0;
cin >> n;
// Largest Negative Value In Top
//Sort From Small Value To Large Value
priority_queue<long... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | 3dc13d34f9ba302d85b4c7bf113f1362 | 1,600 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define Menna ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int main()
{
Menna
int n,cnt=0;
cin>>n;
long long x,sum=0;
priority_queue<long long,vector<long long>,greater<long long>>p;
for(int i=0;i<n;i++){
cin>>x;
sum+=x;
... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | c891d4ad661fa6a4dd5c942f65e9b4f3 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, sum = 0, ans = 0;
cin >> n;
priority_queue<long long,vector<long long>,greater <>>pq;
for(int i = 0; i < n; i++)
{
long long x; cin >> x;
if(sum+x>=0){
sum+=x;
ans++;
pq.push... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | 9bded8e40001564cf3ddb0edd6dcec18 | 1,600 | PASSED |
// Problem: C2. Potions (Hard Version)
// Contest: Codeforces - Codeforces Round #723 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1526/C2
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | b7e71a89fe34a813f6cdd45c07777573 | 1,600 | PASSED |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
long long x,sum=0,max=0;
priority_queue<int> pq;
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
for(int i=0;i<n;i++)
{
sum+=arr[i];
max++;
if(arr[i]<0)
... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | f1b230f4d2b448faf861acb9d4479fff | 1,600 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include<iomanip>
#include <cmath>
#include <algorithm>
using namespace std;
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define T int eee; cin >> eee; while(eee--)
int main() {
speed
int n;
cin>>n;
long long h = 0 , ans = 0;
int a... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | 96b8cca5d3088aa3567826d5cddbc3b7 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define sep ' '
#define endl '\n'
#define Y ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int main() {
Y
int n,x; cin>>n;
priority_queue<int,vector<int>,greater<>>pq; // min top
ll health = 0, cnt = 0;
for (int i = 0; i < n; +... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | fa73cb0d16971d489417bde337a7e95a | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long int n;
void solve()
{
//cout << "Allahu Akbar" << endl;
cin >> n;
priority_queue<long long, vector<long long>, greater<long long> > pq;
long long S = 0;
for(int i = 1;i <= n;i++){
long long x; cin >> x;
S += x;
pq.push(x);
while(S < 0){
... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | 7faad425bbc968e1d31fc4e070320689 | 1,600 | PASSED |
#include<iostream>
#include <array>
#include <algorithm>
#include <cmath>
#include <vector>
#include <utility>
#include <iomanip>
#include <stack>
#include <deque>
#include<cstdio>
#include <queue>
#include<cstring>
#include <set>
#include <map>
#include <unordered_map>
using namespace std;
#define SIZE 200005
#define ... | C++ | b4a4448af5b61fe5a8467a8d0e12fba8 | 9d576c3a26336fb17ad5a86b2cd08a0f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, ... | C++ | affef141c51bbfd881a90d49ec34ceea | ad8fbbf728487f816863f277bfa28e36 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, ... | C++ | affef141c51bbfd881a90d49ec34ceea | 4f2f2c13f9fe43f132f3dd4ef84ed9a2 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, ... | C++ | affef141c51bbfd881a90d49ec34ceea | 8b22434d7577d3fdc4de52754c43c133 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void heapify(int i, long long int a[], int n)
{
int lc = 2 * i + 1;
int rc = 2 * i + 2;
int maxm = i;
if (lc < n && a[maxm] < a[lc])
{
maxm = lc;
}
if (rc < n && a[maxm] < a[rc])
{
maxm = rc;
}
if (maxm ... | C++ | affef141c51bbfd881a90d49ec34ceea | cf4abc9452115d6d3fe8e3811928c4d8 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void inserted(long long int *a,int n){
int i=n;
long long int temp=a[i];
while(i>0 && temp<a[(i-1)/2]){
a[i]=a[(i-1)/2];
i=(i-1)/2;
}
a[i]=temp;
}
long long int deleted(long long int *a,int n){
... | C++ | affef141c51bbfd881a90d49ec34ceea | c62675f3423a991774118195d4291339 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void inserted(long long int *a,int n){
int i=n;
long long int temp=a[i];
while(i>0 && temp>a[(i-1)/2]){
a[i]=a[(i-1)/2];
i=(i-1)/2;
}
a[i]=temp;
}
long long int deleted(long long int *a,int n){
... | C++ | affef141c51bbfd881a90d49ec34ceea | e9fec8a304493da4dcad49214ab6fb0c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void inserted(long long int *a,int n){
int i=n;
long long int temp=a[i];
while(i>=1 && temp>=a[(i-1)/2]){
a[i]=a[(i-1)/2];
i=(i-1)/2;
}
a[i]=temp;
}
long long int deleted(long long int *a,int n){
... | C++ | affef141c51bbfd881a90d49ec34ceea | 8280669e49c769fd177e6ebd435b8bc7 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int n;
cin>>n;
long long int *a=new long long int[n];
long long int sum=0;
priority_queue<long long int,vector<long ... | C++ | affef141c51bbfd881a90d49ec34ceea | 146ad4ee0850a156fa845c04f483063a | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
long long int *a=new long long int[n];
long long int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
... | C++ | affef141c51bbfd881a90d49ec34ceea | 06fe2d00d54f117997c11543d7846c98 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N=1e6,M=1e4;
long long minn=1e18,mux=-1e18;
map<int,int>mp,np;
int dp[2002][2002],a[N];
main(){
int n;
cin>>n;
for(int i=0; i<=n; i++)
for(int j=0; j<=n; j... | C++ | affef141c51bbfd881a90d49ec34ceea | 433f4483e2f2112b7d144c3f62fedc14 | 1,500 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
//#include <bits/stdc++.h>
//#include <iostream>
//#include <algorithm>
#define ull unsigned long long
#define ll long long
using namespace std;
void fast() {
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(0);
}
void primeFactors(map<ll,ll>&m... | C++ | e5e937f080b20eaec5f12f1784ae6427 | a3521ffb3fbe086a77755fe3c2cec75c | 1,400 | PASSED |
/*
Author:TesikBas_
For:EDU(ZF)(Codeforces)
*/
#include <bits/stdc++.h>
#define forn(i,l,r,x) for(int i=(l);i<=(r);i+=x)
#define forr(i,l,r,x) for(int i=(l);i>=(r);i-=x)
#define pb push_back
#define pf push_front
#define ll long long
#define all(x) x.begin(),x.end()
#define sr(a) sort(a+1,a+n+1)
#define ins ins... | C++ | e5e937f080b20eaec5f12f1784ae6427 | 5d1d2d58679fbb8601200a7cc0d926e6 | 1,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.