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 fi first
#define se second
#define pb push_back
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
using ll = long long;
using PII = pair <int, int>;
using vi = vector <int>;
const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
int t, n, a[N];
int ask... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 3e3d3d30b2e134a1d882daca03192eaa | 2,400 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
using ll = long long;
using PII = pair <int, int>;
using vi = vector <int>;
const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
int t, n, a[N];
int ask... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 068da39f5c1ff937c26b614f5fab6f67 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define BetterIO ios::sync_with_stdio(false)
using namespace std;
int Ans[1000005],Res[1000005];
int Ask(int A,int B,int C)
{
cout<<'?'<<' '<<A<<' '<<B<<' '<<C<<endl;
int X;cin>>X;
return X^1;
}
int main(void)
{
BetterIO;
register int Case=1;cin>>Case;while(Case--)
{... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 45285967cece74e46f1c7766f1f63b9d | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int query(int a,int b,int c){
// cout.flush();
cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
int x; cin>>x;
return x;
}
const int N = 1e4+10;
int ans[N],p[N];
int main(){
int T; cin>>T;
while(T--){
int n; cin>>n;... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | fae038ccc3ca265ee008b54f656ce03a | 2,400 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << '\n'
#define between(x, l, r) (x >= l && x <= r)
#define point(a, b, m) ((a - 1) * m + b)
#define all(x) (x).begin(), (x).end()
#define SUM(a) accumulate(all(a), 0LL)
#define MIN(a) (*min_element(all(a)))
#define MAX(a) (*max_element(all(a)))
... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 44b9905c2495983c78fdd2629e7a168d | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5+5;
int T,n,vis[MaxN],s[MaxN];
int ask(int a,int b,int c){
cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
int x;
cin>>x;
return !x;
}
vector<int>v;
void find(){
v.clear();
for(int i=1;i<=n;i++){
if(vis[i]==1){
v.push_back(i);
}
}
cout... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | aa0b3e8851ad39b0d51773f6c63c9128 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=1e5+100;
int a[N];
int ans[N];
int b[N];
int ask(int u,int v,int w)
{
cout<<"? "<<u+1<<" "<<v+1<<" "<<w+1<<endl;
int x;
cin>>x;
return x;
}
void ... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | d08494d38ebab35bddfc40350dc32ee1 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int dim=20009;
bool ask(int a,int b,int c){
cout<<'\n';
cout<<"? "<<a<<' '<<b<<' '<<c;
cout<<'\n';
bool ans;
cin>>ans;
return ans;
}
vector<int>ans;
void answer(){
cout<<"! ";
cout<<ans.size()<<' ';
for(int x:... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 0861688ec1246b7478d14dafc8eebb20 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int dim=20009;
bool ask(int a,int b,int c){
cout<<'\n';
cout<<"? "<<a<<' '<<b<<' '<<c;
cout<<'\n';
bool ans;
cin>>ans;
return ans;
}
vector<int>ans;
void answer(){
cout<<"! ";
cout<<ans.size()<<' ';
for(int x:... | C++ | 98c584b0479eb26d8b0307bd72fc48fd | 52490361c9722a09de1a8ef463d24795 | 2,400 | PASSED |
#include "iostream"
#include "cmath"
#include "vector"
#include "cstring"
#include "map"
#include "set"
#include "algorithm"
#include "unordered_map"
#define nl "\n"
#define te cin >> t
#define pb push_back
#define pob pop_back
#define st for(int z=1;z<=t;z++)
#define ll long long int
#define pi 2*acos(0.0)
#define llu... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 533db0492f1a4ea35de25fe90fcd09c1 | 900 | PASSED |
#include<iostream>
#include<string>
#include<bits/stdc++.h>
using namespace std;
long long n,a[100020],i,j,k,l,n1,n2,max1,min1,sum,t;
double x;
int main()
{
cin>>t;
for(i=1;i<=t;i++)
{
cin>>n>>x;
sum=0;
max1=0;
min1=0;
for(j=1;j<=n;j++)
{
cin>>a[j]... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 6ae2a8a0a416631f912798a8493b2582 | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const ll MOD=1e9+7;
using namespace std;
ll T,N,M;
int main(){
cin>>T;
for(int i=1;i<=T;i++){
cin>>N>>M;
ll sum=0;
ll maks=0;
ll minn;
for(int j=1;j<=N;j... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 7dc6712f3c1c443883aa95bee2f5f132 | 900 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const int N = 1e5+10;
int n , x;
int Array[N];
void solve()
{
long long Max = 0 , Min = 0;
cin >> n >> x;
for(int i = 1 ; i <= n ; ++i) cin >> Array[i];
for(int i = 1 ; i <= n ; ++i) Min += Array[i] , Max += (Array[i] + x - 1) / x;
Min = (Min... | C++ | b36d7f840abe998185a988fe8dd2ec75 | c8108c55abb28483ea4980ec02ae4b21 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while (t--){
int n,a,x ;
long long sum =0,s=0 ;
cin >> n >>x ;
int arr[n];
for (int i=1;i<=n;i++){
cin >> arr[i];
s+=arr[i];
sum += arr[i]/x+(arr[i]%x!=0);
}
... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 7da215ff8530d5d4b77b06fca78459f5 | 900 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
//#include<pair>
#include<map>
#include<set>
#define ll long long
using namespace std;
const int N=3e5+10;
typedef pair<int,int> pii;
int n,t,m;
string s;
char ss[N];
int a[N];
int ans[N];
int main()
{
int t;
cin >> t;
while (t--)
... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 7bcc73aaef82ca05f1c1a47c172a2493 | 900 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
long long arr[100005];
int main()
{
long long n,k,q,sum,sum1;
cin>>q;
while(q--)
{
cin>>n>>k;
sum=0,sum1=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
sum+=arr[i];
}
if(sum%k==0)
... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 9a8e354ade21d551ab2146a9d76b7bb4 | 900 | PASSED |
#include <iostream>
using namespace std;
#include <cmath>
#define endl "\n"
int main() {
int t;
cin>>t;
while(t--) {
int n;
cin >> n;
double d;
cin >> d;
long long sum = 0;
long long count = 0;
for (int i = 0; i < n; i++) {
double value;
... | C++ | b36d7f840abe998185a988fe8dd2ec75 | bb503211aaed6d965ab836afab1403e2 | 900 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long sum=0;
long long sum2=0;
int x;
cin>>x;
for(int i=0;i<x;i++){
int y,tst;
cin>>y>>tst;
int arr[y];
for(int i=0;i<y;i++){
cin>>arr[i];
sum+=arr[i];
}
for(int i=0;i<y;i++){
sum2+=ce... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 9ab5df609d2b2d7552de5ddd323a11f7 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--) {
int n;
double x;
cin >> n >> x;
ll arr[n], sum = 0;
for(int i = 0; i < n; i++) {
cin >> arr[i];... | C++ | b36d7f840abe998185a988fe8dd2ec75 | 402b094f4926f97e84dc1ec3891392b9 | 900 | PASSED |
#include <bits/stdc++.h>
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define endll "\n"
#define FAST std::ios_base::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);
const double pi = acos(-1);
using namespace std;
int main() {
FAST
int n ;cin>>n;
while... | C++ | 09c8db43681d7bc72f83287897a62f3c | 19d777f1db506335fe8b3a854bed42ef | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for( i=0;i<n;i++)
#define foA(i,a,b) for(i=a;i<=b;i++)
#define foD(i,a,b) for( i=a;i>=b;i--)
#define int long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) ... | C++ | 09c8db43681d7bc72f83287897a62f3c | 3cdd923df29109fc81463d1cba4a3bd3 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long n,x,a[100005],minn=0x3f3f3f3f,sum=0,tmp,pos,cnt;
cin>>n>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
tmp=a[i];
cnt=0;
while(tmp%x==0){
tmp/=x;
cnt++;
}
if(cnt<minn)... | C++ | 09c8db43681d7bc72f83287897a62f3c | a4ba8d58ba384514c8ee2e587e5b155d | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int T,i,j;
int a[100100]={0},n,x;
long long ans,b,f;
cin>>T;
while(T--){
ans=0,f=1;
cin>>n>>x;
b=x;
for(i=0;i<n;i++){
cin>>a[i];
ans+=a[i];
}
while(1){
for(j=0;j<n;j++){
if (a[j]%b==0)
ans+=a[j];
if (a[j]%b!=0){
f=0... | C++ | 09c8db43681d7bc72f83287897a62f3c | ee67a90c3991337729e5094da32a6d3c | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int tt,n,x;cin>>tt;
ll q;
while(tt--)
{
ll ans=0;
vector<pair<ll,ll> >a;
cin>>n>>x;
for(int i=0;i<n;i++)
{
scanf("%lld",&q);
if(a.size())
{
if(a[a.size()-1].first==q) a[a.size()-1].second++;
else a.push_back({... | C++ | 09c8db43681d7bc72f83287897a62f3c | be26765152df940c674f28f51b746ba5 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
queue<ll> q;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin>>t;
while(t--){
int n,x;cin>>n>>x;
while(n--){
ll tmp;cin>>tmp;
q.push(tmp);
q.push(1);
}
ll ans=0;
bool f=1;
while(!q.empty()){
ll num=q.front()... | C++ | 09c8db43681d7bc72f83287897a62f3c | a37e2c3c5333a152c0dd5b44f9c37e2f | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t;
cin>>t;
while(t--)
{
long long n,x;
cin>>n>>x;
long long a[n],b[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
b[i]=a[i];
sum=sum+a[i];
}
int... | C++ | 09c8db43681d7bc72f83287897a62f3c | 2b7883dbca6f60fd3466f2d2dee2550e | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int t;
cin>>t;
while(t--)
{
ll n,x;
cin>>n>>x;
ll arr[n+1];
ll s=0;
for(ll i=0;i<n;i++)
{
cin>>ar... | C++ | 09c8db43681d7bc72f83287897a62f3c | 3c12154bde2b47c74b1c4d36a50bcafb | 1,100 | PASSED |
/**Bismillahir Rahmanir Rahim.**/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define Faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1)
#defin... | C++ | 09c8db43681d7bc72f83287897a62f3c | 46c8399fac70744384f650dcd554f4ea | 1,100 | PASSED |
#include <stdio.h>
int main ()
{
int t,n,a[100001],i;
long long x,sum,f;
scanf("%d",&t);
while(t--)
{
scanf("%d%lld",&n,&x);
f=1;sum=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
while(1)
{
for(i=0;i<n&&a[i]%f==0;i++)
{
sum+=a[i];
}
if(i<n)
{
break;
}
f=f*x;
}
printf... | C++ | 09c8db43681d7bc72f83287897a62f3c | a03789a5afbb2488e9f1846e2484335f | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int N=5e5+10;
int a[N],t[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n,x;
cin>>n>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
t[a... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 809d74eacd9de973d60212866453f2b9 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std ;
#define debug(a) cout << #a << " = " << a << endl;
namespace xm{
void Ios()
{
std::ios::sync_with_stdio(0);
std::cin.tie(0) ;
std::cout.tie(0) ;
}
} ;
using namespace xm ;
#define ll long long
const int N = 1e6 + 10 ;
ll a[N] , f[N] ;
ll b[N] ;... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 2861084826e9051520603f6ab1493a91 | 1,600 | PASSED |
#include<iostream>//改正1
using namespace std;//数组必须是全局变量，不然必定报错TAT
int a[500005];
int main(){
int n,x,m;
cin>>n>>x;
for(int i=1;i<=n;i++){
cin>>m;
a[m]++;
}
for(int i=1;i<x;i++){
if(a[i]%(i+1)!=0){
cout<<"No"<<endl;
return 0;
}
a[i+1]+=a[i]/(i+1);
}
cout<<"Yes"<<endl;
return 0;
... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 685619d43f172269165fdc9fda934221 | 1,600 | PASSED |
#include<iostream>//改正1
using namespace std;
int a[500005];
int main(){
int n,x,m;
cin>>n>>x;
for(int i=1;i<=n;++i){
cin>>m;
a[m]++;
}
for(int i=1;i<x;++i){
if(a[i]%(i+1)){
cout<<"No"<<endl;
return 0;
}
a[i+1]+=a[i]/(i+1);
}
cout<<"Yes"<<endl;
return 0;
} | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 4cbe4b9666446910950ab9f10f6da71a | 1,600 | PASSED |
#include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
const int N = 5e5 + 5;
int cnt[N];
int main() {
int n, x, a;
cin >> n >> x;
for(int i = 1; i <= n; ++ i){
cin >> a;
cnt[a] ++; //统计a的阶乘的个数
}
for(int i = 1; i < x; ++ i){
if(cnt[i] % (i+1)){ ... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 107ac745d5ec0af7e0cf210ec3e6e2da | 1,600 | PASSED |
# include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int a[N];
void solve(){
int n,k;
cin >> n >> k;
map<int,int> cnt;
for(int i=1;i<=n;i++){
cin >> a[i];
if(a[i] < k) cnt[a[i]]++;
}
for(int i=1;i<k;i++){
if(cnt[i]%(i+1)){
... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | cdeacdad2404ab2326e3dc29784ad899 | 1,600 | PASSED |
# include<iostream>
# include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int a[N];
void solve(){
int n,k;
cin >> n >> k;
map<int,int> cnt;
for(int i=1;i<=n;i++){
cin >> a[i];
if(a[i] < k) cnt[a[i]]++;
}
for(int i=1;i<k;i++){
if(cnt... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | d0f7a15b469f8e69b0d2f7a763476bb1 | 1,600 | PASSED |
# include<iostream>
# include<bits/stdc++.h>
using namespace std;
# define endl "\n"
const int N = 5e5 + 10;
int a[N];
void solve(){
int n,k;
cin >> n >> k;
map<int,int> cnt;
for(int i=1;i<=n;i++){
cin >> a[i];
if(a[i] < k) cnt[a[i]]++;
}
for(int i=1;i<k;i++... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | 6e2405ce10ac7ae2dec43d606e9d8a2d | 1,600 | PASSED |
# include<iostream>
# include<bits/stdc++.h>
using namespace std;
# define int long long
# define endl "\n"
const int N = 5e5 + 10;
int a[N];
void solve(){
int n,k;
cin >> n >> k;
map<int,int> cnt;
for(int i=1;i<=n;i++){
cin >> a[i];
if(a[i] < k) cnt[a[i]]++;
}
... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | c778ab760f01809c425b78fc72af0f35 | 1,600 | PASSED |
# include<iostream>
# include<bits/stdc++.h>
using namespace std;
# define int long long
# define endl "\n"
const int N = 5e5 + 10;
int a[N];
void solve() {
int n,k;
cin>>n>>k;
map<int,int> cnt; //计数
for(int i = 1;i <= n;++i){
cin>>a[i];
if(a[i]<k) cnt[a[i]]++;
}
for(int i = 1;i < k;++i){
... | C++ | c5ec8b18c39720098f6ac2dbc0ddd4f4 | b71e5dc55872b80365247bb7a068da52 | 1,600 | PASSED |
// Designed by Nguyen Thanh Chau
// a.k.a Paperback Collector
// En Taro Adun! - TemplarAssasin a.k.a Zeratul
//cout<<" :/+ossyyhhhhhhhhhhhhhhhhysooooooo+//:..` "<<endl;
//cout<<" `dNNy+/`--:/+oooyMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNho+/:.` ... | C++ | 54a3b38631ddc033597797263fd7fb22 | 8a269cfb6b0a03c8210420095d6edc35 | 1,500 | PASSED |
#include<cstdio>
using namespace std;
const int N=2e5+2;
int T,n,s,k,a[N],l[N],r[N];bool b[N];
int main(){
scanf("%d",&T);
while(T--){
scanf("%d",&n),s=0;
for(int i=1;i<=n;++i)
scanf("%d",a+i),s+=a[i],b[i]=0;
if(s&1){printf("-1\n");continue;}
s>>=1,l[1]=r[1]=k=1;
for(int i=2;i<=n;++i)
if(... | C++ | 54a3b38631ddc033597797263fd7fb22 | e7178883d5f9f1eea5b48e6e07493134 | 1,500 | PASSED |
#define local
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fori(i,n) for(ll i=0;i<n;i++)
#define ford(i,n) for(ll i = n-1;i >= 0;i--)
#define pb push_back
#define ll long long
#define mod 998244353
#define pi pair<int,int>
... | C++ | 54a3b38631ddc033597797263fd7fb22 | 8be221f9cd0c7490f1f50d2a1edb760b | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
static const int maxn = 200010;
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
static int a[maxn];
int cnt = 0;
for (int i = 1; i <= n; i++) scanf("%d", a + i), cnt += a[i] != 0... | C++ | 54a3b38631ddc033597797263fd7fb22 | c96f8c8f7041cfe619f9ef65de0a6d31 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define db double
ll i;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t;
cin >> t;
while (t--)
{
ll n, r;
cin >> n;
ll a[n];
for (i = 0; i < n; i++) cin >> a[i];
//if(n&1){cout<<"-1"<<end... | C++ | 54a3b38631ddc033597797263fd7fb22 | 028927f9fc85196516d56f2797e539f0 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define db double
ll i;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll t;
cin>>t;
while(t--){
ll n,r;
cin>>n;
ll a[n];
for(i=0;i<n;i++)cin>>a[i];
//if(n&1){cout<<"-1"<<endl;continue;}
vector<pair<ll,ll>>v,ans;
... | C++ | 54a3b38631ddc033597797263fd7fb22 | 048810a4dc296ed7124b7ea34046965d | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
int ctm=0;
int ctp=0;
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
if(a[i]==1){
ctp++;
}
else if(a[i]... | C++ | 54a3b38631ddc033597797263fd7fb22 | cf363712ffdf58a86bbd1b60ea91afa0 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
int ctm=0;
int ctp=0;
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
if(a[i]==1){
ctp++;
}
else if(a[i]... | C++ | 54a3b38631ddc033597797263fd7fb22 | 8bddbdd6d974a00558c94fdeb00b959a | 1,500 | PASSED |
#include<set>
#include<map>
#include<cmath>
#include<stack>
#include<array>
#include<queue>
#include<bitset>
#include<vector>
#include<string>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int mod = 1e9 + 7;
long long poww(long long a , lo... | C++ | 54a3b38631ddc033597797263fd7fb22 | e32ba836f7ee432c51b68c12cc637487 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mk make_pair
#define ll long long
#define f first
#define s second
int X[4] = {0, 0, 1, -1};
int Y[4] = {1, -1, 0, 0};
#define inf 9223372036854775807
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ... | C++ | 54a3b38631ddc033597797263fd7fb22 | ef51dc6dfd1d7f34f3c1d0280e5cdca9 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> ii;
typedef vector<lli> vi;
#define all(x) begin(x), end(x)
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define pb push_back
int main() {
ios_base... | C++ | b87a90f2b4822e59d66b06886a5facad | ac31f71e3cecd46a84784dbe40744ec9 | 1,300 | PASSED |
//in the name of god
// eks
// f = m . a
// mamad dar kamin ast!!!!
// hashtag na b danesh amoz azari
// asghar dar kamin ast!!!!
// asghar dar ke nar mansor dar kamin ast!!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
usin... | C++ | b87a90f2b4822e59d66b06886a5facad | 2353a913dff0e7b4fd3a884a294a2ba1 | 1,300 | 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;
//datatype snippets
typedef long long ll;
typedef long double ld;
//stl snippets
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<long long> vll;
typede... | C++ | b87a90f2b4822e59d66b06886a5facad | 26ebb560aca3fbe1992642dab1685d21 | 1,300 | PASSED |
#include <iostream>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <fstream>
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define pop pop_b... | C++ | b87a90f2b4822e59d66b06886a5facad | 755cf0a56db56d7ed604c27c25319163 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void xw()
{
int n; cin>>n;
vector<int> a(n+10);
for(int i=1;i<=n;i++) cin>>a[i];
if(n&1)
{
cout<<-1<<endl;
return;
}
vector<pair<int,int>> v1;
v1.clear();
for(int i=1;i<=n;i+=2)
{
if(a[i]==a[i... | C++ | b87a90f2b4822e59d66b06886a5facad | b51c96af865d8fd4065b14d26cf3358d | 1,300 | PASSED |
#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
#include<algorithm>
#include<cmath>
#include<unordered_set>
#include<unordered_map>
#include<numeric>
#include<queue>
#include<unordered_set>
#define endl '\n'
#include<stack>
#include<sstream>
#include<map>
#define EPS 1e-6
#def... | C++ | b87a90f2b4822e59d66b06886a5facad | 96149e031ec2372f3c112218c5165e49 | 1,300 | PASSED |
//
// Created by tyj_lpc on 22-11-9.
//
#include<iostream>
using namespace std;
#include<bits/stdc++.h>
#include<stdio.h>
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define eb emplace_back
#define LL long long
//2D prefix, AC
#ifndef MYSELF
int a[20... | C++ | b87a90f2b4822e59d66b06886a5facad | a1e61323fcb3ea91da3d6d030d7f5b41 | 1,300 | PASSED |
//
// Created by tyj_lpc on 22-11-9.
//
#include<iostream>
using namespace std;
#include<bits/stdc++.h>
#include<stdio.h>
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define eb emplace_back
#define LL long long
//2D prefix, AC
#ifndef MYSELF
int a[20... | C++ | b87a90f2b4822e59d66b06886a5facad | 9859a23e99e4356d5c33621fe46ea8a8 | 1,300 | PASSED |
//
// Created by tyj_lpc on 22-11-9.
//
#include<iostream>
using namespace std;
#include<bits/stdc++.h>
#include<stdio.h>
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define eb emplace_back
#define LL long long
//2D prefix, AC
#ifndef MYSELF
int a[20... | C++ | b87a90f2b4822e59d66b06886a5facad | 4844508edae2b1c8638911d44a247d42 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define int long long int
#define endl '\n'
using namespace std;
int32_t main()
{
int t,n,j,x,y,z,m,k,i,all,ans;
cin>>t;
while(t--)
{
cin>>n;
int a[n+1],b[n+1];
for(i=0;i<n;i++)
{
cin>>a[i];
}
if(n%2==1... | C++ | b87a90f2b4822e59d66b06886a5facad | 3eff99888419f020dc462e55e01633fb | 1,300 | PASSED |
// LUOGU_RID: 94005575
#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<3)+(x<<1)+(c-'0');
c=getchar();
}
return x*f;
}
const int MAXN=2e... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | 35888023e656f29a5e77fd7160a82a5f | 3,300 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<3)+(x<<1)+(c-'0');
c=getchar();
}
return x*f;
}
const int MAXN=2e6+10;
int n,m,B,p,T=1,... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | f87a69d2602705d31aa4a603064d25af | 3,300 | PASSED |
// LUOGU_RID: 93906835
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pii;
#define ci const int
template <class T>
inline void chmax(T &x, const T &y) { if(x < y) x = y; }
template <class T>
inline void chmin(T &x, const T ... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | 9bfc7e1a93fcea5c142c151fa8e0fa1d | 3,300 | PASSED |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pii;
#define ci const int
template <class T>
inline void chmax(T &x, const T &y) { if(x < y) x = y; }
template <class T>
inline void chmin(T &x, const T &y) { if(x > y) x = y; ... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | 24d9de7caad2170d3589c16dc414ebee | 3,300 | PASSED |
// LUOGU_RID: 94008499
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+7;
struct node{
int id;
ll k;
node(int id=0,ll k=0):id(id),k(k){}
}a[N];
ll n,x,tot,cnt,b,p,m,ans;
ll pos[41],s[41],mul[41],mm[41];
bool vis[41];
vector<ll>vec[41],sum[41];
ll chk(ll lim){
ll res=0... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | c0f31f3f8fa4b0153af22bb35b1cc354 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+7;
struct node{
int id;
ll k;
node(int id=0,ll k=0):id(id),k(k){}
}a[N];
ll n,x,tot,cnt,b,p,m,ans;
ll pos[41],s[41],mul[41],mm[41];
bool vis[41];
vector<ll>vec[41],sum[41];
ll chk(ll lim){
ll res=0;
for(ll i=1;i<=cnt;+... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | 3cc3dc41c8e50ad59c2605b21d0d33d6 | 3,300 | PASSED |
// LUOGU_RID: 93668867
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
using namespace std;
struct node
{
vector<long long> a,sum;
long long mul,val;
}g[30+5];
int opt[1000000+5... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | 3dd434ec511e06d5e3c7fa329d088634 | 3,300 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
using namespace std;
struct node
{
vector<long long> a,sum;
long long mul,val;
}g[30+5];
int opt[1000000+5],a[10... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | f9ffe67aca0031c26780565bdaa10180 | 3,300 | PASSED |
// LUOGU_RID: 92492771
#include<bits/stdc++.h>
#define rep(i,p,q) for (int i=(p);i<=(q);i++)
#define pre(i,p,q) for (int i=(p);i>=(q);i--)
#define ll long long
#define pb push_back
using namespace std;
const int N=1e6+5; map<ll,ll>mp;
ll n,m,M,X,Y,S=1,T=1,sum,cnt,a[N],v[N]; vector<ll>p[105],q[105],f[105];
ll ... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | ec4af7fd8a67d1394fbd788e6967a961 | 3,300 | PASSED |
// LUOGU_RID: 92407582
#include<bits/stdc++.h>
#define rep(i,p,q) for (int i=(p);i<=(q);i++)
#define pre(i,p,q) for (int i=(p);i>=(q);i--)
#define ll long long
#define pb push_back
using namespace std;
const int N=1e6+5; map<ll,ll>mp;
ll n,m,M,X,Y,S=1,T=1,sum,cnt,a[N],v[N]; vector<ll>p[105],q[105],f[105];
ll ... | C++ | d5be4e2cd91df0cd8866d46a979be4b1 | e219b51e355a92b7edd495bec2abcbee | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
const ll INF = numeric_limits<ll>::max();
vector<vector<vecto... | C++ | 35b9acbe61226923a0c45452f23166c8 | 3d65fe5d6f420934956f2d104851b1ba | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
const ll INF = numeric_limits<ll>::max();
vector<vector<vecto... | C++ | 35b9acbe61226923a0c45452f23166c8 | 8e652e33a3b8eb8bf0ec9881625e613b | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
const ll INF = numeric_limits<ll>::max();
vector<vector<vecto... | C++ | 35b9acbe61226923a0c45452f23166c8 | 7615af39a576c2bea9fbe2c08a04ed1e | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
vector<vector<vector<array<ll, 3>>>> adj;
int main() {
ios::... | C++ | 35b9acbe61226923a0c45452f23166c8 | 541f69960d2c32160fe73d6086f5c706 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
vector<vector<vector<array<ll, 3>>>> adj;
int main() {
ios::... | C++ | 35b9acbe61226923a0c45452f23166c8 | e5d9f9f74f23ea85a6a2ecc75c1d100f | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void ins(int& num) {
cout << num << " " << &num << endl;
}
vector<string> field;
int n, m;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m && field[i][j] != '#';
}
map<array<int, 2>, vector<array<ll, 3>>> adj;
int main() {
i... | C++ | 35b9acbe61226923a0c45452f23166c8 | 55d21b974967fcae5e7011d1fe083b92 | 2,400 | PASSED |
#include<map>
#include<ctime>
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<random>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
#define I inline ll
#define her1 20090115
#define IV inli... | C++ | 35b9acbe61226923a0c45452f23166c8 | 20070cae50ee92bfe7da1894a0d13cf9 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 300005
#define int long long
#define F(i,l,r) for(int i=(l);i<=(r);++i)
#define D(i,r,l) for(int i=(r);i>=(l);--i)
#define MEM(x,a) memset(x,a,sizeof(x))
int I(){int x=0,f=0;char c=getchar(); while(!isdigit(c))f=(c=='-'),c=getchar(); while(isdigit(c))x=x*10+c-'0'... | C++ | 35b9acbe61226923a0c45452f23166c8 | fdbeb208df4368fff6cae88cf16c1ce9 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 300005
#define int long long
#define INF 0x3f3f3f3f3f3f3f3fll
#define F(i,l,r) for(int i=(l);i<=(r);++i)
#define D(i,r,l) for(int i=(r);i>=(l);--i)
#define MEM(x,a) memset(x,a,sizeof(x))
int I(){int x=0,f=0;char c=getchar(); while(!isdigit(c))f=(c=='-'),c=getchar... | C++ | 35b9acbe61226923a0c45452f23166c8 | 9aa15e74feaffe0e6825e802ff6ddcf7 | 2,400 | PASSED |
// Author:A weak man named EricQian
// Attention:Check your code while coding!
#include<bits/stdc++.h>
using namespace std;
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define eb emplace_back
#define pa pair<int,int>
#define fi first
#define se second
typedef long long ll;
inline ll maxll(ll x,ll y... | C++ | 35b9acbe61226923a0c45452f23166c8 | 84510a65fabfe3ffc09842c98a69a3d8 | 2,400 | PASSED |
// LUOGU_RID: 92773143
#include <cstdio>
#include <bitset>
#include <vector>
#define pragma GCC optimize(2,3,"Ofast")
#define gec (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<18,stdin)),p1==p2?EOF:*p1++)
using namespace std;
char buf[1<<18],*p1=buf,*p2=buf;
int read(){
char c=gec;int x=0;bool f=0;
while(c<48||c>57) f|=(c=='-... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 25dbb9b8db1eebaa3b2f28d16a382647 | 3,500 | PASSED |
#include <cstdio>
#include <bitset>
#include <vector>
#define pragma GCC optimize(2,3,"Ofast")
#define gec (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<18,stdin)),p1==p2?EOF:*p1++)
using namespace std;
char buf[1<<18],*p1=buf,*p2=buf;
int read(){
char c=gec;int x=0;bool f=0;
while(c<48||c>57) f|=(c=='-'),c=gec;
do... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 61c07b3462c4a882a02a93319403095a | 3,500 | PASSED |
#include <cstdio>
#include <bitset>
#include <vector>
#define pragma GCC optimize(2,3,"Ofast")
#define gec (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<18,stdin)),p1==p2?EOF:*p1++)
using namespace std;
char buf[1<<18],*p1=buf,*p2=buf;
int read(){
char c=gec;int x=0;bool f=0;
while(c<48||c>57) f|=(c=='-'),c=gec;
do... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 476c7a2099fe5a2da133ca325e003fcc | 3,500 | PASSED |
#include <cstdio>
#include <bitset>
#include <vector>
#define pragma GCC optimize(2,3,"Ofast")
#define gec (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<18,stdin)),p1==p2?EOF:*p1++)
using namespace std;
char buf[1<<18],*p1=buf,*p2=buf;
int read(){
char c=gec;int x=0;bool f=0;
while(c<48||c>57) f|=(c=='-'),c=gec;
do... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 2c3f0c21e69e186fa5c3aa36c93ab33a | 3,500 | PASSED |
#include <cstdio>
#include <bitset>
#include <vector>
#define gec (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<18,stdin)),p1==p2?EOF:*p1++)
using namespace std;
char buf[1<<18],*p1=buf,*p2=buf;
int read(){
char c=gec;int x=0;bool f=0;
while(c<48||c>57) f|=(c=='-'),c=gec;
do x=(x<<1)+(x<<3)+(c^48),c=gec;
while(c>=... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | f29c7201d5d8f8e113e070cbedca0d36 | 3,500 | PASSED |
// LUOGU_RID: 92416628
#include<bits/stdc++.h>
using namespace std;
namespace IO
{
bool EOFstate = 0;
template<typename T>inline void read(T& x)
{
x = 0; int f = 1; char c = getchar();
while(('0' > c || c > '9') && !EOFstate) { if(c == '-')f = -1; c = getchar(), EOFstate = c == EOF; }
while('0' <= c &... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 0108a5a9e5461cdd84238070559626c2 | 3,500 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define pbc push_back
#define pob pop_ba... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 51eb369b8352e2accd21d0bcb808589e | 3,500 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define pbc push_back
#define pob pop_ba... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 3b21cb2892d2c9cef8c760434decf4d9 | 3,500 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define pbc push_back
#define pob pop_ba... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | 5287d9ed56d90505d5e8b06ca391b3f3 | 3,500 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define pbc push_back
#define pob pop_ba... | C++ | d170fcd50b6cb0d2a534255d03a9f3ad | aa7ac39dfd4814dd886496f846ac0c9c | 3,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | 196537ae4fca21c18c7b2015dbe058e2 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | 1473f349c9574457237e311a71dcd5af | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | 6e3e5b13b679d537225c33e35583d9f8 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | 4c2ba4d964e7bb575aaa9dade5a155ba | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | adfcc047a3b9889dbe58913e8e6d520d | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 998244353;
int T;
ll n;
int s[200010];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void sol() {
... | C++ | 2b391638a9fea31986fe8e41c97b640a | 914eab77f04ad3f2d00b1446edb99843 | 2,000 | PASSED |
//g++ -std=c++17 -Wl,--stack,268435456 Ahoyy.cpp -o Ahoyy.exe
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#... | C++ | 2b391638a9fea31986fe8e41c97b640a | fbe250e68bfe59e97f4583dfab3841b6 | 2,000 | PASSED |
//g++ -std=c++17 -Wl,--stack,268435456 Ahoyy.cpp -o Ahoyy.exe
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#... | C++ | 2b391638a9fea31986fe8e41c97b640a | ec3f67eec6256be89ef7d150188f6ec4 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int maxn= 2e6+10;
const int mod= 998244353;
#define ll long long
ll ans[maxn];
ll ans1[maxn];
ll dp[maxn];
int a[maxn];
ll fpow(ll b,ll p){
ll r = 1;
while(p){
if(p&1){
r = r*b%mod;
}
p>>=1... | C++ | 2b391638a9fea31986fe8e41c97b640a | 9a6e1122c657ff2bb918dd92bae66d6b | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int maxn= 2e6+10;
const int mod= 998244353;
#define ll long long
ll ans[maxn];
ll ans1[maxn];
ll dp[maxn];
int a[maxn];
ll fpow(ll b,ll p){
ll r = 1;
while(p){
if(p&1){
r = r*b%mod;
}
p>>=1... | C++ | 2b391638a9fea31986fe8e41c97b640a | 637309b061de2af865875f40eb7416b3 | 2,000 | PASSED |
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
char a[1001000];
char b[1001000];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
scanf("%s %s",a,b);
int kk=0;
// int len1=strlen(a);
ll sum1=0,s... | C++ | ff95cd4632b2ddf8bb54981634badcae | 717884b94917ee6b7c6f4b995283d4b2 | 1,200 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.