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 |
|---|---|---|---|---|---|
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define fi first
#define se second
#define pii pair<int,int>... | C++ | cb47d710361979de0f975cc34fc22c7a | 263cefe7893996fdfcdf120cfb35f1e7 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
//cin>>t;
while(t--)
{
double n;
double sum=0;
cin>>n;
//ll a[n];
while(n)
{
sum = sum + 1/n;
n--;
}
co... | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | dce60b7b46499a4dd7399d2c91066279 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
double sum=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
sum+=(double)1/(double)i;
printf("%llf",sum);
return 0;
}
| C++ | 260666df22ee510fcce3ebdfbb8b71a2 | 63132d4d39bbc4ce8a31fd03bd9f25c3 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a;
double s=0;
cin>>a;
for(int i=1;i<=a;i++)
s+=(double)(1*1.0/i);
cout<<fixed<<setprecision(6)<<s<<endl;
return 0;
}
| C++ | 260666df22ee510fcce3ebdfbb8b71a2 | 196d22f714340b33b150bd452ba08406 | 1,000 | PASSED |
//
// main.cpp
// poj
//
// Created by Marvin on 12/28/19.
// Copyright © 2019 TBD. All rights reserved.
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <stdio.h>
#include <fstream>
#include <string>
#include <map>
#include <math.h>
#include <stdlib.h>
#def... | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | 8b7443c168a4a56fb3b802619699cb6e | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
double sum=0.0;
while(n>0){
sum+=1.0/n;
n--;
}
cout<<sum;
} | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | 1a2707bf936356343b21c6fb5d70c721 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define For(i, j, n) for (int i = j; i < (int)n; ++i)
#define ll long long
#define ull unsigned long long
ll mod = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
double ans = 1.0;
vector<pai... | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | ffcff544632dc0fb8e29fbbce184961a | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
long long n;
cin>>n;
double a=0;
for(int i=1;i<=n;i++)
{
a+=1.0/i;
}
cout<<fixed<<setprecision(12)<<a<< endl;
}
return 0;
} | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | dabd2837e1aad64d9f16e4591646e06b | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
long long n;
cin>>n;
double a=0;
for(int i=1;i<=n;i++)
{
a+=1.0/i;
}
cout<<a<< endl;
}
return 0;
} | C++ | 260666df22ee510fcce3ebdfbb8b71a2 | 9ce0c03472524ebb8cce0e8e6ebdce27 | 1,000 | PASSED |
#include<iostream>
#include<map>
#include<stdio.h>
using namespace std;
int main()
{
int n,t=1,s;
cin>>n;
double sum=0.0;
while(n > 0)
{
sum += t/(float)n;
n--;
}
printf("%f",sum);
}
| C++ | 260666df22ee510fcce3ebdfbb8b71a2 | da1bbb843288d81bb473b7c74a152b99 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define STORPA ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
int main(){
STORPA;
int n;
cin >> n;
double ans=0;
for(int i=n; i>=1; i--){
ans+=1.0/i;
}
cout << fixed << setprecision(12) << ans;
}
| C++ | 260666df22ee510fcce3ebdfbb8b71a2 | ca86d7771d734cdc76539a5fdc352a83 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define INF 0x7f7f7f7f7f
#define int long long
#define MAXN 2005
int n,k;
int dp[MAXN],val[MAXN];
int Abs (int x){return x >= 0 ? x : -x;}
bool check (int mid)
{
for (Int i = 1;i <= n;++ i) dp[i] = i - 1;
for (Int i = 1;i <= n;++ i)
for (Int... | C++ | 544dd0c7274ac337744b8ba0996add1d | 42561030ca67b70e7da1cbfb417c52fc | 2,000 | PASSED |
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
#define LL long long
using namespace std;
int N,K;LL F[2001],A[2001];
bool Check(int Pos){
LL Max=1;For(i,1,N) F[i]=1; //³õÖµÒª¶¨ºÃ,»¹ÓÐÒòΪÏÂÃæif¿ÉÄÜÒ»´Î¶¼½ø²»È¥,ËùÒÔMaxÒ»¿ªÊ¼ÒªÊÇ1
For(i,2,N)For(j,1,i-1... | C++ | 544dd0c7274ac337744b8ba0996add1d | 6e182147e3aa1493adbdea573527408f | 2,000 | PASSED |
#include<bits/stdc++.h>
#define M 2005
using namespace std;
long long n,m,a[M],f[M];
bool check(long long x)
{
register long long i,j;
for(i=1;i<=n;i++)f[i]=i-1;
for(i=1;i<=n;i++)
{
for(j=1;j<i;j++)
{
if(abs(a[i]-a[j])<=(i-j)*x)f[i]=min(f[i],f[j]+i-j-1);
}
}
for(i=1;i<=n;i++)if(f[i]+n-i<=m)return 1;
ret... | C++ | 544dd0c7274ac337744b8ba0996add1d | e3d498795972bf8496adbae22878663e | 2,000 | PASSED |
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 2e3 + 5;
LL a[MAXN], dp[MAXN], n, m;
bool check(LL x) {
for(int i = 2; i <= n; ++i) {
dp[i] = i - 1;
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j < i; ++j) {
if(abs(a[i] - a[j]) <= (i - j... | C++ | 544dd0c7274ac337744b8ba0996add1d | 068955c543a37d13f99a14aa4e807e81 | 2,000 | PASSED |
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
const int N = 1e9;
int a[2005], f[2005];
int n, ans;
inline bool check(long long x) {
for(register int i = 1; i <= n; i++) {
f[i] = i - 1;
for(register int j = 1; j < i; j++)
if(abs(a[i] - a[j]) <= (i - j) * x)
f[i] = min(f[i], ... | C++ | 544dd0c7274ac337744b8ba0996add1d | f3e1553357aa8be7237e14d1f7e7e570 | 2,000 | PASSED |
#include<cstdio>
#include<cmath>
#include<algorithm>
#define inf 1000000000
#define ll long long
using namespace std;
inline ll read() {
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,K;
int a... | C++ | 544dd0c7274ac337744b8ba0996add1d | 92bf7e1c7dcc71765bade904e351b652 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2020;
const int inf = 0x3f3f3f3f;
int v[N];
int dp[N][2];
int n;
ll c;
// a x y b
// a (a+c) (a+c+c) (a+c+c+c)
int go(int i, int s) {
if (i == n) return 0;
int& ans = dp[i][s];
if (ans != -1) return ans;
ans = inf;
if (s == 0) {... | C++ | 544dd0c7274ac337744b8ba0996add1d | f47a2c190357267402b5cfb215830117 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[2001], dp[2001];
bool check(int c) {
int res = INT_MAX;
for(int i = 1; i <= n; i++) {
dp[i] = i-1;
for(int j = 1; j < i; j++) if(abs(a[i]-a[j]) <= 1ll*c*(i-j)) dp[i] = min(dp[j] + i-j-1, dp[i]);
res = min(dp[i] + n-i, res);
... | C++ | 544dd0c7274ac337744b8ba0996add1d | 4044d39590e1c1be99485f035bf84cac | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[2001], dp[2001];
bool check(int c) {
int res = INT_MAX;
for(int i = 1; i <= n; i++) {
dp[i] = i-1;
for(int j = 1; j < i; j++) if(abs(a[i]-a[j]) <= 1ll*c*(i-j)) dp[i] = min(dp[j] + i-j-1, dp[i]);
res = min(dp[i] + n-i, res);
... | C++ | 544dd0c7274ac337744b8ba0996add1d | 09762dcb611f9be5e72b920f879f0f55 | 2,000 | PASSED |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<functional>
using namespace std;
typedef long long inl;
inl n, k;
inl m;
const inl inf = 1e9;
vector<inl> a;
bool check()
{
vector<inl> dp(n);
for (int i = 0; i < n; i++)
... | C++ | 544dd0c7274ac337744b8ba0996add1d | 619252d287bc3df580a891f1a668170a | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
lint v[100001];
lint mod[101];
lint euler(lint nr)
{
lint rez = nr;
lint p = 0;
lint d = 2;
while((nr & 1) == 0)
{
nr >>= 1;
p ++;
}
if(p != 0)
{
rez /= d;
rez *= (d - 1);
}
... | C++ | a0038cd4698c649cf95759d744854cfc | 00174ab0a83caa579b3fd035a6332136 | 2,700 | PASSED |
//while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define FOR(i,a,b) for(register ll i=(a),____u=(b);i<=____u;++i)
#define DEP(i,a,b) for(register ll i=(a),____u=(b);i>=____u;--i)
... | C++ | a0038cd4698c649cf95759d744854cfc | 58aac71197f7aac071464c99889f32bb | 2,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#define rep(i,l,r) for(ll i=l;i<=r;++i)
#define rpe(i,r,l) for(ll i=r;i>=l;--i)
#define rpp(i,x,e,head) for(ll i=head[x];~i;i=e[i].next)
#define dyes cerr<<"yes"<<endl
#define pts puts("")
#define d... | C++ | a0038cd4698c649cf95759d744854cfc | 575c306324700c48bbe9b3c13d34ce0a | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef int I;
typedef long long int LL;
typedef double D;
typedef long double LD;
typedef pair<I,I> PII;
typedef pair<LL,LL> PLL;
typedef pair<LL,I> PLI;
typedef pair<D,I> PDI;
typedef vector<I> VI;
typedef vector<LL> VLL;
typedef vector<D> VD;
typedef vector<LD> VLD;
... | C++ | a0038cd4698c649cf95759d744854cfc | cc5bc10ba6b10bede9d1c99e292ea4ee | 2,700 | PASSED |
using namespace std;
#include<bits/stdc++.h>
#define st first
#define nd second
#define FORE(i,a,b) for(int i=(a),b_=(b);i<=b_;++i)
#define FORD(i,a,b) for(int i=(a),b_=(b);i>=b_;--i)
#define TR(c, it) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); it++)
const int MAXN = 1e5 + 5 ;
int w[MAXN] ;
map <int , in... | C++ | a0038cd4698c649cf95759d744854cfc | 96ffe75fcc8c48fcf6c859fa85428a3a | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, nT, t[1<<17], w[1<<17], Q;
int l, r;
ll mul(ll a, ll b, ll m) { return a*b >= m ? a*b%m + m : a*b; }
ll mpow(ll b, ll exp, ll m) {
ll r = 1;
while (exp) {
if (exp & 1) r = mul(r,b,m);
b = mul(b,b,m);
exp /= 2;
}
return r;
}
int ph... | C++ | a0038cd4698c649cf95759d744854cfc | a0d47fbb8e3a127141d85048eac63255 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define SQ(a) (a)*(a)
#define F0R(i, a) for(int i = 0; i < (a); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define R0F(i, a) for(int i = (a) - 1; i >= 0; i--)
#define ROF(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define rand31() ((rand() << 16) | (rand() << 1) | (rand() & 1... | C++ | a0038cd4698c649cf95759d744854cfc | 765f062648c81974aa4a8cb72090db91 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define rep(i,s,t) for(ll i=s;i<=(t);++i)
#define mod(a,b) (a<b?a:(a%b+b))
using namespace std;
#define Pr(f,...) //printf(f,##__VA_ARGS__),fflush(stdout);
typedef long long ll;
const int N=1e5+50,M=105;
ll n,m,q,w[N],pn,ps[M];
ll phi(ll x){
ll res=1;
for(ll i=2;i*i<=x;++i)if(x%i==0){
... | C++ | a0038cd4698c649cf95759d744854cfc | 506bba738d4bc9a9517182e40763c71f | 2,700 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define rep(i,b,e)for(int i=(b);i<(e);i++)
#define repd(i,b,e)for(int i=(b);i>=(e);i--)
#define each(a,x)for(auto&a:(x))
#define all(x)(x).begin(),(x).end()
#define sz(x)int((x).size())
#define TM template<class T,class U=int,class...V>
#define DF(t,...)TM auto operator<<(... | C++ | a0038cd4698c649cf95759d744854cfc | fc1a2627f4ffe2a17ab92bf818835335 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 100110
#define ll long long
int euler(int n)
{
int ans=n;
for(int i=2;i*i<=n;++i)
{
if(n%i==0)
{
ans-=ans/i;
while(n%i==0)
n/=i;
}
}
if(n>1) ans-=ans/n;
return ans;
}
int eu[... | C++ | a0038cd4698c649cf95759d744854cfc | f7fcffa052b0b0baea19796322de9af5 | 2,700 | PASSED |
// practice with kaiboy
import java.io.*;
import java.util.*;
public class CF907A extends PrintWriter {
CF907A() { super(System.out, true); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
CF907A o = new CF907A(); o.main(); o.flush();
}
void main() {
int a = sc.nextInt();
int b ... | Java | 56535017d012fdfcc13695dfd5b33084 | 0c030e8618ef2e4b898a7cf3a3c0a1d5 | 1,300 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.InputStreamReader;
import java.io.BufferedOutputStream;
import java.util.StringTokenizer;
import java.io.Closeable;
import... | Java | 56535017d012fdfcc13695dfd5b33084 | 99dc2d0ffae34b62a675ee4ddfd1450e | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
int o=max(c,d);
vector<int> otv;
if(o>2*c||o>2*d){
cout<<"-1";
return 0;
}
otv.push_back(o);
o*=2;
o++;
o=max(o,b);
if(o>2*b){
cout<<"-1";
... | C++ | 56535017d012fdfcc13695dfd5b33084 | 9d7e83d284ffffe43e7278270693681b | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
int f,m,s,masha;
cin>>f>>m>>s>>masha;
for(int i=1; i<=200; i++)
{
for(int j=1; j<i; j++)
{
for(int k=1; k<j; k++)
{
if(f<=i&&2*f>=i&&m<=j&&2*m>=j&&s<=k&&2*s>=k)
{
if(masha<=k&&2*masha>=k&&2*masha<j&&2*mash... | C++ | 56535017d012fdfcc13695dfd5b33084 | 08e6e397ee5fe51bc77391add5856fcd | 1,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define inf 1000001
using namespace std;
int main(){
ll v1,v2,v3,vm;cin>>v1>>v2>>v3>>vm;
if(2*v3<vm || 2*vm<v3){cout<<-1;return 0;}
if(2*vm>=2*v2){cout<<-1;return 0;}
ll x=2*min(v3,vm);
ll y,z;
if(2*v2>2*vm)
y=2*v2;
if(y+1>=v1 && (y+1)<=2*v1)
z=y+1;
... | C++ | 56535017d012fdfcc13695dfd5b33084 | 3663b662d1b095547b3ff098522cf911 | 1,300 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include<fstream>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ct... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | b472b37069fca2407186f2fe8b05fa44 | 1,300 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string x; int n,s,t;
cin>>n;
cin>>x;
for(int i=0;i<n;i++)
if(x[i]=='R')
{s=i+1; break;}
else if(x[n-i-1]=='L')
{s=n-i; break;}
for(int i=0;i<n;i++)
if(x[i]=='R'&&x[i+1]=='L')
... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 5f854ffed4591d2c4972deefc2c0c556 | 1,300 | PASSED |
#include <iostream>
#include <vector>
int main(){
using namespace std;
int n;
cin >> n;
char ch;
vector<char> a;
int s = -1;
for(int i = 0; i < n; i++){
cin >> ch;
if(ch == '.'){
continue;
}
if(s == -1){
s = i + 1;
}
a.push_back(ch);
}
int c;
for(int i = 1; i < a.size(); i++){
if(a[i] !=... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 24bb286382849474ea0d3dc9dd17eeac | 1,300 | PASSED |
#include <stdlib.h>
#include <time.h>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <fstream>
#include <string>
#include <map>
#include <set>
using namespace std;
const int M=1000+10;
typedef long long int ll;
int main()
{
//freopen... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 30ce6dcea65406eaedddaa102b6b521d | 1,300 | PASSED |
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <stdlib.h>
#include <sstream>
#include <assert.h>
#include <time.h>
#pragma comment(linker, "/STACK:20000000")
#defin... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 05deec982926d3a524527e5414cfd606 | 1,300 | PASSED |
//#pragma comment(linker, "/STACK:256000000")
#include<iostream>
#include<string>
#include<climits>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<memory>
#include<cstring>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<utility>
#i... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | ca6c7a105f386e8b1da26e619df1afa5 | 1,300 | PASSED |
//steps
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int st_pos = s.find('R');
int last_pos=st_pos;
int left = count(s.begin(), s.end(), 'L'), right = count(s.begin(), s.end(), 'R');
if (left&&!right){
... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 040f071d52ddb1b2b146080fe90691a9 | 1,300 | PASSED |
#include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
char a[1... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 3419feb591d50b0d2b523ddeb87bd6e2 | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
using namespace std;
int n,R,L,l,r;
string s;
int main(){
scanf("%d",&n);
cin>>s;
for(int i=0;i<n;i++){
if(s[i]=='R'){
R++;
r=i+1;}
else if(s[i]=='L')
{
l=1+i;
L++;
}
}
if(R>0){
printf(... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 1cc59741645c9d56e025a9756b8bddd0 | 1,300 | PASSED |
#include<iostream>
#include<string>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
string str;
int n,x=-1,y,c=0,l=0,r=0;
cin>>n;
cin>>str;
for(int i=0;i<str.length();i++)
{
if(str.at(i)!='.')
{
c++;
if(x==-1)
x=i;
if(str.at(i)=='L')
l++;
else
r++;
y=i;... | C++ | 3053cba2426ebd113fcd70a9b026dad0 | 6550d65836a006bd8240f76cb3ad81d5 | 1,300 | PASSED |
/*
Author: Arjan Singh Bal, IIITM Gwalior
"Everything in this world is magic, except to the magician"
*/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "pprint.hpp"
#endif
using namespace std;
template <typename Arg1>
void prn(Arg1&& arg1)
{
cout<<arg1<<"\n";
}
templ... | C++ | 933135ef124b35028c1f309d69515e44 | c1b2a9e163a0fd0a0c77ea3c8ea8b941 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define tie() ios_base :: sync_with_stdio(0); cin.tie(0) ; cout.tie(0);
#define endl '\n'
int N = 1e6 + 2;
int bs(int l , int r , int &n)
{
while(l <= r)
{
int m = (l + r) / 2;
int cube = m * m * m;
i... | C++ | 933135ef124b35028c1f309d69515e44 | 0d4b73ad8dbe0dd2c5042f7ebed31287 | 1,700 | PASSED |
//--------Anivia_kid---------//
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 100;
bool isPrime(ll n)
{
if(n < 2) return false;
if(n == 2) return true;
for(ll i = 2; i * i <= n; i++)
... | C++ | 933135ef124b35028c1f309d69515e44 | d172578d2025904f8159f751a8bdc5c8 | 1,700 | PASSED |
//--------Anivia_kid---------//
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 100;
bool isPrime(ll n)
{
if(n < 2) return false;
if(n == 2) return true;
for(ll i = 2; i * i <= n; i++)
... | C++ | 933135ef124b35028c1f309d69515e44 | c71202491aeb95975cd80aa90548e509 | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
long long calculate_gcd(long long a, long long b)
{
cout << a << " " << b << endl;
if(b == 0)
{
return a;
}
if(a == 0)
{
return b;
}
if (b == 1 || a == 1)
{
return 1;
}
if(a >= b)
{
return calcu... | C++ | 933135ef124b35028c1f309d69515e44 | 0d54d6db60081f504147a1a42536ae78 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long unsigned int llui;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vector<int> > vvi;
typedef set<int> si;
typedef map<string, int> msi;
type... | C++ | 933135ef124b35028c1f309d69515e44 | c2e16148c042370c37c1f34c8b05edae | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long unsigned int llui;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vector<int> > vvi;
typedef set<int> si;
typedef map<string, int> msi;
type... | C++ | 933135ef124b35028c1f309d69515e44 | 78391ffce95dfab8faa0ccfc4ab5336d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long unsigned int llui;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vector<int> > vvi;
typedef set<int> si;
typedef map<string, int> msi;
type... | C++ | 933135ef124b35028c1f309d69515e44 | 03127b55b95aacb94d055efeb739238e | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#def... | C++ | 933135ef124b35028c1f309d69515e44 | 5fe8a34c37f044bf4d3bd362597fe912 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#def... | C++ | 933135ef124b35028c1f309d69515e44 | c623fe63f4b6beddfcec169ba6ce1570 | 1,700 | PASSED |
#include<algorithm>
#include<cstdio>
using namespace std;
int i , n , m , k , parent[500005],siz[500005],a[500005];
int fin(int x){return (parent[x]==x)?x:parent[x]=fin(parent[x]);}
void uni(int x,int y){if(fin(x)!=fin(y))siz[fin(x)]+=siz[fin(y)],parent[fin(y)]=fin(x);}
int main()
{
scanf("%d %d",&n,&m);
for... | C++ | a7e75ff150d300b2a8494dca076a3075 | c8cc06b18468e83ed840aa9cef90a3ec | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define loop(i,x,z) for (int i=x;i<z;i++)
int n, m;
int dp[500002],leaves=0;
//vector<int> groups[100002];
//vector<int> fds[10002];
vector<int> vis;
int dfs(int num, vector<unordered_set<int>>& fds)
{
if (dp[num] != 0) return 0;
//cout << "yup";
dp[... | C++ | a7e75ff150d300b2a8494dca076a3075 | 79eeb0a465078b2535932bdebf092fb6 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int LIM = 1e6 + 5;
vector<int> graph[LIM];
vector<int> parent;
int find(int x) {
if (parent[x] < 0) {
return x;
}
else {
int y = find(parent[x]);
parent[x] = y;
return y;
}
}
void unions(int a, int b) {
int p = find(a);
int q = find(b) ;
if (p != q)... | C++ | a7e75ff150d300b2a8494dca076a3075 | 0ee2df5ee9b39d93a02e5b115398bf83 | 1,400 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define mod 4294967295
vector<int>a[2000000];
vector<int>adj[2000000];
vector<int>ans[2000000];
int vis[2000000],vis2[2000000];
map<int,int>mep;
int len=0;
int f(int i)
{
vis[i]=1;
ans[len].push_back(i);
for(int k=0;k<a[i].s... | C++ | a7e75ff150d300b2a8494dca076a3075 | 3541ceac20cf1c8e7463bc012b515549 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1000043;
vector<int> g[N];
int color[N];
int siz[N];
int n, m;
int cc = 0;
int dfs(int x)
{
if(color[x])
return 0;
color[x] = cc;
int ans = (x < n ? 1 : 0);
for(auto y : g[x])
ans += dfs(y);
return ans;
}
int main()
{
scanf("%d %d", &n, &m);
for... | C++ | a7e75ff150d300b2a8494dca076a3075 | 947a3ca9afe931550777042685aeeef5 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1000043;
vector<int> g[N];
vector<int> adj[N];
int color[N];
int siz[N];
int n, m;
int cc = 0;
int dfs(int x)
{
if(color[x])
return 0;
color[x] = cc;
int ans = (x < n ? 1 : 0);
for(auto y : g[x])
ans += dfs(y);
return ans;
}
int main()
{
scanf("%d... | C++ | a7e75ff150d300b2a8494dca076a3075 | 6566e5fb8d1f22779248f76841712290 | 1,400 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
vector< int>a[2000000];
vector<int >adj[2000000];
vector<int >ans[2000000];
int vis[2000000];
int vis2[2000000];
map<int ,int >mep;
int len=0;
int f(int i)
{
vis[i]=1;
for(int k=0;k<adj[i].size();k++)
{
if(vis2[adj... | C++ | a7e75ff150d300b2a8494dca076a3075 | d484a64fd7b4e1400e235a8de5d3354a | 1,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define modu 998244353
#define fromFile freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define f first
#define s second
using namespace std;
// vector<int> v(500009... | C++ | a7e75ff150d300b2a8494dca076a3075 | ceb7e15afaf21aa8b3f2edebe5aa86a2 | 1,400 | PASSED |
#include<bits/stdc++.h>
#include<stdlib.h>
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define mod (ll)(1e9+7)
#define sp ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ld long double
#define pie acos(-1)
#define endl "\n"
... | C++ | a7e75ff150d300b2a8494dca076a3075 | 4d9ad1f8bf8cab26f3c7de9c36dbcb73 | 1,400 | PASSED |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
//#include<iterator>
#include<cmath>
#include<ctime>
#include<string.h>
#include<queue>
//#include<stdio.h>
//#define a.pb(c) push_back(c)
//#define pri(n) cout<<n<<"\n"
#define all(c) c.begin(),c.end()
#define allarr(c) c,c+sizeof(c)
//#define reval... | C++ | 2d088e622863ab0d966862ec29588db1 | 58114f22e52727519d66ae114a936126 | 1,300 | PASSED |
using namespace std;
#include<string.h>
#include <sstream>
typedef long long int ll;
typedef long double ld;
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <map>
//#define N 4
//const ll INF = 0x3f3f3f3f;
//const ll INF... | C++ | 2d088e622863ab0d966862ec29588db1 | ed2e3cf15957c464a012146d09073902 | 1,300 | PASSED |
using namespace std;
#include<string.h>
#include <sstream>
typedef long long int ll;
typedef long double ld;
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <map>
//#define N 4
//const ll INF = 0x3f3f3f3f;
//const ll INF... | C++ | 2d088e622863ab0d966862ec29588db1 | 55316bed8c4a202e9baed17869db5992 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define ii pair<int, int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 1000000007
#define pll pair<ll, ll>
#define ff first
#define ss second
#define mp make_pair
#define vii vector<ii>
#de... | C++ | 2d088e622863ab0d966862ec29588db1 | 24c31958e425f4d15347023fd199ef4d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define ii pair<int, int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 1000000007
#define pll pair<ll, ll>
#define ff first
#define ss second
#define mp make_pair
#define vii vector<ii>
#de... | C++ | 2d088e622863ab0d966862ec29588db1 | d9a0b9f3127d54bf337bbc99acf3463e | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T; cin >>T;
while(T--)
{
long long int N, K, ans=0, flag=1, maxi=0; cin >> N >> K;
long long int arr[N]={0};
for(int i=0; i<N; i++) cin >> arr[i];
long long int temp=arr[0];
for(int i=1; ... | C++ | 2d088e622863ab0d966862ec29588db1 | edc72664f405cad76d886a738292e038 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
int T; cin >>T;
while(T--)
{
long long int n, K, ans=0, flag=1, maxi=0; cin >> n >> K;
vector<long long int> a(n + 1);
long long int dp[n + 1][2];
for (int i = 1; i <= n; i++) cin >> a[i];
dp[1][0]... | C++ | 2d088e622863ab0d966862ec29588db1 | 9a5dc0d250a7044f79ca9d4b692094ea | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
int T; cin >>T;
while(T--)
{
long long int n, K, ans=0, flag=1, maxi=0; cin >> n >> K;
vector<long long int> a(n + 1);
long long int dp[n + 1][2];
for (int i = 1; i <= n; i++) cin >> a[i];
dp[1][0]... | C++ | 2d088e622863ab0d966862ec29588db1 | d5564444b2f572b22ad43f53f93ddcc8 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long int fun(int arr[], int n, int cnt){
long long int d1[n+1], d2[n+1];
d1[0] = -10000000;
d2[0] = 0;
for(int i=0;i<n;i++){
d1[i+1] = max(d2[i]+arr[i], d1[i]);
d2[i+1] = max(d1[i]-arr[i], d2[i]);
}
return max(d1[... | C++ | 2d088e622863ab0d966862ec29588db1 | 28a605d5dc000b08af1e4fab7eedb6fa | 1,300 | PASSED |
/************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 24 Sept 2020
*/
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL) //;cout.tie(NULL)
#define ll long long
const int mod = 1e9+7;
const long double pie = 3.14159265358979323846;
#defin... | C++ | 2d088e622863ab0d966862ec29588db1 | d0303dd770c6f4ea1c42dbcc269346c0 | 1,300 | PASSED |
#include<iostream>
#include<vector>
using namespace std;
vector<int> adj[200002];
int w[200002];
long long res = 0;
int n, k;
void dfs(int v, int p = -1)
{
for(int i = 0; i < adj[v].size(); ++i)
{
int s = adj[v][i];
if(s == p)
continue;
dfs(s, v);
w[v] += w[s];
res += min( w[s], k - w[s] );
}
}
void ... | C++ | ca22cf92727a38fbb3c085b9362602db | 1d19c3992f45809c88aff6d1a6c397c5 | 1,800 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cassert>
#include <vector>
#define all(x) x.begin() , x.end()
#define fi first
#define se secon... | C++ | ca22cf92727a38fbb3c085b9362602db | 99b6d24f88eba5574cf203484b3316ff | 1,800 | PASSED |
//Begin:2016年08月14日19:45:49
//End:2016年08月14日19:59:44
//Test1:交错题...
//Test2:辣鸡爆Int
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=200000+10;
struct Edge{
int next,v;
Edge(){}
Edge(int next,int v): next(next),v(v){}
}e[maxn<<1];
struct Line{
int u,v;
Line(... | C++ | ca22cf92727a38fbb3c085b9362602db | adcf90eb4ba5c52c92afa0ebf15b31d6 | 1,800 | PASSED |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
struct node{
int k,next;
}G[2000001];
int n,k,head[200001],p=0,ctr,ind=0;
ll ans=0;
bool iss[200001],visited[200001];
void ins(int a,int b){
p++;
G[p].k=b;
G[p].next=head[a];
head[a]=p;
}
void add(int a,int b){ins(... | C++ | ca22cf92727a38fbb3c085b9362602db | 1aa3cf7b833e5041e4c87e72ab9fedb0 | 1,800 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#define N 800100
using namespace std;
int head[N],nm,num[N];long long ans;
bool vis[N],ok[N];
vector<int>v[N];
struct node{
int u,v,next;}edge[N];
void addedge(int a,int b){
edge[nm].u=a;
edge[nm].v=b;
edge[nm].next=head[a];
head... | C++ | ca22cf92727a38fbb3c085b9362602db | ea6a5fa0000f7eb6e90a9bb63d39450a | 1,800 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ... | C++ | ca22cf92727a38fbb3c085b9362602db | 9b1f25a05fa9a10bbb3bee20e3b1678e | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n1,n2) for(int (i)=(int)(n1);(i)<(int)(n2);++(i))
#define lpr(i,n1,n2) for(int (i) =(int)(n1); (i) >= (int)(n2);--(i))
#define scan(a) scanf("%d",&a)
#define scan2(a,b) scanf("%d %d",&a,&b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pb(a) push_back... | C++ | ca22cf92727a38fbb3c085b9362602db | de06fed06bfd8483043c8faaa6b70fed | 1,800 | PASSED |
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 200010;
vector<int> edges[maxn];
bool is_uni[maxn];
int s[maxn];
int _min(int a, int b){
if (a < b) return a;
return b;
}
void dfs(int o, int pa){
if (is_uni[o] == true) s[o]++;
for (int i = 0; i < edges[o].size(); i++){
int v = edges[... | C++ | ca22cf92727a38fbb3c085b9362602db | b8f125f43b17d9cbf6b04daaad78c489 | 1,800 | PASSED |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <queue>
#include <algorithm>
using namespace std;
const int N=200005;
int n,i,head[N],Next[N*2],adj[N*2],k,m,a,siz[N],u,v;
long long ans;
void Push(int u,int v)
{
Next[++k]=head[u];
head[u]=k;
adj[k]=v;
}
void dfs(int i,int fa)
{... | C++ | ca22cf92727a38fbb3c085b9362602db | a470d6e0bf79392d67fc499b00a2a87c | 1,800 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#define Maxn 200050
#define LL long long
using namespace std;
int nxt[Maxn<<1], to[Maxn<<1], head[Maxn], cnt;
void AddEdge(int u, int v) {
nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v;
}
int sz[Maxn], n, k, rt, mnf, vis[Maxn];
void Dfs(int u, int v) {
... | C++ | ca22cf92727a38fbb3c085b9362602db | df2cf1dd639514bd94c4f320f31fce56 | 1,800 | PASSED |
t=int(input())
for i in range(t):
t=input()
one=t.count('1')
zero=t.count('0')
if(zero>0 and one>0):
if(zero>=one):
print('01'*len(t))
else:
print('10'*len(t))
else:
print(t)
| Python | 679a1e455073d3ea3856aa16516ba8ba | c21eb008ed077af0fd3539cb1cb2dacb | 1,100 | PASSED |
from sys import stdin , stdout
for testcases in range(int(stdin.readline())):
# print('=========')
string=stdin.readline()
one=string.count('1')
zero=string.count('0')
# print('length of string:',len(string))
if one==len(string)-1 or zero==len(string)-1:
# print('hello')
print(st... | Python | 679a1e455073d3ea3856aa16516ba8ba | 6fc8b79bbdf57875bb0395ece1a9dbba | 1,100 | PASSED |
import sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
for _ in range(int(input())):
s = input()
st=""
a=s.count("1")
b=s.count("0")
if... | Python | 679a1e455073d3ea3856aa16516ba8ba | 6fcb067375f08bea79136954ba01744c | 1,100 | PASSED |
'''
inputCopy
4
00
01
111
110
outputCopy
00
01
11111
1010
'''
def all(s) :
n = len(s)
for i in range(1, n) :
if s[i] != s[0] :
return False
return True
for _ in range(int(input())):
s=input()
if(all(s)):
print(s)
else:
a=""
for i in range(len(s)... | Python | 679a1e455073d3ea3856aa16516ba8ba | 444a1504b4ea43826d04280bfb70bfda | 1,100 | PASSED |
t=int(input())
for z in range(t):
t=input()
if ((t.count('0')== len(t)) or (t.count('1')==len(t))):
print(t)
else:
if t[0]=='0':
s=''
for i in range(2*len(t)):
if i%2==0:
s+='0'
else:
s+='1'
... | Python | 679a1e455073d3ea3856aa16516ba8ba | 67569bbb5cbd7ca329f8f47c7cd10232 | 1,100 | PASSED |
for _ in range(int(input())):
n=input()
s=list(n)
ans='1'
if s.count('1')==len(s) or s.count('1')==0:
print(n)
else:
for i in range(len(s)):
if s[i]=='1':
if s[i]==ans[-1]:
ans+='01'
else:
ans+='1'
... | Python | 679a1e455073d3ea3856aa16516ba8ba | a7bdbfa107c5902c4e47366e8a4a81fd | 1,100 | PASSED |
for _ in range(int(input())):
n=input()
s=list(n)
ans=''
if s.count('1')==len(s) or s.count('1')==0:
print(n)
else:
for i in range(len(s)):
ans+='01'
print(ans) | Python | 679a1e455073d3ea3856aa16516ba8ba | 42a3ca8873addabeec7460cbeb1de5f6 | 1,100 | PASSED |
T=int(input())
for _ in range(T):
string = input()
A = list(string)
if len(set(A))==1:
print(string)
else:
temp=len(string)
result=""
for _ in range(temp):
result+="01"
print(result)
| Python | 679a1e455073d3ea3856aa16516ba8ba | 231b1bc6b92118ff8e5e547238b44a12 | 1,100 | PASSED |
n=int(input())
for i in range(n):
t=input()
q=[-1]*2
w=[-1]*len(t)
for jj in range(len(t)):
w[jj]=int(t[jj])+1
w.sort()
if w[0]==w[len(w)-1]:
print(2*t)
else:
for ii in range(len(t)):
print(t[0], end='')
q[int(t[0])]=t[0]
for j in range(1, len(t)):
if q[int... | Python | 679a1e455073d3ea3856aa16516ba8ba | 3be775b6e1a7946f7b59076855ceb247 | 1,100 | PASSED |
t=int(input())
for i in range(t):
l=input()
m=[0,0]
for i in l:
if i=="0":
m[0]+=1
else:
m[1]+=1
if m[0]==0 or m[1]==0:
print(l)
else:
a=l[0]
if a=="0":
s="01"*(len(l))
else:
s="10"*(len(l))
print... | Python | 679a1e455073d3ea3856aa16516ba8ba | dbe9a4c57f677876fb9450a7a343c305 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
struct aho_corasick {
struct node {
map<char, int> next;
int link;
int cnt;
bool solved;
int total;
node() : next(), link(0), cnt(0), solved(false), total(0) {}
};
vector<pair<s... | C++ | b3038ba22e3442c142a99f485dd55308 | a6f902467cfc5d516d62a570d44f1f4a | 2,800 | PASSED |
#pragma comment(linker, "/stack:256000000")
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <ctime>
#include <cassert>
#include <queue>
using namespace std;
#define REP(i, n) for (int (i) = 0; (i... | C++ | b3038ba22e3442c142a99f485dd55308 | 5f0c5596c9a6beaa555f8e5a350faa40 | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
#include <algorithm>
#include <functional>
#include <map>
#include <bitset>
#include <iomanip>
#include <list>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
using namespace std;
#define FOR(i,... | C++ | b3038ba22e3442c142a99f485dd55308 | 832f10a3e2e3ccf4e90dc29b0c7a2db5 | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
#include <algorithm>
#include <functional>
#include <map>
#include <bitset>
#include <iomanip>
#include <list>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
using namespace std;
#define FOR(i,... | C++ | b3038ba22e3442c142a99f485dd55308 | 5c7b21d49601fdb85ea8d15ef627a8b7 | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
#include <algorithm>
#include <functional>
#include <map>
#include <bitset>
#include <iomanip>
#include <list>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
using namespace std;
#define FOR(i,... | C++ | b3038ba22e3442c142a99f485dd55308 | b404f95e8c60e6530d11ad20814acf5f | 2,800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.