code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<int> s(n, 0);
int k;
rep(i, m){
cin >> k;
rep(j, k){
int a;
cin >> a;
s[a-1] |= (1 << i);
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 1 | 51,834,229 |
#include <bits/stdc++.h>
#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;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int ... | 1 | 48,850,196 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
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 cout << "Yes" << endl... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ul unsigned long long int
#define ld long double
#define f(t) for(ll i =0;i<t;i++)
#define vi vector<int>
#define vl vector<ul>
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
#define inf 4e18
#define EPS 1e-3
... | 1 | 55,902,320 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main()
{
string s;
cin>>s;
int cnt=0;
REP(i,s.size())if(s[i]=='x')cnt++;
... | #include <bits/stdc++.h>
using namespace std;
std::string replaceAll(std::string &replacedStr, std::string from, std::string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::... | 1 | 3,259,530 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
int main() {
lint n,m; cin >> n >> m;
vector<int> v(n+1,0);
for(lint i=0;i<m;i++) {
lint a,b; cin >> a ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | 1 | 79,551,386 |
#include <iostream>
int main()
{
unsigned int n;
std::cin >> n;
unsigned int PricePerMeal { 800 };
unsigned int CustomerPaid { n * PricePerMeal };
unsigned int PaidBackPer15 { 200 };
unsigned int PaidBack { n / 15 * PaidBackPer15 };
unsigned int RealCost { CustomerPaid - PaidBa... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long meals = n / 15;
long long x = n * 800;
long long ans = x - (meals * 200);
cout << ans << endl;
} | 1 | 86,533,880 |
#include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
const int MAX_N = 1e5 + 5;
struct top3
{
int a[4] = {0 , 0 , 0 , 0};
void add(int x)
{
a[3] = x;
sort(a... | #include<iostream>
using namespace std;
int main(){
int a;
int x=0;
int y=0;
int z=0;
for(int i=1;i<=10;i++){
cin >> a;
if(a>x){
z=y;
y=x;
x=a;
}else if(y<a && a<=x){
z=y;
y=a;
}else if(z<a && a<=y){
z=a;
}
}
cout << x << endl;
cout << y << endl;
... | 1 | 92,981,828 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int h,w;cin>>h>>w;
int a[2003][2003];
rep(i,h){
string s;cin>>s;
rep(j,w){
if(s[j]=='#')a[i][j]=0;
else a[i][j]=1;
}
}
int a... | 1 | 53,028,457 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string a,b,c;
cin>>a>>b>>c;
if(a[a.size()-1]==b[0] && b[b.size()-1]==c[0]) cout<<"YE... | #include <stdio.h>
int main () {
char a[12];
char b[12];
char c[12];
int lenA = 0, lenB = 0;
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
for(int i = 0; a[i] != '\0'; i++) {
lenA++;
}
for(int i = 0; b[i] != '\0'; i++) {
lenB++;
}
if (a[lenA-1] == b [0] && b[lenB-1] == c[0]) {
printf("YES\n");
}
e... | 1 | 73,478,905 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
if (A <= 8 && B <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 1 | 20,560,256 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define f... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | 1 | 7,422,146 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<ll>>;
vector<bool>seen;
ll N;
int main(){
cin>>N;
Graph G(N);
vector<ll>indeg(N);
seen.resize(N,false);
for(ll i=0;i<N-1;i++){
ll a,b;cin>>a>>b;a--;b--;
G[a].push_back(b);
G[b].push_back(a);
indeg[a]++;ind... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 1 | 75,237,211 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> dcnt(n - 1, 0);
int mxd = 0;
for (int i = 0; i < n; i++) {
int d;
cin >> d;
if (i == 0 && d != 0) {
cout << 0 << endl;
return 0;
}
if (i != 0 && d == 0) {
cout ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 | 27,107,852 |
#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)++)
bool contains(string s, string t) {
int n = s.size()/2;
REP(i,n) {
string ss = s.substr(i... | #include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string s;
std::getline(std::cin, s);
std::string p;
std::getline(std::cin, p);
for (int si = 0; si < (int)s.size(); ++si)
{
if (s[si] == p[0])
{
bool match = true;
for (int pi = 0; pi < (int)p.size() && match; ++pi)
{
ma... | 1 | 63,954,117 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, P;
cin >> N >> P;
bool odd = false;
REP(i, N) {
int A;
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll memo[51][2];
int main() {
ll N, P;
cin >> N >> P;
... | 1 | 16,255,869 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long test=1;
while(test--)
{
long long n,m,i,j,a,b,c,d,ans=0;
cin>>a>>b>>c;
if(c>=a && c<=b)cout<<"Yes";
else cout<<"No";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | 1 | 93,199,514 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
in... | #include <bits/stdc++.h>
#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 ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll Gc... | 1 | 97,018,173 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll m, k;
cin >> m >> k;
if(m==1 && k==1 || (k >= 1ll<<m)) {
cout << -1 << endl;
return 0;
}
if(m==1 && k==0) {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int m, k;
cin >> m >> k;
int max_a = pow(2, m);
if (max_a <= k) {
cout << -1 << '\n';
return 0;
}
if (m == 0) {
if (k == 0) {
cout << "0 0" << '\n';
} else {
cout << -1 << '\n';
}
retur... | 1 | 22,488,287 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
int cnt = 0;
for(int i = 1; i <= n/2; i++){
int x = n-i;
if(x != i){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
printf("%d\n", (N - 1) / 2);
return 0;
} | 1 | 70,677,498 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define vvi vector<vi>
#define a... | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) sw... | 1 | 29,580,027 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | 1 | 14,525,591 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
vector<int> buf;
vector<bool> seen;
vector<string> ss;
void dfs(int i, const int size, const int range_start, const int range_end)
{
if (i == size) {
string str;
for (int j = 0; j < buf.size(); j++) {
str.push_back((char)(buf[j] + 48));
}
ss.push_back(str);
}
... | 1 | 77,476,159 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
#define debug(x) cerr<<#x<<" : "<<x<<endl;
#define dbg2(x, y) cerr<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<endl;
#define dbg3(x, y, z) cerr<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<" "<<#z<<" : "<<z<<endl;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 1 | 85,831,874 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,q,k;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<Edge>>;
int main(){
cin >> n;
Graph G(n);
for(ll i=0;i<n-1;i++){
ll a,b,c;
cin >> a >> b >> c;
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 1 | 51,155,520 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | #include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 300005;
int a[N], cnt[N], D[N];
int n;
i... | 1 | 97,524,833 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string k; cin >> k;
string s = k;
ll cnt = 0;
ll n = k.size(), t; cin >> t;
if(count(k.begin(), k.end(), k.front()) == n) {
cout << (t * n) / 2 << endl;
return 0;
}
for(int i = 1; i < n; i++) {
if(s[i - 1] == s[i]) {
s[i] = ... | #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 = (s); i < (int)(n); i++)
#define ALL(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
usin... | 1 | 72,425,495 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b>> c;
int answer;
if(a==b){
answer=c;
}else if(b==c){
answer = a;
}else{
answer=b;
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b,c;
cin>>a>>b>>c;
if(a==b) cout<<c<<endl;
else if(b==c) cout<<a<<endl;
else cout<<b<<endl;
} | 1 | 64,145,844 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N, K;
cin >> N >> K;
if (N % K == 0) {
cout << 0 << "\n";
}
else {
cout << 1 << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | 1 | 67,731,533 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#define int long long
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
signe... | /*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
string s;
cin >> a >> b >> s;
if (s.size() != a + b + 1 || s[a] != '-')
{
cout << "No... | 1 | 38,037,317 |
#pragma GCC optimize("O3")
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <random>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
using namespace std;
namespace fastinput {
template <class T = int> inline T readInt();
... | #include<iostream>
using namespace std;
int h,w,d;
char a[4]={'R','Y','G','B'};
int main()
{
cin>>h>>w>>d;
for(int i=1;i<=h;++i,cout<<endl)
for(int j=1;j<=w;++j)
{
int x=i+j+w,y=i-j+w;
cout<<a[((x/d)&1)*2+((y/d)&1)];
}
return 0;
} | 1 | 2,276,910 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | 1 | 54,155,023 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,p;
cin>>a>>b>>c>>d>>p;
int t=d+(60-b);
int y=(c-a-1)*60;
t=t+y;
t=t-p;
cout<<t;
} | 1 | 99,999,994 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
char ch[1000000];
int main(){
int n;
cin>>n;
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
cout<<(n/3);
return 0;
} | 1 | 71,564,658 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll ans = 0;
string s, t;
cin >> s >> t;
rep(i, s.size())
{
if (s[i] != t[i]) ans++;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
int ans = 0;
cin >> S;
cin >> T;
for (unsigned int i = 0; i < S.size(); i++) {
if (S.at(i) != T.at(i)) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 66,955,616 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<ll,ll>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll H, N;
cin >> H >> N;
vector<ll> minMag(H * 2, INT_MAX);
vector<ll> A(N), B(N);
for (ll i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
ll ans = INT_MAX;
minMag[0] = 0;
for (ll h = 0;... | 1 | 100,772,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, ss, ee) for (int i = (ss); i < (ee); ++i)
void solve() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll ans = 0;
if (a <= k) {
ans += a;
k -= a;
} else {
ans += k;
k = 0;
}
if (b <= k) {
k -= b;
} else {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
#define debug(x) cerr<<#x<<" : "<<x<<endl;
#define dbg2(x, y) cerr<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<endl;
#define dbg3(x, y, z) cerr<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<" "<<#z<<" : "<<z<<endl;
... | 1 | 88,547,097 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char s[100];
bool is_palindrome(char *s) {
int n = strlen(s);
for (int i=0;i<n;i++) {
if (s[i] != s[n-i-1])
return false;
}
return true;
}
void solve() {
int n = strlen(s);
if (!is_palindrome(s)) {... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 7,901,898 |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int>... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_NM = 2005;
const ll MOD = 1e9+7;
ll S[MAX_NM],T[MAX_NM];
ll dp[MAX_NM][MAX_NM],sum[MAX_NM][MAX_NM];
int main()
{
ll N,M;
cin >> N >> M;
rep(i,N)
{
cin >> S[i];
}
... | 1 | 9,725,076 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #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;
string s;
cin >> N >> s;
vector<int> sheep(N), res(N);
rep(i, N) {
if (s[i] == 'o') res[i] = 1;
else res[i] = 0;
}
rep(i, 2) rep(j, 2) {
sheep... | 1 | 25,913,667 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
using namespace std;
typedef vector<int> Ivec;
typedef pair<int, ... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 10;
unsigned N, dist[MAXN][MAXN];
int mark[MAXN];
int main() {
while (~scanf("%d", &N) && N) {
memset(mark, 0, sizeof(mark));
memset(dist, 0x7f, sizeof(dist));
for (int i = 0; i < N; i++) {
... | 1 | 51,722,941 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, string op, ll B) {
cout << A + B * (op == "+" ? 1 : -1) << endl;
}
int main() {
ll A;
cin >> A;
string op;... | #include <iostream>
using namespace std;
void solve(long long A, std::string op, long long B){
if (op == "+") cout << A + B << '\n';
else cout << A - B << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long A;
cin >> A;
std::string op;
std::cin >> op;
long long B;
... | 1 | 16,707,853 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int a,p, pies;
cin >> a >> p;
p = a * 3 + p ;
if(p % 2 == 0)
pies = p/2;
else
pies = (p-1)/2;
cout << pies;
} | #include <stdio.h>
int main(){
int utuh,potongan;
scanf ("%d %d" , &utuh,&potongan);
printf ("%d" , (utuh*3+potongan)/2);
return 0;
} | 1 | 95,469,343 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
vector<int> cnt(26);
int ans = 0;
rep(i, 4) {
int t;
t = s[i]-'A';
if (cnt[t] == 1) {
ans++;
}
cnt[t]++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
map<char,ll>ch;
for(ll i=0;i<4;i++){
ll now=s[i]-'A';
ch[now]++;
if(ch[now]>2){
cout << "No";
return 0;
}
}
for(auto itr=ch.begin();itr!=ch.end();itr++){
ll... | 1 | 60,687,764 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin(... | 1 | 46,675,533 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin>>n>>m;
vector<vector<ll>> mat(n,vector<ll>(m));
for(ll i=0;i<n;i++)
for(ll j=0;j<m;j++){
char ch;
cin>>ch;
if(ch =='.')
mat[i][j] = 1;
else
mat[i][j]=0;
}
vector<vector<l... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 1 | 82,168,808 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> g(n);
for(int i = 0; i < n-1; i++)
{
int a, b;
cin >> a >> b;
a--;b--... | #include<cstdio>
#include<algorithm>
#define N 110000
using namespace std;
inline char gc(){
static char now[1<<16],*T,*S;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0;char ch=gc();
while (ch<'0'||ch>'9') ch=gc();
while (ch<='9'&&c... | 1 | 55,830,370 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
struct SCard
{
char Name;
int Value;
};
vector<SCard> BubbleSort(vector<SCard> List);
vector<SCard> Selection(vector<SCard> List);
void Output(vector<SCard> List);
string IsStable(vector<SCard> Org, vector<SCard> After);
int main(){
... | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<limits>
#include<numeric>
#include<math.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repi(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
... | 1 | 18,701,686 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<int> a(N), b(N);
ll d = 0;
rep(i, N) cin >> a[i];
rep(i, N) cin >> b[i];
rep(i, N) {
if (a[... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 1 | 76,656,139 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,ll b){
ll u = 1;
ll d = 1;
while(b != 0){
u *... | 1 | 31,778,492 |
#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 rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
string s; cin >> s;
ll k; cin >> k;
int i = 0;
while(s[i] == '1')
{
i++;
if(i == k)
... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 1 | 20,505,126 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#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... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 1 | 65,638,243 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "/home/ichigo/debug.hpp"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) ... | 1 | 49,317,489 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
if (2*n > m) {
cout << m/2 << endl;
} else {
cout << n + (m-2*n)/4 << endl;
}
return 0;
} | #include<iostream>
using namespace std;
long long n,m,pair_num(0);
void using_s(){
n--;
m -= 2;
pair_num++;
}
void using_c(){
m -= 4;
pair_num++;
}
int main(void){
cin>>n>>m;
while(n>=1 && m>=2)using_s();
while(m>=4)using_c();
cout<<pair_num<<endl;
return 0;
} | 1 | 23,383,465 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#define LL long long
using namespace std;
const int maxn=1e5+10;
struct node
{
LL pos,val;
} a[maxn];
bool cmp(node a,node b)
{
if(a.val==b.val)return a.pos<b.pos;
return a.val>b.val;
}
int n;
LL ans[maxn];
int main()
{
scanf("%d",&... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n; scanf("%d",&n);
vector<lint> a(n+1);
rep(i,n) scanf("%lld",&a[i+1]);
n++;
priority_queue<pair<lint,int>> Q;
rep(i,n) Q.emplace(a[i],-i);
vector<lint> ans(n);
int cnt=0;
while(1){
int... | 1 | 19,463,162 |
#include <iostream>
using namespace std;
int main()
{
int n; cin >> n;
int a[200000]; for (int i = 0; i < n; ++i) cin >> a[i];
int l = 0, r = 0, sum = 0;
long long ans = 0;
while (r < n)
if (sum + a[r] == (sum ^ a[r]))
sum += a[r++];
else {
ans += r-l;
sum -= a[l++];
}
ans += (... | #include <cstdio>
using namespace std;
long long ans;
int n,suma,sumb,a[10000010];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int l=1,r=0;
while(l<=n)
{
while((suma^a[r+1])==(sumb+a[r+1])&&r<n)
{
suma^=a[r+1];
sumb+=a[r+1];
r++;
}
ans=ans+(r-l+1);
... | 1 | 63,271,668 |
#ifdef LOCAL111
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize ("O3")
#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }
#defi... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5;
int pre[N+2];
int post[N+2];
int p[N+2];
int loc[N+2];
int main()
{
memset(pre,-1,sizeof pre);
memset(post,-1,sizeof post);
int n; cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> p[i];
loc[p[i]] = i;... | 1 | 85,494,792 |
#include<bits/stdc++.h>
#define pb push_back
#define S second
#define F first
typedef long long ll;
using namespace std;
const ll maxn = 5e5 + 10;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
ll n, p, a[maxn], ans, k;
int main(){
cin >> n;
for(int i=0;i < n;i++){
cin >> a[i];
}
p = 2;
ans = a[0] - 1;
for(int i=... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll INF=1000000010;
const ll MOD=1000000007;
const ll LINF=4000000000000000000;
const long double EPS=1e-9;
typedef pair<int,int> P;
int main(){
int n;cin>>n;
ll ans=0;
int s=2;
for(int i=0;i<n;i++){... | 1 | 100,464,625 |
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v)... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, k, ans = 0;
cin >> n >> k;
vector<bool> flag;
for(int i=0; i<n; i++)
flag.push_back(true);
for(int i=0; i<k; i++)
{
int d;
cin >> d;
for(int j=0; j<d; j++)
{
int a;
cin >> a;
flag[--a] = fals... | 1 | 35,022,606 |
#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 ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } ret... | #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++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
int main() {
int n,k; cin >> n >> k;
vector<ll> a(n);
vector<ll> v... | 1 | 54,881,414 |
#include <iostream>
#include <string>
using namespace std;
const long M = 1046527;
string H[M];
long getKey(string str){
long sum = 0 , digit = 0 , p = 1;
for (int i = 0; i < str.size() ; ++i) {
if (str[i] == 'A') {
digit = 1;
} else if (str[i] == 'C') {
digit = 2;
... | #include <iostream>
#include <string>
using namespace std;
const int M = 1046527;
string table[M];
int get_char(char c) {
if (c == 'A') return 1;
else if (c == 'C') return 2;
else if (c == 'G') return 3;
else if (c == 'T') return 4;
else return 0;
}
long long get_key(string &text) {
long long su... | 1 | 52,252,340 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N, P;
cin >> N >> P;
int64_t odd=0;
int64_t A;
for(int64_t i=0LL; i<N; i++){
cin >> A;
odd+=A%2;
}
if(odd==0 && P==1){
cout << 0 << endl;
}
else if(odd==0 && P==0){
cout << (int64_t)pow(2, N) << endl;
}
else{
cout... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 1 | 7,225,518 |
#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(... | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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++)
int main() {
ll N, K;
cin >> N >> K;
ll A, B;
A = B = 0;
ll X;
rep(i, N) {
cin >> X;
if(X % 2 =... | 1 | 35,308,714 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin >> n >> m;
long long a[100005];
for(int i=0; i<n; i++) cin >> a[i];
long long p=1;
for(int i=0; i<n; i++){
long long x=1;
while(a[i]%2==0){
a[i] /= 2;
x *= 2;
}
i... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> pii;
int t;
ull lcm(ull a, ull b){
return (a*b)/__gcd(a,b);
}
ull number_times_divided_by_two(ull a){
ull cnt=0;
while(a%2==0){
a/=2;
cnt++;
}
return cnt;
}
void solv... | 1 | 2,230,603 |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<iomanip>
#include<cmath>
#include<numeric>
#include<vector>
#include<algorithm>
#include<string>
#include<deque>
#include<stack>
#include<map>
#include<cstring>
#include<random>
#include<queue>
#include<iterator>
#include<bitset>
#include<unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+1e3;
int h[N],dp[N];
int main(){
int n,k; cin >> n >> k;
for(int i = 1; i <= n; i++)cin >> h[i];
for(int i = 0; i <= n; i++)dp[i] = 1e9;
dp[1] = 0;
for(int i = 2; i <= n; i++){
for(int j = max(1,i-k); j < i; j++){
dp... | 1 | 8,031,039 |
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e16)
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7)
#define P... | 1 | 56,392,056 |
#pragma GCC optimize (3)
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#define ll long long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
ll S;
cin >> S;
ll x1,y1,x2,y2;
ll t = 1000000000;
ll tmp;
i... | 1 | 95,807,951 |
#include <iostream>
using namespace std;
int main()
{
int t[2], tp[2][4];
for (int i = 0; i < 2; i++){
t[i] = 0;
for (int j = 0; j < 4; j++){
cin >> tp[i][j];
t[i] += tp[i][j];
}
}
if (t[0]>=t[1]) cout << t[0] << endl;
else cout << t[1] << endl;
} | #include<stdio.h>
int main(void)
{
int a,b,c,d,e,f,g,h,x,y;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
scanf("%d",&g);
scanf("%d",&h);
x=a+b+c+d;
y=e+f+g+h;
if(x>=y){
printf("%d\n",x);
}
else{
printf("%d\n",y);
}
return 0;
} | 1 | 81,744,182 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1000000000;
constexpr int MODULO = 1000000007;
typedef int64_t ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll k = n / 50;
vector<ll> ou(50);
for (int i = 0; i < 50; i++) {
ou[i] = i+k;
}
k = n % 50;
f... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <cassert>
#include <random>
using namespace std;
using ll = long lo... | 1 | 45,789,383 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string reply;
cin >> a >> b;
if (((a %= 2) == 0) || ((b %= 2) == 0)) {
reply = "Even";
} else {
reply = "Odd";
}
cout << reply << endl;
} | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
int a, b;
cin >> a >> b;
if(a%2==0 || b%2==0) cout << "Even" << endl;
else cout << "O... | 1 | 96,664,221 |
#include <cstdio>
#include <algorithm>
const int MN = 105;
int N, A[MN], B[MN];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) scanf("%d", &A[i]), ++B[A[i]];
std::sort(A + 1, A + N + 1);
int len = A[N];
for (int i = 0; i <= len; ++i) --B[std::max(len - i, i)];
for (int i = 1; i <= N; ++i) if (B[i] < 0... | #include"bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
int a[106];
int bucket[106];
signed main() {
int n; cin >> n;
rep(i, n)cin >> a[i]; sort(a, a + n);
rep(i, n)bucket[a[i... | 1 | 26,260,173 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
vector<long long> v(n);
for(int i = 0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
long long answer = 0;
if(k >= n)
{
answer = 0;
}
else
{
for(int i = 0;i<n... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int i;
vector<int> h(n);
for(i=0;i<n;i++) cin >> h[i];
sort(h.begin(),h.end());
long long cnt = 0;
for(i=0;i<n-k;i++) cnt += h[i];
cout << cnt << "\n";
return 0;
} | 1 | 86,161,733 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 109;
void parbona() {
cout << "Impossible" << endl;
exit(0);
}
int done[MAXN];
int a[MAXN];
int findIdx(int n, int x) {
for (int i = 1; i <= n; i++) {
if (done[i]) continue;
if (a[i]==x) return i;
}
return -1;
}
int dst[MA... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,w[N],cnt[N];
inline int read()
{
int num=0; char g=getchar();
while(g<48||57<g) g=getchar();
while(47<g&&g<58) num=(num<<1)+(num<<3)+g-48,g=getchar();
return num;
}
int main()
{
n=read(); int val=0,sum; for(int i=1;i<=n;i++) w[i]=rea... | 1 | 90,130,389 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) ((a+b-1)/(b))
#define SORTG(v) sort(v.begin(),v.end(),greater<>())
#define SORT(v) sort(v.begin(),v.end())
#define ALL(v) (v).begin(),(v)... | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | 1 | 3,458,883 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >>... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 1 | 82,300,289 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 1 | 81,559,684 |
#include <bits/stdc++.h>
using namespace std;
map<int , int> nodes;
signed main(){
int n , a , node[2] = {};
cin >> n;
for(int i=0 ;i<n ;i++ ){
cin >> a;
nodes[a]++;
if(nodes[a] == 4){
node[0] = max(node[0] , a);
node[1] = max(node[1] , a);
} else if(n... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long int ll;
const int MOD=1000000007;
int main(){
int n;
cin>>n;
vector<ll> a(n+1);
rep(i,n)cin>>a[i];
a[n]= 0;
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
... | 1 | 32,619,425 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | 1 | 3,878,441 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int>A(1+N);
vector<int>B(1+N);
for(int i = 0; i <= N; i++) {
cin >> A[i];
}
B[N] = 0;
for(int i = N; i > 0; i--) {
B[i-1] = B[i]+A[i];
}
int ans = 0;
int c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 1 | 97,774,320 |
#include<cstdio>
int main(){
int i,n;
for(i=1;i<10;++i)for(n=1;n<10;++n)printf("%dx%d=%d\n",i,n,i*n);
} | #include <iostream>
using std::cout;
using std::endl;
int main()
{
for (int i = 1; i < 10; ++i)
for (int j = 1; j < 10; ++j)
cout << i << "x" << j << "=" << i * j << endl;
} | 1 | 21,790,615 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int MAX = 2000001;
const int VMAX = 10000;
int A[MAX], B[MAX];
int C[VMAX+1];
int main(){
ios::sync_with_stdio(false);
int n, i, j;
cin >> n;
for(i=0; i <= VMAX; i++) C[i] = 0;
for(i=0; i<n; i++){
cin >> A[i... | #include <cstdio>
#include <iostream>
#include <climits>
#include <cmath>
#include <utility>
#include <vector>
#define MAX 10010
using namespace std;
int C[MAX] = {0};
void printArr(vector<int> &A, int n)
{
for(int i = 0; i < n-1 ; i++) cout << A[i] << " ";
cout << A[n-1] << endl;
}
void CountingSort(vector<int> &A... | 1 | 99,621,265 |
#include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int m = 1e9;
int main() {
ll S, x2{m}, x3, y2{1}, y3;
cin >> S;
y3 = 1 + (S - 1) / m;
x3 = m - (S - 1) % m - 1;
cout << "0 0 " << x2 << " " << y2 << " " << x3 << " " << y3 << endl;
} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 | 68,351,476 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define MAX 200005
#define mod 1000000007
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define Case(i) cout<<"Case #"<<i<<": "
#define pf(a) printf("%lld\n"... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll... | 1 | 94,392,328 |
#include<iostream>
#include<algorithm>
#include<vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<long long> a(n), b(n), c(m), d(m);
for (int i = 0; i < n; i++) {
std::cin >> a[i] >> b[i];
}
for (int i = 0; i < m; i++) {
std::cin >> c[i] >> d[i];
}
for (int i... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> a(n),b(n),c(m),d(m);
for(int i=0;i<n;++i){
cin>>a[i]>>b[i];
}
for(int i=0;i<m;++i){
cin>>c[i]>>d[i];
}
int val=0;
for(int i=0;i<n;++i){
int ans=1000000000;
for(int j=0;j<m;++j){
i... | 1 | 99,654,408 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s, t;
cin >> s;
cin >> t;
vector<int> backet(26, 0);
for(int i = 0; i < s.length(); i++) backet[s[i]-'a']++;
string s1 = "";
for(int i = 0; i < 26; i++){
while(backet[i]){
s1 +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
#define MP(a,b) make_pair((a),(b))
#define MT(...) make_tuple(__VA_ARGS__)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i... | 1 | 80,722,893 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main(){
int d;
cin >> d;
if (d == 25){
cout << "Christmas\n";
}
if (d == 24){
cout << "Christmas Eve\n";
}
if (d == 23){
cout << "Christmas Eve Eve\n";
}
if (d == 22){
cout << "Christmas E... | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
int main() {
int d;
cin >> d;
switch (d) {
case 22:
cout << "Christmas Eve Eve Eve";
break;
case 23:
cout << "Christmas Eve Eve";
... | 1 | 94,994,928 |
#include<iostream>
using namespace std;
int x, y;
int cmmdc(int a, int b){
int r;
while(b != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
cin>> x;
y = 360 * x / cmmdc(x, 360);
cout<< y / x;
} | #include<bits/stdc++.h>
main(){int N;std::cin>>N;std::cout<<(360/std::__gcd(360,N));} | 1 | 76,102,631 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
string st;
string t;
vector<string> ss;
int main() {
cin >> st >> t;
string ans;
ans.resize(st.length());
bool flag;
for (int i = 0; i < (st.length() - t.length())+1; i++) {
for (int j = 0; j < t.length(); j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
string s,t;
cin >> s >> t;
ll n=t.size();
ll x=s.size();
if(x<n){
cout << "UNRESTORABLE" << endl;
return 0;
}
vector<ll>check(51,MOD);
for(ll i=x-n;i>=0;i--){
bo... | 1 | 20,696,714 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b, c, r;
string ans = "No";
cin >> a >> b >> c >> r;
if(abs(a-c)<=r || (abs(b-c)<=r && abs(a-b)<=r)) ans = "Yes";
cout << ans << endl;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(abs(a-c) <= d || (abs(a-b) <= d && ab... | 1 | 29,267,922 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <cstdio>
#define LL long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int w,l;
char ch;
int ma... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 | 48,117,196 |
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N , R, ir;
cin >> N >> R;
if (N >= 10) {
ir = R;
}
else {
ir = 100*(10 - N) + R;
}
cout << ir << endl;
} | 1 | 44,849,764 |
#include <complex>
#include <cmath>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a,xy_t b) {
return (conj(a)*b).real();
}
double cross_product(xy_t a, xy_t b) {
return (conj(a)*b).imag();
}
xy_t projection(xy_t p,xy_t b) {
return b * dot_product(p,b)/norm(b);
}
xy... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
double x1, y1, x2, y2, x3, y3, xp, yp;
double ax, ay, bx, by;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
double m,n;
ax = x2 - x1;
ay = y2 - y1;
bx = x3 - x1;
by = y3 - y1;
... | 1 | 46,242,843 |
#include <algorithm>
#include <iostream>
using namespace std;
int N, M;
pair<int,int> PD[10010];
int main() {
while (cin >> N >> M && N) {
int d, p;
for (int i=0; i<N; ++i) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD, PD+N, greater<pair<int,int> >());
int e = 0;
for (int i=... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
bool cmp(pair<int, int> &x, pair<int, int> &y)
{
return x.second > y.second;
}
int main(void)
{
int n, m;
while(cin >> n >> m, n > 0){
int j = 0, ans = 0;
vector<pair<in... | 1 | 65,365,054 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
ll pow(ll a, ll b, ll m)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
}
return ans;
}
boo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
const long long inf=1e18;
#define mod 1000000007
char ar[1005][1005];
ll dp[1005][1005];
void testCase()
{
{
ll n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
... | 1 | 94,005,083 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int main(){
int n;
cin >> n;
int num = 1;
int ans;
for(int i = 1; i <= n; i++){
if(num == n){
ans = num;
break;
}
else if( n... | 1 | 60,503,094 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vect... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
#include <cstring>
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
inline bool chmax(T &lhs, const U... | 1 | 1,253,542 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,ans=0,min;
cin >>n;
int p[n];
for(int i=0;i<n;i++) cin >> p[i];
min=p[0]; ans++;
for(int i=1;i<n;i++){
if(min>p[i]){
ans++;
min=p[i];
}
}
cout << ans;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main(){
int n;
cin >> n;
vi p(n);
rep(i,... | 1 | 8,720,104 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+50;
int n,c[maxn],d[maxn],kd[maxn],f[maxn],res[maxn];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
int ai;
scanf("%d",&ai);
++c[ai];
}
for(int i=1;i<=n;++i) ++d[c[i]];
for(int i=0;i<=n;++i) kd[i]=i*d[i];
... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c... | 1 | 66,527,163 |
#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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <iostream>
using namespace std;
int main() {
int m, k;
cin >> m >> k;
if (k >= (1 << m) || (m == 1 && k == 1)) {
cout << -1; return 0;
}
if (m == 1 && k == 0) {
cout << "0 0 1 1"; return 0;
}
cout << k << ' ';
for (int i = 0; i < (1 << m); ++i)
if (i != k... | 1 | 4,685,514 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int in[5], n[5]={0,1,2,3,4}, tmp, i, j;
cin >> in[0] >> in[1] >> in[2] >> in[3] >> in[4];
for(i=0;i<5;i++) {
for(j=i;j<5;j++) {
if(in[n[j]] > in[n[i]]) {
tmp = n[j];
n[j] = n[i];
n[i] = tmp;
}
}
}
printf("%d %d %d %d ... | #include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
vector<int> values;
copy(istream_iterator<int>(cin), istream_iterator<int>(), back_inserter(values));
sort(values.begin(), values.end(), greater<int>());
for (size_t i = 0; i < values.size(); ++i) {
if... | 1 | 39,188,907 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 1001
int dp[MAX][MAX];
int lcs(string& s,string& t,int si,int ti){
int ret = 0;
if(si < 0 || ti < 0)return 0;
if(dp[si][ti] != -1)return dp[si][ti];
if( s[si] == t[ti] ){
ret = max(ret, lcs(s,t,si-1,ti-1) + 1);
}else{
if(si > 0)ret = max(ret, lcs(s,t,si... | #include <bits/stdc++.h>
using namespace std;
#define For(I,A,B) for(int I=(A); I < (B); ++I)
int c[1005][1005];
int main()
{
int t;
string p;
cin>>t;
getline(cin,p);
while(t--){
int x,y,z,k=0,l,i,j;
string a,b,q="o",r="o";
For(i,0,1005)
For(j,0,1005)
c[i][j]=0;
getline(cin,a);
getline(cin,b);
x=a.length();
y=b.... | 1 | 25,597,349 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.