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<vector>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
int n,i,j,mx=0,temp;
cin>>n;
vector<int> arr(100005,0);
for(i=0;i<n;++i)
{
cin>>temp;
for(j=1;j*j<temp;++j)
if(temp%j==0)
{
arr[j]++;
... | C++ | eea7860e6bbbe5f399b9123ebd663e3e | faf01f95ea0c57294d0413b34893b86c | 1,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
using namespace std;
#define MAX 100005
int ans[MAX];
int main()
{
int n, s;
while (cin >> n)
{
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i++)
{
scanf("%d", &s);
int j;
for (j = 1; j*j... | C++ | eea7860e6bbbe5f399b9123ebd663e3e | 451c9fcd259c12ddd99a29d8202de541 | 1,400 | PASSED |
// гаев любитель попугаев
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::cout;
using std::abs;
using std::min;
using std::max;
using std::swap;
using std::map;
using std::pair;
using std::set;
using std... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | df9059778958c9d0dbc7757def399bc2 | 2,000 | PASSED |
//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | fefcb09109e54e13d7080df54242cdbc | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pi pair<ll,ll>
#define fr freopen("in.txt","r",stdin)
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define frep(i,n) for(int i=1;i<=n;i++)
#define ll long long
#define f first
#define s second
int query(int a,int b) {
fflush(stdout);
cout << "? " << ... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | 0c6b0c6f5e4529e8bce9b958cf2b3325 | 2,000 | PASSED |
#include <bits/stdc++.h>
#ifdef LOCAL_TEST
#pragma comment(linker, "/stack:16777216")
#endif
using namespace std;
typedef long long int ll;
typedef vector <ll> vll;
typedef pair<ll, ll> pp;
typedef vector<pp > vpp;
typedef vector <int> vi;
typedef stack <int> si;
typedef stack <ll> sll;
typedef stack < pair<int, ... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | 4f378020fee1ee4a97abdbd5b91be5fe | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef Adrian
#include "debug.h"
#else
#define debug(...) 9999
#endif
typedef long long ll;
typedef long double ld;
//typedef complex<ld> point;
#define F first
#define S second
#define ii pair<ll,ll>
template<typename G1, typename G2 = G1, typename G3 = G1>
struct tripl... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | e2f6f543d5bbac5a2f2fefdbfcf3bd58 | 2,000 | PASSED |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <queue>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <random>
#include <functional... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | f563f377c92e3bd9750ea8c20431fcf7 | 2,000 | PASSED |
// main.cpp
// solve
//
// Created by Ahmed on 11/16/16.
// Copyright © 2016 Abdellah. All rights reserved.
//
#include<set>
#include<map>
#include <unordered_map>
#include <unordered_set>
#include<list>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | 01a466d4aec82322b4850eb38de43df5 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair < int, int > ii;
const int N = 5000 + 5;
int n;
int a[N], b[N], c[N], d[N], p[N];
bool h[N];
bool check() {
// for(int i = 0; i < n; i++)
// printf("%d ", c[i]);
// puts("");
memset(h, 0, sizeof(h));
for(int i = 0; i < n; i++) {... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | dc0f8c4a9092cb5919d59190823381d2 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
ll f(ll i, ll j)
{
cout << "? " << i << ' ' << j << endl;
ll x;
cin >> x;
return x;
}
int main() {
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
ios::sync_with_stdio(0);cin.tie(0);
... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | 2857cdf7454fda0cfe53ef969fee9574 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | C++ | 77b30da2a1df31ae74c07ab2002f0c71 | 9321bf862214682b2eaba0a35017be82 | 2,000 | PASSED |
#include<math.h>
#include<iostream>
#include<stdio.h>
using namespace std;
const long double PI=3.14159265;
const long double md=500;
long double ml;
int n;
long double a[300];
long double V[300][2];
void vectors()
{
if (n>4)
{
float N;
N=n;
ml=(999-md)/N;
int i;
long d... | C++ | 0a0f67927964db70f9508f85afddb326 | 76b6c2b8b02d7960897b098fab376cc5 | 2,300 | PASSED |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAX_N = 100;
const double EPS = 1e-3;
const double PI = acos(-1);
int n;
struct Point{
double x, y;
};
double ang, Cos, Sin;
Point data[MAX_N + 10];
inline void rotate... | C++ | 0a0f67927964db70f9508f85afddb326 | caa09d3dfcf95acacaef7aca6c2cd818 | 2,300 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define fr(i,a,b) for(int i=a; i < b; i++)
const double eps = 1e-7;
const double pi = acos(-1.0);
struct P{
double x,y;
P(){}
P(double X, double Y){x = X, y = Y; }
P operator +(P a){re... | C++ | 0a0f67927964db70f9508f85afddb326 | e8808bf9dbd426a147efbd0dcb0c969d | 2,300 | PASSED |
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <deque>
#include <bitset>... | C++ | 0a0f67927964db70f9508f85afddb326 | ca2ca9e6fd10bceb73201cd3ee17d16c | 2,300 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 0a0f67927964db70f9508f85afddb326 | 233798562c8f12a6a694bc7af0958be4 | 2,300 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define _Poi const Poi&
#define _Vec const Vec&
using namespace std;
const double eps=0.01;
struct Poi {
double x,y;
Poi() {}
Poi(double x,double y):x(x),y(y) {}
Poi operator + (_Poi rhs) const {
return Poi(x+rhs.x,y+rhs.y);
}
Poi operator... | C++ | 0a0f67927964db70f9508f85afddb326 | e545f65ca935f100ca443dfb0ba005e3 | 2,300 | PASSED |
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n<5)
return puts("No solution"),0;
double arg=0,t=M_PI*2/n,L=100,X=-L,Y=0;
for(int i=1;i<n;i++)
{
X+=cos(arg)*L,Y+=sin(arg)*L;
arg+=t;
printf("%lf %lf\n",X,Y);
L+=0.002;
}
printf("%lf 0\n",X-Y/tan(arg));
} | C++ | 0a0f67927964db70f9508f85afddb326 | cf5d890cb2bf277035932a114e00c71c | 2,300 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>
#include<math.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define J (")
#define N 105
const double pi=4*atan(1),eps=1e-4;
struct point{
static const double eps=1e-10;
double x,y;
point(double _x=0,double _y=0):x(_x),y(_y){}
... | C++ | 0a0f67927964db70f9508f85afddb326 | 7114a769e4799bf1929db3994cc88c0d | 2,300 | PASSED |
/*
* Problem:
* Author: Leo Yu
* Time:
* State: SOLVED
* Memo:
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
inline int r... | C++ | 0a0f67927964db70f9508f85afddb326 | 746d69b0980e4f0fa1af596423fe2d59 | 2,300 | PASSED |
// _temp.cpp : Defines the entry point for the console application.
//
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <vector>
#include <complex>
#define PI 3.1415926535897932384626433832795
using namespace std;
typedef long long ll;
typedef complex<double> c... | C++ | 0a0f67927964db70f9508f85afddb326 | 16c74549748c536f83fc7f350b042e1a | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pqq priority_queue
#define itt ::iterator
#pragma GCC optimize(2)
void setIO(string y)
{
if(y == "")
return ;
#ifndef ybw
freopen((y + ".in").c_str(), "r", stdin);
freopen((y + ".out").c_str(), "w", stdout);
#endif
}
#ifndef u... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | e7fae9e3d426f3417cbc6418730bc670 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
int a=0;
int b=0;
int c=0;
cin >> s;
if(s.size()==1){
cout << s[0];
return 0;
}
if(s.size()==2) {
cout << s[0];
return 0;
}
if(s.size()==3) {
... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | aeaad5564b588c0ffe564ba77a2e5ae9 | 1,900 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma optimize("O3")
#define ll long long
using namespace std;
ll N=998244353 ,M=31;
ll i,j,l,r,n,m,t,k,f,ma=0,y3,mi=2e9,y,x,z,x2,y2,a[1100000],l2,r2,l3,r3,t2,d[1000][1000],dp[10000],b[10000],b2[100000],br[100000],bl[100000];
ll ans;
vector<char>v,v2;
deque<... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | b40ec5bacbc76c1ee91e1a23b459f06e | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007ll
#define endl "\n"
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
ll i=0,j=s.length()-1;
string left="";
while(j-i>=3)
{
if(s[i]==s[j])
{
... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 86fbeffb3a2d7d34a2943276fb2e863a | 1,900 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll ll int ,ll ll int >
#define vi vector<ll ll int >
#define all(a)... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | a17a4dccac04dd9a82d031b382c082be | 1,900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define Ok puts("OK");
using namespace std;
const int N = (int)1e6 + 7;
string s, t;
int n;
main() {
cin >> s;
n = s.size();
int l, r;
l = 0;
r = n - 1;
while (l + 3 <= r) {
if (s[l] == s[r] || s[l] == s[r - 1]) {
t.push_back(s[l]);
} else... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 6724813a63501b8f6ca811dd2acf1bd0 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define mid(l, r) ((l)+(r))/2
#define len(a) (a).length()
#define sz(a) (a).size()
#define xx first
#define yy second
#define inf int(2e9)
#define ff(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i, a, b) for(int (i) = (a); (i) >= (b); --(... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 89dd5884cbe805c1ba672f82766b9065 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(args...)
#define DBG(x...)
#endif
typedef long long ll; typedef long double ld;
#define fi first
#define se second
#define sz(x) ((int)((x).size()))
#define REP(i,a) for(int i=0;i<(a);i++)
#define MOD 100... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 8ad57e72df1416f2cbc7a6ed541010a1 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define y1 A2Dalek
#define y0 Cyberman
#define yn RoseTyler
#define j1 JackHarkness
#define fs first
#define sd second
const int N=1e6;
const int oo=1e9+5;
int du[]={-1,0,0,1};
int dv[]={0,-1,1,0};
const long long mod=1e9+7;
typedef pair<int,int> ii;
typedef pair<int,ii> iii... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 682eab62ec19db6cbd53d65afd1d2246 | 1,900 | PASSED |
#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt","r",stdin));
TEST(freopen("output.txt","w",stdout));
TES... | C++ | 3bebb50d1c2ef9f80e78715614f039d7 | 3e15aca8b1a96dacb87180fd5cfc14fd | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int T;
scanf("%d",&T);
while(T--){
ll a,b,q;
scanf("%lld%lld%lld",&a,&b,&q);
ll maxx = max(a,b);
ll p = a * b / __gcd(a,b);
while(q--){
ll l,r;
scanf("%lld%lld",&l,... | C++ | a1effd6a0f6392f46f6aa487158fef7d | 35237c1b02c38eae0678bda352dced85 | 1,600 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define ll long long
#define inf 1e30
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int N=2e5+50;
const ll mod=998244353;
inline ll read()
{
ll X=0; bool flag=1; char ch=getchar();
while(ch<'0'||ch>... | C++ | a1effd6a0f6392f46f6aa487158fef7d | fe4e1a4b2724aa969256e5abc780f12c | 1,600 | PASSED |
#include<stdlib.h>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
int lcm(int a,int b){
for(int i=b;1;i++){
if(i%a==0&&i%b==0) return i;
}
}
int main(){
int t;
scanf("%d",&t);
while(t--){
int a,b,q;
scanf("%d%d%d",&a,&b,&q);
if(a>b) swap(a,b);
long lon... | C++ | a1effd6a0f6392f46f6aa487158fef7d | 6c55db0a4c569c2d992dcc24ae63f836 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define mem0(s) memset(s,0,sizeof(s))
#define meminf(s) memset(s,0x3f,sizeof(s))
#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_typ... | C++ | a1effd6a0f6392f46f6aa487158fef7d | 6eb0934b459f6e3258c10881ad981c18 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define mem0(s) memset(s,0,sizeof(s))
#define meminf(s) memset(s,0x3f,sizeof(s))
#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_typ... | C++ | a1effd6a0f6392f46f6aa487158fef7d | ba5a3579a4b61ff4a66d7a920d85e3a5 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define mem0(s) memset(s,0,sizeof(s))
#define meminf(s) memset(s,0x3f,sizeof(s))
#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_typ... | C++ | a1effd6a0f6392f46f6aa487158fef7d | 783b55ba0913c1223c805d983383fa05 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define mem0(s) memset(s,0,sizeof(s))
#define meminf(s) memset(s,0x3f,sizeof(s))
#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_typ... | C++ | a1effd6a0f6392f46f6aa487158fef7d | e928e68b810e5b23e2e8676dce88041f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%d",&a)
#define pf(a) printf("%d",a)
#define ford(i,n) for(i=1;i<=n;i++)
#define for0(i,n) for(i=0;i<n;i++)
#define mst(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef double db;
#define pb push_back
#define ddd cout<<"ddd"<<endl
#define maxn 50... | C++ | a1effd6a0f6392f46f6aa487158fef7d | ef3d59fdc16417edbbf3c9aaabba6ed6 | 1,600 | PASSED |
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#inclu... | C++ | a1effd6a0f6392f46f6aa487158fef7d | 62c450bf41921cb6deffbba8dac3c238 | 1,600 | PASSED |
//
// main.cpp
// Problem Code
//
// Created by Algo张伯威 on 2020/4/24.
// Copyright © 2020 Algo张伯威. All rights reserved.
//
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <cstdlib>
#include <vector>
#include <iostream>
using namespace std;
char s[110];
int gcd(i... | C++ | a1effd6a0f6392f46f6aa487158fef7d | d590bd8a32f9156bf5bcc6ef13c4c75a | 1,600 | PASSED |
import java.util.*;
import java.math.*;
import java.text.*;
import java.io.*;
public class Main{
public static void main(String[] args){
Scanner cin=new Scanner(System.in);
int n,a,b;
String s;
int ans=0;
n=cin.nextInt();
a=cin.nextInt();
b=cin.nextInt();
s=cin.next();
//System.out.println(s);
i... | Java | 6208dbdf9567b759b0026db4af4545a9 | 2780da9517b3c156147f1967ae040557 | 1,300 | PASSED |
import java.util.*;
public class Solution{
static int solve(char[] arr, int A, int B) {
int abCount = 0;
if (A <= 0 && B <= 0) return 0;
if (arr[0] != '*') {
arr[0] = A > B ? 'a' : 'b';
if (A > B) A--;
else B--;
abCount++;
}
for (int i = 1; i < arr.length; i++) {
if ... | Java | 6208dbdf9567b759b0026db4af4545a9 | 613dfaa91c6d2b0054704d25e309f200 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;
public class Problem2 {
private static final char EMPTY = '.';
private static final char NOT_EMPTY = '*';
public static void main(... | Java | 6208dbdf9567b759b0026db4af4545a9 | 6662c60954ac9756f226b278b953a3ed | 1,300 | PASSED |
import java.io.PrintWriter;
import java.util.Scanner;
public class cf962b2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int seats = sc.nextInt();
int a = sc.nextInt();
int b =sc.nextInt();
sc.nextLine();
char[] a... | Java | 6208dbdf9567b759b0026db4af4545a9 | c4463e876d33e32f0a8a7f755df3978b | 1,300 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Puneet //FastRead class is ... | Java | 6208dbdf9567b759b0026db4af4545a9 | f8bcbaab11833a24324c6ea01174a62e | 1,300 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | Java | 6208dbdf9567b759b0026db4af4545a9 | 83c784c1278c6abf3aa4a4cfa0cfb102 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] temp = in.readLine().split(" ");
int n = I... | Java | 6208dbdf9567b759b0026db4af4545a9 | 34f73a2bbc7be9b7bddc2a932904c256 | 1,300 | PASSED |
import java.util.Scanner;
public class bProblem {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int a = scan.nextInt();
int b = scan.nextInt();
char[] arr = scan.next().toCharArray();
for(int i = 0;i<n;i++){
if(arr[i] == '*'){
continue;
... | Java | 6208dbdf9567b759b0026db4af4545a9 | 144403c903e6930e7db96af672d5dca2 | 1,300 | PASSED |
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int a = in.nextInt();
int b = in.nextInt();
String s = in.next();
int count = 0;
for (int i = 0; i < s.length()... | Java | 6208dbdf9567b759b0026db4af4545a9 | 3bec0de828931453406c7558f30eaa0f | 1,300 | PASSED |
import java.io.*;
import java.util.stream.Stream;
/**
* @author madi.sagimbekov
*/
public class C962B {
private static BufferedReader in;
private static BufferedWriter out;
public static void main(String[] args) throws IOException {
open();
int[] x = readInts();
int n = x[0];
... | Java | 6208dbdf9567b759b0026db4af4545a9 | 5bad53688dd7e2c51ca0c34bb4d2d6f7 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10,M=2e5+10;
int T,a,b;
int main(){
cin>>T;
while(T--){
cin>>a>>b;
if(a==0){
cout<<"0"<<' '<<b<<endl;
continue;
}
if(b==0){
cout<<a<<' '<<"0"<<endl;
continue;
}
if(a==0&&b==0){
cout<<"0 0"<<endl;
continue;
}
if(a==b){
c... | C++ | 09625e65e62fc1c618d12969932508de | 010bffca73c696f568e8e0cffc9945eb | null | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << '=' << x << endl
#define deb2(x, y) cout << #x << '=' << x << ',' << #y << ... | C++ | 09625e65e62fc1c618d12969932508de | 24107edf9c0e01af3d30fb4e93493edd | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 50;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
int a,b;
scanf("%d%d",&a,&b);
if (a > b) printf("%d %d\n",a - b + b - 1,b);
else if (a == b) printf("%d %d\n",a - 1,a);
else printf("%d %d\n",a - 1,b);
}
... | C++ | 09625e65e62fc1c618d12969932508de | bf7abc1bee9471bd543c88c8f1cb103c | null | PASSED |
#include<iostream>
using namespace std;
int main()
{
int tc;
cin>>tc;
while(tc--)
{
int x,y;
cin>>x>>y;
cout<<x-1<<" "<<y;
cout<<endl;
}
return 0;
} | C++ | 09625e65e62fc1c618d12969932508de | 09e4163d414164b1d383c3928e56f581 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll t,j,i,ans,co,cond;
cin>>t;
while(t--)
{
ll x,y;cin>>x>>y;
x--;
cout<<x<<" "<<y<<endl;
}
}
| C++ | 09625e65e62fc1c618d12969932508de | 8897c6fa20fa24be35578c97cf2bf241 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t;
ll x,y;
void solve(){
cin >> x >> y;
cout << x - 1 << " " << y << endl;
}
int main(){
cin >> t;
while(t--){
solve();
}
}
| C++ | 09625e65e62fc1c618d12969932508de | 1973813d9a6b91c1ccee83865f606be5 | null | PASSED |
// auto hey = []() {std::ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);return 0;}();
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define N 10007
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
c... | C++ | 09625e65e62fc1c618d12969932508de | e133743601d87f090e173adbbfea311b | null | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int x, y; cin>>x>>y;
if (x == y) cout<<x-1<<" "<<y;
else if (x > y) cout<<x-1<<" "<<y;
//else if (y > x && x == 1) cout<<0<<" "<<y;
else if (y > x) cout<<x-1<<" "<<y;
cout<<"\n";
}
int main(){
//freopen("C.inp","r",stdin);
i... | C++ | 09625e65e62fc1c618d12969932508de | 9a9221e8534bf27d0203885b75ba27a6 | null | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define si set < int >
#define vi vector < int >
#define pii pair < int, int >
#define mii map < int, int >
#define p_q priority_queue
#define INF ((1 << 30) - 1)
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#defi... | C++ | 09625e65e62fc1c618d12969932508de | 36be7fd8c9635f955d0c1e02b0ed86c0 | null | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t; cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
cout << a - 1 << " " << b << endl;
}
return 0;
}
| C++ | 09625e65e62fc1c618d12969932508de | e6fdba35f9c8cfb1acc0bc34b5ccd167 | null | PASSED |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class MainS {
static final long MOD = 1_000_000_007, INF = 1_000_000_000_000_000_000L;
static final int INf = 1_000_000_000;
static FastReader reader;
static PrintWriter writer;
public static void main(String[] args) {
... | Java | 3967727db1225c4b6072d9f18e0dce00 | fb439663f00cd01b7fc2f512773dc247 | 1,900 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | Java | 3967727db1225c4b6072d9f18e0dce00 | 02c9932aed2841a3176e0752e546757a | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
public static boolean check(long numdays, long d1, long d2, char[] Arr) {
long n=nu... | Java | 3967727db1225c4b6072d9f18e0dce00 | 9700ef76152ad4addd96a7de29c66665 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
static class pair {
long acc1;
long acc2;
public pair(long d1, long d2) {
t... | Java | 3967727db1225c4b6072d9f18e0dce00 | 1662aa6aeeb5c1e2ff914254c6e960dc | 1,900 | PASSED |
import java.util.*;
public class C1117 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long xo = in.nextInt();
long yo = in.nextInt();
long xf = in.nextInt();
long yf = in.nextInt();
int l = in.nextInt();
int[] dx = new int[l];
int[] dy = new int[l];
int sx = 0;
int... | Java | 3967727db1225c4b6072d9f18e0dce00 | e7f9e0d227cdcee198655a2c48b952b1 | 1,900 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author real
*/
public class Main ... | Java | 3967727db1225c4b6072d9f18e0dce00 | d19cfb1c3fc4fa53403b431c30b56fbe | 1,900 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper p... | Java | 3967727db1225c4b6072d9f18e0dce00 | 637168252539c6e22b0f80e3db9be920 | 1,900 | PASSED |
import java.util.*;
import java.io.*;
import java.util.regex.*;
public class Codeforces{
static class MyScanner{
BufferedReader br;
StringTokenizer st;
MyScanner(FileReader fileReader){
br = new BufferedReader(fileReader);
}
MyScanner(){
br = new BufferedReader(new InputStreamReader(System.in)... | Java | 3967727db1225c4b6072d9f18e0dce00 | fb427fa56d88b44293c813f22d131c12 | 1,900 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.Objects;
import java.nio.charset.Charset;
import java.util.... | Java | 3967727db1225c4b6072d9f18e0dce00 | f3b754d9c49e1498668095d012dda24d | 1,900 | PASSED |
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.TreeSet;
public class E60C {
public static void main(String[] args) {
JS scan = new JS();
TreeSet<Long> worked = new TreeSet<>();
long x1 = s... | Java | 3967727db1225c4b6072d9f18e0dce00 | da56cf96208ae1e342b8ce8cff3279a4 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
bool cmp (pll a, pll b)
{ return a.f + a.s < b.f + b.s; }
ll d[70000], mx[70000];
int main ()
{
ios_base::sync_with_stdio(false);
ll ... | C++ | 606168377dadebd41c01c2e5110cca46 | 57055bf8984b96bea2a3f4e4899c621d | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, r;
cin >> n >> r;
vector<pair<int, int>> P, N;
int a, b;
for (int i = 0; i < n; i+... | C++ | 606168377dadebd41c01c2e5110cca46 | 84987ab2ef1a2f55c242d5002dfa333e | 2,300 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) v... | C++ | 606168377dadebd41c01c2e5110cca46 | 46314e697b7cf0c6d2d09ec151bf7023 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define fr first
#define sc second
#define ii pair<int,int>
#define mp make_pair
using namespace std;
int n,r;
bool com(ii A , ii B)
{
if(A.sc+A.fr > B.sc+B.fr)
return 1;
return 0;
}
ii a[305];
ii b[304];
int m;
int memo[105][30005];
int solve(int i , int re... | C++ | 606168377dadebd41c01c2e5110cca46 | ac014d8219f9dcb273182f74690a4b24 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define mk make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MAXN = 105;
const int MAXM = 1e4 + 5;
const int MOD = 998244353;
const LL INF = 1e18;
int dp[105][60005];
struct Node{
int a, b;
}p[MAXN];
bool cmp(cons... | C++ | 606168377dadebd41c01c2e5110cca46 | 7a8ccf322c27ff39d608d3c239fff113 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define mk make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MAXN = 105;
const int MAXM = 1e4 + 5;
const int MOD = 998244353;
const LL INF = 1e18;
int dp[105][60000];
struct Node{
int a, b;
}p[MAXN];
bool cmp(cons... | C++ | 606168377dadebd41c01c2e5110cca46 | daa38c7bf1dbdbf46825626393b56fcd | 2,300 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#define FASTIO std::ios::sync_with_stdio(false);
using namespace std;
#define lli long long int
#define S second
#define F first
#define PB push_back
#define make_pair MP
#define endl '\n'
#define all(v) sort(v.begin(), v.end())
#define allr(v) sort(v.rbegin(), v.rend())
in... | C++ | 606168377dadebd41c01c2e5110cca46 | c6f6e0e9a47f273a32ad1dc715ecbd9e | 2,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define F first
#define S second
#define mp make_pair
#define PII pair<int,int>
#define PLL pair<long long,long long>
#define M map
#define UM unordered_map
#define graph unordered_map<... | C++ | 606168377dadebd41c01c2e5110cca46 | f32a077b961e6cf9d3828c8ccea01d65 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define F first
#define S second
#define mp make_pair
#define PII pair<ll,ll>
#define PLL pair<long long,long long>
#define M map
#define UM unordered_map
#define graph unordered_map<in... | C++ | 606168377dadebd41c01c2e5110cca46 | af2de972ffdc7c0808f50aa622d4368d | 2,300 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | C++ | 606168377dadebd41c01c2e5110cca46 | a90cb00fd67a78c5bc6fa106a160919b | 2,300 | PASSED |
#include <bits/stdc++.h>
#define pb(a) push_back(a)
#define ll long long int
#define scd(a) scanf("%d",&a)
#define mp(a,b) make_pair(a,b)
#define scl(w) scanf("%I64d",&w)
#define scdd(a,b) scanf("%d %d",&a,&b)
#define srt(a) sort(a.begin(),a.end())
#define... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | e10c7ad5afc43a3922a0b4383a24193a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long int a[1003];
int main()
{
long long int N, A, B, C, T, mx, sum, tp;
int i;
scanf("%I64d %I64d %I64d %I64d %I64d", &N, &A, &B, &C, &T);
mx = 0;
for (i = 0; i < N; i++) {
scanf("%I64d", &a[i]);
if (a[i] > mx) {
mx = ... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | 24dd04f9acd5996d48d29ceefd8b0e00 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long int a[1003];
int main()
{
long long int N, A, B, C, T, mx, sum;
int i;
scanf("%I64d %I64d %I64d %I64d %I64d", &N, &A, &B, &C, &T);
mx = 0;
for (i = 0; i < N; i++) {
scanf("%I64d", &a[i]);
if (a[i] > mx) {
mx = a[i]... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | fc7b9e46ebc6c357dc8e11ca79fd4d58 | 1,300 | PASSED |
/*siddharth goyal*/
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define MOD 1000000007
#define REP(i,n) for(i=1;i<=n;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define vl vector<LL>
#define itr ::iterator it
#define lb lower_bound
#d... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | a7fe7ebd4a0ed38488818962a9e5fd80 | 1,300 | PASSED |
/*siddharth goyal*/
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define MOD 1000000007
#define REP(i,n) for(i=1;i<=n;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define vl vector<LL>
#define itr ::iterator it
#define lb lower_bound
#d... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | db0332c00db5281780b40d3d637cd5ec | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll max(ll a,ll b) {
return (a>b)?a:b;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//code here;
ll n,a,b,c,t; cin>>n>>a>>b>>c>>t;
map<ll,ll> mp;
map<ll,ll> :: iterator it;
ll x;
for(ll i=0;i<n;i++) {... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | f2ee6b248c60a9b72a13c45f34a2beda | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORR(i,a,b) for(int i=a-1;i>=b;i--)
#define pb(a) push_back(a)
typedef long long ll;
int ar[1005];
int f[1005];
int main(){
int n,a,b,c,t;
cin>>n>>a>>b>>c>>t;
FOR(i,0,t+1) f[i]=0;
FOR(i,0,n){
cin>>ar[i];
f[ar[i]]++;
... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | 6fb2038d09a8c65ab719e7905db9773d | 1,300 | PASSED |
#include <bits/stdc++.h>
#define LL long long
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
const int maxn = 1000 + 5;
LL cnt[maxn];
int main()
{
mem(cnt , 0);
LL n , A , B , C , T , ti;
scanf("%lld %lld %lld %lld %lld" , &n , &A , &B , &C , &T);
for(int i = 1 ; i <= n ;i++){
scanf("%lld" , &ti);
... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | 455d7169381e847c2287da74924f1722 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n,a,b,c,t,temp,i,sum_time=0,ans1,ans2,cnt=0,m=0;
cin >> n >> a >> b >> c >> t;
ans1 = n*a;
long long int time[t+1]={0},freq[t+1]={0};
for(i=0;i<n;i++)
{
... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | 495ed983259b7967f397aeacaa9c4e72 | 1,300 | PASSED |
/*---- enazuma11------- */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define inc(a,n) sort(a,a+n)
#define dec(a,n) sort(a,a+n,greater<int>() )
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,A,b,c... | C++ | 281b95c3686c94ae1c1e4e2a18b7fcc4 | d69a2a11c121cfa51b5775d445be30d7 | 1,300 | PASSED |
#include<stdio.h>
#include<vector>
using namespace std;
int str[1005],arr[1005],ans[1005];
int sum[1005];
vector<int>pos;
int main()
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
scanf("%d",&str[i]);
}
for(int i=1; i<=n; i++)
scanf("%d",&arr[i]);
int count=0;
for(int... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | fee7279c2d7d2733187f5db82ffc6a7d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[1500];
int b[1500];
bool pr[1500];
bool pr2[1500];
pair<int, int> c[2];
int main()
{
int n; scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", a + i);
for (int i = 0; i < n; i++) scanf("%d", b + i);
int sch = 0;
for (int i = 0; i < n; i++)... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | 9174f30bdd0925308d7f616f7b87eccf | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("test.in", "r", stdin);
#endif
cin.sync_with_stdio(false);
int n;
cin >> n;
int a[n], b[n];
for(int i = 0 ;i < n; i ++)
cin >> a[i];
for(int i = 0 ;i < n; i ++)
cin >> b[i];
vector <int> ans1(n, 0);
vector <in... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | 0046136ac389425732081057141b3b06 | 1,300 | PASSED |
/*
* FILE: B.cpp
*
* @author: Md. Arafat Hasan Jenin <arafathasanjenin[at]gmail[dot]com>
*
* LINK:
*
* DATE CREATED: 08-06-17 02:14:35 (+06)
* LAST MODIFIED: 08-06-17 04:20:20 (+06)
*
* DESCRIPTION:
*
* DEVELOPMENT HISTORY:
* Date Version Description
* -----------------------------------------... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | 6e38d593dfc06c9d55e0beb507b27262 | 1,300 | PASSED |
/*
* FILE: B.cpp
*
* @author: Md. Arafat Hasan Jenin <arafathasanjenin[at]gmail[dot]com>
*
* LINK:
*
* DATE CREATED: 08-06-17 02:14:35 (+06)
* LAST MODIFIED: 08-06-17 04:18:03 (+06)
*
* DESCRIPTION:
*
* DEVELOPMENT HISTORY:
* Date Version Description
* -----------------------------------------... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | c9bf6352ed6d30c8bbe224357c54dad9 | 1,300 | PASSED |
#include <bits/stdc++.h>
typedef long long ll ;
using namespace std;
int n;
int a[10005] , b[10005] , res[10005];
bool used[10005];
vector < int > v[1010];
bool check()
{
int cnt = 0 ;
for(int i = 1 ; i <= n ; i++){
cnt += a[i] == b[i] ;
}
return cnt == n - 1 ;
}
int main()
{
cin >... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | 72572c0a6313f19cc3b6a7b12a0ec60f | 1,300 | PASSED |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | 28bc8472acb0751dcc91c0ce02c21be2 | 1,300 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
#define MOD 10000000076
#define PI 3.1415926535897932384626433832795
using namespace std;
int aa[1003];
int main()
{
ios::sync_with_stdio(false), cin.tie(0);
// freopen("A-small-practice.in", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin>>n;
int a[n],b... | C++ | 6fc3da19da8d9ab024cdd5acfc4f4164 | f7bf5cd1674cfab2cfddafea5ac2ba2f | 1,300 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.