code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n|a|b|c|x) {
vector<int> vi;
for (int i = 0; i < n; i++) {
int y;
cin >> y;
vi.push_back(y);
}
int frame = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
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; } ret... | 0 | 74,456,987 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> v2(N);
int A;
int maximum=0;
int sec=0;
for (int i=0; i<N;i++) {
cin >> A;
vec[i]=A;
v2[i]=A;
}
sort(v2.begin(),v2.end());
maximum=v2[N-1];
sec=v2[N-2];
if (maximum==sec){
... | #include <iostream>
#include <vector>
#include <string>
#include <bits/stdc++.h>
#include <ctime>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define TT int test_cases; cin >> test_cases; while(test_cases--)
#define TT1 int test_cases=1; while(test_cases--)
#define pb push_back
#define mp make_pair
#de... | 0 | 3,204,212 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <function... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define rep(i,a,b) for(int (i)=a;(i)<(int)(b);(i)++)
using ll = long long int;
using itpl = tuple<int,int,int>;
int wi[4] = {0,-1,0,1};
int hi[4] = {-1,0,1,0};
int main(){
int H,W,cnt=0;
cin >> H >> W;
vector<vector<char>> c(H,vector<char> ... | 0 | 30,052,768 |
#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 long long mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
string ans = "";
ans += s[0];
rep(i, n - 1) {
if(s[i] == s[i + 1])
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se secon... | 0 | 27,901,269 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main()
{
int A,B,K;
cin>>A>>B>>K;
for(int i=1;i<=K;i++){
if(i%2==1){
A/=2;
B+=A;
}else{
B/=2;
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 77,326,046 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | #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> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef vector<ll> VL;... | 0 | 3,443,478 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long kai[100010];
void init(){
kai[0] = 1;
for(int i = 1;i < 100010;i++){
kai[i] = kai[i-1] * i % MOD;
}
return;
}
long long pow_mod(long long n, long long m){
long long ans = 1;
while(m > 0){
if(m & 1) ans... | 0 | 46,511,201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int n;
const int V_MAX = 205;
ll d[V_MAX][V_MAX];
v... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
while((n%4!=0&&n% 7!=0)&&(n>=11)){
n-=11;
}
if(n%4==0||n%7==0){
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
} | 0 | 9,671,210 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, char const *argv[])
{
int h, w;
while(true)
{
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for(int i = 0; i < h; i++)
{
for(int j = 0; j < w; j++)
{
... | 0 | 50,688,708 |
#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,... | #include<iostream>
using namespace std;
#include<vector>
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int ans=0;
int sta=0;
int l=0;
int r=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s=="lu"){
l=1;
}else if(s=="ru"){
r=1;
}else if(... | 0 | 41,518,699 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int a, b;
cin >> a >> b;
cout << (a > b ? a-b : 0) << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1, i = 1;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
const int MOD = 1000000007;
long long int n, k, a[5000];
int main(){
cin >> n >> k;
rep(i, n){
cin >> a[i];
}
long long int sum = 0;
rep(i, n){
long long int fw = 0, bw = 0;
... | 0 | 10,238,321 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn= 2e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
int n;
cin>>n;
int arr[mxn]=... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar,val) memset(ar... | 0 | 94,749,813 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int ma... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<int(n);++i)
using namespace std;
template<class A>void pr(A a){cout << a << endl;}
template<class A,class B>void pr(A a,B b){cout << a << " " ;pr(b);}
template<class A,class B,class C>void pr(A a,B b,C c){cout << a << " " ;pr(b,c);}
template<class A,class B,clas... | 0 | 47,563,255 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define FOR(i, r, n) for (int i=(int)(r); i<=(int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
struct BFS{
vector<vector<int>> data;
vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
void ALLOUT_NUMBER(vector<ll> V)
{
ll N = V.size();
for(ll i=0;i<N;i++)
{
cout << V[i];
if(i<N-1) cout... | 0 | 48,373,961 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int>t(N);
for (int i = 0;i<N;++i) {
cin >> t[i];
}
int ans = 0;
for (int i = 0;i<N-1;++i) {
ans += min(T, t[i + 1] - t[i]);
}
ans += T;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 0 | 36,615,021 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9+7;
vector<ll> fact;
ll m_pow(ll p, ll n){
if(n==0) return 1;
else if(n%2){
ll now = m_pow(p,(n-1)/2);... | #include <bits/stdc++.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =99999999999;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(ll a, ll b){
ret... | 0 | 23,241,089 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
const int64_t L = static_cast<int64_t>(T.length());
vector<char> from_s_to_t('z' - 'a' + 1, -1);
vec... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x... | 0 | 62,988,730 |
#include<iostream>
#include<complex>
#include<cmath>
#include<string>
#include<queue>
using namespace std;
typedef complex<double> xy_t;
int main()
{
const double eps = 1e-11;
int n;
double x[4],y[4];
queue<string> qs;
cin >> n;
for( int i = 0; i < n; ++i){
xy_t p[4];
for( int j = 0; j < 4; ++j){
... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 | 21,913,535 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
bool flg=0;
for(long i=1;i<n;i++){
if(i*i+i<n && n%i==0){
ans+=(n-i)/i;
}
if(i*i+i>=n) flg=1;
if(flg) break;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
REP(i, 0, X) cin >> A[i];
REP(i, 0, Y) c... | 0 | 93,241,924 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int N = 2e5+5 ;
void Never_give_up()
{
int k; cin>>k;
string s; cin>>s;
if(s.size()<=k) cout<<s;
else
{
for(int i=0;i<k;++i) cout<<s[i];
cout<<"...";
... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
bool flag=true,flag2=true;
int ans=0;
for(int i=0;i<=n+1||flag2;i++){
int s=x-i;
flag=true;
for(int j=0... | 0 | 84,254,812 |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(){
vector<long long> inv(100002);
vector<long long> fact(100002);
vector<long long> factInv(100002);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
for(int i=2;i<=100001;i++){
inv[i] = inv[MOD % i] * (MOD - M... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <complex>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include... | 0 | 45,067,467 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int MAXn = 1e7+8;
int main(){
int n, m ,x;
cin >> n >> m >> x;
vector<int> c(n+1);
vector<int> a[n+1];
int tmp;
for(int i = 0; i<n; i++){
cin >> c[i];
for(int j = 0; j<m; j++){
cin >> tmp;
a[i].push_back(tmp);
}
}
int mcost = MAXn... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 69,283,704 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N), B(N);
for(int n=0; n<N; n++) {
cin >> A[n] >> B[n];
}
long long int cnt=0;
for(int n=N-1; n>=0; n--) {
cnt += (B[n]-(A[n]+cnt)%B[n])%B[n];
}
cout << cn... | #include <iostream>
using namespace std;
int main(void){
int count[5][4][11] = {{{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0}},
{{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0,0}},
... | 0 | 11,654,691 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 7;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int f = 0;
for (int i = 1; i <= 1000000; i++)
{
if (a * i % b == c)f = 1;
}
if (f)cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 | 50,143,373 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 50 + 5;
const int M = 100 + 5;
const ll OO = 1e18;
const int mod = 1e9 + 7;
int n,k,v[N],dp[N][N][M];
int solve(in... | 0 | 38,128,926 |
#include<stdio.h>
int main()
{
int h,n,a[100000];
int i,m=0;
scanf("%d %d",&h,&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
m+=a[i];
}
if(h-m<=0){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N,K;cin>>N>>K;
vector<ll> A(N);
REP(i,N... | 0 | 94,306,969 |
#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b)
#define chmin(a, b) (a)=min(a, b)
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = f... | 0 | 76,392,259 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, p{ 0 };
cin >> n >> k;
vector<int>price(n);
for (int i{ 0 }; i < n; i++) {
cin >> price[i];
}
sort(price.begin(), price.end());
for (int i{ 0 }; i < k; i++) {
p += price[i];
}
cout << p;
return 0... | #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, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i, n) rep(j, d) cin >> x[i][j];
int ans = 0;
rep(j, n) rep(i, j) ... | 0 | 90,653,353 |
#include <iostream>
int main(void){
int tmp=0, ans=0;
for (int i=0; i<5; ++i){
int N, rem;
std::cin >> N;
rem = -(N % 10);
if (rem != 0) rem += 10;
if (tmp < rem) tmp = rem;
ans += N + rem;
}
ans -= tmp;
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll x, y;
cin >> x >> y;
ll ans;
if (x... | 0 | 32,870,197 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+50;
int gi(){
char ch=getchar(); int x=0,q=0;
while(ch<'0'||ch>'9') q=ch=='-'?1:q,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return q?-x:x;
}
int head[N],nn[N<<1][2],f[N],cnt;
#define link(u,v) (nn[++cnt][1]=v,nn[cnt][0... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 12,327,462 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <map>
#include <cmath>
#include <cstring>
#define fi first
#define se second
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = 1; i < (n); ++i)
#define drep(i,n) for (int i =... | 0 | 22,125,204 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c; cin >> c;
cout << char(c+1);
} | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it... | 0 | 42,955,216 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = (n)-1; i >= 0; i--)
#define FOR(i, l, r) for(int i = l; i < r; i++)
#define RFOR(i, l,r) for(int i= (l)-1; i>= (r) ; i--)
#define int64 int64_t
#define uint64 uint64_t
#define uint unsigned
array< ar... | #include <iostream>
#include <stdio.h>
int main() {
while (true) {
int m = 0, f = 0, r = 0;
const char *ch[512];
int sum = 0;
scanf("%d%d%d", &m, &f, &r);
sum = m + f;
if (m == -1 && f == -1 && r == -1) break;
if (sum >= 80) *ch = "A";
if (sum >= 65 &&... | 0 | 77,616,610 |
#include <iostream>
using namespace std;
#define MIN(X,Y) ((X)<(Y)?(X):(Y))
int main(void){
string s,t;
int ans;
cin >> s >> t;
ans = t.size();
for (int i=0; i<s.size()-t.size()+1; i++){
int d=t.size();
for (int j=0; j<t.size(); j++){
d -= s[i+j]==t[j];
}
ans = MIN(ans, d);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> gr;
int n, q;
struct DSU{
vector<int> par, siz;
int n;
DSU(int n_) {
int n = n_ + 1;
par.resize(n);
siz.resize(n);
fill(siz.begin(), siz.end(), 1);
iota(par.begin(), par.end(), ... | 0 | 82,614,564 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
string s;
vector<long long> N;
int dp[110][2][4];
int main(void){
cin>>s;
int k;
ci... | 0 | 77,893,008 |
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <iomanip>
#include <iterator>
#include <algorithm>
#include <functional>
#include <typeinfo>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;cin >> n;
vector<int> a(n);for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
int l=-1,r=n;
while(r-l!=1){
int x=(r+l)/2;
bool f=true;
... | 0 | 87,643,561 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Int long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
Int n;
cin>>n;
Int cv=(n*(n+1))/2;
cv*=n;
for(int i = 1;i<=n;i++)
{
Int j = (n*(n+1))/2;
j-=(i)*(n-i+1);
cv-=j;
... | 0 | 79,485,677 |
#include<iostream>
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
int main()
{
float x1,y1,x2,y2,x3,y3,x4,y4,a,b,c,d,e,f,g,h,i;
cin>>a;
for(i=0;i<a;i++)
{
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
b=((y2-y1)/(x2-x1));
... | #include<iostream>
#include<stdio.h>
#include<math.h>
#define PI 3.14159265f
using namespace std;
int main() {
int a, b, C;
double S, L, h;
cin >> a >> b >> C;
S = a*b*0.5*sin(C*PI / 180);
L = a + b + sqrt(a*a + b*b - 2 * a*b*cos(C*PI / 180));
h = b*sin(C*PI / 180);
printf("%f %f %f\n", S, L, h);
return 0;
} | 0 | 833,366 |
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template <typename T>
vector<T> getValues(int num){
vector<T> values(num);
for(int i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
int m... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 78,895,038 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <math.h>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include<bitset>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
using P = pair<int,int>;
int N, M, R;
int dist[201][201];
bool visit[8];
int ans = INF;
vector<int> r(9);
void dfs(int v, int prev, int d){
if(v == R + 1){
if(ans > d) ans =... | 0 | 47,674,211 |
#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 , d ;
cin >> n >> d ;
if( n%500 <= d ){
cout << "Yes" <<endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(x,n) for(int x=0;x<n;x++)
#define vei vector<int>
#define velli vector<long long int>
#define pb(x) push_back(x)
#define pb2 pop_back()
#define all(x) (x).begin(),(x).end()
#define be(x) (x).begin()
typedef pair<int,int> P;
int main()... | 0 | 74,386,416 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, m, x;
cin >> n >> m >> x;
vector<vector<ll>> a(n, vector<ll>(m+1));
rep(i, n){
cin >> a[i][0];
rep(j, m){
cin >> a[i][j+1];
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(true){
cin>>n>>m;
if(n==0&&m==0)break;
vector<pair<int,int>> e;
for (int i = 0; i < n; ++i) {
int a,b;
cin>>a>>b;
e.emplace_back(b,a);
}
sort(e.rbegin(),e.... | 0 | 89,666,801 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (x % y > 0)
cout << x;
else
cout << "-1";
return 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N,M;
ll a[100000];
ll count(ll n){
bitset<64> bt(n);
for(int i=0;i<N;i++){
if(bt[i] == 1) return i;
}
return -1;
}
bool check(ll m){
for(int i=1;i<N;i++){
if(count(a[i]) != m) return true;
}
return false;
... | 0 | 70,682,527 |
#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;
ll A[100005];
ll B[100005];
int main() {
cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define SZ(c) ((int)(c).size())
#define debug(x) cerr << #x << " = " << (x) << '... | 0 | 5,365,864 |
#include<iostream>
using namespace std;
int combination(int n){
int temp = 0;
for(int i = 0;i < 10;i++)
for(int j = 0;j < 10;j++)
for(int k = 0;k < 10;k++)
if((n - i - j - k) >= 0 && (n -i -j -k) <10)
temp++;
return temp;
}
int main(){
int n;
while(cin >> n){
cout << combination(n) << endl;
... | #include <bits/stdc++.h>
using namespace std;
void pass(int l, int x, int n);
int ans;
bool toru[8];
vector<int> road[8];
signed main()
{
int n, m, a, b;
cin >> n >> m;
for(int i=0 ;i<m ;i++ ){
cin >> a >> b;
road[a-1].push_back(b-1);
road[b-1].push_back(a-1);
}
pass(0, 0, n)... | 0 | 59,423,099 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> price;
for(int i = 0; i < N; i++) {
int a;
cin >> a;
price.push(a);
}
for(int i = 0; i < M; i++) {
int a = price.top();
a /= 2;
price.pop();
price.push(a);
}
int64_t ans = ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
string str;
char one[] = {'.',',','!','?',' '};
int xxx[10] = {0,5,3,3,3,3,3,4,3,4};
int yyy[10] = {0,0,0,3,6,9,12,15,19,22};
cin >> n;
while(n--){
vector<char> msg;
vector<int> msg_n;
cin >> str;
char curr = str... | 0 | 85,925,390 |
#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() {
double l;
cin >> l;
double ans = l*l*l/27;
printf("%.7f\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll (i)=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll (i)=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define SZ(v) (ll)(v).size()
#define ALL(v) (v).begin(), (v).end()
#define UNIQ(v... | 0 | 98,168,144 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int i,j;
int h,w;
cin >> h >> w;
vector<vector<char>> v(h+2,vector<char>(w+2,'.'));
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin >> v[i][j];
}
}
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
if(v[i][j]=='#'){
if(v[... | #include <iostream>
#include <vector>
using namespace std;
class DisJointSet {
public:
vector<int> rank, p;
DisJointSet();
DisJointSet(int n) {
rank.resize(n, 0);
p.resize(n, 0);
for (int i = 0; i < n; i++) createSet(i);
}
void createSet(int i) {
rank[i] = 0;
... | 0 | 30,755,188 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[9],n=3;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
a[2]*=10;
cout<<a[0]+a[1]+a[2]<<endl;
return 0;
} | #include <assert.h>
#include <limits.h>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = l... | 0 | 37,680,467 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define Int int64_t
using namespace std;
#define BITS 62
const Int M=(Int)(1e9+7);
inline Int mmul(Int a,Int b){if(a>=M)a=a%M;if(b>=M)b=b%M;if(a*b>=M)return(a*b)%M;return(a*b);}
inline Int madd(Int a, Int b){if(a>=M)a=a%M;if(b>=M)b=b%M;if(a+b>=M)return(... | #include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <ctime>
#include <iterator>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int main()
{
int d;
... | 0 | 59,145,816 |
#include <iostream>
using namespace std;
int main()
{
string a;
getline(cin, a);
if(a[0]==a[1] || a[1]==a[2] || a[0]==a[2]) {
cout<< "No";
}
else{
cout<< "Yes";
}
return 0;
} | #include <iostream>
int f(int x);
int main()
{
int delta;
while (std::cin >> delta) {
int ans = 0;
for (auto i = delta; i < 600; i += delta) {
ans += delta * f(i);
}
std::cout << ans << std::endl;
}
return 0;
}
int f(int x)
{
return (x * x);
} | 0 | 7,199,272 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll N) {
cout << N/3 << endl;
}
int main() {
ll N;
cin >> N;
solve(N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
void dout() { cerr << '\n'; }
template <typename Head, typename... | 0 | 28,957,349 |
#include <iostream>
#include <vector>
int main(void){
int N, ans = 0;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i){
std::cin >> A[i];
--A[i];
}
for (int i = 0; i < N; ++i){
if (i == A[A[i]]) ++ans;
}
std::cout << ans / 2 << std::endl;
retu... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int64_t n;
cin >> s >> n;
int64_t k=s.size(),cnt=0;
if(s==string(k,s[0]))cout << n*k/2 << endl;
else{
for(int64_t i=0;i<k;i++){
if(s[i]==s[i+1] && s[i+1]==s[i+2]){
cnt++;
i++;
}else if(s[i]==s[i+... | 0 | 52,198,354 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
int main()
{
int array[120] = {};
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int b;
int f;
int r;
int v;
std::cin >> b;
std::cin >> f;
std::cin >> r;
std::cin >> v;
array[(b - 1) * 30 + (f - 1) * 10 + r ... | 0 | 82,719,525 |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int w,h;
char tbl[30][30];
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
bool visited[30][30];
int ans;
void dfs(int x,int y){
visited[y][x] = 1;
++ans;
for(int i=0;i<4;++i){
int mx = x+dx[i];
int my = y+dy[i];
if(mx>=w |... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 41,795,100 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
cin >> a >> b;
x = a * b;
if (x % 2 == 0){
cout << "Even" << endl;
}
else if (x % 2 > 0) {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (count(S.begin(),S.end(),'W') == S.length() || count(S.begin(),S.end(),'B') == S.length()) {
cout << 0;
} else {
int answer;
string reversi;
if (S[0] == 'W') {
reversi.push_back('B');
for (int i = S.fin... | 0 | 61,277,312 |
#include <map>
#include <set>
#include <list>
#include <array>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000000;
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<n;i++){
if(a[i-1]>=a[i])break;
if(i==n-1){
cout<<1;
return ... | 0 | 29,627,104 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int N,K;
string S;
cin>>N>>S>>K;
char c = S[K-1];
rep(i,N){
if(S[i]!=c){
S[i] = '*';
}
}
cout<<S<<endl;
} | #include <stack>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <iomanip>
#include <string>
#include <limits>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}... | 0 | 19,635,856 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const ll INF = 1LL<<60;
bool func(int x){
int temp = x;
int y = 0;
while(temp){
y += temp%10;
temp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, X, Y; cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < m; i++) {
cin >> y[i];
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
bool war = true;
f... | 0 | 9,508,449 |
#include <iostream>
using namespace std;
#define MAX 100001
#define NIL -1
struct Node{
int p,l,r;
};
struct Node T[MAX];
int D[MAX];
void rec(int u,int p){
D[u] = p;
if(T[u].r!=NIL) rec(T[u].r,p);
if(T[u].l!=NIL) rec(T[u].l,p+1);
}
void print(int u){
cout<<"node "<<u<<": parent = "<<T[u].p<<", dept... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str += (cha... | 0 | 35,547,463 |
#include <iostream>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
ll N, X;
ll nums[51];
ll ps[51];
ll dfs(ll X, ll N){
if(N == 0) return 1;
if(X == 1) return 0;
else if(X >= 2 && X <= nums[N-1] + 1) dfs(X-1, N-1);
else if(X == nums[N-1] + 2) return ps[... | #include <stdio.h>
int IsRightTriangle(int a, int b, int c);
int main(void){
int n, a, b, c;
scanf("%d", &n);
for (int i=0; i<n; i++){
scanf("%d %d %d", &a, &b, &c);
if (IsRightTriangle(a,b,c)){
printf("YES\n");
} else {
printf("NO\n");
}
}
ret... | 0 | 25,349,715 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main(){
int n;
cin >> n;
int j = n%10;
int d = (n % 100)/10;
int s = n/100;
if(j == 9)
j = 1;
else
j = 9;
if(d == 9)
d = 1;
... | #include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define min(A,B) ((A)<(B)?(A):(B))
int dp[2000][2000];
int EditDistance(char *s,char *t)
{
int i,j,cost;
int slength=strlen(s);
int tlength=strlen(t);
dp[0][0]=0;
for(i=1;i<=slength;i++) ... | 0 | 7,843,617 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s;
int n;
cin >> s >> n;
int a,b;
string str,str2;
for(int i = 0; i < n; i++){
cin >> str >> a >> b;
if(str == "print"){
for(int j = a; j < b+1; j++){
cout << s[j];
}
cout << endl;
}else if(str ==... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
int vx[4] = {0,1,0,-1};
int vy[4] = {1,0,-1,0};
int re[1002][1002];
... | 0 | 85,020,650 |
#include<bits/stdc++.h>
#include<queue>
using namespace std;
int W,H;
char c[101][101];
bool visited [100][100];
int dx[4]={1,0,-1,0};
int dy [4]={0,1,0,-1} ;
void compute(){
memset(visited,false,sizeof visited);
queue<int> que;
int i,j;
for(i=0;i<H;++i){
for(j=0;j<W;++j){
if(c[i][j]=='@'){
que.push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i,... | 0 | 84,777,861 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int total = 0;
vector<int> A(N);
for(int i=0; i<N; i++) {
cin >> A[i];
total += A[i];
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
double limit = (double)total / (4.0 * M);
for(int i=... | 0 | 83,692,797 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
int main()... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
typedef long long ll;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int N,M;
int pre[100010];
int dist[100010];
int INF = 200010;
vector<int> path[100010];
void bfs(){
dist[1] = 0;
pre[1] = 0;
queue<in... | 0 | 18,134,856 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
set<char> st;
vector<int> board(26);
for(int i = 0; i < (int)s.size(); i++) {
if(st.count(s[i]) == 0) {
st.insert(s[i]);
... | 0 | 79,902,803 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long,long> pl;
typedef pair<ll,ll> pll;
typedef vector<long> vl;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef vector<vl> vvl;
typedef vector<vb> vvb;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<string> vs... | 0 | 53,628,007 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
els... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a,b,c,d;
ci... | 0 | 6,621,230 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> cnt(4);
for ( int i=0; i<3; i++ ) {
int a,b;
cin >> a >> b;
--a; --b;
cnt[a]++;
cnt[b]++;
}
sort(cnt.begin(),cnt.end());
if ( cnt[0]==1&&cnt[2]==2&&cnt[0]==cnt[1]&&cnt[2]==cnt[3] ) {
puts("YES");
} else {
puts... | #include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using VI=vector<ll>;
using VD=vector<ld>;
using VVI=vector<VI>;
using VC=vector<char>;
using VB=vector<bool>;
using VVC=vector<VC>;
using VS=vector<string>;
using PLL =pair<ll,ll>;
using PLD=pair<ld,ld>;
using VPLL=vector<PLL>;
... | 0 | 83,317,583 |
#include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
int dp[n + 1][m + 1], s[n], t[m];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
for (int i = 0; i <= m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 26,811,754 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 0 | 47,474,812 |
#include <iostream>
#include <cstdio>
using namespace std;
bool betemp(string sleft, string sright, long long left, long long right){
if(sleft == sright) return (right - left) % 2 == 1;
else return (right - left) % 2 == 0;
}
void solve(long long n){
string vac = "Vacant";
string sleft;
string sright... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL... | 0 | 55,556,819 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int a,b,c,d;
string s;
cin >> s;
a = s[0] - '0'; b = s[1] - '0';
c = s[2] - '0'; d = s[3] - '0';
if(a+b+c+d == 7)
cout << a << "+" << b << "+" << ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 | 22,531,993 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i=0; i<(int)S.size(); i++) {
if (S[i]=='1') {
cout << '9';
}
else {
cout << '1';
}
}
cout << endl;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void){
string S; cin >> S;
int i = 0;
int a, b; a = 0; b = 0;
while (i < S.size()) {
if (i % 2 == 0) {
if (S[i] == '0') {
a++;
}... | 0 | 64,529,880 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long int ll... | #include <iostream>
using namespace std;
using ll = long long;
int main(){
int n,i,cnt=0,ans=0;
ll h,h_pre=0;
cin >> n;
for(i=0;i<n;++i){
cin >> h;
if(h<=h_pre) ++cnt;
else{
ans = max(ans,cnt);
... | 0 | 75,705,958 |
#include <iostream>
int main()
{
int K;
int array[] = { 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 };
std::cin >> K;
std::cout << array[K-1];
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#define ull unsigned long long
using namespace std;
const int nmax = 100100;
int N;
ull A,B;
void solve(ull A, ull B);
void read(){
cin >> N;
for(int i=0;i < N; ++i){
cin >> A >> B;
so... | 0 | 89,421,884 |
#include<bits/stdc++.h>
using namespace std;
void display()
{
int a, b, c, d;
cin>>a>>b>>c>>d;
cout<<min(a, b) + min(c, d)<<endl;
}
int main(void)
{
display();
} | #include <iostream>
using namespace std;
int selectionSort(int A[], int N){
int sw = 0;
int minv;
bool flag;
for(int i = 0; i < N-1; i++){
minv = i;
flag = 0;
for(int j = i+1; j < N; j++){
if(A[minv] > A[j]){
minv = j;
flag = 1;
... | 0 | 11,374,041 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
#define lcm(x, y) ((x) * (y) / __gcd((x), (y)))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define debug(x) cout << #x << " : " << x << endl
#define part cout << "----------------------------------\n";
#includ... | #include <bits/stdc++.h>
#define REP(i,n) for (int 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;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 66,740,053 |
#include <iostream>
using namespace std;
int main()
{
int m,f,r;
for( ; ; ){
cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
if(m==-1 || f==-1){
cout << 'F';
}else if(m+f<30){
cout << 'F';
}else if(m+f<50 && m+f>=30 && r>=50){
cout << 'C';
}else if(m+f<50 && m+f>=30){
... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n, min, max;
cin >> n >> min >> max;
if(n == 0 && min == 0 && max == 0) break;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i]... | 0 | 64,188,113 |
#include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define rep(i,a,b) for (int i = a; i < b; ++i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifnd... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >> t;
int k = -1;
int S = s.length();
int T = t.length();
rep(i, S - T + 1) {
bool ok = true;
rep(j, T) {
if (s[i + j] ... | 0 | 67,928,150 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
scanf("%d%d",&a,&b);
if (a<b)
printf("a < b\n");
else if(a>b)
printf("a > b\n");
else printf("a == b\n");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int M;
cin >> M;
vector<string> t(M);
for (int i = 0; i < M; i++) {
cin >> t[i];
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
for (int ... | 0 | 68,294,839 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
template<typename T>
void trace(T *a, int s, int n) {
for (int i=s; i<n; i++) {
cout<<a[i]<<" ";
}
cout<<endl;
}
typedef long long ll;
cons... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 16,555,822 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
int n,q;
int par[10000];
int rank[10000];
void init(int n){
REP(i,n){
par[i]... | 0 | 87,783,470 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include<tuple>
#include<set>
using namespace std;
#define INF 1100000000000000000
#define MAX 100000
#define MOD 1000000007
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tup... | 0 | 9,603,443 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#include <stack>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF 100000
using namespace st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define GET_ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
#define LL long long
#define VI vector<int>
#define VL vector<LL>
#define VII vector< vector<int> >
#define VLL vector< vector<LL> >
#define VS vector<string>
#define ... | 0 | 83,129,289 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9+7;
int inf = 1000000000;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
sort(d.begin(),d.end());
int ans = d[n/2] - d[n/2-1];
cout << an... | #include <bits/stdc++.h>
using namespace std;
bool lrp[2];
int lr[2];
void c(bool f,char s){
if(s=='u'){
if(lrp[f]==0){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=1;
}else {
if(lrp[f]==1){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=0;
}
}
int main(){
i... | 0 | 27,833,690 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <iostream>
#include <set>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
typedef pair<int, double> Pid;
typedef pair<doub... | 0 | 61,664,670 |
#include<iostream>
using namespace std;
int main(void) {
string S, T; cin >> S >> T;
if (S == T.substr(0, T.size() - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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;
bool f=false;
if(s.at(5)=='0'){
... | 0 | 83,839,054 |
#include <iostream>
using namespace std;
int main(){
int n,i;
int temp;
double ans = 100;
cin >> n;
for(i = 0;i < n;i++){
ans *= 1.05;
temp = (int)ans;
if((double)temp != ans){
ans = (double)temp + 1;
}
}
cout << ans << "000" << endl;
return(0);
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 20,294,886 |
#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;
int64_t a[n];
rep(i,n) cin >> a[i];
sort(a, a+n);
int64_t suma[n+1];
suma[0] = 0;
rep(i,n) suma[i+1] = suma[i] + a[i];... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(uns... | 0 | 65,903,115 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | #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... | 0 | 21,867,276 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,a;
cin>>n>>a;
if(n<500)
{
if(a>=n)
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
}
else
{
n=n%500;
if(n<... | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 0 | 31,057,062 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int n1 = 0, n2 = 0, n3 = 0;
for (int i = 0; i < n; i++) {
if (p[i] <= a) {
n1++;
}
else if (p[i] <= b) {
n2++;... | #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 | 38,011,517 |
#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<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i < n; i++)
#define repd(i, n) for (int i = n-1; i > -1; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
using LP = pair<ll,ll>;
using P = pair<ll,int>;
ll inf = 1e18;
int main()
{
int h, w;
cin >> h >> w;
vector<s... | 0 | 72,267,915 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
P[i]--;
}
for (int i = 0; i < N; i++) {
cin >> Q[i];
Q[i]--;
}
vector<int> nums(N);
... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
char O[55],E[55];
scanf("%s %s",O,E);
for(int i = 0; O[i] != '\0'; i++){
printf("%c",... | 0 | 46,060,501 |
#include <stdio.h>
int main(void)
{
int a,b;
int d,r;
double aa,bb,f;
double ba = 1;
scanf("%d%d",&a,&b);
d = a / b;
r = a % b;
aa = a / ba;
bb = b / ba;
f = aa / bb;
printf("%d %d %f\n",d,r,f);
return(0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
ll K, A, B; cin >> K >> A >> B;
ll cnt = 1;
if(A+2 >= B){
cout << K+1 << endl;
return 0;
}
else{
for(int i = 0; i < K; i++){
if(... | 0 | 65,935,776 |
#include <bits/stdc++.h>
using namespace std;
string s,w="keyence";
int main(){
cin>>s;
string a,b;
for(int i=0;i<w.size();i++){
a=s.substr(0,i+1);
b=s.substr(s.size()-(7-i-1));
if(a+b==w){
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool judge(ll x)
{
printf("? %lld\n",x);
fflush(stdout);
char C;
scanf(" %c",&C);
return C == 'Y';
}
int main()
{
ll ans = 1000000000;
if(judge(ans))
{
ans = 10;
while(!judge(ans - 1))ans *= 10;
pr... | 0 | 31,560,854 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
ll n;
cin >> n;
map<ll, ll> m;
rep(i, 0, n) {
ll x;
cin >> x;
m[x]++;
}
ll m1 = 0, m... | #include<bits/stdc++.h>
using namespace std;
signed main(){
string s,c[4]={"dream","dreamer","erase","eraser"};
bool f;
int p,ans=0,l;
cin>>s;
for(int i=0;i<s.size();i++){
for(int j=0;j<4;j++){
f=1;
p=0;
for(int k=0;k<c[j].size();k++){
if(s[s.size()-1-i-k]!=c[j][c[j].size()-1-k])... | 0 | 10,453,174 |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 200005
#define ll long long
using namespace std;
int n,i,j,k,a[maxn],d[maxn],v[maxn],w;
int check(int K){
if (K==1){
for(int i=2;i<=n;i++) if (a[i]<=a[i-1])
return 0;
return 1;
}
w=1,d[w]=a[1],v[w]=0;
for(i=2;i<=n;i++) if (a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, pos[60];
ll p[60];
ll a[100005], b[100005];
ll sum = 0, occ = 0, ans = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%lld", a + i), sum ^= a[i], occ |= a[i];
int m = 0;
for (int i = 59; i >= 0; --i) {... | 0 | 74,548,265 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.