code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <string>
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <climits>
using namespace std;
using ll=long long;
void solve(){
while(1){
int m,mi,ma;
c... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#define INF 100000000000000000LL
using namespace std;
int main()
{
int n, m;
int a, b;
scanf("%d %d", &n, &m);
vector<int> v[100000];
for(int i=0; i<m; i++){
... | 0 | 58,377,621 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, int>;
const int MAXN = 100005;
void my_ass(bool p){
if(!p){
puts("-1");
exit(0);
}
}
int n, leaf_size[MAXN];
pi a[MAXN];
vector<int> gph[MAXN];
lint get_dist(int x, int d){
lint ret = d;
for(auto &i : gph[x]) ret += get_... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
vector<int> p(n);
rep(i,n) cin >> p.at(i);
int mn = 0, ans = 0;
rep(i,n) {
if(i == 0 || p.at(i) < mn) {
... | 0 | 49,820,281 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int m = -1;
rep(i, S.size() - T.size() + 1) {
bool ok = true;
rep(j, T.size()) {
if (S[j + i] != '?' && S[j + i] != T[j]) {
ok =... | #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 | 100,609,343 |
#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;
cin>>n;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
vector<long long> ki(200001,-1),button(200001,0);
vector<vector<long long>> kankei(200001);
void dfs(long long now,long long point){
point+=button.at(now);
ki.at(now)=point;
for(auto a:kankei.at(now)){
if(ki.at(a)==-1){
df... | 0 | 87,201,180 |
#include <stdio.h>
int main()
{
int n1=0,n2=0,n3=0;
scanf("%d %d %d",&n1,&n2,&n3);
if(n1<n2&&n2<n3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <numeric>
#include <iomanip>
#... | 0 | 1,694,774 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
int p[MAX_N];
int idx[MAX_N];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &(p[i]));
p[i] -= 1;
i... | 0 | 19,080,091 |
#include<bits/stdc++.h>
using namespace std;
int n, m, a[101], sum, temp, i, c;
int main()
{
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
temp = sum /(4*m) + (sum%(4*m)>0);
for(i=0;i<n;i++)
{
if(a[i]>=temp)
c++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, B, digit = 1, sum = 0, C;
cin >> N;
B = N;
C = N;
for ( i = 0; i < N; i++) {
if (B / 10 > 0) {
B = B / 10;
digit++;
}
else {
break;
}
}
for ( i = 0; i < digit; i++) {
sum += N % 10;
N /= 10;
}
if( ... | 0 | 49,357,224 |
#include <iostream>
using namespace std;
long long gcd(long long a, long long b){
while(a%b>0){
long long g = a%b;
a = b;
b = g;
}
return b;
}
int main() {
int n;
cin>>n;
long long num;
long long multi=1;
for (int i=0; i<n; i++){
cin >> num;
long long g = gcd(multi,num);
multi = multi/g*num;
}
cou... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 0 | 34,592,895 |
#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.at(i);
set<int>S;
for(int i=0;i<N;i++)
S.insert(A.at(i));
int ans=S.size();
if(N%2==ans%2)
cout<<ans<<endl;
else
cout<<ans-1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define ... | 0 | 28,526,150 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h)
cin >> s[i];
vector<vector<vector<int>>> id(h, vector<vector<int>>(w, vector<int>(2)));
vector<vector<int>> hl(h), vl(w)... | 0 | 84,020,580 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a[7],b,c,d;
for(int i=1;i<=6;i++){
cin>>a[i];
}
cin>>b;
for(int i=0;i<b;i++){
cin>>c>>d;
if(c==a[1]){
if(d==a[2])cout<<a[3]<<endl;
if(d==a[3])cout<<a[5]<<endl;
if(d==a[5])cout<<a[4]<<endl;
if(d==a[4])cout<<a[2]<<endl... | 0 | 58,184,592 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
int rightPredict=0;
cin>>S>>T;
for(int i =0;i<=2;i+=1){
if (S[i]==T[i]){
rightPredict+=1;
}
}
cout<<rightPredict;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 48,613,707 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cur = 0;
for(char& c : s) {
if(c == 'R') {
cur++;
} else {
ans = max(ans, cur);
cur = 0;
}
}
ans = max(ans, cur);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | 0 | 96,138,995 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
long long n;
cin >> n;
if (n % 1000000000 == 0) {
cout << "0 0 1000000000 1 " << 0 << " " << n / 1000000000 << endl;
} else {
cout << "0 0 1000000000 1 " << 1000000000 - (n % 1000000000) << " " << (n + ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 92,127,303 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
int i, j, k;
int n;
int b, f, r, v;
int building[4][3][10];
cin >> n;
memset(building, 0, sizeof(building));
for (i = 0; i < n; i++) {
cin >> b;
cin >> f;
cin >> r;
cin ... | 0 | 91,438,323 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int res = 0;
for (int i = 1; i <= x/100; i++) {
if (100*i <= x && x <= 105*i) res = 1;
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
using namespace std;
#define MAX 100
int d[MAX], t = 0, M[MAX][MAX] = {}, n;
void bfs(){
queue<int> todo;
d[0] = 0;
todo.push(0);
while(!todo.empty()){
int m = todo.front();
todo.pop();
rep(i, n){
... | 0 | 89,784,951 |
#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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define ... | #include <stdio.h>
typedef long long ll;
ll min(ll a, ll b) {
return a > b ? b : a;
}
ll max(ll a, ll b) {
return a > b ? a : b;
}
int main(void) {
ll i, j, k, l, n, ans = 0, now;
scanf("%lld%lld", &n, &k);
ll h[n + 2], dp[n + 2][n + 1], d[n + 2][n + 1];
h[0] = 0, h[n + 1] = 0;
for(i = 1; i <= n; ++i) sca... | 0 | 85,449,052 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n,i,l,m=1e13; cin>>n;
for(i=1;i<=sqrt(n);i++)
{
if (n%i==0)
{
l=(n/i)-1+(i-1);
m=min(m,l);
}
}
cout<<m;
return 0;
} | #include <iostream>
#include <string.h>
using namespace std;
int main(){
string left="zaqxswcdevfrbgt";
string right="nhymjukilop";
string input;
while (1){
int count=-1;
int boo=0;
cin>>input;
for (int i=0;i<input.length();i++){
for (int j=0;j<right.length();j++){
if (input[i]==right[j])... | 0 | 17,912,463 |
#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
#define Graph vector<vector<int>>
int main() {
int A, B; cin >> A >> B;
string ans = "Yay!";
... | #include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[101010];
main()
{
int n;
int x, y;
long long o;
cin >>n;
for(int i = 0; i < n; i ++)
cin >>a[i].first >>a[i].second;
for(int k = o = 0; k < 100000; k ++)
{
random_shuffle(a, a + n);
x = 0;
... | 0 | 3,235,234 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
deque<char>c;
for(int i=0;i<s.length();i++)
{
c.push_back(s[i]);
}
bool flag = true;
string loc;
string s1 = "maerd",s2 = "remaerd",s3 = "esare",s4 = "re... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string S; cin>>S;
int N=S.size();
bool ikeru=0;
if(S.substr(0, 7)=="keyence") ikeru=1;
if(S.substr(0, 6)=="keyenc" && S.substr(N-1, 1)=="e") ikeru=1;
if(S.substr(0, 5)=="keyen" && S.substr(N-2, 2)=="ce") ikeru=1;
if(S.substr(0,... | 0 | 28,232,145 |
#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<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define digit(N) cout << fixed << setprecision((N))
bool is_unbalanced(string s)
{
map<cha... | 0 | 26,323,870 |
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
bool p[3000000];
vector<int> prime;
void init(){
memset(p,1,sizeof(p));
p[0] = p[1] = false;
for(int i = 2; i <= 1000000; i++){
if(!p[i]) continue;
for(long long j = 1LL*i*i; j <= 1000000; j += i)
p[j] ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
map<string,int> mp;
int n,m;
cin >> n;
string s;
rep(i,n){
cin >> s;
... | 0 | 8,030,147 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(void) {
int a[30], l;
char c[30];
string s;
for (int i = 0; i < 26; i++) {
c[i] = 'a' + i;
a[i] = 0;
}
while (cin >> s) {
l = s.size();
for (int i = 0; i < l; i++) {
if ('A' <= s[i] && s[i] <= 'Z') {
s[i] = s[i... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | 0 | 2,381,890 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int N,L,T;
cin >> N >> L >> T;
vector<int> X(N);
vector<int> W(N);
vector<int> A(N);
vector<int> R(N);
rep(i,N){
cin >> X[i] >> W[i];
if(W[i] == 1){
A[i] = X[i] + T;
... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB(x, v) x.push_back(v);
#define pll pair<ll, ll>
#define ll long long
#define mll map<ll, ll>
#define vl vector<ll>
#define fa(x, v) for(auto x: v)
#define fr(i, a, b) for(int i= a;i <=b; i++)
#define B_... | 0 | 79,877,046 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 74,530,273 |
#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 ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N, D;
cin >> N >> D;
vector<vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<in... | 0 | 39,327,381 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
double s=0,n,v1[200001],v2[200001],T[200],V[200],ans=0;
cin>>n;
rep(i,n){
cin>>T[i],s+=T[i];
if(i>0) T[i]+=T[i-1];
}
rep(i,n) cin>>V[i];
double t;
int x=0;
... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 99,509,905 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main(){
int N,K,i;char c;scanf("%d %d\n",&N,&K);
vector<int> v;v.emplace_back(0);
bool p = 1;
for(i=0;i<N;i++){
scanf("... | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 50,729,920 |
#include<iostream>
using namespace std;
int main(){
int n, m;
int data[128];
char x, y;
char z;
while(1){
cin >> n;
if (n == 0) break;
else {
for(int i = 0; i< 128; i++){
data[i] = i;
}
for(int i = 0; i< n; i++){
cin >> x >> y;
data[static_cast<int>(x)] = static_cast<int>(y);
}
c... | #include<iostream>
#include<cstdio>
using namespace std;
int a,b;
double ans;
int main(){
cin >> a >> b;
ans=(double)a/b;
cout << a/b <<' '<< a%b <<' ';
printf("%.10lf\n",ans);
return 0;
} | 0 | 68,253,221 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char a;
a=1;
while(true){
scanf("%c",&a);
if(a=='\n'){
break;
}
if(a>='a' && a<='z'){
a=a-32;
}else if(a>='A' && a<='Z'){
a=a+32;
}
cout<<(char)a;
... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_ba... | 0 | 24,192,137 |
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<type... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | 0 | 47,559,589 |
#include <iostream>
using namespace std;
int triangle(int a,int b,int c){
if(a<=0 || b<=0 || c<=0){
cout << "ERROR" << endl;
return 1;
}
if(a < b){
swap(a,b);
}
if(a < c){
swap(a,c);
}
if(a*a-b*b-c*c == 0){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
}
int main(void){
in... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <comp... | 0 | 28,352,173 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin >> n;
bool exist=false;
ll groups = 0, crr = 0;
queue<ll> q, tpq;
if(n>2){
for(ll i=2;i<2*n;i++){
if((2*n)%i!=0) continue;
else{
if(abs((2*n)/i - i) == 1) {
groups = i;
exist =... | #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 | 7,197,226 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 35,598,241 |
#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>
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 | 30,179,321 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
const ll MOD = 1000000007;
ll a[N];
int bts[66];
int stb[66];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans = 0;
for(int i=n;i>0;i--){
for(i... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
ll gcd(ll a,ll b){
ll v0=a,v1=b,v2=a%b;
while(v2!=0)... | 0 | 81,919,661 |
#include <bits/stdc++.h>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define repr1(i, n) for (int i = n; i > 0; i--)
#define FOR(i, j, n) ... | #include <iostream>
using namespace std;
int main()
{
double x1,y1,x2,y2,x3,y3;
double xp,yp;
double xv1,yv1,xv2,yv2,xvp,yvp;
double t,u;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
xv1 = x2 - x1;
yv1 = y2 - y1;
xv2 ... | 0 | 32,008,772 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < n; i++) {
if ((s[i] - '0')%p == 0) ans += i + 1;
}
}
else {
map<ll,ll> cnt;
... | 0 | 15,220,650 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int d;
cin >> d;
if(d == 22)
cout << "Christmas Eve Eve Eve";
else if(d == 23)
cout << "Christmas Eve Eve";
else if(d == 24)
cout << "Christmas Ev... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main(){
int N;
string s;
cin >> N >> s;
string check = string();
for(int i = 0 ; i < N; i++) check += '0';
int i = 0;
for(int k = 0; k < N; k++){
if(check[i] == '1') ... | 0 | 100,765,676 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#define Nil -1
#define Lens 1000000
using namespace std;
struct Node
{
int p, l, r;
};
int N;
Node Tr[Lens];
int D[Lens];
int v, d;
void maketree()
{
int tmp;
for (int i = 0; i < N; i++)
{
cin >> v >> d;
int tmpv = v;
int next;
for (int i = 0; i < d; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
string s, t; cin >> s >> t;
int ans = 99999;
for (int i = 0; i + t.size() <= s.size(); i++) {
int tr = 0;
for (int j = 0; j < t.size(); j++) {
if ... | 0 | 14,427,669 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
ll n;
cin >> n;
ll ans = 0;
REP(i,1,n + 1)... | #include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
int n, m; cin>>n>>m;
ll a[n+1], b[n+1], c[m+1], d[m+1];
for (int i=1; i<=n; i++) cin>>a[i]>>b[i];
for (int i=1; i<=m; i++) cin>>c[i]>>d[i];
for (int i=1; i<=n; i++){
ll mi... | 0 | 70,698,099 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
constexpr int MOD = 1... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6;
int n,L,T;
int pos[N];
int f[N][35];
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+(... | 0 | 18,244,980 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<int, int>> red(N);
vector<pair<int, int>> blue(N);
for (int i = 0; i < N; i++) cin >> red[i].second >> red[i].first;
sort(red.begin(), red.end());
reverse(red.begin(), red.end());
for (int i = 0; i < N; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
vector<int> D(N);
rep(i, N) cin >> D[i];
if(D[0] != 0) {
cout << 0 << endl;
return 0;
}
s... | 0 | 34,322,278 |
#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(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
... | #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 | 10,017,150 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
using ll = int; using vll = vector<ll>;
sta... | 0 | 47,161,425 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int h, w;
cin >> h >> w;
string s;
rep(i,h){
rep(k,w){
cin >> s;
if(s=="snuke"){
cout << (char)('A'+k) << i+1 << endl;
break;
}... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 10,141,808 |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
string ans="No";
int H,N;
cin >> H >> N;
vector<int> A(N);
rep(i,N) {
cin >> A[i];
H=H-A[i];
if(H<=0) ans="Yes";
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define MOD 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define loop(I,N) for(int i=I;i<N;i++)
#define sortvec(V) sort(V.begin(),V.end())
#define vec vector<i... | 0 | 66,985,216 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin>>n;
vector<int> p(n);
vector<int> q(n);
int cp=0;
int cq=0;
rep(i,n)cin>>p[i];
rep(i,n)cin>>q[i];
while(prev_permutation(p.begin(),p.end())){
cp++;
}
while(prev_pe... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
int pow10[]={(int)1e0,(int)1e1,(int)1e2,(int)1e3,(int)1e4,
(int)1e5,(int)1e6,(int)1e7,(int)1e8,(int)1e9};
inline char getres(lint x){
printf("? %lld\n",x);
fflush(stdout);
char c;
while((c=getchar())!='Y'&&c!='N');
... | 0 | 21,087,686 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
using Int = long long;
const Int mod = 1000000007;
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> ... | #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 ct = 0, cx = 0, cy = 0;
rep(i, N)
{
int t, x, y;
cin >> t >> x >> y;
int d = abs(x + y - (cx + cy));... | 0 | 15,767,673 |
#include<iostream>
#include<algorithm>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int sum = 0;
int m = 1001;
int M = -1;
for (int i = 0; i < N; ++i) {
cin >> S;
sum += S;
m = min(m, S);
M = max(M, S);
}
sum = sum - m - M;
int ans = sum /... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N,M,X;
cin >> N >> M >> X;
vector<int>C(N);
vector<vector<int>> data(N, vector<int>(M));
vector<int>skills(M,0);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
for (int j = 0; j < M; j++) {
cin >> data.at(i).at(j);
skills.at(... | 0 | 15,307,320 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
char b, ans;
cin >> b;
if(b=='A')ans='T';
... | #include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const... | 0 | 80,261,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000;
double PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
ll GCD(ll a,ll b){
if(a < b)return GCD(b,a);
ll r ... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | 0 | 23,542,451 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
const ll inf=(1e14);
ll solve(){
int h,w,k,ans=0;
cin>>h>>w>>k;
string s[h];
for(string &i:s) cin>>i;
int tot=0;
for(string &i:s) for(char c... | #include <iostream>
using namespace std;
int main(void) {
int n;
int score, sum_score;
int max_score, min_score;
int i;
cin >> n;
while (n) {
sum_score = 0;
max_score = 0;
min_score = 1000;
for (i=0; i<n; i++) {
cin >> score;
sum_score += s... | 0 | 41,130,454 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n; cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 1000;
ll kabu = 0;
for (ll i = 0; i < n - 1; ++i)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<20;j++){
if(a[i]%2)b[i][j]++;
a[i]/=2;
}
}
int x[20]={};
int r=-1;
long long ans=0;
bo... | 0 | 53,314,844 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y ;
if ( (x*y)%2 == 0 ) {
cout << "Even" << endl;
}
else if ( (x*y)%2 == 1 ) {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
char paint[h][w];
rep(i, h){
rep(j, w){
cin >> paint[i][j];
}
}
int x[4] = {0, 0, -1, 1};
int y[4] = {-1, 1, 0, 0};
int check... | 0 | 15,319,644 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
vector<ll> cnt(3);
ll n,a,b;cin>>n>>a>>b;
for(ll i=0;i<n;i++){
ll p;cin>>p;
if(p<=a)cnt[0]++;
else if(p<=b)cnt[1]++;
else ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
int A = 0,B = 0;
int AB = 0;
bool ok ... | 0 | 83,457,148 |
#include <iostream>
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;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int r, D, x2000;
cin >> r >> D >> x2000;
int ans = x2000;
REP(i,10){
ans = r* ans -D;
f... | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 11
#define INF (1<<23)
int G[MAX][MAX];
int main() {
int n, x, y, c;
int V;
while(cin >> n, n) {
fill(G[0], G[MAX], INF);
for(int i=0; i<MAX; i++) {
G[i][i] = 0;
}
V = 0;
for(int i=0; i<n; i++) {
cin >> x >> ... | 0 | 4,926,458 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll d[100009];
int main()
{
ll n;
cin>>n;
ll a[n+1];
for(int i=1;i<=n;i++)cin>>a[i];
ll c=1,an=0;
while(1)
{
if(c==2)break;
an++;
if(d[c]){an=-1;break;}
d[c]=1;
c=a[c];
}
cout<<an<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int n,ans,maxx;
int a[100005],shu[100005];
int main(){
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
shu[a[i]]++;
if(a[i] > maxx) maxx = a[i];
}
for(int i = 1;i <= maxx;i++)
if(shu[i] > 1)
ans += shu[i] -... | 0 | 91,923,324 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll arr[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
ll k;
cin>>k;
cout<<arr[k-1];
} | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <tuple>
#include <numeric>
#include <assert.h>
#include <fu... | 0 | 20,673,058 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define float double
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define dipi2(x,y) i... | 0 | 84,378,861 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int n,left=0,right=0,l=0,r=0;
string s;
cin>>n>>s;
char c=s[0];
rep(i,n){
if(c!=s[i]){
if(s[i]=='('){
left+=max(0,l-r);
r=max(0,r-l);
l=0;
}
c=s[i];
}
... | #include<iostream>
using namespace std;
void Solution()
{
int a, b, c;
while(cin>>a>>b>>c)
{
if(a < b && b < c)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
}
int main()
{
Solution();
} | 0 | 77,936,512 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
long long cnt = n / k;
long long cnts = (n + k / 2) / k;
long long ans = pow(cnt, 3);
if(k%2 == 0) ans += pow(cnts, 3);
cout << ans << endl;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 8,084,766 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define sc(n) scanf("%d", &n)
#define sca(a, n) fo(i, n) sc(a[i])
#define ... | #define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vec... | 0 | 2,219,383 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, count = 0;
bool divi[10001] = { false };
cin >> a >> b >> c;
for(int i = 1; i <= c; i++){
if(c % i == 0){
divi[i] = true;
}
}
for(int i = a; i <= b; i++){
if(divi[i] == true){
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int ... | 0 | 6,099,745 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int p(int A,int B){
if(!B)return 1;
if(B%2)return p(A,B-1)*A%mod;
int C=p(A,B/2);
return C*C%mod;
}
signed main(){
int N;
cin>>N;
vector<int> D(N);
vector<int> A(N);
for(int i=0;i<N;i++){
cin>>D[i];
if(... | 0 | 76,153,604 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dl double long
const int INF=0x3fffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n... | #define FOR(i, min, max) for(int (i) = (min); (i) < (max); (i)++)
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define SWAP(a,b) { int r = a; a = b; b = r; }
#include <utility>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int stable(string c[], string ... | 0 | 21,430,689 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
const long long int Z = 1000000007;
const long long int INF = 1 << 30;
int flag = 0;
using ll = lon... | #include <iostream>
#include <stack>
using namespace std;
bool issame(char a,char b){
if(a=='(')return b==')';
if(a=='[')return b==']';
}
int main(){
while(1){
char in;
in=cin.peek();
if(in=='.')return 0;
stack<char> sta;
bool iscorrect=true;
while(cin.get(in),in!='.'){
if(cin.e... | 0 | 34,159,120 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
templa... | 0 | 61,535,754 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
int64_t INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
vi a(n);
rep(... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
int x, y;
long long ans, dp[4002][3] = {};
string s;
char cat[] = "RGB";
cin >> n >> s;
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < 3; j++ ) {
if ( cat[j] == s[i] ) {
dp[i+1][j]+... | 0 | 87,825,415 |
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n),b(n);
ll s = 0;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
b[i] = a[i];
s += a[i];
}
sort(b.begin(),b.end());
vector<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (... | 0 | 94,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
map<int, int> cnt1, cnt2;
int N, a;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
if (K > (N - 1) * (N - 2) / 2) cout << -1 << endl;
else{
... | 0 | 65,071,463 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define lpsbd(i, s, b, d) for(size_t i = (s); i < (b); i+=(d))
#define lpsb(i, s, b) for(size_t i = (s); i < (b); i++)
#define lpn(i, n) for(size_t i = 0; i < (n); i++)
#define fa(i, x) for(auto &i: x)
#define vcd(t, n, d) vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n), b(n+1, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
long long sum = 0;
for (int i = 0; i <= n; i++) {
sum += b[i]*(b[i]-1LL)/2LL;
}
for... | 0 | 44,291,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
ll N, M;
cin >> N >> M;
if ((N >= 2) && (M >= 2))
cout << (N - ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
int mod(int A, int M) {return (A % M + M) % M;}
const int INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a =... | 0 | 77,799,241 |
#include <iostream>
typedef long long ll;
using namespace std;
static const int MOD = 1000000007;
ll dp[2005];
int main() {
int S;
cin >> S;
dp[0] = 1;
for (int i = 3; i <= S; i++) {
dp[i] = (dp[i - 1] + dp[i - 3]) % MOD;
}
if (S >= 1 && S <= 2) cout << 0 << endl;
else cout << dp[S] ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 200003
#define MOD 1000000007
using Graph=vector<vector<pair<int,double>>>;
int main(){
int N;
cin>>N;
vector<ll> A(N),B(N);
ll sum=0;
int k;
bool flag=false;
for(int i=0;i<N;i++){
cin>>A.at(i)>>B.at(i);
sum+=A.at(i);
... | 0 | 67,938,135 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
ll L, R, t; cin >> L >> R;
vector<int> check(2019,0);
for(ll i=L; i<R; i++){
... | 0 | 56,735,849 |
#include <iostream>
#include <list>
using namespace std;
int main(void) {
int w;
string c;
list<int> myList;
list<int>::iterator it;
cin >> w;
for (int i = 0; i < w; i++) {
cin >> c;
if (c == "insert") {
int x;
cin >> x;
myList.push_front(x);
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 10000000
using namespace std;
bool check(char x){
for(int i=48; i<=57; i++){
if(x == i) return true;
}
return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int... | 0 | 17,502,706 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, COUNT = 0, X;
vector<long long> ANS;
cin >> N;
for (int i = 1; ; i++) {
ANS.push_back(i);
COUNT += i;
if (N <= COUNT) break;
}
X = COUNT - N;
for (int i = 0; i < ANS.size(); i++) if (ANS[i] != X) cout << ANS[i] << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long ll;
ll a,b,k,l,m;
cin>> a>> b>> k;
if((a+b)<k)
{
cout<< "0 0"<< endl;
}
else if(k>=a)
{
l=k-a;
m=b-l;
cout<< "0 "<< m;
}
else
{
l= a-k;
cout<< l<< " "<<... | 0 | 70,825,693 |
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | #include<bits/stdc++.h>
using namespace std ;
int main() {
int A ,B ;
cin >> A >> B ;
if( A == 1){
if (B == 2){
cout << 3 << endl ;
}
else {
cout << 2 << endl ;
}
}
else if (A == 2){
if (B==1){
cout << 3 << endl ;
}
else {
cout << 1 << endl ;
}
}
els... | 0 | 30,029,988 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> ball(n);
map<int,int> maps;
for(int i=0;i<n;i++){
cin>>ball.at(i);
if(maps.count(ball.at(i))) maps.at(ball.at(i))++;
else maps[ball.at(i)]=1;
}
vector<int> num;
for(auto a:ball){
if(maps.at(a)!=0)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int K;
void f(int &mine, int &others... | 0 | 8,015,419 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int p=1000000007;
vector<int64_t> e(k+1,1);
for(int i=0;i<=k;i++){
int x=n;
vector<bool> b;
while(x>0){
b.push_back(x%2==1);
x/=2;
}
for(int d=(int)b.size()-1;d>=0;d--){
e.at(i)=e.at(i)*e.at(i)%p... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
if (count(A.begin(), A.end(), 0) > 0) {
cout << 0 << endl;
return 0;
}
ll prod = 1;
for... | 0 | 57,533,526 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#defin... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
if(s1.size()>s2.size()){
cout << "GREATER" << endl;
return 0;
}else if(s1.size()<s2.size()){
cout << "LESS" << endl;
return 0;
}else{
for(int i=0;... | 0 | 19,202,831 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
long long dfs(int curstep,int &n,set<int> &brok,vector<long long> &dp){
if(curstep == n ) return 1;
if(curstep>n || brok.count(curstep)) return 0;
if(dp[curstep]!=-1) return dp[curstep];
return dp[curstep] = (dfs(curstep+1,n,brok,dp)%m... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | 0 | 46,599,083 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
vector<int64_t> A = { 2, 1 };
int main() {
int N;
scanf("%d", &N);
for (int i = 2; i < N + 1; i++) {
A.push_ba... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD ((int)1e9+7)
#define N ((int)2e5+123)
void reads(string& x){ char kk[N]; scanf("%s",kk); x = kk;}
int ans, n, m, v[N],sum,q;
void solve(){
scanf("%d%d", &n,&m);
for(int i=0;i<n;i++){
scanf("%d",v+i);
sum+=v[i];
... | 0 | 94,134,388 |
#include<bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false),cin.tie(0);
#define ll long long
#define inf 0x3f3f3f3f
const int N=105;
int main()
{
IO;
int len1,len2,i,j,x,ans;
string s,t;
cin>>s>>t;
len1=s.length();
len2=t.length();
ans=inf;
for(i=0;i+len2<=len1;i++)
{
x=0;
for(j=0;j... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
string S;
cin >> S;
int ans = 0;
bool flag = true;
if(S[0] == '0') flag... | 0 | 11,639,111 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int>cnt(N+1, 0);
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
cnt[A]++;
}
sort(cnt.begin(), cnt.end());
int sum = 0;
vector<int>ans(N+1);
ans[0] = N+1;
... | #include <algorithm>
int uf[100010];
void init(int n){ for(int i = 0; i < n; i++) uf[i] = -1; }
int find(int x){
if(uf[x] < 0) return x;
return uf[x] = find(uf[x]);
}
void unite(int x, int y){
x = find(x); y = find(y);
if(x != y){ uf[x] += uf[y]; uf[y] = x; }
}
bool same(int x, int y){
return find(x... | 0 | 84,159,064 |
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define EPS (1e-10)
#define endl "\n"
#define SZ(v) (int)(v.size())
#define IO ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL), cerr.tie(NULL);
typedef long long ll;
typedef long double ld;
ll MOD=1e9 + 7;
ll OO=1e9 + 1;
const int N=1e6 + 10... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 79,855,689 |
#include<stdio.h>
struct Card{
char suit;
char value;
};
void bubble(struct Card A[], int n){
int i, j;
struct Card t;
for ( i = 0; i < n; i++ ){
for ( j = n-1; j >= i+1; j-- ){
if ( A[j].value < A[j-1].value ){
t = A[j]; A[j] = A[j-1]; A[j-1] = t;
}
}
}
}
void selection(struct Card A[]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int cnt = 0, a_cnt = 0, b_cnt = 0, double_cnt = 0;
string s;
for (int i = 0;i < N;i++) {
cin >> s;
for (int j = 0;j < s.length()-1;j++) {
if (s[j] == 'A') {
if (s[j+1] == 'B') cnt++;
}
}
if (s[0... | 0 | 65,090,844 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main(void)
{
int dice[6]={0};
int q;
int a,b;
for(int i=0; i< 6; i++){
cin >> dice[i];
}
cin >> q;
for(int i = 0; i< q; i++){
cin >> a >> b;
if(a == dice[0]){
if (b == dice[1]){
cout << dice[2] <<endl;
}else if(b == dice[2]){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 0 | 90,927,785 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
int main() {
const long long int mod = 1000000007,INF=50000000000000;
map<long long in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 0 | 2,704,892 |
#include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<ll> a(n + 1), b(n);
for(int i = 0; i <= n; +... | #include <cstdio>
using LL = long long;
const int MAXN = (int)1e5;
LL a[MAXN];
struct LinearBasis {
static const int MAXL = 64;
LL a[MAXL];
LinearBasis() {
for (int i = 0; i < MAXL; ++i) a[i] = 0;
}
void Add(LL vec) {
for (int j = MAXL - 1; j >= 0 && vec > 0; --j) {
if (((vec >> j) & 1) == 0) co... | 0 | 62,195,037 |
#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<string,int>;
int main(){
int N;
string S;
cin >> N >> S;
int ans = 1;
for(int i = 1; i<N; i++){
if(S.at(i) != S.at(i-1))ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf ... | 0 | 80,774,043 |
#include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0)
printf("Possible");
else
printf("Impossible");
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N;
scanf("%d", &N);
std::vector<int >... | 0 | 2,694,923 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%2==0) --n;
cout << n/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 44,466,865 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <inttypes.h>
using namespace std;
int main()
{
int32_t N;
scanf("%d", &N);
int32_t t[101];
int32_t T = 0;
for (int32_t i = 0... | #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> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | 0 | 57,684,011 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
temp... | 0 | 72,906,620 |
#include <iostream>
using namespace std;
int main() {
int n,x;
int ans;
while(true){
ans = 0;
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n-2; ++i){
for(int j = i+1; j <= n-1; ++j){
if(i == j) continue;
for(int k = j+1; k <= n; ++k){
if(i == k || ... | #include <stdio.h>
#include <string.h>
int main (){
char kataA[11];
char kataB[11];
char kataC[11];
scanf("%s %s %s", &kataA, &kataB, &kataC);
int panjangA = strlen (kataA);
int panjangB = strlen(kataB);
if(kataA[panjangA-1] == kataB[0] && kataB[panjangB-1] == kataC[0]){
puts("YES");
}
else{
puts("NO");
}... | 0 | 50,476,329 |
#include <bits/stdc++.h>
#define MAX 1000000
#define INF 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define Fa... | #include<bits/stdc++.h>
using namespace std;
int n,a[200001],s[200001];
map<int,int> mp;
bool judge(int x)
{
mp.clear();
int cnt=0;
for(int i=2;i<=n;i++)
if(a[i]<=a[i-1])
{
if(x==1) return false;
while(cnt&&s[cnt-1]>a[i])
mp[s[cnt-1]]=0,cnt--;
... | 0 | 46,257,208 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#d... | #include <iostream>
#include <algorithm>
#include <map>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int H, W, D;
cin >> H >> W >> D;
map<int ,P> m;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
int a;
cin... | 0 | 43,162,027 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n"... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int table[2][100005] = {0};
for(int i=0; i<n; i++){
int v; cin >> v;
table[i%2][v]++;
}
vector<pair<int, int>> ruia, ruib;
for(int i=0; i<1e5+5; i++){
if(table[0][i]) ruia.push_back({table[0][i], i});
if(table[... | 0 | 33,778,951 |
#include<iostream>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n,m){
int ans=0,d[n];
double sum=0.0;
for(int i=0;i<n;i++){
cin>>d[i];
sum+=d[i];
}
sum*=100;
sum-=sum*(p*1.0/100);
if(d[m-1]){
ans=sum/d[m-1];
cout<<ans<<endl;
}
else
cout<<0<<endl;
}
} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F fi... | 0 | 70,664,680 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.