code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << (a - 1) * (b - 1) << ... | #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 ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(... | 1 | 70,969,597 |
#include <stdio.h>
long long p = 1000000007;
long long x, y, z;
long long rui(long long a,long long b) {
if (b == 0)return 1;
if (b == 1)return a;
if (b == 2)return a * a % p;
if (b % 2)return rui(rui(a, b / 2), 2) * a % p;
else return rui(rui(a, b / 2), 2);
}
int main() {
scanf("%lld%lld", &x, &y);
if ((x + y) ... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll fac[2000007],finv[2000007],inv[2000007];
void cominit(){
fac[0]=fac[1]=1;
fi... | 1 | 95,947,008 |
#include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i <= (int)(n); i++)
int main(){
int X, N;
cin >> X >> N;
set<int> p;
int a;
rep(i, N) {
cin >> a;
p.insert(a);
}
rep(i, 100){
if(!p.count(X-i)){
cout << X-i << endl;
return 0;
}else if(!p.count(X+i)){
... | 1 | 1,514,614 |
#include <iostream>
using namespace std;
int N;
int ma;
int main()
{
cin >> N;
for(int i = 1;i <= N;i++)
{
if((i + 1) * i / 2 >= N)
{
ma = i;
break;
}
}
for(int i = ma;i >= 1;i--)
{
if(N - i >= 0)
{
cout << i << endl;
N -= i;
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <utility>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <thread>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)
typedef long long ll;
typedef pair<int,int> pii;
int main... | 1 | 24,839,634 |
#include<iostream>
#include<cstring>
#include<map>
using namespace std;
typedef long long LL;
const int N = 1e5;
LL ans[N+1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
map<LL,LL> freq;
map<LL,int> smallest;
LL total_on_board = 0;
int n; cin >> n;
for(int i = 0; i < n; i++)
{
LL x; ci... | #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... | 1 | 46,859,730 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long lint;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef unsigned long long ulint;
#define endl '\n'
#define fst first
#define sed second
#define pb push_back
#define mp make_pair
#def... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
const long long INF = 1e18;
const long long mod = 998244353;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | 1 | 24,242,692 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int ans;
cin >> N >> M;
ans = (N+M+1)/2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, x = 0;
cin >> a >> b;
x = (a+b)*0.5+0.5;
cout << x << endl;
} | 1 | 69,717,767 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
template<class T> inline bool chmin(T &a, T b){
i... | 1 | 27,822,008 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 998244353;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "----... | #include<bits/stdc++.h>
#include<unordered_map>
#include<tr1/unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define lin1(x) ll int ... | 1 | 6,530,856 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (int)n;i++)
#define repb(i, n) for(int i = (int)n;i >= 0;i--)
#define reps(i, m, n) for(int i = (int)m;i < (int)n;i++)
#define repsb(i, m, n) for(int i = (int)m;i >= (int)n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#defin... | #include <iostream>
using namespace std;
int main()
{
int i;
int a;
int b;
for(i=0;i<10000;i++)
{
cin >> a >>b;
if(a==0 && b==0)
break;
if(a>b)
cout << b <<" "<< a <<"\n";
else
cout << a <<" "<< b <<"\n";
}
} | 1 | 85,903,426 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
struct xyz{
uint64 x;
uint64 y;
uint64 z;
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
uint N, M; cin >> N >> M;
vector<xyz> vXYZ(N);
for(uint i=0; i<N;... | 1 | 84,727,257 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string Card;
int n = 0, t = 0;
cin >> Card;
while (Card != "-") {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
Card = Card.substr(t, Card.size() - t) + Card.substr(0, t);
}
cout << Card << endl;
cin >> Card;
}
return 0... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int check = 0;
do {
string word;
cin >> word;
int num = word.size() - 1;
if (!(word[0] == '-')) {
int m;
cin >> m;
vector<int> h(m);
for (int i = 0; i < m; ++i) {
cin >> h[i];
}
for (int j = 0; j < ... | 1 | 3,838,731 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int goukei = 0;
vector<int>W(N);
for(int i = 0; i < N; i++) {
cin >> W[i];
goukei += W[i];
}
int ans = 1e7;
for(int i = 0; i < N; i++) {
int cnt = 0;
for(int j = 0; j < i; j++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
std::vector<int> v;
int sum = 0;
for(int i=0;i<N;i+=1){
int x;
cin >> x;
v.push_back(x);
sum+=x;
}
int b=999999;
int right = 0;
for(int i=(N-1);i>=0;i-=1){
sum-=v[i];
r... | 1 | 41,335,696 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
int jou = n-1;
int total = k*pow(k-1,jou);
cout << total;
} | #include <bits/stdc++.h>
using namespace std;
long long color(int n, int k) {
if (n == 1) return k;
else return color(n - 1, k) * (k - 1);
}
int main() {
int n, k;
cin >> n >> k;
cout << color(n, k);
} | 1 | 4,189,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
cout << min({A+C,A+D,B+C,B+D}) << endl;
} | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define print(ele) cout << ele << endl
#define print... | 1 | 72,846,153 |
#include<cstdio>
#include<algorithm>
using namespace std;
int input_data[5];
int main(void){
for(int i = 0; i < 5; i++){
scanf("%d", &input_data[i]);
}
for(int i = 0; i < 5; i++){
for(int j = i + 1; j < 5; j++){
if(input_data[i] < input_data[j]){
swap(input_data[i], input_data[j]);
}
}
}
for(int i ... | #include<stdio.h>
#include<algorithm>
using namespace std;
int a[5]={0};
int b[4]={0};
int hit=0,blow=0;
int main()
{
for(int i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+5);
for(int i=4;i>=0;i--)
{
printf("%d",a[i]);
if(i!=0)
{
printf(" ");
}
... | 1 | 54,949,925 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <iostream>
#include <vector>
#include <tuple>
using vec = std::vector<int>;
using Graph = std::vector<vec>;
using edge = std::tuple<int, int, int>;
Graph calc_minimum_dists(Graph g)
{
Graph min_dist = g;
int N = g.size();
for (int k = 0; k < N; k++)
for (int i = 0; i < N; i++)
f... | 1 | 74,549,156 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
ll a;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
int N ;
ll ans = 0 ;
cin >> N ;
vector<ll> A(N) ;
map<ll,ll> mp ;
rep(i,N) cin >> A.at(i) ;
vector<ll> S(N+1) ;
S.at(0) = 0 ;
mp[S.at(0)]++ ;
rep(i,N){
S.at(i+1) = S.... | 1 | 7,854,033 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
string s;
cin>>s;
if(s[0]==s[1]&&s[2]==s[1]){cout<<"No"<<endl;}
else{cout<<"Yes"<<endl;}
return 0;
} | #include <iostream>
using namespace std;
int main(){
char* s = (char*)calloc(4, sizeof(char));
cin >> s;
for(int i = 0; i < 3; i++){
for(int j = i+1; j < 3; j++){
if(s[i] != s[j]) {cout << "Yes" << endl; return 0;}
}
}
cout << "No" << endl;
return 0;
} | 1 | 38,495,048 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int x, a;
cin >> x >> a;
if (x < a) cout << 0 << '\n';
else co... | #include <bits/stdc++.h>
typedef long long ll;
#define endl '\n'o
using namespace std;
const int MOD = 1000000007, MAX = 2000000007, MAXN = 100005;
void solve(int n)
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x,a;
cin>>x>>a;
if(x<a)
cout<<0;
else
{
... | 1 | 43,618,969 |
#include<bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(0)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define c(a,n) for(size_t i = 0; i < n; i++) cin >> a[i];
#define ffor(n) for(size_t i =... | #include <iostream>
using namespace std;
const int NMAX = 1000;
const int MOD = 1e9 + 7;
int N, M;
char s[NMAX + 2][NMAX + 2];
int dp[NMAX + 2][NMAX + 2];
int main()
{
cin >> N >> M;
for(int i = 1; i <= N; i++)
cin >> (s[i] + 1);
dp[1][1] = 1;
for(int i = 1; i <= N; i++)
for(int j = 1; j... | 1 | 2,621,984 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string.h>
#include <string>
#include <map>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;
ll ans = 0;
cin >> n;
vector<string> s(n);
map<string, ll> m;
rep(i,n){
... | #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... | 1 | 40,165,360 |
#include<iostream>
using namespace std;
long long c[]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};
char s[100];
bool query(long long n)
{
cout<<"? "<<n<<endl;
cin>>s;
return s[0]=='Y';
}
int main()
{
if(query(c[9]))for(int i=9;;i--)
if(!i||!query(c[i]-1))
{
cout<<"! "<<c[i]<<endl;
r... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
bool query(ll x){
cout<<"? "<<x<<endl;
char res;
cin>>res;
return res=='Y';
}
void answer(int n){
cout<<"! "<<n<<endl;
return;
}
int main(){
ll ten=1;
for(int k=0;k<=10;k++){
if(!query(ten)){
ll lb=ten/1... | 1 | 89,763,825 |
#include<iostream>
int main(){char c[3],d[3];std::cin>>c>>d;puts((c[0]==d[2])*(c[1]==d[1])*(c[2]==d[0])?"YES":"NO");} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
char c[2][3];
rep(i,0,1){
rep(j,0,2){
cin>>c[i][j];
... | 1 | 41,916,865 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0; cin >> n >> k;
vector<ll> num(k, 0);
for (int i = 1; i <= n; i++)
num[i%k]++;
for (ll a = 0; a < k; a++) {
if ((k-a)%k*2%k == 0)
ans += num[a] * num[(k-a)%k] * n... | #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() {
int N, K;
cin >> N >> K;
ll mod0 = N / K;
ll modhalf;
if (K % 2 == 1) modhalf = 0;
else {
modhalf = mod0;
if (N % K >= K / 2) +... | 1 | 84,731,502 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
string strA = "";
string strB = "";
for (int i = 0; i < b; i++) strA += to_string(a);
for (int i = 0; i < a; i++) strB += to_string(b);
if (strA > strB) cout << strB << endl;
else cout << strA << endl;
... | #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()
{
int a, b;
cin >> a >> b;
int ans = 0;
if (a <= b) {
rep(i, b) {
ans *= 10;
ans += a;
}
} else {
re... | 1 | 60,378,788 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, answer = LLONG_MAX;
cin >> N >> K;
pair<int,int> xy[N];
for (int i = 0; i < N; i++) {
cin >> xy[i].first >> xy[i].second;
}
sort(xy,xy+N);
for (int i = 0; i < N; i++) {
for (int j = i+K-1; j < N; j++) {
int z[j-i+1];
... | 1 | 28,395,268 |
#include<iostream>
#include<string>
using namespace std;
struct Node{
int parent;
int left;
int right;
};
int *D;
Node *T;
void setdepth(int u, int p){
D[u] = p;
if(T[u].right != -1){
setdepth(T[u].right, p);
}
if(T[u].left != -1){
setdepth(T[u].left, p + 1);
}
}
int main(){
int n, x, i, r;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
struct Node {
Node *parent;
vector<Node*> childs;
int num;
};
Node *root;
int main() {
root = new Node;
root->parent = root;
int n;
cin >> n;
Node *nodes[n];
for (int i = 0; i < n; i++) {
nodes[i] = new N... | 1 | 48,991,105 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::string s;
std::cin >> s;
int n = s.size(), b = 0;
std::vector<int> memo(1 << 26, n);
memo[0] = 0;
for (int i = 0; i < n; i++) {
int index = s[i] - 'a';
b ^= 1 << index;
int c = memo[b] + 1;
for (int... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <bitset>
#include <unordered_map>
using ll = long long;
using namespace std;
using bs = bitset<26>;
#define INF 200010
#include <map>
#include <set>
template <typename T>
int compress(vector<T> org, map<T, int> &zip, ... | 1 | 91,986,928 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k, n;
cin>>k>>n;
int A[n+1];
for (int i = 1; i <= n; ++i)
{
cin>>A[i];
}
int ans[n+1];
ans[0] = INT_MIN;
ans[1] = A[n] - A[1];
for (int i = 2; i <= n; ++i)
{
ans[i] = k - A[i] + A[i-1];
}
sort(ans, ans+n+1);
cout<<ans[1]<<endl;
} | #include <iostream>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
int a[n];
int b=0;
int ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=1;i<n;i++){
ans+=a[i]-a[i-1];
if(a[i]-a[i-1]>=b){
b=a[i]-a[i-1];
}
}
if(k-a[n-1]+a[0]>b){
cout<<ans;
return 0;
}
ans+=k-a[n-1]+a[0];
ans-=b;
co... | 1 | 80,591,826 |
#include <iostream>
#include <iomanip>
#include <complex>
#include <cmath>
#include <vector>
#include <queue>
#include <string>
#include <stdlib.h>
using namespace std;
typedef complex<long> com;
long tri(com a, com b)
{
return(conj(a)*b).imag() / 2;
}
long s_ll(string s)
{
int ssize=s.size();
int j=6;
for(int i=... | #include <iostream>
#include <cmath>
using namespace std;
int main (void) {
long double x1, y1, x2, y2, x3, y3, x4, y4;
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
long double t1 = (y1-y2)/(x1-x2);
long double t2 = (y3-y4)/(x3-x4);
if (t1==t... | 1 | 54,418,639 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<string,int>;
using T = tuple<string,int,int>;
int main(){
int A,B,M; cin >> A >> B >> M;
vector<int> a(A), b(B);
for(int i = 0; i < A; i++) cin >> a[i];
for(int i = 0; i < B; i++) cin >> b[i];
int amn = *min_element(a.begin(), ... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 1 | 99,672,021 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
ll n, k;
cin >> n >> k;
set<ll> s;
for (long i = 0; i < k; i++) {
ll d;
cin >> d;
for (l... | 1 | 57,464,949 |
#include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
vector<int> values;
copy(istream_iterator<int>(cin), istream_iterator<int>(), back_inserter(values));
sort(values.begin(), values.end(), greater<int>());
for (size_t i = 0; i < values.size(); ++i) {
if... | #include<iostream>
#include<algorithm>
#include <functional>
using namespace std;
int main(){
int d[6]={};
for(int i=0;i<5;i++){
cin>>d[i];
}
sort(d,d+5,greater<int>());
for(int i=0;i<4;i++){
cout<<d[i]<<" ";
}
cout<<d[4]<<endl;
return 0;
} | 1 | 3,125,966 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int cnt = 0;
while (a >= b) {
b *= 2;
c... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define frepi(a,b) for(int i=a;i<=b;++i)
void solve_main()
{
int a,b,c;cin>>a>>b>>c;
int k;cin>>k;
int count = 0;
... | 1 | 42,432,342 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<x<<endl
#define mmax(x... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define endl '\n'
#define M 1000000007
#define error(x) cout << #... | 1 | 22,679 |
#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
const int N = 1e5 + 5;
int n, k, r, s, p;
string t, play = "rspt";
ll dp[N][5];
ll score(char a, char b){
if(a == 'r' && b == 'p') return p;
else if(a == 's' &&... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | 1 | 82,305,971 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define int long long
signe... | #include <iostream>
#define MOD 1000000007
using namespace std;
int main(void){
int n, t[100000], a[100000], v;
long long ans = 1;
cin >> n;
for(int i=0;i<n;i++)cin >> t[i];
for(int i=0;i<n;i++)cin >> a[i];
if(t[n-1] != a[0])ans = 0;
v = n-2;
for(int i=1;i<n;i++){
v--;
if... | 1 | 73,226,819 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a;
for (int e, i = 0; i < n; i++) {
cin >> e;
a.emplace_back(e, i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
set<int> index;
long long ans = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> q(n+1);
for (ll i = 0; i < n; ++i)
{
ll p; cin >> p;
q[p] = i+1;
}
multiset<ll> s;
s.insert(0);
s.insert(0);
s.insert(n+1);
s.insert(n+1);
s.insert(q[n]);
ll ans = 0;
for (ll i = n-1; i > 0; --i)... | 1 | 2,541,310 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
ll num, ans = 1;
rep(i, n) {
cin >> num;
ans = lcm(ans, num);
}
cout << an... | 1 | 84,391,677 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
us... | #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... | 1 | 24,130,433 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
int ans = 0;
int current = 0;
bool flg = false;
while (!flg) {
ans++;
current += X;
if (current % 360 == 0) {
flg = true;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int x;
cin >> x;
for (int i = 1; ; i++) {
if ((x * i) % 360 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | 1 | 98,670,861 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <algorithm>
int main()
{
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::unordered_map<int, int> mapa;
mapa.insert(std::make_pair(0, 0));
std::string str;
std::getline(std::cin, str);
int n = str.length();
int xoring = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF ... | 1 | 12,227,192 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (int)(n); i++)
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
if (a>=k){
cout<<k<<endl;
}
else if (a+b>=k)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k;cin>>a>>b>>c>>k;
int zbr=0;
zbr+=min(a,k);
k-=min(a,k);
k-=min(b,k);
zbr-=min(c,k);
cout <<zbr<<endl;
} | 1 | 19,058,031 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 10000000000... | 1 | 35,916,430 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N);
loop(0, N, i) cin >> A[i];
ll leastcost = -1;
for (int bit=0; bit<(1<<N); bit... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define all(obj) obj.begin(), obj.end()
#define dbg(x) cerr << #x << ":" << x << " "
#define dbgl(x) cerr << #x << ":" << x << "\n"
#define dbgv(vec) cerr << #vec <... | 1 | 25,118,839 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a[n];
rep(i,n)cin >> a[i];
sort(a,a+n,greater<int>());
int sum=0;
rep(i,n)sum+=a[i];
string ans="No";
int cnt=0;
rep(i,m){
if(4*m*a[i]>=sum)cnt++;
else break;
}
if(m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
... | 1 | 52,968,761 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll m, ll n) {
if (n == 0)return m;
return gcd(n, m % n);
}
int main() {
ll n,x;
cin>>n>>x;
vector<ll> a(n);
rep(i,n){
ll A;
cin>>A;
a[i]=abs(A-x);
}
ll ans=a[0]... | #include <bits/stdc++.h>
#include <gmpxx.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout <... | 1 | 56,188,872 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string a, b; cin >> a >> b;
if(a.size() > b.size()) cout << "GREATER" << endl;
else if(a.size() < b.size()) cout << "LESS" << endl;
else {
int res = 0;
for (int i = 0; i < a.size(); i++)
{
if(a[i] - '0' > b[i] - '0') {
res = 1;
break;
}
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 1 | 8,326,115 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
int xl, xr, yb, yt;
xl = 0;
xr = W;
yb = 0;
yt = H;
for (int i=0; i<N; ++i) {
int x, y;
int a;
cin >> x >> y >> a;
if (a == 1) {
if (x > xl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int W, H, N;
cin >> W >> H >> N;
int left = 0, right = W, bottom = 0, top = H;
for(int i=0; i<N; i++) {
int x, y, a;
cin >> x >> y >> a;
if(a == 1) {
left = max(left, x);
}
else if(a == 2)... | 1 | 71,541,519 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 1e5 + 5;
ll n, m, ans, a[N];
map<int, vector<int>>mp;
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++){
cin >> a... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
int a[N];
void solve() {
int n, m; scanf("%d%d", &n, &m);
map<int, ... | 1 | 87,390,741 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a(n);
for(long long i=0;i<n;i++){
cin >> a[i];
}
long long m=1000, b=0;
for(int i=0;i<n-1;i++){
if(a[i] > a.at(i+1)){
m += a.at(i) * b;
b=0;
}
else{
b += m / a.at(i);
m %= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int N, M;
void func()
{
cin>>N;
ll a[N];
rep(i, 0, N)cin>>a[i];
ll dp[N]={};
dp[0]=1000;
rep(i, 1, N) {
dp[i]=dp[... | 1 | 55,634,836 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define... | 1 | 100,851,496 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a[n+1];
int b[n+1];
int cnt = 0;
rep(i, n)
{
cin >> a[i];
}
rep(i , n)
{
if(a[a[i]] == i)
cnt++;
}
cout << cnt / 2 << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,ans=0;
cin >> n;
int a[n];
rep(i,n){
cin >> a[i];
a[i]--;
}
rep(i,n){
if(i==a[a[i]]) ans++;
}
cout << ans/2 << endl;
} | 1 | 22,667,405 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#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 m... | 1 | 38,976,735 |
#include <bits/stdc++.h>
#define M 1e7
using namespace std;
int main(){
int n,i,j,b[6];
while(cin>>n,n){
int a[86400]={0},ans=0,c=0;
while(n--){
scanf("%d:%d:%d %d:%d:%d",&b[0],&b[1],&b[2],&b[3],&b[4],&b[5]);
a[b[0]*3600+b[1]*60+b[2]]++;
a[b[3]*3600+b[4]*60+b[5]]--;
}
for(i=0;i<86400;i++){
c+=a[i]... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#define L 1
#define A 0
using namespace std;
int main(void)
{
int n;
string s,a;
int i1;
int max;
int count;
while(1){
vector<int> v;
cin >> n;
if (n == 0) break;
vector< pair<string,int> > t;... | 1 | 99,603,644 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
ll ans = 0, cnt = 0;
for(int i=0; i<n; ++i){
int x;
cin >> x;
if(x == 0){
ans += cnt/2;
cnt = 0;
}
else cnt += x;
}
ans += cnt/2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 1 | 60,311,572 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef st... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <valarray>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include ... | 1 | 52,441,599 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
string s,t,u;
ll a,b;
cin >> s >> t >> a >> b >>u;
if(u==s)cout << a-1 << " " << b << endl;
else cout << a << " " << b-1 << endl;
} | #include <iostream>
#include <iomanip>
#include <string>
using namespace std;
void Main() {
string S, T;
int A, B;
string U;
cin >> S >> T;
cin >> A >> B;
cin >> U;
if (U ==S) {
A--;
} else if (U == T) {
B--;
} else {
cout << "Error";
}
cout << A << " ... | 1 | 18,105,044 |
#include <cstdio>
#include <cmath>
#include <complex>
using namespace std;
#define EPS 10e-8
#define PI 3.1415926535
typedef complex<double> Point;
int n;
Point ps[4];
int main() {
scanf("%d", &n);
while (n--) {
for (int i=0; i<4; i++) {
double x, y;
scanf("%lf%lf", &x, &y);
ps[i] = Point(x, y... | #include <cstdio>
#include <cmath>
main(){
double a,b,c,d,e,f,g,h;
for(scanf("%lf",&a);~scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a,&b,&c,&d,&e,&f,&g,&h);)
puts(fabs((c-a)*(h-f)-(d-b)*(g-e))>1e-10?"NO":"YES");
return 0;
} | 1 | 64,008,718 |
#include<iostream>
#include<vector>
using namespace std;
int i;
int main(){
vector<int>a(5);
for (i=0;i<5;i++){
cin >> a[i];
}
if (a[2]+a[4]<=a[0] && a[2]-a[4]>=0 && a[3]+a[4]<=a[1] && a[3]-a[4]>=0){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
if(x >= r && y >= r && W-r >= x && H-r >= y){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 26,986,601 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 1000 + 10;
const long long INF = 1LL * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 10;
long long mod = 1000 * 1000 * 1000 + 7;
int n, k;
int candy[MAXN];
long long dp[200][MAXN];
long long sum[MAXN];
void update(int students)
{
sum[0] = dp[student... | #include "bits/stdc++.h"
using ll = long long;
const int MOD = 1000000007;
const int size = 1003;
const int numberOfCandies = 100005;
const int numberOfChildren = 102;
void Break()
{
#if _MSC_VER
static int x = 0;
++x;
switch (x)
{
__debugbreak();
}
#endif
}
int dp[numberOfCandies];
int main()
{
#if _MSC_VER
fr... | 1 | 49,022,721 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <climits>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++) {
cin >> b.at(i);
}
int kaunto = 0;
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
if (i != j) {
kaunto += b.at(i) * b.at(j);
}
}
}
cout ... | 1 | 37,212,229 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a>b) swap(a, b);
pair<int,int> x = make_pair(a, b);
for(int i = 1; i <= 5000; i++) {
pair<int,int> p = make_pair((i*8)/100, (i*10)/100);
if(p == x) {
cout << i;
exit(0);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int tax8,tax10;
for(int i=1; i<=10000; i++){
tax8=i*0.08;
tax10=i*0.1;
if(a==tax8 && b==tax10){
cout << i << endl;
break;
}
if(i==10000) cout << -1 << endl;
... | 1 | 43,658,319 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<int, int>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
llong H, W, N;
vector<P> black, masu;
cin >> H >> W >> N;
int h,w;
for(int i = 0; i < N; ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 1 | 40,754,615 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0; i<=n/4; ++i) for(int j=0; j<=n/7; ++j) if(i*4+j*7==n) return cout<<"Yes\n",0;
cout<<"No\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 37,214,405 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll a, ll b) {
if (a % b == 0) return b;
else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int main()
{
ll N; cin >> N;
vector... | 1 | 29,635,580 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 1 | 48,979,814 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,d;cin>>n>>d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n)rep(j,d)cin>>x[i][j];
int ans=0;
rep(i,n)for(int j=i+1;j<n;j++){
int cnt=0;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
int N, D;
... | 1 | 18,195,837 |
#include <bits/stdc++.h>
int main()
{
int n;
long long a[50], k{};
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", a + i);
bool updated{true};
while (updated)
{
updated = false;
for (int i = 0; i < n; i++)
{
if (a[i] < n) continue;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)... | 1 | 20,161,403 |
#include<bits/stdc++.h>
using namespace std;
int main(){int N , A , B; cin >> N >> A >> B; puts((B - A) & 1 ? "Borys" : "Alice"); return 0;} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
if((B-A)%2 == 0) cout << "Alice" << endl;
else cout << "Borys" << endl;
} | 1 | 80,150,144 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(int argc, char **argv)
{
ll n;
cin>>n;
ll sum=0;
for (ll i=1;i<=n;i++){
sum+=i;
}
cout<<sum<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int i,b,c,sum;
cin>>b;
sum=0;
for(i=1;i<=b;i++)
{
sum=sum+i;
c=sum;
}
cout<<c<<endl;
return 0;
} | 1 | 18,374,833 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
ll taka = 0,ao = 0;
priority_q... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<int> C(N);
ll sum = 0;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
C[i] = a+b;
sum += a;
}
sort(C.begin(), C.end());
reverse(C.begin(), C.end(... | 1 | 58,868,150 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
ll N, A, B, C;
vector<ll> l_list;
ll calc(ll bits[]) {
ll a = 0;
ll b ... | #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
const ll MOD = 10000... | 1 | 8,159,812 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int d;
cin >> d;
string ans;
switch (d)
{
case 22:
ans = "Christmas Eve Eve Eve";
break;
case 23:
ans = "Christmas Eve Eve";
break;
case 24:
ans = "Christmas Eve";
break;
defaul... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll d;
cin >> d;
if (d == 25) {
cout << "Christmas... | 1 | 74,248,789 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;cin>>N;
vector<int>P(N),Q(N),K(N);
for(int X=0;X<N;X++){
cin>>P[X];
}
for(int X=0;X<N;X++){
cin>>Q[X];
}
for(int X=0;X<N;X++){
K[X]=X+1;
}
int A,B;
int M=0;
do{
M++;
if(K==P){
A=M;
}
if(K==Q){
... | #include<bits/stdc++.h>
using namespace std;
int f(int curr,string&a){
if(curr>=a.length()-2) return 0;
if(a[curr]!='A') return f(curr+1,a);
if(a[curr+1]=='B' && a[curr+2]=='C') return 1+f(curr+3,a);
return f(curr+1,a);
}
int main(){
int n;
cin>>n;
vector<int>origin(n);
vector<int>permu_a(n);
vector<int>permu_... | 1 | 80,281,554 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#incl... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
type... | 1 | 30,279,219 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, s;
cin >> N;
s = N/10%10;
if(s != N/100%10) cout << "No";
else if(s == N%10 || s == N/1000%10) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if ((N / 1000 == N % 1000 / 100 && N % 1000 / 100 == N % 100 /10) || ( N % 1000 / 100 == N % 100 /10 && N % 100 /10 == N % 10) ) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 61,727,794 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
int main(void){
long long n, d, a, x, h;
std::cin >> n >> d >> a;
std::vector<std::pair<int, int>> p(n);
for(int i = 0; i < n; i++){
std::cin >> x >> h;
p[i].first = x;
p[i].second = h;
}
std::sort(p.begin(), p.end());
... | 1 | 79,648,808 |
#include <bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
using namespace std;
const int S=123456;
int main()
{
#ifndef ONLINE_JUDGE
#endif
int n;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(ll i=(n);i<(k);i++)
void Main(){
ll N;cin>>N;
vector<ll> A(N);
For(i,0,N) cin>>A[i];
ll cnt=0;
sort(A.begin(),A.end());
For(i,1,N) if(A[i]==A[i-1]) cnt++;
cnt+=(cnt%2);
cout<<N-cnt<<endl;
}
int main... | 1 | 2,398,797 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
vector<long long> c(26);
for (char d : s) {
++c[d - 'a'];
}
long long ans = (long long) s.size() * (s.size() - 1) / 2 + 1;
for (int i = 0; i < 26; ++i) {
ans -= c[... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)... | 1 | 96,851,571 |
#include <bits/stdc++.h>
#define int long long
#define vi vector<int>
#define co(x) cout << x << '\n'
using namespace std;
inline void solve(){
int n, ans = 0 ;
cin >> n ;
vi a(n+1) ;
for (int i=1;i<=n;i++) cin >> a[i] ;
int sum = 0, xr = 0, cnt = 0 ;
for (int i=1;i<=n;i++){
s... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;
int a[200005];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int r=0;
long long ans=0,sum=a[0];
for(int l=0;l<n;l++){
if(l>0)sum-=a[l-1];
while(r<n-1 && sum+a[r+1]==(sum^... | 1 | 8,400,586 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll mod(ll a) {
if (a > 0) return a % MOD;
if (a % MOD == 0) return 0;
ll x = -a / MOD + 1;... | 1 | 56,643,490 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int a,b,k;
cin>>a>>b>>k;
if(a+b <= k){
cout<<"0"<<" "<<"0";
}
else {if(a <= k){
cout<<"0"<<" "<<b-(k-a);
}
else{
cout<<a-k<<" "<<b;
}
return 0;}
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int64_t a, b, k;
cin >> a >> b >> k;
int64_t t = a - k > 0 ? a - k : 0;
int64_t ao = b - (k - a) > 0 ? b - (k - a) : 0;
if (a - k > 0)
{
t = a - k;
ao = b;
}
else
{
t = 0;
ao = b - (k - a) > 0 ? b - (k - a) : 0;... | 1 | 94,159,550 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n, k, a[maxn], dp[maxn][maxn];
bool check(int x) {
memset(dp, 0, sizeof dp);
if(x == 1) {
dp[2][0] = 1; dp[2][a[2]] = 1;
for (int i = 3; i <= n; ++i)
for (int j = 0; j <= k; ++j) {
dp[i][j] = dp[i - 1][j];
if(j >= a[i]) dp[i][j] ... | #include <vector>
#include <bitset>
#include <functional>
#include <stdio.h>
#include <algorithm>
typedef long long ll;
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 ALL(obj) (obj).begin(),(obj).end()
#define V vector<int>
#define pb(a) push_back(a)
#de... | 1 | 12,616,954 |
#include <iostream>
using namespace std;
int main() {
char x, y;
cin >> x >> y;
if (x > y) {
cout << ">" << endl;
}
else if (y > x) {
cout << "<" << endl;
}
else {
cout << "=" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
char x,y;
cin>>x>>y;
if((int)(x)==(int)(y)) cout<<"=";
else if((int)(x)>(int)(y)) cout<<">";
else cout<<"<";
return 0;
} | 1 | 30,476,330 |
#include <bits/stdc++.h>
using namespace std;
#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)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int x;
cin>>x;
... | #include <iostream>
int main(){int x;std::cin>>x;std::cout<<((x<1200)?"ABC":"ARC");} | 1 | 41,652,491 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
long long int ans = 1;
for(int i=1; i<=n; i++) ans *= i;
cout << ans << '\n';
return 0;
} | #include<stdio.h>
int main()
{
int n;
long long int sum=1;
scanf("%d",&n);
for(int i=n;i>=1;i--)
{
sum=sum*i;
}
printf("%lld\n",sum);
return 0;
} | 1 | 93,600,390 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main( ) {
ios_base::sync_with_stdio(false)... | 1 | 8,517,922 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MAX = 10000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % ... | 1 | 77,195,594 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <iostream>
using namespace std;
int main(){
long n, aux;
cin>>n;
aux=n/15;
cout<<n*800-aux*200;
return 0;
} | 1 | 36,445,680 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #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 rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | 1 | 93,094,434 |
#include<iostream>
using namespace std;
int N, K;
void read() {
cin >> N >> K;
}
void work() {
cout << (N % K == 0 ? 0 : 1) << endl;
}
int main() {
read();
work();
return 0;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 1 | 35,972,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 1 | 28,056,454 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 1 | 25,997,657 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<ll, ll> P;
int main()
{
int n;
cin >> n;
vector<int> v(n + 1);
int mx = 0;
rep(i, n)
{
int x;
cin >> x;
mx = max(mx, x);
v[x]+... | 1 | 96,144,640 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
s... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repr(i, s, e) for(int i=s; i>=e; i--)
#define reps(i, s, e) for(int i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x... | 1 | 97,060,543 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
int a[100001];
ll l[100002];
ll r[100002];
int main() {
int n, i;
ll x = 1, ans = 0... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << ... | 1 | 66,022,026 |
#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
int n;
int dp[100001][2];
vector<int>adj[100001];
int solve(int u ,int par ,int c)
{
if(dp[u][c]!= -1)
return dp[u][c];
int ans = 0;
bool leaf = true;
int w1 = 1;int w2 =1;
for(auto child : adj[u]... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define int long long
#define MOD 1000000007
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> dp;
void dfs(int idx, int last){
for (auto it : adj[idx]){
if (it==last)
continue;
dfs(it, idx);
dp[idx][0] =... | 1 | 61,021,426 |
#include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin>>n>>m;
vector<int>wa(n,0);
vector<bool>c(n,false);
for(int i=0;i<m;i++)
{
string s;
ll x;
cin>>x>>s;
x--;
... | 1 | 36,915,633 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.