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 watch(x) std::cout << (#x) << " is " << (x) << std::endl
// using LL = long long;
// class HLPP {
// int n;
// // e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// // g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
// std::vector<std::pair<int, int>> e;
// std::vector<std::vect... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 22da18228f21562e77171c2cc4213024 | 2,700 | PASSED |
// #include <bits/stdc++.h>
// #define watch(x) std::cout << (#x) << " is " << (x) << std::endl
// using LL = long long;
// class HLPP {
// int n;
// // e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// // g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
// std::vector<std::pair<int, int>> e;
// std::vector<std::vect... | C++ | 198b6e6b91c7b4655d133a78421ac249 | b51e8b8988e775f505227ea5258ff90c | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
class HLPP {
int n;
// e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
std::vector<std::pair<int, int>> e;
std::vector<std::vector<int>> g;
std::vector<i... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 4c4f925470827639421cfe57dbcf1e95 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
// 结合 https://www.cnblogs.com/owenyu/p/6852664.html 在实现上进行了响应的修改
class ISAP {
int n, s, t;
// e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
std::vector<st... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 3b3ae2d5e98536ffa1e8c8b4732f1a6c | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
class Dinic {
int n;
std::vector<std::unordered_map<int, int>> g;
std::vector<std::unordered_map<int, int>::iterator> cur;
std::vector<int> h;
// h[i] 表示 bfs 从 s 到 i 的距离，如果找到了 t，那么就说明找到了增广路。
... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 5b5b0c06bd929fe9185dbc9beb5d556a | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
class Dinic {
int n;
std::vector<std::map<int, int>> g;
std::vector<std::map<int, int>::iterator> cur;
std::vector<int> h;
// h[i] 表示 bfs 从 s 到 i 的距离，如果找到了 t，那么就说明找到了增广路。
bool bfs(int s, int ... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 54c5de968ed86349c0d89bba7cac0d95 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
// 结合 https://www.cnblogs.com/owenyu/p/6852664.html 在实现上进行了响应的修改
class ISAP {
int n, s, t;
// e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
std::vector<st... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 14afda9af04c76c5e7c788e78c913df1 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
// 结合 https://www.cnblogs.com/owenyu/p/6852664.html 在实现上进行了响应的修改
class ISAP {
int n, s, t;
// e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
std::vector<st... | C++ | 198b6e6b91c7b4655d133a78421ac249 | f9d75bb8b34931b14bc1c1cf0d62f720 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
class Dinic {
int n;
// e[i] 表示第 i 条边的终点和容量，注意存边的时候 e[i ^ 1] 是 e[i] 的反向边。
// g[u] 存的是所有以 u 为起点的边，这就很像链式前向星的做法
std::vector<std::pair<int, int>> e;
std::vector<std::vector<int>> g;
std::vector<... | C++ | 198b6e6b91c7b4655d133a78421ac249 | d0d668374cad9dc838d52eec4aba3841 | 2,700 | PASSED |
// LUOGU_RID: 92700308
#include<bits/stdc++.h>
const int N=100000;
int a[N];
int main(){
int n,i,j,x,sum,k,min;
scanf("%d",&n);
while(n--){
scanf("%d",&x);
i=x;
while(i--){
scanf("%d",&a[x-1-i]);
}
for(j=0;j<x;j++){
sum+=a[j];
}
min=a[0];
for(k=1;k<x;k++){
min=(min>a[k])?a[k... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 15a59f8e5fc4c2bd8a625cbf72538cf2 | 800 | PASSED |
// LUOGU_RID: 92653293
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, n, j, i, a[2000], min, sum;
cin >> t;
for(i=0;i<t;i++)
{
cin >> n;
sum=0;
cin >> a[0];
min=a[0];
for(j=1;j<n;j++)
{
cin >> a[j];
if(a[j]<min)
{
min=a[j];
}
}
for(j=0;j<n;j++)
... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | dedaefb662d837e26f9e8e007979a26d | 800 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n,a[10005];
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
}
sort(a + 1,a + 1 + n);
int ans = 0;
for(int i = 1;i <= n;i++){
ans += a[i] - a[1];
}
cout << ans << endl; ... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 84aeffb339316a92d39cf6b941ac49e9 | 800 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
long long ans=0;
int a[10005];
for(int i=1;i<=n;i++) {
cin >> a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++) {
ans=ans+(a[i]-a[1]);
}
cout << ans << e... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 76664e47d1cb0dd89125ebc6cb97b42c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAX_INT = 2147483647;
const int MAXN = 55;
int T;
int n;
int a[MAXN];
int ans;
int main()
{
scanf("%d",&T);
while(T--)
{
memset(a,0,sizeof(a));
scanf("%d",&n);
int minn = INT_MAX;
ans = 0;
for(int i=0;i<n;++i)
{
scanf("%d",... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | c7712301486ff5e4df440b4aebd6f021 | 800 | PASSED |
//this code is make by Yuan2008
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100;
void solve()
{
ll res=(ll)0;
ll n;
scanf("%lld",&n);
vector<ll> v(n);
for(ll i=0;i<n;i++)
{
scanf("%lld",&v[i]);
res+=v[i];
}
ll minn=1e17+10;
for(ll i=0;i<n;i++) minn=min(m... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 2b30d1c5a699e670ecc629cc02654e9b | 800 | PASSED |
#include<stdio.h>
int main()
{
int t,n,a[52],i;
scanf("%d",&t);
while(t--){
int sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int min=a[0];
for(i=1;i<n;i++){
if(a[i]<min)
min=a[i];
}
for(i=0;i<n;i++){
if(a[i]>min)
sum+=(a[i]-min);
}
printf("%d\n"... | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 0143a2d330ebd4bac4aa7081595f35d5 | 800 | PASSED |
#include<iostream>
using namespace std;
int a[55];
int main(){
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int b = 10000000;
int cnt = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
b = min(b,a[i]);
cnt+=a[i];
}
cout << cnt-b*n << endl;
}
return 0;
} | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | e55103176129a28c1f840d5e59d70393 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,x,mi,sum;
int main(){
cin>>t;
while(t--){
sum=0,mi=1e9;
cin>>n;
for(int i=1;i<=n;i++){
cin>>x;
sum+=x;
mi=min(mi,x);
}
cout<<sum-n*mi<<endl;
}
return 0;
} | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 005cc9c9a6bd6c427b4bca3110604cb4 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[55],sum=0;
int main(){
int t,n;
cin>>t;
while(t--) {
sum=0;
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a[i];
sum+=a[i];
}
sort(a+1,a+n+1);
cout<<sum-n*a[1]<<endl;
}
return 0;
} | C++ | 20dd260775ea71b1fb5b42bcac90a6f2 | 4b40136d241838b519b62075e5594bc5 | 800 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = array('i', map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | 288c9e871150bc8cd1fd0b9c5069ab35 | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | 1cdf32a9609d533075b9867fbc616ebe | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | a587a14c03517accdd6419ecbfed004e | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | 2c958c21740ba26e6d39b28be5be2882 | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = array('i', map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | abdbe549487d73c85c81b6dc7ea8de42 | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = array('Q', map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | ca23f87672c16eed03fffcc866b5d908 | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | 8acbfa9cef3a2535a8d568ae77587ab9 | 1,500 | PASSED |
from array import array
for _ in range(int(input())):
n = int(input())
a = array("i", map(int, input().split()))
ans = 0
# Codeforces 1676H2 Maximum Crossings
# https://codeforces.com/contest/1676/problem/H2
def mergeSort(arr):
global ans
if len(arr) < 2:
... | Python | 35dccda260cfdaea651d1950df452e7a | c1ea5e9ea6547aef902bd1a42ca07c98 | 1,500 | PASSED |
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
def mergeSort(arr):
global ans
if len(arr) < 2:
return arr
mid = len(arr)//2
L = arr[:mid]
R = arr[mid:]
... | Python | 35dccda260cfdaea651d1950df452e7a | 426fb0eabbddf4114a2141eb90e00484 | 1,500 | PASSED |
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ans = 0
def mergeSort(arr):
global ans
if len(arr) < 2:
return arr
mid = len(arr)//2
L = arr[:mid]
R = arr[mid:]
mergeSort(L)
mergeSort(R)
... | Python | 35dccda260cfdaea651d1950df452e7a | 6142b4d05eacb87deaa9ec2753d4bb80 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define Sameh cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
using namespace std;
#define ll long long
#define e '\n'
#define SFG(x) x.rbegin(),x.rend()
#define YES cout <<"YES"<<e
#define NO cout <<"NO"<<e
int main()
{
Sam... | C++ | a3df5d51538658e8c9356f9e848debcf | 481d56beff0676c6ef51242949ce7dae | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
signed main(void) {
int testcase=1;
cin>>testcase;
while(testcase--){
int n,q;
cin>>n>>q;
vector<int>v(n),pref(n);
for(int i=0; i<n; i++)
cin>>v[i];
sort(v.rbegin(),v.rend());
pref[0]=v[0];
... | C++ | a3df5d51538658e8c9356f9e848debcf | c56816c0518c2b515eaf60c96e63a1ed | 1,100 | PASSED |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define minint INT_MIN
#define maxint INT_MAX
#define fori(x,n) for(int i=(x);i<(n);++i)
#define all(v) v.begin(),v.end()
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define endl '\n'
using namespace st... | C++ | a3df5d51538658e8c9356f9e848debcf | d19171598dcc5d93a1b905006d709e2b | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int a[N], s[N];
bool cmp(int a, int b){
return a > b;
}
int main(){
int t, n, q;
scanf("%d", &t);
while(t--){
scanf("%d%d",&n,&q);
s[0] = 0;
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
s[i] = s[i - 1] + a[i];
}
sort(a + 1, a +... | C++ | a3df5d51538658e8c9356f9e848debcf | 02361026a5eaebde84da0ef703f4d066 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--){
int n, q;
cin >> n >> q;
vector<long long> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.rbegi... | C++ | a3df5d51538658e8c9356f9e848debcf | da3bc855e83b119e5d119fe88329de2a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;cin>>t;
while(t--)
{
long long n,q;cin>>n>>q;
vector<long long>arr1(n);
for(int i=0;i<n;i++)
{
cin>>arr1[i];
}
sort(arr1.rbegin(),arr1.rend());
// reverse(arr1.begin(),arr1.e... | C++ | a3df5d51538658e8c9356f9e848debcf | f0979cc664c4976652c92370ea2916bb | 1,100 | PASSED |
#include <iostream>
#include <bits\stdc++.h>
#define ll long long int
using namespace std;
void fast()
{
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
/*bool pred( ll r , ll x)
{
return (x*x*x <=r);
}
ll BS(ll l , ll r)
{
ll lo = l , hi =r;
ll mid , ans = 0;
while(lo<=hi)
{
... | C++ | a3df5d51538658e8c9356f9e848debcf | ed7f35ca17faa41d7d527506ac25b38d | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t;
cin >> t;
while(t--)
{
int n, q;
cin >> n >> q;
vector<int>v(n);
i... | C++ | a3df5d51538658e8c9356f9e848debcf | e406729a56f901b5a9954a965403842c | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define inf 0x3f3f3f3f
int i,j,k,n,m,t,flag,ans,sum,s[200100],x,a[200100];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin>>t;
while(t--)
{
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n,greater<int>());
for... | C++ | a3df5d51538658e8c9356f9e848debcf | 5e05649f194858cb169e76328a80a687 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define NO {puts("NO") ; return ;}
#define YES {puts("YES") ; return ;}
using namespace std;
typedef long long ll;
const int N = 1e5+5e4+5;
int f[N],g[N];
int n,m,t;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>m;
memset(g,0,sizeof g);
int sum2=0;
for(in... | C++ | a3df5d51538658e8c9356f9e848debcf | 1d47fb8840fcffe450ee0d750ecb9de6 | 1,100 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t ;
cin >> t ;
while(t--){
string s ;
cin >> s ;
int sum = 0;
int flag =0;
for (int i =0 ; i < 3 ; i ++){
sum += (int)(s[i]-0);
}
for (int i =3 ; i < 6 ; i ++){
flag += (int)(s[... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 1305735e15af1cee605a68e11fe6777f | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
char a[6];
for(int i=0;i<=5;i++) cin>>a[i];
if((a[0]+a[1]+a[2])==(a[3]+a[4]+a[5])) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
| C++ | c7a5b4a015e28dd3759569bbdc130e93 | 73b2dcdab9fd5426d06508995e00cf7a | 800 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
while (n --)
{
string ch;
cin >> ch;
int sum1 = 0, sum2 = 0;
for (int i = 0; i < 3; i ++)
{
sum1 += ch[i] - '0';
}
for (int i = 3; i < 6; i ++... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 643af94de20bc448d1c611853780b346 | 800 | PASSED |
#include<iostream>
#include <string.h>
using namespace std;
int n, m;
void solve() {
string str; cin >> str;
int ls = 0, rs = 0;
for (int i = 0; i < 3; i++) {
ls += str[i] - '0';
rs += str[5 - i]-'0';
}
if (ls == rs)printf("YES\n");
else printf("NO\n");
}
signed main() {
cin >> n; m = n;
while (n--) {
s... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 82a22b4a07aba3fd25cc7de7e21835de | 800 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
if(s[0]+s[1]+s[2]==s[3]+s[4]+s[5])
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 1b01c15446516eac291c7bfc002d24ea | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
int x,y;
cin>>t;
for(int i=0; i<t; i++)
{
string num;
for(int i=0; i<6; i++)
{
cin>>num[i];
x=num[0]+num[1]+num[2];
y=num[3]+num[4]+num[5];
}
if(x==y)
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | cd3c8b10829ce9ea1c1fd06f57bc1d2f | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
for(int i = 0; i < n; i++){
cin >> s;
if(s[0] + s[1] + s[2] == s[3] + s[4] + s[5]){
cout << "YES\n";
}
else{
cout << "NO\n";
}
}
}
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | d46bb868db8e2d62045c82ce67fbcb4c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
string s;
cin >> s;
if(s[0]+'0' + s[1]+'0'+ s[2]+'0' == s[s.length()-1]+'0' + s[s.length()-2]+'0' + s[s.length()-3]+'0')cout <<"YES" <<endl;
else cout <<"NO" <<endl;
}
}
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 8cbc6c02b59820ff0f2fb01920a6d2f5 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string ar;
int x,y,z,p,q,s;
cin>>ar;
x=ar[0];
y=ar[1];
z=ar[2];
p=ar[3];
q=ar[4];
s=ar[5];
if((x+y+z)==(p+q+s))
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | 1a4fac8ffce406e04006589b0a48587c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,t,i,j;
string s;
cin>>t;
for(i=0;i<t;i++){
cin>>s;
if((s[0]-'0')+(s[1]-'0')+(s[2]-'0')==(s[3]-'0')+(s[4]-'0')+(s[5]-'0')){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
... | C++ | c7a5b4a015e28dd3759569bbdc130e93 | e4658b1f2a0872e583b0b5c82e0b64c7 | 800 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#define int long long
using namespace std;
const int N=10000;
signed main(){
int t;
cin>>t;
while(t--){
int sum=0;
string s[51];
int a;
int b;
int min=201;
cin>>a>>b;
for(int i=0;i<a;i++){
cin>>s[i];
}int k=0;
for(int h=0;h<a;h++){
for(... | C++ | ef2b90d5b1073430795704a7df748ac3 | 9e2e216d98112c942ab56f6e5e076322 | 800 | PASSED |
#include<iostream>
#include<stdlib.h>
#include<cmath>
using namespace std;
int main() {
int t;
cin>>t;
while(t--) {
int x,y,min;
cin>>x>>y;
char s[100][100];
for(int i=0; i<x; i++) {
for(int j=0; j<y; j++) {
cin>>s[i][j];
}
}min=y*25;
for(int k=0; k<x-1; k++) {
int sum,min1;
min1=y*25;
... | C++ | ef2b90d5b1073430795704a7df748ac3 | 1e402ae27edbfaf775a5ef013c3dd5cc | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=1010;
int n,m;
int f[N];
int t;
int g[N];
int main()
{
int t;
cin>>t;
string s[N];
while(t--)
{
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>s[i];
}
int sum=10000000;
for(int i=0;i<n;i++)
{
for(int j=... | C++ | ef2b90d5b1073430795704a7df748ac3 | 57a6342b9732100bfee1443f35b430cd | 800 | PASSED |
#include <iostream>
#include <vector>
#include <stdlib.h>
// #include <algorithm>
using namespace std;
vector<string>v;
int difference(string s1,string s2){
int diff=0;
int d=0;
for(int i = 0; i < s1.size(); i++){
d=s2[i]-s1[i];
if(s1[i]=='a' ... | C++ | ef2b90d5b1073430795704a7df748ac3 | 881adb2b95cbe1e488ef41f2f73ee79c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t ;
char a[100][100];
cin >> t;
while(t--){
int n , m ;
cin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
cin >> a[i][j];
int ans = 1100 , s;
for(int i = 1; i < n; ++i){
for(int j = i + 1; j <= n; ++j){
s = 0... | C++ | ef2b90d5b1073430795704a7df748ac3 | 7c4580b8067a514287dca4e1e37912b9 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int cost(string& a, string& b) {
int val = 0;
for(int i = 0; i < a.size(); ++i) {
val += abs(a[i] - b[i]);
}
return val;
}
int main() {
int t; cin >> t;
while(t--) {
int n, m; cin >> n >> m;
vector<string> s(n);
for(... | C++ | ef2b90d5b1073430795704a7df748ac3 | 7a667d800356c5cade9259d7c9b1f0d4 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t,n,m;
char c[100][100];
cin>>t;
for(int i=1;i<=t;i++){
cin>>n>>m;
for(int j=1;j<=n;j++)
for(int l=1;l<=m;l++)
cin>>c[j][l];
int ans=300;
int cnt;
for(int j=1;j<n;j++){
for(int l=j+1;l<=n;l++){
cnt=0;
for(int k=1;k<=m;k++)
... | C++ | ef2b90d5b1073430795704a7df748ac3 | f9ae48ec449aba466f3cc6dee590dbab | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--){
int n, m;
cin >> n >> m;
vector<string> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
int val, ans = ... | C++ | ef2b90d5b1073430795704a7df748ac3 | eb6cebec74225364b258449a18773ef7 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while(t--){
int n,m,daddy=0;
cin >> n >> m;
vector<string> all;
vector<int> yes;
for(int i=0;i<n;i++){
string s;
cin >> s;
all.push_back(s);
}
for(int i=0;i<n-1;i++){... | C++ | ef2b90d5b1073430795704a7df748ac3 | 8ba501de4590c59e58e14000a85f2e16 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 55, mod = 1e9 + 7;
const ll oo = 1e18;
string a[N];
void solve() {
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i];
int ans = 1e9;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
... | C++ | ef2b90d5b1073430795704a7df748ac3 | 89f98a7e2ebfcde3041112226579dd2a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int mp[1005][1005],pre[1005][1005];
int t,n,m,maxnn=0;
int main(){
cin>>t;
while(t--){
cin>>n>>m;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
cin>>mp[i][j];
}
}
memset(pre,0,sizeof(pre));
maxnn=0;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 8f9fc1168e71411430711fb749a7d4cb | 1,000 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t;
cin>>t;
int n,m;
while(t--){
cin>>n>>m;
int a[200][200];
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
cin>>a[i][j];
}
}
int maxx=0;
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
int temp=0;
int ii,jj;
for(ii=i+1,jj=j+1;i... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | e10d5f54c648e1f9a7f31649bcead0e9 | 1,000 | PASSED |
#include<iostream>
#include<string.h>
using namespace std;
const int inf=0x3f3f3f3f;
const int N=1005;
int s[N][N];
int main(){
int n;
cin >> n;
while(n--)
{
int a,b;
cin >> a >> b;
for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{
cin >> s[i][j];
}
}
int num,maxx=0;
for(int i=0;i<a;i++)
{... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 4ca08848c8be213bf723b232902ffa8c | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1000;
int a[N],c[N+250],d[N][N];
void solve()
{
int n,m;
cin >> n >> m;
memset(a,0,sizeof(a));
memset(c,0,sizeof(c));
int ans = 0;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
cin >> d[i][j];
a[i+j] += d[i][j]... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | dfacea46cddb558a152f061d6795ea79 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 250;
int n, t, m;
int arr[N][N];
int sum;
void solve()
{
cin >> n >> m;
for(int i = 0; i < n; i ++... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 51fcc5062baa19303b6f325e0ae71902 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long a[400][400];
int main(){
long long t;
cin >> t;
while(t--){
long long n,m;
cin >> n >> m;
for(long long i = 0;i < n;i++)
for(long long j = 0;j < m;j++)
cin >> a[i][j];
long long maxsum = 0;
for(long long i = 0;i < n;i++){
for(long long j = 0;... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 0220ba78bd7aad76e7d2acf4daeb2681 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1000;
int a[N],c[N+250],d[N][N];
void solve()
{
int n,m;
cin >> n >> m;
memset(a,0,sizeof(a));
memset(c,0,sizeof(c));
int ans = 0;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
cin >> d[i][j];
a[i+j] += d[i][j]... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 32f2a520609f02a78ea9afa6ce1eeea5 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long a[400][400];
int main(){
long long t;
cin >> t;
while(t--){
long long n,m;
cin >> n >> m;
for(long long i = 0;i < n;i++)
for(long long j = 0;j < m;j++)
cin >> a[i][j];
long long maxsum = 0;
for(long long i = 0;i < n;i++){
for(long long j = 0;... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 17b1b1a843415336aa9fe6423381ae37 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=210;
int h[N+N][N],ii[N],jj[N];
int t,n,m;
int main()
{
cin>>t;
while(t--)
{
memset(h,0,sizeof(h));
memset(ii,0,sizeof(ii));
memset(jj,0,sizeof(jj));
cin>>n>>m;
for(int i=1;i<=n;i++)
... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | e6ac0a6dd0da5b31ddfe613a05871274 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long a[400][400];
int main(){
long long t;
cin >> t;
while(t--){
long long n,m;
cin >> n >> m;
for(long long i = 0;i < n;i++)
for(long long j = 0;j < m;j++)
cin >> a[i][j];
long long maxsum = 0;
for(long long i = 0;i < n;i++){
for(long long j = 0;... | C++ | 1b0c53ec666cdfea31a74f73d6ff70f2 | 114113a8f63f338669e819d9c36056dc | 1,000 | PASSED |
#include <cstdio>
int T, n, s, a[1050];
int main()
{
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);s = 0;
for(int i = 1;i <= n;++i)
scanf("%d", &a[i]);
for(int i = 1;i <= n;++i)
for(int j = i + 1;j <= n;++j)
s += a[i] >= a[j];
printf("%d\n", s);
}
... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | dc4c4e051e3ff4365bdd6d0ffe839fc5 | 1,400 | PASSED |
#include <iostream>
using namespace std;
int T, n, s, a[1005];
int main(){
cin >> T;
while(T--){
cin >> n;
s = 0;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++) s += a[i] >= a[j];
}
cout << s << endl;
}
... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | 05ef4e8ce20022dd0eda1b6f23f3ba1f | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
string s;
void solve()
{
v.clear();
ll n, ans = 0;
cin>> n;
for(int i = 1;i <= n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
for(int i = 1;i <= n;i++)
{
for(int l = i+1;l <= n;l++)
{
//cout<<i<<" "<<l... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | 0ba2f659eeacab84bb392e9d9a1049d3 | 1,400 | PASSED |
#include<iostream>
using namespace std;
const int N = 1005;
int val[N];
void solve()
{
int n;cin>>n;
for(int i=1;i<=n;i++) cin>>val[i];
int sm = 0;
for(int i=1;i<=n;i++)
{
int start1 = i;
int end1 = val[i];
for(int j=i+1;j<=n;j++)
{
int start2 = j;
int end2 = val[j];
if(start1<sta... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | 169f3815063382847d457a7e786f1aff | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3+5;
int T;
int n;
int a[MAXN];
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(a,0,sizeof(a));
for (int i=0;i<n;++i)
scanf("%d",&a[i]);
int ans = 0;
for(int i=0;i<n;++i)
{
for(int j=i+1;j<n;++j)... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | 9b1dc13a53cb22138c73a91341f51124 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int a[N];
int n;
int lowbit(int x){return x&-x;}
struct node
{
int tr[N];
void init(){memset(tr,0,sizeof(tr));}
void add(int x,int k){for(;x<=2e5;x+=lowbit(x))tr[x]+=k;}
int query(int x)
{
int ans=0;
for(;x;x-=lowbit(x))ans+=tr[x];
... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | 79ed25843465182783c50042fc09e516 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >> T;
while(T--){
int n,a[1005];
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
}
int cnt = 0;
for(int i = 1;i <= n;i++){
for(int j = 1;j < i;j++){
if(a[i] <= a[j]){
cnt++;
}
}
}
cout << c... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | eb6bac5a8dbefde2cccb0e14cadc0691 | 1,400 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=1e3+5;
int a[maxn];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,ans=0;
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]);
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
if(a[i]>=a[j]) ans++;
printf(... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | efdef4b046072ee093622a81e7e917bb | 1,400 | PASSED |
#include <cstdio>
int T, n, s, a[1050];
int main()
{
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);s = 0;
for(int i = 1;i <= n;++i)
scanf("%d", &a[i]);
for(int i = 1;i <= n;++i)
for(int j = i + 1;j <= n;++j)
s += a[i] >= a[j];
printf("%d\n", s);
}
... | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | fc3d84d0f8f1bb93ace3a04e849d35a6 | 1,400 | PASSED |
#include <stdio.h>
int T, n, s, a[1050];
int main(){
scanf("%d", &T);
while(T--){
scanf("%d", &n);
s = 0;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 1; i <= n; i++)
for(int j = i + 1; j <= n; j++) s += a[i] >= a[j];
printf("%d\n", s);
}
return 0;
} | C++ | 759b3909ccdf1b9ffd800bf0f65361cc | ffa02e59f34584a8a021cfc89661a4b4 | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long int LL;
const int N = 4e4 + 20;
int h[N], ne[N], e[N], idx;
int t, ans;
string s;
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
int see(int x)
{
// cout << 1 << endl;
int sum1 = 0;
if (s[x - ... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 277eb83f26635c8ebbd699f9e3cf5c3a | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
const int N = 30000, M = 100000;
string s;
int col[N];
int head[N], to[M], ne[M], idx;
void add(int u, int v){
to[idx] = v;
ne[idx] = head[u];
head[u] = idx++;
}
int dfs(int u){
int res = 0;
col[u] = (s[u - 1] == ... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 1658224f81a157eea11821afc64f9ecf | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200007;
const int MOD = 1000000007;
void solve() {
int n;
cin >> n;
vector<int> child[n + 7];
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
child[x].push_back(i);
}
string s;
cin >> s;
int res = 0;
function<int(int)> dp = [&] (int x) {
int bal = (s[x - 1] ... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 933c2cfe61dcac267823ded965c2782f | 1,300 | PASSED |
#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
int t, n, cnt;
string s;
vector<int> zs[4005];
int dp(int x)
{
int balance = 0;
if (s[x - 1] == 'B')
balance = 1;
else
balance = -1;
if (zs[x].size() == 0) return balance;
for (auto it : zs[x])
{
balance += dp(it);
}
if (balanc... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 7d93531793e9b211bb16e62862d23f32 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define ll long long
#define ii pair<int,int>
#define all(v1) v1.begin(),v1.end()
#define rall(v1) v1.rbegin(),v1.rend()
#define imfaast ios_base::syn... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 7384f6ea96951429793ef39ccc429576 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,b[4010],tree[4010],x,ans;
char s[4010];//沉默
void count(int tree[],int &pos,char &color){
if(color=='W')
tree[pos]+=1;
else
tree[pos]-=1;
return;
}
int main(){
cin>>t;
for(int i=1;i<=t;++i){
cin>>n;
memset(tree,0,sizeof(tree));
ans=0;
b[1]=-1;
for(i... | C++ | 504613b285d10fbf1e45b9c4ace25865 | fdcf3326dda5b9df543bb97ec268f2b4 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define sareeeee3 ios_base::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
using namespace std;
#define ll long long
const int N = 5001;
ll check[N];
string s;
vector<ll> adj[N];
ll ans{};
ll dfs(ll i = 1) {
ll t;
if (s[i] == 'W') {
t++;
} else {
t--;
}
... | C++ | 504613b285d10fbf1e45b9c4ace25865 | eff90aa09178c3e472e3d9cf71a91cc1 | 1,300 | PASSED |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define LL long long
using namespace std;
const int N=4005;
int T,n,x,a[N],ans,b[N],w[N];
char c;
vector<int> v[N];
LL read(){
LL x=0,f=1; char c=get... | C++ | 504613b285d10fbf1e45b9c4ace25865 | ecbe73b6712adccadeba9490963d8e71 | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <stdio.h>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<numeric>
#include<stack>
using namespace::std;
typedef long long ll;
int n,t;
inline __int128 read(){
__int128 x ... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 3a8219f756bdc35281dc985ac31edc37 | 1,300 | PASSED |
#include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <bits/stdc++.h>
using namespace std;
#define SHEHAB ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define ul unsigned long long
#define ld long double
vector<vector<int>> adj;
vector<bool> visited;
vector<int> ... | C++ | 504613b285d10fbf1e45b9c4ace25865 | 0565a4caf8b5e30d63253b47f1086fa3 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main()
{
LL t;
cin >> t;
while (t--)
{
LL n, k;
cin >> n >> k;
map<LL, LL> mp;
vector<LL> v;
for (LL i = 0; i < n; i++)
{
LL num;
cin >> num... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 998a6c815a5ee5a92688a3dd93023186 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
#define ll long long
#define ls(k) k<<1
#define rs(k) k<<1|1
#define debug(x) cerr<<#x<<":"<<x<<'\n'
using namespace std;
const int maxn = 2e5+10;
const int inf = 0x7fffffff;
const double eps = 1e-6;
const double pi = acos(-1.00);
int n, k, T, a[maxn], s[maxn],... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 1ffbf3f799752bd972b3f23a59373e8b | 1,300 | PASSED |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <string>
#include <fstream>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld lon... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | d2603f83573a3fc277176f7f9e79e092 | 1,300 | PASSED |
#include <iostream>
#include<iomanip>
#include<vector>
#include<math.h>
#include<string>
#include<algorithm>
#include<numeric>
#include<queue>
#include <cstdlib>
#include<set>
#include<deque>
#include<map>
#include<iomanip>
#include<unordered_set>
#include<unordered_map>
#include<numeric>
#include<stack>
#define ll lo... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 881253c9fc67d91af5181474f6de14af | 1,300 | PASSED |
//////////////////////////////////////////////////////////////////
///******************** ~ AHMAD MAHAREEQ ~ ********************///
#include <bits/stdc++.h>
#include <time.h>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <unistd.h>
#include <iostream>
#define F first
#define S second
#... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 7c108240ae0542bbaa4d8fbd940e1ebf | 1,300 | PASSED |
//////////////////////////////////////////////////////////////////
///******************** ~ AHMAD MAHAREEQ ~ ********************///
#include <bits/stdc++.h>
#include <time.h>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <unistd.h>
#include <iostream>
#define F first
#define S second
#... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 0520deb60533a3990ddee2338f3122e4 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define int long long int
#define vi vector
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define node pair<int,char>
#define loop(i,x,y) for(int i=x;i<y;i++)
#define deb(x) cout<< #x <<" "<<x<<endl;
#define prin... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 23b472beb7dc94c462d5235c34fcf34c | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
// #define int long long int
#define vi vector
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define node pair<int,char>
#define loop(i,x,y) for(int i=x;i<y;i++)
#define deb(x) cout<< #x <<" "<<x<<endl;
#define p... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | 80f1a56b901a42e8e8a993a5647ae86f | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int f[200001];
struct fuck{
int num,c;
}q[200001];
int main()
{
int t;cin>>t;
while(t--)
{
int n,k,ans=0,l=0,r=0,an=0,now=0;cin>>n>>k;
for(int i=1;i<=n;i++)cin>>f[i];
f[0]=-1;
sort(f+1,f+n+1);
for(int i=1;i<=n;i++)
{
if(f[i]!=f[i-1])
{... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | b4290b70efd0755f1814b38a63082fff | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>
using namespace std;
int main() {
int t, n, k;
cin >> t;
for (int tc = 1; tc <= t; tc++) {
cin >> n >> k;
unordered_map<int, int> um;
um.reserve(1024);
um.max... | C++ | 13fd45f1892f96eab1d5ab966f465a05 | eeab8878c14867c485cf0295fa9929e1 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,h,mx1,mx2,x,y,cnt;
cin>>t;
while(t--)
{
cin>>n>>h;
mx1=0;mx2=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
if(x>=mx1){
mx2=mx1; mx1=x;
}
else if(x>mx2) mx2=x;
}
cnt=h/(mx1+mx2);
cnt=cnt+cnt;
y=h%(mx1+m... | C++ | 4d5457d9f053556c78c102f5c32f7542 | a77cca69e8bbabc037a7f242463512b1 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.