code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
#define ld long double
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int main(void){
ll a,b;
ll c,d;
cin>>a>>b>>c>>d;
ll z= (c)/__gcd(c,d)*d;
ll ... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allo... | 0 | 49,015,640 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int... | #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;}
int ... | 0 | 26,674,561 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
}
return sum;
}
in... | #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;
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; }
r... | 0 | 93,285,159 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, M;
ll ans = LONG_LONG_MIN;
vector<tuple<ll, ll, ll>> S;
cin >> N >> M;
S.resize(N);
for(ll i = 0;i < N;i++) cin >> get<0>(S[i]) >> get<1>(S[i]) >> get... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N,L;
cin>>N>>L;
vector<int> a(N);
R... | 0 | 75,892,808 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int len[3];
for(int j = 0; j < 3; j++) {
cin >> len[j];
}
sort(len, len+3);
if(len[2]*len[2] == len[0]*len[0] + len[1]*len[1]) cout << "YES" << endl;
else co... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 0 | 65,009,724 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(0);
int x; cin >> x;
cout << 10-x/200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
const int oo = 1e9 + 7;
const int N = 1e3 + 5;
const int ver[] = { -1, +1, 0, 0 };
const int hor[] = { 0, 0, -1, +1 };
const char* mv = "LRDU";
int n;
ll cx[N], cy[N];
ll dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x2 - x... | 0 | 77,770,840 |
#include<iostream>
using namespace std;
int main(){
int n;
int m;
cin >> n;
cin >> m;
if (n < m) cout << "a < b" << endl;
if (n > m) cout << "a > b" << endl;
if (n == m) cout << "a == b" << endl;
return 0;
} | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a,n) for(ll a = 0;a < n;a++)
static con... | 0 | 28,124,925 |
#include <bits/stdc++.h>
#include <math.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<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 0 | 52,499,323 |
#include <iostream>
#include <vector>
long long pow(long long a,long long b,long long mod){
if(b==0){
return 1;
}else{
if(b%2==0){
return pow((a*a)%mod,b/2,mod);
}else{
return (pow((a*a)%mod,b/2,mod)*a)%mod;
}
}
}
int main(){
using namespace std;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n = 0,ans = 0,j = 0;
cin >> n;
for(int i = 1; i <= n; ++i)
{
int digit = 0;
j = i;
while (j != 0)
{
j /= 10;
digit++;
}
if (digit % 2 == 1)
{
ans++;
... | 0 | 19,594,517 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%f %d\n", double(w)*double(h)/2, x*2 == w && y*2 == h);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 74,599,146 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main(){
vector<ll>d;
ll key=0;
string s;cin >>s;
ll n=s.size();
ll now=0;
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
const int mod = (int)1e9+7;
using namespace std;
int fastp(int a, int b){
int res = 1;
a %= mod;
while(b){
if(b&1) res = (res * a) % mod;
a *= a; a %= mod;
b >>= 1;
}
return res%mod;
}
si... | 0 | 71,325,511 |
#include <bits/stdc++.h>
using namespace std;
int main(){
#ifdef LOCAL
freopen("input", "r", stdin);
#endif
int n;
vector<int> a, b, order;
scanf("%d", &n);
for (int i = 0; i < n; i++){
int x;
scanf("%d", &x);
a.push_back(x);
}
for (int i = 0; i < n; i++){
int x;
scanf("%d", &x);
b.push_back(x);
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | 0 | 31,805,088 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <map>
#include <stack>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415... | #include <iostream>
#include <string>
using namespace std;
int main()
{
const int win = 3;
const int draw = 1;
string str;
cin >> str;
int n = stoi(str);
int taro = 0, hanako = 0;
string str_taro, str_hanako;
for(int i = 0; i < n; i++)
{
cin >> str_taro;
cin >> str_ha... | 0 | 85,249,082 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n;
k = n;
int x = 10,t = 0;
for (int i = 0; i < 8; i++) {
t += n % 10;
n /= 10;
}
if (k % t == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<vector>
using namespace std;
bool check(vector<int> u, int x)
{
for(int i=0;i<u.size();i++)
{
if(u[i]<x)
return false;
}
return true;
}
int main()
{
int n,flag=0,y,m,x,ans=INT_MAX;
cin>>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
for(int i=0;i<n;i... | 0 | 52,364,052 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
using ll = long long int;
const int N_MAX = 305;
ll H[N_MAX];
int n, k;
ll dp[N_MAX][N_MAX];
const ll INF = 1E+15;
int main(){
cin >> n >> k;
H[0] = 0;
for(int i = 1; i <= n; i++){
cin >> H[i];
}
f... | 0 | 72,287,880 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, max_count = 0, val = 1;
cin >> n;
for (int i = 1; i <= n; i++)
{
int count = 0, a = i;
... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 0 | 13,717,762 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
string ss;
for (int i = 1; i <= s.size(); i++)
{
if (i % 2 != 0)
ss += s[i - 1];
}
cout << ss << ... | #include<iostream>
#include<string>
using namespace std;
int main() {
string s;
string t;
int correct = 0;
cin >> s;
cin >> t;
for(int i = 0; i < s.length(); i++) {
if(s[i] == t[i]) {
correct++;
}
}
cout << correct << endl;
} | 0 | 80,660,981 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int res = 0;
for (int i = 2; i < N; i += 2) {
string T = S.substr(0, N-i);
string zen = T.substr(0, T.size()/2);
if (T == zen + zen) {
res = N-i;
break;
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
int w, h, n;
cin >> w >> h >> n;
int x[n], y[n], a[n];
for(int i = 0; i < n; i++){
cin >> x[i] >> y[i] >> a[i];
}
int s[w][h];
for(int j = 0; j < w; j++){
for(int k = 0; k < h... | 0 | 6,517,912 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c;
a=b=0;
for(int i=0;i<4;i++){
cin>>c;
a+=c;
}
for(int i=0;i<4;i++){
cin>>c;
b+=c;
}
c=max(a,b);
cout<<c<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 0 | 65,233,773 |
#include<iostream>
using namespace std;
int main(){
int w, h;
while(1){
cin >> h >> w;
if(w == 0 && h == 0) break;
for(int a = 0; a < h; a++){
for(int b = 0; b < w;b++){
if( a == 0 || a == h - 1){
cout << "#";
}else{
if( b == ... | #include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
vector<int> v;
int v1;
double max =0;
cin >> n;
vector<int >a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double ans = a[0];
for (int i = 1... | 0 | 28,939,512 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <stdio.h>
#define MAX 101
int A[MAX][MAX], s[MAX], h[MAX];
void serch(int x, int y){
int i;
h[x] = y;
for(i=1; i<=s[x]; i++){
if(h[A[x][i]] > y)
serch(A[x][i], y+1);
}
}
int main(){
int i, j, k, n;
scanf("%d", &n);
for(i=1; i<=n; i++){
h[i] = 10000;
for(j=1; j<=n; j++)
A[i... | 0 | 99,256,996 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int p[20005], q[20005];
for(int i = 0; i < n; i++){
cin >> p[i];
p[i]--;
q[p[i]] = i;
}
int a[20005], b[20005];
for(int i = 0; i < n; i++){
a[i] = (i + 1) * 40000;
b[i] = 1000000000... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 41,683,638 |
#include <iostream>
using namespace std;
int main(){
int num;
int i =1;
while(1){
cin >> num;
if (num==0){
return 0;
}
cout << "Case " << i++ << ": " << num << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0;i < n;i++){
cin >> a[i];
}
ll ans = a[0];
for (ll i = 1; i < n; i++){
ans = gcd(ans, a[i]);
}
... | 0 | 61,050,835 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#define pb push_back
#define mp make_pair
using namespace std;
template<typename T>inline void upmin(T... | 0 | 90,955,643 |
#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,k;cin>>n>>k;
ll co=k;
for(int i=1;i<n;i++){
co*=k-1;
}
cout<<co<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 95,860,460 |
#include<iostream>
using namespace std;
int main() {
int n,j;
long long k = 100000;
cin >> n;
for (int i = 0; i < n; i++) {
k += k / 20;
j = k % 1000;
if (j != 0) {
k += 1000 - j;
}
}
cout << k << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;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 all(x) (x).begi... | 0 | 22,629,978 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int a, b;
cin >> a >> b;
cout << b + (b-a) << "\n" ;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1, i = 1;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
if(s.size() == a+b+1 && s.at(a) == '-' ){
bool ans = true;
for(int i = 0; i < a; i++){
if(s.at(i) == '-' ){
ans = false;
break;
}
}
for(int i = a+1; i < a+b+1; i++){
... | 0 | 12,407,406 |
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
long long ans = n;
for(int i=0; i<m; i++)
{
int a;
cin >> a;
ans -= a;
}
cout << (ans >= 0 ? ans : -1) << endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
using namespace std;
#define rep(... | 0 | 22,736,763 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true);... | #include <iostream>
using namespace std;
void solve(){
long long int a,b ; cin>>a>>b;
if (2*a<=b && 4*a>=b && b%2==0){
cout<<"Yes"<<'\n';
}else{
cout<<"No"<<'\n';
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
while(t--){
solve(... | 0 | 84,453,454 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using vec_i = std::vector<int>;
using vec_ll = std::vector<ll>;
using vec_ld = std::vector<ld>;
using set_i = std::set<int>;
using set_ll = std::set<ll>;
using set_ld = std::set<ld>;
using uset_i = std::unordered_set<int>;
using uset_ll = std::unord... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1e9 + 7;
const int N=1000100;
template<typename T> istream &operator>>(is... | 0 | 69,876,436 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i < n - 1; i++){
if(s[i] != s[i + 1]) ++ans;
}
ans++;
cout << ans << endl;
r... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include <stdio.h>
#include<map>
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
map<string,long long>arr;
char x[11];
for(int i=0;i<n;i++){
cin>>x;
sort(x,x+10);
arr[x]++;
ans+=arr[x]... | 0 | 59,267,863 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
int main() {
int r,g,b,n; cin >> r >> g >> b >> n;
int counter = 0;
for(int i = 0;i < n / r + 1; i++) {
for(int j = 0; j < n / g +... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <set>
# include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define... | 0 | 47,356,990 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string f, e;
cout << 0 << endl;
cin >> f;
if( f == "Vacant" ) return 0;
cout << N - 1 << endl;
cin >> e;
if( e == "Vacant" ) return 0;
int l = 0;
int r = N - 1;
while( r - l > 1 ) {
int m = (l + r) / 2;
string now;
cout << m <... | #include<cstdio>
#include<cstdlib>
#define llong long long
#define ldouble long double
#define uint unsigned int
#define ullong unsigned long long
#define udouble unsigned double
#define uldouble unsigned long double
#define modinc(x) {if(x>=P) x-=P;}
#define pii pair<int,int>
#define piii pair<pair<int,int>,int>
#defi... | 0 | 41,657,378 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
string str;
string allow;
string replacechar;
int S, E;
string a;
int q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++)
{
cin >> allow >> S >> E;
if (allow=="replace")
{
cin... | #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 | 38,708,929 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) for(ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx=1e5+5;
const int MOD=1e9+7;
ll ara[mx];
int main ()
{
ll n,m;
scanf ("%lld %lld",&n,&m);
ll sum1=0;
for (int i=0;i<n;i++) {
scanf ("%lld",&ara[i]);
if (i) {
ll x=ara[i]-ara[i-1];
sum1... | 0 | 84,462,455 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;
int main(void){
int n,a[101],m=0;
rep(i,1,101){
a[i]=0;
}
while( cin >> n ){
a[n]++;
}
rep(i,1,101){
if(m < a[i]){
m=a[i];
}
}
r... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 2147483647
using namespace std;
int main()
{
double x1, y1, x2, y2;
cin ... | 0 | 85,665,746 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<(x)<<endl
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf=1e18;
const int N=2e5+10;
ll factorial(ll x){
if(x==0||x==1) return 1;
return x*factorial(x-1);
}
ll gcd(ll a ,ll b){return b ? gcd... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int l, r;
cin >> l >> r;
int ans = 2020;
bool flg=0;
for(int i=l; i<=r-1; i++){
if(l==0) l++;
if(l==2019||r==2019){
ans=0;
break;
}
for(int j=l+1; j<=r; j++){
... | 0 | 61,008,411 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
ll co = 0;
vector<P> a;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | 0 | 23,514,115 |
#include <bits/stdc++.h>
#define fio() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
const ll mod = 1e9 + 7;
const ll maxn = 1e5 + 6;
const ll N = 1e2 + 2;... | #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 mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... | 0 | 25,080,576 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
struct priority_queue{
int A[2000005];
int fact;
priority_que... | 0 | 17,777,403 |
#include<iostream>
#include<numeric>
using namespace std;
int main(void)
{
const int N = 4;
int a[N];
int n;
while( cin >> n)
{
int count = 0;
for(int i = 0; i < 10*10*10*10; i++)
{
a[0] = i/10/10/10;
a[1] = i/10/10%10;
a[2] = i/10%10;
a[3] = i%10;
if(accumulate(a, a+N, 0) == n)
count++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | 0 | 56,261,161 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
int i,j,k,l1,l2;
cin>>a>>b;
l1=a.size();
l2=b.size();
int ar[l2+1][l1+1];
for(i=0;i<=l2;i++){
for(j=0;j<=l1;j++){
if(i==0){
ar[i][j]=j;
}
else if(j==0){ar[i][j]=i... | #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>;
const int mod = 1000000007;
ll dp[100010];
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i, M) cin >> a[i];
a.push_back(N+1);
rep(i, 100010)... | 0 | 77,616,872 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
using names... | #include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> h(n, 0);
rep(i, n)cin >> h[i];
vector<queue<int>> dict(n);
vector<int> a(m, 0), b(m, 0);
re... | 0 | 35,430,187 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<iomanip>
#include<set>
#include<tuple>
#include<map>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typede... | #include <bits/stdc++.h>
using namespace std;
const int N = 8005;
int n, x, y, vv[2 * N], *v, c, d;
char s[N];
vector<int> xv, yv;
int main(){
v = vv + N;
scanf("%s%d%d", s, &x, &y);
n = strlen(s);
int i = 0;
for(; i < n; i++, x--) if(s[i] == 'T') break;
xv.push_back(0);
yv.push_back(0);
... | 0 | 64,281,468 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 12,733,951 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
map<char,int> m {};
for (char c : s)
m[c]++;
if (m.size() != 2)
cout << "No";
else
cout << "Yes";
return 0;
} | #include <cstdio>
#include <algorithm>
typedef long long ll;
const int Inf=0x3f3f3f3f;
int n,a,b,Mb=Inf;
ll Sum;
int main()
{
for(scanf("%d",&n);n--;)
{
scanf("%d%d",&a,&b),Sum+=b;
if(a>b)Mb=std::min(Mb,b);
}
Sum-=Mb;
if(Mb==Inf)Sum=0;
printf("%lld\n",Sum);
return 0;
} | 0 | 35,834,965 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
cin >> s;
int ans=0;
for(int a=0; a<10; a++){
for(int b=0; b<10; b++){
for(int c=0; c<10; c++){
int k=0;
for(int i=0; i<n; i++){
int x = s[... | #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 <regex>
#include <vector>
#define fix(n... | 0 | 81,043,832 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
bool ok = true;
if (A != B){
ok = false;
}
if (B != C){
ok = false;
}
if (C != A){
ok = false;
}
if (ok){
cout << "Yes" << "\n";... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int h, w, k;
cin >> h >> w >> k;
char c... | 0 | 48,413,108 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,x,y) for(int i=x; i<y; ++i)
#define mem(x,y) memset(x,y,sizeof(x))
#define ALL(a) a.begin(),a.end()
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define DOF 0x7f7f7f7f
#define se second
#define fi first
#define endl '\n'
template <type... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 64,469,802 |
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;constexpr const char nl='\n',sp=' ';
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N, X, T;
cin >> N >> X >> T;
int ans = 0, cur = 0;
while (cur < N) {
... | #include <bits/stdc++.h>
#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++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = max(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 0 | 51,725,278 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <map>
using namespace std;
int main() {
long long cnt = 0, ans = 1, sum = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
cnt++;
}
else if (s[i] == 'W') {... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b){
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
long long g = gcd(a,b);
return a/g * b;
}
int main()
{
int N;
cin >> N;
long long ans = 1LL;
for ... | 0 | 65,560,894 |
#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 INF = 2147483647;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
int sum=0;
rep(i,n){
for(int j=i+1;j<n;j++){
sum+=d[i]*d[j];
}
}
cout << sum << endl;
return 0;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
#include <stack>
using namespace std;
using ll = long long;
using Pii = pair... | 0 | 21,341,282 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(... | #include<iostream>
#include<vector>
#include<cstdlib>
#include<string>
#include<cmath>
using namespace std;
struct Dice{
int num[6];
};
int main(){
vector<int> number(6);
Dice d1;
for(int i=0; i<6; i++){
cin>>d1.num[i];
}
cin.ignore();
int a;
cin>>a;
int top[a]={0};
int fro... | 0 | 60,806,969 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int N = 1e5 + 5;
map < int , int > H;
vector < int > V[N];
pp A[N];
int sz[N];
int f(int x, int d){
int t = d;
for(int i=0; i<V[x].... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long ... | 0 | 1,536,581 |
#include<bits/stdc++.h>
using namespace std;
main(int argc, char const *argv[])
{
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x,n)
{
int y[n+1];
for (int i = 0; i < n; ++i) cin>>y[i];
y[n]=-1;
int now=0;
if(x==y[0]) ++now;
if(n==1&&now==1)
{
cout<<"0\n";
continue;
}
int i;
for (i = 0; i < 10000; ... | #include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
if (a<=b && b<=c){
cout<<a<<" "<<b<<" "<<c<<endl;
}
else if (a<=c && c<=b){
cout<<a<<" "<<c<<" "<<b<<endl;
}
else if (b<=a && a<=c){
cout<<b<<" "<<a<<" "<<c<<endl;
}
else if (b<=... | 0 | 99,288,418 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define logger(x) cout << __LINE__ << ": " << #x << " -> " << (x) << endl;
#define ll long long int
#define ull unsigned long long int
vector<ll> g[200005];
vector<bool> vis(200005, 0);
ll max_len = 0;
void dfs(ll node, ll lvl)
{
vis[node] = true;
... | 0 | 47,242,439 |
#include<bits/stdc++.h>
using namespace std;
#define reps(i, j, n) for(int i = j; i < (int)n; i++)
#define rep(i, n) reps(i, 0, n)
using int64 = long long;
const int mod = 1e9 + 7;
int64 calc(vector< int64 > &vs)
{
int64 ret = 0;
int64 less = 0;
sort(begin(vs), end(vs));
for(int i = 1; i < vs.size(); i++) {
... | #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n) && n != 0){
int arr[n];
for(int i = 0; i < n; i++){
scanf("%d",&arr[i]);
}
int max_e = arr[0], max_s = arr[0];
for(int cur = 1; cur < n; cur++){
max... | 0 | 48,798,244 |
#include <iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int count = 0;
int z;
for (int x = 0; x <= k; x++) {
... | #include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | 0 | 94,424,115 |
#include <iostream>
int main()
{
using namespace std;
int a,b,c;
int now_num,counter=0;
cin>>a>>b>>c;
now_num=a;
while(now_num<=b)
{
if(c%now_num == 0)
counter++;
now_num++;
}
cout<<counter<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define MotoHaiyaku ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef u... | 0 | 52,081,167 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
string S;
ll Mod = 1000000000 + 7;
cin >> N >> S;
ll a[26];
for (int i = 0; i < 26; i++) {
a[i] = 1;
}
for (int i = 0; i < N; i++) {
a[S[i] - 'a']++;
}
ll ans = 1;
for (int i = 0; i < 26; i++) {
ans ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 68,582,246 |
#include <stdio.h>
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define REP(i,n) FOR(i,0,n)
int main()
{
FOR(i,1,10) {
FOR(j,1,10) {
printf("%dx%d=%d\n",i,j,i*j);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n ,k , x , y ,ans;
int main()
{
cin >> n >> k >> x >> y;
if (n > k)
ans = x * k + y * (n - k);
else
ans = x * n;
cout <<ans << endl;
} | 0 | 50,669,837 |
#include<bits/stdc++.h>
#pragma GCC optimize(3,"Ofast","inline")
#define int long long
using namespace std;
inline int read(){
int f=1,x=0;char ch=getchar();
while(ch<'0'&&ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
main(){
ios::sync_with... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 16,207,041 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main() {
int a, b, C;
double S, L, h, pi, c, d;
cin >> a >> b >> C;
pi = acos(-1);
d = C*pi / 180;
c = sqrt(a*a + b*b - 2 * a*b*cos(d));
S = 0.5*a*b*sin(d);
L = a + b + c;
h = b*sin(d);
printf("%lf\n%lf\n%lf\n", S, L, h);
ret... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int64_t H, W;
cin >> H >> W;
if(H%3 == 0 || W%3 == 0) {
cout << 0 << endl;
} else {
int64_t ans = INT64_MAX;
for(int64_t i=1; i<H; i++) {
int64_t S1 = i*W;
int64_t S2 = (H-i) * ... | 0 | 65,960,089 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A > B || (N == 1 && A != B)) {
cout << 0 << endl;
return 0;
}
ll min_s = A + (N-2) * A + B;
ll max_s = A + (N-2) * B + B;
ll ans = max_s - min_s + 1;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <queue>
#include <map>
#include <set>
using namespace std;
using Int = int64_t;
using P = pair<Int, Int>;
const Int INF... | 0 | 13,097,483 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | #include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 2000000000000000005
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long
#define P(gg) for(a... | 0 | 67,209,966 |
#include <bits/stdc++.h>
using namespace std;
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
#define ll long long int
void solve()
{
char a;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000000;
ll fac[201];
ll dp[201][176];
int main()
{
int n;
cin >> n;
if(n<10){cout<<0<<endl;return 0;}
for(int i =... | 0 | 20,977,526 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<bool> vecbool;
typedef vector<int> vecint;
typede... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 4,316,696 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a<=c && b+a>c){
cout<< "YES";
}
else{
cout<< "NO";
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int x[3000];
int y[3000];
int exchange;
for (int i=1; i<=3000; i=i+1 )
{
cin >> x[i] >>y[i] ;
if( x[i] == 0 )
{
if( y[i] == 0 )
{
break;
}else{
}
}else{
}
... | 0 | 11,401,129 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int main(){
int N,A,B;
cin>>N>>A>>B;
int sum=0;
for(int i=1;i<=N;i++){
int n=i;
int cnt=0;
while(n!=0){
cnt+=n%10;
n/=10;
}
if(A<=cnt&&cnt<... | 0 | 62,723,028 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep2(i,n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T>
using Grid = vector<vector<T>>;
in... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long lint;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef unsigned long long ulint;
#define endl '\n'
#define fst first
#define sed second
#define pb push_back
#define mp make_pair
#def... | 0 | 38,445,133 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n == 2) {
int a, b;
cin >> a >> b;
if (a == b) {
... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
ll nums = 1;
bool ok = false;... | 0 | 90,938,246 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int... | 0 | 77,493,122 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 28,138,235 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='a' && s[1] =='b' && s[2] == 'c'){
cout<<"Yes"<<'\n';
}
else if(s[0] == 'a' && s[1] == 'c' && s[2] == 'b'){
cout<<"Yes"<<'\n';
}
else if(s[0] == 'b' && s[1] == 'a' && s[2] == 'c'){
cout<<"Yes"<<'\n';
}
else... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 5,783,069 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,X;
cin >> N >> X;
if(N%X==0){
cout << 0 << endl;
}
else{
cout << 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define y1 aksjdaskdjksjfksdjf
#define left kdnvldvoiwejifejg
#define right lkdsjflksdjfdjfk
#define prev asdasfsadjkjsdfjs
#define tm aklsjdasjdasjdkdjjf
#define lcm hddalkwjeidjjhasda
#define random_shuffle as... | 0 | 7,987,224 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include<iostream>
#include<string>
using namespace std ;
string s ;
char t[] = {'y','u','i','o','p','h','j','k','l','n','m'} ;
int main(){
while( cin >> s ){
if( s[0] == '#' ) break ;
int ans = 0 ;
int x,j ;
for( int i=0 ; i<s.size() ; i++ ){
for( j=0 ; j<12 ; j++ ){
if( s[i] == t[j] ) break ;
}
... | 0 | 50,999,076 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() - 1; i++)
{
if (S[i] != S[... | 0 | 8,042,282 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=(n)-1;i>j-1;i--)
... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
long long int lis[100][2];
long long int ans=4000000000000000001;
for(int i=0;i<N;i++)cin>>lis[i][0]>>lis[i][1];
for(int i=0;i<N;i++){
for(int j=i;... | 0 | 30,278,393 |
#include<stdio.h>
int main()
{
long long A,B,X;
scanf("%lld %lld %lld",&X,&A,&B);
if(A-B>=0)
{
printf("delicious");
}
else if(A-B>=-X)
{
printf("safe");
}
else if(A-B<-X)
{
printf("dangerous");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
void solve();
clock_t start_time;
double get_current_time() {
return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
ios_base::sync_with_stdio(false);
solve();
}
#define fi first
#define re return
#define s... | 0 | 45,456,692 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | 0 | 83,930,911 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
char a[200010];
int main()
{
scanf("%s",&a);
int sum = 0;
int len = strlen(a);
for(int i = 0;i < len;i++){
sum += (a[i] - '0');
}
if(sum % 9 == 0) printf("Yes\n");
else printf("No\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
vector<vector<int>> ans(h,vector<int>(w,0));
rep(i,b){
rep(j,a)... | 0 | 14,275,338 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int N, K; cin >> N >> K;
ll a[N+1]={};
rep(i,N) { cin >> a[i+1]; a[i+1] += a[i]; }
vector<ll... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 45,244,340 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin >> c;
bool flg = (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o');
cout << (flg ? "vowel" : "consonant") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, H;
ll count = 0;
vector<ll> A, B;
cin >> N >> H;
A.resize(N);
B.resize(N);
for(ll i = 0;i < N;i++) cin >> A[i] >> B[i];
sort(A.begin(), A.end(... | 0 | 82,036,575 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int a[N],b[N],c[N];
int main()
{
int n,ans=0;scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
for(int i=1;i<=n;i++)a[i]=lower_bound(b+1,b+n+1,a[i])-b;
for(int i=1;i<=n;i++)c[a[i]]=i;
for(int i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
} else {
ll ans = 1e10;
for (ll i = l; i <= min(r, l+2019+1); i++) {
for (ll j = i + 1; j <= min(r, l+2019+1); j++) {
... | 0 | 97,217,777 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int N;
cin >> N;
vector< pair<int64_t,int> > p(N);
for(int i=0; i<N; i++) {
cin >> p[i].first;
p[i].second = i;
}
p.emplace_back(0, 0);
sort(p.rbegin(), p.rend());
vector<int6... | #include "bits/stdc++.h"
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 12,488,118 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cmath>
#define myPrint(a, b) printf("%12.8f %12.8f\n", a, b)
struct myPoint { double x, y; };
void koch(int n, myPoint a, myPoint b) {
myPoint s, t, u;
double th = M_PI * (60.0 / 180.0);
if (n == 0) return;
s.x = (2.0 * a.x + b.x) / 3.0;
s.y = (2.0 * a.y + b.y)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
ll n,m;
cin>>n>>m;
vector<pair<ll,ll> > x;
for(ll i=0;i<n;i++){
ll a,b;
cin>>a>>b;
x.push_back(make_pair(a,b));
}
sort(x.begin(), x.end());
ll sum=0, cnt=0... | 0 | 38,893,456 |
#include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
double PI = acos(-1);
class Dice{
int t;... | #include <bits/stdc++.h>
using namespace std;
long long int power(long long int x,long long int y)
{
long long int res = 1;
while (y > 0)
{
if (y & 1)
res = (res*x);
y = y>>1;
x = (x*x);
}
return res;
}
long long int power(long long int x,long long... | 0 | 79,154,399 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define srt(v) sort(v.begin(), v.end())
#define rev(v) reve... | #include <stdio.h>
#include <string.h>
int main(){
char str[1000],ord[10],work[1000];
int q,a,b,i,k;
scanf("%s%d",str,&q);
for(i=0; i<q; ++i){
scanf("%s",ord);
memset( work , '\0' , 1000);
if(strcmp(ord,"replace") == 0){
scanf("%d%d%s",&a,&b,work);
for(k=a; k <= b; ++k)
str[k]=work[k-a]... | 0 | 39,450,058 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <iomanip>
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll ir,dr;
ll n,r; cin >> n >> r;
if(n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
deque<int> dq;
for (int i = 0; i < n; i++) {
int a; cin >> a;
if (i % 2 == 0) dq.emplace_front(a);
else dq.emplace_back(a);
}
if (n % 2 != 0) {
for (int i = 0; i ... | 0 | 44,609,813 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
long long a,b,n;
string ss;
int main(){
cin>>n;
vector<int>v(n+2,0);
for (int i=1; i<=n; i++){
cin>>v[i];
b+=abs(v[i]-v[i-1]);
}
b+=abs(v[n]);
for (int i=1; i<=n; i++){
cout<<b-abs(v[i]-v[i-1])-abs(v[i]-v[i... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
int n; scanf("%d", &n);
ll a[n + 5];
for (int i = 0; i <= n; i++) scanf("%lld", &a[i]);
ll c[n + 5];
c[n] = a[n];
for (int i = n - 1; i >= 0; i--) {
c[i] = a[i] + c[i + 1];
}
if (n == 0) {
if... | 0 | 38,533,293 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int mx = 1e5 + 9;
const ll MOD = 1e9 + 7;
inline void normal(ll &a) { if (a >= MOD) a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) {normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) {normal(a), normal(b); ret... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<climits>
#define MOD 1000000007
typedef long long ll;
using namespace std;
struct UnionFind{
vector<int> par;... | 0 | 13,513,008 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
string p;
getline(cin, s);
getline(cin, p);
string tmp;
for(int i=0;i<s.size();i++){
if(s.size()-i < p.size()){
tmp = s.substr(i,s.size()-i) + s.substr(0, i+p.size()-s.size());
}else{
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#include<tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
bool war(const vector <int >& x, const vector <int >& y) {
for (int Z = -100; Z <= 100; ++Z) {
bool is_ok = true;
for (... | 0 | 55,063,676 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pl;
#define all(a) (a).begin(),(a).end()
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,n) for(ll (i)=(n)-1;(i)>=0;i--)
#define SHOW(x) cout << #x << ": " << x << endl... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 25,913,075 |
#include <stdio.h>
int main()
{
int h, w, i, j;
while (1) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0) {
break;
}
else if (h != 0 && w != 0) {
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
printf("#");
... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 | 25,168,664 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string s;
cin >> s;
bool ok = s[a] == '-';
for (size_t i = 0; i < s.size(); i++)
{
if (i != a) {
ok &= '0' <= s[i] && '9' >= s[i];
}
}
cout << (ok ? "Yes" : "N... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long lon... | 0 | 29,063,941 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#includ... | 0 | 95,045,254 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1)
a=14;
if(b==1)
b=14;
if(a>b)
cout<<"Alice"<<endl;
else if(a==b)
cout<<"Draw"<<endl;
else
cout<<"Bob"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> ar(n,0);
for(int i=0;i<n;++i)
cin>>ar[i];
vector<int> dp(n,INT32_MAX);
dp[0]=0;
for(int i=1;i<n;++i)
{
for(int j=max(i-k,0);j<i;++j)
{
dp[i]=min(dp[i],dp[j]+abs(ar[i... | 0 | 67,946,626 |
#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<string> candidates;
for (int i = 0; i < 10; ++i) {
string candidate(to_string(i));
for (int j = 0; j < 10; ++j) {
if (candidate.size() == 1) {
candidate... | #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int i=1;
int x;
while(cin>>x){
if(x!=0){
cout<<"Case "<<i++<<": "<<x<<endl;
}
else
break;
}
} | 0 | 91,375,948 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll pow(ll a,ll b){
if(b==0) return 1;
ll ret=pow(a,b/2);
ret*=ret;
ret%=mod;
if(b%2==1) ret*=a;
ret%=mod;
return ret;
}
struct nCr{
private:
vector<ll> vecs,vecm,vec;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <l... | 0 | 42,306,624 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,x,m;
cin >> n >> x >> m;
vector<ll> spare(m, -1);
ll now = x;
rep(i,m){
if(spare[now] != -1) break;
else{
... | #include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
const int maxn = 1e5 + 10;
int n,a[maxn];
int main() {
scanf("%d",&n);
for (int i = 1; i <= n; i++)
scanf("%d",&a[i]);
sort(a + 1,a + n + 1);
if (n == 2) {
printf("%d\n%d %d\n",a[2] - a[1],a[2],a[1]);
} else if (a[n] <= 0) {
int sum = a[n... | 0 | 21,621,674 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.