code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,ans="Yes";
cin >> s >> t;
vector<long> a(26);
vector<long> b(26);
for(long i=0;i<s.size();i++) {
if(a[t[i]-'a']!=0&&a[t[i]-'a']!=s[i]) ans="No";
a[t[i]-'a']=s[i];
if(b[s[i]-'a']!=0&&b[s[i]-'a']!=t[i]) ans="No";
b[s[i]-'a']=t... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#defi... | 0 | 100,533,445 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<55)
#define mod 1000000007
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int a,b,c,k;
cin>>a>>b>>c>>k;
if (k%2==0) {
long long int ans=a-b;
if (abs(a-b)>1000000000000000000) {
cout<<"Unfair"<<endl;
} else {
cout<<ans<<endl;
}
} else {
long l... | 0 | 48,645,926 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, V) for (int i = 0; i < V; i++)
#define repr(i, V) for (int i = V-1; i >= 0; i--)
#define repval(i, a, V) for (int i = a; i < V ; i++)
#define all(x) x.begin(), x.end()
#define ld long double
#define eps 0.0000000001... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i,a,b) for(Re in... | 0 | 76,531,737 |
#include <iostream>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
if (a - b >= c)
{
std::cout << 0 << std::endl;
}
else
{
std::cout << c - a + b << std::endl;
}
return 0;
} | #include <iostream>
typedef long long LL;
using namespace std;
int main() {
LL n;
LL m;
LL tmp;
LL ans;
cin >> n >> m;
if(m>n){
tmp=n;
n=m;
m=tmp;
}
if(m==1){
if(n==1){
ans=1;
}else if(n==2){
ans=0;
}else{
... | 0 | 1,673,348 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define re... | 0 | 27,150,827 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll exp... | #include <bits/stdc++.h>
using namespace std;
using ld = double;
using point = complex<ld>;
int main() {
int n; cin >> n;
vector<point> ps;
for(int i = 0; i < n; ++i) {
int x, y; cin >> x >> y;
if(x == 0 && y == 0) continue;
ps.emplace_back(x, y);
}
n = ps.size();
sort(ps... | 0 | 70,245,689 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | #include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int n;
scanf("%d", &n);
vector<int> v[100000];
f... | 0 | 65,540,682 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_... | 0 | 22,849,787 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int t,x;
cin >> t >> x;
cout << fixed << setprecision(15) << t/double(x) << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | 0 | 99,635,992 |
#include<iostream>
#include<stdlib.h>
#include<queue>
using namespace std;
int main () {
int a,b;
while(cin>>a>>b,a|b){
int x,y,m=0;
int d[a*b]={};int k;cin>>k;
for(int i=0;i<k;++i){
cin>>x>>y;x--;y--;
d[x+y*a]=1;
}
int t=a+b;
int dp[2][a*b];
for(int i=0;i<2;++i)for(int j=0;j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5005;
ll c[maxn], p[maxn], b[maxn], n, k, ans = -999999999999, t, cnt, vis[maxn], inf = 0;
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> p[i];
for (int i = 1; i <= n; i++)
cin >> c[i];
... | 0 | 91,184,204 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
s1 = toupper... | 0 | 60,140,246 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
int s1len = (int)s1.size();
int s2len = (int)s2.size();
vector<vector<int> > D(s1len+1 ,vector<int>(s2len+1, 0));
for(int i=0;i<=s1len;++i){
D[i][0]=i;
}
for(int ... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 19,435,866 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = abs(a[i] - x);
}
if (n == 1) {... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void show(vector<ll>& vc)
{
for(auto it:vc)cout<<it<<" ";
cout<<endl;
}
#define M 300014
/**
typedef pair<ll, ll> pii;
#define x first
#define y second
pii extendedEuclid(ll a, ll b)
{
if(b == 0) return pii(1, 0);
else
{
p... | 0 | 51,863,642 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<array>
#include<math.h>
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[])
{
int H, W;
int ansH;
char ansW;
std::cin >> H >> W;
string str;
int A = 'A';
for (... | #include<stdio.h>
const int MAX_N = 1000000;
int n;
int num[MAX_N];
int ans=0;
int main(){
for (int i = 2; i < MAX_N; i++){
num[i] = 1;
}
for (int i = 2; i < MAX_N; i++){
if (num[i] == 0) continue;
for (int j = 2; i*j < MAX_N; j++){
num[i*j] = 0;
}
}
while... | 0 | 94,382,047 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
map<int,int> mp;
for(int i = 0; i < 3; i++){
int a, b; cin >> a >> b; mp[a]++; mp[b]++;
}
int cn1 = 0, cn2 = 0;
for(auto i : mp) {
cn1 += i.second == 1;
cn2 += i.second == 2;
}
cout << (cn... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define _dec(i,N,j) for(int i = (N-1);i >= (j);i--)
#define _rec(i,N,j) for(int i = (N);i >=(j);i--)
#define ALL(x) x.begin(),x.end()
#define MEM(a,n) memset(a,n,sizeof(a))
#d... | 0 | 25,472,522 |
#include <bits/stdc++.h>
int divs(int n) {
int count = 2;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
++count;
const int t = n / i;
if (i != t) {
if (n % t == 0)
++count;
}
}
}
return count;
}
in... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 40,189,568 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define int long long
int32_t main(){
int l, r;
cin >> l >> r;
if (r - l <= 10000){
int mn = 100000000;
for (int i = l; i <= r; i++){
for (int j = i + 1; j <= r; j++){
mn = min(mn, ... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int x,n,ans,a,b;
cin>>x>>n;
if(n==0)
{
ans=x;
}
else
{
vector<int> p(n);
for(int i=0;i<n;i++)
{
cin>>p.at(i);
}
for(int i=x;i<=101;i++)
{
int h=0;
for(int j=0;j<n;j++)
{
if(p.at(j)==i)
... | 0 | 68,155,776 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e7+5;
int ans[maxn]={0};
int main(){
long long n;
scanf("%lld",&n);
long long cnt=0;
for(int i=1;i<n;i++){
if(ans[i]==0&&ans[n-i]==0&&i!=n-i){
ans[i]=ans[n-i]=1;
cnt++;
}
}
printf("%lld",cnt);
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 13,429,305 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int h,w,ans=0;
cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
vector<vector<int>> dist(h,vector<int>(w,INF));
queue<P> que;
rep(i,h) rep(j,w){
... | #include <iostream>
#define N_MAX 1000000000
using namespace std;
int func(long long n){
static int cnt = 0;
if(cnt++ > 64)return -1;
char ans;
cout << "? " << n << endl;
cin >> ans;
if(ans == 'Y')return 1;
return 0;
}
int main(void){
long long left = (long long)N_MAX*10-1, right = (long... | 0 | 72,373,973 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,h;
cin>>n>>h;
vector<long long> a(n);
vector<long long> b(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
cin>>b.at(i);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(a.begin(),a.end());
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int sum = 0;
for (int i = a; i < b + 1; i++){
int c_1 = i / 10000;
int c_2 = (i % 10000) / 1000;
int c_3 = (i % 100) / 10;
int c_4 = i % 10;
if (c_1 == c_4 && c_2 == c_3){
... | 0 | 16,533,277 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define vi vector<int>
#define sws ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl '\n'
#... | 0 | 37,774,979 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
map<int, int> m1;
map<int, int> m2;
bool comp1(int a, int b) {
return m1[a] > m1[b];
}
bool comp2(int a, int b) {
return m2[a] > m2[b];
}
int main(int argc, char* argv[]) {
int n;
cin >> n;
int v[n];
for (int i = ... | 0 | 89,759,110 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um = unordered_map<ll,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void prt(T v){cout<<... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 9,844,203 |
#include <iostream>
int main() {
int num1, num2, num3;
int count = 0;
std::cin >> num1 >> num2 >> num3;
for (int i = 1; i <= num3; i++)
{
if (num3%i == 0) {
if (num1 <= i && i <= num2) count++;
}
}
std::cout << count << std::endl;
return 0;
} | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 5,501,706 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 73,104,958 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
vector<pair<int,int>> P;
ll sum_p = 0;
vector<int> X(m, -1);
for(ll i=0; i<n; ++i){
if(X[x] > -1){
int cyc_len = P.size() - X[x];
int nxt_len =... | #include <bits/stdc++.h>
using namespace std;
int n, m, l, r, d1;
vector<pair<int,int>> e[100004];
bool visited[100004];
long long d[100004];
bool ok;
void dfs(int here){
visited[here] = true;
for(auto i : e[here]){
int there = i.first;
int dist = i.second;
if(!visited[there]){
d[there] = d[here] + dist;
... | 0 | 19,317,663 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; ... | #include "bits/stdc++.h"
using namespace std;
int main(){
string S,T;
cin >> S >> T;
vector<int> start(26,-1);
vector<int> goal(26,-1);
for(int i=0;i<S.size();i++){
int a=S[i]-'a';
int b=T[i]-'a';
if(start[a] != -1 || goal[b] != -1){
if(start[a] != b || goal[b]!=a... | 0 | 55,987,011 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin),... | #include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 105;
int n, a[N];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; ... | 0 | 25,110,381 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int A, B, X;
cin >> A >> B >> X;
if(A <= X && A + B >= X ) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll h[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int active = 0;
int ans ... | 0 | 62,409,758 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto ma... | #include<bits/stdc++.h>
using namespace std;
int H, W, x, y, ans = 0, flag = 0;
queue<int> Qx, Qx_next; queue<int> Qy, Qy_next;
bool can_go(int x, int y){
return (1 <= x && x <= H && 1 <= y && y<= W);
}
void f(vector<vector<int>>& A, int x, int y){
if(can_go(x,y)){
if(A[x][y] == 1){
flag = 1... | 0 | 47,680,727 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
const int MAX_N = 2e5 + 100;
int N;
int main() {
cin >> N... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 91,058,931 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
long long int a,b,ans=0;
cin>>a>>b;
for(int i=0;b>=a;i++){
a=a*2;
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
int acnt = 0, bcnt = 0, abcnt = 0;
for (int i = 0; i < n; i++) {
int m = s[... | 0 | 17,574,206 |
#include <iostream>
using namespace std;
int main(){
char s[200001],t[200001];
cin>>s>>t;
int i = 0, sum = 0;
while(s[i]!='\0'){
if(s[i]!=t[i])
sum++;
i++;
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
#include <boost/math/tools/minima.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(... | 0 | 52,356,109 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
long long ans = 0;
for(int i = 0; i< N; i++){
ans += A[i] / 2;
if(i < N - 1) {
if(A[i + 1] > 0)... | #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define ... | 0 | 6,347,272 |
#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() {
string s, t;
cin >> s;
cin >> t;
rep(i,s.size()) {
if (s==t) {
cout << "Yes" << endl;
return 0;
} else {
... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define ld long double
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#p... | 0 | 55,335,008 |
#include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e18
#define fastRead ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const ll MOD = 1e9 + 7;
... | #include <iostream>
#include <stack>
using namespace std;
void startstack(stack<int> &st){
st.empty();
st.push(0);
}
void clear(string &tmp){
int j;
do{
for(j=0;tmp[j];j++);
if(tmp[--j]=='.') break;
}while(getline(cin,tmp));
}
int main(){
int i,j;
stack<int> st;
string tmp;
startstack(st);
g... | 0 | 93,594,034 |
#include <iostream>
std::string str_repeat(char c, int n)
{
std::string str = "";
while (n--) {
str += c;
}
return str;
}
int main(void)
{
int h, w;
while (std::cin >> h >> w) {
if (h == 0 && w == 0) break;
h -= 2;
std::cout << str_repeat('#', w) << std::endl;
while (h--) {
std::co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | 0 | 13,203,377 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
int n, m;
cin >> n... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
int main(){
long int A,B,C,p,i;
p = 0;
cin >> A >> B >> C;
for(i = A;i <= A *... | 0 | 31,578,591 |
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
namespace
{
static std::array<int, 1000001> ng_nums = {};
static std::array<int, 1000001> num_count = {};
}
namespace ABC170
{
class D
{
public:
D() = default;
~D() = default;
void Run()
{
int N;
std::cin >... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int a[10];
int out[3] = {0, 0, 0};
for (int i = 0; i < 10; ++i) cin >> a[i];
for (int i = 0; i < 10; ++i){
if (a[i] >= out[0]){
out[2] = out[1];
out[1] = out[0];
out[0] = a[i];
}
else if (a[i] >= out[1]){
out[2] = out[1];
o... | 0 | 62,252,348 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int n;
cin >> n;
rep(i,n){
int y,m,d,ans=0;
cin >> y >> m >> d;
while(y<1000){
while(m<=10){
while(d<=19){
d++; ans++;
}
if(y%3==0 || m%2 == 1) ans++;
d=1;
m++;
}
m=1;
y++;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) cin >> A[i];
int64_t ans = 0;
while(true){
bool updated = false;
for(int i=0; i<N; i++){
int64_t d = A[i]/N;
ans += d;
if(d ... | 0 | 40,336,825 |
#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 long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, k;
cin >> a >> b >> k;
if(a>=k)a-=k;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long a[n];
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
for (int i = 0; i < n - 1; i++) a[i + 1] += a[i];
int k = 0;
for (int i = 0; i < n - 1; i++)
if (a[i] * 3 < a[i + 1]) k = i + 1;
printf("%d\n", ... | 0 | 57,657,330 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<int>
#define vvint vector<vint>... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 0 | 63,118,345 |
#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... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
using ll = long long int;
using p = pair<int, int>;
using pl = pair<ll, ll>;
using v = vector<int>;
using vd = ve... | 0 | 22,826,997 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 100,006,336 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[4][3][10];
for(int h=0;h<4;h++){
for(int i=0;i<3;i++){
for(int j=0;j<10;j++){
a[h][i][j]=0;
}
}
}
int b;
cin>>b;
for(int c=0;c<b;c++){
int d,e,f,g;
cin>>d>>e>>f>>g;
d--;e--;f--;
a[d][e][f]+=g;
}
for(int h=0;;h++){
f... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int... | 0 | 47,637,556 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<vector<int>> ar(n,vector<int>(3));
for(int i=0;i<n;++i)
{
cin>>ar[i][0]>>ar[i][1]>>ar[i][2];
}
vector<vector<int>> dp(n,vector<int>(3,0));
dp[0][0]=ar[0][0];
dp[0][1]=ar[0][1];
dp[0][2]=ar[0]... | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 19,210,755 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
vector<ll> sum;
ll i;
void pre_process(vector<ll> &a,vector<ll> &s){
ll n=(ll)a.size();
s.assign(n+1,0);
for(i=0;i<n;i++){
s[i+1]=s[i]+a[i];
}
}
ll query(ll i,ll j,vector<ll> &s){
return s[j]-s[i];
}
int main(){
ll n,k;cin>... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | 0 | 64,546,148 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
int ans = 100;
for(int i=1; (ll)i*i<=n; ++i){
if(n%i == 0){
ll x = n/i;
int nans = 0;
while(x>0){
x /= 10;
nans++;
}
ans = min(ans,nans);
}
}
cout << ans << e... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
rep(i, n) a[i + 1] += a[i];
sort(a.begin(), a.end());
ll ans = 0;
vector<ll> r... | 0 | 68,523,876 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int W, H, N;
cin >> W >> H >> N;
int x1 = 0, x2 = W + 1, y1 = 0, y2= H + 1;
int x , y , a;
for (int i = 1; i <= N; i++) {
cin >> x >> y >> a;
if(a == 1) {
x1 = max(x1, x);
}
else if (a == 2) {
x2 = min(x2, x);
}
... | 0 | 25,625,119 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i] = a[i]-1;
int ans = 1;
int p1=a[0];
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ans = 0;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = 0; i < n; ++i) {
... | 0 | 10,467,516 |
#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] -= i;
}
sort(A.begin(), A.end());
int mid = A[N / 2];
long long ans =... | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<math.h>
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
ll n,vis[MAX];
ll fac[MAX]={1,1};
ll inv[MAX]={1,1};
ll fi[MAX]={1,1};
void init()
{
for(int i=2;i<MAX;i++)
{
fac[i]=fac[i-1]*i%mod;
inv... | 0 | 66,283,645 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
double sum = 0;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
sum += A[i];
}
int cnt = 0;
rep(i, N) {
if (A[i] >= (double)(sum / (4 * M))) cnt+... | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<P,int>
#define vpp vector<PP>
#define fi first
#define se second
#define INF (1<<30)
#define MOD 1000000007
#define REP(i... | 0 | 46,928,494 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#')... | #include <bits/stdc++.h>
using namespace std;
bool compare(const vector<long long> &a, const vector<long long> &b) {
return atan2(a[1], a[0]) < atan2(b[1], b[0]);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<vector<long long>> coords;
for (int i = 0; i ... | 0 | 34,134,475 |
#include <iostream>
using namespace std;
int main(){
int n,m;
while(cin >> n >> m , n || m){
int data[11] = {0};
for(int i=0;i<n;i++){
int a,b;
cin >> a >> b;
data[b] += a;
}
for(int i=10;i>=0;i--){
if(data[i] <= m ){
m -= data[i];
data[i] = 0;
}else{
data[i] -= m;
m = 0;
}
... | #include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
bool isPrime(int n){
if(n < 2){
return 0;
}
if(n%2 == 0){
return n==2;
}
for(int i=3;i*i<=n;i++){
if(n%i == 0) return 0;
}
return 1;
}
void allPoss(int indx,int ... | 0 | 54,749,119 |
#include <iostream>
using namespace std;
#define LISTSIZE 10000
int main(){
int n[LISTSIZE];
int x = 1;
int i = 0;
while (1){
cin >> x;
if (x==0) {
break;
}
n[i] = x;
i += 1;
}
for (int t=0; t<i; t=t+1) {
cout << "Case " << t+1 << ": " ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define SZ(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#de... | 0 | 63,261,672 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
int num = o.size() + e.size(), o_idx = 0, e_idx = 0;
string ans;
for (int i=0; i<num; i++){
int temp = i + 1;
if (temp%2 == 0){
ans += e.at(e_idx);
e_idx++;
}
... | 0 | 53,241,469 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a;
cin>>a;
if(a-'a'>=0){
cout<<"a"<<endl;
}
else {
cout<<"A"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int N;
Vl B;
Vl csum;
ll fun(ll b) {
int idx = lo... | 0 | 32,149,705 |
#include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define frepi(a,b) for(int i=a;i<=b;++i)
void solve_main()
{
int x;cin>>x;
int ans;
if(x>=1800)ans=1;
else if(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <queue>
#include <numeric>
#include <iomanip>
using namespace std;
#define ll long long
constexpr ll inf = 1e9+7;
int main () {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin>>N;
vector<double>... | 0 | 77,705,386 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, a, ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
int N,K; cin>>N>>K;
if(K > (N-1)*N/2 - (N-1)){
c... | 0 | 94,464,739 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
int x = 0;
for (char c : s) {
x += (int)(c - '0');
}
if (x % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<iostream>
#include<list>
#include<cstring>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int main(){
int n,x,y;
int i,j,k,l;
string str;
cin >> n;
for(i = 0;i < n;i++){
cin >> str;
... | 0 | 98,422,149 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
typedef pair<int,int> P;
typedef long long ll;
int main(){
int H, W, D; cin >> H >> W >> D;
vector<P> mp(H * W);
rep(i, 0, H) rep(j, 0, W){
int p; cin >> p; p--;
mp[p] = {i,j};
}
int Q; cin ... | 0 | 73,227,555 |
#include<iostream>
void sort(int*,int*,int*);
void swap(int*,int*);
void print(int,int,int);
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
sort(&a,&b,&c);
print(a,b,c);
return 0;
}
void sort(int* a,int* b,int* c){
if(*a>*b){
swap(*a,*b);
}
if(*b>*c){
swap(*b,*... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
int L = 0;
int R = 0;
int LR = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int k = s.size();
if (s[0] == 'B' && s[k-1] == 'A') LR++;
else if (s[0] == 'B') L++;
else if (s[k-1] == 'A'... | 0 | 12,592,388 |
#include <bits/stdc++.h>
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template<typename Head,typen... | #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 reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n;
int cnt = 62;
vector<ll> vec;
ll mod = 1e9+7;
ll solve() ... | 0 | 11,663,778 |
#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>;
vector<int> par;
vector<int> siz;
int maxi=1;
int root(int x){
if(par.at(x)==-1) return x;
return par.at(x) = root(par.at(x));
}
int size(int x){
return siz.at(x);
}
void uni... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | 0 | 32,306,120 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include <stdio.h>
#include <stdbool.h>
bool judgeRectTriangle(int , int , int);
int main(void)
{
int edge1, edge2, edge3;
scanf("%d", &edge1);
while (scanf("%d%d%d", &edge1, &edge2, &edge3) != EOF) {
if (judgeRectTriangle(edge1, edge2, edge3) ){
printf("YES\n");
} else {
... | 0 | 68,702,908 |
#include <iostream>
using namespace std;
int main(){
int money;
while(cin >> money && money !=0){
int count =0;
int res = 1000 - money;
for(int i=0;i<3;i++){
count +=res %10;
if(res % 10 >4){ count -= 4;}
res /=10;
}
cout << count << endl;
}
} | #include <stdio.h>
#include <math.h>
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.0;
s1 = ((xp - x1) * (y2 - y1) - (y... | 0 | 58,986,853 |
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#define rep(i,n) ... | #include<bits/stdc++.h>
using namespace std;
int check(vector<vector<char>>&hyo,int n,int m){
vector<int>delh;
vector<int>delw;
bitset<6>a=n;
bitset<6>b=m;
int ret=0;
for(int i=0;i<hyo.size();i++){
for(int j=0;j<hyo.at(0).size();j++){
if(a.test(i)&&b.test(j)&&hyo.at(i).at(j)=='#')
ret++;
... | 0 | 36,563,019 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
cin >> S;
int X = 0;
int Y = 0;
for(int i = 0; i < S.size(); i++) {
if(S[i] == '0') {
X++;... | #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... | 0 | 69,933,824 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0;
cin >> a >> b;
a = (a + b)/2.0 + 0.5 ;
cout << a << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 6,852,745 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll a = 0;
a = pow(10,15);
ll b = 0;
b = y - x;
if(b >= 0){
a = min(a,b);
}
b = 1 + y + x;
if(b >= 0){
a... | #include<iostream>
int main(){
int n, count = 0;
bool isprime [1000000];
for(int i = 0; i < 1000000; i++)
isprime[i] = true;
isprime[0] = isprime[1] = false;
for(int i = 2; i <= 1000; i++){
if(isprime[i]){
for(int j = i * 2; j < 1000000; j += i){
isprime[j... | 0 | 26,586,494 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s ;
cin >> s ;
int n=s.size();
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(i==0){
if(s.at(i)!='A'){
cout <<"WA" << endl;
break;
}
}
if(i==1){
if(s.at(i)<97||s.at(i)>122){
... | 0 | 78,957,150 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc015_a.txt"); \
cin.rdbuf(in.rdbuf());
#else
#define INPUT_FILE
#e... | 0 | 38,791,298 |
#include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> mp;
for(int n=0; n<N; n++) {
int A;
cin >> A;
mp[A]++;
}
int ans=mp.size();
int cnte=0;
for(auto itr=mp.begin(); itr!=mp.end(); itr++) {
if(itr->second%2==0... | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
#define ld long double
#define ff first
#define ss second
using namespace std;
ll fact(ll a)
{
if(a==0) return 1;
else return a*fact(a-1);
}
vl<ll> divisor(ll n)
{
vl<ll> v;
for(int i=2;i<=sqrt(n);i++)
{
if(n... | 0 | 6,164,323 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b, q;
string str, str1, str2, str3, g, p;
cin >> str >> q;
for( int i = 0; i < q; i++){
cin >> g;
if(g == "print"){
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if(g == "reverse"){
cin >>... | #include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#define ll long long
#define IOS std::ios::sync_with_stdio(false);
using namespace std;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;... | 0 | 51,986,820 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string a, b;
cin >> a >> b;
int asize = a.size();
int bsize = b.size();
if(asize!=bsize){
if(asize>bsize) cout << "GREATER" << e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | 0 | 9,466,786 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,v[111111],ans;
map<int,int>odd,even;
vector<pair<int,int>>o,e;
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
int main() {
int n, k, r, s, p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
bool flag[n];
rep(i, n) flag[i] = true;
int ans = 0;
rep(i, k) {
... | 0 | 60,431,966 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef unsig... | #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 (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 0 | 46,880,210 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define vl vector<ll>
#define N 100005
#define mod 1000000007
ll lcm(ll a,ll b)
{
return a/__gcd(a,b)*b;
}
int main()
{... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N, K;
scanf("%d", &N);
scanf("%d", &K... | 0 | 95,450,718 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #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 | 68,227,176 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #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 | 63,881,290 |
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
usin... | #include <iostream>
#include <algorithm>
using namespace std;
#define relu(x) max(x, 0l)
int main() {
int n, k;
cin >> n >> k;
long a[n], rui[n+1], top[n+1];
for (auto &ai:a) cin >> ai;
rui[0] = top[0] = 0;
for (int i=0; i<n; i++) {
rui[i+1] = rui[i] + a[i];
top[i+1] = top[i] + r... | 0 | 54,865,975 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long t,i,p=0;
string s;
cin>>s;
t=s.size();
for(i=0;i<t;i++){
if(s[i]=='o')
p++;
}p=p+15-t;
if(p>=8)
cout<<"YES";
else
cout<<"NO";
return 0;
} | #include <iostream>
#include <array>
#include <algorithm>
using namespace std;
int main()
{
int q, t, f;
array<int, 6> d;
array<string, 3> tbl = {"12431", "03520", "01540"};
auto idx=[&](int x){return distance(d.begin(), find(d.begin(), d.end(), x));};
auto half=[](int x){return x < 3 ? x : 5 - x;};... | 0 | 65,403,133 |
#include <bits/stdc++.h>
using namespace std;
int Sum(vector<int>& x) {
int ret = 0;
for (auto i : x) ret += i;
return ret;
}
int main() {
vector<int> a(4), b(4);
for (auto& i : a) cin >> i;
for (auto& i : b) cin >> i;
cout << max(Sum(a), Sum(b)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
signed main(){
int H, W, D; cin >> H >> W>> D;
vector<P> data(H * W + 1);
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int x; scanf("%d", &x);
data[x] = P(i, j);
}
}
vector<int> sum(H * W + 1, 0)... | 0 | 13,474,842 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | #include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
string ope[3];
for(int op=0;op < (1<<3);op++){
int sum = 0;
sum = s[0] - '0';
for(int i=0;i < 3;i++){
if((op >> i) & 1){
sum += s[i+1] - '0';
ope[i] = '+';
}else{
sum -= s[i+1... | 0 | 11,566,337 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
int k;
string s;
cin >> k >> s;
if(s.size(... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 61,677,910 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
string s;
std::deque<string> deq(n,"00000000000000000000000000");
std::map<string, long long int> map;
for (int i=0;i<n;i++) {
cin>>s;
for (int j=0;j<s.size();j++) {
string tmp=deq[i];
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, x;
cin >> a >> b >> x;
int tmp = 0;
bool flag = false;
tmp += a;
if (tmp != x)
{
for (size_t i = 0; i <= b; i++)
{
tmp++;
if (tmp == x)
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
}
el... | 0 | 92,387,019 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int,string>> sub(m);
rep(i,m) cin >> sub[i].first >> sub[i].second;
int ac = 0, pena = 0;
map<int,int> mp;
rep(i,m) {
int p... | 0 | 76,940,424 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1013;
int h, w;
bool used[maxn][maxn];
int d[maxn][maxn];
int main() {
char a;
cin >> h >> w;
queue < pair < int, int > > q;
for (int i = 1; i <= h; ++i) {
for (int j = 1; j <= w; ++j) {
cin >> a;
if (a == '#') {
q.push(make_... | 0 | 60,991,035 |
#include <iostream>
using namespace std;
int main(){
long long int a, b, k;
cin >> a >> b >> k;
if (a > k)
cout << a - k << " " << b;
else if (a + b < k)
cout << 0 << " " << 0;
else
cout << 0 << " " << b - k + a;
} | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
int count = 0;
while(a >= b)
{
b = b*2;
count+=1;
if(count >= k)
{
break;
}
}
if(count < k... | 0 | 77,482,791 |
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <set>
#include <deque>
#include <vector>
#define MAX 50010
#define rep(i,p) for(int i=0;i<p;i++)
#define pb push_back
using namespace std;
int n,m,temp;
std::vector<int> C;
int dp[MAX];
int main(){
cin >> n >> m;
rep(i,m) {
c... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
const int INF = 1e18, MOD = 1e9 + 7;
int x, y, a, b, c, n;
signed main() {
cin>>x>>y>>a>>b>>c;
vector<pair<int, int>> v;
for (int i = 0; i <... | 0 | 89,493,549 |
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
char map[1005][1005];
char map1[1005][1005];
int a[1005][1005];
int m,n,q,num=0;
int main()
{
int x,y;
cin>>m>>n>>q;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
x=i;
y=j;
ma... | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb pu... | 0 | 8,924,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <cstdio>
#include <vector>
using namespace std;
#define MAXN 100001
int N;
vector<int> conj[MAXN];
int visited[MAXN];
int sg(int id)
{
int ret = 0;
visited[id] = 1;
for(auto p : conj[id])
if(!visited[p])
ret ^= sg(p)+1;
return ret;
}
int main(void)
{
int i = 0;
in... | 0 | 51,350,527 |
#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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
const int A = 1000005;
int main()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> b(A);
rep(i,n){
cin >> a[i];
++b[a[i]];
}
bool ispw = true;
for(int i=2; i<A; ++i){
int cnt = 0;
fo... | 0 | 80,167,438 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define pb push_back
#de... | 0 | 83,520,253 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;
const long long OO = 1e18+25;
#define f first
#define s second
int n,m,a[N], x,y, dsu[N], cnt;
int findparent(int u)
{
if(u == dsu[u]) return u;
return dsu[u] = findparent(dsu[u]);
}
void merge(int u... | #include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
string t;cin >> t;
string ty,tm,td={};
int j = 0;
for(int i = 0... | 0 | 23,624,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
con... | 0 | 7,845,297 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 50,306,031 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[200010];
int ans[100010];
bool vis[100010];
void bfs(int rt)
{
vis[rt]=1;
queue<int>q;
q.push(rt);
while(!q.empty())
{
int adj=q.front(); q.pop();
for(auto x: g[adj])
{
if(vis[x]==0)
{
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define VI vector<int>
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define db double
#define all(x) (x).begin(),... | 0 | 98,428,907 |
#include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
#define yes_or_no(flag) if (flag) { println("Yes"); } else { println("No"); }
int main() {
int A, B;
cin >> A >> B;
int count = 0;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int x = s.size() / 2;
bool... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | 0 | 11,995,115 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstdlib>
typedef long long ll;
using namespace std;
#define M 1020751
long long convert(string word);
void insert(long long *d,long long key);
int find_key(long long *d,long long key);
int h1(long long key)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const int MOD = 1000000007;
const int MAX = 100000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> in... | 0 | 60,157,593 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.