code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int p,q,r;
cin>>p>>q>>r;
int sum;
sum = p+q+r - max(p,max(q,r));
cout<<sum<<endl;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 16,975,960 |
#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;
int main() {
io... | #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() {
string s,t; cin>>s>>t;
reverse(s.begin(),s.end());
reverse(t.begin(),t.end());
string s1 = s;
int m = s.size();
int n = t.size();
rep(i, m){
if(s[i] ==... | 0 | 22,607,919 |
#include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
int* a = new int[n];
long int min, max, sum;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum = sum + a[i];
}
cout << min << "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr ... | 0 | 77,537,612 |
#include<cstdio>
#include<iostream>
using namespace std;
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define rep0(i,n) rep(i,0,n)
#define MD 1000000007
char sep[2] = {' ', '\n'};
int main() {
int i, j, k, l, m, n, x, y, z;
while(true) {
cin >> n >> x;
if (n == 0 && x == 0) break;
z = 0;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
using... | 0 | 684,896 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
ll binary_search(
ll lo, ll hi, function<bool(ll)> is_ok,
bool maximize
){
while(lo < hi){
if(maximize){
const ll mid = (lo + hi + 1) / 2;
... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int m = 0, f = 0, r = 0, count = 0;
string grade[100];
while (1){
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1) grade[count++] = "F";
else if (m + f >= 80) ... | 0 | 16,888,336 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 542,290 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int64_t first = 0;
int64_t second = 2;
int64_t answer = 1;
for (int i=0;i < N - 1; i++){
first = second;
second = answer;
answer = first + second;
}
printf("%ld",answer);
} | #include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | 0 | 91,509,451 |
#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() {
string s;
cin >> s;
int cnt=0;
int64_t ans=0;
rep(i,s.length()){
if(s[s.length()-i-1]=='B'){
ans+=cnt;
}
else cnt++;
}
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
string str;
char ch;
int px,py;
int main()
{
cin>>str; px=py=-1;
int lg=str.length();
if(str[0]==str[1])
{
cout<<1<<' '<<min(lg,3)<<'\n';
return 0;
}
for(int i=2; i<lg; ++i)
if(str[i-1]==str[i] || str[i-2]==str[i]... | 0 | 13,982,340 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; ... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin()... | 0 | 86,162,791 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#d... | 0 | 60,433,811 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (auto &x : A) cin >> x;
int ans = A.at(0);
for (int i = 1; i < N; ++i) {
ans = __gcd(ans, A.at(... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
bool compare(const pair<int,int> &A,const pair<int,int> &B){
if(A.first!=B.first) return A.first<B.first;
else return A.second<B.second;
}
int main(void){
int n;
while(cin>>n,n){
vector<pair<int,in... | 0 | 8,644,708 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
template <class T>
class dice {
public:
dice() {
id[TOP] = 0; id[FRONT] = 1; id[LEFT] = 2;
id[RIGHT] = 3; id[BACK] = 4; id[BOTTOM] = 5;
}
T& operator[] (FACE f) { return var... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9+7;
using ipair= pair<int,int>;
bool operator>(const ipair a,const ipair b){return a.first > b.first;};
int main(){
int N,M;
... | 0 | 68,534,532 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n,Y;
cin>>n>>Y;
... | 0 | 42,103,456 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); i++)
int main() {
int N, Q, t, u, v, res;
cin >> N >> Q;
dsu d(N);
REP(i, Q) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 84,802,250 |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
template <typename T,typename U>
struct compressor{
vector<pair<T,U>> v;
void add(T x,U y){
v.emplace_back(x,y);
}
void compress(){
sort(v.begin(),v.end());
vector<pair<T,U>> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[250000],n;
bool comp(ll a,ll b)
{
return a>b;
}
ll segment(ll i)
{
if(i==n)
return i-1;
if(arr[i]!=arr[i+1])
return i;
return segment(i+1);
}
int main()
{
ll tc,m,i,a=1,b,flag=0,cnt=0;
cin>>n;
for(i=0;i... | 0 | 32,338,564 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int N,V,P;
long long M;
cin>>N>>M>>V>>P;
long long A[100000],emp[100000];
for(int i=0;i<N;i++) cin>>A[i];
sort(A,A+N);
emp[N-P]=0;
for(int i=N-P-1;i>=0;i--){
emp[i]=A[N-P]-A[i];
emp[i]+=emp[i+1];
}
in... | 0 | 43,288,767 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = (s.length() - 1) / 2;
string rs = s, fs = s.substr(0, l), ss = s.substr(l + 1, l), rfs = fs, rss = ss;
reverse(rs.begin(), rs.end());
reverse(rfs.begin(), rfs.end());
reverse(rss.begin(), rss.end());
cout << ((s == rs... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 53,731,805 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<bitset>
using namespace std;
char p[8010];
bitset<16384>T;
int x, y, C[8010], ex, ey;
bool OK(int st, int d, int ed) {
int t = abs(ed - st);
if (t % 2 == d % 2 && t <= d)return true;
return false;
}
bool Pos(int ck, int d) {
if (abs(d) > 8000)return fal... | #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 | 71,229,374 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int nxt[20][100000], rev[20][100000];
int main(){
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
vector<int> y(n);
for(int i = 0; i < n; i++) y[i] = 1e9-x[n-1-i];
int l;
cin >> l;
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl... | 0 | 62,656,041 |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 200005
#define ll long long
using namespace std;
int n,i,j,k,a[maxn],d[maxn],v[maxn],w;
int check(int K){
if (K==1){
for(int i=2;i<=n;i++) if (a[i]<=a[i-1])
return 0;
return 1;
}
w=1,d[w]=a[1],v[w]=0;
for(i=2;i<=n;i++) if (a... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 29,034,026 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k;cin>>k;
string s; cin>>s;
int len = s.size();
if(len>k)
{for(int i= 0;i<k;i++)
cout<<s[i];
cout<<"..."<<endl;
}
else{
cout<<s<<endl;
}
} | #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 h,w,k;
cin >> h >> w >> k;
int hpush,wpush;
bool ok=false;
rep(i,h+1){
rep(j,w+1){
hpush = i;
wpush = j;
int masu = hp... | 0 | 95,389,371 |
#include<bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 303
int n, m;
int h[ran];
i64 f[ran][ran][ran];
void upd(i64 &a, i64 b) {
if(a<0 || a>b) a = b;
}
int main() {
scanf("%d%d", &n, &m);
for(int i=1;i<=n;i++) scanf("%d", &h[i]);
h[0] = 0;
memset(f, -1, sizeof f);
f[0][0][0] = 0;
for... | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
int main()
{
int i,j;
int n;
int ans;
char a[3],b[3];
while(1)
{
scanf("%d",&n);
if(n==0){break;}
else
{
ans=0;
for(i=0;i<(n/2);i++)
{
scanf("%s %s",a,b);
if((a[0]!=b[0])&&(a[1]==b[1]))
{
... | 0 | 18,827,116 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
size_t H;
scanf("%zu", &H);
vector<int> A(H+1);
for (size_t i=1; i<=H; ++i)
scanf("%d", &A[i]);
for (size_t i=1; i<=H; ++i) {
printf("node %zd: ", i);
printf("key = %d, ", A[i]);
if (i>>1)
... | 0 | 71,620,841 |
#include<bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rept(i,n) for(int i=n;i>0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(v) v.bigin(),v.end()
using namespace std;
int main(){
int h,n;
cin>>h>>n;
int a[n];
rep(i,n){
cin>>a[i];
h-=a[i];... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
int main(){
int N;
cin >> N;
vector<P> R(N),B(N);
rep(i,N){
cin >> R[i].first >> R[i].second;
}
rep(i,N){
cin >> B[i].first >> B[i].second;
}
... | 0 | 35,931,892 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, C, K;
cin >> N >> C >> K;
int T[N];
rep(i, N) { cin >> T[i]; }
sort(T, T + N);
int ans = 1;
int total = 1;
int t = T[0];
for (int i = 1; i < N; i++) {
if (T[... | #ifndef atcoder_defs_hpp
#define atcoder_defs_hpp
#include <cstdio>
#include <cstdint>
#include <cinttypes>
#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
using i8t = std::int64_t;
using u8t =... | 0 | 26,834,914 |
#include <cstdio>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 4e5;
int A[N], B[N];
int main(){
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if(((ll)a*(ll)b<(ll)n) || (a+b>n+1)){
puts("-1");
return 0;
}
int i, j;
for(i=1; i<=n; i++... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define sz(x) (ll)x.size()
#define all(x) x.begin(),x.end()
#define trav(a,x) for(auto &a:x)
#define fr(i,a,b) for(ll i=a;i<=b;i++)
#define fr1(i,a) for(ll i=0;i<a;i++)... | 0 | 83,226,054 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
const ll MOD = 1000000007;
using namespace std;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
int main(void)
{
int n;
cin >> n;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int ans =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
string s, t; cin >> s >> t;
int res = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] != t[i]) res++;
}
cout << res;
return 0;
} | 0 | 79,080,067 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll count = 0;
ll a[n];
ll mi = INT_MAX;
for(int i = 0;i<n;i++)
{
cin>>a[i];
mi = min(mi,a[i]);
if(mi==a[i]) count++;
}
cout<<count<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string Yes="Yes";
string YES="YES";
string NO="NO";
string No="No";
template<class T> inline bool chmax(T& a, T b) { i... | 0 | 6,631,211 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a%b==0)cout << -1 <<endl;
else cout << a <<endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 68,389,987 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
set<char> ss;
for (int i = 0; i < s.size(); ++i) {
ss.insert(s[i]);
}
for (char i = 'a'; i <= 'z'; ++i) {
if (ss.count(i) == 0) {
cout << i << '\n';
return 0;
}
}
cout << "N... | #include <iostream>
#include <vector>
using namespace std;
int fib(int n) {
return n <= 1 ? 1 : fib(n - 1) + fib(n-2);
}
int dp[1000];
int fibMemoR(int n){
if(n <= 1) return dp[n] = 1;
if(dp[n])return dp[n];
return dp[n] = fibMemoR(n-1) + fibMemoR(n-2);
}
int fibdp(int n){
vector<int> dpv(n);
dp... | 0 | 21,251,366 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll x, a, b;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#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 foreach(it, v) for(typeof(v.begin()) it=v.begin(); it!=v.end(); ++it)
#define pb push_back
#define sz(x) (int)(x).size()
#define fi fi... | 0 | 24,559,920 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,A,B;
cin >> N >> A >>B;
if((B-A)%2 == 0) cout << "Alice" << endl;
else cout << "Borys" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
cin >> s;
int n = s.size();
boo... | 0 | 27,865,650 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d,x;
double da,db;
string s,ss,sss;
int ans = 0;
string anss = "";
cin >> a >> b >> c >>... | #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>;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n,INF);
rep(i,n-1){
a[i] = min(a[i],b[i]);
a[i+1] = min... | 0 | 43,600,301 |
#include <iostream>
#include <vector>
using namespace std;
int h,w,k;
int sum_matrix(const vector<vector<int>>& vv){
int count=0;
for(const auto& v : vv){
for(const auto& e : v){
count += e;
}
}
return count;
}
int main(){
cin >> h >> w >> k;
vector<vector<int>> data(... | #include <iostream>
using namespace std;
int main(){
int N;
int length=1;
cin >> N;
int A[N+1];
int L[N+1];
for(int i=1;i<N+1;++i){
cin >> A[i];
}
L[1]=A[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{
int l=1,r=length,mid;
... | 0 | 98,630,957 |
#include <iostream>
using namespace std;
int main() {
int ans[1000][11][21], p = 0;
for (int y = 999; y >= 1; y--) {
for (int m = 10; m >= 1; m--) {
int ed = (y % 3 == 0 || (m % 2) == 1) ? 20 : 19;
for (int d = ed; d >= 1; d--) {
ans[y][m][d] = ++p;
}
... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 46,058,367 |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break;
else gcdmax%=gc... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_b... | 0 | 11,220,956 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool ok=false;
for(int i=a;i<a*b;i+=a){
if(i%b==c){
ok=true;
break;
}
}
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | 0 | 7,608,581 |
#include<cstdio>
using ll = long long;
using ull = unsigned long long;
const static int MOD = 1000000007;
ll RepeatSquaring(ll N, ull P){
if(P == 0 || N == 1) return 1;
if(N == -1) return P & 1 ? -1 : 1;
if(!(P & 1)){
ll t = RepeatSquaring(N, P >> 1);
return t*t % MOD;
}
return N*RepeatSquaring(N, P - 1) % MOD... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
using namespace std;
const int maxM = 200005;
int parent[maxM];
int sum[maxM];
int Find(int x)
{
if (x != parent[x])
{
int i = parent[x];
parent[x] = Find(parent[x]);
sum[x] += sum[i];
}
return parent[x];
}
int main()
{
int m, n;
int ans... | 0 | 69,834,538 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int m[10];
for(int i=0;i<10;i++){
cin>>m[i];
m[i]=-m[i];
}
sort(m,m+10);
for(int i=0;i<3;i++)cout<<-m[i]<<endl;
return 0;
} | #include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using ll = long long;
int M = 100100100;
using namespace std;
int main()
{
int n;
cin >> n;
int maxx = 0;
int sum = 0;
vec... | 0 | 44,808,617 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 68,585,713 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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 >... | #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... | 0 | 42,857,682 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int N,A,B;
cin >> N >> A >> B;
if(N == 2) cout << "Borys" << endl;
else if((B-A)%2 == 0) cout << "Alice" << endl;
else cout << "Borys" << endl;
} | #include <iostream>
using namespace std;
int main(void)
{
while (true) {
u_int h, w;
cin >> h >> w;
if (!h && !w)
break;
char buf1[w+2], buf2[w+2];
for (u_int i = 1; i < w-1; i++) {
buf1[i] = '#';
buf2[i] = '.';
}
buf1[0] = ... | 0 | 47,735,019 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn= 1e6+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
rishabh();
int a,b;
cin>>a>... | 0 | 56,328,975 |
#include <iostream>
#include <string>
int main(int argc, char const* argv[])
{
std::string str;
int i = 0, sum;
while (std::cin >> str)
{
sum = 0;
if (str[0] == '0')
break;
for (size_t i = 0; i < str.size(); i++)
sum += str[i] - '0';
std::cout << sum << std::endl;
}
return 0;
} | #include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <random>
#include <cmath>
#include <chrono>
#include <cstring>
#include <algorithm>
#include <string>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
using namespace std;
using LL = long long;
#define ... | 0 | 9,523,591 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int sd[n][2], cp[m][2];
for (int i = 0; i < n; i++)
cin >> sd[i][0] >> sd[i][1];
for (int j = 0; j < m; j++)
cin >> cp[j][0] >> cp[j][1];
for (int i = 0; i < n; i++) {
int temp[2] = {0, 0};
for (int j = 0; j... | #include<iostream>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(x<a)
{
cout<<"NO"<<endl;
}
else
{
x-=a;
if(b>x){
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
} | 0 | 7,695,202 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
signed main(){
int a,b,c,d,e;
while( scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e) != EOF ){
vector<int> data{a,b,c,d,e};
sort(data.begin(), data.en... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 53,552,106 |
#include <iostream>
#include <cstdio>
using namespace std;
long long h, w;
int main() {
cin >> h >> w;
if(h>1 && w>1) cout << (h*w+1) / 2;
else cout << 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 13,441,833 |
#include <stdio.h>
int main(){
int a,b,c;
scanf("%d %d %d", &a,&b,&c);
if(a<b && a<c && b<c){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define mp make_pair
#define pb(x) push_back(x)
#define... | 0 | 25,073,086 |
#include<bits/stdc++.h>
using namespace std;
#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 RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
bool check(string A){
int a[26];
REP(i,26){
a[i]=0;
}
REP(i,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 84,146,127 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
int ans=0;
scanf("%d%d",&n,&m);
k=m;
int a[100005];
int u,v;
memset(a,0,sizeof(a));
while(m--)
{
scanf("%d%d",&u,&v);
a[u]++;
a[v+1]--;
}
... | 0 | 15,388,892 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
typedef long double ld;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
int A, B, C... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
const ll MOD = 1000000007;
ll pow2( ll n, ll cnt ){
if( cnt == 0 ) return 1;
if( cnt == 1 ) return n;
ll tmp = pow2(n,cnt/2);
if( cnt%2 == 0 )
return tmp%MOD*tmp%MOD;
else
... | 0 | 23,784,127 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 200001;
const int MOD = 1000000007;
signed main() {
int n,a,b;
cin>>n>>a>>b;
if((b-a)%2)cout<<"Borys";
else cout<<"Alice";
} | #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 | 69,235,119 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
cout << abs(... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 85,553,769 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,A,B;
cin >> N >> A >> B;
int64_t answer=0;
int64_t r;
r = N % (A+B);
answer += (N/(A+B))*A + min(A,r);
cout << answer << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#include <cstdint>
#define rep(i,n) for (int i = 0; i < (n); ++i)
usin... | 0 | 42,125,258 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
int A, B, C, D;
cin >> A >> B >> C >> D;
int ans = 0;
if( C <= B && B <= D )
ans = B - C;
if( C <= A && A <= D )
ans = D - A;
if( C <= A && B <= D )
ans = B - A;
if( A <= C && D <= B )
ans = D - C;
cout << ans << endl;
} | #include<iostream>
class Circle{
public:
Circle()
: m_x(0)
, m_y(0)
, m_r(0)
{}
int m_x;
int m_y;
int m_r;
};
int range(int l,int p, int r){
int a = p - r;
int b = p + r;
if (a < 0)
return 1;
if (b > l)
return 1;
return 0;
}
int main(){
int h, w;
Circle c;
int flag = 0;
std::cin >> w;
std::cin ... | 0 | 53,572,672 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int M,Nmin,Nmax;
cin >> M >> Nmin >> Nmax;
while(M){
vector<int> V(M);
rep(i,0,M)cin >> V[i];
int maxd = 0,maxi;
... | #include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
char c;
cin >> c;
int f = 0;
if (c == 'a') f = 1;
if (c == 'e') f = 1;
if (c == 'i') f = 1;
if (c == 'o') f = 1;
if (c == 'u') f = 1;
if (f) {
cout << "vowel" << endl;
}
else {
cout << "consonant" << endl;
}
} | 0 | 93,245,979 |
#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... | #pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | 0 | 44,056,186 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define sws ios_base::sync_with_... | #include <iostream>
#include <vector>
using namespace std;
const long N = 100;
int main(){
long n;
cin >> n;
long c[N + 1][N + 1];
for (long i = 1; i <= n; i++){
for (long j = 1; j <= n; j++){
c[i][j] = 0;
}
}
for (long i = 1; i <= n; i++){
long u, k;
cin >> u >> k;
long m[N];
for (long j = 1; j <=... | 0 | 30,772,613 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 46,647,342 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t l0=2,l1=1,l2;
if ( N == 1 ) {
cout << l1;
} else {
for (int i = 2; i <= N; i++) {
l2 = l1 + l0;
l0 = l1;
l1 = l2;
}
cout << l2;
}
} | #include<iostream>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
const ll longinf=1LL<<60 ;
ll dist(ll x,ll y){
return abs(x)+abs(y);
}
bool odd,even;
int main(){
string s="RLUD";
int n;cin>>n;
ll x[n],y[n];
rep(i,n){... | 0 | 74,674,668 |
#include <bits/stdc++.h>
using namespace std;
int n,a[81];
void nhap()
{
scanf("%d",&n);
for (int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
}
}
void process()
{
int i=1;
long long s=1000;
while (i<n)
{
int j=i+1;
while (j<=n && a[j]>=a[j-1])
j++;
j--;... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 0 | 74,225,763 |
#include <bits/stdc++.h>
#include <string.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define REP(i, n, m) for(int i=n; i < m; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
using namesp... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define AL... | 0 | 62,495,955 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int numStones;
cin >> numStones;
vector<int> heights(numStones);
for(int& height : heights) {
cin >> height;
}
vector<int> costs(numStones, 0);
costs[1] = abs(heights[1] - heights[0]);
for(int i = 2; i < costs.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,ans=0;
set<int>s;
cin>>n;
while(1)
{
++ans;
if(s.count(n)==0)
s.insert(n);
else
break;
if(n%2==0)
{
n=n/2;
}
else
{
n=3*n+1;
... | 0 | 22,929,230 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define allof(v) (v).begin(), (v).end()
#define MOD 1000000007
li n;
li t[222];
li v[111];
li lb_left[111];
li lb_right[1... | #define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <ma... | 0 | 55,823,677 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
string S;
cin >> S;
ll n = S.size();
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<array<int, 2>> v;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end(), [](array<int, 2> a,... | 0 | 9,727,955 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N,M;cin>>N>>M;
vector<vector<long>>A(8,vector<long>(N));
for(long j=0;j<N;j++){
long x,y,z;cin>>x>>y>>z;
for(long i=0;i<8;i++){
long a=(i%2)*2-1,b=((i/2)%2)*2-1,c=((i/4)%2)*2-1;
A[i][j]=a*x+b*y+c*z;
}
}
vector<long>B(8,0);... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RNG(i,from,to) for(int i=(from); i<(int)(to); i++)
typedef long long ll;
typedef pair<int, int> pii;
template<typename T> void show(T e){ cout << e << endl; }
template<typename T> void show(const vector<T>& v){ for(cons... | 0 | 57,936,687 |
#include <bits/stdc++.h>
#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
typedef long long ll;
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int a,b,c,k;
cin >> a >> ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k, first;
cin >> n >> k >> first;
vector<int> a(n-1);
rep(i,n-1) cin >> a[i];
ll ans = 1e18;... | 0 | 89,092,155 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A[N];
for(int i = 0; i < N; i++){
cin >> A[i];
}
int count[N] = {};
int test;
for(int i = 0; i < N; i++){
test = A[i] - 1;
count[test]++;
}
sort(count, count + N);
int integ;
for(int i = 0; i < N ... | #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 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < ... | 0 | 57,419,277 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
using namespace std;
int main(){
long long s = 0; int n; scanf("%d", &n);
map<int, int> m;
rep(i, n){
int a; scanf("%d", &a);
m[a]++;
}
priority_queue<int> p;
for(auto q: m){
if... | #include <bits/stdc++.h>
using namespace std;
class dsu {
public:
vector<int> p;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
}
inline int get(int x) {
return (x == p[x] ? x : (p[x] = get(p[x])));
}
inline bool unite(int x, int y) {
x = get(x);
y = get(y);
... | 0 | 93,602,301 |
#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 K, A, B; cin >> K >> A >> B;
if(A >= B-2 || A >= K) cout << K+1 <... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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(int i=0;i<n;++i)
... | 0 | 23,098,636 |
#include <iostream>
using namespace std;
int main(void)
{
int red, green, blue;
int mul_times;
cin >> red >> green >> blue;
cin >> mul_times;
int mul_cnt = 0;
while(red >= green){
green *= 2;
mul_cnt += 1;
}
while(green >= blue){
blue *= 2;
mul_cnt += 1;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | 0 | 88,590,201 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | 0 | 91,244,187 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomani... | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | 0 | 53,616,955 |
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <utility>
int main()
{
int M, N;
std::cin >> M >> N;
std::map<int, std::map<int, int>> ken_shi_y;
for(int i=0; i<N; i++)
{
int P, Y;
std::cin >> P>> Y;
ken_shi_y[P][Y] = i;
}
std::vector<std::pair<int,int>> resul... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, ... | 0 | 2,542,134 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
int main()
{
ios_base::sync_with_stdio(false);
ci... | 0 | 47,793,769 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
#define INF (1 << 30)
priority_queue<int> PQ;
int main() {
string com;
int key;
while( 1 ) {
cin >> com;
if (com == "insert") {
cin >> key;
PQ.push(key);
}
... | #include <iostream>
using namespace std;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv... | 0 | 28,641,240 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF=1e9... | #include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a,... | 0 | 66,934,307 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
int main(){
string s ; cin >> s ;
vll x ;
string sub ;
ll cnt = 0 ;
for(int i=0;i<s.size();i++){
if(s.at(i)=='x') cnt++ ;
else{
sub += s.at(i) ;
x.emplace_bac... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for(;exp > 0;exp >>= 1) {
if((exp & 1) == 1) tot = tot ... | 0 | 16,051,269 |
#include<bits/stdc++.h>
#define vi vector<int>
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define ll long long int
#define pi pair<ll,ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(int a, int b)
{
if(b==0)
return a;... | #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 srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 26,454,845 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 2e9
#define LINF 1e18
#define MOD 1000000007
#define PI 3.141592653589793
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define input(x, n)for(ll i = 0; i <(ll)(n); i++)cin >> x[i];
#define until(i,n) for(ll i = 1; i <= (ll)(n); i++)
#de... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int N,c=0;
cin>>N;
for(int i=1;i<N;i++){
for(int j=1;j<N;j++){
if(N>i*j){
c++;
}else break;
}
}
cout<<c<<"\n";
} | 0 | 6,090,444 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
struct edge {
int to;
int weight;
ed... | #include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 2000000000000000005
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ll long long
#define int long long
#define P(gg) for(auto rax:gg){cout<<rax<<... | 0 | 35,008,449 |
#include <iostream>
using namespace std;
int main()
{
int first = 0, second = 0, third = 0;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
if (n > first) {
third = second;
second = first;
first = n;
}
else if(n > second) {
third = second;
second = n;
}
els... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define itrdebug(x) cerr << #x ... | 0 | 74,137,205 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s, t... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n,d,x;
cin>>n>>d>>x;
int sum=0;
rep(i,n){
int a;
int b;
cin>>a;
b=1;
while(b<=d){
b+=a;
sum++;
}
}
cout... | 0 | 74,517,984 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string order;
vector<int> num;
vector<char> word;
int n;
char button[9][5] = {{'.',',','!','?',' '},{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},{'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
int main()
{
int... | 0 | 38,082,218 |
#include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;
int N, A, B, MIN;
ll res;
int main(){
cin >> N;
MIN = intmax;
while (N--) {
cin >> A >> B;
if (A > B)MIN = min(MIN, B);
res... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
int main() {
ll n, d, a;
cin >> n >> d >> a;
vector<P> x(n);
rep(i, n)cin >> x... | 0 | 11,903,867 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, int>> p(n);
rep(i, n) {
cin >> p[i].first;
p[i].second = i;
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll P[100005];
ll Q[100005];
int main()
{
in... | 0 | 73,392,434 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main(){
int N,T; cin >> N >> T;
vector<int> t(N);
rep(i,N) cin >> t[i];
ll l=0,r=0;
bool on = false;
ll res = 0;
rep(i,N){
if(t[i]<=r) on = true;
... | 0 | 48,897,675 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
vector<int> ar(3);
for(auto&e:ar){
scanf("%d",&e);
}
sort(ar.begin(),ar.end());
printf("%d %d %d\n",ar[0],ar[1],ar[2]);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
#define NIL -1
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<char>>;
using P =pair<int,int>;
template<class T> ... | 0 | 58,699,163 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define mod 1000000007
#define PI 3.1415926535897932384626433
using namespace std;
int main(){
fast;
int n,i;
cin >> n;
int a[n],b[n-1];
for(i=0;i<n-1;i++){
cin >> b[i];
}
a[0] = b[0];
i... | 0 | 85,752,819 |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define vp vector<pii>
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.... | #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 | 70,827,608 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
cons... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main() {
int n;cin>>n;
int a[n+1];
ll ans=0,tmp;
rep(i,n)cin>>a[i];
a[n]=0;
rep(i,n){
tmp=a[i]/2;
if(a[i]%2==1 && a[i+1]>0){
tmp++;
a[i+1]-... | 0 | 45,536,210 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
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... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> n_vec;
map<string,int> n_map;
for (int i = 0; i < N; i++) {
string a;
cin >> a ;
n_vec.push_back(a);
}
int M;
cin >> M;
vector<string> m_vec;... | 0 | 93,659,679 |
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
int n,i;
ll d[87];
cin >> n;
d[0]=2;
d[1]=1;
for(i=2;i<=n;i++)
d[i]=d[i-2]+d[i-1];
cout << d[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
#define pi 3.14159
int main(){
int N,M;
cin >> N>>M;
int ans =0;
for(int i=0 ;i<M;i++){
int a;
cin >> a;
ans += a;
}
ans = (ans-N)*(-1);
if(ans>=0){
... | 0 | 60,731,538 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 61,157,532 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
const int MOD = 1000000007;
const ... | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
#define ld long double
#define ff first
#define ss second
using namespace std;
ll fact(ll a)
{
if(a==0) return 1;
else return a*fact(a-1);
}
vl<ll> divisor(ll n)
{
vl<ll> v;
for(int i=2;i<=sqrt(n);i++)
{
if(n... | 0 | 29,805,522 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
map<int,int> m;
rep(i,N)
{
int a;
cin>>a;
m[a]++;
}
int ans=0;
for(auto p : m)
{
if(p.first>p.second)
{
ans+=p.s... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N), S(N + 1, 0);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
A.at(i)--;
S.at(i + 1) = (S.at(i) + A.at(i)) % K;
}
map<int64_t, int64_t> mp;
for (int i = 0; i < min(K, N + 1); i++)
{
... | 0 | 100,670,927 |
#include <iostream>
#include <cctype>
#include <stdio.h>
using namespace std;
int main(){
char sentence;
while(true){
scanf("%c", &sentence);
if(islower(sentence)){
sentence = toupper(sentence);
}else if(isupper(sentence)){
sentence = tolower(sentence);
}else{
sentence = sentence;
}
cout << sente... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
int main(){
ll a,b ;
cin >> a >> b ;
cout << (a*3+b)/2 << endl ;
} | 0 | 64,767,568 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())
using namespace std;
int main() {
string s;
int n,... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>> s(m);
for(int i=0;i<m;i++){
int k;
cin >> k;
s.at(i) = vector<int>(k);
for(int j=0;j<k;j++){
cin >> s.at(i).at(j);
}
}
vector<int> p(m);
for(int i=0;i... | 0 | 45,285,380 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int x=-1, y=-1,z=-1;
int c=0;
cin >> x >> y >> z;
for (int i = x; i <= y; i++){
if (z%i == 0){ c++; }
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 0 | 44,486,851 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string ans;
for(int i = 0; i < 3; i++) {
string s;
cin >> s;
ans.push_back(s[0] + 'A' - 'a');
}
cout << ans << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (!n) break;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
for (int i = 1; i < n-1; ++i) {
sum += a... | 0 | 1,489,919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.