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>
#define int long long
int x, y, n;
using namespace std;
pair<int, int> v[1000006];
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first < b.first;
}
signed main() {
//ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
string s;
int t;
cin >> t;
while (t--... | C++ | b63a6369023642a8e7e8f449d7d4b73f | d641e3c2dec2bd583c72d547eadfd89c | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 3e5+10;
int a[maxn],b[maxn],t,n;
signed main()
{
cin >> t;
while( t-- )
{
int A,B;
scanf("%lld%lld",&A,&B);
int nowa = 0,mx = 0;
cin >> n;
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
for(int i=1;i<=n;i++) scanf("%lld",&b[... | C++ | b63a6369023642a8e7e8f449d7d4b73f | f01774440df35f68b6bea10bb1f5d4b6 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
uint64_t n;
void solve() {
int64_t A, B, m;
cin >> A >> B >> m;
vector<int64_t> v(m);
int64_t ma = LONG_MIN;
for (auto &a : v) {
cin >> a;
ma = max(ma, a);
}
for (int i = 0; i < m; i++) {
int64_t b = 0;
cin >> ... | C++ | b63a6369023642a8e7e8f449d7d4b73f | 54f8c451a7ea57dcb6d999ad83c940ed | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define d1(a) {cout<<#a<<"="<<(a)<<'\n';}
#define d2(a,b) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<'\n';}
#define d3(a,b,c) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<" "<<#c<<"="<<(c)<<'\n';}
#define d4(a,b,c,d) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<" "<<#c<<"="<<(c... | C++ | b63a6369023642a8e7e8f449d7d4b73f | aa1851a42af5ef2ff301b120222c6c86 | 900 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
int num;
scanf("%d",&num);
while(num--)
{
ll A,B,n;
ll a[100000],b[100000];
ll maxx=-1,count,sum=0;
scanf("%lld%lld%lld",&A,&B,&n);
for(... | C++ | b63a6369023642a8e7e8f449d7d4b73f | d6dd62f1d05225f05d99993d2a45643b | 900 | PASSED |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <stack>
#include <cstdio>
#include <queue>
#include <set>
#include<sstream>
#include <cstring>
#include <cmath>
#include <bitset>
//#pragma GCC optimize(2);
#define IOS ios::sync_with_stdio(false);
#define mm(a, b) memset(a, b, sizeof(a)... | C++ | b63a6369023642a8e7e8f449d7d4b73f | 76ef6c626f8c0cc35161185968b5ea92 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct monster
{
ll a, b;
} mon[100010];
int main()
{
ll N;
cin >> N;
while (N--)
{
ll A, B, n;
scanf("%lld%lld%lld", &A, &B, &n);
ll Maxsh = 0;
for (ll i = 0; i < n; i++)
{
scanf("%lld", &mon[i].a);
Maxsh = max(Maxsh, mon[... | C++ | b63a6369023642a8e7e8f449d7d4b73f | 7b2520f4241aa2c5a9d4d158bed7c95a | 900 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
ll int a[400010],b[401010],n,A,B;
ll int sum;
int main()
{
ll int t,i,j,maxx;
cin>>t;
while(t--)
{
sum=maxx=0;
cin>>A>>B>>n;
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n;i++) cin>>b[i];
for(i=0;i<n;i++)
{
j=b[i]/A+(b[i]%A!=0... | C++ | b63a6369023642a8e7e8f449d7d4b73f | 55f414124c66f782ba5a5c3426809f00 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct gs
{
ll a, b;
} mon[100010];
int main()
{
ll N;
cin >> N;
while (N--)
{
ll A, B, n;
scanf("%lld%lld%lld", &A, &B, &n);
ll Msh = 0;
for (ll i = 0; i < n; i++)
{
scanf("%lld", &mon[i].a);
Msh = max(Msh, mon[i].a);
... | C++ | b63a6369023642a8e7e8f449d7d4b73f | 818757b73c3716f8c9d662d65e6e60ba | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define fastio ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define pi acos(-1)
#define mod 1000000007
#define takeInput(v) for(auto& x:v) cin>>x;
#define precision(n) fixed<<setprecision(n)
#define print(v) for(auto x:v) cout<<x<<' '; cout<<endl;... | C++ | c02357c4d959e300f970f66f9b3107eb | 38613781c888af96a8cf8ec80a2ac573 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
const double PI= 2*acos(0);
const int inf = 0x3f3f3f3f;
const int N=1e5+5;
void solve()
{
string s;
cin>>s;
for(int i=0;i<s.size();i++)
{
if(i&1)
{
i... | C++ | c02357c4d959e300f970f66f9b3107eb | e2c4bb65717f53121c38ce7e96d9ac45 | 800 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
using namespace std;
using vi=vector<int>;
using pii=pair<int, int>;
using ull=unsigned long long;
using ll=long long;
int main()
{
int t; cin >> t;
while(t--) {
string s; cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i %... | C++ | c02357c4d959e300f970f66f9b3107eb | ec8671ddba9effc75f6c0adc62aa6c3c | 800 | PASSED |
#include <stdio.h>
#include <string.h>
char s[55];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%s",s);
for(int i=0;i<strlen(s)-1;i+=2)
{
if(s[i]!='a')s[i]='a';
else s[i]='b';
if(s[i+1]!='z')s[i+1]='z';
else s[i+1]='y';
}
if(strlen(s)%2)
{
if(s[strlen(s)-1]!='a')s[strlen(s)-1]=... | C++ | c02357c4d959e300f970f66f9b3107eb | e99eec088770cb771e5d4cb0b41460b5 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
#include<string.h>
main()
{
int t;
scanf("%d",&t);
while(t--)
{
char str[55];
scanf("%s",str);
int i,l=strlen(str);
for(i=0;i<l;i+=2)
{
if(str[i]=='a')
str[i]++;
else
str[i]... | C++ | c02357c4d959e300f970f66f9b3107eb | 3b06c72f07f409b217af31570d72ff7f | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define bismillah ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define khatam return 0
using namespace std;
int main()
{
bismillah;
int t;
cin >> t;
while(t--)
{
string s;
cin >> s;
for(int i=0; i<s.si... | C++ | c02357c4d959e300f970f66f9b3107eb | 852f9244bbd390bea2f243fe08289565 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
while(n--){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(i%2==0){
if(s[i]!='a'){
s[i]='a';
}
else{
s[i]='b';
}
}
else
{
if(s[i]!='z'){
s[i]='z';
... | C++ | c02357c4d959e300f970f66f9b3107eb | a4c9b94273a8ababff9649546535b52f | 800 | PASSED |
//
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
int n=s.size();
for(int i=0; i<n; i+=2)
{
if(s[i]=='a')
s[i]='b';
else
s[i... | C++ | c02357c4d959e300f970f66f9b3107eb | 9e504c6ae14624069ccfe2cd39ff1e02 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
string s;
cin>>s;
bool turn=true;
for(int i=0;i<s.length();i++){
if(turn){
if(s[i]=='a'){
... | C++ | c02357c4d959e300f970f66f9b3107eb | b22d97113d90cacc814374ba4c08443b | 800 | PASSED |
#include<iomanip>
#include<bits/stdc++.h>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
long long int lcm(long long int p,long long int q)
{
return p/__gcd(p,q)*q;
}
typedef long long int ll;
#define pi pair<ll,ll>
#define ff first
#define ss second
#define ... | C++ | c02357c4d959e300f970f66f9b3107eb | 2acc0836a1e2d01ff6d706ce70c6b73d | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define fi first
#define se second
#define ff fi.fi
#define ss se.se
#define fs fi.se
#define sf se.fi
#define all(x) x.begin(), x.end()
#define endl "\n"
typedef l... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | 1a0ce08fe047166b94e3d71722e5be2f | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
bool cmp(long long a,long long b){return a>b;}
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w",... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | 5c11203a567030eee90b8900d061ae9e | 800 | PASSED |
#include <bits/stdc++.h>
#define nich using
#define was namespace
#define here std
nich was here;
#define fastio ios_base::sync_with_stdio(false), cin.tie(0)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORO(i, n) for (int i = 0; i < n; i++)
#define ROF(i, a, b) for (int i = a; i >= b; i--)
#define ll lon... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | bb984dc117bde19950ec3746e9e75c3a | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll t;
cin>>t;
while(t--)
{
ll r,b,d;
cin>>r>>b>>d;
if((min(r,b))*(d+1)>=max(r,b))
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
}
| C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | 9dae678e71378ae74434509a9c15bbf3 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX=0x3f3f3f3f;
const int mod = 1e9+7;
const int inf = 1e9+5;
const long long LINF = 1e17+5;
const int maxn = 2e5+5;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | e60815264b250934e231240db77f1a7d | 800 | PASSED |
#include<unordered_map>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<iomanip>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<array>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
#define fast ios_base::sync_with_stdio... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | 6d5c29bca35b3c9e2117a5f17ecd9cb6 | 800 | PASSED |
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int b,r,d;
cin>>r>>b>>d;
if ((abs(r-b) + min(r,b) - 1)/min(r,b) <= d) cout<<"YES\n";
else cout<<"NO\n";
}
return 0;
}
| C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | f9da8784fab6d501802cdf6e616ce16c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n, m, d, t;
int main()
{
cin >> t;
while(t--)
{
cin >> n >> m >> d;
ll maxx = max(n, m), minn = min(n, m);
if(maxx > minn * (d + 1))
printf("NO\n");
else
printf("YES\n");
}
... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | fcb52399f847d78ae73e811f078aaafe | 800 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
#define ll long long
int main()
{
ll t,n,x,y;
cin>>t;
while(t--){
cin>>x>>y>>n;
if(x>y) {
ll temp = x;
x = y ;
y = temp;
}
ll j = y - x ;
if(n == 0 && j != 0 ){
... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | 017fb7c298916fad73705efcd899d8f6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin >> t;
while(t--) {
long long a, b, c;
cin >> a >> b >> c;
long long d = max(a, b);
long long e = min(a, b);
if(e * (c + 1) >= d) {
cout << "YES" << "\n";
} else {
cout <<... | C++ | c0ad2a6d14b0c9e09af2221d88a34d52 | f8213eab43437a6c7e80c0dafc341a87 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool cmp(int x,int y){
return x>y;
}
signed main(){
int t,n;
cin>>t;
while(t--){
cin>>n;
int uni[n+1];
int skill[n+1];
int sum=0;
for(int i=0;i<n;i++)scanf("%lld",&uni[i]);
f... | C++ | 437ab04bd029db32ceba31becbe06722 | 3c62df177154f61f905a0e81403ff916 | 1,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define LL long long
using namespace std;
const int N=200050;
vector<LL> s[N];
int n;
int u[N];
LL res[N]; //res of every group
int main(){
... | C++ | 437ab04bd029db32ceba31becbe06722 | e926f0180393318ca1dc8c465ab2a982 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
int main() {
int t;
scanf("%d", &t);
forn(_, t){
int n;
scanf("%d", &n);
vector<int> s(n), u(n);
forn(i, n){
scanf("%d", &s[i]);
--s[i... | C++ | 437ab04bd029db32ceba31becbe06722 | 681eb5aab9daff85b3492e232f4e4704 | 1,400 | PASSED |
/**************Bismillah-ir-Rahman-ir-Rahim***************
* Author : Nazrul *
* Date : 2021-07-15 12:49:28 *
* Modified time : 2021-07-15 13:26:50 *
*********************************************************/
#include<bits/stdc++.h>... | C++ | 437ab04bd029db32ceba31becbe06722 | d176c2de056502c993b60abb852b6044 | 1,400 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
ty... | C++ | 437ab04bd029db32ceba31becbe06722 | f13497337d0b6c3aff5c4a5de6572045 | 1,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
// clang-format off
//{ Template
#define FOR(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define sz(n) ((int)(n).... | C++ | 437ab04bd029db32ceba31becbe06722 | 90b8d6acb7b7181efafe53a5d74ed00c | 1,400 | PASSED |
#include <bits/stdc++.h>
#define read(FILE) freopen(FILE, "r", stdin);
#define out(FILE) freopen(FILE, "w", stdout);
#define sr3 ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define M_PI 3.14159265358979323846
#define mod 1000000007
#define endl "\n"
#define vp vector<pair<ll,ll>>
#define vi vector<ll>
#defi... | C++ | 437ab04bd029db32ceba31becbe06722 | 5aaa72ffff13daf51885836b7f7cbd17 | 1,400 | PASSED |
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <set>
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
typedef long long ll;
int main(){
int t;
std::cin >> t;
while(t--){
int n;
std::cin >> n;
std::vector<std::vector<int> >v(n + 1);
... | C++ | 437ab04bd029db32ceba31becbe06722 | 4a4a0654b3ef70be643db6c3121cf94d | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main (){
#ifndef ONLINE_JUDGE
freopen("SuhaibSawalha1","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> p[n];
int a[n];
for (i... | C++ | 437ab04bd029db32ceba31becbe06722 | d9164ae5cfcaadde11627ccecd9c72c4 | 1,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+100;
ll T,n;
ll u[N],v[N];
ll sum[N],ans[N];
ll wor[N];
priority_queue<ll, vector<ll>, greater<ll> >q[N];
inline void solve(){
cin>>n;
memset(sum,0,sizeof(ll)*(n+10));
memset(ans,0,sizeof(ll)*(n+10));
for(ll i=1;i<=n;++i) ... | C++ | 437ab04bd029db32ceba31becbe06722 | f2ff499fdaab3e0710c7e9cc377b3d46 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define dbg(x) cout<<#x<<" = "<<x<<"\n"
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#defi... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 06e2a00e98adfdfbfef06d313d38a582 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define dbg(x) cout<<#x<<" = "<<x<<"\n"
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#defi... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 8e56d69e21ac83c186611f99e44466c0 | 800 | PASSED |
#include <bits/stdc++.h>
#define nich using
#define was namespace
#define here std
nich was here;
#define fastio ios_base::sync_with_stdio(false), cin.tie(0)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORO(i, n) for (int i = 0; i < n; i++)
#define ROF(i, a, b) for (int i = a; i >= b; i--)
#define ll lon... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 58fb8e04edc722dca2b7e0f7fcd70e0f | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
bool cmp(long long a,long long b){return a>b;}
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w",... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 13c5911cee1c47503a9c3f467bc97dcf | 800 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
#define ll long long
int main()
{
ll t,n,x,y;
cin>>t;
while(t--){
cin>>x>>y>>n;
if(x>y) {
ll temp = x;
x = y ;
y = temp;
}
int x1 = x - 1 , y1 = y - 1,cnt = 0,max = 1*y1 + y * ... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 29a5238bec5ed094b5c9bf06e02db1ed | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 200005
#define MAXM 200005
typedef pair<int, int> pii;
#define INF 0x3f3f3f3f
#define rep(i, x, y) for (int i = x; i <= y; i++)
#define per(i, x, y) for(int i = x; i >= y; i--)
#define pb emplace_back
ll read() {
ll x=0,f=1;char ch;
... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | f6aebdb54c0186b2c4a856e44ff9ed58 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n,m,k;
cin>>n>>m>>k;
if((n-1) + (m-1)*n != k) cout<<"NO"<<'\n';
else cout<<"YES"<<'\n';
return ;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--) solve();
}
| C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 2ebc9988dfbb7cb39ba435f58cdd73dc | 800 | PASSED |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pb push_back
using namespace std;
int main()
{
cin.sync_with_stdio(0), cin.tie(0);
int t, n, m, k;
cin >> t;
while (t--)
{
cin >> n >> m >> k;
cout << (n*m-1 == k ? "... | C++ | 8b0a9c7e997034d3ecce044b9f64aeba | e9d5eea1d8c07cd162cf345222e9732d | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while(t--){
int n, m, k, ans;
cin >> n >> m >> k;
ans = m * n - 1;
if(ans == k) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}
| C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 80ec70f907ed515cf347c1e340c1ae75 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin >> t;
while(t--) {
int a, b, c;
cin >> a >> b >> c;
if(a * b - 1 == c) {
cout << "YES" << "\n";
} else {
cout << "NO" << "\n";
}
}
}
| C++ | 8b0a9c7e997034d3ecce044b9f64aeba | 4de298bb702e55e7402644c1b631e740 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ni[5050][5050],a[5050],b[5050],c[5050],summ[5050];
int main()
{
ll n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
}
for(int i=1;i<=n;i++)
{
c[i]=a[i]*b[i];
summ[i]=c[i]+summ[i-1];
ni[i][i]=c[i... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 33ecc8d3377ff3473f57c8163af82e4b | 1,600 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;
const int N=5005;
ll s[N],a[N],b[N];
ll dp[N][N];
int main()
{
int n;
cin >> n;
for(int i = 1; i<=n; i++)
cin >> a[i];
for(int i = 1; i<=n; i++)
... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 5d1b8efd36f16bb21f446ac91aae9252 | 1,600 | PASSED |
#define tasknames ""
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll maxn = 2e5 + 5;
ll n;
ll a[maxn], b[maxn], pre[maxn];
ll res = 0;
void Input()
{
cin >> n;
for (ll i = 1; i <= n; i++)
{
ci... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 51e02e638959baa3565da125e10c617a | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll sum[5010];
ll dp[5050][5050];
ll a[5050], b[5050];
int main()
{
int n;
scanf("%d", &n);
int i, j, k;
for(i = 1; i <= n; i ++ )
scanf("%lld", &a[i]);
for(i = 1; i <= n; i++)
{
scanf("%lld", &b[i]);
dp[i... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | f40edd1414221c12e81cde3b8205b35f | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 5010;
int a[N], b[N], f[N][N], s[N];
signed main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) {
cin >> b[i];
f[i][i] = a[i] * b[i];
s[i] = s[i - 1] + f[i][i];
}
int ans = s[n];
... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 0d11cb359a5da41aeebd7dc2fdb94843 | 1,600 | PASSED |
#include <iostream>
#include <cmath>
#define int long long
using namespace std;
const int N = 5010;
int A[N], B[N], f[N][N], s[N], ans;
signed main() {
int n;
cin >> n;
for(int i = 1; i <= n; i ++ ) cin >> A[i];
for(int i = 1; i <= n; i ++ ) cin >> B[i], s[i] = s[i-1] + A[i] * B[i], f[i][i] = A[... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 9979743bdf4077b0ff13c29bb1abee46 | 1,600 | PASSED |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 5005;
long long a[N], b[N], p[N], s[N], dp[N][N];
signed main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)scanf("%lld", &a[i]);
for (int i = 1; i <= n; i++)scanf("%lld", &b[i]);
for (int i = 1; i <= n; i++)p[i] = p... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 9c57d8c0375e859f728a7a2079dfd388 | 1,600 | PASSED |
#include<bits/stdc++.h>
//#include "Solution.h"
using namespace std;
typedef long double ld;
typedef long long ll;
constexpr long long sz = 2e5 + 7;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(i,j,k) for(int i=j;i<k;i++)
#define FORD(i,j,k) for(int i=j;i>=k;i++)
#define pii... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 3ef034c0dd51913424e3e986821278f5 | 1,600 | PASSED |
#include<bits/stdc++.h>
//#include "Solution.h"
using namespace std;
typedef long double ld;
typedef long long ll;
constexpr long long sz = 2e5 + 7;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(i,j,k) for(int i=j;i<k;i++)
#define FORD(i,j,k) for(int i=j;i>=k;i++)
#define pii... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | 6f552cc3b2999569ab974d99ee4e569c | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define pb push_back
#define mp make_pair
#define sp setprecision
#define mn INT_MIN
#define mx INT_MAX
#define mem(a,b) memset(a,b,sizeof(a))
#define F first
#define S sec... | C++ | 7a3108216f400a4f5bb809353ceb18d4 | fcd8df21821a52c75e7cec767372fca2 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int base = 31;
const int NMAX = 400001;
const int INF = 1e9;
const int VMAX = 5... | C++ | a019519539d493201bef69aff31bcd4e | a148ce7d0b492544de5b02837961f0cf | 2,700 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int base = 31;
const int NMAX = 400001;
const int INF = 1e9;
const int VMAX = 5... | C++ | a019519539d493201bef69aff31bcd4e | 29426d0b6579a10a806202e2a7dc6dc6 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int base = 31;
const int NMAX = 400001;
const int INF = 1e9;
const int VMAX = 5... | C++ | a019519539d493201bef69aff31bcd4e | 2ed32dfc7c14285fa5db43393593109a | 2,700 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int base = 31;
const int NMAX = 1000001;
const int INF = 1e9;
const int VMAX = ... | C++ | a019519539d493201bef69aff31bcd4e | 3d31aa1b27538ea735d5fc05620cf03f | 2,700 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int base = 31;
const int NMAX = 1000001;
const int INF = 1e9;
const int VMAX = 501;
const int nrbits = 17;
c... | C++ | a019519539d493201bef69aff31bcd4e | 8acc89d2ef4aadfaa2363347dc5315a3 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
inline int read()
{
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9')... | C++ | a019519539d493201bef69aff31bcd4e | b784e10b1ef96115b6f3a1127ad9ff65 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
inline int read()
{
int x=0,f=1;char c=getchar();
while... | C++ | a019519539d493201bef69aff31bcd4e | d8dc0651335fc8dfe616a6200c5551e7 | 2,700 | PASSED |
#pragma GCC optimaze(3)
#pragma GCC optimaze(2)
#pragma GCC optimaze("Ofast")
#pragma GCC optimaze("inline")
#pragma GCC optimaze("unroll-loops")
#define fi first
#define se second
#define ll long long
#include<bits/stdc++.h>
using namespace std;
//const ll m1=998244353,m2=1e9+7;
//const ll mm1=1e9+7,mm2=1e9... | C++ | a019519539d493201bef69aff31bcd4e | 71a064f7ed97e83b685a27ff7fabbf13 | 2,700 | PASSED |
#pragma GCC optimaze(3)
#pragma GCC optimaze(2)
#pragma GCC optimaze("Ofast")
#pragma GCC optimaze("inline")
#pragma GCC optimaze("unroll-loops")
#define fi first
#define se second
#define ll long long
#include<bits/stdc++.h>
using namespace std;
//const ll m1=998244353,m2=1e9+7;
//const ll mm1=1e9+7,mm2=1e9... | C++ | a019519539d493201bef69aff31bcd4e | 4a81bcbe2188eae13b7ec937545d04ff | 2,700 | PASSED |
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
long long gcd(long long x,long long y)
{
return y == 0 ? x : gcd(y, x % y);
}
struct frac
{
long long p;
long long q;
bool operator <(const frac &b)const
{
return (long double)p / q ... | C++ | a019519539d493201bef69aff31bcd4e | 040091aece02a832a21344c9992119f6 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%2;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 41688d05c0916cdde3e470628fbcd3e0 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%3;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | f43883571cb69ba210c5147a2f5babe1 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%4;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 62f7f4a738927ee28f95a8ad4fdac05c | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%5;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 2ffe1a213716d5155b2faa41e3dff63c | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%7;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 9bb22e1dbb852c6bff23d473087c7155 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%8;
if (k == 0) while (1);
cou... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 41c15e502bee1be167c1e673fea696e2 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%10;
if (k == 0) while (1);
co... | C++ | 329ac6671e26b73ab70749ca509f5b09 | c7dc1eb14a991c6753fb402a578c1e67 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%10;
if (k == 0) while (1);
co... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 88697ba556f86ce1be147c7756c6c401 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%100;
if (k == 0) while (1);
c... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 455fe216acb30cc9682f90189da4ad55 | 800 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
void solve() {
srand(double(time(0)));
short n, x;
cin >> n;
vector<short> a(n);
for (short i = 0; i < n; i++) cin >> a[i];
short k = rand()%10000;
if (k == 0) while (1);
... | C++ | 329ac6671e26b73ab70749ca509f5b09 | 03aab0f184808fa7b89669f39b7114b4 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<set>
#include <sstream>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#define x first
#define y second
#define ios ios::sync_with_stdio(fal... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | 4ed54f831e529102dfa6f022e1dd63b8 | 1,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<set>
#include <sstream>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#define x first
#define y second
#define ios ios::sync_with_stdio(fal... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | 3fcdf017809f68e51aeeccb3a169d76f | 1,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<set>
#include <sstream>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#define x first
#define y second
#define ios ios::sync_with_stdio(fal... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | d81e3bc35577693421484f7c612ec369 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define vec vector<int>
#define vecp vector <pair <int, int>>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define str string
using namespace std;
int inf = 1e18;
int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0); ... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | caa9ecce7aa7645386cfa0d41910abc4 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define vec vector<int>
#define vecp vector <pair <int, int>>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define str string
using namespace std;
int inf = 1e18;
int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0); ... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | 34c4eba5b17e15dc6faa552adfafafe8 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int binarysearch(vector<ll> arr, ll l, ll r, ll x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | fa572a3c0ec6d4c9ef18f5b47e54b775 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int binarysearch(vector<ll> arr, ll l, ll r, ll x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | d07bdf3c1f62ad935c7c7f13eadc7f5b | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int binarysearch(vector<ll> arr, ll l, ll r, ll x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | dbf1cedfa51f44aa8c7bebf1f286e83a | 1,600 | PASSED |
//by InsiApple
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define x first
#define y second
#define pb push_back
#define rp(i,n,m) for(int i=(n);i<=(m);i++)
#define pr(i,n,m) for(int i=(m);i>=(n);i--)
#define all(a) a.begin(), a.end()
#define p2(x) (1ll<<(x... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | 6545ad5d55bea416150e97225475bfa6 | 1,600 | PASSED |
//by InsiApple
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define x first
#define y second
#define pb push_back
#define rp(i,n,m) for(int i=(n);i<=(m);i++)
#define pr(i,n,m) for(int i=(m);i>=(n);i--)
#define all(a) a.begin(), a.end()
#define p2(x) (1ll<<(x... | C++ | 0942e9cbce56ff3becd03d8e34962bf3 | 8943b1bdcb0be444e2021fcf3386d166 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define vec vector<int>
#define vecp vector <pair <int, int>>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define str string
using namespace std;
int inf = 1e18;
int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0); ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 0dd6bf54bc0f849427232d7beed99548 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define rep(i,n) for(int i=0,i##__end_=(n);i<i##__end_;i++)
#define ep emplace
#define eb emplace_back
typedef long long ll;
typedef pair<int,int>pi;
typedef ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 363c868c03f275c42ef6da9ae27bd586 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ep emplace
#define rep(i,n) for(int i=0,i##__end_=(n);i<i##__end_;i++)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typedef ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 665f3ae62cf306d0a069ebda5eda0b68 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ep emplace
#define rep(i,n) for(int i=0,i##_end_=(n);i<i##_end_;i++)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int> pi;
typedef p... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 7e0bf52891d4d6e9b31462d28e1fbb73 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ep emplace
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int> pi;
typed... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 61efe0d81a510886a69e0b3e12496476 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ep emplace
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typede... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 2836d4907881b3943bfd09f004c3bbb0 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define eb emplace_back
#define ep emplace
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 4352b0fcce3ebd5cd5170828db4cef0e | 1,300 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define eb emplace_back
#define ep emplace
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | ba82e78767b1469f018548c6f3722670 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define eb emplace_back
#define ep emplace
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typedef ... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | c935181a6e52d0e3ead992f7eaeced94 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;i++)
#define eb emplace_back
#define ep emplace
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typede... | C++ | 70028bbb9b7bce1f0d2753275b3e752f | 3b76b45414dfbf972f250182c62d13c4 | 1,300 | PASSED |
//yamero codeforces-chan/atcoder-chan/quera-chan
#include <bits/stdc++.h>
#define F first
#define pb push_back
#define sz size()
#define S second
#define DEBUG cout << "Beep Boop"
#define RTE assert(false)
using namespace std;
typedef long long int ll;
const int N = 2e5 + 10;
int n,k,arr[N];
inline void init(){
}
inl... | C++ | 4d5d20fd586ddbea2adeab104a6c2aec | 6176924864f7ff24213b28d8f5476761 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.