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>
using namespace std;
const int maxn = 202000;
int a[maxn];
struct node{
int ch[2],cnt;
}nd[maxn*40];
int root[maxn],num;
void init(){
for(int i=1;i<=num;i++) nd[i].ch[0]=nd[i].ch[1]=nd[i].cnt=0;
for(int i=1;i<=num;i++) root[i] = 0;
num... | C++ | e83fa9011ace93a63b954f079e3387ba | 5d07d274fc66d55a81ede8d88fd8df58 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ls(p) tr[p].ls
#define rs(p) tr[p].rs
using namespace std;
const int N=1e5+10;
int t,n,a[N],node,tmp[N],cnt1,T[N];
struct TREE
{
int ls,rs,cnt;
}tr[N*70];
int update(int pre,int x)
{
int p=++node,tmp=node;
for(int i=30;i>=0;i--)
{
tr[p]=tr[pre];tr[p].cnt++;
if(... | C++ | e83fa9011ace93a63b954f079e3387ba | d7bb8f622e4c3a4656ec35ddec9f4131 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int th=31;
struct SegmentTree{
vector<vector<int>> tree;
int n;
SegmentTree(vector<int> v){
n=v.size();
tree.resize(2*n);
for(int i=0; i<n; i++){
tree[i+n]={v[i]};
}
for(int i=n-1; i; i--){
tree[i]=comb(tree[i<<... | C++ | e83fa9011ace93a63b954f079e3387ba | aa6bda996720ea4e43a380802503b71d | 2,500 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
using namespace std;
inline int re... | C++ | e83fa9011ace93a63b954f079e3387ba | 23ac8da37bfcffd71cbec157a954b32b | 2,500 | PASSED |
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
#define int long long
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define drp(i,j,k) for(int i=j;i>=k;--i)
#define rd(x) (1ll*rand()*rand()%(int)(x)+1)
#define out(x) printf("%lld ",x)
#define hh printf("\n")
int wzlmax(int &x,int y){return x<y?x=y:x;}
int wzlmin... | C++ | e83fa9011ace93a63b954f079e3387ba | ccc431c2c61e5e5c18a001ff9ead3fab | 2,500 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::ste... | C++ | e83fa9011ace93a63b954f079e3387ba | 8b4aa597b63213c2d2bf8654ea290068 | 2,500 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::ste... | C++ | e83fa9011ace93a63b954f079e3387ba | a2de7ecc8991755cd2b5a440a5de54dd | 2,500 | PASSED |
/*
* @Author: Michael Lee
* @Date: 2022-05-02 09:26:47
* @LastEditors: Michael Lee
* @LastEditTime: 2022-05-02 11:21:54
* @Description: CF1665E MinimizOR
*/
#include<iostream>
#include<cstring>
using namespace std;
#define rint register int
/***********fast IO***********/
char buf[1<<21],*p1=buf,*p2... | C++ | e83fa9011ace93a63b954f079e3387ba | a650479b09295b3655857bfc15a1b96c | 2,500 | PASSED |
/*
* @Author: Michael Lee
* @Date: 2022-05-02 09:26:47
* @LastEditors: Michael Lee
* @LastEditTime: 2022-05-02 11:14:16
* @Description: CF1665E MinimizOR
*/
#include<iostream>
#include<cstring>
using namespace std;
/***********fast IO***********/
char buf[1<<21],*p1=buf,*p2=buf,obuf[1000000],*p3=ob... | C++ | e83fa9011ace93a63b954f079e3387ba | 41933d26788885ada0eb8aa79a5bc685 | 2,500 | PASSED |
import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return (int(input()))
def inlt():
return (list(map(int, input().split())))
def insr():
s = input()
return (list(s[:len(s) - 1]))
def invr():
return (map(int, input().split()))
class Solu... | Python | 807c5ec37b0ea83ef40550698f1ff498 | 8906d9ca06ab515d75915612bd25ca38 | 900 | PASSED |
import math
#################### Problems from CodeForces solved by Sohaib Moradi aka Shmits ####################
######################################################################### 1
###### World Cup ###### A problem from CodeForces ###### Wordl Cup ######
## tags: binary search, math
# def func(As, n... | Python | 807c5ec37b0ea83ef40550698f1ff498 | c7e6654ef9b62bc8b12525d39657e4ca | 900 | PASSED |
for enumeration in range(int(input())):
n = int(input())
array = list(map(int, input().split()))
build = [0] * n
x = 0
for i in range(n - 1, -1, -1):
p = array[i]
if x < p:
x = p
build[i] = int(x > 0)
x -= 1
print(*build) | Python | 807c5ec37b0ea83ef40550698f1ff498 | e032b0225e1f18e93bf3b241f731c903 | 900 | PASSED |
for i in range(int(input())):
c = int(input())
l = list(map(int, input().split()))[::-1]
s = []
g = 0
while len(s) != c:
if l[len(s)] > g:
g = l[len(s)]
if g > 0:
s += [1]
g -= 1
else:
s += [0]
print(*s[::-1]) | Python | 807c5ec37b0ea83ef40550698f1ff498 | 92e52303dbbca0f81bc8c4962e49045d | 900 | PASSED |
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
foo = [0 for __ in range(n)]
for idx, i in enumerate(a):
if not i:
continue
foo[idx] = 1
i -= 1
pos = idx-1
while i > 0 and pos >= 0:
foo[p... | Python | 807c5ec37b0ea83ef40550698f1ff498 | ef70aa1b8bd218f9e3dcddf593054d89 | 900 | PASSED |
t=int(input())
for _ in range(t):
n=int(input())
a=[int(x) for x in input().split()]
b=[0]*n
temp=0
for i in range(n-1,-1,-1):
temp=max(temp,a[i])
if temp>0:
b[i]=1
temp-=1
for i in b:
print(i,end=" ")
print()
| Python | 807c5ec37b0ea83ef40550698f1ff498 | 060382a67d2160677398e0bb7c4449d2 | 900 | PASSED |
t=int(input())
for _ in range(t):
n=int(input())
a=[int(x) for x in input().split()]
ans=[0]*n
temp=0
for i in range(n-1,-1,-1):
temp=max(temp,a[i])
if temp>0:
ans[i]=1
temp-=1
for i in ans:
print(i,end=" ")
print()
| Python | 807c5ec37b0ea83ef40550698f1ff498 | 9bbad82e1f7671da273defe21d327cbe | 900 | PASSED |
for _ in range(int(input())):
n=int(input())
a=[int(x) for x in input().split()]
temp=0
ans=[0 for i in range(n)]
i=n-1
while i>=0:
temp=max(temp,a[i])
if temp!=0:
ans[i]=1
temp-=1
i-=1
for i in range(n):
print(ans[i],end="... | Python | 807c5ec37b0ea83ef40550698f1ff498 | 68ffb5e460a6d4424e7f345dce3d7839 | 900 | PASSED |
t=int(input())
for _ in range(t):
n=int(input())
a=[int(x) for x in input().split()]
b=[0]*n
temp=0
for i in range(n-1,-1,-1):
if a[i]!=0 or temp!=0:
b[i]=1
temp=max(a[i],temp)
temp-=1
else:
b[i]=0
for i in range(n):
... | Python | 807c5ec37b0ea83ef40550698f1ff498 | 1189e9e9a0267ca26c4cdde47c88361c | 900 | PASSED |
for _ in range(int(input())):
n=int(input())
a=[int(x) for x in input().split()]
temp=a[n-1]
b=[0]*n
for i in range(n-1,-1,-1):
if ((temp!=0)|(a[i]!=0)):
b[i]=1
temp=max(temp,a[i])
temp-=1
else:
temp=a[i]
for i in ra... | Python | 807c5ec37b0ea83ef40550698f1ff498 | 9e0d8e58ae7351ebef8f77e5f928bebb | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[105],b[105],c[105];
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int ans=0;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
}
for(int i=1;i<=n;i++){
... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 96bd9d389ef8cfbfdc422c0f1f750b54 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node{
int x;
int y;
}s[105];
int deng[105];
int yan[105];
int cost[105];
int main()
{
int t;
cin>>t;
while (t--){
int n;
cin>>n;
memset(deng,0,sizeof(deng));
memset(cost,0,siz... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 1c71ffc858c87e152f5b83d5b81a1d67 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[110],b[110],c[110];
int main()
{
int t,n;
cin>>t;
while(t--){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
}
for(int i=1;i<=n;i++){
cin>>c[i];
}
ll ans=0;
for(int i=1;i<=n;i++){
ans+=a[i]-b[i-1]+c[i];... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 490b217a46ead9dcb99757ef0c9ee698 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=110;
int a[maxn];
int b[maxn];
int l[maxn];
int main()
{
int t;
while(cin>>t)
{
while(t--)
{
int n;
cin>>n;
for(int i = 1 ; i<= n ; i ++ )cin>>a[i]>>b[i];... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | d46a33697957f391f0d7bb82f3fba927 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[105],b[105],c[105];
int z[105],d[105];
int main(){
int t;
cin>>t;
while(t--){
memset(z,0,sizeof(z));
memset(d,0,sizeof(d));
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 12e65153eafa30db8a83c0b201dd560d | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[105],b[105],stop[105];
int time1[105],extra[105];
int main(){
int t;
cin>>t;
while(t--){
int n,sum1=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
stop[i]=(b[i]-a[i])/2;
if((b[i]-a[i])%2!=0... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | b5aa4eb0d96a8476438c73b6a0536104 | 800 | PASSED |
#include "iostream"
using namespace std;
int t,n;
int a[105],b[105],la[105];
int stop[105],tm[105];
int main()
{
cin >> t;
while (t--){
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i] >> b[i];
if((b[i]-a[i])%2==0) stop[i] = (b[i]-a[i])/2;
else stop[i... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 1bb5d7898f0f8608f8d5b53f624c765f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,a[1005],b[1005];
int c[1005];
int main()
{
while(cin>>t){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
while(t--){
cin>>n;
for (int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for (int i=0;i<n;i++){
cin>>c[i];... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | fa7874c32085cf68515224c8c1d2c547 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int a[150],b[150],c[150];
int main(){
int n,m;
while (cin>>n){
while (n--){
cin>>m;
for (int i = 1; i <=m; i++) {
cin>>a[i]>>b[i];
}
for(int i=1;i<=m;i++)cin>>c[i];
int a... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | c2a9aabdca04d6045605112790c27822 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long n,m,t,h;
struct node {
ll x;
ll y;
ll yan;
}s[100005];
ll cnt[10005];
int main()
{
while(cin>>t){
while(t--){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i].x>>s[i].y;
s[i].yan=(s[i].y-s[i].x+1)/2;
}
for(i... | C++ | 42840fc873369e0d0d6a4ad24a43f5a6 | 11a9ece8bbe230e33f28929a422ed6be | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
for (int i = 0; i < t; i++)
{
int n,a;
cin >> n;
int nr = 0;
int v[50] = {0};
for (int j = 0; j < n; j++)
{
cin >> a;
int k = 0;
//int x/*, ok = 0... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 88d1deebbc9f309268d19ce082486f76 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int j;
int n;
cin>>j;
for(int f=0;f<j;f++ )
{
cin>>n;
int a[n];
int u[n]={0};
int g=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int o=0;o<n;o++)
{
int p;
for(p=0;p<n;p++)
{
if(a[o]==u[p])
break;
}
if(p==n)
{
... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 29a18548b9057cfc23c64922cd7760d4 | 800 | PASSED |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
const int N = 60;
int main()
{
int t;
cin >> t;
while(t--)
{
int a[N];
set<int> s;
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
... | C++ | ab7ab67941783da5c16f6294eb1910d9 | b48a5092f36401e9306f06eec4ce3d5c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int x; cin >> x;
while(x--) {
int y; cin >> y;
set<int> s;
int total = 0;
for(int i = 0; i < y; i++) {
int g; cin >> g;
if(s.count(g)) {
total++;
} else {
s.insert(g);
}
}
if(total % 2 == 1) {
total+... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 7265a784ea8389b1b138a5410aaac40c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void FAST()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main()
{
FAST();
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
set<int>st;
for(int i=0;i<n;i++)
{
int x;
... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 02edf6210d2c8e22181ce509c2b02756 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=1;i<=int(n);i++)
#define Forn(i,n) for(int i=0;i<int(n);i++)
#define Rfor(i,n) for(int i = int(n-1);i>=0;i--)
#define rfor(i,n) for(int i = int(n);i>0;i--)
#define endl "\n"
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.e... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 6a3afd93aff724355d9a90587ad530a9 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
int t, n;
int a[MAXN];
set<int> s;
int main()
{
cin >> t;
while (t--)
{
s.clear();
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
s.insert(a[i]);
}
if ((n - s.s... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 7f5b3eb86bc4d263c22675873a080dad | 800 | PASSED |
// Time: 2022-06-14 21:17:15 Problem: B. All Distinct
// URL: https://codeforces.com/contest/1692/problem/B
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define Case(i) cout << "Case " << int(i) << ": "
#... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 7c4fdd637a4289e6cc38e68d3375ba18 | 800 | PASSED |
#include<iostream>
#include<map>
#include<string>
#include<cmath>
using namespace std;
int arr[55];
int main() {
int t;
cin >> t;
while (t--) {
int removed = 0;
int n; cin >> n;
int freq[10001] = { 0 };
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
freq[x]++;
if (freq[x] > 1) {
removed... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 0c78b1467da186b60433f98749891042 | 800 | PASSED |
#include <bits/stdc++.h>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
BOOST
int t;
cin>>t;
while(t--)
{
int k;
cin>>k;
int array[k];
for(int i=0;i<k;i++)
{
cin>>array[i];
}
int count=0;
sort(array,array+k);
for(int i=0;i<k-1;i+... | C++ | ab7ab67941783da5c16f6294eb1910d9 | 0ca7ef4f0fe7fdecb9fd0cb0fd385e1c | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define sz(v) (int) (v).size()
#define all(v) (v).begin(), (v).end()
#define r_all(v) (v).rbegin(), (v).rend()
#define bit_count(v) __builtin_popcount((v))
using int64... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | b276c9442ea37882631d18c4aac88a0c | 800 | PASSED |
#include <iostream>
using namespace std;
int main ()
{
int TCase;
cin >> TCase;
for (int i = 0; i < TCase; i++){
int self, next, result = 0;
cin >> self;
for (int j = 0; j < 3; j++){
cin >> next;
if (self < next){
result++;
}
... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | fe3c8919234f5e32f6cd8fb62c8e9259 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
for(int i=0;i<t;i++)
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a>b&&a>c&&a>d)
{
cout<<"0"<<endl;
}
else if(a<b&&a>c&&a>d || a>b&&a<c&&a>d || a>b&&a>c&&a<d)
{
cout<... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | 01d2cf9753f8c7928a87fb8e3bf3879a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int a[4];
for(int i=0; i<4; i++)
{
cin>>a[i];
}
int count=0;
for(int i=0;i<4;i++)
{
if(a[i]>a[0])
count++;
}
... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | f1f1afd5da154300aa196fa00aa0c071 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t,it,i,timur,x,temp;
cin >> t;
for(it = 0; it < t; it++){
cin >> timur;
temp = 0;
for(i = 0; i < 3; i++){
cin >> x;
if(x > timur){
temp += 1;
}
}
cout << tem... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | 5c5d2de5d8218f8c1c2747e9ac4d974e | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int cases = 0, a = 0, b = 0, c = 0, d = 0, total = 0;
cin >> cases;
for (int i = 0; i < cases; i++) {
total = 0;
cin >> a >> b >> c >> d;
if (b > a) {
total++;
}
if (c > a) {
total++;
... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | dc17470081b1dc96f63094391378d30b | 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++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | 3ddd412cd455e67327dbbe286ae4af2b | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int i, j, t, a, b, c, d, grt = 0;
cin >> t;
for (i = 0; i < t; ++i)
{
cin >> a >> b >> c >> d;
if (a < b)
++grt;
if (a < c)
++grt;
if (a < d)
++grt;
cout << grt << endl;
... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | 8132469bdbfbfa6e64e98e2daf2bf37b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int num; cin>> num; while(num--){
int x; cin>> x;
int count=0;
int test=3;
while(test--){
int xx; cin>> xx;
if(x<xx){
count++;
}
}
cout<< count<< "\n";
}
}
... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | 392fa951be0c36832069aa2e1e2f7f02 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t, a, b, c, d;
cin >> t;
for(int i=1; i<=t; i++){
cin >> a >> b >> c >> d;
if(a<b && a<c && a<d){
cout << "3" << endl;
}
if(a>b && a>c && a>d){
cout << "0" << endl;
}
if(a>b... | C++ | e829ca4438e9cb30ea1c66eea7d5f7a7 | f39587682a4c90458c194ce02bcf9831 | 800 | PASSED |
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<long long>
#define test() ll t; cin >> t; while(t--)
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
test(){
... | C++ | b5ef56f2eb482682414c32fba83a3949 | 0354d08a1296eca77d32956bfb3e5c36 | 1,400 | PASSED |
///ALLAH IS OMNISCIENT
///RABBI JIDNE ELMA
///SOLUTION BY JAKI
#include<bits/stdc++.h>
using namespace std;
#define JAKI ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define nl "\n"
#define frl(i,a,n) for(ll i=a;i<n; i++)
#d... | C++ | b5ef56f2eb482682414c32fba83a3949 | f6e6bcf2c01814b37582884d7f859092 | 1,400 | PASSED |
///ALLAH IS OMNISCIENT
///RABBI JIDNE ELMA
///SOLUTION BY JAKI
#include<bits/stdc++.h>
using namespace std;
#define JAKI ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define nl "\n"
#define frl(i,a,n) for(ll i=a;i<n; i++)
#d... | C++ | b5ef56f2eb482682414c32fba83a3949 | cc9ef723c9a653c9e5600190015df52a | 1,400 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define watch(x) cout<<#x<<":"<<x<<" ";
#define mod 1000000007
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define sz(x) ((int)(x).size())
#define... | C++ | b5ef56f2eb482682414c32fba83a3949 | 346ff233ab51d5b354708c7c33f10a7f | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for(int p = 0 ; p<t ; p++){
int n, k;
cin >> n >> k;
vector <int> v(n);
for(int i = 0; i<n ; i++){
cin >> v[i];
}
int contador = 0;
int contadorPar=0;
int ... | C++ | b5ef56f2eb482682414c32fba83a3949 | 3e44a3f6e1009bf7226a820b8ed871aa | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int k;
cin>>k;
int arr[n];
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
int ans=0, cont = 0;
for(int i=1; i<n; i++... | C++ | b5ef56f2eb482682414c32fba83a3949 | f1358863f102b6a5df1aa5752a9f3937 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;cin>>t;
while (t--){
int n,k;cin>>n>>k;int a[n+1],b[n];int cnt=0;
fill(b,b+n,0);
for (int i = 1; i <=n ; ++i) {
cin>>a[i];
}
for (int j = 1; j <n ; ++j) {
if (a[j]<a[j+1]*... | C++ | b5ef56f2eb482682414c32fba83a3949 | 072beb089643350b7f31b185fe7105eb | 1,400 | PASSED |
#include<iostream>
using namespace std;
const int N=2e5+5;
int a[N],b[N];
int main(){
ios::sync_with_stdio(0);
int t;
cin>>t;
while(t--){
int n,k,ans=0;
cin>>n>>k;
for(int i=1;i<=n;++i){
cin>>a[i];
if(a[i]*2>a[i-1]){
b[i]=b[i-1]+1;
}else{
b[i]=b[i-1];
}
}
for(int i=k+1;i<=n;++i){
if... | C++ | b5ef56f2eb482682414c32fba83a3949 | 7a2fd5ba8dc512e966f45b0928cbde6e | 1,400 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n, k;
scanf("%d %d", &n, &k);
int a[n+1];
a[0] = 0;
int s[n+1];
s[0] = s[1] = 0;
int ans = 0;
for(int i=1;i<=n;i++) scanf("%d", &a[i]); ... | C++ | b5ef56f2eb482682414c32fba83a3949 | 39397c7e3edef8d431745986b079788b | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
const int mod=1e9+7, maxn=2e5+5;
int t, n, k, ans, last, a[maxn], l, r;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> t;
while(t--) {
cin >> n >> k;
ans=n-k, last=0;
... | C++ | b5ef56f2eb482682414c32fba83a3949 | 54700a549233554edc07649a80a93317 | 1,400 | PASSED |
/*Md. Shihab Hossain
Dept of CSE
BSMRSTU 2018-19*/
#include <bits/stdc++.h>
#include <vector>
#define pb push_back
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define ll long long int
#define gt greater<ll>()
#define ff first
#define ss second
#define pi acos(-1)
#d... | C++ | c601769062070ab983e1d4c9942cdd39 | 3b1213d1a9aa0829a3a4753f2c30587f | 1,100 | PASSED |
//Bishmillahir Rahmanir Raheem
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define pll pair<ll,ll>
#define vp vector<pair<ll,ll>>
#define pb push_back
#def... | C++ | c601769062070ab983e1d4c9942cdd39 | fb3a26f85d08354872e1e29363e0f507 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long int
#define f(n) for(int i = 0; i < n; i++)
#define loop(x,n) for(int x = 0; x < n; x++)
using namespace std;
int32_t main() {
int test;
cin >> test;
while (test--) {
string s;
cin>>s;
int x;
cin>>x;
int ... | C++ | c601769062070ab983e1d4c9942cdd39 | bdcf82eb3a7fc2a91c0b803e08ccd08c | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long int
#define f(n) for(int i = 0; i < n; i++)
#define loop(x,n) for(int x = 0; x < n; x++)
using namespace std;
int32_t main() {
int test;
cin >> test;
while (test--) {
string s;
cin>>s;
int x;
cin>>x;
int ... | C++ | c601769062070ab983e1d4c9942cdd39 | a37f199496150124e5004be02cea8054 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long int
#define f(n) for(int i = 0; i < n; i++)
#define loop(x,n) for(int x = 0; x < n; x++)
using namespace std;
int32_t main() {
int test;
cin >> test;
while (test--) {
string s;
cin>>s;
int x;
cin>>x;
int ... | C++ | c601769062070ab983e1d4c9942cdd39 | 68debdb481ddade4cad75f2cf609fabe | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[10000];
int pd(int x)
{
int hh=x/60,mm=x%60;
if(hh/10==mm%10&&hh%10==mm/10)return 1;
return 0;
}
int main()
{
int t,h,m,k;
char c;
cin>>t;
while(t--)
{
cin>>h>>c>>m>>k;
memset(a,0,sizeof(a));
int s=h*60+m,ans=0;
while(a[s]==0)
{
// cout<<s<<endl;
... | C++ | c601769062070ab983e1d4c9942cdd39 | 31dea369dfaf4bddc58fe10177819650 | 1,100 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int h,m;
int chack(int x,int y)
{
int x1=x;
int y1=y;
x1=(x1%10)*10+x1/10;
if(x1==y1) return 1;
else return 0;
}
void jin(int x)
{
m+=x;
h+=m/60;
h=h%24;
m=m%60;
}
string s;
int main()
{
int t,n;
cin>>t;
while(t--)
{
s="";
int ans=0,h1,m1;... | C++ | c601769062070ab983e1d4c9942cdd39 | 5b3dabcbfb36518c42ae7e266d5a5680 | 1,100 | PASSED |
#include<iostream>
#include<map>
#include<string>
#include<cmath>
using namespace std;
int arr[55];
int main() {
int t;
cin >> t;
while (t--)
{
int counter = 0;
string s; int x;
cin >> s>>x;
string h_fir = s.substr(0, 2);
string m_fir = s.substr(3, 5);
int h_int = stoi(s.substr(0, 2));
int m_int =... | C++ | c601769062070ab983e1d4c9942cdd39 | 17d986eff040970bb027a67a33153a0b | 1,100 | PASSED |
#include <bits/stdc++.h>
#define UCHIHA_OUDA() ios::sync_with_stdio(0),cin.tie(nullptr),cout.tie(nullptr);
#define YES cout<<"YES \n"
#define NO cout<<"NO \n"
#define ll long long
using namespace std;
bool isPrime(int x);
bool palindrome(string s);
int GCD(int x, int y);
///Where there's a will there's a way.
int main... | C++ | c601769062070ab983e1d4c9942cdd39 | 184917a0e8338fa8fa288d8f6a3700f9 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int ssss[25]={0,10,20,30,40,50,-1,-1,-1,-1,1,11,21,31,41,51,-1,-1,-1,-1,2,12,22,32,42};
bool ss[24*60];
int main(){
int t;//
cin>>t;
while(t--){
memset(ss,0,sizeof ss);
int a,b,c;
scanf("%d:%d %d",&a,&b,&c);
int now=a*60+b;
int end=a*60+b+24*60;
int ans=0;
f... | C++ | c601769062070ab983e1d4c9942cdd39 | c72aab779cb33ea6c3752dcdd942c199 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main (){
int nbrfois,taile;
string s ="";
int flag =0;
cin>>nbrfois;
for( int x = 0; x < nbrfois; x++) {
cin>>taile;
vector<int> v ;
v.clear();
flag=0;
int mycin;
... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | 7b5438fd87b4b39deaf6c3b96e8daa52 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
int ar[10005]={0};
for (int i=0; i<n; i++) {
int x;
cin >> x;
if (ar[x%10]<3) {
ar[x%... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | 6cecc610ebaa4a11b9e799ddd7afd4bf | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
int ar[10005]={0};
for (int i=0; i<n; i++) {
int x;
cin >> x;
x%=10;
int xx=x;
... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | dab3fa53418edb4722efa6a313a2834a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=0; i<n; i++) {
int x;
cin >> x;
x%=10;
int xx=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | c1aa6f7e1ac872a7b2db290ef5690f99 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | f6398e73766ccbc6291d462d0df331a4 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | 8b830b0151816e7e09b93abd3b537c3d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | 6ae8b882ecc53cfec4984411179c9705 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | e23d067a25c662202b0ea5e9ab498264 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | c5dbc4fdd829e4ee9af6c1d1eddbfea2 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, ar[10005];
int main()
{
int t;
cin >> t;
while (t--) {
cin >> n;
vector<int> arr;
for (int i=1; i<=n; i++) {
int x;
cin >> x;
x%=10;
int u=x;
if (ar[x]<3) {... | C++ | 3ae4f35808348841e0f47540cdf4abe6 | bb243f987684d83eab47f73b017a34b3 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t;
cin>>t;
while(t--){
ll n,s,ans,sum=0,sum1=0,j=0,diff=0;
cin>>n>>s;
int arr[n];//int subarr[n]={0};
for(int i=0;i<n;i++){
cin>>arr[i];sum=sum+arr[i];//subarr[0]=... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | 18b56e0af9d803fb0a4ad072628d6e00 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int s;
cin>>s;
int arr[n];
long long sum=0;
vector <int> ones;
for(int i = 0;i<n;i++)
{
cin>>arr[i];
if(arr[i]==1){o... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | c28a6d6704c91e0ea76c8861f4eaaac2 | 1,200 | PASSED |
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<long long>
#define test() ll t; cin >> t; while(t--)
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
test(){
... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | 687c76590e8d124333d912ec88c5a543 | 1,200 | PASSED |
#include<iostream>
using namespace std ;
const int N = 2e5 + 5 ;
int a[N];
int main()
{
int t;
cin >> t ;
while(t--)
{
int n ,s ;
cin >> n >> s ;
int sum = 0 , ans = -1 ;
for(int i = 0 ; i < n ; i++)
{
cin>> a[i];
sum += a[i... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | f58bb769edd5fa3063a58256a69723b3 | 1,200 | PASSED |
#include<iostream>
using namespace std;
const int M = 2e5+5;
int a[M];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t,n,s,i;
cin>>t;
while(t--){
cin>>n>>s;
int sum=0,ans=-1;
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | e052ac3ab8fe8aeb2ad39ba6e4454a4a | 1,200 | PASSED |
#include<iostream>
using namespace std;
const int M = 2e5+5;
int a[M];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t,n,s,i;
cin>>t;
while(t--){
cin>>n>>s;
int sum=0,ans=-1;
for(i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | 73785d5583a04337d539fee197fc3618 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define l__l ll t;cin>>t;while(t--)
#define ss stringstream
#define en end()
#define bg begin()
#define in push_back
#define sz size()
using namespace std;
int main()
{
IOS
l__l{
ll a,b;ci... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | d2928bb74af5a5bc353434ddd24b547c | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(c) (c).begin(),(c).end()
#define allr(c) (c).rbegin(),(c).rend()
#define srt(c) sort(all(c))
#define srtv(c) sort(allr(c))
#define rep(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define rep1(i, j, n) for(int (i) = (j); (i) < (n); ++(i))
#defi... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | c2813bf1ec15d6d04dd1efff87178ded | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
//freopen ("input.txt","r",stdin);
//freopen ("output.txt","w",stdout);
int t;cin>>t;
while(t--){
int n,s;cin>>n>>s;
int arr[n+1];
... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | fb03bc1d0c78686a37f3b24dec5a4b78 | 1,200 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<cctype>
#include<set>
#include<unordered_set>
#include<cstring>
#include<numeric>
#include<limits>
#include<limits.h>
#include<bitset>... | C++ | 68adf23485d9db9a254ab73d4f07bd62 | 3e744c5ffb14b4f8659ca6ce9ab2b2f5 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=1;i<=int(n);i++)
#define Forn(i,n) for(int i=0;i<int(n);i++)
#define Rfor(i,n) for(int i = int(n-1);i>=0;i--)
#define rfor(i,n) for(int i = int(n);i>0;i--)
#define endl "\n"
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.e... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 507b2ee62ab2e8940d6635dd120b46e5 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=1e6 +1;
int fr[N];
int pr[N];
int arr [10][10];
int main(){
int t , r=0 , c=0;
cin >> t;
char n;
while(t--){
for(int i=1 ; i<=8; i++){
for(int j=1 ; j<=8; j++){
cin >> n;
if(n == '#')
... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 4c500475de0dcb988bb6a14acf904cce | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define int ll
void solve()
{
string s[10];
for(int i=0;i<8;i++)cin>>s[i];
for(int i=1;i<7;i++)
for(int j=1;j<7;j++)
{
if(s[i][j]=='#'&&s[i+1][j+1]=='#'&&s[i+1][j-1]=='#'&&s[i-1][j+1]=='#'&&s[i-1][j-1]=='#')
{
cout<<i+1<<" "<<j+1<<... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | ae456f9e81df3aa2323bb104f87ee5d1 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define el \n
#define m_doaa ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod 1e9+7
#define ff first
#define ss second
using namespace std;
int main()
{
m_doaa;
ll t;
char arr[8][8];
cin>>t;
while(t--)
{
for(ll i=0; i... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 03baaf8e0f7ebebdb362b3e4e5368bb1 | 800 | PASSED |
#include<iostream>
//include <bits/stdc++.h>
using namespace std;
int main(){
char a[8][8];
int t;cin>>t;
while(t--){
for(int i=0 ;i<8;i++){
for(int j=0 ;j<8;j++){
cin>>a[i][j];
}
}
for(int i=0 ;i<8;i++){
for(int j=0 ;j<8;j+... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 5daa78eafce07e07c2856457500ca131 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define str string
#define sstr stringstream
#define nl "\n"
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 21c29fc1c5731312086221642b5c87f4 | 800 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int start_up() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}
int main()
{
start_up();
ll t;
cin>>t;
while(t--)
{
char a[8][8];
ll c=0;
for(int i=0;i<8;i++)
{... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 9d868b65bc2e6b91f9958a8c403f78a6 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,a,b;
string s[9];
cin>>t;
while(t--)
{
for(int i=0;i<8;i++)
cin>>s[i];
for(int i=1;i<7;i++)
{
for(int j=1;j<7;j++)
{
if(s[i+1][j+1]=='#'&&s[i-1][j-1]== '#'&&s[i+1][j-1]=='#'&&s[i-1][j+1]=... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 4c9c897e2f6df24bcb3f45e49a141407 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;cin>>t;getchar();
while(t--)
{char a[8][8];
int i,j,k=0;
for(i=0;i<8;i++)
for(j=0;j<8;j++)
cin>>a[i][j];
for(i=1;i<7;i++)
{
for(j=1;j<7;j++)
{
if(a[i][j]=='#')
{
if(a[i-1][j-1]=='#'&&a[i-1]... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | cd883ec34f88aef97ee9b0d0eedbb646 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 10;
int t;
char maze[N][N];
int main()
{
cin >> t;
while(t --)
{
for(int i = 1; i <= 8; i++)
{
for(int j = 1; j <= 8; j++)
{
cin >> maze[i][j];
}
}
int x = -1,y = -1;
for(int i = 2; i <= 7; i++)
{
for(int j = 2; j <= 7;... | C++ | b0f968ca75fbea2f11a7e4b9006f136e | 9bdf9283fe837dd194796766b5e632dd | 800 | PASSED |
// https://codeforces.com/problemset/problem/1692/H
// H. Gambling
#include <iostream>
#include <unordered_map>
#include <map>
#include <tuple>
using LLI = long long int;
bool operator>(const std::tuple<LLI, int, int> a, const std::tuple<LLI, int, int> &b){
return std::get<0>(a) > std::get<0>(b);
}
void solve(... | C++ | a07c199ca02f0abaab6c73efdb2a5b2d | 8cb21d9409bc3a1494bf01cfed82b113 | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.