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;
char s[200005];
int l,cnt,k;
vector<int>q[200005];//二维动态数组
int main(){
scanf("%s",s);
l=strlen(s);
for(int i=0;i<l;i++){
if(s[i]=='0')q[cnt++].push_back(i+1); //0
else{ //1
if(cnt==0){ //如果1... | C++ | 37b34461876af7f2e845417268b55ffa | cb2a3d538c1fe8348ec6ba845849a04a | 1,600 | PASSED |
#include <bits/stdc++.h>
char s[2000005];
int pre[200005],nxt[200005],n,size[200005];
void output(int x){
if (!x){printf("\n");return;}
printf("%d ",x);
output(nxt[x]);
}
int main(){
scanf("%s",s+1);
n=std::strlen(s+1);
int p1=1,p2=1;
for(int i=1;i<=n;++i){
if (s[i]=='0')continue;
while (p2<i)p2++;
while ... | C++ | 37b34461876af7f2e845417268b55ffa | 1c91faacf61a0174024419341d9ec37d | 1,600 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
using namespace std;
char s[200005];
vector<int>q[200005];
int cnt=0;
int max(int a,int b){
return a>b?a:b;
}
int main(){
cin>>s;
int len=strlen(s);
int k=-1;
for(int i=0;i<len;i++){
if(s[i]=='0'){
q[cnt++].push_back(i... | C++ | 37b34461876af7f2e845417268b55ffa | e26bacb5782519007ac125c6aa935912 | 1,600 | PASSED |
#include <cstdio>
#include <deque>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#include <algorithm>
#include <cmath>
#define pb push_back
#define mp make_pair
#define F first
#define S s... | C++ | f5acd95067656fa7667210af2c9bec81 | 4b56dfd4dce024a84a22d66d6e1b945a | 1,200 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 10;
const long long int REM = 10007;
long long int n , res = 0;
long long int a[MAXN];
int main(){
cin >> n;
for(int i = 0 ; i < n ; i++)
cin >> a[i];
sort(a , a+n);
for(int i = 0 ; i < n ; i++){
res += (a[i] * a[n... | C++ | f5acd95067656fa7667210af2c9bec81 | e3a0ce61857fe7e808ba6dc3016e8da6 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long i,n;
cin>>n;
long long arra[1000001];
for(i=0;i<n;i++)
{
cin>>arra[i];
}
sort(arra,arra+n);
long long sum=0;
for(i=0;i<n;i++)
{
sum+=arra[i]*arra[n-i-1];
}
cout<<(sum%... | C++ | f5acd95067656fa7667210af2c9bec81 | d65e96f92730db11f29f4df46466cd85 | 1,200 | PASSED |
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
multiset<int> input;
for(int i=0; i<n; i++)
{
int in;
cin >> in;
input.insert(in);
}
auto it = input.begin();
auto rev_it = input.rbegin();
long l... | C++ | f5acd95067656fa7667210af2c9bec81 | 27c9282771ae5c54d2e845adbb37c728 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define fill(a,x) memset(a,x,sizeof(a))
#define pb push_back
#define sz(x) (int)x.size()
#define F first
#define S second
#define FOR(i,a,b) for(int i = a; i<=b; ++i)
#define NFOR(i,a,b) for(int i =... | C++ | f5acd95067656fa7667210af2c9bec81 | a4ca87e4d91f41ae6cf8ec737939a4d0 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define PB push_back
#define LOOP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
const int mod = 10007;
int main()
{
LL n;
cin>>n;
LL ans=0;
LL a[n+2];
for(int i=1;i<=n;i++)
cin>>a[i];
... | C++ | f5acd95067656fa7667210af2c9bec81 | dae3add841a52e0a69009ffe3f2439a1 | 1,200 | PASSED |
/** بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم**/
#include<iostream>
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#include<fstream>
#include<numeric>
#inc... | C++ | f5acd95067656fa7667210af2c9bec81 | 3193f6e1816e33edab1b083eecdc7c80 | 1,200 | PASSED |
/**========================================================**/
/** In the name of Allah , most Gracious , most Merciful **/
/**========================================================**/
/**=======================**/
/** RKSAZID,CSE,KUET,2K14 **/
/**===============... | C++ | f5acd95067656fa7667210af2c9bec81 | 3dd41a6e4196ebd58c08f5ad526e3419 | 1,200 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <time.h>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,... | C++ | f5acd95067656fa7667210af2c9bec81 | 6a18dd1c69cd1b3baf39b8bd563b6402 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 10007
using namespace std;
ll a[111111],b[111111];
bool cmp(ll x,ll y){
if(x>y)return true;
else return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n,i,a... | C++ | f5acd95067656fa7667210af2c9bec81 | da49a392173f56bb7394f4f202c33df9 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define forn(i,n) for(int i = 0; i<n; i++)
#define forr(i,a,n) for(int i = a; i<n; i++)
using namespace std;
string s;
int n, sum[1000006], res, cierran, abren;
void solve(){
cin >> n;
cin >> s;
if(n & 1) {cout ... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 1443b7b5de93062bb2c10c7d896cbe7d | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int a[maxn*5];
int b[maxn];
int sum[maxn*5];
long long n,m,k;
char s[maxn*5];
int vis[maxn*5];
int main(){
int n;
cin>>n;
cin>>s+1;
int cnt1=0;
int cnt2=0;
long long ans=0;
for(int i=1;i<=n;++i){
if(s[i]==')')a[i]=-1;
else... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 17c7f91b08a4fda73d42da8f189d15ab | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
stack<char> s;
cin>>n;
int cnt=0, sol=0, nr=0;
while(n--){
char x;
cin>>x;
nr++;
if(!s.empty()&&x==')'&&s.top()=='('){
s.pop();
}
else s.push(x);
if(x=='(') cnt++;
... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 1e099d701ea227f611a5c7045e2c5270 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll t=1;//cin>>t;
while(t--)
{
ll n;cin>>n;
string s;cin>>s;
ll c=0;
for(ll i=0;i<n;i++)
{
if(s[i]=='(')c++;
else c--;
}
if(... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 7f280b0bcfaadb7651466578579b7469 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, db, cnt;
string s;
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> s;
for (int i=0; i<n; i++) {
if (s[i]=='(') cnt++;
else cnt--;
if (cnt<0 || (cnt==0 && s[i]=='(')) db++;
}
if (cnt!=0) cout << -1 << "\n";
e... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 4c6d1aae74ff84d3660a588923db824c | 1,300 | PASSED |
#include <bits/stdc++.h>
#define ROCK ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f first
#define sec second
using namespace std;
const long long int inf =(long long)1e18;
const int dx[4] = {0, 0, 1, -1},dy[4] = {1, -1, 0, 0};
typedef long long int ll;
int main()
{
ROCK;
int n;cin>>n;
stri... | C++ | e3275cd360d8f46cbbae03dfa86b924a | f09c4bc774488cc1ece4b6d2e1ac58d9 | 1,300 | PASSED |
/* Author:bhagatsunny96
JGEC
template__
lets_code_it_ */
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long int
#define ld long double
#define fi first
#define se second
#define mod 1000000007
#define test long long int t; cin>>t; while(t-->0)
#define fIO ios_base::sy... | C++ | e3275cd360d8f46cbbae03dfa86b924a | a32e8bc4b4d2fd0e5f7126cedfbed448 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
ll n,ans;
string s;
bool fun(string p)
{
ll x = p.size();
stack<char> ss;
int zz=0;
for(ll i=0; i<x; i++)
{
if((p[i]==')') && (ss.empty())) {zz=1; break;}
if((p[i]==')') && (ss.top()!='(')) {zz... | C++ | e3275cd360d8f46cbbae03dfa86b924a | d2cc4beaaead904d4d7e8408d696bdc0 | 1,300 | PASSED |
/*
* WATCH THIS
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll N = 1e6 + 2, NN = 1e3 + 4, oo = INT_MAX, mod = 1e9 + 7;
void debug() { cerr << endl; }
template<typename Head, typename... Tail>
void debug(Hea... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 828de28f7fe5e9523721f257fbdd053f | 1,300 | PASSED |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//using namespace __gnu_pbds; ... | C++ | e3275cd360d8f46cbbae03dfa86b924a | 89fcd8399c72a2e55fdd1ad26f944378 | 1,300 | PASSED |
import java.util.*;
public class test {
public static void main(String[] args) {
Scanner keyboard = new Scanner(System.in);
String line1 = keyboard.nextLine();
String line2 = keyboard.nextLine();
if (line1.equals(line2)) System.out.println(-1);
else System.out.println(Math.max(line1.length(), line2.len... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 5adc0e59b0777302ba71e5c2bfe781ac | 1,000 | PASSED |
import java.util.*;
import java.lang.String;
public class first{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String s1=sc.nextLine();
String s2=sc.nextLine();
int l1=s1.length();
int l2=s2.length();
if(s1.compareTo(s2)==0){
... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 831ebdca8fc961fa3514d1319503a8b4 | 1,000 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws Throwable {
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
String a=in.readLine();
String b=in.readLine();
if(a.equals(b)) {
System.out.println(-1);
} ... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 1ccfc0fa07b6dd935ccc92131618bcbb | 1,000 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws Throwable {
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
String a=in.readLine();
String b=in.readLine();
if(a.equals(b)) {
int i=0;
for(;i<a.length()... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | fbc4c08b171692048751ee5b05132e6a | 1,000 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class CFA {
static String max, min ;
public static void main(String[] args) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
for(String ln;(ln=in.readLine())!=null;){
String a = ln;
String b... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 00fada19349e87600bcc9083c2659f25 | 1,000 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class A {
static String a, b;
public static void main(String[] args) throws Throwable {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
a = in.readLine();
b = in.readLine();
int asw = 0;
if (a.length() != b.l... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | d89c5ef07d1b3b97f68dbc89327f39d7 | 1,000 | PASSED |
import java.util.*;
public class Codeforces4 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
String a = sc.next();
String b = sc.next();
if(a.equals(b)){
System.out.println("-1");
}else {
... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 0f5d98c2bc197db22e40ffaca5849858 | 1,000 | PASSED |
import java.util.Scanner;
public class GfG{
public static void main(String[] args){
Scanner sc=new Scanner (System.in);
String s=sc.next();
String s1=sc.next();
if(s.equals(s1)){
System.out.println("-1");
}
else{
System.out.println(s.length()>s... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 419258003171ccb03b1448eb00a4eba5 | 1,000 | PASSED |
import java.util.*;
import java.lang.Math;
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.IntStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
public class Problem {
... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 92e7537428e3945c82f2e0d678515ec5 | 1,000 | PASSED |
import java.io.*;
public class Main {
public static void main(String args[])throws IOException
{
BufferedReader obj=new BufferedReader(new InputStreamReader(System.in));
String a=obj.readLine();
String b=obj.readLine();
//int dp[][]=new int[a.length()+1][b.length()+1];
//for(int i=1;i<=a.length();i++)
//{
// for... | Java | f288d7dc8cfcf3c414232a1b1fcdff3e | 8cea74d714e7b4ab1ca90e30c2565a14 | 1,000 | PASSED |
#include<cstdio>
#include<iostream>
#include<stack>
using namespace std;
#define MAXN 1000000
int len[MAXN]={0};
int main(){
#ifndef ONLINE_JUDGE
freopen("data","r",stdin);
#endif
string s;
stack<int> st;
int k,maxl=0,n=0;
cin>>s;
for(int i=0; i<s.size(); i++){
if('(' == s[i]){
st.push(i);
... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 2a7038665e240a17b9b5b5e6c3172de1 | 1,900 | PASSED |
#include <iostream>
#include <stack>
using namespace std;
int a[1000005];
int main()
{
string s;
cin>>s;
int n=s.size();
stack<pair<char,int> > st;
int i;
for(i=0;i<n;i++)
{
if(i==0 || st.empty())
{
st.push(make_pair(s[i],i));
continue;
}
... | C++ | 91c3af92731cd7d406674598c0dcbbbc | a676d7a9bb30ebf044feae5ae7775834 | 1,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define maxn 1000100
using namespace std;
int mark[maxn];
char str... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 61ac80561d4a8bd7ca181ce7b83e4fbe | 1,900 | PASSED |
//372 ms 9100KB
#include <iostream>
#include <stack>
#include <string>
#include <cstdio>
using namespace std;
int DP[1000001];
int main()
{
stack<int> stk;
string str;
cin >> str;
int len = str.length();
int maxLen = 0;
int maxNum = 1;
for (int i = 0; i < len; i++)
{
if (s... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 29a180b0678f2a6ae6fd51cedc0219f3 | 1,900 | PASSED |
//372 ms 9100KB
#include <iostream>
#include <stack>
#include <string>
#include <cstdio>
using namespace std;
int DP[1000001];
int main()
{
stack<int> stk;
string str;
cin >> str;
int len = str.length();
int maxLen = 0;
int maxNum = 1;
for (int i = 0; i < len; i++)
{
if (st... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 9e55ab41fa7926ec3b5b4e0bf55fd061 | 1,900 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
#include <stack>
using namespace std;
int dp [1001000];
string s;
stack <int> st;
int main ()
{
cin >> s;
int len = s.size ();
for (int i = 0; i <len; i ++)
{
if (s [i] == '(')
{
st.push (i);
}
else
{
if (! st.empty ())... | C++ | 91c3af92731cd7d406674598c0dcbbbc | c0870cd6bec8ee5a19d5d23034484740 | 1,900 | PASSED |
//342 ms 9100KB
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int DP[1000001];
int main()
{
stack<int> stk;
string str;
cin >> str;
int len = str.length();
int maxLen = 0;
int maxNum = 1;
for (int i = 0; i < len; i++)
{
if (str[i] == '(')
... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 208255d8d252a78fcdc9f4cb1db4cc64 | 1,900 | PASSED |
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int DP[1000001];
int main()
{
stack<int> stk;
string str;
cin >> str;
int len = str.length();
int maxLen = 0;
int maxNum = 1;
for (int i = 0; i < len; i++)
{
DP[i] = 0;
if (str[i] == '(')
... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 647615640ac23276acedebb2907cca09 | 1,900 | PASSED |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
string s;
cin >> s;
int f[s.length()];
stack<int> st;
int maxLen = 0, maxNum = 1;
for (int i = 0; i < s.length(); ++i)
{
f[i] = 0;
if (s[i] == '(')
st.push(i);
else
{
... | C++ | 91c3af92731cd7d406674598c0dcbbbc | 78d795b1cf22bbaa6a887b57d04a84d7 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define INF (int)10e6
#define eps 10e-6
#define mp make_pair
#define pub push_back
#define pob pop_back
#define all(t) t.begin(),t.end()
#define LL long long
#define MOD 1000000007
#define fr(i, a, b) for(int i = a ; i <= b ; i++)
#define frev(i, a, b) for(int i = b ; i >= a ; i--)
#define rt ... | C++ | 91c3af92731cd7d406674598c0dcbbbc | a3796dae6e9de3d86ad608bebe69be22 | 1,900 | PASSED |
/////////////////////////////////////////////////////////////////////////////////////////////////
/* Shanto */
/* Khulna University of Engineering and Technology */
/* Depa... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | a9119cecf2e1ac78a0d7a3c8ab33c635 | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
#define ll long long int
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
int b[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
b[i]=a[i];
}
sort(a,a+n);
int c=0;
for(int i=0;i<n;i++)
{
if(a[i]!=b[i]... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 92d321f90031c647202253fe7360120d | 1,300 | PASSED |
#include<bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector < int > v(n), v1(n);
for (int i = 0; i < n; i++) {
scanf("%d", &v[i]);
v1[i] = v[i];
}
std::sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++)
n += v[i] != v1[i];
return puts(n - v... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | aafb448cad91a7683a099560f663dcc1 | 1,300 | PASSED |
#include<bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector < int > v(n), v1(n);
for (int i = 0; i < n; i++)
scanf("%d", &v[i]), v1[i] = v[i];
std::sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++)
n += v[i] != v1[i];
return puts(n - v.size() < 3 ? "Y... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 037838c26574b50ebba9a1a3f2e65545 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, i;
int arr[100001];
int arr2[100001];
scanf("%d", &n);
for(i=0; i<n; i++){
scanf("%d", &arr[i]);
arr2[i]=arr[i];
}
sort(arr2, arr2+n);
int cont=0;
for(i=0; i<n; i++){
if(arr[i]!=arr2[i]){
... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 93234c4f93ea3de15c769387ef8516ed | 1,300 | PASSED |
#include<bits/stdc++.h>
#define FRL(i, n) for(i=0; i<n; i++)
#define pii pair<int, int>
int a[1000005], b[1000005];
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n, i, c=0, x;
cin>>n;
for(i=0; i<n; i++){
cin>>a[i];
b[i]=a[i];
}
sort(a, a+n);
for(i=0; i<n; i++){
... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | ba7ce02baa0b564a2cf91832f1aba889 | 1,300 | PASSED |
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#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 <c... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 55e7101889c6244dfa3473c0bbe0e3e0 | 1,300 | PASSED |
#include <iostream>
#include <fstream>
#include <map>
#include <cmath>
#include <math.h>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <stdio.h... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 41926df7d0d0d127cf10bf51c2ad5636 | 1,300 | PASSED |
//In the name of Allah
#include<bits/stdc++.h>
using namespace std;
const int Maxn = 100 * 1000 + 10;
int n, cnt, a[Maxn], b[Maxn];
int main()
{
cin >> n;
for(int i = 0; i < n; i ++)
{
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for(int i = 0; i < n; i ++)
if(a[i] != ... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 1059b86bde47c32074019d8af87c3e87 | 1,300 | PASSED |
//Cool
#include <iostream>
#include<bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
typedef int ll;
#define lp(i, wwww) for(int i=0; i<wwww; i++)
#define lp2(i, a, b) for (int i=a; i<b; i++)
#define pb push_back
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.t... | C++ | 541fde3a3c40926cbd1edb6017b83e52 | 0792930e670b2f656497d9a030a7f0b9 | 1,300 | PASSED |
//����dp[i][0/1]��ʾ��i��ͷ�ij���2(3)���Ӵ��ܷ�����
#include <bits/stdc++.h>
using namespace std;
int dp[10009][3];
char a[10009];
set<string>s;
int main()
{
cin >> (a+1);
int len=strlen(a+1);
dp[len+1][0]=dp[len+1][1]=1;
for(int i=len-1;i>=6;i--)
{
if( a[i]!=a[i+2] || a[i+1]!=a[i+3] )
dp[i][0]|=dp[i+2][0];
dp[... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | f23194c30e525b6394904bf74e4dca55 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
int Gcd(int a,int b){if (b == 0) return a; return Gcd(b , a%b);}
int Lcm(int a, int b){ return a/Gcd(a,b)*b;}
inline long long read(){
long long f = 1, x = 0;char ch = getchar();
while (ch > '9' || ch < '0'){if (c... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | a1c5a604b89641f28ebde733859169df | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int dp[maxn][2];
int main() {
string str;
cin >> str;
set<string> st;
int n = str.length();
for (int i = n - 1; i >= 5; i--) {
if (i + 2 == n) dp[i][0] = 1;
if (i + 3 == n) dp[i][1] = 1;
if (i + 2 < n) {
if (dp[i + 2][1]) dp[i][0] = 1... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | 6279133522deaebe73caba4dce0a2bd9 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define sf(x) scanf("%d",&x)
using namespace std;
typedef long long ll;
const int maxn = 305000;
int n=0,sz;
bool vis[maxn][2];
string str;
bool check(int pos,string t){
if(pos==0)return true;
if((pos>=5||pos==2||pos==4)&&vis[pos][0]){
s... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | 6aa6f2037b00f6d8074ebf1137102bc5 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
bool dp[N][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen ("input.txt", "r", stdin);
freopen ("output.txt", "w", stdout);
#endif
string s;
cin >> s;
dp[s.length() - 2][0] = true;
dp[s.length() - 3][1... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | ef7e51829bd47d50cf328d73f5f69e21 | 1,800 | 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;
using ll = long long;
using ld = long double;
#ifdef LOCAL
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typena... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | 53321ee2c8f1ce60a56d5771a7808793 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define ms(a) memset(a,0,sizeof(a))
#define ms_inf(a) memset(a,0x3f,sizeof(a))
#define ms_ninf(a) memset(a,0xcf,sizeof(a))
#define pb push_back
#define mp make_pair
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#defi... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | c4929204bdf853dd8a7976da29ba7511 | 1,800 | PASSED |
#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <fstream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cmath>
#include <set>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
us... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | 09ef46b893318c2727e16db0cfb00538 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define MOD 998244353
#define INF 1000000000000000000
#define endll "\n"
#define pb push_back
#define forn(i,n) for(i=0;i<n;i++)
#define forab(i,a,b) for(i=a;i<=b;i++)
#define vpll vector<p... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | 37817eb9327be134485a03817007e5a9 | 1,800 | PASSED |
#include <stdio.h>
#include <set>
#include <string.h>
#include <string>
using namespace std;
char str[10005];
bool d[10005], e[10005];
set<string> ans;
int main()
{
scanf("%s", str);
int len = strlen(str);
d[len] = e[len] = true;
for (int i = len - 2; i >= 5; i--)
{
if (d[i + 3] || (e[i + 3] && memcmp(str + i,... | C++ | dd7ccfee8c2a19bf47d65d5a62ac0071 | c6ba663aeeaaae5d3bcb9b78a266f28d | 1,800 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreToke... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | fad9f65330e44fc349f668ca029e706f | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Random;
import java... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | fb0d8f3fa4d8ee9a99c6c3ae3588487b | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Random;
import java... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | e3024783f33a85ebf97bf8ef8f98d038 | 1,600 | PASSED |
import java.io.*;
import java.util.*;
public class D_CampSchedule {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | d0da0da0fe218530d5172ca8a9fcbb6a | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class D {
int[] funcZ(String two){
int[] z = new int[two.length()];
int l = 0;
... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | f29b783b7d9398a03eb7ca919d8ffe16 | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class CF1138D {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
char[] s = br.readLine().toCharArray();
char[] t = br.readLine().t... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | e706a825078185e6162fe05159eba1aa | 1,600 | PASSED |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main{
public static void main(String[] args){
FastScanner sc = new FastScanner();
String S = sc.next();
String T = sc.next();
PrintWriter out = new PrintWriter(System.out);
int o = overlap(T,T);
... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | 29baf28ad69414fb8007a5c34e161077 | 1,600 | PASSED |
import java.io.IOException;
import java.util.InputMismatchException;
public class Main {
public static void main(String[] args) {
FasterScanner sc = new FasterScanner();
char[] a1 = sc.nextString().toCharArray();
char[] a2 = sc.nextString().toCharArray();
int[] z = computeZArray(a2);
int len = 0;
for (... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | ed8a03b28ea504a234ff947779aa0684 | 1,600 | PASSED |
import javafx.scene.layout.Priority;
import java.io.*;
import java.lang.reflect.Array;
import java.net.Inet4Address;
import java.util.*;
import java.lang.*;
import java.util.HashMap;
import java.util.PriorityQueue;
public class templ implements Runnable{
static class pair implements Comparable
{
int f;
... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | f5071785cb306f34ef8c9340d3190fb1 | 1,600 | PASSED |
import java.lang.*;
import java.math.*;
import java.util.*;
import java.io.*;
public class Main {
void solve(){
s=ns().toCharArray();
t=ns().toCharArray();
computeLPS();
int n=t.length;
int c1[]=new int[2];
int c2[]=new int[2];
for(char ch : s) c1[ch-'0']++;
... | Java | 6ac00fcd4a483f9f446e692d05fd31a4 | cc99d661c0cff428aa8903a532647cd3 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
vector<int> g[MAXN], gg[MAXN];
int p[MAXN], v[MAXN][2];
int marc[MAXN];
int n, m, cont;
bool erro=0;
void dfs(int cur, int k) {
marc[cur]=k; //printf("%d %d\n", cur, k);
for(int i=0; i<g[cur].size(); i++) {
int viz=g[cur][i]; int pes=... | C++ | faf79a485fe06f3081befde45471a569 | a49e8b9edc0f23b498b6934c5026bb14 | 2,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define fin stdin
#define fout stdout
using namespace std;
//FILE *fin = fopen("x.in", "r"), *fout = fopen("x.out", "w");
typedef long long i64;
const int nmax = 2e5 + 5;
int nrc, m;
int st[nmax + 1];
int viz[nmax + 1];
vector< int > b[n... | C++ | faf79a485fe06f3081befde45471a569 | ee412560b1d4d514b500f329dbbed0af | 2,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define fin stdin
#define fout stdout
using namespace std;
//FILE *fin = fopen("x.in", "r"), *fout = fopen("x.out", "w");
typedef long long i64;
const int nmax = 1e5 + 5;
int st[nmax + 1];
bool ans = 1;
int viz[nmax + 1];
vector< int > b... | C++ | faf79a485fe06f3081befde45471a569 | 4c2e8a565ad783cc307990ee049add2e | 2,000 | PASSED |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#define N 200010
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define mem(x,y) memset(x,y,sizeof(x))
using namespace std;
typedef long long ll;
int a[N]... | C++ | faf79a485fe06f3081befde45471a569 | 009c5686d36f1052c635d13ad9eea005 | 2,000 | PASSED |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#define N 200010
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
using namespace std;
typedef long long ll;
int a[N], f[N];
vector<int> v[N];
int find(int... | C++ | faf79a485fe06f3081befde45471a569 | 8078faf33ac9d0e5ef4b581c4749f68b | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
const int MAX = 1e5+10;
int r[MAX], color[MAX];
vector< vector<int> > switches;
vector< vector<ii> > adj;
bool test;
void dfs(int u, int c){
color[u] = c;
for(int i = 0; i < adj[u].size(); i++){
int v = adj[u][i].first, l = adj[u][i]... | C++ | faf79a485fe06f3081befde45471a569 | 6f38740f6246206ee42aebcf57feb9e1 | 2,000 | PASSED |
//#ifndef ONLINE_JUDGE
#include <bits/stdc++.h>
#define maxn 100010
#define cmax 1000000007
#define llmax (1LL << 61)
#define el '\n'
#define pb push_back
#define NO {cout << "NO"; exit(0);}
#define mp make_pair
#define inmap(Map,x) ((Map).find((x)) != (Map).end())
#define For(i,a,b) for(int i = a; i <= b; i++)
#define... | C++ | faf79a485fe06f3081befde45471a569 | 49ffd3c97ab2bcb56933ff49e315cf19 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ID(x) (x<<1)
const int MAXN = 1e5 + 7;
vector<int> adj[3*MAXN], radj[3*MAXN], room[3*MAXN];
stack<int> st;
bool vis[3*MAXN];
int n, m, status[3*MAXN], mark[3*MAXN];
int ct = 0;
void dfs1(int x){
vis[x] = true;
for(int i = 0;i < adj[x].size();i++){
int u = adj[x... | C++ | faf79a485fe06f3081befde45471a569 | 7903b5d93e2b5e300d3aca1a506a7240 | 2,000 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
vector<vector<pair<int, int> > > g;
vector<bool> used;
vector<int> col;
bool f = false;
void dfs(int u, int cl) {
used[u] = true;
col[u] = cl;
for (auto v : g[u]) {
if (!used[v.first])... | C++ | faf79a485fe06f3081befde45471a569 | bb54261a78f0faade271e80f1488869b | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define for_tests(t, tt) int t; scanf("%d", &t); for(int tt = 1; tt <= t; tt++)
#ifndef ONLINE_JUDGE
#define debug(args...) fprintf(s... | C++ | faf79a485fe06f3081befde45471a569 | 492c286d963c9c98f3b9f4db661b61b5 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define si( x ) scanf("%d", &x)
#define sll( x ) scanf("%I64d", &x)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
ll s;... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 14c03a67831a7feb5bcce618223bfb5c | 1,400 | PASSED |
#include <bits/stdc++.h>
#define si( x ) scanf("%d", &x)
#define sll( x ) scanf("%I64d", &x)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
ll s;... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 64dc4bf5fe14b34256e4254e2451dd80 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define si( x ) scanf("%d", &x)
#define sll( x ) scanf("%I64d", &x)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
ll s;... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 0a9b94565c078826d3b6713c01e1539e | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | fc16f1f6221708045e37133b1fcffeb5 | 1,400 | PASSED |
#include<iostream>
#include<map>
#include<string.h>
using namespace std;
int main()
{
int T;
cin>>T;
map<long long int, int>num;
while (T--)
{
char c;
long long int num_1;
cin >> c >> num_1;
long long int num_2 = 0;
for (int i = 0; i<18; i++)
{
num_2 = num_2 * 2 + num_1 % 2;
num_1 = num_1 ... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | af8e4bc74f435b3f10ab1d9b03539f89 | 1,400 | PASSED |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<map>
#include<string.h>
using namespace std;
int main()
{
int T;
cin>>T;
map<long long int, long long int>num;
while (T--)
{
char c;
long long int num_1;
cin >> c >> num_1;
long long int num_2 = 0;
for (int i = 0; i<18... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 0ad78637cc34e519b76f006d56f28927 | 1,400 | PASSED |
#include<iostream>
#include<map>
#include<string.h>
using namespace std;
int main()
{
int T;
cin>>T;
map<long long int, int>num;
while (T--)
{
char c;
long long int num_1;
cin >> c >> num_1;
long long int num_2 = 0;
for (int i = 0; i<18; i++)
{
num_2 = num_2 * 2 + num_1 % 2;
num_1 = num_1 / 1... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | f7d4fa0f04ef9b8a9baa97088b6b124d | 1,400 | PASSED |
#include <bits/stdc++.h>
//#define TT
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 10000000;
const int MOD = 1e9+7;
int bintree[maxn];
void init()
{
memset(bintree,-1,sizeof(bintree));
}
bool isleave(int p)
{
return bintree[p<<1] == -1 && bintree[(p<<1)+1] =... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 9405a1a42c3a7794ecf42b0eeeea03d5 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long vec[1000000];
long long conv(long long a)
{
long long ans = 0;
long long mul = 1;
while(a!=0)
{
if(a%2==1) ans = ans + mul;
mul*=2;
a/=10;
}
return ans;
}
char in[150];
int main()
{
int n;
scanf("%d",&n); getchar();
for(int a=0;a<n;a++)
{
char... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 99ce939fd775aaaa6efeb5012d4a4735 | 1,400 | PASSED |
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct trip
{
struct trip *even;
struct trip *odd;
int num;
trip():even(NULL),odd(NULL),num(0)
{ }
};
struct trip root;
struct trip aaa[270000];
int n;
int pos=0;
char str[20];
... | C++ | 0ca6c7ff6a2d110a8f4153717910378f | 36aac9ccd84d2d22688c2f4e3c18553d | 1,400 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int n;
int m[200001][2];
int nextSol(int i){
int a, b;
a = m[i][0];
b = m[i][1];
if(m[a][0] == b || m[a][1] == b){
return a;
}
return b;
}
int main(int argc, char *argv[]){
int i, j, sol;
scanf("%d", &n);
for(i = 1; i<=n; i++){
scanf("%d %d", &m[i][0], ... | C | 819d3694fccf2b5af0ec3b4ee429dbb3 | 5e23fcf6621ff9b82bdd7c104b0521a7 | 1,600 | PASSED |
function task([n, ...pairs]) {
pairs = pairs.map(p => p.split(' ').map(n => Number(n)));
let result = [];
let presense = new Array(pairs.length + 1);
let index = 1;
while (result.length !== pairs.length) {
result.push(index);
presense[index] = true;
const [a, b] = pairs[index - 1];
const aP... | Javascript | 819d3694fccf2b5af0ec3b4ee429dbb3 | 2b74413a4a6bc36959c2bb2e02baa48e | 1,600 | PASSED |
const read = [];
let n;
const MAXN=2e5;
const arr=new Array(MAXN+1).fill(null);
const RL = require('readline').createInterface({
input: process.stdin,
output: process.stdout,
});
RL.on('line', line => {
read.push(line.trim());
});
const solve=function (current, next){
const vector=[];
let nextnext=null;
... | Javascript | 819d3694fccf2b5af0ec3b4ee429dbb3 | 4438bd36b199fd13323d174b5470d2cd | 1,600 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using CompLib.Util;
public class Program
{
int N;
int[][] A;
public void Solve()
{
var sc = new Scanner();
N = sc.NextInt();
A = new int[N][];
for (int i = 0; i < N; i++)
{
A[i] = new ... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | b7a1cc0fc7e70967f6584664d8e599a7 | 1,600 | PASSED |
using System;
using System.Linq;
using CompLib.Util;
public class Program
{
int N;
int[][] A;
public void Solve()
{
var sc = new Scanner();
N = sc.NextInt();
A = new int[N][];
for (int i = 0; i < N; i++)
{
A[i] = sc.IntArray();
}
// ... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | e8b77f351914bc9d1f4e356a0880ef90 | 1,600 | PASSED |
using System;
using System.Text;
using System.Collections.Generic;
using System.Threading;
using System.IO;
namespace codeforces
{
class Program
{
const int N = 2000 * 100;
static int[,] a = new int[N, 2];
static void Main(string[] args)
{
int n = int.Parse(Console... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | 2cdefa84ca4dd8d520d321f504331df7 | 1,600 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, i... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | dd74ac4da1ca8a4b80d585b0739b2578 | 1,600 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.