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;
#define LL long long
const int N=500+5,INF=0x3f3f3f3f;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int x,y;
scanf("%d%d",&x,&y);
LL ans=0;
for(int k=1;k*k<x;k++)
{
int t=min(y,x/k-1)-k;
if(t>0) ans+=t;
}
printf("%lld\n",ans);
}
return... | C++ | efdb966e414050c5e51e8beb7bb06b20 | 4b45baaf9e3dba48e19a922153e69854 | 1,700 | PASSED |
#include <iostream>
using namespace std;
typedef long long ll;
const int N=1e6+7;
int main() {
int t;
cin>>t;
while(t--) {
ll ans=0;
int x,y;
cin>>x>>y;
for(int i=1;i<=x/i;i++) {
ans+=max(0,min(y,x/i-1)-i);
}
cout<<ans<<endl;
}
return 0;
}
| C++ | efdb966e414050c5e51e8beb7bb06b20 | 79671ac1d8943d2f3cdba44e1e795c84 | 1,700 | PASSED |
#include <iostream>
#include <cmath>
#define ll long long
using namespace std;
int main()
{
ll t, x, y;
cin >> t;
for (int j=1; j<=t; j++){
cin >> x >> y;
ll res = 0;
for (int i=1; i<=sqrt((double) x); i++) {
ll tmp = max((ll)(0), min(x/i-1, y) - i);
res += tm... | C++ | efdb966e414050c5e51e8beb7bb06b20 | e8e0f0515ebfe622a732cda42a894dac | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N =1e5+10;
int arr[N];
signed main()
{
int t;
cin>>t;
while(t--)
{
int x,y;
cin>>x>>y;
long long res=0;
for(int i=1;i<=x/i;i++)
{
res+=max(min(y,x/i-1)-i,0);
}
cout<<res<<endl;
}
}
| C++ | efdb966e414050c5e51e8beb7bb06b20 | ee61929ccaa839eb1d20e3433acd8b86 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll _,x,y;
int main()
{
scanf("%lld",&_);
while(_--)
{
scanf("%lld%lld",&x,&y);
ll ans=0;
ll ans1=sqrt(x+1),ans2=0;
if(y>=x) y=x-1;
if(ans1>=y)
{
ans=(y-1)*y/2;
}
else
{
ll r=0;
for(ll l=ans1+2;l<=y+1;l=r+1)
{
r=min... | C++ | efdb966e414050c5e51e8beb7bb06b20 | 05350cc323024f6ed6fbc3d3f7449bf3 | 1,700 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | efdb966e414050c5e51e8beb7bb06b20 | e5e6ae7da2db6a3621244181ff68b8ff | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int main(){
int n,m,k;cin>> n >> m >> k;
int a[N];
for(int i=1;i<=n;i++)cin>> a[i];
while(m--){
int l,r;cin>> l >>r;
ll ans =0;
ans+=a[l]-1;
ans+=k-a[r];
ans+=2*(a[r]-a[l]-1-r+l+1);
cout<<ans<<endl;
}
}
... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | cabc1af393da75d0e9cfe721d6070167 | 1,200 | PASSED |
#include <stdio.h>
int a[100005];
long long b[100005], sum[100005];
int main(void) {
int n, q, k;
scanf("%d %d %d", &n, &q, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
b[1] = a[2] - 2;
b[n] = k - 1 - a[n - 1];
for (int i = 2; i <= n - 1; i++)
b[i] = a[i + 1] - a[i - 1] - 2;
for (int i = 1; i <= n;... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | e6317698a7ec96c2f0a73557d6e5083a | 1,200 | PASSED |
/*
Author: Rudro_mozumdar
*/
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <random>
#define ll long long int
#define endl "\n"
#define filer freopen("in.txt", "r", stdin)
#define filew freopen("out.txt", "w", stdout)
#define tes... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | aaecacd1c8478d70af5f5821bcccc927 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define pb push_back
typedef long long ll;
using namespace std;
const int N=2e5;
/*
递增
长度相等
范围[1,k]
只有一个元素不同
*/
int n,q,k,ans;
int a[N];
ll psum[N];
int l,r;
void AC(){
ans=0;
cin>>l>>r;
if(l==r){
cout<<a[l]-1+k-a[l]<<endl;
}else{
ans+=psum[r-1]-psum[l];
ans+=a[... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | 3bea76c48ce9af9bec83f5f960c4c347 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MEGURINE
#define fr(x) freopen(x, "r", stdin)
#define fw(x) freopen(x, "w", stdout)
#endif
#ifndef MEGURINE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline", "fast-math", "unroll-loops", "no-stack-protector")
#endif
#define fastIO() ios::sync_with_stdio... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | 303ffc66828dd37041081f0c04883f4e | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
long long M=1e9+7;
//INT_MAX gives maximum value of integer similarly LONG_MAX,INT_MIN is also there
const int N=1e7+10; //use it when size of array approximately equal to... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | 417cad8a1ad2e7e37a6aa8dc78957f6c | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
long long M=1e9+7;
//INT_MAX gives maximum value of integer similarly LONG_MAX,INT_MIN is also there
const int N=1e7+10; //use it when size of array approximately equal to... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | bbf5485496bd4d5e6b288c7ea158e5dd | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
long long M=1e9+7;
//INT_MAX gives maximum value of integer similarly LONG_MAX,INT_MIN is also there
const int N=1e7+10; //use it when size of array approximately equal to... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | 35aa935a10ff31f5fe7e6d279adc8ee4 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
long long M=1e9+7;
//INT_MAX gives maximum value of integer similarly LONG_MAX,INT_MIN is also there
const int N=1e7+10; //use it when size of array approximately equal to... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | c4defa8f71ae49d190f916a8fbf05f9a | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for( int i=0;i<n;i++) // loop from 0 to n in ascending order
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1) //loop from k to n in both asc as well as desc order
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define... | C++ | 740d2aba32f69b8cfe8f7cb624621a63 | 8a78d8de541ec6581cc058c9063147b6 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(s) s.begin(),s.end()
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | 4e9f63050985d262c1d1ecaae8042730 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
fast;
ll t;
cin>>t;
while(t--){
ll a,b;
cin>>a>>b;
ll ans=1e18, c=0;
for(ll i=0; i*i<=a; i++){... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | f58c7cd3ec65d2705eb08cc290a8087f | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define MOD 98765431
typedef long long ll;
ll const N = 1e5+3,oo=1e9;
void solve() {
int a,b;
cin>>a>>b;
int ans=0,mn=10000;
if(b==1){
b++;
++ans;
}
for (int i = b; i <=max(b,30) ; ++i) {
int cnt=0,val=a;
while(val>0){
... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | ced5d919fcf54cef4c40a3a0ca1fe6e8 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define f first
#define s second
#define ou ||
#define dbg(x) cout << #x << " = " << x << endl
#define forn(i, n) for (int i = 0; i < int(n); i++)
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF =... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | 917dfe2ffed219bd12a9fa23754ecb29 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define Mohamed71 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define INF INT_MAX
#define pb push_back
#define pf push_front
#define inarr(n, arr) for(int i = 0; i<(n); i++)cin>>arr[i];
#define all(x) (x).begin(), (x).end()
#define allr(x) x.rbegin(),x.rend()
#defin... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | 4356df0812c352243544447e905d65d7 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define arisu ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define scase sf ("%d",&tc)
#define ull unsigned long long
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define fr(i,x,n) for(int (i) = (x) ; (i) < (n) ; ++(i))
#define fre(i,x,n) for(int (i) = (x) ; (i) <= (n) ; ++(... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | be7e6f0e29ed09c31cf5af81da51dc9f | 1,000 | PASSED |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int a, b;
scanf("%d%d", &a, &b);
int cnt = 0;
if (b == 1) {
b++;
cnt++;
}
int ans = 0x3f3f3f3f, val = b;
for (b = val; b <= val + 6; b++) {
int x = a, y = cnt;
while (x) {
... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | df7d3529be8c5b4f4fca01cb857a3e01 | 1,000 | PASSED |
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <string>
#include <iostream>
#include <map>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climit... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | 52f590a712205663d2adddced6bf0170 | 1,000 | PASSED |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include<vector>
using namespace std;
#define ll long long
#define mm (1e9)
ll dfs(ll a,ll b)
{
ll p=0;
while(a)
{
a=a/b;
p++;
}
return p;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll a,b;
... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | f695acde6855ee6fa5fb319253ac9f06 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define F first
#define S second
#define sz(s) (int)s.size()
#define all(v) v.begin(), v.end()
int cur = 0, cnt = 0;
int compute(int a, int b) {
if(cnt || b == 1)... | C++ | 2b757fa66ce89046fe18cdfdeafa6660 | a4f64a52780fd440e14e743b0dcbef43 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 1 << 30;
void solve() {
int n;
cin >> n;
vector<int> f(n + 1);
vector<vector<int>> e(n + 1);
for (int i = 2; i <= n; i++) {
cin >> f[i];
e[f[i]].push_back(i... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 90c4ead08413a81e362ea55e0658d3d5 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 1 << 30;
void solve() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
e[x].push_back(i);
e[i].... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | af248e442fc9be15e0ce0e05652f59d9 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 1 << 30;
void solve() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
e[x].push_back(i);
e[i].... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 590c908b6fc89f3c59c54981aee69202 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 1 << 30;
void solve() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
e[x].push_back(i);
e[i].... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 9085a99cb9bb93ce7a66d307977ed8e8 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 1 << 30;
void solve() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
e[x].push_back(i);
e[i].... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 79cd909dcff44c286a286def9fb60204 | 2,500 | PASSED |
#include <iostream>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <unordered_set>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <random>
#include <cfloat>
#i... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 8848e1b6377e0f34d83a7f62aadc95ec | 2,500 | PASSED |
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <tuple>
#include <utility>
#define greedy int
#define mindset main()
using namespace std;
#define FOR(a,b,c) for(int a = b; a < (c); a++)
#define FORR(a,b,c) for(int a = b; a > (c); a--)
... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 5aeefd2b8d5152262208d246e657f3b8 | 2,500 | PASSED |
#include<cstdio>
#include<vector>
std::vector<int> a[200005],s[200005];
int t,n,fa[200005],dep[200005],md;
long long d[200005],g[200005],ans=0;
void add(int x,int y){a[x].push_back(y);a[y].push_back(x);}
void dfs(int v,int x,int d)
{
fa[v]=x;dep[v]=d;
md=std::max(md,d);
s[d].push_back(v);
for (int i=0;i<... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 0e0ecd60fd491a205eb7fb24f1c2d503 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
vector<int> G[N];
int L[N], R[N], tot = 0, cnt = 0;
ll dp[N], tpf[N], tps[N], pre_mx[N], suf_mx[N];
ll ans = 0;
struct node{
int id, fa, dep;
ll val;
}a[N];
void dfs(int u, int depth) {
tot = max(tot, d... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | 6b366b65e2de593ec3594bdb64d51436 | 2,500 | PASSED |
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mxN = 2e5 + 5;
long long a[mxN];
vector<int> ad[mxN], g[mxN], child[mxN];
void dfs(int u, int p, int d = 0) {
g[d].push_back(u);
for (int v : ad[u]) {
if (v == p) continue;
dfs(v, u, d + 1);
child[... | C++ | 1ff25abd9d49de5e5ce3f7338ddef18c | fdb10561073c45f285aab41752847e33 | 2,500 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 0fa7af5afcacb8f158da9ac9a449ee7d | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 2225f81a0d34f69ae07d6265863391eb | 2,400 | PASSED |
#include <bits/extc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
#ifdef XYL_DEBUG
#define... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 2af04393d1e6b4615f84bea943b8b206 | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 076d105bb02b37d881bb3d41eeca20d0 | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 1bc676bb956dc4a99bb918d9cbe7d472 | 2,400 | PASSED |
#include <bits/extc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
#ifdef XYL_DEBUG
#define... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 9c4bf78cb5dba2cdbfef7412cd319077 | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 6cf4b60270bf091b69b89444067d2284 | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 4a9af66c9853df4b18d16f32112aa25a | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | ef10bf1b957f08f2f54fdc6119a8af95 | 2,400 | PASSED |
#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define forn(i, j, k) for(auto i=j;i<k;i++)
#define Forn(i, j, k) for(auto i=j;i>k;i--)
#define mem(i, j) memset(i,j,sizeof(i))
#define mec(i, j) memcpy(i,j,sizeof(i))
#define mk make_pair
#define pb push_back
#define ctz __builtin_ctzll
... | C++ | eb8f0abc9556ca514454d307fd98ae5d | 02c69648b579b97009c70dfde7cd3a48 | 2,400 | PASSED |
// LUOGU_RID: 92448292
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
#define pr pair<int, int>
const int INF = LONG_LONG_MAX;
... | C++ | 987433ba0b6a115d05f79f512e329f7a | 2fcbdbcbd1ac528fa6bc5fd6c4126af8 | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
#define pr pair<int, int>
const int INF = LONG_LONG_MAX;
const int m... | C++ | 987433ba0b6a115d05f79f512e329f7a | 603c90ebbd729d1363626b83ad1e1565 | 2,300 | PASSED |
// CF
#include<iostream>
#include<stack>
#include<list>
#include<set>
#include<vector>
#include<algorithm>
#include<math.h>
#include<numeric>
#include<map>
#include<cstring>
#include<queue>
#include<iomanip>
#include<cmath>
#include<queue>
#include <bitset>
#include<unordered_map>/*
#ifndef local
... | C++ | 987433ba0b6a115d05f79f512e329f7a | c3a0299f36419a5ce744922f0ce07694 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace my_std
{
typedef long long ll;
const ll inf=0x3f3f3f3f;
#define fr(i,x,y) for(ll i=(x);i<=(y);++i)
#define pfr(i,x,y) for(ll i=(x);i>=(y);--i)
#define space putchar(' ')
#define enter putchar('\n')
inline ll read()
{
ll sum=0,f=1;char ch=0;
while(!isdig... | C++ | 987433ba0b6a115d05f79f512e329f7a | 346bd1a1ab8e1c081a6667cf98d0a727 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace my_std
{
typedef long long ll;
const ll inf=0x3f3f3f3f;
#define fr(i,x,y) for(ll i=(x);i<=(y);++i)
#define pfr(i,x,y) for(ll i=(x);i>=(y);--i)
#define space putchar(' ')
#define enter putchar('\n')
inline ll read()
{
ll sum=0,f=1;char ch=0;
while(!isdig... | C++ | 987433ba0b6a115d05f79f512e329f7a | 3a3a9b059c6ccc271db91d5536c90a96 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
template <const int N>
struct LCA {
int lg[N], dep[N], par[N][20];
LCA() {
lg[0] = -1;
for (int i = 1; i < N; i++) {
lg[i] = lg[i >> 1] + 1;
}
}
void init(int n, int rt, vector<int> *G) {
for (int i = 1; i <= n; i++) {
f... | C++ | 987433ba0b6a115d05f79f512e329f7a | 179ced4fb504cb2cfb5ec2a270a4c83f | 2,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7, inv = 500000004;
struct LCA {
vector<int> lg, dep;
vector<vector<int> > par;
LCA(int n, int rt, const vector<vector<int> > &G) : lg(n + 1), dep(n + 1), par(n + 1, vector<int>(20)) {
lg[0] = -1;
for (int i = 1; i... | C++ | 987433ba0b6a115d05f79f512e329f7a | e270e9df19537c33ff43e7a693d87f49 | 2,300 | PASSED |
#include<map>
#include<ctime>
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
#define I inline ll
#define her 20090115
#define IV inline void
#define ch... | C++ | 987433ba0b6a115d05f79f512e329f7a | 39732855b7bd3e7eca6e24feb2502a32 | 2,300 | PASSED |
#include<map>
#include<ctime>
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
#define I inline ll
#define her 20090115
#define IV inline void
#define ch... | C++ | 987433ba0b6a115d05f79f512e329f7a | 7acc2ab08f5a62553022aaca7766175a | 2,300 | PASSED |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#define ll long long
#define int ll
#define Inf 0x3f3f3f3f
using namespace std;
const int N=500+60,mod=1e9+7;
const int inv2=(mod+1)/2;
inline int read(){
int d=0,f=1;char x=getchar();
while(x<'0'||x>'9'){if(x=='-'){f=-1;}x=getchar... | C++ | 987433ba0b6a115d05f79f512e329f7a | 52f85d5fc6247052ba85523dd1b0884a | 2,300 | PASSED |
#include<map>
#include<ctime>
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll int
using namespace std;
#define I inline ll
#define her 20090115
#define IV inline void
#define cht 1000... | C++ | a6ca373007dc86193721b52bf35f5af8 | ed7b71926cc1b56600b82927c01785c0 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a<b?a:... | C++ | a6ca373007dc86193721b52bf35f5af8 | 84097443b993781a69030e11a5bf23cd | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int N = 102;
int b[3][N], c[N];
int dp[N][N*N]; // (i, pref_i) -> count
int n;
int calc(int x) {
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][0] = dp[i-1][0];
for (int j = 1; j <= i*N; j++) {
dp[i][j] = (0LL + dp[i][j-1... | C++ | a6ca373007dc86193721b52bf35f5af8 | aae2e6b2af7bf9d39de121e4faa7025f | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int p=1e9+7;
int b[101],c[101],f[10001],g[10001],w[101];
unordered_map<int,int>mp;
main(){
int n;
cin>>n;
int s=1;
for(int x=1;x<=n;x++)
cin>>c[x],(s*=c[x]+1)%=p;
for(int x=1;x<n;x++)
cin>>b[x];
for(int x=1;x<=n;x++)
for... | C++ | a6ca373007dc86193721b52bf35f5af8 | a26be2d53123b64213c1f63448fa6e42 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=101,mod=1e9+7;
int c[N];
int b[N];
int f[N];//b的贡献
int dp[N][N*N];
int main(){
int n,x;cin>>n;
dp[0][0]=1;
for(int i=1;i<=n;i++)cin>>c[i];
for(int i=1;i<n;i++)cin>>b[i];
for(int i=1;i<=n;i++)for(int j=1;j<i;j++)f[i]+=(i-j)*b[j];
... | C++ | a6ca373007dc86193721b52bf35f5af8 | 168b978a0229ee3589276f22b228db64 | 2,700 | PASSED |
// LUOGU_RID: 94496503
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
int x = 0; bool op = 0;
ch... | C++ | a6ca373007dc86193721b52bf35f5af8 | 3d26e41f2a50374b19e7e250c68a71d1 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
int x = 0; bool op = 0;
char c = get... | C++ | a6ca373007dc86193721b52bf35f5af8 | c16321be6a5afc8d3d6b7c754c5cc1d3 | 2,700 | PASSED |
#include <cstdio>
#include <algorithm>
const int N = 105, P = 1000000007;
int n, c[N], b[N], m, f1, f[N][N*N], l, r, ans;
signed main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
for (int i = 2; i <= n; i++) scanf("%d", &b[i]), b[i] += b[i-1];
scanf("%d", &m);
scanf("%d", &f1);
... | C++ | a6ca373007dc86193721b52bf35f5af8 | 08e9d97c1dae76bc8f4c9d9d709890fb | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 5;
const int MOD = 1e9 + 7;
int N, X;
int c[MAXN], b[MAXN];
int dp[MAXN][MAXN * MAXN];
void load() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", c + i);
for (int i = 1; i < N; i++)
scanf("%d", b + i);
scanf("%*d%d", &X... | C++ | a6ca373007dc86193721b52bf35f5af8 | 0abae2c359428d425b9bea7ef46da865 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=110,p=1e9+7,M=N*N;
int n,m,q,x[N],b[N],c[N],a[M],f[M],g[M];
void add(int &x,int y){x=(x+y)%p;}
signed main(){
scanf("%d",&n);
int L=0,R=N*N;
for(int i=1;i<=n;i++)scanf("%d",&c[i]),m=max(m,c[i]);
for(int i=1;i<n;i++)scanf("%d",&x... | C++ | a6ca373007dc86193721b52bf35f5af8 | 54df86c9c4693577d3fc94d5d1aca5f9 | 2,700 | PASSED |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<long long>a(n),b(n);
for(int i=0;i<n;++i)
... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 30c8a1195cc1b3542c34f3c374ffc616 | 1,400 | PASSED |
#ifdef YANGHAN
#include "../acm.h"
FILE *INPUT = freopen("input.txt", "r", stdin);
#else
#include <bits/stdc++.h>
#define separator(x)
#endif
void solve() {
#define int long long
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 189c0bedf6038fb91211313e510bb4b9 | 1,400 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<unordered_map>
#include<vector>
using namespace std;
typedef long long int LL ;
typedef pair<__int128,__int128> PII;
const int N = 1e5 + 10;
LL a[N];
__int128 a1[N];
__int128 a2[N];
void print(__int128 x)
{
if(x < 0)
{
... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | fcc52aefbb64f36ebd6e723d8aee02b9 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod (1e9 + 7)
#define inf 1e18
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define w(x) int x; cin >> x; while(x--)
mt19937 rng... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 7be64ef727a4fdd99fd886d20349f5ea | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// Idea: add an edge from 1 to the node with the largest d[i] value.
// Then, add an edge from u -> v is d[v] <= d[u] with a weight of
// d[v] - d[u]. The shortest path to go from 1 to u will go from
// 1 -> node with largest d[i] value -> v... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 11e7f10fe3fb25778e3ea42be7f0cc9e | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
void solve() {
int n;
cin >> n;
vector<int> d(n + 2);
for (int i = 1; i <= n; i++) cin >> d[i];
sort(d.begin() + 1, d.begin() + n + 1);
ll ans = d[n], cs = 0;
for (int i = ... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | f0d3eee68aa9c448d4d0acff965961af | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define mod 1000000007
#define vc vector<ll>
#define vp vector<pair<ll,ll>>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ist(a) insert(a)
#define fr(i,a,n) for(int i=a;i<n;i++)
#define fr2(i,n,a) for(int ... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 41470cd9a51d2e4b3ceabb683122ce17 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define mod 1000000007
#define vc vector<ll>
#define vp vector<pair<ll,ll>>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ist(a) insert(a)
#define fr(i,a,n) for(int i=a;i<n;i++)
#define fr2(i,n,a) for(... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | b0629b8e614bfa603bf9eeee511ee0bd | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define mod 1000000007
#define vc vector<ll>
#define vp vector<pair<ll,ll>>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ist(a) insert(a)
#define fr(i,a,n) for(ll i=a;i<n;i++)
#define fr2(i,n,a) for(l... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 9259792c424ae02a5de293742e128182 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int n; cin>>n;
ll arr[n]; for(int i=0;i<n;i++) cin>>arr[i];
sort(arr,arr+n);
ll sum = 0;
ll ans = arr[n-1];
for(int i=1;i<n;++i){
sum ... | C++ | 7dfe0db5a99e6e4d71eb012fab07685b | 8137b0bbc72ae3f4c408db8d15e94b90 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephol... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | deb2a0206737ba516c833cdaca0c7865 | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | 2ecf95a322fbfa2d88e6998480d5cb6c | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | b8f7c8f69bf9c811d2487233afc09103 | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | b4d010ff159a0b16d10224dc8a5d4218 | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | ef1a0e302ff8183a78a3b8136dd78d4e | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | 9adb30aed0d1491ee88d81f485817b4d | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | 38f33b238ff48c49622e423e48589ab2 | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | bc87dcfa08330bd237b60fa29eda0721 | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | 4d1542568f542ea45304799da59a13fe | 3,200 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define LL long long
#define ... | C++ | 7c26c9759818e8b77fdacbed8694cc27 | 233609dd331d3a18a15fc38576bd3c4b | 3,200 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | cbe3e32389d1e4429293d85b75946d65 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 2e82c596c5984d8212ce04cc3a2e2f20 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 8ce6a3b46565065da4dd59e3d0cb95e8 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cassert>
#include <cstdio>... | C++ | f2bcbbfc8062aebd0545497d815f8827 | eb13975cd63e93ae9b779c3f9d597f54 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | d9bfa45c96647b1112766fbd0359f982 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 5c50d54e841d7d61430b354441e4b71b | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
#include <cstdio>
struct UnsafeInput... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 8e5c5577bae5ec586a73e4c259770b30 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
using namespace std;
bool online_j... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 43d63bb15d42ab209c4e214fdf4de986 | 2,900 | PASSED |
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
using namespace std;
bool online_j... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 73e8248cb31868da1987582ea2b7bda7 | 2,900 | PASSED |
#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cstring>
... | C++ | f2bcbbfc8062aebd0545497d815f8827 | 39c3265317690172ca1e0dd4702dcf78 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
using namespace std;
const int N = 307, mod = 1e9 + 7, B = 16;
int qpow(int x, int y = mod - 2) {
int res ... | C++ | c11a4d0fb5ce48af19aa7583559ed269 | 04e4c8ce0ae6a5c223fe44f7c11823c8 | 3,500 | PASSED |
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("move-l... | C++ | c11a4d0fb5ce48af19aa7583559ed269 | c9b75e2a75f50057277cecc254b723e6 | 3,500 | PASSED |
#include <cstdio>
#include <vector>
#include <algorithm>
#define pb push_back
using std::vector;
const int N=305, MOD=1000000007;
inline int mval(int x) { return x>=MOD?x-MOD:x; }
inline int fix(int x) { return x+(x>>31&MOD); }
inline void inc(int &x, int a) { x=mval(x+a); }
inline void dec(int &x, int a) { x=... | C++ | c11a4d0fb5ce48af19aa7583559ed269 | f46bd8ee59086b6fa863f5d6ac8ce1fe | 3,500 | PASSED |
#include <cstdio>
#include <vector>
#include <algorithm>
#define pb push_back
using std::vector;
const int N=305, MOD=1000000007;
inline int mval(int x) { return x>=MOD?x-MOD:x; }
inline int fix(int x) { return x+(x>>31&MOD); }
inline void inc(int &x, int a) { x=mval(x+a); }
inline void dec(int &x, int a) { x=... | C++ | c11a4d0fb5ce48af19aa7583559ed269 | bc11a20da2da347d130333aa451c3a7a | 3,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.