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;
int main(){
string s;
cin >> s;
string ans;
rep(i,s.size()){
if(s[i]!='B'){
ans.push_back(s[i]);
}
else{
if(ans.size()==0)continue;
else... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 0 | 43,890,044 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 50,169,951 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include<bits/stdc++.h>
using namespace std;
int32_t main()
{
int n,h;
cin>>n>>h;
vector<int> a,b;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
a.push_back(x);
b.push_back(y);
}
sort(rbegin(a),rend(a));
vector<int> power;
int ans=0;
for(auto i:b)
... | 0 | 100,542,895 |
#include <bits/stdc++.h>
using namespace std;
unordered_set<string> okWord;
string Extract(string &str, int s, int e) {
string res;
if (s<0) {return res;}
for (int i=s; i<e; i++) {res+=str.at(i);}
return res;
}
int NextStartIndex(string &str, int p) {
for (int i=7; i>=5; i--) {
if (okWord.count(Extract(st... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
int n, a, b, c, x, tmp, frame;
while (cin >> n >> a >> b >> c >> x, n|a|b|c|x) {
vector<int> y;
fram... | 0 | 21,367,285 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 41,027,052 |
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
cout << n * n - m;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define repD(i,a,b) for(auto i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define tr(c,... | 0 | 98,117,730 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,D,X,A;
cin>>N>>D>>X;
int count=0;
while(cin>>A){
int i=0;
while((i*A+1)<=D){count++;i++;}
}
cout<<X+count<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int mean = 0;
rep(i,n) {
mean += x[i];
}... | 0 | 34,274,119 |
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int H,W;
int dx[2] = {1,0};
int dy[2] = {0,1};
v... | 0 | 63,333,046 |
#include <iostream>
using namespace std;
struct TCoordinate
{
double x;
double y;
};
bool IsSameSide(TCoordinate T1, TCoordinate T2, TCoordinate L1, TCoordinate L2)
{
double CrossProductT1 = (L2.x - L1.x) * (T1.y - L1.y) - (L2.y - L1.y) * (T1.x - L1.x);
double CrossProductT2 = (L2.x - L1.x) * (T2.y - L1.y) - (L2.y ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int) (n); (i) ++)
using namespace std;
struct UnionFind {
int n;
vector<int> parent;
vector<int> rank;
vector<int> num;
int find(int x) {
if (parent[x] == x) return x;
return parent... | 0 | 72,918,416 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 22,863,520 |
#include <iostream>
using namespace std;
int main()
{
int atcoder, user;
cin >> atcoder >> user;
if (atcoder % user == 0){
cout << 0 << endl;
}
else {
cout << 1 << endl;
}
return 0;
} | #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<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | 0 | 96,877,009 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000
int main(){
int N;
cin>>N;
vector<int> t,v;
int sum = 0;
for(int i=0;i<N;i++){
int a;
cin>>a;
a*=2;
t.push_back(a);
}
for(int i=0;i<N;i++){
int b;
... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
int read() {
int s = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
wh... | 0 | 97,289,244 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace st... | #include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | 0 | 36,599,811 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 99,055,567 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[2] = {0, 1};
ll dy[2] = {1, 0};
int main(void){
ll n, m;
cin >> n >> m;
l... | #include<iostream>
using namespace std;
int main() {
string str, c;
int q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> c;
if (c == "print") {
int a, b;
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if (c == "reverse"... | 0 | 84,372,226 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | #include <bits/stdc++.h>
using namespace std;
int n, m, h[100005], ans=0;
vector<int> r[100005];
int main() {
cin >> n >> m;
for (int i=1; i<=n; i++) cin >> h[i];
for (int i=0; i<m; i++) {
int a, b; cin >> a >> b;
r[a].push_back(b);
r[b].push_back(a);
}
bool ok=1;
for (in... | 0 | 79,673,765 |
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int
main(int argc, const char *argv[])
{
int n;
cin >> n;
map<string, bool> msb;
while (n--) {
string order, text;
cin >> order >> text;
if (order == "insert") {
msb.insert(pair<string, bool>(te... | 0 | 19,398,095 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s;
cin>>s;
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define ... | 0 | 54,144,766 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n < 1200) {
cout << "ABC";
}else if (n < 2800) {
cout << "ARC";
}else {
cout << "AGC";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i,a,b) for(int i =(a);i<(b);i++)
#define fs first
#define ss second
inline int Scan() {
int x=0;... | 0 | 41,301,884 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n = 0, d = 0, x;
cin>>n;
cin>>d>>x;
int temp = 0, cont = 0;
for(int i = 0; i < n; i++){
cin>>temp;
cont+= ceil((float)d/temp);
}
cout<<cont+x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define F(i,x,n,y) for(i=x;i<n;i+=y)
#define fi(i,x,n) for(i=x;i<n;++i)
#define f(n) for(int i=0;i<n;++i)
#define fr(i,x,n) for(i=x;i>=n;--i)
#define end... | 0 | 67,394,722 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int main() {
ll N;
cin >> N;
map<ll, ll>mp;
vector<ll>D(N);
for (int i = 0; i < N; i++) {
cin >> D[i];
mp[D[i]]++;
}
if (D[0] != 0) {
cout << 0 << endl;
} else {
... | #include<iostream>
#include<string>
using namespace std;
int ans[30] = {};
int main()
{
string x;
int y;
while (cin >> x)
{
for (int i = 0; i < x.length(); i++)
{
if ('a' <= x[i] && x[i] <= 'z')
{
y = x[i] - 'a';
ans[y]++;
}
else if ('A' <= x[i] && x[i] <= 'Z')
{
y = x[i] - 'A';
a... | 0 | 52,138,127 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
using namespace std;
using ll = long long;
using P = pair<int, ll>;
int main()
{
string s;
cin >> s;
int ans = 1000;
for (... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int getFirst10(int n){
int numb = 0;
while(numb < n){
numb += 10;
}
return numb;
}
int main(){
Hello
int a[5], ans = 1e9;
for(int i ... | 0 | 98,014,927 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define FAST {ios_base::sync_with_stdio(false);cin.tie(NULL);}
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
#define rep(n) for(int i=0;i<(n);i++)
#define rrep(n) for(int i=(n)-1;i>=0;i--)
#define mem(a,b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int cnt_digits(ll X){
int cnt=0;
while(X>0){
X/=10;
cnt++;
}
return cnt;
}
int main(){
... | 0 | 53,732,631 |
#include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
bool is_palindrome(const std::string& s)
{
for (int i = 0; i < s.size() / 2; i++)
{
if (s[i] != s[s.size() - 1 - i])
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 0 | 6,834,940 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,k;
cin>>n>>k;
ll v[n];
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int kk = k;
ll maxsum=0;
for(int i=0;i<=min(n,k);i++)
{
int ab=i;
for(int j=0;j<=ab;j++)
{
int pre=j;
int suf=ab-j;
ll sum=0;
multiset<ll>val;
for(int l... | #include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
if (a < b) {
std::cout << "a < b" << std::endl;
}
else if (a == b) {
std::cout << "a == b" << std::endl;
}
else {
std::cout << "a > b" << std::endl;
}
return 0;
} | 0 | 14,744,972 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | 0 | 18,307,190 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, ans = 50000000;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
for(int p = 1; p <= 100; p++){
int temp = 0;
for(int elem : x){
... | #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 << 60;
const int INF = 1e9 + 7;
bool Co... | 0 | 360,000 |
#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>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | 0 | 38,813,364 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 44,724,348 |
#include <iostream>
using namespace std;
int main()
{
int A,B,C;
cin >>A>>B>>C;
A<=100 && A>=-100 ;
B<=100 && B>=-100 ;
C<=100 && C>=-100 ;
if (A==B) cout<<C;
else if (A==C) cout<<B;
else cout<<A;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 87,216,663 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin... | 0 | 93,368,212 |
#include<iostream>
using namespace std;
int main()
{
int n, a;
cin>>n>>a;
int rem;
rem= n%500;
if(rem>a) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = (int)s.size();
if (len < 4) cout << "No" << endl;
else {
string t;
for (int i = 0; i < 4; i++) {
t += s.at(i);
}
if (t == "YAKI") cout << "Yes" << endl;
else c... | 0 | 10,391,488 |
#include<cstdio>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<tuple>
#include<algorithm>
#include<numeric>
#include<limits>
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using namespace std;
... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 50,916,424 |
#pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
ll l, r, ans = 2... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 10,705,025 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
vector<int> factor(int n){
vector<int> res;
for (int i = 2; i*i <= n; ++i) {
while(n % i == 0... | #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... | 0 | 25,346,000 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> cards;
while (true) {
int m;
string now;
cin >> now;
if (now == "-")
break;
cin >> m;
for (int i=0;i<m;i++) {
int h;
cin >> h;
now = now + now.substr(0, h);
... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 33,950,845 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt1=0;
int cnt2=0;
stack<char> st;
for(int i=0;i<n;++i){
if(!st.empty()){
if(st.top()=='(' && s[i]==')')st.pop();
else st.push(s[i]);
}
else st.pus... | #include <cstdio>
#include <vector>
int vis[100005];
std::vector<int> edges[100005];
int dfs(int node,int c=1){
int size=1;
vis[node]=c;
for(int child:edges[node]){
if(!vis[child]) size+=dfs(child,c^3);
if(vis[child]&c) vis[node]=3;
}
return size;
}
int main(){
int N,M;
scanf("%d %d",&N,&M);
for... | 0 | 20,422,583 |
#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;
bool ok = false;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ok = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) ok = true... | #include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int ans = 1, cnt_max = 0;
for (int i = n; i > 0; i--) {
int t = i, cnt = 0;
while (t % 2 == 0) {
t /= 2; cnt++;
}
if (cnt_max < cnt) {
cnt_max = cnt;
ans = i;
}
}
cout << ans << endl;
return 0;
} | 0 | 83,148,905 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using lb = long double;
using P = pair<ll,ll>;
using graph = vector<vector<l... | 0 | 24,165,662 |
#include <iostream>
using namespace std;
static const int INI = -1;
int f[66];
int fib(int n){
if(n == 0 || n == 1) return f[n] = 1;
else if(f[n] != INI) return f[n];
return f[n] = fib(n - 1) + fib(n - 2);
}
int main(){
int n;
for(int i = 0;i <= 66; i++){
f[i] = INI;
}
cin >> n;
cout << fib(n) <<... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
class node
{
public:
vector<int>rank,p;
node(){}
node(int size)
{
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++)
makeset(i);
}
voi... | 0 | 39,240,434 |
# include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0LL)
# define debug(x) cerr<< #x << " : " << x << endl
# define dd... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w;
string s[100];
cin>>h>>w;
for(int i=0;i<h;i++){
cin>>s[i];
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=='#'){
if(i==0 && j==0)
if(s[i+1][j]... | 0 | 4,058,616 |
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<algorithm>
#include<set>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<climits>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> v(n + 1,... | 0 | 20,341,744 |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (... | #include <functional>
#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 = 10000000... | 0 | 64,437,885 |
#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>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#de... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
vector<bool> seen;
int c = 0;
int N;
ll ans = 0;
void dfs(Graph &G, int v){
seen[v] = true;
c++;
if(c==N){
ans++;
return;
}
for (auto next_v:G[v])
{
... | 0 | 100,728,451 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
int a[5];
int main(void){
rep(i, 5) cin >> a[i];
sort(a, a+5, greater<int>());
rep(i, 4) cout << a[i] << " ";
cout << a[4] << endl;
} | #include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<functional>
#include <random>
#include<iostream>
#include<iomanip>
using namespace std;
int N;
pair<int, int> A[100000];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i].fir... | 0 | 81,314,311 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase=1;
for(int p=0;p<testcase;p++){
ll h=0,w=0;
cin>>h>>w;
if(h==1 || w==1)
cout<<"1";
else if(h*w%2==0)
cout<<h*w/2;
else
... | #include <iostream>
using namespace std;
int main() {
char a[21] = {0};
cin.getline(a, 21);
for (int i = 0; i < 21; i++) {
if (a[20 - i] == '\0')
continue;
cout << a[20 - i];
}
cout << endl;
return 0;
} | 0 | 82,959,505 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main(){
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(l, k + 1){
rep(r, k - l + 1){
if(l + r > n... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp make_pair
#define pb push_back
#define endl "\n"
#define rep(i,a,n) for(int i=a;i<n;i++)
const int mod = 1e9 + 7;
void solve() {
string s;
cin >> s;
int m = 0;
rep(i, 0, 3) {
int c = 0;
while (s[i] == 'R') {
c++;
i++;
}... | 0 | 4,303,695 |
#include<stdio.h>
int main(){
long long n;
scanf("%lld",&n);
long long h[n+10];
long long tmp=0,ans=0;
for(long long i=0;i<n;i++){
scanf(" %lld",&h[i]);
if(i>0&&h[i-1]>=h[i])tmp++;
else{
if(ans<tmp)ans=tmp;
tmp=0;
}
}
if(ans<tmp)ans=tmp;
printf("%lld\n",ans);
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int64_t i = 0; i < (int64_t)(n); i++)
#define mod(a) a % 1000000007;
int64_t myadd(int64_t a, int64_t b) {
int64_t a_ = mod(a);
int64_t b_ = mod(b);
return mod( a_ + b_ );
}
int64_t myprod(int64_t a, int64_t b) {
int64_t a_ = mod(a);
int64_t b... | 0 | 89,067,334 |
#include<bits/stdc++.h>
using namespace std;
vector< int > z_algorithm(const string &s) {
vector< int > prefix(s.size());
for(int i = 1, j = 0; i < s.size(); i++) {
if(i + prefix[i - j] < j + prefix[j]) {
prefix[i] = prefix[i - j];
} else {
int k = max(0, j + prefix[j] - i);
while(i + k < ... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
const double EPS = 1e-8;
typedef complex<double> Point;
typedef vector<Point> Polygon;
inline int sign(double x){
return (x > EPS ? 1 : x < -EPS ? -1 : 0);
}
inline Point curr(const Polygon& a, int x){
return a[x];
}
in... | 0 | 91,566,926 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
#define int long long
signed main(){
int n,l;cin>>n>>l;
vector<int> v(n);
for(int i=0;i<n;i++)cin>>v[i];
int a=-1;
for(int i=1;i<n;i++)if(v[i]+v[i-1]>=l)a=i;
if(a<0)fin("Impossible");
cout<<"Pos... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
ll mmod[100010][31];
int main(){
ll n, m;
cin >> n >> m... | 0 | 74,687,005 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(2);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";new... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
bool is_int(vector<int> a, vector<int> b, int d) {
vector<int> temp(d);
in... | 0 | 64,792,110 |
#include <iostream>
using namespace std;
int main()
{
char a;
int s=0;
while((a=getchar())!='\n')
{
s+=(a-'0');
}
if(s%9==0)
{
cout << "Yes" ;
}
else if(s%9!=0)
{
cout << "No";
}
cout << endl;
return 0;
} | #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>;
static const int N = 100;
int main() {
int n, p[N+1], m[N+1][N+1];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i-1] >> p[i];
}
for (int i = 1; i <= n;... | 0 | 15,729,047 |
#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... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define so(v) sort(v.begin(), v.end())
#define fi first
#define se second
using namespace std;
int main()
{
string s;
cin>>s;
stack <char> x;
vector<char> v ;
for... | 0 | 89,917,492 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int M=1010;
char a[M],b[M];
int n,m,ans=M+10;
int main()
{
scanf("%s",a+1);n=strlen(a+1);
scanf("%s",b+1);m=strlen(b+1);
for(int i=1;i+m-1<=n;i++)
{
int sum=0;
for(int j=1;j<=m;j++)
if(a[i+j-1]!=b[j])
sum... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((... | 0 | 99,712,671 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
vector<int> array(3);
array[0] = A;
array[1] = B;
array[2] = C;
sort(array.begin(), array.end());
int t = 0;
t = array[2] * 10 + array[1];
cout << t + array[0] << endl;
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
const ll INF = LONG_LONG_MAX / 100;
const ll MINF = LONG_LONG_MIN;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#de... | 0 | 88,036,025 |
#include <bits/stdc++.h>
using namespace std;
int n,k,p[5005];
long long d[5005],c[5005];
void nhap()
{
scanf("%d %d",&n,&k);
for (int i=1;i<=n;++i)
{
scanf("%d",&p[i]);
}
for (int i=1;i<=n;++i)
{
scanf("%lld",&c[i]);
}
}
void process()
{
long long kq=-1e18;
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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; }
int main(void... | 0 | 90,565,562 |
#include<bits/stdc++.h>
#include<algorithm>
#include <queue>
#include<vector>
#include<list>
#include <cstdlib>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 1e4+10;
vector<int> g[MAXN];
list<int> l;
int in[MAXN],vis[MAXN];
void bfs(int s)
{
queue<int> que;
que.push(s);
vis[s] = ... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | 0 | 40,012,830 |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
const int MOD = 998244353;
const int LIMIT_SQ = 1000 * 1000 * 1000;
const LL LIMIT = (LL) LIMIT_SQ * LIMIT_SQ;
void solve_test() {
int n;
cin >> n;
vector<LL> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
bool has_zero = false;
for (int i = 0; i... | #include <iostream>
#include <climits>
#include <cmath>
#include <vector>
#include <string>
uint64_t getDigit(uint64_t val)
{
return std::to_string(val).length();
}
uint64_t F(uint64_t A, uint64_t B)
{
uint64_t a = getDigit(A);
uint64_t b = getDigit(B);
return a > b ? a : b;
}
int main()
{
uint64_t N;
uint64_t an... | 0 | 17,117,629 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,tmp = 0,ans = 0;
map<int,int> mp;
cin >> N;
vector<int> a(N);
for(int i = -1;i <= 100001;i++)
mp[i] = 0;
rep(i, N){
cin >> tmp;
mp[tm... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
x -= i + 1;
a[i] = x;
}
sort(a.begin(), a.end());
ll b = a[(n % 2 == 1 ? (n - 1) / 2 : n / 2 - 1)];... | 0 | 54,839,723 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
re... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 17,772,400 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[100001];
ll frog(vector<int> height,int n){
dp[0]=0;
dp[1]=abs(height[1]-height[0]);
for(int i=2;i<n;i++){
dp[i]=min(dp[i-2]+abs(height[i-2]-height[i]),dp[i-1]+abs(height[i-1]-height[i]));
}
return dp[n-1];
}
int main(){
#ifndef ONLINE... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define FF(i,a,b) for(int i=a;i<b;i++)
#define BF(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<int>
#define MAP map<int,int>
#define pb push_back
#define MP ... | 0 | 50,454,093 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s; cin >> s;
string s1 = s.substr( 0, 4 );
string s2 = s.substr( 4 );
cout << s1 << " " << s2 << endl;
return ( 0 );
} | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +... | 0 | 5,602,246 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N , K , Mini = 0;
cin >> N >> K;
int F[N] ;
for(int i =0 ; i < N ; ++i )
{
cin >> F[i] ;
}
sort( F , F + N ) ;
for(int i = 0 ; i < K ; ++i)
{
Mini += F[i] ;
}
cout << Mini ;
return 0;
} | #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()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int N, K;
int sum(vector<int> &V, int i, int j, int count){
vector<int> T... | 0 | 58,327,146 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ull> vull;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
#define FOR(i, a, b) for (int i = a... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 33,690,615 |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
const int INF=1<<2... | #include <iostream>
#define MAX 120
using namespace std;
int main() {
int n, u, k, v;
int graph[MAX][MAX];
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
graph[i][j] = 0;
}
}
for (int i = 0; i < n; ++i) {
cin >> u >> k;
for (int ... | 0 | 18,186,078 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int h, w;
cin >> h >> w;
rep(i, h) {
string w;
cin >> w;
cout... | #include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | 0 | 60,751,356 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
typedef tuple<ll, int, int, int> t;
int main() {
auto compare = [](t a,t b) {
return get<0>(a)<get<0>(b);
};
priority_queue<t, vector<t>, decltype(compare)> q(compare);
int x, y, z, K, e, ... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B;cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else{
if(A!=1&&B!=1){
if(A<B){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
else if(A==1&&B!=1){
... | 0 | 84,877,920 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
long long Comb(int n, int i){long long ans = 1; if(i>n || i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> red(N);
for (int i = 0; i < N; i++) {
cin >> red.at(i);
}
int M;
cin >> M;
vector<string> blue(M);
for (int i = 0; i < M; i++) {
cin >> blue.at(i);
}
int max = 0;
int res = 0;
string word;
for ... | 0 | 90,054,296 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;cin>>N>>M>>X>>Y;
vector<int> x(N),y(M);
for(int i=0;i<N;i++) cin>>x.at(i);
for(int i=0;i<M;i++) cin>>y.at(i);
sort(x.begin(),x.end());
sort(y.begin(),y.end());
int maxx=x.at(N-1);
int miny=y.at(0);
bool conflict=true;
for(int i=X+1... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mo... | 0 | 100,576,126 |
#include <stdio.h>
int main(){
long long int n;
scanf("%lld",&n);
long long int num[n]={};
long long int res=1;
long long int temp;
for (int i=0;i<n;i++){
scanf("%lld",&num[i]);
}
for(int i=0;i<n;i++){
if (num[i]==0){
printf("0\n");
return 0;
}
}
for (int i=0;i<n;i++){
if(num[i]<=10000000000000... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> par,rank;
UnionFind(int n){
par.resize(n);
rank.resize(n);
for(int i=0; i<n; i++){
par[i]=i;
rank[i]=0;
}
}
void unite(int x,int y)
{
x = root(x);y = root(y);
... | 0 | 71,710,663 |
#include <iostream>
using namespace std;
long long int factorial(long long int n)
{
if(n > 0)
return n * factorial(n - 1);
else
return 1;
}
int main()
{
long long int n;
cin >> n;
cout << factorial(n) << endl;
} | #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<int>>;
#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 ... | 0 | 21,786,872 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << 6 - a - b;
return 0;
} | #include<iostream>
int main()
{
int A, B;
scanf( "%d%d", &A, &B);
if((A*2<=B)&&(B<=A*4)&&(B%2==0))
printf("Yes");
else
printf("No");
} | 0 | 83,394,028 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long LINF = 1LL << 60;
const long long LMINF = 1LL << 63;
const int INF = 1 << 30;
#define REP(i,n) for(int i = 0;i < n;++i)
#define REPS(i,x) for(int i = 1;i <= (int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i >= 0;i--)
#define RREP... | 0 | 93,668,660 |
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define sz(x) int(x.size())
#define fill(x,v) memset(x,v,sizeof(x))
#define REP(i,a,b) for(int i = int(a); i < int(b); ++i)
#define trace(x) cout << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 46,816,569 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
long long k;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 800;
int c[maxn], s[maxn], f[maxn];
int main() {
int n;
cin >> n;
for(int i= 0; i < n - 1; ++i) cin >> c[i] >> s[i] >> f[i];
for(int i = 0; i < n - 1; ++i){
long long now = s[i] + c[i];
for(int j = i + 1; j < n - 1; ++j){
long long need = max( (l... | 0 | 96,462,946 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, a, b;
cin >> k >> a >> b;
if(a%k == 0 || a-a%k + k <= b){
cout << "OK" << endl;
}else{
cout << "NG" << endl;
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main() {
string str;
vector<string> v;
vector<string>::iterator it_old;
int l_max = 0;
int c_max = 0;
string l_str;
string c_str;
int count = 0;
while (cin >> str) v.push_back(str);
sort(v.begin(), ... | 0 | 27,033,927 |
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define all(V) V.begin(), V.end()
vector<int> rea(100000, 0);
int main() {
int K, a, b, c;
cin >> K;
rea[1] = 1;
queue<int> Q;
Q.push(1);
while (!Q.empty()) {
a = Q.front();
Q.pop();
b = (a * 10) % K;
if (r... | #include<stdio.h>
char num1[10000000]={0},num11[10000000]={0},num2[10000000]={0},b[10000000]={0};
int main(void)
{
int n1=0,n2=0;
int i,j,k;
while(scanf("%d",&n1)!=EOF)
{
if(n1==0)break;
getchar();
for(i=0;i<n1;i++)
{
scanf("%[^\n]",b);
num1[i]=b[0... | 0 | 65,657,495 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rr... | #include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
ll M = 998244353;
ll modpow(ll a, ll n, ll mod) {
... | 0 | 78,699,340 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i =0; (int)i<n; i++)
using namespace std;
int N,M; bool ab[10][10],seen[10];
int dfs(int v, int N, bool seen[10]) {
bool allVisited = true;
rep(i,N) {
if (seen[i] == false) allVisited = false;
}
if (allVisited) return 1;
int ret =0;
rep(i,N) {
if (... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h , w;
cin >> h >> w;
int i, j;
vector<vector<char>> a(h, vector<char>(w));
for(i = 0;i < h;i++){
for(j = 0;j < w;j++){
cin >> a.at(i).at(j);
}
}
for(i = 0;i < a.size();i++){
for(j = 0;j < w;j++)... | 0 | 44,891,696 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define intpow(a, n) (int)pow((long double) a, (long double) n)
#... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 0 | 50,209,394 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
c... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
#define rep(i,n) for(ll i=0;i<(n;i++)
typedef long long ll;
using namespace std;
int main(void){
int A,B,C,K;
cin >> A >> B >> C >> K;
while(B<=A){
... | 0 | 36,174,692 |
#include <bits/stdc++.h>
using namespace std;
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define rep1(i,n)for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=(int)(n)-1;0<=i;i--)
#define rrep1(i,n) for(int i=(int)(n);1<=i;i--)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it... | 0 | 95,539,392 |
#include <iostream>
using namespace std;
int a[100001] = {0}, b[100001] = {0};
int main () {
int n, m, temp;
cin >> n >> m;
for (int i = 1; i <= m; i++) {cin >> temp; b[temp]++;}
a[1] = b[1] == 0 ? 1 : 0;
a[2] = b[2] == 0 ? (b[1] == 0 ? 2 : 1) : 0;
for (int i = 3; i <= n; i++) if (!b[i]) a[i] = ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for(int i=(start); i<(int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<long long> vecll;
typedef vecto... | 0 | 76,030,144 |
#include <iostream>
#include "atcoder/dsu.hpp"
using namespace std;
int main()
{
int N, Q;
int t, u, v;
cin >> N >> Q;
atcoder::dsu d(N);
for (int i = 0; i < Q; i++)
{
cin >> t >> u >> v;
if (t == 0)
{
d.merge(u, v);
}
else if (t == 1)
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 83,292,657 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int>L(N);
vector<int>R(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L.at(i);
cin >> R.at(i);
sum += R[i] - L[i] + 1;
}
cout << sum << endl;
} | #include <iostream>
#include <stdlib.h>
using namespace std;
int main(){
char* s = (char*)calloc(11,sizeof(char));
cin >> s;
char* t = (char*)calloc(12,sizeof(char));
cin >> t;
bool ans = true;
while(*s != 0){
if(*t != *s) ans = false;
t++;
s++;
}
if(ans) cout << "Yes";
else cout << "No";
cout << endl;
... | 0 | 81,300,881 |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
vector<pair<int, int> > ans(m);
if(n % 2 == 1){
int j = 2;
for(int i = 0; i < m; i++){
ans[i].first = j;
ans[... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 0 | 83,151,252 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q; cin >> q;
for (int i = 0; i < q; i ++) {
long long a, b; cin >> a >> b;
long long root = sqrt(a*b);
long long ans = root + (a*b-1)/root-1;
if ((a*b-1)/root >= a) ans --;
if ((a*b-1)/root >= b) ans --;
cout << ans << endl;
}
} | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 0 | 30,890,502 |
#include <iostream>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
long long arr[100001] = {};
for (int i = 0 ; i < n ; i++){
int num , qty;
cin >> num >> qty;
arr[num] += qty;
}
long long count = 0;
for (int i = 1 ; i < 100001 ; i++ ){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int gcd(int a, int b){
if(a<b)
swap(a,b);
while(a%b){
a %= b;
swap(a,b);
}
return b;
}
int main(){
int n,k;
cin >> n >> k;
v a(n);
bool ... | 0 | 11,199,197 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endi... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 14,569,715 |
#include<iostream>
using namespace std;
int main( )
{
char str[1201];
int i;
cin.getline( str, sizeof( str ) );
for( i=0; '\0'!=str[i]; i++ ) {
if( 'A'<=str[i] && str[i]<='Z' ) {
str[i] += 32;
} else if( 'a'<=str[i] && str[i]<='z' ) {
str[i] -= 32;
}
}
str[i]='\0';
cout<<str<<endl;
return 0;
} | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 74,915,665 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
int gcd(in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,s,e) for(int i=s;i<=e;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MAX (int)1e9 + 99
#define maxof(a,b,c) max(a,max(b,c))
#define min... | 0 | 83,374,696 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | 0 | 66,649,685 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int mod=1000000007;
const int INF=1001001001;... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
float distance(vector<int> a, vector<int> b, int d) {
float res = 0.0;
for (size_t i=0; i<d; i++) {
res += (a[i] - b[i]) * (a[i] - b[i]);
}
return sqrt(res);
}
int main() {
int n, d;
cin >> n >> d;
vector<ve... | 0 | 22,011,947 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int r;
cin >> r;
cout << r * r << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define vit vector<int>::iterator
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fr first
#define sc second
#define skip continue
#define PI 3.14159265
typedef u... | 0 | 69,980,888 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define in(v) if (scanf("%d", &v)<1);
#define in_s(v) if (scanf("%s", v)<1);
#define out(v) printf("%d\n", v)
const int S = 1, W = 2, EMPTY = -1;
int main() {
int N; in(N);
char s[N]; in_s(s);
int v[N];
rep(first, 2) rep(second, 2)... | #include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | 0 | 35,046,826 |
#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 <stdio.h>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep2(i, x, n) for(i... | 0 | 98,737,867 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include <map>
#include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <string>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
template<class T... | 0 | 78,568,866 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
string abc = "abc";
if (s == abc) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
#define fori(a, b, step) for (int i = a; i < b; i += step)
#define forj(a, b, step) for (int j = a; j < b; j += step)
#define int long long
const int maxn = 5e5 + 1, mod = 1e9 + 7;
... | 0 | 7,687,999 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
struct Gauss {
int LOGN, sz;
vector<T> basis;
Gauss(int LOGN): LOGN(LOGN), sz(0), basis(LOGN) {}
void insert(T mask) {
for (int i = LOGN - 1; i >= 0; i--) {
if (mask & (1LL << i)) {
if (!basis[i]) {
... | 0 | 90,590,643 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b)
{
if (a % b == 0 || b % a == 0) return min(a, b);
if (a < b) swap(a, b);
if (a == 1 || b == 1) return 1;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b)
{
return a / gcd(a, b) * b;
}
int main()... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 25,233,729 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.