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>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
int z[1005]={0};
int flag=0,sum=0,dima=0,k=0;
for(int i=1;i<=n;i++)
{
cin>>z[i];
}
int d=n;
for(int i=1;i<=n;i++)
{
k++;
if(k%2!=0)
... | C++ | a7e98ed8ee1b0a4fd03dfcd222b68c6f | 9866da2f49a8ec95cde0ede49c58772c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1000010];
void solve(){
int n,k;
cin>>n>>k;
if(k>=n) cout<<"1"<<endl;
else{
int mx=1;
for(int i=1;i<=sqrt(n);i++){
if(i>k) break;
if(n%i==0){
mx=max(mx,i);
if(n/i<=k) mx=max(mx,n/i);
}
}
cout<<n/mx<<endl;
}
}
int m... | C++ | f00eb0452f5933103f1f77ef06473c6a | 0bb6c47a5a5354abf8330636cb674931 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MINF=1e9+5;
const int INF=1e18+10;
#define N 100005
#define int long long int
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
bool isprime(int n){
if(n<=1)
return false;
if(n<=3)
return true;
for(int i=2;i*i<=n;i++){
if(n%i==0)
... | C++ | f00eb0452f5933103f1f77ef06473c6a | bd51fe05c57bdf8e4efc36a919454d60 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sct(tc) scanf("%lld",&tc)
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld%lld",&n,&m)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
int main()
{
ll tc,n,k,i,j,ans;
double l;
sct(tc);
while(tc--)
{... | C++ | f00eb0452f5933103f1f77ef06473c6a | 13ce120573ab4446c75d3f60d83391bb | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
lli t,n,k;
int main(){
cin >> t;
while(t--){
cin >> n >> k;
if(n <= k) cout << 1 << "\n";
else{
int resp=1;
int li = (lli)sqrt(n)+1;
int dalhe = 0;
for(int i=2;i<=min(k,(lli)li);i++){
if(n%i==0){
if(n/i > k) resp... | C++ | f00eb0452f5933103f1f77ef06473c6a | 24c19baafe5cb43e2a6056f6fde7a78d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
cin >> test;
for (int tt = 0; tt < test; tt++) {
int n, k;
cin >> n >> k;
int ans = n;
for (int j = 1; j * j <= n; j++) {
if (n % j == 0) {
if (j <= k) {
ans = min(ans, n / j);
}
if (n / j <= k) {
ans = min(ans... | C++ | f00eb0452f5933103f1f77ef06473c6a | 86e5ad4795059e5b64c398a91de71e8c | 1,300 | PASSED |
//#include "stdafx.h"
# include <fstream>
# include <iostream>
# include <stdlib.h>
# include <queue>
# include <string>
# include <cstdio>
# include <stdio.h>
# include <math.h>
# include <algorithm>
# include <vector>
# include <unordered_map>
# include <set>
# include <map>
# include <iomanip>
# include <math.h>
# i... | C++ | f00eb0452f5933103f1f77ef06473c6a | 04c45d5eab191409bc1f750e224e2180 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long
const int NN =1e6+10;
using namespace std;
int main()
{
int t;cin >> t;
while(t--)
{
ll n,k; cin >> n >> k;
ll ans=n;
for(ll i=1;i*i<=n; i++)
{
if(n%i==0)
{
ll temp=n/i;
if... | C++ | f00eb0452f5933103f1f77ef06473c6a | 185996970eb575be392996d98bd6a7a2 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for(int tmp=0;tmp<t;tmp++){
unsigned long long int n,k;
cin >> n >> k;
if(k>=n){
cout << 1 << "\n";
continue;
}
bool fl=false;
for(int i=2;i*i<=n;i++){
if(n%i==0&&n/i<=k){
cout << i << "\n... | C++ | f00eb0452f5933103f1f77ef06473c6a | ce256832036c52639adc880d2e15e4c7 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
//freopen("shovels.inp","r",stdin);
int t,n,k,i,kq,kt;
cin>>t;
while(t--)
{
cin>>n>>k;
kq=n;
if(k==1) cout<<n<<endl;
else if(n<k) cout<<1<<endl;
else if(n==k) cout<<1<<endl;
else
{ ... | C++ | f00eb0452f5933103f1f77ef06473c6a | 43560f9bfa11a5ced144af3f9fffc438 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
#define int long long
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(k>=n){
cout<<1<<endl; continue;
}
if(k==1){
cout<<n<<endl; continue;
}
int prime=1;
for(int i... | C++ | f00eb0452f5933103f1f77ef06473c6a | de933b23ace8e95ba94cd180ed51f89f | 1,300 | PASSED |
#include<bits/stdc++.h>
#define x1 akakak
#define y1 skkskakak
using namespace std;
const int MAX_N = 2e5 + 121;
const int INF = 2e9;
const int MAGIC = 5;
int l[MAX_N], e[MAX_N], n, m, cl, ce, v, i1, i2, j1, j2, q;
inline void up(int &a,int b){
if(b < a) a = b;
}
inline int get(int x,int y,int xh,int yh)... | C++ | 9bf6be240fb16da07b942be39bb3916a | a8f0f4d150400ff44693a3b7cd3160cd | 1,600 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100000 + 100;
int n,m,cl,ce,v,q;
int a[maxn], b[maxn];
int x1,x2,y1,y2;
void slove()
{
int ans = 0x7fffffff;
if(x1 > x2){
swap(x1,x2); swap(y1,y2);
}
int yy1 = min(y1, y2), yy2 = max(y1, y2);
int ... | C++ | 9bf6be240fb16da07b942be39bb3916a | 5575286102b4a5120d59deb544ee2e1a | 1,600 | PASSED |
#include<cstdio>
#include<algorithm>
using namespace std;
const int inf=1e9;
int ans,n,pos,m,mid,i,a,b,c[100005],l,r,e[100005],v,x1,q,yy,x2,y2;
int aabs(int a)
{
if(a<0)return -a;
else return a;
}
int main()
{
scanf("%d%d%d%d%d",&n,&m,&a,&b,&v);
for(i=1;i<=a;i++)scanf("%d",&c[i]);
for(i=1;i<=b;i++)scanf("%d",&e[i]... | C++ | 9bf6be240fb16da07b942be39bb3916a | e6926aa1da5347ffef2969806cdaba98 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 10;
int n, m, cl, ce, v, q, a, b, c, d;
int l[maxn], e[maxn];
int main()
{
scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
for(int i = 1; i <= cl; i++) scanf("%d", &l... | C++ | 9bf6be240fb16da07b942be39bb3916a | 60d754d679f14ea82cc6847f77dafa3a | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+5;
int n,m,u,e,v;
int up[maxn],el[maxn];
int q;
int main(){
scanf("%d%d%d%d%d",&n,&m,&u,&e,&v);
for(int i=1;i<=u;i++) scanf("%d",&up[i]);
for(int i=1;i<=e;i++) scanf("%d",&el[i]);
scanf("%d",&q);
sort(up+1,up+u+1);
sort(el+... | C++ | 9bf6be240fb16da07b942be39bb3916a | 4bcc93c8cce20bd3bae42f8b2c151e9f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int inf = (int)1e9;
int s[N], e[N];
int main() {
int n, m, c1, c2, v;
scanf("%d %d %d %d %d", &n, &m, &c1, &c2, &v);
for (int i = 0; i < c1; i++) {
scanf("%d", s + i);
}
for (int i = 0; i < c2; i++) {
scanf("%d", e + i);
}
int qq;
... | C++ | 9bf6be240fb16da07b942be39bb3916a | 66b84ebed335631b99fd44e9ebfcfcc4 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<int> ds,de;
pair<int,int> bs(int x) {
int a = 0;
int b = ds.size() - 1;
//stairs
int s;
if(ds.size() != 0) {
while(b - a > 1) {
int mid = (a + b) >> 1;
if(ds[mid] >= x) b = mid;
else a = mid;
... | C++ | 9bf6be240fb16da07b942be39bb3916a | 85b4e89aaf888191321112260f8327c8 | 1,600 | PASSED |
#include <iostream>
#include <list>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <map>
// # include </Users/amazalov/bits/stdc++.h>
typedef long long LL;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).be... | C++ | 9bf6be240fb16da07b942be39bb3916a | d8bd5817ec25c70ae71403db56613fb9 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100100;
int n ;
ll x,s;
vector<ll>ans , v[63];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld",&x);
v[ 63-__builtin_clzll(x) ].push_back(x);
}
for(int j=0;j<63;j++)sort(v[j].begin(),v[j].end()),reverse(v[j].... | C++ | 4033eee4e822b9df57e30297e339c17d | c914cb5c065762115d744cec10a3ef31 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100100;
int n ;
ll x,s;
vector<ll>ans , v[63];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld",&x);
v[ 63-__builtin_clzll(x) ].push_back(x);
}
for(int j=0;j<63;j++)sort(v[j].begin(),v[j].end()),reverse(v[j].begi... | C++ | 4033eee4e822b9df57e30297e339c17d | 2d01dc1d34660a755082ccc4dc6e3dbd | 2,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 100000+5;
int n; ll bin[65], a, ans[N];
queue<ll>q[65];
void work() {
scanf("%d", &n);
bin[0] = 1; for (int i = 1; i <= 60; i++) bin[i] = bin[i-1]<<1;
for (int i = 1; i <= n; i++) {
scanf("%I64d", &a);
for (in... | C++ | 4033eee4e822b9df57e30297e339c17d | 12bd81cc98bbee6576d0139639a3055f | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <stdio.h>
#define ll long long
#define fr(i,p,n) for(ll i=p;i<n;i++)
#define fr1(i,p,n) for(ll i=p;i>=n;i--)
#define FAST ios::sync_with_stdio(0);cin.tie(NULL);
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define PI 3.14159265358979323846
#d... | C++ | 4033eee4e822b9df57e30297e339c17d | bdad97a54a04b310c6566c55ce461b7d | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100100;
int n ;
ll x,s;
vector<ll>ans , v[63];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld",&x);
v[ 63-__builtin_clzll(x) ].push_back(x);
}
for(int j=0;j<63;j++)sort(v[j].begin(),v[j].end()),reverse(v[j].... | C++ | 4033eee4e822b9df57e30297e339c17d | 2182d9ea2e86a4cf4633279560424f5b | 2,200 | PASSED |
#include <cstdio>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define rush() int T;scanf("%d",&T);while(T--)
typedef long long ll;
const int maxn = 100005;
const ll mod = 1e9+7;
cons... | C++ | 4033eee4e822b9df57e30297e339c17d | 008e0808f47b0f4b74280ea092477bc7 | 2,200 | PASSED |
#include <cstdio>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define rush() int T;scanf("%d",&T);while(T--)
typedef long long ll;
const int maxn = 100005;
const ll mod = 1e9+7;
cons... | C++ | 4033eee4e822b9df57e30297e339c17d | 9b977e3571253a31d154796024e634c3 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define lll long long
#define lld long double
using namespace std;
const int N = 2e6 + 229;
const lll M = 1e9 + 7;
const lll M2 = 1e9 + 9;
const lll mod = 998244353;
const int rx[8] = {1, 1, -1, -1, -2, -2, 2, 2};
const int ry[8] = {-2, 2... | C++ | 4033eee4e822b9df57e30297e339c17d | e531576f4c3c101761be5c1ec555167b | 2,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const int N=1e5+99;
int n,maxl,pos[N];
vector<ll>vec,g[70],bit;
void getbit(ll x)
{bit.clear();while(x){bit.pb(x%2);x/=2;}}
bool solve()
{
ll sum=0;bool flag;
vector<ll>ans;
for(int i=1;i<=n;i++)
{
getbit(sum);
flag=0;
for(... | C++ | 4033eee4e822b9df57e30297e339c17d | 5d44d6b137f237178fc219165ce5ffa4 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int B = 100;
int n;
long long b[N];
queue<long long> pq[B];
void dismiss() {
cout << "No" << "\n";
exit(0);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n... | C++ | 4033eee4e822b9df57e30297e339c17d | c0a41b5fc698afbf8432ba964b4f103d | 2,200 | PASSED |
import java.util.Scanner;
public class ACoder {
public static void main(String[] args) {
Scanner k = new Scanner(System.in);
int n = k.nextInt();
System.out.println(((n * n)+1) / 2);
String x="";
String y="";
for (int i = 0; i < n; i++)
if(i%2==0)
... | Java | 1aede54b41d6fad3e74f24a6592198eb | c621fbb25bf4a891dcfa345bc8234ffa | 800 | PASSED |
import java.util.Scanner;
public class practice {
public static void main(String[] args) {
Scanner input = new Scanner (System.in);
int n = input.nextInt();
System.out.println((n * n + 1) / 2);
for (int i = 0; i < n; i++)
{
StringBuilder sb = new StringBuilder();
for (int j = 0; j < n; j++)
{... | Java | 1aede54b41d6fad3e74f24a6592198eb | 7717c8c969cd88404c2785082cb874f4 | 800 | PASSED |
import java.security.acl.LastOwnerException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.function.IntBinaryOperator;
public class Coder {
public static int... | Java | 1aede54b41d6fad3e74f24a6592198eb | 813e98d23546d12e2a545a9226502480 | 800 | PASSED |
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;
/**
* Created by HP on 3/23/2018.
*/
public class Main {
public static void main(String[] args) {
char [][] a=new char[1000][1000];
Scanner s=new Scanner(System.in);
int n=s.nextInt();
String c1,c2;... | Java | 1aede54b41d6fad3e74f24a6592198eb | c8882755f178662e58b7f86625c1bfe5 | 800 | PASSED |
import java.util.Scanner;
/**
* Created by Kuang.Ru on 14-9-24.
*/
public class A384 {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int ans;
if (n % 2 == 1) {
ans = (n / 2 + 1) * (n / 2 + 1) + (n / 2) * (n / 2);
} el... | Java | 1aede54b41d6fad3e74f24a6592198eb | f8d067867a7cdb910c125b46b397b726 | 800 | PASSED |
import java.util.Scanner;
public class Q384A {
public static void main(String[] args) {
run();
}
public static void run(){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int n2 = n;
int add = 1;
int c = 0;
String l = "";
String l2 = "";
while (n2 > 1) {
l += "C.";
n2 -= 2;
... | Java | 1aede54b41d6fad3e74f24a6592198eb | 4e4c5b79713442334d934f1818f6226c | 800 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;
public class A225 {
public void solve() throws IOException {
... | Java | 1aede54b41d6fad3e74f24a6592198eb | 921395fdb44a3c6d639515b0eb27a10b | 800 | PASSED |
import java.util.*;
public final class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int num = 0;
if (n % 2 == 1) {
num = n * n / 2 + 1;
} else {
num = n * n / 2;
}
System.out.println(num);
String s = "C", c = ".";
for (int ... | Java | 1aede54b41d6fad3e74f24a6592198eb | afd4116f75297ba26c3d7afb94fe2fc0 | 800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new Pr... | Java | 1aede54b41d6fad3e74f24a6592198eb | f20ebdee7fb5b1d441df80a03e8b7395 | 800 | PASSED |
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
short n = Short.parseShort(br.readLine()), a = (short) (n / 2);
StringBuilder s1 = new StringBuilder(), s2 = new Strin... | Java | 1aede54b41d6fad3e74f24a6592198eb | e60f8e478ce0d469f2813b863b39f288 | 800 | PASSED |
# include<cstdio>
# include<cstring>
using namespace std;
const int N=100005;
char s[N];
int main()
{
int i,t,sx,sy,ex,ey,res;
while(scanf("%d%d%d%d%d",&t,&sx,&sy,&ex,&ey)!=EOF)
{
res=-1;
scanf("%s",s);
int x=ex-sx,y=ey-sy;
for(i=0;i<t;i++)
{
if(s[i]=='E... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 91cdd3e7748ba4696700cf2db1a44dab | 1,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
long long x;
long long y;
};
node start,end;
char ch[110000];
int main()
{
// freopen("in.txt","r",stdin);
int t;
scanf("%d%I64d%I64d%I64d%I64d",&t,&start.x,&start.y,&end.x,&end.y);
ge... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 80b448b7d0bbafb2106fab462713d36a | 1,200 | PASSED |
/****************************
By: South_stream
Email: South_stream@163.com
****************************/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<queue>
#define sf scanf
#define pf printf
#define cls(a) memset(a,0,sizeof(a))
#define _cls(a) memset(a,-1,sizeof... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 0d6816b3c74a48b3e6809b4fb14f5a37 | 1,200 | PASSED |
#pragma comment(linker, "/STACK:100000000000000")
#include <stdio.h>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <string.h>
#include <ccty... | C++ | aa31a2a1ad1575aee051ddee8642c53a | f3b24c616b07db4e51fe8ecee116aa24 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t;
ll sx, sy, ex, ey;
int main(void) {
cin >> t >> sx >> sy >> ex >> ey;
int ans=0;
for (int i=0; i<t; i++) {
char c;
cin >> c;
if (sx==ex && sy==ey) {
cout << ans << "\n";
return 0;
... | C++ | aa31a2a1ad1575aee051ddee8642c53a | dcb7d72f1d5ee6f5a7d697bd6df818e0 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n , m , i , l , j , k , a , b , sx , sy , ex , ey , x , y;
string s;
int main()
{
cin>>n>>x>>y>>ex>>ey>>s;
for(i=0;i<n;i++)
{
if (s[i] == 'E' && x < ex)
x ++;
if (s[i] == 'S' && y > ey)
y --;
if (s[i] ==... | C++ | aa31a2a1ad1575aee051ddee8642c53a | f60502029ecdf7498857ab9bfce23721 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n , m , i , l , j , k , a , b , sx , sy , ex , ey , x , y;
string s;
int main()
{
cin>>n>>x>>y>>ex>>ey>>s;
for (i = 0 ; i < n ; i ++)
{
if (s[i] == 'E' && x < ex)
x ++;
if (s[i] == 'S' && y > ey)
y --;
i... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 0b875c336307a23a7ea753dd948c1144 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n , m , i , l , j , k , a , b , sx , sy , ex , ey , x , y;
string s;
int main()
{
//ios_base::sync_with_stdio(0);
cin>>n>>x>>y>>ex>>ey>>s;
for (i = 0 ; i < n ; i ++)
{
if (s[i] == 'E' && x < ex)
x ++;
if (s[i] == 'S' &&... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 7fd3c8297ef1b54fb1629d949362ceaf | 1,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t;
ll sx, sy, ex, ey;
int main(void) {
cin >> t >> sx >> sy >> ex >> ey;
int ans=0;
for (int i=0; i<t; i++) {
char c;
cin >> c;
if (sx==ex && sy==ey) {
cout << ans << "\n";
return 0;
... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 70a3fefd031f88fecf479185c64bfbaf | 1,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t;
ll sx, sy, ex, ey;
int main(void) {
cin >> t >> sx >> sy >> ex >> ey;
int ans=0;
for (int i=0; i<t; i++) {
char c;
cin >> c;
if (sx==ex && sy==ey) {
cout << ans << "\n";
return 0;
... | C++ | aa31a2a1ad1575aee051ddee8642c53a | 9808843c425df84d6f9f6169f822182d | 1,200 | PASSED |
#include <stdio.h>
#include <math.h>
#include <string.h>
int ans[10000005];
int main()
{
int q;
scanf("%d",&q);
while(q--)
{
memset(ans,0,sizeof(ans));
int n,index=2;
scanf("%d",&n);
ans[1]=1;
for(int i=2;i<=100000;i++)//i为每个人可以分到多少分
{
if(n/i==... | C++ | 1fea14a5c21bf301981656cbe015864d | b8047a7cc10266439a3a295973e6f418 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t;
cin>>t;
while(t--){
int n;
cin >> n;
set<int> ans;
int s = (int)sqrt(n);
for (int i = 0; i <= s; i++)
ans.insert(i);
for (int i = 1; i <= s; i++)
ans.insert(n / i);
cout<<ans.size()<<endl;
set<int>::iterator rit;
for ... | C++ | 1fea14a5c21bf301981656cbe015864d | d9132634aae0a8210e285a6d4baef865 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t;
cin>>t;
while(t--){
int n;
cin >> n;
set<int> ans;
int s = (int)sqrtl(n);
for (int i = 0; i <= s; i++)
ans.insert(i);
for (int i = 1; i <= s; i++)
ans.insert(n / i);
cout<<ans.size()<<endl;
set<int>::iterator rit;
for... | C++ | 1fea14a5c21bf301981656cbe015864d | 707fb9adf1ff46556e9dd92152dedcca | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
vector<int>res;
int a;
int test(int x)
{
int cur=a/x;
// cout<<"x="<<x<<"cur="<<cur<<endl;
int k=1;
while(a/x==cur)
x<<=1;
x>>=1;
// cout<<"x="<<x<<endl;
while(a/x==cur)
{
x+=k;
k<<=1;
}
if(a/(x-1)!=cur)
... | C++ | 1fea14a5c21bf301981656cbe015864d | 8061f0bd331e42adaa872f9560a4c5cb | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
int a[1000000];
int main(){
int T,n,ans,j,k;
cin>>T;
while(T--){
ans=0,j=1,k=1;
cin>>n;
a[0]=0;
while(1){
if(n/k==a[j-1]){
k=n/(n/k)+1;
continue;
}
a[j++]=n/k;
if(n/k==1) break;
k++;
}
sort(a,a+j);
cout<<j<<'\n';
for... | C++ | 1fea14a5c21bf301981656cbe015864d | 41943c97e26db5c900c19680d01e9903 | 1,400 | PASSED |
#include <iostream>
#include <cmath>
#include <set>
using namespace std;
set <int> st;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T, n;
cin>>T;
while(T--){
cin>>n;
st.clear();
int t = sqrt(n);
st.insert(0);
st.insert(t);
st.insert(n);
for(int i = 1; i <= t; ++i){
st.... | C++ | 1fea14a5c21bf301981656cbe015864d | 3bf3fd338c5cb9fde84c126e0608a175 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void F(int n)
{
set <int> ans;
for (int i = 0; i <= sqrt(n); i++)
{
ans.insert(i);
if (i > 0 && i < sqrt(n))
ans.insert(n / i);
}
cout << ans.size() << "\n";
for (auto it:ans)
cout << it << " ";
cout << "\n";... | C++ | 1fea14a5c21bf301981656cbe015864d | bc42a23b0a7be61a4257888010d9ed86 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef vector<int> vi;
int T, n;
int main()
{
cin >> T;
while (T--)
{
cin >> n;
set<int> ans = {0, 1};
rep(i, floor(sqrt(n)))
{
ans.insert(n / (i + 1));
... | C++ | 1fea14a5c21bf301981656cbe015864d | 08cc19e8e19c6188ddc35b2ca8abcebd | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl;
#define iosbase ios_base::sync_with_stdio(false)
#define tie cin.tie();cout.tie();
#define endl '\n'
typedef pair<int, int> ii;
typedef long long ll;
#define T int t; cin >> t; while( t--)
#define sT int t; scanf("%d", &... | C++ | 1fea14a5c21bf301981656cbe015864d | b95ad2894211a8cd0b4c27faa37a4da7 | 1,400 | PASSED |
#include<stdio.h>
long long out[1000010],t;
int main(){
scanf("%lld",&t);
while(t){
long long n,ans=1,a=1,b=0;
scanf("%lld",&n);
while(b<n){
b=(long long)n/(n/a);
out[++ans]=b;
a=b+1;
}printf("%lld\n",ans);
for(int i=1;i<=ans;i++)printf("%lld ",out[i]);
t--;
}... | C++ | 1fea14a5c21bf301981656cbe015864d | 052f838c297051435da4b06ac21698f8 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second
#define pb push_back
#define SQR(x) ((x) * (x))
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl
#define FOR(i, a, n)... | C++ | 3542adc74a41ccfd72008faf983ffab5 | 99c38f183670a4993c9b676c1b5aba25 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,count=0;
cin>>n;
for(int i=0;i<n;i++)
{
int a,b,c;
cin>>a>>b>>c;
if(a+b+c>=2)
count++;
}
cout<<count<<endl;
return 0;
}
| C++ | 3542adc74a41ccfd72008faf983ffab5 | 0a0f494f477ccf1b12779e2c8748db7f | 800 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,sum=0;
cin>>t;
while(t>0)
{
int count = 0;
int arr[3];
for(int k = 0; k<3; k++)
{
cin>>arr[k];
}
for( int j = 0; j<3;j++)
{
for( int i = j+1; i<3; i++)
{
... | C++ | 3542adc74a41ccfd72008faf983ffab5 | 0e78c1d11c9abf3ef47e0614554ba478 | 800 | PASSED |
#include<iostream>;
using namespace std;
int main() {
int n, sum1 = 0, sum=0 ;
cin >> n;
int q[1000][3];
for (int x = 0; x < n; x++) {
for (int y = 0; y < 3; y++) {
cin >> q[x][y];
}
sum1 += q[x][0] + q[x][1] + q[x][2];
if (sum1 == 2 || sum1 == 3)
sum++;
sum1=0;
}
... | C++ | 3542adc74a41ccfd72008faf983ffab5 | bb58e61141871a051585aa728827543a | 800 | PASSED |
#include<stdio.h>
int main()
{
int i,m,c=0,n,l;
scanf("%d",&i);
while(i>0)
{
scanf("%d%d%d",&m,&n,&l);
if(m==1&&n==1)
{
c++;
}
else if(l==1&&n==1)
{
c++;
}
else if(m==1&&l==1)
{
c++;
}
i--;
}
printf("%d",c);
return 0;
}
| C++ | 3542adc74a41ccfd72008faf983ffab5 | 40abfa2b84d088d6ffca7afb1cb21ba9 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int N, count=0, implemented = 0;
cin>>N;
int arr[N][3];
for(int i=0;i<N;i++)
for(int j=0;j<3;j++)
cin>>arr[i][j];
for(int i=0;i<N;i++)
{
count =0;
for(int j=0;j<3;j++)
if(arr[i][j] == 1) count++;
... | C++ | 3542adc74a41ccfd72008faf983ffab5 | 654141250bc06bd9c2db6b36b32baadb | 800 | PASSED |
// Example program
#include <iostream>
#include <string>
using namespace std;
int main()
{
int x , y , z , a , count = 0;
cin >> x;
for (int i = 0 ; i < x ; i++)
{
cin >> y >> z >> a;
if ((y + a + z) > 1)
{
count++;
}
}
cout << count;
return 0;
}
| C++ | 3542adc74a41ccfd72008faf983ffab5 | 4860d4453d468e8cf6176815f1e048de | 800 | PASSED |
// Example program
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin >> x;
int z , y;
int num = 0;
for (int i = 0 ; i < x ; i++)
{
y = 0;
for (int j = 0 ; j < 3 ; j++)
{
cin >> z;
if (z == 1)
y++;
}
i... | C++ | 3542adc74a41ccfd72008faf983ffab5 | fc9947c96eed52b2c94c7ef59b0ec4d5 | 800 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n , t , y , u , temp=0;
cin >> n;
for (int i = 0; i < n;i++)
{
cin >> t >> y >> u;
if (((t + y) + u) >= 2)
{
temp++;
}
}
cout << temp;
return 0;
} | C++ | 3542adc74a41ccfd72008faf983ffab5 | 11d61e70e33c4c8dfd1f08450cb19900 | 800 | PASSED |
// Example program
#include <iostream>
#include <string>
using namespace std;
int main()
{
int x , counter = 0;
cin >> x;
for (int i = 0 ; i < x ; i++)
{
int u,o,p;
cin >> u >> o >> p;
if (u + o + p >= 2)
{
counter++;
}
}
cout << counter;
r... | C++ | 3542adc74a41ccfd72008faf983ffab5 | 6daadf1e617e7060a833aa1ca2a6e60c | 800 | PASSED |
/*package com.ashutosh.codeforces;*/
import java.io.*;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* Created by ashutosh on 12/11/16.
*/
public class b327 extends FastIO{
public static void main(String[] args) {
int n = reader.readInt();
getFirtNPrimeNumbers(n);
... | Java | c047040426e736e9085395ed9666135f | cd01b03ba7b7dd1735296e02781884fa | 1,200 | PASSED |
/*package com.ashutosh.codeforces;*/
import java.io.*;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* Created by ashutosh on 12/11/16.
*/
public class b327 extends FastIO{
public static void main(String[] args) {
int n = reader.readInt();
getFirtNPrimeNumbers(n);
... | Java | c047040426e736e9085395ed9666135f | afad22929e9dc751e31feef687e2f3b9 | 1,200 | PASSED |
import org.omg.PortableInterceptor.INACTIVE;
import sun.misc.MessageUtils;
import java.io.*;
import java.math.BigInteger;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.*;
import java.util.zip.DataFormatException;
import static java.lang.Math.min;
public class MyS... | Java | c047040426e736e9085395ed9666135f | a552fa586d30e329ec9eabea35bcdd45 | 1,200 | PASSED |
import java.util.Scanner;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Vector;
public class Main
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++)
{
... | Java | c047040426e736e9085395ed9666135f | d05c800fe12f2ad6c4f281d34a5838b8 | 1,200 | PASSED |
import java.util.Arrays;
import static java.util.Arrays.fill;
import java.util.Scanner;
public class Main
{
public static void main(String args[])throws Exception
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
boolean a[]=new boolean[100000001];
fill(a,false... | Java | c047040426e736e9085395ed9666135f | ec65cbbc528e9bf0a205ccb2889e6778 | 1,200 | PASSED |
import java.util.Scanner;
public class HungarySequence {
public static void main(String arg[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
int k=0;
int r=1;
for(int i = n; i < (n << 1); i++)
System.out.print(i + " ");
/... | Java | c047040426e736e9085395ed9666135f | 9a689be78f24fe90280d2cb5908db63c | 1,200 | PASSED |
import java.util.Scanner;
public class hungrySeq {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=n;i<2*n;i++)
{
System.out.print(i+" ");
}
}
}
| Java | c047040426e736e9085395ed9666135f | 82eb213732599e1f25847c87622f8022 | 1,200 | PASSED |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main {
// make it false if Multiple test case is not in the question
static boolean multipleTC = false;
int TestCase = 1;
// for pre processing if needed
void pre() throws Exception {
}
public static void mai... | Java | c047040426e736e9085395ed9666135f | 9092ddc546598e236650328e63139bfc | 1,200 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Solution {
public static final double eps = 1e-9;
public stati... | Java | c047040426e736e9085395ed9666135f | a3b1ec6c890ad560847c6660a00b0792 | 1,200 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
/**
*
*
* @author Code Forces.
*
* Solution by: L.Azuaje.
*
* CF Problem: ... | Java | c047040426e736e9085395ed9666135f | 05d7ef33c9b6c38e8bda065997a79798 | 1,200 | PASSED |
#include<stdio.h>
int main()
{
long long int sum1=0,sum2=0,x,i,j,n,a[200010];
scanf("%lld",&n);
for(i=0;i<n;i++){
scanf("%lld",&a[i]);
}
for(i=0;i<n;i++){
sum1+=a[i];
}
if(sum1%2==0)
{
x=sum1/2;
}
else
{
x=sum1/2;
x++;
}
for(i=0... | C | 241157c465fe5dd96acd514010904321 | 4cfb5402003e54d55411c6e0c1036b25 | 1,300 | PASSED |
#include<stdio.h>
#include<math.h>
int main(){
int n,i,a[200000];
long long int c=0,d=0,x;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
c+=(long long int)a[i];
}
for(i=1;i<=n;i++){
d+=(long long int)a[i];
x=ceil((double)c/2);
if(d>=x) break;
}
printf("%d",i);
return 0;
}
| C | 241157c465fe5dd96acd514010904321 | ad98a50ed487d1d77ffc6eb3eb1bbe1b | 1,300 | PASSED |
#include<stdio.h>
#include<math.h>
int main()
{
int i,n,sum=0,x=0;
int equator;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
equator =ceil(sum/2.0);
for(i=0;i<n;i++)
{
x=x+a[i];
if(x>=equator)
{
... | C | 241157c465fe5dd96acd514010904321 | ba440488e047a19a3806717aa5bdd1e8 | 1,300 | PASSED |
#include<stdio.h>
int main()
{
int n,i,s=0,a[200020],su=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
if(s%2!=0)
s=s+1;
su=0;
for(i=0;i<n;i++)
{
su+=a[i];
if(su>=s/2)
break;
}
printf("%d",i+1);
}
| C | 241157c465fe5dd96acd514010904321 | afcfc06d1586f52fefe23573ac757821 | 1,300 | PASSED |
#include<stdio.h>
int main()
{
long int n;
scanf("%ld",&n);
long int a[n],sum1=0,sum2=0,i;
long int p=0;
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
sum1=sum1+a[i];
}
p=(sum1/2);
if(n>1){
if(sum1%2==0){
for(i=0;i<n;i++)
{
sum2=sum2+a[i];
... | C | 241157c465fe5dd96acd514010904321 | 9b038355d50162bc82d3b19fe84a8e13 | 1,300 | PASSED |
#include<stdio.h>
int main()
{
int n,i,sum=0,b=0;
float j;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n;i++){
b=b+a[i];
if(b>=sum/2.0){
break;
}
}
printf("%d\n",i+1);
return 0;
}
| C | 241157c465fe5dd96acd514010904321 | ff5fcb3e12abd11663d8906f79502119 | 1,300 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int numberOfProblem;
scanf("%d",&numberOfProblem);
int problem[numberOfProblem];
int sumOfProblem=0;
for(int i = 0 ; i < numberOfProblem ; i ++)
{
scanf("%d",&problem[i]);
sumOfProblem+=problem[i];
}
if (sumOfProblem%2=... | C | 241157c465fe5dd96acd514010904321 | bdfbbe975b36530d2d7833336cb6e3b9 | 1,300 | PASSED |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int arr[n];
unsigned long long int sum=0;
for (int i=0;i<n;i++) {
scanf("%d", &arr[i]);
sum+=arr[i];
}
unsigned long long int half=0, idx=0;
if (sum%2==1) sum=sum/2+1;
else sum=sum/2;
while (half<sum) {
half+=arr[idx++];
}
printf("%d\n", idx);
... | C | 241157c465fe5dd96acd514010904321 | f67b4f2846f397dfa1d61d20e81661dc | 1,300 | PASSED |
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int a[n],i,sum=0,j=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=1;i<=n;i++)
{
j=j+a[i];
if(j*2>=sum)
{
printf("%d",i);
break;
}
}
}
| C | 241157c465fe5dd96acd514010904321 | 4b92e49adcb47dcc7118fb79ce8dc0eb | 1,300 | PASSED |
// WTFPL - Copyright (C) 2018
// 962A - Equator
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int kind_of_search(long int *arr, int size, long int needle)
{
int L = 0;
int R = size;
while (L < R) {
int mid = L + (R - L) / 2;
if (needle <= arr[mid])
R = mid;
else
L = mid + 1;
}
return L;
}
... | C | 241157c465fe5dd96acd514010904321 | abddc212e0c8234a075ca60d05789ce8 | 1,300 | PASSED |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int infi = Integer.MAX_VALUE / 2, mod = (int) (1e9 + 7), maxn = (int) 1e5;
static long infl = Long.... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 96b1a88801c4dbaa6893c424616f7d5b | 1,500 | PASSED |
import javafx.util.Pair;
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
boolean multiple = true;
long MOD = 1000000007;
@SuppressWarnings("Duplicates")
void solve() throws Exception
{
HashMap<Pair<Integer, Integer>, Integer> m... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 01159c8fd87881063098d68d33e79458 | 1,500 | PASSED |
// package com.company;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.sql.SQLOutput;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | bbbe5ecd2c0b164d7f84e5dbabfd7f44 | 1,500 | PASSED |
//
import java.math.*;
import java.util.*;
import java.io.*;
public class C {
static BufferedReader in;
static String file = "../in";
static int test = 10; // 0 for local testing, 1 for std input
public static void main(String[] args) throws Exception
{
int _k = Integer.valueOf("1")... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 53372201c3d21825d5d62d38198cfe51 | 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.math.BigInteger;
import java.net.StandardSocketOptions;
import java.security.cert.CollectionCertStoreParameters;
import... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | e50624e15a1e9a0d3ffd24eea300e41f | 1,500 | PASSED |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import static java.lang.Math.*;
public class Main {
void run() throws IOException {
int t = nextInt();
while (t-- > 0) {
int n = nextInt();
char[] a = next().toCharArray();
TreeMap<pair, Inte... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 5df889de760285f897fa157beda0ab5e | 1,500 | PASSED |
// package cp;
import java.io.*;
import java.math.*;
import java.util.*;
public class Cf_three {
long gcd(long a,long b) {if(b==0)return a;else return gcd(b,a%b);}
void swap(long a,long b) {long temp=a;a=b;b=temp;}
StringBuilder sb=new StringBuilder();
BigInteger RES=new BigInteger("0");
//(Initialize as string) ... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 692f9f0272ad6a0af8921aba4c31c3a7 | 1,500 | PASSED |
import java.io.*;
import java.math.*;
import java.text.DecimalFormat;
import java.util.*;
public class MainClass
{
InputStream in;
PrintWriter out;
long mod=(long)1e9+7;
int MAX=(int)2e5+7;
double eps=1e-6;
String high="";
void solve()
{
int t = ni();
while(t-- > 0) {
int n = ni();
String pat... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | ece41c919b682940b8825ab0e059c259 | 1,500 | PASSED |
import java.util.*;
public final class Second {
static class Point {
int x, y;
Point(int a, int b) {
x = a;
y = b;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public boolean equals... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | 8aa37e622c97c2ec216840c8ff994db2 | 1,500 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
private void solve()throws IOException{
int n=nextInt();
HashMap<String,Integer> map=new HashMap<>();
map.put("0 0",0);
int time=1;
int x=0,y=0;
String s=nextLine();
int min=inf;
int l=-1,r... | Java | 1fc1d5ee79aaf823b246db5471ba7836 | b64bbc032f392d32f91854e7d55127d2 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n,x;long long int ans=0;
cin>>n>>x;
int no[n];
map<int,int>store;
for(int i=0;i<n;i++)
{
cin>>no[i];
store[no[i]]++;
}
for(int i=0;i<n;i++)
{
if(x==0)
{
... | C++ | daabf732540e0f66d009dc211c2d7b0b | 4722c3316b61fdb2cc5e13b553075c2e | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.