code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | 0 | 95,869,123 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 88,616,705 |
#include<iostream>
using namespace std;
int main(){
int a, cnt[101]={}, maxn=0;
while(cin>>a){
cnt[a]++;
if(maxn<cnt[a]) maxn=cnt[a];
}
for(int i=1;i<=100;i++){
if(maxn==cnt[i]) cout<<i<<endl;
}
return 0;
} | #include <cstdio>
#include <algorithm>
using namespace std;
int sum[1000001];
bool prime[1000001];
void sieve()
{
fill_n(prime, 1000001, true);
prime[1] = false;
for (int i = 2; i <= 1000000; ++i) {
sum[i] = sum[i - 1];
if (!prime[i]) continue;
sum[i]++;
for (int k = i + i; k <= 1000000; k += i) {
prime[k... | 0 | 20,949,652 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e9;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long long lcm(long long a, long long b) {
re... | #include<iostream>
#include<stdio.h>
using namespace std;
int parent(int i) {
return i / 2;
}
int left(int i) {
return 2 * i;
}
int right(int i) {
return 2 * i + 1;
}
int main() {
int n, A[100001];;
cin >> n;
for (int j = 1; j <= n; j++) scanf("%d", &A[j]);
for (int j = 1; j <= n; j++) {
... | 0 | 19,392,250 |
#include <cstdio>
#include <cmath>
double x[4],y[4];
struct vektor{
double x,y;
vektor(){}
vektor(double xx,double yy){
x=xx;
y=yy;
}
};
vektor vek[3];
vektor make_vektor(int i,int j){
return vektor(x[j]-x[i],y[j]-y[i]);
}
bool check(){
double s=-(vek[2].x*vek[1].y-vek[2].y*vek[1].x)/(vek[1].x*vek[0].y-vek[1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 51,203,222 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
#define all(x) (x).beg... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
int... | 0 | 64,448,270 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int b[101] = {}, n, a, mini = 100, maxi = 0, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
b[a]++;
if (b[a] >= 3) {
cnt++;
}
mini = min(mini, a);
maxi = max(maxi, a);
}
if (mini != (maxi + 1) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> z[i];
}
ll ans = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k+... | 0 | 61,108,018 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n % 2 == 1) {
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << n - i << endl;
}
} else {
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << n - i - (2 * i >= m) << endl;
}
}
return 0;
... | #pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld ... | 0 | 33,995,201 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) for(... | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 0 | 78,817,944 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
while(cin >> n, n) {
bool l=false, r=false;
bool state = false;
int cnt = 0;
rep(i, n) {
... | 0 | 64,675,367 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int A, B;
bool ans = false;
cin >> A >> B;
if(A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0)
ans = true;
if(ans) cout << "Possible" << "\n";
else cout << "Impossible" << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 10,700,484 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define int ll
signed main ()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
double now;
cin >> now;
now /= 3.0;
cout << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define int lli
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<lli> vli;
typedef vector<pii> vii;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0... | 0 | 51,364,459 |
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<int>;
const int maxn = 1<<19, mlg = 18, rt = 1<<10, mod = 1e9 + 7;
using ld = long double;
using pi = pair<int, int>;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void printVector(vector<int> v) {
for (auto x : v) {
cout << x << ' ';
}
cout << '\n';
}
void printArray(ll A[], int size) {
for (int i = 0; i <= size - 1; i++) cout << A[i] << ' ';
}
int main() {
int n = 0;
string s;... | 0 | 87,240,534 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | 0 | 24,305,021 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(void){
ll n;
cin >> n;
string str, t;
cin>>str>>t;
ll result = 0;
for(ll i = 0; i < n; i++){
for(ll j = 0; j < n; j++){
if(str[i+j]!=t[j]){
result=max(result, j);
brea... | #include <iostream>
#include <stdio.h>
#define INF 10000
using namespace std;
struct edge {
int from, to, cost;
};
edge es[100];
int d[11];
int n,maxV=0;
int shortest_path(int s){
int sum=0;
for(int i=0;i<maxV+1;i++){
d[i] = INF;
}
d[s] = 0;
while(1){
bool update = false;
... | 0 | 24,962,204 |
#include <stdio.h>
int main() {
double n,m,d;
scanf("%lf%lf%lf",&n,&m,&d);
printf("%lf\n",((d)?2:1)*(m-1)*(n-d)/(n*n));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD (1000000007)
#define f first
#define s second
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(), x.end()
#define print(vec,l,r) for(int i = l; i <= r; i++) cout << vec[i] <<" "; cout << endl;
#define forf(i,a,b) for(int i = (a); ... | 0 | 81,841,144 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
for(int i=0; i<k; i++) {
int d;
cin >> d;
vector<int> b(d);
for(int j=0; j<d; j++) {
cin >> b[j];
a[b[j]-1] = 1;
}
}
int ans = 0... | #include<iostream>
using namespace std;
int main(){
string a,b,c;
cin >> a >> b >> c;
bool ans = 0;
int la = a.size();
int lb = b.size();
int lc = c.size();
if((a.at(la - 1) == b.at(0))&&(b.at(lb - 1) == c.at(0))){
ans = 1;
}
if(ans){
cout << "YES" << endl;
}
... | 0 | 59,490,029 |
#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() {
string s,t;
cin >> s>>t;
int ans=0;
REP(i,s.length()){
if(s[i]==t[i]) continue;
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int main()
{
string s;
cin >> s;
const int n = s.length();
map<char, bool> f;
vector<long long> mask(n);
for (int i = 0; i < n; ++i) {
f[s[i]] ^= 1;
long long &now = mask[i];
for (int j = 'a'; j ... | 0 | 46,843,302 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long ;
int main() {
ll a;
cin>>a;
vector<char>vec(a);
vector<char>veco(a);
for(ll i=0;i<a;i++){
cin>>vec.at(i);
}
for(ll i=0;i<a;i++){
cin>>veco.at(i);
}
for(ll i=0;i<a;i++){
cout<<vec.at(i)<<veco.at(i);
}
cout<<endl;
retur... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <assert.h>
#include <stack>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define MX 10000000001
#define pow2(... | 0 | 30,044,682 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9+7;
int main() {
string r;
cin >> r;
int cnt = 0,ans ... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 24,319,491 |
#include<iostream>
using namespace std;
int par[10000];
int rank[10000];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rank[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | 0 | 39,736,031 |
#include <bits/stdc++.h>
using namespace std;
#define rep(k,nu) for(int i=k; i<nu; i++)
#define rep2(k,n) for(int j=k; j<n; j++)
#define INF 1000000000000
#define MOD 10000007
#define ll long long
#define pb pop_back
template<typename T> inline void chMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<typename T> inl... | #include<iostream>
using namespace std;
bool isStable (char C[], int A[], int N, char c[], int a[]) {
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
for (int x = 0; x < N - 1; x++) {
for (int y = x + 1; y < N; y++) {
if (A[i] == A[j] && A[... | 0 | 15,292,632 |
#include <iostream>
using namespace std;
int main() {
int d,i,s;
while (cin >> d) {
s=0;
for (i=d;i<600;i+=d) s+=d*i*i;
cout << s << endl;
}
return 0;
} | #include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
class Solution {
public:
int longestSubarray(vector<int>& nums, int limit) {
multiset<int>S;
int l=0;
S.insert(... | 0 | 29,319,676 |
#include <iostream>
#include <stdexcept>
#include <cassert>
#include <cmath>
#include <vector>
using namespace std;
int main() {
const long long M = pow(10, 18);
int N;
cin >> N;
vector <unsigned long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) { cout << 0 << endl; return 0; ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, n, val;
cin >> x >> n;
set<int> st;
for(int i=0;i<n;++i){
cin >> val;
st.insert(val);
}
int mini = INT_MAX, ans;
for(int i=x;i >= -1000;--i){
if(st.count(i) == 0){
if(mini > abs(x - i)){
ans = i;
mini = abs(x - i);
break;
}... | 0 | 52,129,108 |
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
ll A,B;
char op;
c... | #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... | 0 | 2,824,433 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
#... | #include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define log(x,b) (log(b)/log(x))
#define rep(i,x,y) for(int i=(x);i<(y);i++)
using namespace std;
int32_t main()
{
int n,m;
cin>>n>>m;
string s[n],t[n];
for(int i=0;i<n;i++){
cin>>s[i];
}
for(int i=... | 0 | 74,316,066 |
#include <iostream>
using namespace std;
const int N = 100000 + 10;
typedef long long LL;
const LL MOD = 998244353;
int n, d[N], mx;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i ++) {
int x; scanf("%d", &x);
if (i == 1 && x != 0) return !printf("0\n");
d[x] ++; mx = max(mx, x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char str[104];
int main(){
while(1){
stack<int> st;
bool judge = true;
fgets(str, 104, stdin);
if(str[0]=='.')break;
int i=0;
while(str[i] != '.'){
if(str[i]=='(' || str[i]=='['){
... | 0 | 54,031,373 |
#include "bits/stdc++.h"
using namespace std;
#define long int64_t
int main() {
ios_base::sync_with_stdio( false );
int N;
cin >> N;
vector<int> a( N );
for( auto& v: a ) { cin >> v; }
int ans = 0;
int x = a[0];
for( int i = 1; i < N; ++i ) {
if( a[i] == x ) {
x = 0;
ans += 1;
}
else {
x = a[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template<class T>... | 0 | 43,238,569 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | 0 | 35,329,246 |
#include <stdio.h>
#include <cctype>
int main(void){
char str[1201];
int i=0;
int n=0;
while(1){
scanf("%c",&str[i]);
n++;
if(str[i]=='\n'){
break;
}
if(islower(str[i])){
str[i]=toupper(str[i]);
}else if(isupper(str[i])){
str[i]=tolower(str[i]);
}
i++;
}
for(i=0;i<n;i++){
printf("%c",st... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 86,439,999 |
#include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> parent;
vector<int> size;
UnionFind(int n) {
parent.resize(n);
size.resize(n, 1);
for (int i = 0; i < n; i++) {
parent.at(i) = i;
}
}
int root(int x) {
if (parent.at(x) == x) {
re... | 0 | 17,763,601 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
ll mysqrt(ll x){
ll l=1,r=2e9;
while(l<r){
ll mid=(l+r)>>1;
if(mid*mid<x)l=mid+1;
else r=mid;
}
return l;
}
int main(){
ll s;
cin>>s;
ll x1=mysqrt(s);
ll y2=x1;
ll x2=x1*y2-s;
ll y1=1;
cout<<0<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | 0 | 4,972,836 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | 0 | 75,574,463 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for(int i=int(a);i<int(b);i++)
#define pb emplace_back
#define all(x) (x).begin(),(x).end()
ll mod=1e9+7;
ll mod2=998244353;
const int INF=1e9;
signed main(){
ll ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | 0 | 65,857,698 |
#include<iostream>
using namespace std;
int main()
{
int a,b,s;
cin>>a>>b>>s;
(a+b<s || a>s)? cout<<"NO" : cout<<"YES";
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 | 29,176,020 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using vb = vector<bool>;
using boolGraph = vector<... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 80,589,946 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int a[501];
int main(){
int n;
cin>>n;
rep(i,n) cin>>a[i];
rep(i,n){
int l=i*2+1,r=i*2+2;
cout... | 0 | 54,389,112 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a+b>=c) cout << "Yes"<<endl;
else cout << ... | #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bit... | 0 | 34,549,772 |
#include <iostream>
using namespace std;
int main(void){
int a, b, res;
cin >> a >> b;
res = (a - 1) * (b - 1);
cout << res << endl;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
ll N;
cin >> N;
ll T[N];
ll A[N];
for (int i = 0; i < N; ++i) {
ci... | 0 | 84,966,367 |
#pragma GCC optimize("Ofast",3,"inline")
#include<bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
#define m_p make_pair
#define y1 ygftgfgcdtfgxffgx
#define y2 yfdsesgvtyghftfvv
#define x1 xvyr6cf6fgcfgf676
#define x2 xcr6rfc5r66y6r6fr
#define up_bound upper_bound
#define low_bound lower_bound
... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 23,453,973 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>v;
int answer=0;
for(int i = 0 ; i< 2*n ;i++){
int k;
cin>>k;
v.push_back(k);
}
sort(v.begin(),v.end());
for(int i = 0 ; i < 2*n ; i+=2){
answer+=min(v.at(i),v.at(i+1));
... | #include <bits/stdc++.h>
#define LL long long
#define VI vector<int>
#define VB vector<bool>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(),... | 0 | 4,010,733 |
#include<iostream>
#include<queue>
#include<algorithm>
#include<numeric>
#include<string>
#include<map>
#include<bitset>
using namespace std;
using int_greater_PQ = priority_queue<int,vector<int>,greater<int>>;
int main()
{
int N;
cin>>N;
map<int,int>A;
for(int i=0;i<N;++i)
{
int a;
... | #include <stdio.h>
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,l,r) for(int i=l;i<r;i++)
using ll = long long;
const ll MOD=1e9+7;
const ll INF=9e18+10;
const int inf=2e9+10;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
int main(){
int k,n;cin>>k>>n;
... | 0 | 38,101,882 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int ans,x,n,i;
cin>>x>>n;
if(n==0)
cout<<x<<endl;
else
{
int a[102]={0};
for(i=0;i<n;i++)
{
cin>>ans;
a[ans]=1;
}
int f,b,fans;
for(i=x;i<=101;i++)
{
if(a[i]==0)
{
f=i;
break;
}
}
for(i=x;i>=0;i--)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,C,K,cnt = 0,cust = 0,time = 0;
cin >> N >> C >> K;
vector<int> T(N);
rep(i, N){
cin >> T[i];
}
sort(T.begin(),T.end());
cust++;
time = T[0];
... | 0 | 15,840,397 |
#include <iostream>
#include <cstdio>
using namespace std;
int n, m, x[10];
int c[10]={0,2,5,5,4,5,6,3,7,6};
string d[10005];
string f(string p, string q) {
if(p.size()>q.size() || p.size()==q.size() && p>q) return p;
return q;
}
int main() {
int i, j, t;
cin >> n >> m;
while(m--) {
cin >> t;
x[c[t]] = max(x[c... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 0 | 94,982,463 |
#include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)
#define mset(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
const int INF = 10000000... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
const int N = 1e5+10;
const ll INF = 1e15;
using namespace std;
vector<pair<int,ll>> Graph[N];
vector<ll> d;
void dijkstra (in... | 0 | 25,761,304 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long int
#define vi vector<int>
#define vl vector<LL>
#define pb push_back
#define all(V) V.begin(),V.end()
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("... | 0 | 18,212,010 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
templ... | 0 | 95,049,916 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long>vec;
for(long long i=1; i*i<=N+1; i++){
if(N%i == 0){
vec.push_back( N/i + i - 2);
}
}
sort(vec.begin(),vec.end());
cout << vec.at(0) << endl;
} | #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 | 99,524,373 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 5;
const int M = 2000 + 5;
char g[N][M];
struct Data {
int l, r, u, d;
Data () {}
} stat[N][M];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int... | #include <iostream>
using namespace std;
void doStdOut(const char *str){ cout << str << endl; }
int main()
{
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if( x < r || y < r || x + r > W || y + r > H )
{
doStdOut("No");
}
else
{
doStdOut("Yes");
}
return 0;
} | 0 | 219,703 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i+=2) {
t+=s[i];
}
cout << t << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | 0 | 72,254,442 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
#define fi first
#define print(v) for(ll i:v) cout<<i<<ss
#define se second
#define pb push_back
#define nn "\n"
#define all(p) p.b... | 0 | 6,742,374 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll m,k,nr;
int main()
{
cin>>m>>k;
nr=(1<<m)-1;
if(k>nr)
{
cout<<-1;
return 0;
}
if(m>=2)
{
for(int i=nr;i>=0;i--)
if(i!=k)
cout<<i<<" ";
cout<<k<<" ";
for(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi=3.14159265358979323846;
const long long inf = 1LL << 60;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -... | 0 | 62,890,353 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int res = 0;
for (int i = A; i <= B; i++) {
if (i/10000 == i%10) {
if (i/1000%10 == i%100/10) {
res += 1;
}
i += 9;
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp make_pair
#define pb push_back
#define endl "\n"
#define rep(i,a,n) for(int i=a;i<n;i++)
void solve() {
int d, t, s;
cin >> d >> t >> s;
if (d <= t * s) {
cout << "Yes" << endl;
return;
}
cout << "No... | 0 | 87,621,671 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B, C;
cin >> A >> B >> C;
vector<int> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
int min = 100000;
for (int i = 0; ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define LINF... | 0 | 12,677,865 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int a,b,c;cin >>a>>b>>c;
if(c>=a&&c<=b)puts("Yes");
else puts("No");
} | #include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
int a[105];
int solve(int n, int k) {
int dp[n + 5][k + 5];
for (int j = 0; j <= k; j++)
{
dp[1][j] = (j > a[... | 0 | 13,360,648 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<ll> A(N),B(N);
priority_queue<pair<ll,int>> pq;
rep(i,N){
cin >> A[i] >> B[i];
pq.push(m... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | 0 | 28,180,256 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | 0 | 91,604,764 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
T ifact[N+1];
constexpr ModFact() : fact(... | #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 | 55,165,111 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
temp... | #include <iostream>
using namespace std;
#define FORS(i, j, k, step) for (int i=j; i<k; i+=step)
#define FOR(i, j, k) for (int i=j; i<k; i++)
#define RFORS(i, j, k, step) for (int i=j; i>=k; i-=step)
#define RFOR(i, j, k, step) for(int i=j; i>=k; i--)
#define REP(i, k) for(int i = (0); i < (k); i++ )
#define RREP(i, k)... | 0 | 30,989,256 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
typedef tuple<long long, long long, long long> tllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
bool compTuple(co... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define ... | 0 | 68,547,369 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n,s,t,max,min,sum = 0;
cin >> n;
if(n == 0)break;
else{
cin >> s;
max = min = sum = s;
for(int i = 0; i < (n - 1);++i){
cin >> t;
if( t > max ){ max = t;}
if( t < min ){ min = t;}
sum += t;
}
... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 0 | 86,785,586 |
#include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
char ch; for(;!isdigit(ch=getchar()););
for(x=ch-'0';isdigit(ch=getchar());)x=x*10+ch-'0';
}
typedef long long LL;
const int MAXN = 300005;
int n, cnt[MAXN];
LL sum[MAXN];
int ans[MAXN];
inline bool chk(int k, int x) { return sum[x] >= 1ll*k*x; }
... | #include <iostream>
#include <vector>
using namespace std;
struct Node {
int parent;
int rank;
};
vector<Node> v;
void initialize(int n);
int find_set(int x);
void unite(int x, int y);
void disp(vector<Node> v);
bool same(int x, int y);
void initialize(int n) {
for (int i=0; i<n; i++) {
Node nd = {i... | 0 | 7,127,657 |
#include <iostream>
using namespace std;
int main (){
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r ;
if(0<x && 0<y && r<=x&&x<=W-r && r<=y&&y<=H-r ){
cout << "Yes" << endl;
}
else{ cout << "No" << endl;}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Benri { Benri() { std::cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12);}} benri;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using vvll = vector<vll>;
usin... | 0 | 48,359,750 |
#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;
using P = pair<int,int>;
int main(){
string A, B;
cin >> A >> B;
if(A.size() > B.size()... | #include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
const int val=1000000;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main(void){
int h,w;
int ans=0;
cin>>h>>w;
char a[h][w];
int num[h][w];
queue<P> que;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
if(a[i... | 0 | 55,631,637 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,p,ans=0;
int a[200005],b[200005],c[10005];
int quick_power(int a,int b)
{
int res=1;
for (;b;b=b>>1,a=(a*a)%p)
{
if (b&1) res=(res*a)%p;
}
return res;
}
signed main()
{
cin>>n>>p;
c[0]=1;
for (int i=1;i<=n;i++)
{
char x;
cin>>x;
... | /* https:
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#d... | 0 | 6,422,591 |
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
char *tmp[10] = {"", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
char buf[2000];
string out;
int main() {
int n;
cin >> n;
while(n--) {
cin >> buf;
int slen = strlen(buf);
int i, j;
for( i = 0; i < slen; i++ ) ... | #include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main()
{
int n, m;
cin >> n >> m;
Graph G(n);
rep(i, m)
{
int a,... | 0 | 47,913,493 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD = ll(1e9)+7;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll num[26] ={};
for(int i=0;i<N;i++){
num[S[i] -'a']++;
}
ll ans =1;
for(int i=0;i<26;i++){
ans *= (num[i]+1);
ans %=MO... | 0 | 22,341,276 |
#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<ll, ll>;
template <class T>
using V = vector<T>;
const int MAX = 64;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
V<ll> a(n);
rep(i, n) cin >> a[i];
V<V<P>> bits(n, V<P>(MA... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, D; cin >> N >> D;
vector<vector<ll>> X(N, vector<ll> (D));
for(ll i = 0; i < N; i++) {
for(ll j = 0; j < D; j++) {
cin >> X.at(i).at(j);
}
}
ll cnt = 0;
for(ll i = 0; i < N; i++) {
for(ll j = i + 1; j < N... | 0 | 26,607,396 |
#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;
typedef long long ll;
#define int long long
#define pb push_back
#define fi first
#define se second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.beg... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | 0 | 91,661,006 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
int len = S.size();
string rs = S;
reverse(rs.begin(), rs.end());
string S_left;
for(int i=0; i<(len-1)/2; ++i){
S_left += S[i];
}
string S_left_r... | #include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | 0 | 21,674,096 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main()
{
int n;
double ans=0;
cin>>n;
rep(i,n){
double a;
cin>>a;
ans+=1/a;
}
ans=1/ans;
printf("%.10f",ans);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 719,911 |
#include <iostream>
using namespace std;
using LL = long long;
int main() {
LL X, Y;
cin >> X >> Y;
int i = 0;
while (X <= Y) {
X *= 2;
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define inf 1e15
#define N 300005
int row[N];
int col[N];
vector<int>rowv,colv;
set<pair<int,int>>bomb;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t=1;
while(t--){
... | 0 | 28,663,393 |
#include<stdio.h>
char num1[10000000]={0},num11[10000000]={0},num2[10000000]={0},b[10000000]={0};
int main(void)
{
int n1=0,n2=0;
int i,j,k;
while(scanf("%d",&n1)!=EOF)
{
if(n1==0)break;
getchar();
for(i=0;i<n1;i++)
{
scanf("%[^\n]",b);
num1[i]=b[0... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define float long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define pii pair<int, int>
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define all(x) x... | 0 | 88,488,529 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int N, K;
cin >> N >> K;
double prob = 0;
for(int x = 1; x <= N; x++){
int n = ceil(log2(K) - log2(x));
double win = 0;
if(n > 0){
win = 1.0 / (1 << n);
}
prob += win;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Blue ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,a,n) for... | 0 | 51,358,486 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int main() {
string a;
long int n, total;
long int c[26];
for(int k = 0; k<26; k++){
c[k] = 0;
}
cin >> a;
n = a.length();
for(int i = 0; i<n; i++){
c[a[i] - 'a']++;
}
total = n*(n-1)/2 +1;
fo... | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int intervalState(int a, int b, int c, int d){
if(a <= c && b <= c) return 0; ... | 0 | 53,998,600 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
double x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
cout<<hypot(x2-x1, y2-y1)<<'\n';
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 10... | 0 | 65,816,118 |
#include <bits/stdc++.h>
using namespace std;
#include <vector>
int main(){
int N, M; cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
for (int m=0; m<M; m++){
int K; cin >> K;
for (int k=0; k<K; k++){
int s; cin >>s;
S[m].push_back(s);
}
}
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 8,880,745 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++)
{
cin >> a.at(i);
b.at(i)=a.at(i);
}
sort(b.begin(),b.end());
int mm=b.at(n-1),mn=b.at(n-2);
for(int i=0;i<n;i++)
{
if(a.at(i)==mm)
{
cout << mn << endl;
}
else
{
cout <<... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | 0 | 18,545,386 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[64] = { 0 };
int A,B,C;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d %d", &A, &B, &C);
int flag = 0;
for(int i = 0; i < A; i++){
int ans = (i * B + C) % A;
if(ans == 0){
flag = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007
#define INF 1e14
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>void p(T x){cout << x... | 0 | 40,170,692 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, N;
cin >> W >> H >> N;
int xmin = 0, xmax = W;
int ymin = 0, ymax = H;
while (N--) {
int x, y, a;
cin >> x >> y >> a;
... | #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>;
int main()
{
ll n, m, ans = 0;
cin >> n >> m;
vector<P> p;
rep(i, n)
{
double a, b;
cin >> a >> b;
p.push_back(P(a, b));
}
sort(p.... | 0 | 99,269,333 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#define pf push_front
#define pb push_back
#define pop_f pop_front
#define p... | #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 P... | 0 | 39,100,435 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
sort(t.begin(), t.end());
int ans = 1;
for (int i = 1, beg = t[0], num = 1; i < n; i++) {
if (t[... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using name... | 0 | 58,306,514 |
#include <iostream>
#include <vector>
int main(){
int a, b;
while(std::cin >> a >> b){
if(a == 0 && b == 0)break;
int obstacleNum;
std::cin >> obstacleNum;
std::vector<std::vector<int>> obstacle(a+1, std::vector<int>(b+1, 0));
std::vector<std::vector<int>> road(a+1, std::vector<int>(b+1, 0));
int tmp_a,tm... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s;
bool l,r,c;
while(1){
cin>>n;
if(n==0) break;
l=r=false;
c=true;
ans=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu") l=true;
else if(s=="ld") l=false;
else if(s=="ru") r=true;
else if... | 0 | 70,786,678 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using Graph = vector<vector<int>>;
const int MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> xyz(N, vec... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
ll n;
cin >> n;
ll ans=0;
if(n%2==0){
ll kani=5;
while(n>=kani){
ans+=n/(kani*2);
kani*=5;
}
}
cout << ans << endl;
} | 0 | 53,211,886 |
#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>
#include<random>
#include<ctime>
#include<set>
using namespace std;
const long long int mod=1000000007;
const lo... | #include <iostream>
using namespace std;
int main () {
int A, S=0, T=0, a, b, i;
for(i=0; i<4; i++) {
cin >> a;
S += a;
}
for(i=0; i<4; i++) {
cin >> b;
T += b;
}
A = S>T? S:T;
cout << A << endl;
} | 0 | 46,235,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
int main(){
ll N, M;
cin >> N >> M;
if(N == 1 && M == 1){cout << 1 << endl; return 0;}
else if(N == 1 || M == 1){cout << N * M - 2 << endl; retu... | #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(){
int n,m,x;
cin >>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i, n){
cin >> c[i];
rep(j, m){
cin >> a[i][j];
}
... | 0 | 73,453,371 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
struct edge{ll x,y;};
struct huga{ll honest; bool done;};
using namespace std;
vector<int>binary(ll temp){
vector<int>s;
while(temp){
temp--;
s.push_back(temp%2);
temp = temp / 2;
... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(10);
#define randomINIT mt19937 rnd(chrono::steady_clock:... | 0 | 76,023,314 |
#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, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string ans;
rep(i, n) ans += s[i];
cout << ans << endl;
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cc... | 0 | 10,121,819 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
if ((x-t) < 0){
cout << 0 << endl;}
else{
cout << x-t << endl;}
} | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 1,233,914 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
const int MAX=2e5+5;
int pre[26][MAX];
int dp[MAX];
int mask[MAX];
map<int,int> mp;
string s;
int main()
{
memset(dp,-1,sizeof dp);
cin>>s;
pre[s[0]-'a'][0]=1;
for(int i=1;i<s.length();i++)
{
for(int j=0;j<26;j++)
{
... | #include<iostream>
#include<list>
#include<queue>
#include<vector>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
priority_queue<int, vector<int>, greater<int>> pq;
int lim = min(n, k);
int maxv = 0;
... | 0 | 6,845,016 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int H, W, N;
P ab[100000];
map<P, bool> mp, use;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W >> N;
for(int i = 0; i < N; ++i) {
cin >> ab[i].first >> ab[i].second;
mp[... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define substr(s,f,t) (s.substr(f-1,t-f+1))
#define ALL(a) (a).begin(),(a).end()
#define Yes(hog... | 0 | 99,377,005 |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<long long> par;
UnionFind(int n){
par.assign(n,-1);
}
void unite(long long x, long long y){
x=root(x);y=root(y);
if(x==y) return;
if(par[x]>par[y]){
swap(x,y);
}
par[x]+=par[y];
par[y]=x;
}
long long roo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
string S, T;
vector<string> v;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> S >> T;
rep(i, S.size()-T.size()+1) {
bool flag = true;
rep(j, T.s... | 0 | 34,210,221 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
#define... | #include <iostream>
#include <string>
using namespace std;
int main () {
int a;
string p,s;
cin >> p >> s;
p += p;
a=p.find(s);
if(a==-1)cout <<"No"<<endl;
else cout << "Yes"<<endl;
} | 0 | 76,719,882 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <co... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 39,591,752 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vvl vector<vector<ll> >
#define vvi vector<vector<int> >
#d... | 0 | 23,953,911 |
#include <iostream>
#include<vector>
using namespace std;
int main() {
int n;cin>>n;
vector<long long> s(n),a(n);
long long sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
s[0]=a[0];
for(int i=1;i<n;i++){
s[i]=s[i-1]+a[i];
}
long long ans=s[0]-(sum-s[0]);
if(ans<0){
ans*=-1;
}
for(int i=1;i<n-1... | #include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int N, M;
int A[1 << 18], B[1 << 18], C[1 << 18], D[1 << 18];
int main() {
cin >> N >> M;
for (int i = 1; i <= N; i++) cin >> A[i] >> B[i];
for (int... | 0 | 42,986,696 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < (int)(... | #include<bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cerr << endl << #a << " : " << a << endl
#... | 0 | 57,795,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll M=1e9+7;
const ll MAXN=1e6+7;
const ld pi=acos(-1);
#define gi(n) ll n=read()
#define endl '\n'
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define per(i,a,b) for(ll i=b-1; i>=a; --i)
typedef vector<ll> V;
typedef vector<V... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
string s, t = "";
cin >> n;
int l = 0, r = n;
cout << 0 << endl;
cin >> s;
if (s == "Vacant")
return 0;
while (t != "Vacant") {
int m = (l + r) / 2;
cout << m << end... | 0 | 96,720,878 |
#include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pa... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int gcd(int a, int b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
in... | 0 | 91,639,591 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
int main(){
int n;
cin >> n;
vector<int> a(1e6+1);
rep(i,1e6+1) a.at(i)=0;
set<int> s;
rep(i,n){
int b;
cin >> b;
if(s.coun... | #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ios>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <cmath>
#include <sstream>
#include <numeric>
#include <deque>
#include <random>
using namespace std;
int main() {
vector... | 0 | 86,085,516 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.