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 |
|---|---|---|---|---|---|
//
// Created by changhyeonnam on 2021/08/03.
//
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include<queue>
#define endl '\n'
#define INF 1e9
#define LINF 2e15
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<int,pa... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | d4e040e07dda02cb89772b74f71e02bc | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n; cin >> n;
vector<vector<int>> cou(n, vector<int>(5));
vector<int> r(n), sz(n);
for (int i ... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 31cddac55c270957cf6308830eb6af2e | 1,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
// macros for help during coding
#define rep(a,s,e) for(int a=s; a < e ; a++)
#define repr(a,s,e) for(int a=s; a >= e; a--)
#define int long long int
#define sz(x) ((x).size())
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second
#define mk... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 32bc4bd34229a7bb5d89abe42dc3c680 | 1,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
// macros for help during coding
#define rep(a,s,e) for(int a=s; a < e ; a++)
#define repr(a,s,e) for(int a=s; a >= e; a--)
#define int long long int
#define sz(x) ((x).size())
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second
#define mk... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 3615361badaf1c22d1de4027df6a15df | 1,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
// macros for help during coding
#define rep(a,s,e) for(int a=s; a < e ; a++)
#define repr(a,s,e) for(int a=s; a >= e; a--)
#define sz(x) ((x).size())
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second
#define mk make_pair
#define pb pu... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | d68494cafcd7af179f8892f9aa459178 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// for debuging only
#ifndef ROHITKUMAROFF
#define debug(x) cerr<< #x <<" => "; _print(x); cerr<<"\n";
#else
#define debug(x)
#endif
void _print(int x){ cerr<< x ; }
void _print(string s){ cerr<< s; }
void _print(long x){ cerr<< x ;}
void _print(float f)... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 4d7b4e187529daa0e4d560508942b47c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
vector<vector<int>> occ(n, vector<int>(5));
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.lengt... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 85ae995dc1c2827488cc4c943b20c99c | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
vector<vector<int>> occ(n, vector<int>(5));
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.le... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 40d7b76bf5e4dd79b0c2f3105e51f130 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;
// using namespace __gnu_pbds;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | 047674c5371c7393e78f2082143d84f3 | 1,500 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Random;
public class Main {
BufferedReader in;
PrintWriter out;
Main() {
in = new BufferedReader(... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 7ff23d47515880736b513afb1d479744 | 800 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
public class A{
public static void main(String[] args){
Scanner sc= new Scanner(System.in);
int t=sc.nextInt();
while(t>0){
String s= sc.next();
Map<Character,Integer> hm=new HashMap<Character,Integer>();
for(int i=0;i<s.length();i++){
... | Java | a6b760941ab8be2c32c6dc66c623ea0e | c2b7b9b7b8a30ba907dca8b9b654083a | 800 | PASSED |
//package cp;
import java.util.*;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.Math.max;
import java.io.*;
public class Codechef {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner in;
pub... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 25d7257e9d545f81c716fbfc6bf86283 | 800 | PASSED |
import java.util.*;
public class Test{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-- > 0){
String s = sc.next();
HashMap<Character, Integer> map = new HashMap<>();
for(int i... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 1b3840a6ca30399b69a6529ad6198ddf | 800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class Main {
static PrintWriter out;
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedRea... | Java | a6b760941ab8be2c32c6dc66c623ea0e | ad58b7e5daf0e03c5b637dd287517a4c | 800 | PASSED |
import java.util.*;
import java.io.*;
import static java.lang.Math.min;
import static java.lang.Math.max;
import static java.lang.Math.abs;
import static java.lang.Math.sqrt;
public class Solution {
static Scanner scn = new Scanner(System.in);
static StringBuilder sb = new StringBuilder();
static Prin... | Java | a6b760941ab8be2c32c6dc66c623ea0e | cc7fc9db72190914fb759fc50dfd8fed | 800 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Codechef
{
public static void main (String[] args)
{
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t--!=0)
{
String s=sc.next();
char s1[]=s.toCharArray();
int freq[]=new int... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 62ea38a1987667f4ec8f0aa3a8005d3c | 800 | PASSED |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for(int i=0;i<t;i++) {
String s = sc.next();
HashMap<Character, Integer> map = new HashMap<>();
for (int j = 0; j < s.length(); j++) ... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 0ec36bede7f60dae429aae0c3271a533 | 800 | PASSED |
import java.util.*;
public class WonderfulColoring1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 0; i < n; i++) {
int[] arr = new int[26];
String str = sc.next();
for(int j = 0; j... | Java | a6b760941ab8be2c32c6dc66c623ea0e | daaebcdea75cef0e736eeb2125e06732 | 800 | PASSED |
import java.util.*;
public class prg{
public static void main(String args[])
{
Scanner sc= new Scanner(System.in);
int t= sc.nextInt();
while(t-->0)
{ int a=0,ct=0;
String s = sc.next();
int l=s.length();
HashMap<Character, Integer> charCo... | Java | a6b760941ab8be2c32c6dc66c623ea0e | 464c690996ed5670759e5cdfe731e81e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=105,inf=0x3f3f3f3f,mod=1e9+7;
int dp[N][N],cnt[N],n,k;//深度，个数
vector<int>G[N];
void add(int &a,int b){
a+=b;
if(a>=mod)a-=mod;
}
void dfs_dep(int u,int fa,int dep){
cnt[dep]++;
for(auto v:G[u]){
if(v==fa)continue;
dfs_dep(v,u,dep+1);
... | C++ | d1245eadd5be9051c153161d0823b6dc | 66ec57572761828c4624f86a8e2adc67 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=105,inf=0x3f3f3f3f,mod=1e9+7;
int dp[N][N],cnt[N],n,k;//深度，个数
vector<int>G[N];
void add(int &a,int b){
a+=b;
if(a>=mod)a-=mod;
}
void dfs_dep(int u,int fa,int dep){
cnt[dep]++;
for(auto v:G[u]){
if(v==fa)continue;
dfs_dep(v,u,dep+1);
... | C++ | d1245eadd5be9051c153161d0823b6dc | 772ebc8856a04e937beae23ba2d7abfc | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=104,mod=1e9+7;
void solve(){
int n,k;
cin>>n>>k;
vector<vector<int>>G(n);
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
if(k==2){
cout<<n*(n-1)/2<<'\n';
return;
}
int ans=0... | C++ | d1245eadd5be9051c153161d0823b6dc | f6552178867e8eddf66c74c4b89d6c1b | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=104,mod=1e9+7;
void solve(){
int n,k;
cin>>n>>k;
vector<vector<int>>G(n);
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
if(k==2){
cout<<n*(n-1)/2<<'\n';
return;
}
int ans=0... | C++ | d1245eadd5be9051c153161d0823b6dc | 435fe317fcbeb094d3032f9332458ad7 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 110;
int n, k, g[N][N];
int cnt[N], dp[N];
void add(int& a,int b){
a += b;
if(a >= mod)a -= mod;
}
void solve() {
int ans = 0;
cin >> n >> k;
for (int i = 0; i <= n; i++)for (int j = 0; j <= n; j++) {
g... | C++ | d1245eadd5be9051c153161d0823b6dc | 7c3221c7f5a861a3bb50e23602c46d3e | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 110;
int n, k, g[N][N];
int cnt[N], dp[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
g[i][j] = (i == j) ? 0 : mod;
for (int i = 1; i < n; i++) {
int u... | C++ | d1245eadd5be9051c153161d0823b6dc | 8b9f5da2bf30006d0d96ac8e5afbe9c1 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ll = long long;
// I swear that I type this everytime, so this is not count as template :))
#define defop(type, op) \
inline friend type operator op (type u, const type& v) { return u op ##= v; } \
type& operator op##=(const typ... | C++ | d1245eadd5be9051c153161d0823b6dc | 36ca55ff7979b53813497fcd4a88a2b2 | 2,200 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
us... | C++ | d1245eadd5be9051c153161d0823b6dc | bb39c55aa02cf5bbcc2bcd7dbe7ad2d4 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n;long long mod=1e9+7;
vector<int>e[1000];
int k;
long long tims[100];
int passed[120];
long long sum;
void cal(int mid){
memset(passed,0,sizeof(passed));memset(tims,0,sizeof(tims));
vector<int>gp[102];
vector<int>tgp[102];
passed[mid... | C++ | d1245eadd5be9051c153161d0823b6dc | 4ef0b7f2bb0fc87cf48a5e4b7f6e38a6 | 2,200 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<tuple<int,int,int>> vti3;
//... | C++ | d1245eadd5be9051c153161d0823b6dc | 1ecc0893536683980f67c3d71567b510 | 2,200 | PASSED |
//
// the code was written by Romashevsky German Denisovich Sh 1, Lida 11 'V' class
//
/*
=+==++++%@#+***********+@**************+******************+**%=***********+******%@+**+*+++++=*****%+**********************+*++******@+***************+**++*********+=*****@+******%==+*****************
=++====+%=************%... | C++ | 98aca7d5bf74c7787bf2159770054297 | 977e5259c53c2c1f81c8f81322b1dd61 | 1,400 | PASSED |
#pragma GCC optimize(2)
#include <iostream>
#include <vector>
#include <set>
#include <cstring>
#include <unordered_map>
#include <algorithm>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
const int maxn = 2e5 + 5;
struct node
{
... | C++ | 98aca7d5bf74c7787bf2159770054297 | ea2029eab114bbe21d932d7521cece44 | 1,400 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#define graph vector<vector<int>>
#define HASH unordered_map
#define ll long long int
#define msi multiset<int>
#define msd multiset<double>
#define mapii map<int,int>
#define mapic map<int,char>
#define mapci map<char,int>
#define mapdi map<double,int>
#define maps... | C++ | 98aca7d5bf74c7787bf2159770054297 | 6947e3872f66fe9198aeffd82cc94c21 | 1,400 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#define vi vector<int>
#define pii pair<int,int>
using namespace std;
//nessa função utilizamos um template, ou seja
//ele reconhece o tipo do argumento que vai ser passado,
//ela serve para ler um array
template<class T>
T Push(T x, int n){
for(int i = 0; i < ... | C++ | 98aca7d5bf74c7787bf2159770054297 | 55376bfc91cfc0e9a58f6b7750d558ea | 1,400 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#define vi vector<int>
#define pii pair<int,int>
using namespace std;
//nessa função utilizamos um template, ou seja
//ele reconhece o tipo do argumento que vai ser passado,
//ela serve para ler um array
template<class T>
T Push(T x, int n){
for(int i = 0; i < ... | C++ | 98aca7d5bf74c7787bf2159770054297 | 7db4421df4aeb4e96e4c70d3cfaf5002 | 1,400 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
#define ll long long int
#define HASH unordered_map
#define vi vector<int>
#define pii pair<int,int>
#define vll vector<ll>
#define msi multiset<int>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {c... | C++ | 98aca7d5bf74c7787bf2159770054297 | e4709add22bcc03f6045126ed01aaa0a | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template <class T> char *debug_arr(T begin, T end) {
for (; begin != end; ++begin) {
cerr << *begin << " ";
}
return "";
}
#define DS cerr << "? ";
#define D(A) cerr << #A << ": " << A << ", ";
#define D2(A) cerr << #A << ": " << debug_arr(A.begin(), A.end... | C++ | 98aca7d5bf74c7787bf2159770054297 | 89825a33264b0b403d89f00a3f75d581 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " = " << x << endl
#define ios ios::sync_with_stdio(false)
#define ll __int128
#define cl cout << endl
#define cxl(x) cout << (x) << endl
#define pll pair<long long,long long>
const double PI=acos(-1.0);
const int mod=998244353;
const... | C++ | 98aca7d5bf74c7787bf2159770054297 | 33bc9f265e6d838d1b2beb6e67187e5f | 1,400 | PASSED |
#include <iostream>
#include <math.h>
#include <map>
#include <string.h>
#include <algorithm>
#include <stack>
#include <vector>
#include <set>
#define ll long long
#define ld double
using namespace std;
#define FOR(i,a,b) for (int i=a; i <=b; i++)
#define FORD(i,a,b) for (int i=a; i >=b; i--)
const int N=... | C++ | 98aca7d5bf74c7787bf2159770054297 | 6952587dd5cc664a0bd90b316f435375 | 1,400 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define endl '\n'
#define f(n) for(int i=0 ;i<n;i++)
#define fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
using namespace std;
int main()
{
fast
ll T=1;
cin>>T;
while (T--)
... | C++ | 98aca7d5bf74c7787bf2159770054297 | fd8bd15ca8b97534adf4fd0579477a6c | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e3+4;
void call()
{
int n, k;
cin>>n>>k;
vector<int> arr(n+1);
for(int i=1; i<=n; i++)
cin>>arr[i];
int dp[n+1][n+1];
memset(dp, 0, sizeof(dp));
for(int i=1; i<=n; i++)
{
... | C++ | 1042641f46ec636ca8820f0509c77a6f | df0880f1d2a3d4a1ef538e767a5e309a | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e3+4;
void call()
{
int dp[N][N];
int n, k;
cin>>n>>k;
vector<int> arr(n+1);
for(int i=1; i<=n; i++)
cin>>arr[i];
dp[0][0] = 0;
for(int i=1; i<=n; i++)
{
dp[i][0]... | C++ | 1042641f46ec636ca8820f0509c77a6f | e3565582cae4b807c7219760e9b0ff16 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef vector<bool> vb;
typedef pair<ll,ll> pii;
#define fo(i,s,e_ex) for(i=s;i<e_ex;i++)
#define Fo(i,k,n) for(i=k;k<n?i<=n:i>=n;k<n?i+=1:i-=1)
#define endl '\n'
#define MOD 1000000... | C++ | 1042641f46ec636ca8820f0509c77a6f | ead9e7dacf9a06b37b7282c53d4dd811 | 2,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<vl> vvl;
type... | C++ | 1042641f46ec636ca8820f0509c77a6f | c879c1f851f3a862cdfcdb0bd80cdc1c | 2,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<vl> vvl;
type... | C++ | 1042641f46ec636ca8820f0509c77a6f | f555b2807e96d891d1dc5fdbfa776ecb | 2,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<vl> vvl;
type... | C++ | 1042641f46ec636ca8820f0509c77a6f | 4cc65f98e99ba182356bd03a83b234cc | 2,000 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include<bits/stdc++.h>
#include <unordered_map>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define vi vector<int>
#define lp(i , n) for(int (i)=0 ; i<(n) ; i++)
#define lp1(i , n) for(int (i)=1 ; i<=(n) ; i++)
#define loop(i, a, b)... | C++ | 1042641f46ec636ca8820f0509c77a6f | 5bd39036486ee1354a16947a83820749 | 2,000 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include<bits/stdc++.h>
#include <unordered_map>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define vi vector<int>
#define lp(i , n) for(int (i)=0 ; i<(n) ; i++)
#define lp1(i , n) for(int (i)=1 ; i<=(n) ; i++)
#define loop(i, a, b)... | C++ | 1042641f46ec636ca8820f0509c77a6f | 951738f377b24fccd6df1c1a6bae1c49 | 2,000 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include<bits/stdc++.h>
#include <unordered_map>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define vi vector<int>
#define lp(i , n) for(int (i)=0 ; i<(n) ; i++)
#define lp1(i , n) for(int (i)=1 ; i<=(n) ; i++)
#define loop(i, a, b)... | C++ | 1042641f46ec636ca8820f0509c77a6f | 559389781b91e3303af5147c5e024a2a | 2,000 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include<bits/stdc++.h>
#include <unordered_map>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define vi vector<int>
#define lp(i , n) for(int (i)=0 ; i<(n) ; i++)
#define lp1(i , n) for(int (i)=1 ; i<=(n) ; i++)
#define loop(i, a, b)... | C++ | 1042641f46ec636ca8820f0509c77a6f | dffbfe9cc1e4a10e1636b365285d4c47 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
int main()
{
//freopen("in.txt", "r", stdin);
ll a,b,bb,cc,aa,c,t,n,k,m;
sg s;
cin>>t;
while(t--){
cc = -1;
cin>>m>>n>>k;
ch... | C++ | a15f7324d545c26725324928eaaa645c | ebe97c7b8401f57885a153e568678385 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
int main()
{
//freopen("in.txt", "r", stdin);
ll a,b,bb,cc,aa,c,t,n,k,m;
sg s;
cin>>t;
while(t--){
cc = -1;
cin>>m>>n>>k;
ch... | C++ | a15f7324d545c26725324928eaaa645c | 469dfabd6edfd4fb9b5319447fcbf08b | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
int main()
{
// freopen("in.txt", "r", stdin);
ll a,b,bb,cc,aa,c,t,n,k,m;
sg s;
cin>>t;
while(t--){
cc = -1;
cin>>m>>n>>k;
ch... | C++ | a15f7324d545c26725324928eaaa645c | 7fd7563cffefbe83a9e411aafa13e818 | 2,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void put_vertical(vector<vector<char>> &maze, vector<char> &letters, int &idx, int r, int c, int n, int m){
int nr[] = {r-1, r, r+1, r+2, r+1, r, r-1, r-1, r+2, r+2};
int nc[] = {c, c+1, c+1, c, c-1, c-1, c-1, c+1, c+1, c-... | C++ | a15f7324d545c26725324928eaaa645c | 64e7d8cf96ac0693f5d25f8f14798d8e | 2,100 | PASSED |
#include <bits/stdc++.h>
#define de(x) cerr << " debug " << #x << " == " << x << endl;
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 7;
const double eps = 1e-8;
const double PI = acos(-1.0);
inline int qpow(int x, int n) {
int ret = 1;
for (; n; n >>= 1) {
if (n &... | C++ | a15f7324d545c26725324928eaaa645c | d6293ed5bc5ea449e3f3a6c34e19f359 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void domino(int a, int b,int k)
{
int temp=(a*b)/2;
temp=temp-k;
string arr[a];
if(temp>k && b%2==0 || a%2==1 && a!=1 || b==1 && b%2==1)
{
char ch1='a';
char ch2='b';
int temp2=0;
int temp3=0;
int n=0;
int m=0;
if(temp... | C++ | a15f7324d545c26725324928eaaa645c | 8131008deee2c6896990e9592a55f6b9 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void domino(int a, int b,int k)
{
int temp=(a*b)/2;
temp=temp-k;
string arr[a];
if(temp>k || a%2==1 && a!=1)
{
char ch1='a';
char ch2='b';
int temp2=0;
int temp3=0;
int n=0;
int m=0;
if(temp>0){
for(int i=0;i<a;i=... | C++ | a15f7324d545c26725324928eaaa645c | 96d8c8252174ca0f08add0799b2b458d | 2,100 | PASSED |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
void print(vector<int> v) {
for (int i: v) {
cout << i << " ";
}
cout << endl;
}
void print(vector<long long> v) {
for (long long x: v) {
cout << x << " ";
... | C++ | a15f7324d545c26725324928eaaa645c | 51f4b9cdd80f7e28e4b502bba99219b2 | 2,100 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
us... | C++ | a15f7324d545c26725324928eaaa645c | 0f119212a3cff623a2e026159c34b2a3 | 2,100 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
us... | C++ | a15f7324d545c26725324928eaaa645c | 8e1e40a2b2a23a1eb8f061953c0d04a1 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> x(n + 1,0), y(n + 1,0);
set<int> stX, stY;
for (int i = 1; i <= n + 1; i++)
{
stX.insert(i);
stY.insert(i);
}
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | b286d91c0938f658184a80681b95a586 | 1,400 | PASSED |
// JAI BAJARANG BALI
// manitianajay45
// give me some sunshine, give me some rain, give me another chance to grow up once again.....
// sab moh maya hai....
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(fals... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 5266e6219cdcc7c1602d0a135d741e14 | 1,400 | PASSED |
// JAI BAJARANG BALI
// manitianajay45
// give me some sunshine, give me some rain, give me another chance to grow up once again.....
// sab moh maya hai....
#include<bits/stdc++.h>
using namespace std;
// using namespace __gnu_pbds;
// #define int int
#define mod 1000000007
int main(){
i... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 0d8aff6dc089f6e34f92456292757647 | 1,400 | PASSED |
//testing
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 7330b0cee7d68852b18f9b2333e0b62a | 1,400 | PASSED |
// JAI BAJARANG BALI
// manitianajay45
// give me some sunshine, give me some rain, give me another chance to grow up once again.....
// sab moh maya hai....
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define mod 1000000007
class segment{
public:
vector<ll> v;
ll siz;... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 1ca24d49989aebd211ec090c182ef724 | 1,400 | PASSED |
#include <bits/stdc++.h>
using ll = long long;
template <typename T>
struct Fenwick {
const int n;
std::vector<T> a;
Fenwick(int n) : n(n), a(n) {}
void add(int x, T v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] += v;
}
}
T sum(int x) {
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 39be0a149ecd945506a6bbb0fbfa6253 | 1,400 | PASSED |
#include <bits/stdc++.h>
using ll = long long;
template <typename T>
struct Fenwick {
const int n;
std::vector<T> a;
Fenwick(int n) : n(n), a(n) {}
void add(int x, T v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] += v;
}
}
T sum(int x) {
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 2d804f4e91c3be2127a6a9dd186031e9 | 1,400 | PASSED |
#include <bits/stdc++.h>
using ll = long long;
template <typename T>
struct Fenwick {
const int n;
std::vector<T> a;
Fenwick(int n) : n(n), a(n) {}
void add(int x, T v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] += v;
}
}
T sum(int x) {
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 0ede9aadcdcf7f1e98f617ca6090e2ad | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// struct Fenwick {
// const int n;
// std::vector<int> a;
// Fenwick(int n) : n(n), a(n + 1) {}
// void add(int x, int v) {
// for (int i = x; i <= n; i += i & -i) {
// a[i] += v;
// }
// }
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 37b78e1a62204cdeeff50485bf5aa209 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// struct Fenwick {
// const int n;
// std::vector<int> a;
// Fenwick(int n) : n(n), a(n + 1) {}
// void add(int x, int v) {
// for (int i = x; i <= n; i += i & -i) {
// a[i] += v;
// }
// }
... | C++ | bd95629c1698cf1d0cfd338afcf1ca93 | 13f0e65c546581315ccba47ac619910c | 1,400 | PASSED |
#include <stdio.h>
#include <cstdlib>
#include <cassert>
#include <iostream>
#include <set>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <complex>
#include <map>
#include <unordered_map>
#include <queue>
#include <array>
#includ... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 820ede81254b3c853f99e3e6e4ab1a4e | 1,200 | PASSED |
#include<iostream>
#include<map>
using namespace std;
typedef long long ll;
const int N = 200010;
int a[N];
map<ll,ll> mp;
int main(){
int n,q;
bool cnt = false;
ll sum=0;
scanf("%d %d",&n,&q);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
int op,idx,val,last;
while(q--){
scanf(... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 92225ea54669f76505f1a1daa025285e | 1,200 | PASSED |
#include<iostream>
#include<map>
#define int long long
using namespace std;
typedef long long ll;
map<ll,ll> mp;
const int N = 200100;
int a[N];
signed main(){
int n,q;
int sum = 0;
int op;
bool cnt=0;
cin>>n>>q;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum+=a[i];
}
while(q--){
int... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 591b7ee5caa77d90a9f757c765bf1e6d | 1,200 | PASSED |
/// add to friend: Botur
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define p_f pop_front
#define p_b pop_back
#define fi first
#define se second
#define int long long
#define Sort(a) sort(a.begin(), a.end())
#define Rsort(a) sort(a.rbegin(), a.rend())
#define Reverse(a) reverse(... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 28b2a847531a4774131af91adce3c1cf | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define M 1000000007
using namespace std;
int main()
{
ll n, q, i, ans = 0;
cin >> n >> q;
ll arr[n+1];
for(i = 1; i <= n; i++){
cin >> arr[i]; ans+=arr[i];
}
ll x, y, z;
map< ll , ll > mm;
ll current = -1... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 2a67558d99bac2ea2d60fc88f31e4ddd | 1,200 | PASSED |
#include <bits/stdc++.h>
#define lson rt<<1
#define rson rt<<1|1
#define int long long
using namespace std;
inline int read(){
register int w=1,x=0,ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return x*w;
}
const int MAXN = (int)2e5+10;
int n,q;
i... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | a8f91ee4bd75209672e0db45ee779bc2 | 1,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<set>
#include<cstring>
#define ll long long int
using namespace std;
const int N=2e5+10;
ll a[N];
int v[N];
int main()
{
int n,q;
cin>>n>>q;
ll sum=0,add=0; int now=0;//总修改次数
for(int i=1;i<=n;i++) scanf("%lld",&a[i]),sum+=a[i]... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 6103bc1a603b8bd2226ef2ea51bfc149 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll l = 10e9;
int main() {
ll n, q; cin >> n >> q;
ll a[n];
ll sum = 0;
ll y = 0 , bl = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
//m[i+1]=a[i];
sum += a[i];
}
map <ll, ll>m;
for (ll i = ... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 423827b1edbf8b96f1e4ea8208f5a35a | 1,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
int a[200010]={0},c[200010];
int main()
{
int n,q;
LL sum=0;
scanf("%d%d",&n,&q);
for(in... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | c7d6c420ef65ce805fadfa51e65102e3 | 1,200 | PASSED |
#include<iostream>
using namespace std;
int main(){
int n=0,q=0,a[200005]={0},b[200005]={1};
long long sum=0,X=0,x=0;
int t=0,k=0,zero=0;
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
b[i]=1;
}
for(int i=1;i<=q;i++){
cin>>t;
if(t=... | C++ | b9771f941967b030aa13d0bfcc4d0a61 | 659d5880dbf1c377ba418ecbe8ca9199 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl "\n"
#define vt vector
#define cin(v)for (auto &x : v) cin >> x
#define cout(v)for (auto &x: v) cout << x sp
#define N 500
#define cin_frq(v, m) for (auto &x : v){cin >> x ; m[x]++; }
#define sp << " "
#define... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | a025a4e295a1f40689183f7b1abf1411 | 900 | PASSED |
#include <bits/stdc++.h>
#define _AdHam ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define T int T; cin >> T; while(T--) go()
#define sz(x) (int) x.size()
#define vec vector
typedef long long ll;
using namespace std;
const int N = 2e5 + 1;
void go() {
ll n;
cin >> n;
if (n == 4... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | fe4149dd9e783e08b219a414496667cb | 900 | PASSED |
#include <bits/stdc++.h>
#define ld long double
#define ll long long
#define yes cout<<"YES"<<'\n'
#define no cout<<"NO"<<'\n'
using namespace std;
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int m;
cin >> m;
for (int i = 1; i <= m; i++) {
ll n;
... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | 8c98de005865e0a312f8b54814b83282 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void sol(vector<long long int> v, int n)
{
//vector<pair<long long int, long long int>> ans;
for(int i=0; i<n; i++)
{
if(v[i]%2!=0)
{
cout<<"-1"<<endl;
}
else if(v[i]==2)
{
cout<<"-1... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | d5524a176825c48a0d22d317b2b02a6a | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define open freopen("input.txt" , "r" , stdin);
#define close freopen("output.txt" , "w" , stdout);
using namespace std;
ll t, n, k = 0, k1 = 0, l = 0, l1, m, ku = 0, ku1, sum = 0, h, dip0 = 0, dip1 = 0, udar, p = 0, howmany[117], maxi = -1e9, r ;
ll mx = -1e9, a, b,... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | f7d007a56d5536de26a97cd28c71fc4b | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define open freopen("input.txt" , "r" , stdin);
#define close freopen("output.txt" , "w" , stdout);
using namespace std;
ll t, n, k = 0, k1 = 0, l = 0, l1, m, ku = 0, ku1, sum = 0, h, dip0 = 0, dip1 = 0, udar, p = 0, howmany[117], maxi = -1e9, r ;
ll mx = -1e9, a, b,... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | 33f398e9a86f33cd5e75e541e0075883 | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define open freopen("input.txt" , "r" , stdin);
#define close freopen("output.txt" , "w" , stdout);
using namespace std;
ll t, n, k = 0, k1 = 0, l = 0, l1, m, ku = 0, ku1, sum = 0, h, dip0 = 0, dip1 = 0, udar, p = 0, howmany[117], maxi = -1e9, r ;
ll mx = -1e9, a, b,... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | 1f4ad7c6f704cacba3c624ebbaa14c7c | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define open freopen("input.txt" , "r" , stdin);
#define close freopen("output.txt" , "w" , stdout);
using namespace std;
ll t, n, k = 0, k1 = 0, l = 0, l1, m, ku = 0, ku1, sum = 0, h, dip0 = 0, dip1 = 0, udar, p = 0, howmany[117], maxi = -1e9, r ;
ll mx = -1e9, a, b,... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | f9ee841ec796b3f40904b01b074ddcc4 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long int n;
cin >> n;
if (n % 2 != 0 || n < 4) cout << "-1\n";
else {
long long temp = n / 2, r2, r1;
if (temp % 2 == 0) {
r2 = temp / 2;
}
else {
r2 = (temp - 1) / 2 ;
}
if (temp % 3 == 0) {
... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | 5a6a14a6dbe637364c092a0548e9a595 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long int n;
cin >> n;
if (n % 2 != 0 || n < 4) cout << "-1\n";
else {
long long temp = n / 2, r2, r1;
if (temp % 2 == 0) {
r2 = temp / 2;
}
else {
r2 = (temp - 2) / 2 + 1;
}
if (temp % 3 == 0) {... | C++ | 1cc628b4e03c8b8e0c5086dc4e0e3254 | 23f816b5606a9765bd2200cb23d6c1f1 | 900 | PASSED |
//#pragma GCC optimize(3)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#define INF 0x7fffffff
#define int long long
using namespace std;
int n,m,k,cnt=0;
int a[200005],b[200005],v[200005],f[200005],rd... | C++ | 1b36b12307b1a324b84e878d11efbbec | d99b2871462d9494763b6dc5f00a6099 | 1,900 | PASSED |
//#pragma GCC optimize(3)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#define INF 0x7fffffff
#define int long long
using namespace std;
int n,m,k,cnt=0;
int a[200005],b[200005],v[200005],f[200005],rd... | C++ | 1b36b12307b1a324b84e878d11efbbec | 131ec764fcd6e9e93360fb29bba3bdf5 | 1,900 | PASSED |
//#pragma GCC optimize(3)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#define INF 0x7fffffff
#define int long long
using namespace std;
int n,m,k,cnt=0;
int a[200005],b[200005],v[200005],f[200005],rd... | C++ | 1b36b12307b1a324b84e878d11efbbec | 234a47af176c72dd279984d328f9f46d | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,ck;
ll k;
bool c;
ll a[1000007];
ll id[1000007];
int vis[1000007];
ll f[1000007];//以i结尾且以i为最大值的最长路径
vector<int> g[1000007];
vector<int> rg[1000007];
int pass[1000007];
int use[1000007];
ll l=1e9,r=-1;
bool cmp(int x,int y){
ret... | C++ | 1b36b12307b1a324b84e878d11efbbec | 08a7f786ff83ba45aa2c01f3be427ae0 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,k,nb;
struct node{
int data,nxt;
}a[400005];
int first[400005];
int cnt;
int vis[400005];
int f[400005];
int val[400005];
void add(int x,int y){
cnt++;
a[cnt].data=y;
a[cnt].nxt=first[x];
first[x]=cnt;
}
int dfs(int x,int ... | C++ | 1b36b12307b1a324b84e878d11efbbec | cfc24bf192fc5e216d3ceb42918dff39 | 1,900 | PASSED |
// i started at 1:03 A.M. 1/2/2022 Author:: Gorssorser , nice to see you here , thnx for visiting
#include <iostream>
#include <iomanip>
#include <list>
#define ll long long int
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <sstream>
#include <deque>... | C++ | 1b36b12307b1a324b84e878d11efbbec | 9161e1198b605fe5d1f41a43ff50c1ea | 1,900 | PASSED |
#include<iostream>
#include<cstring>
#include<queue>
#define int long long
using namespace std;
const int N = 2e5+10;
int e[N],h[N],ne[N],a[N],b[N],c[N],deg[N],d[N];
int idx;
int n,m,k;
void add(int a,int b)
{
e[idx] = b;
ne[idx] = h[a];
h[a] = idx++;
}
bool toposort(int mid)
{
queue<int> q;
for(i... | C++ | 1b36b12307b1a324b84e878d11efbbec | a045a87c2c26e400f2a1d4b6f358c9a3 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 300010
int n,m,k,x,y,val[N],len[N];
struct Edge {int x,y,w;} e[N];
bool cmp(Edge a,Edge b) {return a.w < b.w;}
int in_num[N];
vector<int>edge[N];
bool topo()
{
queue<int>sk;
int sum = 0,maxx = 0;
for(int i = 1;i <= n;++i)
i... | C++ | 1b36b12307b1a324b84e878d11efbbec | 6c355c2d9d32e8131875a40b0b197390 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define N 1010000
#define fer(x,y,z) for(register int x=y;x<=z;x++)
using namespace std;
int n,m,K,a[N];
int xx[N],yy[N],dis[N],in[N];
int las[N],to[N],nxt[N],tnt;
void add(int x,int y){nxt[++tnt]=las[x],las[x]=tnt,to[tnt]=y;}
void sak_dfs(int x){
dis[x]=1;in[x]=1;
for(int i=las[x];i... | C++ | 1b36b12307b1a324b84e878d11efbbec | 01a7fd33caa5d024b0a01aadded9011f | 1,900 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long... | C++ | 1b36b12307b1a324b84e878d11efbbec | f5578e4e1e8e108384a39a8eb36285a3 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const int Mod = 998244353;
int f[1<<17][18], pre[18][maxn];
char s[maxn];
int main() {
int n;
scanf("%d%s", &n, s);
int tot = 0;
for(int i = 0; i < n; i++) tot += s[i]=='?';
for(int i = 1... | C++ | 1f13db0d8dcd292b55f49077b840e950 | cc132b8554b90a035f03c6b3550782be | 2,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.