code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
string ans;
rep(i, (int)s.size()) {
if (s[i] == 'B') {
if(!ans.empty()) ans.pop_back();
}
else ans += s[i];
}
cout << ans << end... | 0 | 44,414,999 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
int64_t yen = 1000;
int now; cin>>now;
for(int i=0; i<N-1; ++i){
int nxt; cin>>nxt;
yen += max(0L, yen/now * (nxt - now));
now = nxt;
}
cout<< yen <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int DiceInfo[7];
vector<string> DicePosition;
const string WEDirection = "364136";
const string NSDirection = "265126";
const string LRDirection = "453245";
void swap(string &ans, int pos, const string &direction) {
char tmp;
tmp = ans[direction[pos] - '0'];
ans[directio... | 0 | 25,316,421 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, K;
cin >> N >> K;
vector<int> a(N);
... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 55,139,038 |
#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, d;
cin >> n >> d;
int x[n][d];
rep(i, n) rep(j, d) cin >> x[i][j];
int ans = 0;
rep(i, n) rep(j, i) {
int dist = 0;
rep(k, d) { dist += (x[i][k] - x[j][k]) * (... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MO... | 0 | 36,800,523 |
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include <algorithm>
#include <climits>
#include <cstdio>
using uint = unsigned int;
static uint matrix_chain_multiplication(const uint p[], const uint n)
{
uint m[n][n];
for (auto i = 0u; i < n; ++i) m[i][i] = 0u;
for (auto d = 1u; d < n; ++d) {
for (auto i = 0u, j = i+d; j < n; ++i, ++j) {
auto min = ... | 0 | 23,772,185 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
const int MAX_N = 100005;
ll distSum [MAX_N];
int subSize [MAX_N];
vector<int> adj [MAX_N];
void addEdge (int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
void distSumDfs (int vertex, int ... | 0 | 9,090,150 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,r,s1,r1,s2,r2;
int d,d1,d2;
cin>>r;
int n=r.size();
s=r;
reverse(r.begin(),r.end());
d=s.compare(r);
s1=s.substr(0,(n-1)/2);
r1=s1;
reverse(r1.begin(),r1.end());
d1=s1.compare(r1);
s2=r.substr(0,((n+2)/2 )... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int p[M];
string S[M];
for (int i = 0; i < M; i++) cin >> p[i] >> S[i];
bool isOK[N + 1] = {false};
int arrWA[N + 1] = {0};
for (int i = 0; i < M; i++) {
if (isOK[p[i]]) continue;
if (S[i]... | 0 | 42,415,333 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int time = 1900 * M + 100 * (N - M);
int X = time * pow(2, M);
cout << X << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
vector<int> ns;
int temp, max_n = 0;
while(cin >> temp){
ns.push_back(temp);
max_n = max(temp, max_n);
}
max_n++;
vector<bool> is_prime(max_n, true);
vector<int> primes;
for(ll i=2;i<max_n;i++... | 0 | 78,109,886 |
#include <bits/stdc++.h>
using namespace std;
int64_t my_div(int64_t a, int64_t b) {
if (a>0){
return a%b;
}
else{
a = -a;
if( a % b==0){
return 0;
}
else{
return b*( a/b + 1) - a;
}
}
}
int main() {
int64_t N, L, T;
cin >> N >> L >> T;
int64_t N_1, N_2;
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 95,223,427 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
double sum=0;
cin>>n;
for(int i=0;i<n;i++){
double x; string u;
cin>>x>>u;
if(u=="JPY") sum+=x;
else sum+=x*380000.0;
}
cout<<fixed<<setprecision(8)<<sum<<endl;
return 0;
} | 0 | 38,554,208 |
#include <iostream>
int main(int argc, char const* argv[])
{
int n, x;
while (std::cin >> n >> x)
{
if( n == 0 & x == 0)
break;
int count = 0;
for (size_t i = 1; i <= n; i++)
for (size_t j = i + 1; j <= n; j++)
for (size_t k = j + 1; k <= n; k++)
if(x - k == i + j)
count++;
std::cout << ... | #include <bits/stdc++.h>
#define pi 3.14159
#include <map>
#include <iterator>
using namespace std;
int main()
{
long long int n,i,j,f=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
map<int,int>arr;
map<int, int>::iterator itr;
for(i=0;i<n;i++)
{
arr[a[i]]++;
}
for( itr=arr.begin();itr!=arr... | 0 | 74,279,946 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int R=-1, G=4501;
cin >> R >> G;
if(R<0||4500<G) cout << "入力エラー(制約 : 0≦R, G≦4500)" << endl;
else cout << G*2.0 -R << endl;
} | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<vector<char> >ar(n,vector<char>(m));
vector<vector<long long int> >dp(n,vector<long long int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>ar[i][j];
... | 0 | 44,628,670 |
#include <stdio.h>
int main(){
int x,sum;
sum=1;
while(sum!=0){
sum=0;
while((x=getchar())!='\n'){
sum+=x-'0';
}
if(sum==0){
break;
}
printf("%d\n",sum);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll num;
cin>>num;
vector<ll>arr(num);
map<int,ll>rel;
for(int i=0; i<num; i++)
{
cin>>arr[i];
rel[arr[i]]++;
}
ll sum=0;
for(auto var : rel)
{
ll n=var.second;
sum+=n*(n-1)/2;
}
for(int i=0; i<num; i++)
{
int temp=arr... | 0 | 100,115,997 |
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | #define _USE_NATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | 0 | 45,424,848 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int N; cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int k =... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n+1);
vector<ll> b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i... | 0 | 31,973,235 |
#include <cmath>
#include <iostream>
#include <cstdio>
#include <ctype.h>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <sstream>
using namespace std;
int main()
{
int n;
long ans;
cin >> n;
ans = n;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
const ll mod=1e9+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll q,h,s,d,n;
cin>>q>>h>>s>>d>>n;
n*=4... | 0 | 52,273,971 |
#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_set>
#includ... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 97,933,736 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
#d... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 24,692,887 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n), y(m), z;
rep(i, n) cin >> x[i];
rep(i, m) cin >> y[i];
sort(x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n;
cin >> n;
vec x(n),y(n);
for(ll i=0;i<n;i++) cin >> x[i] >> y[i];
ll ans=0;
for(ll i=0;i<n;i++) {
for(... | 0 | 25,124,574 |
#include<iostream>
using namespace std;
void dfs(int n,int s,int k);
int ans=0;
int main(){
int n,sum;
while(cin>>n>>sum , n||sum){
ans=0;
dfs(n,sum,0);
cout<<ans<<endl;
}
}
void dfs(int n,int sum,int k){
if(n<0){
return ;
}
if(n==0){
if(sum==0){
ans++;
}
}
else{
if(9<k){
return ;
}
for(... | #include <iostream>
using namespace std;
const int MAXN = 1e5 + 5;
int n,k;
int niz[MAXN];
long long pref[MAXN];
long long ppref[MAXN];
int main () {
cin >> n >> k;
for (int i = 0 ; i < n; i ++) {
cin >> niz[i];
}
pref[0] = niz[0];
if (niz[0] > 0) {ppref[0] = niz[0];}
else {ppref[0] = 0;... | 0 | 20,329,317 |
#include <iostream>
#include<string>
#include<cctype>
using namespace std;
int main() {
string str,ab,order;
char temp;
int q,a,b;
cin>>str>>q;
while(q--){
cin>>order;
if(order=="replace"){
cin>>a>>b>>ab;
str.replace(a,b-a+1,ab);
}
if(order=="reverse"){
cin>>a>>b;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> a(M, 0);
for(int i = 0; i < M; i++) cin >> a[i];
ll ans = 0;
ll dp[N + 1] = {0};
for(int i = 0; i <... | 0 | 49,337,209 |
#include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
int main() {
int64_t n; cin >> n;
vector<int> pf;
for (int64_t i = 2; i * i <= n; ++i) {
if (n % i) continue;
int cnt = 0;
while (n % i == 0) {
++cnt;
n /= i;
}
pf.pu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2*acos(0.0)
#... | 0 | 33,652,162 |
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define TESTCASES() cin >> (T3X0); T353 = T3X0; while(T3X0--)
#define _input(V3C) for(auto &V3C_I7 : (V3C)) cin >> (V3C_I7)
#define mems(A77AY, V4LU) memset((A77AY), (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 100100;
int main()
{
int n;
cin >> n;
vector<int> dp(n + 1, INF);
dp[0] = 0;
for (int i = 1; i <= n; i++)
{
for (int pow = 6; pow <= i; pow *= 6)
... | 0 | 1,016,960 |
#include<iostream>
using namespace std;
int main(){
int N, A[100];
cin >> N;
for(int i=0; i<N; i++){
cin >> A[i];
}
int min=A[0], max=A[0];
for(int j=1; j<N; j++){
if(A[j] < min) min = A[j];
if(A[j] > max) max = A[j];
}
cout << abs(max - min);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<pair<int,int>> edge(M);
for(int i=0; i< M; i++){
cin >> edge.at(i).first >> edge.at(i).second;
}
vector<int> node(N);
for(int i=0; i<N; i++){
node.at(i) = i+1;
}
sort(node.begin(), node.end());
int cou... | 0 | 73,825,630 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
sort(A.begin(), A.end(), greater<long long>());
long long res = 0;
for (int i = 0; i < K; ++i) res += A[i];
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n-1; i >= (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i,... | 0 | 30,305,918 |
#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
#define int long long
using pii=std::pair<int,int>;
using namespace std;
const int maxn = 1e5 + 5;
int n, u, v, dp[2][maxn];
vector<int> adj[maxn];
void dfs(int x, int p)
{
int ways[2] = {1, 1};
for(auto v : adj[x])
if(v != p)
{
df... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 7,676,108 |
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9
using namespace std;
typedef long long ll;
int n, v[200002];
deque<pair<int, int> >d;
bool chk(int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | 0 | 22,338,301 |
#include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
int main() {
double x1, y1, x2, y2, x3, y3, xp ,yp,ss,s1,s2,s3;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
ss=fabs((x3-x1)*(y2-y1)-(x2-x1)*(y3-y1));
s1=fabs((x3-xp)*(y2-yp)-(x2-xp)*(y3-yp));
s2=fabs((x3-xp)*(y1-yp)-(x1-xp)*(y3-yp));
s3=fabs... | #include<cstdio>
#include<cstdlib>
using namespace std;
int d[100100];
int beg[100100],nex[200100],tto[200100],e;
void putin(int s,int t){
tto[++e]=t;
nex[e]=beg[s];
beg[s]=e;
}
int f[100100];
void dfs(int u,int fa){
for(int i=beg[u];i;i=nex[i]){
if(tto[i]==fa) continue;
dfs(tto[i],u);
}
int cnt=0;
for(int i... | 0 | 100,880,059 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int r,g,b;
int k;
cin>>r>>g>>b>>k;
while(g<=r){
k--;
g*=2;
}
while(b<=g){
k--;
b*=2;
}
if(k>=0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;
if(t... | 0 | 29,175,411 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int a[4];
int main(){
for(int i = 0; 6 > i; i++){
int tmp;cin>>tmp;tmp--;
a[tmp]++;
}
vector<int> z;
for(int i = 0; 4 > i; i++){
z.push_back(a[i]);
}
sort(z.begin(),z.end());
for(int i = 0; 4 > i; i++){
if(i < ... | 0 | 17,165,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
string s, ... | #include<iostream>
using namespace std;
#define ll long long
ll n;
ll a[100005];
ll dp[100005];
const ll Inf = 1e10;
ll MinCostToReachFromNToZero(ll N){
if(dp[N] != -1)return dp[N];
if(N <= 0) return 0;
ll ans = abs(a[N] - a[N-1]) + MinCostToReachFromNToZero(N-1);
if(N-2 >= 0){
ll ans2 = abs(a[N] - a[N-... | 0 | 91,962,247 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstdio>
#include <complex>
#include <numeric>
#include <string.h>
#include <random>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using nam... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 72,821,170 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Pi acos(-1)
int mai... | 0 | 24,603,571 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define REP(i,j,n) for(int i = j;i < (n);i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main(){
ll N, M, K;
cin >> N >> M >> K;
string ans = "No";
rep(i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, a, n) for(int i=a; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
int sum=0;
vector<int> a(n);
for(int i... | 0 | 30,926,287 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define mod(x) ((x % MOD) + MOD) % MOD
#define int long long int
#de... | #include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll... | 0 | 59,813,601 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int l1,l2,i,j,ans,m;
char s1[1002],s2[1002];
scanf("%s%s",s1,s2);
l2=strlen(s2);
l1=strlen(s1);
l1=l1-l2+1;
for(i=0,ans=0;i<l1;i++)
{
for(j=0,m=0;j<l2;j++)
{
if(s1[i+j]=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1234567;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int>a(N);
int cnt = 1;
int res = 0;
for(int i = 0; i < N; i++) {
... | 0 | 54,512,947 |
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define replet(c) for(char c='a';c<='z';c++)
#define LL long long
#define pii pair <LL,LL>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#define sqr(a) ((a)*(a))
u... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N, H, W;
cin >> N >> H >> W;
long long cnt = 0;
for (int i = 0; i < N; i++){
long long A, B;
cin >> A >> B;
if (A >= H && B >= W){
cnt++;
}
}
cout << cnt << endl;
} | 0 | 85,894,267 |
#include <iostream>
#define NIL -1
struct Node {
int parent, left, right;
};
int getDepth(Node* nodeList, int index)
{
int parent = nodeList[index].parent;
int depth = 0;
while (parent != NIL) {
depth++;
parent = nodeList[parent].parent;
}
return depth;
}
std::string getType(Node* node)
{
... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int N;
string S;
bool dfs(vector<int> &ans, vector<int> &ret, int idx) {
if (idx == N - 1) {
if ((ret[idx] == 1 && S[idx] == 'o') || (... | 0 | 49,287,844 |
#include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int,int> P;
int W,H;
bool used[200020];
int restx,resty;
P costs[200020];
int main(int argc, const char * argv[]) {
scanf("%d%d", &W,&H);
restx = W+1;
resty = H+1;
for(int i=0;i<W;++i) {
int p;
scanf("%d", &p);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) cin >> H[i];
ll mi = 0;
int ans = 0;
for (ll h : H)
{
if (mi <= h)
{
mi = h;
... | 0 | 29,964,446 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<tuple<int,int,int>> a(m+1);
for(int i=1; i<=m; i++) {
int p, y;
cin >> p >> y;
a[i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 68,021,784 |
#include <bits/stdc++.h>
using namespace std;
int ans[26];
int main() {
int a,b,c,d;
cin >>a >>b>>c >> d;
int start = max(a,c);
int end = min(b,d);
if(start < end){
cout << end-start <<endl;
}
else{
cout << 0 <<endl;
}
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | 0 | 78,683,459 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 0; i < 3000; i++){
int x, y;
cin >> x >> y;
if(x == 0 && y == 0) break;
else{
if(x > y) swap(x, y);
cout << x << " " << y << endl;
}
}
} | #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 li = unsigned long long int;
using namespace std;
int main() {
fastIO;
string s;
cin >> s;
bool word[26]{false}... | 0 | 31,330,089 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
printf("%.10f", ans);
return 0;
} | #include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define rloop(m,n) for(m=n-1;m>=0;m--)
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define n... | 0 | 99,659,946 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#de... | 0 | 28,144,807 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
} | #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... | 0 | 40,924,633 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
int main(){
str... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 79,599,950 |
#include "iostream"
#include "vector"
#include "string"
#include "algorithm"
#include "math.h"
#include "cstring"
#include "stack"
#include "queue"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll> > mat;
int main()
{
int n, k;
cin >> n >> k;
... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 72,418,309 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int_Max 2147483647
#define ll_Max 9223372036854775807
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int ans = 0, n;
int t=0, x=0, y=0;
int t2, x2, y2;
cin >> n;
REP(i,0,n){
cin >> t2 >> x2 >> y2;... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | 0 | 99,418,053 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 35,707,451 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll amari = n % (a + b);
ll ans;
ans = ((n - amari) / (a + b)) * a;
if(amari <= a) {
ans += amari;
} ... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
#define for1(n) for... | 0 | 84,415,006 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#define F first
#define S second
using namespace std;
int n;
long long m;
int d;
int p;
pair<int,int> a[11111];
int main(void){
while(cin >> n >> m){
if(!n) break;
for(int i = 0; i < n; i++){
cin >> d >> p;
a[i] = make_pair(p,d);
}
... | #include <bits/stdc++.h>
#include <vector>
#include <string>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
... | 0 | 90,229,581 |
#include <iostream>
#include <vector>
using namespace std;
vector<int> g[100010];
long long a[100010],c=0,sum = 0;
long long dfs(int r,int p){
if(g[r].size()==1){
return a[r];
}
long long sum = 2*a[r];
for(int i=0;i<g[r].size();i++){
if(g[r][i]!=p){
long long x = dfs(g[r][i],r);
sum -= x;
if(x>a[r]){
... | #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 2e12
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using P = ... | 0 | 89,867,573 |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<stdlib.h>
#include<algorithm>
using namespace std;
typedef long long int lli;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli t, n, i, ans, x, m, y, j, cnt;
cin >> n >> t;
cout << n-t+1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 45,074,665 |
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int sum = 0;
for(int i=0; i<n-1; i++){
sum += abs(a[i+1]-a[i]);
}
sum += abs(a[0])+abs(a[n-1]);
int sum... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
void print_vector(vector<T>& vec) {
cout << "print_vector -> ";
for(int i=0; i<vec.size(); i++) {
if(i == vec.size()-1) {
cout << vec[i] << endl;
}
else {
cout << vec[i] << " ";
}
}
... | 0 | 21,669,564 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int N;
int main(){
cin>>N;
LL ans = 0;
for (int i=1; i<=N; i++) ans += 1LL*i*(N-i+1);
for (int i=1; i<=N-1; i++){
int u,v; cin>>u>>v;
if (u>v) swap(u,v);
ans -= 1LL*u*(N-v+1);
}
printf("%lld\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false)
#define ll long long
ll a[300300], b[302000], vs[3000000];
vector<ll>v;
int main()
{
IO;
ll i, j=1, k = 0, mod = 1e9+7, m, mx, n, l = 1, p, t, h, kk=0, cnt=0;
cin>>n>>m;
for(i=1; i<=n; i++) j*=2;
if(m==1&&n==1)... | 0 | 63,533,010 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <st... | #include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | 0 | 59,317,788 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <numeric>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define repr(i,n) for (int i = n; i > 0; --i)
using namespace std;
using ll = long long;
using P = pair<int,int>;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll gcd(int a,int b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(int a,int b){return a*b/gcd(a,b);}
const int IN... | 0 | 72,639,220 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N = 1010;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int _w;
int n, m;
char str[N][N];
int dis[N][N];
queue<pii> q;
bool inside( int x, int y ) {
return x >= 1 && x <= n && y >= 1 && y <= m;
}
int main() {
_w = sca... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
ll sum[n + 1] = {};
rep(i, 0, n) {
int a;
cin ... | 0 | 3,975,357 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#define rep(i, a, b) for ( long long i = (a); i < (b); i++ )
#define per(i, a, b) for ( long long i = (b)-1; i >= (a); i--)
#define pb push_back
#define bg begin()
#define en end()
#define DEB... | #include <iostream>
using namespace std;
int main(){
int d;
while(cin >> d){
int n = 600/d;
int sum=0;
for(int i=1;i<n;i++){
sum+=d*(i*d)*(i*d);
}
cout << sum << endl;
}
} | 0 | 56,298,829 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include"bits/stdc++.h"
#define rep(i, N) for(int i = 0;i < N;i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int sum(vector<int> v) {
int res = 0;
for (auto x : v)res += x;
return res;
}
int main(void) {
int N, M; cin >> N >> M;
vector<int> ac(N, 0);
vector<int> pen(N, 0);
rep(unchi, M)... | 0 | 19,994,021 |
#include <cstdio>
#include <functional>
#include <algorithm>
#include <vector>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iostream>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
#include <queue>
#include <map>
using namespace std;
#define INF (1ll<<60)
#define INFint (1<<30)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
vector<char> T(N);
for(int i = 0; i < N; i++) {
cin >> T.at(i);
}
map<char, int> Points{{'r', R}, {'s', S}, {'p', P}};
map<char, char> my_hands{{'r', 'p'... | 0 | 87,883,107 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
const int maxm = 5e5 + 5;
const ll inf = 2147483647;
int n, m, k;
int a[101], b[101];
int main(){
int n;
cin>>n;
for(int i = 0; i < n; i++)cin>>a[i];
for(int i = 1; i < n; i++){
b[i] = a[i] - a[i - 1];
... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
int main()
{
ll s,a,b,c,d;
cin>>s; cout<<0<<" "<<0<<" ";
a=1e9; if(s%a==0) b=s/a; else b=s/a+1;
ll s2=a*b-s; cout<<a<<" "<<1<<" "<<s2<<" "<<b<<endl;
return 0;
} | 0 | 92,692,394 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x=0,y=0,z=0,w=0;
for(int i=0;i<6;i++){
int n;cin>>n;
if(n==1)x++;
else if(n==2)y++;
else if(n==3)z++;
else w++;
}
if(x*y*z*w==4)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 97,561,763 |
#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 n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int c0 = 0, c1 = 0, c2 = 0, c3 = 0;
for (auto t : s) {
rep(j, t.size() - 1) if (t.s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 11,497,991 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
const int MAX = 1e6;
ll fac[MAX], finv[MAX], inv[MAX];
ll modpow(ll a, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | 0 | 54,080,535 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(10);
for(int i=0;i<10;i++)cin>>a[i];
sort(a.begin(),a.end());
for(int i=9;i>=7;i--)cout<<a[i]<<endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep... | 0 | 100,044,218 |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int d;
cin >> d;
if(d == 25) {
cout << "Christmas";
}
if(d == 24) {
cout << "Christmas Eve";
}
if(d == 23) {
cout << "Christmas Eve Eve";
}
if(d == 22) {
cout << "Christmas Eve Eve ... | 0 | 48,168,756 |
#include <stdio.h>
int main()
{
int n;
int i;
int debt = 100000;
scanf("%d",&n);
for(i = 0; i < n; i++){
debt = (int)(debt * 1.05);
if(debt % 1000 != 0){
debt = (int)(debt / 1000) * 1000 + 1000;
}
}
printf("%d\n",debt);
return 0;
} | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 0 | 47,083,289 |
#include<bits/stdc++.h>
#define ll long long
#define debug(x) cout<<x<<"DE"<<endl;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m,s=0;
cin>>n;
ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i==1)m=l1[i];
else m=__gcd(m,l1[i]);... | #include<bits/stdc++.h>
#define FILEIN freopen("input.txt", "r", stdin)
using namespace std;
#define ll long long
#define endl "\n"
const ll INF = 1e9;
int main(){
string s;
cin>>s;
for(int i = 0; i<s.length(); i++){
if(s[i] == s[i+1]){
cout<<i+1<<" "<<i+2<<endl;
return 0;
... | 0 | 75,827,433 |
#include <iostream>
#include <cmath>
int main() {
int n;
std::cin >> n;
while(n--){
double x1, y1, x2, y2, x3, y3, x4, y4;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
int ix1 = round(x1*100000), iy1 = round(y1*100000),
ix2 = round(x2*100000), iy2 = round(y2*100000),
ix3 = round(x3*... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
typedef long long L... | 0 | 25,384,696 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n], b[n];
for(int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
long long int push_sum = 0;
for(int i = n-1; i >= 0; --i) {
if((push_sum + a[i])%b[i] != 0)
push_sum += b[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 70,193,075 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,... | 0 | 76,613,144 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
int n; cin >>n;
map<string, int> mp;
vector<string> s(n);
rep(i,n){
cin >>s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll ans = 0;
for(string t : s){
if(mp[t]>1... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 0 | 80,067,929 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
if(n==1) {
cout<<"0"<<endl;
return 0;... | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<int> v(n), cpy;
for(int i = 0; i < n; ++i){
... | 0 | 87,647,727 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <cmath>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep1(i,n) for(long long i=1; i<=(long long)(n);i++)
#define rep-(i,n) for(long long i=n;i>=0;i--)
typedef long long ll;
const ll inf = 1e18+7;
const ll mod = 1e9+7;
int mai... | #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;
ll ans = 0;
cin >> N;
vector<ll> A(N);
vector< vector<ll> > B(60, vector<ll>(N+1));
ll all_a = 0;
REP(i, N) {
ll ain;
cin >> A[i];
all_a ^= A[i];
}
REP(i,N) A[i] ... | 0 | 17,268,780 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
char s1[10], s2[10], s3[10];
char ans[4] = {'\0'};
cin >> s1 >> s2 >> s3;
ans[0] = s1[0] - 32;
ans[1] = s2[0] - 32;
ans[2] = s3[0] - 32;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
int main()
{
int E;
std::cin >> E;
int a = (E / 1000) % 10;
int b = (E / 100) % 10;
int c = (E / 10) % 10;
int d = (E / 1) % 10;
std::vector<std::vector<int>> P = {{1, 1, 1}, {1, 1, -1}, {1, -1, 1}, {1, -1, -1}, {-1, 1, 1}, {-1, 1, -1}, {-1, -1, 1}, {-1, -1, -1}};
... | 0 | 21,276,591 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
const ll mod = 1e9+7;
int main(){
int n,m;
cin >> n >> m;
int ans=0;
ans=1900*m+100*(n-m);
ans*=1 << m;
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a... | 0 | 96,508,114 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
typedef long long ll;
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, ... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long int;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b... | 0 | 48,621,934 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin>>a>>b;
string s; cin>>s;
for(char c:s.substr(0,a)) if('0'>c||c>'9'){
cout<<"No"; return 0;
}
if(s.substr(a,1)!="-"){
cout<<"No"; return 0;
}
for(char c:s.substr(a+1,b)) if('0'>c||c>'9'){
cout<<"No"; return 0;
}
cout<<"... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int A[N+1];
int L[N+1];
for(int i=1;i<N+1;++i){
cin >> A[i];
}
A[0]=-1;
L[0]=-1;
L[1]=A[1];
int length=1;
for(int i=1;i<N+1;++i){
if(L[length] < A[i]) L[++length] = A[i];
if(L[1] > A[i] ) L[1]=A[i];
else{
... | 0 | 24,438,129 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define f first
#define s second
#define mp make_pair
using namespace std;
ll func(ll n, ll x)
{
if(n<x) swap(n,x);
if(n%x==0) return 2*(n/x)*x-x;
return 2*(n/x)*x+func(n%x,x);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n,x... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 32,401,817 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | #include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,sizeof(a))
using namespa... | 0 | 90,281,305 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 0 | 45,474,086 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 44,716,219 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
int n,a,b; cin >> n >> a >> b;
int dai = 0, chu = 0, sho=0;
for(int i = 0; i < n; i++){
int p; cin >> p;
if(p <= a) sho++;
else if(p <= b) chu++;
else dai++;
}
cout <... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
const int T = 24 * 60 * 60;
int d[T];
int to_in... | 0 | 40,665,158 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef unsigned long long LL;
LL N;
vector<LL... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | 0 | 91,199,692 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;scanf("%d",&N);
int a[N],ans=0;
for(int i=0;i<N;i++){scanf("%d ",&a[i]);a[i]--;}
for(int i=0;i<N;i++)if(a[a[i]]==i)ans++;
printf("%d\n",ans/2);
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return... | 0 | 42,621,638 |
#include<stdio.h>
int main(){
char a[7];
scanf("%s", a);
if ((a[0]==a[1]&&a[0]!=a[2])||(a[2]==a[1]&&a[0]!=a[2])||
(a[0]==a[2]&&a[1]!=a[2])){
puts("Yes");
}
else{
puts("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<ll> c(n);
rep(i,n) {
int at;
cin >> at;
at--;
a[i] = at;
c[at]++;
}
ll count = 0... | 0 | 2,150,660 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#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()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#def... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
int n,k;
ll ans = -(1LL<<60);
cin >> n >> k;
vector<ll> a(n),s1(n+1,0),s2(n+1,0);
for(int i = 0;i < n;i++){
cin >> a[i];
s1[i+1] = s1[i] + a[i];
if(a[i] >= 0) s2[i+1] = s2[i] + a[... | 0 | 23,435,570 |
#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>;
ll dp[110][110];
int main() {
int h, w;
cin >> h >> w;
vector<vector<bool>> v(h,vector<bool>(w));
rep(i,h)rep(j,w) {
char c;
cin >> c;
if(c=='#') v[i][j] = fals... | #include<bits/stdc++.h>
using namespace std;
struct Dice
{
int x, y;
int l, r, f, b, d, u;
void RollF()
{
--y;
int buff = d;
d = f;
f = u;
u = b;
b = buff;
}
void RollB()
{
++y;
int buff = d;
d = b;
b = u;
u = f;
f = buff;
}
void RollL()
{
--x;
... | 0 | 95,158,513 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(i = 0; i < n; ++i)
int score[100];
int n, i, k, ans;
int main() {
for(;;) {
scanf("%d", &n);
if(n == 0) break;
REP(i, n) scanf("%d", &score[i]);
sort(score, score + n);
int ans = 0;
for(int j = 1; j <= n - 2; ++j) ans += score... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | 0 | 40,061,158 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 44,877,794 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1 << 30);
int main() {
int n,h[110000];
cin >> n;
for(long i =... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 37,322,918 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int s;
cin>>s;
vector<int> c(1000000);
c[0]=s;
for(int i=0;i<1000000;i++){
if(c[i]%2==0){
c[i+1]=c[i]/2;
}
else if(c[i]%2==1){
c[i+1]=3*c[i]+1;
}
}
for(int i=0;i<=1000000;i++){
... | #include <iostream>
using namespace std;
int main(){
int mini, n, array[100], sw=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> array[i];
}
for(int i=0;i<n;i++){
mini = i;
for(int j=i+1;j<n;j++){
if(array[mini]>array[j]){
mini = j;
}
... | 0 | 87,383,686 |
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<iterator>
#include<iomanip>
#include<string>
using namespace std;
int main()
{
long long int a;
float b;
cin>>a>>b;
int c=100.05*b;
cout<<fixed<<setprecision... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 69,246,997 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin >> N >> A;
cout<<(N+A+1)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.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 ch... | 0 | 23,825,177 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int sum1=0,sum2=0;
int m;
for(int i=0;i<4;i++){
cin >> m;
sum1+=m;
}
for(int i=0;i<4;i++){
cin >> m;
sum2+=m;
}
if(sum1>=sum2){
cout << sum1 << endl;
} else{
cout << sum2 << endl;
}
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, ... | 0 | 100,014,440 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < (int)S.length(); i++)
{
if (S[i] == '0')
{
ans++;
}
}
ans = min(ans, (int)S.length()-ans) * 2;
cout << ans << endl;
}
int main() {
sol... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define be(v) (v).begin(), (v).end()
int main() {
int n; cin >> n;
vint a(n);
vint b(n);
rep(i,n) {
cin >> a[i];
b[i]=a[i];
}
sort(be(b));
reverse(be(b));
int max... | 0 | 81,448,120 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int a,b;
cin >> a >> ... | #include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
string s;
while( getline( cin, s ) ) {
if ( s == "." )
break;
bool b = true;
stack<char> t;
t.push( '\0' );
for( auto c : string( s.cbegin(), s.cbegin... | 0 | 17,051,902 |
#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 <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n;
cin >> n;
vector<string>anaglam(n);
map<string, ll>mp;
for (int i = 0; i < n; i++) {
cin >> anaglam[i];
sort(anaglam... | 0 | 40,674,564 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v).end()
#define allr(v)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> h >> n;
int mx = h + 10010;
const int INF = (int)1e9;
vector<int> dpOld(mx, INF), dpNew(mx, INF);
dpOld[0] = 0;
wh... | 0 | 62,469,777 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.