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 rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k; cin >> n >> k;
vector<int> a(n, 0);
rep (i, n) cin >> a[i];
if (n == 1){
co... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | c4c895622b965ec99cbaf56626a6d6a2 | 1,000 | PASSED |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typede... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 39f9d4f9b922d71894eabc7214a74b49 | 1,000 | PASSED |
#include <iostream>
using namespace std;
int main() {
long long n,k,sum=0,result=0;
cin>>n>>k;
long long a[n+1];
for(long long i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
for(long long i=2;i<=n;i++){
if(a[i]+a[i-1]<k) {
result+=k-a[i]-a[i-1];
a[i]+=k-a[i]-a[i-1];
}
}
cout<<result<<endl;
for(long long... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 1fac6f62e4134138265d02a88bc4ba48 | 1,000 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<ctype.h>
#include<stdlib.h>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include<queue>
#include<vector>
#include<algorithm>
#include<bitset>
#includ... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 95e36efeb3bd8e61dcf1dd8a6c4105c7 | 1,000 | PASSED |
#include<stdio.h>
int n,a[1000],ans,k;
int main()
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
/*if(n==1)
{
if(a[1]<k)printf("%d\n%d",k-a[1],k);
else printf("%d\n%d",ans,a[1]);
return 0;
}
else
{*/
for(int i=2;i<=n;i++)
{
if(a[i]+a[i-1]<k)
{
ans+=k-(a[i]+a[i-1]);
a[i]... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | be39f32cf989ee8ac062301152f9e1bf | 1,000 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define LL long long
#define mem0(x) memset(x,0,sizeof(x))
#define REP(i,x,y) for (int i=x;i<=y;i++)
#define REPI(i,n) for (int i... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 1dce4a474a5714a522c00f98383dc18b | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int *a = new int[n];
for(int i = 0; i < n; i++)
{
cin>>a[i];
}
int minday = 0;
for(int i = 1; i < n; i++)
{
int tmp = a[i];
a[i]+=max(0,k-a[i]-a[i-1]);
minday+=a[i]-tmp;
}
cout<<minday<<endl;
for(int i = 0; i < n; i++)
{
... | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 77ae115e611343689f686abe5282a602 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,c=0,i;
cin>>n>>k;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n-1;i++)
if(a[i]+a[i+1]<k)
{
c+=k-a[i]-a[i+1];
a[i+1]=k-a[i];
}
cout<<c<<endl;
for(i=0;i<n;i++)
cout<<a[i]<<" ";
return 0;
} | C++ | 1956e31a9694b4fd7690f1a75028b9a1 | 126e7e3bfdf9e5350900f8152483b11f | 1,000 | PASSED |
#include<cstdio>
#include<cstring>
using namespace std;
bool maze[205][205];
int deg[205], mdeg[205];
bool vis[205];
int r[205];
int main(){
int n;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d", &r[i]);
r[i]--;
}
memset(maze, false, sizeof(maze));
memset(deg, 0, sizeof... | C++ | be42e213ff43e303e475d77a9560367f | 025bb889640aea776acf653ab2b2b3a2 | 1,700 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <memory.h>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <string.h>
#include <string>
#include <ctype.h>
#include <ctime>
#include <bitset>
#include <vector>
#include <cassert>
using namespace std;
#define eprintf(...) fprint... | C++ | be42e213ff43e303e475d77a9560367f | 16836bb42bc417ebfb884b9fe08fb2f9 | 1,700 | PASSED |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <tr1/unordered_map>
#include <tr1/unordered_set>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cl... | C++ | be42e213ff43e303e475d77a9560367f | a5067a640eaec399ab445fcdc51b01c5 | 1,700 | PASSED |
// Vishal Gupta IIIT-H
#include <bits/stdc++.h>
using namespace std;
#define sz(a) int((a).size())
#define all(c) c.begin(),c.end() //all elements of a container
#define rall(c) c.rbegin(),c.rend()
#define tr(container,it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++) //traversin... | C++ | be42e213ff43e303e475d77a9560367f | d0af5ff54dfbfc5c7cc53c8965d388c9 | 1,700 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
int comp[222], n, before[222], k;
vector<int> dpnd[222];
int solve(int curr) {
int bfr[222], done = 0, ret = 0;
for (int i = 1; i <= n; ++i)
bfr [i] = before[i];... | C++ | be42e213ff43e303e475d77a9560367f | 7cfa64ce537e64f1b47f63d841bc0777 | 1,700 | PASSED |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 100005
#define Long long long
#define For(i,l,r) for(int i=l;i<=r;i++)
using namespace std;
int next[N],son[N],ed[N],cnt;
void link(int x,int y){next[++cnt]=son[x]; son[x]=cnt; ed[cnt]=y;}
int st,en,q[N],n,sum,Ret,Ans;
int vis[N],du[N],b... | C++ | be42e213ff43e303e475d77a9560367f | 4d6825684e652683682e008eb911fa70 | 1,700 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#define sc scanf
#define pr printf
#define fi first
#define se second
#define pb push_back
#define p_b pop... | C++ | be42e213ff43e303e475d77a9560367f | 6e859d0d3cf17c398f676121445172be | 1,700 | PASSED |
# include <stdio.h>
# include <string.h>
int n,end;
int n1[250];
bool vis1[250];
int ans=0;
struct bet
{
int len;
bool vis[250];
};
bet f[250],f1[250];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&n1[i]);
for (int i=1;i<=n;i++)
{
scanf("%d",&f[i].len);
for (int j=0;j<f[i].len;... | C++ | be42e213ff43e303e475d77a9560367f | 0b490a456e1cd2415db82fe50010d4e5 | 1,700 | PASSED |
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N, A[202];
vector<int> V[202];
int grad[202], fgrad[202];
bool S[202];
int result = 0x3f3f3f3f;
int main()
{
cin >> N;
for (int i = 1; i <= N; ++i)
cin >> A[i];
for (int i = 1, size; i <= N; ++i)
{
cin >> s... | C++ | be42e213ff43e303e475d77a9560367f | 559dada55883f674bf2e6cc752e9aa5a | 1,700 | PASSED |
/*
Author : OmarEl-Mohandes
PROG : C
LANG : C++
*/
#include <map>
#include <string>
#include <deque>
#include <queue>
#include <stack>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <vector>
#include <set... | C++ | be42e213ff43e303e475d77a9560367f | d1b5202599a8ca744a4015fcd0d42966 | 1,700 | PASSED |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void solve(){
int n;
cin >> n;
char s[1010];
scanf("%s",s+1);
int ans = n;
for(int i = 1;i<=n;i++){
if(s[i]=='1'){
ans = max(ans,max(2*i,2*(n-i+1)));
}
}
cout ... | C++ | 23575500451a061ed498468f3814c38a | 8cac60013f8596613b860786105ced50 | 1,000 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cctype>
#include<cmath>
#define ll long long
#define I inline
using namespace std;
ll t;
ll len;
ll ans;
string s;
b... | C++ | 23575500451a061ed498468f3814c38a | 2ead459c5113c1918f1021a5db054b76 | 1,000 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cctype>
#include<cmath>
#define ll long long
#define I inline
using namespace std;
ll t;
ll len;
ll ans;
string s... | C++ | 23575500451a061ed498468f3814c38a | 90d92ea0796b61510ff14952467ba86e | 1,000 | PASSED |
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <climits>
using namespace std;
#define ll long long
int n;
int main()
{
int t;
cin>>t;
while(t--)
{
int lateststair=0, early=n;
bool n... | C++ | 23575500451a061ed498468f3814c38a | 65fd1606c596dcaf569cf6e89f369400 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n,t;
string s;
cin>>t;
while(t--){
long dem=0;
long k=0;
cin>>n>>s;
for(long i=0;i<n;i++){
if(s[i]=='1'){
k=max(k,max(i+1,n-i));
... | C++ | 23575500451a061ed498468f3814c38a | 677bdedcd8f3b777187b984b79c83321 | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
void test(){
vector<int> vect;
int n;
string str;
cin >> n;
cin >> str;
for(int i=0;i<str.size();i++){
if(str[i] == '1'){
vect.push_back(i);
}
}
if(vect.size() == 0)... | C++ | 23575500451a061ed498468f3814c38a | 46cf0980d2f6407e0d4721ce14247176 | 1,000 | PASSED |
// https://codeforces.com/problemset/problem/1244/B
#include <iostream>
#include <vector>
std::vector<bool> reverse(std::vector<bool> v){
std::vector<bool> o;
for(auto it = v.rbegin(); it != v.rend(); ++it) o.push_back(*it);
return o;
}
inline int max(int a, int b){
return (a > b ? a : b);
}
int solve(std::... | C++ | 23575500451a061ed498468f3814c38a | 899868f6d08af70b9e4999ec5f99248e | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int q;
cin>>q;
for(int qq=0;qq<q;qq++){
int n;
cin>>n;
int res1=-1,res2=-1;
for(int i=0;i<n;i++){
char x;
cin>>x;
if(res1==-1 && x=='1') res1=i;
if(x... | C++ | 23575500451a061ed498468f3814c38a | 933bc86ec326f9436cc9b892fc53397c | 1,000 | PASSED |
#include <bits/stdc++.h>
#define ld long double
#define ll long long
#define ull unsigned long long
#define F first
#define S second
#define nl cout << endl
#define pii pair <ll, ll>
#define pb push_back
#define mp make_pair
#define pi 3.14159265358979323846264
#define y1 abacaba
#define fn "abc"
#define sz(a) (int)(a... | C++ | 23575500451a061ed498468f3814c38a | 20e62a823ec0eef814d6dba5dc42b9f1 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int t;
cin >> t;
for (int z = 1; z <= t; z++) {
int n;
string s;
cin >> n >> s;
int cnt = 0;
bool isDone = 0;
int cnt1 = 0;
for (int i = 0; i... | C++ | 23575500451a061ed498468f3814c38a | 79fdd3f3e88e59a90e4687ddd91c9c4d | 1,000 | PASSED |
#include <iostream>
using namespace std;
string gs,s,s2;
int n,fr[28],ok,c;
int main()
{
cin >> gs;
for(int i = 0; i < gs.size(); i++)
fr[gs[i]-'a']=1;
cin >> s;
for(int i = 0 ;i <s.size(); i++)if(s[i]=='*')c = 1;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> s2;
i... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 506809d8680bdbf1801005e7cf4e30c5 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
int n;
while(cin>>a>>b>>n){
for(int j=1;j<=n;j++){
cin>>c;
int lb=b.length();
int lc=c.length();
if(b.find('*')==-1){
if(lb!=lc){
cout<<"No"<<endl;
continue;
}
else{
int t=0;
for(int i=0;i<lb;i++){
... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 3ea5bf955727c81cd4ffb5ac55aeaacf | 1,600 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <set>
#define MAX(x,y) ((x)>(y)?(x):(y))
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MS(a) memset(a,0,sizeof(a))
#define MS1(a) me... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | c7dad816d645047e5bbaa1c49cbffe3b | 1,600 | PASSED |
#include<iostream>
#include<cmath>
#include<cstring>
char asc[30],f[100010],g[100010];
using namespace std;
int main()
{
memset(f,0,sizeof(f));
static int ascl[150];
int n,flag=0,dd;
cin>>asc;
for(int i=0;i<strlen(asc);i++)
ascl[asc[i]]=1;
cin>>f;
for(int i=0;i<strlen(f);i++)
{
... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 010d84003f2eb58bc84ea9153e569452 | 1,600 | PASSED |
#include<iostream>
#include<cmath>
#include<cstring>
char asc[30],f[100010],g[100010];
using namespace std;
int main()
{
memset(f,0,sizeof(f));
static int ascl[150];
int n,flag=0,dd;
cin>>asc;
for(int i=0;i<strlen(asc);i++)
ascl[asc[i]]=1;
cin>>f;
for(int i=0;i<strlen(f);i++)
{
... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | b296b5ecc3137f55135d50afbd295812 | 1,600 | PASSED |
#include<bits/stdc++.h>
#define INF 1e9
#define ld long double
#define lli long long int
#define PI acos(-1)
#define read freopen("in.txt","r",stdin)
#define uu first
#define vv second
#define write freopen("out.txt","w",stdout)
#define pii pair<int,int>
using namespace std;
string gd,str,a... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 0acc1d8783f8a386098de37a8a91c394 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define maxn 100010
#define inf 0x3f3f3f3f
#define REP(i,x,y) for(int i=x;i<(y);i++)
#define RREP(i,x,y) for(int i=x;i>(y);i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
string s,good;
int ma[30];
int main()
{
//ios::sync_with_stdio(false);
cin>>good;
REP... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 6b7a5cf074a9284b5f7dc31abce998ae | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string t,pat; char x=' ';
int i,j,q,p,tl,inc;
bool com;
map<char,int> good,bad;
for(x='a';x<='z';x++)bad[x]++;
cin>>t>>pat>>q;
p=pat.length();
for(i=0;i<t.length();i++)good[t[i]]++,bad[t[i]]--;
for(i=0;i<q&&cin>>t;i+... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 9fef8fde8e01087375b26063314be2d6 | 1,600 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
/*#include <sstream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include<climits>
#include <bitset>
#include <ctime>
#include <cassert>
#include <functional>
#include <iomanip>
... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | 79d742836b30bdc9f5f23d82de6d3ea9 | 1,600 | PASSED |
#include<stdio.h>
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MEM(a,x) memset(a,x,sizeof(a))
#define lowbit(x) ((x)&-(x))
using namespace std;
const int inf = 1e9+7;
const int N = 1e5 + 50;
bool good[26];
char str[N];
char p[N];
int len;
int vis[N];
bool sta... | C++ | c6633581d7424d670eaa0f8a5c8cc366 | db043be34c439172a6f067eb72cf83be | 1,600 | PASSED |
k=int(input())
for i in range(k):
L,v,l,r=map(int,input().split())
print(L//v-r//v+(l-1)//v)
| Python | 5194846a503c2087fcd299eaf3c20b2b | 7fc90e9ba212b7b1be08761eda5855bc | 1,100 | PASSED |
t_ = list(map(int, input().split(sep=' ')))
t = t_[0]
for i in range(t):
L, v, l, r = list(map(int, input().split(sep=' ')))
num = L//v
not_seen = (r//v) - (l//v)
if(l%v==0):
not_seen+=1
print(str(num-not_seen)) | Python | 5194846a503c2087fcd299eaf3c20b2b | 29bad5b93387dcca9b9e9568bbd05933 | 1,100 | PASSED |
for x in range(int(input())):
a = list(map(int, input().split()))
print(((a[2] - 1) // a[1]) + ((a[0] - a[3] + (a[3] % a[1])) // a[1])) | Python | 5194846a503c2087fcd299eaf3c20b2b | 058779c7289e6fa41b0259912111ff41 | 1,100 | PASSED |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Wed Nov 14 13:35:44 2018
@author: abhinavvajpeyi)
"""
def search(l,h,v):
if l%v==0:
return ((h//v)-(l//v)+1)
return ((h//v)-(l//v))
n=int(input())
while n:
d,v,l,r=input().strip().split(' ')
d=int(d)
v=int(v)
l=int(l)
r=i... | Python | 5194846a503c2087fcd299eaf3c20b2b | 86602838a8182335d2f4ec59143ef940 | 1,100 | PASSED |
t=int((input()))
while(t):
L,v,l,r=map(int,input().split())
if(v==0):
print("0")
else:
L = L // v
if (l % v == 0):
l = l // v
r = r // v
r += 1
else:
l = l // v
r = r // v
print(L + l - r)
t = t - 1
| Python | 5194846a503c2087fcd299eaf3c20b2b | 36ae40ae21fd2b9f18ca855048215351 | 1,100 | PASSED |
t = int(input())
for _ in range(t):
L,v,l,r = map(int,input().split())
mod = l%v;
if(mod == 0):
print(L//v - (r - l) //(v) - 1)
else:
print(L//v - (r-l+mod)//v)
| Python | 5194846a503c2087fcd299eaf3c20b2b | 9933253e6b21f9039152676750241228 | 1,100 | PASSED |
n = int(input())
def func(a, b, c ,d):
res = a//b-(d//b-(c-1)//b)
return res
for i in range(n):
L, v, r, l = list(map(int, input().split()))
print(func(L, v, r, l)) | Python | 5194846a503c2087fcd299eaf3c20b2b | 2214652749f1a8a99164c6d44c57cda7 | 1,100 | PASSED |
#!/usr/bin/env python
t = input()
for line in range(int(t)):
numbers = input().split()
L = int(numbers[0])
v = int(numbers[1])
l = int(numbers[2])
r = int(numbers[3])
totalLanterns = L//v
trainLanterns = (r//v) - ((l-1)//v)
p = totalLanterns - trainLanterns
print(p)
| Python | 5194846a503c2087fcd299eaf3c20b2b | 48bbd997da64de6e814045599b54224d | 1,100 | PASSED |
t = int(input())
for t_itr in range (t):
pqrs = input().rstrip().split()
p = int(pqrs[0])
q = int(pqrs[1])
r = int(pqrs[2])
s = int(pqrs[3])
lantern = (p // q) - (s // q) + ((r - 1) // q)
print(lantern) | Python | 5194846a503c2087fcd299eaf3c20b2b | f39f8a4e3ec66463de753cc0b185e54f | 1,100 | PASSED |
def countDiv(A, B, M):
if (A % M == 0):
return ((B //M) - (A //M)) + 1
return ((B //M) - (A //M))
for i in range(int(input())):
n,m,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
print(countDiv(1,l-1,m)+countDiv(r+1,n,m)) | Python | 5194846a503c2087fcd299eaf3c20b2b | ba69dba6f77f848d8df4fea5b83df6f6 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define pb push_back
#define fl(i,a,b) for(ll i=a;i<b;i++)
#define flr(i,a,b) for(ll i=a;i>b;i--)
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define keep_unique(v) sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | b33411799868a566525910e8ebf8c653 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define llu unsigned long long int
#define scll(x) scanf("%lld",&x)
#define scld(x) scanf("%lf",&x)
#define scull(x) scanf("%llu",&x)
#define scch(x) scanf(" %c",&ch)
#define Pi acos(-1.0)
#define MEM(a,b) memset(a,b,sizeof(a))... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | 40270ce838437a0d52185b0869519cde | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n,a[400005];
int main() {
ios::sync_with_stdio(false);
int T; cin>>T;
while (T--) {
cin>>n;
for (int i=1; i<=n; i++) cin>>a[i];
int half = n/2, las = a[half+1];
while (a[half]==las) half--;
int diff=0,p[200005],me[4]={0};
for (int i=1; i<=half; i++)
if... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | c22ef1bec964e307254cb5fdb87d0f0c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long n,t,x;
struct node {
long long s;
long long b;
}a[1000001];
bool cmp(node p,node q)
{
return p.b<q.b;
}
map<long long ,long long>m;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
m.clear();
int k=0;
for(int i=1;i<=n;i++)
{
cin>>x;
if(m[x]==0)
{... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | 05c6c78fcc52b0e04e5b4d6f793305aa | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
vector<ll> a(n);
for(ll i=0;i<n;i++)
{
cin>>a[i];
}
ll b[3]={0,0,0};
ll k=0;
ll cnt=0;
b[0]++;
... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | cace99434e22247e8f6139c98c705d49 | 1,500 | PASSED |
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 400005;
int sorce[maxn];
int main()
{
int cases,m;
int ans[3];
cin >> cases;
while (cases--) {
int n;
cin >> n;
map<int,int>mp;
for(int i=0;i<3;i++) ans[i] = 0;
for (int i=... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | c9ba1ffa54a50c87efb409635af497dd | 1,500 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define sc scanf
#define ls rt << 1
#define rs ls | 1
#define Min(x, y) x = min(x, y)
#define Max(x, y) x = max(x, y)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define MEM(x, b) memset(x, b, sizeof(x))
#define lowbit(x) ((x... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | cb4f8c5d13d452dedd4b6c967c5cd86b | 1,500 | PASSED |
//#define LOCAL
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <math.h>
#include <string.h>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <bitset>
#include <iterat... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | f1644fbc4969058c0473a7d151870cbd | 1,500 | PASSED |
#include<iostream>
using namespace std;
int main(){
int m,n,lim;
cin>>m;
while(m--){
cin>>n;
int sc[400000];
for (int i =0;i<n;i++)
cin>>sc[i];
lim=n/2;
while (lim>0&&sc[lim-1]==sc[lim])
lim--;
int g=1,c;
while(g<n-1&&sc[g]=... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | 6327750c28a337587da9fffa55f90e10 | 1,500 | PASSED |
#include <queue>
#include <cstdio>
using namespace std;
int main()
{
int t;
scanf("%d", &t);
while(t--) {
queue<int> Q;
int n, prev, tmp, l(1), r(1);
scanf("%d", &n);
scanf("%d", &tmp);
prev = tmp;
while(r < n) {
while(r < n && tmp == prev) {
++r;
prev = tmp;
scanf("%d", &tmp);
}
... | C++ | cff809c3d5682e6b3e71b525c5f8f8b4 | 417df8b1e537c28a6115bfb19f387267 | 1,500 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define si set < int >
#define vi vector < int >
#define pii pair < int, int >
#define mii map < int, int >
#define p_q priority_queue
#define INF ((1 << 30) - 1)
#define FI(n) FastIO::read(n)
#define FO(n... | C++ | 3644aef5e313dcc26648ea4d50d6300c | fbd99afcb607b3b443968c7cb8be4907 | null | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1E6+10;
int read()
{
int a=0;char b=1,c;
do if((c=getchar())==45)b=-1;while(c<48||c>57);
do a=(a<<3)+(a<<1)+(c&15);while((c=getchar())>47&&c<58);
return a*b;
}
void write(int x)
{
if(x<0)putchar('-'),x=-x;
char a[10],... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 4810ce310465aa324de0c64e076b2ef5 | null | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, k;
char s[N];
string dp[N];
string miniChar(char c) {
char ret = (c + 1 == 'a' + k ? 'a' : (c == 'a' ? 'a' : c - 1));
string r; r += ret;
return r;
}
int solve() {
scanf("%d %d", &n, &k);
scanf("%s", s + 1);
dp[0] = "";
for (int... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 85120733ae84ae142b57646477767741 | null | PASSED |
#include <bits/stdc++.h>
using namespace std;const int N = 505;int n, k;char s[N];string dp[N];
string miniChar(char c) {char ret = (c + 1 == 'a' + k ? 'a' : (c == 'a' ? 'a' : c - 1));string r; r += ret;return r;}
int solve() {scanf("%d %d", &n, &k);scanf("%s", s + 1);dp[0] = "";for (int i = 1; i <= n; ++i) {dp[i] = dp... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 1aea9456860b52b5a9e04f10661aa850 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2000009;
int n, k, a[N];
char s[N];
void init()
{
scanf("%d %d", &n, &k);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++)
a[i] = s[i] - 'a' + 1;
}
void work()
{
if (n == 1)
{
if (a[1] == k || a[1] == 1) puts("a");
else printf... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 1f189a9ae8093e0f1d0aad8ba3992a8b | null | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 505;
int n, k;
char cz;
bool vis[sz][27][27];
string s, dp[sz][27][27];
char cnv(char x) {
if(x == 'a' || x == cz) return 'a';
return x - 1;
}
string fnc(int i, char pch, char cch) {
if(i >= n) return string(1, pch);
int p... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 025cce46d57ab9e8e917be467eb1127d | null | PASSED |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(register int i=(a);i<(b);++i)
#define ROF(i,a,b) for(register int i=(a);i>=(b);--i)
#define pi pair<int,int>
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
#define ls(x) ch[x][0]
#define rs(x) ch[x][1]
#define xs(x) (ch[fa[x]][1]==x)
using namespace std... | C++ | 3644aef5e313dcc26648ea4d50d6300c | 18d0710ee67f7ec6be95ccf7266a0da1 | null | PASSED |
import java.util.Scanner;
public class CodeForce {
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
int t = s.nextInt();
while(t>0)
{
String n = s.next();
System.out.println(n.length... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | dd9e2780e59c7e85cd0bcbea28a21c11 | null | PASSED |
import java.util.Scanner;
public class cp2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int t = in.nextInt();
for(int i = 0;i<t;i++) {
String n = in.next();
int l = n.length();
System.out.println(l);
}
}
}
| Java | ea011f93837fdf985f7eaa7a43e22cc8 | 4572d810772d50f0bb925cf05c1e73b1 | null | PASSED |
import java.math.BigInteger;
import java.util.*;
import java.util.Scanner;
public class StrangeFunctions {
public static int getCount(BigInteger number) {
double factor = Math.log(2) / Math.log(10);
int Count = (int) (factor * number.bitLength() + 1);
if (BigInteger.TEN.pow(Count - 1).compareTo(number) ... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | fbbb546aa2dd1ea532c013978474014b | null | PASSED |
import java.util.*;
public class Main{
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
String z=sc.nextLine();
while(t-->0){
String n=sc.nextLine();
System.out.println(n.length());
}
}
} | Java | ea011f93837fdf985f7eaa7a43e22cc8 | 56c285445720b577db43cfdd9a7569dd | null | PASSED |
import java.util.*;
public class problems {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t>0) {
String s=sc.next();
solve(s);
t--;
}
}
static void solve(String n) {
System.out.println(n.length());
}
} | Java | ea011f93837fdf985f7eaa7a43e22cc8 | a716178ad8e2f89283603380c24926d0 | null | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
public class A {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next() {
... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | 952e79e495d92d27bd64c9c9d7f1cebb | null | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
public class E {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int t,i,j,sum=0,c=0;
BigInteger n;
t=sc.nextInt();
while(t-->0)
{
n=sc.nextBigInteger();
while(!n.equals(BigInteg... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | 2240fca3d13541a129a98f79b2b0e2d2 | null | PASSED |
import java.util.*;
// import java.lang.*;
import java.io.*;
// THIS TEMPLATE MADE BY AKSH BANSAL.
public class Solution {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in))... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | b87f31991d2e212e1f3dad915bf2d59f | null | PASSED |
import java.util.Scanner;
import java.math.BigDecimal;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long t=sc.nextLong();
while(t>0){
String n=sc.next();
long sum=0;
long len=n.length();
for(;len!=0;sum++) {
len--;
}
... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | 4da29ba0852684bc5c892302cdb7db9e | null | PASSED |
import java.util.Scanner;
public class Codeforces {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
sc.nextLine();
while(t-- >0){
String str = sc.nextLine();
int len = str.length();
System.out... | Java | ea011f93837fdf985f7eaa7a43e22cc8 | d379d6b26b26e76898bc31e22a6beeb2 | null | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define w cout
#define e endl
using namespace std;
const int N = 1e6 + 7;
void ask(int x1 , int y1 , int x2 , int y2) {
w << "? " << x1 << " " << y1 << " " << x2 << " " << y2 << e;
}
int main() {
int n;
cin >> n;
int x1 = 1 , y1 = 1 , x2 = n , y2 = 1;
int xx1 = -1,... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 35c89de6376cb59bc1933e28e873fec4 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
pair<int, int> solve_y(int x1, int y1, int x2, int y2);
pair<int, int> solve_x(int x1, int y1, int x2, int y2);
pair<int, int> solve_x(int x1, int y1, int x2, int y2) {
pair<int, int> result;
if (x1 == x2 && y1 == y2)
return {x1, y1... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 5f8a9dafb2ebae4c0414b3906dbe163f | 2,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
istream &operator>>(istream &fin, vector<int> &a) {
for (auto &i:a)
fin >> i;
return fin;
}
ostream &operator<<(ostream &out, vector<int> &a) {
for (auto &i:a) {
out << i << ' ';
}
return out;
}
pair<int, int> so... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 75fd91b7e80e433df0e1e79ac0eeb701 | 2,200 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <deque>
#include <queue>
#include <iomanip>
#include <numeric>
... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 29df400fb78bae97353ef9566861cae5 | 2,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<iomanip>
#include<queue>
#include<stdlib.h>
typedef long long ll;
#define INF 0x3f3f3f3f
#define SIZE 200007
#define pi acos(-1.0)
#define forn for(i = 0; i < ... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | a708b44c9a5b673f98219441cdf57ac5 | 2,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<iomanip>
#include<queue>
#include<stdlib.h>
typedef long long ll;
#define INF 0x3f3f3f3f
#define SIZE 200007
#define pi acos(-1.0)
#define forn for(i = 0; i < ... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 21d5b06e3bc436032ee09e7929d07fac | 2,200 | PASSED |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int N;
int query(int u, int d, int l, int r) {
printf("? %d %d %d %d\n", u, l, d, r);
fflush(stdout);
int x;
scanf("%d", &x);
return x;
}
int main() {
scanf("%d", &N);
std::vector<int> ox, ... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | ee24fdfe3d7fc3b3703ed1e9417375e1 | 2,200 | PASSED |
// Author: Tyler Wang
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <new>
#incl... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 213f34e4a3bc9821a549ad83ba0c4c63 | 2,200 | PASSED |
// Author: Tyler Wang
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <new>
#incl... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 3b20ca3dcf7d3643653793a6ded99379 | 2,200 | PASSED |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int N;
int query(int u, int d, int l, int r) {
printf("? %d %d %d %d\n", u, l, d, r);
fflush(stdout);
int x;
scanf("%d", &x);
return x;
}
int main() {
scanf("%d", &N);
std::vector<int> ox, ... | C++ | 5774f74d9f6dc9ef79182515f667eb23 | 9e94d84825c5350ee52b493cd4bb14d5 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, m, x, y, zero=0;
cin>>n>>m;
set<long long> r;
set<long long> c;
while(m--)
{
cin>>x>>y;
r.insert(x);
c.insert(y);
long long row=r.size();
long long col=c.size();
long long ans = n * n - col*... | C++ | faf1abdeb6f0cf34972d5cb981116186 | 89e93e5aeaa39ba422563d425f85f5a9 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl endl
#define f first
#define s second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define vc vector<ll>
#define pr pair<ll,ll>
#define f(i,x,n) for (int i = x;i < n;++i)
using namespace std;
... | C++ | faf1abdeb6f0cf34972d5cb981116186 | d65d143f0eb922c8f40eed1a2d43d91c | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl endl
#define f first
#define s second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define vc vector<ll>
#define pr pair<ll,ll>
using namespace std;
const int N = 200000+9;
ll n,x,r,c;
map<int... | C++ | faf1abdeb6f0cf34972d5cb981116186 | ad22a1db8316a0df9c9469898b7b4334 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl endl
#define f first
#define s second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define vc vector<ll>
#define pr pair<ll,ll>
#define f(i,x,n) for (int i = x;i < n;++i)
using namespace std;
... | C++ | faf1abdeb6f0cf34972d5cb981116186 | 06b785dd65d3371c07e8addaabe1d5be | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ulli unsigned long long int
int main()
{
ulli n,m,i,j,k,sum=0;
cin>>n>>m;
//sum=n*n;
set<ulli> seh,sel;
//ulli count=0;
for(i=0;i<m;i++)
{
//count=0;
ulli a,b;cin>>a>>b;
seh.insert(a);
sel.insert(b);
cout << (n-seh.size())*(n-sel.size()) <<" ";
}
... | C++ | faf1abdeb6f0cf34972d5cb981116186 | ec8f365cbb2354603aafa6afc1579aca | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define test long long int t; cin>>t; while(t-->0)
#define fIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define loop(i,n) for (ll i = 0; i < n; i++)
#define sz(x) x.size()
#define F first
#define ... | C++ | faf1abdeb6f0cf34972d5cb981116186 | b8e8695e714ed619baf9aaf0960673ac | 1,200 | PASSED |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, l... | C++ | faf1abdeb6f0cf34972d5cb981116186 | d442127413cbbb9c08b2ead15eb4e895 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const int N = 1e6 + 2;
struct IOsetup{
IOsetup(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(... | C++ | faf1abdeb6f0cf34972d5cb981116186 | 6e90022353adcb2fac89760606b607a4 | 1,200 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define PB push_back
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define ar array
#... | C++ | faf1abdeb6f0cf34972d5cb981116186 | 05906f023de0fb182f7b929ba236be6b | 1,200 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+1;
int r[6]={4,5,6,3,2,1};
int main()
{
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
//freopen("input.txt", "r", stdin);
... | C++ | faf1abdeb6f0cf34972d5cb981116186 | 58a4b77165eed8b404d0ad4cf467d50c | 1,200 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[1001];
for(int i=0;i<n;i++)
cin>>arr[i];
int i;
bool flag = true;
for(i=1;i<n-1;i++)
{
if(arr[i-1]<arr[i] &... | C++ | dd55e29ac9756325530ad2f4479d9f6d | 5d3fd79f3e2f0bb85f1eceb751f45428 | 900 | PASSED |
#include<iostream>
#include<vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> nums(n + 1);
for (size_t i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
nums[tmp] = i + 1;
}
int left = 1;
int right = n;
for (size_t i = nums.size(); i != 1;) {
--i;
if (nums[i] != left && nums[i] != rig... | C++ | dd55e29ac9756325530ad2f4479d9f6d | 4b59ee044802b29ff938434ff8c694e4 | 900 | PASSED |
#include<iostream>
#include<cstdlib>
#include<string>
#define MAX 1000
using namespace std;
struct out {
string x;
int b[3] = { 0 };
};
void xxx(int a[], int n, out *&Xuat, int &m) {
for (int i = 0; i < n - 2; i++) {
if (a[i] < a[i + 1] && a[i + 1] > a[i + 2]) {
Xuat[m].b[0] = i + 1;
Xuat[m].b[1] = i + 1 + 1... | C++ | dd55e29ac9756325530ad2f4479d9f6d | 3632174be975a694d7fca5d0416b589e | 900 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n,l=0;
cin >> n;
int* mas = new int[n];
for (int i = 0; i < n; i++)
cin >> mas[i];
for (int i = 0, j=i+1; i <n, j<n; i++, j++)
{
if (mas[i] < mas[j])
{
for (int k = j + 1; k < n; k++)
{
if ... | C++ | dd55e29ac9756325530ad2f4479d9f6d | 0909a8efac5f355416863fc3dc63fa8b | 900 | PASSED |
#include <iostream>
#include<iomanip>
#include<cstring>
int nums[1000];
using namespace std;
int main()
{
int c, n;
cin >> c;
while (c-- > 0) {
int ai=0, aj=0, ak=0;
cin >> n;
memset(nums, 0, 1000);
for (int i = 0; i < n; ++i)
{
cin >> nums[i];
}
int i;
for (i = 1; i < n-1; ++i)
{
int conditi... | C++ | dd55e29ac9756325530ad2f4479d9f6d | e02e33f78547667870c65e6ee33f2e30 | 900 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.