code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 20,322,029 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | #include <iostream>
using namespace std;
int main()
{
int A , B,C ;
cin >> A >> B >> C ;
if ((A>=1 && A<=500) && (B>=1 && B <= 500)) {
if (C>=1 && C<=1000){
if (C<=(A+B)) {
cout << "Yes" << endl ;
}
else
cout << "No"... | 0 | 19,803,382 |
#include <bits/stdc++.h>
#define REP(i,n) for (long i=0;i<(n);i++)
#define FOR(i,a,b) for (long i=(a);i<(b);i++)
#define RREP(i,n) for(long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define du... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n,u,k,v;
int g[101][101]={};
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&u,&k);
for(int i=0;i<k;i++){
scanf("%d",&v);
g[u][v]=1;
}
}
for(int i=1;i<n+1;i++){
printf("%d",g[i][1]);
for(int j=2;j... | 0 | 5,107,673 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int main() {
int n; cin >> n;
int adj[n][n] = {};
for (int i = 0; i < n; i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k; j++) {
int v; cin >> v;
adj[u-1][v-1] = 1;
}
}
int d[n];
fill(... | #include<bits/stdc++.h>
using namespace std;
const int limit = 200050;
int main(){
int n;
cin >> n;
int a[limit];
for(int i = 0; i < n; i++){
cin >> a[i];
a[i] = a[i] - i - 1;
}
sort(a, a + n);
int b = (n % 2 == 0) ? a[n / 2 - 1] : a[(n + 1) / 2 - 1];
long long f = 0;
... | 0 | 44,660,123 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
if((b-a)%2) cout<<"Borys";
else cout<<"Alice";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 36,222,763 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 92,553,406 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
using ll = long long int;
int main() {
int n; cin>>n;
vector<ll> v(n);
rep(i,n){
cin>>v[i];
}
sort(v.begin(),v.end() );
rep(i,n-1){
v[i+1]+= v[i];
}
int c=1;
rep(i,n-1){
if(v[n-1-i]<=3*v[n-2-i]){... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A,B,C;
bool check[105];
for(int i = 0; i < 105; i++){
check[i] = false;
}
scanf... | 0 | 9,496,518 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
string s[N];
rep(i, N) cin >> s[i];
int M;
cin >> M;
string t[M];
rep(i, M) cin >> t[i];
map<string, int> m;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | 0 | 83,694,067 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
rep(i, n - 1)
{
ans... | #pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | 0 | 52,167,866 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
ll S; cin >> S;
ll x2=E9, y2=1,x3,y3;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 89,637,567 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
using namespace std;
using ll = long long;
const ll M = 1e9+7;
ll mpow(ll x,ll y){
ll ans = 1;
while(y != 0){
if(y&1){
ans = ans * x % M;
}
x = x * x % M;
y = y >> 1;
}
return ans % M;
}
ll comb(... | 0 | 10,783,596 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <cstdio>
#include <iostream>
using namespace std;
int dfs(int depth, int cur, int accm, int n, int s)
{
if (depth > n)
return 0;
if (depth == n && accm == s)
return 1;
if (accm > s)
return 0;
else {
int count = 0;
for (int i = cur + 1; i < 10; i++) {
count += dfs(depth+1, i, a... | 0 | 24,487,337 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
... | #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > ... | 0 | 89,987,393 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n,k;
cin >> n >> k;
vector<pair<ll,ll>> vec;
rep(i,n){
ll x,y;
cin >> x >> y;
vec.push_back(make_pair(x,y));
}
sort(vec.begin(),vec.end());
ll now=0;
rep(i... | #include <iostream>
#include <queue>
#define MAX 1005
#define INF 100000000
using namespace std;
typedef struct{
int x;
int y;
int state;
} Mouse;
int H,W,N;
int start_x,start_y;
char ar[MAX][MAX];
int offset_x[4] = {1,0,-1,0};
int offset_y[4] = {0,1,0,-1};
int ans[MAX][MAX];
void init(){
for(int i = 0;... | 0 | 29,121,551 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll a,b;
cin>>a>>b;
if(a==b) {
for(ll i=0;i<a;i++) {
cout<<a;
}
cout<<endl;
}
else if(a<b) {
for(ll i=0;i<b;i++) {
cout<<a;
}
cout<<endl;
}
else {
for(ll i=0;i<a;i++) {
cout<<b;
}
co... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int f[202100],sum[70707070];
char a[202002];
int main()
{
int n,tmp,i,j;
scanf("%s",a+1);
n=strlen(a+1);
tmp=0;
sum[0]=1;
for(i=1;i<=n;i++)
{
tmp=tmp^(1<<(a[i]-'a'));
if(sum[tmp]!=0)
f[i]=sum[tm... | 0 | 31,576,555 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define watch(x) cout << "["<<(#x) << " is " << (x) << "]" << endl
void watchVecI(vector<int>a){
for(int i = 0; i < a.size(); ++i){
cout << a[i] << " ";
}
cout << endl;
}
void watchVecS(vector<string>a){
for(int i = 0; i < a.size(); ++i){... | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (long long)x.size()
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
const ld pi = 3.141592653;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll INF = __LONG_LONG_MAX__;
using ... | 0 | 47,547,080 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
ll int n;
cin... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 88,398,769 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pai pair<int,int>
#define vi vector<long long int>
#define vb vector<bool>
#define vm vector<vector<int> >
#define vd vector<double>
#define vs vector<string>
#define vp vector< pair <string,int> >
#de... | 0 | 65,468,711 |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | 0 | 32,727,563 |
#include <iostream>
using namespace std;
int main()
{
string n;
int sum;
cin >> n;
for (char c : n) {
sum += int(c) - 48;
}
if (sum % 9 == 0) {
cout << "Yes";
}
else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
struct UnionFindTree {
vector<int> size, parents;
UnionFindTree() {}
UnionFindTree(int n) {
size.resize(n, 0);
parents.resize(n, 0);
for (int i = 0; i < n; i++) { makeTree(i); }
}
void makeTree(int x) {
parents[x] = x;
... | 0 | 45,669,751 |
#include <iostream>
#include <stdlib.h>
int main(void) {
int a,b,c;
std::cin >> a >> b >> c;
if (a < b && b < c){
std::cout << "Yes" << '\n';
} else {
std::cout << "No" << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF =... | 0 | 58,056,426 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , K;
cin >> N >> K;
int A=0 , B=0;
vector<int> l(N);
for(int i=0;i<N;i++){
cin >> l[i];
}
sort(l.begin() , l.end());
reverse(l.begin() , l.end());
int ans = 0;
for(int i=0;i<K;i++ ){
ans += l[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define ... | 0 | 57,040,088 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
set<string> x;
x.insert(s);
int l;
string a, b;
for(int i=0; i<n-1; i++) {
cin >> a;
if(i==0) {
if(s[s.size()-1] != a[0]) {
cout << "No" << endl;
... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll T[N],A[N];
for (int i = 0; i < N; i++) {
cin >> T[i];
}
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
... | 0 | 91,926,514 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
deque<int> ans;
int p = n % 2;
rep(i,n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
string maxs(string S, string T){
if(S.length() > T.length()){
retur... | 0 | 25,792,686 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int i,j,_;
for(scanf("%d",&_);_--;){
ll a,b;
cin>>a>>b;
if(a>b)swap(a,b);
ll s=a*b;
ll c=(ll)sqrt(s);
ll ans;
if(c*c==s){
ans=(c-1)*2;
if(a<c)--ans;
}else{
ans=c*2;
if(c*(c+1)>=s)--ans;
if(a<=c)--ans;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<double> VL;
typedef vector<string> VS;
typedef vector<PLL> VP;
typedef vector<ll> VLL;
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rep... | 0 | 761,657 |
#include <stdio.h>
void hairetu_zero(int bill[][10]);
void tenant(int b[][10], int f, int r, int v);
void output(int b[][10]);
int main(void)
{
int n;
int b;
int f;
int r;
int v;
int b1[3][10];
int b2[3][10];
int b3[3][10];
int b4[3][10]; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,K;
cin >> N >> K;
K = min(100,K);
vector<int> A(N+1);
rep(i,N)cin >> A[i+1];
for(int i=0;i<K;i++){
vector<ll> ... | 0 | 74,639,259 |
#include<bits/stdc++.h>
using namespace std;
#define MK make_pair
int main(){
while(1){
int n;
cin>>n;
if(n==0){break;}
int t[1000000]={};
for(int i=0;i<n;i++){
int h,m,s;
char c;
cin>>h>>c>>m>>c>>s;
int a=h*60*60+m*60+s;
t[a]++;
cin>>h>>c>>m>>c>>s;
a=h*60*60+m*60+s;
t[a]--;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef long ... | 0 | 60,606,987 |
#include<bits/stdc++.h>
using namespace std;
main(){
long long i,j,k,l,m,n,p;
while(cin>>p>>n>>m){
if(m-n<=0)cout<<"delicious"<<endl;
else if(m-n<=p)cout<<"safe"<<endl;
else cout<<"dangerous"<<endl;
} return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
#define int long long
int next_combination(int bit) {
int x = bit & -bit, y = bit + x;
return (((bit & ~y) / x) >> 1) | y;
}
signed main(){
int n, k;
cin >> n >... | 0 | 58,006,770 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0;
for (int i = 1; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
int a = 10001 * i + 1010 * j + 100 * k;
if (A <= a && a <= B) {
count += 1;
... | 0 | 95,976,239 |
#include<iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#define debug(a) cout << "*" << a << "*" << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> node;
typedef pair<node, int> P;
int n, m, mp[105][105];
const int ... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp... | 0 | 15,719,974 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a... | 0 | 78,403,800 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
unordered_set<int> A;
for(char c:S)
A.insert(c);
for(char c='a';(int)c<='z';c=(char)((int)c+1))
if(!A.count(c)){
cout<<c<<endl;
return 0;
}
cout<<"None"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const unsigned long long LINF = 1e19;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N... | 0 | 278,675 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[101][101]={};
int n,u,k,v;
cin>>n;
for(int i=0;i<n;i++){
cin>>u>>k;
for(int j=0;j<k;j++){
cin>>v;
a[u][v]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++)
cout<<a[i+1][j+1]<<' ';
cout<<a[i+1][n]<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
... | 0 | 33,193,767 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n;
cin >> n;
vector<string> s(2*n);
REP(i, n){
cin >> s[i];
s[i]+=s[i];
s... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
struct node{
node(ll _val = 0,node *_pre = NULL,node *_nx = NULL):value(_val),pre(_pre),nx(_nx){}
ll value;
node *pre,*nx;
};
struct link{
node *head = new node();
node *tail = head;
void add(ll val)
{
node *p = new no... | 0 | 19,826,401 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string str;
getline(cin, str);
for (int i = 0; i < str.length(); ++i) {
char c = str[i];
if ('A' <= c && c <= 'Z')
c = (c - 'A') + 'a';
else if ('a' <= c && c <= 'z')
c = (c - 'a') + '... | 0 | 14,431,717 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, int> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ... | 0 | 92,685,740 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char X, Y;
cin >> X >> Y;
string ans;
if (X < Y) ans = "<";
else if (X > Y) ans = ">";
else ans = "=";
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>... | 0 | 14,446,328 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
int main () {
int n, a, b;
std::cin >> n >> a >> b;
long long sum = 0;
long long psum;
for (int i = 1; i <= n; i++)
{
psum = 0;
int tmp = i;
if (n >= 10)
{
while(t... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); ++i)
int main() {
int n,num,s,a[101]={},p[7]={};
cin >> n;
rep(i,n){
num=i;
while(num%2==0){
a[2]++;
num/=2;
}
s=sqrt(num);
for(int j=3;j<=s;j+=2){
while(num%j=... | 0 | 5,150,918 |
#include <iostream>
using namespace std;
int main(){
int n;
float x1,x2,x3,x4,y1,y2,y3,y4;
cin >> n;
for(int i=0;i<n;i++) {
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if( (y2-y1)/(x2-x1) == (y4-y3)/(x4-x3) )
cout<<"YES\n";
else
cout<<"NO\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<vector<pair<int, int>>> edge(N + 1,
vector<pair<int, int>>());
int a, b, c;
for (int i = 0; i < N - 1; i++) {
scanf("%d %d %d", &a, &b, &c);
edge[a].insert(edge[a].end(), make_pair(b... | 0 | 25,106,080 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto& i : (arr))
#define all(x) ... | 0 | 80,254,352 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define reprange(i, a) for(int i : vector<int>a)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL << 60;
const ll mo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int H, W;
cin >> H >> W;
vector<string> c(H);
rep(i, H) cin >> c[i];
int ans = 0;
vector<vector<int>> cnt(H, vector<int>(W, 0));
rep(i, H... | 0 | 97,989,883 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 55);
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll res = INF;
for (int bit = 0; b... | 0 | 28,001,645 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2+5;
int n , k;
bool yes[N];
int main(){
scanf("%d%d" , &n , &k);
for(int i = 1; i <= k; i++){
int d;
scanf("%d" , &d);
for(int j = 1; j <= d; j++){
int x;
scanf("%d" , &x);
yes[x] = 1;
... | 0 | 64,759,503 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using ll = long long;
int main(){
string S;
cin >> S;
string ans,e;
for (int tmp = 0; tmp < 8; tmp++) {
ans = S[0];
int sum = stoi(ans);
rep(i,3){
e = S[i+1];
if ((... | #include <bits/stdc++.h>
using namespace std;
int N;
int A[110];
int main(){
cin >> N;
for(int i=0; i<N; i++) A[i] = i+1;
int res = 0;
while(true){
bool exist_even = false;
for(int i=0; i<N; i++){
if(A[i] % 2 == 0 && A[i] != 0) exist_even = true;
}
if(exist_ev... | 0 | 67,706,404 |
#include<bits/stdc++.h>
#define ll long long
#define thekingisborn ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ld long double
#define f first
#define se second
#define pb push_back
#define maxn 200005
#define mod 1000000007
#define pi 3.14159265359
using namespace std;
typedef pair<int,int>pii;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.1415926535;
const ll MAX=1000000;
ll modpow(ll x,ll y){
long long ans=1;
while(y>0){
if(y&1){
ans*=x%MOD;
}
x*=x%MOD;
x%=MOD;
ans%=MOD;
y>>=1;
}
return ans;
}
ll fac[M... | 0 | 54,560,290 |
#include <iostream>
#include <regex>
using namespace std;
int main()
{
string s, p;
regex re;
cin >> s >> p;
re = p;
s += s;
if (regex_search(s, re)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | 0 | 70,777,873 |
#include<iostream>
#include<string>
using namespace std;
#define SIZE 1001
int Char_Change_Int( char c );
int main()
{
char num;
string str;
int sum = 0;
while( 1 )
{
cin >> str;
num = str[0];
if( num == '0' && str.size() == 1 )
{
break;
}
for( int i = 0; i < str.size(); i++ )
{
sum += Char_Cha... | #include<bits/stdc++.h>
using namespace std;
long long N;
long long u[200005];
long long v[200005];
int main(){
cin >> N;
for(long long i = 0; i < N - 1; i++) {
cin >> u[i] >> v[i];
u[i]--; v[i]--;
if(u[i] > v[i]) {
swap(u[i], v[i]);
}
}
long long maxi = 0;
for(long long i = 0; i < N; i++) {
long long... | 0 | 43,801,231 |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 200005;
int n, ans;
int a[N], b[N];
int main(){
scanf("%d",&n);
for(int i = 1;i <= n;i++){
scanf("%d",&a[i]);
b[i] = a[i];
}
sort(b+1,b+1+n);
for(int i = 1;i <= n;i++){
a[i] = lower_bound(b+1, b+1+n,a[i])-b;
}
for(int i = 1;i <= n;i++)... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int num;
int win_point = 3;
int draw_point = 1;
int taro_point = 0;
int hanako_point = 0;
string card_taro, card_hanako;
cin >> num;
for (int i = 0; i < num; ++i)
{
cin >> card_taro >> card_hanako;
... | 0 | 48,767,036 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
int n = s.size();
for(int i=0; i<26; ++i) for(int j=0; j<n; ++j){
if(s[j] == 'a'+i){
char cs = s[j], ct = t[j];
for(int k=j; k<n; ++k){
if(s[k] == cs && t[k] != ct){
cout << "No" << endl;
... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
const int N=1e5+3;
int c[N];
int main()
{
ft
int t,i,j,n,m,l=0,r=0,s=0;
cin>>n;
f... | 0 | 44,946,397 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,k;
cin >> n >> k;
vector<int> h(n);
rep(i,n){
cin >> h.at(i);
}
vector<int> p(n);
rep(i,n){
p.at(h.at(i)-1)++;
}
sort(p.begin(),p.end());
reverse(p.begin(),p.end());
int ans=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18 + 5;
int n, k;
ll ans = INF;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<pair<ll, ll>> a(n);
vector<ll> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].secon... | 0 | 81,851,357 |
#include <iostream>
using namespace std;
int main(){
int n[100],m,max=0;
for(int i=0;i<100;i++){
n[i] = 0;
}
while(cin>>m){
n[m-1]++;
if(max<n[m-1]){
max++;
}
}
for(int i=0;i<100;i++){
if(n[i] == max)
cout<<i+1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 29,611,571 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl "\n"
#define ll long long
#define MOD 1000000007
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define pii pair<int,int>
bool compare(const pii &a, const pii &b){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> A(H, vector<char>(W));
vector<vector<int>> M(H, vector<int>(W, 0));
queue<int> X;
queue<int> Y;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> A.at(i).at(j);
if (A.a... | 0 | 80,020,565 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
string str;
cin>>str;
for(int i = 0;i<str.length();i++)
cout<<str[str.length()-(i+1)];
cout<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int v,e;
cin>>v>>e;
int g[v][v];
int INF=1LL<<55LL;
for(int i=0;i<v;i++)
for(int j=0;j<v;j++)
g[i][j]=(i!=j)*INF;
for(int i=0;i<e;i++){
int s,t,d;
cin>>s>>t>>d;
g[s][t]=d;
}
for(int k=0;k<v;k++)
f... | 0 | 36,597,121 |
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
int main() {
llint h1, h2, m1, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int a = (h2 - h1) * 60 + (m2 - m1);
cout << max(0LL, a - k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 9,368,964 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
ll absll(ll a){
if(a > 0) return a;
else return -1*a;
}
int main() {
ll x,y; cin >> x >> y;
if(x == y) cout << 0;
else if(x... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 20,456,786 |
#include<iostream>
using namespace std;
int main(){
int n;
long long a;
long long minvalue = 1000000;
long long maxvalue = -1000000;
long long sum = 0;
cin >> n;
for ( int i = 0; i < n; i++ ){
cin >> a;
if ( a < minvalue ) minvalue = a;
if ( a > maxvalue ) maxvalue = a;
sum += a;
}
cout << minvalue << ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 10,629,738 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int c=0;
char a[3],abc[3]={'a','b','c'};
cin>>a;
for(int i=0;i<=2;i++)
{
if (a[0]==abc[i])
{
c++;
continue;
}
else if (a[1]==abc[i])
{
c++;
c... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define MAX 1000001
#define MOD 1000000007
#define pi 3.14159265358979323846264338
#define mp make_pair
#define pb push_back
#define pll pair<ll,ll>
#define vl vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vc vector<c... | 0 | 30,667,203 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i) cin >> A[i];
ll ret = 0;
for(int i = 1; i < N; ++i){
if(A[i-1] > A[i]){
ret += A[i-1] - A... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int numb(int n, int k){
int cntr = 0;
while(n < k){
cntr ++;
n *= 2;
}
return cntr;
}
int main(){
Hello
double n, k;
cin >> ... | 0 | 12,444,514 |
#include <bits/stdc++.h>
#define rua system("pause")
using namespace std;
typedef long long ll;
inline int read()
{
int x = 0, f = 1; char c = getchar();
while (!isdigit(c)) {if (c == '-') f = -1; c = getchar();}
while (isdigit(c)) {x = x * 10 + c - '0', c = getchar();}
return x * f;
}
const int MAXN = 4e5 + 10;
in... | #include <iostream>
#include <limits>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ... | 0 | 42,547,566 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF= 1e9+5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abcdefghijk... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
string s;
cin >> s;
string ans = "";
REP(i,(int)s.size()){
i... | 0 | 79,943,436 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const ll INF = 1e15;... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
map<int64_t,int64_t>a;
int tmp;
for(int i=0;i<n;i++){
cin>>tmp;
if(a.count(tmp))a.at(tmp)++;
else a[tmp]=1;
}
vector<int64_t>aa;
for(auto num:a){
if(num.second<=3&&num.second>=2){
aa.push_back(num.first);
}
... | 0 | 18,633,178 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> a;
for(int i = 0; i < n; ++i){
int p,q;
cin >> p >> q;
a.push_back({p,q});
}
sort(a.begin(),a.end());
long long int res = 0;
int c = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j <... | #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()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<pair<int, int>> sushi(N);
REP(i, N) {
... | 0 | 93,910,874 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int s = abs(a-b);
if(s%2 == 1) cout << "Borys" << endl;
if(s%2 == 0) cout << "Alice" <<endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first
#de... | 0 | 96,553,641 |
#include <vector>
using namespace std;
class UnionFind
{
public:
vector<int> parent;
vector<int> sz;
UnionFind(int n): parent(n), sz(n)
{
for(int i=0;i<n;i++)
{
parent[i] = i;
sz[i] = 1;
}
}
int root(int x)
{
return parent[x]==x ? x : p... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long k;
ios::sync_with_stdio(false);
cin.tie(0);
cin>>k;
long a,b,c;
a=k/50+50;
b=k%50;
c=a-b-1;
cout<<50<<endl;
for(int i=0;i<50;i++)
{
if(i<b)
{
if(i==0)
... | 0 | 75,631,280 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main(){
int a[26];
for (int i = 0;i < 26;++i) {
a[i] = 0;
}
char c;
while (cin >> c) {
char b = tolower(c);
if ('a' <= b&&b <= 'z') a[b - 'a']++;
}
for (int i = 0;i < 26;i++) {
cout <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define FOR(i,... | 0 | 93,869,873 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,d[100000];
deque<ll>que;
int main(void){
cin>>n;
d[1]=1;
que.push_back(1);
while(que.size()){
ll p=que.front();
que.pop_front();
for(int i=0;i<2;i++){
ll u=i?(p+1)%n:(p*10)%n;
if(d[u]... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define SORT(a) stable_sort(all(a))
#define ... | 0 | 47,780,163 |
#include<iostream>
using namespace std;
int main(){
int n,u,k,v;
int A[101][101];
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++) A[i][j]=0;
}
for(int i=0;i<n;i++){
cin>>u;
cin>>k;
for(int j=0;j<k;j++){
cin>>v;
A[u-1][v-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 68,067,170 |
#include<bits/stdc++.h>
using namespace std;
#define INFTY 200000000000
int main(){
int v,e;cin>>v>>e;
long long dis[v][v];
for (int i = 0; i < v; i++)
{
for (int j = 0; j < v; j++)
{
if(i==j)dis[i][j] = 0;
else dis[i][j] = INFTY;
}
}
f... | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | 0 | 95,309,281 |
#include <cstdio>
int fib(int *a,int n){
if(n==0 || n==1)return 1;
else{
int tmp;
if(a[n])tmp = a[n];
else{
tmp = fib(a,n-1) + fib(a,n-2);
a[n] = tmp;
}
return tmp;
}
}
int main(){
int i, n;
int a[45];
for(i=0;i<45;i++)a[i]=0;
s... | #include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
const ll MOD = (ll)1e9 + 7;
vector<ll> dist;
void dfs(int u, int par, const vector<vector<pair<int, int>>>& adj) {
for(auto& node: adj[u]) {
... | 0 | 38,925,872 |
#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
using namespace std;
template <typename T> T Max(T X,T Y){return X>Y?X:Y;}
template <typename T> T Min(T X,T Y){return X<Y?X:Y;}
template <typename T> void c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N, count = 0;
ll K;
cin >> N >> K;
vector<ll> Z(100001);
for(int i=0; i<N; i++) {
int a, b;
cin >> a >> b;
Z[a] += b;
}
for(int i=1; i<=100001; i++) {... | 0 | 11,707,869 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s){return accumulate(s.begin(),s.end(),0);}
void p(vector<int> A){rep(i,A.size()){cout << A[i] << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 30,138,942 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(N), B(N);
for (int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
long long S = 0;
for (int i = N - 1; i >= 0; i--){
int r = (A[i] + S) % B[i];
if (r != 0){
S += B[i] - r;
}
}
cout << S << ... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | 0 | 64,445,767 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
i... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | 0 | 90,326,068 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
bool kaibun1=true;
bool kaibun2=true;
bool kaibun3=true;
int N=S.size();
for (int i=0;i<N;i++) {
if (S[i] != S[N-1-i]) {
kaibun1 = false;
break;
}
}
for (int i=0;i<(N-1)/2;i++... | 0 | 15,003,994 |
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX_N = 100;
int pts[MAX_N];
int n;
int main() {
while (true) {
cin >> n; if (n <= 0) break;
for (int i = 0; i < n; ++i)
cin >> pts[i];
sort(pts, pts + n);
long pt = 0;
for (int i = 1; i < n-1; ++i)
pt += pts[i];
cout << pt / (n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& x: ve... | 0 | 40,476,935 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,leg;
int b, t;
cin >> n >> leg;
for (int i = 0; i <= 100; i++) {
if (leg % 2 != 0)
break;
for (int j = 0; j <= 100; j++) {
if (i + j == n && 2 * i + 4 * j == leg) {
co... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;
int main() {
int n; cin >> n;
map<int, int> cnt;
while (n--) {
int a; cin >> a;
cnt[a]++;
}
priority_queue<int> pq;
for (auto &p: cnt) {
for (int i = 0; i < p.s... | 0 | 36,684,097 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int i=1;
while(1){
int n; cin >> n;
if(n==0) break;
cout << "Case " << i << ": " << n << "\n";
i++;
}
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 5,951,252 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <string>
#include <math.h>
#include <map>
#include <numeric>
#include <stack>
#include <queue>
#include <functional>
#include <stdio.h>
#define ll long long
#define pl pair<ll,ll>
#define vl vector<ll>
#define vvl vector<vector<ll> >... | #include <vector>
#include <list>
#include <map>
#include <set>
#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 <cstdlib>
#include <c... | 0 | 58,022,326 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <bitset>
#include <set>
#include <complex>
#include <cmath>
#include <cstring>
#include <map>
using namespac... | 0 | 60,139,355 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
void read();
template<typename First, typename... Rest> void read(First& first, Rest&...... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
vector<pair<int, ll>> tree[100010];
ll depth[100010];
void dfs(int v, int p, ll d) {
depth[v] = d;
for (auto &e: tree[v]) {
if (e.first == p) continue;
dfs(e.first, v, d + e.second);... | 0 | 6,509,415 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9+7)
#define ALL(v) v.b... | #include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(i=0;i<(n);i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int inputValue(){... | 0 | 96,496,451 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int x, y;
cin >> x >> y;
cout
<< abs(abs(y) - abs(x))
- (y == 0 ? 1 : 0)
+ (signbit(x) == signbit(y)
? (x < y ? 0 : 2)
: 1)
<< endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(void){
int n;
cin >> n;
long long int num[n];
long long int sum[n];
long long int ans = 10000000000000;
for(int i = 0; i < n; i++){
cin >> num[i];
if(i==0) sum[i]=num[i];
... | 0 | 61,417,762 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int mod=1e9+7;
void solve()
{
ll a,b;cin>>a>>b;
cout<< a + b/2;
}
int main(void)
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int T=1;while(T--){solve();}return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 0 | 34,180,007 |
#include <iostream>
#include <cmath>
int main()
{
int a, b, c, d;
std::cin >> a >> b >> c >> d;
bool can_direct = std::abs(c - a) <= d;
bool can_indirect = (std::abs(b - a) <= d &&
std::abs(c - b) <= d);
int can = can_direct || can_indirect;
std::cout << (can ? "Yes" : "No") << std::e... | #include <stdio.h>
#include <string.h>
int main(){
char str[11];
scanf("%s", &str);
char keluar[11];
int j = 0, i = 0;
int len = strlen(str);
while(len--)
{
if(str[j] == 'B')
{
if(i > 0)
{
i--;
}
keluar[i]= ' ';
j++;
}
else
{
keluar[i] = str[j];
i++;
j++;
}
}
... | 0 | 80,965,345 |
#include <iostream>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
struct Cube
{
int f[6];
Cube(){}
void roll(int i,int j,int k,int l)
{
int t = f[i];
f[i] = f[j];
f[j] = f[k];
f[k] = f[l];
f[l] = t;
}
void roll_z() { roll(1,2,4,3); }
void roll_y() { roll(0,2,5,3); }
void... | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | 0 | 28,894,262 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
int sum = 0;
cin >> A >> B;
for (int i = A; i < B+1; i++) {
if ((i / 10000 == i % 10) && (((i % 10000) / 1000) == ((i % 100) / 10))) sum++;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 43,804,514 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = ve... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] =... | 0 | 81,284,242 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
vector<string>s(h);
rep(i,h)cin>>s[i];
vector<vector<int>>dist... | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL... | 0 | 12,289,089 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n+1),x(n+1),y(n+1);
t.at(0) = 0, x.at(0) = 0, y.at(0) = 0;
for(int i=1;i<n+1;i++){
cin >> t.at(i) >> x.at(i) >> y.at(i);
}
bool ans = 1;
for(int i=0;i<n;i++){
int ta,xa,ya;
ta = t.at(i+1)-t.at(i);
x... | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | 0 | 93,932,400 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | #include<iostream>
#include<vector>
#include<map>
#define P pair<int,int>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n||m||p){
int maisu=0,tmp,atari;
int ans=0;
for(int i=0;i<n;i++){
cin>>tmp;
maisu+=tmp*100;
if(i+1==m)atari=tmp;
}
if(atari==0)ans=0;
else {
ans=maisu*100;
ans-=maisu... | 0 | 66,815,946 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M,X,ans=-1,p=0,t=1;
cin >> N >> M >> X;
int C[N],A[N][M],P[M]={};
for (int i = 0; i < N; i++)
{
cin >> C[i];
for (int j = 0; j < M; j++)
{
cin >> A[i][j];
}
}
for (int bit = 0; bit < (1 << N); ++bit)
{
for (int i ... | #include<iostream>
#include<cstdio>
using namespace std;
int n,m,k,type;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9')
c=getchar();
while ('0'<=c&&c<='9')
{
sum=sum*10+c-'0';
c=getchar();
}
return sum;
}
int main()
{
n=read(),m=read(),k=read();
for (int i=1;i<=n;++i)
{... | 0 | 30,505,004 |
#include<bits/stdc++.h>
using namespace std;
int n,a[100005],cnt,k=0;
vector<int> v;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i-1]);
if(i==1){
cnt=1;
continue;
}
if(a[i-1]==a[i-2]){
++cnt;
}else{
v.push_back(cnt);
cnt=1;
}
}
v.push_back(cnt);
for(int i=0;i<v.size(... | #include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a... | 0 | 70,870,991 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n,len;
char c[100000];
char ans[1000... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i=0; i<n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { i... | 0 | 43,892,072 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<int,int>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<vector<int>> bitcnt;
int K;
vector<int> select(vector<int>& origin, int bit){
if(bit == -1) return origin;
int cnt = 0;
vector<int> nextIdx;
for(int i : origin){
if(bitcnt[i][bit] == 1){
... | 0 | 81,044,352 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <cstdio>
using namespace std;
int main()
{
int in[10];
int i = 0;
while (scanf("%d", &in[i]) != EOF){
if (in[i] == 0){
i--;
printf("%d\n", in[i]);
}
else {
i++;
}
}
} | 0 | 77,998,172 |
#include<iostream>
using namespace std;
int main(){
int H,W,i,j;
while(cin>>H>>W){
if(H==0&&W==0){
break;
}
for(i=0;i<W;i++){
cout<<'#';
}
cout<<endl;
for(i=0;i<H-2;i++){
cout<<'#';
for(j=0;j<W-2;j++){
cout<<'.';
}
cout<<'#'<<endl;
}
for(i=0;i<W;i++){
cout<<'#';
}cout<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main(){
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i=0; i<h; i++) cin >> a[i];
vector<vector<int>> dist(h, vector<int>(w, -1));
queue<pair<int, int>> que;
for (int i=0; i<h; i+... | 0 | 2,388,643 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string s;
cin >> s;
string res = "";
rep(i, s.size())
{
if (s[i] == 'B'... | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long int
#define all(x) (x).begin(), (x).end()
#define present(c,x) (c.find(x) != c.end())
#define removeDuplicates(a) a.resize(unique(all(a))-a.begin())
#define endl '\n'
const int INF=1e9+5;
void solve(){
int h,w;
cin>>h>>w;
vector<st... | 0 | 54,866,721 |
#include <bits/stdc++.h>
#define nl ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
using namespace std;
int main() {
nl
int t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << double(t... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> pq;
rep(i, N) {
int A;
cin ... | 0 | 48,099,860 |
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX_N 100000
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
void print_node(Node nodes[], int i, int depth[]) {
printf("node %d: parent = %d, depth = %d, ", i, nodes[i].parent, depth[i]);
if(nodes[i].parent == NIL) {
pri... | #include <bits/stdc++.h>
#define fname "D"
#define cerr if(false)cerr
#define bug(x) cerr << (#x) << " = " << (x) << endl
#define ll long long
#define REP0(i, n) for(int i = 0, _n = (n); i < _n; ++i)
#define REP1(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define REPB0(i, n) for(int i = (n) - 1; i >= 0; --i)
#define ... | 0 | 69,037,837 |
#include <bits/stdc++.h>
#define fir first
#define sec second
#define pb push_back
#define ll long long
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define debug(x) cerr<<#x<<" =: "<<x<<endl;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace s... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 29,772,658 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.