code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n) ; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m;
cin >> n >>m;
cout << (n+m+1)/2 <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long comb2(long long x) {
if (x < 2)
return 0;
return (x * (x - 1)) / 2;
}
int main() {
long long N, P;
string S;
cin >> N >> P;
cin >> S;
if (P == 2 || P == 5) {
long long ans = 0;
for (long long i = S.length() - 1; ... | 0 | 97,743,961 |
#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;
int main(){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
long long wa[n+1];
wa[0]=0;
map<int,vector<int>>x;
set<int>s;
for(int i=1;i<=n;i++)wa[i]=wa[i-1]+a[i-1];
for(int i=0;i<=n;i++){
wa[i]=((wa[i]-i)%k+k)%k;
... | 0 | 32,203,047 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int EditDistance(string s1,string s2){
int n=s1.size();
int m=s2.size();
int dp[n+1][m+1];
for(int i=0;i<n+1;i++){
dp[i][0]=i;
}
for (int j=0;j<m+1;j++){
dp[0][j]=j;
}
for (int i=1;i<n+1;i++){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b;
if(a==1 && b==2)
cout << "3" << endl;
else if(a==2 && b==1)
cout << "3" << endl;
else if(a==2 && b==3)
cout << "1" << endl;
else if(a==3 && b==2)
cout << "1" << endl;
else if(a... | 0 | 79,063,722 |
#include<cstdio>
using namespace std;
int main(){
int a,b,c,d;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
int ans = 0;
if (a > b) ans += b;
else ans += a;
if (c > d) ans += d;
else ans += c;
printf("%d\n", ans);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
vec ans;
void dfs(ll id,ll sum) {
if(sum==0) {
for(ll i=1;i<10;i++) {
ll tsum=sum+i;
ans.push_back(tsum);
dfs(id-... | 0 | 64,259,249 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N;
cin >> N;
vector<map<char, int>> mp(N);
rep(i, N){
string s;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 49,363,730 |
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000000000
#define INF 1000000
#define M 1000000007
#define PI 2 * acos(0.0)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main(){
fast_io
ll n;
cin>>n;
ll a[n];
for(ll i = 0;i<n;i++)... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | 0 | 72,052,488 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,k;cin >>n>>k;
ll r,s,p;cin >>r>>s>>p;
string t;cin >>t;
ll ans=0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 0 | 25,421,749 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define MAX 100005
#define ff first
#define ss second
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}... | #include <iostream>
#include <stdio.h>
#include <string.h>
#define MAX_OP_NUM 2000000
#define MAX_KEY_VALUE 1000000000
#define MAX_LIST_LENGTH 1000000
using namespace std;
struct Cell {
int value;
Cell* next;
Cell* prev;
};
class LinkedList {
public:
LinkedList() {
nil = new Cell();
nil->next = nil;
... | 0 | 93,134,747 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX = 2000010;
const int MOD = 100000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 11,735,501 |
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n;
vector <ll> a;
ll calc(ll m){
ll ret = 0;
for(auto &i : a){
if((i + m) % (n + 1) == n) return -1;
ret += (i + m) / (n + 1);
}
return ret;
}
int main(){
ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).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... | 0 | 15,628,368 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(lon... | #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);
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> h(N);
for(int i = 0; i ... | 0 | 48,426,212 |
#include <stdio.h>
#include <string.h>
int main(){
char a[15], b[10], c[10];
scanf("%s %s %s", a,b,c);
int al = strlen(a), bl = strlen(b), cl = strlen(c);
if (a[al-1] == b[0] && b[bl-1] == c[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
} | #include <iostream>
using namespace std;
char table[21][21];
bool reachable;
int cnt;
int w, h;
void dfs(int x, int y) {
if (table[y][x] == '@')
reachable = true;
table[y][x] = '#';
for (int dy = -1; dy <= 1; dy++) {
for (int dx = -1; dx <= 1; dx++) {
if (dx*dy != 0 || x+dx < 0 |... | 0 | 77,806,902 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)n;++i)
constexpr int TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); };
const int inf = TEN(18) + 10;
int N, X, D, sum;
int a[55];
int f(int... | 0 | 59,443,217 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int n, q;
int rank[10000], par[10000];
void init(){
rep(i,n) par[i] = i;
rep(i,n) rank[i] = 0;
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(par[x]);
y = find... | 0 | 83,057,957 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 49,778,372 |
#include <bits/stdc++.h>
using namespace std;
char grid[5001][5001];
long long mod=1e9+7;
int soln(int n,int m){
int dp[n][m];memset(dp,0,sizeof(dp));
dp[n-1][m-1]=1;
for(int i=n-1;i>=0;i--){
for(int j=m-1;j>=0;j--){
if(i==n-1&&j==m-1)continue;
else if(grid[i][j]=='#')dp[i][j... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint n;
vector<int> u, v;
lint vertice_count() {
lint res = 0;
for (lint i = 0; i < n; i++) {
res += (i + 1 - 0) * (n - i);
}
return res;
}
lint edge_count(int l, int r) {
if (l > r) {
swap(l, r);
}
return ... | 0 | 67,482,900 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll x, a, b;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> x >> a >> b;
if (a >= b) cout << "delicious";
else if (b - a <= x) cout << "safe";
else cout << "dangerous";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M,0));
priority_queue<int, vector<int>, greater<int>> cost;
for(int i = 0; i < N; ++i){
cin >> C[i];
for(int j = 0; j < M; ++j){
... | 0 | 94,057,740 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef map<string, int> msi;
int main(){
int a,b; cin >> a >> b;
int x_l = ceil(a / 0.08);
int y_l = ceil(b / 0.1);
int x_u = ceil((a+1) / 0.08);
int y_u = ceil((b+1) / 0.1);
vector<... | #include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(void) {
int N, K;
scanf("%d %d", &N, &K);
int d[100];
int A[100][100];
int sunuke[100] = {0};
for (int i = 0; i < K; i++) {
scanf("%d", &d[i]);
for (int j = 0; j < d[i]; j++) {
scanf("%d", &A[i][j]);
sunuke[A[i][j] - 1]++... | 0 | 59,528,019 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7;
int n, k, ans, dp[N];
ll sub(int a, int b){
return (((a - b) % mod) + mod) % mod;
}
int add(int a, int b){
return (a + b) % mod;
}
int mul(int a, int b){
... | 0 | 46,591,205 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
string a, b;
cin >> a >> b;
if (a == "H") {
if (b == "H")
cout << "H"... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 67,743,238 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
for (int i = 0; i... | 0 | 12,319,564 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #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>
#... | 0 | 16,058,527 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) { for (int i = 0; i < n; ++i) par[i] = i; }
void init(int n) { par.resize(n); for (int i = 0; i < n; ++i) par[i] = i; }
int root(int x) {
if (par[x] == x) retu... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | 0 | 65,131,185 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int ... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
ll AN(ll A, ll N){
if (N ... | 0 | 69,196,228 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll minimum;
ll frog(ll *A,ll n,ll k)
{
ll ans=0,p=0;
ll t[n+1];
for(int i=0;i<=n;i++)
t[i]=INT_MAX;
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3&&k>=2)
{
for(int j=i-1;j>=max(i-k,p... | 0 | 89,904,700 |
#include <iostream>
#include <functional>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (char i : {'S', 'W'}) {
for (char j : {'S', 'W'}) {
string result(n, 0);
result[0] = i;
result[1] = j;
for (int k = 2; k < n; k++) {
... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 5100
#define MOD 1000000007
typedef long long ll;
typ... | 0 | 39,060,900 |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXL 8005
char S[MAXL];
vector<int> v[2];
bool dp[MAXL][MAXL];
int main() {
int L;
int x[2];
scanf("%s%d%d", S, x, x + 1);
for(L = 0; S[L]; L++);
int c = 0, lt = L;
for(int i = L - 1; i >= 0; i--) if(S[i] == 'T') {
v[c].push_... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;
cin>>n;
rep(i,999){
int a=n/1... | 0 | 92,377,544 |
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;
cin >> n;
multiset<int> s;
for(int i = 0; i < n; i++){
int x; cin >> x;
s.insert(x);
}
int diam = *s.rbegin();
bool even = diam%2==0;
int to = diam/2+1;
while(diam >= to){
bool valid = s... | #pragma region header
#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>
#inc... | 0 | 11,378,804 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'o') cnt++;
}
if (15 - n + cnt < 8) cout << "NO" << endl;
else cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define rep(i,n,z) for(int i=z;i<n;i++)
#define rrep(i,z) for(int i=z;i>=0;i--)
#define nl cout<<endl
#define vi vector<int>
#define vlli vector<long long int>
#define umap un... | 0 | 83,089,291 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc getchar
#define pc putchar
#define cs const
#define int ll
inline
int getint(){
re int num;
re char c;
re bool f=0;
while(!isdigit(c=gc()))f^=c=='-';num=c^48;
while(isdigit(c=gc()))num=(num<<1)+(num<<3)+(c^48);
return... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
#include<set>
using namespace std;
const long long int mod=1000000007;
const lo... | 0 | 45,065,616 |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <vector>
using namespace std;
#define LL long long
#define ri register int
template<typename T>inline void read(T& x) {
x = 0;
int f = 0;
char ch = getchar();
for (;!isdigit(ch);ch = getchar())
f |= (ch == '-');
for (;isdigit(ch... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int IN... | 0 | 3,262,993 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll INF=1e18;
int main() {
ll h, w, m;
cin>>h>>w>>m;
map<P,ll> v;
vector<ll> H(h,0);
vector<ll> W(w,0);
vector<ll> H1;
vector<ll> W1;
ll maxh=0;
ll maxw=0;
rep(i,... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(0);
int a, b; cin >> a >> b;
for (int i=1;i<=1000;i++) {
int x = i*0.08, y = i*0.1;
if (x==a&&y==b) {... | 0 | 54,492,027 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#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() {
string s;
cin >> s;
cout << s.substr(0, 4) << " " << s.sub... | #include <iostream>
using namespace std;
int main(){
while(true){
string s;
string bottom;
string top;
int m;
int h;
cin >> s;
if(s=="-")break;
cin >> m;
for(int i=0; i<m; i++){
cin >> h;
bottom = s.substr(0, h);
top = s.substr(h, s.length()-h);
for(int i=0;... | 0 | 30,836,762 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
vector<vector<int>> edge;
vector<vector<ll>> dp;
ll mod = 1e9+7;
void dfs(int now, int par) {
for (int nxt : edge[now]) {
if (nxt == par) continue;
dfs(nxt, now);
dp[now][0] *= dp[nxt][0]+dp[nxt][1];
... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 0 | 21,745,420 |
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <algorithm>
#define brijesh ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
#define popb pop_back
#define l1 long long
#define vi vector<int>
#define vl vector<l1>
#define vs vector<string>
using namespace std;
int main() {
brije... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) return 0;
vector<int> V(N);
for (int i = 0; i < N; i++) {
char C, D;
cin >> C >> D;
if (C == 'l') V[i] = 0;
else V[i] = 1;
}
int ANS = 0;
for (int i = 0; i < N / 2; i++) {
ANS += V[i * 2] != V[i... | 0 | 96,098,809 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Yen;
cin >> N >> Yen;
int a, b, c;
int r = 0;
for (int i = 0; i <= N; i++) {
if (Yen == 10000*i) {
if (N == i) {
a=i, b=0, c=0;
r++;
goto SKIP;
}
}
for (int j = 0; j <= N-i; j++) {
if (j == N-i) {... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 2,495,424 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
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 all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 0 | 58,250,705 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {
IOS;
int N, D;
cin >> N >> D;
vector<vector<int>> nd_vec(N, vector<int>(D));
int cnt = 0;
for (int i = 0; i < N; i++){
for (int j = 0; j < D; j++){
int t;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define fi first
#define se second
#define pb push_back
typedef pair<int,int> P;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define abs(x) ((x)>0?(x):-(x))
const int maxn = 100205, inf = 0x3f3f3f3f;
int n;
char s[maxn];
int main()... | 0 | 1,265,637 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll m,n;
cin >> m >> n;
l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
vector<ll> v;
for(ll i = 0; i < n; ++i){
ll tmp; cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end(), greater<ll>());
ll ans = 0, f = 0;
for(ll i = 0; i < n - 1; ++i){
... | 0 | 90,422,979 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
string s;
string right="yuiophjklnm";
cin >> s;
while(s.at(0)!='#'){
vector<int> Right(s.size(),0);
for(int i=0;i<s.size();i++){
if(find(right.begin(),right.end(),s.at(i))==right.end()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define sort(s) sort(s.begin(),s.end())
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b) {
return ... | 0 | 89,738,214 |
#include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "";
for (int b = 0; b < (1 << 3); b++) {
int res = S.at(0) - '0';
string formula = to_string(res);
for (int i = 0; i < S.size() - 1; i++) {
if (b & (1 << i)) {
formula += '+';
... | 0 | 13,599,329 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
#define INF (int)1e9
#define MOD ((int)1e9+7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<vi > vvi;
typedef vector<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) * y;
}
int main() {
string S;
cin >> S;
bool hantei = false;
int n = 0;
for (int i = S... | 0 | 79,204,967 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,min_row,min_col;
cin >> H >> W >> min_row >> min_col;
string pattern0,pattern1;
for(int w=0; w<W; w++){
if(w < min_row){
pattern0+= '0';
pattern1+= '1';
}
else{
pattern0+= '1';
pattern1+= '0';
}
}
for(i... | #include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
vector<ll>adj[100005];
int m... | 0 | 29,438,312 |
#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... | #include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> p(n), a(n), b(n);
rep(i, 0, n)
{
int pp;
cin >> pp;
p[--pp] = i ... | 0 | 67,638,427 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
if ( s<t ) puts("<");
if ( s>t ) puts(">");
if ( s==t ) puts("=");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define let auto const
int main() {
i64 m, nm, nM;
while(cin >> m >> nm >> nM, m) {
vector<i64> P(m);
rep(i,0,m) cin >> P[i];
sort(all(P));
reve... | 0 | 11,228,996 |
#include <iostream>
int main(){int a,b,c,d,e,f,g,h;std::cin>>a>>b>>c>>d>>e>>f>>g>>h;a+=b+c+d;e+=f+g+h;std::cout<<(a>e?a:e)<<"\n";} | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, c... | 0 | 3,584,537 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> num(100000,0);
for(int i = 0; i < N; i++){
num.at(vec.at(i))++;
... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a;
char c;
c=getchar();
while(c != '\n'){
a.push_back(c);
c=getchar();
}
string result;
for (int i = 0; i < a.size() ; ++i) {
if(a[i]>='a' && a[i]<='z') {
result +=... | 0 | 62,798,881 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<int> alpha(26,51);
for (int i = 0; i < n; i++) {
vector<int> tmp(26);
for (char c : s[i]) {
tmp[c - '0' - 49]++;
}
for(int j = 0;... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
vector<pair<long long, long long>> ps(N, make_pair(0, 0));
vector<long long> X(N, 0), Y(N, 0);
for (long long i = 0; i < N; ++i) {
long long x, y;
cin >> x >> y;
ps[i].first = x;
... | 0 | 61,581,700 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include "bits/stdc++.h"
using namespace std;
const int mx = 2e5 + 9;
int ans[mx];
bitset <mx> mark;
vector <int> adj[mx];
void bfs(int s) {
mark[s] = 1;
queue <int> q;
q.push(s);
while (!q.empty()) {
auto u = q.front();
q.pop();
for (auto v : adj[u]) {
if (mark[v]) c... | 0 | 56,157,282 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
vector<ll> sum(n+1,0);
rep(i,n){
... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | 0 | 21,804,972 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ return a < b && (a = b, true); }
int main(){
int ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 53,689,585 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, k, sum = 1;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
int buf1 = sum * 2;
int buf2 = sum + k;
sum = min(buf1, buf2);
}
cout << sum << endl;
} | #include <iostream>
#include <string>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
string prev = "";
int ans = 0;
for(int i = 0; i < N; ++i) {
string cmd;
cin >> cmd;
if((prev == "lu" && cmd == "ru") ||
(prev == ... | 0 | 96,148,035 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RRE... | #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 ... | 0 | 7,669,313 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) {
... | 0 | 9,148,174 |
#include<iostream>
#define MAX 100
using namespace std;
int G[MAX][MAX];
void arrayInit(int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
G[i][j] = 0;
}
}
}
void input(int n) {
int m, g, k;
for (int i = 0; i < n; i++) {
cin >> m >> k;
--m;
for (int j = 0; j < k; j++) {
cin >> g;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
int main(){
ll N, M;
cin >> N >> M;
if(N > M / 2){
cout << M / 2 << endl;
}
else if(N < M / 2){
cout << N + (M - 2* N) / 4 << endl;
}
else{
cout << N << endl;
}
return 0;... | 0 | 18,875,346 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s, t;
int z = 0;
cin >> s >> t;
for (int i = 0; i < s.leng... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <utility>
#include <climits>
#include <string>
typedef long long ll;
using namespace std;
void solve(){
const int magic = 26;
int alphabet[magic];
string x;
for(int i = 0; i < magic; i++){
alph... | 0 | 89,235,487 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll h, w, a, b;
cin >> h >> w >> a >> b;
if (a > w - a || b > h - b){
cout << "No" << endl;
}
else {
for (int i = 0; i < h; i++){
for (int j =... | 0 | 36,890,377 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
string s;
int main()
{
cin >> s;
for (int i = 0; i < s.size(... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 77,178,309 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
string s;
std::cin >> s;
reverse(s.begin(),s.end());
ll ans=0;
int bcnt=0;
for (int i = 0; i < s.size() ; i++) {
if(s[i]=='B'){
ans+=i-bcnt;
bcnt++;
}
}
std... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bo... | 0 | 5,526,541 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return (a%b==0?b:gcd(b, a%b));}
int lcm(int a,int b){return a*b/gcd(a, b);}
int main()
{
int n, ans = 0, tmp = 0;
vector<int> h(100000);
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++)
{
if (h[i - 1] >=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | 0 | 3,150,037 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
ll n, a;
cin >> n;
map<ll, ll> mp;
for(int i = 0; i < n; ++i... | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
bool ask(ll x) {
cout << "? " << x << endl;
string ans;
cin >> ans;
return ans[0] == 'Y' || ans[0] == 'y';
}
void answer(ll x) {
cout << "! " << x << endl;
}
int main() {
ll po = 1;
int size = -1;
... | 0 | 98,812,257 |
#include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
long long A,B,C,D;
cin>>A>>B>>C>>D;
long long all=B-A+1;
long long su... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
struct UnionFindTree {
size_t n;
vector<int> tree;
UnionFindTree(size_t n): n(n) {
tree = vector<int>(n, -1);
}
int find_root(size_t v) {
if (tree[v] < 0) return v;
return tree[v]... | 0 | 75,706,122 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
char ch[1200];
int i, n = 0;
for(;;){
scanf("%c", &ch[n]);
if(ch[n] == '\n') break;
if('A' <= ch[n] && ch[n] <= 'Z')
ch[n] += 32;
else if('a' <= ch[n] && ch[n] <= 'z')
ch[n] -... | #include<stdio.h>
int main(void)
{
int a[5010]={};
int tr;
int i,j;
int n;
int max;
for(scanf("%d",&n);n;scanf("%d",&n))
{
for(i=0;i<5010;i++)a[i]=0;
max=0x80000000;
for(i=1;i<=n;i++)
{
scanf("%d",&tr);
a[i]=a[i-1]+tr;
}
for(i=0;i<n;i++)
... | 0 | 98,007,723 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 35,558,019 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,k;
while( cin >> n >> k,n+k){
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
}
int sum = -500000;
for(int i = 0;i < n-k+1;i++){
int s = 0;
for(int j = i;j < i+k;j++){
s += a[j];
}
sum =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, D;
cin >> H >> W >> D;
vector<int> X(H * W + 1), Y(H * W + 1);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
int A;
cin >> A;
X.at(A) = i;
Y.at(A) = j;
}
}
vector<int> d(H * W + 1);
for (int ... | 0 | 4,227,625 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
int a, b, x;
cin >> a >> b >> x;
double ad = (double) a;
double bd = (double) b;
double xd = (double) x;
if( 2 * x >= a * a * b )
{
cout << std::fixed << std::setprecision(15) << atan2( 2 * bd - 2 * xd / a... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 61,936,274 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
int main(){
string s,t;
cin >> s >> t;
for (int i = 0; i< s.size();i++){
s = s[s.size()-1]+s.substr(0,s.size()-1... | 0 | 58,366,673 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define COUT cout<<fixed<<setprecision(12)
#define CIN getline(cin,s)
ll MOD=1000000007;
void solve()
{
ll n,k;
cin>>n>>k;
ll p[n+1];
for(ll i=0;i<n;i++)
... | 0 | 12,371,819 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a==1 && b==1) {
ans=1;
}
else {
if (a>=b) {
ans=b;
for (int i=1; i<a; i++) {
ans=ans*10+b;
}
}
else {
ans=a;
... | 0 | 25,636,200 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,k,l,a,b,c,d,m,f1,f2;
cin>>a>>b>>c;
k=10000000000;
l=k-b;
l+=c;
m=k+a;
if(l<=k)
{
cout<<"delicious"<<endl;
}
else if(l>k&&l<=m)
{
cout<<"safe"<<endl;
}
else if(l>m)
... | 0 | 99,652,722 |
#pragma region include
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <cstdio>
#include <tuple>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | 0 | 66,197,083 |
#include<bits/stdc++.h>
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over retu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 92,327,986 |
#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);
}
void solve() {
int n; scanf("%d", &n);
long long ans = 0, sum = 0;
for (int a, i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
map<ll, ll> ball;
for (int i = 0; i < N; i++) {
cin >> A[i];
ball[A[i]]++;
}
ll sum = 0;
for (auto num : ball) {
if (num.second >= 2) {
su... | 0 | 40,471,628 |
#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>;
const int INF = 1 << 29;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
bool ok = true;
if (s[a] != '-') ok = false;
rep(i, a+b+1) {
if (i == a) continue;
if (!is... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 6,749,047 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define ... | 0 | 94,771,910 |
#include<stdio.h>
int main(){
int i;
char str[21];
for(i=0;;i++){
str[i]=getchar();
if(str[i]=='\n')
break;
}
for(;i>0;i--){
printf("%c",str[i-1]);
}
printf("\n");
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 91,040,621 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
string a, b, x;
int m, n;
cin >> a >> b >> m >> n >> x;
if(x == a) cout << m - 1 << " " << n << endl;
else if(x == b) cout << m << " " << n -1 << endl ;
return 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 rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
retu... | 0 | 55,764,150 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main(){
while(1){
char c;
scanf("%c",&c);
int a = atoi(&c);
if(a==0) return 0;
while(1){
scanf("%c",&c);
if(c=='\n'){ cout << a << endl; break;}
a += atoi(&c);
}
}
} | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_N (100)
#define MAX_T (200)
using namespace std;
int main(int argc, char *argv[]) {
int N, ts[MAX_N], vs[MAX_N];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &ts[i]);
}
for (int i = 0; i < N; i++) {
scanf("%d", &vs[i... | 0 | 2,418,072 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < n; i++) {
int p, q;
cin >> p >> q;
if (p <= m) {
a[m - p].emplace_back(q);
}
}
priority_queue<int> q;
int ans = 0;
for (int i = m - 1; i >= 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> a(100001, 0), b(100001, 0);
int v;
for (int i = 0; i < n; ++i) {
cin >> v;
if (i & 1) a[v]++;... | 0 | 85,450,829 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int ans = 0;
ll size = S.size();
for (ll i = 0; i < size; i++) {
ans = (ans + (S[i] - '0')) % 9;
}
cout << (ans ? "No" : "Yes") << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60... | 0 | 23,160,894 |
#include <iostream>
using namespace std;
int main(){
int n,k;string s;cin>>n>>s>>k;k--;
for(int i = 0; n > i; i++){
if(s[k] != s[i]){
s[i] = '*';
}
}
cout << s << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
i... | 0 | 14,451,537 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 53,661,155 |
#include <cstdio>
char S[101010];
int main()
{
scanf("%s", S);
bool app[26];
for (int i = 0; i < 26; ++i) {
app[i] = false;
}
for (int i = 0; S[i] != '\0'; ++i) {
app[S[i] - 'a'] = true;
}
for (int i = 0; i < 26; ++i) {
if (!app[i]) {
printf("%c\n", (char)(i + 'a'));
return 0;
}
}
puts("None");
... | #include <iostream>
using namespace std;
int main(){
int X,Y,a=0;
cin>>X>>Y;
for(int i=0;i<=X;i++){
if((X-i)*2+i*4==Y){
a=1;
break;
}
}
if(a==1)printf("Yes\n");
else printf("No\n");
} | 0 | 50,732,376 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string shuffle(string str, int h);
int main(void)
{
while(true){
string str;
cin >> str;
if(str == "-"){
break;
}
int num_shuffle;
cin >> num_shuffle;
for(int i = 0; i < num_shuffle; i++){
int num_h;
cin >> num_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 2,148,640 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, X, M;
cin >> N >> X >> M;
ll total = 0;
ll x = X;
vector<int> indices(M, -1);
vector<int> a;
int l = 0;
while (indices[x] == -1) {
indices[x] = l;
total += x;
a.push_back(x);
x = (x * x) % M;
l++;
... | 0 | 90,800,438 |
#include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){ _;
string s,p;
cin>>s>>p;
stringstream ss;
ss<<s<<s;
if(strstr(ss.str().c_str(),p.c_str()))
cout<<"Yes"<<endl;
else
cout<<"No"<<e... | #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
string stmax(string a,... | 0 | 36,134,524 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
const ll MAX=1e5+5;
ll lcm(ll x,ll y)
{
return ((x*y)/ __gcd(x,y));
}
void test_cases()
{
ll r,d,x;
cin>>r>>d>>x;
for(ll i=1;i<=10;i++)
{
x=r*x-d;
cout<<x<<"\n... | #include <string>
#include <cmath>
#include <iostream>
using namespace std;
int main(){
double x1;
double y1;
double x2;
double y2;
double l;
double x;
double y;
cin >> x1;
cin >> y1;
cin >> x2;
cin >> y2;
x = x1 - x2;
y = y1 - y2;
l = x*x + y*y;
cout << fixed << sqrt(l) << endl;
return 0;
} | 0 | 13,922,563 |
#include <stdio.h>
#include <vector>
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
constexpr int mod = 1e9 + 7;
std::vector<int> A, B;
std::vector<std::vector<int>> DP;
int dfs(int x, int y){
if(DP[x][y] != -1) r... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 69,152,751 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
int main() {
ll a, b, k;
cin >> a >> b >> k;
if (a + b < k) {
a = 0;
b = 0;
}
else if (a < k) {
k -= a;
a = 0;
b -= k;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> P;
typedef ... | 0 | 16,359,835 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,v;
cin >> s >> v;
if(s.at(0) == v.at(2) && s.at(1) == v.at(1) && s.at(2) == v.at(0)){
cout << "YES" << endl;
}
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main () {
string S_prime, T;
cin >> S_prime >> T;
bool restorable = false;
if (S_prime.size() >= T.size()) {
for (int i = S_prime.size() - T.size(); i >= 0; i--) {
string su... | 0 | 81,035,146 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> sunuke;
for (int i=0 ; i<N ; i++)
sunuke.push_back(i+1);
vector<int> d(K);
for (int i=0 ; i<K ; i++){
cin >> d.at(i);
vector<int> A(d.at(i));
for (int j=0 ; j<d.at(i) ; j++){
cin >> A.at(j);
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int cnt[2] = {};
for (int i = 0; i < N; ++i) {
if (S[i] == '(') {
++cnt[0];
} else {
if (cnt[0]) --cnt[0];
else ++cnt[1];
}
}
for(in... | 0 | 93,587,660 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i] >> b[i];
}
Int ans = 0;
for (int i = n-1; i >= 0; i--) {
Int aa = ans + a[i];
... | #line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | 0 | 19,999,833 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
const int MOD = 1e9+7;
inline int add(int a, int b){ return (a+b)... | #include <iostream>
using namespace std;
int main(){
float a,b,c,d,e,f,g,h;
int t;
cin >> t;
while(t--){
cin >> a >> b >> c >> d >> e >> f >> g >> h;
if((d-b)/(c-a) == (h-f)/(g-e)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
re... | 0 | 55,506,107 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <limits>
using namespace std;
const double PI = 3.1415926535897932;
int
main()
{
ios::sync_with_stdio(false);
constexpr int d = numeric_limits<float>::max_digits10;
double a, b;
int C;
cin >> a >> b >> C;
double c = C * PI / 180;
... | #include <bits/stdc++.h>
using namespace std;
int mxL[200][200], mxR[200][200];
int main() {
int n, k;
cin >> n >> k;
deque<int> dq;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
dq.push_back(a);
}
vector<int> vec;
int cnt = 0;
for (int i = 1; i <= min(n, k); i++... | 0 | 36,136,960 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
ll x, y;... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 30,325,371 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int dx[] = {1, 0};
const int dy[] = {0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
for(int i = 0; i < h; i++){
string s;
cin >> s;
for(... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> V;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
set<pair<ll,int>> a;
int n,m;
cin >> n >> m;
rep(i,n){
... | 0 | 97,465,912 |
#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> a(n);
for(int i=0;i<k;i++)
{
int d;
cin>>d;
for(int j=0;j<d;j++)
{
int x;
cin>>x;
a[x-1]++;
}
}
int count=0;
f... | 0 | 29,989,040 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep_start(a,i,n) for(ll i=a;i<=n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define rev1(i,n) for(ll i=n;i>0;i-... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
vector<bool> visited;
bool can = false;
bool dfs(const vector<vector<ll>> &g, ll v, ll goal){
visited[v] = true;
for(auto next_v: g[v]){
if(next_v == goal) can = tr... | 0 | 24,960,901 |
#include <bits/stdc++.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =99999999999;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(ll a, ll b){
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 32,722,121 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
int main() {
int H1, H2, M1, M... | #include <iostream>
int *parents;
int *ranks;
int find(int x) {
if (parents[x] == x)
return x;
else
return parents[x] = find( parents[x] );
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if ( ranks[x] < ranks[y] ) {
parents[x] = y;
}
else if ( ranks[y] < ranks... | 0 | 37,108,097 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.