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;
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 | 24034b3d85331e593785b55c6cf65f2e | 2,400 | 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 Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll)a * a % Mod;
... | C++ | 1f13db0d8dcd292b55f49077b840e950 | 98ecb948460b0ab8832f361d38b73d80 | 2,400 | 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 Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll)a * a % Mod;
... | C++ | 1f13db0d8dcd292b55f49077b840e950 | 27c1913a0876b59005b2e0a8cd530e02 | 2,400 | 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 Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll)a * a % Mod;
... | C++ | 1f13db0d8dcd292b55f49077b840e950 | 9a24ebdf914022632a51ab144aa93957 | 2,400 | 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 Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll)a * a % Mod;
... | C++ | 1f13db0d8dcd292b55f49077b840e950 | e5656d4e5bd792b59be99adfa04677f1 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const int Mod = 998244353;
int dp[maxn][maxn][3], f[1<<17][18], pre[18][maxn];
char s[maxn];
int Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll... | C++ | 1f13db0d8dcd292b55f49077b840e950 | d304347b0518d21c5e7b4cb85b458adc | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const int Mod = 998244353;
int dp[maxn][maxn][3], f[1<<17][18], pre[18][maxn];
char s[maxn];
int Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll... | C++ | 1f13db0d8dcd292b55f49077b840e950 | 47f9996fc812b05447860df23fb51d12 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const int Mod = 998244353;
int dp[maxn][maxn][3], f[1<<17][18], pre[maxn][18];
char s[maxn];
int Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll... | C++ | 1f13db0d8dcd292b55f49077b840e950 | f52e25c83afba79041891364f9ec3cea | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const int Mod = 998244353;
int dp[maxn][maxn][3], f[1<<17][18], pre[maxn][18];
char s[maxn];
int Quickpow(int a, int b) {
int res = 1;
while(b) {
if(b&1) res = (ll)res * a % Mod;
a = (ll... | C++ | 1f13db0d8dcd292b55f49077b840e950 | 1aa38d511063775273911f8148e78180 | 2,400 | PASSED |
#include<stdio.h>
int main()
{
int t ;
scanf("%d",&t) ;
while(t--)
{
long long int a,b ;
long long int num1,num2,num3 ;
scanf("%lli",&a) ;
scanf("%lli",&b) ;
if(b==1)
{
printf("NO\n") ;
}
else
{
printf("YE... | C++ | f10aa45956e930df3df0e23f2592c8f1 | 5ee2ef5ce2e038b21ec41c0bed2e472e | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long int a, b;
scanf("%lld %lld", &a, &b);
if (b == 1)
{
printf("No\n");
continue;
}
else
{
printf("Yes\n");
... | C++ | f10aa45956e930df3df0e23f2592c8f1 | 4b99772fe4567c6a2646b393fc7e846c | 1,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int n;
int main()
{
cin >> n;
while(n--)
{
long long int a,b;
cin >> a >> b;
if(b==1)
{ printf("NO\n");
}
else
{
printf("YES\n");
cout<<a<<' '<<a*(2*b-1)<<' '<<a*b*2 << endl;
}
}
}
| C++ | f10aa45956e930df3df0e23f2592c8f1 | e4cfff21e043cdb127237e5ef44060e8 | 1,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
long long a,b;
cin>>a>>b;
if(b==1) cout<<"NO"<<endl;
else cout<<"YES"<<endl<<a<<' '<<a*b<<' '<<a*(b+1)<<endl;
}
}
| C++ | f10aa45956e930df3df0e23f2592c8f1 | 3a9223776ad5346cbaa658092905bb06 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void fasting()
{
cin.tie(0);
cin.sync_with_stdio(0);
}
int main(){
fasting();
int t ;
cin >>t;
ll a , b;
while(t--){
cin >>a >>b;
if(b!=1){
cout<<"YES\n"<<(a*b)<<' '<<a<<' '<<a+(a*b)<<'\n';
}
else
cout<<"NO\n";
}
return 0;
}
... | C++ | f10aa45956e930df3df0e23f2592c8f1 | 105681c838a646765e4412849bffd760 | 1,000 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
void solve(){
long long a,b;
cin >>a>>b;
if(b==1){
cout <<"NO"<<endl;
return;
}
cout <<"YES"<<endl;
cout <<a*(b-1)<<" "<<a*(b+1)<<" "<<a*b*2<<endl;
}
int main(){
int t;
cin >>t;
while(t--){
solve();
}
return 0;
}
... | C++ | f10aa45956e930df3df0e23f2592c8f1 | 807dc6ad3abedf8f3e40aaae7fa286f3 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,a,b;
int main()
{
cin>>t;
while(t--)
{
cin>>a>>b;
if(b==1)cout<<"NO"<<endl;
else
{
puts("YES");
cout<<a<<" "<<a*b<<" "<<a*b+a<<endl;
}
}
}
| C++ | f10aa45956e930df3df0e23f2592c8f1 | fc76f5861a3546f69de259bbcf989dca | 1,000 | PASSED |
#include <iostream>
//shiva251
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
long long int a,b;
cin>>a>>b;
if(b==1){
cout<<"NO"<<endl;
}
else{
cout<<"YES"<<endl;
cout<<a<<" "<<a*b<<" "<<a*(b+1)<<endl;
}
}... | C++ | f10aa45956e930df3df0e23f2592c8f1 | fa82e732abe72d4e701e9473b54132a3 | 1,000 | PASSED |
//#pragma GCC target("avx,avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m)... | C++ | f10aa45956e930df3df0e23f2592c8f1 | c24013f187adc197349692427e07dfc2 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define endl '\n'
#define r_all(v) v.rbegin(),v.re... | C++ | f10aa45956e930df3df0e23f2592c8f1 | cdaf7ad376ded89ee455befb65f0fff0 | 1,000 | PASSED |
#include<stdio.h>
long long int a[100005],x,y,min;
int t,n,i,j,k,ii,jj;
long long int GCD(long long int a,long long int b)
{
if(a==0)
return b;
return GCD(b%a,a);
}
long long int GCD(long long int a,long long int b);
int main()
{
scanf("%d",&t);
while(t--)
{
min=1000000005;
... | C++ | 8b2b7208630af1d086420513a437a914 | 7f1acf1984e223e8d9f36e143174d4cd | 1,300 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdint>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#i... | C++ | 8b2b7208630af1d086420513a437a914 | 5bc0d6599af402eac216b18de7a04f99 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define li long long int
#define ul unsigned long long int
#define pb push_back
#define pf push_front
#define mp make_pair
#define sz size()
#define mod 1000000007
#define fr first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#... | C++ | 8b2b7208630af1d086420513a437a914 | f9f87256967308dcc330bd33eeed3221 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2*acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " is ... | C++ | 8b2b7208630af1d086420513a437a914 | 6e4b7080f0b4ffac3bb055681fa13fae | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sortall(x) sort(all(x))
#define setbits(x) __builtin_popcountll(x)
#define dec_to_bin... | C++ | 8b2b7208630af1d086420513a437a914 | 0dd4e540069582f2e1c13b07b2fe880f | 1,300 | PASSED |
#include<iostream>
using namespace std;
typedef long long ll;
int a[(int)(1e5 + 5)];
int main() {
int t;
cin >> t;
while(t --) {
int n;
cin >> n;
ll min = 1e18;
int minid;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
if (a[i] < min) {
min = a[i];
minid = i;
}
}
ll value = min;
cout... | C++ | 8b2b7208630af1d086420513a437a914 | 6f754e4ceb6f03b5104f30a47fece9fe | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
int a[maxn];
struct node
{
int a1,a2,a3,a4;
}ans[maxn];
int gcd(int a,int b)
{
return b?gcd(b,a%b):a;
}
int main()
{
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int minn=1<... | C++ | 8b2b7208630af1d086420513a437a914 | 7fba0061f527015bf62fc1a169180d64 | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <utility>
#include <iomanip>
#define int long long
using namespace std;
string jian(string a, string b)
{
bool f = 0;
i... | C++ | 8b2b7208630af1d086420513a437a914 | 4e31b6566b8f2c434e4de03e395bc9b1 | 1,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
#define DD double
#define MAXN 200000
#define INF 0x7ffffff
using namespace std;
int n, a[MAXN + 5];
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i+... | C++ | 8b2b7208630af1d086420513a437a914 | d81fa70192b9da823fd555c1fbc979df | 1,300 | PASSED |
#include <bits/stdc++.h>
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define forx(i,x,n) for(int i=x;i<(int)n;i++)
#define ce(e,i,n) cout<<e<<" \n"[i==(int)n-1];
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
const int N=1e6+2;
const long long inf=1e15;
int a[N],ans[N];
s... | C++ | 8b2b7208630af1d086420513a437a914 | 7d82d70e8beb36585221c08eba616979 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
// #define FOR(i, begin, end) for (__typeof(end) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for (int i = a; i ... | C++ | cbd550be6982ef259de500194c33eff2 | 9e79b38e6ca2b3f498393d0df93db8b6 | 2,500 | PASSED |
#include <bits/stdc++.h>
// #define int long long
using namespace std;
// #define FOR(i, begin, end) for (__typeof(end) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for (int i = a; i <= ... | C++ | cbd550be6982ef259de500194c33eff2 | 64bc21c2613308a5d8d0f169b9158cd3 | 2,500 | PASSED |
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// ----------------check here before submitting your code--------------------------------
#define QWQ1
#ifdef QWQ
const int N = 2e3 + 5;
#else
const int N = 8e5 + 5;
#endif
const int MOD = 998244353;
// ... | C++ | cbd550be6982ef259de500194c33eff2 | d7df2ab7a7011ad73d5f5271bf7b3c21 | 2,500 | PASSED |
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// ----------------check here before submitting your code--------------------------------
#define QWQ1
#ifdef QWQ
const int N = 2e3 + 5;
#else
const int N = 1e5 + 5;
#endif
const int MOD = 998244353;
// --... | C++ | cbd550be6982ef259de500194c33eff2 | b3e642e1d1e166c2f8d6fbe79c56aee2 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define FORD(i, a, b) for (int i = (b)-1; i >= int(a); i--)
#define sz(c) int((c).size())
#define all(c) c.begin(), c.end()
#define debug(x) cerr << #x << ": " ... | C++ | cbd550be6982ef259de500194c33eff2 | c78d62c71e06ec5d4227ce327b7ff9f8 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define FORD(i, a, b) for (int i = (b)-1; i >= int(a); i--)
#define sz(c) int((c).size())
#define all(c) c.begin(), c.end()
#define debug(x) cerr << #x << ": " ... | C++ | cbd550be6982ef259de500194c33eff2 | 8f40505c90db4caa7510445dcdd02e10 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define UP(a,b,c) for(ll (a)=(b);(a)<(c);(a)++)
#define UU(a,b,c) for(ll (a)=(b);(a)<=(c);(a)++)
#define D... | C++ | cbd550be6982ef259de500194c33eff2 | 74093fd363816ec0116f087e7801c814 | 2,500 | PASSED |
#include <bits/stdc++.h>
//........
using namespace std;
const int N = 2.1e5;
vector<int> t[N];
vector<int> endpts[N];
int dp[N][2], verts[N][2];
int total[N], mins[N];
int which_path[N];
int npath = 0;
int smallest(int v, int par, int no) {
int small = 1e9;
int who = -1;
for (int u : t[v... | C++ | cbd550be6982ef259de500194c33eff2 | c323e628fb96a8d53ac266ad9fd56c7e | 2,500 | PASSED |
#include <bits/stdc++.h>
//.......
using namespace std;
const int N = 2.1e5;
vector<int> t[N];
vector<int> endpts[N];
int dp[N][2], verts[N][2];
int total[N], mins[N];
int which_path[N];
int npath = 0;
int smallest(int v, int par, int no) {
int small = 1e9;
int who = -1;
for (int u : t[v]... | C++ | cbd550be6982ef259de500194c33eff2 | 0846f6d3bae0d903d135590031a086d1 | 2,500 | PASSED |
#include <bits/stdc++.h>
//......
using namespace std;
const int N = 2.1e5;
vector<int> t[N];
vector<int> endpts[N];
int dp[N][2], verts[N][2];
int total[N], mins[N];
int which_path[N];
int npath = 0;
int smallest(int v, int par, int no) {
int small = 1e9;
int who = -1;
for (int u : t[v])... | C++ | cbd550be6982ef259de500194c33eff2 | 426161402acb47b819382b92b5aa3fc3 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)
#define frm(i, n) for(int i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<v... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 3967b9e49ac788d939083a1089d8b678 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=1e5+5;
int t;
int m,k;
int a[MAXN];
int Res[505][505];
pair<int,int>R[MAXN];
int zfx[15]={1,1,-1,-1};
int zfy[15]={1,-1,1,-1};
int Maxi=0;
void RR(int Mid)
{
for(int i=1;i<=k;i++)
{
R[i].first=a[i];
R[i].second=i;
... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 17241ddcddc94a2dffeb8fe501a07faf | 2,700 | PASSED |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define eb emplace_back
using namespace std;
const int M=100009;
int n,m;
int a[M],id[M],c[M],b[1009][1009];
int get0(int k){
return (k+1)/2*k;
}
int get1(int k){
return get0(k)+(k+1)/2*(k/2);
}
v... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 05a946f4eaa51ba84be721f27f59435b | 2,700 | PASSED |
#define Big_Head
#ifdef Big_Head//All the Things
#ifdef Big_Head//The Whole Big Head
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt")
#undef ONLINE_JUDGE
#include<bits/stdc++.h>
#ifdef Big_Head//Online_Judges
#define Luogu 1
#define Cf 2
#define At 3
#define Other 4
#define No 5
#end... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 7f76a68569f2643f1e013d53e06ca5bb | 2,700 | PASSED |
#pragma GCC optimaze(3)
#pragma GCC optimaze(2)
#pragma GCC optimaze("Ofast")
#pragma GCC optimaze("inline")
#pragma GCC optimaze("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
const int N=510,M=200010;
int n,m,m... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 3b25f90ca3a5fb2446b440a756e2ca51 | 2,700 | PASSED |
#pragma GCC optimaze(3)
#include<bits/stdc++.h>
using namespace std;
int n,m,s,mx;
int a[200010],ret[510][510],b[200010];
vector<pair<int,int> > ss;
vector<int> vec;
inline bool cmp(int x,int y)
{
return a[x]>a[y];
}
inline void work(int x,int y)
{
for (int i=x;i<=s;i+=2)
{
for (int j=y;j<=s;j... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 1833f8f22d4629561a88e27027ebc973 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,s,mx;
int a[200010],ret[510][510],b[200010];
vector<pair<int,int> > ss;
vector<int> vec;
inline bool cmp(int x,int y)
{
return a[x]>a[y];
}
inline void work(int x,int y)
{
for (int i=x;i<=s;i+=2)
{
for (int j=y;j<=s;j+=2)
{
ss.push_bac... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 24eb877fbbfa210d979685093edfdd73 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,mx,s;
int a[200010],ret[510][510],b[200010];
vector<pair<int,int> > ss;
vector<int> vec;
inline bool cmp(int x,int y)
{
return a[x]>a[y];
}
inline void work(int x,int y)
{
for (int i=x;i<=s;i+=2)
{
for (int j=y;j<=s;j+=2)
{
ss.push_bac... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 9eb8ffbaa73611ef59f5c00fb9b628f0 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=300103;
int r[1001][1001];
void solve(){
int m,k;cin>>m>>k;
vector<pair<int,int>>v;
for(int i=1,x;i<=k;i++)cin>>x,v.push_back({x,i});
std::sort(v.begin(), v.end(),greater<>());
int mx=v[0].first;
int sz=1;
... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | bde8e64cde5013344d8bcbf391f0cc96 | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef double db;
#define int long long
#define fi first
#define se second
#define mk make_pair
#define pb emplace_back
#define poly vector<int>
#define Bt(a) bitset<a>
#define bc __builtin_popcount
#define pc putchar
#define ci const int&
char sss;
const int... | C++ | 79d8943cb9a9f63b008cb38ee51ae41e | 4606279757ab178537159fd222944ad1 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define W int test = 1; cin >> test; while(test--)
#define F11 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define al(x) x + 1 , x + n + 1
#define sz(s) (s).size()
#define F first
#define S second
#define pb push_back
#define mkp make_... | C++ | 9877f4773f34041ea60f9052a36af5a8 | ceaae5513655460926de2033e6790354 | 2,000 | PASSED |
#include "bits/stdc++.h"
#include<sstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define __ASHISH__ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define endl "\n"
#define Max(x,y,z) max(x,m... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 370ce6876aa0e6fdcdb33e6653e0505a | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#de... | C++ | 9877f4773f34041ea60f9052a36af5a8 | b11faa6200c331d8ff660b154c7826ce | 2,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define You_Never_Know ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#ifdef Dhru08
#include "debug.hpp"
#else
#defin... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 693e86a5596b91f7f3c1ea45729654d1 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
//#define endl "\n" /*DELETE IT ON INTERACTIVES!!*/
#define mod 998244353
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int... | C++ | 9877f4773f34041ea60f9052a36af5a8 | da571ac01d4607b1c0df59d32ffb1c1a | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" /*DELETE IT ON INTERACTIVES!!*/
#define mod 998244353
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int a... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 92bf756715a1101a405df6a93df9d69c | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
//#define endl "\n" /*DELETE IT ON INTERACTIVES!!*/
#define mod 998244353
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int... | C++ | 9877f4773f34041ea60f9052a36af5a8 | e211130aad1bf0ed2eb3f1c54e8d6ed3 | 2,000 | PASSED |
/*Dev Karan Singh Sisodia*/
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pyes cout << "Yes" << "\n";
#define pno cout << "No" << "\n";
#define br cout << "\n";
#define ff first
#define ss ... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 2cafb9f64c56ffd19a141899d03eede8 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define forr0(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define forr1(i, n) for (int i = (int)(n); i >= 1... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 3ebe926d56b1a8c8048b714301fb0db0 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define scanit(a,n) for(ll indexaa=0; indexaa<n; indexaa++) cin>>a[indexaa];
#define printit(a,n) for(ll indexaa=0; indexaa<n; indexaa++) cout<<a[indexaa]<<" "; cout<<e... | C++ | 9877f4773f34041ea60f9052a36af5a8 | 5879b24a073d090823812744eb5073d5 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;retur... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 82db3269b98658ec61667315cfbf3eb0 | 3,500 | PASSED |
//CLOCKS_PER_SEC
using namespace std;
#include<bits/stdc++.h>
//#define sort stable_sort
#define ll long long
#define mk make_pair
#define pb push_back
#define in insert
#define mtr(x,y,z) mk(mk(x,y),z)
#define fi first
#define se second
#define lch(x) ((x)<<1)
#define rch(x) (((x)<<1)|1)
#define all(x) (x... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 9a4fdf14ac385bc3e33355e32c831a6e | 3,500 | PASSED |
/* Written by Rikka__ */
/* ✧*｡٩(ˊᗜˋ*)و✧*｡ */
/*
my name is Van,
I'm 30 years old and I'm from Japan.
I'm an artist, I'm a performance artist.
I'm hired for people to fulfill their fantasies,
their deep, dark fantasies.
I was gonna be a movie star,
you know with modeling and uh acting.
After 102 au... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 651b2524407aea70df079128da6c00e8 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
mt19937 rnd(228);
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)
const int M = 5e4 + 239;
const int X = (int)(1e8) + 239;
const int T = (1 << 17) + 239;
const ld pi = acos((ld)-1.0);
int n, l, k, bd, x[M], y[M];
int... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 2b5c330a143811ce576b6cd5a30d6709 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | bce530b65f9f97156474b0c74e5f80cd | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | d93e3d682374d13c2ed65a75b76e85fb | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 7548c7001ae1d72ddbd2675946908271 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 8063a2f86f35a2c3587718281ed3cff9 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 5de9d2d367de97b0381d159d09896224 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | b55ff0115d93ce5b288e9625f0b93e56 | 30652e8db88f124c66e647c4de9e4b14 | 3,500 | PASSED |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>... | C++ | 328f818db87d424ed960a804688e0a88 | c3ec63a706d8b96846a7d66f2265be65 | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | 1668b6bedd21014a73c194cf815e125d | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | 7e50315ac1da901e0b617e3f650fd4b0 | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | f497d7d2a6ead70d09e7ed2da1f69d5e | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | 5881862090f02f8a9a001ea7b1e4b635 | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | b11829ffbe929a0ce3834ec108ec289e | 3,300 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx... | C++ | 328f818db87d424ed960a804688e0a88 | 41150d0bb76f8b9f99cbfb69b7721fce | 3,300 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx... | C++ | 328f818db87d424ed960a804688e0a88 | a3830348188a3b8f6dada2d4ab51e790 | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | 94da95318af81f5c3116e5781ae1fe82 | 3,300 | PASSED |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,l... | C++ | 328f818db87d424ed960a804688e0a88 | 634c07b57ccdf1253b1b282b978c2a9d | 3,300 | PASSED |
#include <bits/stdc++.h>
#define fi(N) for (int i = 0; i < int(N); i++)
#define fj(N) for (int j = 0; j < int(N); j++)
#define fk(N) for (int k = 0; k < int(N); k++)
#define f1(X) for (auto &i1 : X)
#define f2(X) for (auto &i2 : X)
#define f3(X) for (auto &i3 : X)
#define all(X) X.begin(), X.end()
using ll ... | C++ | 763073079a81793b60eefa1ad8426a9a | d0db7e1bb7db005f517049a76f1b7c48 | 2,600 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(c) c.begin(), c.end()
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define BIT(u, i) (u >> i) & 1
#define pii pair<int, int>
#define pll pair<long long, l... | C++ | 763073079a81793b60eefa1ad8426a9a | ebb6afd70d09da4a52843d0c5dc2439b | 2,600 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(c) c.begin(), c.end()
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define BIT(u, i) (u >> i) & 1
#define pii pair<int, int>
#define pll pair<long long, l... | C++ | 763073079a81793b60eefa1ad8426a9a | 533c6f96c5e5b61181705360d14fc516 | 2,600 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(c) c.begin(), c.end()
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define BIT(u, i) (u >> i) & 1
#define pii pair<int, int>
#define pll pair<long long, l... | C++ | 763073079a81793b60eefa1ad8426a9a | 8c7656dabf819a06ddaa451724ae28a5 | 2,600 | PASSED |
/*
わんわん……わんだほーいっ☆
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
#define mp make_pair
#define PC __builtin_popcount
char s[15];
struct flowWork{
int cnt;
int siz[5005];
int nxt[2000005],to[2000005],val[2000005],cst[2000005];
inline void AddEdge(int u,int v,... | C++ | 763073079a81793b60eefa1ad8426a9a | 5e7fb37c944a9832bf56cffd23914172 | 2,600 | PASSED |
/*
わんわん……わんだほーいっ☆
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
#define mp make_pair
#define PC __builtin_popcount
char s[15];
struct flowWork{
int cnt;
int siz[5005];
int nxt[2000005],to[2000005],val[2000005],cst[2000005];
inline void AddEd... | C++ | 763073079a81793b60eefa1ad8426a9a | 102e10c82b5a632465f273567112c33b | 2,600 | PASSED |
#include<iostream>
#include<cstring>
#include<vector>
#include<cassert>
using namespace std;
#define endl '\n'
#define lowbit(x) (x&(-x))
typedef long long LL;
const int N=2e3+100,M=3e6+10,INF=0x3f3f3f3f;
int ne[M],e[M],f[M],w[M],idx;
int h[N],q[N],d[N],pre[N],mf[N];
int S,T;
bool inq[N],mark[N];
inlin... | C++ | 763073079a81793b60eefa1ad8426a9a | ff87ad5440c0862585199bcb5fcd8726 | 2,600 | PASSED |
#include<iostream>
#include<cstring>
#include<vector>
#include<cassert>
using namespace std;
#define endl '\n'
#define lowbit(x) (x&(-x))
typedef long long LL;
const int N=2e3+100,M=1e7+10,INF=0x3f3f3f3f;
int ne[M],e[M],f[M],w[M],idx;
int h[N],q[N],d[N],pre[N],mf[N];
int S,T;
bool inq[N],mark[N];
inlin... | C++ | 763073079a81793b60eefa1ad8426a9a | a7ef2117cff820137e8719351eba2435 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define int long long
#define MAXM 500005
#define MAXN 4005
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) +... | C++ | 763073079a81793b60eefa1ad8426a9a | adfa5f540a01cbf99d0d1d620efe46ac | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define int long long
#define MAXM 500005
#define MAXN 4005
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t... | C++ | 763073079a81793b60eefa1ad8426a9a | 000678245eb2fcd0a1b4899077265829 | 2,600 | PASSED |
//CRUNCH UP THE NUMBERS!!!
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
#include<map>
#include<unordered_set>
#include<cstdlib>
#include<climits>
#include<sstream>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<cmath>
#include<cstdio>... | C++ | 99dd00f4840188d4d96260100b20e9c9 | dc60894e00f03a879ae55c164278f6d7 | 1,200 | PASSED |
//CRUNCH UP THE NUMBERS!!!
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
#include<map>
#include<unordered_set>
#include<cstdlib>
#include<climits>
#include<sstream>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<cmath>
#include<cstdio>... | C++ | 99dd00f4840188d4d96260100b20e9c9 | b7acc97ec399b6e185508dbe40777297 | 1,200 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<string>
#include <sstream>
#include <iterator>
#include<queue>
using namespace std;
vector<int> operator1(vector<int> p) {
for (int i = 0; i < p.size(); i += 2) {
int t = p[i];
p[i] = p[i + 1];
p[i + 1... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 5d4f5e58da4c2053c7670e2fb04f2472 | 1,200 | PASSED |
#include<iostream>
#include<math.h>
using namespace std;
void xapxep(int a[],int n)
{
for(int i=0 ; i<2*n ; i++)
{
int MIN=i;
for(int j=i+1; j<2*n; j++)
{
if(a[MIN]>a[j])
{
MIN=j;
}
}
int temp=a[i];
... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 4af59f4a7760c60e48ccc79d4e44ef53 | 1,200 | PASSED |
// 1510K Kings Task.cpp
// by Hwongfish
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 2010;
int n = 0, p[N] = { 0 };
int check() {
for (int i = 0; i < 2 * n; ++i)
if (p[i] != i + 1)
return 0;
return 1;
}
int op1() {
for (int i = 0; i < n; ++i)
swap(p[2 * i], p[2... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 983a6696ae9c1d1a06271b12dadaf9d0 | 1,200 | PASSED |
#include <iostream>
#include <vector>
#include <map>
#include <climits>
using namespace std;
int n;
int sol = INT_MAX;
map<vector<int>, int> mp;
void dfs(vector<int>& a, int time){
int flag = 1;
for(int i = 0; i < 2*n; i++){
if(a[i] != i+1){
flag = 0;
break;
}
}
if(flag == 1 && time ... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 651d3100fa2d9374e0d65cda991f9731 | 1,200 | PASSED |
//CRUNCH UP THE NUMBERS!!!
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
#include<map>
#include<unordered_set>
#include<cstdlib>
#include<climits>
#include<sstream>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<cmath>
#include<cstdio>... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 6691fa001382d51d2301dab911660129 | 1,200 | PASSED |
#include<iostream>
using namespace std;
#define maxsize 2500
int min(int a, int b)
{
if (a < b)
return a;
else return b;
}
void swap1(int a[],int n)
{
int t;
for (int i = 1; i <= 2 * n - 1; i += 2)
{
t = a[i];
a[i] = a[i + 1];
a[i + 1] = t;
}
}
void swap2(int a[], int n)
{
int t;
f... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 39b060d9e42cb1c67a58e7308d432d90 | 1,200 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <iomanip>
#include <string>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
//types
typedef long long ll;
typed... | C++ | 99dd00f4840188d4d96260100b20e9c9 | 6b6167f8879b93367f8b88db608ff584 | 1,200 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 2010;
int arr[maxn], backup[maxn];
int n, m;
bool check() {
for(int i = 1; i <= m; ++ i)
if(arr[i] != backup[i])
return 1;
return 0;
}
inline void work() {
int tim = 0;
int ans = -1;
do {
bool... | C++ | 99dd00f4840188d4d96260100b20e9c9 | b4937a156d42a278ad699c572e5dec79 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define fi first
#define sc second
#define MOD 1000000007
#define mkp make_pair
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FORD(i,r,l) for (int i=r;i>=l;i--)
#define CL(x) memset(x,0,sizeof(x))
#define ALL(x) ... | C++ | 3a305e2cc38ffd3dc98f21209e83b68d | f3a62674af7129b1cc98bfb1e716ca87 | 2,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.