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 |
|---|---|---|---|---|---|
using System;
class _1095D
{
static void Main()
{
int n = int.Parse(Console.ReadLine());
if (n == 3)
{
Console.WriteLine("1 2 3");
return;
}
int[][] g = new int[n + 1][];
for (int i = 1; i < n + 1; ++i)
{
g[i] = new int[2];
}
for (int i = 0; i < n; ++i)
{
int[] xy = Array.ConvertAll(C... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | bd55db6b8c27ee51dc637497dd96e445 | 1,600 | PASSED |
using System;
using System.IO;
using System.Text;
namespace Circular_Dance
{
internal class Program
{
private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
private static readonly StreamWriter writer = new StreamWrit... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | eb9863dba80c46be81e3de14607701cc | 1,600 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleApp1
{
class Animal
{
public string name;
public string color;
public override bool Equals(object obj)
{
return base.Equals(obj);
... | C# | 819d3694fccf2b5af0ec3b4ee429dbb3 | b2abbd766fd203837cecc5fb22fd9e77 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <cmath>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <sstream>
#define fr(a,b,c) for (int a=b;a<=c;a++)
#define frr(a,b,c) for (int a=b;a>=c;a--)
#def... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 8c8aee19a118ec7d50818a277f80c581 | 1,800 | PASSED |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <complex>
using namespace std;
typedef long long LL;
typedef unsigned long long... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | a7c7863acb5a0f38ee3d9530296fe6df | 1,800 | PASSED |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cassert>
#include <cctype>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
#define FOR(i,a,b) for(int i = (a),_n=(b);i<=_n;i++)
#define REP... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 82e35d84c8f95f1169d3e79109cafd12 | 1,800 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int i, j, n, m, k;
cin >> n;
int b[n];
int pr[n];
int mas[n][n];
for (j = 0; j < n; j++)
for (i = 0; i < n; i++)
cin >> mas[j][i];
for (j = 0; j < n; j++)
cin >> pr[j];
for (j = 0; j... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 582d3a8e44d517c3be0ef3177dcbe23c | 1,800 | PASSED |
/*************************************************************************
> File Name: b.cpp
> Author: Nature
> Mail: 564374850@qq.com
> Created Time: Thu 13 Nov 2014 07:58:21 PM CST
************************************************************************/
#include <cstdio>
#include <cstring>
#include... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 2104969b5626bda617a9d96be500f4e6 | 1,800 | PASSED |
#include <stdio.h>
#include <string.h>
int ans[300],alex[300];
int pref[300][300];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
scanf("%d",&pref[i][j]);
for(int i=0;i<n;i++)
scanf("%d",&alex[i]);
memset(ans,-1,sizeof(ans));
for(int c=1;c<=n;c++){
int f=-1,s=-1;
for(int i... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 1434d751a7d3312b3a58f8e0fbfcc2d8 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
int arr[350];
int man[350][350];
int ans[350];
int h[350][350];
int taka(int x)
{
for(int i=1;i<=n;i++)
{
if(arr[i]<=x) return arr[i];
}
}
int dam(int x,int y)
{
for(int i=1;i<=n;i++)
{
if(arr[i]<=x && arr[i]!=y) return arr[i];
... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 23e3f71f2c75d991010494859d0fd3fa | 1,800 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int MAXN = 310;
const int INF = 0x3f3f3f3f;
int n, x, p[MAXN][MAXN], ans[MAXN];
struct Node {
int id, order;
Node() {}
Node(int _id, int _order) : id(_id), order(_order) {}
bool operator < (const No... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | 2206d728f99f6233848111c3dfb3c1d5 | 1,800 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
int n;
int p[310][310];
int pr[310];
int a[310];
bool best(int x, int y){
for(int i=0; i<n; i++){
if(p[y][i]==y) continue;
if(p[y][i]==x) return true;
int... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | f4bebeeb60a6576051b6cb57535834b6 | 1,800 | PASSED |
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 305;
int p[N][N];
int a[N];
int na[N];
int np[N][N];
int f[N];
int main(void) {
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) {
scanf("%d", &p[i][j]);
np[i][p[i][j]] = j;
}... | C++ | d8f8be420c1d9553240708f28f8ba4b2 | d0c565d7f3eece7573940a6cefcdca35 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define sd(x) scanf("%d",&x)
#define sd2(x,y) scanf("%d%d",&x,&y)
#define sd3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define LET(x, a) __typeof(a) x(a)
#define foreach(it, v) for(LET(it, v.begin()); it != v... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 93c498fb675bbf578de99d1127a5c981 | 2,300 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
const int pri[] = {2, 3, 5, 7, 11, 13};
int k, num, ans[100010];
void dfs1(int o, int zong, int pr)
{
if(o > 2 * k * k)return;
if(pr < 0)
{
++ num;
ans[num] = o;
return;
}
int nowo = o, nowzong = zong;
while(zong ... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 192b6ef4c6e9e7f10448bf3544f4f91a | 2,300 | PASSED |
/*
By Tianyi Chen. All rights reserved.
Date: 2017-02-11
*/
#include<bits/stdc++.h>
using namespace std;
int k,p,limit;
const int prime[]={2,3,5,7,11,13};
unordered_set<int>ans;
void dfs(int i,int64_t m) {
if(m>limit)return;
if(i==6) {
if(ans.size()<k)ans.insert(m);
if(ans.size()==k) {
for(auto&&x:ans)printf("... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 3d5e28f2c13bdcb6584e109ce2d3a23c | 2,300 | PASSED |
#include <stdio.h>
#include <vector>
#include <queue>
#define pb push_back
using namespace std;
const int MAX_PRIMES = 15;
vector<int> primes;
vector<int> num[(1 << MAX_PRIMES) + 5];
bool used[(1 << MAX_PRIMES) + 5];
vector<int> BFS(int sz, int k) {
queue<int> fila;
vector<int> ans;
fila.push((1 << sz) ... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 6d3b146abc8dc58919b4096c3c7ec3e7 | 2,300 | PASSED |
/*
* 364C. Beautiful Set.cpp
*
* Created on: Aug 2, 2016
* Author: Osama Hatem
*/
#include <bits/stdtr1c++.h>
#include <ext/numeric>
using namespace std;
const int MAXN = 5001;
int k;
bool vis[MAXN];
vector<int> primes;
vector<pair<int, int>> ans;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r",... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 519ca7b2ec629c41f89dc4d3d41f8de6 | 2,300 | PASSED |
#include<stdio.h>
#include<string>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<bitset>
#include<map>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ... | C++ | 74713233dd60acfbc0b26cd3772ed223 | c0dc2a2ebf983af7915e7000e0b88fc5 | 2,300 | PASSED |
#include<cstdio>
#include<vector>
using namespace std;
const int pr[5]={2,3,5,7,11};
vector<int> a;
int main(){
int n;
scanf("%d",&n);
a.push_back(1);
for(int i=0;a.size()<n+1;i++)
for(int j=0;j<a.size();j++)
if(a[j]*pr[i]<=n*n*2)a.push_back(a[j]*pr[i]);
for(int i=a.size()-n;i<a.... | C++ | 74713233dd60acfbc0b26cd3772ed223 | d0add6887d44d83f9cfd81d8579a3dcf | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector <int> o{1}, ps{2,3,5,7,11};
int main() {
int n;
scanf("%d", &n);
for (auto p: ps) {
if ((int)o.size() > n) break;
for (int i=0; i<(int)o.size(); ++i) if (o[i]*p<=2*n*n) o.push_back(o[i]*p);
}
for (int i=0; i<n; ++i) printf("%d ", *(o.rbegin()+i));
return ... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 8bcdd1aa97b3d9267c7cf913b14d0958 | 2,300 | PASSED |
#include <iostream>
#include <set>
#include <map>
#include <utility>
using namespace std;
int a2, a3, a5, a7, a11;
int wynik = 0;
int pytam;
bool isOk1(int x) {
while(x % 2 == 0) x /= 2;
while(x % 3 == 0) x /= 3;
while(x % 5 == 0) x /= 5;
return (x == 1);
}
void check1(int k) {
for(int i = 2 * k ... | C++ | 74713233dd60acfbc0b26cd3772ed223 | 3ec6fc8ad4ee114f3c709c5659f1e06f | 2,300 | PASSED |
#include <iostream>
#include <stack>
#include <string>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#define ll long long
using namespace std;
set <pair <int,int> > q[6];
set <pair <int,int> > q2;
int num[10];
vector <int>... | C++ | 74713233dd60acfbc0b26cd3772ed223 | a35ff7e9798563e64140abe6925369dc | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <cstdio>
#include <stdlib.h>
#include <stack>
#include <numeric>
#include <bitset>
#include <cctype>
#include <list>
#include <assert.h>
#include <rand... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 1feb53b5c63eba3238a1b1570cd3b5b7 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,K,S[2510][2510],p1[10],p2[10];
ll ans;
char str[2510][2510];
inline int calc(int lx,int ly,int rx,int ry)
{
return S[rx][ry]-S[lx-1][ry]-S[rx][ly-1]+S[lx-1][ly-1];
}
void solve(int lx,int ly,int rx,int ry,bool dir)
{
if(lx>rx||ly>ry)return;
i... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 6bc15768fd745edd085090f22c12bbd2 | 3,000 | PASSED |
#include <bits/stdc++.h>
typedef long long LL;
const int N = 2505;
int n, m, k, a[N][N], s[N][N];
LL ans = 0;
int sum(int l, int r, int L, int R) {
return s[r][R] - s[l - 1][R] - s[r][L - 1] + s[l - 1][L - 1];
}
int A[N][N][7], B[N][N][7];
void solve(int l, int r, int L, int R) {
if (l == r && L == R) return ans ... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 0dad83609c4e9875ed7635467e531898 | 3,000 | PASSED |
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<math.h>
#define ll long long
#define MAXN 2505
ll a[MAXN][MAXN],b[2][7];
char c[MAXN];
ll ans,n,m,k;
ll sum(ll x1,ll y1,ll x2,ll y2){
return a[x2][y2]-a[x2][y1-1]-a[x1-1][y2]+a[x1-1][y1-1];
}
void work(ll x1,ll y1,ll x2,ll y2,ll type){
if(x1==x2&&y1==y2... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 0712412fb017c7aa7c627a6c388c3300 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2505;
int n, m, num;
int a[N][N];
int sum[N][N];
int bestL[10], bestR[10];
ll ans;
int get(int lx, int rx, int ly, int ry) {
if (lx > rx || ly > ry) {
return 0;
} else {
return sum[rx][ry] - sum[lx - 1][ry] - sum[rx][ly - 1] + su... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 2b4d3081a717be9c4ea6612a19bfcf7d | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define db long double
int n, m, k;
bool a[2501][2501];
int sum[2501][2501];
ll ans = 0;
int get(int x1, int x2, int y1, int y2){
re... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | a91f8f544f198a003ac4be262b91739b | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,k;
string s;
int bound1[10],bound2[10];
bool graph[2501][2501];
int pre[2501][2501];
long long int ans=0;
int calc(int x1,int y1,int x2,int y2){
return pre[x2][y2]-pre[x2][y1]-pre[x1][y2]+pre[x1][y1];
}
int cnt=0;
void solve(int x1,int y1,int x2,int y2,bool vertic... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | 26e07e616ecead34ef4498823bb2c07b | 3,000 | PASSED |
// In the name of Allah.
// We're nothing and you're everything.
// Ya Ali!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2500 + 14;
int n, m, k;
char c[maxn][maxn];
int up[maxn][maxn], dn[maxn][maxn];
int main(){
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m >> k;
... | C++ | 2571ed6a92294e35f633ca57f54a5b91 | cc10ae3ccac89702cadb2653c7cf5d83 | 3,000 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
long long int n,*a,max=0,min,mxpos=0,mnpos=0,t,i;
scanf("%lld",&n);
a=(long long int *)malloc(sizeof(long long int) * n);
for(i=0; i<n; i++)
{
scanf("%lld",&a[i]);
if(i==0)
{
min=a[i];
}
if(m... | C | eb2d1072c5308d9ef686315a122d9d3c | 659808f55cb98e9f3506186528ea6d5e | 1,300 | PASSED |
#include <stdio.h>
int main()
{
long long a[200001]={0},min=1000000000,max=1,n,i,x,mincount=0,maxcount=0;
scanf("%I64d",&n);
for (i=0;i<n;i++){
scanf("%I64d",&x);
if (x<min){
mincount=0;
min=x;
}
if (x==min)
mincount++;
if (x>max){
maxcount=0;
max=x;
}
i... | C | eb2d1072c5308d9ef686315a122d9d3c | 98c081fc76eb0e0768e14eb31f78df46 | 1,300 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
int main()
{
long long int n,i,minCount=0,maxCount=0,min=INT_MAX,max=INT_MIN,num;
scanf("%lld",&n);
int flag = 1;
for(i=0;i<n;i++)
{
scanf("%lld",&num);
if(flag)
{
min=num;
max = num;
m... | C | eb2d1072c5308d9ef686315a122d9d3c | ff72ef507cf02509ef135d6160f90504 | 1,300 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<limits.h>
int arr[200005];
int compare(int *a,int *b){
return *a-*b;
}
int main(){
int a,b,c;
scanf("%d",&a);
int i;
int min=INT_MAX;
int max=0;
for(i=0;i<a;i++){
scanf("%d",arr+i);
if(arr[i]>max)
... | C | eb2d1072c5308d9ef686315a122d9d3c | 8084dc2550d45c9957d41bf984dfd7de | 1,300 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<limits.h>
int arr[200005];
int compare(int *a,int *b){
return *a-*b;
}
long long int bound(int arr[],int size,int target,int check){
int f,m,l;
f=0;
l=size;
if(!check){
while(f<l){
m=(f+l)/2;
if(arr[m]<=target){
... | C | eb2d1072c5308d9ef686315a122d9d3c | a31e081d607fa80f1002f0373b5e31b8 | 1,300 | PASSED |
#include<stdio.h>
int main()
{
long long int n,i,j,max=0,count=0,l,m,min=20000000000,count2=0;
scanf("%I64d",&n);
long long int a[n];
for(i=0;i<n;i++)
{
scanf("%I64d",&a[i]);
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
/* for(i=0;i<n;i++)
... | C | eb2d1072c5308d9ef686315a122d9d3c | a3b554be22bacc65088fadd042d512d0 | 1,300 | PASSED |
#include<stdio.h>
//#include<string.h>
#include<math.h>
main()
{
//freopen("out.txt", "r", stdin);
int m, c = 1, i, max = 0, min = 99999999999;
long long cmax = 0, cmin = 0, n;
scanf("%I64d", &n);
int a[n];
for(i = 0; i<n; i++)
{
scanf("%d", &a[i]);
if(a[i]>=max)
... | C | eb2d1072c5308d9ef686315a122d9d3c | 54f146497bfc15c9ddba6930ff1a46f7 | 1,300 | PASSED |
#include<stdio.h>
int main()
{
long long int n,b,i,j,mn=10000000000,mx=0,cnt_min,cnt_max,dif,way;
scanf("%I64d",&n);
for(i=0;i<n;i++)
{
scanf("%I64d",&b);
if(b>mx)
{
mx=b;
cnt_max=1;
}
else if(b==mx) cnt_max++;
if(b<mn)
{
... | C | eb2d1072c5308d9ef686315a122d9d3c | 01a76473a49939c2ab5f28cc8f4957ca | 1,300 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main(){
long long int n;
long long int bn = 1LL;
long long int sn = 1LL;
scanf("%I64d", &n);
long long *b;
long long bbuff;
long long sbuff;
b = (long long int*)malloc(sizeof(long long int)*n*1.5);
int i;
for (i = 0; i < n; i++)... | C | eb2d1072c5308d9ef686315a122d9d3c | 485074671c70b5f9b21bed17fb098202 | 1,300 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int all_same(int *list, int N){
int i, first;
first = list[0];
for(i=1; i<N; i++){
if(list[i] != first)
return 0;
}
return 1;
}
long long NCR(int N, int r){
int i;
long long temp = 1;
for(i=N; i>N-r; i--){
temp = temp *... | C | eb2d1072c5308d9ef686315a122d9d3c | 83fd6a1ac134060f4eaab35e9c6f3b9e | 1,300 | PASSED |
#include<bits/stdc++.h>
#define M 200005
using namespace std;
queue<int>Q;
vector<int>dsu;
int n,m,d,i,fa[M],x,y,used[M],vi[M],Fa,u,v;
vector<int>g[M];
int fin(int u){return fa[u]==u?u:fa[u]=fin(fa[u]);}
void merge(int u,int v){
int X=fin(u),Y=fin(v);
if(X!=Y)fa[X]=Y;
}
int main(){
cin>>n>>m>>d;
for(i... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 1b023c9bebe85bc483bf1a52c870fd4a | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Dsu {
vector<int> anc;
Dsu(int n = 0) : anc(n) {
iota(anc.begin(), anc.end(), 0);
}
int operator[] (int x) {
return x == anc[x] ? x : anc[x] = operator[](anc[x]);
}
bool operator() (int u, int v) {
int a = operator[](u)... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 06406c3ca12f3386006d17c2edee98a8 | 1,900 | PASSED |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int n, m, d, u, v, c;
vector <int> edges[200005];
bool visited[200005];
bool con... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 41e88912679893e2969268a6dffa1d3f | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector <... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 1bb632d0e11219dfa12692be807d567a | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define PI 3.14159265
#define int long long
#define f first
#define s second
#define umap unordered_map
#define pb push_back
#define eb emplace_back
#define ins insert
#define all(a) a.begin(),a.end()... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 35bb97c9638fcc7201fa0a6174879173 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | b502c67413eaccae0006bd84521514a3 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s; i < n; i++)
#define x first
#define y second
typedef pair<int, int> ii;
const int maxn = 200005;
int p[maxn];
int n,m,D;
vector<int> g[maxn];
int vis[maxn];
vector<ii> all;
vector<ii> ans;
int cnt;
void dfs(int node){
if(vis[node])return;
... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | a158aa5f2b5b817fbc9bc1743cde5f1c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define endl "\n"
#ifdef DEBUG
#define dump(v) cerr << "["#v << ":" << (v) << "]" << endl;
#else
#define dump(v)
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef ... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 2b53f40fcd2826846e640c9a67c63b60 | 1,900 | PASSED |
//region trash
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define DB(x){if(cond)cerr<<__LINE__<<" "<<#x<<" " <<x<<endl;}
#define REP(i,b)for(auto i=0;i<(b);++i)
#define FOR(i,a,b)for(auto i=(a);i<=(b);++i)
#define FORD(i,a,b)for(auto i=... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 97ee439adecbf8996ecab411400b4c66 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define db(x) cerr<<#x<<" = "<<x<<endl;
using namespace std;
struct _edge{
int u,v,nxt;
}edge[400205];
int inn[200205];
int fa[200205];
bool cho[400205];
int fl[200205];
int ecnt;
int hed[200205];
bool met[200205];
int f(int x){
if(fa[x]==x)return x;
else return fa[x]=f(fa[x]);
}
void uni(int... | C++ | 0cfaaa70b7990e4f170eb397cd8756f8 | 64c2c6a60f2d21a481f23c1223ae2846 | 1,900 | PASSED |
#include <string>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | C++ | ddc9201725e30297a5fc83f4eed75fc9 | ef2ac3b1f5bcac25191b807ecee4c2b8 | 1,000 | PASSED |
#include <iostream>
#include <sstream>
using namespace std;
string s;
string to_string(int a) {
stringstream ss;
ss << a;
return ss.str();
}
int eval(string s) {
if(s.length() == 1)
return 0;
int sum = 0;
for(int i = 0; i < s.length(); i++)
sum += s[i] - '0';
return 1 + eval(to_string(sum));
}
int main... | C++ | ddc9201725e30297a5fc83f4eed75fc9 | bfcbb578f18a1cefd386129a17eace70 | 1,000 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <map>
#define xx first
#define yy second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define MAX 2000000000
using namespace std;
int dirx[8... | C++ | ddc9201725e30297a5fc83f4eed75fc9 | 11f302c1cacf6fa276fb53c103f09ad6 | 1,000 | PASSED |
# include <iostream>
# include <vector>
# include <queue>
# include <deque>
# include <stack>
# include <set>
# include <string>
# include <algorithm>
# include <cstdio>
# include <cstdlib>
# include <map>
# include <cmath>
# include <bitset>
# include <list>
# include <sstream>
using namespace std;
string toString(i... | C++ | ddc9201725e30297a5fc83f4eed75fc9 | 7b49dc1fc437fa7ea932855a5fb40919 | 1,000 | PASSED |
#include"stdio.h"
int cnt=0,i;
char arr[100005];
void sum(){
int t=0;
for(i=0;arr[i];i++)
t+=arr[i]-48;
sprintf(arr,"%d",t);
}
int main(){
scanf("%s",arr);
while(1){
if(arr[1]==0)break;
sum(); cnt++;
}
printf("%d",cnt);
return 0;
}
| C | ddc9201725e30297a5fc83f4eed75fc9 | b08659a29b4dcdf6a28a73cc21ba75be | 1,000 | PASSED |
#include<stdio.h>
#include<string.h>
int sm;
int f(int n)
{
sm=0;int s;
while(n>0)
{
s=n%10;
// printf("%d---",s);
sm=sm+s;
n=n/10;
//printf("%d\n",n);
}
return sm;
// printf("%d",sm);
}
int main()
{
int... | C | ddc9201725e30297a5fc83f4eed75fc9 | 3c0128592bb2db24db022259b1c29a4a | 1,000 | PASSED |
//Bismillahir rahmanir rahim
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void) {
// your code goes here
char num[100001];
gets(num);
int i,c=0, y,sum=0;
y = strlen(num);
if(y<2){
goto asd;
}
qer:
for(i=0;num[i];++i)
sum += num[i]-'0';
//print... | C | ddc9201725e30297a5fc83f4eed75fc9 | acf03f34ef3322a6217253ff9a4ffa14 | 1,000 | PASSED |
#include<stdio.h>
#include<string.h>
int main()
{
char arr[100002];
int sum=0,c=0,i,j,k,l;
scanf("%s",arr);
l=strlen(arr);
if(l!=1)
{
for(i=0;i<l;i++)
sum=sum+arr[i]-48;
c++;
}
while(sum>=10)
{
k=0;
while(sum!=0)
{
j=sum%10;
... | C | ddc9201725e30297a5fc83f4eed75fc9 | d49b5ed278250131289687e75285c894 | 1,000 | PASSED |
# include <stdio.h>
main()
{
long long int t,ans=1,a[100001],j,n=0,i=0;
char c;
while((c=getchar())!='\n')
a[i++]=c-'0';
i--;
if(i==0){printf("0");return 0;}
for(j=0;j<=i;j++)n+=a[j];
while((n/10)!=0)
{
t=0;ans++;
while(n!=0)
{
t+=(n%10);
n/=10;
}
n=t;
}
printf("%I64d",ans);
return ... | C | ddc9201725e30297a5fc83f4eed75fc9 | 65b1b5daaa85265c67f83154236ac5dd | 1,000 | PASSED |
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
int n,i,j,sum=0,count=0;char no[100002];
scanf("%s",&no);
while(no[1])
{
count++;
int sum=0;
for(j=0;no[j];j++)sum+=no[j]-'0';
sprintf(no,"%d",sum);
}
printf("%d",count);
return 0;
} | C | ddc9201725e30297a5fc83f4eed75fc9 | 9dce1ae52e5097b84ee4d46e4efe6094 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define sz(a)int(a.size())
int vis [5010][30][30];
int c [30][5010];
int main () {
string s;
cin >> s;
int n = sz(s);
for (int i = 0; i < n; i++) {
int p = i;
for (int j = 1; j < n; j++) {
p++;
if (p >= n) p = 0;
vis[j][s[i]-'a'][s[p]]++;
}
}
... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 83878da96005cae0ff67c1aee37b6bf1 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
string s;
double ans;
int cnt[200];
vector <int> v[200];
int main()
{
cin >>s;
double n=s.size();
for (int i=0;i<n;i++)
v[s[i]].push_back(i);
for (char i='a';i<='z';i++)
{
if (!v[i].empty())
{
int x=v[i][0];
... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | e3c58730f47f7d06ca8f1325e58c1a41 | 1,600 | PASSED |
/*
.
iXXXXXXXXXX22XXXXi ... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 187d88d0574a2937341623ab56d390bc | 1,600 | PASSED |
#include<stdio.h>
#include<iostream>
#include<map>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<queue>
#include<vector>
#include<iomanip>
#include<string.h>
#include<algorithm>
#include<stack>
#include<complex>
#define inf 0x3f3f3f3f
#define pi (2*asin(1))
//std::ios::sync_with_stdio(false... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 19a6d61816e4fd8e710aac3ee7ce764f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <(b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define FORE(i, c) for(auto i = (c).begin(); i != (... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 714c61bcdd53efb65b565ed434f339e5 | 1,600 | PASSED |
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define d long double
#define pii pair<int,int>
#define pb push_back
#define cases int tc;cin>>tc;w... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | abc84090f526cb492ae0f2aaae5cd791 | 1,600 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int mp[26], ct2[26];
int ct[26][26];
int main() {
cin.tie(0... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | e2bb23d806b165377ce52674216302a6 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector <string> V [26];
int toInt(char c)
{
return (int) (c-'a');
}
int cnt [26];
int main()
{
string s;
cin >> s;
int len = s.size();
for(int i = 0; i < len; i++)
{
cnt[toInt(s[i])]++;
string t = s.substr(i+1);
string toAdd =... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 633f4f6e87c32311ca869d05291cdbcb | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const int N=1e5+5;
int m[26][5005][26];
int32_t main()
{
IOS;
string s;
cin>>s;
int n=s.size();
s+=s;
long double ans=0;
for(int i=0;i<s.size()/2;i++)
{
char ch=s[i];
int ctr=1;... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | 30f525889f5051d2dbff8d181bb5bc27 | 1,600 | PASSED |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <strin... | C++ | 4c92218ccbab7d142c2cbb6dd54c510a | c881dec0046376c5e0cc425844c26d5d | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void divisores(int a);
void sionovrga();
int n;
vector <pair <int,int> > aarray;
vector <int> divi;
set<int> st;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b;
cin>>n;
for(int i=0; i<n ;i++){
cin>>a>>b;
aarray.push_back(m... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 5039b6e7082e062a92bd6d1a727f3e3b | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 1;
int n;
pair<int, int> a[N];
vector<int> d;
set<int> st;
void calc_div(int x) {
d.clear();
int sqrtx = sqrt(x) + 1;
for(int i = 1; i <= sqrtx; ++i) {
if(x % i == 0) {
d.push_back(i);
if(x / i != i)
d.push_back(x / i);
... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 1b7e4b5bd7fd6479a26c7c6047be8e46 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
const int maxn=(int)4e5+5;
int n;
void fac(int x, set<int>& factors) {
for (int p=2; p*p<=x; p++) {
if (x%p) continue;
factors.insert(p);
while (x%p==0) x=x/p;
}
... | C++ | aba6e64e040952b88e7dcb95e4472e56 | f5519142a48d67630471d06aa614b5cd | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll A[150001],B[150001];
void add_primes(unordered_set<ll> &p, ll num) {
// for (ll i=2; i<= (ll) sqrt(num); i++) {
// if (num%i==0) p.insert(i);
// }
while (num%2==0) {
p.insert(2);
num/=2;
}
for (ll i=3; i<= (ll) sqrt(nu... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 5cabc9432bbd2482e8a4f3776d00d301 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll A[150001],B[150001];
void add_primes(unordered_set<ll> &p, ll num) {
while (num%2==0) {
p.insert(2);
num/=2;
}
for (ll i=3; i<= (ll) sqrt(num); i+=2) {
while (num%i==0) {
p.insert(i); num/=i;
}
}
if (num>2) p... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 99e302ccd2bf5b380e4f32d822c6c4e3 | 1,600 | PASSED |
#include <iostream>
#include <queue>
#include <algorithm>
#define forn(i,a,b) for(ull i = a; i < b; i++)
#define ll long long
#define ull unsigned long long
#define fr first
#define sc second
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
ull prime(ll n)
{
if(n%2 == 0) re... | C++ | aba6e64e040952b88e7dcb95e4472e56 | c1a13b6a4a17679175e325fd141f32c7 | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <math.h>
#include <stack>
#include <tuple>
#include <stdio.h>
#include <stdio.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define debug false
#define ll... | C++ | aba6e64e040952b88e7dcb95e4472e56 | ec72a9fb0e344b4f5951b58be3edaf01 | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <math.h>
#include <stack>
#include <tuple>
#include <stdio.h>
#include <stdio.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define debug false
#define ll... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 9445d660efbd4d3fddd813ad0ab8c80e | 1,600 | PASSED |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
set<int> v2;
void div(ll a)
{
int i;
while(a%2==0)
{
v2.insert(2);
a/=2;
}
for(i=3; i<=sqrt(a); i+=2)
{
while(a%i==0)
{
v2.insert(i);
a/=i;
}
}
if(a>2)
... | C++ | aba6e64e040952b88e7dcb95e4472e56 | b4f6c63adf9a8e1548efc8ba58c51fd8 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll p[1501000];
ll a[150100],b[150100];
bool not_p[30010000];
int cnt,n;
void init(){
int maxn=30000000;
for(int i=2;i<=maxn&&cnt<1000000;i++){
if(!not_p[i]) p[cnt++]=i;
for(int j=0;j<cnt&&i*p[j]<=maxn;j++){
not_p[i*p[j]]=1;
if(i%p[j]==0) br... | C++ | aba6e64e040952b88e7dcb95e4472e56 | 10b6b06e6488afa3703431fb42e6ec58 | 1,600 | PASSED |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <stack>
#include <limits>
#include <vector>
#include <stack>
#include <sstream>
#include <queue>
#include <utility> // for pair
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b,c) for(int i=a;i<b;i += c)
#define FORd(i,a,b,c... | C++ | c9b322a9138410a82e541179272eb6bf | f2af26383e4a0a2706f9532a9c431540 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define el '\n'
#define sp ' '
#define fornp(i, x, n) for (int i = x; i < int(n); i++)
#define fornm(i, x, n) for (int i = x; i >= int(n); i--)
#define MAXN (int)(3e5+10)
#define MOD (int)((1e9)+7)
#define oo (int)(2e9)
#define OO (ll)(1e18)
#define clr(container, val) memset(container, val, si... | C++ | c9b322a9138410a82e541179272eb6bf | 7ad47d9d8c4f4907ee37d004351c921b | 1,300 | PASSED |
#include<bits/stdc++.h>
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define F first
#define C continue
#define pb push_back
#define S second
#define R return
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double D;
const int MX=1e6+9;
const ll inf=(1ll<<60);
const l... | C++ | c9b322a9138410a82e541179272eb6bf | 6a19efef56a8422736559ba76b078b0e | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <queue>
#define ll long long
using namespace std;
struct day {
ll k, l, s;
bool operator<(const day &b) const {return s > b.s;}
} a[100005];
int n, f = 0;
ll r = 0;
queue<int>s;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> f;
in... | C++ | c9b322a9138410a82e541179272eb6bf | e77df772f470ae8fc104d28a411ed25e | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
long long v[100005];
int main()
{
long long n,k,i,x,y,s=0;
cin>>n>>k;
for(i=0; i<n; i++)
{
cin>>x>>y;
s+=min(x,y);
v[i]= min (2*x,y)-min(x,y);
}
sort(v,v+n);
for(i=n-k;i<n;i++)
s+=v[i];
cout<... | C++ | c9b322a9138410a82e541179272eb6bf | 1cea524ac6053ceaa0282ef60332de51 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,f;
cin >> n >> f;
unsigned long long outp(0);
vector<pair<long long,int> > v(0);
for(int i=0;i<n;i++)
{
long long k,l;
cin >> k >> l;
if(k>=l) outp+=l;
else
{
v.push_back(m... | C++ | c9b322a9138410a82e541179272eb6bf | 7076f954cb77e74a3915baea849bf29d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
int a[maxn],k[maxn],l[maxn],b[maxn];
int cmp(int a,int b)
{
return a > b;
}
int main()
{
int n,f;
scanf("%d%d",&n,&f);
long long sum = 0;
for(int i = 0;i < n;i++){
scanf("%d%d",&k[i],&l[i]);
a[i] = min(k[i],l[i]);
... | C++ | c9b322a9138410a82e541179272eb6bf | 62185d23e6ba1dadef4abca7894e83f8 | 1,300 | PASSED |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <utility>
#include <iostream>
#include <algorithm>
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define al printf("!");
#define r0 return 0
#define pb push_bac... | C++ | c9b322a9138410a82e541179272eb6bf | d1cdfc13f05f853867cd4c3f83132aae | 1,300 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
bool cmp(int X, int Y)
{
return X > Y; // descending order
}
long long n,f,sells;
int profit[100000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> f;
long long k[n],l[n];
for (int i=0;i<n;++i)
cin >> k[... | C++ | c9b322a9138410a82e541179272eb6bf | bc8f0056d3431763b6bc263f9c32bcd3 | 1,300 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef signed long long sll;
typedef unsigned long long ull;
#define all(s) ((s).begin()),((s).end())
#define rall(s) ((s).rbegin()),((s).rend())
#define Pi 3.141592653589793238462643383279502884197169399375106
const int OO=INT_MAX;
using namespa... | C++ | c9b322a9138410a82e541179272eb6bf | 5046d0c6767955b2048f5629905e1ed1 | 1,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <stack>
#include <vector>
#include <ctime>
#include <cstring>
#include <queue>
#define msc(X) memset(X,-1,sizeof(X))
#define ms(X) memset(X,0,sizeof(X))
typedef long long LL;
using namespace std;
int biao[5040],sz=0;
bool judge(int ... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | 4a4303d554f69836bf8a1098561d443d | 2,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <stack>
#include <vector>
#include <ctime>
#include <cstring>
#include <queue>
#define msc(X) memset(X,-1,sizeof(X))
#define ms(X) memset(X,0,sizeof(X))
typedef long long LL;
using namespace std;
int biao[5040],sz=0;
bool judge(int ... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | 8160f27c8311a4d481fe4ed195b4e893 | 2,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <stack>
#include <vector>
#include <ctime>
#include <cstring>
#include <queue>
#define msc(X) memset(X,-1,sizeof(X))
#define ms(X) memset(X,0,sizeof(X))
typedef long long LL;
using namespace std;
int biao[5040],sz=0;
bool judge(int ... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | 7d22f934d34a28c06041d1b342e20105 | 2,500 | PASSED |
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>
#define F1(x,y,z) for(int x=(y);x... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | 590ad6ddbbf0221f8a747e02f10da2ac | 2,500 | PASSED |
/* */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | f5c30f6815bfef6fa1e14dff0b1113e1 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
#define pb push_back
#define INF 1e8
#define MAX 105
vector<string>v;
pii query(string s){
cout<<s<<endl;
int b,c;
scanf("%d%d",&b,&c);
return make_pair(b,c);
}
int used[10];
void build(int pos,string now)... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | e61b351bab3d0fad0c174534964ea05c | 2,500 | PASSED |
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int x[8],a[8],b[8];
int cnt;
bool _[10000];
bool check(int k)
{
for(int i=1;i<=cnt;i++)
{
int A=0,B=0;
int k1[]={k/1000,(k/100)%10,(k/10)%10,k%10};
int k2[]={x[i]/1000,(x[i]/1... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | f883c1de200fe97696a90fa4210c4ca0 | 2,500 | PASSED |
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int x[8],a[8],b[8];
int cnt;
bool _[10000];
bool check(int k)
{
for(int i=1;i<=cnt;i++)
{
int A=0,B=0;
int k1[]={k/1000,(k/100)%10,(k/10)%10,k%10};
int k2[]={x[i]/1000,(x[i]/1... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | b6b937ec0e669999501c69b402d7de8e | 2,500 | PASSED |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cassert>
using namespace std;
typedef pair<int, int> pii;
pii compare(int target[], int guess[]) {
int x = 0;
for(int i = 0; i < 4; ++i) {
if(target[i] == guess[i]) ++x;
}
int y = 0;
for(int i = 0; i < 4; ++i) {
if(target[i] == guess[i]) con... | C++ | ad56be6638b54bc91e6e9e25f0cfb2d9 | c2e5016744e6cf1987cb402838498b4d | 2,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.