code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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;
constexpr int mod = 1000000007;
int main() {
ll n, z, w;
cin >> n >> z >> w;
vector<ll> a(n);
rep(i, n) cin >> a[i];
if (n == 1) {
cout << abs(a[0] - w) << endl;
return 0;
}
l... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
usin... | 0 | 71,260,690 |
#include <iostream>
#include <string.h>
using namespace std;
int char2int(char ch) {
if (ch == 'A') return 1;
if (ch == 'C') return 2;
if (ch == 'G') return 3;
if (ch == 'T') return 4;
return 0;
}
int string2hash(char str[]) {
int length = strlen(str);
int sum = 0;
int phase = 1;
for... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
t... | 0 | 47,254,163 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb p... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
string s;
cin >> s;
for(int i = 0; i < a; ++i)
{
if(s[i] == '-')
{
cout << "No" << endl;
return 0;
}
}
if(s[a] != '-')
{
cout << "No" << endl;
return 0;
}
for(int i = a+... | 0 | 70,741,883 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s,t;cin>>s>>t;
sort(all(s));
sort(all(t));
reverse(all(t));
if(s<t)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
int n,k;
int a[2001];
ll mod = 1e9+7;
cin >> n >> k;
for(int i=0;i<n;i++) cin >> a[i];
int cnt = 0ll;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(a[i]>a[j]) cnt++;
}
}
int cnt2 = 0ll;
... | 0 | 19,505,126 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), ... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
string s;
cin >> s;
bool check = false;
int arr['z'-'a'+1]{};
for(int i = 0; i < s.size(); i++)
{
arr[s[i] - 'a']++;
if( arr[ s[i] - 'a'] > 1 )
check = true;
}
if( check == false )
cout <... | 0 | 1,030,780 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int Squares, Blocks;
cin >> Squares >> Blocks;
cout << Squares * Squares - Blocks << endl;
} | #include <cstdint>
#include <iostream>
#include <string>
constexpr int32_t kMaxNumberOfVertices = 100;
constexpr int32_t kInvalidVertexIndex = -1;
void CallWarshallFloyd(std::istream &input_stream);
class WarshallFloyd {
public:
WarshallFloyd() noexcept;
~WarshallFloyd() noexcept;
void SetNumberOfVertices(const ... | 0 | 43,817,148 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
int r = (n - 1) * (n - 2) / 2 - k;
if (r < 0) {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
LL h,w,n;
cin >> h >> w >> n;
vector<LL> ans(10,0);
ans[0]=(h-2)*(w-2);
int a,b;
map<int,set<int>> field;
field[-2]=set<int>();
field[-1]=set<int>();
fi... | 0 | 8,841,831 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else
cout << ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<i... | 0 | 48,855,048 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T,U;
cin >> S >> T >> U;
char s = S.at(0)-32;
char t = T.at(0)-32;
char u = U.at(0)-32;
cout << s << t << u << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 1;
int x = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) != a){
x ++;
}
else {
a ++;
}
}
if (x == N)
... | 0 | 65,387,940 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N, M;
cin >> N >> M;
double p = pow(0.5, (double)M);
int ans = (1900.0 * M + 100.0 * (N - M)) / p;
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #pragma region header
#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--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 91,761,014 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
int main() {
string S;
cin >> S;
if(S[3-1]==S[4-1]&&S[5-1]==S[6-1]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
#define pb push_back
int main(void){
ll h,n;
cin>>h>>n;
vector<pair<ll,ll>>p(n);
rep(0,i,n){
cin>>p[i].first>>p[i].second;
}
ll dp[h+1];
rep(0,i,h+1)dp[i]=(ll)1e9;
dp[0]=0;
... | 0 | 2,876,024 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = int_fast64_t;
using pll = pair<ll,ll>;
constexpr ll INF = 1LL<<60;
constexpr ll MOD = 1e9+7;
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b)... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#define MAX 1000000000
#define MIN -10000000000
#define ll long long
using namespace std;
int main() {
ll n,k,i,j,temp,last,maxx;
do {
cin>>n;
if(n==0)break;
vector<ll> a(n);
vec... | 0 | 9,299,229 |
#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... | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v)... | 0 | 41,833,782 |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | #include<bits/stdc++.h>
#include<math.h>
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fl(i,a,b) for(ll i=a;i<b;i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#... | 0 | 46,545,402 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | #include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld"... | 0 | 73,761,219 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include <bits/stdc++.h>
using namespace std;
int H, W;
char s[50][50];
int check(int x, int y){
bool k=false;
if(x>0 && s[x-1][y]==1){
k=true;
s[x-1][y]=0;
check(x-1, y);
}
if(y<W && s[x][y+1]==1){
k=true;
s[x][y+1]=0;
check(x, y+1);
}
if(x<H && s[x+1][y]==1){
k=true;
s[x+1]... | 0 | 18,993,755 |
#include <bits/stdc++.h>
#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 INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1,... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 0 | 100,536,122 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>
#include<deque>
using namespace std;
#define INF 1 << 29
#define LL long long int
struct Edge{
int a;
int b;
Edge(in... | 0 | 86,845,793 |
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a, b, k; cin >> a >> b >> k;
ll c = max(a-k, (ll)0), d = max(b - max(k-a, (ll)0), (ll)0);
cout << c << " " << d << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 69,744,567 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b;
cin >>a >>b;
int i;
for(i=0;i<1500;i++){
if(((int)(i*0.080)) == a && ((int)(i*0.10)) == b) goto OUT;
}
i=-1;
OUT:
cout <<i;
return 0;
} | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 79,103,790 |
#include <iostream>
#include <deque>
using namespace std;
int main() {
int n, m;
char a, b;
deque<char> s, x, y;
while(cin >>n) {
if(!n) {
break;
}
for(int i=0; i<n; i++) {
cin >> a >> b;
x.push_back(a);
y.push_back(b);
}
cin >> m;
for(int i=0; i<m; i++) {
cin >> a;
s.push_back(a);
}... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
int a[100][100];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
char c;
cin >> c;
a[i][j] = (c == '.');
}
}
bool f[100];
fill(f, f + 100, true);
for(int i = 0; i < h; i++){
bool ff = ... | 0 | 78,609,830 |
#include <iostream>
#define NIL -1
struct Node {
int parent, left, right;
};
int getDepth(Node* nodeList, int index)
{
int parent = nodeList[index].parent;
int depth = 0;
while (parent != NIL) {
depth++;
parent = nodeList[parent].parent;
}
return depth;
}
std::string getType(Node* node)
{
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
s+='T';
int x,y;
cin >> x >> y;
int n=s.size();
int direction=0;
int count=0;
vector<int> X,Y;
Y.push_back(0);
for (int i=0; i<n; i++){
if (s[i]=='F'){
... | 0 | 50,110,508 |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
class Dice {
private:
int surface[6];
void next(int a, int b, int c, int d);
public:
Dice(int surface[6]);
Dice();
void role(char dir);
void rot(char dir);
void set(int pos, int num);
int get(int pos);
};
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int x, y;
cin >> x >> y;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, -1, 0... | 0 | 53,773,015 |
#include <iostream>
using namespace std;
const int MAX_N = 1e5 + 5;
int arr [MAX_N];
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (arr[arr[i]] == i) ans++;
}
ans /= 2;
cout << ans <<... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 35,151,501 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
string s,t; cin >> s >> t;
... | #include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <bitset>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <utility>
#include <functional>
#include <map>
#include <set>
#incl... | 0 | 40,219,403 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll h,w;
cin >> h >> w;
vector<string> s(h);
for(auto &i:s)cin >> i;
vector<vector<ll>> dis(h,vector<ll>(w,1e9));
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
if(s[i][j]=='#')dis[i][j]=0;
}
}
for(int i = 0;i<h;i++)
{
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 | 78,994,404 |
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <cmath>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define FI first
#define SE second
#define MA(i,j) make_pair(i,j)
#define PA pair<int,int>
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
int main(void){
string s;
cin>>s;
int n=s.size();
bool ok=false;
int L=-1,R=-1;
if(n==2&&s[0]==s[1]){
L=1,R=2;
}
for(int i=0;i<n-2;i++){
if(s[i]==s[i+1]||s[... | 0 | 93,100,532 |
#include<iostream>
using namespace std;
int main(){
long long n;
cin >> n;
cout << n*(n-1)/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,k;
cin>>a>>b>>k;
for(int i=0;i<k;i++){
if(i%2==0){
if(a%2!=0)
a--;
b+=a/2;
a/=2;
}else{
if(b%2!=0)
b--;
a+=b/2;
b/=2;
}
}
cout<<a<<' '<<b<<endl;
return 0;
} | 0 | 493,149 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
bool prime(int cur)
{
if(cur==1||cur==0)return false;
for(int i=2;i<=sqrt(cur);i++)
{
if(cur%i==0)
{
return false;
}
}
return true;
}
in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
std::string s; std::cin >> s;
int A = s[0] - '0';
int B = s[1] - '0';
int C = s[2] - '0';
int D = s[3] - '0';
if (A + B + C + D == 7)
std::cout <... | 0 | 66,402,252 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a) ;i<(b) ;i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0 ;i<(n) ;i++)
#define RREP(i,n) for (int i=(n)-1;i>=0 ;i--)
#define EACH(i,a,b) for (int i=(a) ;i<=(b);i++)
#define REACH(i,a,b... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 70,780,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 99,728,797 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 296,158 |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;
const int maxn=2222;
const ll modn=1e9+7;
const int inf=2e9+7;
const double PI = acos(-1.0);
const double eps=1e-8;
inline int lowbit(int x){return x&-x;}... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
int x, y;
int i, st, large, small;
for(i = 1; i <= 3000; i++){
scanf("%d", &x); scanf("%d", &y);
small = x;
large = y;
if(y < small){
small = y;
large = x;
... | 0 | 23,015,744 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n... | #include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout... | 0 | 7,252,483 |
#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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll keta(ll a) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, k;
cin >> n >> c >> k;
int bus = 1;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
sort(t.begin(), t.end());
int saisyonokata = -1, genkai = 0, machi = 0;
for (int i = 0; i < n; i++) {
if(saisyonokata == -1) {
sai... | 0 | 96,296,329 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define x first
#define ld long double
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) a.begin(... | #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... | 0 | 42,416,007 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
int ans=-1,a;
for(int i=1;i<=n;i++){
int cnt=0,j=i;
while(j){
if(j%2==0)cnt++;
j/=2;
}
if(cnt>ans){
ans=cn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
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,... | 0 | 16,818,028 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | 0 | 70,749,011 |
#include<iostream>
using namespace std;
int main(){
string s,t;
cin >> s;
cin >> t;
if(s.size() != t.size()){
return 0;
}else{
int cnt = 0;
for(int i = 0;i < s.size();i++){
if(s[i] != t[i]){
cnt++;
}
}
cout << cnt << end... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
ll repeatsquaring(ll N,ll M,ll P){
if(M==0)return 1;
if(M%2==0){
ll t=repeatsquaring(N,M/2,P);
return t*t%P;
}
return M*repeatsquaring(N,M-1,P);
}
int main(){
ll N;
cin>>N;
vector<ll>A(N);
for(int i=0;i<N;i... | 0 | 8,919,199 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
void print_vec(vector<int> vec) {
cout << "[";
for (int i = 0; i < vec.size(); i++) {
if (i) {
cout << ", ";
}
cout << vec.at(i);
}
cout << "]...size: " << vec.s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 46,874,036 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,ans=0;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A.at... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
int i,j,k,l1,l2;
cin>>a>>b;
l1=a.size();
l2=b.size();
int ar[l2+1][l1+1];
for(i=0;i<=l2;i++){
for(j=0;j<=l1;j++){
if(i==0){
ar[i][j]=j;
}
else if(j==0){ar[i][j]=i... | 0 | 42,300,937 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
map<string,int> br;
string tmp;
rep(i,N) {
cin >> tmp;
br[tmp]++;
}
int M;
cin >> M;
rep(i,M) {
cin >> tmp;
br[tmp]--;
}
int ans=0;
for(auto itr : br) {
ans =... | #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 | 6,762,568 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=a;i<=b;++i)
#define rpd(i,a,b) for(register int i=a;i>=b;--i)
#define rep1(i,x) for(register int i=head[x];i;i=nxt[i])
typedef long long ll;
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 44,128,682 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,ans=-1;
cin >> n >> m;
for(int i=0;i<=1262;i++){
if(floor(i*0.08)==n&&floor(i*0.1)==m){
ans=i;
break;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define rep(i,a,b) for (int i = a; i <= (int)b; ++i)
#define f first
#define s second
#define single_test
constexpr int mod = 1e9 + 7;
struct M {
unsigned v;
M(long long a = 0)... | 0 | 27,205,360 |
#include <iostream>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
cout << (N + K - 1)/K - N/K;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int x[100010],w[100010];
int ans[100010];
int n,L,r,t;
long long fldl;
int main()
{
scanf("%d%d%d",&n,&L,&t);
for(int i = 1;i <= n;i++)
{
scanf("%d%d",&x[i],&w[i]);
if(w[i] == 2)w[i] = -1;
}
for(int i = 1;i <= n;i++)
{
int len = x[i] + w[... | 0 | 56,548,438 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<double>> p(n, vector<double>(d));
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> p[i][j];
}
}
int ans = 0;
for (int i = 0; i < n-1; i++) {
... | 0 | 81,827,798 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T ipow(T b, long long e) {
if (e == 0) {
return 1;
} else if (e % 2 == 0) {
return ipow(b * b, e / 2);
} else {
return ipow(b * b, e / 2) * b;
}
}
template <typename T>
T combination(int n, int r) {
T ans = 1... | #include<bits/stdc++.h>
using namespace std;
#define int long long
char table[110][110];
const int inf = 1010;
void chmin(int &a, int b){
if( a > b ){ swap(a,b);}
return ;
}
signed main(void){
int h,w; cin >> h >> w;
vector<vector<int>> dp(h,vector<int>(w,inf));
dp[0][0] = 0;
for(int i = 0; i < h; i++){ ... | 0 | 98,501,509 |
#include<iostream>
using namespace std;
int main() {
int n;
int a[250];
cin >> n;
for (int j = 0; j < n; j++) {
cin >> a[j];
}
for (int j = 0; j < n; j++) {
cout << "node " << j+1 << ": key = " << a[j]<<", " ;
if (j != 0) {
int k = (j -1)/ 2;
cout << "parent key = " << a[k]<<", " ;
}
int righ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | 0 | 60,702,388 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int a[2020];
int b[2020];
int dp[2020][2020];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,m=0;
cin>>n>>m... | 0 | 87,027,042 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <set>
#include <algorithm>
using namespace std;
#define LL long long
#define MX 200005
int main ()
{
LL k;
scanf("%lld",&k);
LL t = k/50;
LL m = k%50;
printf("50\n");
for (int i=0;i<49;i++)
{
if (... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ret return
using namespace std;
int main() {
int x,y;
cin>>x>>y;
bool ok=0;
for(int i=x;i>=0;i--) {
int j=x-i;
if(i*2+j*4==y)
ok=1;
}
if(ok)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
ret 0;
} | 0 | 67,711,214 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
int T[110] = {};
int V[110] = {};
int S[110] = {};
for(int i = 1; i <= N; i++){
cin >> T[i];
S[i] = S[i-1] + T[i] * 2;
}
for(int i = 1; i <= N; i++){
cin >> V[i];
}
int A[40010] = {};... | 0 | 48,072,843 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long ... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=0, tmp=0, state=0;
vector<ll> A;
vector<vector<ll>> B;
signed main(){
cin >> N;
for(int i=0;i<N;i++) {
ll a;
cin >> a;... | 0 | 92,773,401 |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> v;
for(int i=0;i<n;i++)
{ int x;
cin>>x;
v.push_back(x);
}
vector<int> dp(n,0);
for(int i=n-2;i>=0;i--)
{
dp[i]=INT_MAX;
for(int j=1;j<=k;j++)
{
if(j+i==n)
break;
dp... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define ss second
#define ff first
#define pb push_back
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO ios_base::sy... | 0 | 66,353,071 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
int A[110];
cin >> N;
for (int i = 0; i < N; ++i){
cin >> A[i];
}
int M = A[0];
int m = A[0];
for (int i = 0; i < N; ++i)
{
if(A[i] > M){
M = A[i];
}
if(A[i] < m... | 0 | 14,720,537 |
#include <iostream>
#include <string>
#include <queue>
typedef long long int ll;
using namespace std;
int N;
ll a[100002];
ll min(ll a, ll b) {
return (a < b) ? a : b;
}
ll max(ll a, ll b) {
return (a > b) ? a : b;
}
ll solve() {
int i, j, ki;
ll res = 0;
ll allxor = 0;
for (i = 0; i < N; i++) {
allxor ^= a[i];... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
b... | 0 | 23,847,879 |
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iomanip>
#include<complex>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VV... | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb pu... | 0 | 29,470,241 |
#include <iostream>
#include <cmath>
#include <iomanip>
int main() {
double m = 100;
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
m *= 1.05;
m = std::ceil(m);
}
std::cout << std::fixed << std::setprecision(0) << m * 1000 << std::endl;
return 0;
} | #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 | 55,554,613 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n; i++)
{
if (b[n - 1]... | 0 | 91,450,943 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
bool ok = true;
if (s[0] != 'A') ok = false;
int c = 0;
for (int i = 2; i < s.size()-1; ++i)
if (s[i] == 'C') c++;
if (c != 1) ok = false;
int d = 0;
for (int i = 0; i < s.size(); ++i)
if (s[i] < 97) d++;
if (d != 2) ok = false;
... | #include <bits/stdc++.h>
using namespace std;
#define Lim 9999991
#define Jmp 100003
long long dic[Lim];
long long toint(string s) {
long long ret = 0;
for (int i = 0; i < s.size(); ++i) {
ret <<= 3;
switch (s[i]) {
case 'A':
ret += 1;
break;
... | 0 | 36,327,911 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
long long a=2,b=1;
if(n==0)cout<<a;
if(n==1)cout<<b;
else{
long long c;
for(int i=2;i<=n;i++){
c = b;
b = a+b;
a = c;
}
cout<<b;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int n1 = a.size();
int n2 = b.size();
int dp[n1+1][n2+1];
rep(i,n1+1)rep(j,n2+1)dp[i][j] = 0;
rep(i,n1)... | 0 | 47,223,107 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int ans;
for (int i = 0; i < a; i++){
if (i == 0){
ans += b;
}
else{
ans = ans * (b - 1);
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <iostream>
#include <cstdint>
#include <vector>
#include <utility>
using namespace std;
using i64 = int64_t;
using pii = pair<i64, int>;
using vpii = vector<pii>;
vpii PF(i64 n){
vpii pf;
for(i64 i=2; i*i<=n; i++){
if(n%i != 0) continue;
int ex = 0;
while(... | 0 | 2,350,171 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 3,265,742 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
string s;
long k;
cin >> s >> k;
size_t first = s.find_first_not_of("1");
if (first == string::npos) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template<typename T>
void fin (T a){
cout<<a<<endl;
exit(0);
}
template<typename S>
void print(S a){
cout<<a<<endl;
}
template<typename U>
void pprint(U a){
... | 0 | 6,778,484 |
#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>;
using v = vector<int>;
using vv = vector<v>;
const int MOD = 998244353;
const int INF = 1001001001;
int main(){
int x,a;cin >>x>>a;
cout << ((10+x-a)/10)*10 << endl;
retur... | # include<bits/stdc++.h>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define eps 1e-8
# define MOD 1000000007
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(register int i=a; i<=n; ++i)
# define FDR(i,a,n) for(register int i=a; i>=n; --i)
# define ... | 0 | 40,695,675 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | #include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<climits>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<cst... | 0 | 84,377,950 |
#include <bits/stdc++.h>
using namespace std;
int main(){
const int N= 3;
vector<string> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
bool is_satisfied= true;
for(int i=1; i<N; i++){
if(data.at(i-1).back()!=data.at(i).at(0)){
is_satisfied= false;
break;
}
}
string ans= (... | #include<bits/stdc++.h>
#define INF 1e18
#define int long long
using namespace std;
struct Graph{
Graph(int n):d(n,vector<int>(n,INF)),N(n){
for(int i=0;i<n;++i)d[i][i]=0;
}
vector<vector<int>>d;
int N;
void add_edge(int a,int b,int c){
d[a][b]=c;
}
void warshallFloyd(){
... | 0 | 52,200,551 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? ... | #include <stdio.h>
int main () {
int a[3][3];
int count = 0;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &a[i][j]);
}
}
int n, m, b[3][3];
scanf("%d", &n);
for ( int i = 0; i < n; i++) {
scanf("%d", &m);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if ... | 0 | 10,034,641 |
#include <iostream>
using namespace std;
int main() {
int n,x;
while (true) {
int count = 0;
cin >> n >> x;
if (n == 0 && x == 0) {
break;
}
int start = n ? n < x : x;
for (int a = n; a > 2; a--) {
for (int b = a-1; b > 1; b--) {
... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 78,110,573 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
cout << "100 100" << endl;
rep(i,50){
rep(i, 25){
if(a > 1){
cout << ".#";
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Pair = pair<int, int>;
using Vec = vector<int>;
using Graph = vector<Vec>;
int main(void)
{
string s, t;
cin >> s >> t;
cout << t << s << endl;
} | 0 | 49,084,257 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000 * 1000 * 1000 + 7;
const int MX = 100 * 1000 + 7;
void add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
void sub(int &x, int y) {
x -= y;
if (x < 0) x += MOD;
}
int mul(int x, int y) {
... | 0 | 59,248,563 |
#include<iostream>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int FirstNum = r * x - D;
cout << FirstNum << endl;
for (int i = 1; i < 10; i++) {
cout << r * FirstNum - D << endl;
FirstNum = r * FirstNum - D;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
#define bit(n,k) ((n>>k)&1)
cons... | 0 | 78,906,652 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool guess(ll x)
{
if (x == 0) return 1;
printf("? %lld\n", x);
fflush(stdout);
char ch = getchar();
while (ch != 'Y' && ch != 'N') ch = getchar();
return ch == 'Y';
}
void confirm(ll x)
{
printf("! %lld\n", x);
fflush(stdout);
exit(0);
}
int ... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int h,w;
char mp[111][111];
int xx[4]={0,1,0,-1};
int yy[4]={-1,0,1,0};
int sx,sy;
int tile(int y,int x){
if(y<h&&x<w&&y>=0&&x>=0&&mp[y][x]!='#'){
mp[y][x]='#';
int t=0;
for(int i=0;i<4;i++){
t+=tile(y+y... | 0 | 74,672,634 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 10000;
ll N, ans=0, tmp1=0, tmp2=0, tmp3=0;
string A[MAXN];
signed main(){
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=0;i<N;i++) {
for(int j=0;j<A[i].size()-1;j++) {
if(A[... | 0 | 50,322,638 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int h, n; cin >> h >> n;
vector<int> dp(h + 1, INT_MAX);
dp[0] = 0;
while (n--) {
int a, b; cin >> a >> b;
for (int i = 1; i <= h; i++)
dp[i] = min(dp[i], max(dp[i-a], 0) + b);
}
cout << dp[h] << '\n';
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
void printNo(){
cout << "NO" << endl;
exit(0);
}
int main() {
string s;cin >> s;
string pre = "";
for(ll i=0;i<(ll)s.size();++i){
if( s.at(i) != 'd' && s.at(i) != 'e' ) printN... | 0 | 52,757,328 |
#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;
int n = s.size();
int a = 0;
int b = 0;
rep(i, n){
if(s.at(i) == '0'){
a++;
}else{
b++;
}
}
cout << min(a, b)*2 << endl;
return... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vp;
const int inf = 1e9;
const ll INF = 1e18;
const db eps = 1e-10;
#define fi first
#define se second
#define pb push_back
#define eb empl... | 0 | 85,141,263 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 40,266,521 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <bitset>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
const int MAX = 510000;
const int MOD = 1000000007;
const int MAX_N = 200000;
int ctoi(const char c){
switch(c){
... | 0 | 53,190,819 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 1000001;
const double PI = acos(-1);
int dp[110][11][3], k, n;
string num;
int solve(int pos, int nz, ... | 0 | 17,198,539 |
#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>;
using vb=vector<bool>;
using vvb=vector<vb>;
using vc=vector<char>;
using vvc=vector<vc>;
using pii = pair<int,int>;
using pil = pair<int,ll>;
using pli = pair<ll,in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
ll N, a, b, c;
vector<ll> V;
ll ans = INF;
int main(){
cin >> N >> a >> b >> c;
V.resize(N);
for(int i = 0; i < N; i++) cin >> V[i];
for(int i = 1; i < (1<<N); i++){
for(int j = 1; j < (1<<N); j++){
... | 0 | 92,841,441 |
#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++)
int main() {
long n,m;
cin>>n>>m;
vector<long>a(n);
map<long,long>memo;
long tot=0;
rep(i,n){
cin>>a.at(i);
tot+=a.at(i);
tot%=m;
memo[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long 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; }
int ... | 0 | 38,995,899 |
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
if (i + 1 < n && s[i] == s[i + 1]) {
printf("%d %d\n", i+1, i + 2);
return ... | 0 | 15,912,982 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin >> m >> n;
if(m==1||n==1)
{
cout << 1;
}
else if((m*n)%2==0)
{
cout << m*n/2;
}
else
{
cout << (m*n+1)/2;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 17,775,176 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[200010],vis[200010];
vector<int>v;
int main(){
char a,b;
cin>>a>>b;
if(a=='H')
{
if(b=='H')cout<<'H';
if(b=='D')cout<<'D';
}
else
{
if(b=='H')cout<<'D';
if(b=='D')cout<<'H';
}
r... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll... | 0 | 32,479,121 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll mod = 998244353;
const int MAX = 510000;
int main() {
vector<char> alphabet;
for (char c='a'; c<='z'; c++) alphabet.push_back(c);
string S;
cin >> S;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
if(S.size() <= N){
cout << S << endl;
return 0;
} else if(N < S.size()) {
S.erase(N);
cout << S << "..." << endl;
return 0;
}
} | 0 | 80,043,117 |
#include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(),V.end()
#define ll long long
#define MOD 1000000007
int main() {
ll N;
string S;
cin >> N;
cin >> S;
vector<ll> A(N * 2, 1), B = A;
for (int i = 0;i < N * 2;i++) {
if (i % 2) {
if (S[i] == 'B')
A[i] = -1;
}
else if (S[i] == 'W')
... | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> v;
for (int i =0 ;i < 2 * N; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
int ans = 0;
for (int i =0 ;i < N; i++) {
ans += v[2 * i];
}
cout <... | 0 | 61,630,201 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll output = 0;
ll now = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'B') {
now++;
} else {
output += now;
}
}
cout << output << endl;... | #include <iostream>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
const int kNil = -1;
const int kMaxV = 110;
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_t... | 0 | 37,787,343 |
#include<stdio.h>
int main(){
char letter;
scanf("%c",&letter);
char next = letter + 1;
printf("%c\n", next);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long d[100000];
int main() {
long long n;
cin >> n;
long long a;
long long ans=1;
for(int i=0;i<n;i++){
cin >> a;
d[a]++;
if(i==0&&a>0){
ans=0;
cout << ans << endl;
return 0;
}
... | 0 | 28,145,108 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <iostream>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
int main(){
ll p=0,q=0,x,y,n;
int a,b,c,i;
cin>>a>>b;
for(i = 0;i < a;i++){
cin>>n;
p = p+n*(i)-n*(a-i-1);
p = p%mod;
}
for(i = 0;i < b;i++){
cin>>n;
q = q+n*(i)-n*(b-i-1... | 0 | 37,123,147 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
s[i].resize(k);
rep(j, k) {
cin >> s[i][j];
--s[i][j];
}
}
int p[m];
... | 0 | 21,543,682 |
#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... | #include <stdio.h>
int main(void) {
int i, j, a[3], tmp;
scanf("%d %d %d",&a[0],&a[1],&a[2]);
for (i=0; i<2; i++) {
for (j=0; j<2; j++) {
if(a[j] >= a[j+1])
{
tmp = a[j];
a[j] = a[j+1];
a[j+1] = tmp;
}
}
... | 0 | 41,370,300 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #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;
const ll INF=(ll)1e19;
int main(){
int n,m;
cin >> n >> m;
vector<vector<... | 0 | 40,154,224 |
#include<iostream>
#include<map>
using namespace std;
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
typedef long int li;
int main(){
string s; cin >> s;
rep(i,4) cout << s[i];
cout << " ";
repa(i,4,s.size()) cout << s[i];
cout << "\n";
} | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <cmath>
#include <cctype>
#define ll long long
#define INF 1e+7
#define MOD 1000000007
using namespace std;
int main(){
l... | 0 | 83,897,411 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
#include<functional>
using namespace std;
using ll = long lo... | #include <bits/stdc++.h>
using namespace std;
#define Vi vector<int>
#define FOR(i,s,e) for (int i=s; i<e; i++)
#define ITER(v) v.begin(), v.end()
constexpr int MAX_LEN = 1'000;
int dp[MAX_LEN][MAX_LEN];
void set_val(int i, int j, int inc) {
int val = inc;
if (i > 0 && j > 0) {
int tmp = dp[i-1][j-1] + ... | 0 | 54,879,934 |
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | #include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;... | 0 | 99,624,071 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector <ll> d(n), c(n);
ll sum = 0;
ll cnt = 0;
for(int i = 0; i < n; i++) {
cin >> d[i] >> c[i];
sum += d[i] * c[i];
cnt += c[i];
}
cout << (cnt - 1) + (sum - 1) / 9 << '\n';
} | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int n, Q;
ll x[1... | 0 | 16,352,585 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
bool check = true;
vector<vector<char>> sub(N, vector<char>(N));
for (int x... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a,b,c;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b>>c;
if(c>=a&&c<=b)
cout<<"Yes";
else
cout<<"No";
return 0;
} | 0 | 14,308,364 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, s{};
cin >> N;
vector<int> A(N + 2);
for (int i = 1; i <= N; ++i) {
cin >> A[i];
s += abs(A[i] - A[i - 1]);
}
s += abs(A[N]);
for (int i = 1; i <= N; ++i) {
cout << s + abs(A[i + 1] - A[i - 1]) - abs(A[i + 1] - A[i]... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n), b(n);
for(int i=0; i<n; i++)
cin >> a[i] >> b[i];
long m = 1e9;
for(int i=0; i<n; i++)
if(a[i]-b[i] > 0 && m > b[i]) m = b[i];
if(m == 1e9) {
cout << 0 << endl;
... | 0 | 20,134,855 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, p;
cin >> n >> p;
int a[20000];
int m = 0;
for(int i=0; i<n;++i){
cin >> a[i];
if(a[i] % 2 == 1) m++;
}
if(m==0)cout << (p==0 ? (1ll <<n) : 0) << endl;
else cout << (1ll << (n-1)) << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 4,922,727 |
#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>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
const int MAX=1000010;
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit(){
fac[0]=fac[1]=1;
... | 0 | 61,542,379 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
... | #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;
typedef pair<ll,ll> P;
#define a firs... | 0 | 9,876,775 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.