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;
using ll = long long;
int main()
{
ll k, a, b; cin >> k >> a >> b;
ll cur = 0;
if(a < b) {
ll tim = k - (a - 1);
if(tim >= 2) {
cur += b;
}
cur += ((tim - 2) / 2) * (b - a);
cur += (tim % 2);
}
cout << m... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b) f... | 0 | 89,378,931 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 | 93,269,972 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 1, vector<int>());
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
int main() {
int N,K;
... | 0 | 68,029,293 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 h, w;
int n;
cin >> h >> w >> n;
map<tuple<int, int>, int> m;
for (int i = 0; i < n; i++) {
int r, c;
cin >> r >> c;
r--;
c--;
for... | #include <iostream>
#include <vector>
int main() {
using std::vector;
constexpr int inf = 1e9;
int n, m;
std::cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, inf));
for (int i = 0; i < n; i++) {
d.at(i).at(i) = 0;
}
vector<int> a(m), b(m), c(m);
for (int i = 0; i < m; i++) {
std::cin >>... | 0 | 58,363,660 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
map<int,int> mp;
ll tot = 0, ans = 0;
++mp[0];
for(int i=0; i<n; ++i){
int x;
cin >> x;
tot += x;
tot %= m;
ans += mp[tot];
++mp[tot];
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n + 1, -1);
queue<int> q;
dp[0] = 0;
q.push(0);
while(!q.empty()) {
int temp = q.front();
q.pop();
if (temp + 1 <= n && dp[temp + 1] < 0) {
dp... | 0 | 13,739,477 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n){
if(n<=1)return false;
for(int i=2;i<=1001000;i++){
if(n%i==0)return false;
}
return true;
}
int main(){
long long n;
cin >> n;
long long f[1001001];
for(int i=0;i<1001001;i++)f[i]=0;
long long a = n;
... | 0 | 4,175,206 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n; scanf("%d", &n);
int sum = (999 / 3) * 200 + (999 - 999 / 3) * 195 + 1;
rep(i, n) {
int y, m, d; scanf("%d%d%d", &y, &m, &d);
int ans = sum; y--; m--;
ans -= (y / 3) * 200 + (y - y / 3) * 195;
if ((y + 1) % ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | 0 | 40,723,508 |
#include<bits/stdc++.h>
using namespace std;
long long n;
long long r[110], c[110];
vector<vector<long long>> dp(110, vector<long long>(110, -1));
long long rec(long long l, long long m){
if(dp[l][m] != -1) return dp[l][m];
if(l + 1 == m) return dp[l][m] = r[l] * c[l] * c[m];
else if(l == m) return dp[l][m]... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; i++)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; i--)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch... | 0 | 37,448,665 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 79,040,863 |
#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 NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | #include<bits/stdc++.h>
using namespace std;
#define O_O ios_base::sync_with_stdio(0); cin.tie(NULL)
#define endl '\n'
#define PI acos(-1.0)
#define CASE(n) cout << "Case " << n << ": "
#define CASE_(n) cout << "Case " << n << endl
#define FIXED(n) cout << fixed << setprecision(n)
#define MOD 1000000007
inline void nor... | 0 | 20,820,975 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N , arr[200003]; cin >> N;
for(int i = 1 ; i <= 2 * N ; ++i) cin >> arr[i];
sort(arr + 1 , arr + 2 * N + 1); long long sum = 0;
for(int i = 1 ; i <= 2 * N ; i += 2) sum += arr[i];
cout << sum; return 0;
} | 0 | 69,447,027 |
#include<iostream>
using namespace std;
int main() {
string s; cin >> s;
bool a = false, b = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')a = true;
if (s[i] == 'B')b = true;
}
cout << (a & b ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define mp make_pair
#define endl "\n"
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define lb lower_bound
#define forn(i,n) for(ll i=0 ; i<n ; i++)
#define arr(a,n) for(ll i=0;i<n;i++){ cin>>a[i]; }
#define ub upper_bound... | 0 | 54,295,712 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 32,523,900 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;
int main(void){
string s; cin >> s;
int w[s.... | 0 | 10,888,492 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
(x<1200)?cout<<"ABC":cout<<"ARC";
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
char get_best_action(char tc) {
if(tc == 'r') {
return... | 0 | 49,353,559 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), ... | 0 | 97,695,576 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(a-c) <= d){
cout << "Yes";
return 0;
}
if(abs(a-b) <= d && abs(b-c) <= d){
cout << "Yes";
}
else
{
cout <<... | #include <iostream>
#include <cmath>
using namespace std;
const int Max = 100;
const int Min = -100;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if((W > 0 && W <= Max) && (H > 0 && H <= Max) && (r > 0 && r <= Max))
{
if((0 <= (x-r)) && (0 <= (y-r)) && ((x+r) <= W) && ((y+r) <= H))
cout << ... | 0 | 1,323,850 |
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
printf("%dx%d=%d\n", a, b, a*b);
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++)
{
cin >> x[i];
}
int l, q;
cin >> l >> q;
vector<vector<int>> dp(31, vector<int>(n+1));
for(int i = 0; i < n; i++)
{
... | 0 | 100,351,265 |
#include <iostream>
using namespace std ;
using ll = long long ;
int main(){
ll a,b,k ;
cin >> a >> b >> k ;
for(int i=0;i<k;i++){
if(i&1){
b -= (b&1) ;
a += b/2 ;
b /= 2 ;
}else{
a -= (a&1) ;
b += a/2 ;
a /= 2 ;
}
}
cout << a << " " << b << endl ;
} | #include<bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false)
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define mst(a,n) memset(a,n,sizeof(a))
#define dbg(a, b) ... | 0 | 53,608,862 |
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main() {
int n,k;cin >>n>>k;
string s;cin >>s;
vector<int>num;
int now=1;
int cnt=0;
for (int i = 0... | 0 | 30,989,886 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
int main()
{
int n, T = 0, H = 0, Bool = 1;
char a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a >> b;
for (int j = 0; a[j] != '\0' && b[j] != '\0'; j++){
if (a[j] > b[j]) { T += 3; Bool = false; }
if (a[j] < b... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int count_sw = 0;
void ss(int A[],int N){
for (int i = 0; i < N-1; i++) {
int min = A[i];
int k = i;
for (int j = i+1; j < N; j++) {
if (min > A[j]) {
min = A[j];
... | 0 | 77,795,916 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 7600000000LL;
int main(){
int T; scanf("%d", &T);
while(T--){
ll a, b, ans = 0; scanf("%lld%lld", &a, &b);
if(a==b) ans = 2*a-2;
else{
ll sq = sqrt(a*b);
if(sq*sq == a*b) sq--;
... | 0 | 13,747,152 |
#include<iostream>
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int n ;
cin >> n ;
int a[n+2] ;
a[0] = 0 ;
a[n+1] = 0 ;
int sum = 0 ;
for(int i=1;i<=n;i++){
cin >> a[i] ;
sum+= abs(a[i]-a[i-1]) ;
}
... | #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 | 1,176,491 |
#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 M = 1000002;
int main() {
ll n;
cin >> n;
vector<int> array(M);
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) {
if(array[a[i]] != 0){
array[a[i]] = 2;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 39,318,372 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
ll gcd (ll a, ll b) {
if (b > a) {
ll tmp = b;
b = a;
a = tmp;
}
if (b == 0) return a;
return gcd(b, a % b);
}
int main(){
int N;
cin >> N;
vect... | 0 | 13,321,192 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
int a[n + 1], b[n + 1];
for(int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
}
b[n] = 0;
ll total = 0;
for(int i = 0; i < n + 1; i++) {
int mn = min(a[i], b[i]);
a[i... | #include <bits/stdc++.h>
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end();
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}... | 0 | 47,573,791 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, len, minLen, index;
cin >> n >> m;
vector<int> a(n), b(n), c(m), d(m);
for (i = 0; i < n; i++) cin >> a[i] >> b[i];
for (i = 0; i < m; i++) cin >> c[i] >> d[i];
for (i = 0; i < n; i++) {
minLen = INT_MAX;
for (j = 0; j < m; j... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 30,670,238 |
#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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=20;
map<string , int > mp;
int main()
{ char a[N],b[N];
string s;
scanf("%s",a);
scanf("%s",b);
int x,y;
scanf("%d%d",&x,&y);
s=a;
mp[s]=x;
s=b;
... | 0 | 76,424,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> a(n+1), b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll save=0;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
bool used[27];
int main(){
string s;
cin... | 0 | 17,381,777 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int h,w,k;
cin>>h>>w>>k;
string c[h];
rep(i,h)cin>>c[i];
int ans=0;
rep(i,1<<h){
... | #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
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | 0 | 78,640,916 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int t = (a + b) % 2;
double q = (a + b) / 2;
if (t == 1){
cout << q + 1 << endl;
}
else if(t == 0){
cout << q << endl;
}
} | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=... | 0 | 72,049,255 |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
... | #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 frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 99,828,602 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
t.pop_back();
if(s==t) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | 0 | 56,113,277 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll K;
cin >> K;
ll n = 50, r = K % n;
vector<ll> a(n);
for ( int i = 0; i < n; i++ ) {
a[i] = n - 1 + K / n;
}
for ( int i = 0; i < n; i++ ) {
if ( i < r ) {
a[i] += n - r + 1;
... | #include<map>
#include<cmath>
#include<ctime>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define qmin(x,y) (x=min(x,y))
#define qmax(x,y) (x=max(x,y))
#define mp(x,y) make_pair(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline int read(){
int... | 0 | 68,712,815 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
const int updn[] = {3, 0};
int n;
while (scanf("%d", &n), n){
int res = 0;
int state = 0;
for (int i = 0; i < n; i++){
string str;
cin >> str;
if (str == "lu") state += 1;
if (str == "ru") state += 2;
if (str == "ld") state -= 1;
if (... | #include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int sa,sb;
sa = a.size();
sb = b.size();
if(sa>sb){
cout << "GREATER" << endl;
return 0;
}else if(sa <sb){
cout << "LESS" << endl;
return 0;
}else if(sa == sb){
for... | 0 | 78,513,963 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo... | #include <iostream>
using namespace std;
int main()
{
int h, w;
while(cin >> h >> w && h && w) {
while(h--) {
int w0 = w;
while(w0--) cout << '#';
cout << '\n';
}
cout << endl;
}
return 0;
} | 0 | 60,703,098 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | #include <iostream>
using namespace std;
int main(){
int a,b,c,d,e,n,ans=0;
while(cin >> n ){
for(int i=0;i<=9;i++){
for(int j=0;j<=9;j++){
for(int k=0;k<=9;k++){
for(int l=0;l<=9;l++){
if(i+j+k+l==n){
ans++;
}
}
}
}
}
cout << ans << endl... | 0 | 96,402,715 |
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
#define int ll
using namespac... | #include <iostream>
using namespace std;
int main(){
int x,y;
while(cin >> x >> y, x+y){
if(x > y)swap(x,y);
cout << x << " " << y << endl;
}
return 0;
} | 0 | 30,584,543 |
#include<cstdio>
#include<cstring>
#include<vector>
#define rep(i,a) for( int i = 0; i != (a); ++i )
#define repi(i,a,b) for( int i = (a); i != (b); ++i )
const int INF = 1<<28;
int n;
std::vector<int> r(100);
std::vector<std::vector<int> > dp( 100, std::vector<int>( 100, INF ) );
int main()
{
scanf( "%d", &n );
rep(... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
vector<ll> size(51);
ll ans(ll n, ll x){
if (n == 0)
return 1;
if (x == 1)
return 0;
if (x <= size[n-1] + 1)
return ans(n - 1, x - 1);
if (x == size[n-1] + 2)
return ans(n - 1, size[n-1... | 0 | 2,187,718 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int>D;
for (int i = 0; i < N; i++)
{
int d;
cin>>d;
D.push_back(d);
}
sort(D.begin(),D.end());
int ans=D[N/2]-D[(N/2)-1];
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 88,496,208 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a[3],ans;
for(int i=0;i<3;++i){
cin>>a[i];
}
sort(a,a+3);
ans=a[2]*10+a[1]+a[0];
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(... | 0 | 91,198,943 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, K;
int A[100010], B[100010];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
ll ans =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define PII pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i+... | 0 | 88,822,950 |
#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
#define _GLIBCXX_DEBUG
signed main() {
int N, K; cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
int ans = 0;
int mod = pow(10, 9)+7;
int sk = K*... | #include <iostream>
using namespace std;
int main(void){
int d;
while(true){
cin >>d;
if(cin.eof())
break;
int total=0;
for(int i=d; i<600; i+=d)
total+=d*i*i;
cout << total << endl;... | 0 | 2,605,503 |
#include <iostream>
#include <string>
using namespace std;
int
main()
{
ios::sync_with_stdio(false);
while (true) {
string line;
getline(cin, line);
if (line == "-") {
break;
}
int m;
cin >> m; cin.ignore();
for (int i = 0; i < m; i++) {
int h;
cin >> h; cin.ignore();
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
int p[MAX_N];
int idx[MAX_N];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &(p[i]));
p[i] -= 1;
i... | 0 | 53,918,708 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
int main() {
ll h, w;
cin >> h >> w;
if (min(h, w) == 1) {
cout << 1 << endl;
return 0;
}
cout << ((h + 1) / 2)... | 0 | 36,821,545 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
long long n; cin >> n;
long long minx = 100000000;
long long k = 1;
while (k * k <= n){
if (n%k == 0){
long long x = max(to_string(n/k).size(), to_string(k).size());
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n;cin>>n;
ll arr[n+1];
ll sum=0;
bool state=0;
for(int i=0;i<=n;i++){
cin>>arr[i];sum+=arr[i];
}
if(n==0){if(arr[0]==1){cout<<"1\n";return 0;}if(arr[0]==2){cout<... | 0 | 75,231,362 |
#include <stdio.h>
int main () {
int apel, apel2, slice;
scanf ("%d %d", &apel, &apel2);
slice = (apel * 3) + apel2;
printf ("%d", slice/2);
return 0;
} | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i ... | 0 | 63,109,792 |
#include<bits/stdc++.h>
using namespace std;
int find_parent(int i,int par[])
{
if(i==par[i])
return i;
return par[i]=find_parent(par[i],par);
}
int main()
{
int n,m;
cin>>n>>m;
int par[n];
int sz[n];
for(int i=0;i<n;i++)
{
par[i]=i;
sz[i]=1;
}
int ma=1;
int a,b;... | #include<bits/stdc++.h>
#define si( x ) scanf("%d", &x)
#define sll( x ) scanf("%lld", &x)
#define mp make_pair
#define pb push_back
#define INF 1e18
using namespace std;
typedef pair < int , int > pii;
typedef long long ll;
ll dis[101][101];
int n, m;
int main( int argc, char *argv[] )
{
cin >> n >> m;
for(int i = 0... | 0 | 50,588,722 |
#include<bits/stdc++.h>
using namespace std;
inline void ri(int &x){
x=0; static char c; bool t=0;
while(c=getchar(),c<'0'||c>'9') if(c=='-') t=1; else t=0;
do x=x*10+c-'0'; while(c=getchar(),c>='0'&&c<='9');
if(t) x=-x;
}
const int N=200024;
vector<int> Q[N];
int sg[N];
void dfs(int fa,int x){
int i,l=Q[x].size()... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char** argv) {
int x = 0;
int v[3] = {0};
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
for (int i = 0; i < 2; i++) {
int j = i;
for (int k = i+1; k < 3; k++) {
if(v[j] > v[k]) {
... | 0 | 1,871,170 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cctype>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#de... | 0 | 52,536,307 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
int m = a.size(), n = b.size();
if (m < n) {
cout << "LESS" << "\n";
return 0;
}
else if (m > n) {
cout << "GREATER" << "\n";
return 0;
}... | #include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
#define N 105
vector<int> neighbors[N];
queue<int> q;
int dist[N];
int vis[N];
int res = 0;
void bfs(int d){
if(q.empty()) return;
while(!q.empty()){
int temp = q.front();
q.pop();
if(dist[temp]!=-1){
if(d<dist[tem... | 0 | 81,111,794 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >>a>>b>>c>>d;
int w,x,y,z;
x=d+c-a;
w=c-(d-b);
y=a-(d-b);
z=b+c-a;
cout <<w << ' ' << x << ' ' << y <<' ' << z << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | 0 | 69,736,004 |
#include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 85,388,497 |
#include <iostream>
#define MAX 45
using namespace std;
int f[MAX];
int fib(int n){
if(n==0||n==1) return f[n]=1;
if(f[n] != -1) return f[n];
return f[n]=fib(n-1)+fib(n-2);
}
int main(){
int n; cin >> n;
for(int i=0;i<=n;i++) f[i]=-1;
cout << fib(n) << endl;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... | 0 | 9,376,726 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int w, h, n;
cin >> w >> h >> n;
int p1 = 0, p2 = w, p3 = 0, p4 = h;
rep(i, n)
{
int x, y, a;
cin >> x >> y >> a;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1000];
int min, max;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i == 0)
{
min = a[i];
max = a[i];
}
else
{
if (max < a[i])
max = a[i];
if (min > a[i])
min = a... | 0 | 73,612,478 |
#include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 2010;
const long double PI = acos(-1);
bool f(ll n){
ll l = n%10;
while(n){
if (abs(n... | #include <iostream>
#include <algorithm>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007;
static const size_t MAX_N = 100001;
struct modll {
long long x;
modll() { }
modll(long long _x) : x(_x) { }
operator int() const { return (int)x; }
modll operat... | 0 | 37,943,384 |
#include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
int N;
cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int M;
cin>>... | #include <iostream>
#include <string>
using namespace std;
int size = 0;
int S[2000000] = {0};
int parent(int i){
if(i % 2 == 1)return (i - 1) / 2;
else return (i - 2) / 2;
}
void insert(int *S, int k){
int i = size++;
while(i > 0){
int p = parent(i);
if(S[p] >= k) break;
else{
S[i] =... | 0 | 96,418,589 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
string s,t,u;
ll a,b;
cin >> s >> t >> a >> b >>u;
if(u==s)cout << a-1 << " " << b << endl;
else cout << a << " " << b-1 << endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 75,260,935 |
#include<cstdio>
using namespace std;
#define god(x1,y1,x2,y2,x3,y3) x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2)
int main(){
double x1,y1,x2,y2,x3,y3,ax,ay;
while(scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3,&ax,&ay) != EOF){
if(god(x1,y1,x2,y2,x3,y3) > 0.0 && god(ax,ay,x1,y1,x2,y2) > 0.0 &&
god(ax,ay,x3,y3,x1,... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
str... | 0 | 9,244,614 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | #include "bits/stdc++.h"
using namespace std;
const int mx = 200000 + 9;
bitset <mx> mark;
int d[mx];
vector <int> adj[mx];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
mark[1] = 1;
qu... | 0 | 65,741,111 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b;
cin >> a >> b;
if(a==b)
cout << "Draw" << endl;
else if(a!=1&&b!=1){
if(a<b)
cout << "Bob" << endl;
else
cout << "Alice" << endl;
}
else{
if(a==1){
cout << "Alic... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 16,314,755 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repd(i, a, b) for (int i = a; i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#... | 0 | 2,202,949 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100
int INFTY = (1<<21);
int num,M[MAX][MAX];
int d[MAX];
void bfs(int s){
queue<int> q;
q.push(s);
int u,i,v;
for( i = 0; i < num; i++){
d[i] = INFTY;
}
d[s] = 0;
while( !q.empty()){
u = q.front();
q.pop();
for(v = 0; v < num; v++){
... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 3,622,952 |
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
typedef pair<int, int> P;
int main() {
ll n, m; cin >> n >> m;
vector<P> S(n), C(m);
loop(i,0,n) cin >> S[i].first >> S[i].second;
loop(i,0,m) cin >> C[i].... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int curr=1;
set<int> s;
s.insert(n);
while( true)
{
if(n%2==0)
{
curr++;
n=n/2;
if( s.find(n)== s.end() )
{
s.insert(n);
}
... | 0 | 98,278,936 |
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
string shuffle(string str, int h){
string str1 = str.substr(0,h);
string str2 = str.substr(h, str.size()-h);
return str2 + str1;
}
int main(){
string card;
int i, h;
while(1){
cin>>card;
if (card=="-") brea... | #include <iostream>
#include <bitset>
using namespace std;
const long long INF = 1LL<<60;
int main() {
int n, k; cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
long long ans = INF;
for (int bit = 0; bit < (1<<n); bit++) {
int t = bitset<20>(bit).count();
if (t < k)... | 0 | 99,148,529 |
#include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
long long X, Y;
cin >> X >> Y;
int cnt = 1;
X *= 2;
while(X <= Y){
cnt++;
X *= 2;
}
cout << cnt << '\n';
return 0;
} | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | 0 | 75,034,256 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,j;
cin>>n>>k;
int m=1e9+7;
int a[n+1],s[k+1];
for(i=1;i<=n;i++)
cin>>a[i];
int dp[n+1][k+1];
dp[0][0]=1;
for(i=1;i<=k;i++)
dp[0][i]=0;
for(i=1;i<=n;i++)
{
s[0]=dp[i-1][0];
for(j=1;j<=k;j+... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
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;... | 0 | 63,369,875 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll m = INF;
for (int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
m = min(m, a[i]);
}
ll l ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 56,522,798 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
char m, n;
int count=0;
m = s[0];
while (n != m){
n = m;
for (int i=0; i<s.length(); i++){
if (s[i] != m){
m = s[i];
s = s.substr(i);
... | #include<bits/stdc++.h>
using namespace std;
const int mod = (int) 1e9 + 7;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < m; ++i) {
cin >> t[i];
}
vector<long long>... | 0 | 15,199,812 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
string n;
cin >> n;
for (auto ch : n) {
if (ch == '9')
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
int n,k; cin >> n >> k;
map<int,int> m;
for(int i = 0;i < n;i++){
int x; cin >> x;
auto result = m.find(x);
... | 0 | 99,046,355 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m;
cin>>n>>m;
int clear=0, pena=0, p;
string s;
map<int, int> ac;
map<int, int> wa;
while(m--){
cin>>p>>s;
if(ac[p]) continue;
if(s=="AC"){
clear++;
ac[p]=1;
pena... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n,m;
cin >> n >> m;
vector<ll> g[3];
for(int i=0;i<n;++i){
for(int j=0;j<3;++j){
ll x;
cin >> x;
g[j].push_back(x);
}
}
ll cal=0;
for(int bit=0;bit<(1<<3);++bit){
vector<ll> kouho;
for(int i=... | 0 | 16,370,040 |
#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
const int MAXN =1e5+10;
const long long mod = 1e14 ;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
using... | 0 | 83,064,684 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main(){
ll a,b,c,d;
ci... | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | 0 | 52,353,409 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned char, unsig... | #include<bits/stdc++.h>
using namespace std;
long long int fun(int n,vector<long long int> &a,vector<long long int> &b,vector<long long int> &c,vector<vector<long long int>> &dp,int k){
if(n<0) return 0;
if(dp[n][k]!=-1) return dp[n][k];
int ans=0;
int v[2]={-1};
if(k==0){
ans = a[n];
... | 0 | 76,793,721 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_elemen... | 0 | 25,581,760 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <string>
using namespace std;
int main()
{
stack<char> s;
while (true){
char str[128];
fgets(str, sizeof(str), stdin);
if (str[0] == '.'){
break;
}
while (!s.empty()){
s.pop();
}
bool flag = true;
for (int i = 0... | #include <stdio.h>
#include <vector>
#include <iostream>
#include <queue>
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
struct node{
ll num;
int cnt;
... | 0 | 55,960,570 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
string S;
bool finished = false;
cin >> H >> W;
for (i = 1; i <= H; i++) {
for (j = 1; j <= W; j++) {
cin >> S;
if (S == "snuke") {
cout << (char)(64 + j) << i << endl;
finished = true;
... | 0 | 72,823,800 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=1e9;
int main()
{
int n,k,s;
cin>>n>>k>>s;
if(s==MAXN)
{
for(int i=1;i<=k;i++)
printf("%d ",MAXN);
for(int i=k+1;i<=n;i++)
printf("%d ",1);
}
else {
for(int i=1;i<=k;i++)
printf("%d ",s);
for(int i=k+1;i<=n;i++)
printf("%... | 0 | 31,909,644 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int N, M;
cin>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct edge {
ll to, cost;
};
int n;
vector<vector<edge>> g;
vector<ll> d;
void dijkstra(int s) {
for (int i = 0; i < n; ++i) {
d[i] = LINF;
}
priority_queue<pa... | 0 | 70,795,457 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#include <bitset>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n... | 0 | 37,961,949 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define INF 9223372036854777ll
#define pb push_back
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
vector<ll> dp(k+1);
dp[0... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int H, W, i, j;
while (1){
scanf("%d %d", &H, &W);
if (H == 0 && W == 0){
break;
}
for (i = 1; i <= H; i++){
for (j = 1; j <= W; j++){
if (i>1 && i < H){
if (j>1 && j < W){
putchar('.');
}
else {
putchar('... | 0 | 56,449,227 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ra... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
int n;
vector<lint> a;
bool isValid(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count <= m;
}
bool isValid2(lint m) {
lint cou... | 0 | 6,909,941 |
#include<stdio.h>
int main(){
int n, k;
scanf("%d %d", &n, &k);
printf("%d", n - k + 1);
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int n = 0;n<N;++n) {
cin >> A[n];
}
int num = 1;
int ans = 0;
for (int n = 0; n < N; ++n) {
if (num == A[n]) {
num++;
}
else {
ans++;
}
}
if (1 == num) {
cout << -1<<endl;
}
else {
cout << a... | 0 | 65,604,248 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
string s;
char c;
int main(){
cin>>a>>s>>b;
c=s[b-1];
for(int i=0;i<a;i++)if(s[i]==c)cout<<c;
else cout<<'*';
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, y;
cin >> n >> y;
if (n * 10000 < y || n * 1000 > y) {
cout << -1 << ' ' << -1 << ' ' << -1 << '\n';
return 0;
}
int c = y / 1000;
int b = min((c - n) / 4, c / 5);
... | 0 | 51,949,251 |
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#define ll long long
int main()
{
int K;
std::cin >> K;
std::string S;
std::cin >> S;
int S_size = S.size();
if(S_size <= K) {
std::cout << S << std::endl;
}
else {
std::cout << S.... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, M;
cin>>n>>M;
map<int, int> cnt;
int sum = 0;
cnt[sum]++;
for (int i=1; i<=n; i++) {
int x;
cin>>x;
sum = (sum+x)%M;
cnt[sum]++;
}
long long ans =... | 0 | 15,331,234 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
using... | 0 | 24,788,304 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main(){
int N,Q;
cin >> N >> Q;
dsu D(N);
for(int i=0;i<Q;i++){
int t,u,v;
cin >> t >> u >> v;
if(t==0){
D.merge(u,v);
}
if(t==1){
if(D.same(u,v)) cout << 1 << endl;
else cout ... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll gcd(ll a, l... | 0 | 18,595,117 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int answer = 0;
for(int c = 1; c <= N; c+= 2)
{
int numofdivisors = 0;
for (int X = 1; X <= c; ++X)
{
if(c % X == 0)
{
++numofdivisors;
}
}
... | #include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[... | 0 | 69,780,826 |
#include<iostream>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
int sum = A+B+C;
int count=0;
while(A>0 && K>0){
A--;
K--;
count++;
}
while(B>0 && K>0){
B--;
K--;
}
while(K>0){
K--;
count--;
}
cout << count << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll,... | 0 | 57,635,806 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
void solve() {
int n,k,a,b,ans = 0;
cin >> n;
cin >> k;
cin >> a;
cin >> b;
ans += (min(n,k))*a + (max(0, n-k))*b;
cout << ans;
}
int32_t main() {
IOS;
solve();
return 0;
} | 0 | 38,482,858 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
int main() {
int A,B;cin >> A >> B;
if (A%3 == B%3){
if (A%3 == 0){
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
}else{
cout << "Possible" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long K,A,B;
long long N=1;
cin>>K>>A>>B;
for(long long X=0;X<K;X++){
if(A+2<B){
if(N<A){
N++;
}
else{
if(X+1<K){
N+=B-A;
X++;
}
else{
N++;
}
}
}
... | 0 | 57,191,095 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)x.size()
#define eb emplace_back
#define pb push_back
#defin... | #include <iostream>
#include <vector>
#include <numeric>
using i64 = long long;
class UF {
std::vector<int> par, rank;
public:
UF(int size) : par(size), rank(size) {
std::iota(par.begin(), par.end(), 0);
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[... | 0 | 51,211,279 |
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
ll n,d[101]={},z[100]={};
int main(void){
cin>>n;
for(int i=2;i<=n;i++){
ll a=i,j=2;
while(a!=1){
if(a%j!=0){
j++;
}
e... | 0 | 69,811,261 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline b... | #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 <set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
int main()
{
lint ... | 0 | 91,995,110 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x2;
int y = y2;
int dx = x2 - x1;
int dy = y2 - y1;
for(int i = 0; i < 2;i++){
swap(dx,d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | 0 | 87,364,883 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define nrep(i,n) for(int i=1;i<=(n);i++)
#define FST first
#define SEC second
using namespace std;
typedef pair <int,int> pxy;
#define WMAX 20
#define HMAX 20
int dd[5]={0,1,0,-1,0};
int W,H;
void print(char map[HMAX][WMAX]){
putchar('\n');
rep(i,H){... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int Y,M,D,S;
cin>>Y>>M>>D;
if(Y%3==0){
if(M%2==0){
Y=Y/3-1;
M=M/2-1;
S=196471-Y*590-390-M*40-20-D;
cout<<S<<endl;
}
else{
Y=Y/3-1;
M=M/2;
S=196471-Y*590-390-M*40-D;
cou... | 0 | 98,050,748 |
#include <bits/stdc++.h>
using namespace std;
bool StringToInt(string s, int &data)
{
data=0;
int sign=1;
for(int i=0;i<s.length();i++){
if(i==0 && s[i]=='-'){
sign=-1;
continue;
}
if('0'<=s[i] && s[i]<='9'){
data*=10;
data+=sign*(s[i]-'0');
}
else return false;
}
retu... | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef unsigned long long llong;
#define MAX 4000
const llong mod = 1000000000 + 7;
int main()
{
int N;
char S[MAX];
llong Rlen = 0, Glen = 0, Blen = 0;
llong ans = 0;
scanf("%d", &N);
scanf("%s", S);
for (int i = 0; i < N; i++)
{
switch ... | 0 | 17,753,366 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
... | 0 | 39,576,828 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
char A;
for(n=0;n<4;n++){
A=getchar();
cout << A;
}
cout << " ";
for(n=0;n<8;n++){
A=getchar();
cout << A;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int main() {
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
int ans=a.at(0);... | 0 | 73,459,779 |
#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... | 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,657,253 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.