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>
#include<algorithm>
#include<vector>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<climits>
#include<stack>
#include<queue>
#include<stack>
#include<bitset>
#include<utility>
#include<cctype>
#include<cstring>
#include<cassert>
#define LL long long
#define mp make_pair
#defi... | C++ | a67ea891cd6084ceeaace8894cf18e60 | ea5680591717002282e4bcc85cc9ce7c | 1,600 | PASSED |
#include <iostream>
#include <string>
using namespace std;
void swap(int &a,int &b){
int temp;
temp=a;
a=b;
b=temp;
}
int main(){
int n;
cin>>n;
int i;
int* p=new int[n];
for(i=0;i<n;i++)
cin>>p[i];
string* A=new string[n];
for(i=0;i<n;i++)
cin>>A[i];
bo... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 22b93604ce8ac637cfcb2e2547b1f678 | 1,600 | PASSED |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<functional>
#include<numeric>
#include<string.h>
#include<cstring>
#include<string>
#include<vector>
#include<complex>
#include<sstream>
#include<iterator>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<list>
#include<queue>
#includ... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 446523a768f6074c45e7fc0a412e3593 | 1,600 | PASSED |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<functional>
#include<numeric>
#include<string.h>
#include<cstring>
#include<string>
#include<vector>
#include<complex>
#include<sstream>
#include<iterator>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<list>
#include<queue>
#includ... | C++ | a67ea891cd6084ceeaace8894cf18e60 | a54bd0efcf7e1ad1196edf01114ea0d0 | 1,600 | PASSED |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<functional>
#include<numeric>
#include<string.h>
#include<cstring>
#include<string>
#include<vector>
#include<complex>
#include<sstream>
#include<iterator>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<list>
#include<queue>
#includ... | C++ | a67ea891cd6084ceeaace8894cf18e60 | ca8afa42735a9c53cdb717bc61f1f0fc | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,a[333];
string s[333];
int f[333];
int ff(int x){return x==f[x]?x:f[x]=ff(f[x]);}
int main(){
cin >> n;
for(int i=0;i<n;++i){cin >> a[i];f[i]=i;}
for(int i=0;i<n;++i)
{ cin >> s[i];
for(int j=0;j<i;++j)
if(s[i... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 697fc89eda6e35838e73d6fc71bd9d8f | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,a[333];
string s;
int f[333];
int ff(int x){return x==f[x]?x:f[x]=ff(f[x]);}
int main(){
cin >> n;
for(int i=0;i<n;++i){cin >> a[i];f[i]=i;}
for(int i=0;i<n;++i)
{ cin >> s;
for(int j=0;j<i;++j)
if(s[j]=='1')f... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 47444dd7409b4261ebdd0cd2172b4fa9 | 1,600 | PASSED |
#include<cstdio>
#include<string>
#include<algorithm>
#include<iostream>
using namespace std;
int s[302],a[302];
int fint(int x)
{
if(s[x]==x) return x;
s[x]=fint(s[x]);
return s[x];
}
int main()
{
int n,i,j;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
{scanf("%d",&a[i])... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 716620138f3aa3fdfc61646b67722058 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,a[333];
string s[333];
int f[333];
int ff(int x){return x==f[x]?x:f[x]=ff(f[x]);}
int main(){
cin >> n;
for(int i=0;i<n;++i){cin >> a[i];f[i]=i;}
for(int i=0;i<n;++i)cin >> s[i];
for(int i=0;i<n;++i)
for(int j=0;j<i;++j)
if(s[i][j]==... | C++ | a67ea891cd6084ceeaace8894cf18e60 | 47b2b4e2f20cde83a11ef718c653c347 | 1,600 | PASSED |
#include<bits/stdc++.h>
int main(){
int n,c=0,j=0,i,k;
int a[10000];
int h[100000];
int prime[168]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 0054c078066cedfb73f571fd5baa3892 | 1,500 | PASSED |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<set>
using namespace std;
int b[2000];
int main()
{
set<int>q;
set<int>::iterator it;
int k,i,j,n;
scanf("%d",&n);
if(n==1)
printf("0\n");
else if(n<=4)
{
printf("%d\n",n-1);
for(i=2;i<=n;i++)
printf("%d ",i);
}
else
{
q.insert(2);
... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 395616855a7f5a6d32f849fa204f163b | 1,500 | PASSED |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
vector<int> Ans;
inline bool check(const int x)
{
int temp=(int)sqrt(x);
for(int i=2;i<=temp;++i)
if(x%i==0)return false;
return true;
}
int main()
{
int n;
cin >> n;
for(int i=2;i<=n... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | cce20202f2e55c8a2b5cf169cd772a89 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int p[1004]={0} ;
int main(){
long long int n ;
long long int i,j,temp;
cin>>n;
vector<int> a;
a.clear() ;
for(i=0;i<=1000;i++)
p[i]=1;
for(i=2;i<=1000;i++){
if(p[i]==0)
continue ;
for(j=(2*i);j<=1000;j+=i)
... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 0aa9467759b83efb8058449901b47d82 | 1,500 | PASSED |
using namespace std;
#include<bits/stdc++.h>
typedef long long ll;
typedef pair<ll,ll> pii;
typedef vector< pii > vpii;
typedef vector<long long> vi;
typedef map<string,ll> msi;
typedef map<ll,ll> mii;
///Print
#define P(a) printf("%lld",a)
#define PP(a,b) printf("%lld %lld",a,b)
#define PPP (a,b,c) ... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | a57400a209365df0f7f57d718a7abe0e | 1,500 | PASSED |
//============================================================================
// Name : ACMM.cpp
// Author : GhofranAbdelwahab
// Version :
// Copyright : BrainTuck
// Description : Hello World in C++, Ansi-style
//============================================================================
#include... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | ed5676a5906ecf3c7e52fc5cfaaf4c35 | 1,500 | PASSED |
# include <bits/stdc++.h>
using namespace std;
vector <int> primo;
int crivo (int i) {
int ult = primo.size() - 1, flag = 0;
if ( i <= ult )
return(primo[i]);
for (int k = primo[ult] + 2; ; k += 2) {
flag = 0;
for (int j = 1; j <= ult && !flag; j++) {
if ( !(k % primo[... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 1cb2d6aa28717e1755ce1aab2bcc9006 | 1,500 | PASSED |
# include <bits/stdc++.h>
using namespace std;
vector <int> primo;
int crivo (int i) {
int ult = primo.size() - 1, flag = 0;
if ( i <= ult )
return(primo[i]);
for (int k = primo[ult] + 2; ; k += 2) {
flag = 0;
for (int j = 1; j <= ult && !flag; j++) {
if ( !(k % pri... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 7be86f50861cf8ebd00f4e6036703a85 | 1,500 | PASSED |
# include <bits/stdc++.h>
using namespace std;
vector <int> primo;
int crivo (int i) {
int ult = primo.size() - 1, flag = 0;
if ( i <= ult )
return(primo[i]);
for (int k = primo[ult] + 2; ; k += 2) {
flag = 0;
for (int j = 1; j <= ult && !flag; j++) {
if ( !(k % primo[... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 8ba005c16ee5961e7715647cbdcc1d49 | 1,500 | PASSED |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <map>
#include <cmath>
#include <cstdlib>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <climits>
#include <cct... | C++ | 7f61b1d0e8294db74d33a6b6696989ad | 38fcccb85fa3e957c7b8bd3da7569a94 | 1,500 | PASSED |
#include <iostream>
#include <climits>
using namespace std;
int main()
{
int n; cin >>n;
int Min = INT_MAX;
int Max = INT_MIN;
int g,xMin,xMax;
for (int i=0; i<n; ++i)
{
cin >>g;
if (g<=Min) { Min = g; xMin = i; }
if (g>Max) { Max = g; xMax = i; }
}
// cout <<"xMin: "<<... | C++ | ef9ff63d225811868e786e800ce49c92 | 40c799352d4094664e670deba91b9473 | 800 | PASSED |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#define MAX(a,b) ((a) > (b) ? (a) : (b))
using namespace std;
int main(void)
{
int n, arr[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int max = 0, min = 0, sec = 0;
for (int ... | C++ | ef9ff63d225811868e786e800ce49c92 | e10d11691a5a8d685f6038b9755887cb | 800 | PASSED |
#include<iostream>
#include<string>
#include<cstdlib>
#include<iomanip>
using namespace std;
int main() {
int n;
cin>>n;
int max1=0;
int max2=1000000;
int min1 = max2;
int maxi=0;
int mini=0;
int a[n+1];
int i;
for(i=1; i <= n; i++){
cin >> a[i];
max1 = max(max1,a[i]);
min1 = min(min1,a[i])... | C++ | ef9ff63d225811868e786e800ce49c92 | 9a005c54e4f6719a9972869bd0501da6 | 800 | PASSED |
#include<iostream>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<cstdio>
using namespace std;
int main(){
int n,num[100000],i,min=101,max=0,locmin,locmax;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
if(num[i]<=min)
{
min=num[i];
locmin=i;
... | C++ | ef9ff63d225811868e786e800ce49c92 | 3dcafe88610f3ba656659a62c9830670 | 800 | PASSED |
#include<iostream>
int n,i,p,q=99,x,a,b;main(){for(std::cin>>n;i++<n;)std::cin>>x,x>p?p=x,b=i:0,x<=q?q=x,a=i:0;std::cout<<b+n-a-1-(b>a);}
| C++ | ef9ff63d225811868e786e800ce49c92 | 73c50b55bc4208e5122658e860efd30a | 800 | PASSED |
#include<stdio.h>
int main()
{
int n,a[101],i,s,S,l,L;
scanf("%d",&n);
scanf("%d",&a[0]);
S=a[0];L=a[0];s=0;l=0;
for(i=1;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]>L)
{L=a[i];l=i;}
if(a[i]<=S)
{S=a[i];s=i;}
}
i=l+n-s-1;
if(s<=l)
i--;
printf(... | C++ | ef9ff63d225811868e786e800ce49c92 | 917510fbc1f13b51735968e16ce63da8 | 800 | PASSED |
#include <stdio.h>
int main(void){
int n;
int i;
int a[200];
int min,max;
int p=0,q=0;
scanf("%d",&n);
scanf("%d",&a[0]);
min=a[0];
max=a[0];
for (i=1; i<n; i++){
scanf("%d",&a[i]);
if (a[i]>max){
max=a[i];
p=i;
}
if (a[i]<=min){
min=a[i];
q=i;
}
}
if (q>p)
printf("%d",n-q+p-1);
el... | C++ | ef9ff63d225811868e786e800ce49c92 | 1e3d8c0395e069c8ff6769af2d7230f5 | 800 | PASSED |
#include<iostream>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int a[100];
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int min=101,minn,max=0,maxn;
int min2=101,minn2,max2=0,maxn2;
for(int i=0;i<n;i++)
{
if(a[i]<=min)
{
min=a[i];
... | C++ | ef9ff63d225811868e786e800ce49c92 | 363f7621630b8d5abab9df7cdef054bd | 800 | PASSED |
#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int n,i;
int max,min;
int pomax,pomin;
int sum;
int a[102];
scanf("%d",&n);
max=0;
min=101;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]); ... | C++ | ef9ff63d225811868e786e800ce49c92 | 4c0c52364a99653ebb2ebde6cee11e92 | 800 | PASSED |
#include <stdio.h>
int main(void)
{
int n, f[105];
int min, max, pmin, pmax, count;
scanf("%d", &n);
scanf("%d", &f[0]);
min = max = f[0];
pmin = pmax = 0;
for (int i = 1; i < n; ++i)
{
scanf("%d", &f[i]);
if (f[i] > max) { max = f[i], pmax = i; }
if (f[i] <= min) { min = f[i], pmin = i; }
}
if (pmax... | C++ | ef9ff63d225811868e786e800ce49c92 | bf68be0253acdc0e32df1f8d1c8c0f1c | 800 | PASSED |
// Code by KSkun, 2018/5
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <functional>
#inc... | C++ | 711896281f4beff55a8826771eeccb81 | eb9b2b1dd2a264f7cb278560b5f4f61b | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<vector>
#define maxn 100007
using namespace std;
int n;
vector<int>v[maxn];
int d[maxn];
int s[maxn];
void dfs(int x)
{
s[x]=1;
for(int i=0;i<v[x].size();i++)
{
int y=v[x][i];
if(d[y]==0)
{
d[y]=d[x]+1;
dfs(y);
s[x]+=s[y];
}
}
return;
}
int find(int x)
... | C++ | 711896281f4beff55a8826771eeccb81 | b2df6cdb454256e864f576347776ac84 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define INFLL 1000000000000000ll
#define INF 2000000000
#define EPS (ld)0.00001
#define endl "\n"
#define ft first
#define sd second
#define openfiles ifstream cin("input.txt"); ofstream cout("output.txt");
#define clos... | C++ | 711896281f4beff55a8826771eeccb81 | 04431b5820d8d61969ab9833e3712184 | 1,500 | PASSED |
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 100000 + 100;
int n, u, v;
vector<int> G[maxn];
int num[maxn];
void dfs(int f, int x) {
num[x] = 1;
int len = G[x].size();
for(int i = 0; i < len; ++i) {
int pos = G[x][i];
if(pos != f) {
dfs(x, pos);
... | C++ | 711896281f4beff55a8826771eeccb81 | 4356bcf23f3c36e0a3038551bc74aeeb | 1,500 | PASSED |
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).beg... | C++ | 711896281f4beff55a8826771eeccb81 | 2c592d4ad768b24d6ff13078b1c90971 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#include<string.h>
#define testcase ll t; cin >> t; while(t--)
#define mp make_pair
#define pb push_back
#define ll unsigned long long
#define io std::ios::sync_with_stdio(false)
#define MAX INT_MAX
#define INF 100000000
#define debug1(x) cout << #x <<" " << x ... | C++ | 711896281f4beff55a8826771eeccb81 | 9e291c6350827eba86262d82c42026e0 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define pi 3.141592653589793238
typedef pair<lli,lli> pll;
typedef map<lli,lli> mll;
typedef set<lli> sl;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef set<int> si;
#define x first
#define y second
#define mp make_pair
#define pb pu... | C++ | 711896281f4beff55a8826771eeccb81 | 95f0721ff00afcea5d58119c704ced6a | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int sz = 1e5 + 10;
const int inf = 1 << 25;
int n, ans, root, mx;
vector < int > G[sz];
void dfs( int u, int p = -1, int dist = 0 ) {
if( mx < dist ) {
mx = dist;
root = u;
}
for( const in... | C++ | 711896281f4beff55a8826771eeccb81 | c7a98d049104d9da928b45d1195db70b | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int sz = 1e5 + 10;
const int inf = 1 << 25;
int n, ans, root, mx;
vector < int > G[sz];
int rec( int u, int p = -1 ) {
int cmp = 1, h;
for( const int& v: G[u] ) {
if( v == p ) continue;
h = rec( v... | C++ | 711896281f4beff55a8826771eeccb81 | e1257a47ff24e49fae98fbddf0e2656c | 1,500 | PASSED |
#include <bits/stdc++.h>
#define N 200100
using namespace std;
int n;
vector<int> g[N];
int vis[N]={0};
int children[N] = {0};
void dfs(int v)
{
children[v] = 1;
vis[v] = 1;
for (int u = 0; u < g[v].size(); ++u)
{
if (not vis[g[v][u]])
{
dfs(g[v][u]);
children[v] += children[g[v][u]];
}
}
}
int main... | C++ | 711896281f4beff55a8826771eeccb81 | 207b2e7fa4b3e9faed863569dbc3828f | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<int>w[100010];
int n,max_ge,ans=INT_MAX,a[100010],NTF_AK_IOI;
int check(int x){
int tmp=0,cnt=w[1].size();
NTF_AK_IOI=0;
for(int i=2;i<=max_ge;i++){
if(!w[i].size()) continue;
for(int j=0,ed=w[i].size()-x+1;j<ed;j++) tmp+=w[i][j],cnt++;
for(int j=max((int)w[... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | f58d0dfd2262b089ea08e70f707fe763 | 2,100 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i = a; i < b; i ++)
typedef long long ll;
typedef pair<int,int> ii;
typedef long double db;
const int N = 1e5+5;
int n;
vector<int>adj[N];
int f(int x){
///Ana 3yz aksb wna m3aya x electors
///7a decrease kol el nas l7ad mayb2a m3ahom... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | f7cd54724d9385b89ac69c4d2e1533eb | 2,100 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
const int maxn=100010;
int num[maxn],ans=1<<30,n;
vector<int>g[maxn];
int q[maxn],cnt;
int check(int mid)
{
int tnum=num[0]+mid,res=0,tot=0;//res -> cost
for(int i=1;i<=100000;i++)
{
for(int j=0;j<=max(-1,num[i]-tn... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | eaa539571e54b3ab5b880c5913e2c277 | 2,100 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdlib>
#define de printf("\ndebug:\n")
#define End printf("end\n\n")
using namespace std;
typedef long long ll;
const int mod1=1e5+7;
const i... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | 0399621f3f18b2975fa667f6d30e18a1 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAX=1e5+9;
vector<int> a[MAX];
int b[MAX],v,n,l,r,m1,m2,ans=2e9;
int f(int o)
{
int u=v,m=0,ans=0,j,k;
for(int i=1;i<MAX;i++)
{
for(j=0,k=a[i].size();k-j>=o;j++)
ans+=a[i][j],u++;
for(;j<k;j++)
b[m++]=a[i][j];
}
sort(b,b+m);
for(int i=0;u<o;u++,i++)... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | 2ba32cd16ad0b8ac140c612c9568551c | 2,100 | PASSED |
#include<bits/stdc++.h>
#define lon long long
using namespace std;
lon n,big,ans=LLONG_MAX;
vector <lon> vec[101234];
lon check(lon z){
lon res=0,tot=vec[0].size();
vector <lon> ret;
for(lon i=1;i<=big;i++){
lon now=0,siz=vec[i].size(),poi=siz;
for(lon j=0;j<siz;j++){
if(poi<z){
for("lyc";j<siz;j++)ret.... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | fbf1014c018a95d68a85b991d7685211 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define lon long long
using namespace std;
lon n,big,ans=LLONG_MAX;
vector <lon> vec[101234];
lon check(lon z){
lon res=0,tot=vec[0].size();
vector <lon> ret;
for(lon i=1;i<=big;i++){
lon now=0,siz=vec[i].size(),poi=siz;
for(lon j=0;j<siz;j++){
if(poi<z){
for("lyc";j<siz;j++)ret.... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | 47b68aee53c6ae4176747d0cebb22af5 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define N 100001
using namespace std;
struct Treap{
typedef struct _Node {
int x, y, cnt;
_Node *l, *r;
int sum;
_Node (int x) : x(x), y(((rand() << 16) ^ rand()) & 0x7fffffff), cnt(1), l(NULL), r(NULL), sum(x){};
void recalc (){
cnt... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | 36fb45d426448be92124fc7edde4c84f | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int L = 1e5;
int n;
vector<int> a[N];
int now;
inline int calc(int x) {
int g = now, bn = 0, s = 0, i, j, k;
vector<int> v;
for (i = 1; i <= L; ++i) {
for (j = 0, k = a[i].size(); k - j >= x; ++j)
s += a[i][j], g++;
for ... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | 5865eee9e3f736ba250ced4f8daa4bdd | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, lim, out, s, ans;
int a[N], b[N], o[N], r[N];
bool check[N];
vector<int> bycandidate[N];
vector<int> byrank[N];
int cmp(int x, int y) {
return b[x] < b[y];
}
int cmp1(int x, int y) {
return b[x] > b[y];
}
int main() {
scanf("%d", &... | C++ | 2a0362376ddeaf3548d5419d1e70b4d3 | b2d9d823fd89496ce8495dc210ea82e0 | 2,100 | PASSED |
//arGreed
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int n, buk[26] = { 0, }, fi[26] = {0,};
cin >> n;
string a;
for (int i = 0; i < n; i++)
{
cin >> a;
for (int j = 0; j < a.size() ;j++)
{
if (a[j] == a[j + 1]) {
buk[a[j] - 'a']++; j++;
}
}
f... | C++ | 586a15030f4830c68f2ea1446e80028c | b9a90c9a3ff731e746a5f9d39e35bfcf | 1,000 | PASSED |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n = 0, m = 1;
string s = "";
vector<char> buf1(26, ' ');
vector<char> buf2;
cin >> n;
while (cin >> s) {
buf2 = buf1;
n = s.size() - 1;
for (int i = 0; i < n; i++) {
... | C++ | 586a15030f4830c68f2ea1446e80028c | 976910f2fa8a7eb0b9d8a9b2079ab824 | 1,000 | PASSED |
t = int(input())
for tt in range(t):
s=input()
l=set()
#l.append(s[0])
n=len(s)
if n==1:
print(s,end="")
else:
left = 0
right = 1
while left<n and right<n:
if s[left]==s[right]:
left+=2
right+=2
else:
... | Python | 586a15030f4830c68f2ea1446e80028c | 742d9aea83f22f45def1b3e7dff87a55 | 1,000 | PASSED |
noc = int(input())
for i in range(noc):
inputString = input()
sequenceOfChar = 0
lastChar = ""
out = set([])
for idx, char in enumerate(inputString):
if char == lastChar:
sequenceOfChar += 1
if sequenceOfChar%2 == 1 and len(inputString) == idx + 1:
ou... | Python | 586a15030f4830c68f2ea1446e80028c | 848246b6af5bd5e69c7cb45105540dcb | 1,000 | PASSED |
for _ in range(int(input())):
# s = input()+" "
# ans = []
# i = 0
# while i+1 < len(s):
# if s[i] != s[i+1]:
# if s[i] not in ans:
# ans.append(s[i])
# else:
# i += 1
# i += 1
# print(*sorted(ans), sep="")
s = input()
# for c i... | Python | 586a15030f4830c68f2ea1446e80028c | 1bfb6ceea9a28fb6e4bf615d2492a4c5 | 1,000 | PASSED |
for _ in range(int(input())):
s = input()+" "
ans = []
i = 0
while i+1 < len(s):
if s[i] != s[i+1]:
if s[i] not in ans:
ans.append(s[i])
else:
i += 1
i += 1
print(*sorted(ans), sep="")
| Python | 586a15030f4830c68f2ea1446e80028c | 776401cdbcc7c0471370a1725b522d46 | 1,000 | PASSED |
for _ in range(int(input())):
s = input()
ss = sorted(set(s))
t = 0
for x in ss:
if s.count(x) != 2 * s.count(x + x):
t += 1
print(x, end="")
print() | Python | 586a15030f4830c68f2ea1446e80028c | 4999911723fb5c52ddc41cbc69cf7e06 | 1,000 | PASSED |
t = int(input())
for i in range(t):
s1 = ''
s = input()
ch = s[0]
n = 0
for i in s:
if i != ch:
if n % 2 == 1 and not ch in s1:
s1 += ch
n = 1
ch = i
else:
n += 1
if n % 2 == 1 and not ch in s1:
s1 += ch
... | Python | 586a15030f4830c68f2ea1446e80028c | ae2ca4f07cdaa10d179bbc4006d756c3 | 1,000 | PASSED |
t = int(input())
for _ in range(t):
lastChar = "1"
cnt = 0
inp = input()
n = len(inp)
res = set()
for i in range(n):
if lastChar == inp[i]:
cnt += 1
else:
if cnt % 2 == 1:
res.add(lastChar)
lastChar = inp[i]
cnt = 1
... | Python | 586a15030f4830c68f2ea1446e80028c | 9d3b1ed27a5c2b33dda12c4798423b76 | 1,000 | PASSED |
for _ in range(int(input())):
s = input()
n = len(s)
i = 0
valid = set()
while i < n:
j = i + 1
while j < n and s[j] == s[i]: j += 1
if (j - i) & 1: valid.add(s[i])
i = j
print(''.join(sorted(valid))) | Python | 586a15030f4830c68f2ea1446e80028c | eebf190271f3f99090f7580d51da400c | 1,000 | PASSED |
#include <stdlib.h>
#include <stdio.h>
int main()
{
long long n, x, y, a;
int i;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%I64d %I64d %I64d", &n, &x, &y);
a = y-n+1;
if(a<=0 || a*a+n-1 < x) printf("-1\n");
else {
printf("%I64d\n", a);
for(i=2; i<=n; i++) printf("1... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | dd43379a5a81c6546d1fa4b18552334d | 1,400 | PASSED |
#include <iostream>
using namespace std;
int main(){
long long n, x, y;
cin >> n >> x >> y;
long long a1 = y - n + 1;
if (a1 > 0 && a1 * a1 >= x - n + 1){
cout << a1 << " ";
for (int i = 1; i < n; i++){
cout << 1 << " ";
}
}
else cout << -1;
}... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | 299c5883f5f852d1d89928514ec00ace | 1,400 | PASSED |
#include<cstdio>
#include<iostream>
using namespace std;
long long n, x, y;
int main ()
{
cin>>n>>x>>y;
if (n>y)
{
cout<<-1<<endl;
return 0;
}
for (long long i=1;i<=n ;i++)
{
long long r=(y-(n-i) )/i, c;
if (r==0) continue;
c=r*r*i+n-i;
if ( ... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | 04924a566c8bc12e333e3a1c80c7cec8 | 1,400 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <iomanip>
#include <cstdio>
#include <map>
using namespace std;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
typedef long long ll;
ll a[100005];
int main(){
int i;
l... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | 8d83c7182264050fc95458c50b1bce08 | 1,400 | PASSED |
/*
this code was written by Zanaty
problem Name: steamroller
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define reps(i,x,n) for((i)=(x);(i)<(int)(n);(i)++)
#define repi(i,n) for((i)=(n)-1;(i)>=0;(i)--)
#define SZ(v) (int)v.size()
#define LEN(s) (int)s.length()
#... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | fcfd843efa2a537aba62d324a5c18af4 | 1,400 | PASSED |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstrea... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | e2de50c32784a9ed8c8c65b0ae42e792 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long int power(long long int x,long long int n)
{
long long int ans;
if(n==0)
return 1;
else if(n%2==0)
{
ans=power(x,n/2);
return ans*ans;
}
else
{
return x*power(x,n-1);
}
}
int main()
{
long long int ... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | fda1c10e005006cc806c51760bc0c8b4 | 1,400 | PASSED |
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
__int64 n,x,y;
int main()
{
while(scanf("%I64d%I64d%I64d",&n,&x,&y)==3)
{
if(y<n)
{
printf("-1\n");
continue;
}
__int64 s... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | 83f3a2100f84069940e388ca1849bbc0 | 1,400 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
long long N,X,Y;
void solve()
{
if (sqrt(X-N+1)>Y-N+1||Y-N+1<=0)
{
cout << -1 << endl;
return;
}
for (int i=0;i<N-1;i++)
cout << 1 << endl;
cout << Y-N+1 << endl;
}
int main()
{
cin >> N >> X >> Y;
solve();
return 0;
} | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | ed114eebf6dc12f19adda95b02924ec6 | 1,400 | PASSED |
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <iomanip>
#include <bitset>
#include <list>
#include <utility>
#include <ctime... | C++ | 138fd96bf5a677a6d59c20f88fd612f1 | bfa0f8a6f51fced1b8ff863181476ff1 | 1,400 | PASSED |
import java.io.*;
import java.util.*;
public class test {
public static void main(String[] args)throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Scanner sc = new Scanner(System.in);
int t=1;
while(t-->0){
int n=Integ... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 74e21ca4a5c29e5c9cd9a92c7f3d5151 | 1,000 | PASSED |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class TaskD1 {
public static void main(String[] args) {
MyScanner sc = new MyScann... | Java | bcd9439fbf6aedf6882612d5f7d6220f | a42509343c10878f3c160db84aab38bb | 1,000 | PASSED |
import java.util.*;
public class segementTree {
public static int mod=1000000007;
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)
arr[i]=sc.nextInt();
Arrays.sort(arr);
int ans[]=new int[n];
if(... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 90cf857ef8726fdca7106dd6bca97936 | 1,000 | PASSED |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
var a = new int[n];
for(int i = 0; i < n; i++){
... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 37c080f6994e10677f6db1a1b03959a4 | 1,000 | PASSED |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
//package javaapplication2;
import java.util.*;
import java.util.Arrays;
/**
*
* @author DELL
*/
public class JavaApplication2 {
... | Java | bcd9439fbf6aedf6882612d5f7d6220f | b5932bcee3d2df21c5b0f608f416a13d | 1,000 | PASSED |
import java.awt.dnd.InvalidDnDOperationException;
import java.io.*;
import java.lang.reflect.Array;
import java.nio.charset.CharsetEncoder;
import java.util.*;
public class Main {
private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
private static final boolean OFFLINE_WITHOU... | Java | bcd9439fbf6aedf6882612d5f7d6220f | d1957057356eec04378496fa50c6b6eb | 1,000 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
public class problemD {
private static void solve() throws Exception {
... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 53b42998882f3d46b96944734f8e6795 | 1,000 | PASSED |
import java.io.*;
import java.util.*;
// Author- Prashant Gupta
public class D {
public static void main(String[] args) throws IOException {
// write your code here
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
// Scanner sc = new Scanner(System.in);
Read... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 05cba2631b4bc2262a922ea9c691605d | 1,000 | PASSED |
import java.util.*;
public class Codeforces{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
sc.nextLine();
String[] arr=sc.nextLine().split(" ");
Arrays.sort(arr,new Comparator<String>() {
public int compare(String s1,String s2) {
return Integer.valu... | Java | bcd9439fbf6aedf6882612d5f7d6220f | d117e6826f5de23952c45eed74795be9 | 1,000 | PASSED |
import java.lang.*;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new Buf... | Java | bcd9439fbf6aedf6882612d5f7d6220f | 411ad360dc50bb7c61247e1b8560cf8f | 1,000 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define all(x) (x).begin(), (x).end()
#define deb if(s.size() > 1000) while(true);
using namespace std;
int ans, k;
string s;
vector<string> tree[2000000];
void dfs(int son) {
int depth = 0; string cur = "";
ans = max(ans, son);
for (; ; k++)
if (s[... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 421509b766456b083491c6be7b740fa6 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
#define ... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 70097895ab2543b43801ac00f9e3a24d | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
#define ... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 92c5395c8baa25cece7d8fdceb67053b | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
#define ... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 068402de4ffcd9bdce9a0723881db630 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
#define ... | C++ | da08dd34ac3c05af58926f70abe5acd0 | e29421fa8b973013abc51808c20da035 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 1842362d18dd478f169fff9c68a7a920 | 1,700 | PASSED |
#include<iostream>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<map>
#include<unordered_set>
#include<algorithm>
using namespace std;
#define endl '\n'
#define gap ' '
#define Max LLONG_MAX
#define Min LLONG_MIN
... | C++ | da08dd34ac3c05af58926f70abe5acd0 | c4b2115832bfc9fd8012dcf8698f066c | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=696969;
vector<string> ve[MAXN];
string s;
int maxi=0,l,cur=0,N;
void DFS(int dep){
if(cur>=l)return;
string tmp="";
while(s[cur]!=',')tmp+=s[cur],cur++;
cur++;
int go=0;
while(cur<l&&s[cur]!=',')go=go*10+s[cur]-'0',cur++;
ve[dep+1].push_back(tmp);
cu... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 50b8fa56a2f5af660699e99dc0c81200 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
#define fo(name,start,end) for(int (name)=(start);(name)<(end);(name)++)
#define mkpr(fir,sec) make_pair((fir),(sec))
#define ll long long
#define sz(a) int((a).size())
#define pb push_back
#define all(cont) (cont).begin(),(cont).end()
#define foit(container, ... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 914f06465c529483e204f389dbddf7e9 | 1,700 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set... | C++ | da08dd34ac3c05af58926f70abe5acd0 | 5dd7679138d49211a8a4c71e46e03d0b | 1,700 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<iterator>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define vd " "
#define fo(a,b,c) for(i=a;i<=b;i+=c)
#define Fo(a,b,c... | C++ | e1481b9d940407da75e11355b580f459 | 4d5d00576d03c51a4dc25590df985c1c | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define db double
#define pb push_back
#define nl '\n'
#define X first
#define Y second
#define nimble ios::sync_with_stdio(0);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define mod(x,m) ((((x)%(m))+(m))%(m))
#define _sz(x)... | C++ | e1481b9d940407da75e11355b580f459 | cfacac143f23c7fa967172aabe5a5acd | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long int ll;
#define int long long int
#define IOS ios::syn... | C++ | e1481b9d940407da75e11355b580f459 | 4e8d10b2e27c8bdfffd20ad5c4f85278 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> p(n);
for (int i = 0; i < m; ++i) {
int pos;
cin >> pos;
p[pos - 1] = 1;
}
while (true) {
bool o... | C++ | e1481b9d940407da75e11355b580f459 | 4f7a9a18d2035539b0d4b2613ccfd6b1 | 1,200 | PASSED |
//
// Created by Saket Saumya
// Mon Mar 23 2020
//
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
#define present(c,x) ((c).find(x) != (c).end())
#define what_is(x) cerr << #x << " is " << x << endl;
const long long MOD = (long lon... | C++ | e1481b9d940407da75e11355b580f459 | 4856904e4cc027fd751e9ef3abb3bcfc | 1,200 | PASSED |
//
// Created by Saket Saumya
// Mon Mar 24 2020
//
//Optional FAST
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define ll long long
#d... | C++ | e1481b9d940407da75e11355b580f459 | 2db9a5f429406f94dceb18059b2cadd3 | 1,200 | PASSED |
/* Author: Yash B Sakaria */
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 7;
#define pb push_back
#define ff first
#define ss sec... | C++ | e1481b9d940407da75e11355b580f459 | 6106d014ae9c774808649e249b259cd2 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
int a[n],p[m];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int j=0;j<m;j++){
cin>>p[j];
}
sort(p,p+m);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(a[p[j]]<a[p[j]-1]){
swap(a[p[j]],a[p[j]-1]);
}
}
}
if(is_sorted(a,a+n))... | C++ | e1481b9d940407da75e11355b580f459 | 77958fc54f4ef6faeedb0243fb7e3e3a | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int m,n;
cin>>m>>n;
int arr[m],p[n];
for(int i=0;i<m;i++)
{
cin>>arr[i];
}
for(int i=0;i<n;i++)
{
cin>>p[i];
}
map... | C++ | e1481b9d940407da75e11355b580f459 | ff774eb83eeffca1277c1644f0587f08 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int t;
cin>>t;
while(t--)
{
ll n,m;
cin>>n>>m;
ll a[n+1],p[n+1]={0},b[n+1];
for(ll i=1;i<=n;i++)
{ cin>>a[i];
b[i]=a[i];
}
sort(b+1,b+n+1);
for(ll i=1;i<=m;i++)
{ ll temp;
cin>>t... | C++ | e1481b9d940407da75e11355b580f459 | 26c96b684e950a06b5f3c0a25e4eaf1d | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_f... | C++ | 6ac3246ee9cf78d81f96a3ed05b35918 | 0b5b2166dff88256e24b7697456e01cc | 2,000 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.