code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int solve(const vector<vector<int>> &G) {
vector<int> conn(G.size()), del(G.size());
queue<int> Q;
for (int i = 0; i < G.size(); i++) {
conn[i] = G[i].size();
if (conn[i] == 1) Q.push(i);
}
while (!Q.empty()) {
int node = Q.front(... | #include<iostream>
using namespace std;
const int SIZE = 10;
int Sort(int A[], int N, int name) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
return A[name];
}
int main(){
int Height[10];
int sort[3];
for (int i ... | 0 | 68,567,133 |
#include <iostream>
using namespace std;
static const int N = 100;
int main(void)
{
int M[N][N];
int n, u, k, v;
std::cin >> n;
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
M[i][j] = 0;
}
}
for(int i = 0; i < n; ++i)
{
std::cin >> u >> k;
u--;
for(int j = 0; j < k; ++j)
{
std::c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n)cin >> a.at(i);
unordered_map<int ,int> cnt;
rep(i,n){
... | 0 | 76,093,056 |
#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 a,p;cin >>a>>p;
p+=3*a;
cout <<p/2<<endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
#include<unordered_map>
using namespace std; ... | 0 | 72,734,715 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i, a, b) for (int i = a; i < (b); i++)
#define FOR(i, n) for (int i = n; i >= 0; i--)
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > pack;
ll w, h;
int main(){
cin >> w >> h;
ll wholescore = 0;
REP(i, w){
... | 0 | 76,740,985 |
#include<iostream>
using namespace std;
int n,y,m,d,endD,cnt;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>y>>m>>d;
cnt=0;
while(1){
if(y==1000&&m==1&&d==1)break;
cnt++;
d++;
if(y%3==0||m%2==1){
endD=20;
}else{
endD=19;
}
if(d>endD){
d=1;
m++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 5,293,009 |
#include <iostream>
using namespace std;
int main(void){
int N,A,Z;
cin>>N>>A;
Z=N%500;
if(Z<=A){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define N 101
vector<vector<int> > dp(N, vector<int>(N));
int p[N+1];
int main(){
int n;
cin >> n;
for (int i = 1; i < n+1; i++) cin >> p[i-1] >> p[i];
for (int l = 2; l <= n; l++){
for (int i = 1; i <= n-l+1; i++){
int j = i + l - 1;
... | 0 | 95,076,236 |
#include <stdio.h>
#include <iostream>
#include <map>
using namespace std;
typedef pair<double, double> P;
bool isIn(P a, P b, P c, P p)
{
P s1(b.first - a.first, b.second - a.second);
P s2(c.first - b.first, c.second - b.second);
P s3(a.first - c.first, a.second - c.second);
P p1(p.first - a.first, p.second - a.se... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin... | 0 | 16,810,130 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | 0 | 27,626,053 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(b >= c || a >= b)
{
cout << "No" << endl;
}
else
{
cout << "Yes"<< endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int q;
cin >> q;
for (; q > 0; q--) {
ll a, b;
cin >> a >> b;
if (a * b <= 2) {
cout << 0 << endl;
continue;
}
if (a > b) {
ll t = a;
a = b;
b = t;
}
ll r = sqrt(a * b);
ll x = r + (r == a), y = r + 1 + (r... | 0 | 29,262,616 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++... | 0 | 44,049,182 |
#include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int st=A/0.08;
int ed=(A+1)/0.08;
int ans=-1;
for(int i=st;i<=ed;i++){
if((int)(i*0.08)==A&&i/10==B){
ans=i;
break;
}
}
... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 14,459,708 |
#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=1e9;
int main()
{
int n,k,s;
cin>>n>>k>>s;
if(s==MAXN)
{
for(int i=1;i<=k;i++)
printf("%d ",MAXN);
for(int i=k+1;i<=n;i++)
printf("%d ",1);
}
else {
for(int i=1;i<=k;i++)
printf("%d ",s);
for(int i=k+1;i<=n;i++)
printf("%... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> T;
for (int i = 0; i < N; ++i) {
T.push_back(S[i] - '0');
}
int cnt = 0;
for(int n = 0; n < 1000; ++n) {
int t = n / 100;
int m = (n - (100... | 0 | 74,625,213 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int P[200100];
int PMin = 200100;
int ans = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &P[i]);
if (P[i] <= PMin) ans++;
PMin = min(PMin, P[i]);
}
printf("%d", ans);
return ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3][3];
for(int i=0;i<3;i++)for(int j=0;j<3;j++)cin >> a[i][j];
int n;
cin >> n;
for(int i=0;i<n;i++){
int x;
cin >> x;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[i][j]==x)a[i][j]=0;
}
}
}
if(... | 0 | 84,640,584 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
vector<int> X(N);
vector<int> Y(N);
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> X.at(i) >> Y.at(i) >> A.at(i);
int Xl = 0;
int Xr = W;
int Yu = H;
int Yd = 0;
for (int i = 0; i < N; ++i) {
swit... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
using namespace std;
int main(void){
int h,w;
cin >> h;
cin >> w;
vector< vec... | 0 | 80,015,145 |
#include <algorithm>
#include <cstdio>
using namespace std;
int s(int x, int y) {
if (x <= y)
return y - x;
else
return x - y + 2;
}
int main() {
int x, y, res = 2000000000;
scanf("%d %d", &x, &y);
res = min(res, s(x, y));
res = min(res, s(-x, y) + 1);
res = min(res, s(x, -y) + 1);
res = min(res... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T;
T=S;
if(S=="keyence"){
cout << "YES" << endl;
return 0;
}
for(int i=0;i<S.size();i++){
for(int j=1;j<=S.size()-i;j++){
S.erase(S.begin()+i,S.begin()+i+j);
if(S=="keyence"){
cout << "YES"... | 0 | 50,316,503 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #define _GLIBCXX_DEBUG
#include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int mn = n+1, cnt = 0;
for(int i=0; i<n; i++){
int p;
cin >> p;
if(p < mn){
mn = p;
cnt++;
}
}
cout << cnt << '\n';
return 0;
} | 0 | 39,321,138 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#incl... | 0 | 49,738,124 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, pair<int, int> > p;
long long gcd(long long a, long long b) {
if(a < b) {
swap(a, b);
}
long long r = a % b;
while(r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_s... | #include<bits/stdc++.h>
#define int long long int
#define mod 1000000007
#define inf 1e18
#define fo(i,y,n,inc) for(int i=y;i<n+y;i+=inc)
#define cin(t) int t;cin>>t
#define w(t) while(t--)
#define nl cout<<endl;
#define pb push_back
#define ft(i) (i&(-1*i))
#define arrIn(arr,size) for(int i=0;i<size;i++){cin>>arr[i];... | 0 | 15,208,196 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int mi = 1145141919, ma = 0, n;
cin >> n;
int a;
for (int i = 0; i < n; ++i)
{
cin >> a;
mi = min(a, mi);
ma = max(a, ma);
}
cout << ma - mi << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define Fast_as_duck ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define forn(i,st,n) for(int i = st; i < n ; i++)
#define rev(i,st,n) for(int i = st; i >= n ; i--)
#define ss second
#define ff first
#define ll long long
typedef pair <int , in... | 0 | 12,364,049 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int ans = 0;
int N;
std::cin >> N;
vector<int> tako(N);
for(int i = 0; i < N; i++){
std::cin >> tako[i];
}
for(int i = 0; i < N-1; i++){
for(int j = i+1; j < N; j++){
ans = ans + tako[i]*tako[j];... | 0 | 41,157,080 |
#include<iostream>
using namespace std;
int main()
{
int x,N;
cin >> N;
x = N/3;
cout << x <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 0 | 53,614,422 |
#include <iostream>
#include <map>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
int main(int argc, char **argv) {
#if INPUT_FROM_FILE
std::ifstream ifs("test.txt");
#endif
int n = 0;
#if INPUT_FROM_FILE
if (!ifs.is_open()) {
std::cout << "can't open" << std::endl;
exit(0);
}
while ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<double, int, int> T;
constexpr in... | 0 | 64,092,009 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define N_MAX 50000
#define M_MAX 20
#define NIL 1000000000
int DP[N_MAX + 1][M_MAX + 1];
int C[M_MAX + 1];
int main(void){
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; i++){
scanf("%d", &C[i]);
}
for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_ba... | 0 | 97,617,424 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<vector>
#include<ctime>
#define ll long long
#define pr(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define N 2010000
struct node
{
ll to,next;
}e[N*3];
ll size,o,p,vis[N],tag[N],g[N],f,n,m,i,du[N],I,P,Q... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a,b;
cin>>a>>b;
string s,t;
for(ll i=0;i<b;i++){
char now=char(a+'0');
s.push_back(now);
}
for(ll i=0;i<a;i++){
char now=char(b+'0');
t.push_back(now);
}
if(s... | 0 | 14,783,823 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | #include <iostream>
#include <cstring>
using namespace std;
char str[33];
int main(void) {
int count;
cin.tie(0);
while (cin >> str, str[0] != '#') {
count = 0;
for (int i = 0; i < 31; i++) {
if (strlen(str) - 1 == i) break;
if ((('a' <= str[i] && str[i] <= 'g') | ('q' <= str[i] && str[i] <= 't') | ('v' <=... | 0 | 26,353,319 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const ... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragm... | 0 | 63,405,285 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
int main()
{
int n;
cin >> n;
vi data(n+1);
for(int i = 1; i <= n; ++i)
{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using mat = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll ... | 0 | 4,356,061 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int64_t N;
cin >> N;
int64_t B;
for(int64_t A = sqrt(N) + 1; A > 0; A--) {
if(N % A == 0) {
B = A;
break;
}
}
int64_t C = N / B;
cout << B + C - 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
bool mp[h*w];
string tmp;
for(int i = 0; i < h; i++) {
cin >> tmp;
for(int j = 0; j < w; j++) {
... | 0 | 95,142,293 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n,k,ans;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
... | 0 | 12,274,051 |
#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.at(i);
}
vector<long long> Acnt(N+1,0);
for(auto x: A){
Acnt.at(x)++;
}
long long s=0;
for (int i = 1; i < N+1; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
long... | 0 | 41,799,921 |
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<vector<int>> g;
vector<int> was;
vector<int> topoSort;
void dfs(int u) {
was[u] = true;
for (auto& v : g[u]) {
if (!was[v]) {
dfs(v);
}
}
topoSort.push_back(u);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i = 0; ... | 0 | 67,616,791 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int ara[n+5];
for(int i=0;i<n;i++)cin>>ara[i];
sort(ara,ara+n);
reverse(ara,ara+n);
int sum=0;
for(int i=0;i<k;i++)sum+=ara[i];
cout<<sum<<endl;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mo... | 0 | 82,553,616 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(_i, n) printf("%d%c", a[_i], _i + 1 == n ? '\n' : ' ')
#define DUMP2D(a, n, m) REP(_i, n) REP(_j, m) printf("%d%c", a[_i][_j], _... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 0 | 36,986,394 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long double T, X; cin >> T >> X;
cout << T / X <<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
const long long INF = 6e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int,int>> a(n);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i... | 0 | 78,154,340 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast ... | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
using namespac... | 0 | 51,106,442 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j) for(int (i)=0;(i)<(int)(j);++(i))
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
int w, h;
char f[20][20];
while (cin >> w >> h && w && h) {
int c = 1;
queue<pair<int, int>> q;
rep(y,h) {
rep... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
for(int b=0;b<(1<<3);++b){
int ans = S[0] - '0';
for(int i=1;i<4;++i){
if(b & (1<<(i-1))){
ans += S[i] - '0';
}else{
ans -= S[i] - '0';
}
}
if (ans == 7){
for(int i=0;i<3;++i){
... | 0 | 96,002,978 |
#include<bits/stdc++.h>
using namespace std;
main()
{
long long i,j,k,l,m,n,o,p;
string s;
while(cin>>s){
l=s.size();
int x[150]={0};
for(i=0;i<l;i++)x[s[i]]++;
l=0;
for(i=97;i<123;i++)if(x[i]==0){l++;
printf("%c\n",i);
break;
}
if(l==0)cout<<"None"<<endl;
}
return... | #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 | 94,741,152 |
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
using namespace std;
int n,a,b,cur;
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
#endif
cin>>n>>a>>b;
i... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
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;
}
template<class T>
inline ... | 0 | 59,088,647 |
#pragma GCC optimize("Ofast",3,"inline")
#include<bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
#define m_p make_pair
#define y1 ygftgfgcdtfgxffgx
#define y2 yfdsesgvtyghftfvv
#define x1 xvyr6cf6fgcfgf676
#define x2 xcr6rfc5r66y6r6fr
#define up_bound upper_bound
#define low_bound lower_bound
... | #include<iostream>
#include<map>
using namespace std;
int main(void){
map<string,int>m;
map<string,int>::iterator it,cit,sit;
string s;
int maxS=0,maxC=0;
while(cin >>s){
m[s]+=1;
}
for(it=m.begin();it!=m.end();it++){
int size=(*it).first.size();
if(size>maxS){
sit=it;
maxS=size;
... | 0 | 15,455,851 |
#include <bits/stdc++.h>
using namespace std;
int n,k;
vector<int> a;
bool ok(int p) {
if(a[p]>=k) return true;
vector<vector<char> > dp(n+1,vector<char>(k));
dp[0][0]=true;
for(int i=0;i<n;++i) {
for(int j=0;j<k;++j) {
dp[i+1][j]|=dp[i][j];
if(i==p||j+a[i]>=k) continue;
dp[i+1][j+a[i]]|=dp[i][j];
if(... | #include<iostream>
#include<string>
using namespace std;
string replaceAll(string &replacedStr, string from, string to){
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if(from.empty()){
return replacedStr;
}
while((replacedStr.find(from,pos)) != string::npos){
po... | 0 | 14,169,992 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
string sentence, replacement,command,copy;
cin>>sentence;
cin>>a;
for (int i=0; i<a; i++) {
cin>>command;
if(command=="print"){
cin>>b>>c;
for(int l=0;l<c-b+1;l++){
cout<<sen... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n+1];
long long b[n];
for ( int i = 0; i < n+1; i++ ) { cin >> a[i]; }
for ( int i = 0; i < n; i++ ) { cin >> b[i]; }
long long ans = 0;
for ( int i = 0; i < n; i++ ) {
if ( a[i] >= b[i] ) {
ans += b[i];
... | 0 | 81,219,207 |
#include<iostream>
using namespace std;
int main(){
double x1, x2, x3, y1, y2, y3, xp, yp;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
double cross1 = (x2-x1)*(yp-y1)-(y2-y1)*(xp-x1);
double cross2 = (x3-x2)*(yp-y2)-(y3-y2)*(xp-x2);
double cross3 = (x1-x3)*(yp-y3)-(y1-y3)*(xp-x3);
if(cross1 < ... | #include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se ... | 0 | 92,296,112 |
#include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 82,689,109 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=double;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
using pld=pair<ld,ld>;
using ti3=tuple<int, int, int>;
using vi=vector<int>;
using vll=vector<ll>;
using vld=vector<ld>;
using vpi=vector<pi>;
using vpll=vector<ll>;
using vpld=vector<ld>;
u... | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 0 | 30,575,071 |
#include <bits/stdc++.h>
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#define _USE... | 0 | 79,704,762 |
#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... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
struct edge {
int to;
int weight;
ed... | 0 | 9,649,406 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N+1);
ll sum=0;
for(ll i=0;i<N+1;i++) {
cin>>A[i];
sum+=A[i];
}
vector<ll> B(N);
for(ll i=0;i<N;i++) {
cin>>B[i];
}
for(ll i=0;i<N;i++) {
if(A[i]>=B[i]) {... | #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | 0 | 63,874,862 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define F first
#define S second
#define lb lower_bound ... | 0 | 18,974,405 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <string>
#include <math.h>
using namespace std;
int main(){
long long int n,b=10000000000,ans=0;
cin>>n;
vector<long long int>a(1000000);
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a... | #include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
#define int long long
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
const int INF = 1e18;
const int MAX_N = 1e5 + 5;
int32_t main()
{
for (int i = 1 ; i <= 9 ; i ++)
{
... | 0 | 89,889,110 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
double ans = 1;
for(; n != 1; n--) {
ans *= n;
}
printf("%.0f\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).b... | 0 | 47,730,513 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 0 | 32,734,331 |
#include "algorithm"
#include "functional"
#include "iostream"
#include "numeric"
#include "queue"
#include "set"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define repr(i, from) for (ll i = from - 1; i >= 0; --i)
#define all(vec) vec.be... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 65,473,105 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define D1(a) cerr<<#a<<":"<<a<<endl
#define D2(a,b) cerr<<#a<<":"<<a<<","<<#b<<":"<<b<<endl
#define D3(a,b,c) cerr<<#a<<":"<<a<<","<<#b<<":"<<b<<","<<#c<<":"<<c <<endl
#define D4(a,b,c,d) cerr<<#a<<":"<<a<<","<<#b<<":"<<b<<","<<#c<<":"<<c<<","<<#d<<":... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.t... | 0 | 25,750,443 |
#include<stdio.h>
#include<string.h>
int main()
{
char str[255];
char pass[255];
scanf("%s", &str);
for(int i = 0, j = 0; str[i] != '\0'; i++){
if(str[i] == '1'){
pass[j] = '1';
++j;
pass[j] = '\0';
}else if(str[i] == '0'){
pass[j] = '0';
++j;
pass[j] = '\0';
}else{
if(j > 0){
pass[--... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define double long double
#define ull unsigned long long
#define mod 1000000007
#define vi vector<ll>
#define extrem... | 0 | 16,122,244 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
double ans = 0.0, A;
rep(i,n){
cin >> A;
ans += 1.0 / A;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans;
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 | 23,286,215 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b;
cin >> n >> a >> b;
for(int i = 0;;i++){
if(i % 2 == 0){
if(a+1 != b)a++;
else if(1 < a)a--;
else {
cout << "Borys" << endl;
break;
}
} else... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()
#define re return
#define mp make_pair
#define makeunique(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define endl '\n'
typedef pair<int, i... | 0 | 65,341,105 |
#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVLD>... | #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 ,... | 0 | 72,395,797 |
#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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll x[55... | #include <bits/stdc++.h>
#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 n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
vector<char> d(n);
rep(i,n){
if(t.at(i) == 'r') d.at(i) = 'p';
... | 0 | 33,659,902 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;cin>>s;
rep(i,3){
if(s.at(i)=='1'){
... | #include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
for (int i = 0; i < n; i++) {
cin >... | 0 | 17,741,510 |
#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... | #pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_re... | 0 | 48,054,906 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int H,W,d;
cin>>H>>W>>d;
int K = 500;
vector<string> S(2000,string(2000,'.'));
for(int i=0;i<2000;i++){
for(int j=0;j<2000;j++){
int a = ((i%(2*d))<... | #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;
template <typename T = double>
using point = complex<T>;
using ll = long long;
using ull = unsigned long long;
using ldob = long double;
template <typename T = int>
us... | 0 | 26,531,924 |
#include<bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
char a=S.at(0);
char b=S.at(1);
char c=S.at(2);
if (a==b && b==c) {
cout << "No" << endl;
}
else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int X,Y,Z,K;cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
for(int i=0;i<X;i++){
cin >> A[i];
}
for(int i=0;i<Y;i++){
cin >> B[i];
}
for(int i=0;i<Z;i++){
cin >> C[i];
}
sort(A.... | 0 | 13,080,978 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
using ll = long long;
using d = double;
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> r(n);
rep(i,m){
int a,b;
scanf("%d%d",&a,&b);
r[a-1].push_back(b-1);
r[b-1].push_back(a-1);
}... | 0 | 45,213,178 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A ;
string tg = "{3}";
smatch m;
cin >> A;
for (int i = 0; i < A.size(); i++){
regex re(A[i]+tg);
if (regex_search(A, m, re)){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n;
int a[105];
int sum, sum2;
int main() {
int res = 1e9... | 0 | 78,814,871 |
#include <iostream>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include<cctype>
#include... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head,... | 0 | 7,727,238 |
#include <iostream>
using namespace std;
int main(void) {
int N, A, B, p;
cin >> N >> A >> B;
int cntA = 0, cntB = 0, cntC = 0;
for (int i = 0; i < N; ++i) {
cin >> p;
if (p <= A) ++cntA;
if (A < p && p <= B) ++cntB;
if (B < p) ++cntC;
}
cout << min(cntA, min(cntB, cntC)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 77,765,465 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
#define REP(i, n) for (int i = 0; i < n; ++i)
const int MAX = 111;
int N;
int cnt[MAX];
int main() {
cin >> N;
int mx = 0, mn = MAX;
REP (i, N) {
int a;
cin >> a;
cnt[a]++;
... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility>
#define rt "\n"
#define rep(i,n) for(int i... | 0 | 23,486,978 |
#include <stdio.h>
int main(){
int N, K;
scanf("%d %d", &N, &K);
int operations=1;
for(int i=0;i<N;i++){
if(operations<K){
operations*=2;
}
else
operations+=K;
}
printf("%d\n", operations);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int amaji(int y,int x,int n1)
{
if(x%n1==y%n1)
{
return 1;
}
else
{
return 0;
}
}
int main(void){
int n,t[100000],x[100000],y[100000],i=0,z,k;
cin >> n;
for(i=0;i<n;i++)
{
cin >> t[i] >> x[i] >> y[i];
}
... | 0 | 70,869,895 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ if (a < b) { a = b; } }
te... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int ans = 0;
for(int i = 0; i < n; i++)
if (a[a[i]] == i)
ans++;
ans /= 2;
cout << ans << '\n';
re... | 0 | 4,273,083 |
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
int x = 0, y = 1;
vector<vector<int>> v(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
if (i == b)
swap(x, y);
for (int j = 0; j < w; ++j) {
if (j < a)
v[i][j] = x;
else
... | 0 | 31,086,482 |
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
#ifdef DEBUG
ofstream fout("output.txt");
ifstream fin("input.txt");
if(!fout || !fin){
cout << "Can't open the file.\n";
return;
}
#endif
int n;
long int *numbers;
long int sum;
long int max_sum;
while(1){
cin >> n... | #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 | 79,217,718 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
const int mod = 1e9 + 7;
string to_string(string s) {
return '"' + s + '"';
}
string t... | 0 | 11,058,250 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 98,126,876 |
#include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<math.h>
#include<unordered_map>
#include<map>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
vec parent;
vec cost;
int find(int x)
{
if (... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
LL N;
cin>> N;
for(LL i=sqrt(N);i>0;i--){
if(N%i==0){
i=N/i;
int count=0;
while(i>0){
i/=10;
count++;
}
cout << count << endl;
return 0;
}
}
} | 0 | 78,329,283 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include <stdio.h>
int main()
{
int H,W;
while(1){
scanf("%d %d",&H,&W);
if(H==0&&W==0)
break;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++)
printf("#");
printf("\n");
}
printf("\n");
}
return 0;
} | 0 | 45,001,398 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int minN = 200000;
vector<int> P(N); vector<int> minV(200000);
for (int i =0; i<N; i++) {
cin >> P.at(i);
minN = min(P.at(i),minN);
minV.at(i) = minN;
}
int ans =0;
for (int i =0; i<N; i++) {
if (P.at(i) == minV.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int64_t,int64_t>;
int main(){
int k,n;
cin >> k >> n;
vector<int> vec(n);
rep(i,n){
int a;
cin >> a;
vec[i] = a;
}
int x = 0;
... | 0 | 72,278,866 |
#include<bits/stdc++.h>
using namespace std;
#define RI register int
int a[105],n,ans;
int main()
{
cin>>n;
for(RI i=1;i<=n+n;++i) cin>>a[i];
sort(a+1,a+1+n+n);
for(RI i=1;i<=n+n;i+=2) ans+=a[i];
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T... | 0 | 86,392,096 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll n, ans = 0;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
vector<bool> flag(a.back()+1, true);
for(int i = 0; i < n; i++) if(flag[a[i]]) for(int j = 2*a[i]; ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
template<class G>
class Fenwick_tree_dual{
vector<G> a;
public:
Fenwick_tree_dual(int n):a(n){}
void add(int l,int r,G val){
if(l==0){
for(;r>0;r-=r&-r) a[r-1]+=val;
return;
}
add(0,r,val);
add(0,l,-val);
}
G sum(in... | 0 | 95,348,026 |
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e8;
void solve(int c, int G[10][10]){
for(int k=0; k<c; k++)
for(int i=0; i<c; i++)
for(int j=0; j<c; j++)
G[i][j] = min(G[i][j], G[i][k]+G[k][j]);
int tmin = INF;
int res;
for(int i=0; i<c; i... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> plus, minus;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a > 0)plus.push_back(a);
else minus.push_back(a);
}
sort(plus.begin(), plus.en... | 0 | 86,527,269 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll > P;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = 0;
N -= K;
ans++;
if (N == 0) {
cout << ans << endl;
}
else {
for (int i = 0; i < 1000000; i++) {
N -= (K - 1);
ans++;
if (N <= 0) {
cout << ans << endl;
break;
}... | 0 | 25,738,354 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
typedef complex<double> P;
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 99,454,035 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
string x;
getline(cin, x);
for (int i = 0; i < x.size(); i++) {
if ('a' <= x[i] && x[i] <= 'z')cout << (char)(x[i] + ('A' ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1'000'000'007;
int mul(long long a, long long b){
return a * b % mod;
}
int main(){
int n;
cin >> n;
string s;
cin >> s;
int open = 1;
int res = 1;
if(s[0] != 'B'){
cout << 0 << endl;
return 0;
}
for(int i = 1; i < 2 * n; i++){
int sign = s[i... | 0 | 46,692,325 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<'\n';
int main()
{
char a,b;
cin>>a>>b;
if(a>b)
cout<<'>';
else if(a==b)
cout<<'=';
else
cout<<'<';
nl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmi... | 0 | 91,372,443 |
#include <iostream>
#include <vector>
#include <string>
#include <climits>
using namespace std;
vector<vector<long long int> > dp(101,vector<long long int>(4,-1));
long long int digitSum(const string &a,int idx,int k,bool tight,const int &n){
if(idx==n)
return k==0?1:0;
if(tight){
if(!k)
return digitSum(a,idx+... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n;
map<LL, PII> S;
vector<PII> ans;
LL offset;
int main()
{
sca... | 0 | 50,333,314 |
#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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | 0 | 69,321,351 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 100100... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | 0 | 9,549,449 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
int dx [4] = {1, 0, -1, 0};
int dy [4] = {0, 1, 0, -1};
int main() {
int h, w;
std::cin >> h >> w;
std::vector<std::vector<char>> s(h, std::vector<char>(w));
for(int i = 0;i < h; i++) {
for(int j = 0; j < w; j++) {
... | #include <iostream>
#include <cmath>
using namespace std;
int i, j, n;
string str;
bool interact(long long ask) {
cout << "? " << ask << endl;
char c;
cin >> c;
return c == 'Y';
}
int main() {
long long digit = 1;
int l = 1, r = 10;
int number;
long long last = 0;
int ans;
string... | 0 | 46,762,439 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
ll A,B;
cin>>A>>B;
if(A!=1 && B!=1){cout<<A*B/2+A*B%2<<endl;}
else{cout<<1<<endl;}
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 73,252,930 |
#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 << ' ' << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M; cin >> N >> M;
vector<int> a(M),b(M);
for(int i=0; i<M; i++){
cin >> a.at(i) >> b.at(i);
}
vector<int> order(N);
for(int i=0; i<N; i++){
order.at(i)=i+1;
}
int ans=0;
do{
if(order.at(0)!=1) br... | 0 | 58,331,346 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<deque>
#include<bitset>
#include<map>
#include<set>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define N 200010
using namespace std;
typedef long long ll;
typedef unsigned long ... | 0 | 9,668,111 |
#include<bits/stdc++.h>
using namespace std;
const int INF= 1e9+5;
typedef long long ll;
int main(){
int x;
cin>>x;
cout<<x/3<<endl;
} | #include<bits/stdc++.h>
using namespace std;
long long n, ans=0, a[100010], p,l,idx ;
int main() {
cin >>n;
for (int i=1; i<=n; i++){
cin>>a[i];
}
sort(a+1, a+n+1);
for (int i=n; i>=1 ;i--){
if (a[i]==a[i-1]){
p=a[i];
idx=i;
break;
}
}
... | 0 | 12,450,561 |
#include <bits/stdc++.h>
int main() {
std::vector<int> V(3);
for(int i=0; i<3; i++) scanf("%d", &V[i]);
std::sort(V.rbegin(), V.rend());
int ans = V[0] * 10 + V[1] + V[2];
printf("%d\n", ans);
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 16,189,755 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
long long int combination2(long long int c);
int main() {
long long int N, sum = 0;
cin >> N;
vector<long... | 0 | 18,039,509 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
int k;
cin>>k>>s;
if(s.size()<=k) cout<<s;
else {
for(int i=0;i<k;i++) cout<<s[i];
cout<<"...";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 13,711,395 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,l;
cin >> n >> l;
vector<string> S(n);
for(int i = 0; i < n; i++){
cin >> S[i];
}
sort(S.begin(), S.end());
string s;
for(string x : S){
s += x;
}
cout << s << endl;
} | #include <iostream>
using namespace std;
int main(){
int T;
cin >> T;
while(T--){
int y,m,d,ans=0;
cin >> y >> m >> d;
while(y != 1000 || m != 1 || d != 1){
d++;
if( y % 3 ){
if( d > 20 - (m+1) % 2 ) d = 1 , m++;
if( m >= 11 ) m = 1 , y++;
}else{
if( d >= 21 ) d = 1 , m++;
if( m >= 11 ... | 0 | 29,344,277 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
typedef pair<int,int>P;
int main()
{
int h,w,m;
cin>>h>>w>>m;
vector<int>hs(h);
vector<int>ws(w);
set<P>s;
rep(i,m)
{
int r,c;
cin>>r>>c;
r--;c--;
hs[r]++;
ws[c]++;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vecto... | 0 | 64,701,917 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main() {
int n,ans;
string s;
char a,b;
cin>>n>>s;
ans=n;
a=s[0];
rep(i,n-1){
b=s[i+1];
if(a==b) ans--;
else a=b;
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n,m,r,ans=1e15,a,b,c;
cin >> n >> m >> r;
vector<long long> t(r);
for(int i=0;i<r;i++){
cin >> t[i];
t[i]--;
}
sort(t.begin(), t.end());
long long f... | 0 | 682,892 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int n=N;
int sum=0;
while(n!=0){
int m=n%10;
n=(n-m)/10;
sum+=m;
}
if(N%sum==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 36,886,853 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
double a,b;
cin >> a >> b;
rep(i, 1001) {
int at = i * 0.08;
int bt = i * 0.1;
if (a == at && b == bt) {
cout << i << endl;
ret... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cin >> A[i][j];
A[i][j]--;
}
}
int N = H * W;
vector<int> y(N), x(N);
for (int i = 0; i < H; i++){... | 0 | 11,680,630 |
#include <iostream>
#include <stack>
int main(){
int a;
std::stack<int> stack;
while(std::cin >> a){
if(a > 0){
stack.push(a);
} else{
std::cout << stack.top() << std::endl;
stack.pop();
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
#define LOG_MAX 30
template <typename T>
class Doubling {
const size_t n;
vector<vector<T>> next;
public:
Doubling() {}
Doubling(vector<T> first_row)
: n(first_ro... | 0 | 80,668,545 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.