code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 64,003,165 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
ll x,y;
cin>>x>>y;
ll count=0;
if(x>=0 && y>=0){
if(x<=y) count=y-x;
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector<long long> l(n, 0), h(n), t(n), a(n);
cin >> t[0];
l[0] = h[0] = t[0];
for (int i = 1; i < n; i++) {
cin >> t[i];
if (t[i] > t[i-1]) {
l[i] = h[i] = t[i];
}
else {
... | 0 | 38,649,249 |
#include <bits/stdc++.h>
using namespace std;
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
int main() {
int n;
cin>>n;
vector<int>a;
for(int i=2;i<=n;i++){
if(is_prime(i))a.push_back(i);
}
int kotae=0;
if(a.size()<=3){
cout<<0... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind {... | 0 | 43,708,928 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
int main() {
ll A, B;
cin >> A >> B;
cout << lcm(... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<in... | 0 | 41,263,649 |
#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int main(){
double a,b,S,L,h,rad;
int c;
double PI = acos(-1);
cin>>a>>b>>c;
rad = c*PI/180;
S = a*b*sin(rad)/2;
L = a+b+sqrt(a*a+b*b-2*a*b*cos(rad));
h = 2*S/a;
printf("%.8lf\n", S);
printf("%.8lf\n", L... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#defin... | 0 | 61,927,657 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
int sum = 0, x = -1, y = -1, t = -1;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int z = N - i - j;
if (z < 0) continue;
int tmp = 10000 * i + 5000 * j + 1000 * z;
if (Y == tmp) {
... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
using namespace std;
int main(){
int W,H;
cin >> W >> H;
vector<int> p(W,0);
vector<int> q(H,0);
for(... | 0 | 66,280,296 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s;
cin>>s;
string result;
for(int i=0;i<s.size();i=i+2){
result+=s[i];
}
cout<<result<<endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 84,853,946 |
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#defin... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vector<ll>>;
template<c... | 0 | 40,860,353 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
const int64_t inf = 4e18 + 11;
signed main () {
int n, k;
cin >> n >> k;
vector < pair < int, int > > p(n);
vector < int > f(n), s(n);
for (int i = 0; i < n; ++i) {
cin >> p[i].x >> p[i].y;
f[i] = p[i].x;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 69,777,944 |
#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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
#define P pair<int,int>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define st st... | 0 | 59,954,993 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e,f,g;
cin >> a >> b >> c >> d;
if(b>a){
e = b-a;
}
else{
e = a-b;
}
if(c>b){
f = c-b;
}
else{
f = b-c;
}
if (c>a){
g = c-a;
}
else{
g = a-c;
}
if(d>=g || (d>=e && d>=f)){
cout << "Yes" << endl;
}
else... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 10,078,767 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <complex>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <bitset>
#include <cstdint>
#include <casse... | #include <stdio.h>
int main()
{
long long n, x, c, t, y;
scanf("%lld%lld", &n, &x);
c = n, t = n - x;
while(1){
c += 2 * (t / x) * x;
y = x, x = t % x;
if(!x){
c -= y;
break;
}
t = y;
}
printf("%lld\n", c);
return 0;
} | 0 | 72,500,738 |
#include<iostream>
using namespace std;
int main(){
string s;
getline(cin,s);
int i=0;
while (s[i] != '\0' ){
if (s[i] >='a' && s[i] <= 'z'){
cout << char(toupper(s[i]));
} else if (s[i] >='A' && s[i] <= 'Z'){
cout << char(tolower(s[i]));
} else {
... | #include<bits/stdc++.h>
#define N 100001
#define int long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(ch=='-')fs=1,x=0... | 0 | 77,695,989 |
#include<bits/stdc++.h>
#define ll long long
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define siii(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define s(a) scanf(... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 39,073,533 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <set>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
typedef long double db;
const int N=200005;
std:: set <db> set;
int a[N],prt1,prt2;
db fac[N],ans=-1;
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')... | 0 | 93,326,470 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>> g(200005);
vector<ll> ans;
void dfs(ll v, ll p = -1){
for(ll u : g.at(v)){
if(u == p)
continue;
ans.at(u) += ans.at(v);
dfs(u, v);
}
}
int main(){
ll n, q;
cin >> n >> q;
for(ll i... | 0 | 64,562,205 |
#include <iostream>
using namespace std;
int main() {
int n, a[100001] = {}, cnt = 0, t;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> t;
a[i] = t;
if (a[t] == i) ++cnt;
}
cout << cnt << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | 0 | 69,366,854 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main () {
int D;
cin >> D;
if (D == 25) cout << "Christmas" << endl;
else if (D == 24) cout << "Christmas Eve" << endl;
else if (D == 23) cout << "Christmas Eve Eve" << endl;
else if (D == 22) cout << "Christmas Eve Eve Eve" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 76,555,945 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | 0 | 87,220,478 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | #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 rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
... | 0 | 50,506,216 |
#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 <time.h>
#define ll ... | #include <iostream>
using namespace std;
int x, n;
bool exclude[102];
int main() {
int a;
cin >> x >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
exclude[a] = true;
}
int i = 0;
while (true) {
if (!exclude[x - i]) {
cout << x - i << endl;
return 0;
... | 0 | 26,037,746 |
#include<iostream>
using namespace std;
int main(){
string s;
cin >> s;
if(s[1]=='R'){
if(s[0]=='R'&& s[2]=='R'){
printf("%d\n",3);
}else if(s[0]=='R'|| s[2]=='R'){
printf("%d\n",2);
}else{
printf("%d\n",1);
}
}else if(s[0]=='R' || s[2]... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll ,ll>
#define vll vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell ... | 0 | 74,021,794 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b; cin >> k >> a >> b;
cout << ((a + k - 1) / k * k <= b ? "OK" : "NG") << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,d[100];
bool graph[100][100], visited[100];
queue<int> q;
void bfs(int s){
q.push(s);
visited[0]=true;
while(!q.empty()){
int v=q.front(); q.pop();
for(int v2=0; v2<n; v2++){
if(graph[v][v2] && visited[v2]=... | 0 | 11,268,261 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long;
int main() {
int x, t;
cin >> x >> t;
if (x >= t) cout << x - t << endl;
else cout << "0" << endl;
return 0;
} | #include <iostream>
#include <cstdio>
inline bool between(int value, int begin, int end) {
return begin <= value && value <= end;
}
int main() {
int n_nodes;
scanf("%d\n", &n_nodes);
int tree[n_nodes + 1];
for (int i = 1; i <= n_nodes; i++)
scanf("%d", &tree[i]);
int ip, il, ir;
for ... | 0 | 14,116,179 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
int ans=-1e18;
signed main(){
int n,k;cin>>n>>k;
vector<int> v(n),c(n);
for(int i=0;i<n;i++){cin>>v[i];v[i]--;}
for(int i=0;i<n;i++)cin>>c[i];
vector<vector<int>>w;
vector<int>used(... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 23,825,619 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define F first
#define S second
typedef pair<int,int> pii;
typedef long long ll;
int main(){
int n,m,ans=0; cin>>n>>m;
vector<int> B[m];
int arr[m];
for(int i=0; i<m; i++){
... | #include <iostream>
#include<cmath>
using namespace std;
struct Card{char ehuda,value;};
void arraycout(int *arrayy,int n){
for(int u=0;u<n;u++){
if(u==n-1){
cout<<arrayy[u]<<endl;
}else{
cout<<arrayy[u]<<' ';
}
}
}
void Bubble(Card* A,int n){
for(int i=0;i<n;... | 0 | 72,667,056 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define REP... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
string s;
cin>>n>>s;
for(int p=0;p<4;++p){
string t(n,'?');
t[0]=a=(p%2?'S':'W');
t[1]=b=(p/2%2?'S':'W');
for(int i=1;i<=n;++i){
int prev=(i%n==0?n-1:i-1);
int next=(i==n-1?0:i%n+1);
if((s[i%n]=='o'&&t[i%n]=='S... | 0 | 87,349,401 |
#include <stdio.h>
#include <string.h>
int x;
char y[101];
int main(){
scanf("%d",&x); scanf("%s",&y);
int len = strlen(y);
if(len<=x){
printf("%s\n",y);
return 0;
}
else{
for(int i=x; i<len; i++){
y[i]='\0';
}
for(int i=x; i<x+3; i++){
y[i]='.';
}
printf("%s\n",y);
return 0;
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 0 | 29,927,204 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <iostream>
using namespace std;
int main() {
int n, m, Min=1000001, Max=-1000000;
long Sum=0;
cin >> n;
for(int i=0; i<n; i++){
cin >> m;
if(m < Min){
Min = m;
}
if(m > Max){
Max = m;
}
Sum += m;
}
cout << Min << " ... | 0 | 26,760,137 |
#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>;
char que(int x){
printf("%d\n",x);
fflush(stdout);
char c[8];
scanf("%s", c);
if(c[0]=='V')exit(0);
return c[0];
}
int main(){
int n;
scanf("%d", &n);
... | #include <cstdio>
#include <vector>
using namespace std;
int n,k;
vector<int> v;
int main(){
int a;
int i;
while(scanf("%d %d",&n,&k) && (n || k) ){
v.clear();
for(i=0;i<n;i++){
scanf("%d",&a);
v.push_back(a);
}
a = 0;
for(i=0;i<k;i++){
a+=v[i];
}
int max = a;
for(;i<n;i++){
a = a - v[i -... | 0 | 90,197,678 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n,a,b;
cin >>n >>a >>b;
int p1 = 0, p2 = 0, p3 = 0;
for(int i = 0; i < n; i++){
int p; cin>>p;
if(p <= a) p1++;
else if(p <= b) p2++;
else p3++;
}
cout << min(p1, min(p2, p3)) <<e... | #include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
#define INF (int)(1e9)
int N;
const int MAX_N = 100010;
int dist[MAX_N];
bool chk[MAX_N];
struct state{
int d,v;
bool operator<(const state& r)const{
return d > r.d;
}
};
priority_queue<state> Q;
void go(int u,int c){
i... | 0 | 48,209,080 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num,fin=0;
string str;
char a=str[0];
cin >> num >> str;
for (int i=0; i<num; i++) {
char b=str[i];
if (a!=b){
fin++;}
a=b;}
cout << fin;} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
... | 0 | 52,370,205 |
#pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
inline int ri() {
int r; cin >> r; return r;
}
const ll mod = 1e9 + 7;
int main()
{
string s;
cin >> s;
int n = s.size();
for(auto &i : s)i -= '0';
vector<vector<ll>> dp(n + 1, vector<ll>(2));
dp[0][0] = 1;
for(int i = ... | 0 | 42,099,212 |
#include <bits/stdc++.h>
int main() {
putchar(getchar()+1);
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> a(n, vector<int>(d));
for(int i=0; i<n; i++) {
for(int j=0; j<d; j++) {
cin >> a[i][j];
}
}
int sum = 0;
int count = 0;
for(int i=0; i<n-1; i... | 0 | 97,240,115 |
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
r... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 56,915,208 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long A,B;
cin>>A>>B;
long long ans=(A*B)/__gcd(A,B);
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int d... | 0 | 92,653,952 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
string s;
cin >> s;
set<int> d;
for (auto &i : s) d.insert(i);
if (d.... | #include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
int answer = 0;
int i = N;
while (i >= 3) {
i -= 3;
answer++;
}
cout << answer << endl;
} | 0 | 53,258,323 |
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define fastcin() ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(), (x).end()
#define heap priority_queue
using namespace std;
typedef pair<int, int> ii;
mt19937 rng(chrono::steady_clock::now().time... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long W, H;
long p[100000];
long q[100000];
cin >> W >> H;
for(int i = 0; i < W; i++){
cin >> p[i];
}
for(int i = 0; i < H; i++){
cin >> q[i];
}
sort(p, p+W);
sort(q, q+H);
... | 0 | 73,400,036 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
long long N;
cin >> N;
int m = INFINITY;
for(long long i=1; i<=sqrt(N)+1; i++) {
if(N%i==0) {
int x = max(log10(i)+1,log10(N/i)+1);
m = min(m,x);
}
else continue;
}
cout << m << endl... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using P = pair<ld,ld>;
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 prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v) get... | 0 | 67,414,494 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 5,913,185 |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vecto... | #include <bits/stdc++.h>
int main(){
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::string s;
std::vector<char> v;
std::cin >> s;
for(int i = 0; i < (int)s.size(); i++){
if(s[i] == '0'){
v.push_back('0');
}else if(s[i] == '1'){
v.push_back('1... | 0 | 37,825,664 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "---... | #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; }
const int mod=1000000007;
const int INF=1001001001;... | 0 | 52,210,270 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, d;
void solve()
{
double ans;
if(!d) ans = 1.0*(m-1)/n;
else {
ans = 2.0*(n-d)*(m-1)/n/n;
}
printf("%.8lf\n", ans);
}
int main()
{
cin >> n >> m >> d;
solve();
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N, L, Q;
cin >> N;
vector<int> x(N);
REP(i, N) cin >> x[i];
cin >> L;
cin >> Q;
v... | 0 | 26,812,011 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int n,m;
cin >> n >> m;
cout << n*(n-1)/2 + m*(m-1)/2 << endl;
return 0;
} | #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 pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | 0 | 26,192,952 |
#include <bits/stdc++.h>
using namespace std;
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef vector<int> vi;
const int INF = 1000000000;
int main() {FIN
int n;
cin >> n;
cout << (n * (n + 1)) / 2 << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
c=0;
cin>>a>>b;
for(int64_t i=0;i<=a;i++){if(b==2*i+4*(a-i)){cout<<"Yes"<<endl;
c=1;
break;}}
if(c==0){cout<<"No"<<endl;}
} | 0 | 30,155,542 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
struct SegmentTree {
int n;
vector<int> dat;
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2*n-1, INF);
}
void up... | #include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int compute_digits(int n){
int counter = 0;
while(n != 0){
++counter;
n /= 10;
}
return counter;
}
int main(int argc, char const *argv[])
{
long long N;
cin >> N;
int answer = numeric_limits<int>:... | 0 | 258,969 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n; cin >>n;
vector<int> h(n);
rep(i,n) cin >>h[i];
int mx = 0;
int ans = 0;
rep(i,n) {
if(h[i] >= mx) ans++;
mx = max(h[i], mx);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100001];
int main(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int mid = ((a[n] + 1) / 2), pos = 0;
for(int i = 1; i < n; i++){
if(abs(pos - mid) > abs(a[i] - mid)){
pos = a[i];... | 0 | 69,953,621 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n;... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
if (buf.find("replace ") != string::npos)
{
char cmd[10] = {0};
... | 0 | 56,255,677 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll A[N+10];
ll ans = 1;
for(ll i=0;i<N;i++){
ll a;
cin >> A[i];
}
for(int i=0;i<N;i++){
if(A[i]==0){
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) {
return x;
} else {
return p... | 0 | 17,521,794 |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> as(n), bs(n);
for (auto &a : as)
cin >> a;
for (auto &b : bs)
cin >> b;
ll asum = accumulate(as.begin(), as.end(), 0LL);
ll bsum = accumu... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
int ans=0;
for(int i=1;i<N+1;i++){
int w=0;
int n=i;
while(n!=0){
w+=n%10;
n=n/10;
}
if(A<=w&&w<=B){
ans+=i;
}
}
cout << ans... | 0 | 76,442,485 |
#include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = std::pair<int, int>;
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb push_back
const int mn = 1e6 + 5;
int n, k;
int a[mn];
ll s[mn];
vector<ll> b;
int main() {
#ifdef trote
freopen("../1.txt", "r", stdin);
#end... | 0 | 90,819,336 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> G[200020];
vector<ll> P(200020),A(200020);
vector<ll> par(200020,-1);
void dfs(int u){
A[u]=P[u]+A[par[u]];
for(int i=0;i<G[u].size();i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 16,926,500 |
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
int main(){
string s1,s2;
int s=0;
while(getline(cin,s1)){
getline(cin,s2);
for(int i=0;i<s1.size();i++){
if(s1[i]!=s2[i]) s++;
}
cout<<s<<endl;
s=0;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin >>n>>m;
int c[m];
for(int i=0;i<m;i++){
cin>>c[i];
}
int l[n+1][m];
for(int i=0;i<=n;i++){
for(int j=0;j<m;j++){
if(i==0){
l[i][j]=0;
}else if(j==0){
if(c[0]>i){
l[i][j]=i;
}else{
l[i][j]=l[i-... | 0 | 24,790,393 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 | 47,895,372 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <fstream>
#include <queue>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <sstream>
#define For(i,a,b) for(int i=(a);i<(b);++i)
#define ... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 0 | 86,473,330 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #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 | 64,053,429 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i... | #include <bits/stdc++.h>
#define lli long long int
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(lli i=0, i##_len=(lli)(n); i<i##_len; i++)
#define repf(i, n) for(lli i=1, i##_len=(lli)(n+1); i<i##_len; i++)
#define per(i, n) for(lli i=((lli)(n))-1; i>=0; i--)
#define perf(... | 0 | 70,324,353 |
#include <iostream>
#include <string>
using namespace std;
long long binsearch(long long ans,long long digit){
string s;
long long dig = 1;
for(int i=0;i<digit;i++){
dig *= 10;
}
int lb = 10,ub = -1;
while(lb-ub>1){
long long mid = (lb+ub)/2;
if(digit==0 && mid==0){
return 1000;
}
cout << "? " << (an... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 76,442,269 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll X, A, B;
cin >> X >> A >> B;
if (A >= B) {
cout << "delicious" << endl;
}
else if (B -A > X) {
cout << "dangerous" << endl;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,c;
cin >> n >> c;
vec v(n);
for(ll i=0;i<n;i++) {
cin >> v[i];
}
ll ans=0;
for(ll i=1;i<=min(c,n);i++... | 0 | 27,417,864 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <i... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 46,108,674 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int i = 1; i < n; i++) {
if (a[i] < a[i-1]) {
ans += a[i-1]-a[i];
a[... | #include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
... | 0 | 4,416,283 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
reverse(S.begin(),S.end());
while (1) {
int N = S.size();
if (N >= 5) {
string S5 = S.substr(0,5);
if (S5 == "maerd" || S5 == "esare") {
S.erase(0,5);
} else if (N >= 6) {
string S6 = S.substr(0,... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
int main(){
LL n;
LL k;
LL ans;
vector<pair<LL, LL>> ab;
LL tmp_a;
LL tmp_b;
cin >> n >> k;
for(int i=0; i<n; i++){
cin >> tmp_a >> tmp_b;
ab.push_back(make_pair(tmp_a, t... | 0 | 4,737,450 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[m],b[m],c[m];
vector<vector<int>>d(n,vector<int>(n,1000000000));
for(int i=0;i<n;i++)d[i][i]=0;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i]>>c[i];
a[i]--;
b[i]--;
d[a[i]][b[i]]=c[i];
... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 26,965,055 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define pll pair<ll,ll>
#define pii pair<ll,ll>
#define all(s) s.begin(),s.end()
#define vll vector<ll>
#define vi ... | #include <bits/stdc++.h>
typedef long long int LL;
using namespace std;
namespace Number {
typedef long long int LL;
LL gcd(LL a, LL b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
LL gcd_extend(LL a, LL b, LL *x, LL *y) {
if (a == 0) {
... | 0 | 14,937,845 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
us... | 0 | 28,114,284 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include<bits/stdc++.h>
using namespace std;
int td(int n,vector<int> a)
{
vector<int> dp(n+1);
dp[1]=0;
dp[2]=abs(a[1]-a[2]);
for(int i=3;i<=n;i++)
{
dp[i]=min(abs(a[i]-a[i-1])+dp[i-1],abs(a[i]-a[i-2])+dp[i-2]);
}
return dp[n];
}
int main()
{
int n;
cin>>n;
vector<int> a... | 0 | 53,763,587 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++) {
cin>>A[i];
}
pair<ll,ll> mas;
pair<ll,ll> ma;
for(ll i=0;i<N;i++) {
if(A[i]>mas.first) {
mas.first=A[i];
mas.second=i;
}
else if(ma.f... | #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
int H,W,i=0,j=0,k=0;
while(cin>>H>>W){
if(H==0&&W==0) break;
for(i=1;i<=H;i++){
for(j=1;j<W;j++){
if(i==1||i==H)cout<<"#";
else {
cout<<"#";
for(k=0;k<W-2;k++){
cout<<".";
}
break;
}... | 0 | 31,613,546 |
#include<iostream>
using namespace std;
string s[10] = {"\n",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
char now,before;
string in;
void solve(){
now = '\n';
before = 'N';
int c=0,r=0;
int index = 0;
while(in[index++] == '0');
for(int i = index-1; i < in.length(); i++){
if(in[i] == '0')... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 16,077,256 |
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
string S;
cin>>S;
map<char, int> chrmap;
for(int i=0;i<S.size();++i){
chrmap[S[i]]++;
}
char ans = 'A';
for(char i='a';i<='z';++i){
if(chrmap[i]==0){
... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 56,637,642 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
string t;
bool ans=false;
char tmp;
cin >> s;
cin >> t;
int n=s.size();
for(int i=0; i<n; i++){
if(s==t){
ans=true;
break;
}els... | 0 | 88,775,983 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s;
cin >> s;
vector<bool> dp(26,false);
rep(i,int(s.size())){
dp[s[i]-'a']=true;
}
rep(i,26){
if(dp[i]==false){
cout << char('a'+i) << endl;
... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <numeric>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<int>> a(h,vector<int>(w,0));
queue<vector<int>> que;
for(int i=0; i<h; i++){
f... | 0 | 95,461,320 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s,t;
cin>>s>>t;
for(int i=0;i<s.size();i++){
cout <<s[i]<<t[i];
}
cout <<endl;
} | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
string S; cin >> S;
if (S.size() != 26) {
bool f[26] = {};
rep(i, S.size()) { f[S[i] - 'a'] =... | 0 | 84,917,787 |
#include <iostream>
#include <string>
using namespace std;
const string L = "qwertasdfgzxcvb";
int main(){
string s;
while(cin >> s, s != "#"){
int ans = 0;
bool prev = L.find(s[0]) != string::npos;
for(int i=1; i<(int)s.size(); ++i){
bool cur = L.find(s[i]) != string::npos;... | #include <iostream>
using namespace std;
int main(){
int N;
int A[100000];
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[i];
}
int prev_max = 1;
long ans = A[0]-1;
for(int i = 1; i < N; i++){
int tmp = prev_max+1;
if(A[i] == tmp){
prev_max = tmp;
... | 0 | 100,408,515 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
string L = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char col = 0;
int axis = 0;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
string S;
cin >> S;
if (S == "snuke"){
... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define ... | 0 | 70,907,465 |
#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 (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#define... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<long long>A(N+1);
vector<long long>B(N);
for(int X=0;X<N+1;X++){
cin>>A[X];
}
for(int X=0;X<N;X++){
cin>>B[X];
}
long long K=0;
for(int X=0;X<N;X++){
if(B[X]<=A[X]){
K+=B[X];
A[X]-=B[X];
}
... | 0 | 5,890,099 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int A, B, C;
cin >> A >> B >> C;
int m = ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> X(N,vector<int>(D));
for ( int i = 0; i < N; ++i){
for ( int j = 0; j < D; ++j){
cin >> X[i][j];
}
}
int count = 0;
for ( int i = 0; i < N-1; ++i){
for (... | 0 | 13,106,817 |
#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 a,b,c;
cin >> a >> b >> c;
if( a.back() == b.front() && b.back() == c.front() ){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return... | #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;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 57,929,131 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
ll K, A, B; cin >> K >> A >> B;
... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 4,604,683 |
#include<bits/stdc++.h>
using ll = long long;
int main(){
ll n;
scanf("%lld", &n);
ll a[n], b[n], c[n];
for(ll i=0; i<n; i++) scanf("%lld", &a[i]);
for(ll i=0; i<n; i++) scanf("%lld", &b[i]);
for(ll i=0; i<n; i++) c[i] = a[i] - b[i];
ll luck = 0, ans = 0;
... | #include <iostream>
using namespace std;
int main(){
int debt = 100000;
int week;
cin >> week;
for(int i = 0; i < week; ++i){
debt *= 1.05;
if(debt % 1000 != 0){
debt = (debt + 999) / 1000;
debt = debt * 1000;
}
}
cout << debt << endl;
r... | 0 | 27,350,382 |
#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 ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int x;
cin... | #include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
#include <map>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
vector<pair<ll, int>> prime_facto... | 0 | 32,521,666 |
#include <bits/stdc++.h>
#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 ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 50,335,208 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), ... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int chk[100001];
struct edg {
int idx, dst;
};
vector<edg> gph[100001];
int dst[100001];
void go(int now, int cnt) {
dst[now] = cnt;
chk[now] = 1;
for (edg nxt : gph[now]) {
if (!chk[nxt.idx]) {
go(nxt.idx, cnt+nxt.dst);
... | 0 | 76,641,416 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (int)(a); i <= (int)(n); ++i)
#define rrep(i, a, n) for (int i = (int)(a); i >= (int)(n); --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(f, 0, (x.size() - 1)) cerr << x[f] << (f == (x.size() - 1) ? "\n" : " ")
#define all(x) x.... | #include<iostream>
using namespace std;
int main() {
int A[8];
int n = 0;
while (n < 8) {
cin >> A[n];
n++;
}
int M = A[0] + A[1] + A[2] + A[3];
int N = A[4] + A[5] + A[6] + A[7];
if (M > N) {
cout << M << endl;
}
else {
cout << N << endl;
}
return 0;
} | 0 | 27,136,363 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a.at(i);
vector<int> b;
for(int i=1;i<n;i+=2)
b.push_back(a.at(i));
reverse(b.begin(),b.end());
for(int i=0;i<n;i+=2)
b.push_back(a.at(i));
if(n%2==1)
reverse(b.begin(),b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 200000
#define mod1 1000000007
#define mod2 1000000009
#define mod3 998244353
#define endl '\n'
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main()
{
IO
clock_t begin = clock();
ll n,k;
cin>>n>>k;
ll a[n+1];
... | 0 | 39,713,302 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> tmp(n);
rep(i, k) {
int d;
cin >> d;
rep(j, d) {
int a;
cin >> a;
tmp.at(a-1) = 1;
}
}
int cnt = 0;
rep(i, ... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 10,920,924 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
int main(void){
int n ;
cin >> n ;
int count = 0 ;
for(int i = 1 ; i < n +1 ; i++){
if(n - i > 0 && i != n-i){
count ++ ;
}
}
cout << count... | #include <iostream>
using namespace std;
int main(void){
int a, b, c;
cin>> a >> b >> c;
if(a<b&&a<c){cout << a <<" ";
if(b<c){cout << b <<" "<< c <<endl;
}else{
cout << c <<" "<< b <<endl;
}
}else if(b<a&&b<c){cout << b <<" ";
if(c<a){cout << c <<" "<< a <<en... | 0 | 7,501,485 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#include <cstdint>
#de... | 0 | 34,564,557 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
ll n, m;
cin>>n>>m;
if(n > m)swap(n, m);
if(n == 1){
if(m == 1)cout<<1<<endl;
else cout<... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vect... | 0 | 82,345,205 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 0 | 65,556,225 |
#include <iostream>
using namespace std;
int main(void){
int n,i;
cin >> n;
for(i=n;i<n+111;i++){
if(i%111==0) break;
}
cout << i;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | 0 | 58,088,699 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int comp(int *a,int *b){
int buffer;
if(*a > *b){
buffer = *b;
*b = *a;
*a = buffer;
return 1;
}
else{
return 0;
}
}
int main(){
int a,b,c,d,e;
int i = 1;
... | 0 | 17,728,304 |
#include <iostream>
#include <vector>
constexpr int MOD = 1000000007;
using namespace std;
int main()
{
int n;
cin >> n;
if (n < 3)
{
cout << 0 << endl;
return 0;
}
vector<int> dp(n + 1);
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
for (int i = 3; i < n + 1; i++)
{
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | 0 | 49,527,042 |
#include<stdio.h>
int selectionSort(int A[], int N) {
int minj, i, j, v;
int count = 0;
for (i=0; i<N; i++) {
minj = i;
for (j=i+1; j<N; j++) {
if (A[minj]>A[j]) minj = j;
}
if (minj != i) {
v = A[i];
A[i] = A[minj];
A[minj] = v... | #include <bits/stdc++.h>
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | 0 | 94,319,609 |
#include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
Int n; cin >> n;
vector<Int> a(n);
for(auto &i:a) cin >> i;
vector<Int> c(n, 0);
for(auto i:a) ++c[i-1];
vector<Int> d(n+2, 0);
for(auto i:c) ++d[i];
vector<Int> e(d);
for(Int i=0; i<n... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if(a == b){
cout << 0;
} else if (abs(abs(a) - abs(b)) == 0) {
cout << 1;
} else if (a > b) {
if ((a >= 0 && b <= 0) || (a <= 0 && b >= 0)) {
cout << abs(abs(a) - abs(b)) + 1... | 0 | 95,435,059 |
#include<iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int d,t,s; cin>>d>>t>>s;
if(d<=t*s) cout << "Yes\n";
else cout << "No\n";
} | #include<stdio.h>
int ov_abs(int a){
return a>0 ? a : -a;
}
int score[1000];
int main(){
int n;
scanf("%d",&n);
while(n!=0){
int ans = 889464810;
for(int i=0; i<n; i++){
scanf("%d",&score[i]);
}
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
... | 0 | 56,027,723 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
int a=0;
for(int i=0;i<s.length();i++)
{
if(s[i]!=s[i+1])
a++;
}
cout<<a<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
const double PI=3.14159265358979323846;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 55,124,331 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1<<30
#define LINF 1LL<<60
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll N;
int K[6] = {500,100,50,10,5,1};
while(cin >> N,N){
int res = 0;
... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int q;
scanf("%d", &q);
for(int i = 0; i < q; i++){
long a,b;
scanf("%ld %ld", &a, &b);
if(a>b){
swap(a,b);
}
lo... | 0 | 89,318,590 |
#include <iostream>
using namespace std;
int main() {
int FLOORS = 3;
int ROOMS = 10;
int first_b[FLOORS][ROOMS];
int second_b[FLOORS][ROOMS];
int third_b[FLOORS][ROOMS];
int fourth_b[FLOORS][ROOMS];
for (int i = 0; i < FLOORS; i++) {
for (int j = 0; j < ROOMS; j++) {
first_b[i][j] = 0;
se... | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 0 | 73,119,234 |
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
#define mx 100001
int main(){
int cost[mx],h[mx];
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> h[i];
}
cost[0] = 0;
for(int i = 1; i < n; i++){
cost[i] = min(abs(h[i] - h[i - 1... | /*http:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while (cin>>n && n>0){
vector<int> s;
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
s.push_back(tmp);
}
sort(s.begin(),s.end());
cout... | 0 | 4,290,355 |
#include <iostream>
using namespace std;
const int MAXN = 100 * 1000 + 5;
long long arr[MAXN];
long long temp[MAXN];
int n, k;
int main () {
cin >> n >> k;
for (int i = 0; i < n; i ++) {
cin >> arr[i];
if (i > 0) {
if (arr[i] > 0)
temp[i] = temp[i - 1] + arr[i];
else
temp[i] = temp[i - 1];
arr[i]... | #include <iostream>
using namespace std;
int main() {
int n = 0;
while (cin>>n && n != 0) {
int a[5001] = {};
cin>>a[0];
int max = a[0];
for (int i = 1; i < n; i++) {
cin>>a[i];
if (a[i] >= 0) {
int temp = 0;
for (int s = i;... | 0 | 91,196,309 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.