code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | 0 | 59,905,537 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
int ans = 0;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
if(i) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 0 | 51,035,562 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long double a, b;
cin >> a >> b;
for (long double n = 1; n < 10000; n++)
{
if (floor(n * 0.08) == a && floor(n * 0.1) == b)
{
cout << n << endl;
return 0;
}
}
cout << -1 << endl;
} | #include<bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } re... | 0 | 15,591,315 |
#include<stdio.h>
int main(){
long long int N;
scanf("%lld",&N);
long long int A[N];
long long int i;
long long int prod=1;
long long int x=1e18;
for(i=0;i<N;i++){
scanf("%lld",&A[i]);
}
for(i=0;i<N;i++){
if(A[i]==0){
puts("0");
return 0;
}
}
for(i=0;i<N;i++){
if(A[i]<=x/prod){
prod*=A[i];
... | #include <iostream>
#include<sstream>
#include<string>
#include<vector>
#include <cmath>
#include <limits>
#include <queue>
#include<algorithm>
#include<cstring>
#include <cstdlib>
#include <cstdio>
#include <set>
#include <iomanip>
#include <map>
#include <stack>
#include <memory>
#include <numeric>
#include <type_tra... | 0 | 34,643,195 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define F first
#define S second
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>boo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> l4;
typedef pair<double, double> dd;
#define mp make_pair
#define pb push_back
#define debug(x) cerr << #x << " = " << x << " "
const int N = 5e3+2;
bitset<N> bl[N], br[N];
int n, k;
void print(bitset<N> ... | 0 | 40,620,257 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long t,i,p=0;
string s;
cin>>s;
t=s.size();
for(i=0;i<t;i++){
if(s[i]=='o')
p++;
}p=p+15-t;
if(p>=8)
cout<<"YES";
else
cout<<"NO";
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll w,h,adx,ady,sum=0;
vector<P> pq;
cin >> w >> h;
ll p[w],q[h];
adx=h+1;
ady=w+1;
for(int i=0;i<w;i++){
cin >> p[i];
pq.push_back(P(p[i],0));
... | 0 | 9,946,427 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
ll a,b;
vector<tuple<ll, ll, ll>> ab(n);
for(int i=0; i<n; i++){
cin >> a >> b;
ab[i] = make_tuple(a+b, a, b);
}
sort(ab.rbegin(), ab.rend());
ll ans = 0LL;
for(int i=0; i<n... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef pair<ll,ll> prl;
typedef vector<ll> vcl;
typedef map<ll,ll> mapl;
typedef unordered_map<ll,ll> umap;
#define pb push_back
#define all(v) v.begin(), v.end(... | 0 | 70,275,426 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pqgreater(x) x, vector<x>, greater<x>
#define abs(x) (x>0?x:-x)
#define decimal(x) cout<<fixed<<setprecision(x)
#define gc getchar
#define pc putchar
co... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | 0 | 91,333,282 |
#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 MOD=1000000007;
int main() {
int n;
cin >> n;
int ans;
if(n/10==0) ans=n;
else if(n/100==0) ans=9;
else if(n/1000==0) ans=n-90;
else if(n/10000==0) ans=909;... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
vector<int> dy = {1, 0, -1, 0};
vector<int> dx = {0, 1, 0, -1};
typedef pair<int, int> PII;
int main() {
int h, w;
cin >> h >> w;
vector<string> grah(h);
rep(i, h) cin >> grah.at(i);
queue<PII> q;
vector<vector... | 0 | 63,449,904 |
#include <bits/stdc++.h>
using namespace std;
void hawawa()
{
int n, m;
int mod = 1e9 + 7;
cin >> n >> m;
vector<long long> x(n);
vector<long long> y(m);
for (auto&& i : x) {
cin >> i;
}
for (auto&& i : y) {
cin >> i;
}
long long xsize = 0;
for (int i = 0; i < n; i++) {
xsize += i * x[i];
xsize %= mo... | #include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define ll long long
#define ld double
#define pb push_back
#define mod 998244353
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using na... | 0 | 97,499,852 |
#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>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<... | 0 | 87,142,185 |
#include <bits/stdc++.h>
using namespace std;
#define iter(i, a, b) for(int i=(a); i<(b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a)+1)
#define log(a) cerr<<"\033[32m[DEBUG] "<<#a<<'='<<(a)<<" @ line "<<__LINE__<<"\033[0m"<<endl
#define all(a) a.begin(), a.end()
#define fi first
#define se s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, kakikae = 0;
cin >> n >> k;
map<int, int> a;
for (int i = 0; i < n; i++) {
int ai; cin >> ai;
if (a.count(ai)) a[ai]++;
else a[ai] = 1;
}
int syurui = a.size();
if (syurui <= k) goto OUT;
for (int i = 1; i < n; i++) {
... | 0 | 11,646,698 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef set<int> si;
typedef map<st... | 0 | 51,296,306 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pi... | 0 | 16,331,645 |
#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;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll ans[... | #include <bits/stdc++.h>
using namespace std;
#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() {
string s;
cin >> s;
vector<int> t(26);
rep(i,s.size()) t[s[i]-'a']++;
if(s.size()<26){
cout << s;
rep(i,2... | 0 | 37,605,047 |
#include<stdio.h>
int main(void)
{
int a,b=0,c=0,i;
for(i=0;i<4;i++){
scanf("%d",&a);
b+=a;
}
for(i=4;i<8;i++){
scanf("%d",&a);
c+=a;
}
if(b<c){
printf("%d\n",c);
}
else{
printf("%d\n",b);
}
return 0;
} | #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VA... | 0 | 12,666,844 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t H, W;
cin >> H >> W;
vector<vector<int64_t>> horizon(H);
vector<vector<int64_t>> vertical(W);
vector<vector<bool>> is_op... | 0 | 52,314,650 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P2;
int next_animal(int a,int b,int c){
if(b==1) c=(c+1)%2;
if(c==0) return a;
else return (a+1)%2;
}
int main(){
int n;
cin>>n;
vector<int> vec;
for(int i=0;i<n;i++){... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define sz(x) (int)(x).size()
const int N = 100010;
int a[N], vis[N], n, m;
vector<int> adj[N];
vector<ii> comp;
void dfs (int u) {
vis[u] = 1;
comp.push_back({u, a[u]});
for (int v : adj[u]) if (!vis[v]) dfs(v);
}
int ... | 0 | 61,456,091 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MAX { 200010 };
const ll MOD { 1000000007 }, oo { 1LL << 62 };
ll solve(int N, const vector<ll>& xs)
{
return 0;
}
int main()
{
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
cout << T ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll X,Y,A,B,C;
void solve(){
cin>>X>>Y>>A>>B>>C;
ll a[A] , b[B] , c[C];
vector<ll> values;
ll sum = 0;
for(ll i = 0 ; i<A ; i++)
cin>>a[i];
for(ll i = 0 ; i<B ; i++)
cin>>b[i];
for(ll i = 0 ; i<C ; i++)
ci... | 0 | 79,357,758 |
#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... | #include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
const ll mod=998244353;
int main(){
bool flag=true;
ll n,ans=1;
cin >> n;
map<int,int> mp;
mp[0]=0;
r(i,n){
int a;
cin >> a;
mp[a]++;
if(i==0&&a!=0)flag=false;
if(i!=0&&a==0)flag=f... | 0 | 38,267,395 |
#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=5e18;
int main() {
ll h,w,k;
cin >> h >> w >> k;
for(ll i=0;i<=h;i++) {
for(ll j=0;j<=w;j++) {
if(i*j+(h-i)*(w-j)==k||i*j+(h-i)*(w... | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll... | 0 | 59,759,655 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 91,130,390 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,t,dot;
cin>>n>>x>>t;
dot=n/x;
if (n%x>0){
dot++;
}
cout<<dot*t;
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int s = 100000;
int n;
cin >> n;
while (n--) {
if (int(s*1.05) % 1000 == 0) {
s = int(s*1.05);
}
else {
s = int(s*1.05) + (1000 - int(s*1.05) % 1000);
}
}
printf("%d\n", s);
return 0;
} | 0 | 24,735,462 |
#line 1 "test/atcoder/practive2-a.cpp"
#include <iostream>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main() {
int n, q; cin >> n >> q;
dsu d(n);
for (int i = 0; i < q; ++i) {
int t, u, v; cin >> t >> u >> v;
if (t == 0) {
d.merge(u, v);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 1,169,207 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
if (d == 0) {
printf("%.10f\n", (1.0/n) * (m-1));
}
else {
printf(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int a[20];
int main()
{
int n, k;
cin >> n >> k;
rep(i,n) cin >> a[i];
ll ans = ll(1e18)+1;
rep(bit,1<<n) {
ll tot = 0;
int maxv = 0;
int visible = 0;
rep(i,n... | 0 | 38,984,752 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
char grid[1010][1010];
bool seen[1010][1010];
int di[]={0,1,0,-1};
int dj[]={1,0,-1,0};
int main(){
int h,w;
cin>>h>>w;
queue<P> q;
rep(i,h)rep(j,w){
cin>>grid[i][j]... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;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 repi(i,x) for(a... | 0 | 100,496,151 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int m... | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | 0 | 43,040,215 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n;
cin >> n;
int c[n-1], s[n-1], f[n-1];
for (int i = 0; i < n-1; i++)
cin >> c[i] >> s[i] >> f[i];
for (int i = 0; i < n-1; i++) {
int t = 0;
for (int j = i; j < n-1; j++) {
if (t < s[j])
t = s[j] + c[j];
else {
int tmp = t - s... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 0 | 38,254,414 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,a;
cin>>x>>a;
if (x<a)
{
printf("0\n");
}
else
printf("10\n");
return 0;
} | #include <cstdio>
#include <iostream>
#include <set>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc()
{
static char buf[100000],*l=buf,*r=buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T ... | 0 | 82,595,120 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 76,849,511 |
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int tem;
vector<int> v1;
for(int i=0;i<5;i++)
cin >> tem,v1.push_back(tem);
sort(v1.begin(),v1.end(),greater<int>());
for(int i=0;i<5;i++)
cout << (i?" ":"")<< v1[i] ;
cout << endl;
return 0;
} | 0 | 17,738,434 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[15],t[15];
cin>>s>>t;
int l=strlen(s);
int p=strlen(t),cnt=0;
for(int i=0;i<l;i++)
{
if(s[i]==t[i])
{
cnt++;
}
}
if(cnt==l)
{
if(l==p-1){
cout<<"Yes"<<endl;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
#define rep(i,N) for(int i=0;i<(int)(N);++i)
#define rrep(i,N) for(int i=(int)(N)-1;i>=0;--i)
#define debug(x) cout<<#x<<"="<<x<<endl;
constexpr ll MOD=1000000007;
constexpr ll INF=1LL<<60;
template<class T> inline bool chmin(T& a,T ... | 0 | 66,304,087 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int,int> pii;
typede... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include <map>
using namespace std;
int solve(int nmin, ... | 0 | 33,094,621 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> h(N);
for(ll i=0;i<N;i++) {
cin>>h[i];
}
vector<ll> dp(N,0);
dp[N-2]=abs(h[N-1]-h[N-2]);
for(ll i=N-3;i>=0;i--) {
dp[i]=min(dp[i+1]+abs(h[i]-h[i+1]),dp[i+2]+abs(h[i]-... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define FOR0(i,n) for(int i=0, _##i=(n); i<_##i; ++i)
#define FOR(i,l,r) for(int i=(l), _##i=(r); i<_##i; ++i)
#define FORD(i,l,r) for(int i=(r), _##i=(l); --i>=_##i; )
#define repi(i,a)... | 0 | 32,291,735 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const p... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | 0 | 53,782,145 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int l, r = N;
l = max(0, (int)count(A.begin(), A.end(), 1)-1);
while (r-l > 1) {
int c = (19*l+r+18)/20;
map<int, int> mp... | 0 | 7,486,300 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N,P,g=0,n=0,m=0;
cin>>N>>P;
vector<int> A(N);
for(int &i:A){
cin>>i;
if(i%2==1){
cout<<(int)pow(2,N-1)<<endl;
return 0;
}
}
if(P==1)
cout<<0<<endl;
else
cout<<(int)pow(2,N)<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | 0 | 24,905,813 |
#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 x = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> pr;
int sum = 0;
rep(i,n) {
int a;
cin >> a;
sum += a;
pr.push(a);
}
rep(i,... | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 10000000... | 0 | 37,020,342 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k; cin>>n>>k;
vector<long long> a(n), s(n+1, 0);
for (int i = 0; i < n; i++) cin>>a[i];
for (int i = 0; i < n; i++) s[i+1] = s[i] + a[i];
long long ans = 0;
map<int, int> v;
int l = 0;
for (int r = 0; r < n+1; r++) {
if (r-l >= k) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<int> v1(n/2, 0), v2(n/2, 0);
for (int i = 0; i < n; i++)
{
if(i%2 == 0){
cin >> v1[i/2];
} else {
cin >> v2[(i-1)/2];
}
}
map<int, int>... | 0 | 4,965,477 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
#define P pair<int, ll>
int main(){
int X,Y,Z,K;cin>>X>>Y>>Z>>K;
vll A(X),B(Y),C(Z);
rep(i,X)cin>>A[i];
rep(i,Y)cin>>B[i];
rep(i,Z)c... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define Debug(x) cout << #x " = " << (x) << endl
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(... | 0 | 70,950,392 |
#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 <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b... | 0 | 81,738,600 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int X;
cin >> X;
if(X<100){
cout << 0 << endl;
return 0;
}
int... | #include<bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
inline ll read()
{
ll x=0,w=0;char ch=getchar();
while(!isdigit(ch))w|=ch=='-',ch=getchar();
while(isdigit(ch))x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return w?-x:x;
}
ll ans;
char s[10];
inline void query(ll x)
{if(x==1){s[0]='Y';... | 0 | 62,474,062 |
#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;
int main() {
cin.tie(0);
ios::sync_with_stdio(false)... | #include <numeric>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> vals[n];
for (int i = 0; i < n; i++) {
int t, d; cin >> t >> d;
vals[t-1].push_back(d);
}
vector<int> rest, top;
for (int i = 0; i ... | 0 | 25,045,891 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define mapa map<char,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
#define reverse(a) reverse(a.begin(),a.end())
const double PI=acos(-1);... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
#include <complex>
#include <random>
using namespace std;
random_device rd;
mt19937 mt(rd());
using Point = complex<double>;
double dot(Point p, Point q) { return (conj(p) * q).real(); }
int n;... | 0 | 99,749,924 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c;
if (a >= b){
d = a; a = b; b = d;
}
if (c <= a){
d = c; c = a; a = d;
}
if (c >= a && c <= b){
d = b; b = c; c = d;
}
cout << a << " " << b << " " << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,L;
cin >> N >> L;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
ll l=-1,r=-1;
for(int i=1;i<N;i++){
if(A[i-1]+A[i]>=L){
l = i-1;
r=i;
break;
... | 0 | 70,564,692 |
#include <iostream>
#include <string>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int, int> pi;
int N, M;
vector<vector<pi> > P;
vector<string> A;
void input_init(void) {
cin >> N >> M;
P.resize(N + 1);
for (int i = 0; i < M; ++i) {
int p, y;
cin >> p >> y;
P[p].... | 0 | 41,610,277 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <ll> a(n);
vector <int> b(n);
for(int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
ll ans = 0;
for(int i = n - 1; i >= 0; i--) {
a[i] += ans;
ans += (b[i] - (a[i] % b[i])) ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b; c... | 0 | 31,454,560 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
#include <set>
#include <unordered_set>
#include <list>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <climits>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF... | 0 | 74,708,468 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define first ff
#define second ss
#define pi acos(-1.0)
typedef long long ll;
using namespace std;
vector<int>node[10001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
template <class T>
vector<T> m... | 0 | 79,253,632 |
#include <bits/stdc++.h>
using namespace std;
int a[3];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[2] * 10 + a[1] + a[0];
return 0;
} | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
int n; cin >> n;
vector<int> p(n);rep(i,n) cin >> p[i];
vector<int> q(n);rep(i,n) cin >> q[i];
vector<int> ... | 0 | 33,432,436 |
#include <bits/stdc++.h>
#define cn count;
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout... | #include <bits/stdc++.h>
using namespace std;
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;
}
return false;
}
#define MAX 1000
t... | 0 | 17,270,977 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include <bits/stdc++.h>
using namespace std;
vector<long long> rbd(vector<long long> mat) {
int n = mat.size();
int rk = 0;
for (int i = 60; i >= 0; i--) {
bool exist = false;
for (int j = rk; j < n; j++) {
if (mat[j] >> i & 1) {
exist = true;
swa... | 0 | 78,506,812 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1;i <= n;i++){
cin >> a[i];
}
for(int i = 1;i <= n;i++){
cout << "node " << i << ": key = " << a[i] << ", ";
if(i / 2 >= 1)cout << "parent key = " <<a[i / 2] << ", ... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | 0 | 51,423,920 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
long long int y;
cin>>n>>y;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
int t;
if(n-i-j>=0) t=n-i-j;
else continue;
if(10000*i+5000*j+1000*t==y){
cout<<i<<" "<<j<<" "<<n-i-j;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n == 0) break;
vector <int> data(n);
for(int i=0; i<n; i++){
cin>>data.at(i);
}
sort(data.begin(), data.end());
reverse(data.begin(),data.end());
vector <int> gap(n);
for(int i=0; i<... | 0 | 56,035,643 |
#include<iostream>
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int n ;
cin >> n ;
int a[n+2] ;
a[0] = 0 ;
a[n+1] = 0 ;
int sum = 0 ;
for(int i=1;i<=n;i++){
cin >> a[i] ;
sum+= abs(a[i]-a[i-1]) ;
}
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
string s, pin, sub_s;
i... | 0 | 1,593,143 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
vector<ll> a(n);
for (int i=0; i<n; i++) cin >> a[i];
list<ll> b;
bool toggle = true;
for (auto x : a) {
toggle ? b.push_back(x) : b.push_front(x);
toggle ^= true;
}
i... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
ll INF = 1'000'000'000'000'000'000;
int main(){
int n;
cin >> n;
ll ans = 1;
vector<ll> a(n);
rep(i,n){
cin... | 0 | 48,469,388 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,sum=0;
cin>>n>>m;
vector<int> v(m);
for(long i=0;i<m;i++)
{
cin>>v[i];
}
for(long i=0;i<m;i++)
{
sum+=v[i];
}
if(n-sum>=0)
{
cout<<n-sum<<"\n";
}
else
{
cout<<"-1"<<"\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N;
string hoge(int n){
string res;
if(n <= N && to_string(n) <= to_string(N)) res = "Y";
else if(n > N && to_string(n) > to_string(N)) res = "Y";
else res = "N";
cout<<res<<endl;
return res;
}
bool checkt(int m){
string ans;
m *= 10;... | 0 | 95,367,518 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | 0 | 43,397,731 |
#include<bits/stdc++.h>
using namespace std;
string seven(vector<int> A){
string s="";
for(int bit=0;bit<(1<<3);++bit){
bitset<3> tmp(bit);
int sum=A.at(0);
s=to_string(A.at(0));
for(int i=0;i<3;++i){
if(tmp.test(i)){
sum+=A.at(i+1);
s+="+";
}
else{
sum-=A.a... | #include <iostream>
#include <string>
using namespace std;
int func(char w)
{
char n = '0';
for(int i = 2; i <= 10; i++){
if(w == (char)(n+i)){
return i;
}
}
return 1;
}
int main()
{
int n, s, t, v;
string s1, s2;
char w = '0';
cin >> n;
while(n--){
cin >> s1 >> s2;
s = t = 0;
... | 0 | 91,713,169 |
#include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define PI (acos(-1.0))
#define MODN 1000000007
#define MODN2 998244353
#define ALL(V) (V).begin(),(V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main(){
string o,e;
cin >> o;... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i... | 0 | 13,388,600 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <c... | #include <iostream>
#include <cmath>
using namespace std;
int main(void) {
int N=999999;
int p[N] , s[N];
p[0]=0 , s[0]=0;
for (int i=1; i<N; i++){
p[i] = 1;
s[i] = 0;
}
for (int i=1; i<N; i++){
if (p[i]==1){
int n=i+1 , m=2*n;
while (m<=N){
... | 0 | 74,023,152 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
long long N;
cin >> N;
if (N == 1) {
cout << 1 << endl;
return;
}
vector<long long> L(N + 1, 0LL);
L[0] = 2;
L[1] = 1;
for (long long i = 2; i < N + 1; ++i) {
L[i] = L[i - 1] + L[i - 2];
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int prime[1000000];
bool is_prime[1000001];
int main(){
int n;
while(cin >> n){
int p = 0;
rep(i, n + 1) is_prim... | 0 | 51,374,312 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
int n, m; cin >> n >> m;
priority_queue<P, vector<P>, greater<P>> q;
priority_queue<int> p;
rep(i, n){
int a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N;
cin >> N;
vector<int> C(N), S(N), F(N);
for(int i = 1; i < N; i++){
cin >> C.at(i) >> S.at(i) ... | 0 | 52,618,013 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 11,745,259 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int tc=1;
while(tc--)
{
ll int n,k;
cin>>n>>k;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 25,765,791 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n,m; cin >> n >> m;
vector<int> a(m);
rep(i, m) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>() );
vector<int> match_num{2 , 5 , 5 , ... | 0 | 19,349,317 |
#include <iostream>
using namespace std;
using ll = long long;
#define mod 2019
#define INF 2<<30
int main(void){
ll l,r;
cin >> l >> r;
if(r+1-l>=mod)
{
cout<<0;
return 0;
}
int m=mod;
for(int i=l;i<r;i++)for(int j=l+1;j<=r;j++)
{
m=min(((i%mod)*(j%mod))%mod,m);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
vector<vector<int>> start(n,vector<int>(2));
for(int i=0;i<n;i++){
cin>>start.at(i).at(0)>>start.at(i).at(1);
}
vector<vector<int>> goal(m,vector<int>(2));
for(int i=0;i<m;i++){
cin>>goal.at(i).at(0)>>goal.at(i).at(1);
... | 0 | 41,927,405 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
ll r,d;
vector<ll> x(11);
cin >> r >> d >> x[0];
for (int i = 0; i <= 10; i++)
{
x[i+1] = r*x[i] - d;
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL read(){
LL x=0,f=1;
char ch=getchar();
while (!isdigit(ch)&&ch!='-')
ch=getchar();
if (ch=='-')
f=-1,ch=getchar();
while (isdigit(ch))
x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,A[N],in[N];
vector <int>... | 0 | 87,098,988 |
#include <iostream>
using namespace std;
const int maxn=1e6 + 10;
int p[maxn],inp[maxn],f[maxn],top;
void init(){
for(int i=2;i<maxn;i++){
if(!inp[i]){
p[top++]=i;
}
for(int j=0;j<top && i*p[j]<maxn;j++){
inp[i*p[j]]=1;
if(!(i%p[j]))
break;
}
f[i]=f[i-1]+1-inp[i];
}
}
int main(){
init();
int ... | #include <iostream>
using namespace std;
const int M = 1046527;
const int L = 14;
string H[M];
int getChar(char ch) {
if (ch == 'A') {
return 1;
}
else if (ch == 'C') {
return 2;
}
else if (ch == 'G') {
return 3;
}
else if (ch == 'T') {
return 4;
}
ret... | 0 | 59,349,715 |
#include <iostream>
using namespace std;
int main()
{
char s[201];
char p[101];
cin.getline(s,101);
cin.getline(p,101);
int ns=0,np=0;
for(int i=0;s[i];i++)
ns++;
for(int i=0;p[i];i++)
np++;
for(int i=ns;i<2*ns;i++)
s[i]=s[i-ns];
s[2*ns]='\0';
int i,j;
for(i=0;i<2*ns-np;i++)
{
fo... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=100010;
int tt;
int head[N],a[N],to[N*2],nxt[N*2],in[N];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') ch=getchar... | 0 | 50,146,784 |
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <functional>
#include <cassert>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define PI 3.141592653589... | #include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
#include <cmath>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200002
#define LIMIT2 500002
typedef long long ll;
typedef long double ld;
typedef const void cv;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define per(i,n) for(... | 0 | 65,790,293 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) f... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 30,881,881 |
#include <iostream>
#include <string>
char c[10][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', ... | #include <bits/stdc++.h>
#define FAST_IO \
ios::sync_with_stdio(0); \
cin.tie(0); ... | 0 | 26,775,003 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int q;
scanf("%d", &q);
for(int i = 0; i < q; i++){
long a,b;
scanf("%ld %ld", &a, &b);
if(a>b){
swap(a,b);
}
lo... | 0 | 29,129,944 |
#include <stdio.h>
int main()
{
int hour_1;
int hour_2;
int min_1;
int min_2;
int k;
scanf("%d %d %d %d %d", &hour_1, &min_1, &hour_2, &min_2, &k);
int total_hour = hour_2 - hour_1;
int total_minute = min_2 - min_1;
int duration = (total_hour * 60) + total_minute - k;
printf("%d\... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
const int MAX = 5... | 0 | 49,014,456 |
#include <bits/stdc++.h>
using namespace std;
int a[1000005],n,t;
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&t), a[t]++;
int cnt = 0;
for(int i=1;i<=100000;i++) if(a[i]>1) cnt+=a[i]-1;
if(cnt&1) n-=cnt+1;
else n-=cnt;
cout<<n<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
struct LazySegmentTree {
private:
int length;
vector<long long> node, lazy;
public:
LazySegmentTree(int N) {
length ... | 0 | 21,166,939 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#d... | #include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | 0 | 26,714,227 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val)... | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pai... | 0 | 9,985,820 |
#include<cstdio>
int main(void){char x[1001];int c,i;scanf("%s",x);while(x[0]-'0'){for(i=0,c=0;x[i]!=0;++i){c+=x[i]-'0';}printf("%d\n",c);scanf("%s",x);}return(0);} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 63,722,631 |
#include<bits/stdc++.h>
using namespace std;
#define l long int
#define ll long long int
vector<int>adj[1000001];
int vis[1000001];
int n=2005;
int dp[2005];
int fact[1000001];
#define mod 1000000007
ll sequence_sum(int a)
{
if(a==0)
return 1ll;
else if(a==1 || a==2)
return 0ll;
else if(a==3... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
for (int i = 0; i < R; i++) {
cin >> r.at(i);
r.at(i)--;
}
vector<vector<int>> G(N, vector<int>(N, 1e9));
for (int a, b, c; cin >> a >> b >> c;) {
G.at(--a).at(--b) = c;
G.at(b).at... | 0 | 93,847,561 |
#include <bits/stdc++.h>
#define for0(i,n) for (int i=0; i<n; i++)
#define iter(c) for(auto it=c.begin(); it!=c.end(); it++)
#define iter2(c) for(auto it2=c.begin(); it2!=c.end(); it2++)
#define pb push_back
#define ms(a,z) memset(a,z,sizeof(a));
#define mp make_pair
#define X first
#define Y second
#define max(a,b) ((... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 76,858,396 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stdio.h>
#include <string>
#include <string.h>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main (void)
{
string a;
cin >> a;
int k = 0;
k = a.size();
for (int i = k; i > 0... | #include <iostream>
using namespace std;
int numEven[100010], numOdd[100010];
int main(){
int n, v[100010];
cin >> n;
for(int i = 0; i < n; i++){
cin >> v[i];
if(i%2==0){
numEven[v[i]]++;
}else{
numOdd[v[i]]++;
}
}
int numEvenMax = 0, numOddMax... | 0 | 31,814,217 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
struct Q{char x; int a, b, c, d;} a[2001][2001];
int n, m;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) cin >> a[i][j].x;
for(int i = 1; i <= n; i++) {
... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 46,278,772 |
#include<iostream>
using namespace std;
long long extGCD(long long a, long long b, long long *px, long long *py){
if(b == 0){
*px = 1;
*py = 0;
return a;
}
long long d = extGCD(b, a%b, py, px);
*py -= a/b * (*px);
return d;
}
int main(){
long long N;
cin >> N;
lon... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const long long mod = 1e9+7;
int main(){
int n, m; cin >> n >> m;
vector<bool> stairs(n+1, true);
for(int i=0; i<m; i++){
int a; cin >> a;
stairs[a] = false;
}
vector<ll> dp(n+1);
dp[0]=1;
for(int i=0; i<n; i... | 0 | 19,986,708 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve5a(int a, int b) {
REP(i,a) {
REP(j,b) {
cout << "#";
}
... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 83,932,734 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll ar[500009],br[500009],cr[500009];
int main()
{
ll a,b,c,i,j=0,k;
string s;
cin>>a;
for(i=1; i<=a; i++)
{
cin>>ar[i];
}
for(i=0;i<=a+1;i++)
{
j=j+abs(ar[i]-ar[i-1]);
}
for(i=1; i<=a; i++)
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long int;
int main(){
int N;cin>>N;
vector<int> d(N);
map<int,int> m... | 0 | 37,373,417 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<int> A(N,0);
for(int i = 0; i < N; i++)
{
cin >> A.at(i);
}
int ans = 1 << 30;
int temp = 0;
for (int i = 1; i <= 100; i++)
{
temp = 0;
for (int j = 0;... | 0 | 94,299,620 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
static const int INF = 1e9;
int dp[1001][1001];
void solve()
{
string s1, s2;
cin >> s1 >> s2;
int m = s1.size();
int n = s2.size();
for (int i = 0; i <= m; ++i)
{
for (int j = 0; j <= n; ++j)
{
dp[i][j] = INF;
}
}
for (int... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 14,941,476 |
#include<iostream>
#include<algorithm>
#define REP(i,n) for(int (i) = (0);(i) < (n);++i)
using namespace std;
int dp[1010][1010];
int main(){
string a,b;cin>>a>>b;
REP(i,a.size()+1)dp[i][0]=i;
REP(i,b.size()+1)dp[0][i]=i;
for(int i=1;i<=a.size();i++){
for(int j=1;j<=b.size();j++){
int q=1;if(a[i-1]==b[j-1])q ... | #include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main(){
int s, x, d=2;
cin >> s;
set<int> a;
a.insert(s);
while(1) {
if(s%2==0){
x = s/2;
if(a.find(x)!=a.end()) {
cout << d << endl;
return 0;
... | 0 | 83,767,500 |
#include<stdio.h>
int main(void)
{
int i,j,l;
char a[11],b[11],c[11];
scanf("%s%s%s",&a,&b,&c);
i=j=l=0;
while(a[i] != '\0')
i++;
i=i-1;
while(b[j] != '\0')
j++;
j=j-1;
if(a[i] == b[0]){
if(b[j] == c[0])
pr... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 17,667,116 |
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int H,W;
char S[22][22];
int DFS(int x, int y, int max){
return 0;
}
int main(void) {
int a,b,c,d; cin>>a>>b>>c>>d;
if(abs(a-c)<=d){
cout<<"Yes"<<endl;
}else if(abs(a-b)<=d && abs(b-c... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 62,802,280 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main() {
char ch[1000];
while(1){
scanf("%s", ch);
if (strcmp(ch, "0") == 0) break;
int sum = 0;
for (int i = 0; i < 1000; i++) {
if (ch[i] == '\0') break;
sum += ch[i] - '0';
... | #include <bits/stdc++.h>
#define fi first
#define se second
#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 rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 41,421,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int a, b, c, d... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 82,943,305 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a, b, c;
cin >> a >> b >> c;
if (a[a.length() - 1] == b[0] && b[b.length() - 1] == c[0])
cout << "YES";
else
cout << "NO";
} | #include <iostream>
#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>
#inc... | 0 | 84,217,786 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int d[k], a[k][n];
vector<bool> tricked(n, true);
for (int i = 0; i < k; i++) {
cin >> d[i];
for (int j = 0; j < d[i]; j++) {
cin >> a[i][j];
tricked[a[i][j] - 1] = false;
}
}
int count = 0;
for (... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <list>
#include <ctime>
#include <complex>
#include <bitset>
#include <tuple>
#include <functional... | 0 | 42,170,999 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;
int main() {
int n; cin >> n;
map<int, int> cnt;
while (n--) {
int a; cin >> a;
cnt[a]++;
}
priority_queue<int> pq;
for (auto &p: cnt) {
for (int i = 0; i < p.s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed <... | 0 | 84,720,590 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
string line;
map<char, int> m;
const char tmp = 'a';
for(int i=0; i<26; i++) {
m[tmp+i] = 0;
}
while(cin >> line) {
for(unsigned int i = 0; i<line.length(); i++) {
if('a' <= line[i] && line[i] <= 'z') {
... | # include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<=b){
if(b<=c){
printf("%d %d %d\n",a,b,c);
}else if(b>c){
if(a<=c){
printf("%d %d %d\n",a,c,b);
}else if(a>c){
printf("%d %d %d\n",c,a,b);
}
}
}else if(a>b){
if(a<=c){
printf("%d ... | 0 | 79,776,817 |
#include<bits/stdc++.h>
#include <string>
using namespace std;
const int mod = 1e9 + 7;
const long long INF = 1e18;
#define PI 3.141592653589793
#define REP(i, n) for(long long i = 0;i < n;i++)
int main()
{
int A,B;
cin>>A>>B;
if(A+B==3)cout<<3;
if(A+B==5)cout<<1;
if(A+B==4)cout<<2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long H, W;
cin >> H >> W;
long long res = 0;
long long w=0, h=0;
if(W%2 == 0){
w = W/2;
if(H%2 == 0){
h = H/2;
res = w*H;
}else{
h = (H+1)/2;
res = w*H;
}
... | 0 | 30,764,172 |
#include <iostream>
#include <string>
using namespace std;
void insertionSort(int A[],int N){
int i, j, v;
for(i = 1; i < N; ++i){
v = A[i];
j = i - 1;
while (j >= 0 && v < A[j]){
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
}
int main(){
int X,... | #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, n) for(int i=0; i<(n); i++)
int main(){
int n; cin>>n;
vector<int> x(n);
vector<int> y(n);
forin(x, n)... | 0 | 43,267,617 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... | 0 | 74,934,906 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.