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++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
string s; ... | #include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define boost() ios_base::sync_with_stdio(0), cin.tie(... | 0 | 88,593,783 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin >> N >> A >> B;
long long ans = 0;
long long AB = A + B;
ans += (N / AB) * A;
N %= AB;
if(N < A)ans += N;
else ans += A;
if(A == 0)ans = 0;
cout << ans << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#define pb push_back
#define mp make_pair
using namespace std;
template<typename T>inline void upmin(T... | 0 | 18,683,992 |
#include<iostream>
using namespace std;
static const int MAX = 100;
void selectionSort(int array[], int N){
int i,j,min,tmp;
int count = 0;
for(i = 0 ; i < N ; i++){
min = i;
for(j = i + 1 ; j < N ; j++){
if(array[j] < array[min]) min = j;
}
tmp = array[i];
array[i] = array[min];
arr... | #include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main()
{
int x;
cin >> x;
for (int i = 0; i < 8; i++)
... | 0 | 58,654,839 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void){
string s;
int n,x,y,f=0,p=0;
map<int, bool> a,b,c;
cin>>s>>x>>y;
n=s.length();
b[0]=true;
for(int i=0;i<n;i++){
if(s[i]=='F'){
f++;
}
if(s[i]=='T'||i==n-1){
... | #include<cstdio>
using namespace std;
#define N 1050
#define K 36
char as[N][K];
int p[N][2],n,is1,is2;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&p[i][0],&p[i][1]);p[i][0]*=-1,p[i][1]*=-1;
if((p[i][0]+p[i][1])&1)is1=1;
else is2=1;
}
if(is1&&is2){printf("-1\n");return 0;}
if(is1)
{
... | 0 | 2,398,546 |
#include <iostream>
#include <queue>
using namespace std;
int D[110]={0};
void bfs(int src,int n,int g[110][110]){
queue<int> Q;
Q.push(src);
D[src]=0;
while (! Q.empty()){
int cur =Q.front();
Q.pop();
for(int r=0;r<n;r++){
if (g[cur][r]==1&&D[r]==0){
D[r]=D[cur]+1;
Q.push(r)... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<... | 0 | 63,528,032 |
#include<iostream>
#include <map>
using namespace std;
int main()
{
string wordMax;
map<string, int> n;
map<string, int>::iterator i, nMax;
string a;
wordMax = "";
while (cin>>a) {
if ( n.count(a) ) {
n[a] ++;
} else {
n.insert( map<string, int>::value_type(a, 1) );
}
if ( a.size() > wordMax.siz... | #include<iostream>
#include<cstdio>
#include<queue>
#include<string>
using namespace std;
int main()
{
priority_queue<int> Q;
string s;
int num;
while (cin >> s) {
if (s == "end")break;
scanf("%d", &num);
if (s[0] == 'i')Q.push(num);
if (s[0] == 'e') {
printf("%d\n", Q.top());
Q.pop();
}
}
return ... | 0 | 50,207,651 |
#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 = 1e3+23;
long long x[N], y[N], z[N];
int ind[N];
void solve() {
int n, m; scan... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int k,a,b; cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK\n";
return 0;
}
}
cout << "NG\n";
} | 0 | 91,903,581 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
int n,s;cin>>n>>s;
if(s % 1000 != 0) {
printf("-1 -1 -1\n");
} else {
s /= 1000;
bool flg = false;
for(int i = 0;i <= 20000;i++) {
for(int j = 0;j <= 10000;j++) {
... | #include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int N ;
std::cin >> N;
std::vector<int> W(N);
std::vector<int> diff(N);
for(int i=0; i<N; i++) {
std::cin >> W[i];
}
for(int t=0; t<N; t++) {
for(int i=0; i<=t; i++) {
diff[t] += W[i];
}
for(int i=t+1; i<N; i++) ... | 0 | 89,726,541 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <utility>
#include <iterator>
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
vector<int64_t> A(k);
copy_n(istream_iterator<int64_t>(cin), k, A.begin());
auto check = [&](int64_t n, bool s){
for (const auto &a: A)
n = n / a * a;
return s ? n >= 2 : n <= 2;
};
int64_t... | 0 | 60,700,163 |
#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>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
typedef pair<int,int> pa;
int fa[200],p[200][200],vis[200];
vector<int>ve[200];
int a[200],b[200],c[200],d[200];
int dfs(int x)
{
for (auto v:ve[x]){
if(!vis[v]){
vis[v]=1;
i... | 0 | 15,006,634 |
#include<bits/stdc++.h>
#define flash() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sc1i(a) scanf("%d",&a)
#define sc2i(a,b) scanf("%d %d",&a,&b)
#define sc3i(a,b,c) scanf("%d %d %d",&a, &b, &c)
#define p1i(a) printf("%d\n",(a))
#define p2i(a,b) printf("%d %d\n",(a), (b))
#d... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | 0 | 83,521,945 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string O,E;
cin >> O >> E;
for(int i=0;i<O.size();++i){
cout << O.at(i);
if(i < E.size()) cout << E.at(i);
}
cout << endl;
return 0;
} | #include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
while (std::cin >> n) {
int cnt = 0;
for (int i = 0; i < 10; ++i)
for (int j = 0; j < 10; ++j)
for (int k = 0; k < 10; ++k)
for (int l = 0; l < 10; +... | 0 | 65,641,295 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
S.pop_back();
while (S.size()) {
if (S.size() % 2) {
S.pop_back();
}
else {
string a, b;
a = S.substr(0, S.size() / 2);
b = S.substr(S.size() / 2);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 41,184,800 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main()
{
string s;
int num;
priority_queue<int> Q;
while (cin >> s && s != "end") {
if (s == "insert") {
cin >> num;
Q.push(num);
}
else if (s == "extract") {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin>>n;
vector<long>a(n),b(n);
rep(i,n){
cin>>a.at(i);
}
rep(i,n){
cin>>b.at(i);
}
long ta=0;
long tb=0;
rep(i,n){
... | 0 | 69,514,446 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
int K,A,B; cin >> K >> A >> B;
if(A%K==0 || B%K==0){
cout << "OK" << endl;
}else if(A/K < B/K){
cout << "OK" << endl;
}else{
cout << "NG" << endl;
}
} | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vecto... | 0 | 67,501,254 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int test[12345678][2], aa[1234][1234], bb[1234][1234];
signed main() {
int n, m = 0, k, z = 0, cnt = 1, ans = 0;
cin >> n >> k;
if (k > (n - 1)* (n - 2) / 2) { cout << -1 << endl; return 0; }... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.141592653589793238462643383279502884L
#define make_unique(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#... | 0 | 58,388,413 |
#include<bits/stdc++.h>
const int MN=200000+5;
using namespace std;
typedef long long ll;
template<typename T>inline T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
return in*=f;
}
int n;ll ans=1;
int nxt[MN],to[MN],h[MN],cnt,w[... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int a=s[0]-'0',b=s[1]-'0',c=s[2]-'0';
int d=s[3]-'0';
for(int i=0;i<8;i++){
int sum=0;
sum=sum+a;
if(i&(1<<0)){
sum=sum+b;
}
else{
sum=sum-b;
}
if(i&(1<<1)){
sum=sum+c;
}
... | 0 | 3,085,949 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int h,w,k,ans=0;
cin >> h >> w >> k;
char mp[h][w];
rep(i,h)rep(j,w) cin >> mp[i][j];
rep(i,1<<h){
bitset<6> s(i);
rep(j,1<<w){
int cnt = 0;
bits... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll h, w;
cin >> h >> w;
vector < string > s(h);
for(int i = 0; i < h; i++) cin >> s[i];
vector < vector < ll > > d(h, vector < ll > (w, 1e18));
queue < pair < ll, ... | 0 | 47,511,303 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | 0 | 85,429,302 |
#include <iostream>
#include <iomanip>
#include <complex>
using namespace std;
typedef complex<long double> P;
int n;
void dfs(const P& p1, const P& p2, int i)
{
if(i == n){
cout << p2.real() << ' ' << p2.imag() << endl;
return;
} else {
P p3, p4, p5;
p3 = (p2 - p1) / 3.0L + p1;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 48,345,858 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n);
vector<int> b(n);
int m = 0, mm = 0;
queue<int> mi;
for(int i=0; i<n; ++i){
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end(), greater<int>());
int f, s;
f = b[0]; s ... | 0 | 7,765,883 |
#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(){
int n;
cin >> n;
vector<double> v(n);
rep(i,n) cin >> v[i];
sort(all(v));
double ans=0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
void mark(vector<vector<bool>>& board, vector<vector<int>>& a, int bi) {
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
if (a[i][j] == bi) {
board[i][j] = true;
return;
}
}
}
}
bool check(vector<vector<bool>>& board) {
... | 0 | 71,941,935 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <cmath>
#include <cstdio>
int a, b, c; double d, s, l, f, h, t;
int main() {
scanf("%d%d%d", &a, &b, &c);
d = 1.0 * c / 180.0 * 3.14159265358979;
h = b * sin(d);
f = sqrt(b * b - h * h);
t = a + (c > 90 ? 1.0 : -1.0) * f;
s = a * h / 2.0;
l = a + b + sqrt(t * t + h * h);
printf("%.9f\n", s);
printf("%... | 0 | 63,743,235 |
#include <bits/stdc++.h>
using namespace std;
#define IOS cin.tie(0);ios::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define vvp vector<v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=998244353;
const int INF=(int)1e9;
const ll... | 0 | 32,832,071 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vp=vector<pair<ll,ll>>;
int main() {
int N;cin>>N;
ll D,A;cin>>D>>A;
vp enemy(N);
for (int i = 0; i < N; i++){
int X,H;cin>>X>>H;
enemy[i].first=X;
enemy[i].second=H;
}
sort(enemy.begin(),enemy.end())... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | 0 | 24,734,286 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(),v.end())
#define sor(v) sort(v.begin(),v.end())
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#def... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long lon... | 0 | 96,256,379 |
#include <iostream>
using namespace std;
int main(){
string x;
while (cin >> x, x != "0"){
int ans = 0;
int l = x.length();
for (int i = 0; i < l; ++i){
ans += x[i] - 48;
}
cout << ans << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | 0 | 41,611,351 |
#include<iostream>
using namespace std;
int main(){
int x,No1,No2,No3;
No1=0;
No2=0;
No3=0;
for(int i=0;i<10;i++){
cin>>x;
if(x>No1){
No3=No2;
No2=No1;
No1=x;
}else if(x>No2){
No3=No2;
No2=x;
}else if(x>No3){
No3=x;
}
}
cout<<No1<<endl<<No2<<endl<<No3<<endl;
return 0;
} | #include<iostream>
#include<vector>
int main()
{
std::vector<bool>result;
while (true)
{
double x1, y1, x2, y2, x3, y3, xp, yp;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp;
if (!std::cin)
{
break;
}
double k = ((x2 - x3)*(y3 - y1) - (x3 - x1)*(y2 - y3)) / ((x2 - x3)*(yp - y1) - (xp - x1)*... | 0 | 24,790,102 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #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... | 0 | 51,994,018 |
#include <iostream>
#include <vector>
int main(int argc, char **argv)
{
while(true){
std::vector<int> bef;
std::vector<int> aft;
int n;
std::cin >> n;
if(n==0){
break;
}
for(int i = 0; i < n; i++){
char input;
std::cin >> input;
bef.push_back(input);
std::cin >> input;
aft.push_back(input);
}
std:... | #include "iostream"
#include<stdio.h>
#include<cctype>
#include<string>
using namespace std;
int main()
{
string a;
int b = 0;
getline(cin, a);
while (a[b]) {
if (islower(a[b])) {
a[b] = toupper(a[b]);
}
else if (isupper(a[b])) {
a[b] = tolower(a[b]);
}
b++;
}
cout << a<<endl;
} | 0 | 34,207,331 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,l;
cin>>n>>l;
vector<string> v(n);
for(int i=0;i<n;i++)cin>>v[i];
sort(v.begin(),v.end());
for(auto it=v.begin();it != v.end();it++)cout<<*it;
return 0;
} | #include <stdio.h>
#include <string.h>
#define INF 0x3f3f3f
#define M
int map[15][15], sum;
int min(int a, int b)
{
return a < b ? a : b;
}
int zdl(int start)
{
int list[13];
bool next[13];
memset(next, false, sizeof(next));
for(int i=0; i<=sum; i++)
{
list[i] = map[start][i];
}
next[start] = true;
int ans ... | 0 | 78,412,959 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a!=b&&a!=c)
cout << a << endl;
if(b!=a&&b!=c)
cout << b << endl;
if(c!=b&&c!=a)
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
const int mod = 1000000007;
int n;
cin >> n;
string s;
cin >> s;
vector<ll> counter(26, 0);
rep(i, n) {
counter[s[i] - 'a']++;
}
ll ans = 1;
re... | 0 | 51,841,257 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<ll> a(n), b(n);
ll ans = 0;
rep(i,n) cin >> a[i] >> b[i];
for (int i = n-1; i>=0... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if(x>y)swap(x,y);
for(int i=x; i >= 1; i--){
if(i == 1)return 1;
else if( x % i == 0 && y % i == 0)return i;
}
}
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++)cin >... | 0 | 12,849,113 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
int Fnum, Snum;
vector<char> before, after, sent;
char wk, tk;
while(cin >> Fnum)
{
if(!Fnum) break;
for(int i = 0; i < Fnum; i++)
{
cin >> wk >> tk;
before.push_back(wk); after.push_back(tk);
}
cin >> Snum;
fo... | #define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define sobr(v) v.rbegin(),v.rend()
#defi... | 0 | 99,002,563 |
#include <iostream>
int main() {
int m, f, r;
do{
std::cin >> m >> f >> r;
int sum = m + f;
if(m == -1 || f == -1){
if(m == -1 && f == -1 && r == -1){
}
else{
std::cout << 'F' << std::endl;
}
}
else if(sum >= 80){
std::cout << 'A' << std::endl;
}
else if(sum >= 65 && sum < 80){
std::cout << 'B' << std::endl;
}
else if(... | #include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, con... | 0 | 86,679,290 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
long n;
cin >> n;
vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++)
{
cin >> a[i];
}
vector<long> b(n);
for (long i = 0; i < n; i++)
{
cin >> b[i];
}
long ans = 0;
for (long i = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 85,235,848 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | 0 | 90,912,990 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n;
ll a[300005];
ll d[300005];
int main()
{
scanf("%lld", &n);
for(ll i = 0; i < (1 << n); i++)
{
scanf("%lld", &a[i]);
}
for(ll i = 1; i < (1 << n); i++)
{
ll t = i;
d[i] = d[i - 1];
... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typed... | 0 | 83,454,579 |
#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 arr[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K; cin>>K;
cout << arr[K-1] << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 71,925,604 |
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
const int N = 2e5 + 7;
int v[N], c[2 * N], n;
set < int > s;
bool ok(int val) {
s.clear();
for (int i = 1; i < n; ++i) {
if (v[i] > v[i - 1]) {
auto it = s.end();
if (it == s.begin())
con... | #include <stdio.h>
int main(void)
{
int a, b;
scanf("%d %d" ,&a, &b);
if (a % 2 && b % 2)
puts("Odd");
else
puts("Even");
return 0;
} | 0 | 71,170,425 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
ll a,b,c,k;
cin >> a >> b >> c >> k;
if( k%2 == 1 ){
cout << b-a << endl;
}else{
cout << a-b << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main() {
char str;
int Alpha[26] = {0};
while((str = getchar()) != EOF) {
if(str >= 'A' && str <= 'Z') Alpha[str-'A']++;
if(str >= 'a' && str <= 'z') Alpha[str - 'a']++;
}
char alpha = 'a';
for(int i... | 0 | 32,277,585 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,a,b,i;
cin>>n;
cin>>a>>b;
int p,mark[3]={0};
for (i=0;i<n;i+... | 0 | 75,057,300 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int cnt = 0;
vector< vector<ll> > ans;
vector<vector<ll>> vac;
ll vacation(int N,int i){
if(N==0){
return vac[N][i];
}
if(ans[N][i]!=-1){
return ans[N][i];
}
for(int j=0;j<3;j++){
if(i!=j){
cnt++;
ans... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s1, s2;
void solve() {
int dp[s1.size() + 1][s2.size() + 1];
for (int i = 0; i <= s1.size(); i++) {
dp[i][0] = i;
}
for (int i = 0; i <= s2.size(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= s1.size(); i++) {
... | 0 | 23,429,368 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <bits/stdc++.h>
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define rep(i, n) reps(i, 0, n - 1)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
#define per(i, n) sper(i, n - 1, 0)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int k, s;
c... | 0 | 38,244,208 |
#include <iostream>
#include <string>
#include <set>
using namespace std;
void solve()
{
int a, b, c;
set<int> d;
cin >> a >> b >> c;
d.insert(a);
d.insert(b);
d.insert(c);
cout << d.size() << endl;
}
int main()
{
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, C, K;
cin >> N >> C >> K;
vector<ll> time(N);
for (int i = 0; i < N; i++) {
cin >> time[i];
}
sort(time.begin(), time.end());
ll count = 1;
ll j = 0;
for (ll i = 0; i < N; i++) {
if... | 0 | 11,764,409 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
ll modpow(ll k, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * k % mod;
k = k * k % mod;
n /= 2;
}
return res;
}
ll choose(ll n, ll k) {
ll ... | #include <stdio.h>
#include <iostream>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
int n, m;
int INF = 9999999;
cin >> n >> m;
int c[m];
int dp[m+1][n+1];
for(int i=0 ; i<m ; i++){
cin >> c[i];
}
for(int i=0 ; i<=m ; i++){
for(int j=0 ; j<=n ; j++){
dp[i][j]... | 0 | 65,119,006 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n,a,b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i <= n; i++){
int x = i;
int sum = 0;
while(x > 0){
sum += x % 10;
x /= 10;
}
if(sum >=... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int a,ans=1000000000;
cin>>a;
vector<int> data(a);
for(int i=0;i<a;i++) cin>>data[i];
sort(data.begin(),data.end());
for(int i=data[0];i<=data[a-1];i++)
{
int sum=0;
for(int k=0;k<a;k++)... | 0 | 84,159,635 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> t(n + 1, 0), x(n + 1, 0), y(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> t[i] >> x[i] >> y[i];
}
for (int i = 1; i <= n; i++) {
int dx = abs(x[i] - x[i - 1]) + abs... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 7,732,223 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | 0 | 30,005,799 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int MAXN = 100000 + 10000;
int n, m, k;
int p[MAXN], d[MAXN];
vector<int> v1, v2;
int ans[MAXN];
int main()
{
ios::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A))/(sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
const ll MOD = 1e9 + 7;
int ... | 0 | 94,718,797 |
#include<iostream>
using namespace std;
int main(void){
int n,m;
m = 0;
while(cin >> n){
if( n <= 36) {
for(int i = 0; i <= 9; i++ ){
for(int j = 0; j <= 9; j++ ){
for(int k = 0; k <= 9; k++ ){
if(n - i - j - k >=0 ){
if(n - i - j - k <=9){
m++;
}
}
}
}
}
}
... | #include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i,f,n) for(int i=(f); i<=(n); ++i)
using namespace std;
main()
{
int N, a[2000001], maxv = 0;
scanf("%d", &N);
rep(i, N)
scanf("%d", a+i),
maxv = max( maxv, a[i] );
int cnt[maxv + 1] = {-1};
int ret[... | 0 | 67,827,114 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
#include<iomanip>
#include<map>
#include<cmath>
#include<cstdio>
#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 argc, const char * argv[]) {
vector<i... | #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 ... | 0 | 60,133,004 |
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
int N;
int INF = 1e9 + 1;
int dp[100001];
int a[100001];
int main(void){
cin >> N;
for(int i=0; i<N; ++i) cin >> a[i];
fill(dp, dp+N, INF);
for(int i=0; i<N; ++i){
*lower_bound(dp, dp+N, a[i]) = a[i];
}
cout <<... | #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;
}
int main()
{
ios_base::sync_with_stdio(false);
ci... | 0 | 63,726,204 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
const int MOD=1e9+7;
int main() {
int n,m;
cin >> n >> m;
vector<vector<ll>> s(... | 0 | 68,082,411 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> orderedSet... | #include<iostream>
#include<stdio.h>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<math.h>
#define ll long long int
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
int a[n];
int i;
int s=... | 0 | 52,896,756 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
reverse(a.begin(), a.end());
if (a.at(0) == b.at(0)) {
reverse(b.begin(), b.end());
if (b.at(0) == c.at(0)) {
cout << "YES" << endl;
}
else cout << "NO" << endl;
}
else cout << "NO" << endl;
... | #include <stdio.h>
char c[256];
void clear() {
int i; for (i = 0; i < 256; i++) c[i] = 0; }
int main() {
int n;
char f, t;
while (1) {
scanf("%d\n", &n);
if (!n) break;
clear();
while (n--) {
scanf("%c %c\n", &f, &t);
c[f] = t;
}
scanf("%d\n",... | 0 | 41,064,637 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
#include <map>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> L(N+1);
L.at(0) = 2;
L.at(1) = 1;
for(long long i=0;i<=N-2;i++){
L.at(i+2) = L.at(i+1) + L.at(i) ;
}
cout << L.at... | #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(){
int n;
cin >> n;
string s;
cin >> s;
int now = 0;
int left = 0;
int right = 0;
for (int ... | 0 | 89,646,779 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0 && S.at(i) == '1') {
a++;
}
if (i % 2 == 1 && S.at(i) == '0') {
a++;
}
if (i % 2 == 1 && S.at(i) == '1') {
b++;
}
if ... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
long long n,m; cin >> n >> m;
long long ans;
ans = 0;
bool p,q,r;
p = (n == 1);
q = (m == 1);
r = ((n == 2) || (m == 2));
if(p && q){
cout << 1 << endl... | 0 | 38,530,049 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef... | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrep... | 0 | 26,846,206 |
#include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = 303;
const int inf = (int)1e15;
int n, k, h[N], f[N][N];
i... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define M 100007
#define INF 1e9
#define INFL 1e18
#define PI acos(-1)
#define mp make_pair
int n;
int dp[100100];
int arr[100100];
int mydp(int i)
{
if(i>=n)
{
return... | 0 | 36,197,322 |
#include <iostream>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, xp, yp;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
double sall = (x1-x2)*(y1+y2) + (x2-x3)*(y2+y3) + (x3-x1)*(y3+y1);
double s1 = (x1-x2)*(y1+y2) + (x2-xp)*(y2+yp) + (xp-x1)*(yp+y1);
double s2 = (x1-xp)*(y1+yp) + (xp-x3)*(yp+y3... | #include <string.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n = 0, taro_point = 0, hanako_point = 0;
char taro_card[100 + 1] = { 0 },
hanako_card[100 + 1] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> taro_card >> hanako_card;
int result = strcmp(taro_card, hanako... | 0 | 60,346,678 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
signed main(){
int ans=0;
int... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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,a,b,c;
... | 0 | 65,594,667 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct Elm
{
int val;
Elm *prev, *next;
};
Elm *nil;
void newList()
{
nil = (Elm *)malloc(sizeof(Elm));
nil->next = nil;
nil->prev = nil;
}
void insert(int val)
{
Elm *x = (Elm *)malloc(sizeof(Elm));
x->val = val;
x->next = nil... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 15,384,174 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
map<char, int> _map = { { 'm', 1000 },{ 'c', 100 },{ 'x', 10 },{ 'i', 1 } };
int solve(string a)
{
int aa = 0;
rep(i, 0, a.length())
{
if ('1' <= a[i] && a[i] <= '9')
{
aa += (a[i] - '0') * _map[a[i + 1]];
i++;
}
else... | #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 | 20,568,074 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef long double ld;
int INF = 100100101;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h,w;
cin >> h >> w;
string s[h];
rep(i,h){
cin >> s[i];
}
rep(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 13,687,326 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d,t,s;
cin >> d >> t >> s;
if ((d / s + (d % s == 0 ? 0 : 1)) > t) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
ll l,r;
ll m = 2e9;
cin >> l >> r;
if(r-l >= 2500)... | 0 | 66,024,317 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
vector<int> to[200005];
const int MAX=1000000000;
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--;b--;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
int ans = 0;
for(int a = 0;a <= 9;a++){
for(int b = 0;b <= 9;b++){
for(int c = 0;c <= 9;c++){
for(int d = 0;d <= 9;d++){
if(a + b + c + d == n) ans++;
}
}
}
}
... | 0 | 33,918,974 |
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <vector>
#define LL long long
using namespace std;
const int N = 200010;
int n, D, A;
struct T {
int x, h;
}a[N];
LL tot[N];
int main() {
scanf("%d%d%d", &n, &D, &A);
for (int i = 1; i <= n; i++)
scanf("%d%d", &a[i].x, &a[i].h);... | #include <bits/stdc++.h>
using namespace std;
int n, sumt = 0;
vector<int> t, v;
vector<double> lim;
double solve();
int main() {
cout << fixed << setprecision(10);
cin >> n;
t.assign(n + 2, 0);
for(int i = 1; i <= n; ++i) cin >> t[i];
v.assign(n + 2, 0);
for(int i = 1; i <= n; ++i) cin >> v[i];
n += 2;
... | 0 | 55,119,290 |
#include <bits/stdc++.h>
#include <boost/integer/common_factor_rt.hpp>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
map<int,int> m;
for(ll i=0;i<n;i++){
cin >> a.at(i);
m[a.at(i)]++;
}
ll ans=0;
for (auto p : m) {
auto k = p... | #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;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned lo... | 0 | 20,311,344 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char X, Y;
cin >> X >> Y;
int x, y;
if(X == 'A'){
x = 10;
}
if(X == 'B'){
x = 11;
}
if(X == 'C'){
x = 12;
}
if(X == 'D'){
x = 13;
}
if(X == 'E'){
x = 14;
}
if(X == 'F'){
x = 15;
}
if(Y == 'A'){
y = 10;... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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 bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define pb push_back
#define eb emplace_back
using na... | 0 | 96,644,376 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << min(1, a % b) << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int cnt,i,j,k,a,b,c,d,x,y;
while(~scanf("%lld %lld %lld %lld",&a,&b,&c,&d))
{
x = a*c;
if(x< a*d) x = a*d;
if(x< b*c) x = b*c;
if(x< b*d) x = b*d;
if(x<0 && ((a<=0 && b>=0) || (c<=0 && d>=0))) x =0;
... | 0 | 99,158,529 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void c... | #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
for(;;){
int n;
cin >> n;
if(!n) return 0;
char dic[256];
REP(i,256) dic[i]=(char)i;
REP(i,n... | 0 | 3,909,889 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, s;
cin >> n >> k >> s;
long long INF = 10000000000;
vector <long long> ans(n, INF);
for (int i; i < k; i ++){
ans[i] = s;
}
for (int i; i < n; i ++){
if (ans[i] == INF){
if (s == 1000000000){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void dfs(int idx, map<int, set<int>>& tree, const vector<int>& add, int add_sum, vector<int>& ans, vector<bool>& is_used)
{
if(is_used[idx]) return;
add_sum += add[idx];
ans[idx] = add_sum;
is_used[idx] = true;
for(auto i : tree[idx... | 0 | 72,161,001 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main() {
scanf("%d %d",&a,&b);
if(a-b<0) puts("0");
else printf("%d",a-b);
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 44,592,727 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,j=0;
cin>>N;
while(N>2){
N=N-3;
j++;
}
cout<<j<<endl;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_n... | 0 | 65,697,466 |
#include <iostream>
using namespace std;
int main(){
int N,M;
cin >> N >>M;
if(N%2==1){
for(int i=1;i<=M;i++){
cout << M+1-i<<" " <<M+i <<endl;
}
}else{
if(N%4==0){
int l=N-1,h=N;
for(int i=1;i<=M;i++){
cout<< l<< " " <<h<<endl;
l--;
h++;
if(i==N/4)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1e9+7
#define INF 1 << 30
#define MAX (1 << 20)
#define NINF (-(1 << 30))
#define Point pair<int, int>
#define triplet pair<pair<int, int>, int>
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NU... | 0 | 47,071,100 |
#include <iostream>
using namespace std;
int A[2000001];
int B[2000001];
int C[10001];
int main()
{
int n, m;
ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 0; i < n; ++i){
cin >> A[i];
++C[A[i]];
}
for(int i = 1; i < 10001; ++i) C[i] = C[i] + C[i - 1];
for(int i = n... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
stack<char> st;
rep(i, s.size()){
if(s[i] == '0' || s[i] == '1') st.push(s[i]);
else if(s[i] == 'B'){
if(st.empty()) continue;
else st.pop();
}
}
string ans = ""... | 0 | 78,215,583 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <pprint.hpp>
#endif
#define endl "\n";
#define pb push_back
#define md 1000000007
#define ll long long int
#define all(v) v.begin(),v.end()
ll power(ll a,ll b){ll z=1;while(b){if(b&1){z*=a;z%=md;}a*=a;a%=md;b/=2;}return z%md;}
using namespace std;
mt19937 rng(chrono::stead... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 68,796,396 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n = 0 , k = 0 ;
cin >> n >> k ;
vector<int> height(n+1), cost(n+1, INT_MAX) ;
for(int i = 1 ; i <= n ; i++)
cin >> height[i] ;
cost[1] = 0 ;
for(int i = 2 ; i <= n ;... | 0 | 2,602,016 |
#include<iostream>
#include<vector>
using namespace std;
class dj{
public:
vector<int>rank,p;
dj(){}
dj(int size){
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;++i){ p[i]=i; rank[i]=0;}
}
bool same(int x,int y){
return findset(x)==findset(y);
}
void unite(int x,int y){
lin... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 0 | 12,169,117 |
#include <iostream>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << max(max(a * c, a * d), max(b * c, b * d));
return 0;
} | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with... | 0 | 15,086,282 |
#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
ll XOR(ll n){
if(n < 0) return 0;
if(n % 4 == 0) return n;
else if(n % 4 == 1) return 1;
else if(n % 4 == 2) return n + 1;
else if(n % 4 == 3) retur... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
int A,B,C;
vector<int> l;
int ans = 1001001001;
void dfs(vector<int> d){
if(d.size()==N){
vector<int> material(3,0);
int point = 0;
for(int i=0;i<N;i++){
if(d[i]==3) continue;
if(material[d[i]]!... | 0 | 27,702,118 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s1,s2;
cin>>s1>>s2;
ll len=s1.size();
ll ans=0;
for(ll i=0;i<len;i++){
if(s1[i]!=s2[i]) ans++;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N; cin >> N;
... | 0 | 32,659,651 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi v ... | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
in... | 0 | 15,071,401 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include<set>
#include<map>
int main()
{
int n;
std::cin >> n;
std::vector<long long> a(n);
std::set<long long> sa;
std::map<long long, long long> ma;
for(int i = 0; i < n; i++) {
std::cin >> a[i];
sa.in... | 0 | 69,484,467 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | 0 | 26,209,034 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> sign(N, -1... | #include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<math.h>
#include<string>
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
int main(void)
{
string a, b;
cin >> a >> b;
int n = a.length() + 1;
int m = b.length() + 1;
vector<vector<int... | 0 | 78,751,243 |
#include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw";
else if(a==1)
cout<<"Alice";
else if(a>b&&b!=1)
cout<<"Alice";
else
cout<<"Bob";
return 0;
} | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 25,586,767 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int c,d,e,f,g,h,i,j,a,b;
cin>>c>>d>>e>>f>>g>>h>>i>>j;
a=c+d+e+f;
b=g+h+i+j;
if(a<b)cout<<b<<endl;
else cout<<a<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double sum = hypot(x2-x1,y2-y1);
printf("%lf\n",sum);
return 0;
} | 0 | 51,148,955 |
#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() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if ... | #include <iostream>
using namespace std;
bool judge(double x1, double x2, double x3, double y1, double y2, double y3, double xp, double yp)
{
if (((x2 - x1) * (yp - y2)) - ((y2 - y1) * (xp - x2)) > 0)
{
if (((x3 - x2) * (yp - y3)) - ((y3 - y2) * (xp - x3)) > 0)
{
if (((x1 - x3) * (yp... | 0 | 38,242,151 |
#include <cstdio>
typedef long long int lli;
int main()
{
lli K;
scanf("%lld", &K);
lli p = K / 50;
lli q = K % 50;
printf("50\n");
for (int i = 0; i < q; i++)
printf("%lld ", 100 - q + p);
for (int i = 0; i < 50 - q; i++)
printf("%lld ", 49 - q + p);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> is_prime(999999+1,true);
void init_prime() {
is_prime[0] = is_prime[1] = false;
for(int i=2; i<=999999; i++) {
if(is_prime[i]) {
for(int j=i*2; j<=999999; j+=i)
is_prime[j] = false;
}
}
}
int table[1000000] = {0};
int ma... | 0 | 33,284,030 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string t;
for(int i=0,l=s.size();i<l;++i){
if(i%2==0)t.push_back(s[i]);
}
cout<<t<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = (... | 0 | 76,274,488 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <iostream>
#include <iomanip>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main()
{
char a, b;
cin >> a >> b;
if (a == 'H')
{
cout << b << endl;
}
else if (b == 'H')
{
cout << 'D... | 0 | 9,318,324 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int x, n;
vector<int> p;
cin >> x >> n;
rep (i, n) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
if(find(p.begin(), p.end(), x) == p.end()) {
cout << x << e... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 92,194,903 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<algorithm>
#define N 100005
using namespace std;
struct with {
int w;
long long d;
} dt[N];
map<long long, int> chk;
int n;
int parent[N],subn[N];
long long d[N];
long long sum[N];
bool cmp(with i, with j) {
return i.d < j.d;
... | #include <iostream>
using namespace std;
struct Card{
char suit;
char value;
};
void bubble_sort(struct Card A[], int N){
Card temp;
for(int i=0; i<N; i++){
for(int j = 0; j < N - i -1; j++){
if(A[j].value > A[j+1].value){
temp = A[j];
A[j] = A[j+1];
A[j+1] = temp;
}
... | 0 | 41,017,035 |
#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 <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | 0 | 9,151,273 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
light[i].push_back(--s);
... | 0 | 84,371,639 |
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#endif
#include "bits/stdc++.h"
using namespace std;
typedef unsigned long long ll;
typedef unsigned short int st;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for(long blockTime = 0; (bloc... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,K;
cin>>n>>K;
string s;
cin>>s;
if(n==1)
{
cout<<1<<endl;
return 0;
}
vector<int>o;
for(int i=0;i<n;i++)
{
if(s[i]=='1' && i==0)o.push_back(i);
else if(s[i-1]=='0' && s[i]=='1')o.push_back(i);
}
... | 0 | 27,827,489 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
#define _GLIBCXX_DEBUG
const int INF=1e15;
signed main(){
int N,A,B;cin>>N>>A>>B;
int ac,bc,cc;
ac=bc=cc=0;
REP(i,N){
int a;cin>>a;
if(a<=A)ac+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define F... | 0 | 63,315,340 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL p[100005], q[100005];
int main() {
LL w, h;
cin >> w >> h;
for (int i = 0; i < w; i++) {
cin >> p[i];
}
p[w] = 999999999;
sort(p, p + w);
for (int i = 0; i < h; i++) {
... | 0 | 55,598,477 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.