code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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... | #include<iostream>
const static int INF = 1001001001;
int main(void){
int n, p, min, ans = 0;
min = INF;
std::cin >> n;
for(int i = 0; i < n; i++){
std::cin >> p;
if(min >= p){
min = p;
ans++;
}
}
std::cout << ans << std::endl;
return 0;
} | 0 | 6,433,892 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | 0 | 35,951,234 |
#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(void){
int n, m;
cin >> n >> m;
vector<int> h(n);
vector<bool> ok(n,true);
rep(i,n) cin >> h[i];
rep(i,m){
int a, b;
cin >> a >> b;
a--; b--;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
long long modinv(long long a, long long m) {
long long b = ... | 0 | 9,520,353 |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<c... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define MAX_N 200'000
using namespace std;
int A[MAX_N];
int D[MAX_N];
int main() {
int K, N;
cin >> K >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int max_d = 0;
int max_idx = 0;
for (int i = 0; i < N - 1; ++i) {
... | 0 | 57,593,959 |
#include<bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i,a,b) for( int i = a; i < b ; i++ )
#define sor(a) sort( a.begin(), a.end() )
#define rsor(a) sort( a.rbegin(), a.rend() )
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
typedef l... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 97,167,141 |
#include <bits/stdc++.h>
#define siz (int)3e5 + 7
using namespace std;
int n;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++){
if((360 * i) % n == 0){
printf("%d", (360 * i) / n);
break;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int,int>
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define extract_word(s) stringstream str(s); while(str>>word)
#define fastio ios_base::sync_with_stdio(false);cin.t... | 0 | 77,452,406 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi... | 0 | 55,578,435 |
#include <bits/stdc++.h>
#define BR "\n"
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define ALL(cont) begin(cont),end(cont)
#define AS_MOD(a,b) ((((a) % (b) ) + (b)) % (b))
#define FEACH(it,cont) for(auto (it) = begin(cont); it!=end(cont);++it)
#define FEACHR(it,cont) for(auto (it) = rbegin(cont); it!=rend(cont);++i... | #include <iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void){
int n,d;
cin>>n>>d;
vector<vector<int>> vec(n+1, vector<int>(d+1));
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
cin>>vec[i][j];
}
}
int answer=0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
... | 0 | 57,200,576 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
ll L0 = 2;
ll L1 = 1;
int N; cin >> N;
if (N == 1) { cout << 1 << endl; return 0;}
ll ans;
rep(i,N-1){
ans = L0 + L1;
swap(L0, L1);
L1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(){
int h, n;
cin >> h >> n;
vector<int> dp(h+1, INF);
dp[0] = 0;
rep(i,n) {
int a, b;
cin >> a >> b;
re... | 0 | 82,392,721 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long H,W,N;
cin >>H>>W;
long long Sa,Sb,Sc,ans;
ans=100000000;
for(int i=1;i<H;i++){
Sa=i*W;
Sb=(H-i)*(W/2);
Sc=(H-i)*(W-(W/2));
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
for(int i=1;i<H;i++){
Sa=i*W;
Sb=((H-... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, m;
string s, p;
int main(){
cin >> s >> p;
n = s.size();
m = p.size();
s += s;
rep(i, n){
if(p == string(s, i, m)){
cout << "Yes" << endl;
... | 0 | 28,627,546 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl>... | #include <algorithm>
#include <iostream>
using namespace std;
#define ALL(x) begin(x), end(x)
int main() {
int W, H, N;
cin >> W >> H >> N;
int xmin{0},xmax{W},ymin{0},ymax{H};
int x,y,a;
for (int i = 0; i < N; i++) {
cin >> x >> y >> a;
switch(a) {
case 1:
xmin = max(xmin,x);
br... | 0 | 38,991,105 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
int main() {
FIO;
ll a, b... | 0 | 82,310,710 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
vector<int>... | 0 | 60,624,634 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
int x,y;cin >> x >> y;
ll ans = 0; int a[x];
for(int i = 0;i < x;i++){
cin >> a[i];
}
for(int i = 1;i < x;i++... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >> s;
if(s[0]!='A'){
cout << "WA" <<endl;
return 0;
}
int cnt = 0;
... | 0 | 49,538,780 |
#include <iostream>
int main(int argc, char** argv)
{
while (true)
{
int height, width;
std::cin >> height >> width;
if (height == 0 && width == 0)
{
break;
}
for (int h = 0; h < height; ++h)
{
for (int w = 0; w < width; ++w)
{
if ((h == 0 || h == (height - 1)) ||
(w == 0 || w == (widt... | #include<iostream>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define lvi vector<long long>
#define pi pair<int,int>
#define lpi pair<long long ,long long>
#define mp make_pair
#define pb push_back
#define ll long long
#define N 100005
#... | 0 | 24,030,182 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
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(unsigned long x) {cerr << x;}
void __print(... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 998244353;
int main()
{
long long n, x, m; cin >> n >> x >> m;
long long ans = 0;
vector<long long> remain; int cnt = 0;
vector<int> used(m+1); used[m] = 1;
remain.push_back(x); cnt++;
long long cur = (x*x) % m; long long sum = x;
... | 0 | 98,073,506 |
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int infty = static_cast <int> (pow(256, sizeof(int)) / 2 - 1);
class cDisjointSet
{
vector<int> vp;
vector<int> vrank;
public:
cDisjointSet(int n);
void makeSet(int x);
void uunionn(int x, int... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#include <bi... | 0 | 29,178,529 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vec... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 0 | 47,578,248 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 84,933,066 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define rep2(x,from,to) for(int x=(from); x<(to); (x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
string s;
vector<string> str1;
set<string> str2;
while(cin >> s) {
str1.push_back(s);
str2.insert(s)... | #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(... | 0 | 14,174,233 |
#include <iostream>
using namespace std;
int main(){
int n,i,j;
cin >> n >> i;
j=(n-i)+1;
cout << j;
return 0;
} | #include <iostream>
using namespace std;
long long MAX = 1e18;
int main(void)
{
int n; cin >> n;
long long prod = 1;
long long a;
for (int i = 0; i < n; i++)
{
cin >> a;
if (prod != 0)
{
if (a <= MAX / prod || a == 0) prod *= a;
else prod = -1;
... | 0 | 48,127,969 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans +=... | 0 | 10,774,966 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , N_, a ;
cin>>N;
N_=N;
a=0;
for(int i=0 ; i<N ; i++){
int b ;
b=N_%10;
N_ = (N_-b)/10;
a +=b;
}
if(N%a==0){
cout<< "Yes" << endl;
}
else{
cout<<"No"<<endl;
}
} | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 10,955,615 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A;
cin >> N >> A;
int ans = N % 500;
if(A >= ans){
cout << "Yes" << '\n';
}else{
cout << "No" << '\n';
}
return 0;
} | #include<bits/stdc++.h>
std::vector<int> A;
int inf = 1001001001;
int parent(int key){
int parent = key / 2;
return parent;
}
int heapIncreaseKey(int i, int key){
if(key < A[i]){
return 0;
}
A[i] = key;
int pa = parent(i);
while(i > 1 && A[pa] < A[i]){
std::swap(A[i], A[pa]);... | 0 | 19,624,447 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A - 1) * (B - 1));
return 0;
} | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 54,449,267 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
long calc(string s) {
long ret = 0;
string tmp = "";
char op = '+';
for (int i = 0; i < s.size(); i++) {
if (s[i] == '+' || s[i] == '-') {
if (op == '+') {
ret += atol(tmp.c_str());
} else {
ret -= atol(tmp.c_str());
}
op ... | 0 | 65,729,534 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
#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 = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 57,535,367 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 50,159,067 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int a, b, r1,rem;
double r2;
cin >> a >> b;
r1 = a / b;
rem = a % b;
r2 = 1.0 * a / b;
cout << r1 << " " << rem << " ";
printf("%.8lf\n", r2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | 0 | 73,747,171 |
#include <stdio.h>
int main () {
int a,b;
int tampung = 1;
scanf("%d", &a);
scanf("%d", &b);
for ( int i = 0 ; i < a; i++) {
if (tampung <= b) {
tampung *= 2;
} else {
tampung += b;
}
}
printf ("%d\n", tampung);
return 0;
} | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 1,728,878 |
#include<bits/stdc++.h>
using namespace std;
string comp(string a,string b){
if(a.size()>b.size()){
return "GREATER";
}else if(a.size()<b.size()){
return "LESS";
}else{
for(int i=0;i<a.size();i++){
if(a.at(i)>b.at(i))
return "GREATER";
else if(a.at(i)<b.at(i))
return "LESS"... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 8,611,103 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define R... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
double avg=arr[0]+arr[1];
avg/=2;
for(int i=2;i<n;i++)
{
avg+=arr[i];
avg/=2;
}
... | 0 | 69,481,747 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int m=999;
for(int i=2;i<s.size();i++)
m=min(m,abs(753-stoi(s.substr(i-2,3))));
cout<<m<<endl;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 92,215,895 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> arr(n, vector<int>(3));
for(int i = 0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = ... | 0 | 100,789,451 |
#include <iostream>
using namespace std;
int main(void)
{
int m, f, r;
while (true) {
cin >> m >> f >> r;
if ( m == -1 && f == -1 && r == -1) break;
else if (m == -1 || f == -1) cout << 'F' << endl;
else if (m + f >= 80) cout << 'A' << endl;
else if (m + f >= 65 && m + f ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 90,928,991 |
#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>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(){
int w, h;
cin >> w >> h;
vector<pair<ll, ll>> v;
for(int i=0; i<w; i++){
ll p;
cin >> p;
v.push_back(make_pair(p, 0));
}
for(int i=0; i<h; i++){
ll q;
cin >> q;
v.push_back(make_pair(q, 1));... | 0 | 37,437,095 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
#define rep3(i,n,m) for(long long i=n;i>=m;i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void chmax(ll& a,... | 0 | 97,753,968 |
#include <iostream>
using namespace std;
int main()
{
int x,i=1;
while(1)
{
cin>>x;
if(x!=0)
{
cout<<"Case"<<" "<<i<<": "<<x<<endl;
i++;
}
else
{
return 0;
}
}
} | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
LL p = 1000000007ll;
vector<LL> dx, dy;
vector<LL> dxsum(1), dysum(1);
map<pair<LL,LL>,LL> memo;
LL solve(LL x, LL n)
{
if(abs(x)>dxsum.back()-dxsum[n]) return 0;
if(abs(x)==dxs... | 0 | 52,488,184 |
#include <ext/rope>
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define read(arr, l, r) for(int i = (l); i < (r); cin >> arr[i++])
#define print(arr, l, r) for(int i = (l); i < (r); cout << arr[i++] << " \n"[i == r])
#define rep(i, l, r) for (i... | #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(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | 0 | 15,649,957 |
#include<stdio.h>
int main(void){
int a,b,c;
scanf("%d %d %d\n",&a,&b,&c);
if(a < b && b < c){
printf("Yes\n");
}
else{
printf("No\n");
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 43,303,368 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
while(1){
bool pl = false;
rep(i, n){
if (h[i] != 0){
h[i]--;
if (!pl)... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
... | 0 | 93,045,805 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100000
#define INF 99999999
int n, mn = INF, mx, cnt, a[maxn], b[maxn];
int read()
{
int x = 0, k = 1;
char c; c = getchar();
while(c < '0' || c > '9') { if(c == '-') k = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 + c - '0', c= ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 54,257,134 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, t;
cin >> n >> t;
vector<int> a(n);
ll ans = 0;
rep(i, n) cin >> a[i];
for(int i = 1; i < n; ++i){
ans += min(t, a[i] - ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | 0 | 8,536,452 |
#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 a, b;
cin >> a >> b;
string s = "Yay!";
if (a > 8 || b > 8) s = ":(" ;
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 pb push_back
#define sz(a) ... | 0 | 56,666,799 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a<c && c<b && b<d) cout << b-c << endl;
else if(a<=c && d<=b ) cout << d-c << endl;
else if(c<a && a<d && d<b ) cout << d-a << endl;
else if(c<=a && d>=b) cout << b-a << endl;
else cout << 0 << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B;
cin >> A >> B;
if ((A <= 8) && (B <= 8)) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | 0 | 28,491,109 |
#include <iostream>
using namespace std;
int main(void)
{
int number1, number2;
cin >> number1 >> number2;
if (number1 == number2) {
cout << "a == b" << endl;
} else if (number1 < number2) {
cout << "a < b"<< endl;
} else {
cout << "a > b" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int solve() {
int n, k; cin >> n >> k;
vi v(n, 0);
for (int i = 1; i <= k; ++i) {
int d; cin >> d;
int a;
while (d--) {
cin >> a;
v[a - 1]++;
}
}
int cn... | 0 | 41,299,701 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> P_vec(N), Q_vec(N);
for (int i = 0; i < N; ++i)
cin >> P_vec.at(i);
for (int i = 0; i < N; ++i)
cin >> Q_vec.at(i);
vector<int> perm(N);
for (int i = 0; i < N; ++i)
perm.at(i) = i ... | #include <cstdio>
#include <cctype>
using namespace std;
int main(){
char A;
int C[26]={0},i;
while( scanf("%c", &A)!= EOF){
if(isalpha(A)){
A=tolower(A);
int i=A-'a';
C[i]++;
}
}
for(int i=0; i<26; i++){
printf("%c : %d\n",i+'a',C[i]);
}
return 0;
} | 0 | 51,461,895 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
re... | #include<iostream>
#include<map>
#include<utility>
using namespace std;
template<typename T>
class UnionFind {
std::map<T, T> parent;
std::map<T, int> rank;
public:
void unionSet(const T& a, const T& b) {
T x = findSet(a), y = findSet(b);
if(rank[x] < rank[y]) std::swap(x, y);
parent... | 0 | 94,054,186 |
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <sstream>
#define ll long long
#define F first
#define S second
#define pb push_back
#define ld long double
#define pll pair<long long,long long>
#define pld pair<long double,long double>
#define ios ios_bas... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF ... | 0 | 15,411,381 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
if(s.front()!='A') {cout << "WA" << endl; return 0;}
bool ok = true;
int cnt = 0;
if(s[1] >= 'A' ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
char... | 0 | 48,269,410 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define CMAX(m, x) m = max(m,x);
#define CMIN(m, x) m = min(m,x);
#define itn int
typedef long lon... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 69,772,157 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
int R, G;
void input() {
cin >> R >> G;
}
int main() {
input();
int ans = 2 * G - R;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
int n, k;
cin >>... | 0 | 52,295,533 |
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<iterator>
#include<iomanip>
#include<string>
using namespace std;
int main()
{
int n;
cin>>n;
vector<long long int>fac(n+1,0);
int i=1;
while(i<=n)
{
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int... | 0 | 37,991,207 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
ll x, y;
ll x_vertex[N];
ll y_vertex[N];
vector<ll> x_coords;
vector<ll> y_coords;
for (int i... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
long long hidari=0;
long long migi=N;
vector<int> card(N, 1);
for (long long i=0; i<M; i++) {
long long L, R;
cin >> L >> R;
for (long long i=hidari; i<L-1; i++) card.at(i) = 0;
... | 0 | 48,090,955 |
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<map>
#include<set>
#include<vector>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<numeric>
#include<string>
#include<tuple>
using namespace std;
#define BEGIN ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#de... | #include <stdio.h>
#include <algorithm>
int main(void)
{
while(true) {
int M=0,m=50000,n,sum=0;
scanf("%d", &n);
if(n==0) break;
for(int i=0; i < n; i++)
{
int s;
scanf("%d", &s);
M = std::max(s, M);
m = std::min(s, m);
... | 0 | 32,265,688 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 1000000;
const ll INF = (1LL << 31) - 1;
const double pi=acos(-1);
long double n,m,d,ans=0;
int main(){
cin >> n >> m >> d;
if(d==0){
ans=(m-1)/n;
}
else{
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
string s;
string t;
cin >> s >> t;
... | 0 | 78,940,326 |
#include <iostream>
using namespace std;
void reverse(int *array, int length) {
int i;
int j;
for(i=0;i<length-1;i++){
for(j=i+1;j<length;j++){
if(array[i]<array[j]){
int temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}
}
}
int main() {
int mountain[10];
for (int i = 0; i < 10; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int ... | 0 | 56,400,014 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
cout << a*a << endl;
} | #include <iostream>
#include <cassert>
#define REP(i,l,n) for(int i=l;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define MAX 21
int ans,baseX,baseY;
int w,h;
char tile[MAX][MAX];
void seek(int x,int y);
using namespace std;
int main() {
while(1){
cin >> w;
cin >> h;
if(w==0&&h==0) return 0;
rep(i,h){
... | 0 | 32,642,452 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A>B && A !=1 && B!=1)
cout<<"Alice"<<endl;
else if(A<B && A !=1 && B!=1)
cout<<"Bob"<<endl;
else if(A==B)
cout<<"Draw"<<endl;
else if(A ==1 && B!=1)
cout<<"Alice"<<endl;
else if(A... | #include <iostream>
using namespace std;
int coin(int X){
int ans = 0;
ans = X / 500;
ans = ans + (X % 500) / 100;
ans = ans + ((X % 500) % 100) / 50;
ans = ans + (((X % 500) % 100) % 50) / 10;
ans = ans + ((((X % 500) % 100) % 50) % 10) / 5;
ans = ans + (((((X % 500) % 100) % 50) % 10) % 5)... | 0 | 2,181,681 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
#define maxn 1000
using namespace std;
char tu[maxn][maxn];
int dp[maxn][maxn];
int main(){
int r,c;
cin >> r >> c;
getchar();
for (int i=1; i<=r; i++){
for(int j =1;j<=c;j++){
scanf("%c",&tu[i][j]);
}
getchar();
}
if(tu[1][1]=='#'){
... | 0 | 25,691,103 |
#include <iostream>
using namespace std;
int main()
{
int qq;
for(int i = 1; i < 10; i++){
for(int iq = 1; iq < 10; iq++){
qq = i * iq;
cout << i << "x" << iq << "=" << qq << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define tc ll t; cin >> t; while (t--)
#define s... | 0 | 58,770,715 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin>>N;
bool check=false;
for(int i=0;i<N/4+1;i++){
for(int j=0;j<N/7+1;j++){
if(4*i+7*j==N){
check=true;
}
}
}
if(check){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | 0 | 18,326,936 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
ll add(ll a, ll b) {
return ((a%mod) + (b%mod)) % mod;
}
ll sub(ll a, ll b) {
return ((a%mod) - (b%mod) + mod) % mod;
}
ll mul(ll a, ll b) {
return ((a%mod)*(b%mod)) % mod;
}
int main() {
int n, m;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<ll> x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
ll ans = LLONG_MAX;
rep(i, n) rep(j, n) rep(s, n) rep(t, n) {
ll xl = x[i];
... | 0 | 93,782,432 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#define FOR(i, a, b) for(int i=a; i<b; ++i)
#define rFOR(i, a, b) for(int i=a-1; i>=b; --i)
#define REP(i, n) for(int i=0; i<n; ++i)
#define rREP(i, n) for(int i=n-1; i>=0; --i)
#define all(a) a.begin(), a.end... | #include <iostream>
#include <vector>
#include <string>
int main()
{
int h, w;
std::cin >> h >> w;
std::vector<std::string> buffer;
buffer.reserve(h);
for (int i = 0; i < h; ++i)
{
std::string tmp;
std::cin >> tmp;
buffer.emplace_back(std::move(tmp));
}
for (int i... | 0 | 97,832,774 |
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#de... | #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 | 66,384,261 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv... | 0 | 5,524,080 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
string alphabet="abcdefghijklmnopqrstuvwxyz";
int main() {
string s,t; cin>>s>>t;
vector<int> vs(26,0), vt(26,0);
rep(i,s.size()){
int x;
rep(j,26){
if(s[i]==alphabet[j]){x=j; break;}
}
vs[x]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> asum(n+1);
rep(i, n) {
cin >> a[i];
if ( i == 0 ) asum[0] = abs(a[i]);
else asum[i] = asum[i-... | 0 | 90,328,074 |
#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;
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define debug(...) 42
#endif
#define sf scanf
#define pf printf
#define nl printf("... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 0 | 23,565,056 |
#pragma GCC optimize("O3","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zeroupper")
#pragma GCC target("avx","popcnt")
#include <x86intrin.h>
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define mp make_pair
#define hello cout<<"hello"<<"... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans = 1000000000;
for (int i = -100; i <= 100; i++){... | 0 | 92,933,183 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << max(max(abs(a-b),abs(b-c)),abs(c-a));
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define INF 1000000000
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main()
{
int n;
cin >> ... | 0 | 50,854,164 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N,ans = 0;
cin >> N;
string s[N];
rep(i,N)cin >> s[i];
for(int k=0;k<N;k++){
bool ok = 1;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if((i+k)%N==j)contin... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 95,462,493 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
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 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
vector<int> prime(int N) {
vector<bool> a(N, true);
for(int i=1; i<sqrt(N); i++) {
... | 0 | 28,697,806 |
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
vector<int> c(n+1, 0);
int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; c[a[i]]++; }
int mn = *min_element(a, a+n), mx = *max_element(a, a+n);
bool ans = mn == (mx + 1) / 2 && (mx % 2 ? ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(int i=s;i<t;i++)
#define MAXNUM 333333
int num[MAXNUM];
int main()
{
int n,a;scanf("%d",&n);
rep(i,1,n+1)scanf("%d",&a),num[a]++;
sort(num+1,num+n+1);
int nowres=n,nownum=n,nowpos=n,x=0;
rep(i,1,n+1)
{
while(nowres*1ll*... | 0 | 78,958,910 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double t,x;
cin>>t>>x;
cout<<t/x<<setprecision(4);
} | #include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | 0 | 49,205,959 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +... | 0 | 10,382,124 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll n, m, x, ans = 1e18;
cin >> n >> m >> x;
ll c[12][13] = {};
rep(i,n) rep(j,m + 1) cin >> c[i][j];
for (int i = 0; i < (1 << 12); i++) {
ll rez[13] = {};
... | 0 | 94,073,240 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<long long, int> prime_factorize(long long n) {
map<long long, int> res;
for (long long p = 2; p * p <= n; ++p) {
while (n % p == 0) { ++res[p]; n /= p; }
}
if (n != 1) res[n] = 1;
return res;
}... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,pos;
int sum = 0;
string str="", x="";
int t;
vector<string> s;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>str>>t;
s.push_back(str);
a.push_back(t);
}
cin>>x;
for(int i=0;i<n;i++)
{
if(s[i]==x... | 0 | 57,607,889 |
#include<iostream>
#include<string>
#define rep(i,n) for(int i=0; i<n; i++)
int m[4] = {1000,100,10,1};
char c[4]= {'m','c','x','i'};
int toint(std::string str){
int d=1;
int sum = 0;
rep(i,(int)str.size()){
if('0' <=str[i] && str[i] <= '9'){
d=str[i] - '0';
}else{
rep(j,4){
if(c[j] == str[i]){
su... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | 0 | 49,074,804 |
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int ans = 100000;
int tmp;
for (int i=0; i<n; i++) {
ans *= 1.05;
tmp = ans / 1000 * 1000;
if (tmp != ans) ans = tmp + 1000;
}
cout << ans << endl;
return 0;
} | #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
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
i... | 0 | 73,331,242 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | #include<iostream>
#include<queue>
#include<vector>
#include<string>
#include<utility>
using namespace std;
int solve(const vector<string> mp, vector<pair<int,int>> points, int h, int w, int s, int e) {
int cx,cy;
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
vector<vector<int>> memo(w,vector<int>(h,0))... | 0 | 76,233,556 |
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s;
std::vector<std::string> vs;
for (int i = 0; i < n; ++i) {
std::cin >> s;
vs.push_back(s);
}
bool flag = true;
std::string temp = vs[0];
for (int i = 1; i < n; ++i) {
... | #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>
#incl... | 0 | 59,961,391 |
#include <cstdio>
using namespace std;
constexpr int MOD = 1000000007;
int main() {
int N;
scanf("%d%*c", &N);
bool S[N * 2];
char c;
for(int i = 0; i < N * 2; i++) {
scanf("%c", &c);
S[i] = (c == 'B');
}
long long ans = 1;
int acc = 0;
for(int i = 0; i < N * 2; i++) {
if((acc & 1) ^ S[i]) {
acc++;
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define EPS 0.00000000001
using namespace std;
int main()
{
double x1,x2,x3,x4,y1,y2,y3,y4;
double dx1,dy1,dx2,dy2;
int n;
int i;
cin>>n;
for(i=0;i<n;i++){
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
dx1=x2-x1;
dy1=y2-y1;
dx2=x... | 0 | 80,094,121 |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <numeric>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <tuple>
using ll = long long int;
using ul = unsigned long long int;
const ll LL_MAX (1LL<<60);
const... | #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;
vector<ll> A(N);
vector<ll> num(N+1, 0);
rep(i, N){
cin>>A[i];
num[A[i]]++;
}
ll sum=0;
rep(i, N){
i... | 0 | 13,777,009 |
#pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vec... | #include <iostream>
using namespace std;
int main(void)
{
char str[1001], ord[8];
int i, j, q, a, b;
cin >> str >> q;
for (i = 0; i < q; i++) {
cin >> ord >> a >> b;
if (ord[2] == 'i') {
for (j = a; j <= b; j++)
cout << str[j];
cout << endl;
} else if (ord[2] == 'p') {
char rep[b - a... | 0 | 85,170,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) ans.at(A.at(i) - 1) = i + 1;
for (int i = 0; i < N; i++) {
if (i == N - 1) cout << ans.at(... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | 0 | 92,099,030 |
#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;
ll exp... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 0 | 35,342,516 |
#include <stdio.h>
int main()
{
int K;
int X;
scanf("%d", &K);
scanf("%d", &X);
(K * 500 >= X) ? puts("Yes") : puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> seive(2000001);
long int n,k;
cin >> n;
for(int i=0;i<n;i++){
cin >> k;
seive[k]++;
}
long int not_divisible=0;
vector<int> divisible(2000001,0);
for(int i=1;i<=2000000;i++){
if(seive[i]==0 || divisible[i])
... | 0 | 52,233,782 |
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void one_case() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
++mp[a];
}
int res = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n, m, l=0, r=INF;
... | 0 | 9,315,081 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
int main() {
int a[5];
rep(i, 5)scanf("%d", &a[i]);
sort(a, a + 5, greater<>());
rep(i, 5)cout << a[i] << (i == 4 ? '\n' : ' ');
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | 0 | 63,767,891 |
#include<stdio.h>
#define Max 45
int F[Max];
int fibonacci(int n){
if( n == 0 || n == 1)
return F[n] = 1;
if( F[n] != NULL )
return F[n];
return F[n] = fibonacci(n - 2) + fibonacci(n - 1);
}
int main(){
int n, i, A;
scanf("%d",&n);
for( i = 0 ; i <= n ; i++)
A = fibonacci(i);
printf("%d\n",A... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9+7;
int main() {
int H, W;
cin >> H >> W;
vec... | 0 | 16,645,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N;
cin >> N;
map<ll, int> mp;
vector<ll> A(N);
for (int i = 0; i < N; i++)
{
ll a;
cin >> a;
if (mp.count(a))
mp[a]++;
else
mp[a] = 1;
A[i] = a;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 62,600,017 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k=0,l=0,b=0;
cin>>n;
vector<ll> v(n+1,0);
for (ll i = 0; i < n; ++i)
{
cin>>v[i];
}
sort(... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 24,721,148 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
... | #include <iostream>
using namespace std;
void solve(long long s){
int count = 0;
if (s == 1) count = 0;
else if (s == 2) count = 0;
else {
while (s != 4) {
if (s % 2) s = 3 * s + 1;
else s /= 2;
count++;
}
}
cout << count + 4 << '\n';
}
int mai... | 0 | 93,061,200 |
#include <iostream>
static void printQq();
static const int Max = 10;
int main(int , char **)
{
printQq();
return 0;
}
static void printQq()
{
for (int i = 1; i < Max; ++i) {
for (int j = 1; j < Max; ++j ) {
std::cout << i << "x" << j << "=" << i * j << std::endl;
}
}
} | #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 | 36,156,501 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int N = s.size(... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd se... | 0 | 62,236,914 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
vector<int> vec(3);
cin>>vec[0]>>vec[1]>>vec[2];
sort(vec.begin(),vec.end());
cout<<vec[2]-vec[0]<<endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 71,383,626 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define fi first
#define se second
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
typedef pair<int,int> P;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define abs(x) ((x)>0?(x):-(x))
#define y1 hhf
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
cin >> n >> k;
long long a[n];
long long com=0;
for(int i=0;i<n;i++){
cin >> a[i];
com = __gcd(com,a[i]);
if(a[i]==k){
cout << "POSSIBLE" << endl;
return 0;
}
}
so... | 0 | 66,842,828 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printdbl(a) printf("%lf\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d... | 0 | 39,608,887 |
#include <bits/stdc++.h>
using intl = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define repd(i, n) for(intl i = (intl)(n); i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define repid(i, a, b) for(intl i = (intl)(a); i >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n; cin >> n;
ll T[n], A[n];
for(int i=0;i<n;i++) cin >> T[i];
for(int i=0;i<n;i++) cin >> A[i];
vector<pair<ll, bool> > vp;
for(int... | 0 | 50,936,817 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s1,s2;
cin>>s1>>s2;
int n1 = s1.length();
int n2 = s2.length();
if (n1 = n2 + 1){
for (int i = 0; i<s1.size(); i++){
if (s1[i] != s2[i]){
cout<<"No";
return 0;
}
}
cout<<"Yes";
}
else{
cout<<"No";
}
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf =... | 0 | 47,041,272 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.