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 <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <set>
#include <cstdio>
#include <memory>
#include <cmath>
#include <chrono>
#include <random>
#include <map>
#include <sstream>
#include <queue>
#include <cassert>
#include <cstdio>
#define... | C++ | afb43928545743b497b1a9975768f8e5 | 1cd4e942d1832f61114da4564f97db2e | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
#define pi 3.141592653589793
#define mod 998244353
#define pb push_back
#defin... | C++ | afb43928545743b497b1a9975768f8e5 | ceb8bee8eb6f29692ca90e484e4d105e | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long int n,r,l,i,sum,rem,no,idx,cidx,count,fidx,rem2,next;
cin>>n>>l>>r;
long long int a[n],*low,*high;
a[0]=0;
for(i=1;i<n;i++){
sum = 2*(n-i);
a[i] = a[i... | C++ | afb43928545743b497b1a9975768f8e5 | b42728c473cba6b4b056f6099e44cf15 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define INF 1e18
#define EPS 1e-6
#define pb push_back
#define pause system("pause");
#define exit exit(0)
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll t, n, l, r;
int main() {
cin >> t;
while (t--) {
cin >> n >> l >> r;
ll mx = n * (n - 1) + 1, cnt =... | C++ | afb43928545743b497b1a9975768f8e5 | 925f75b7c94e6a87ef5f7ed1e473b766 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#define sz(a) (int)((a).size())
#define fuck() cout<<"--------"<<endl
#define see(x) cout<<#x<<" = "<<x<<endl
#de... | C++ | afb43928545743b497b1a9975768f8e5 | 75e0a2d5a35352dbea92eb591a504d64 | 1,800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.lang.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
Scanner sc=n... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 7c882db622d559fbf0cc1c2dc4ce57fb | 900 | PASSED |
import java.util.*;
import java.io.*;
public class Main
{
static PrintWriter out;
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br=new BufferedReader(new InputStreamReader(System.in));
out=new PrintWriter(System.out);
}
String next(){
while(st==nu... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | a55da6cacdb54b14f58de38403dc34c7 | 900 | PASSED |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Cf131 implements Runnable
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int ... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 8349a3eb2f91e870eb7b5b2cd6e95801 | 900 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
static PrintWriter out;
static FastReader fr;
// make it false if Multiple test case is not in the question
final static boolean multipleTC = true;
// Global Variables
final static int MOD = (int) 1e9 + 7;
final static double INF = ... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 82247517dd3c7c0955451c785c8cdb6f | 900 | PASSED |
// Working program with FastReader
import java.io.*;
import java.util.*;
public class codeforces_1350A
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || ... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 8795075de6c6ca493b8a68e76fce5eea | 900 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
static public class InputIterator{
ArrayList<String> inputLine = new ArrayList<String>(1024);
int index = 0;
int max;
InputIterator(){
BufferedReader br = new BufferedReader(new InputStreamReader(System... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 79339d7b7255dfd51e647bcc2932b102 | 900 | PASSED |
import java.util.*;
public class WaterMelon {
public static void main(String[] args) {
Scanner reader = new Scanner(System.in);
int cases = Integer.parseInt(reader.nextLine());
for (int i = 0; i < cases; i++) {
String[] input = reader.nextLine().split(" ");
int n = ... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 945406fce4f64754261d192bcb3a5698 | 900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Test {
public static void main(String[] args) throws IOException {
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
String test_numS=bf.readLine();
int test_num... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | a7aab3e4cb1f1734ae1d470a8791cc35 | 900 | PASSED |
//1350A-未完成
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Orac_and_Factors {
public static void main(String[] args) throws IOException {
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
String test_numS=bf.readLine(... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | d81b1ea6ca137da5912c5a241933b74a | 900 | PASSED |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int t = Integer.parseInt(input.nextLine());
String[] numbers;
for(int i = 0;i < t;i++) {
numbers = input.nextLine().split("\\s");
i... | Java | 9fd9bc0a037b2948d60ac2bd5d57740f | 63ec102890fe3a9599cf00708eafdeb8 | 900 | PASSED |
import java.io.*;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.*;
public class Solu {
static StringBuffer str = new StringBuffer();
static InputReader in = new InputReader(System.in);
static int mm=1000000007;
public static void main(String[] args) {
int... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 5c9de8e016f33a510115d0341cd0f366 | 1,600 | PASSED |
import java.util.Scanner;
public class D_50{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] A = new long[n];
for (int i = 0 ; i < n ; i++) A[i] = sc.nextLong();
int m = sc.nextInt();
long[] B = new long[m];
for (int i = 0 ; i< m ; i++) B[i] = sc.... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | c828a7af20e73c9d4caed2ad1ccceb51 | 1,600 | PASSED |
/*
javac d.java && java d
*/
import java.io.*;
import java.util.*;
public class d {
public static void main(String[] args) { new d(); }
FS in = new FS();
PrintWriter out = new PrintWriter(System.out);
int n, m;
int[] a, b;
long[] sa, sb;
d() {
n = in.nextInt();
a = new int[n];
for (int i = 0; i < n; i+... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 7c89228d35a6b980849eef4a924f87e3 | 1,600 | PASSED |
import java.io.*;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
InputReader in = new InputReader(inputStream);
int n1 = in.nextInt();
int[] a = new int[n1];
for (i... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 5030536d286e2a14830fbd200a4b6830 | 1,600 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args)
{
InputReader in = new InputReader(System.in);
OutputWriter out = new OutputWriter(System.out);
int n = in.nextInt();
long[]a = new long[n];
for (int i =0;i<n;i++)
... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 768fdc6302eb83347007ec14bc665c84 | 1,600 | PASSED |
import java.util.*;
import java.io.*;
public class d {
public static void main(String[] args) {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
out.close();
}
public static void solve(InputReader in, PrintWriter ou... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 3c70b3d9a3f26858e731d7a6ec43a3d0 | 1,600 | PASSED |
import java.io.*;
import java.util.*;
public class Codeforces1036D {
public static void main(String[] args) {
MyScanner scanner = new MyScanner(System.in);
int n = scanner.nextInt();
int[] a = new int[n];
for(int i = 0; i < n; i++) {
a[i] = scanner.nextInt();
}
int m = scanner.nextInt();
int[] b = ne... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 678adcf4adfd414d75c05f7400537129 | 1,600 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static ArrayList<ArrayList<Integer>> list;
static HashSet<In... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 91925fb0ef81ce23be7c78474dc51878 | 1,600 | PASSED |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.util.HashMap;
import java.util.PriorityQueue;
public class templ implements Runnable {
class pair
{
int v,val;
pair(int f,int s)
{
v=f;
val=s;
}
}
public static int M=1000000007;... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 1923cedb887666fd45d85d024526ead0 | 1,600 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastReader in = new FastReader();
int n = in.nextInt();
long[] an = new long[n+1];
for(int i=1 ;i<=n ;i++) an[i] = in.nextLong();
int m = in.nextInt();
long[] am = new ... | Java | 8c36ab13ca1a4155cf97d0803aba11a3 | 999df59e00d064d39bb28bbadbd1c5e4 | 1,600 | PASSED |
// Abhay Singh Bhadoria ( _Asb_ ) //
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
vector<int> pos[N];
int main() {
ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
pos[a[i]].push... | C++ | 68987c2618285686aa9b505e0a3d8230 | 18644dfeb090df850c7a51d4b11006e9 | 1,600 | PASSED |
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#define LSB(x) ((x) & (-(x)))
const int MAX_N = 100000 + 1;
class Comparator {
public:
bool operator()(const int a, const int b)
{
return a > b;
}
};
int n, index = 0;
long long solution = 0;
std::priority_queue<int, std::vector<int>,... | C++ | 68987c2618285686aa9b505e0a3d8230 | 2298d17fa3f340d8cd4dc562e4c2915f | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define per(i,b,a) for (int i=b;i>=a;i--)
#define mes(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi first
#define se s... | C++ | 68987c2618285686aa9b505e0a3d8230 | 04cb79642d1f5ff266249b03a15e1fb4 | 1,600 | PASSED |
#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-x))
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a>b?b:a)
#define INF 0x3f3f3f3f
#define sz size()
#define pb push_back
#define ph push
#define mem(x, y) memset(x, y, sizeof(x));
#define mem0(x) mem(x,0)
#define mem1(x) mem(x,-1)
#define memINF(x) mem(x,INF)
#define all(... | C++ | 68987c2618285686aa9b505e0a3d8230 | 03ce3f0d36a4a4780e682f2039ed3a18 | 1,600 | PASSED |
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "algorithm"
#include "vector"
#include "queue"
#include "stack"
#include "set"
#include "map"
using namespace std;
const int maxn=100010;
int n;
int tree[maxn];
inline int lb(int x) {
return x&(-x);
}
void insert(int s,int x) {
while(s<maxn) {
... | C++ | 68987c2618285686aa9b505e0a3d8230 | 8bd230a1fb47d9f53a9831e7cd4526c8 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=j;i<=n;i++)
typedef long long ll;
const int maxn = 101000;
const int inf=1e9;
int n,m,x,y,g,ans,k;
struct noob
{
int x,y;
}a[maxn],b[maxn];
bool cmp(noob x,noob y)
{
return x.x<y.x||(x.x==y.x&&x.y<y.y);
}
int main(){
ios::sync_with_st... | C++ | 68987c2618285686aa9b505e0a3d8230 | a0cf156f3030817922440cc5adf49250 | 1,600 | PASSED |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string.h>
#include<math.h>
using namespace std;
typedef long long int lli;
#define fori(x,n) for(int x = 0; x < n; ++x)
#define pb push_back
#define mp make_pair
const int MAX=1e5+5;
int BIT[MAX],n,a[MAX];
v... | C++ | 68987c2618285686aa9b505e0a3d8230 | c2b488d00cee3081510fc84bd399b7bd | 1,600 | PASSED |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string.h>
#include<math.h>
using namespace std;
typedef long long int lli;
#define fori(x,n) for(int x = 0; x < n; ++x)
#define pb push_back
#define mp make_pair
const int MAX=1e5+5;
int BIT[MAX],n,a[MAX];
v... | C++ | 68987c2618285686aa9b505e0a3d8230 | 3b0b4c41516ee2576a3a394ee10d115e | 1,600 | PASSED |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=1e5+5;
struct node{
LL x;
int id;
}a[maxn];
bool cmp(node a, node b)
{
return a.x<b.x;
}
long long val[maxn];
int lowbit(int x)
{
return x&-x;
}
void add(int x, int y)
{
while(x<maxn)
{
val[x]+=y;
x... | C++ | 68987c2618285686aa9b505e0a3d8230 | d1550b30aae31642a12f91c23a9ffcbf | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(0);
ll n, ans, loc = 0;
cin >> n, ans = n;
vector<int> a(n);
vector<set<int>> s(100001);
for (int i = 0; i < n; i++) cin >> a[i], s[a[i]].insert(i);
sort(a.begin... | C++ | 68987c2618285686aa9b505e0a3d8230 | 6b86c9c954bbd6549537d33a234b8227 | 1,600 | PASSED |
import java.util.List;
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
publi... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | ead86b68f32ee79216bf480ccdfbbad2 | 1,500 | PASSED |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arra... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | 3f2146fd20b6316033e47a8ffb13f72f | 1,500 | PASSED |
import java.util.Scanner;
public class ProblemB {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int klein = 0, gleich = 0, gross = 0;
for (int i = 0; i < N; i++) {
int x = sc.nextInt();
if (x < M) klein++;
else if (x > ... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | cbb67b2d3ffedf7870b88eec9bfca247 | 1,500 | PASSED |
import java.io.*;
import java.util.*;
import java.math.*;
public class Median {
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
// 0 1 2 3 4 5 6 7
// 6 => 6 - (items - 6) + (newMedLoc > currentMedLoc ? 1 : 0)
// 2 4 6 8 1... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | b81fc8f98c6e0b6033c0b37aed226dbd | 1,500 | PASSED |
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] argv) {
new Main().run();
}
void run() {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
try {
solve();
} finally {
... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | fbe094585785f8c81f5fd61c24cb2266 | 1,500 | PASSED |
import java.util.*;
public class Median {
public static void main(String[] args){
Scanner key=new Scanner(System.in);
int len = key.nextInt();
// if(median%2==1)median++;
int tgtNum=key.nextInt();
key.nextLine();
int index=0;
int [] vals = new int[len];
f... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | 3899c78d86db78a2d9ea4a8b87cc2bea | 1,500 | PASSED |
import java.util.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.MathContext;
public class Main {
private void solve() {
int n = in.nextInt();
int x = in.nextInt();
Vector<Integer> v = new Vector<>();
for(int i =0 ; i < n; ... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | 0399f081e363a7e5341367ebbcd37517 | 1,500 | PASSED |
import java.util.*;
import java.math.*;
import java.io.*;
public class Main {
public static StringTokenizer st;
public static BufferedReader scan;
public static PrintWriter out;
public static void main(String[] args) throws IOException{
scan = new BufferedReader(new InputStreamReader(System.in)... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | 75bd39fcdb89f2ef3b6012795430dfa6 | 1,500 | PASSED |
import java.io.*;
import java.util.*;
public class middle implements Runnable {
public StringTokenizer strtok;
public BufferedReader inr;
public PrintWriter out;
public static void main(String[] args) {
new Thread(new middle()).start();
}
public static final String taskname = "middle";
public void run() {
... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | e1373f0cdfa77ef27bec5ea8cfe9fe3d | 1,500 | PASSED |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.TreeSet;
public class C {
static StreamTokenizer st;... | Java | 1a73bda2b9c2038d6ddf39918b90da61 | 7f9003fe59cff70d1218c4cf41e2587b | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int sum[20000];
int tmp[20000];
int n, k, m, j, A, B, C, ans;
int b[200][200];
int a[200][200];
void Pr()
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
sum[i] +... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | d67405cf5f03050b81554941395b4c52 | 1,400 | PASSED |
#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int field [60][60];
vector<int> v;
vector<int> vx;
int main() {
// freopen("A.ts.in","r",stdin);
freopen("input.txt", "r", stdin);
freopen("output.txt... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | 6dd1643ccace455358b62a9970490dad | 1,400 | PASSED |
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | dadcff39a55ef9eb5693e9376aa42948 | 1,400 | PASSED |
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | f14332f1a8bb2bb325d070230766dc08 | 1,400 | PASSED |
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <stack>
#include <map>
#include <vector>
#include <set>
#include <bitset>
#include <string>
#include <queue>
using namesp... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | fd62ccf828e1f1e490d245e9cb8e9f5f | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n, m;
int r[N], c[N];
int x, y, z;
int calc(int* w, int n) {
int ret = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n - 1; ++j) {
int s1 = w[i];
int s2 = w[j] - w[i];
int s3 = w[n - 1] - w[j];
if (s1 > s2... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | 5a81943fc2ec2c898dd4d44f6b78fe5e | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n, m;
int r[N], c[N];
int check(int* r, int* a, int n) {
int ret = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n - 1; ++j) {
if (r[i] == a[0] && r[j] - r[i] == a[1] && r[n - 1] - r[j] == a[2]) {
ret++;
}
... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | 7c901d1f030d5ed67cea45d4a43e1d41 | 1,400 | PASSED |
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <vector>
#include <set>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <fstream>
using namespace std;
#define REP(i,s,e) for(int i = s;i < e;i++)
#define rep(i,e) REP(i,0,e)
#define ll long long
#defi... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | 59c1c8c3e372923d22748b1711ac8050 | 1,400 | PASSED |
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
#define lowbit(x) (x&(-x))
#define Max(a,b) a>b?a:b;
#define LL long long
#define maxn 1000000
#define mod1 112233... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | 6077f81b74afee907ca39eed2ac5e393 | 1,400 | PASSED |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int row[55],line[55],num,A[3],ot[5][2],lvl;
void op(int ii[])
{
int a[3];
memset(a,0,sizeof(a));
for(int i=0;i<3;i++)
{
for(int j=ot[i][0];j<=ot[i][1];j++)
a[i]+=ii[j];
}
sort(a,a+3);
for(int i=0;i<3;i++)
if(a[i]!=A[i])return... | C++ | ef162ba7ca860369cf950d9a3686ddc8 | a222826e5fdd38b8c90acc51ef1e57a7 | 1,400 | PASSED |
#include<vector>
#include<iostream>
#include<fstream>
using namespace std;
int main(void)
{
ifstream fin("input.txt");
ofstream fout("output.txt");
long n,m,i;
vector<long>V[5000];
for(bool f;fin>>n;){
for(n<<=1,i=0;n^i;V[m-1].push_back(++i)) fin>>m;
for(i=5000;i--&&!(1&V[i].size()););
if(~i) fout<<"-1\n";
... | C++ | 0352429425782d7fe44818594eb0660c | 61226b275082a37b69fe93702d40969d | 1,200 | PASSED |
#include<vector>
#include<algorithm>
#include<iostream>
#include<fstream>
using namespace std;
bool pf(const vector<long>&E){return 1&E.size();}
int main(void)
{
ifstream fin("input.txt");
ofstream fout("output.txt");
long n,m,i;
vector<long>V[5000];
for(bool f=0;fin>>n;){
for(n<<=1,i=0;n^i;V[m-1].push_back(++i)... | C++ | 0352429425782d7fe44818594eb0660c | 8bbc756f731102e24fb2748081821f7b | 1,200 | PASSED |
#include<vector>
#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
using namespace std;
int main(void)
{
ifstream fin("input.txt");
ofstream fout("output.txt");
long n,m,i;
vector<long>V[5000];
auto pf=[](const vector<long>&V)->bool{return 1&V.size();};
for(bool f=0;fin>>n;){
for(n<<... | C++ | 0352429425782d7fe44818594eb0660c | 7c759b7e0e9d3e710a4d8cae1b78eb90 | 1,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<queue>
#define inf 1600005
#define M 40
#define N 100005
#define maxn 2000005
#define eps 1e-7
#define zero(a) fabs(a)<eps
#define ... | C++ | 0352429425782d7fe44818594eb0660c | b76b641fc9a65708ac317d4211145893 | 1,200 | PASSED |
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long int64;
typedef unsigned long long uint64;
int n;
vector<int> xs[5050];
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.... | C++ | 0352429425782d7fe44818594eb0660c | c481566c62dc628defc25bb1c1e68e31 | 1,200 | PASSED |
#include <cstdio>
#include <vector>
const int Limit = 5000;
std::vector<int> nums_[Limit + 1];
bool check() {
for (int i = 1; i <= Limit; ++i) {
if (nums_[i].size() > 0 && nums_[i].size() % 2 != 0) return false;
}
return true;
}
int main() {
std::freopen("input.txt", "r", stdin);
std::freopen("outpu... | C++ | 0352429425782d7fe44818594eb0660c | 1ded94251c0dcab94e2e9533c7bcbcb0 | 1,200 | PASSED |
#include<set>
#include<cmath>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<numeric>
#include<vector>
#include<ctime>
#include<queue>
#include<list>
#include<map>
#define pi acos(-1)
#define INF 0x7fffffff
#define clr(x) memset(x,0,sizeof(x));
#def... | C++ | 0352429425782d7fe44818594eb0660c | 7c47543007521debe2af94764f402d12 | 1,200 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <cmath>
#include<fstream>
using namespace std;
const int O=2e9;
const double E=1e-9;
co... | C++ | 0352429425782d7fe44818594eb0660c | 2612a43aeb1ece4bf74eddba75c95500 | 1,200 | PASSED |
#include <iostream>
#include <string>
#include<math.h>
#include<vector>
#include<set>
#include <map>
#include<sstream>
#include<algorithm>
#include<ctime>
#include <cmath>
#include <stdlib.h>
#include<iomanip>
#include <climits>
using namespace std;
int main()
{
freopen("input.txt", "r", stdin);
freopen("output... | C++ | 0352429425782d7fe44818594eb0660c | 4120f2415c4a0f5c330b5cc16bba83f3 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef unsigned long long uint64;
typedef pair<int, int> pii;
typedef long long int64;
#define rep(i,n) for(int i = 0; i<(int)n; i++)
#define all(X) (X).begin(), (X).end()
struct info {
int i, ind... | C++ | 0352429425782d7fe44818594eb0660c | 7a261001e82e9a7cc86b70c9ac27e456 | 1,200 | PASSED |
#include <iostream>
int big=0;
int log4roof(int num){
int k;
for(k=0;(1<<(k*2))<num;k++);
return k;
}
int main(){
int N;
std::cin>>N;
for(int i=0;i<N;i++){
int K,A;
std::cin>>K>>A;
if(A>1){
big=std::max(big,K+log4roof(A));
}else{
big=std::max(big,K+1);
}
}
std::cout<<b... | C++ | 15aac7420160f156d5b73059af1fae3b | cf9427aee236fdc2d87f00bd32b2f886 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define FOR(i,a,b) for( int i = (a); i < (int)(b); i++ )
#define REP(i,n) FOR(i,0,n)
#define YYS(x,arr) for(auto& x:arr)
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort( (x).begin(),(x).end() )
#define REVERSE(x) reverse( (x).begin(),(x).end() )
#define pb emplace_back
#define mp ma... | C++ | 15aac7420160f156d5b73059af1fae3b | d510a20fd4b5d6b81d6c5a7248bd267b | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ll unsigned long long
#define MP make_pair
#define PB push_back
#define N 100009
#define MOD 1000000007
#define f first
#define s second
#define wt(x) cout << # x <<" = " << x << endl
#define FASTIO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl "\n"
#define inf 1e1... | C++ | 15aac7420160f156d5b73059af1fae3b | e8d2cb793b00e2c15011696dd3168be4 | 1,600 | PASSED |
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
int k, m;
map <int, int> box;
while(n--) {
cin >> k >> m;
box[k] = m;
}
auto i = box.begin();
int l = i -> first, r = i -> second;
++i;
while(i != box.... | C++ | 15aac7420160f156d5b73059af1fae3b | 1c8831c41bd107bd4316c33e8c51257e | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100100
typedef long long LL;
int n, a[N];
LL b[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i ++) {
scanf("%d%I64d", a + i, b + i);
}
int rt = 0, cur = -1;
LL tp = 0;
for(int i = 1; i <= n; i ++) {
b[i] = (b[i] + 3) >> 2;
... | C++ | 15aac7420160f156d5b73059af1fae3b | 2ed29d810055b6b9be08eda88a53ba02 | 1,600 | PASSED |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cout<<#x<<" -> "<<x<<'\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#defi... | C++ | 15aac7420160f156d5b73059af1fae3b | 04e2ae63974f3d060696337fbc4bbbd5 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace HABIT{
#define f(a,b,c,d) for(register int a=b,c=d;a<=c;a++)
#define g(a,b,c,d) for(register int a=b,c=d;a>=c;a--)
#define LOCAL
typedef int i32;
typedef unsigned int u32;
typedef long long int i64;
typedef unsigned long long int u64;
... | C++ | 15aac7420160f156d5b73059af1fae3b | b6f0112e971882895da230c698334e0c | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef tuple<int,int,int> tiii;
... | C++ | 15aac7420160f156d5b73059af1fae3b | 5a54f38a1b6cad3be78fcbb5e78e956e | 1,600 | PASSED |
#include <bits/stdc++.h>
#define pii pair<ld, ld>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define y1 lsafjaljgfs
#define x1 ajhg
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const int N = 1e6 + 1;
const int TMXN = 2e6 + 10;... | C++ | 15aac7420160f156d5b73059af1fae3b | 5548455ddea86897c00585613341ce44 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ii pair< ll , ll >
#define se second
#define fi first
using namespace std;
const int N=1e5+5;
ii a[N];
ll pows (ll x , ll n)
{
ll ans=1;
for(int i=0;i<n;i++)
{
ans*=x;
}
return ans;
}
int main()
{
int n;
cin>>n;
for(int i=0... | C++ | 15aac7420160f156d5b73059af1fae3b | f15e208c55583a67b7a13ab9f772c416 | 1,600 | PASSED |
#include<bits/stdc++.h>
// I'm Klaus, Nicklaus
using namespace std;
#define ios ios_base::sync_with_stdio(0),cin.tie(0);
#define ll long long
#define ld long double
#define ms(ar,val) memset(ar,val,sizeof ar)
const int nax = 5002;
int oo = 1e8;
string s, t;
int n, m;
int dp[3][nax][3][3];
/*int go(int i, int j, int ... | C++ | cce64939977e0956714e06514e6043ff | cac2daff53d79fa97f67405ecdf42198 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vec vector
#define psb push_back
#define ppb pop_back
#define psf push_front
#define ppf pop_front
#define ins insert
#define fst first
#define scd second
using namespace std;
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL); cou... | C++ | cce64939977e0956714e06514e6043ff | 6369101fe2532753c5b416f3abf2aa9b | 1,800 | PASSED |
/*input
7 7
uiibwws
qhtkxcn
*/
#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;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE... | C++ | cce64939977e0956714e06514e6043ff | 1231a4c29ef959872e11e74fc3c71180 | 1,800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
// #define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(... | C++ | cce64939977e0956714e06514e6043ff | fb0d3a639f1e47c92d25df95a806279f | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ll,ii> iii;
int n,m;
char a[5005], b[5005];
int dp[5005][5005];
int main()
{
cin>>n>>m;
for(int i = 1; i <= n ;i++) cin>>a[i];
for(int j = 1; j <= m; j++) cin>>b[j];
... | C++ | cce64939977e0956714e06514e6043ff | a2d95fb097cde28915c2820a3811c7ff | 1,800 | 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 mem(a, b) memset(a, (b), sizeof(a))
#define all(cont) cont.begin(), cont.end()
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define mod1 1... | C++ | cce64939977e0956714e06514e6043ff | 338ef1fc4074df23ba6dd744ce4e6f79 | 1,800 | PASSED |
//agrawal117
//chahatagrawal117
#include<bits/stdc++.h>
#define endl '\n'
#define mod 1000000007
typedef long long int ll;
using namespace std;
#define MAX 5005
int n,m;
int dp[MAX][MAX];
string a,b;
int solve(int i, int j)
{
if(i==n|| j==m) return 0;
if(dp[i][j]!=-1) return dp[i][j];
int x=-1+solve(i... | C++ | cce64939977e0956714e06514e6043ff | e2669574e0176dc806f68c404bfa4be0 | 1,800 | PASSED |
#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int dp[5001][5001];
int main() {
int n, m;
cin >> n >> m;
string a, b;
cin >> a >> b;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[n][m] = 0;
}
}
for (int i = 0; i... | C++ | cce64939977e0956714e06514e6043ff | 494870f2b1da8995fb9db05f03acdb05 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi 2*acos(0.0)
#define f first
#define s second
#define pb push_back
#define gap ' '
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mod 1000000007
#define N 5000
int n,m;
string s,t;
short int dp[N][N][2][2];
int solve(i... | C++ | cce64939977e0956714e06514e6043ff | fac8f17806303e0e69c2dcc06fbddf2e | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define x first
#define y second
#define pb push_back
#define mp make_pair
template <typename T> void chkmin(T &x,T y){y<x?x=y:T();}
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
te... | C++ | cce64939977e0956714e06514e6043ff | 488da360f6e868d1a34994ebcf4b880a | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define inf 1e18
#define ll long long
ll perimeter(pair<ll,ll> a, pair<ll,ll> b, pair<ll,ll> c)
{
ll ans = abs(a.first-b.first) + abs(b.first-c.first) + abs(c.first-a.first);
ans += abs(b.second-c.second) + abs(a.second-c.second) + abs(a.second-b.second);
return ans... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | 30a3dddd74be599c099f2f2465e3e4aa | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
int n,x[N],y[N],f[N][4];
int calc3() {
int ans=0;
for(int j=0;j<(1<<6);j++) {
int c0=0,c1=0,c2=0,c3=0,c4=0,c5=0;
if(j&1) ++c0,--c2;
else --c0,++c2;
if(j>>1&1) ++c1,--c3;
else --c1,++c3;
if(j>>2&1) ++... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | 92d0e12305d855a51b927b234c25eb22 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> ... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | f000fe6b2145ec146d98464b425efdc1 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<int,i... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | 4903859eed59d0866dd09530b3432395 | 2,100 | 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;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vii = vector<ii>;
using vvii = vector<vii>;... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | 62751cf07a1ade1be398a7896720819a | 2,100 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn=3... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | d25ce01be9c879c111a6610962c8a8d6 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ft first
#define nd second
#define int long long
#define forn(i, a, b) for(int i=a; i<=b; ++i)
#define ford(i, a, b) for(int i=a; i>=b; --i)
#define repn(i, a, b) ... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | 980cf44625b5955310efe9c0162ddfe8 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 300020
#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | b1a8923c7cc00d0f8f47ce7441f1f123 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.141... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | eeb75619e9c213a34bfbc2ae1717a1b0 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define sz(a) static_cast<int>((a).size())
#define pb emplace_back
#define mp make_pair
#define endl '\n'
#define f first
#define s second
#ifdef SEREZHKA
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define ... | C++ | 9eccd64bb49b74ed0eed3dbf6636f07d | fe0a65f51b7b0d31ec641ce0f56fa2c8 | 2,100 | PASSED |
using System;
using System.IO;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.Collections.Generic;
class Solution {
private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
static void Main(str... | C# | e6689123fefea251555e0e096f58f6d1 | def68f33c3e9584014c9b2de7137b1f2 | 800 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Problem785A
{
class Program
{
static void Main(string[] args)
{
Dictionary<string, int> polyhedrons = new Dictionary<string, int>();
polyhedrons... | C# | e6689123fefea251555e0e096f58f6d1 | 32d9ef539d4e735eb52b3ea1463fe1e7 | 800 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace A.Anton_and_Polyhedrons
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
string[] arr = new string[n];
... | C# | e6689123fefea251555e0e096f58f6d1 | 9cb0bc1f9716203c36b85c6a57fe82de | 800 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleTraining
{
public class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
List<string> s = new List<string>();
for(int i = ... | C# | e6689123fefea251555e0e096f58f6d1 | ef9c181c8e96d4c9401fb79679a30122 | 800 | PASSED |
using System;
namespace CodeForce
{
class Program
{
static void Main()
{
int n = int.Parse(Console.ReadLine()), sum = 0, i = 0;
for (; i < n; ++i) {
sum += GetNum(Console.ReadLine());
}
Console.WriteLine(sum);
}
st... | C# | e6689123fefea251555e0e096f58f6d1 | 8550d61e5d6a6fc228302d180495f735 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.