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 (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, x, m, logn, ans = 0;
cin >> n >> x >> m;
logn = ceil(log2(n)) + 1;
vector<vector<ll>> nex(logn, vector<ll>(m)), sum(logn, vector<ll>(m));
rep(i, m) {
nex[0][i] = i * i % m;... | #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 n, d, x;
int chocolate(int a) {
return (d - 1) / a + 1;
}
int main() {
cin >> n >> d >> x;
int ans = x;
rep(i, n) {
int a; cin >> a;
ans += chocolate(a);
}
cout << ... | 0 | 87,105,996 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int X;
cin >> X;
int cnt = 0;
while (true) {
cnt++;
if((c... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 36,625,286 |
#include<stdio.h>
int main()
{
int W, H, x, y, r;
scanf("%d%d%d%d%d", &W, &H, &x, &y, &r);
if ((x>=r) && (x<=W - r) && (y >= r) && (y <= H - r))
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i=0; i<N; i++) cin >> s[i];
int AB_num = 0, c1 = 0, c2 = 0, c3 = 0;
for ... | 0 | 86,810,305 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main(){
ll n, x;
cin >> n >> x;
ll a;
... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 66,208,208 |
#include<iostream>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n;
int m=10000000;
cin>>n;
if(n==0)break;
int s[n];
for(int i=0;i<n;i++){
cin>>s[i];
}
sort(s,s+n);
for(int i=0;i<n-1;i++){
if(s[i+1]-s[i]<m){
m=s[i+1]-s[i];
}
}
cout<<m<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define ll long long
#define ld double
#define pb push_back
#define mod 998244353
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using na... | 0 | 18,227,234 |
#include<iostream>
using namespace std;
int main(){
int cou = 1;
int n;
while(1){
cin >> n;
if(n==0) break;
cout <<"Case"<<" "<<cou<<":"<<" "<< n<< endl;
cou++;
}
return 0;
} | #include <iostream>
using namespace std;
int P[10010];
int n,q;
int comp[100000 + 10];
int x[100000 + 10];
int y[100000 + 10];
void init(int N)
{
for(int i = 1; i <= N; ++i)
{
P[i] = i;
}
}
int root(int a)
{
if(P[a] == a)
{
return a;
}
return (P[a] = root(P[a]));
}
bool is_sa... | 0 | 19,766,325 |
#include<bits/stdc++.h>
#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 fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d,x;
string s,ss,sss;
int ans = 0;
string anss = "";
cin >> a >> b;
int ab [] = {0 , 1 ,... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
... | 0 | 28,652,378 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n,k;
string s;
cin >> n;
cin >> s;
cin >> k;
char x = s[k-1];
rep(i,n) if(s[i] != x) s[i] = '*';
cout << s << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int V; cin >> V;
vector<vector<int> > adjlist(V);
for(int i = 0; i < V; i++){
int gomi; cin >> gomi;
int k; cin >> k;
for(int j = 0; j < k; j++){
int a; cin >> a;
adjlist[i].push_back(a - 1);
... | 0 | 49,574,463 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
const int inf = 1000000000;
const ll MOD = 1e9 + 7;
int main()
{
ll n, m;
cin >> n >> m;
ll ans = 0;
... | #include<stdio.h>
#include<string.h>
#define NIL (-1)
#define m 1046527
char T[m][14];
int h1(int key) {return key%m;}
int h2(int key) {return key%(m-1);}
int getChar(char ch){
if (ch=='A') return 1;
else if (ch=='C') return 2;
else if (ch=='G') return 3;
else if (ch=='T') return 4;
else return 0;
}... | 0 | 80,602,348 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int get(int n){
string ans;
cout << n << endl;
cin >> ans;
if(ans == "Male"){
return 1;
}else if(ans == "Female"){
return 2;
}else if(ans == "Vacant"){
return 0;
}
}
int main(){
int N; cin >> N;
... | 0 | 75,167,786 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 x, y;
cin >> x >> y;
if (abs(x - y) <= 1) {
cout << "Brown" << endl;
} else {
cout << "Alice" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define mp make_pair
int aa[1005],bb[1005],cc[1005];
vector<int> v;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int a,b,c,k,lo,hi,mid,cnt,cnt2;
cin>>a>>b>>c>>k;
for(int x=0;x<a;x++)cin>>aa[x];
for(int x=0;x<b;x++)ci... | 0 | 7,588,127 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i=0; i<K; i++) {
if (i%2==0) {
if (A%2!=0) A--;
B += A/2;
A /... | #include <iostream>
#include <string>
#include <stack>
#include <map>
using namespace std;
int main() {
map<char,char> close_of;
close_of['('] = ')';
close_of['['] = ']';
while(true) {
string line;
getline(cin, line);
if(line == ".") break;
bool ok = true;
stack<c... | 0 | 64,918,743 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#de... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
t = 1;
while(t--){
ll n;
cin >> n;
ll count = 0;
ll ans =0;
while(n % 2 == 0 && n > 1)
{
n /=2 ;
count ++;
}
ans += (ll) (-1 + sqrt(1 + 8... | 0 | 69,256,792 |
#include<bits/stdc++.h>
using namespace std;
int main()
{int a,b,c;
cin>>a>>b>>c;
int q[a],w[b],n,m,k;
int ans=INT_MAX,a1=INT_MAX,a2=INT_MAX;
for(int i=0;i<a;i++)cin>>q[i],a1=min(a1,q[i]);
for(int i=0;i<b;i++)cin>>w[i],a2=min(a2,w[i]);
while(c--)
{
cin>>n>>m>>k;
ans=min(ans,(q[n-1]+w[m-1]-k));
}cout<<min(an... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int N;
cin>>N;
int h[N];
rep(i, N) cin>>h[i];
int max = h[0];
int min = h[0];
int count = 0;
... | 0 | 15,068,362 |
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
typedef vector<P> G;
inline double dot(const P& a, const P& b) { return real(conj(a)*b);}
inline double cross(const P& a, const P& b) { return imag(conj(a)*b);}
#define curr(g, i) g[i]
#define next(g, i) g[(i+1)%g.size()]
enum { OUT, ON, IN };
int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() ... | 0 | 24,235,380 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;... | 0 | 26,591,226 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#define MOD 1e9+7;
#define INF 1e17+9;
#define PI acos(-1);
using namespace std;
int main() {
long long k,a,b;
cin >> k >> a >> b;
long long first_cost=a+2-1;
long long bisk=... | #include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main(void) {
io;
int N,K,X,Y;
cin >> N >> K >> X >> Y;
long long total = 0;
for (int i = 1; i <= N; i++) {
if (i <= K) {
total += X;
} else {
... | 0 | 70,430,700 |
#include <bits/stdc++.h>
using namespace std;
long long f(long long b, long long n) {
if (b <= 1) return -1;
if (n < b) return n;
else return f(b, n / b) + n % b;
}
int A[100005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", A + i);
int res = 0;
for (int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(5);
for(int i=0;i<5;i++){
cin >> a[i];
}
vector<int> b(5);
for(int i=0;i<5;i++){
if(a[i]%10==0){
b[i]=a[i];
}
else{
b[i]=(a[i]/10+1)*10;
}
}
vector<int> c(5);
for(int i=0;i<5;i++){
if(a[i]%10==0){
... | 0 | 89,484,807 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n,k,t,d;
cin... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
long long calc_digit(long long N){
long long ans = 0;
while(N>0){
N /= 10;
ans++;
}
return ans;
}
int main(){
long long N;
cin >> N;
long long ans = INF;
for(long long A = 1; A*A <= N; A++ ){
... | 0 | 68,980,499 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1000000000100000000;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll gcd(ll x, ll y) {
return y ? __gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
return x/__gcd(x, y)*y;
}
int main() {
ll n, x; cin >> n >> x;
ll minx = x;
vector<ll> v(n + 1);
v[0] = x;
for (int i = ... | 0 | 66,995,320 |
#include <iostream>
using namespace std;
int main()
{
int a[200010];
long long int b[200010];
int N = 2;
cin >> N;
for (int i = 1; i <= N; i++)
{
cin >> a[i];
}
long long int sum = 0;
long long int m, n;
for(int j=1;j<=N;j++)
{
sum = sum + a[j];
}
m = sum;
n = sum;
long long int x[200009], y[200009];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 0 | 72,807,675 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
for (int i = A; i < 100000; i += A) {
if (i % B == C) return cout << "YES" << "\n", 0;
}
cout << "NO" << "\n";
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int NIL = -1;
const int MAX_N = 100100;
struct Node{ int parent, left, right; };
N... | 0 | 21,228,364 |
#include<stdio.h>
int main(void){
int a,b,c;
scanf("%d %d %d\n",&a,&b,&c);
if(a < b && b < c){
printf("Yes\n");
}
else{
printf("No\n");
}
} | #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<int> a(n+1), b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
r... | 0 | 18,280,046 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#def... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t kMod = 1e9+7;
int main() {
int N;
cin >> N;
vector<int64_t> nums(N);
for (int n = 0; n < N; ++n) {
cin >> nums[n];
}
vector<vector<int64_t>> cnt(2, vect... | 0 | 79,729,636 |
#include <stdio.h>
int main(void){
int n;
int b,f,r,v;
int i,j,k;
int count[4][3][10]={{{0,0,0}}};
scanf("%d\n", &n);
for ( i = 0 ; i<n ; i++ ){
scanf("%d %d %d %d\n", &b ,&f, &r, &v );
count[b-1][f-1][r-1] += v;
}
for( i = 0 ; i <4 ; i++ ){
for( j = 0 ; j < 3 ; j++ ){
for(k = 0 ; k ... | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
cin >> S;
int N = S.size();
char curr = S[0];
int ans = 0;
for (int i = 1; i < N; ++i) {
if (curr != S[i]) {
++ans;
curr = S[i];
}
}
cout << ans << endl;
}
int main() {
std::... | 0 | 75,974,048 |
#include<bits/stdc++.h>
using namespace std;
int p(int i){return i/2;}
int l(int i){return i*2;}
int r(int i){return i*2+1;}
int main(){
int h,a[300];
cin >> h;
for(int i=1;i<=h;i++)cin >> a[i];
for(int i=1;i<=h;i++){
cout << "node " << i << ": key = " << a[i] << ", ";
if(p(i)>=1)cout << "parent key = "... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 52,331,778 |
#include <bits/stdc++.h>
#include <iostream>
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--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main()
{
ll a,b, k;
cin>>a>>b>>k;
vi divs;
int m = min(a,b);
rep(i, 1, m)
if(a... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 57,058,074 |
#include <stdio.h>
int main()
{
int apple;
int piecesOfApple;
scanf("%d %d", &apple, &piecesOfApple);
int cut = apple * 3;
piecesOfApple >= 2 || apple >= 1 ? printf("%d", (cut + piecesOfApple) / 2) : printf("0");
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<doub... | 0 | 73,475,783 |
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
#define W_MAX 20
#define H_MAX 20
#define B '.'
#define R '#'
#define M '@'
char map[W_MAX][H_MAX];
int main(){
while(true){
int W,H;
cin >> W >> H;
if(W==0 && H==0) break;
pii s;
for(int i=0; ... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <cstring>
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define PI 3.141592653589793
#define ... | 0 | 15,943,889 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define bitcnt(v) __builtin_popcount(v)
#define all(v) v.... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define ll long long
#define inf 20021225
#define N 1225
using namespace std;
int read()
{
int s=0,t=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') t=-1; ch=getchar();}
while(ch>='0' && ch<='9') s=s*10+ch-'0',ch=getchar();
return s*t;
}... | 0 | 35,352,651 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define mex 1000005
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t[mex];
void update(int v, int tl, int tr, in... | #include <iostream>
#include<algorithm>
using namespace std;
int a[200005], sa[200005];
int main()
{
int n;
int max=0;
int prev = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sa[i] = a[i];
}
sort(sa, sa + n);
for (int i = 0; i < n; i++) {
if (a[i] == sa... | 0 | 93,944,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
vector<int> x(N), y(M);
int xM = -in... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | 0 | 73,376,361 |
#include<bits/stdc++.h>
#include<string>
#include<cctype>
#include<cmath>
#include<queue>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
queue <int> q1;
int n,i,j;
cin >> n;
int d[n][n];
int m[n];
int v[n];
rep(i,n){
m[i]=10000;
v[i]=0;
rep(j,n){
if(i==j){
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef vector<int> vi;
int N,M; Graph G;
void input()
{
cin>>N>>M;
G.resize(N+1);
for(int i=0;i<M;++i){
int a... | 0 | 2,101,510 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
string s;
cin>>n;
int ans=1;
for(int i=0;i<n;i++)cin>>s;
for(int i=0;i<n-1;i++){
if(s[i]==s[i+1])continue;
else ans++;
}
cout<<ans<<endl;
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
int tpoint = 0;
int hpoint = 0;
string taro, hanako;
cin >> n;
for(int i = 0; i < n; i++){
cin >> taro >> hanako;
if(taro > hanako){
tpoint = tpoint + 3;
}
else if(taro < hanak... | 0 | 6,846,515 |
#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 PP pair<P,P>
using namespace std;
ll dp[2005][2005];
ll sum[2005][2005];
int main(){
int n,m; cin >> n >> m;
int s[... | #include<iostream>
int main()
{
int k,s,x,y,z,ans=0;
std::cin>>k>>s;
for(x=0;x<=k;x++){
for(y=0;y<=k;y++){
for(z=0;z<=k;z++){
if(x+y+z==s)ans++;
}
}
}
std::cout<<ans<<std::endl;
} | 0 | 18,626,359 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define rep1(i,n)for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=(int)(n)-1;0<=i;i--)
#define rrep1(i,n) for(int i=(int)(n);1<=i;i--)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | 0 | 19,261,805 |
#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>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, y;
cin >> n >> y;
int a = -1, b = -1, c = -1;
for(int i=0; i<=n; i++) {
for (int j=0; i+j<=n; j++) {
int k = n - i - j;
int total = 10000 * i + 5000 * j + 1000 * k;
if (total == y) {
... | 0 | 14,882,583 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 256;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | 0 | 49,995,657 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){
... | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | 0 | 97,236,770 |
#include <bits/stdc++.h>
#include "atcoder/dsu"
typedef long long int ll;
using namespace std;
using namespace atcoder;
int main() {
int n, q;
cin >> n >> q;
vector<int> ans;
dsu d(n);
for (int i = 1; i <= q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d... | #include <iostream>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
const long INF = 1000000000005;
int main(){
int N, M, R;
cin >> N >> M >> R;
int r[R];
for(int i=0; i<R; i++){
cin >> r[i];
r[i]--;
}
long dp... | 0 | 96,570,888 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
string S,T;
void input()
{
cin >> S >> T;
}
void solve()
{
bool ans = true;
char P[26][1];
for(int i=0; i<26; ++i){
P[i][0] = '0';
}
for(int i=0; i<S.length(); ++i){
if(P[S[i]-'a'][0]... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 35,411,473 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int n, mx = 0, mn = 1010;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; ++i){
cin >> x.at(i);
... | 0 | 16,206,626 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string c, left, right;
int a,b;
while(cin >> c){
if(c == "-") break;
cin >> a;
for (int i = 0; i < a; ++i)
{
cin >> b;
c += c.substr(0, b);
c.erase... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int cnt = 0;
rep(i, n){
int num = i+1;
if(num%2 == 0) continue;
int div_cnt = 0;
rep(j, num){
... | 0 | 70,463,808 |
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define forn(i, n) for(int i = 0; i < int(n); ++i)
typedef pair<int, int> pii;
int H,W,A,B;
void solve(){
cin>>H>>W>>A>>B;
forn(i,B){
forn(j,A){
cout<<0;
}
forn(j,W-A){
cout<<1;
}
cout<<'\n';
}
forn(i,H-B){
forn(j,A){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,max,tmp;
string str;
max = 0;
tmp = 0;
map<string,int> B;
map<string,int> R;
cin >> N;
for(int i = 0; i < N; i++){
cin >> str;
B[str]++;
}
cin >> M;
for(int i = 0; i < M; i++){
cin >> str;
... | 0 | 13,008,848 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int main(){
int N;
cin >> N;
long long L[100];
L[0] = 2;
L[1] = 1;
rep(i, N-1){
L[i+2] = L[i+1]+L[i];
}
cout << L[N] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>>ab(n, vector<int>(2));
for (int i = 0; i < n; i++)cin >> ab.at(i).at(0) >> ab.at(i).at(1);
for (int i = 0; i < n; i++)ab.at(i).at(0) = ab.at(i).at(0) % ab.at(i).at(1);
long long ans = 0;
for (int i = n-1; i >= 0; i--) ... | 0 | 30,837,866 |
#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);... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 10,490,506 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
map<int,int> m{};
m[a] = 1;
m[b] = 1;
m[c] = 1;
cout << m.size() <<endl;
} | #include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
... | 0 | 8,985,355 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
using namespace std;
const string MCXI = "ixcm";
int MCXI2Int(string s)
{
int res = 0, tmp = 1;
for (unsigned int i = 0; i < s.size(); ++i) {
if (isdigit(s[i])) {
tmp = s[i]-'0';
} else {
if (s[i] == 'm') {
res += tmp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
int mina = INT_MAX, minb = INT_MAX;
for (auto &p : a) {
cin >> p;
mina = ... | 0 | 73,358,387 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a[i];
ll inner = 0;
for (int i=0; i<n; i++) {
for (int j=i; j<n; j++) {
if (a[i] > a[j]) inner++;
... | 0 | 32,843,013 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long a[100100];
int main()
{
int n,i;
long long ans=2,sum=2;
cin >> n;
for(i=1;i<=n;i++)
{
cin >> a[i];
}
for(i=n;i>0;i--)
{
if(ans%a[i])
{
ans/=a[i];
ans=ans*a[i]+a[i];... | #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
typedef long long ll;
int main() {
ll N,K; cin >> N >> K;
map<ll,l... | 0 | 30,742,664 |
#include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define ternary(condition, x, y) ((condition) ? x : y)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
const st... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 2000005
#define MAXA 10005
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len... | 0 | 25,288,260 |
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
for (int i=0; i<n; i++) {
int y,m,d;
cin >> y >> m >>d;
int p= y % 3;
if (p==1) {
y+=2;
}
if (p==2) {
y+=1;
}
int y... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 0 | 149,243 |
#include<cstdio>
#define rep(i,a) for(int i=0;i<(a);++i)
int N, M, P;
int main()
{
while( scanf( "%d%d%d", &N, &M, &P ), N|M|P )
{
int S = 0, cnt = 0;
rep( i, N )
{
int X;
scanf( "%d", &X );
S += X*100;
if( i == M-1 )
cnt = X;
}
S *= (100-P);
S /= 100;
printf( "%d\n", cnt?S/cnt:0 );
}
... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n,m; cin >> n >> m;
long long ac, a[n], num=0, x; cin >> a[0];
a[0]/=2;
x = a[0];
while(x % 2 == 0){
x /= 2;
num++;
}
bool ok = true;
... | 0 | 28,002,531 |
#include<stdio.h>
#include<string.h>
char a[105][3],b[105][3],c[105][3];
void squt(char a[],char b[]){
char s[105];
strcpy(s,a);memset(a,0,strlen(a));
strcpy(a,b);memset(b,0,strlen(b));
strcpy(b,s);
}
int main(){
char s;
int n,m,i,j,k,bo=1;
scanf("%d%c",&n,&s);
for(i=0;i<n;i++){
scanf("%s",a[i])... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin >> H >> W;
vector<vector<char>>grid(H,vector<char>(W));
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> grid.at(i).at(j);
}
}
for(int i = 0; i < H; i++){
bool isspace = true;
... | 0 | 35,136,674 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
using namespace std;
int main(){
string A, B; cin >> A >> B;... | #include<bits/stdc++.h>
using namespace std;
static const int MAX = 100;
static const long long INF = (1LL<<32);
int V,E;
long long d[MAX][MAX];
void floyd(){
for(int k=0;k<V;k++){
for(int i=0;i<V;i++){
if(d[i][k] == INF) continue;
for(int j=0;j<V;j++){
if(d[k][j] == INF) continue;
d[i][j] = min(d[i... | 0 | 31,518,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int w[110];
rep(i, n) {
cin >> w[i];
}
... | 0 | 18,506,449 |
#include<iostream>
#include<algorithm>
using namespace std;
int N,C,K,ans;
int main(){
cin>>N>>C>>K;
int T[N];
for(int i=0;i<N;i++)cin>>T[i];
sort(T,T+N);
for(int i=0,M=0;i<N;i++)if(T[M]+K<T[i]||i-M+1>C)ans++,M=i;
cout<<ans+1<<endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);
#de... | 0 | 76,388,267 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
vector<long long> v(n);
for(int i = 0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
long long answer = 0;
if(k >= n)
{
answer = 0;
}
else
{
for(int i = 0;i<n... | 0 | 25,674,331 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | 0 | 50,575,086 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
vector<bool> show_y(h, false), show_x(w, false);
rep(i, h) {
re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,k,c=0;
vector<int> a;
cin >> n >> k;
for(int i=0; i<n; i++){
int data;
cin >> data;
a.push_back(data);
}
sort(a.rbegin(),a.rend());
for(int i=k; i<n; i++){
c+=a[i];
}
c... | 0 | 6,256,624 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
int arr[4];
char cc... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 19,108,369 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, total = 0;cin >> N;
vector<ll> A(N);
rep(i, 0, N){
cin >> A[i];
if(i == 0)total += abs(0 - A[i]);
else total += abs(A[i] - A[... | #include<iostream>
using namespace std;
int main(){
long long n; cin >> n;
for(long long x = 1; x <= n; x++){
if((x * (x + 1)) / 2 >= n){
for(long long y = x; y >= 1; y--){
if(n >= y){
cout << y << endl;
n -= y;
}
... | 0 | 66,325,966 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nume... | 0 | 58,984,877 |
#pragma GCC optimize("O2")
#include<iostream>
using namespace std;
#define f(x,y,z) for(short int x=y;x<z;++x)
bool b[6][6], r[6], c[6];
short int h, w, k, rr[6], cc[6], m, sm, hs, ht;
char x;
void hit(short int z) {
if(z == h+w) {
sm = hs = 0;
f(i,0,h) if(r[i]) sm += rr[i];
f(j,0,w) if(c[j]... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll inf = 1LL << 60;
int main(){
cin.tie... | 0 | 90,826,130 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
string a;
cin>>a;
if(a[0]-... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >>s;
int n=s.size();
int flag=0;
for(int i=0; i<n-1; i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2 << endl;
flag++;
break;
}
}
if(flag==0){
for(int i=0; i<n-2; i++){
if(s[i]==s[i+2]){
... | 0 | 15,699,748 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int n;
cin>>n;
vector<long> a(n+1);
long b;
long ans=0;
rep(i,n+1){
cin>>a[i];
}
rep(i,n){
cin>>b;
long a1=a.at(i);
long aa=a.at(i+1);
if(a1+aa<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 92,891,144 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int N, M, i;
scanf("%d%d", &N, &M);
vector<int> H(N);
for(i = 0; i < N; i++){
scanf("%d", &H[i]);
}
vector<int> is_good(N, 1);
for(i = 0; i < M; i++){
int A, B;
scanf("%d%d", &A, &B);
A--;
B--;
if(H[A] <= H[B]){
is_good[A] = 0;
}
if(... | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 999999+1
int prime[N];
void sieve(int en) {
for(int i=2;i<=(int)sqrt(en);i++) {
for(int j=i*2;j<=en;j+=i) {
prime[j] = 1;
}
}
}
int main() {
int n;
int max_n = 2;
while(cin >> n) {
if(n > max_n) {
... | 0 | 69,586,827 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int N,M;
pair<int,int> a[100000];
int main(){
while(cin >> N >> M){
if(N==0 && M==0){
return 0;
}
else{
for(int i=0; i<N; i++){
int d,p;
cin >> d >> p;
a[i] = make_pair(p,d);
}
sort(a, a+N);
r... | 0 | 31,495,089 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans = 0, w = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
ans += i - w;
w++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll a, ll b)
{
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
int main()
{
ll N;
cin >> N;
vector<ll> T(N, 0);
for (int ... | 0 | 80,818,988 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 100000000... | #include <cstdio>
using namespace std;
int N, M;
char table[256];
char buf[10];
int main() {
for (;;) {
fgets(buf, 10, stdin);
sscanf(buf, "%d", &N);
if (N == 0) { break; }
for (int i = 0; i < 256; i++) {
table[i] = i;
}
for (int i = 0; i < N; i++) {
fgets(buf, 10, stdin);
ta... | 0 | 45,293,438 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
vector<ll> xv,yv;
int main(){
ll n,k;
cin>>n>>k;
vector<P> vec;
for(int i=0;i<n;i++){
ll x,y;
cin>>x>>y;
vec.push_back(P(x,y));
xv.push_back(x);
yv.push_b... | 0 | 89,813,455 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,i,j,t;
char ch;
cin>>ch;
if(ch=='A')
cout<<"T\n";
if(ch=='T')
cout<<"A\n";
if(ch=='C')
cout<<"G\n";
if(ch=='G')
cout<<"C\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int inf =1000000000;
int main() {
int n;
ll c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
vector<int> bus;
int l = 0;
boo... | 0 | 64,575,738 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> P={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
vector<int> count(25, 0);
int N;
cin >> N;
for(int i=0; i<25; i++){
for(int j=1; j<=N; j++){
int n=j;
int p=P.at(i);
wh... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1 && B == 2 || A == 2 && B == 1 ) {
cout << 3;
return 0;
}
if (A == 1 && B == 3 || A == 3 && B == 1 ) {
cout << 2;
return 0;
}
if (A == 2 && B == 3 || A == 3 && B == 2... | 0 | 63,020,138 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <iostream>
#include <set>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
typedef pair<int, double> Pid;
typedef pair<doub... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 66,342,030 |
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw\n";}
else if((a<b&&a!=1)||b==1)
{
cout<<"Bob\n";
}
else
{
cout<<"Alice\n";
}
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int main(void){
int in;
while(1){
int cnt=0;
cin >> in;
if(in==0)break;
in = 1000-in;
if(in>=500){
cnt++;
... | 0 | 29,742,929 |
#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 LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include<bits/stdc++.h>
using namespace std;
vector<int>p;
vector<int>rank;
void shokika(int size){
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++){
p[i]=i;
rank[i]=0;
}
}
int find(int x){
if(x==p[x])
return x;
return p[x]=find(p[x]);
}
int same(int x,int y){
if(find(x)==find(y)... | 0 | 3,842,634 |
#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()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<ll, ll> P;
int main(){
ll n;
cin >> n;
vector<ll> c(n);
vector<ll> s(n);
vector<ll> f(n);
rep(i,n-1){
cin >> c[i] >> s[i] >> f[i];
}
rep(i,n-1){
... | 0 | 50,644,789 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
string res = "No", tmp;
int size = 0;
while (size < s.size()) {
tmp = s.substr((s.size()-size), s.size());
if ((tmp + s.substr(0, (s.size()-size))) == t) {
res = "Yes";
brea... | #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 | 39,396,456 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 4,303,317 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s,r="yuiophjklnm";
int a,b,c;
while(cin>>s,s[0]!='#'){
a=-1;
c=0;
for(int i=0;i<s.size();i++){
b=r.find(s[i],0)==string::npos;
c+=a!=b;
a=b;
}
cout<<c-1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | 0 | 43,791,570 |
#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>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 82,392,180 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<vector<int> > G(n, vector<int>(n, 0));
for ( int i = 0; i < n; i++ ) {
int u, k;
cin >> u >> k;
u--;
for ( int i = 0; i < k; i++ ) {
int v;
cin >> v;
v--;
G[u][v] = 1;
... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(long long i=0;i<n;i++)
#define REP1(i,n) for(long long i=1;i<=n;i++)
#define REP2D(i,j,h,w) for(long long i=0;i<h;i++) for(long long j=0;j<w;j++)
#define REP2D1(i,j,h,w) for(long long i=1;i<=h;i++) for(long long j=1;j<=w;j++)
#define PER(i,n) for(long lo... | 0 | 30,531,330 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
map<int,int> meven;
map<int,i... | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 0 | 51,510,474 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(ll a, ll b) {
ll m = a * b;
ll r = sqrt(m) - 2;
while ( (r+1) * (r+1) < m ) r++;
ll r2 = r * (r+1) < m ? r+1 : r;
ll ans;
if ( r != r2 ) {
if ( a == r+1 && b == r+1 ) {
ans = 2 * r;
} else {
... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include ... | 0 | 6,661,551 |
#include <iostream>
using namespace std;
int main() {
struct Line{
double x1, y1, x2, y2;
};
Line l1, l2;
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> l1.x1 >> l1.y1 >> l1.x2 >> l1.y2 >> l2.x1 >> l2.y1 >> l2.x2 >> l2.y2;
if((l1.y2-l1.y1)/(l1.x2-l1.x1) == (l2.y2-l2.y1)/(l2.x2-l2.x1)) {
... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
template <typename A, typename B>
s... | 0 | 46,242,611 |
#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... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string setup(string s){
string ns = "";
for(int i=0; i<s.length(); i++){
if(s[i] == '(' || s[i] == ')' || s[i] == '[' || s[i] == ']'){
ns += s[i];
}
}
return ns;
}
int main(void){
while(1){
string line;
getline(... | 0 | 31,043,142 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | #include <iostream>
#include <string>
int main()
{
std::string str;
std::cin >> str;
int order_num = 0;
std::cin >> order_num;
for (int i = 0; i < order_num; i++) {
std::string order = "";
std::cin >> order;
if (order == "replace") {
int a = 0;
int b =... | 0 | 93,527,848 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define setA0(a) for(ull i =0;i<n;i++){a[i] = 0;}
#define aout(a) for(auto x : a){cout<<x<<' ';}
#define a... | #include <bits/stdc++.h>
using namespace std;
bool func(int n) {
string s = to_string(n);
bool b = true;
for (int i = 0, n = s.size(), h = n / 2; i < h; i++)
if (s.at(i) != s.at(n - 1 - i)) {
b = false;
break;
}
return b;
}
int main() {
int a, b;
cin >> a ... | 0 | 6,080,717 |
#include<bits/stdc++.h>
#define ll long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 5,735,474 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
int L = 0, R = 0;
cin >> a >> b >> c >> d;
L = a + b;
R = c + d;
if (L > R) {
cout << "Left" << endl;
}
else if (L == R){
cout << "Balanced" << endl;
}
else {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
int K;
cin >> S >> K;
for(int i = 0; i < K; i++) {
if(S[i] != '1') {
cout << ... | 0 | 49,612,351 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
const long long MOD = 1e9 + 7;
const int MAXH = 1000 + 5;
struct Pos {
int x;
int y;
};
int h, w;
long long dp[MAXH][MAXH];
char board[MAXH][MAXH];
void calc(int x, int y) {
if (x < 1 || y > w) {
retu... | #include <iostream>
#include <vector>
int sort(std::vector<int> &v)
{
int swapCount = 0;
int size = v.size();
for (int i = 0; i < size; ++i) {
int minj = i;
for (int j = i; j < size; ++j) {
if (v[j] < v[minj]) {
minj = j;
}
}
if (i != m... | 0 | 59,312,166 |
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <tuple>
using namespace std;
using ii = pair < int, int >;
using ti = tuple < int, int, int>;
using lint = long long;
const int N = 105;
int a[N];
ve... | #include<bits/stdc++.h>
using namespace std;
typedef string STR;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef priority_queue<int> PQI;
typedef vector... | 0 | 92,934,500 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi ... | 0 | 61,883,763 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int FindSumOfDigits(int n){
int sum = 0;
while(n > 0){
sum += n % 10;
n = n / 10;
}
return sum;
}
int main(void){
int N, A, B;
cin >> N >> A >> B;
int total = 0;
for(int i = 1;... | #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 | 99,448,131 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void ... | 0 | 91,910,834 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main(){
int H,W;
cin >> H >> W;
vector<vector<char>> map (H, vector<char>(W));
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
cin >> map.at(i).at(j);
... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define int long long
#define all(x) (x).begin(), (x).end()
signed main() {
ios::sync_with_stdio(0);
cin.sync_with_stdio(0);
cin.tie(0);
string s, t;
cin >> s >> t;
string ans ... | 0 | 33,837,039 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
string a, b;
cin >> a >> b;
int cnt = 0;
for(int i = 0; i < a.length(); i++) {
if(a[i] == b[i]) {
cnt++;
}
}
cout << cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #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(... | 0 | 12,823,307 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N,L,T;
cin >> N >> L >> T;
vector<int> X(N),W(N),X2(N);
int count = 0;
for(int i=0; i<N; i++) {
cin >> X[i] >> W[i];
if (W[i] == 1) count -= (T + X[i]) / L;
else count += (T - (X[i]+1-L)) / L;
if (... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using ... | 0 | 63,022,183 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
typedef pair<ll,ll>pll;
const ll MAX=100000;
const ll MOD=1e9+7;
vector<ll>sot,unsot;
ll f[MAX+100];
int main()
{
ll n;
cin>>n;
double ara[n+3];
for(ll i=0;i<... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 67,521,221 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <iostream>
#include <ios>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int C[10001] = {0};
int n = 0;
cin >> n;
int a = 0;
int mina = 10000;
for (int i = 0; i != n; ++i){
cin >> a;
++C[a];
if (a < mina) mina = a;
}
cout << mina;
... | 0 | 49,504,792 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.