code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
for(int i = 1; ; i++) {
int x, y;
cin >> x >> y;
if(x == 0 && y == 0) break;
cout << min(x, y) << " " << max(x, y) << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int x, y, z, k;
ci... | 0 | 89,230,221 |
#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 main(){
int n,m;
cin>>n>>m;
priority_queue<int> pq;
rep(i,n){
int a;
cin>>a;
pq... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e17;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | 0 | 42,664,755 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
puts("0");
} else {
puts("10");
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 21,507,752 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define ... | #include<iostream>
#include<string>
using namespace std;
void print( int a, int b, string& s )
{
for( int i = a; i <= b; i++ )
cout << s[i];
cout << endl;
}
void reverse( int a, int b, string& s )
{
for( int i = a, j = b, k = 0; k < (b - a + 1) / 2; i++, j--, k++ )
{
char temp;
t... | 0 | 22,103,982 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string j="NG";
int k,a,b;
cin>>k>>a>>b;
for(int c=0; c<=1000; c++){
if(a<=k*c&&k*c<=b){
j="OK";
}
}
cout<<j<<endl;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
int N, M;
cin >> N >> M;
vector<string> A, B;
A.resize(N);
B.resize(M);
for(int i = 0; i < N; i++)
{
cin >> A[i];
}
for(int i = 0; i < M; i++)
{
... | 0 | 80,207,859 |
#include <bits/stdc++.h>
using namespace std;
int f(int n){
if(n < 10) return n;
return f(n/10) + n%10;
}
int main(void){
int N;
cin >> N;
if(N % f(N) == 0) cout << "Yes" << endl;
else cout << "No" <<endl;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <... | 0 | 75,434,951 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int>data(60);
for(int i=0;i<N;i++){
cin>>data.at(i);
}
sort(data.begin(),data.end());
reverse(data.begin(),data.end());
int count;
for(int i=0;i<K;i++){
count =count+data.at(i);
}
cout<<count<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
vector<long long>a(n),b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
vector<long long>tasu,hiku;
for(int i=0;i<n;i++){
long long sa;
sa=a[i]-b[i];
if(sa>0)tasu.push_back(sa);
else if(sa<0)hiku.... | 0 | 89,464,599 |
#include <iostream>
#include <vector>
using namespace std;
using int64 = long long;
int main() {
int n,k;
cin >> n >> k;
vector<int64> x(n);
vector<int64> y(n);
for (int i=0; i<n; i++) cin >> x[i] >> y[i];
vector<int64> xv = x;
vector<int64> yv = y;
sort(xv.begin(), xv.end());
sort(y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 0 | 69,025,522 |
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <utility>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <cstdio>
#include <map>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#d... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | 0 | 30,748,269 |
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < ((int)n); ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static... | 0 | 70,046,865 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int SIZE = 1000000000;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1) {
A -= 1;
}
B += A/2;
... | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | 0 | 40,128,813 |
#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 int long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) ... | 0 | 49,369,494 |
#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 rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b... | 0 | 22,042,657 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 0 | 13,816,537 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
vector<int> vs(n);
rep(i,n) cin >> vs[i];
ll ans =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 26,722,762 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
string S, T;
cin >> S >> T;
vi cs(S.size());
vi ct(T.size());
rep(i, S.size()) {
cs[i] = S[i] - 'a';
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 93,211,518 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
long n;
cin >> n;
vector<long> h(n);
int m = 0;
int c = 0;
cin >> h[0];
rep(i, n - 1) {
cin >> h[i + 1];
if(h[i + 1] > h[i])
m = max(m, ... | #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 | 62,640,772 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N),B(N);
int64_t sumA=0;
int64_t sumB=0;
for(int i=0;i<N;i++){
cin >> A.at(i);
sumA+=A.at(i);
}
for(int i=0;i<N;i++){
cin >> B.at(i);
sumB+=B.at(i);
}
if(sumA<sumB){
cout << -1 << endl;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod;
ll powimod(ll x,ll n,ll mod){
ll res=1;
while(n){
if(n&1) res=(res*x)%mod;
x=(x*x)%mod;
n>>=1;
}
return res;
}
ll powi(ll x,ll n){
ll res=1;
while(n){
if(n&1) res*=x;
x*=x;
... | 0 | 33,429,253 |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(a,b) memset(a,b,sizeof(a))
#define msn(a,n,b) for(int i=0;i<=n;i++)a[i]=b
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define fi first
#define se second
using namespace st... | #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()
const int MAX_N = 1000010;
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = ... | 0 | 67,463,392 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dh[8] = {... | #include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>
using namesp... | 0 | 16,210,938 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> as(n);
for(Int i=0;i<n;i++) cin>>as[i];
Int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string s;
cin >> s;
string t = "";
for (int i = 0; i < 2; i++){
for (int j = 0; j < 2; j++){
string tmp;
if (i == 0){
tmp += 'S';
} else {
tmp += 'W';
}
if (j == 0){
tmp += 'S... | 0 | 51,801,724 |
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <algorithm>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main(){
long long out;
int n;
while(cin >> n){
out = 1;
for(int i = 0; ... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define double long double
typedef long long ll;
typedef pair<int,int> pii;
typedef ... | 0 | 77,936,096 |
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
long long int ans=0,a,b;
scanf("%d",&n);
for(int i=1;i<n;i++){
for(int j=1;j<n;j++){
if(i*j>=n) break;
ans++;
}
}
printf("%lld\n",ans);
}
int main(){
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define int lli
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<lli> vli;
typedef vector<pii> vii;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0... | 0 | 93,334,258 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class... | #include<bits/stdc++.h>
std::vector<int> A;
int inf = 1001001001;
int parent(int key){
int parent = key / 2;
return parent;
}
int heapIncreaseKey(int i, int key){
if(key < A[i]){
return 0;
}
A[i] = key;
int pa = parent(i);
while(i > 1 && A[pa] < A[i]){
std::swap(A[i], A[pa]);... | 0 | 41,601,934 |
#include <iostream>
using namespace std;
int main() {
int h,w;
for(;;){
cin >> h >> w;
if(h>0 && w>0){
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cout << "#";
if(j+1==w){
cout << endl;
}
}
if(i+1==h){
cout << endl;
}
}
}else if(h==0 && w==0){
break;
}
}... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int h,n;
cin >> h >> n;
vector<int> dp(h+1,1e8);
dp[0]=0;
for (int i=0; i<n;++i) {
int a,b;
cin >> a >> b;
for (int idx=0; idx<h+1; idx++) {
if (dp[idx]!=1e8) {
dp[min(idx+a,h)]=min(dp[id... | 0 | 57,168,842 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=6e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | #define _GLIBCXX_DEBUG
#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()
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<vi> g(n, vi(n));
rep(i, m)
... | 0 | 94,278,728 |
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
#include<stack>
#include<set>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using pll = pair<ll,ll> ;
ll INF = 1e15 ;
void chmin(ll &a,ll b){if(a>b) a = b ;}
void chmax(ll &a,ll b){if(a<b) a = b ... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | 0 | 79,426,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin>>N;
long ans=0;
for(int i=1;i<sqrt(N);i++){
long M=N-i;
if(M%i==0&&i<M/i) ans+=M/i;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
template<typename T>
struct CumulativeSum {
vector<T> s;
CumulativeSum(const vector<T> &nums) {
int n = nums.size();
s.resize(n + 1, 0);
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
}
T sum(int l, int ... | 0 | 8,371,643 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #define _USE_MATH_DEFINES
#include <math.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace s... | 0 | 138,841 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef vector<vector<int> > vvi;
typedef map<int, bool> mib;
typedef long long ll;
typed... | 0 | 20,069,768 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B;
cin>>A>>B;
cout<<A*B-(A+B)+1<<endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long lon... | 0 | 100,732,623 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
int l=0,r=100000;
rep(i,m){
int nowl, nowr;
cin >> nowl >> nowr;
l = max(l,nowl);
r = min(r,nowr);
}
cout << max(0,r-l+1);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 0 | 59,277,923 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | 0 | 17,254,157 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b;
c=a/b;
printf("%.9f\n",c);
} | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int k; c... | 0 | 51,233,477 |
#include <iostream>
#include <bitset>
using namespace std;
int main(){
int N, K;
long ans = 0;
int A[100000];
int B[100000];
cin >> N >> K;
for(int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
for(int i = 0; i < N; i++){
if((K|A[i]) <= K) ans += B[i];
}
int n = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, x[100], y[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (atan2(y[i], x[i]) > atan2(y[j], x[j]))
{
swap(x[i], x[j]);
swap(y[i], y... | 0 | 13,902,281 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 86,593,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int n;
scanf("%d",&n);
printf("%d\n",(n-1)/2);
}
int main(){
solve();
return 0;
} | #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 ... | 0 | 73,942,690 |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf =... | 0 | 98,011,272 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | #include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<string>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorith... | 0 | 51,698,705 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <string>
#include <unordered_map>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007ll;
const ll hmax=1000000000;
const l... | 0 | 55,035,543 |
#include <iostream>
using namespace std;
int main(void){
int n, x, i, j, k, count = 0;
for(;;){
cin >> n >> x;
if(n == 0 && x == 0) break;
for(i = 1; i <= n; i++){
for(j = i + 1; j <= n; j++){
for(k = j + 1; k <= n; k++){
if(i + j + k == x)... | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 0 | 30,217,256 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, h;
cin >> n >> h;
vector<int> v(n);
int maxa = 0;
for (auto& i : v) {
int a;
cin >> a >> i;
maxa = max(maxa, a);
}
sort(v.rbegin(),v.rend());
int ret = 0;
for (auto& i : v) {
if (i <= maxa) {
break;
... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(long long i=(l);i<(r);i++)
#define dec(i, l, r) for(long long i=(r)-1;i>=(l)... | 0 | 41,949,140 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main(){
int n, m,X,Y;
cin >> n >> m>>X>>Y;
vector<int> x(n);
vector<int> y(m);
rep(i,n) cin >> x[i];
rep(i,m) cin >> y[i];
sort(x.begin(),x.end());
sort(y.begin... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n,m;cin>>n>>m;
char a[n][m];
for(int i = 0;i<n;i++){
string b;cin>>b;
for(int j = 0;j<m;j++) {
a[i][j] = b[j];
}
}
for(int i = 0;i<n;i++){
... | 0 | 18,175,327 |
#include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(ll i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# de... | 0 | 57,262,062 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <iostream>
using namespace std;
int main(){
int N,n;
int sum = 0;
cin >> N;
n = N;
while(n>10){ sum += n%10;
n = n/10;
}
sum += n;
if(N%sum == 0) cout << "Yes" << "\n";
else cout << "No" << "\n";
return 0;
} | 0 | 72,082,528 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n,k,s;
cin>>n>>k>>s;
vector<int>v(n,1);
for(int i=0;i<n;i++) {
if(i<k) v[i]=s;
else {
s==1e9?v... | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
#define P pair<int, int>
int main () {
int H, W, D; cin >> H >> W >> D;
vector<vector<int>>... | 0 | 7,412,178 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N; cin >> N;
ll ans = 0;
for (int i = 1; i < 1e6+1; i++){
ll n = N - i;
if(n%i == 0){
ll x = n / i;
if(x > i){
... | #include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | 0 | 61,117,916 |
#include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define ii pair<int,int>
#define qu queue <int>
#define qmax priority_queue <int>
#define qmin priority_queue <int, vector<int>,greater<int>>
using namespace std;
int main(){
ios_base::sy... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int N,K;cin>>N>>K;
vector<int> L;
for (int i = 0;i < N; i++) {
int l;cin>>l;
L.push_back(l);
}
sort(L.begin(), L.end());
int result = 0;
for (int i = N - 1; i >= N - K; i--) {
... | 0 | 56,664,014 |
#include<iostream>
#include<string>
#include <numeric>
#include <algorithm>
#include<queue>
#include<vector>
using namespace std;
typedef pair<int, int> P;
long long X, Y, cnt=1;
int main(){
cin >> X >> Y;
while(X<=Y){
X = X*2;
cnt++;
}
cout << cnt-1 << endl;
return 0;
} | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main(){
int n,m;
while(cin >> n,n){
map<string,string>mm;
map<string,int>mm2;
string ans;
for(int i=0; i<n; i++){
string in,in2;
cin >> in >> in2;
mm[in] = in2;
mm2[in] = 1;
}
cin >> m;
for(in... | 0 | 76,629,165 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
int main() {
int x,y; cin>>x>>y;
rep(i,x+1) rep(j,x+1) {
... | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
res = res*a%mod;
n -= 1;
}
return res;
}
int main(){
int N;
cin >> N;
int D[N];
long long mod = 99... | 0 | 87,353,562 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (a % b == 0) return b;
return gcd(a % b, b);
}
l... | #include <iostream>
#include <cmath>
#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>
#inclu... | 0 | 15,555,143 |
#include<iostream>
const static int INF = 1001001001;
int main(void){
int n, p, min, ans = 0;
min = INF;
std::cin >> n;
for(int i = 0; i < n; i++){
std::cin >> p;
if(min >= p){
min = p;
ans++;
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 88,728,442 |
#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
bool isPrime(int n){
if(n < 2){
return 0;
}
if(n%2 == 0){
return n==2;
}
for(int i=3;i*i<=n;i++){
if(n%i == 0) return 0;
}
return 1;
}
void allPoss(int indx,int ... | #include <bits/stdc++.h>
#include <vector>
#include <numeric>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for(int i=0;i<int(n);++i)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define ALL(v) v.begin(),v.end()
... | 0 | 99,121,006 |
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<map>
#include<set>
#include<vector>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<numeric>
#include<string>
#include<tuple>
using namespace std;
#define BEGIN ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define per(i,n) for(int i=(n)-1; i>=0; i--)
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
const int MOD = 1000000007;
int main(){
ll s; cin>... | 0 | 13,753,203 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<ll>front(n),back(n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i<j && a[i]>a[j]) back[i]++;
else if(i>j && a[i]>a[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | 0 | 19,048,892 |
#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 a, b;
cin >> a >> b;
map<string, int> mp;
int x, y;
cin >> x >> y;
mp[a] += x;
mp[b] += y;
string c;
cin >> c;
mp[c]--;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
cin >> S;
vector<int>A(S.size()+1);
vector<int>B(S.size()+1);
for(int i = 0; i < S.size(); i++) {
if(S... | 0 | 71,958,841 |
#include <bits/stdc++.h>
using namespace std;
const int N = 18;
using ii = pair<int, int>;
#define x first
#define y second
namespace my {
ii merge(ii a, ii b) {
a.y = max(a.y, b.x);
if(a.y > a.x) swap(a.x, a.y);
a.y = max(a.y, b.y);
if(a.y > a.x) swap(a.x, a.y);
return a;
}
}
int n;
ii f[2][1 << N];
int ma... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
int ... | 0 | 34,243,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int inNumN = 0;
int inNumA = 0;
cin >> inNumN >> inNumA;
cout << inNumN * inNumN - inNumA << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 0 | 41,540,772 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL -1
#define MAX 100001
struct Node {
int parent, left, right;
};
vector<Node> t(MAX, {NIL, NIL, NIL});
vector<int> d(MAX);
void set_depth(int u, int p) {
d[u] = p;
if (t[u].right != NIL) {
set_dept... | #include <iostream>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define MAX 10000
using namespace std;
int ans,cou;
int n;
char s[10],g[10];
struct t {
int h;
int m;
int s;
};
t start[MAX],goal[MAX];
int main() {
while(true){
cin >> n;
if(n==0) return 0;
ans = 0;
cou = 0;... | 0 | 42,932,322 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k, n;
string s;
cin>>k>>s;
n = s.size();
if(n>k)
{
for(int i=0;i<k;i++)
{
cout<<s[i];
}
cout<<"...";
}
else
{
cout<<s;
}
cout<<endl;
return 0;
} | #include <string>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <unordered_map>
#include <iostream>
using namespace std;
vector<string>split(string s, char delim){
int len = s.length();
string currStr = "";
vector<string>retVec;
for(int i = 0;i<len;i++){
char ch = s[i];
if(ch==delim)... | 0 | 98,441,604 |
#include <bits/stdc++.h>
#define si(v) v.size()
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (n); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
using ll = long long;
using ld = long double;
using namespace std;
signed main()
{
co... | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
int len = 0;
std::vector<int> a(n), lis(n, -1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
if (i == 0) {
lis[len] = a[i];
len++;
continue;
}
if (lis[len - 1] < a[i]) {... | 0 | 87,284,713 |
#include <stdio.h>
void printSquareF(unsigned int High, unsigned int Wide);
int main(int argc, const char * argv[]) {
unsigned int w = 1, h = 1;
while (!(h == 0 && w == 0)) {
scanf("%d %d", &h, &w);
if(!(h == 0 && w == 0)){
printSquareF(h, w);
}
}
return 0;
}
void pri... | #include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
const int MAXN=100005;
int n,m;
int co[MAXN];
bool vis[MAXN];
vector<int> E[MAXN];
bool dfs(int u){
bool tag=1;
vis[u]=1;
for(int i=0;i<(int)E[u].size(... | 0 | 95,242,380 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef long long li;
#define MOD 1000000007
#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
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(c... | 0 | 3,959,685 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
v.at(i + 1) = (v.at(i) + v.at(i + 1)) / 2;
}
cout << v.at(n - 1) << endl;
return 0;
} | #pragma GCC optimize(3)
#define ADD_STACK int size = 512 << 20;\
char *pp = (char*)malloc(size) + size; \
__asm__("movl %0, %%esp\n" :: "r"(pp))
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<fstream>
#include<queue>
#include<map>
#include<stack>
... | 0 | 6,529,590 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int m = 0, ans = 0;
for(int i = 0;i < n;i++){
cin >> a[i];
m = max(m,a[i]);
}
bool b = false;
for(int i = 1;i <= m;i++){
for(int j = 0;j < n;j++){
if(!b && a[j] >= i) b = true;
if(b && a[j] < i){... | #include<stdio.h>
#include<string.h>
int Hash[244140625];
char s[13];
int getChar(char ch){
if(ch=='A'){
return 1;
}else if(ch=='C'){
return 2;
}else if(ch=='G'){
return 3;
}
return 4;
}
int getKey(){
int sum=0,p=1;
for(int i=0;i<strlen(s);i++){
sum+=p*(getChar(s[i]));
p*=5;
}
retu... | 0 | 30,423,399 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int N,M,X,Y;
cin >> N>>M>>X>>Y;
vector<int> a(N);
vector<int> b(M);
int XMAX=X;
int YMIN=Y;
for (int i=0;i<N;i++){
cin>>a[i];
XMAX=max(XMAX,a[i]);
}
for(int i=0;i<M;i++){
cin >> b[i];
YMIN=min(Y... | #include <stdio.h>
int n,ans;
char s[30000];
int pos[10][30000],size[10];
bool ok(int i,int j,int k){
if(size[i]==0||size[j]==0||size[k]==0) return false;
int pivot=-1;
for(int a=0;a<size[j];a++){
if(pos[j][a]>pos[i][0]){
pivot=pos[j][a];
break;
}
}
if(pivot==... | 0 | 21,784,548 |
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e6) + 5;
int _size[N], root[N];
int n;
void Init() {
for (int i=1; i<=n; i++) {
_size[i] = 1;
root[i] = i;
}
}
int GetRoot(int x) {
while (root[x] != x) {
root[x] = root[root[x]];
x = root[x];
}
return x... | #include <cstdio>
#include <algorithm>
using namespace std;
#define N 100010
int n,l,t,cnt,a[N],w[N];
int main(){
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;++i) scanf("%d%d",&a[i],&w[i]);
for(int i=1;i<=n;++i){
int now=a[i];
if(w[i]==2) w[i]=-1;
a[i]+=t*w[i];
cnt+=a[i]/l;
if(a[i]%l<0) cnt--;
a[i]=(a[i]%... | 0 | 73,019,890 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int N = (int)S.size();
int reds = 0;
int blues = 0;
for (int i = 0; i < N; i++) {
if(S[i]=='0') reds++;
else blues++;
}
cout << min(reds,blues)*2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 2*acos(0.0)
#define pf printf
#define sf scan
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef std::vector<int> vi;
typedef vector<long long> vll ;
typedef pair<int, ... | 0 | 566,537 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> v(n);
REP(i,n){
int a,b;
cin >> a >> b;
v[i].firs... | 0 | 70,085,882 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n;
cin >> n;
string s;
cin >> ... | #include<iostream>
#include<string>
using namespace std;
int main(){
string cards;
string buf;
int h,n;
int i;
while(1){
cin >> cards;
if(cards == "-"){
break;
}
cin >> n;
for(i = 0; i < n;i++){
cin >> h;
buf = cards.substr(0,h);
cards += buf;
cards.erase(card... | 0 | 97,521,084 |
#include <stdio.h>
int main (){
int n;
scanf ("%d",&n);
if (n%10==7||(n/10)%10==7||n/100==7){
printf ("Yes\n");
}else{
printf("No\n");
}
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(),(obj).end()
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define rep(i,n) for(int i=0;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> inline bool chmin(T& a, T b) { if... | 0 | 8,026,944 |
#include<iostream>
#define SIZE 100
using namespace std;
int main(void) {
int n, c, v;
int G[SIZE][SIZE];
int A[SIZE][SIZE];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
A[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> v;
cin >> c;
for (int j = 0; j < c; j++) {
cin >... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | 0 | 60,739,668 |
#include<bits/stdc++.h>
using namespace std;
bool inside(int i, int j, int h, int w) {
return (i >= 0 && i < h && j >= 0 && j < w);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k,s;
cin>>n>>k>>s;
if(s < 1e9) {
for(int i = 0; i < n; i++) {
if(k-- > 0)
cout<<s<<" ";
e... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int m = 61;
int n;
vector<bitset<m>> gaussian_elimination(vector<bitset<m>> b) {
vector<bitset<m>> c(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) c[i][j] = b[i][m - 1 - j];
}
int x = 0;
for (int i = 0; i < n && ... | 0 | 68,105,294 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, m, l;
cin >> n >> m >> l;
rep(i, n) {
ll res;
if (i < m) res = l;
else {
if (l < 100) res = l+1;
else ... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 0 | 36,905,336 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<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)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | 0 | 71,968,061 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<string> vs;
const ll mod = 1e9+7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
#define fo... | 0 | 20,347,382 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> g(n);
for(int i=0;i<n;++i){
int id,k;
cin >> id >> k;
id--;
for(int j=0;j<k;++j){
int v;
cin >> v;
v--;
g[id].push_back(v);
}
}
vector<int> dist(n,-1);
queue<int> que;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
a.at(i)--;
}
int ans = 0;
for(int i=0;i<n;i++){
if(a.at(a.at(i))==i) ans++;
}
cout << ans / 2 << endl;
} | 0 | 87,163,670 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p; cin >> n >> p;
string s; cin >> s;
ll r=0, ans=0, acc=1;
if (p == 2) {
for (int i = 0; i < n; i++) {
if ((s[i]-'0')&1^1) ans+=i+1;
}
cout << ans;
return 0;
}
if (p == 5) {
for (int i = 0; i < ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 100,342,574 |
#include<bits/stdc++.h>
using namespace std;
const int N=105;
int a[N],n,ans;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
for (int i=1,j=1;i<=n;i=j){
while (j<=n&&a[i]==a[j])j++;
ans+=(j-i)/2;
}
printf("%d\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
rep(i, n){
cin >> a[i];
if ((i % 2 == 0 && n % 2 == 0) || (i % 2 == 1 && n % 2 == 1) ){
b.pus... | 0 | 79,184,142 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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... | #include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define int ll
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef pai... | 0 | 66,077,080 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
if(n % 2 == 1)
cout << 0 << endl;
else {
ll cnt = 0, fty = 10;
while(n >= fty) {
cnt += n / fty;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
map<char,ll>ch;
for(ll i=0;i<4;i++){
ll now=s[i]-'A';
ch[now]++;
if(ch[now]>2){
cout << "No";
return 0;
}
}
for(auto itr=ch.begin();itr!=ch.end();itr++){
ll... | 0 | 35,524,164 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k; cin >> a >> b >> c >> k;
long long ans;
if(k%2==1) ans=(a-b)*(-1);
else ans = a-b;
if(abs(ans)>pow(10,18)) cout << "Unfair" << endl;
else cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> count(200000, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
... | 0 | 18,135,262 |
#include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100000;
std::vector<int>... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(10);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | 0 | 49,533,078 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
for (int bit = 0; bit < (1 << 3); bit++) {
int ans = a;
string ope;
if (bit & (1 << 0)) {
ans += b;
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 55,336,793 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
char c;
cin>>c;
if(c=='A')
{
cout<<'T'<<endl;
}
else if(c=='C')
{
cout<<'G'<<endl;
}
else if(c=='T')
{
cout<<'A'<<endl;
}
else if(c=='G')
{
cout<<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
k=min(k,200);
rep(i,k){
vector<int> vec(n+1,0);
rep(i,n){
int x=v[i];
int y=max(0,i-x);
... | 0 | 870,198 |
#include <iostream>
using namespace std;
int main( void )
{
int n,s;
while( 1 ){
int ret = 0;
cin>>n>>s;
if( n==0 && s==0 ) break;
for( int i=0; i < (1<<10); i++ ){
int a=1,b=0,c=0;
for( int j=0; j<10; j++ ){
if( i & a ){ b += j; c++; }
a <<= 1;
}
if( c == n &... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 53,986,314 |
#pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vec... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 1e2 + 10;
const int SIZ = 1e6 + 10;
const ... | 0 | 70,840,351 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | #include <bits/stdc++.h>
using namespace std;
int check(char c){
if( (c >= 'h' && c<='p') || c == 'y' || c == 'u') return 1;
else return 0;
}
int main(){
while(1){
string s; cin>>s;
if(s == "#") break;
int count = 0;
for(int i=1; i<s.size(); i++){
if(check(s[i-1])... | 0 | 95,706,560 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll W, H, N;
cin >> W >> H >> N;
vector<... | 0 | 93,521,579 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
int sum=0;
for(int i=1; i<n; i++){
sum = sum + i;
}
for(int i=1; i<m; i++){
sum = sum + i;
}
cout << sum << endl;
return 0 ;
} | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<utility>
#include<string>
#include<map>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 0 | 45,324,942 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <ctime>
#include <cstring>
#include <cassert>
#include <bitset>
#include <sstream>
#include <queue>
#define pb push_back
#define mp make_pair
#define fs first
#define sc... | #include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define ll long long
#define N 1000005
int n,a[N];
bool vis[N];
int s[N];
int main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0),std::cout.tie(0);
std::cin>>n;
int mx=0;
rep(i,... | 0 | 100,407,452 |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#define sqr(x) (x)*(x)
using namespace std;
vector<int> bi[100005];
int n,m,i,j,dp[100005];
void dfs(int x,int fa)
{
int i;
for (i=0;i<bi[x].size();i++)
{
if (bi[x][i]==f... | #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;
#define li long long int... | 0 | 94,647,650 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<int>> l(h,vector<int>(w,... | 0 | 97,094,963 |
#include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int conversion_num;
while (cin >> conversion_num) {
if (conversion_num == 0) break;
map<string, string> ConversionBase;
for (int i = 0; i < conversion_num; ++i) {
string str1, str2;
cin >> str1 >> str2;
... | 0 | 54,746,181 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(1){
int n;
vector<int> a;
cin>>n;
if(n == 0)
break;
for(int i=0; i<n; i++){
int x;
cin>>x;
a.push_back(x);
}
sort(a.begin(),a.end());
int diff=1000000;
for(int i=0; i<n-1; i++){
if(a[i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
using P = pair<int,int>;
int main()
{
int n;
cin >> n;
vector<P> a(n);
vector<P> b(n);
vector<bool> used(n);
rep(i,n)
{
int x, y;
cin >> x >> y;
... | 0 | 56,310,303 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll mod=1e9+7;
ll n,m;
cin>>n>>m;
int a[n],b[m];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int j=1;j<=m;j++)
cin>>b[j];
int dp[n+1][m+1];
memset(dp,0,siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> s(n + 1);
map<ll, ll> nums;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s[i + 1] = s[i] + a;
}
for (int i = 0; i < n + 1; i++) {
nums[s[i]]++;
}... | 0 | 99,250,686 |
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define fastio ios::sync_with_stdio(0);cin.tie(0)
#define For(i,a,b) for (Long i = a; i < b; i++)
#define roF(i,a,b) for (Long i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) (v).begin(),(v)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_b... | 0 | 77,712,572 |
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int solve(int idx , vector<int>&v , vector<int>&dp , int n)
{
if(idx == n)
return 0;
if(dp[idx] != -1)
return dp[idx];
int op1 = INT_MAX;
int op2 = INT_MAX;
if(idx + 1 <= n)
{
op1 = solve( idx + 1 , v , dp , n) ... | 0 | 4,919,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(){
vector<int> w(10, 0);
for (int i = 0; i < 6; i++){
int a;
cin >> a;
w[a]++;
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(long long i = a; i < b; i++)
#define dump(a) for(auto x : a) cout << x << " "; cout << "\n"
#define print(a) cout << a << "\n"
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr... | 0 | 221,070 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()
#define PI 3.14159265358479
typedef long long ... | #include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
vector<int>to[200005];
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--; b--;
to[a].push_back(b);
to... | 0 | 63,265,708 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.