source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N=200050;
multiset<int> ri;
struct Node{
int l,r;
}nod[N];
int T,n,nex[N],val[N],pos,gg[N],ans,cnt,sta[N];
bool cmp(Node x,Node y){return x.l<y.l;}
int find_p(int x){
if(!cnt || nod[sta[1]].l<=x) return 0;
int l=1,r=cnt;
while(l<r){
int mid=((l+r)>>1);
i... | C++ | 58d7066178839b400b08f39b680da140 | d5df562681ec7a4bd14b8c71cba35b44 | 2,300 | PASSED |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <set>
#define M 8000005
using namespace std;
int t,n,L[M],R[M],b[M];
int read(){
char c=getchar();int ans=0;bool flag=1;
while (c<'0'||c>'9') flag&=(c!='-'),c=getchar();
while (c>='0'&&c<='9') ans=ans*10+c-'0',c=g... | C++ | 58d7066178839b400b08f39b680da140 | f666d5f0ba0af3d4dc2168b30b2e27c3 | 2,300 | PASSED |
#include<bits/stdc++.h>
#define maxn 800005
using namespace std;
int t,l[maxn],r[maxn],b[maxn],n,m,a[maxn],ans;
map<int,int> mp;
set<int> sets;
set<int>::iterator it;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
m=0;
mp.clear();
sets.clear();
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++)
{
cin>... | C++ | 58d7066178839b400b08f39b680da140 | b6ae3fd4b39d919c666f4deb9f03cf3b | 2,300 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll l[200005],r[200005];
int save[10000000],t[10000000],raod[10000000];
ll n,pown = 1;
set<ll>st;
pair<ll,ll>a[200005];
vector<ll>g;
unordered_map<ll,ll>mp,rao;
void upd(ll x,ll L,ll R,ll p,ll q){
... | C++ | 58d7066178839b400b08f39b680da140 | 4a35fd40cfabefcf38220b0082c21e1b | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int T,n,m,p,k,a[1200010],ans[4800010],cnt;
int tree[4800010],add[4800010],aft[1200010],lt[4800010],rt[4800010];
struct node{
int l,r,id;
}s[200010];
bool cmp(node a,node b){
return a.r==b.r?a.l<b.l:a.r<a.r;
}
void build(int l,int r,int t){
tree[t]=add[t]=0;
if(l==r) ret... | C++ | 58d7066178839b400b08f39b680da140 | 54e4fe7fd7685f3ca5bdd1bf2af4c29d | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
#define re register
#define int long long
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= ... | C++ | 58d7066178839b400b08f39b680da140 | 0c38af4aceb04dad2e970621b4450be9 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
#define re register
#define int long long
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= ... | C++ | 58d7066178839b400b08f39b680da140 | bc4864e4d93399518478176c8b8bedd4 | 2,300 | PASSED |
import java.io.*;
import java.util.*;
public class Main
{
final int dx[]={-1,0,1,0};
final int dy[]={0,-1,0,1};
private void solve()throws IOException
{
int n=nextInt();
int m=nextInt();
char grid[][]=new char[n+1][m+1];
int degree[][]=new int[n+1][m+1];
for(int i=1;i<=n;i++)
{
String s=nextLine();
... | Java | 9465c37b6f948da14e71cc96ac24bb2e | 64670edefe95c3e5802d9586b3a92587 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n,m, maxn=2001, maxm=2001;
vector<string> gr(maxn, string(maxm,'.'));
struct Pt{
int i, j;
Pt(int _i, int _j):i(_i),j(_j){}
};
bool isValid(Pt p){
return 0<=p.i && p.i<n && 0<= p.j && p.j<m;
}
vector<Pt> dirs={Pt(-1,0),Pt(1,0),Pt(0,-1),Pt(0,1)};
... | C++ | 9465c37b6f948da14e71cc96ac24bb2e | 73f2b7a77264ccedd0473e007561757d | 2,000 | PASSED |
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define fl(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define mod 998244353
#define inf 1e9
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mx 2005
... | C++ | 9465c37b6f948da14e71cc96ac24bb2e | bfca475c1693c8d5652f61ebf84ce7c8 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fRead(x) freopen(x,"r",stdin)
#define fWrite(x) freopen (x,"w",stdout)
#define LL long long
#define ULL unsigned long long
#define ff first
#define ss second
#define pb push_back
#define ... | C++ | 9465c37b6f948da14e71cc96ac24bb2e | e687ff4cfa61bf5711712190f454ca5a | 2,000 | PASSED |
#include<iostream>
#include<cstring>
int n, a,c,t,k;
int aa[100001];
int main() {
std::cin >> n >> k;
std::cin >> a;
t = a;
c = a;
for (int i = 1; i < n; ++i) {
std::cin >> aa[i];
t = std::min(aa[i], t);
c = std::max(aa[i], c);
}
if (k == 1) std::cout << t;
else i... | C++ | ec1a29826209a0820e8183cccb2d2f01 | 526dc0a7704fe4b123fc76b73dc2f9fb | 1,200 | PASSED |
# include <bits/stdc++.h>
using namespace std;
long long n, a=0,b=0,c=-1000000001,t=1000000001,m,k;
long long g = -1000000001,v=0,cnt = 0,ans = 0,aa[100001],bb[1000001],cc[100001];
double p1, p2, p3, p4;
int main()
{
cin>>n>>k;
cin>>a;
if(n==1){
t =a;
}
for (long long i = 1; i <n ; ++i) {
... | C++ | ec1a29826209a0820e8183cccb2d2f01 | 320d9d81208f989c34eb52deffd718a6 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
using namespace std;
ll n,m,sum,num,sam,nam,a[100001],s[100001];
int main(){
cin>>n>>m;
for(int i = 1;i <= n;i++){
cin>>a[i];
s[i]=a[i];
}
sort(a+1,a+n+1);
if(m==1){
cout<<a[1];... | C++ | ec1a29826209a0820e8183cccb2d2f01 | d58ff2a11639b953711bd987406d6d0d | 1,200 | PASSED |
#include<bits/stdc++.h>
#include <complex>
#define Write freopen("out.txt","w",stdout)
#define Read freopen("in.txt","r",stdin)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sl(a) scanf("%lld",&a)
#define sll(a... | C++ | ec1a29826209a0820e8183cccb2d2f01 | 8dc6cbcfc018519e2da258a62cd53535 | 1,200 | PASSED |
/**
Solution by Abil
**/
#include <bits/stdc++.h>
# define fr first
# define sc second
# define pb push_back
# define mk make_pair
# define ll long long
# define sz(s) s.size()
# define all(s) s.begin(),s.end()
using namespace std;
const long long N = (1e6 + 10);
int arr[N],arr1[N];
int main()
{
int n, k;
ci... | C++ | ec1a29826209a0820e8183cccb2d2f01 | 25e90da28ff61e432a3a1b7b7944c12d | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MaxN=100001;
int a[MaxN];
int pre[MaxN];
int suf[MaxN];
int main(){
int N,K,i,j,p=-1000000001,q=1000000001,pos;
cin>>N>>K;
for(i=0;i<N;i++){
cin>>a[i];
p=max(a[i],p);
q=min(q,a[i]);
pre[i]=q;
}
q=... | C++ | ec1a29826209a0820e8183cccb2d2f01 | d37e2d6c94be6a0a8f69640e8a13334e | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int main() {
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
if (k >= 3) {
ll curr = v[0];
for (int i = 1; i < n; i++)
curr = max(curr, v[i]);
cout << curr;
return 0;
}
if (k == 1) {
ll curr = v[... | C++ | ec1a29826209a0820e8183cccb2d2f01 | c49c6b4d147cd52ff0e323542220b0d9 | 1,200 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <stdio.h>
#include <functional>
using namespace std;
const int N = 100001;
int n, k;
vector<int>a;
int prefl[N], prefr[N], m = -2 * 10e9;
int main() {
cin >> n >> k;
for(int i = 0; i < n; i++)... | C++ | ec1a29826209a0820e8183cccb2d2f01 | 665f35eb39441d8f45ad2fc2deea9eaa | 1,200 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
int a[111111];
int b[111111];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(a,... | C++ | ec1a29826209a0820e8183cccb2d2f01 | f7bf293d17bf382697ee30413a598c2a | 1,200 | PASSED |
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1e5+10;
int a[maxn], n, k;
int main(){
scanf("%d%d", &n, &k);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
int ans;
if(k == 2) ans = max(a[0], a[n-1]);
else {
sort(a, a+n);
if(k == 1) ans = a[0];
... | C++ | ec1a29826209a0820e8183cccb2d2f01 | f6fc14fc48ea305cd6655a535305bf17 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define dbg(nazwa) cerr << #nazwa ": " << (nazwa) << "\t"
#define nl cerr << endl
#define pb push_back
using namespace std;
const int N = 1e6;
int dp[N + 3], t[N + 3];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
cin... | C++ | f33991da3b4a57dd6535af86edeeddc0 | c4e3ff8d822f3b895ab38c2e463086f2 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e6;
ll sum[N],a[N];
ll dp[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
for(ll i=1; i<=n; i++)
{
cin>>a[i];
dp[a[i]]=1;
}
for(ll i=1;i<=N; i++)
{
i... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 374a3ce39458cb8895154456ddf3405b | 1,500 | PASSED |
// in the name of god
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
//#include <unistd.h>
using namespace std ;
using namespace __gnu_pbds;
/*
struct Mat{int n;int a[maxn][maxn];Mat(bool x=0){for(int i=0;i<maxn;i++)for(int j=0;j<maxn;j++)a[i][j]=((i==j)?x:0);... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 732773db3b7d639a920038182a84cfc6 | 1,500 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
int dp[1000005];
int main()
{
int n,ans=0;
scanf("%d",&n);
while (n--)
{
int a;
scanf("%d",&a);
dp[a]=max(dp[a],1);
for (int i=2*a;i<1000005;i+=a)
dp[i]=max(dp[i],1+dp[a]);
ans=max(ans,dp[a]);
}
printf("%d",ans);
}
| C++ | f33991da3b4a57dd6535af86edeeddc0 | 01197c7b1d7277ab98d37862c5e823c2 | 1,500 | PASSED |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#incl... | C++ | f33991da3b4a57dd6535af86edeeddc0 | b4cae59fff315c0369ecb943b7bd30d1 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int N = 2e6+5;
const int mod = 1e9 + 7;
ll a[N], b[N], c, dp[N], dis;
char o;
pair <int, int> p;
bool mark, h = false,... | C++ | f33991da3b4a57dd6535af86edeeddc0 | d7647fc840f778c18b122b019f0e9db9 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int N = 2e6+5;
const int mod = 1e9 + 7;
ll a[N], b[N], c, dp[N], dis;
char o;
pair <int, int> p;
bool mark, h = false, ... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 4c196f5ad8daaf5ec84a9a0d12e4e442 | 1,500 | PASSED |
//g++ 5.4.0
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define mp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int a[n];
int mi=0;
int c[1000001]={0};
int d[1000001]={0};
int v[... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 7a139ca4758cca7cafee85eec59c05ae | 1,500 | PASSED |
/*
ID: barish21
LANG: C++14
TASK: test
*/
/****Author: Barish Namazov****/
#include <bits/stdc++.h>
using namespace std;
/***TEMPLATE***/
#define intt long long
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define sz(s) (int)s.size()
#define ms0(arr) memset(arr,0,sizeof arr)
#define... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 4f52fb282554ca99526051ff4c87ac9c | 1,500 | PASSED |
//****author RKN
//DATE 5/2/2020 5.15 AM
// ***************DREAM IS NOT THAT YOU SEE WHILE SLEEPING BUT IT IS WHAT DONT LET YOU SLEEP************//
/////////////////////// machayenge......sala hoga apne se bhi ek din ///////////////////////////////////////////////////////////
#include<bits/stdc++.h>
#in... | C++ | f33991da3b4a57dd6535af86edeeddc0 | 9954c1d6a8f805c6644c9adf28e5d4b1 | 1,500 | PASSED |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long mt;
#define rep(a, b, i) for(re... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 589d55755f01c5e1fd6d20f389c141ee | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int mx=1234567;
typedef long long ll;
int a[mx],b[mx];
bool ok[mx];
int main()
{
ll n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=0;i<m;i++)
{
cin>>b[i];
}
ll ans=0;
for(int i=0;i<m;i++)
{
for(int j=1;j<=n;j++)
{
ok[j]=false;
}
... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | a92519243549fb4d903bb3a90f7afec3 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int buk[500],day[1000];
bool dp[500];
int main(){
int n,m,ans=0;
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> buk[i];
}
for(int i=0;i<m;i++){
cin >> day[i];
}
stack<int> st_ori,st_sup1;
int st_sup2;
for(int i=0;i<m;i++){
if(!dp[day[i]-1]){
st_sup1.push(day... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | c1754af581fc9e5579c68c135cf23104 | 1,600 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int maxn = 1005;
using ll = long long;
int w[maxn], b[maxn];
int main(int argc, char const *argv[])
{
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i){
scanf("%d", &w[i]);
}
for(int i = 1; i <= m; ++i){
scanf("%d", &b[i]);
}
ll ... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 8c3382845949f7efb9798be71af86ac0 | 1,600 | PASSED |
#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define rep(i,t,n) for(int i=t;i<n;i++)... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 18d5b5b726cd8b6d808b62bd82e0c26f | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[505],w[505],b[1005],c[505];
int main()
{
int n,m,i,j,x,ans;
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
scanf("%d",&w[i]);
j=1;
for(i=0; i<m; i++)
{
scanf("%d",&x);
b[i]=x;
if(c[x]==0)
{
c[x]=1;
... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | b19394d15ef92c2dca238612683b017b | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;cin>>n>>m;
int i,j;
vector<int> w(n);
for(i=0;i<n;i++)
cin>>w[i];
unordered_set<int> s;
list<int> l;
vector<int> d(m);
for(i=0;i<m;i++){
int a;cin>>a;
if(s.count(a)==0)
{
s.insert(a);
l.push_back(a-1);
}
... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 78dbc95e57d392bf699aa891ffe99000 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;cin>>n>>m;
int i,j;
vector<int> w(n);
for(i=0;i<n;i++)
cin>>w[i];
unordered_set<int> s;
list<int> l;
vector<int> d(m);
for(i=0;i<m;i++){
int a;cin>>a;
if(s.count(a)==0)
{
s.insert(a);
l.push_back(a-1);
}
... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 126860f347ef410c9bca076b51fcf4af | 1,600 | PASSED |
/* SHUBHAM KESHARWANI */
#include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define fr(a,b) for(ll i=a;i<b;i++)
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin>>t; while(t--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#pragma GCC ta... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 6ea451046e8d64ba2e591897eaf69995 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 500005;
int n, m;
int w[505];
int b[1005];
int stk[505];
bool vis[505];
void solve() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) {
scanf("%d", &w[i]);
vis[i] = 0;
}
for(int i = 1; i <= m; ++i)
... | C++ | a18edcadb31f76e69968b0a3e1cb7e3e | 0f42aac1d45d57633fef3f04fb71b2f6 | 1,600 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<bitset>
using namespace std;
#define PII pair<int,int>
#define X first
#define Y second
#define PB push_back
#define CLR(... | C++ | c527bf72a894d32dbfcc2097343bb22c | 8d20187e8a1fe299b8fc6af57d81869e | 2,100 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<bitset>
using namespace std;
#define PII pair<int,int>
#define X first
#define Y second
#define PB push_back
#define CLR(... | C++ | c527bf72a894d32dbfcc2097343bb22c | 638417fc0ac47169d0de35f0e6691ba6 | 2,100 | PASSED |
/*
||Sri:||
__|
______________|_________________________
| | ___| | | ___| | | |___
/\ /\ | |___ | | |___| | | |___|
/ \/ \ | ___| | | |_/ |___| |___
I am a beginner. Feel free to send tutorials/help ... | C++ | c527bf72a894d32dbfcc2097343bb22c | 8a1cb416105269e9f329b351db6ad2b4 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define MAXN 310
using namespace std;
class MaxFlow {
public:
vector<vector<int> > initial_g, g; // initial_g: stores initial capacities which should not be changed.
vector<int> vis, from;
int n, s, t; // no. of vertices, src,... | C++ | c527bf72a894d32dbfcc2097343bb22c | d7028e57c253126865bad1aa057a3df2 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 220
int cap[MAXN][MAXN];
int deg[MAXN], adj[MAXN][MAXN];
int q[MAXN], prv[MAXN];
int dinic(int s, int t, int n) {
int flow = 0;
memset(deg, 0, sizeof(deg));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (cap[i][j] || cap[j][i... | C++ | c527bf72a894d32dbfcc2097343bb22c | 1771204b539f371a06cc57133e9e4c72 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 330
int cap[MAXN][MAXN];
int adj[MAXN][MAXN];
int ans[MAXN][MAXN];
int deg[MAXN];
int q[MAXN];
int prv[MAXN];
int acc, nn, acc2;
int dinic(int n, int s, int t) {
memset(deg, 0, sizeof(deg));
int flow = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; ... | C++ | c527bf72a894d32dbfcc2097343bb22c | e29ee7aeeadca0f6543330497698de18 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAX_N=1e2+10;
const int MAX_M=1e5+10;
const int INF=1e9+10;
vector <int> g[MAX_N*2];
pair<pair<int,int>,int> e[(3*MAX_N+MAX_M)*2];
int N,M,a[MAX_N],b[MAX_N],cnt=0,S,T,ans[MAX_N][MAX_N],dist[MAX_N*2];
queue <int> Q;
bool vis[MAX_N*2];
void add_edge(int u,int v,in... | C++ | c527bf72a894d32dbfcc2097343bb22c | 0f061058c4d29a88bd49d108417fa646 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAX_N=1e2+10;
const int MAX_M=1e5+10;
const int INF=1e9+10;
vector <int> g[MAX_N*2];
pair<pair<int,int>,int> e[MAX_M];
int N,M,a[MAX_N],b[MAX_N],cnt=0,S,T,ans[MAX_N][MAX_N],dist[MAX_N*2];
queue <int> Q;
bool vis[MAX_N*2];
void add_edge(int u,int v,int cost){
g[... | C++ | c527bf72a894d32dbfcc2097343bb22c | 81b0e6935452ab1e2a33497323655b64 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAX_N=1e2+10;
const int MAX_M=2e2+10;
const int INF=1e9+10;
vector <int> g[MAX_N*2];
pair<pair<int,int>,int> e[(3*MAX_N+2*MAX_M)*2];
int N,M,a[MAX_N],b[MAX_N],cnt=0,S,T,ans[MAX_N][MAX_N],dist[MAX_N*2];
queue <int> Q;
bool vis[MAX_N*2];
void add_edge(int u,int v,... | C++ | c527bf72a894d32dbfcc2097343bb22c | 98c3270e2dc1af0a43ab6b3244871e45 | 2,100 | PASSED |
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define SRC 254
#define SNK 255
using namespace std;
int n, m, a[256], b[256], been[256], from[256], cap[256][256], tot, tot2, where, prev1, next1, path_cap;
vector<int> adj[256];
void connect(int A, int B, int AB, int BA) {
adj[A].push_back(B... | C++ | c527bf72a894d32dbfcc2097343bb22c | fb76972288b4bca6f610ed8fd0abee72 | 2,100 | PASSED |
#include <cstdio>
#include <algorithm>
using namespace std;
const int max_n = 2e5 + 5;
int n, m, w, a[max_n], d[max_n];
bool Check(int k) {
for (int i = 1; i <= n; i++)d[i] = a[i] - a[i - 1];
int u = 0, sum = 0;
for (int i = 1; i <= n; i++) {
sum += d[i];
if (sum < k) {
int t... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 1905372c4c6d4471e02f0003ce0907ee | 1,700 | PASSED |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define all(x) (x).begin() , (x).end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl '\n'
#define MAX 1000000
typedef long long int ll;
using namespace ... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | be31b789c67144690068c1a0f4a8b912 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define all(x) (x).begin() , (x).end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl '\n'
#define MAX 1000000
typedef long long int ll;
using namespace ... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 8cb9aac4513a59322b1f0b60a0fe505c | 1,700 | PASSED |
/* By : rupesh282
* link : https://codeforces.com/problemset/problem/460/C
* */
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define all(x) (x).begin() , (x).end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define en... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 718e6f6306244fd9ba0b5ab98694addc | 1,700 | PASSED |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
#define FILE "lucky"
#define ull unsigned long long
#define ld long double
#define rev reverse
#define pob pop_back()
#define sz size()
#define bb begin()
#define ee e... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 71ce10d5de5770736c6f6c25f572103a | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sqr(x) ((x) * 1LL * (x))
#define freopen(x) freopen(x".in", "r", stdin), freopen (x".out", "w", stdout);
#define sz(x) int(x.size())
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 859bdb2448afaec5bbc6c463a3374891 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define PI 3.14159265
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define INF 1000000000000000000
ll max(ll a,ll b)
{
... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 31e43fc32ae909a7282a9099fda9165e | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int add[100010];
int a[100010];
int n,m,w;
bool check(int d){
memset(add,0,sizeof add);
int cnt=0;
for(int i=1;i<=n;i++){
add[i]+=add[i-1];
while(add[i]+a[i]<d && cnt<m){
add[i]++;
add[min(n+1,i+w)]--;
cnt++;
}
if(cnt==m && add[i]+a[i]<d) return false;
}... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 66cca489ac49ea7723368e94d789d1f4 | 1,700 | 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;
typedef long long int lli;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<lli,lli> pll;
typedef std::vector<lli> vll;
typedef std::... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | a0edabd7e1bcb45599520ea3513d821f | 1,700 | 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;
typedef long long int lli;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<lli,lli> pll;
typedef pair<int,int> pii;
... | C++ | 48c8dc603511fd3f0e6ad00dfc801a7e | 5d2e48631d58f9ad533134b5a6e70fdb | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
while(isdigit(... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | d3f45aa8509b4caea54e7c3b24f59245 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long nused[2000001];
long long n, num[200000];
long long init_dist[2000001];
long long thisused[2000001];
bool capped[2000001];
int main() {
ios::sync_with_stdio(false);
cin>>n;
for (long long i = 0; i < n; i++) {
cin>>num[i];
init_dist[num[i]]++;
}
bool di... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | 005d717eb3e555169f16ab8609564e82 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// This code uses the bossle/cp library
// Available at https://github.com/bossle/cp
// #pragma STDC FENV_ACCESS OFF
// #pragma STDC FP_CONTRACT ON
// #pragma STDC CX_LIMITED_RANGE ON
// #pragma GCC optimize "O3"
namespace cp_base {
auto init = (
ios::sync_with_stdio(... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | 16e99c65ba72f6ae586ddf05f44fb2c2 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int P = 2e6 + 1;
const int M = 1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= M) {
a -= M;
}
return a;
}
int mul(int a, int b) {
return 1LL * a * b % M;
}
int n;
struct segment_tree {
struct node {
vector<int> reqs;
... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | 0cf70e01fd6f04d3b376dc3ddcead5cf | 2,900 | PASSED |
/***********Template Starts Here***********/
#include <bits/stdc++.h>
#define pb push_back
#define nl puts ("")
#define sp printf ( " " )
#define phl printf ( "hello\n" )
#define ff first
#define ss second
#define POPCOUNT __builtin_popcountll
#define RIGHTMOST __builtin_ctzll
#define LEFTMOST(x) (63-__builtin_clzll((... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | 87a886ed149892c0df2e2d38a4e9fd12 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int SITO_MAX = 2000005;
int f[SITO_MAX+1];
vector<int> prosti;
struct sito {
sito() {
for (int i=2; i<=SITO_MAX; i++) {
if (f[i] == 0) {
f[i] = i;
prosti.push_back(i);
... | C++ | 816a82bee65cf79ba8e4d61babcd0301 | 19313b21a0ae21b27569e3f716aa707e | 2,900 | PASSED |
import sys
import time
mod=1000000007
def sieve(s):
is_not_prime=[False]*(s+1)
prime=[]
small=[0]*(s+1)
cnt=[0]*(s+1)
other=[0]*(s+1)
for i in xrange(2, s+1):
if not is_not_prime[i]:
prime.append(i)
small[i]=i
cnt[i]=1
other[i]=1
for p in prime:
next=p*i
if next>s:
break
is_not_prime[... | Python | 816a82bee65cf79ba8e4d61babcd0301 | a6c9d900ce4a35b98ae2dd0c1b114598 | 2,900 | PASSED |
import sys
import time
mod=1000000007
def sieve(s):
is_not_prime=[False]*(s+1)
prime=[]
small=[0]*(s+1)
cnt=[0]*(s+1)
other=[0]*(s+1)
for i in xrange(2, s+1):
if not is_not_prime[i]:
prime.append(i)
small[i]=i
cnt[i]=1
other[i]=1
for p in prime:
next=p*i
if next>s:
break
is_not_prime[... | Python | 816a82bee65cf79ba8e4d61babcd0301 | 1415b8e07d410c938e44d39596767ce0 | 2,900 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
// 2*7*11 7*13 11*13
public class d {
static int N = 2000001;
static final long MOD = (int) (1e9+7);
public static void main(String[] args) {
int[] pf = new int[N];
for(int i=2;i<N;i++) {
if(pf[i] != 0)
continue;
for(int j=i;j<N;j+=i)
pf[j] = i;
... | Java | 816a82bee65cf79ba8e4d61babcd0301 | dc0605efb790e400ae778323f0beab40 | 2,900 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.util.Random;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import ... | Java | 816a82bee65cf79ba8e4d61babcd0301 | 636a49d74d9ae4aeb8142c5cfc578729 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define fio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define ull unsigned long long int
#define endl "\n"
#define PB(x) push_back(x)
#define fi first
#define si second
#define mp make_pair
#... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | bd63184e53e4357dc7d9a4209b1c4f9f | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7
typedef long long int ll;
#define fori(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define foria(i, a, b) for (ll(i) = (a); (i) <= (b); (i)++)
#define foriar(i, a, b) for (ll(i) = (a); (i) >= (b); (i)--)
#define ff first
#define ss second
#define p... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 8a33562d1801a5ff2b55198bb857f3b2 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,k,t,m,a,b;
vector<long long>ans;
vector<long long>cc;
bool si=false;
int x;
pair<int,int>cnt[100005];
int main(){
ios_base::sync_with_stdio();
cin.tie(0);
cin>>t;
while(t--){
si=true;... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | dc1a41bb56625638d9bb0be4444a2713 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
bool isSorted(pair<int, bool>* a , int n) {
for (int i = 0 ; i < n - 1 ; i++) {
if (a[i].first > a[i + 1].first) {
return false;
}
}
return true;
}
void solve() {
int n ;
cin >> n;
pair<int, bool> a[n];
for (int i = 0 ; i < n ; i++) {
cin >> a[i].first;
}... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 95512205a66fa8ae3921a55453ddebeb | 1,300 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace st... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 633aee853d91816253240d9a5e63a669 | 1,300 | PASSED |
#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 AB_BHI_NI_DEGI \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb push... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 620ee5525f58437a3e55891f636a206f | 1,300 | PASSED |
#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 AB_BHI_NI_DEGI \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb push... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 9e6cf74d0b31e83937e42ecf3e2b505a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
int n;
while(t--)
{
cin>>n;
int A[n],B[n],C[n];
for(int i=0;i<n;i++)
{cin>>A[i];C[i]=A[i];}
for(int i=0;i<n;i++)
cin>>B[i];
int count1=0,count0=0;
sort(... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | bb96f82d0cbae48599fb7b095fc9de77 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 9a333fbe549307fb39e55edcbf05e155 | 1,300 | PASSED |
/*
@Author: Ayush Shah :)
@Institution: BIT Mesra :)
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of ele... | C++ | 4bf3a94119d08a9cd6075a67d0014061 | 5965633eaed9adcc02b9010885c2d9b7 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3fLL
#define mod 1000000007
#define pb push_back
#define sq(x) ((x)*(x))
#define sz(a) ((int)a.size())
#define x first
#define y second
#define eps 1e-8
#define bpt(x) (__builtin_popcount(x))
#define bptl(x) (__builtin_popcountll(x... | C++ | 08fa04303060d38d6cd0f3a321a527ad | a81a315971a4882f60fc0303f0cdcf21 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3fLL
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define sq(x) ((x)*(x))
#define x first
#define y second
#define eps 1e-8
#define bpt(x) (__builtin_popcount(x))
#define bptl(x) (__builtin_popcountll(x))
#define... | C++ | 08fa04303060d38d6cd0f3a321a527ad | 690074a46fe62adabe7ca4382b858dc8 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=0,sum=100001;
string s;
cin>>n>>s;
vector<int> v[200005];
v[sum].push_back(0);
for(int i=0;i<n;i++)
{
sum+=(s[i]=='1'?1:-1);
v[sum].push_back(i+1);
}
for(int i=50000;i<150000;i++)
{
... | C++ | 08fa04303060d38d6cd0f3a321a527ad | 736a0896dabb79b43fd0ef9549e2943f | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ok printf("ok\n");
#define pf printf
#define sc scanf
#define br printf("\n")
#define scs(a) scanf("%s",a)
#define sc1(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
#define sc3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sc1l(a) scanf("%lld",&a)
#define s... | C++ | 08fa04303060d38d6cd0f3a321a527ad | edfea91bfeabb744e5a55ed030bfcf04 | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#define inf (100000)
using namespace std;
int n,p[100001],cnt,f[200001];
void read(){
char i=getchar();
while(i<'0'||i>'9')i=getchar();
while(i>='0'&&i<='9'){p[++cnt]=i-'0';if(p[cnt]==0)p[cnt]--;i=getchar()... | C++ | 08fa04303060d38d6cd0f3a321a527ad | b87709db5d4be8bc13fe1a7a6cbbcfa5 | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#define inf (100000)
using namespace std;
int n,p[100001],cnt,f[200001];
void read(){
char i=getchar();
while(i<'0'||i>'9')i=getchar();
while(i>='0'&&i<='9'){p[++cnt]=i-'0';if(p[cnt]==0)p[cnt]--;i=getchar()... | C++ | 08fa04303060d38d6cd0f3a321a527ad | bd8c76fe87d7eb5ed58978f94dc38e3b | 1,500 | PASSED |
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<int, int> mp;
int n;
string s;
int main()
{
cin >> n >> s;
int ans = 0;
int rs = 0;
for (int i = 0; i < n; ++i)
{
rs += (s[i] == '0') ? -1 : 1;
if (mp.find(rs) == mp.end())
{
mp[rs] = i;
}
else
{
int dis = i - mp[rs... | C++ | 08fa04303060d38d6cd0f3a321a527ad | b32ffc0c8b09c654e91141dad839ffbc | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;
const int maxn=100020;
char s[maxn];
int n,cnt[maxn][2],sub[maxn];
map<int,int> mp;
int main()
{
scanf("%d",&n);scanf("%s",s+1);
for(int i=1;i<=n;i++)
{
if(s[i]=='0') cnt[i][0]=cnt[i-1][0]+1,cnt[i][1]=cnt[i-1][1];
else if(s[... | C++ | 08fa04303060d38d6cd0f3a321a527ad | 3f3b1536109b9058c43b4d268604e319 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define pb push_back
int x[maxn*2+10];
vector<int> v[maxn*2+10];
int main()
{
int n;
string s;
//for(int i=0;i<maxn*2;i++)v[i].clear();
//cout<<"@@@@@@@@@@"<<endl;
for(int i=0;i<=maxn*2;i++) v[i].clear();
cin>>n>>s;
x[0]=1000... | C++ | 08fa04303060d38d6cd0f3a321a527ad | df63f0386557be61f5eb9b32eddb9797 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define pb push_back
int x[maxn*2+10];
vector<int> v[maxn*2+10];
char s[maxn+5];
int main()
{
int n;
//for(int i=0;i<maxn*2;i++)v[i].clear();
//cout<<"@@@@@@@@@@"<<endl;
for(int i=0;i<maxn;i++) v[i].clear();
scanf("%d",&n);
sc... | C++ | 08fa04303060d38d6cd0f3a321a527ad | c4f683bee738d1bc8f19319d3a781b63 | 1,500 | PASSED |
import java.math.BigInteger;
import java.util.Scanner;
/*
527
4573
1357997531
2268482861
2268482869
4265
4263
*/
public class b {
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
String n = in.next();
in.close();
// n = "";
// for(int i = 0; i < 1E5; ++i)
// {
... | Java | bc375e27bd52f413216aaecc674366f8 | 52b671c2c8752b9c7664bf0bfe08b084 | 1,300 | PASSED |
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String n = scan.next();
StringBuilder s = new StringBuilder(n);
String ans = "";
int in = -1;
int k = -1;
for (int i = 0; i < n.length()... | Java | bc375e27bd52f413216aaecc674366f8 | 5280fff29f7c099124e40ae666cffd2a | 1,300 | PASSED |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Xi Lin (zimpha@gmail.com)
*... | Java | bc375e27bd52f413216aaecc674366f8 | e141257dac949ddbf4268db1d25c53c4 | 1,300 | PASSED |
import java.util.Scanner;
public class B {
public static int toInt(char c) {
return (int) c - '0';
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
char[] c = in.nextLine().toCharArray();
// SWAP SMALL
int l = toInt(c[c.length - 1]), t;
boolean found = false;
for (int ... | Java | bc375e27bd52f413216aaecc674366f8 | 27aefd861b6a2885a7f0dcdecc0bf04c | 1,300 | PASSED |
import java.util.Scanner;
public class B {
private static char[] c;
private static int len, l;
public static int toInt(char c) {
return (int) c - '0';
}
public static boolean solve(int i) {
if (i >= 0 && i < len) {
int x = toInt(c[i]);
if ((x & 1) == 0) {
if (x < l) {
char p = c[i];
c[i... | Java | bc375e27bd52f413216aaecc674366f8 | 4b9d89c7b6181070f3e97f8902eec698 | 1,300 | PASSED |
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
public class Solution {
public String currency() {
Scanner s = new Scanner(System.in);
char[] n = s.next().toCharArray();
s.close();
for (int i = 0;... | Java | bc375e27bd52f413216aaecc674366f8 | 0d6d48aefe49a6146b3c87733469b25f | 1,300 | PASSED |
import static java.lang.System.in;
import java.io.IOException;
import java.util.*;
public class Main
{//static{ System.out.println("hello");}
static byte[] buffer = new byte[8192];
static int offset = 0;
static int bufferSize = 0;
static void print(char a[])
{for (int i=0;i<a.length ;i++)
... | Java | bc375e27bd52f413216aaecc674366f8 | 4cdc23d4e75e20de86d43a6d347cdb85 | 1,300 | PASSED |
import java.util.Scanner;
public class AntonandCurrencyYouAllKnow {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
String todayRate = sc.next();
char swap = todayRate.charAt(todayRate.length() - 1);
... | Java | bc375e27bd52f413216aaecc674366f8 | 7cb4134b6af1159d9f30c106c0cfdf29 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main2 {
public static void main(String args[]) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
boolean ok = false;
int kouhoindex = ... | Java | bc375e27bd52f413216aaecc674366f8 | 2c0d475d2f1815ff72e7ae106becdecd | 1,300 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.