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 <stdio.h>
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()
#... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 4d2540f9863db030ced400dcadb8293e | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
inline int who(char a,char b)
{
if(a==b) return 0;
if(a=='R' && b=='S') return 1;
if(a=='S' && b=='P') return 1;
if(a=='P' && b=='R') return 1;
return 2;
}
int games;
int cnt[3];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 43042760b3865f3e3f91dc024673fff1 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int winner(char a, char b){
if(a=='R'&&b=='S') return 1;
if(a=='R'&&b=='P') return 2;
if(a=='R'&&b=='R') return 0;
if(a=='S'&&b=='R') return 2;
if(a=='S'&&b=='S') return 0;
if(a=='S'&&b=='P') return 1;
if(a=='P'&&b=='S') return 2;
if(a=... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 7cc9dbb2671ecf5220a5c3cc0e744a87 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ulli unsigned long long int
#define li long int
#define ff(i,a,b) for(int i=a;i<b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
#define w(t) while(--t >= 0)
#define l(s) s.len... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 43a1b570aa2efc4f8ef9884a41a36e1f | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define maxn 1001
int gcd(int a, int b) {
int pr = a, r = b;
int q, h;
while(r) {
q = pr / r;
h = r;
r = pr - q * r;
pr = h;
}
return pr;
}
int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
bool win(char a, char b) {
return (a == 'R' && b == 'S') || (a == ... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 4d88460ef576aab543637af635d862cd | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
return b ? gcd(b,a%b): a;
}
int main(){
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int n;
cin>>n;
string str1,str2;
cin>>str1>>str2;... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 411e150cd0b0822420d3514f46311b54 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define PI acos(-1.0)
ll m,n,c,d,j,k,l,r,x,t,y,u,a,b,z,i,e;
string s,p,q;char a1,a2;
int main ()
{
cin>>n>>s>>p;
k=s.size()*p.size();
for(i=0;i<k;i++){
a1=s[i%s.size()];
a2=p[i%p.size()];
if((a1=='R'&&a2=='S'... | C++ | 9a365e26f58ecb22a1e382fad3062387 | d34b91e5e79f32d487019cd0e29100be | 1,300 | PASSED |
/*
Sarthak Jain
*/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int mod=1e9+7;
int min(int a,int b){
return (a<b)?a:b;
}
int max(int a,int b){
return (a>b)?a:b;
}
int fp(int a,int b){
if(b==0) return 1;
int x=fp(a,b/2);
x=(x*x)%mod;
if(b&1) x=(x*a)%mod;
return x;
... | C++ | 9a365e26f58ecb22a1e382fad3062387 | a8341f0639ffe290e63bf89364880bf4 | 1,300 | PASSED |
//g++ 7.4.0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(int a, int b) {
ll x = max(a,b);
ll y = min(a,b);
while (y != 0) {
int r = x%y;
x = y;
y = r;
}
return x;
}
int win(char a, char b) {
if (a == 'R' && b == 'S') return 1;
if (a... | C++ | 9a365e26f58ecb22a1e382fad3062387 | cc8b92f834a0ff5510601f1c40782a9a | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
string a,b;
cin>>a>>b;
int n1=a.size(),n2=b.size();
int x=(n1*n2)/__gcd(n1,n2);
int count1=0,count0=0,sum=0;
int num[x];
for(int i=0; i<x; i++)
{
if(a[i%n1]=='R'&&b[i%n2]=='S'||a[i%n1]... | C++ | 9a365e26f58ecb22a1e382fad3062387 | 724d3e6b26482f48cf3890d69f319d9f | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <random>
#include <set>
#include <queue>
using namespace std;
// mt19937 rng(5);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define fo(i, n) for (int i = 0; i < n... | C++ | d4249cd3147e888e13e85767d3457d0b | 9af11a916e126e63eb8ceb725dceca23 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
const int mod=998244353;
int t,n,k,a[N],fix[N],ind[N],f,ans,m,b[N];
set<int>s;
int main(){
cin>>t;
while(t--){
cin>>n>>m;
for(k=1;k<=n;k++)
cin>>a[k],
fix[a[k]]=0,
ind[a[k]]=k,
s.insert(k);
for(k=1;k<=m;k++){
cin>>b[k];
fix[b[k]]=1;
... | C++ | d4249cd3147e888e13e85767d3457d0b | c23a002222ed2ea36225537b91dae10a | 1,800 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION std::cout << std::fixed << std::setprecision(20);
using namespace std;
const int inf = 1e9;
const int N = 1e6 + 10;
const int mod = 998244353;
voi... | C++ | d4249cd3147e888e13e85767d3457d0b | 97503d94d6d96629c2bd5c0b108a2d3c | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | C++ | d4249cd3147e888e13e85767d3457d0b | 9265710b6ad6038aeebb3d72f0f057c6 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
#define N 200005
int a[N],b[N];
int pos[N],vis[N];
int main(){
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
//memset(vis,0,sizeof vis);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),pos[a[i]]=i,vis[... | C++ | d4249cd3147e888e13e85767d3457d0b | 2a3972163f0e1aaecc20e3a6a1455405 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod=998244353;
const int N=2e5+10;
int a[N],b[N];
int pos[N],ans[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
{
ans[i]=0;
... | C++ | d4249cd3147e888e13e85767d3457d0b | 68ae1678d9515bad1914f767e3f84b74 | 1,800 | PASSED |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <assert.h>
#include <stack>
#include <string>
#define int long long int
//annoying and stupid problem
using namespace std;
int mod=998244353;
int n, k... | C++ | d4249cd3147e888e13e85767d3457d0b | 5ca643dfe9352014f10d5a0f8245dd6e | 1,800 | PASSED |
# include <bits/stdc++.h>
# define fi first
# define se second
# define int long long
const int mod = 998244353;
using namespace std ;
int32_t main() {
int t = 1 ; cin >> t ;
while( t -- ) {
int n, k ; cin >> n >> k ;
map < int, int > pos ;
vector < int > v1(n+10), v2(k+1), us(n+10);
... | C++ | d4249cd3147e888e13e85767d3457d0b | 301490bfcc833db6c6f6f176ad4e2ba3 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define endl '\n'
#endif
constexpr int mod = 998244353;
void test_case()
{
int n, k;
cin >> n >> k;
vector<int> b(k);
list<int> a;
vector<list<int>::iterator> idx(n);
for (int i = 0; i < n; i++) {
int tmp;
cin ... | C++ | d4249cd3147e888e13e85767d3457d0b | 1b1fb7d76f0f137ffaabc00f66792964 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define endl '\n'
#endif
constexpr int mod = 998244353;
void test_case()
{
int n, k;
cin >> n >> k;
vector<int> b(k), pos(n + 1);
vector<bool> tag(n + 2, false);
tag[0] = tag[n + 1] = true;
for (int i = 1; i <= n; i++) {
... | C++ | d4249cd3147e888e13e85767d3457d0b | d3385962c6f3d79067fc981ee2e4fd9e | 1,800 | PASSED |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define ul unsigned long long
#define ui unsigned int
#define ri register int
#define pb push_back
#define mp make_pair
char p[30]={'0','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
inline ll rd... | C++ | 700cfc8d20794ca38d73ccff31e5292c | 5c9d3b640c72aff6f2e1601198a219bb | 1,500 | PASSED |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define ul unsigned long long
#define ui unsigned int
#define ri register int
#define pb push_back
#define mp make_pair
char p[30]={'0','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
inline ll rd... | C++ | 700cfc8d20794ca38d73ccff31e5292c | d4e2acb7b749d6a929c0c6e2f832686d | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long double eps = 1e-7;
int n, l;
int a[N];
bool check(long double t) {
long double tmp = t;
int v = 1, p1, p2;
p1 = n + 1; p2 = 0;
for (int i = 1; i <= n + 1; i++) {
int dis = a[i] - a[i - 1];
if (1. * dis / v < tmp) {
tmp -= 1. * d... | C++ | 700cfc8d20794ca38d73ccff31e5292c | 98c744ff501050a0137b59d6c92a8926 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(LL i=(j); i<(k); ++i)
#define pb push_back
#define PII pair<LL,LL>
#define PLL pair<long long, long long>
#define ini(a,j) memset(a,j,sizeof a)
#define rrep(i,j,k) for(LL i=j; i>=k; --i)
#define fi first
#define se second
#define LL long long
#define b... | C++ | 700cfc8d20794ca38d73ccff31e5292c | b6b50de26b42a9e44702a3e21be5e887 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t, n, l;
vector<double> arr;
void solve(){
cin >> n >> l;
arr.resize(n);
for(int i=0; i<n; i++)cin >> arr[i];
int lPtr=0, rPtr=n-1;long double lSpeed=1, rSpeed=1;
long double lPos = 0, rPos = l, totalTime = 0;
while(lPtr <= rPtr){
double lTime = (arr[lPtr]-lPo... | C++ | 700cfc8d20794ca38d73ccff31e5292c | cfd0fd40b2f1482e162f1385e4ae07a6 | 1,500 | PASSED |
/*
It's not my code.
source: https://codeforces.com/contest/1408/submission/94324318
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
vector<ld> arr;
int n,l;
ld check(ld t){
ld curr1 = 0;
ll currspeed1 = 1;
ld time1 = 0;
int target;
// cout<<"P1: \n";
... | C++ | 700cfc8d20794ca38d73ccff31e5292c | 513688ce90efe520971491af3ed3a461 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int xx[] = {0,0,-1,1,-1,1,-1,1}, yy[] = {-1,1,0,0,-1,-1,1,1};
#define fo(NAME, A, B) for (long long NAME = (A); NAME < (B); ++NAME)
#define fc(NAME, A, B) for (long long NAME = (A); NAME <= (B); ++NAME)
#define endl ((char) 10)
#define size(X) ((int) (X.size()))
using ll = ... | C++ | 700cfc8d20794ca38d73ccff31e5292c | db71d5322405789a8da469ada876d660 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int xx[] = {0,0,-1,1,-1,1,-1,1}, yy[] = {-1,1,0,0,-1,-1,1,1};
#define fo(NAME, A, B) for (long long NAME = (A); NAME < (B); ++NAME)
#define fc(NAME, A, B) for (long long NAME = (A); NAME <= (B); ++NAME)
#define endl ((char) 10)
#define size(X) ((int) (X.size()))
using ll = ... | C++ | 700cfc8d20794ca38d73ccff31e5292c | ea09990ba051cc393c1aa5a2b2797f70 | 1,500 | PASSED |
/*
It's not my code.
source: https://codeforces.com/contest/1408/submission/94324318
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
vector<ld> arr;
int n,l;
ld check(ld t){
ld curr1 = 0;
ll currspeed1 = 1;
ld time1 = 0;
int target;
// cout<<"P1: \n";
... | C++ | 700cfc8d20794ca38d73ccff31e5292c | a1bb1637e5dba2ea97dd677292e1f7be | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
vector<ld> arr;
int n,l;
ld check(ld t){
ld curr1 = 0;
ll currspeed1 = 1;
ld time1 = 0;
int target;
// cout<<"P1: \n";
for(int i=0;i<=n;i++){
// cout<<"i: "<<i<<" arr[i]: "<<arr[i]<<" arr[i+1]: "<<ar... | C++ | 700cfc8d20794ca38d73ccff31e5292c | 08b5dbbffb627650a8f4628b3bdf9738 | 1,500 | PASSED |
#include <stdio.h>
#define LI long long int
int flag[100];
LI pow[100];
LI sex(LI t){
LI ret=0, bnd1, bnd2, c;
int i, j, k, u;
if (t==0) return 0;
pow[0]=1, pow[1]=2;
for (i=2;i<63;i++){
pow[i]=pow[i-1]*2;
flag[i]=0;
}
for (i=2;i<64;i++){
u=1-flag[i];
for (j=i;j<64;j+=i){
flag[j]+=u;
}
for (... | C++ | a628b6606c977059dca6d8dd05de99d4 | 1810745ecd233696b7b6d955c732d3ba | 2,100 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iostream>
#include<set>
#define maxn 100009
using namespace std;
long long f(int x)
{
long long tmp[100]={0},ans=0;
for(int k=1;k<x;k++)
{
if(x%k==0){
tmp[k]=(1LL<<(k-1));
for(int i=1;i<k;i++)
i... | C++ | a628b6606c977059dca6d8dd05de99d4 | 6a6b89953e230246dad6c9fb47f62f2c | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define f first
#define s second
#define mp make_pair
#define pb... | C++ | a628b6606c977059dca6d8dd05de99d4 | 622149252725dcc3637db72e5023485f | 2,100 | PASSED |
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
map<ll,bool> M;
ll l,r;
bool check(ll x,int k)
{
if(k%2)
return true;
ll tmp=(1ll<<(k/2));
if(x%tmp==x/tmp)
return false;
return true;
}
ll ans(ll x)
{
if(x==0)
return 0;
M.clear();
for(int i=1;i<=20;i++)
{
ll tmp=(1ll<<i)+1;
... | C++ | a628b6606c977059dca6d8dd05de99d4 | d6f6dee88082f3b5964728eae8dd7595 | 2,100 | PASSED |
//IN THE NAME OF GOD(=ALLAH)
/*
ID: iman.ho1
LANG: C++
PROG: NAMEQ
*/
//Iman Homayoni Kisomi (I man)
#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#in... | C++ | a628b6606c977059dca6d8dd05de99d4 | c20a332acac908d3ed6378ca8da26817 | 2,100 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | a628b6606c977059dca6d8dd05de99d4 | adf52560ec5e4d3d7821e3f408827c3e | 2,100 | PASSED |
// inplace_merge(T + beg, T + mid + 1, T + end + 1);
// unsigned Long hash[maxn],p = 999999999989; hash[0] = 1; fo(i,1,maxn)hash[i] = hash[i-1] * p;
// __builtin_popcount(n);
/*
ID: Tariqul
PROG:
LANG: C++
*/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring... | C++ | a628b6606c977059dca6d8dd05de99d4 | e36b0d6a591588dd23eaf630f2135f3a | 2,100 | PASSED |
// inplace_merge(T + beg, T + mid + 1, T + end + 1);
// unsigned Long hash[maxn],p = 999999999989; hash[0] = 1; fo(i,1,maxn)hash[i] = hash[i-1] * p;
// __builtin_popcount(n);
/*
ID: Tariqul
PROG:
LANG: C++
*/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring... | C++ | a628b6606c977059dca6d8dd05de99d4 | c475632325eeb9f8497e89290ad9eb99 | 2,100 | PASSED |
// inplace_merge(T + beg, T + mid + 1, T + end + 1);
// unsigned Long hash[maxn],p = 999999999989; hash[0] = 1; fo(i,1,maxn)hash[i] = hash[i-1] * p;
// __builtin_popcount(n);
/*
ID: Tariqul
PROG:
LANG: C++
*/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring... | C++ | a628b6606c977059dca6d8dd05de99d4 | 4ea26a22fcb04795b2f353b1b3bbddb5 | 2,100 | PASSED |
//In the Name of God
#include<iostream>
#include<cstring>
#define int long long
using namespace std;
int s,e;
int dp[128];
int len(int x)
{
int ret=0;
for(;x;x/=2,ret++);
return ret;
}
int c(int x,int l)
{
int L=len(x);
int ret=0;
for(int i=0;i<l/L;i++)
ret=ret*(1ll<<L)+x;
return ret;
}
int f(in... | C++ | a628b6606c977059dca6d8dd05de99d4 | cbb736b797909b3826e729abcf8d83d1 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, t, j=-1;
cin>>n>>t;
string s;
cin>>s;
bool ok=false;
for(int i=0;i<n;i++) {
if(s[i]>='5' && ok) {
for(int k=i;k>=0&&t>0;k--,t--) {
if(s[k]>='4') { j=k-1;
}
... | C++ | d563ce32596b54f48544a6085efe5cc5 | 7b969517e69131e440be17240c38b5c4 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
const int maxn = 2e5+5;
char s[maxn];
int main(){
int n, t; scanf("%d %d", &n, &t);
scanf("%s",s+1);
s[0] = '0';
int l = 1, r = n;
for (int i=1;i<=n;i++) if (s[i] == '.') {
l = i; break;
}
f... | C++ | d563ce32596b54f48544a6085efe5cc5 | fba8de25563f7d12235ed21e1c7ac33b | 1,700 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
const int maxn = 2e5+5;
char s[maxn];
int main(){
int n, t; scanf("%d %d", &n, &t);
scanf("%s",s+1);
s[0] = '0';
int l = 1, r = n+1;
for (int i=1;i<=n;i++) if (s[i] == '.') {
l = i; break;
}
... | C++ | d563ce32596b54f48544a6085efe5cc5 | 151020e39e9fbfa52560390dce49e2d6 | 1,700 | PASSED |
/*
TASK:
LANG:C++
URL:
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
char s[200005];
int n,t,ok,c,i;
int main() {
scanf("%d%d%s",&n,&t,s);
while(s[i]&&s[i]!='.')i++;
ok=i++;
while(s[i]&&t){
if(!c){
if(i<=ok)break;
if(s[i]-'0'>4){
... | C++ | d563ce32596b54f48544a6085efe5cc5 | 9896fc8c32d8eadbbce30ebdc9557c05 | 1,700 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#define LL long long
using namespace std;
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
string s;
cin>>s;
int index=0;
for(int i=0; i<n; i++)
{
if(s[i]=='... | C++ | d563ce32596b54f48544a6085efe5cc5 | 1fd9eb6df9dd21eecdaf0e735d2c1e37 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char arr[200000+5];
int main()
{
int n,t; bool inc=0,BIGG=0; string s;
cin>>n>>t>>s;
int dot=s.find('.'); int First_big,last_one=n-1;
for(int i=dot;i<s.size();i++){ if (s[i]>='5') {First_big=i; BIGG=1; break;} }
if (BIGG){ for (int i=First_big;i>=dot && t>=0;i--){
... | C++ | d563ce32596b54f48544a6085efe5cc5 | 344f85ddea9f2ced26ba62ffa929aeb9 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char arr[200000+5];
int main()
{
int n,t;
cin>>n>>t;
bool inc=0,BIGG=0;
string s; cin>>s;
int dot=s.find('.');
int First_big,last_one=n-1;
for(int i=dot;i<s.size();i++){
if (s[i]>='5') {First_big=i; BIGG=1; break;}
}
if (BIGG){
for (int i=First_big;i>=dot... | C++ | d563ce32596b54f48544a6085efe5cc5 | 4ffbb3b26c30e3f0d7de24582745a6f0 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
string s;
bool tp=false;
int n,t,fr,st,en;
int wwq(int a)
{
a--;
if(a<0)
{
tp=true;
return 0;
}
if(s[a]=='.') a--;
s[a]++;
if(s[a]=='9'+1)
{
s[a]='0';
wwq(a);
}
return 0;
}
int main()
{
cin>>n>>t>>s;
en=n;
for(int i=0;i<n;i++)
if(s[i]=='.')
{
fr=i... | C++ | d563ce32596b54f48544a6085efe5cc5 | f7946fe3e01cbe39e7eebd2cd1d03cc0 | 1,700 | PASSED |
#include <iostream>
#include <string>
using namespace std;
string mtr(string s) {
string res = "";
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#')
break;
res.push_back(s[i]);
}
return res;
}
int main() {
int n, t;
cin >> n >> t;
string s;
cin >> s;
... | C++ | d563ce32596b54f48544a6085efe5cc5 | 588c130810ad5203d3cfcf10ea8018af | 1,700 | PASSED |
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <tr1/u... | C++ | d563ce32596b54f48544a6085efe5cc5 | 3a189c619c76098185a152ed4d9fc10c | 1,700 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#include <cmath>
#define ll long long int
#define mp make_pair
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define ff first
#define ss second
using namespace std;
ll MOD = 1000000007;
int main(int argc, char const *argv[])
{
int t;
cin>>t;
for (int r1 = 0... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | a880334ca6b466f11fd093c3c4692d95 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long int ll;
main()
{
ll t,n,i,j,k,l;
cin>>t;
ll a[30];
for(i=0;i<30;i++)
{
a[i]=1<<(i+1);
}
while(t--)
{
cin>>n;
k=(n/2)+1;
j=1<<k;
j-=2;
cout<<j<<endl;
}
} | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | cccdafc6ef49fc0616b8f960790dacbf | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long int ll;
main()
{
ll t,n,i,j,k,l;
cin>>t;
while(t--)
{
cin>>n;
k=(n/2)+1;
j=1<<k;
j-=2;
cout<<j<<endl;
}
} | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | feb442e1e8dc49adcc702f63b83492fa | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define lint long long int
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define MAXN 100001
#define len length()
#define testcase(t) for(int i=0;i<t;i++)
int power(lint x, lint... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | cd1113ebdd15f69e46e01daaba9a6606 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long f(long long p) {
if(p < 0) p = -p;
return p;
}
int main() {
std :: ios :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
long long x = 0, y = 0;
for... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | aaa05d5befdaee0045e1bf4797ea8382 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long f(long long p) {
if(p < 0) p = -p;
return p;
}
int main() {
std :: ios :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
long long x = 0, y = 0;
for... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | c8ba41c46057eb8dfee94b44e4284494 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll t,n;
cin>>t;
while(t--){
cin>>n;
vector<ll> v;
ll x=1;
while(n>0){
x=x*2;
v.push_back(x);
n--;
}
ll sum1=0,sum2=0,s=v.size();
for(ll i=0;i<s/2-1;i++){
sum1=sum1+v[i];
}
sum1=sum1+v[s-1];
for(ll i... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | cd40ebdb28ac16d5e5b926212af2bb32 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll int t;
cin>>t;
while(t--)
{
ll int n;
cin>>n;
ll int ar[n];
ar[0]=2;
ll int total=ar[0];
ll int i;
for( i=1;i<n;i++)
{
ar[i]=2*ar[i-1];
total=total+ar[i];
}
if(n!=2)
{
ll int req=n/2;
ll int sum=ar[0]... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | 1ec7bf92ab86c71ec0352e4313b3767b | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll int t;
cin>>t;
while(t--)
{
ll int n;
cin>>n;
ll int ar[n];
ar[0]=2;
ll int total=ar[0];
ll int i;
for( i=1;i<n;i++)
{
ar[i]=2*ar[i-1];
total=total+ar[i];
}
if(n!=2)
{
ll int req=n/2;
ll int sum=ar[0]... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | f7b17ce13c34c9e02315564a8659cbae | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll int t;
cin>>t;
while(t--)
{
ll int n;
cin>>n;
ll int ar[n];
ar[0]=2;
ll int total=ar[0];
ll int i;
for( i=1;i<n;i++)
{
ar[i]=2*ar[i-1];
total=total+ar[i];
}
if(n!=2)
{
ll int req=n/2;
ll int sum=ar[0]... | C++ | 787a45f427c2db98b2ddb78925e0e0f1 | c1a754e30eeecb7ad88db6b27af27e9a | 800 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <string>
#include <cctype>
#include <cstdlib>
#define ll long long
using namespace std;
const ll len=100001;
int main()
{
ll n;
while(scanf... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | 8e04b3e1ea8213a21ed9d85e8a80556e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int yi=0,er=0;
for(int i=0;i<n;i++)
{
int a;
scanf("%d",&a);
if(a==1)
yi++;
else
er++;
}
if(yi==0)
{
printf("0");
}
else if(er==0)
{
printf("%d",yi/3);
}
else
{
if(yi<=min(yi,er))
printf("%d",min(yi,er));
... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | 5522ea4ee8e1d257a3883faa456b50e9 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
std::sort(a,a+n);
int ans=0;
int l=n-1;
for(int i=0;i<=l;i++)
{
if(a[i]+a[l]==3)
... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | f3740cb9133129f7679138fe935a1052 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>a[i];
std::sort(a,a+n);
int ans=0;
int l=n-1;
for(int i=0;i<=l;i++)
{
if(a[i]+a[l]==3)
... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | 602d02b917b4c5aa803fca45481ceed4 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define popb pop_back
#define lld long long int
#define ull unsigned long long int
#define max3(a,b,c) max(a,max(b,c))
#define max4(a,b,c,d) max(max3(a,b,c),d)
#define mi... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | ad9b1a0f6e0c330d6d7bfb572e726bf5 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define EPS 1e-9
#define REP(i, a, b) for(int i = a; i < b; ++i)
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
const float PI =... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | 3e4f500fbfb033477c1ef681c61ef5fa | 800 | PASSED |
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
typedef long long ll;
using namespace std;
int n,rudi,i,alic,rez;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>rudi;
if(rudi==2)rez++;
}
rudi=rez;
alic=n-rudi;
cout<<min(rudi,alic)+(alic-min(rudi,alic))/3<<endl;
return 0;
} | C++ | 6c9cbe714f8f594654ebc59b6059b30a | b0afa036747f3e91865c1090337cac06 | 800 | PASSED |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<iostream>
#define nl std::cout<<'\n'
#define sp <<' '
#define rep(i,n) for(int i=0;i<n;i++)
#define repr(i,l,r) for(int i=l;i<r;i++)
template<typename T,typename U> static void amin(T &x, U y){if(y<x)x=y;}
template<typename T,typename U> static void... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | 48818d1ce338737c03a18a7cf7bc1405 | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <stdio.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[])
{
int n, x, a, b;
cin >> n;
a = b = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x == 1) a++;
else b++;
}
if ... | C++ | 6c9cbe714f8f594654ebc59b6059b30a | fa3645c6bec8ecd9e6003229791a5c66 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int n,i,a,d=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a;
if(a==2)
d++;
}
cout<<(min(d,n-d))+((n-d)>d?(n-(d<<1))/3:0);
return 0;
} | C++ | 6c9cbe714f8f594654ebc59b6059b30a | c92bdfa8021fa9658f813dd9c3e62f3f | 800 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
#define print(x) std::cout << (x) << std::endl
using LL = long long;
int main() {
//freopen("in","r",stdin);
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::vector<bool> isp(n + 1);
std... | C++ | 513480a6c7a715e237c3a63805208039 | 3b8102dad7e0a4313ebb93842590780b | 2,600 | PASSED |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cst... | C++ | 513480a6c7a715e237c3a63805208039 | 113709eaa0befa48730ac00869747661 | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#def... | C++ | 513480a6c7a715e237c3a63805208039 | 61d9658c25faac33d31bb53d3a5975bf | 2,600 | PASSED |
// Author -- xyr2005
#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
#define Finline __inline__ __attribute__ ((always_inline))
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
#define SZ(x) ((int)x.size())
#define mkpr std::make_pair
#define pb push_back
typedef long ... | C++ | 513480a6c7a715e237c3a63805208039 | 08141a54ae9c4cd9f44e28cc37895ea1 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define f first
#define s second
#define pii pair<int,int>
#define emp nullptr
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MAX_N = 1e5 + 7;
vector<int> g[MAX_N];
... | C++ | 513480a6c7a715e237c3a63805208039 | 9451be506b1a1dfb47c3f7aba939e705 | 2,600 | PASSED |
mx=1000000000
def solve():
a,b,c=map(int,input().split())
if(a>=c):
ans1=-1
ans2=c//a+1
elif(c>a*b or c==a*b):
ans1=1
ans2=-1
else:
ans1=1
ans2=c//a+1
print(ans1,ans2)
for _ in range(int(input())):
solve() | Python | 002801f26568a1b3524d8754207d32c1 | da687bae02561ee9c14a5e964e17b2ba | 1,000 | PASSED |
import sys
import math
data = sys.stdin.readlines()
for i in range(int(data[0])):
lista = list(map(int, data[i + 1].split()))
a = lista[0]
b = lista[1]
c = lista[2]
if c <= a:
print(-1,b)
else:
if a <= c/b:
print(1,-1)
else:
print(1,b) | Python | 002801f26568a1b3524d8754207d32c1 | f6076ec99b3bcfc6ed6999bacecd4d71 | 1,000 | PASSED |
t = int(input())
for _ in range(t):
a,b,c=map(int,input().split())
if(a>=c):
print(-1,end=" ")
else:
print(1,end=' ')
k=c//b
if(k>=a):
print(-1)
else:
print(b) | Python | 002801f26568a1b3524d8754207d32c1 | 288887ecaf255a9b945e388ebee8a644 | 1,000 | PASSED |
for _ in range(int(input())):
a,b,c=map(int,input().split())
x=-1
y=-1
if c>a:
x=1
if a*b>c:
y=b
print(x,y)
| Python | 002801f26568a1b3524d8754207d32c1 | 8e4ba97169a84ceb3a20afc699fde3f3 | 1,000 | PASSED |
for _ in range(int(input())):
a,b,c=map(int,input().split())
print(-1 if a>=c else 1,-1 if c/a>=b else b) | Python | 002801f26568a1b3524d8754207d32c1 | 7f62d51ca036e02b5b41584f4196dd37 | 1,000 | PASSED |
for _ in range(int(input())):
a,b,c=map(int,input().split())
ans1=1
ans2=b
kpa=a*b
sp=c/a
if sp>=b:ans2=-1
if a>=c:ans1=-1
print(ans1,ans2) | Python | 002801f26568a1b3524d8754207d32c1 | 8e109e86d12bd90342abe6cf8dbd3c38 | 1,000 | PASSED |
for _ in range(int(input())):
a,b,c=map(int,input().split())
print(-1if a>=c else 1,-1if c/a>=b else b) | Python | 002801f26568a1b3524d8754207d32c1 | a5293229ca59a9ac99c57f1123b38235 | 1,000 | PASSED |
tc = int(input())
for _ in range(tc):
a , b , c = map(int,input().split())
f , s = -1 , -1
if a * (b - 1) < c:
f = b - 1
if a < c:
f = 1
if a * b > c :
s = b
if a >= c:
s = b
print(f , s)
| Python | 002801f26568a1b3524d8754207d32c1 | 5d05055998b4b109520da3aa8d7ec53a | 1,000 | PASSED |
tc = int(input())
for _ in range(tc):
a , b , c = map(int,input().split())
f , s = -1 , -1
if a < c:
f = 1
if a * b > c :
s = b
print(f , s) | Python | 002801f26568a1b3524d8754207d32c1 | ee04fee4b20ea985d4c508147827d92d | 1,000 | PASSED |
for _ in range(int(input())):
a,b,c=map(int,input().split())
if a<=(c/b):
print(1,-1)
else:
if a>=c:
print(-1,b)
else:
print(1,b) | Python | 002801f26568a1b3524d8754207d32c1 | 08fe4640d640e89964c9ef865c49320b | 1,000 | PASSED |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <math.h>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <string>
#include <utility>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <vector>
using namespace std;... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 8c7005e2bf6ec6aef25fa507978043b7 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m=3000001,i,j,k,ans,l,y,x,z,c,t;
int a[101][101]={0},b[101];
bool can=false;
int main()
{
std::ios_base::sync_with_stdio(false);
cin>>n>>m;
if (m<3) {cout<<-1;return 0;}
for (i=1;i<=n;i++)
cin>>b[i];
for (i=0;i<m;i++)
{
cin>>x>>y;
a[x][y]=a[y][x]... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 6bc4eadda17d3c3790493b28adf928c3 | 1,200 | PASSED |
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<set>
#include<map>
using namespace std;
int sum=99999999, b[200]={0}, f[200];
bool T[200][200]={0};
vector< int > V[200];
int main()
{
int a, c, l, k;
scanf("%d ... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 1a56a3d75da25b772116b634a5dbafdb | 1,200 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX_N = 100 + 10, big = 1000 * 1000 * 1000 + 10;
long long a[MAX_N];
long long mini = big;
bool check[MAX_N][MAX_N], hast = false;
int main()
{
int n, m, z, t;
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m;... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | d23d96588e6fa9765fbc4d6a77779642 | 1,200 | PASSED |
#include <algorithm>
#include <cstdio>
#include <cmath>
/* sada moram da ucim i ovaj C++,evo naucio sam komentar da napisem */
using namespace std;
int a[1000];
int c[1000][1000];
int sum,n,m,i,j,k;
int main()
{
int x,y;
scanf("%d%d" , &n,&m);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
for ( i=0;i<m;i++)... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 7dab9140063aec3a6ded8d18d57d329a | 1,200 | PASSED |
#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cctype>
#include <set>
#include <bitset>
#include <algorithm>
#include <list>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ma... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 381c29b7058273aa9eb6df3de1336676 | 1,200 | PASSED |
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main(void)
{
int i,j,k,n,m,cost[105],arr[105][105]={0},a,b,mx=1000000000;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&cost[i]);
for(i=1; i<=m; i++)
{
scanf("%d%d",&a,&b);
arr[a][b]=1;
... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 2d86057cc40387c25ae59accca2e008f | 1,200 | PASSED |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int ck[105][105];
int main()
{
int arr[100005];
int m,n;
cin>>m>>n;
for(int i=1 ; i<=m ; i++)
cin>>arr[i];
for(int i=1 ;i<=n ; i++){
int u,v;
cin>>u>>v;
ck[u][v]=ck[v][u]=1;
}
int ans=INF;
... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | f1af651906de0c6a681f3476c8542bfe | 1,200 | PASSED |
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map <int , map <int , bool > > v ;
int price [1000000] ;
int res = 500000006 ;
int main() {
v.clear () ;
int a , b ;
cin>>a>>b ;
for (int i = 0 ; i<a ; i++)
{
cin>>price[i] ;
}
int x , y ;
for (in... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | 90766fc43ce0c9cb4fa984354ed1f6c6 | 1,200 | PASSED |
/**
* Author: Sehriyar Novruzov (n.sehriyar@hotmail.com)
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<ctime>
#include<fstream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#inc... | C++ | d90da1e932a6aa546bec4e1bd4b1fbec | e534e66e59ba63d64051e4f39913f2f1 | 1,200 | PASSED |
from sys import stdin
from math import ceil, gcd
# Input data
#stdin = open("input", "r")
n = int(stdin.readline())
arr = list(map(int, stdin.readline().split()))
arr.sort()
ans = [0] * n
j = n - 1
for i in range(0, n, 2):
ans[i] = arr[j]
j -= 1
j = 0
if n % 2 == 0:
for i in range(n - 3, -1, -2):
... | Python | 6443dffb38285b6deb74f2371d8d0cac | 1d1427274e19446d4f09d814b090d61a | 1,500 | PASSED |
n = int(input())
lst = list(map(int, input().split()))
lst.sort()
result = lst[n//2:]
for i in range(n//2):
result.insert(2*i + 1, lst[i])
cnt = 0
for i in range(1, n - 1):
if result[i - 1] > result[i] and result[i] < result[i + 1]:
cnt += 1
print(cnt)
print(' '.join(map(str,result))) | Python | 6443dffb38285b6deb74f2371d8d0cac | 5cb8d88b3e0741217b20d6cf8deedb97 | 1,500 | PASSED |
n=int(input())
a=sorted(list(map(int,input().split())))
arr=[0]*n
i=0
for j in range(n//2,n):
arr[i]=a[j]
i+=2
i=1
for j in range(n//2):
arr[i]=a[j]
i+=2
cnt=0
for i in range(1,n-1):
if arr[i-1]>arr[i]<arr[i+1]:cnt+=1
print(cnt)
print(*arr) | Python | 6443dffb38285b6deb74f2371d8d0cac | eea845592369450de54a77eb8171510a | 1,500 | PASSED |
n=int(input())
a=list(map(int,input().split()))
a=sorted(a)
l=[]
t=0
i=0
j=n//2
if(n==1):
print(0)
print(a[0])
elif(n==2):
print(0)
print(a[0],a[1])
else:
while(i<n//2 or j<n):
if(j<n):
l.append(a[j])
j+=1
if(i<n//2):
l.append(a[i])
i+=1
for i ... | Python | 6443dffb38285b6deb74f2371d8d0cac | 509938b03c0ad44675181ed66d80e283 | 1,500 | PASSED |
n=int(input())
a=list(map(int,input().split()))
a.sort()
g=[]
h=[]
for j in range(n//2):
g.append(a[j])
for j in range(n//2,n):
h.append(a[j])
gx=len(g)
hx=len(h)
gy=0
hy=0
c=0
k=[]
while gy<gx or hy<hx:
if gy<gx and hy<hx:
if g[gy]<h[hy]:
k.append(h[hy])
k.append(g[gy])
... | Python | 6443dffb38285b6deb74f2371d8d0cac | b5ed1ddf94bbaed8404a95442f21f9ce | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.