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<cstdio>
#include<iostream>
using namespace std;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int dot_left = 0;
int n,m;
char c[2005][2005];
bool in_bound(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m;
}
bool valid(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && c[i][j] ... | C++ | 9465c37b6f948da14e71cc96ac24bb2e | 418d5bd96ec24be391ac1076774fb361 | 2,000 | PASSED |
//package pkg515b;
import java.util.*;
public class Main
{
static int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
public static void main(String[] args)
{
Main obj=new Main();
Scanner sc=new Scanner(System.in);
int n=sc.nextInt()... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | 19e05551a1b0955283f76af3b1582968 | 1,300 | PASSED |
import java.util.*;
public class Solution {
static int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
public static void... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | 5dd753c41d5019ca68efa49bb28c12bc | 1,300 | PASSED |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf515b {
static BufferedReader __in;
static PrintWriter __out;
static StringTokenizer input;
public static void main(String[] args) throws IOException {
__in = new BufferedRead... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | 7efcdd1895916a6411e58080892b05cd | 1,300 | PASSED |
import java.io.*;
import java.util.*;
public class Main
{
private void solve()throws IOException
{
int n=nextInt();
int m=nextInt();
int b=nextInt();
boolean happyboys[]=new boolean[n];
while(b-->0)
happyboys[nextInt()]=true;
boolean happygirls[]=new boolean[m];
int g=nextInt();
while(g-->0)
h... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | 8156060c36575a67fcceb1710672d374 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class MeetInTheMiddle_515B {
public static void main(String[] args) throws IOException {
new MeetInTheMiddle_515B().run();
}
private void run() throws... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | b7be42edf605a9b82cc19654e9d8bdc5 | 1,300 | PASSED |
import java.util.Scanner;
public class D630 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean boys[] = new boolean[n];
boolean girls[] = new boolean[m];
int b =in.nextInt();
for ... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | f4ad21e0ddb660ded91db82c36871f74 | 1,300 | PASSED |
import java.io.*;
import java.util.*;
public class DrazilAndHisFriends
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new InputStreamReader(System.in));
}
String ne... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | a05c2537007d5000ef8500de3029363e | 1,300 | PASSED |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int infi = Integer.MAX_VALUE / 2, mod = (int) (1e9 + 7), maxn = (int) 1e5;
static long infl = Long... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | 7190363a450f5b3fb6e6ef58c64fa273 | 1,300 | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
public class practice {
// Faster Input...
static class Reader{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()... | Java | 65efbc0a1ad82436100eea7a2378d4c2 | fff01426234419a824b60803971ca435 | 1,300 | PASSED |
#include <bits./stdc++.h>
#define ll long long int
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n,m;
cin>>n>>m;
int k,i,j,l,lcm;
cin>>k;
int arr[200]={0};
for(i=0;i<k;i++){
cin>>j;
arr[j]... | C++ | 65efbc0a1ad82436100eea7a2378d4c2 | d3a0f2ab943db485f9e087148dddc135 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int t;
cin>>n>>t;
string s ;
cin>>s;
int change=t;
int i=0;
int j=0;
int k=0;
int l=0;
int maxa;
int maxb;
while(i<n)
{
if(s[i]=='b')
{break;}
i++;
}
while(k<n)
{
if(s[k]=='a')
{break;}
k++;
}
change=t;
while(j<n)
{
if(s[j]=='b')
{
change--;... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 3ffb8927e2728654284decafba0fa723 | 1,500 | PASSED |
#include<stdio.h>
#include<ctype.h>
#include<string.h>
int main()
{
char a[100010];
int i,j,n,k,count=0,sum=0,b[100100],c[100010];
int p=0,max=-1,t1,t2,t3,x,y=0,z,count1=0;
int d[100010],e[100010],q=0,s1,s2;
scanf("%d %d %s",&n,&k,a);
for(i=0;i<n;i++)
{
if(a[i]=='a')
count++;
if(a[i]=='b')
{
c[p]=i;
... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 00de75c4797357c4c3e3b33e0808e939 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#pragma GCC optimize("Ofast")
using namespace std;
string s;
ll n,k;
const ll ed=1;
ll ans(char c)
{
vector<ll> a;
for (ll i=0; i<s.size(); i++)
if (s[i]!=c) a.push_back(i);
if (a.size()<=k) return n;
//if (k==0) return 1;
ll ans=0;
ll m=a.s... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 80e5f11c9ec14a3f4768c043c6d1b9ed | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//g++ exec.cpp -o exec && ./exec
int n, k;
string s;
int solve(char x){
int max=0,l, r=0, cont=0, ret=0;
for(l=0; l<n; l++){
while(r<n and (cont<k or s[r]!=x)){
if (s[r]==x)
++cont;
r++;
}
if (s[l]==x)
--cont;
if(ret<r-l)ret=r-l;
}
return ret... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 342d13713a611e4c1dc8639db070e084 | 1,500 | PASSED |
#include <iostream>
#include <algorithm>
#include<string>
using namespace std;
int main()
{
int len,k;
string s;
cin>>len>>k>>s;
int maxi=-99;int maxa=-99;;
int l,r;
l=r=0;
int t=k;
while(r<len)
{
if(s[r]=='a')
{
maxi=max(maxi,r-l+1);
r++;
}
else
{
if(k!=0)
{
maxi=max(maxi,r-l+1);
... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 86c1cf4550e71f6e782d532a40c7ca71 | 1,500 | PASSED |
// JAI SHREE RAM
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,j,k,i,count;
cin>>n>>k;
char c,co;
vector<int> v;
count=0;
for(i=0;i<n;i++)
{
cin>>c;
if(i>0&&c!=co)
{
v.emplace_back(count);
count = 0;
}
co=c;
count++;
}
if(k>=n)
{
cout<<n;
return 0;
}
v.emplace_back(c... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 716b19ac8a317885e432d159c0822ded | 1,500 | PASSED |
#include <bits/stdc++.h>
//in the name of god;;
using namespace std;
typedef long long ll;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define vc vector<ll>
ll n, k, A, B, l, MX = -1;string s;
int main(){
cin >> n >> k >> s;
for(ll i = 0; i < n; ++i){
if(s[i] == 'a... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | ec5af4892e7e588e00587d446b301cbc | 1,500 | PASSED |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define graph vector<vector<int>>
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) (x).begin(),(x).end()
#define __lcm(a,b) (a)/__gcd((a),(b))*(b)
#define sp(x,y) {ZaMeNa=(x);(x)=(... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | 307635872930c0a5946a141a677c4443 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<ll>
#define vvll vector<vll>
#define mll map<ll,ll>
#define f(i,m,n) for(i=m;i<n;i++)
#define ee endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define take(v,n) for(i=0;i<n;i++) cin>>v[i];
#def... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | db14b22db1adf87c4298ac59021f4d53 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define ld long double
#define uint unsigned int
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pll pair<long long ,long long >
#defin... | C++ | 0151a87d0f82a9044a0ac8731d369bb9 | e712c97a8bb5a9319a8ca26f17fa9432 | 1,500 | PASSED |
/*IN THE NAME OF GOD*/
/*year:2015 month: day: codeforces level:newbie*/
#include <iostream>
#include <conio.h>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <string.h>
#include <string>
#include <cmath>
#include <map>
using namespace std;
int main()
{
char x[1000];
long ... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 98022144f14f4ef5afbdc2b87c019031 | 1,000 | PASSED |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
char a[10000];
int main()
{
int p=0,len,b,c=0;
int n;
//scanf("%d",&n);
while(gets(a))
//while(n>=0)
{
//n--;
//gets(a);
if(a[0]=='+')
{
p++;
continue;
}
if(a[0]=='-')
{
p--;
continue;
}
len=strlen(a);
for(... | C++ | d7fe15a027750c004e4f50175e1e20d2 | f3d82374e3c8bfe95b815a21f5abcc91 | 1,000 | PASSED |
#include <iostream>
#include <cstring>
#define MAX_S 101
using namespace std;
int main() {
char s[MAX_S];
int p = 0;
int res = 0;
while (cin.getline(s,MAX_S)){
//if (s[0] == '@') break;
if (s[0] == '+') p++;
if (s[0] == '-') p--;
if ((s[0] != '+') && (s[0] != '+')){
int c = 0;
bool f = false;
... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 76af7091be4c2790d783d1786ac0e784 | 1,000 | PASSED |
/*
ID:
PROG:
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#inclu... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 940320a87000de802eddbd37fcba7cb2 | 1,000 | PASSED |
/*
ID:
PROG:
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#inclu... | C++ | d7fe15a027750c004e4f50175e1e20d2 | fff662fd52a3cf2aeaf9e7cc1ced1f0f | 1,000 | PASSED |
/*
PROG: cf5A
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#includ... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 79306d3a4102e081c633944685b24353 | 1,000 | PASSED |
/*
PROG: cf5A
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#includ... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 687ff77f53c5ce75776d836419f0cf5b | 1,000 | PASSED |
/*
ID:
PROG:
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include... | C++ | d7fe15a027750c004e4f50175e1e20d2 | a21fd3b75e07b3db2e9060adc6b81c59 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pai;
typedef vector< pai > vpi;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define fr1(n) for(int i=0;i<n;++i)
#define fr(n,i) for(int i=0;i<n;++i)
#define tr(... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 97e804a5863b916e85a064d8fad672d2 | 1,000 | PASSED |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cmath>
#include <deque>
#include <cstring>
using namespace std;
#define LET(x,a) typeof(a) x(a)
#define FOR(i,a,b) for(LET(i,a);i!... | C++ | d7fe15a027750c004e4f50175e1e20d2 | 0cd7cec87e8fa529d3ae4305878de4b3 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mu 1000000007
/*int gcd(int a, int b){
if (a == 0)
return b;
return gcd(b%a, a);
}
int compare(const void* a, const void* b)
{
const int* x = (int*) a;
const int* y = (int*) b;
if (*x > *y)
return 1;
else if (*x < *y)
retur... | C++ | e17427897fd5147c601204cb1c48b143 | 18c05286dfecd1cbd4ff9458333aa680 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a;
unordered_set<int> s;
s.insert(-1);
for (int i = 0; i < n; i++)
{
cin >> a;
if (a > i)
{
cout << (i + 1) << "\n";
return 0;
}
else
{
if (s.find(a - 1) == s.end())
{
cout << (i + 1) << "\n";
ret... | C++ | e17427897fd5147c601204cb1c48b143 | 87e73fcd575fbc56e64ecfdf7cf45c44 | 1,000 | PASSED |
///JAFAR
/// __
/// / l
/// .' : __.....__..._ ____
/// / / \ _.-" "-. "" "-.
/// (`-: .---: .--.' _....J. "-.
/// """y \,.' \ __..--"" `+""--. `.
/// : .'/ .-"""-. _. `. "-. `._.._
/// ; _.'.' .-j... | C++ | e17427897fd5147c601204cb1c48b143 | 3adc09eb7ee8c0316d389836c8d7c088 | 1,000 | PASSED |
/// .
/// / )) |\ ) ).
/// c++. (\ ( `. / ) (\ ( `. ). ( (
/// | | )) ) ) ( ( `.`. ) ) ( ( ) )
/// | | ( ( / _..----.._ ) | ( ( _..----.._ ( (
/// ,-. | |---) V.'... | C++ | e17427897fd5147c601204cb1c48b143 | b13d0e40a9b9afe11623fa32c8284caa | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,n,ch=0;
cin>>n;
long long int A[n];
for(i=0;i<n;i++)
{
cin>>A[i];
}
for(i=0;i<n;i++)
{
if(A[i]<=ch)
{
if(ch==A[i])
ch++;
}
else
{
... | C++ | e17427897fd5147c601204cb1c48b143 | e08560a7b291a2d24940d6fdc2a9439b | 1,000 | PASSED |
/*"BISMILLAHIR RAHMANIR RAHIM....."
"YOUR OUTPUT WILL BE REWARDED,NOT YOUR EFFORTS.."
CREATOR:SHOHAG(ICT'13,MBSTU).......*/
#include<bits/stdc++.h>
#define pf printf
#define sf scanf
#define sz 100009
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss ... | C++ | e17427897fd5147c601204cb1c48b143 | ea150ffe8e427644b05ceb196cdfd5ef | 1,000 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 9999999999;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define pb push_bac... | C++ | e17427897fd5147c601204cb1c48b143 | 016a7d09775e4c1b9f41b7f1b7954430 | 1,000 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin>>n;
long long int a[n],k=1;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
if(a[0]!=0)
{
cout<<"1";
k=1;
}
else if(a[0]==0)
{
long long int max=a[0],k=0;
for(int i=1;i<n;i++)
{
if(a[i]>max+1)
... | C++ | e17427897fd5147c601204cb1c48b143 | 470798eecbbedd76e4aa66deaa63b700 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a,b,max=0;
long int i=1,n;
cin>>n;
while (i<=n){
cin>>a;
if (i==1 && a!=0)break;
if (a>max+1)break;
if (a>max) max=a;
i++;
}
if (i>n)i=-1;... | C++ | e17427897fd5147c601204cb1c48b143 | 2a81ad5839e3f13e1155fab95e67fde6 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
long long int a[n];
long long int maxE = INT_MIN;
int fault = -1;
for(int i=0;i<n;i++) {
cin>>a[i];
}
if(a[0] != 0) {
fault = 1;
cout<<fault<<endl;
... | C++ | e17427897fd5147c601204cb1c48b143 | 30fa1774125e699896419e68afc9f243 | 1,000 | PASSED |
import java.util.*;
import java.io.*;
public class C
{
public static void main(String args[]) throws Exception
{
BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(infile.readLine());
int N = Integer.par... | Java | fa531c38833907d619f1102505ddbb6a | eaa5b95eb377dacfedf3b3576c054ff5 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define pi pair<int, int>
#define ll long long
#define vi vector<int>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
//freopen("input.txt", "r", stdin);
int n;
cin >> n;
vi l(n), ... | C++ | fa531c38833907d619f1102505ddbb6a | 24e44363f2d9bf2e7e7a1bae411eb1c0 | 1,500 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define f(i, n) for(int (i)=0; (i)<(n); (i)++)
#define int long long
typedef long long ll;
typedef vector<int> vi;
const ll mod=1e9+7, nmax=2e5+1... | C++ | fa531c38833907d619f1102505ddbb6a | 9d3c0cd5db93c93621fe8f0e9657e5bd | 1,500 | PASSED |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long... | C++ | fa531c38833907d619f1102505ddbb6a | db7cf626dcee70b5852d79fbb6c1336a | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
int l[1001],r[1001],a[1001];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>l[i];
for(int i=1;i<=n;i++) cin>>r[i];
for(int i=1;i<=n;i++) a[i]=n-l[i]-r[i];
for(int i=1;i<=n;i++)
{
int li=0;
for(int j=1;j<i;j++){if(a[j]>a[i]) li++;}
int ri=0;
for(int j=n;... | C++ | fa531c38833907d619f1102505ddbb6a | ffb9084f6a3ae39fba6dc8ede0856d6c | 1,500 | PASSED |
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
int n,m;
string s,t;
int main()
{
#ifdef OnCode
//freopen("code.in","r",stdin);
//freopen("code.out","w",stdout);
#endif
... | C++ | d629d09782a7af0acc359173ac4b4f0a | 9ab68897d79e9194129e179ab768cb25 | 1,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
int n,m; cin>>n>>m; n-=1,m-=1;
if(n>m+1){
cout<<"NO"; return 0;
}
char s1[200010],s2[200010]; cin>>s1>>s2;
int pos=0;
for(int i=0;i<=n+1;i++){
pos=i;
if(s1[i]=='*') ... | C++ | d629d09782a7af0acc359173ac4b4f0a | 81abd2d5cdd656d0fdbcfe5d92f469db | 1,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,m; cin>>n>>m; n-=1,m-=1;
if(n>m+1){
cout<<"NO"; return 0;
}
char s1[200010],s2[200010]; cin>>s1>>s2;
int pos=0;
for(int i=0;i<=n+1;i++){
pos=i;
if(s1[i]=='*') break;
}
for... | C++ | d629d09782a7af0acc359173ac4b4f0a | b4dd81a7ab86174149ec84d4107d9cbf | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
scanf("%d%d",&n,&m);
string a, b;
cin >> a >> b;
if(a == b) printf("YES\n");
else{
bool continuar = false;
int pos = 0;
for(int i=0;i<a.size();i++){
if(a[i] == b[i]) continue;
el... | C++ | d629d09782a7af0acc359173ac4b4f0a | 435d5cffdb805953f5c38cbb7641e04c | 1,200 | PASSED |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 200005;
char aa[maxn];
char bb[maxn];
int main()
{
int lena, lenb;
scanf("%d%d", &lena, &lenb);
if(lenb < lena - 1)
{
puts("NO");
return 0;
}
scanf("%s%s", aa+1, bb+1);
int ida = 0;
int i;... | C++ | d629d09782a7af0acc359173ac4b4f0a | 4fd3d9bce0af4b5ed3c14091e4b9f05c | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define trace1(x) cerr<<#x<<":... | C++ | d629d09782a7af0acc359173ac4b4f0a | 5fd235a47328e4f185debb45259767c4 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,f=0,i,j;
string s,t;
cin>>n>>m>>s>>t;
if(s==t)
cout<<"YES"<<endl;
else if(s.find("*")==string::npos)
cout<<"NO"<<endl;
else{
int temp=s.find("*");
for(i=0;i<temp;i++){
if(s[i]!=t[i]){
... | C++ | d629d09782a7af0acc359173ac4b4f0a | 2182a336f7c4338da3097cfc5800dc99 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
string s,t;
cin>>s>>t;
int p=-1;
for(int i=0;i<n;i++){
if(s[i]=='*'){
p=i;break;
}
}
if(p==-1){
puts((s==t)?"YES":"NO");return 0;
}
if(n-1>m)return puts("NO");
f... | C++ | d629d09782a7af0acc359173ac4b4f0a | 7869fcb80872dc476700a48c2ef97526 | 1,200 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define closeio std::ios::sync_with_stdio(false)
int main()
{
int n,m,i,len,flag=0;
string s,x,s1,s2;
cin>>n>>m;
... | C++ | d629d09782a7af0acc359173ac4b4f0a | 67fe4eaa13365b7659cad18138d52470 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
int main()
{
int n,m;
cin>>n>>m;
bool flag=true;
string s,t;
cin>>s>>t;
int i,j;
if(n>m+1)
flag=false;
int idx=-1;
for(int i=0;i<n;i++)
{
if(s[i]==t[i]) continue;
else if(s[i]!='*'&&s[i]!=t[j]) {cout... | C++ | d629d09782a7af0acc359173ac4b4f0a | 90a432006b28252f54a8863b94ae793a | 1,200 | PASSED |
f = lambda: map(int, input().split())
n, k = f()
print(sum(sorted(f())[:k])) | Python | 5097e92916e49cdc6fb4953b864186db | de6ec1409cd6ef73f102b9f57fbd5072 | 1,200 | PASSED |
n = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
n, k = n[0], n[1]
a.sort()
s = sum([a[i] for i in range(k)])
print(s)
| Python | 5097e92916e49cdc6fb4953b864186db | d11d48f3711c5d61a988cc13ea666f1f | 1,200 | PASSED |
n,k=map(int,input().split())
print(sum(sorted(list(map(int,input().split())))[:k])) | Python | 5097e92916e49cdc6fb4953b864186db | ba8bfe3e4a13d8b8f98b372a0a0afe55 | 1,200 | PASSED |
n, k = map(int, input().split())
a = sorted(list(map(int, input().split())))
print (sum(a[:k])) | Python | 5097e92916e49cdc6fb4953b864186db | 687e46b838a1910744586e68fb4891e6 | 1,200 | PASSED |
v=int(input().split()[1].strip())
val=input().split()
val=sorted([int(x.strip()) for x in val])
print(sum(val[0:v])) | Python | 5097e92916e49cdc6fb4953b864186db | 8a0d68fa74a9c5e2af2e6d7fc75c7423 | 1,200 | PASSED |
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
s = 0
for i in range(k):
s += a[i]
print(s)
| Python | 5097e92916e49cdc6fb4953b864186db | 650afc7936cdd0c621662779b2d0087c | 1,200 | PASSED |
n, k = input().split()
n = int(n)
k = int(k)
a = list(map(int, input().strip().split(' ')))
t = 0
a.sort()
for i in range(k):
t += a[i]
print(t) | Python | 5097e92916e49cdc6fb4953b864186db | 83c2ca152f513912d19ca584571f9fa2 | 1,200 | PASSED |
n,k=input().strip().split(' ')
n,k=(int(n),int(k))
l=list(map(int,input().strip().split(' ')))
l.sort()
print(sum(l[:min(k,n)])) | Python | 5097e92916e49cdc6fb4953b864186db | 452d7f164498090408075be7ea884f63 | 1,200 | PASSED |
import sys
mod = 1000000007
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline()
def print_array(a): print(" ".join(map(str, a)))
def main():
n, k = get_ints()
a = get_array()
a.sort()
... | Python | 5097e92916e49cdc6fb4953b864186db | 131ab3049e347fcc61f2784118140aaf | 1,200 | PASSED |
#!/usr/bin/python3
n,k = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
a.sort()
print(sum(a[i] for i in range(k)))
| Python | 5097e92916e49cdc6fb4953b864186db | 03173ff561de4c3ba5265a9d49e61ea7 | 1,200 | PASSED |
import java.io.*;
import java.util.*;
import java.util.stream.*;
//Arrays.stream(br.readLine().split("\\s")).mapToInt(Integer::parseInt).toArray();
public class solution{
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(System.out);
... | Java | 5099a9ae62e82441c496ac37d92e99e3 | 5357caaa825ac24347f5053aff4ea55e | 1,400 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Kraken
*/
public class Main {
public static void main(String[] args) {
InputStream inputSt... | Java | 5099a9ae62e82441c496ac37d92e99e3 | b64e7f7ec2828f84405552fad638881a | 1,400 | PASSED |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Reader in = new Reader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
int n = in.nextInt();
... | Java | 5099a9ae62e82441c496ac37d92e99e3 | 570ee17e31871f3ecd4ac79bcb52c162 | 1,400 | PASSED |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class VanyaAndFood {
public static void main(String[] args) throws IOException {
Scanner sc = ne... | Java | 5099a9ae62e82441c496ac37d92e99e3 | bf027fa3dab58f80720bb9b22f760d5b | 1,400 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
public class xl3ster
{
static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter out = new PrintWriter(System.out);
public s... | Java | 5099a9ae62e82441c496ac37d92e99e3 | d38f47cec5f7168e1388e5ce13a3e87d | 1,400 | PASSED |
/**
* @author egaeus
* @mail sebegaeusprogram@gmail.com
* @veredict Not sended
* @url <https://codeforces.com/problemset/problem/677/B>
* @category ?
* @date 14/06/2020
**/
import java.io.*;
import java.util.*;
import static java.lang.Integer.*;
import static java.lang.Math.*;
public class CF677B {
publi... | Java | 5099a9ae62e82441c496ac37d92e99e3 | 1b22278c7d3f926200342ce2d8627232 | 1,400 | PASSED |
import java.util.*;
import java.math.*;
import java.io.*;
public class solution {
public static void merge(int arr[], int l, int m, int r) {
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
/* Create temp arrays */
int L[] = new int[n1];
... | Java | 5099a9ae62e82441c496ac37d92e99e3 | e78ce85ed3f087e20c53522cc2704486 | 1,400 | PASSED |
import java.util.*;
import java.math.*;
import java.io.*;
public class A{
static FastReader scan=new FastReader();
public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
static int n;
static char orig[][];
static int check(char arr[][]){
int c=0;
... | Java | 5099a9ae62e82441c496ac37d92e99e3 | 031955aaab673ecf5b129f4fff3f6f36 | 1,400 | PASSED |
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
... | Java | 5099a9ae62e82441c496ac37d92e99e3 | 36f027b99c498c1fc57a86ae882024dd | 1,400 | PASSED |
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); // 5
int h = sc.nextInt(); // 6
int k = sc.nextInt(); // 3
int a[] = new int[n];
for(int i = 0;i < n;i++) {
a[i] = ... | Java | 5099a9ae62e82441c496ac37d92e99e3 | c835886e3dd0731bd21a925a967bd4f1 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int q;
scanf("%d",&q);
while(q--)
{
int l,r,d;
scanf("%d%d%d",&l,&r,&d);
if(d<l) printf("%d\n",d);
else printf("%d\n",(r/d+1)*d);
}
return 0;
} | C++ | 091e91352973b18040e2d57c46f2bf8a | 95f8cf35c367d863c3d0416cca7196d6 | 1,000 | PASSED |
#include<bits/stdc++.h>
int T,l,r,d;
using namespace std;
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%d%d%d",&l,&r,&d);
if (d<l)
{
printf("%d\n",d);
continue;
} else
{
int t=(r/d*d);
if (t<=r) t+=d;
pr... | C++ | 091e91352973b18040e2d57c46f2bf8a | a558a90d60c6a5a649a2ccfaa48d7135 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int l,r,d;
cin>>l>>r>>d;
if(d<l) cout<<d<<endl;
else cout<<((r/d)+1)*d<<endl;
}
return 0;
}
| C++ | 091e91352973b18040e2d57c46f2bf8a | 186a3550a61b2ca5f1777d9e03627c0e | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int l,r,d;
cin>>l>>r>>d;
int x=l/d;
int m=l%d;
int p=r/d;
int q=r%d;
if((x==1&&m==0)||l<d)
cout<<(p+1)*d<<endl;
else
cout<<d<<end... | C++ | 091e91352973b18040e2d57c46f2bf8a | afb7a3c489d2b2e02f8ee4634cf960a5 | 1,000 | PASSED |
#include <iostream>
using namespace std;
int main() {
int q;
cin>>q;
while(q--){
long long l,r,x;
cin>>l>>r>>x;
if(x<l||x>r) {
cout<<x;
}
else {
cout<<(r/x)*x+x;
}
if(q)cout<<endl;
}
return 0;
} | C++ | 091e91352973b18040e2d57c46f2bf8a | 485e0d973b99bbc617a33597f42f6ece | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll t,i,j,n,m,k,ans,ck,cnt=0,sum=0,c=0;
cin>>t;
while(t--){
cin>>n>>k>>ck;
n--;
k++;
if(n>=ck){
cout<<ck<<endl;
}
else {
if(k<=ck){
... | C++ | 091e91352973b18040e2d57c46f2bf8a | d0f304fdef4ac8965865ef8f0422aa6e | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
while(n--)
{
ll l,r,d;
cin>>l>>r>>d;
if(d<l)
{
cout<<d<<endl;
}
else
{
ll ans = ((r/d)+1)*d;
cout<<ans<<endl;
... | C++ | 091e91352973b18040e2d57c46f2bf8a | 57d772860a26f713e6ec148bf13288a3 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
while(n--)
{
ll l,r,d;
cin>>l>>r>>d;
if(d<l)
{
cout<<d<<endl;
}
else
{
ll ans = ((r/d)+1)*d;
cout<<ans<<endl;
... | C++ | 091e91352973b18040e2d57c46f2bf8a | df1838d33d70f0051cf7bbc0a6725015 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fs first
#define sc second
#define ll long long
#define pii pair<int,int>
#define ld long double
#define foreach(V) for(typeof V.begin() it=V.begin();it!=V.end();it++)
ll n,x,y,z;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x>>y>>z;
... | C++ | 091e91352973b18040e2d57c46f2bf8a | 6b24b88ab0c566b1c4e2281c95b362f7 | 1,000 | PASSED |
#include<stdio.h>
#include<cctype>
#include<iostream>
#include<cstring>
#include<cmath>
typedef unsigned long long ull;
typedef unsigned long int ul;
typedef long long ll;
char buf[1<<21],*p1=buf,*p2=buf;
inline int getch()
{
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
char buf2[1<<21]... | C++ | 091e91352973b18040e2d57c46f2bf8a | 9923d2a0b4d07dcad3dc96c2e544ae82 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define PRIME 1000000007
#define REDUCE_IO_TIME ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pii pair<int, int>
#define I first
#define II second
#define INPUT_AR(ar, n) for(int i=0; i<n; i++) cin >> ar[i];
#define MAX 200005
using namespace std;... | C++ | b06d5b48525cd386a0141bdf44579a5c | b59f96443be797f6882df81b11a31fdf | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int main()
{
long long test,t=0;
cin >> test;
while (test--)
{
t++;
long long n;
cin >> n;
string s;
cin >> s;
long long res =0,tmp = 1;
vector <long long > a;
for (int i= 1; i<n;i++)
{
if (s[i]==s[i-1]) tmp++;
else a.push_back(tmp),tmp=1;
}
... | C++ | b06d5b48525cd386a0141bdf44579a5c | 095a7be0d8e383c2a80fca1161c1bdd8 | 1,700 | PASSED |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl... | C++ | b06d5b48525cd386a0141bdf44579a5c | 2bed6dca0fd1a337f7066462b31fad86 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sc(x) scanf("%d",&x)
#define _sc(x) scanf("%lld",&x)
#define pf(x) printf("%d",x);
#define _pf(x) printf("%lld",x);
#define FOR(i,a,b) for(int i = a;i<=b;++i)
#define _FOR(i,a,b) for(int i = a;i<b;++i)
const ll mod = 1e9+7;
const ll maxn = 1e6+1... | C++ | b06d5b48525cd386a0141bdf44579a5c | b9d8409de8e39c0cd8c48c203a004c4e | 1,700 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define ins insert
#define se second
#define all(x) (x).begin(), (x).end()
#define vi vector <int>
#define vvi vector<vector<int>>
#define k1(x) __builtin_popcount(x)
#define sl0(x) __builtin_clz(x)
#define... | C++ | b06d5b48525cd386a0141bdf44579a5c | 737493c4804737723efe167451802b3c | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
int cnt = 0;
while(s.size() && s[0] == s.back()) {
cnt++;
s.pop_back();
}
if(s.empty()) {
if(cnt <= 2) {
cout << "0\n";
return;
... | C++ | b06d5b48525cd386a0141bdf44579a5c | 163a62e6ada0c78374936717f6309429 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int, int>;
#define dbg(x) cerr<<#x": "<<(x)<<'\n'
#define dbg_p(x) cerr<<#x": "<<(x).first<<' '<<(x).second<<'\n'
#define dbg_v(x, n) {cerr<<#x"[]: ";for(long long _=0;_<n;++_)ce... | C++ | b06d5b48525cd386a0141bdf44579a5c | f15b2286face9cfc8bf9aaa824b39327 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
int cnt = 0;
while(s.size() && s[0] == s.back()) {
cnt++;
s.pop_back();
}
if(s.empty()) {
if(cnt <= 2) {
cout << "0\n";
return;
... | C++ | b06d5b48525cd386a0141bdf44579a5c | 5ed958f5d70a9e31c8b1d8fe9220cd40 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
int cnt = 0;
while(!s.empty() && s[0] == s.back()) {
cnt++;
s.pop_back();
}
if(s.empty()) {
if(cnt <= 2) {
cout << "0\n";
return;
... | C++ | b06d5b48525cd386a0141bdf44579a5c | b5ca170659e6c3433a487f2686f45c07 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vec vector
#define pb push_back
#define popb pop_back
vec<ll> a;
ll n, m , k , x, y;
int main() {
ll t, ans=0;
string s;
cin >> t;
while (t--) {
cin >> n >> s;
ll kr=0;
ans=0;
while (!s.empty() ... | C++ | b06d5b48525cd386a0141bdf44579a5c | 626d417488925e479b6bd881063ed526 | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int numeros[... | Java | 5139d222fbbfa70d50e990f5d6c92726 | 0607e9a3b03707acbd5994620b5d1966 | 1,100 | PASSED |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t-->0){
int n=sc.nextInt();
int arr[]=new int [n+1];
int buf[]=new int[5005];
boolean flag=false;
for(int i=1;i<=n;i++){
arr[i]=sc.nextInt();
if(b... | Java | 5139d222fbbfa70d50e990f5d6c92726 | bde1442a7812ce7b6f02d30abfd6eb5e | 1,100 | PASSED |
import java.util.*;
import java.io.*;
public class Main{
static FastScanner in;
static PrintWriter out;
public static void main(String[] args){
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
int T = in.nextInt();
for (int t = 0; t < T; ++t){
int n = in.nextInt();
int[] ... | Java | 5139d222fbbfa70d50e990f5d6c92726 | a4370665e173b561baeffeca0b3edf74 | 1,100 | PASSED |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int... | Java | 5139d222fbbfa70d50e990f5d6c92726 | 0bba50781aa79893347e0b371961e8a8 | 1,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.