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;
int main()
{
int n; cin>>n;
vector<string> ans;
while(n--)
{
string on=".,!? ";
string s; cin>>s;
int cnt=0 ,num=0;
string tmp;
for(int i=0; i<s.size(); ++i)
{
if(num==s[i]-'0') cnt++;
else
{
if(num==1) tmp+=on[cnt... | #include<iostream>
using namespace std;
int main(){
int x,y,i;
for(i = 1; i <= 3000; i++){
cin >> x >> y;
if((x == 0) && (y == 0)) break;
if(x <= y){
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
}
return 0;
} | 0 | 19,319,421 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int gcd(ll N){
ll ans=1;
for(ll i=sqrt(N)+1; 0<i; i--){
if(N%i==0){
ans=i;
break... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.en... | 0 | 60,143,221 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
--x; --y;
g[x].push_back(y);
g[y].push_back(x);
}
function<int(int, int)> Dfs = [&... | # include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector < int > a(n + 2);
long long total = 0;
for ( int i = 1; i <= n; i++ ) {
cin >> a[i];
}
for ( int i = 1; i <= n + 1; i++ ) {
total += abs( a[i - 1] - a[i] );
}
for ( int i = 1; i <= n; i++ ) {
long long t = total;
t -= a... | 0 | 53,166,458 |
#include <iostream>
using namespace std;
int main() {
long long int a, b, c, k;
cin >> a >> b >> c >> k;
if(k % 2 == 1) {
cout << (a - b) * -1 << "\n";
} else {
cout << a - b << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, keta = 1, keta_cnt = 1, cnt = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
keta = i;
while (keta >= 10) {
keta /= 10;
keta_cnt++;
}
if(keta_cnt % 2 == 1) {
cnt++;
}
keta_cnt = 1;
}
cout << cn... | 0 | 14,951,670 |
#include <iostream>
using namespace std;
int main(){
int num[5], i, j, a;
for(i = 0; i < 5; i++){
cin >> num[i];
}
for(j = 4; j >= 0; j--){
for(i = 0; i < j; i++){
if(num[i] < num[i+1]){
a = num[i];
num[i] = num[i+1];
num[i+1] = a;
}
}
}
for(i = 0; i < 4; i++){
cout << num[i] << ' ';
}
... | #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 rep(i, n) for... | 0 | 98,792,700 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x,a;
cin>>x>>a;
if(x>=a)
cout<<"10";
else
cout<<"0";
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, b, f, r, v;
int oh[4][3][10] = { 0 };
cin >> n;
for(int i = 0; i < n; i++){
cin >> b >> f >> r >> v;
b--; f--; r--;
oh[b][f][r] += v;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 3; j++){
for(int k = 0; k < 10; k++){
cout << ' ' << oh[... | 0 | 29,622,044 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 102;
char s[N], t[N];
int main() {
int n;
scanf("%d\n%s\n%s", &n, s, t);
string res = "";
for (int i = 0; i < n; i++) {
res += s[i];
res += t[i];
... | #include <iostream>
#include <iomanip>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
#include <cassert>
#include <fstream>
#include <algorithm>
#include <list>
#include <random>
#include <ctime>
#include <cmath>
#include <random>
#in... | 0 | 84,675,919 |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.14159265359;
const ll MOD =... | #include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from); x<(to); (x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n, a[101];
rep2(i,1,100) {
a[i] = 0;
}
while(cin >> n) {
a[n]++;
}
int max = 0;
rep2(i,1,100) {
if(max < a[i]) max = a[i];
}
rep2(i,1,100) {
if(a[i] == max) ... | 0 | 74,904,347 |
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
char b; cin >> b;
char p;
switch(b) {
case 'A': p = 'T'; break;
case 'T': p = 'A'; break;
case 'C': p = 'G'; break;
case 'G': p = 'C'; break;
}
cout << p << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 2,202,308 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | #include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
using namespace std;
int main()
{
string op;
int num;
priority_queue<int>pq;
while (cin >> op)
{
if (op == "end") break;
if (op == "insert")
{
cin >> num;
pq.push(num);
}
else if (op == "extract")
{
cout << ... | 0 | 10,541,448 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
LL n,h,w,x,y,ans[10];
LL dx[9]={1,1,1,0,0,-1,-1,-1,0},dy[9]={-1,0,1,-1,1,-1,0,1,0};
map<pair<int,int>,int>Map;
int main()
{
cin>>h>>w>>n;
ans[0]=(h-2)*(w-2);
for (int i=1; i<=n; ++i)
{
cin>>x>>y;
for (int i=0; i<9; ++i)
{
LL X=x+dx[i],Y=y+dy... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define pii pair<ll ,ll>
#define vi vector<ll>
#define present(container, element) (conta... | 0 | 37,930,860 |
#include <iostream>
#include <vector>
#include <utility>
#include <map>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using pll = pair<ll,ll> ;
ll sa(long long a,long long b){if(a>b) return a-b ; return b-a ;}
int main(){
ll h,w,d ;
cin >> h >> w >> d ;
map<ll,pll> ... | #if 0
???????????????????????????Z???Z[1000][1000]??§???????????£??????????????????????????£??????
#endif
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int N,len1,len2;
string X,Y;
int Z[1010][1010];
int main() {
cin >> N;
for (int i=0; i<N; i++){
cin >> X >> Y;
len1 = X.le... | 0 | 62,898,339 |
#include<iostream>
using namespace std;
int main(){
int a,o=0;
bool n[1000000];
for(int i=2;i<=999999;i++){
n[i]=true;
}
n[0]=n[1]=false;
for( int j=2;j*j<=999999;j++){
if(n[j]){
for(int k=j*2;k<=999999;k+=j){
n[k]=false;
}
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int mcxi2int(string mcxi) {
int ret = 0;
int i = 0;
while(i < mcxi.length()) {
int c = 1;
if('2' <= mcxi[i] && mcxi[i] <= '9') {
c = mcxi[i] - '0';
... | 0 | 87,922,978 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, A, B, x;
cin >> a >> b;
A = a%2;
B = b%2;
x = A*B;
if (x == 0) {
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
} | #include<bits/stdc++.h>
#define ll long long
#define mod 838627288460106
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll n,y,i,j,c10k=0,c5k=0,c1k=0;
cin>>n>>y;
bool ok=1;
for(i=0; i<=n; i++)
{
for(j=0; j<=n; j++)... | 0 | 43,831,113 |
#include <bits/stdc++.h>
using namespace std;
#define itn int
#define nibu(K,x) binary_search(K.begin(),K.end(),x)
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define out(x) cout<<x<<endl
#define... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s,t;
cin >> n >> s >> t;
int ans = 2*n;
for (int i=0; i<n; i++) {
int j = 0;
bool f = true;
while (j < n) {
if (i+j >= n) break;
if (s[i+j] != t[j]) {
... | 0 | 96,337,637 |
#include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) { x+=y; y=x-y; x-=y; }
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
int main()
{
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
int count = 0;
for (int i = 0; ... | 0 | 4,459,089 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | #include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int n;
char k[100][2];
int m;
char a;
while (cin >> n) {
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> k[i][0] >> k[i][1];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
for (int i = 0; i < n; i++) ... | 0 | 73,880,442 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double t ;
double x ;
cin >> t >> x;
double at;
at = t / x;
cout << fixed << setprecision(10) << at << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
const int INF = 1000010;
int MCMP(int N, int R[], int C[]) {
int dp[N][N];
rep(i, N) rep(j, N) {
if (i==j) dp[i][j] = 0;
else dp[i][j] = INF;
... | 0 | 51,208,827 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 0 | 36,822,733 |
#include <iostream>
#include<bits/stdc++.h>
#include<vector>
#include<string>
#define ll long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define s second
#define pb(x) push_back(x)
#define f first
using namespace std;
int main(){
ios::sync_with_... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | 0 | 17,510,859 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r", stdin);
freopen("out","w",stdout);
#endif
int n;
cin>>n;
int u,v;
int ans=0;
for(int i=1;i<=n;i++)
{
ans+=i*(n-i+1);
}
for(int i=1;i<n;i++)
{
cin>>u>>v;
if(u>v)s... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | 0 | 8,609,838 |
#include <stdio.h>
#include <iostream>
using namespace std;
long long a[100010];
long long mask[61];
int main()
{
int n;cin >> n;
for (int i=0;i<n;++i)
cin >> a[i];
long long ans=0;
long long tmp=0;
for (int i=0;i<n;++i)
tmp^= a[i];
ans=tmp;
tmp= (1LL << 61)-1-tmp;
for (i... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
int main(){
ll n, k, s;
cin >> n >> k >> s;
ll a[2] = {s/2, s%2 == 1 ? s/2 + 1 : s/2};
rep(i, n){
if(i > 0) cout << " ";
if(k == n){
cou... | 0 | 28,168,176 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include<stdio.h>
int main()
{
int n,i,dig,flag=0;
scanf("%d",&n);
while(n!=0)
{
dig = n%10;
n = n/10;
if(dig==7)
flag++;
}
if(flag>0)
printf("Yes\n");
else
printf("No\n");
return 0;
} | 0 | 87,331,799 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <stack>
#include <queue>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
ll mod_pow(ll, ll, ll); ll mod_fact(ll, ll); ll mod_inv(ll, ll); ll gcd(ll, ll); ll lcm(ll, ll);
int main(){
int a[12] = {1, 6, 36, 216, 1296, 7776, 46656, 9, 81, 729, 6561, 59049};
int n;
c... | 0 | 93,245,215 |
#include<bits/stdc++.h>
using namespace std;int l(string a,string b){int m=a.size(),n=b.size(),i=0,j,s=0,c[1001][1001]={};for(a=' '+a,b=' '+b;++i<=m;)for(j=0;++j<=n;s=s<c[i][j]?c[i][j]:s)c[i][j]=a[i]==b[j]?c[i-1][j-1]+1:c[i-1][j]>c[i][j-1]?c[i-1][j]:c[i][j-1];return s;}main(){string a,b;int n;for(cin>>n;n--;)cin>>a>>b,... | #include <cstdio>
using namespace std;
int main(){
int n[5], sub;
for(int i = 0; i < 5; i++) scanf("%d", &n[i]);
for(int i = 0; i < 5; i++){
for(int j = 4; j >= i; j--){
if(n[i] < n[j]){
sub = n[i];
n[i] = n[j];
n[j] = sub;
}
}
}
for(int i = 0; i < 5; i++) printf("%d%c", n[i], (i == 4)? '\n' ... | 0 | 17,490,877 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | 0 | 32,611,122 |
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int n, m;
cin >> n >> m;
vector<ll> h(n), c(n);
rep(i, n) cin >> h[i];
rep(i, m){
int a, b;
cin >> a >> b;
if(h[a - 1] > h[b - 1]){
... | 0 | 51,527,464 |
#include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int i=0; i<n; i++)
#define REP2(i, a, b) for(int i=a; i<b; i++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1'000'000'007
template <class T> ostream& operator<<(ostream... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef LL ll;
typedef long double ld;
typedef string str;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef stringstream strs;
#define X first
#define Y second
#define PB push_back
#define For(i,a,b) for (int i=a;i<b;i++)
#define Ford(i,a,b... | 0 | 877,419 |
#include<bits/stdc++.h>
using namespace std;
int dp[100001][3];
int a[100001][3];
int solve(int n)
{
dp[0][0]=a[0][0];
dp[0][1]=a[0][1];
dp[0][2]=a[0][2];
for(int i=1;i<n;i++)
{
dp[i][0]=max(dp[i-1][1]+a[i][0],dp[i-1][2]+a[i][0]);
dp[i][1]=max(dp[i-1][0]+a[i][1],dp[i-1][2]+a[i][1]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 4,460,716 |
#include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#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 <s... | #include<iostream>
using namespace std;
string s;
int sum1,sum2;
int Search2(int indx);
int Search1(int indx){
while(indx < (int)s.size()){
if(s[indx]==']'){
return -1;
}
else if(s[indx]=='('){
indx = Search1(indx+1);
sum1++;
if(indx==-1 ) return -1;
}
else if(s[indx]=='[')... | 0 | 47,671,705 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
if((N-N/1000*1000)%111==0){
cout<<"Yes"<<endl;
}
else if((N-N%10)/10%111==0){
cout<<"Yes"<<endl;
}
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
double x[N];
string y[N];
double total = 0;
for(int i = 0 ; i < N ; i++){
cin >> x[i] >> y[i];
if(y[i] == "JPY"){
total += x[i];
}else{
total += x[i] * 380000.0;
... | 0 | 28,489,712 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int main()
{
int n,m;cin >> n >> m;
vector<int> a(m);
rep(i,m) cin >> a[i];
vector<vector<int>> dp(m+1, vector<int>(n+1, -1));
sort(a.... | #include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
using namespace std;
const int maxn=10005;
int n,m,t;
vector<int> v[maxn];
int main()
{
scanf("%d",&n);
n*=2;
while(m*(m+1)<n) m++;
if(m*(m+1)!=n)
{
puts("No");
return 0;
}
puts("Yes");
m++;
cout<<m<<endl;
rep(i,1,m)
{
int vv=v[i].size();... | 0 | 10,996,363 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int maxx=10010;
vector<int> A[maxx],ans;
queue<int> task;
int f[maxx];
bool flag[maxx];
int v,e;
int main (){
int x,y;
bool xx=false;
cin>>v>>e;
for(int i=0;i<maxx;i++){
f[i]=0;
flag[i]=false... | 0 | 15,420,221 |
#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... | #include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define MOD 1000000009
typedef long long ll;
using namespac... | 0 | 94,548,962 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int A, B, C, K;
cin >> A >> B >> C >> K;
int sum = 0;
if(K > A){
sum += A;
K -= A;
}... | #include <cstdio>
int main()
{
int n, m, d, p, r[11];
while(true)
{
scanf("%d", &n);
scanf("%d", &m);
if(n == 0 && m == 0) { break; }
for(int i = 0; i < 11; i++)
{
r[i] = 0;
}
for(int i = 0; i < n; i++)
{
scanf("%d", &d)... | 0 | 73,072,404 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
int a,b;
scanf("%d %d", &a, &b);
if(a == b) printf("Draw\n");
else if(a == 1) printf("Alice\n");
else if(b == 1) printf("Bob\n");
else if(a < b) printf("Bob... | #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 | 89,587,681 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = min(n, 9);
ans += min(max(n - 99, 0), 900);
ans += min(max(n - 9999, 0), 90000);
ans += min(max(n - 999999, 0), 9000000);
cout << ans << endl;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
using ... | 0 | 23,567,183 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll solve(vector<ll> v) {
int n = v.size();
ll res = 0;
for (ll i=0; i<... | #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 | 1,357,731 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define ... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int aux[N];
int main() {
int n, k;
cin >> n >> k;
map <int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mp[x]++;
}
int sz = 0;
for (auto it = mp.begin(); it != mp.end(); it++) {
au... | 0 | 62,766,164 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 60);
template <typename T>
struct LazySegmentTree {
int n;
vector<T> node, lazy;
LazySegmentTree (int sz, T init = 0) {
... | 0 | 67,002,843 |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
using ull = unsigned long long;
constexpr double Pi = 3.141592653;
int main()
{
double a, b, cAngle;
cin >> a >> b >> cAngle;
cAngle = cAngle * 2 * Pi / 360.... | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
#define ll long long
#define mod (long long)(1e9+7)
#define endl '\n'
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0) ;
#define pi (acos(-1))
#define F first
#define S second
ll fp(ll n , ll p )
{
i... | 0 | 82,173,375 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | #include<bits/stdc++.h>
using namespace std;
#define l long int
#define ll long long int
vector<int>adj[1000001];
int vis[1000001];
int n=2005;
int dp[2005];
int fact[1000001];
#define mod 1000000007
ll sequence_sum(int a)
{
if(a==0)
return 1ll;
else if(a==1 || a==2)
return 0ll;
else if(a==3... | 0 | 83,355,350 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
... | #include <iostream>
using namespace std;
string* bubble_sort(int n, string* array) {
for (int i = 0; i < n; i++) {
for (int j = n-1; j > i; j--) {
if (array[j][1] < array[j-1][1]) {
string tmp = array[j];
array[j] = array[j-1];
array[j-1] = tmp;
}
}
}
return array;
}
st... | 0 | 21,361,661 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
class Rooted_Tree
{
public:
int id;
int parent;
int depth;
string type;
int degree;
vector<int> c;
Rooted_Tree()
{
id = parent = depth = degree = -1;
type =... | 0 | 35,824,460 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(4), a = {1, 4, 7, 9};
for(int i = 0; i < 4; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
if(v == a)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include<iostream>
using namespace std;
int main()
{
int n,a;
while(cin>>n)
{
int x=0;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
a=n-i-j-k;
if(a>=0&&a<=9)
x++;
... | 0 | 34,298,348 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int score = 0;
for(int i = 1; i <= N; i++){
score += i;
if(score >= N){
for(int j = 1; j <= i; j++){
if(score != N + j){
cout << j << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll... | 0 | 14,403,315 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <fstream>
#include <set>
#include <stack>
#include <queue>
#include <list>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
temp... | 0 | 91,344,770 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long answer = 0;
cin>>n;
long long tmp_n = n;
for(long long i=2;i*i<=n;i++) {
long long tmp = i;
while(tmp_n % tmp == 0) {
tmp_n/=tmp;
answer++;
tmp*=i;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
string s,t; cin >> s >> t;
int hit = 0;
for (int i = 0; i < n; i++)
{
int tmp = 0;
for (int j = 0; j < n - i; j++)
{
int a = i + j;
int b = n - i + j;
if (s[a] == t[j])
{
tmp++;
cont... | 0 | 38,220,735 |
#include<iostream>
#include<string>
#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];
}
int num = 0;
for (int i = 0; i < N - 1; i++) {
int min_idx = i;
int min = a[i];
for (int j = i; j < N; j++) {
if (mi... | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
using namespace std;
typedef long long int64;
typedef int int32;
typedef char int8;
#define rep(i,j) for(int i=0;i<j;i++)
#define repeat(i,j,k) for(i=(j),i<(k);i++)... | 0 | 28,120,389 |
#pragma optimize("O3")
#include <bits/stdc++.h>
#define f(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define F first
#define S second
#define ii pair<int, int>
using ll = long long;
using db = long double;
using namespace std;
const int N = 1e6 + 5;
int get(int x){
int ans = 0;
for(int j = 1; x >= j;... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}... | 0 | 39,073,506 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
if (n / 100 == 7){
cout << "Yes" << endl;
} else if((n % 100) / 10 == 7){
cout << "Yes" << endl;
} else if(n % 10 == 7){
cout << "Yes" << endl;
} else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,b_num=0,ans=0,i=0;
cin >> N;
int data[N];
for(int i=0;i<N;i++) cin >> data[i];
for(int i=0;i<N;i++) data[i]--;
while(1){
ans++;
if(data[b_num] == 1) break;
int next = data[b_num];
if(i > 1... | 0 | 96,343,494 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 80,064,345 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | 0 | 67,939,346 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <math.h>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio... | 0 | 46,522,984 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[60];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
for(sort(a+1,a+n+1);a[n]>=n;sort(a+1,a+n+1)){for(int i=0;i<n;++i)a[i]+=a[n]/n;a[n]%=n;}
cout<<a[0]<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
int main(){
int N;
cin >> N;
double t, v[N+1], ta[N];
rep(i, N) {
cin >> t;
if(!i) ta[i] = t;
else ta[i] = ta[i-1] + t;
}
rep(i, N) cin >> v[i];
v[N] = 0.0, t = 0;
int pos = 0;
double ans = 0, ve... | 0 | 82,954,398 |
#include<stdio.h>
#include<string.h>
int main(){
int N, sum=0;
scanf("%d", &N);
for(int i=0;i<N;i++){
sum += i+1;
}
printf("%d", sum);
return 0;
} | #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<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>(st... | 0 | 66,234,471 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> v(n);
REP(i,n){
int a,b;
cin >> a >> b;
v[i].firs... | #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;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
string S;
cin >> S;
int cnt = 0;
char cur = 'A';
rep(i,... | 0 | 2,761,537 |
#include <cstdio>
#include <string>
using namespace std;
int main() {
char buf[1<<7];
scanf("%s", buf);
string s(buf); s+=s;
scanf("%s", buf);
string p(buf);
printf("%s\n", s.find(p)!=string::npos? "Yes":"No");
return 0;
} | #include<iostream>
#include<string>
#include<vector>
using namespace std;
void bubbleSort( vector<string> &cards )
{
for( int i=0; i<cards.size( ); i++ ) {
for( int j=cards.size( )-1; i<j; j-- ) {
if( cards[j][1]< cards[ j-1 ][1] ) {
swap( cards[j], cards[ j-1 ] );
}
}
}
return;
}
void selectionSort(... | 0 | 53,874,037 |
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
while (x > 0 || y > 0) {
if (x <= y)
cout << x << " " << y << endl;
else
cout << y << " " << x << endl;
cin >> x >> y;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n;
int comb[4][51] = {0};
for(int i=0; i<10; i++){
comb[0][i] = 1;
}
for(int i=1; i<4; i++){
for(int j=0; j<9*i+10; j++){
for(int k=0; k<10; k++){
if(j-k>=0){
comb[i][j] += comb[i-1][j-k];
}
}
}
}
whi... | 0 | 4,398,211 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
int num = 1, cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) == num) {
num++;
} else {
cnt++;
}
}
i... | 0 | 85,529,815 |
#include<stdio.h>
int main(void)
{
int a,s,d,f,g,i,j;
while(scanf("%d",&a)!=EOF){
s=0;
for(i=0;i<=9;i++){
for(j=0;j<=9;j++){
for(f=0;f<=9;f++){
for(g=0;g<=9;g++){
if(a==i+j+f+g){
s++;
}
}
}
}
}
printf("%d\n",s);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
while(cin >> n >> x, n|x){
int ans = 0;
for(int i=1; i<=n-2; i++){
for(int j=i+1; j<=n-1; j++){
for(int k=j+1; k<=n; k++){
if(i+j+k == x) ans++;
}
}
}
cout << ans << endl;
}
return 0;
} | 0 | 94,830,975 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,j,k,n74=0,n24=0,n14=0,n4=0,n2=0,ans=0;
cin>>n;
vector<int> p;
p.push_back(2);
for(i=3;i<100;i++){
for(j=0;j<p.size();j++) if(i%p.at(j)==0) break;
if(j==p.size()) p.push_back(i);
}
vector<int> c(p.size());
for(i=2;i<=n;i++){
k=i... | 0 | 161,636 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int x, y;
cin >> x >> y;
if(y<=x*4 && y>=x*2 && y%2==0)
{
cout << "Yes" << endl;
}
else
cout << "No" << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve(... | #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 getDigits(int n){
int digits = 0;
while(n > 0){
n /= 10;
digits++;
}
return digits;
}
int main() {
int N;
cin >> N;
int ans = 0;
... | 0 | 81,927,967 |
#include<iostream>
using namespace std;
int main(void) {
int now, count;
while(true) {
cin >> now;
if(now == 0) { break; }
count = 0;
now = 1000 - now;
while(now > 0) {
if(now >= 500) {
now -= 500;
count++;
} else if(now >= 100) {
now -= 100;
count++;
} else if(now >= 50) {
now ... | #include <iostream>
#include <vector>
long long pow(long long a,long long b,long long mod){
if(b==0){
return 1;
}else{
if(b%2==0){
return pow((a*a)%mod,b/2,mod);
}else{
return (pow((a*a)%mod,b/2,mod)*a)%mod;
}
}
}
int main(){
using namespace std;
... | 0 | 8,262,993 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e7 + 1;
int n, m, k;
long long int cs[N];
int main(){
int n, m;
cin >> n >> m;
cout << n * (n - 1) / 2 + m * (m - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x1) cout<<#x1<<": "<<x1<<endl
#define debug2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
signed main(){
int n; cin >> n;
vector<int> ... | 0 | 34,806,897 |
#include<iostream>
#include<algorithm>
using namespace std;
int n,sz[1000000],par[1000000];
long long d[1000000],chdst[1000000];
pair<long long,int>id[1000000];
bool solve()
{
for(int i=0;i<n;i++)
id[i]=make_pair(d[i],i);
sort(id,id+n);
for(int i=0;i<n;i++)
{
sz[i]=1,par[i]=-2;
chdst[i]=0;
}
for(int i=n-1;i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
string s;
ll k;
cin >> s >> k;
ll cnt = 0;
ll res = 0;
rep(i,s.size... | 0 | 71,063,227 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 3,282,474 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W;
int ans = 0;
cin >> H >> W;
vector<string>S(H);
for (int i = 0; i < H; i++) {
cin >> S[i];
}
int L[H][W];
int R[H][W];
int D[H][W];
int U[H][W];
for (int i = 0; i < H; i++) {
... | 0 | 6,930,629 |
#include "bits/stdc++.h"
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a%b);
}
long long lcm(long long x, long long y) {
return x * y / gcd(x, y);
}
int main() {
long long A,B,C,D;
cin >> A>>B>>C>>D;
A--;
long long ans1 = A / C + A / D - A / (lcm(C, D))... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; a < b; i++);
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se secon... | 0 | 25,281,098 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = { 0, 1, 0, -1 };
static const int dy[4] = { 1, 0, -1, 0 };
static const char dir[4] = { 'u', 'r', 'd', 'l' };
static const ll INF = 1 << 21;
static const ll MOD = 998244353;
ll m... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 89,064,519 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A = 1;
int sum = 1;
for (int i = 0; i < N; i++){
if (K <= A){
sum += K;
}
else {
sum += A;
}
A *= 2;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
int ok[1000001] = {0};
int cnt[1000001] = {0};
for(int i = 0; i < N; i++) {
cnt[A[i]]++;
}
for(int i = 1; i <= 1000000; i++) {
i... | 0 | 100,676,198 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n) ; ++i)
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define emb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define R... | 0 | 41,663,097 |
#include <bits/stdc++.h>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> P;
ll N;
string s;
string ans="";
void judgement(char zero,char one)
{
char animals[100005];
animals[0]=zero;
animals[1]=one;
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, ... | 0 | 90,955,791 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 0 | 4,381,855 |
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) x.begin(),x.... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(ll i=(j);i<(n);++i)
#define rrep(i,n) for(int i=(n);i>=0;--i)
#define ssort(n) sort((n).begin(),(n).end())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define Yes cout << "Yes" << endl
#def... | 0 | 18,087,752 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with... | #include<bits/stdc++.h>
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define vi vector<int>
#define vl vector<ll>
#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,... | 0 | 26,680,935 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m,a[100];
cin>>n>>m;
int popu=0; double sum_a=0;
rep(i,n){
int A;
cin>>A;
a[i]=A;
sum_a+=a[i];
}
rep(i,n){
if(a[i] >= sum_a/(4*m)){
popu++;
... | #include<iostream>
#include<string>
int main(){
std::string x,y;
int a[1001][1001];
int cnt=0;
std::cin>>x;
std::cin>>y;
for(int j=0;j<1001;j++){
for(int k=0;k<1001;k++){
a[j][k]=0;
if(j==0) a[j][k]=k;
if(k==0) a[j][k]=j;
}
}
int b00,b01,b10,b11;
for(int j=1;j<=x.size();j++){... | 0 | 30,883,214 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define PI 3.14159265358979323846
#define endl '\n'
using namespace std;
void solve()
{
int n;
cin >> n;
int cnt = 0;
queue <ll> q;
for(int i = 1; i < 10; i++)
q.push(i);
while(true)
... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<(n);++i)
#define repA(i,j,n) for(i=(j);i<=(n);++i)
#define repD(i,j,n) for(... | 0 | 58,229,689 |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[100];
int main(void) {
int n;
int max = 0;
for (int i = 0; i < 100; i++)a[i] = 0;
while (scanf("%d", &n) != EOF) {
a[n]++;
}
for (int i = 0; i < 100; i++) {
if (a[i] > max)max = a[i];
}
for (int i = 0; i < 100; i++) {
if... | #include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include <iomanip>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<P>v;
bool cmp(P a,P b)
{
return atan2(a.second,a.first)<atan2(b.second,b.first);
}
int main()
{
... | 0 | 12,554,382 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<ll>;
using P = pair<ll,ll>;
int main(){
int n,k;
string s;
cin >>n>>s>>k;
k--;
rep(i,n){
if(s[i]==s[k])cout << s[i];
else cout << "*";
}
cout << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | 0 | 97,874,372 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 0 | 34,683,721 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define INF 10000000
#define rep(i,a,b) for(ll (i)=a;(i)<(ll)(b);(i)++)
using ipair = pair<ll,ll>;
vector<vector<ll>> capacity;
vector<vector<ll>> flow;
vector<ll> pred;
bool findPath(ll s, ll t){
ll N = capacity.size();
pred.assign(N,-1);
... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int L, R;
cin >> L >> R;
if (R - L > 3000)
{
cout << 0 << endl;
return (0);
}
... | 0 | 100,131,791 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define ll long long
#define ld long double
int main(){
ll n; cin >> n;
vector<ll> a(n+1); rep(i,n+1) cin >> a[i];
vector<ll> b(n); rep(i,n) cin >> b[i];
ll destroy = 0;
for(ll i = 1; i <= b.size(); i++){
... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | 0 | 49,579,268 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main()
{
vector<string> ans;
string E = "-";
while ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 33,267,813 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a;
long double b;
cin >> a >> b ;
b*=1000;
a=a*b/1000;
cout << a << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
string s, t;
cin >... | 0 | 85,583,929 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define ... | 0 | 8,162,764 |
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll ... | 0 | 63,867,497 |
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define BACK(x) prev((x).end())... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
while(1){
cin>>a>>b;
if(a==0&&b==0)break;
else{if(a>b)swap(a,b);
cout<<a<<" "<<b<<endl;
}
}
} | 0 | 50,974,188 |
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <ctime>
#include <cstring>
#define ll long long
#define INF 1000000000
#define For(i,a,b) for(int i=a;i<=b;++i)
#define Rev(i,a,b) for(int i=a;i>=b;--i)
#define pb push_back
#define pq priority_queue
#define PI acos(... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int N;
vector<i64> X,Y;
int main() {
cin >> N;
X.resize(N);
Y.resize(N);
for(int i = 0;i < N;i++) {
cin >> X[i] >> Y[i];
}
vector<i64> vec;
{
... | 0 | 97,758,661 |
#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<string, int> mp;
string name;
int s[110];
int main()
{
int n; cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> name >> s[i];
mp[name] = i;
}
cin >> name;
int sum = 0;
for (int i = mp[name] + 1; i <= n; ++i) sum += ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> A;
ll N,M,V,P;
bool check(int p){
if(N-p <= P) return true;
vector<ll> v;
for(int i=0;i<N;i++){
if(v.size() >= N-P) break;
if(i==p) continue;
v.push_back(A[i]);
}
ll ap = A[p] + M;
if(ap < v.ba... | 0 | 72,852,793 |
#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,... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200000];
map<int, vector<int>> e;
long long ans = 0;
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
cin >> n >> k;
e[0].push_back(0);
int t, sum = 0;
for (int i = 0; i < n; i++)
{
cin >> t;
sum... | 0 | 3,195,560 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define INF_LL 1LL << 60
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, con... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int a, b, c, d, f;
cin >> a >> b >> c >> d;
int e = min(min(min(a, b), c), d);
if(e == a){
f = min(min(b, c), d);
}
else if(e == b){
f = min(min(a, c), d);
}
else if(e == c){
... | 0 | 39,592,287 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2050) c... | 0 | 51,356,223 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{ char s[105][105];
int n,m,i,j;
scanf("%d%d",&n,&m);
getchar();
for(i=0;i<n;i++)
{for(j=0;j<m;j++)
scanf("%c",&s[i][j]);
getchar();
}
for(i=0;i<n;i++)
{for(j=0;j<m;j++)
printf... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | 0 | 47,863,436 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,m,x;
cin >> n>>m>>x;
int a[n][m];
int c[n];
rep(i,n+1){
cin >> c[i];
rep(j,m){
cin >> a[i][j];
}
}
int ans=1e9;
for(int bit=0;bit<(1<<n);bit++){
vector<int> is(m,0);... | #include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int sum=0;
int count=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='R')
sum++;
else
sum=0;
if(sum>count)
count=sum;
}
cout<<count<<endl;
return 0;
} | 0 | 40,605,282 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin >> a >> b;
if (a == 1){
a += 13;
}
if (b == 1){
b += 13;
}
if (a == b){
s = "Draw";
}else if (a < b){
s = "Bob";
}else{
s = "Alice";
}
cout << s << end... | #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 | 12,641,866 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int kotae=0;
int ichi=0;
int zero=0;
int n=s.size();
for(int i=0;i<n;i++){
if(s[i]=='0')zero++;
else ichi++;
}
kotae=min(ichi,zero)*2;
cout<<kotae<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 2e9+1;
ll gcd(ll... | 0 | 53,189,895 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
#define MODB 998244353
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& ... | #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 | 29,674,837 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
const int MAX_V = 100;
int V, E;
int s,... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | 0 | 23,763,997 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int dp[105][4][2];
int main(){
string s;
int k;
cin >> s >> k;
int n = s.size();
dp[0][0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < 4; j++){
for(int m = 0; m < 2; m++){
for(int d = 0;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 0 | 22,544,720 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.