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 pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define ub upper_bound
#define lb lower_bound
#define bit __builtin_popcount
#define memset(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long ... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 572eb4924691cf7735d6394399ea254f | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 110;
ll t,n,m,k;
ll a[N];
int main()
{
cin>>t;
while(t--)
{
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
ll ans=m;
bool flag=1;
for(int i=2;i<=n;i++)
{
if(a[i-1]+m+k>=a[i])
{
int cur=min(a[i-1]+k-a[i],a[i-1]);
... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 9f52cdbd8a0ba45cdcbd1478161b61e3 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int T;cin>>T;
while(T--){
int a[105];
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
cin>>a[i];}
for(int i=2;i<=n;i++){
if(i>=2&&a[i-1]>0&&(a[i-1]+k>a[i]))
m+=min(a[i-1]-a[i]+k,a[i-1]);
else if(i>=2&&(a[i-1]+k<a[i]))
{m-=a[i]-a... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 4c200d5fc65435e89fe87d06cb4486ef | 1,200 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int main() {
// your code goes here
int t,diff;
cin>>t;
int n,m,k;
while(t--){
cin>>n>>m>>k;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
int b = m;
int i = 0;
while(i<n-1) {
diff = v[i+1] - v[i];
if( diff > k)... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 21bcdf357882f488114ec228d3db7004 | 1,200 | PASSED |
#include<iostream>
//#include <bits/stdc++.h>
#include<map>
#include<unordered_map>
#include<vector>
#include<utility>
#include<cstring>
#include<set>
#include<algorithm>
#include<cmath>
#include <iomanip> //std::cout << std::fixed; std::cout << std::setprecision(10); for precision
using namespace std;
//stoi,stoll ... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 79ec267d585b3f130de13781efa2e574 | 1,200 | PASSED |
/******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debu... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | cda86e99cb8db2a3630b747bdbacb338 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,m,k;
int h[105];
int main()
{
scanf("%d",&t);
while(t--)
{
int flag=0;
scanf("%d%d%d",&n,&m,&k);
scanf("%d",&h[0]);
for(int i=1;i<n;i++)
{
scanf("%d",&h[i]);
{
int ch=abs(h[i]... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | 629389d655fec8c4214532060141da75 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
string sol(int n,int m,int k, vector <int> &h){
int i=0;
while(i<n-1){
if(h[i]>=h[i+1]){
m+=h[i]-h[i+1];
m+=min(h[i+1],k);
}
else{
if(h[i+1]<=h[i]+k){
if(h[i+1]>=k)
m+=k+h[i]-h[i+1];
else
m+=h[i];
}else{
m-=h[i+1]-k-h[i];
if(... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | ff274adc1aaf247f8ee0230ba312fff3 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long t,n,m,k,h[1100],f;
int main(){
cin>>t;
for (int i=0;i<t;i++){
cin>>n>>m>>k;f=0;
memset(h,0,sizeof(h));
for (int j=0;j<n;j++) cin>>h[j];
for (int j=0;j<n-1;j++){
if (h[j]+k>=h[j+1])
m+=h[j]-max((long long)0,h[j+1]-k);
else{
if (abs(h[j]-h[j+1... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | d93de78e24b025e4c4b5b5c29700d808 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long num[105];
int main(){
ios::sync_with_stdio(false);
int t;
while(cin >> t){
while(t--){
long long n, m, k, ms;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
cin >> num[i];
}
bool flag = true;
for(int i = 1; i < n; i++){
if(num[i] ... | C++ | 3f60e740d9a3ec14223b2b1f62c52f61 | b82bbe8c81960a6a81b30b7cabcebd79 | 1,200 | PASSED |
import java.util.ArrayList;
import java.util.Scanner;
public class cf1b {
public static String xclToRow(String input){
String result;
int j=0;
ArrayList<Integer> letterValues = new ArrayList<>();
while(!Character.isDigit(input.charAt(j))){
letterValues.add(input.charAt(j... | Java | 910c0e650d48af22fa51ab05e8123709 | cd3bb97d73f115845893f17ca3601e68 | 1,600 | PASSED |
// package CodeForces;
import java.io.*;
import java.util.*;
public class Problem_1B {
public static StringBuilder add(StringBuilder s)
{
if(s.toString().equals("Z"))
return new StringBuilder("AA");
char c=s.charAt(s.length()-1);
c++;
// System.out.println(c);
if(c>'Z')
{
return add(s.replace(s.len... | Java | 910c0e650d48af22fa51ab05e8123709 | 2644a81d00bd1feb93d81b502063c2ea | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Z1B {
static char[] digits = {'a', 'b',
'c', 'd', 'e', 'f', 'g', 'h',
'i', 'j', 'k', 'l', 'm', 'n',
'o', 'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y', 'z'};... | Java | 910c0e650d48af22fa51ab05e8123709 | 85aa0e881c333dcd410a2a2240d53a90 | 1,600 | PASSED |
import javafx.util.*;
import java.util.*;
import java.io.*;
public class JavaApplication1 {
static long x, y, z;
static ArrayList<Integer>arr1 = new ArrayList<Integer>();
static ArrayList<Integer>arr2 = new ArrayList<Integer>();
public static void main(String[] args) throws IOException {
Scanne... | Java | e0b5169945909cd2809482b7fd7178c2 | 5d95b4bef2fd4d7394bab22f795daebf | 1,700 | PASSED |
import java.io.*;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
/**
* Created by vikas.k on 26/12/16.
*/
public class CF251D {
public static void main(String[] args){
CF251D gv = new CF251D();
gv.solve();
}
private int n,m;
private List<Long> ls... | Java | e0b5169945909cd2809482b7fd7178c2 | d643c3108e935c581e93bdfa4a9f81eb | 1,700 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
/... | Java | e0b5169945909cd2809482b7fd7178c2 | e7e99c14a63a7cba604961c4856f3c7e | 1,700 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.function.Function;
import java.util.StringTokenizer;
import java.io.BufferedRe... | Java | e0b5169945909cd2809482b7fd7178c2 | af87de09c78e1066e068d5e17aa91e19 | 1,700 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
/... | Java | e0b5169945909cd2809482b7fd7178c2 | 6d12a28fbcf8dda07236e05ee3b33dbe | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
public class Task2 {
static ArrayList<Long> arr1 ... | Java | e0b5169945909cd2809482b7fd7178c2 | 6a848dce605ce0a432520055e8405b2d | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Task2 {
static long []arr1 , arr2;
sta... | Java | e0b5169945909cd2809482b7fd7178c2 | ac04c065d8363ad062cfaf124d37fc17 | 1,700 | PASSED |
import java.io.*;
import java.util.*;
import java.util.Random;
import java.util.StringTokenizer;
public class Main {
long b = 31;
String fileName = "";
////////////////////// SOLUTION SOLUTION SOLUTION //////////////////////////////
long INF = Long.MAX_VALUE / 10000;
int MODULO = 1000*... | Java | e0b5169945909cd2809482b7fd7178c2 | 3cf56a2ce06178b50466d88d76a416f0 | 1,700 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | Java | e0b5169945909cd2809482b7fd7178c2 | 6d632358882030a490ef46b3716edd06 | 1,700 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
static int a[];
static int b[];
static long find(long mid){
long temp = 0;
for(int i = 0;i < a.length;i++){
if(mid >= a[i])
temp += mid - a[i];
}
for(int i = 0;i < b.length;i++){
if(mid < b[i])
temp += b[i] - mid;
}
return temp;
}
public static vo... | Java | e0b5169945909cd2809482b7fd7178c2 | 8a241e311e00abcd11aa372d8ce23c3c | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int... | C++ | 874ff1e3a04aa44616980c4cee618948 | b222ac291ca18e90672b522e1bd8254e | 3,300 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=500005;
struct edge{
int to,next,v;
}e[N*2];
int head[N],tot;
int deg[N];
int n,q;
ll *aim[N];
bool cmp(ll *a,ll *b){
return *a>*b;
}
void add(int x,int y,int v){
e[++tot]=(edge){y,head[x],v};
head[x]=tot;
}
struct Tree{
int S,fa[N][20]... | C++ | 874ff1e3a04aa44616980c4cee618948 | 1ea262ee4cb9d30ee76df9871df7d526 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define re register
struct eg{int to,c;eg*nx;}e[200100],*la[100100],*cnt=e;
inline void addE(re int a,re int b,re int c)
{
*++cnt=(eg){b,c,la[a]};la[a]=cnt;
*++cnt=(eg){a,c,la[b]};la[b]=cnt;
}
int dep[100100],dep1[100100],hv[100100],fa[100100],fl[100100],top[100100],no[100100],qe[100100],nm[10... | C++ | 874ff1e3a04aa44616980c4cee618948 | e080da3f1576fc081599b6b0ac86b730 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define re register
struct eg{int to;long long c;eg*nx;}e[200100],*la[100100],*cnt=e;
void addE(re int a,re int b,re long long c)
{
*++cnt=(eg){b,c,la[a]};la[a]=cnt;
*++cnt=(eg){a,c,la[b]};la[b]=cnt;
}
int d1[100100],s1[100100],n,q;
long long ans[100100],dis[100100],dis1[100100];
void dfs(re i... | C++ | 874ff1e3a04aa44616980c4cee618948 | 12cd180427d7eeac6b4da8a868303c2f | 3,300 | PASSED |
#include <cstdio>
#include <algorithm>
int n,q,head[100001],nxt[200001],b[200001],v[200001],k,dis[100001],fa[100001],stk[100001],top,sum;
void push(int s,int t,int val){
nxt[++k]=head[s];
head[s]=k;
b[k]=t;
v[k]=val;
}
void dfs(int x,int f){
if(!f)dis[x]=0;
fa[x]=f;
for(int i=head[x];i;i=nxt[i])
if(b[i]!=f){
... | C++ | 874ff1e3a04aa44616980c4cee618948 | 82e41cb1bb0dbe3e0ddd27b59d816265 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
const int MN=1e5+5;
int to[MN<<1],nxt[MN<<1],c[MN<<1],h[MN],cnt;
inline void ins(int s,int t,int w){
to[++cnt]=t;nxt[cnt]=h[s];h[s]=cnt;c[cnt]=w;
to[++cnt]=s;nxt[cnt]=h[t];h[t]=cnt;c[cnt]=w;
}
int n,m,lcnt,sum;
struct Tree{
int t... | C++ | 874ff1e3a04aa44616980c4cee618948 | 610423183892c457205a13d7759994cd | 3,300 | PASSED |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
const int MN=1e5+5;
int to[MN<<1],nxt[MN<<1],c[MN<<1],h[MN],cnt;
inline void ins(int s,int t,int w){
to[++cnt]=t;nxt[cnt]=h[s];h[s]=cnt;c[cnt]=w;
to[++cnt]=s;nxt[cnt]=h[t];h[t]=cnt;c[cnt]=w;
}
int n,m,lcnt,sum;
struct Tree{
int t... | C++ | 874ff1e3a04aa44616980c4cee618948 | df216037498b9236f793fc382e317927 | 3,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
int read()
{
int r=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')r=(r<<1)+(r<<3)+ch-'0',ch=getchar();
return r*f;
}
int n,Q;
struct data{
i... | C++ | 874ff1e3a04aa44616980c4cee618948 | c7993b8e1805cbae6f1b5fa79267a9f3 | 3,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
int read()
{
int r=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')r=(r<<1)+(r<<3)+ch-'0',ch=getchar();
return r*f;
}
int n,Q;
struct data{
i... | C++ | 874ff1e3a04aa44616980c4cee618948 | 76d2e952bd7394d181c41736baee7f8f | 3,300 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int fr[100010],ne[200010],v[200010],w[200010],bs=0;
void addb(int a,int b,int c)
{
v[bs]=b;
w[bs]=c;
ne[bs]=fr[a];
fr[a]=bs++;
}
int zj=0,wz;
void dfs0(int u,int f,int h)
{
if(h>zj)
zj=h,wz=u;
for(int i=fr[u];i!=-1;i=ne[i])
{
if(v[i]!=f)
dfs0(v[i],u,h+w[i]);
}
}
str... | C++ | 874ff1e3a04aa44616980c4cee618948 | 1fbb93286916e2e8956be28d8c2c0875 | 3,300 | PASSED |
//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
#include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1)*4
#define pb push_back
#define vpr... | C++ | 70986d3b1ff66ac612e8841a6049866d | ffedc97bda3384390fb7276ac26e7ea2 | 1,700 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define sz(s) (int)s.size()
#define clr(v, d) memset(v, d, sizeof(v))
#define pp push_back
#define pb pop_back
#... | C++ | 70986d3b1ff66ac612e8841a6049866d | 4a850da1744e0440a576041a344d01f5 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<int,int> unp; // num id
map<int,int> unp1; // num sum
int main()
{
int n; cin>>n;
int ma(0),id;
for(int i=1;i<=n;i++)
{
int a; cin>>a;
unp[i]=a;
unp1[a]=unp1[a-1]+1;
if(unp1[a]>ma) ma=unp1[a],id=a;
}
cout<<ma<<endl;... | C++ | 70986d3b1ff66ac612e8841a6049866d | ed193f46e954b2a8c1315d04a8e15cd3 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define ld long double
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define sc(x) scanf("%s",x)
#define pd(t) printf("%d\n",t)
#define plld(t) printf("%lld\n",t)
#define mp(a,b) make_pair(a,b)
#define pii pair<int,int>
#define pli pa... | C++ | 70986d3b1ff66ac612e8841a6049866d | 187c639d09294bc11402e56e423b30aa | 1,700 | PASSED |
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define ld long double
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define sc(x) scanf("%s",x)
#define pd(t) printf("%d\n",t)
#define plld(t) printf("%lld\n",t)
#define mp(a,b) make_pair(a,b)
#define pii pair<int,int>
#define pli pa... | C++ | 70986d3b1ff66ac612e8841a6049866d | 8c407d6a1ef98a1eb278edb1b9f9ee05 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define mod 1000000007
#define inf 1e15 + 7
#define ll long long
#define ld long double
#define vll vector < ll >
#define prll pair < ll , ll >
#define vprll vector < prll >
#define M map < ll , ll >
#define MK make_pair
#define F first
#define S s... | C++ | 70986d3b1ff66ac612e8841a6049866d | a3ac007e68e37f99aa635d53fa49dd49 | 1,700 | PASSED |
//Program.cpp
//Author : Aaryan Srivastava
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#define pb push_back
#define popb pop_back
#define ull unsigned long long
#define beg begin
#define mp make_pair
#define pii pair<int, int>
#define piii pair<pii,int>
#define rep(i,n) for(int (i) = 0 ; i < (n) ; i... | C++ | 70986d3b1ff66ac612e8841a6049866d | cc0abbb456a1505adfb8ac29808f0b3c | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
//#define int long long
const int N = 3e5 + 5;
map<int,int> mp;
int32_t main(){
IOS;
int n;
cin >> n;
int a[n];
for(int i=0;i<n ; ++i){
cin >> a[i];
}
int ans = -1;
int id = -1;
... | C++ | 70986d3b1ff66ac612e8841a6049866d | 6b78d8d9752d067b443be53e4a62ef4a | 1,700 | PASSED |
#include<bits/stdc++.h>
#define LL long long int
#define PI 3.14159265358979323846
#define MOD ((LL)1e9+7)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
IOS
map<LL,LL>Number_Length;
map<LL,set<LL>>Number_Indexs;
LL n;cin>>n;
for(LL i=0;i<n;i++)
{
LL x;cin>>x;
... | C++ | 70986d3b1ff66ac612e8841a6049866d | d67fe73ef5b66647bc679fd730f8c060 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define LL long long int
#define LD long double
#define PI 3.14159265358979323846
#define MOD ((LL)1e9+7)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
LL n;cin>>n;
map<LL,LL>M;
vector<LL>A(n);
map<LL,multiset<LL>>IM;
for(LL i=0;i<n;i++)
{... | C++ | 70986d3b1ff66ac612e8841a6049866d | fb30c0d7528876aff1046b176ce78773 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define ins insert
#define sb substr
#define con continue
#define ub upper_bound
#define lb lower_bound
#define pll pair<ll,ll>
#define pld pair<ld,ld>
... | C++ | d0030996e6b29c8580463fae43bb04d4 | f6410f38cbeab7cc024d7fe5294f9397 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forl(i,a,n) for(int i=a;i<n;i++)
#define fore(i,a,n) for(int i=a;i<=n;i++)
#define revforl(i,n) for(int i=n-1;i>=0;i--)
#define revfore(i,n) for(int i=n;i>0;i--)
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#defin... | C++ | d0030996e6b29c8580463fae43bb04d4 | f905d3de19187cdc603fbc047b03ef69 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
//const int MOD=998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
int n,ct=0;
string s;
cin>>n>>s;
if(n<=2){
cout<<"1\n";... | C++ | d0030996e6b29c8580463fae43bb04d4 | 318f7e8add16c982d64ddf71893be648 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t!=0){
int n;
cin>>n;
// int cnt=0;
string s;
cin>>s;
int i=0,j=0,cnt=0;
vector<int>v;
while(i<n&&j<n){
if(s[i]==s[j])
cnt++,j++;
else{
v.push_back(cnt);
... | C++ | d0030996e6b29c8580463fae43bb04d4 | 221ae1adc400218aaf98f98c6da64f69 | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define vec vector
#define pb push_back
#define pp pop_back
#define fi first
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define se second
#define un_map unordered_map
#define rep(i,a,n) for (int i = a; i < n; ++i)
#... | C++ | d0030996e6b29c8580463fae43bb04d4 | 24507c61833e3b8121a1c3c811c89ab5 | 1,700 | PASSED |
#include <map>
#include <set>
#include <list>
// #include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <iostream>
#include <stdlib.h>
#include <algorithm>
// #include <unordered_map>
using namespace std;
typedef long long... | C++ | d0030996e6b29c8580463fae43bb04d4 | 5f484d88464430898907aa0eb0df33d0 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define INF 1e9
#define EPS 1e-9
#define bitcount __builtin_popcount
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < ... | C++ | d0030996e6b29c8580463fae43bb04d4 | 60cca95fd3e42ade2832f382672ae58c | 1,700 | PASSED |
// mujhe chutiya likhne ka man to nhi tha but mai hu!!
#include<bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define mod 1000000007
#define mod2 998244353
#define int long long
#define endl '\n'
#define p_b push_back
#define m_p make_pair
#define fas... | C++ | d0030996e6b29c8580463fae43bb04d4 | b3a217285a134a3f38e30cd12aa97baf | 1,700 | PASSED |
#include<bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define mod 1000000007
#define mod2 998244353
#define int long long
#define endl '\n'
#define p_b push_back
#define m_p make_pair
#define fastIO ios_base::sync_with_stdio(false),cin.tie(NULL)
using... | C++ | d0030996e6b29c8580463fae43bb04d4 | 2767df1890883a7de92397905ac8d30a | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
char buf[200043];
int main()
{
int t;
scanf("%d", &t);
for(int tc = 1; tc <= t; tc++) {
int n;
scanf("%d", &n);
scanf("%s", buf);
string s = buf;
queue<int> q;
int cur = 0;
for(int i = 0; i < n; i++)
{
if(i > 0 && s[i] != s[i - 1])
cur++;
i... | C++ | d0030996e6b29c8580463fae43bb04d4 | 58e72b6d797176578277d4466e618dcd | 1,700 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <deque>
#include <queue>
#include <cstring>
#include <set>
#include <list>
#include <map>
#include <ctime>
#include <random>
#include <unordered_map>
#include <stdio.h>
using namespace std;
typedef long long ll;
t... | C++ | ede40397da124bebb40903e4a0d6a349 | 7578ce9c74d55775e1774bff666113f4 | 2,900 | PASSED |
#include <stdio.h>
#include <bits/stdtr1c++.h>
#define clr(ar) memset(ar, 0, sizeof(ar))
#define read() freopen("lol.txt", "r", stdin)
#define dbg(x) cout << #x << " = " << x << endl
#define ran(a, b) ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a))
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC ta... | C++ | ede40397da124bebb40903e4a0d6a349 | fc6334d809c8e210afa15e598444e55c | 2,900 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define F first
#define S second
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define pii pair <int ,int >
#define bug(x) cout<<"passed "<<x<<endl;
long long const inf = 1e18, linf... | C++ | ede40397da124bebb40903e4a0d6a349 | 463358167d1677e6bfe3d2b132c035b0 | 2,900 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define F first
#define S second
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define pii pair <int ,int >
#define bug(x) cout<<"passed "<<x<<endl;
long long const inf = 1e18, linf... | C++ | ede40397da124bebb40903e4a0d6a349 | 28175fa861cfa468e073c015c2ce710a | 2,900 | PASSED |
//In the name of Allah
//In the name of the compassionate of the merciful
//Ya Ali!
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll ;
typedef long double ld ;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistic... | C++ | ede40397da124bebb40903e4a0d6a349 | bb932dde9dbd55b196e1b0a515898dc1 | 2,900 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long LL;
const int N=1000000+10;
int n; LL a[N];
int mp1[2][N],mp2[2][N];
LL res=0;
LL gcd(LL x,LL y){
return y==0?x:gcd(y,x%y);
}
vector<LL> getFac(LL x){
vector<LL> v;
for(LL g=1;g*g<=x;g++){
... | C++ | ede40397da124bebb40903e4a0d6a349 | bd66a655f08b5ab952bb477b7d19f3f7 | 2,900 | PASSED |
#include <bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
using namespace std;
ll n,a[2000000],ans=1;
map <ll, ll> zzz;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i=0;i<n... | C++ | ede40397da124bebb40903e4a0d6a349 | 18ccb6d3391f9dca634a67a70fea80bf | 2,900 | PASSED |
from sys import stdin, stdout
for i in range(int(input())):
s = stdin.readline()
r = s.count('R')
u = s.count('U')
l = s.count('L')
d = s.count('D')
r = l = min(r,l)
u = d = min(u,d)
if r == u == 0:
stdout.write('0\n')
elif r == 0 or u == 0:
stdout.write('2\n')
stdout.write('%s\n' % ('... | Python | 1fba9a290d0492a3d658a7a33388db13 | 408815d6be4b444ec6d5931a8390bced | 1,200 | PASSED |
for _ in range(int(input())):
x=input()
L,R,U,P=x.count('L'),x.count("R"),x.count("U"),x.count("D")
if not((L>0 and R>0) or (U>0 and P>0)):
print(0)
elif L>0 and R>0 and U>0 and P>0:
h,v=min(L,R),min(U,P)
print(2*h+2*v)
print('L'*h+'U'*v+'R'*h+'D'*v)
else:
print(2)
print('L'+'R' if (L>0 and R>0) else '... | Python | 1fba9a290d0492a3d658a7a33388db13 | f11cb529202e1e02b890da2137a60bd0 | 1,200 | PASSED |
for _ in range(int(input())):
s=input()
l,r,u,d=s.count("L"),s.count("R"),s.count("U"),s.count("D")
a,b=min(l,r),min(u,d)
if a==0 and b==0: print(0)
elif a==0 and b>0: print(2,"UD",sep='\n')
elif b==0 and a>0: print(2,"LR",sep='\n')
else:
print(2*(a+b),"L"*a+"U"*b+"R"*a+"D"*b,sep='\n')
| Python | 1fba9a290d0492a3d658a7a33388db13 | 29e98b7e188c30f8e3899365dde5607e | 1,200 | PASSED |
for _ in range(int(input())):
s=input()
l,r,u,d=s.count("L"),s.count("R"),s.count("U"),s.count("D")
a,b=min(l,r),min(u,d)
if a==0 and b>0: b=1
elif b==0 and a>0: a=1
print(2*(a+b),"L"*a+"U"*b+"R"*a+"D"*b,sep='\n')
| Python | 1fba9a290d0492a3d658a7a33388db13 | 4bb77f664329767cf22368362907f1ff | 1,200 | PASSED |
from sys import stdin
r = stdin.readline
def main():
cases = int(r())
for case in range(cases):
comm = r().strip()
count = {"D":0, "U":0, "R":0, "L":0}
for com in comm: count[com]+=1
inst = ""
up, down, right, left = count["U"], count["D"], count["R"], count["L"]
... | Python | 1fba9a290d0492a3d658a7a33388db13 | 3dc9de45bffa3e8df788b8556fde1dd8 | 1,200 | PASSED |
MOD = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
for _ in range(ii()):
s = si()
l, r, u, d = s.count('L'), s.count('R'), s.count('U'), s.count(... | Python | 1fba9a290d0492a3d658a7a33388db13 | 809360ba333110090bfab711f5398d8f | 1,200 | PASSED |
## 1272B
n=int(input())
for i in range(n):
s=input()
u=s.count('U')
d=s.count('D')
l=s.count('L')
r=s.count('R')
# print(l,r,u,d)
if min(u,d)==0 and min(l,r)!=0:
print(2)
print('LR')
elif min(u,d)!=0 and min(l,r)==0:
print(2)
print('UD')
else:
print(2*(min(l,r)+min(u,d)))
print(min(l,r)*'L'+min(... | Python | 1fba9a290d0492a3d658a7a33388db13 | 996880222b55943af69c9ab0f3041a93 | 1,200 | PASSED |
if __name__ == '__main__':
# print("saddess".replace("s", "", 1))
t = eval(input())
inputs = list()
for _ in range(t):
temp = input()
inputs.append(temp)
for walks in inputs:
length = len(walks)
walked = [0] * 4 # left, right, up, down
prev = ""
for x... | Python | 1fba9a290d0492a3d658a7a33388db13 | 80866f45ea70591fc3cf5cc3d673a4c7 | 1,200 | PASSED |
if __name__ == '__main__':
# print("saddess".replace("s", "", 1))
t = eval(input())
inputs = list()
for _ in range(t):
temp = input()
inputs.append(temp)
for walks in inputs:
length = len(walks)
walked = [0] * 4 # left, right, up, down
prev = ""
for x... | Python | 1fba9a290d0492a3d658a7a33388db13 | 0b127e86b0589feb967358f893370ad4 | 1,200 | PASSED |
import sys
input = sys.stdin.readline
q = int(input())
for _ in range(q):
s = input()[:-1]
cntU = s.count("U")
cntD = s.count("D")
cntL = s.count("L")
cntR = s.count("R")
minLR = min(cntR, cntL)
minUD = min(cntU, cntD)
if minLR > 0 and minUD > 0:
ans = minLR * 2 ... | Python | 1fba9a290d0492a3d658a7a33388db13 | fb217b9600a98754dcbe4e4247767bfe | 1,200 | PASSED |
#include<stdio.h>
int main()
{
int i,m,a,b,temp;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&a);
//int A[a];
int B[3];
for(int j=0;j<3;j++)
{
B[j]=0;
}
for(int j=0;j<a;j++)
{
scanf("%d",&b);
temp=b%3;... | C | e59cddb6c941b1d7556ee9c020701007 | d8f8cdc2db92ff8125f75e7765a2ee05 | 1,100 | PASSED |
#include<stdio.h>
#include<memory.h>
int main(){
int num;
scanf("%d", &num);
int ans[num];
memset(ans, 0, sizeof(ans));
int i, j, k;
for(i=0;i<num;i++)
{
int n;
int zero = 0;
int one = 0;
int two = 0;
scanf("%d", &n);
int arr[n], arr_2[n];
for(j=0;j<n;j++)
{
scanf("%d", &arr[j]);
arr_2[j]... | C | e59cddb6c941b1d7556ee9c020701007 | 3d34324b53e4903cf3bdf2267903a2a9 | 1,100 | PASSED |
#include <stdio.h>
int main(){
int n,t,b[3],x,res;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
b[0]=0;b[1]=0;b[2]=0;res=0;
while(n--){
scanf("%d",&x);
b[x%3]++;
}
res+=b[0];
if(b[1]>b[2]){
res=res+b[2]+(b[1]-b[2])/3;
}
else{
res=res+b[1]+(b[2]-b[1])/3;
}
printf("%d\n",res);
}
} | C | e59cddb6c941b1d7556ee9c020701007 | f5401d20c17e488bfa62edefd2b28420 | 1,100 | PASSED |
#include<stdio.h>
int ara2[3];
int main()
{
int i,n,sum=0,x=0,y=0,t,j;
scanf("%d",&t);
int ara3[t];
for(j=0;j<t;j++){
scanf("%d",&n);
long long int ara[n];
for(i=0;i<n;i++){
scanf("%lld",&ara[i]);
ara[i]=ara[i]%3;
ara2[ara[i]]++;
}
... | C | e59cddb6c941b1d7556ee9c020701007 | 598b1d6dfc2e62db1983c94b207bc85b | 1,100 | PASSED |
#include<stdio.h>
int main() {
int t,n;
scanf("%d",&t);
int temp;
int modthr[3];
for (int i = 0; i < t; i++) {
modthr[0]=modthr[1]=modthr[2]=0;
scanf("%d",&n);
for (int j = 0; j < n; j++) {
scanf("%d",&temp);
modthr[temp%3]++;
}
if (modthr[1]<modthr[2]) {
modthr[0]+=modth... | C | e59cddb6c941b1d7556ee9c020701007 | b4a371ac7c47a8c92f68a63b8844e09e | 1,100 | PASSED |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int query,i,j,count0=0,count1=0,count2=0;
scanf("%d",&query);
int *q=malloc(query*sizeof(int));
int **a=malloc(query*sizeof(int*));
int *result=malloc(query*sizeof(int));
for(i=0;i<query;i++)
{
count0=0;
count1=0;
count2=0;
scanf("%d",&q[i]);
a[i]=mall... | C | e59cddb6c941b1d7556ee9c020701007 | 5cb48b2e4570d52dee759f8625d2317a | 1,100 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main() {
int num, q, n, num_ones, num_twos, num_threes;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
num_ones = num_twos = num_threes = 0;
scanf("%d", &n);
for (int j = 0; j < n; j++) {
scanf("%d", &num);
if (num ... | C | e59cddb6c941b1d7556ee9c020701007 | cf401d0ff584bf9e13284f15c6be4dc6 | 1,100 | PASSED |
#include <stdio.h>
int main()
{
int t,n,ara[101];
scanf("%d",&t);
for(int i=0 ; i<t ; i++)
{
int a=0,b=0,c=0;
scanf("%d",&n);
for(int i=0 ; i<n ; i++)
{
scanf("%d",&ara[i]);
if(ara[i]%3 == 0)
a++;
else if(ara[i]%3 == 1)
... | C | e59cddb6c941b1d7556ee9c020701007 | 8c71e1d11bdc5ba221e189df0fc74075 | 1,100 | PASSED |
#include<stdio.h>
int main()
{
int t,n;
scanf("%d", &t);
while(t--)
{
int count = 0, one = 0, two = 0;
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
int temp;
scanf("%d", &temp);
if(temp%3 == 0)
count++;
else if(temp%3 == 1)
one++;
else
two++;
}
if(one>two)
{
one ... | C | e59cddb6c941b1d7556ee9c020701007 | ba27c44926ef7a4ef8e25e77a04e4297 | 1,100 | PASSED |
#include<stdio.h>
#include<stdlib.h>
long long a[1000000];
long long amin(long long a,long long b)
{
if(a>b) return b;
else return a;
}
int main()
{
long long n;
scanf("%I64d",&n);
n=n+1;
int i;
while(n=n-1)
{
long long m;
scanf("%I64d",&m);
long long m3y1=0;
long long div3=0;
long long m3y2=0;
fo... | C | e59cddb6c941b1d7556ee9c020701007 | cf1dd23441ebbe809389ee7e7cdbc914 | 1,100 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
public class JzzhuandCities {
public static class node implements Comparable<... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 8f0ee9d3f6069722e0928e5f5968978d | 2,000 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class Div2_257_D {
static long INFINITY = 1000000000000l;
static int nodes;
static int edges;
static int trains;
static long distance[];
static in... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 7237168685fc2fdcb0c02fa6a08b9048 | 2,000 | PASSED |
import java.util.*;
import java.io.*;
public class CF257D {
class EdgeList extends HashMap<Integer, List<Integer>> {};
// multigraph
// src -> (dest -> [costs of edges])
static EdgeList [] graph;
static CF257D c;
private static void populateEdge (int u, int v, int x) {
EdgeList nbrs = graph[u];
if (... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 325e7ad073f6f11666527c07b9c15772 | 2,000 | PASSED |
import java.util.*;
import java.io.*;
public class B257 {
public static void main(String[] args) throws IOException
{
input.init(System.in);
int n = input.nextInt(), m = input.nextInt(), k = input.nextInt();
ArrayList<Edge>[] g = new ArrayList[n];
for(int i = 0; i<n; i++) g[i] = new ArrayList<Edge>();
... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 293f4b98d31c43dca298bdf977c8a033 | 2,000 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class PD2 {
public static void main(String[] args) {
MyScanner scanner = new MyScanner();
int n = scanner.nextInt();
int m = scanner.nextInt();
int k = scanner.nex... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 6cc8504a8f4f5cf23dfa5602339b389a | 2,000 | PASSED |
import java.io.*;
import java.util.*;
import java.util.List;
public class Main {
private static StringTokenizer st;
private static BufferedReader br;
public static long MOD = 1000000007;
public static void print(Object x) {
System.out.println(x + "");
}
public static String join(List<?... | Java | 03d6b61be6ca0ac9dd8259458f41da59 | 908880263d5c150004ef8907c36a8c15 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n , m , k , x , y , z , vis[100005];
long long cost[100005];
struct edge{
long long node , cost , Train;
edge(int n , int c , int t):
node(n) , cost(c) , Train(t){}
bool operator<(const edge &e)const{
if(this->cost == e.cost)
retu... | C++ | 03d6b61be6ca0ac9dd8259458f41da59 | 7656b9294858ee36fe2404940fc6ba9d | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
fstream in ( "data.in" , ios::in );
fstream out( "data.out", ios::out );
const int DIM = 1e5 + 5;
vector<tuple<int, int, int>> edg[DIM];
long long dst[DIM];
priority_queue< pair<long long, int>,
vector<pair<long long, int>>,
greate... | C++ | 03d6b61be6ca0ac9dd8259458f41da59 | de437be9066d92ab42d6b92245288af6 | 2,000 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define lp(a,i,m) for(int i=a;i<m;i++)
#define lpR(a,i,m) for(int i=m-1;i>=a;i--)
#define ll long long
#define pb push_back
#define read(n) scanf("%d",&n)
///YOU CAN DO IT ACPC2018!!
///Take a risk dont always play it safe or you wil... | C++ | 03d6b61be6ca0ac9dd8259458f41da59 | 479b72aeef6b7a3d3853bb66d65457b9 | 2,000 | PASSED |
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int N, M, K, p[maxn], vis[maxn];
ll d[maxn];
vector<pii> g[maxn];
void init () {
scanf(... | C++ | 03d6b61be6ca0ac9dd8259458f41da59 | 0bdb8a3c5b144e7dcb84dd3b88088a54 | 2,000 | PASSED |
#include<cstdio>
int main()
{
int a=0,b=0,c=0,d=0,e=0;
int n=0,N;
int ok=1;
scanf("%d",&N);
while (n<N)
{
int x;
scanf("%d",&x);
if (x==1)a++;
else if (x==2)b++;
else if (x==3)c++;
else if (x==4)d++;
else if (x==6)e++;
else ok=0;
... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 9abceb38566497d312fd9ada16ef9d7d | 1,200 | PASSED |
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1e6;
int s[MAXN];
int num[MAXN];
int main(void)
{
int n; scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%d", &s[i]);
if(s[i] == 5 || s[i] == 7)
{
printf("-1");
return 0;
... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | c1ff2b2fdcec69a47c038c94aff9358f | 1,200 | PASSED |
#include<stdio.h>
int main()
{
int sum,n,a[99999],dui,r;
int a1=0,a2=0,a3=0,a4=0,a5=0,a6=0,a7=0;
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
switch(a[i]){
case 1:a1++;break;
case 2:a2++;break;
case 3:a3++;break;
... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | b876271f507600f364f0af6a5ca5868c | 1,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define maxn 100 + 5
//#define LOCAL
using namespace std;
int num[maxn];
int ans[maxn];
int main()
{
#ifdef LOCAL
freopen("date.in","r",stdin);
freopen("date.out","w",stdout);
#endif // LOCAL
int n;
scanf("%d",&n);
memset(ans... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | a6f36ee018268e877403e93989e429b4 | 1,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define maxn 100 + 5
//#define LOCAL
using namespace std;
int num[maxn];
int ans[maxn];
int main()
{
#ifdef LOCAL
freopen("date.in","r",stdin);
freopen("date.out","w",stdout);
#endif // LOCAL
int n;
scanf("%d",&n);
memset(ans... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 59ea163d1443eef8b8913a549d1809a2 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define dep(i,b,a) for (int i = (b); i >= (a); -- i)
using namespace std;
int num[10], n;
bool work() {
if (n % 3) return 0;
rep(i, 1, n) {
int x;
scanf("%d", &x);
if (x <= 0 || x > 7) return 0;
num[x] ++;
}... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | e83c4e4939b88760412cb41957bc2d20 | 1,200 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int a[10];
int main()
{
int n;
int tmp;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&tmp);
a[tmp]++;
}
if(!a[5]&&!a[7]&&a[1]==a[2]+a[3]&&a[1]==a[4]+a[6]&&a[2]>=a[4])
{
... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 561f257316d502e3c7c06b9070c81b59 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int num[7] = {0};
int main()
{
int n,s,flag = 1;
scanf("%d",&n);
for (int i = 0;i < n;i++)
{
scanf("%d",&s);
if (s == 5 || s == 7)
{
flag = 0;
}
else
{
num[s]++;
}
}
if (flag == 1 && num[1] == num[2] + num[3] && num[2] >= num[4] && num[1] == num[4]... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 0fd4f8945d9e65e54d30ee9463bfa944 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int num[7] = {0};
int main()
{
int n,s,flag = 1;
scanf("%d",&n);
for (int i = 0;i < n;i++)
{
scanf("%d",&s);
if (s == 5 || s == 7)
{
flag = 0;
}
else
{
num[s]++;
}
}
if (flag == 1 && num[1] == num[2] + num[3] && num[2] >= num[4] && num[1] == num[4]... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 075a58c7b773c4bbe46a886c0d4f1664 | 1,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n;
int sum[8];
const int maxn=1e6+3;
int a[maxn];
int ans[maxn][3];
int cou;
int main()
{
while(~scanf("%d",&n))
{
cou=0;
memset(sum,0,sizeof(sum));
for(int i=0;i<n;i++)
{
sc... | C++ | 513234db1bab98c2c2ed6c7030c1ac72 | 98dd4d3d8ba815d03345de82898cc1ce | 1,200 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.