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 |
|---|---|---|---|---|---|
///#pragma GCC optimize(3)
///#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
///#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>PLL;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
#define... | C++ | 852e1d776c560a8720d4e9f1762b255f | 73a607ca9bffb83ce6011815be96f24a | 1,900 | PASSED |
#include<bits/stdc++.h>
char s1[100];
char s2[100];
char str[1005];
using namespace std;
map<char,char>M;
int main(){
scanf("%s%s%s",s1,s2,str);
for(int i=0;i<26;i++){
M[s1[i]] = s2[i];
M['A'+s1[i]-'a'] = 'A' + s2[i] - 'a' ;
}for(int i=0;str[i];i++)
printf("%c",isalpha(str[i])?M[str[i]]:str... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | c6f8718eced88016b531c161802500ff | 800 | PASSED |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s1,s2,s3;
int z;
while(cin>>s1>>s2>>s3)
{
for(int i=0;i<=s3.size()-1;i++) //��Դ�ı����б���
{
if(s3[i]>='0' && s3[i]<='9') //��������֣���ֱ�����
{
... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 26fecd6c119b65c7f12b419127cabe44 | 800 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
char s1[30],s2[30],s[1010],t[300];
int main()
{
ios::sync_with_stdio(0);
cin>>s1>>s2>>s;
for(int i=0;i<26;i++)
t[s1[i]]=s2[i];
for(int i=0;s[i];i++)
{
if(isupper(s[i]))s[i]=t[s[i]+32]-32;
e... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 265472fe5f01bcd0a695e3c3f9969dbc | 800 | PASSED |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<ctype.h>
#include<map>
using namespace std;
map<int,int>my_map;
const int maxn=26+2;
const int N=1000+2;
const int len=26;
char s1[maxn],s2[maxn];
char s3[N];
int main(){
while(scanf("%s%s%s",s1,s2,s3)!=EOF){
my_map.... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | b98e3a02ceeb111ee89d1fce37e1acd1 | 800 | PASSED |
#include<stdio.h>
using namespace std;
char a1[1005],a2[1005],a3[1005],a[30],b[30];
int main(){
scanf("%s%s%s",a1,a2,a3);
int i;
for(i=0;a1[i];i++){
a[a1[i]-'a']=a2[i];
b[a1[i]-'a']=a2[i]-32;
}
for(i=0;a3[i];i++){
if(a3[i]>='a'&&a3[i]<='z'){
printf("%c",a[a3[i]-'a']);continue;
}
if(a3[i]>='A'&&a3[i]<=... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | b5f26e58306c5ed7c78f6458762d0e43 | 800 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
char a[27],b[27];
cin>>a>>b;
char c[26];
for(int i=0;i<26;i++){
c[a[i]-97]=b[i];
}
string d;
cin>>d;
for(int i=0;i<d.size();i++){
if(d[i]>='a'&&d[i]<='z')cout<<c[d[i]-97];
else if(d[i]>='A'&&d[i]<='Z')printf("%c",c[d[i]-65]-32);
... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 7af416d98a09acc0fda26a8bf4d07083 | 800 | PASSED |
#include<cstdio>
#include<cstring>
int main()
{
char a[26], b[26], c[1001], d[26];
scanf(" %s %s %s", a, b, c);
for(int i = 0; i < 26; i++)
{
d[a[i] - 'a'] = b[i];
}
for(int i = 0; i < strlen(c); i++)
if(c[i] < 65) continue;
else if(c[i] >= 'A' && c[i] <= 'Z') c[i] = d[c[i] - 'A'] - 32;
else c[i] =... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 21b86a117b652def4910fdaccf0937ad | 800 | PASSED |
#include<string>
#include<iostream>
using namespace std;
int main()
{
string lay1,lay2,s,new_s="";
cin>>lay1;
cin>>lay2;
cin>>s;
int index[26]={0};
for(int i=0;i<26;i++)
index[lay1[i]-97]=i;
int l=s.length();
for(int i=0;i<l;i++)
{
if(s[i]>='0' and s[i]<='9')
new_s+=s[i];
else
{
if(tolower(s... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 3498471d4cb697c87f30e17daa58daa8 | 800 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 1005
int main()
{
char a[maxn], b[maxn], str[maxn];
int i, j;
scanf("%s",a);
scanf("%s",b);
scanf("%s",str);
for(i = 0; i < strlen(str); ++i){
if((str[i] >= 'a' && str[i] <= 'z') || (str[i] >= 'A' && str[i] <= 'Z')){
for... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 11180556f31e28e723fa476fda27015f | 800 | PASSED |
#include<iostream>
#include<string.h>
using namespace std;
int num( char a) {
for (int i = 0; i < 10; i++) {//���ֵıȽ�
if ((i+48)== a) return ( i + 1);
}
return 0;
}
int small(char *s, char a) {//Сд��ĸ�ıȽ�
for (int i = 0; i < 26; i++) {
if (s[i] == a) return (i + 1);//�ҵ�λ�ú�+1���������ⷵ�� 0
}
retu... | C++ | d6f01ece3f251b7aac74bf3fd8231a80 | 2015dd0695f37a9fbc89d676b8722990 | 800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
public class d {
static BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) th... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | e6485dce27425664864ff5c85cdb8500 | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
static void solve(InputReader in, OutputWriter out) {
int k = in.nextInt();
int n = in.nextInt();
int[] marks = new int[k];
for (int i = 0; i < marks.length; i++) {
marks[i] = in.nextInt();
}
int... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | b7a69817f4326283320e67ff3a20272b | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStre... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | a1578a8f3236e23970629ba9ddd87896 | 1,700 | PASSED |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Codeforces {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int k = sc.nextInt();
int n = sc.nextInt();
int[] prefixSums = new int[k];
prefixSums[0] = sc.nextInt();
... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | 30e34d982f2b4ac2dc2480cd3d521039 | 1,700 | PASSED |
import java.util.*;
import java.io.*;
public class JuryMarks {
// https://codeforces.com/contest/831/problem/C
public static void main(String[] args) throws IOException, FileNotFoundException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
//BufferedReader in = new BufferedReader(... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | 33949ca3c83da30b1d03381462967512 | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class jurymarks {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new St... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | cf55039dd80cd33c6af6c5f19308a2af | 1,700 | PASSED |
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
StringTokenizer token = new StringTokenizer(in.readLine());
int k =... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | a717e2186a07ce8d1505203fff347d75 | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class JuryMarks {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader (System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int k = Integer.parseInt(st.nextToken());
int n = Integ... | Java | 6e5b5d357e01d86e1a6dfe7957f57876 | e546a8327fb03b8d88e7939147a9c779 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ris return *this
#define tmplt template<class T
#define dbgo debug& operator<<
tmplt > struct rge { T b, e; };
tmplt > rge<T> range(T i, T j) { return rge<T>{i, j}; }
struct debug {
#ifdef LOCAL
~debug(){cerr<<endl;}
tmplt > dbgo(T x){cerr<<boolalpha<<x;ris;}
tm... | C++ | 6e5b5d357e01d86e1a6dfe7957f57876 | 52c6b2a90e3f6e0e8b18415ee0015efc | 1,700 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define F first
#define S second
#define mpp make_pair
using namespace std;
const int maxn=2e5+10, mod=1e9+7, inf=1e8;
set<int> s;
unordered_map<int, int> mp;
int main(){
int k, n;
cin >> k >> n;
int a[k], b[n], su[k];
for (int ... | C++ | 6e5b5d357e01d86e1a6dfe7957f57876 | eb621a9a07964064b0272fc76a265e8c | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cout << fixed << setprecision(6) ;
long double x, y, x2, y2;
long double r, r2;
cin >> x >> y >> r ;
cin >> x2>> y2>> r2 ;
long double R = sqrt((x-x2)*(x-x2)+(y-y2)*(y-y2)) ;
if ( r+r2 < R ) cout << "0.000000" ;
else if ( R+ m... | C++ | 94d98a05741019f648693085d2f08872 | b1fd3706d34668bc49c9c4112ea4174c | 2,000 | PASSED |
//#pragma comment(linker, "/STACK:100000000")
#define _CRT_DISABLE_PERFCRIT_LOCKS
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
/*MACROS*/
//FUNCTIONS
#define in_range(i, l, r) for(ll i = l; i < r; i++)
#define all(v) begin(v), end(v)
#define rall(v) (v).rbeg... | C++ | 94d98a05741019f648693085d2f08872 | 2a57830600aec5980ffeb7fe3fed8621 | 2,000 | PASSED |
# include <bits/stdc++.h>
using namespace std;
# define fi cin
# define fo cout
# define db long double
const db pi = 3.14159265;
int main(void)
{
db x1,y1,r1,x2,y2,r2;
fi>>x1>>y1>>r1>>x2>>y2>>r2;
db d = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
if (r1 + r2 < d) return fo << "0.000000\n",0;
... | C++ | 94d98a05741019f648693085d2f08872 | b46e798febaa7f8a400a62f7a61ada67 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#def... | C++ | 94d98a05741019f648693085d2f08872 | 587d62b7a51a2f249dae6f2d037a7784 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#def... | C++ | 94d98a05741019f648693085d2f08872 | 234263153b0e309d56329d0906fe73ff | 2,000 | PASSED |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>
typedef long long ll;
typedef long double ld;
using namespace std;
const ld PI = ... | C++ | 94d98a05741019f648693085d2f08872 | 87c27dadaceb35cc781d5ac45383c775 | 2,000 | PASSED |
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cctype>
#include <vector>
#include <array>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <deque>
#include <functional>
#... | C++ | 94d98a05741019f648693085d2f08872 | e56028ee45c48c5e1c980b07a53f561b | 2,000 | PASSED |
# include <bits/stdc++.h>
# define pi 3.1415926535897932384626433832795028841971693993751058209749445923078164
using namespace std;
long double x[2],y[2],r[2],xxx[2],yyy[2],d,alpha,h,xx,yy,a,b,c,l,s1,s2,s,m1,m2,res1,res0;
long double sqr(long double a)
{
return a*a;
}
main()
{
ios_base::sync_with_stdio(0);
for ... | C++ | 94d98a05741019f648693085d2f08872 | e8124120438894dba71eca84b9e0937f | 2,000 | PASSED |
# include <bits/stdc++.h>
# define pi 3.1415926535897932
using namespace std;
long double x[2],y[2],r[2],xxx[2],yyy[2],d,alpha,h,xx,yy,a,b,c,l,s1,s2,s,alpha1,alpha2,m1,m2,dd,hh,res1,res0;
long double sqr(long double a)
{
return a*a;
}
long double dientichtamgiac(long double a,long double b,long double c)
{
long ... | C++ | 94d98a05741019f648693085d2f08872 | 0249452e09d75e63a9ba1f98de27259c | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main () {
long double pi = acos(-1);
long double x1, y1, r1;
long double x2, y2, r2;
long double ans;
cout.precision(24);
cin >> x1 >> y1 >> r1;
cin >> x2 >> y2 >> r2;
if (r1 > r2) {
long double tmp = r1;
r1 = r2;
r2 = tmp;
}
long dou... | C++ | 94d98a05741019f648693085d2f08872 | 7395c0803f7c845a8e4dac2d60e50d88 | 2,000 | PASSED |
#include<iostream>
#include<cstdio>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<algorithm>
#define ll long long
#define pb push_back
#define f first
#define s second
#define all(c) c.begi... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 3a8ae9139bde4ab1ab958d3067cee8ea | 1,700 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n,k,d1,d2;
int t;
bool check(ll a,ll b,ll c){
if (a+b+c>k || (k-a-b-c)%3) return 0;
ll x=n-k-(a-b+a-c);
if (x<0 || x%3) return 0;
return 1;
}
int main(){
bool flag;
// freopen("1.txt","r",stdin);
scanf("... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 379729124d1967a660ea282c2a230181 | 1,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define N 100005
ll m,n,k,d1,d2,D1,D2;
int t;
bool check(){
ll a,b,c;
n=m;
c=k-d1-2*d2;
if (c<0 || c%3) return 0;
c/=3;
if (c>k) return 0;
b=c+d2;
if (b>k) return 0;
a=b+d1;
if (a>k)... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 109e736f6c4f532150c4afaedc7c29a0 | 1,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define N 100005
ll m,n,k,d1,d2,D1,D2;
int t;
bool check(){
ll a,b,c;
n=m;
c=0;
if (c>k) return 0;
b=c+d2;
if (b>k) return 0;
a=b+d1;
if (a>k) return 0;
if (a+b+c>k) return 0;
if (a<... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 03a6f7d40497021c8db69558801e575a | 1,700 | PASSED |
#include <cmath>
#include <memory>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef __int64 ll;
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
int cmp(const void *a, const void *b)
{
return(*(int *)... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | a2f0f4bb2c7cd8d80ceaaae83cedd47c | 1,700 | PASSED |
/*
* Author:
* Indestinee
* Date:
* 2014.07.25
*/
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define cls(a) memset(a,0,sizeof(a))
#define rise(i,a,b) for(i=a;i<=b;i++)
#define fall(i,a,b) for(i=a;i>=b;i--)
l... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 643fa74cb15afefea34c62f6561185e1 | 1,700 | PASSED |
#include<iostream>
#include <functional>
#include<vector>
#include <string.h>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 5e5 + 9;
typedef long long ll;
ll n,aux,k,d1,d2;
ll num[3];
ll x1 = 0,x2 = 0,x3 = 0;
bool solve()
{
if(n%3)return false;
for(ll i = -1; i <= ... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | fa15c50635133d7cc4d5581a4335d98e | 1,700 | PASSED |
#include <cstdio>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cctype>
#include <memory.h>
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
typedef long long ll;
using namespace std;
const in... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 421c498f388bd6ed8f7f4661c17809fa | 1,700 | PASSED |
#include <cstdio>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cctype>
#include <memory.h>
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
typedef long long ll;
using namespace std;
const in... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 4d8e5d19672267658eef31110ef037d9 | 1,700 | PASSED |
#include <cstdio>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cctype>
#include <memory.h>
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
typedef long long ll;
using namespace std;
const in... | C++ | 324298100f3e36d289ef6ca8178ac6d3 | 6a96128688881c1949cac688f439ec96 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const int Nmax = 1e5+5;
long long arr[Nmax];
int main()
{
long long n, k, l;
cin >> n >> k >> l;
for(int i = 0;i < n*k;++i)
cin >> arr[i];
sort(arr, arr + n*k);
long long x = 1, hv = 1, p = 0;
long long ans = ar... | C++ | d40fcaf3e305910f66fec02f5507c327 | 7321c52539f0eccc04cf42978b0d138c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sc second
#define ff \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll al[26];
ll ar[26];
int main()
{
int q;
// cin >> q;
q = 1;
ll n,k,l;
cin>>... | C++ | d40fcaf3e305910f66fec02f5507c327 | bac9b2f1615939ceb3dd71f182b6b574 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int m, n, k, l, upper = 1;
long long result = 0;
cin >> n >> k >> l;
m = n * k;
vector<long long> a(m+2, 0) ;
for (int i = 1; i <= m; i ++)
cin >> a[i];
sort(a.begin()+1, a.begin() + m +1);
... | C++ | d40fcaf3e305910f66fec02f5507c327 | 14b3cebbf920e3b947f8c85e6f93d661 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int m, n, k, l, upper = 1;
long long result = 0;
cin >> n >> k >> l;
m = n * k;
vector<long long> a(m+2, 0) ;
for (int i = 1; i <= m; i ++)
cin >> a[i];
sort(a.begin()+1, a.begin() + m +1);
... | C++ | d40fcaf3e305910f66fec02f5507c327 | ccbf2bd9ba1b4b5d454f68807c289998 | 1,500 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
const int maxn = int(1e5) + 7;
ll n, k, l, m, a[maxn], ans, upper;
int main() {
scanf("%lld%lld%lld", &n, &k, &l);
m = n * k;
for (ll i = 1; i <= m; i++) scanf("%lld", a + i);
std::sort(a + 1, a + 1 + m);
if (a[n] - a[1] > l) return 0 * puts("0");
i... | C++ | d40fcaf3e305910f66fec02f5507c327 | e66f00f98bde91e8dfd6ebf2d6d658e5 | 1,500 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
const int maxn = int(1e5) + 7;
ll n, k, l, m, a[maxn], ans, upper;
int main() {
scanf("%lld%lld%lld", &n, &k, &l);
m = n * k;
for (ll i = 1; i <= m; i++) scanf("%lld", a + i);
std::sort(a + 1, a + 1 + m);
if (a[n] - a[1] > l) return 0 * puts("0");
i... | C++ | d40fcaf3e305910f66fec02f5507c327 | 39c9963433419fb03265e20e1f050d47 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
typedef long long li;
int n, k, l, m;
vector<li> a;
inline bool read() {
if(!(cin >> n >> k >> l))
return false;
m = n * k;
a.assign(m, 0);
fore(i, 0, m)
assert(scanf("%lld", &a[i]) == 1);
return true;
... | C++ | d40fcaf3e305910f66fec02f5507c327 | 28100ea525632beafb7cefb7aeef3a47 | 1,500 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int a[100100],n,m,k,cnt,fp;
long long int ans;
int main(){
cin >>n >>m >>k;
for(int i=0;i<n*m;i++) cin >>a[i];
sort(a,a+m*n);
if(a[n-1]-a[0]>k) {
cout <<0 <<endl;
return 0;
}
if(m==1){
for(int i=0;i<n;i++) ans+=a[i];
cout <<an... | C++ | d40fcaf3e305910f66fec02f5507c327 | 6d786f5287f2ac7db12aa1d284f618e6 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100005;
LL a[N];
int main()
{
LL n,k,l;
scanf("%lld %lld %lld",&n,&k,&l);
for(int i = 1;i <= n * k;++i)
{
scanf("%lld",&a[i]);
}
sort(a + 1,a + n * k + 1);
int x = upper_bound(a + 1, a + n * k + 1,a[1] +... | C++ | d40fcaf3e305910f66fec02f5507c327 | 34e02343ad7fe12faf52804e64882156 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100005;
LL a[N];
int main()
{
LL n,k,l;
scanf("%lld %lld %lld",&n,&k,&l);
for(int i = 1;i <= n * k;++i)
{
scanf("%lld",&a[i]);
}
sort(a + 1,a + n * k + 1);
int x = upper_bound(a + 1, a + n * k + 1,a[1] +... | C++ | d40fcaf3e305910f66fec02f5507c327 | fde181de3917b2c0d56ad0bda78c7850 | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int i, n, m, low, high, mid;
int arr1[200000], arr2[200000];
scanf("%i %i", &n, &m);
for(i=0;i<n;++i){scanf("%i",&arr1[i]);}
for(i=0;i<m;++i){scanf("%i",&arr2[i]);}
sort(arr1,arr1+n);
for(i=0;i<m;i++... | C++ | e9a519be33f25c828bae787330c18dd4 | 19ecc3dbaa6d9c4dd92e6b315349c1cc | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#define MAX 200000
using namespace std;
/*
COMPARE UM ELEMENTO DE Q, NUMA POSICAO J, ENCONTRE O NUMERO DE ELEMENTOS EM P QUE SÃO MENORES OU IGUAIS AO ELEMENTO ESCOLHIDO
*/
int main(int argc, char **argv){
int n, m;
cin >> n >> m;
... | C++ | e9a519be33f25c828bae787330c18dd4 | 0c352adaba7916975d0d10157f3f6b93 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int N, M, x;
int A[200005];
int binarySearch(int key)
{
int low = 0;
int high = N-1;
int target;
while(low <= high)
{
target = (low + high) / 2;
if(A[target] < key)
low = target + 1;
else if(A[target] > key)
high = target - 1;
else
low = target + 1... | C++ | e9a519be33f25c828bae787330c18dd4 | 5c968c983d15b1d7fa2241b7fc89ef7b | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ai;
int bi;
cin >> ai;
cin >> bi;
vector<int> a (ai,0);
for (int i=0; i<ai; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int c;
vector<int> b (bi,0);
for (int i=0;i<bi;i++){
cin >> c;
int A=0;
int B=ai-1;
while (A!=B){
int m=(A+... | C++ | e9a519be33f25c828bae787330c18dd4 | 74b73e2c977fd2f767f304ad3c5db2b4 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int veta[200010],vetb[200010];
int N,M;
int buscab(int ini, int fim,int x){
int best=-1;
while(ini<=fim){
int meio=(ini+fim)/2;
if(veta[meio]>x ){
fim=meio-1;
}
else {
best=meio;
ini=meio+1;
}
}
return best + 1;
}
int main(){
io... | C++ | e9a519be33f25c828bae787330c18dd4 | a0456f8213ed400144bf5575c3ee5716 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200100
#define INF 999999999999
long long v1[MAXN],v2[MAXN];
long long n,m;
long long busca(long long x){
long long ini=1,fim=n+1;
long long pos=-1;
while(ini<=fim){
long long meio = (ini+fim)/2;
if(v1[meio... | C++ | e9a519be33f25c828bae787330c18dd4 | adcc4e05b5f067262f06131266207d9e | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
scanf("%d %d", &n, &m);
vector<int> v;
for(int i=0;i<n;i++)
{
int a;
scanf("%d", &a);
v.push_back(a);
}
sort(v.begin(), v.end());
for(int i=0;i<m;i++)
{
int a;
scanf("%d", &a);
printf("%d ", upper_bound(v.begin(), v.end(), a) - ... | C++ | e9a519be33f25c828bae787330c18dd4 | fd1c8d4d7304918842131679c5305188 | 1,300 | PASSED |
#include <cstdio>
#include <algorithm>
#include <iostream>
int main()
{
int n, m, b;
int a[200000];
// scanf("%d %d", &n, &m);
std::ios::sync_with_stdio(false);
std::cin >> n;
std::cin >> m;
for (int i = 0; i < n; i++)
// scanf("%d", &a[i]);
std::cin >> a[i];
std::sort(&a[0], &a[n]);
for (int i = 0; i... | C++ | e9a519be33f25c828bae787330c18dd4 | abbb3039405b30a7979daee5aa43f84b | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
//Read the size of vectors
int n, m;
cin >> n;
cin >> m;
//Read elements of vectors
vector<int> a(n);
vector<int> b(m);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int j = 0; j < m; j++) {
cin... | C++ | e9a519be33f25c828bae787330c18dd4 | fe41bb1078605c255c3df12975e6c23d | 1,300 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
int main()
{
long long n, m, k;
vector<long long> a;
scanf("%lld %lld", &n, &m);
for (long long i = 0; i < n; ++i)
{
scanf("%lld", &k);
a.push_back(k);
}
sort(a.begin(), a.end());
for (long long i = 0; i <... | C++ | e9a519be33f25c828bae787330c18dd4 | 1d2da1ac4b1834e093743492f900344a | 1,300 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int su[300002];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
int ar[n];
for(int i=0;i<n;i++)
cin>>ar[i];
int r=0;
int lp=-1; int rp=-1;
int co=0;
int ans=0;
int p=0;... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 01869782c9b6c128a0c5186d265a48b1 | 1,600 | PASSED |
#include<iostream>
#include<stdio.h>
#include<iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<queue>
#include<math.h>
#include<utility>
#include<stack>
#include<unordered_map>
#include<map>
#include<set>
#include<unordered_set>
#include<algorithm>
#include<sstream>
#define ff first
#define ss sec... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 4995c4c2971f3c6e4a17fd2585052801 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <fstream>
#include <numeric>
#define endl '\n'
#define ll long long
#define pb push_back
#define FASTIO io... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 640efe88d361ead96c5a478c90847565 | 1,600 | PASSED |
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int main(){
int n,k,countb=0,maxb=0,x=0,max=0;
scanf("%d%d",&n,&k);
int arr[n];
vector<int> a,b;
for(int i=0;i<n;i++) scanf("%d",&arr[i]);
a.push_back(-1);
b.push_back(-1);
for(int i=0;i<n;i++){
... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 65bdebfec8de4f7883bff20775730d1a | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> v1;
void findZeroes(int arr[], int n, int m)
{
// Left and right indexes of current window
int wL = 0, wR = 0;
// Left index and size of the widest window
int bestL = 0, bestWindow = 0;
// Count of zeroes in current... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 135f8f8be5d7d714c94a5f7d6b174c77 | 1,600 | PASSED |
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int nulla = 0, max = -1, maxstart = -1;
int j = -1;
for (int i = 0; i < n; i++) {
while (j + 1 < n && nulla + (1 - a[... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 10ad9c47d6e17c7de0a70e75b4d81e64 | 1,600 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,k;
cin >> n>> k;
vector<int> tomb(n);
for(int i = 0; i < n; i++){
cin >> tomb[i];
}
int nagy=-1, nagykezd, nagyveg;
vector<int> nagysor(n);
int j = 0, l = 0;
for(int i = 0; i < n; i++){
while(l < n && j + (1 - ... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 2bacb8834d33234e64f233180dbd9e0f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
vector<int> v;
v.push_back(-1);
int m=0;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
a[i]=x;
if(x==0)
{
v.push_back(i);
}
if(x==1) m=1;
... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 792bb23b5a6bc155ebaebb2d581473c7 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <vector>
#include <set>
#include <cassert>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
... | C++ | ec9b03577868d8999bcc54dfc1aae056 | c10f9e1266bd3e2de10c6d9383d05888 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <vector>
#include <set>
#include <cassert>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
... | C++ | ec9b03577868d8999bcc54dfc1aae056 | 2ebb9c52f519c1755aa5f540ae9c2d1f | 1,600 | PASSED |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <bitset>
using namespace std;
template <typename T> void chkmax(T &x, T y) {x = x > y ? x : y;}
template <typename T> void chkmin(T &x, T y) {x = x > y ? y : x;}
type... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 8c9aa27e44d3dbe7a18cc5b4919e65a8 | 2,700 | PASSED |
#include <cstdio>
#include <bitset>
#include <algorithm>
#define int long long
template<typename T>
inline T min(const T &a,const T &b){return a<b?a:b;}
template<typename T>
void read(T &r)
{
static char c;r=0;
for(c=getchar();c>'9'||c<'0';c=getchar());
for(;c>='0'&&c<='9';r=(r<<1)+(r<<3)+(c^48),c=getchar()... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 866e418babc9700c05ce96a6f814a4aa | 2,700 | PASSED |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
const int MaxN = 150, MaxM = 150;
const int INF = 0x7F7F7F7F;
struct edge_t {
int u, v, d;
edge_t(int _u = 0, int _v = 0, int _d = 0) { u = _u, v = _v, d = _d; }
inline friend bool operator < (const edge_t &a, const edge_t &b) { return ... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | d028dbde8cddabd88ff848c0a7476775 | 2,700 | PASSED |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
const int MaxN = 150, MaxM = 150;
const int INF = 0x7F7F7F7F;
struct edge_t {
int u, v, d;
edge_t(int _u = 0, int _v = 0, int _d = 0) { u = _u, v = _v, d = _d; }
inline friend bool operator < (const edge_t &a, const edge_t &b) { return ... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 635b2291c3bc8a9e8884e183ebbd3123 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
struct matrix {
bitset<151> bs[151];
};
int n;
matrix operator*(matrix a, matrix b) {
matrix ans;
bitset<151> tmp[151];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
tmp[j][i] = b.bs[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | f8b8657e293ba574fb6b74aad75213b6 | 2,700 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int MAXN = 151;
const int MAXBLOCKS = 7;
int n, m;
struct matrix {
bool mat[MAXN][MAXN];
unsigned int row[MAXN][MAXBLOCKS];
unsigned int col[MAXN][MAXBLOCKS];
matrix() {
memset(mat, 0, sizeof mat);
... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | f52aba62660ded20f8704961480d5021 | 2,700 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int MAXN = 151;
const int MAXBLOCKS = 7;
int n, m;
struct matrix {
bool mat[MAXN][MAXN];
unsigned int row[MAXN][MAXBLOCKS];
unsigned int col[MAXN][MAXBLOCKS];
matrix() {
memset(mat, 0, sizeof mat);
... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 8a28f86a3563d6b22696062026cc11cb | 2,700 | PASSED |
#include<bits/stdc++.h>
#define fir first
#define sec second
#define db double
#define ll long long
#define ev eg[i].v
#define pb push_back
#define INF 0x3f3f3f3f
#define pir pair<int,int>
#define Rep(i,l,r) for(int i=(l);i<=(r);++i)
#define RepD(i,r,l) for(int i=(r);i>=(l);--i)
#define RepG(i,x) for(int i=hd[x];i;i=eg... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 7e418ea15e27179337203c9c80090dc5 | 2,700 | PASSED |
#include <cstdio>
#include <algorithm>
#include <queue>
#include <bitset>
#define vi vector<int>
#define mat vector<vi>
using namespace std;
const int MAXN = 200, inf = 1e9+300;
struct edge {
int a, b, d;
bool operator<(edge o) const {
return d < o.d;
}
};
int N, M, r = inf;
mat I, x, g, gp;
vector<edge> e;
ma... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | d08f7ecd82412bf04776492701fc1960 | 2,700 | PASSED |
#include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
typedef double db;
#define rdb register db
#define cdb const db
typedef long double ldb;
typedef unsigned long long ull;
#define pb push_back
#de... | C++ | 63018a40861e1760f367cb6e4fa5cd0c | 54c38a3176dc15ed465c99abe4cfbb5a | 2,700 | PASSED |
#include<stdio.h>
int main()
{
int n,i,t,max=0;
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%d",&n);
if(n>max)
{
max=n;
}
}
printf("%d\n",max);
return 0;
}
| C++ | d03ad531630cbecc43f8da53b02d842e | f34f6b153a4d4dc076213f86602e65f5 | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int posAct=0,posSuiv , h,energy=0 ,money=0,n;
cin >> n ;
for ( int i =0 ; i<n ; i++)
{
cin>>posSuiv ;
energy+=posAct-posSuiv ;
if ( energy<0 ){
money+=-energy ;
... | C++ | d03ad531630cbecc43f8da53b02d842e | d43ccaedc98959ece172662a8b7faaa0 | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <stdio.h>
#include <math.h>
#include <iterator>
#include <sstream>
#include <queue>
#include <unordered_set>
#define pb push_back
#define sz(x) (int)x.size()
#define vll vector<long long>
#define vc vector<char>
#define... | C++ | d03ad531630cbecc43f8da53b02d842e | b594d57078f96029621eac1acbf0b456 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define s(x) scanf("%d",&(x))
#define sl(x) scanf("%lld",&x)
#define print(x) printf("%d ",x)
#define printnl(x) printf("%d\n",x);
#define forI(i,a,b) for(int i=(a);i<=(b);i++)
#define forD(i,a,b) for(int i=(a);i>=(b);--i)
#define MOD 1000000009
#define INF_LONG 8999999999999999999
#define ll lo... | C++ | d03ad531630cbecc43f8da53b02d842e | edde6a0f67db49c3be8c0cf7d6043b88 | 1,100 | PASSED |
/*
Author: Maxym Strelbitskyi
Vinnytsia - 2014
*/
#define _CRT_DISABLE_PERFCRIT_LOCKS
#define opt ios_base::sync_with_stdio(false);cin.tie(NULL);
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include... | C++ | d03ad531630cbecc43f8da53b02d842e | b6f2460e62cf7ecdf95ffcced51a9aae | 1,100 | PASSED |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <queue>
#include <cmath>
#include <ctime>
#include <climits>
#include <iomanip>
#include <sstream>
using namespace std;
typedef long long LL;
#de... | C++ | d03ad531630cbecc43f8da53b02d842e | 9b09bfc6b6d274f7bf11301f05964cdc | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100010
int n, vec[N];
int main(){
cin >> n;
for( int i =0 ;i <n; i++ )cin >>vec[i];
int en = 0;
int ph = 0;
long long ans = 0;
for( int i=0; i<n; i++ ) {
if( en+(ph-vec[i]) < 0 )
... | C++ | d03ad531630cbecc43f8da53b02d842e | 369fa518774e8467c0da6f75a17d8dcd | 1,100 | PASSED |
#include <iostream>
using namespace std;
int main() {
cin.sync_with_stdio(false);
long long n, sum, maxx;
cin >> n;
cin >> maxx;
for (int i = 2, h; i <= n; i++) {
cin >> h;
maxx = (maxx > h ? maxx: h);
}
cout << maxx;
return 0;
}
| C++ | d03ad531630cbecc43f8da53b02d842e | bcf6e413f5d2752fec63bfd5de7181a9 | 1,100 | PASSED |
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll strength = 0;
ll money = 0;
ll... | C++ | d03ad531630cbecc43f8da53b02d842e | 8743158903edca4cc792514eb9b44eed | 1,100 | PASSED |
//__________________________________________________________________
//
// Name: Codeforces
// Author: GogolGrind
//__________________________________________________________________
#include <bits/stdc++.h>
#define File_in(input) freopen(input, "r", stdin)
#define File_out(output) freopen(output, "w", std... | C++ | d03ad531630cbecc43f8da53b02d842e | 40d4bf7d5a087d48e2110705efe72c5d | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int i=0,j=n-1;
int k=0;
int s=0,d=0;
while(i<=j)
{
if(k%2==0)
{
if(a[i]>a[j])
{
s+=a[i];
... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 10b03bceedb358c5be5af87ab4c5d531 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int l=0,h=n-1;
int sumS=0;
int sumD=0;
for(int i=0;i<n;i++)
{
if(i%2==0)
{
if(arr[h]>arr[l])
{
su... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 020ec19c91ae87c096a2b268997c54c2 | 800 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int num_cards, sereja_score = 0, dima_score = 0;
cin >> num_cards;
vector<int> cards(num_cards);
for(int iter = 0; iter < num_cards; iter++){
cin >> cards[iter];
}
int i = 0, j = num_cards - 1, k = 0, max;
wh... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 8e08805cc0eb81c5c21e2acc35597ba1 | 800 | PASSED |
#include <iostream>
using namespace std;
int main(){
int n;
int suma = 0, sumb = 0;
cin >> n;
int *a = new int[n];
for (int i = 0; i<n; i++){ cin >> a[i]; }
int x = 0, y = n - 1;
while (true){
if (x > y){ break; }
else{
if (a[x]>a[y]){
suma += a[x];
x++;
}
else{
suma += a[y];
y--;
... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 1b8276fcd5ddc9c416eba1dd5a10130f | 800 | PASSED |
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | be143042a43171e67b57ff0ab234554e | 800 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int cards[n];
int sum_1=0,sum_2=0;
for(int i=0;i<n;i++){
cin >> cards[i];
}
int i = 0,j=n-1;
int flag =0;
while(i <= j){
if(cards[j]>cards[i]){
if(flag == 0){
... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 2a9be288c8ccb1e1784a3feb73044975 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
#define PI acos(-1.0)
typedef long long ll;
const int MOD = 1e9+7;
const int INF=0x3f3f3f3f;
int main()
{
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int i=0;
int j=n-1;
int s=0,d=0;
int ... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | d1ef12c598fd89de606df7ad8b4c7d36 | 800 | PASSED |
#include<stdio.h>
main()
{
int n,a[1000],i,b=0,c=0,k=1,q=0;
scanf("%d",&n);
for(i=0; i<n; i++)
scanf("%d",&a[i]);
for(i=0; i<=n; i++)
{
if(q==1) i--;
if(k)
{
if(a[i]>a[n-1]) b+=a[i],q=0;
else b+=a[n-1],q=1,n-=1;
k=0;
co... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 2ebeb339d963ec027d369cff2928d9ac | 800 | PASSED |
#include<stdio.h>
int main()
{
int n,a[10005];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int s1=0,s2=0,x=0,y=n-1,f=1;
for(int i=0;i<n;i++)
{
if(f)
{
if(a[x]>a[y])
{
s1+=a[x++];
}
els... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | ee766f6d39a13fbd1c386f74786ee459 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.