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;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll... | #include<bits/stdc++.h>
int main(){
int n;
scanf("%d", &n);
char fie[n][n];
for(int i=0; i<n; i++) scanf("%s", fie[i]);
int ans = 0;
for(int i=0; i<n; i++){
int cnt = 0;
for(int j=0; j<n; j++){
for(int k=j; k<n; k++)... | 0 | 4,515,934 |
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define fore(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define pb push_back
#define fi first
#define se second
#defin... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 35,987,624 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a ,b;
cin >> a >> b ;
int d = a/b;
int r = a%b;
long double f = (long double)(a)/b;
cout << d << " " << r << " " << showpoint << fixed << setprecision(12) << f << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(),a.end());
int dup=0;
for... | 0 | 7,407,749 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int search(int key, vector<int> a){
int right = a.size();
int left = 0;
while(right >= left){
int middle = left + (right - left) / 2;
if(a[middle] == key) return middle;
e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct jie
{
int x,w;
}mp[100005];
int a[100005],b[100005];
int main()
{
int n,l,T,ans=0,i;
scanf("%d %d %d",&n,&l,&T);
for(i=0;i<n;i++)
{
scanf("%d %d",&mp[i].x,&mp[i].w);
}
for(i=0;i<n;i++)
{
if(mp[i].w... | 0 | 43,313,127 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<ll> v(n+1);
v[0] = 2;
v[1] = 1;
for(int i = 2; i <= n; i++){
v[i] = v[i-1] + v[i-2];
}
cout << v[n] << end... | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a)... | 0 | 3,255,354 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct store
{
ll can;
ll price;
};
bool compare( struct store a , struct store b)
{
return a.price< b.price;
}
int main()
{
ll n;
cin>>n;
ll m;
cin>>m;
store* shop = new store[n];
for(ll i=0; i < n; i++)
{
... | 0 | 68,282,178 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, R;
cin>>n>>m>>R;
int r[R];
for (int i=0; i<R; i++) {
cin>>r[i];
--r[i];
}
int d[n][n];
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if (i != j) {
d[i][j] = 1e9;
} else {
d[i][j] = 0;
}... | #include <iostream>
#include <set>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int s;
set<int> a;
cin >> s;
int p;
for (int i = 1; i < 1000000; ++i) {
if (i == 1) {
a.insert(s);
p = s;
continue;
}
if (p % 2 == 0) {
s = p / 2;
} else {... | 0 | 6,739,114 |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,l... | #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 LL long long
int n;
vector<pair<LL,LL>> v;
pair<LL,LL> myplus(pair<LL,LL> p, LL d, int rot){
if(rot==0){
p.first -= d;
}else if(rot==1){
p.first += d;
}else if(rot==2){
p.sec... | 0 | 77,233,784 |
#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>... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ... | 0 | 52,753,366 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include <stdio.h>
int main() {
char x[102];
char g[102];
scanf ("%s %s", x, g);
printf("%s%s", g ,x);
return 0;
} | 0 | 97,188,815 |
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (a%b == 0) return(b);
else return (gcd(b,a%b));
}
long long lcm (long long a, long long b) {
long long g = gcd(a,b);
return a / g * b;
}
int main(void){
int n;
cin >> n;
long long ans = 1;
for(int i = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
sort(all(a));
vector<bool> ok(10000... | 0 | 95,322,124 |
#include <iostream>
using namespace std;
int main(){
int d=1, n, k;
cin >> n >> k;
while(n!=0){
d = min(d*2,d+k);
n--;
}
cout << d << endl;
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n... | 0 | 75,477,609 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define ull unsigned long long
using namespace std;
inline ll in()
{
ll Req = 0, wX = 0; char ch;
while (!isdigit(ch)) {wX |= (ch == '-'); ch = getchar();}
while (isdigit(ch)) {Req = (Req << 3) + (Req << 1) + (ch ^ 48); ch = getchar();}
return wX... | #include <iostream>
using namespace std;
#include <stdio.h>
#include <algorithm>
#include <string>
int main(void)
{
string str;
string command;
string print ="print";
string replace ="replace";
string reverse ="reverse";
string p ;
int a , b;
int q ;
string rrr;... | 0 | 67,733,080 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL I... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
int mod = (int) 1e9 + 7;
int main(){
int x, n;
cin >> x >> n;
if(n == 0){
cout << x << "\n";
return 0;
}
... | 0 | 44,750,398 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n;
cin >> n;
vector<double> c(n), s(n), f(n);
for(int i=1; i<=n; i++){
cin >> c[i] >> s[i] >> f[i];
}
for(int i=1; i<=n; i++){
double time = 0;
time += s[i] + c... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | 0 | 39,228,156 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
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; }... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | 0 | 75,594,469 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 82,407,149 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(3);
cin>>v[0]>>v[1]>>v[2];
sort(v.begin(),v.end());
cout<<-v[0]+v[2]<<endl;
} | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define rep(i,n) for(ll i=0;i<n;i++)
#define repr(i,n) for(ll ... | 0 | 73,515,016 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long A, long long B, long long K) {
if (K >= A) {
cout << 0 << " ";
K -= A;
} else {
cout << A - K << " ";
K = 0;
}
if (K >= B) {
... | 0 | 9,991,737 |
#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 <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <string>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include <iomanip>
#include <tuple>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#defi... | 0 | 19,184,387 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) {
cin >> h[i];
}
int ans, cnt;
ans = cnt = 0;
rep(i,n-1) {
if(h[i] >= h[i+1... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int A=S.at(0)-'0';
int B=S.at(1)-'0';
int C=S.at(2)-'0';
int D=S.at(3)-'0';
if(A-B-C-D==7){
cout << A << "-" << B << "-" << C << "-" << D << "=7" << endl;
}
else if(A-B-C+D==7){
cout << A << "-" << B << "-" << C << "+... | 0 | 78,369,746 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> l(N);
for (auto& v : l) {
cin >> v;
}
sort(l.begin(), l.end(), greater<int>());
int ans = 0;
for (int i = 0; i < K; ++i) {
ans += l[i];
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | 0 | 58,464,631 |
#include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
bool no=false;
if(s[0]!='A'){
no=true;
}
bool inside=false;
for(int i=1;i<s.size();i++)
{
if(s[i]>='A'&&s[i]<='Z'){
if(!inside&&s[i]=='C'&&(i>=2&&i<=s.size()-2)){
inside=true... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
inline void io()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
}
int main()
{
io();
int n;
cin >> n;
int mx = 0;
int ans = 0;
for (int ... | 0 | 69,851,871 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 56,892,008 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string s; cin >> s;
ll cnt = 0;
for(int i = 1; i < s.size(); i++){
if(s[i - 1] != s[i]) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 0 | 46,272,876 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
signed main() {
int N; cin >> N;
vector<int> A(N);
rep(i, N) {
int a; cin >> a;
if(i == 0) A[i] = a;
else A[i] = A[i-1]+a;
}
int ans = 0;
uno... | #include <iostream>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
#define ll long long
int main()
{
ll N, M;
std::cin >> N >> M;
std::vector<ll> A(M);
for(ll i=0; i < M; i++) {
std::cin >> A[i];
}
ll sum = 0;
for(ll i=0; i < M; i++) {
sum += A[i];
... | 0 | 20,985,916 |
#include <iostream>
#include <string>
#include <queue>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
int n;
cin >> n;
int cnt = 0;
int building[12][10] = {{0}};
int b, f, r, v;
int left, right = 0;
for(int i=0; i<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K;
cin >> N >> K;
vec<ll> A(N),B... | 0 | 76,436,894 |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char y = 'A';
for (int i = 0 ; i < h; i++) {
for (int j = 0; j < w; j++) {
string su;
cin >> su;
if (su == "snuke") {
i++;
y += j;
... | 0 | 93,787,567 |
#include <stdio.h>
#include <iostream>
#include <limits>
#include <cstdint>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <bitset>
#include <array>
#include <string.h>
#include <stack>
#include <queue>
#include <stdint.h>
#include <sstream>
#include <map>
#include <set>
#include <l... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
int n; scanf("%d", &n);
ll ans = 0;
for (ll i = 1; i <= n; i++) {
ans += (i * (n - i + 1));
}
for (int i = 1; i < n; i++) {
ll u, v; scanf("%lld %lld", &u, &v);
if (u > v) swap(u, v);
ans... | 0 | 99,718,768 |
#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)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n, d;
cin >> n >> d;
vector<vector<ll>> x... | #include<iostream>
#include<vector>
#include<cmath>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define INF 1000000
#define N 10
int main() {
int n;
while (1) {
cin >> n;
if (n==0)break;
int dp[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dp[i][j] = ... | 0 | 37,778,180 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int ans = 0;
for(int i=0;i<N;i++){
int X;
int A,B;
cin>>A>>B;
X = B-A+1;
ans+=X;
}
cout<<ans<<endl;
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | 0 | 76,767,316 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int xs[] = {0, 1, 0, -1}, ys[] = {1, 0, -1, 0};
char c[108][108];
int w, h;
bool come[108][108];
int dfs(int x, int y){
if(x < 0 || y < 0 || x >= h || y >= w)return 0;
if(c[x][y] == '#')return 0;
if(come[x][y])return 0;
come[x][y] = true;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using ll = long long;
int main() {
int x , n;
cin >> x >> n;
vi p(102);
... | 0 | 54,376,711 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> as(n + 1), bs(n);
rep(i, n + 1) cin >> as[i];
rep(i, n) cin >> bs[i];
ll ans = 0;
rep(i, n) {
if (as[i] <= bs[i]) {
ans += as[i];
... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=10000;
const double INF=1000000000;
const int MAX=100001;
int main(){
ll w,h;
cin>>w>>h;
vector<P> v;
for(int i=0;i<w;i++){
ll p;cin>>p;
v.pus... | 0 | 90,150,690 |
#include <iostream>
#include <vector>
using namespace std;
class Shape {
public:
int H;
int W;
Shape(int H, int W) {
this->H = H;
this->W = W;
}
};
int main(void) {
int H, W;
vector<Shape> shapeList;
while(true) {
cin >> H >> W;
if((H == 0) && (W == 0)) break;... | #include<stdio.h>
#include<string.h>
int main() {
int i,a,len;
char st[1201];
int num;
int alp[26]={0};
while(scanf("%s",st) != EOF) {
a=0;
len = strlen(st);
while(1) {
num = st[a]-'a';
if(st[a] >= 97 && st[a] <=122) {
alp[num]++;
... | 0 | 37,773,007 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long double d;
cin >> d;
d/=3;
cout << fixed << setprecision(9);
cout << d*d*d;
} | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la;
usi... | 0 | 94,640,665 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define mod 1000000007
#define INF 1000000000000
#define F first
#define S second
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int n,k;
set<int>st;
int ans... | 0 | 100,673,642 |
#include <iostream>
using namespace std;
int main() {
int n, m;
char table[256];
while (cin >> n, n) {
for (int i = 0; i < 256; i++)
table[i] = 0;
for (int i = 0; i < n; i++) {
char a, b;
cin >> a >> b;
table[a] = b;
}
cin >> m;
for (int i = 0; i < m; i++) {
char a;
cin >> a;
if (table... | #include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[... | 0 | 96,095,265 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 40,418,038 |
#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;
}
void print() { cout << "\n"; }
t... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
#define rep2(i,a,n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int N; cin >> N;
string S; cin >> S;
int res = 0;
for (int i = 0; i <= 999; i++) {
int fd = i % 10;
int sd = (i / 10) % 10;
int ... | 0 | 44,845,204 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
string s;
string ab = "56789";
string ac = "321";
cin>>s;
if(s[5]=='1'){cout<<"TBD"; return 0;}
if(s[5]=='0'){
for(int i=0;i<5;i++){
if(s[6]==ab[i]){cout<<"TBD"; return 0;}
... | #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... | 0 | 93,679,699 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define pb push_back
using namespace std;
const int P=139;
const int mod=998244353;
const int maxn=1e6+5;
typedef long long ll;
const int inf=0x3f3f3f... | 0 | 2,193,534 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int k[m];
vector<vector<int>> s(m);
for(int i=0;i<m;i++){
cin >> k[i];
s[i].resize(k[i]);
for(int j=0;j<k[i];j++){
cin >> s[i][j];
--s[i][j];
}
}
int ans=0;
vector<int> p(m);
for(int i=0;i<m;i... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<bool> alphabet(26,true);
int num;
for(int i=0; i<s.size(); i++){
num=s.at(i)-'a';
alphabet.at(num)=false;
}
for(int i=0; i<27; i++){
if(i<26){
if(alphabet.at(i)){
... | 0 | 89,827,652 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _... | 0 | 27,916,300 |
#include <iostream>
using namespace std;
int main() {
int r; cin>> r;
int D; cin>> D;
int wt; cin>>wt;
for(int a=1; a<11; a++){
wt= (r*wt)-D;
cout<< wt<< endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define m 1046527
#define L 14
char T[m][L];
int h1(long long key){
return key%m;
}
int h2(long long key){
return 1+key%(m-1);
}
int h(long long key, int i){
return (h1(key)+i*h2(key))%m;
}
int charTonum(char c){
switch(c){
case 'A':
retu... | 0 | 2,775,199 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
int a[100000];
int main() {
int n, k;
while (cin >> n >> k && n != 0) {
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int sum = 0, ans = 1 << 31;
for (int l = 0, r = 0; ... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 84,208,371 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
bool solve(){
int coin[6] = {500,100,50,10,5,1};
while(1){
int in;
cin>> in;
if(!in) b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 0 | 85,920,148 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,k,s;
cin >> n >> k >> s;
int inf = 1e9;
if(s == inf) inf--;
for(int i = 0; i < k; i++) cout ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 5,986,147 |
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 41,791,334 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int main()
{
int a,b,c,d;cin>>a>>b>>c>>d;
int x=c... | #include <iostream>
using namespace std;
void CountingSort(int A[], int B[], int n, int k)
{
int* C = new int[k + 1];
for (int i = 0; i < k + 1; ++i)
{
C[i] = 0;
}
for (int i = 0; i < n; ++i)
{
C[A[i]]++;
}
for (int i = 1; i < k+1; ++i)
{
C[i] = C[i - 1] + C[i];
}
for (int i = n - 1; i >= 0; --i)
{
... | 0 | 26,564,959 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | 0 | 94,389,898 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>a(n+1);
for(int i=0;i<=n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=0;
for(int i=1;i<=n;i++)
{
ans=__gcd(ans,(a[i]-a[i-1]));
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int x,y,temp;
while(1){
cin >> x >> y;
if(x==0 && y==0) break;
if(x < y){
cout << x << " " << y << endl;
}
else{
temp=x;
x=y;
y=temp;
cout << x << " " << y <<... | 0 | 49,943,326 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
int i,j;
cin >> str;
string st="";
for( i=str.size()-1; i>=0 ; i-- )
st+=str[i] ;
cout << st << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | 0 | 86,657,031 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
map<int,ll> m,f;
int N;
ll X;
ll solve(int n, ll x){
if(x == 1){
if(n == 0){
return 1;
} else {
return 0;
}
}
if(x <= 1 + m[n-1]){
return solve(n-1, x-1);
}
... | 0 | 36,236,062 |
#include <iostream>
#include <stdio.h>
double sqrt(double number, const int& SIGNIFICANT_DIGITS);
int main(){
double x1, x2, y1, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
printf("%0.5f\n", sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2), 10));
return 0;
}
double sqrt(double number, const int& SIGNIFICANT_DIGITS){
doubl... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
signed main() {
int n,m,x;
cin>>n>>m>>x;
int c[n];
vector<vector<int>> v(n,vector<int>(m));
for(int i=0;i<n;i++)
{
cin>>c[i];
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
int ans=IN... | 0 | 90,320,117 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 7,656,904 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
string num;
while (cin >> num && num[0] != '0') {
int sum = 0;
for (int i = 0; i < num.size(); i++) {
sum += (num[i] - '0');
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> ki(100005,0), gu(100005,0);
cin >> n;
for (int i = 1; i <= n; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
gu[v]++;
}
else {
ki[v]++;... | 0 | 52,392,395 |
#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 ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FRE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b)... | 0 | 75,114,611 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> coin(m);
int max = 0;
for(int i = 0; i < m; i++){
cin >> coin[i];
}
sort(coin.begin(), coin.end());
vector<unsigned int> coin_nums(n+1, -1);
coin_... | #include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#define endl "\n"
using namespace std;
int main()
{
string s;
cin >> s;
int i;
for(i = 0; i < s.length() - 1; i ++)
{
if(s[i] == s[i + 1])
{
cout << i + 1 << " " << i + 2;
break;
}
... | 0 | 89,740,576 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(void)
{
int n, m, l=1, r;
cin >> n >> m;
r = n;
rep(i,m){
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, r-l+1) << endl;
return 0;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vecto... | 0 | 62,350,475 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int LLI;
string check(char s[], char t[], int s_size, int t_size)
{
int smaller = s_size > t_size ? t_size : s_size;
for(int i = 0; i < smaller; i++)
if( s[i] > t[t_size - i - 1] )
return "No";
else if( s[i] < t[t_size - 1 - i] )
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int k, x;
cin >> k >> x;
cout << (k * 500 < x ? "No" : "Yes");
}
int main()
{
fastio;... | 0 | 37,490,457 |
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int main()
{
int a, b, c, d, e;
while (cin >> a >> b >> c >> d >> e, a || b || c || d || e) {
int f[100];
for (int k = 0; k < a; k++)scanf("%d", &f[k]);
int sum = 0;
for (int i = 0; i <= 10000; i++) {
if (e == f[sum]) {
if (sum +... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n ;
cin>>n;
int* b = new int[n]();
for(int i=1;i<=n-1;i++)
{
cin>>b[i];
}
ll sum =0;
int* a = new int[n+1]();
a[1] = b[1];
for(int i=2;i<=n-1;i++)
{
a[i] = min( b[i-1] , b[i] )... | 0 | 17,713,667 |
#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 A, B;
cin >> A >> B;
cout << 6 - A - B << endl;
return 0;
} | #include <bits/stdc++.h>
#define max 1010
using namespace std;
struct edge{
int cost;
int to;
int from;
};
edge miti[max];
struct p_que{
int heap[max];
int index[max];
int now;
};
int cost[max];
struct p_que* make();
void push(p_que *p, int num,int id);
int smal(p_que *p,int p_id);
int pop(p_que *p);
void dainyu(... | 0 | 18,393,223 |
#include<iostream>
using namespace std;
int main(){
int n,k;
while(1){
int a[100000];
cin>>n>>k;
if(n==0&&k==0)break;
int max=0,sum;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
sum=0;
if(i+k-1<n){
for(int j=0;j<k;j++){
sum+=a[i+j];
}
if(max<sum){
max=sum;
... | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
const unsigned int M = 1000000007;
int main() {
int n,m;
cin>>n>>m;
vector<vector<char>> matrix(n,vector<char>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>matrix[i][j];
}
}
int dp... | 0 | 50,767,714 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
ll c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long sum_A = 0, sum_B = 0;
vector<long long> A(N), B(N);
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
sum_A += a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
long... | 0 | 34,709,493 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
int main(){
int n;
string a,b;
cin>>n>>a>>b;
if(a==b){
cout<<n<<endl;
return 0;
}
if(n==1&&a!=b){
cout<<2<<endl;
return 0;
}
int kazu=0;
int saidai=0;
rep(i,n){
string bubun=b.sub... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 6,693,155 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int l1=s.size(),l2=t.size();
int mi_cnt=l2;
for(int i=0;i+l2-1<l1;i++)
{
int cnt=0;
for(int j=0;j<l2;j++)
{
if(t[j] != s[i+j])
cnt++;
}
mi_cnt=min(mi_cnt,cnt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 | 25,948,364 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n);
vector<vector<int>> M(n, vector<int>(n));
for (int i = 0; i < n; i++) {
int node;
int d;
cin >> node >> d;
node--;
for (int j = 0; j < d; j++) {
int tmp;
cin >> tmp;
tmp--;
... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int main() {
int N;
cin >> N;
i64 S = 0;
vector<i64> s(N);
for(int i = 0; i < N; i++) {
cin >> s[i];
S += s[i];
if(i) s[i] ... | 0 | 75,574,792 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i,a,n) for(int (i)=a;(i)<(int)(n);(i)++)
#define rrep(i,a,n) for(int (i)=(n)-1;(i)>=a;(i)--)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main()... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pll pair<int , int>
#define int long long int... | 0 | 39,699,042 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define pb push_back
#define len(x) (int)(x).size()
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 10;
#define in... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << ... | 0 | 79,497,317 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>; ... | 0 | 66,786,939 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll X, t;
cin >> X >> t;
ll ans = X - t;
if (ans < 0) ans = 0;
cout << ans << 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 | 95,423,296 |
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 51,653,191 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main(void){
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ma = max(a*c,b*d);... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 0 | 73,641,805 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
printf("%f %d\n", 0.5 * W * H, W * 0.5 == x && H * 0.5 == y);
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n, m;
cin>>n>>m;
vector<pair<int, int> > v(n);
rep(i, n){
int a, b;
cin>>a>>b;
v[i] = make_pair(b, m-a);
}
sort(v.begin(), v.end());
revers... | 0 | 55,384,851 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> orderedSet... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(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) cout<<a[0];for... | 0 | 1,394,668 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,m;
cin>>n>>m;
cout<<min(n,m/2)+(m-min(n,m/2)*2)/4<<endl;
} | #include <bits/stdc++.h>
using namespace std;
bool isPrime(int x) {
if(x == 1) return false;
for (int i = 2; i < x; i++) {
if(x % i == 0) return false;
}
return true;
}
int main() {
int n;
cin >> n;
vector<int> Prime;
for (int i = 2; i <= n; i++) {
if(isPrime(i)) Prime.pu... | 0 | 22,378,270 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
while(1){
int k=0;
cin>>a>>b;
if(a==0&&b==0)break;
for(int i = 1;i<=a;i++){
for(int j = i+1;j<=a;j++){
for(int l = j+1;l<=a;l++){
if(b==i+j+l){
k++;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | 0 | 6,706,923 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
typedef long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}... | 0 | 56,107,568 |
#include <stdio.h>
#include <string.h>
int dp[2][51];
int main()
{
while(1)
{
int n;
if(EOF == scanf("%d",&n))
{
break;
}
int now = 0;
for(int i = 0; i <= 50; i++)
{
dp[now][i] = 0;
}
dp[now][0] = 1;
for(int k = 0; k < 4; k++)
{
int nex = (now + 1) % 2;
for(int i = 0; i <= 50; i++)
... | #include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | 0 | 66,421,344 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[4];
for(int i=0;i<4;++i) cin >> s[i];
sort(s,s+4);
if(s[0]==s[1]&&s[2]==s[3]&&s[1]!=s[2]) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
struct edge {
ll to, cost;
... | 0 | 56,491,208 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
#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 FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | 0 | 81,552,933 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i=0; i<n; i++){
cin>> arr[i];
}
if (n%2==0){
for (int i=n-1; i>=0; i--){
if (i%2==1) cout << arr[i]<<' ';
}
for (int i=0; i<n; i++){
if (i%2==0) cout << arr[i]<<' ';
}
}... | #include <iostream>
#include <algorithm>
#include <vector>
#include <complex>
using namespace std;
int main(){
int n;
complex<int> c;
vector< complex<int> > v;
vector<int> srt;
while( cin>>n ){
if( v.size()==0 ){
c.real() = n;
c.imag() = 1;
v.push_back( c );
}else{
for( unsigne... | 0 | 4,315,084 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define ld long double
#define PB push_back
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define pii pair <int , int>
#define pll pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
int N,i,n,a[100001]={0},b[100001]={0},t;
cin>>N;
for(i=1;i<=N;i++){
cin>>n;
a[i]=n;
}
for(i=1;i<=N;i++){
t=a[i];
b[a[t]]=t;
}
for(i=1;i<=N;i++){
cout<<b[i]<<" ";
}... | 0 | 13,223,701 |
#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; i >= 0; i--)
const ll INF = 1000000000000000000;
int A,B,C,K;
int cnt;
int main(){
cin >> A >> B >> C >> K;
while (A >= B){
cnt++;
... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 96,037,503 |
#include<bits/stdc++.h>
#define M 1000003
using namespace std;
int n,d[M];
string str,key;
int stoi(string s){
int r=0;
for(int i=0;i<s.size();i++){
if(s[i]=='A')r=r*4+1;
if(s[i]=='C')r=r*4+2;
if(s[i]=='G')r=r*4+3;
if(s[i]=='T')r=r*4+4;
}
return r;
}
void insert(int k){
int i=0,f=0;
while(!f... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
long long ans1 = 0, ans2 = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
if (ans1 == 0) {... | 0 | 62,062,047 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll X;
scanf("%lld", &X);
ll r =... | #include <iostream>
#include <stdio.h>
using namespace std;
int tmp,D[100]={},ans;
void north(){
tmp=D[0];
D[0]=D[1];
D[1]=D[5];
D[5]=D[4];
D[4]=tmp;
}
void south(){
tmp=D[0];
D[0]=D[4];
D[4]=D[5];
D[5]=D[1];
D[1]=tmp;
}
void east(){
tmp=D[0];
D[0]=D[3];
D[3]=D[5];
... | 0 | 83,761,468 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
int i = min(A, B);
while (i > 0)
{
if (A % i == 0 && B % i == 0)
{
cnt++;
}
if (cnt == K)
{
break;
}
i--;
}
cout << i << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1e... | 0 | 91,637,268 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include <bits/stdc++.h>
#define il inline
#define rg register
using namespace std;
typedef long long LL;
const LL m_63=1061109567;
const LL m_127=2139062143;
const int inf=2147483647;
const double pi=atan(1.0)*4.0;
const LL llf=9223372036854775807;
const LL N=1e6+7;
const int M=1e6;
int n,d[N],flag[N];
int num,b[N],w[... | 0 | 69,466,749 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,m;
cin >> n >> m;
vec a(n),b(m);
for(ll i=0;i<n;i++) cin >> a[i];
for(ll i=0;i<m;i++) cin >> b[i];
mat dp(n... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
ll ok[12345678], cost[12345678];
signed main() {
ll n, m, l, r, d, z = 0, ans = 0;
cin >> n >> m; map <ll, map<ll, ll>> ma;
vector<vector<ll>> G(123456);
queue<ll> que;
if (m =... | 0 | 79,307,293 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>
#include <set>
using ll = long long;
using namespace std;
typede... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 97,588,634 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string a, b;
cin >> a >> b;
reverse(a.begin(), a.end());
if(a == b) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,v) VL v(n);rep(i,n)cin>>v[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#d... | 0 | 34,070,320 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <climits>
#include <string>
#include <cmath>
using namespace std;
using ll = long long int;
#define NUM 1000000007
int main(){
char c;
vector<bool> v(3);
for(int i=0; ... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll n;
string s;
cin>>n>>s;
ll now=0,mn=0;
rep(i,n){
... | 0 | 75,654,089 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K)
{
ll max_K = (N - 1) * (N - 2) / 2;
if (K > max_K) {
cout << -1 << endl;
return;
}
cout << N - 1 + max_K - K << endl;
for (ll i = 2; i <= N; i++) {
cout << 1 << " " << i <... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typede... | 0 | 14,468,252 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
int32_t main(){
int t,o;
cin >> t >> o;
if(t*500 >= o)
cout << "Yes\n";
else
cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll r[10],c[10];
ll cntr[(1<<10)],cntc[(1<<10)];
string s[10];
bool rr[10],cc[10];
int main() {
ll H,W,K;
cin>>H>>W>>K;
for(ll i=0;i<H;i++) cin>>s[i];
ll sum=0;
for(ll i=0;i<H;i++){
for(ll j=0;j<W;j++){
if(s[i][j]... | 0 | 32,802,426 |
#include <cstdio>
#include <cstdlib>
typedef struct Node
{
int key;
struct Node* prev;
struct Node* next;
} Node;
Node* head;
void initNode()
{
head = (Node*)malloc(sizeof(Node));
head->prev=head;
head->next=head;
}
void insertFirst(int key)
{
Node* x=(Node*)malloc(sizeof(Node));
x->key=key;
x->next=head->next... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int x,n,i=0,j,c=0,p,mita[1000] ={0};
cin >> x >> n;
for(i=0;i<n;i++)
{
cin >> p;
mita[p]=1;
}
if(mita[x]==0)
{
cout << x << endl;
return 0;
}
for(i=1;i<=n;i++)
{
if(mita[x-i]==0... | 0 | 6,522,557 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B, C, K, ans;
cin >> A >> B >> C >> K;
if (A >= K) ans = K;
else if (A + B >= K) ans = A;
else ans = 2 * A + B - K;
cout << ans << 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) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | 0 | 57,246,134 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main(){
string S;
cin >> S;
if (... | #include<iostream>
int main(){
int n;
std::cin >> n;
int a[n+1];
for(int i=1;i<=n;i++)
std::cin >> a[i];
bool f=0;
int t=0;
int i=1;
while(t!=n){
if(a[i]==2){
t++;
f=1;
break;
}
else{
i=a[i];
}
t++;
}
f==1?std::cout << t : std::cout << "-1";
return 0... | 0 | 33,621,843 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 58,737,127 |
#include<bits/stdc++.h>
using namespace std;
long long A[200005];
map<long long, long long> memo;
int main(){
long long N;
cin >> N;
for(long long i = 0; i < N; i++) {
cin >> A[i];
A[i]--;
memo[A[i]]++;
}
long long base = 0;
for(auto item: memo) {
base += ((item.second) * (item.second - 1)) /2;
}
for(lo... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 11,975,622 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
string s;
cin >> s;
if (s.at(5) == '0' && s.at(6) >= '1' && s.at(6) <= '4')
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int MAX_V = 100;
vector<vector<int>> d(MAX_V, vector<int>(MAX_V, I... | 0 | 4,701,010 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.