code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
int main(){
int X,A,B;
cin>>X>>A>>B;
int time=A-B;
if(time>=0){
cout<<"delicious";
return 0;
}
else if(time*-1<=X){
cout<<"safe";
return 0;
}
else{
cout<<"dangerous";
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(){
... | 0 | 51,303,358 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(all(v));
double price = (double... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<P> v(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
v[i] = P(b, a);
}
vector<P> w(N);
for (int i = 0; i < N; i++) {
int c, d;
cin >... | 0 | 70,530,336 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include <iostream>
int main(int argc, const char * argv[]) {
std::string line;
int chars[26] = {};
for ( ; getline(std::cin, line); ) {
for (size_t i = 0; i < line.length(); i++) {
if ('a' <= line[i] && line[i] <= 'z') {
chars[line[i] - 'a']++;
} else if ('A'... | 0 | 5,608,979 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<pair<string, int>> v(n);
for(auto &x:v) cin >> x.first >> x.second;
string p; cin >> p;
bool found = false; int ans = 0;
for(int i=0;i<n;i++){
if(v[i].first == p){
found = true;
cont... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647 >> 1);
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5... | 0 | 63,655,619 |
#include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>
#include<utility>
#include<cctype>
#include<climits>
#include<map>
#include<queue>
#include<functional>
#include<stack>
#include<iomanip>
using namespace std;
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPL(i,a,n)... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 82,710,607 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, m;
cin>>n>>m;
ll a[n];
priority_queue<ll> pq;
for (int i=0; i<n; i++){
cin>>a[i];
pq.push(a[i]);
}
ll cnt = 0;
while(!pq.empty() && cnt<m){
ll x = pq.top();
pq.pop();
... | #include <iostream>
using namespace std;
int main() {
char x, y;
cin >> x >> y;
if (x > y) {
cout << ">" << endl;
}
else if (y > x) {
cout << "<" << endl;
}
else {
cout << "=" << endl;
}
return 0;
} | 0 | 90,651,563 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define modulo ll (1e9 + 7)
typedef long long ll;
typedef pair<int,int> pii;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const int N = 50, M = 500, OO = 0x3f3f3f3f;
const ll llOO = 0x3f3f3f3f3f3f3f3f;
int main(){
init();
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
int ans = 2*n;
for(int i = 1;i <= n;i++){
string sx = s.substr(n-i,i);
... | 0 | 56,452,316 |
#pragma GCC optimize("Ofast")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdl... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | 0 | 24,439,660 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; string s; cin >> n >> s;
set<string> str;
set<char> c0, c1, c2;
for(int i=0;i<n-2;i++) {
if(c0.size() == 10) break;
else if(c0.count(s[i])) continue;
else {
for(int j=i+1;j<n-1;j++) {
... | 0 | 5,425,145 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define MMAX (ll)(1e9)
#define MAX 20000
int main(){
ll n;
cin >> n;
ll a[n+1], b[n+1], p[n];
for(int i=0; i<n; i++) cin >> p[i];
for(int i=1; i<=n; i++){
a[i]=i*2*MAX;
b[i]=MMAX-a[i];
}
for(int i=0; i<n; i++)... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 70,248,908 |
#include<bits/stdc++.h>
int d[11],n,m,i,a,b,s,e;
int main(){
while(true) {
memset(d,0,sizeof(d));s=0;
std::cin>>n>>m;if(!n){break;}
for(i=0;i<n;i++){std::cin>>a>>b;d[b]+=a;}
for(i=10;i>=0;i--){e=std::min(d[i],m);m-=e;s+=i*(d[i]-e);}
printf("%d\n",s);}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,i;
cin >> N;
vector<int> p(N);
for(i=0; i<N; i++){
cin >> p.at(i);
}
int m=200000;
int cnt =0;
for(i=0; i<N; i++){
if(p.at(i) <= m){
m = p.at(i);
cnt++;
}
}
cout << cn... | 0 | 12,023,245 |
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "/home/v-o_o-v/deb.h"
#define deb(x...)cerr << "[" << #x << "] = [";_print(x);
#else
#define deb(x...)
#endif
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).r... | #include <utility>
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int n;
int a[100][100] = {0};
int k[100] = {0};
int d[100];
int kansu( int i, int t ){
if ( d[i] != -1 && d[i] <= t ) return 0;
d[i] = t;
t++;
for ( int j = 0; j < k[i]; j++ ) {
kansu( a[i][j], t )... | 0 | 58,674,649 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
std::string S;
std::cin >> S;
std::array<int, 26> a;
for (int i = 0; i < 26; i++) {
a.at(i) = 0;
}
for (int i = 0; i < S.size(); i+... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | 0 | 33,777,018 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b;
char c;
cin >> a >> c >> b;
if(c=='+')cout << a+b << endl;
else if(c=='-')cout << a-b << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int H[N];
int A[M],B[M];
for(int i=0;i<N;i++) cin >> H[i];
for(int i=0;i<M;i++){
cin >> A[i] >> B[i];
}
vector<int> R[N+1];
for(int i=0;i<M;i++){
R[A[i]-1].push_back(B[i]);
R[B[i]-1].push_back(A[i]);
}
int... | 0 | 66,803,067 |
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <numeric>
#include <ctype.h>
#include <cstdlib>
#include <string.h>
using namespace std;
int main()
{
int count = 0, a = 0, b = 0;
string input;
cin >> input;
cin >> count;
for (int i = 0;... | #include<iostream>
#include<string>
#include<cctype>
using namespace std;
int main( )
{
string str;
int i;
while( true ) {
getline( cin, str );
if( '0' == str[0] ) { break; }
int sum = 0;
for( i=0; '\0'!=str[i]; i++ ) {
if( isdigit( str[i] ) ) {
sum += ( str[i]-'0' );
}
}
cout<<sum<<endl;
}
... | 0 | 11,214,352 |
#include <bits/stdc++.h>
using namespace std;
int N,K;
const int n=200010;
int cnt[n];
int main()
{
cin>>N>>K;
for (int i = 0; i < N; i++)
{
int a;
cin>>a;
cnt[a-1]++;
}
sort(cnt,cnt+N);
int ans=0;
for (int i = 0; i < N-K; i++)
{
ans+=cnt[i];
}
co... | #include<stdio.h>
#include<string.h>
int main(){
char a[11];
char b[11];
char c[11];
scanf("%s",a);
scanf("%s",b);
scanf("%s",c);
int len1 = strlen(a);
int len2 = strlen(b);
int len3 = strlen(c);
if(a[len1-1] == b[0] && b[len2-1] == c[0]){
printf("YES");
}
else{... | 0 | 85,933,414 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
using namespace std;
typede... | #include <bits/stdc++.h>
using namespace std;
const int base=1e9+7;
string s;long long n,kq,x,dem;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>s;
kq=1;
x=0;dem=0;
for (long long i=2*n-1;i>=0;i--)
{
if (i%2&&s[i]=='B') x++;
else if (i%2==0&&... | 0 | 88,111,548 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 1, vector<in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = *max_element(a.begin(), a.end());
vector<int> cnt(mx + 1);
for (int i = 0; i < n; i++... | 0 | 20,051,442 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return ... | /*http:
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX 999999
using namespace std;
int num_prime[MAX];
bool not_prime_flag[MAX];
int main()
{
int n;
int max_input;
vector<int> input;
while (cin>>n){
input.push_back(n);
}
max_input=*max_element(input.begin(),input.... | 0 | 96,748,157 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int cost(int x,int y){
return (x-y) * (x-y);
}
int main(void){
int N;
cin >> N;
int a[N];
rep(i,N){
cin >> a[i];
}
int ans = 1e9;
for(int i=-100;i<=100;i+... | 0 | 92,811,340 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 68,184,256 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
int n, s;
int a[200020];
long long z;
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0, j = 0; i < n; s ^= a[i++])
{
while (j < n && (s & a[j]) == 0)
{
s ^= a[j++];
}
z += j - i;
}
printf("%lld\n", z);
re... | 0 | 40,555,166 |
#include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<int> v(n), cpy;
for(int i = 0; i < n; ++i){
... | #include<stdio.h>
int main()
{
int a,b;
for(int i=0;;i++)
{
scanf("%d %d",&a,&b);
if(a==0&&b==0) break;
int sum=0;
for(int x=1;x<=a;x++)
{
for(int y=x+1;y<=a;y++)
{
for(int z=y+1;z<=a;z++)
{
if(x+y+z==b)
{
sum++;
}
}
}
}
printf("%d\n", sum);
}
return 0;
} | 0 | 76,262,962 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> num(1000010);
int g = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
g = gc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
vector<int> S[MAX],color(MAX,0),odd,even;
void DFS(int u){
int cnt=1;
bool ok=true;
stack<int> ST;
color[u]=1;
ST.push(u);
while(!ST.empty()){
... | 0 | 1,820,024 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int,int>
#define V vector
#define pb push_back
#define mkp make_pair
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int... | 0 | 38,471,371 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using gp = priority_queue<int, vector<int>, greater<int>>;
int N, K;
vector<int> D;
void solve() {
cin >> N >> K;
for (int i = 0; i < N; ++i) {
int v; cin >> v;
D.push_back(v);
}
int limit = min(N, K);
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define MOD 1000000007
#define EPS 1e-12
const double PI = acos(-1.0);
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define ALL(x) x.begin(), x.end... | 0 | 28,953,620 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <... | 0 | 41,943,724 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define fset(arr,n,val) for(int i=0;i<n;++i) arr[i] = val
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#de... | 0 | 18,732,300 |
#include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef set<char> setchar;
typedef set<int> sett;
typedef deque <int> dq;
typedef long long ll;
#define vec(a) a.begin(),a.end()
#define pb push_back
#define pf push_front
#define mem(a,b) memset(a,b,sizeof(a));
#define inI(a) scanf("%d",&... | 0 | 24,292,009 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
if (lhs ... | #include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 81,127,110 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
vector<ll> func( ll n ){
vector<ll> a;
for(ll i=1;i*i<=n;++i){
if( n%i == 0 ) a.push_back(i);
}
return a;
}
ll keta( ll n ){
if( n == 0 ) return 0;
return 1 + keta(n/10);
}
int main() {
ll n;cin... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 25,086,398 |
#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,ans=99999999999999; ... | #include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <deque>
using namespace::std;
int ri()
{
int x;
scanf("%d", &x);
return ... | 0 | 12,634,678 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, m = 0;
std::cin >> n >> m;
std::string r = "IMPOSSIBLE";
std::unordered_map<int, bool> stop_overs;
std::vector<int> stops;
while (m--) {
int s = 0, e = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vb vector<bool>
#define pii pair<int,int>
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define F first
#define S second
#define inf (long long) 1e18
#define f(i,... | 0 | 31,275,805 |
#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;
typedef long double ld;
typedef array<ll,2> pll;
const ll NMAX=100001,MOD=1e9+7;
vector<ll> edg[NMAX];
ll dp[NMAX][2];
bool visited[NMAX];
void dfs(l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 1,994,785 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5000005;
struct ab{int f,t;}t[N];
int a[N],size[N],id[N],hh[N],h,tot;
map<int,int>mp;
void make(int x,int y){t[++h].f=hh[x],t[h].t=y,hh[x]=h;}
int cmp(int x,int y){return a[x]>a[y];}
void dfs(int x,int y,int z)
{
tot+=z;
for(int i=hh[x];i;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(fa... | 0 | 94,361,716 |
#include <bits/stdc++.h>
using namespace std;
#define N 201000
char s[N];
int n,sum[N],f[N],g[1<<26];
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for (int i=1;i<=n;i++) sum[i]=sum[i-1]^(1<<(s[i]-'a'));
memset(f,0x3f,sizeof(f));
memset(g,0x3f,sizeof(g));
g[0]=0;
for (int i=1;i<=n;i++)
{
f[i]=min(f[i],g[sum[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int n;
int t[110000], x[110000], y[110000];
t[0] = x[0] = y[0] = 0;
cin >> n;
for(int i = 1; i < n + 1; i++) {
cin >> t[i] >> x[i] >> y[i]... | 0 | 40,195,336 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,t=0,h=0;
cin >> n;
for (; n > 0; n--)
{
string taro, hanako;
cin >> taro >> hanako;
if (taro < hanako){ h += 3; }
else if (taro>hanako){ t += 3; }
else { t += 1; h += 1; }
}
cout <<t<< " " << h << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
if(s.at(0)== s.at(1)){
if(s.at(2)== s.at(3)&& s.at(0) != s.at(2)){
cout << "Yes" <<endl;
return 0;
}else{
cout << "No" << endl;
}
}else if(s.at(0)== s.at(2)&& s.at(0) != s.at(1)){
if(s.at(1)=... | 0 | 64,084,992 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
vector<pair<char,int>> RLE(string S){
vector<pair<char... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int num1, num2;
cin >> num1, cin >> num2;
vector<string> strvec(num1);
for(int i = 0; i < num1; i++) {
cin >> strvec[i];
}
sort(strvec.begin(), strvec.end());
for(int i... | 0 | 58,305,837 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a;
int b=0;
cin>>a;
for(int i=0;i<a.size();i++){
if(a[i]=='x') b++;
}
if(b>=8) cout<<"NO";
else cout<<"YES";
cout<<"\n";
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n... | 0 | 7,934,339 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#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_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 0 | 880,236 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,L; cin>>N>>L;
vector<ll> A(N+1,0);
for(ll i=1; i<=N; i++) cin>>A[i];
for(ll i=1; i<N; i++){
ll n=A[i]+A[i+1];
if(n>=L){
ll asz=A.size()-1;
cout<<"Possible"<<endl;
for(ll j=1; j<i; j++) cout<<j<<endl;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 0 | 34,300,313 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for... | #include <iostream>
#include <cmath>
using namespace std;
bool isPrime(long long n, long long root) {
for (long long i = 2; i <= root; i++) {
if (n % i == 0)
return false;
}
return true;
}
int nDigits(long long n) {
int digits = 0;
while (n > 0) {
digits++;
n /= 10;
}
return digits;
}
in... | 0 | 35,896,094 |
#include <stdio.h>
#include <string.h>
#define rep(i, a) for(int i = 0; i < a; ++i)
int main(void) {
char s[250], t[250];
int m, i, j, n, a;
while( 1 ) {
scanf("%s", s);
n = strlen(s);
if(n == 1 && s[0] == '-') break;
scanf("%d", &m);
rep(i, m) {
scanf("%d", &a);
rep(j, a) t[j] = s... | #include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace... | 0 | 84,518,149 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll maxn = 1e6 + 5;
const int N = 1e5 + 5;
long long n,k,f[N];
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%... | 0 | 84,785,396 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
int i,n,x=100000;
cin >> n;
for(i=0;i<n;i++){
x*=1.05;
if(x%1000!=0) x=(x/1000+1)*1000;
}
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
using namespace std;
int n,a,b,cur;
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
#endif
cin>>n>>a>>b;
i... | 0 | 27,654,892 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll x,y; cin>>x>>y;
ll ans=abs(abs(x)-abs(y));
if(0<=x&&x<y) {cout<<ans<<endl; return 0;}
if(x<0&&0<y) {cout<<an... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,... | 0 | 95,840,393 |
#include<bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin... | #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> a_times(200001);
vector<int> a(n);
int tmp;
rep(i, n)
{
cin >> tmp;
a.at(i) = tmp;
a_times.at(--tmp) ++;
}
int max = *max_... | 0 | 24,972,705 |
#include<iostream>
#include<complex>
#include<cmath>
using namespace std;
#define EPS 1e-10
int main(void){
int n;
cin >> n;
for(int i=0; i<n; i++){
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if( abs((x2-x1)*(y4-y3) - (x4-x3)*(y2-y1))<EPS )
cout << "YES" << e... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | 0 | 98,161,916 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x2 - x1;
int y = y2 - y1;
cout << x2 - y << " " << y2 + x << " " << x1 - y << " " << y1 + x << endl;
} | #include <iostream>
using namespace std;
int main(){
int d, t = 0;
int ans[100] = {0};
while(cin >> d){
for(int i = d; i < 600; i = i+d){
ans[t] = ans[t]+i*i*d;
}
t++;
}
for(int i = 0; i < t; i++){
cout << ans[i] << endl;
}
} | 0 | 9,651,137 |
#include <iostream>
using namespace std;
int main(void)
{
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
if (x - r<0 || x + r>w || y - r < 0 || y + r > h)cout << "No";
else cout << "Yes";
cout << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main(void){
string str;
int q;
cin >> str;
cin >> q;
for (int i=0;i<q;i++){
string c;
cin >> c;
if (c=="print"){
int a,b;
cin >> a >> b;
for (int i=a;i<=b;i++)
cou... | 0 | 43,076,484 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
long long a,b,c,d=0,e=0;
cin>>a;
a*=a;
a/=1;
cout<<a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vp... | 0 | 55,704,550 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define ALL(name) name.begin(),name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
# define DBG(fmt, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#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 m... | 0 | 47,118,365 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
string ans = "NO";
for(int i = 1; i <= b; i++) {
if(a * i % b == c) {
ans = "YES";
break;
}
}
cout << ans;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
int n;
cin >> n;
vector<string> w(n);
string tmp;
rep(i, n){
cin >> w[i];
}
b... | 0 | 44,200,183 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout<<n<<"\n"
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
map<ll,ll> mp;... | #include <iostream>
using namespace std;
int main(void) {
char c;
int cnt[26];
for (int i = 0; i < 26; i++) cnt[i] = 0;
while (cin >> c) {
if (isalpha(c)) {
c = tolower(c);
cnt[c - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
cout << char('a' + i) <<... | 0 | 53,918,531 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
vector<int>vec(3);
cin >> vec[0];
cin >> vec[1];
cin >> vec[2];
sort(vec.begin(),vec.end());
if(vec[2]-vec[0]%2 == vec[2]-vec[1]%2) {
cout << (vec[2]-vec[1]+vec[2]-vec[0])/2 << endl;
}
else {
... | #include <bits/stdc++.h>
using namespace std;
long long INF=pow(10LL, 16LL);
int main(){
long N, D, A;
cin >> N >> D >> A;
pair<long, long> monsters[N];
for (int i = 0; i < N; i++) {
long X, H;
cin >> X >> H;
monsters[i]={X,H};
}
sort(monsters, monsters+N);
long comulativeDamage = 0L;
long ... | 0 | 91,493,222 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 0 | 47,572,451 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)
int main()
{
ll H, W; cin >> H >> W;
vector<string> S(H, "");
rep(i,H) {
cin >> S[i];
}
vector<string> S2;
rep(i, H) {
bool allw = true;
... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i ... | 0 | 67,991,948 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define ll long long
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define loop(i,start, stop) for(int i = start; i < (stop); i++)
using namespace std;
in... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool isOk = true;
if (A.at(A.size() - 1) != B.at(0)) {
isOk = false;
}
... | 0 | 94,249,647 |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e9;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a + b == c + d)
cout << "Balanced" << endl;
else if(a + b > c + d)
cout << "Left" << endl;
else
cout << "Right" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 80,988,114 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const l... | #include<iostream>
#include<string>
using namespace std;
int main(){
int N;
string S;
cin >> N;
cin >> S;
long divd = 1000000007;
int d[2*N];
d[0]=1;
int ln = 1;
for(int i =1 ; i < 2*N; i++){
if(S[i]!=S[i-1]){
if(d[i-1] > 0){
ln++;
... | 0 | 39,455,184 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S, T, ans="Yes";
cin >> S >> T;
int Ns = S.size(), Nt = T.size();
for (int i=0; i<Ns; i++) {
if (S[i]!=T[i]) {
ans = "No";
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to;
};
using Graph = vector<vector<Edge>>;
vector<bool> seen;
int t=0;
void dfs(const Graph &G, int v) {
seen[v] = true;
t++;
for (auto e : G[v]) {
if (!seen[e.to]) {
dfs(G, e.to);
}
}
}
int main() {
... | 0 | 3,023,554 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
ll q,h,s,d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
vector<int> a(4);
a[0] = q*8;
a[1] = h*4;
a[2] = s*2;
a[3] = d;
ll ans = 0;
sort(a.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 24,341,130 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define LL(x) ll x; scanf("%lld",&x)
#define INPUT(x) cin >> x
#define REP1(x,n) for(int x = 0; x < n; 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 | 577,724 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int w;
cin >> S >> w;
for(int i=0; i< S.size(); i+=w) {
cout << S.at(i);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 0 | 8,079,107 |
#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;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define per(i,a,b) for(ll i=a; i>=b; i--)
#define ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (n)-1; i > -1; i--)
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
using namespace std;
using ll = long long;
using... | 0 | 48,311,137 |
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
vector<pair<int, int>> g;
int main() {
int n,m;
cin >> n >> m;
int a,b;
for(int i =0;i<n;i++){
cin >> a >> b;
g.push_back(make_pair(a,b));
}
sort(g.begin(), g.end());
priority_queue<int> pq;
int j = 0;
long long res = 0;
for(i... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define rep_down(i,n) for (int i=n-1; i>=0;--i)
... | 0 | 15,201,986 |
#include <stack>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <limits>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int mod = 1000000000 + 7;
vector<in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
const int mod = 1e9+7;
const int INF = INT_MAX;
#define endl "\n"
#define append push_back
#define roastedcoder ios_base::sync_with_stdio(false); cin.tie(NULL);
int main() {
roastedcoder
string s; cin>>s;
if(s[1] =... | 0 | 50,003,696 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | #include <bits/stdc++.h>
#define rep(i,s,n) for(int i = s; i < (int)n; i++)
using namespace std;
int main(){
int len;
string S;
bool flg;
flg = true;
len = 0;
cin >> S;
reverse(S.begin(),S.end());
len = S.size();
vector<string> T = {
"dream","dreamer","erase","eraser"
};
... | 0 | 49,302,347 |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
typedef struct l_e
{
int key;
l_e *previous;
l_e *next;
}list_element;
typedef struct l_i
{
list_element *head;
list_element *tail;
}list_... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 43,198,117 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
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 (b<a) { a=b; return 1; } return ... | 0 | 38,226,551 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n),dp(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
dp[0] = 0;
for(int i=1;i<n;i++){
int val = INT_MAX;
for(int j=1;j<=k;j++){
if(i-j < 0){
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | 0 | 55,084,754 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
#include <math.h>
using namespace std;
#define _USE_MATH_DEFINES
int a[4][3][10];
int main() {
int b, r, f, v;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> b >> f >>... | #include <iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int i=0,j=0;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << endl;
}
}
return 0;
} | 0 | 67,643,555 |
#include<bits/stdc++.h>
using namespace std;
int x,t;
int main()
{
cin>>x>>t;
cout<<((x-t>0)?(x-t):0);
} | #include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define ff first
#define ss second
typedef pair<int, int> ii;
vector <int> nums;
vector <ii> tree;
struct ctnr{
int mxa, mxb;
};
ii giveMe(ii x, ii y)
{
ii ret;
ret.ff = max(x, y).ff;
ret.ss = max(max(x, y).ss, min(x, y).ff... | 0 | 24,529,424 |
#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(){
int n,m,a;
cin >> n >> m;
rep(i,m){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin>>s>>t;
int n=s.size(),x=t.size();
int p = 0;
int res = 2000;
for(int i=0;i<n-(x-1);i++){
int curr = 0;
for(int j=p;j<x;j++){
if(s[i+j]!=t[j])curr++;
}
res = min(res,curr);
... | 0 | 72,022,124 |
#include <iostream>
using namespace std;
int main() {
int input01;
int input02;
cin >> input01 >> input02;
if(input01 > input02) {
cout << "a > b" << endl;
} else if(input01 < input02) {
cout << "a < b" << endl;
} else {
cout << "a == b" << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
pair<int, int> red[N], blue[N];
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
red[i] = make_pair(a, b);
}
for (int i = 0; i < N; i++) {
int c, d;
cin >> c ... | 0 | 7,853,060 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e3 + 5, M = 1e4 + 5, mod = 1e9 + 7;
int dp[N][M], mark[N][M], n, h, dam[N], cost[N];
ll solve(int idx, int kam){
if(kam <= 0) return 0;
if(idx == n) return 1e9;
if(mark[idx][kam]) return dp[idx][kam];
mark[idx][kam] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll>pos[21];
ll inp[100];
map<ll,ll>mp;
vector<ll>points;
vector<ll>::iterator upper1, upper2;
int main()
{
ll i,j,k,l,t,n,x=0,y=0,p,q,z=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>p;
points.push_back(p);
}
for(i=0;i<n;i+... | 0 | 55,858,091 |
#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 << "] " ... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 0 | 31,206,229 |
using namespace std;
#include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
#define pb push_back
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<stri... | #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 | 87,718,924 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <list>
#include <ctime>
#include <complex>
#include <bitset>
#include <tuple>
#include <functional... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
template<class T>inline bool chmin(... | 0 | 37,706,657 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <bits/stdc++.h>
using namespace std;
uint64_t calc_lucas(int N) {
uint64_t L[N + 1];
L[0] = 2LL;
L[1] = 1LL;
if(N == 0 || N == 1) {
return L[N];
} else if(N >= 2) {
for(int i = 2; i <= N; i++) {
L[i] = L[i - 1] + L[i - 2];
}
}
return L[N];
}
i... | 0 | 36,811,414 |
#include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
using namespace std;
int main() {
int n;
double x1,y1,x2,y2,x3,y3,x4,y4,m1,m2;
cin>>n;
for(int i=0;i<n;i++){
int p=0;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if(x1==x2&&x3==x4){p=1;}
else if(x1==x2||x3==x4){}
else ... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
map<string,int> mp;
string s;
getli... | 0 | 54,564,492 |
#include <iostream>
#include <vector>
#include <string.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
struct Road
{
int a, b, c;
};
int n, a, b, c;
int table[10][10];
Road roads[45];
int main()
{
while( 1 )
{
cin >> n;
if(n == 0) break;
memset(table, 0, sizeof(int) * 100);
rep(i, n)
{
... | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
ll N, K;
cin >> N >> K;
ll A, B;
A = B = 0;
ll X;
rep(i, N) {
cin >> X;
if(X % 2 =... | 0 | 42,789,610 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
vector<long long> a(10e5);
long long N;
cin >> N;
a[0] = 0;
a[N + 1] = 0;
for (auto i = 1; i <= N; i++) {
cin >> a[i];
}
long long cost = 0;
for (auto i = 1; i <= N +... | 0 | 82,941,352 |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_set>
#define _USE_MATH_DEFINES
#include <cmath>
#define ll long long
using namespace std;
const double pi = 3.14159265358979323846;
vector<int> g[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll A, B, C, K;
cin >> A >> B >>... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 40,322,153 |
#include <iostream>
#define MAX 10000
using namespace std;
int main()
{
int n;
unsigned short *A, *B;
int C[MAX+1];
cin >> n;
A = new unsigned short[n];
B = new unsigned short[n];
for (int i = 0; i <= MAX; ++i) C[i] = 0;
for (int i = 0; i < n; ++i)
{
B[i] = 0;
cin >... | #include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) ... | 0 | 5,422,564 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 38,705,976 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / __gcd(a, b) * b
#define range(a) (a).begin(),(a).end()
const int inf = 2147483647;
int main (){
string s;cin>>s;
bool flag = false;
rep(i,0,s.size()){
... | 0 | 46,562,201 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int sum = 0;
cin >> N;
int A = N;
for (int i = 1; i < 9; i++){
int B = A % 10;
sum += B;
A -= B;
A /= 10;
}
if (N % sum == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INPUT() freopen("input.txt", "r", stdin)
#define OUTPUT() freopen("output.txt", "w", stdout)
#define F first
#define S second
template<typename T>T gcd(T... | 0 | 58,405,497 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
double x1,y1,x2,y2,x3,y3,x4,y4;
double EPS = 1e-10;
cin>>n;
for (int i=0;i<n;i++) {
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if ( abs((y4-y3)*(x2-x1)-(y2-y1)*(x4-x3))<EPS ) {
cout<<"YES"<<endl;
} el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 872,645 |
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX 100000000
#define INFTY (1<<30)
int n, H[MAX];
void maxHeap(int i) {
int left = i * 2;
int right = i * 2 + 1;
if (left > n) return;
int max = left;
if (right <= n) max = H[left] >= H[right] ? left : right;
max = H[i] >= H[max] ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 35,577,296 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | # include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
#define SEND_HELP ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#define d... | 0 | 18,286,350 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100005
#define MOD 1000000007
int main()
{
string a;
cin >> a;
int n=a.size();
for(int i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
for(int i=0;i<n-2;i++)
{
i... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 80,994,842 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k,s;
cin >> n >> k >> s;
int inf;
if(s==1000000000) inf = s-1;
else inf = 1000000000;
for(int i = 0; i < n; i++) {
if(i<k) cout << s << ' ';
else if(i<n-1) cout << inf << ' ';
else cout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | 0 | 16,876,080 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for(int i=0;i<(n);++i)
#define INF (1ll<<60)
#define FI first
#define SE second
typedef pair<int, int> pii;
#define l_b lower_bound
#define u_b upper_bound
int N, K;
int A[100100];
int B[100100];
signed main(... | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
const int Rk = 0;
const int Sc = 1;
const int Pp = 2;
int main() {
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;... | 0 | 96,196,663 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include ... | #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() {
int H,W,M;
cin >> H >> W >> M;
vi h(... | 0 | 64,925,674 |
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i, n) for( int i=0 ; i<n ; i++ )
#define f(i, a, b) for( int i=a ; i<b ; i++ )
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
int gcd(int a, int b)
{
if (b == ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
bool check(int h, int w, int N, int M, const vector<string>& A, const vector<string>& B){
if(h < 0 || h+M-1 >= N || w < 0 || w + M-1 >= N) return false;
for(int i = h; i < h+M; ++i){
for(int j = w; j < w+M; ++j){
if... | 0 | 83,196,738 |
#include<bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 69,277,529 |
#include <iostream>
#include <cmath>
using namespace std;
long long int a[100000];
long long int dp[1000005];
int main()
{
long long int length;
cin >> length ;
for(long long int i=0;i<length;i++){
cin >>a[i];
}
dp[0] = 0;
for(int i = 1; i < length; i++){
dp[i] = dp[i-1] + abs (a... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 99,808,944 |
#include <bits/stdc++.h>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
int64_t dfs(const vector<vector<int64_t>>& links, const vector<int64_t>& a, int64_t current, int64_t parent) {
if (links[current].size() == 1 && parent >= 0) {
return a[current];
}
int64_t s = 0;
int64_t m... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N;
cin >> N;
double sum = 0;
rep(i,N) {
double m;
string s;
cin >> m >> s;
if (s == "JPY") {
sum += m... | 0 | 58,900,936 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <bits/stdc++.h>
using namespace std;
void nCr(int n, long long ncr[]);
signed main() {
int n, p, a, odd, even;
long long sum_even, nco[51], nce[51], ans;
cin >> n >> p;
odd = 0;
even = 0;
for(int i=0 ;i<n ;i++ ) {
cin >> a;
if(a%2 == 1) {
odd++;
} els... | 0 | 41,847,530 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.