code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include "bits/stdc++.h"
#define REP(i, n) for(int i = 0; i < int(n); i++)
#define FOR(i,n,m) for(int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 6;
const ll LLINF = 1e18 + 1;
int main() {
int w, h; cin >> w >> h;
vector<pair<int,int>> p... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
int l[h][w];
rep(i,h) {
rep(j,w) {
if(s[i][j]=='#') l[i][j] = 0;
... | 0 | 68,492,976 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h, w, k;
long long int cnt = 0;
cin >> h >> w >> k;
vector <string> grid(h);
for (auto &i : grid) cin >> i;
for (int i = 0; i < (1 << w); ++i){
for (int j = 0; j < (1 << h); ++j){
long long int... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<string>> a(n);
while (m--) {
int x;
cin >> x; x--;
string s;
cin >> s;
a[x].push_back(s);
}
int wa = 0;
int ac = 0;
for (auto... | 0 | 11,010,487 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> A(n);
for(int i=0; i<n; ++i) cin>>A[i];
long long current=1000;
for(int i=1; i<n; ++i){
long long stocks=0;
if(A[i-1]<A[i]) stocks = current/A[i-1];
current += (A[i]-A[i-1])*stocks;
... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | 0 | 62,480,026 |
#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... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 69,238,123 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2] - A[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define itn long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rrep(i,n) for(int i=(int)(n);i>=0;--i)
#define debug(x) cout << #x << "=" << (x) << endl;
const ll MOD=1e9+7;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;}... | 0 | 7,467,823 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int N;cin>>N;
int ko = 0;
for(int i = 1;i<=N;i++){
for(int j = 1;j<=N;j++){
if(i*j <N){
ko++;
}
else{
break;
... | #include <bits/stdc++.h>
using namespace std;
int N, C, K;
int T[1000010];
int main()
{
cin >> N >> C >> K;
for (int i = 0; i < N; i++)
{
scanf("%d", &T[i]);
}
sort(T, T + N);
int cnt = 0;
for (int i = 0; i < N;)
{
int j = 0;
while (i + j < N && T[i+j] - T[i] <= K... | 0 | 41,695,971 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i... | 0 | 26,336,065 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> s_inverse(2*n);
for(int i=0; i<2*n; i++){
if(s[i] == 'B') s_inverse[i] += 1;
if(i % 2 == 0) s_inverse[i] += 1;
s_inverse[i] %= 2;
}
... | 0 | 81,703,372 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c,d = 0;
cin >> a >> b >> c;
if(a < b && b < c){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <iostream>
#include <cstring>
#include <algorithm>
#include <functional>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <stdlib.h>
#include <deque>
#include <cstdint>
using namespace std;
int main () {
long long int a, b, m;
cin >> a >> b >> m... | 0 | 91,494,805 |
#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 all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long acc_a[n + 1], acc_b[n + 1];
acc_a[0] = acc_b[0] = 0;
for (int i = 1; i <= n; i++) {
acc_a[i] = acc_a[i - 1] + a[i - 1];
... | 0 | 67,292,102 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string s; cin >> s;
ll len = s.size(... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 10,575,426 |
#include <bits/stdc++.h>
#define bp(x) __builtin_popcountll(x)
#define ll int64_t
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define fw(i, l, r, c) for(int i = l; i <= r; i += c)
#define bw(i, r, l, c) for(int i = r; i >= l; i -= c)
#define fastio ios_base::sync_with_stdio(0); cin.t... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 40,877,294 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 52,990,950 |
#include<bits/stdc++.h>
#include <math.h>
#include <map>
#include <unordered_map>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pa... | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include<set>
#include<queue>
#include <iomanip>
typedef long long ll;
#de... | 0 | 26,991,923 |
#include<iostream>
using namespace std;
int main()
{
int i, ans = 0, X[101] = {0}, a[3];
cin >> a[0] >> a[1] >> a[2];
X[a[0]]++;
X[a[1]]++;
X[a[2]]++;
for(i=0;i<101;i++)
{
if(X[i]!=0)
ans++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<char, int>;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
ll N, A, B;
int main(){
cin >> N >> A >> B;
if(A + B - 1 > N){
cout << -1 << endl;
... | 0 | 71,239,982 |
#include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
int res[20];
int numres = 0;
while(1){
cin >> n;
if(n==0){
break;
}
int max = INT_MIN;
int min = INT_MAX;
int total = 0;
int read;
for(int i=0; i<n; ... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);... | 0 | 21,570,897 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int c, d;
if (a%2 == 0) {
c = a/2 * 25;
d = c+12;
} else {
d = (a+1)/2 * 25;
c = d-12;
d--;
}
int e = b * 10;
int f = (b+1)*10;
bool found = false;
for (int i = c; i <= d; i++) {
if (i >= e && i < f) {
cout ... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fro(i, s, e) for (auto i = s; i <= e; ++i)
#define int long long
#define ld long double
#define fr(i, n) for (auto i = 0; i < n; i++)
#define ff first
#define pf pop_front()
#define... | 0 | 26,559,039 |
using namespace std;
#include <bits/stdc++.h>
int main()
{
int a,b,x;
cin>>a>>b>>x;
if(a<=x){
if(a+b>=x){
std::cout << "YES" << std::endl;
}
else{
std::cout << "NO" << std::endl;
}
}
else{
std::cout << "NO" << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N == 105){
cout << 1 << endl;
}
else if(N < 105){
cout << 0 << endl;
}
else{
int count = 0;
int total = 0;
for(int j = 1; j <= N; j++){
for(int i = 1; i <= N; i++... | 0 | 65,044,953 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 1e5;
const int MOD = 1e9 + 7;
class gf {
public:
int n;
gf() : n(0) {}
gf(int n) : n(n % MOD) {}
... | 0 | 191,667 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int cnt[3],k;
cin >> cnt[0] >> cnt[1] >> cnt[2] >> k;
vector<vector<ll>> cake(3);
priority_queue<pair<ll,tuple<int,int,int>>> que;
map<tuple<int,int,int>,bool> mp;
for(int i = 0; i < 3; i++)... | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a)... | 0 | 12,295,376 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> ans;
int main(){
while(1){
int n;
cin >> n;
if(n == 0) break;
bool fd = true;
bool lf = true,rf = true;
int count = 0;
for(int i = 0;i < n;i++){
string f;
cin >> f;
if(f == "lu" || f == "ld") lf = !lf;
else ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; int64_t k;
cin >> n >> k;
vector<pair<int, int>> p(n);
for (auto i = 0; i < n; i++) {
int a, b; cin >> a >> b;
p[i] = {a, b};
}
sort(p.begin(), p.end());
int64_t sum = 0;
for (auto i = 0; i < n; i++) {
... | 0 | 79,515,987 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char i : n) {
int digit = i - 48;
if (digit == 9)
cout << "1";
else if (digit == 1)
cout << "9";
}
cout << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define Mod(n) n % 1000000007
const int dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
int main()
{
int N;
cin >> N;
double sum = 0;
double x;
string u;
for(int i = 0;i < N;i++)
{
cin >> x >> u;
... | 0 | 91,099,639 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int n , k;
int main()
{
_FastIO;
cin >> n;
vector<bool> used(300 , false);
for(int i = 0; i <= 25; i++){
for(int... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> fridge(a), microwave(b);
int minf = 1e6, minm = 1e6;
for(int i=0; i<a; i++){ cin >> fridge[i]; minf = min(minf, fridge[i]); }
for(int i=0; i<b; i++){ cin >> microwave[i]; minm = min(minm, micr... | 0 | 6,189,326 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
ll n,k,s;
cin >> n >> k >> s;
ll INF = pow(10,9);
if(s==INF) INF--;
rep(i,n){
if(i<k) cout<<s<<" ";
else cout<<INF<<" ";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, a, n) for(int i=a; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
int sum=0;
vector<int> a(n);
for(int i... | 0 | 6,320,029 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | #include <bits/stdc++.h>
using namespace std;
long long numberOfDivisor(long long n){
long long cnt = 0;
for (long long i=1; i*i <= n; ++i) {
if (n%i==0) {
cnt++;
if (n/i != i) cnt++;
}
}
return cnt;
}
int main() {
int N; cin >> N;
int res = 0;
for (i... | 0 | 71,007,126 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int a, b, n, m, test;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
cin >> n >> m;
vector<vector<int>> v(... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define INF (int)1e9
typedef long long int int64;
void print() {
cout << endl;
}
void print(const char* s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(char s, bool endli... | 0 | 51,417,218 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int> p(M),y(M);
for(int i=0;i<M;i++){
cin>>p[i]>>y[i];
p[i]--;
}
vector<vector<int>> task(N);
for(int i=0;i<M;i++){
task[p[i]].push_back(y[i]);
}
for(int i=0;i<N;i++){
sort(task[i].begin(),task[i].end(... | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn = 1e6+10;
const ll inf = 1e14;
struct node{
ll x,y;
}r[1100];
bool cmp(node a,node b){
return atan2(a.y,a.x) < atan2(b.y,b.x);
}
int main(){
ll n,x,y;
cin >> n;
for(ll i = 0; ... | 0 | 81,268,949 |
#include<iostream>
using namespace std;
#define N 5
void Swap(int *a,int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
void BabbleSort(int *a){
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(a[j] >= a[j-1]){
Swap(&a[j],&a[j-1]);
}
}
}
}
int main(){
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
Babbl... | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstr... | 0 | 67,225,829 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i = 0;i < (n); ++i)
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
typedef long long ll;
typedef long double la;
using namespace std;
int main(){
string s;
c... | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pf push_... | 0 | 20,660,928 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> a(n), b(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
}
if(a > b) swap(a, b);
int ans = 0;
do {
if(a == b) break;
... | 0 | 34,103,439 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(){
int N;
vector<int> As(200010);
cin >> N;
As.resize(N);
for (int i = 0; i < N; i++) {
cin >> As[i];
}
vector<int> Cs(N);
copy(As.begin(), As.end(), Cs.begin());
sort(Cs.begin(), Cs.end());
for... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | 0 | 89,400,327 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | 0 | 96,956,224 |
#include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int main... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
bool fA = false;
bool fB = false;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A') {
fA = true;
}
else if (S[i] == 'B') {
fB = true;
}
... | 0 | 62,696,457 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int a,b,c;
for(;;){
scanf("%d %d %d",&a,&b,&c);
if(a+b+c==-3){
break;
}else if(a+b>=80){
printf("A\n");
}else if(a+b>=65){
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 66,807,710 |
#include <cstdio>
#include <cstdint>
#include <vector>
using namespace std;
uint32_t n;
vector<uint64_t> h;
void solve() {
uint32_t max_cnt = 0;
for (auto i=h.begin();i<h.end();i++) {
uint32_t cnt = 0;
auto iter = i;
while (*iter >= *next(iter) && iter < h.end()-1) {
cnt++;
... | #include <iostream>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <typeinfo>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main(){
int n, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
... | 0 | 34,088,623 |
#include <iostream>
using namespace std;
int main(){
long long int n,ans=1;
cin>>n;
for(int i=n;i>0;i--){
ans=ans*i;
}
cout<<ans<<endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long cnt5(long long n){
long long ret = 0 ;
while(n){
n/=5;
ret+=n;
}
return ret;
}
int main()
{
long long n;
cin >> n;
if(n%2)
cout << 0 << endl;
else{
long long sum = cn... | 0 | 32,664,035 |
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using namespace std;
int main () {
int n,k;
vector <int> a;
cin >> n >> k;
for (int i=0;i<n;i++) {
int m;
... | #include <bits/stdc++.h>
using namespace std;
int A[3][3];
int is_bingo(){
int i,j;
for(i=0;i<3;i++){
if(A[i][i]!=0)break;
if(i==2)return 1;
}
for(i=0;i<3;i++){
if(A[i][2-i]!=0)break;
if(i==2)return 1;
}
for(i=0;i<3;i++){
for(j=0;j<3;j++){
if(A... | 0 | 35,618,672 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s, s2;
ll k;
cin >> s >> k;
int n = s.size();
s2 = s + s;
if (n == 1) {
cout << k / 2 << endl;
return 0;
} else if (all_of(s.begin(), s.end(),... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
void add(ll &a, ll b)
{
a = (a+b) % MOD;
}
ll mod_pow(ll x, ll n)
{
ll res = 1;
while(n > 0)
{
if(n & 1) res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
int main()
{
ll ... | 0 | 28,862,059 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 20,391,638 |
#include<iostream>
using namespace std;
#include<string>
int main()
{
string str, order, w;
int q, i, j, a, b;
cin >> str;
cin >> q;
for(i = 0; i < q; i++){
cin >> order;
cin >> a >> b;
if(order == "print"){
cout << str.substr(a, b - a + 1) << endl;
}else ... | #include <bits/stdc++.h>
#define ST_ARR_LEN(array) (sizeof(array)/sizeof(*array))
#define MOD 1000000007
using namespace std;
using ll = long long;
const ll MAX = LLONG_MAX;
const ll MIN = LLONG_MIN;
typedef stack<ll> llStack;
typedef queue<ll> llQueue;
typedef vector<ll> llVector;
typedef list<ll> llList;
typedef stru... | 0 | 59,354,265 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1')cout << 9;
else if (s.at(i) == '9')cout << 1;
else cout << s.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
ll N,K;
cin>>N>>K;
vector<pair<ll,ll>>A(N);
rep(i,N){
cin>>A[i].first;
ci... | 0 | 72,323,663 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
typedef vector<pp> vpp;
#define trace(...) __f(#__VA_ARGS__,... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss ... | 0 | 53,406,249 |
#include<stdio.h>
int main(){
int n;
scanf("%d" , &n);
if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {
puts("Yes\n");
}
else{
puts("No\n");
}
return 0;
} | #include <stdio.h>
#include<math.h>
#include <string.h>
#include <ctype.h>
int main(){
int i,n;
int max,a[100]={0};
while(scanf("%d",&n)!=EOF){
a[n]++;
}
max=0;
for(i=0;i<100;i++){
if(max<a[i]){
max=a[i];
}
}
for(i=0;i<100;i++){
if(a[i]==max){
printf("%d\n",i);
}
}
return 0;
} | 0 | 84,794,918 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
int main(){
int n; cin>>n;
vector<ll>A(n);
rep(i,n){
cin>>A[i];
if (A[i]==0){
cout << 0;
return 0;
}
}
ll ans = A[0];
for(int i=1; ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e12
#define mo 1000000007
ll dp[101][100001];
ll a[101];
ll n,k;
ll solve()
{
for(ll j=0;j<=a[1];j++)
{
dp[1][j] = (j<=a[1])?1:0;
}
for(ll i=2;i<=n;i++)
{
for(ll j=0;j<=k;j++)
{
if(j==0)
{
dp[i][j] = dp[i-1][j];
}
... | 0 | 84,428,002 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
cout << 9*max(A,max(B,C)) + A + B + C << endl;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 | 53,869,536 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,count=0;
cin >> a >> b >> c >> d;
for(int i=0;i<=100;i++){
if(a<=i&&i<b&&c<=i&&i<d)count++;
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
#include <iomanip>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 +... | 0 | 61,005,181 |
#include <iostream>
#include <queue>
using namespace std;
int D[110]={};
int R[110][110]={};
int n,a,b,k;
void bfs(int src){
queue<int> Q;
Q.push(src);
D[src] = 0;
while (! Q.empty()) {
int cur = Q.front();
Q.pop();
for(int dst=1;dst<n+1;dst++){
if(R[cur][dst]==1 && D[dst]==0){
D[dst] =D[cur]+1;
Q.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV... | 0 | 40,879,643 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define dl double
#define PB push_back
#define MP make_pair
#define PPB pop_back
#define FI first
#define SE second
#define IN insert
#define ER erase
#define clean cout.flush()
#define PF push_front
#define PP pop
... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 7,710,243 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long int;
using vec = vector<ll>;
using P = pair<int,int>;
const int INF = 1e9+7;
int main() {
int n;
cin >> n;
vec a(n+1), l(n+1), u(n+1), b(n+1);
rep (i,n+1) {
... | 0 | 46,087,470 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int h, w;
int i, j;
cin >> h;
cin >> w;
while (h != 0 || w != 0){
for (i = 0; i < h; i++){
if(i+1!=1&&i+1!=h){
for (j = 0; j < w; j++){
if(j+1==1||j+1==w)cout << "#";
... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | 0 | 75,528,762 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> vec(N);
rep(i,N){
cin >> vec[i];
vec[i] -= (... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
string a, b; cin >> a >> b;
int cnt=2*n;
for(int i=0; i<n; i++){
string s1 = a.substr(i);
string s2 = b.substr(0, n-i);
if(s1!=s2) continue;
cnt = 2*i+(n-i);
break... | 0 | 58,945,800 |
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 0 | 38,931,293 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
#define rep_r(i,s,n)for(ll i=n-1;i>=s;i--)
#define repe_r(i,s,n)for(ll i=s;i<=n;i++)
static const ll MOD = 1e9 + 7;
static... | 0 | 60,431,759 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s[1000] = {0};
s[0] = a;
for (int i = 1; i < 1000; i++) s[i] += s[i - 1] + a;
rep(i, 1000) {
if (s[i] % b == c) {
... | #include <iostream>
#include <string.h>
using namespace std;
#define ll long long
const int N=2e5+5;
int a[N],b[N];
int main(){
int n,k;cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
while(k--){
int flag=0;
memset(b,0,sizeof(b));
for(int i=0;i<n;i++){
b[max(i-a[i],0)]++;
if(i... | 0 | 81,350,771 |
#include <bits/stdc++.h>
#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++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int mn = 1000;
rep(i,s.size()-2) {
mn = min((int... | #include <iostream>
#include <cstdio>
#include <cstdlib>
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++)
#define MAXLEN 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int n; scanf("%d", &n);
int C[VMAX + 1];
A = (unsigne... | 0 | 77,192,202 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
#define mx 1000000007
#define ll long long int
using namespace std;
int n,k;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>> n;
int arr[n+1][4];
for(int i=1;i<=n;++i)
cin>> arr[i][1] >> arr[i][2] >> arr[i][3] ;
int dp[n+1][4]={0};
dp[n][0]=max(... | 0 | 86,435,116 |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using ll=long long;
int main() {
int N,M; cin>>N>>M;
priority_queue<int> q;
for (int i = 0; i < N; i++){
int A; cin>>A;
q.push(A);
}
for (int i = 0; i < M; i++){
if(q.size()){
int tmp=q.top();
... | #include <stdio.h>
int main(void){
int i,n,k;
while(scanf("%d%d",&n,&k),n,k){
int max=0,temp=0;
int val[100000]={0};
for(i=0;i<n;i++){
scanf("%d",&val[i]);
temp+=val[i];
if(i>=k)temp-=val[i-k];
if(i>k-1 && temp>max)max=temp;
}
printf("%d\n",max);
}
return 0;
} | 0 | 45,805,766 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int... | #include <bits/stdc++.h>
using namespace std;
const int MAX=105;
const long long int INF=(1LL<<32);
long long int D[MAX][MAX];
int N;
void floyd(){
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
if(D[i][k]==INF) continue;
for(int j=0;j<N;j++){
if(D[k][j]==INF) continue;
... | 0 | 54,846,380 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N;
cin >> N;
ll dp[3][100010];
for(int i=0;i<N;i++){
int a,b,c;
cin >>a>>b>>c;
if(i==0){
dp[0][i]=a;
dp[1][i]=b;
dp[2][i]=c;
}
else{
dp[0][i]=max(dp[1][i-1],dp[2][i-1])+a;
dp[1][i]=... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 58,353,655 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
char e,f,g;
cin >>a>>b>>c;
e = a.at(0) - 32;
f = b.at(0) - 32;
g = c.at(0) - 32;
cout << e<< f << g<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
typedef long long ll;
int main(){
int k,n;
cin >> k >> n;
vector<int> a(n);
rep(i, n){
cin >> a.at(i);
}
int maxa = 0;
rep(i, n-1){
int tmp = a.at(i+1) - a.at(i);
if(tmp>maxa) maxa ... | 0 | 79,484,314 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a... | 0 | 48,997,891 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 80,988,554 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
vector<pair<long long,long long> >v;
vector<long long>vx,vy;
int main()
{
long long c,d,e,l,g,n,k,i,j,t,p,q,x,y,x1,y1,x2,y2;
long long f=4000000000000000005,a,b,m;
... | 0 | 65,396,150 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <iomanip>
#include <fstream>
using namespace std;
inline in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
string s,t;cin >> s >> t;
vector<vector<int>> a(26),b(26);
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97].push_back(i);
}
for(int i = 0; i < s.size(); i++) {
... | 0 | 76,549,849 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,H,W,A,B,x=0;cin>>N>>H>>W;
for(int i=0;i<N;i++){
cin>>A>>B;
if(H<=A&&W<=B)x++;
}
cout<<x<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
deque<int>deq;
for(int i=0; i<n; i++){
if(i%2==0) deq.push_front(arr[i]);
else deq.push_back(arr[i]);
}
if(n%2==0){
while(deq.size()){
cout<<deq.back()<<" ";
deq.pop_back();... | 0 | 36,692,439 |
#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 =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n,r;cin >>n>>r;
ll ans;
ans=n>10?r:r+100*(10-n);
cout <<ans <<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 84,674,439 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,L,T;
int pos[N],v[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++) scanf("%d%d",&pos[i],&v[i]),v[i]=v[i]==1? 1:-1;
vector<int> fin;
for(int i=1;i<=n;i++)
fin.push_back(((pos[i]+v[i]*T)%L+L)%L);
int pos1=fin[0]... | #include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | 0 | 2,013,133 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
string s;
cin>>n>>s;
int cur=0;
int wor=0;
rep(i,0,n){
if(s[i]=='(') cur++;
else cur--;
wor=min(cur,wor);
}
rep(i,0,-wor){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
int count =0;
for (int i = 0; i < W; i++) {
bool flag = true;
for... | 0 | 84,709,982 |
#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>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
string s[maxn];
int t[maxn];
int main() {
ios_base::sync_with_stdio(fal... | 0 | 86,727,372 |
#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
using namespace std;
int k, a[123567], l = 2, r = 2;
signed main() {
cin >> k; for1(i, k)cin >> a[i];
for (int i = k; i >= 1; i--) {
if (l % a[i] != 0)l += a[i] - l % a[i];
r -= r % a[i];
if (l > r) {
cout << "-1\n"... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int gcds(vector<int> as) {
int ans = as[0];
for (int i = 1; i < (int... | 0 | 68,521,755 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<string, int> s;
for (int i = 0; i < n; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = 1;
} else {
s[tmp] ++;
}
}
int m; cin >> m;
for (int i = 0; i < m; i ++) {
... | #include <iostream>
using namespace std;
int main(){
string s;cin>>s;
int mn = 0;
int mx = s.size()-1;
int ans = 0;
while(mn < mx){
if(s[mn] == s[mx]){
mn++;mx--;
}else if(s[mn] == 'x'){
mn++;
ans++;
}else if(s[mx] == 'x'){
mx--;
ans++;
}else{
cout << -1 << ... | 0 | 95,393,804 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#de... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 0 | 24,602,659 |
#include <bits/stdc++.h>
#include <algorithm>
#include <string>
#include <list>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string S;
bool flag = true;
cin >> S;
if (S[0] != 'Y') flag = false;
if (S[1] != 'A') flag = false;
if (S[2] != 'K') flag = false;... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 0 | 49,404,093 |
#include <iostream>
using namespace std;
int main() {
string s;
getline(cin, s);
for (string::iterator it = s.begin(); it != s.end(); it++) {
char c = (char)*it;
if (isalpha(c))
if (isupper(c))
*it = tolower(c);
else
*it = toupper(c);
}
cout << s << endl;
return 0;
} | #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 | 18,557,271 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int)(x... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | 0 | 77,807,433 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 0 | 22,582,608 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << 8 - (x-400)/200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n, m;
cin >> n >> m;
vec... | 0 | 97,201,452 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)... | #include <stack>
#include <cstdio>
using namespace std;
int main(){
int s;
stack<int> stk;
while(~scanf("%d",&s)){
if(s){
stk.push(s);
} else {
printf("%d\n",stk.top());
stk.pop();
}
}
} | 0 | 82,267,249 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll H,N;cin >> H >> N;
vector<ll> A(N);
vector<ll> B(N);
ll Amax = 0;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
Amax = max(Amax,A[i]);
}
ll Ha = H + Amax + 1;
vector<vector<ll>> DP(N+1,vector<ll>(Ha,-1));
DP[0][0] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 30,869,290 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = ... | 0 | 39,452,839 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> l(n);
vector<int> r(n);
for(int i=0;i<n;i++)
cin>>l.at(i)>>r.at(i);
int c=0;
for(int x=1;x<=100000;x++){
for(int i=0;i<n;i++){
if(l.at(i)<=x&&x<=r.at(i)){
c++;
break;
}
}
}
cout<... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 6,758,990 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
using ll = long long ;
const int INF = 1001001001;
int main() {
int a,b,c ;
cin >> a >> b >> c ;
if(a<b) swap(a,b) ;... | #define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;}
vector<pair<ll,int>> factorize(ll n) {
vector<p... | 0 | 29,844,377 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include <bits/stdc++.h>
#define rep(i,l,r) for (int i=l,i##end=r;i<=i##end;++i)
#define per(i,r,l) for (int i=r,i##end=l;i>=i##end;--i)
#define rep0(i,r) for (int i=0,i##end=r;i<i##end;++i)
#define pr pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pb push_back
using ... | 0 | 10,636,832 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
if (a > b) {
cout << 0;
return 0;
}
if (a == b) {
cout << 1;
return 0;
}
if (n == 1) {
cout << 0;
} else if (n == 2) {
cout << 1;
} else {
cout << 1LL * (n - 2) * ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,k;
int count_bk=0,ans=0;
cin >> h >> w >> k;
vector<vector<char>>c(h+1,vector<char>(w+1));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> c.at(i).at(j);
if(c.at(i).at(j) == '#'){
count_bk++;
}
}
}
for(in... | 0 | 85,475,610 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
string in;
char list[9][6]={
{'.',',','!','?',' ','/'},
{'a','b','c','/','/','/'},
{'d','e','f','/','/','/'},
{'g','h','i','/','/','/'},
{'j','k','l','/','/','/'},
{'m','n','o','/','/','/'},
{'p','q','r','s','/','/'},
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define IN... | 0 | 77,079,438 |
#include<stdio.h>
int main()
{
int N,A;
scanf("%d %d",&N,&A);
N=N * N;
A=N-A;
printf("%d",A);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 37,298,704 |
#include <iostream>
using namespace std;
int main(){
char k;
cin >> k;
if(islower(k)){
cout << "a" << endl;
}
else{
cout << "A" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 1; i < (n); ++i )
typedef std::pair<int,int> pint;
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
string str; cin >> str;
string ans;
char tmp;
tmp = str[0];
ans[0] = tmp;
rep (i,str.length()){
if (str[i] ... | 0 | 47,876,501 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EP... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 89,942,846 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define MAXN 300003
#define MOD 1000000007
#define oo (1<<20)
#define mid ((a+b)/2)
#define pb push_back
#define sz size()
#define fastCpp() ios_base::sync_with_stdio( false ), cin.tie( NULL ), cout.tie( NULL )
using namespace std;
typedef long long ll;
typedef unsig... | 0 | 47,217,338 |
#include <iostream>
using namespace std;
int main (void) {
char a, b;
cin >> a >> b;
if (a == b) {
cout << 'H' << endl;
}else{
cout << 'D' << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int x, n;
cin >> x >> n;
set<long> p;
for (long i = 0; i < n; i++) {
long tmp;
cin >> tmp;
p.insert(tmp);
}
... | 0 | 78,480,189 |
#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... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).ren... | 0 | 58,442,919 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e6;
int d[MAXN+1];
bool prime[MAXN+1];
int n;
void sieve(){
memset(prime,true,sizeof(prime));
for(int p=2; p*p<=MAXN; p++){
if(prime[p]){
for(int i=p*p; i<=MAXN; i+=p){
prime[i] = false;
d[i]... | #include <bits/stdc++.h>
#define ll long long
#define INF 1e9
#define pb push_back
#define mp make_pair
#define loop(a,n) for(long long i=a;i<n;i++)
#define vil vector<long long int>
#define vi vector<int>
#define sz(v) v.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
usi... | 0 | 10,736,607 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(cnt,e) for(ll cnt=0;cnt<e;cnt++ )
typedef pair<ll,ll> P;
const ll mod = 1e9+7;
const ll INF = INT64_MAX;
ll i,j,k;
int main(){
ll x;
cin>>x;
if(x<1200)cout<<"ABC"<<endl;
else cout<<"ARC"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
const int N = 1e5;
int fact[N + 69], ifact[N + 69], pos[N + 69];
int n;
pair<int, int> lol;
int C(int x, int y) {
if(x < 0 || y < 0 || x < y)
return 0;
int ret = 1;
ret = (1LL * ret * fact[x]) %... | 0 | 64,496,298 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include<bits/stdc++.h>
using namespace std;
#define lop(i,n) for(ll i=0;i<n;i++)
#define lop1(i,n) for(ll i=1;i<=n;i++)
#define lopr(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long int
#define pb push_back
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '... | 0 | 61,970,496 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll n,m,i,a=0,b=0,k,t,j;
cin>>a>>b;
if(a+b==3) cout<<"3";
else if(a+b==4) cout<<"2";
else cout<<"1";
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 0 | 93,502,798 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> a;
for(int i = 0; i < s.size(); i++){
a[s[i]]++... | #include <iostream>
using namespace std;
long long fact(int n);
int main ()
{
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
long long fact(int n)
{
if(n == 1) return 1;
else if(n == 0) return 0;
return (n * fact(n - 1));
} | 0 | 61,908,713 |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int> > v(n+1, vector<int>(n+1, 0));
int a, b;
rep(i, m){
cin >> a >> b;
v[a][b] = 1;
}
vector<int> p(n);
... | 0 | 66,559,870 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (... | #include <iostream>
#include <cstdio>
#include <map>
using namespace std;
typedef long long ll;
ll n, k;
ll a[200005];
ll b[200005];
map<ll, ll> ma;
ll ans;
int main()
{
scanf("%lld%lld", &n, &k);
ma[0]++;
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
a[i]--;
b[i] = b[i - 1]... | 0 | 28,445,636 |
#include <algorithm>
#include <assert.h>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define fre freopen("0.in", "r", stdin), freopen("0.out", "w", stdout)
#define abs(x) ((x) > 0 ? (x) : -(x))
#define MOD 1000000007
#define LL signed long long int
#define ps(x) push_back(x)... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
string s;cin>>s;
for(int i=0;i<s.size();i++) {
if(s[i]=='B') {
if(i>0) {
s.erase(i-1, 2);
i-=2;
} else {
s.erase(i, 1);
i--;
... | 0 | 55,940,273 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N)), B(M, vector<char>(M));
rep(i, N) rep(j... | #include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
string S;
cin >> S;
bool a = false;
bool b = false;
bool c = false;
rep(i, S.size()) {
switch(S[i]) ... | 0 | 61,344,121 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.