code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str,fc,p;
int q,i=0,a,b;
cin>>str>>q;
for(;i<q;i++){
cin>>fc>>a>>b;
switch(fc[2]){
case 'i':
cout<<str.substr(a,b-a+1)<<endl;
... | #include <stdio.h>
int main()
{
int n,f,e,j,k,i;
char m[1001],my[1001],c[10],mc[1001];
scanf("%s",m);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d",c,&f,&e);
if(c[0]=='p'){
for(k=f;k<=e;k++){
printf("%c",m[k]);
}
printf("\n");
}else if(c[3]=='e'){
j=e;
for(k=f;k... | 1 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp... | #include <bits/stdc++.h>
const int MAXN = 1010;
typedef long long LL;
int pri[MAXN], bak, n;
int ispri(int x) {
for (int i = 2; i * i <= x; ++i)
if (x % i == 0) return false;
return true;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL get(int x, int y) {
... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define Sort(x) sort((x).begin(),(x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
int main(void) {
std::string str;
int a;
int b;
int q;
std::string start = "";
std::string sub = "";
std::string end = "";
std::string s = "";
std::cin >> str >> q;
for (int i = 0; i < q; i++) {
... | #include <iostream>
int li, ri, n, m, a, b;
int main() {
a = 0;
b = 1000001;
std::cin >> n >> m;
for (int i = 0; i < m; ++i) {
std::cin >> li >> ri;
if (li > a) a = li;
if (b > ri) b = ri;
}
int ans = a > b ? 0 : b - a + 1;
std::cout << ans;
return 0;
} | 0 |
#include <iostream>
#include <limits.h>
using namespace std;
int dp[100][100];
int p[101];
int n;
void solve() {
for (int m = n; m > 0; m--) {
for (int t = 0, i = 0, j = n - m + 1; t < n && j < n; t++) {
dp[i][j] = INT_MAX;
for (int k = i; k < j; k++) {
int temp = dp[i][k] + dp[k + 1][j] + p[i] * p[k + ... | #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dp[111][111],n,L[111],R[111];
int f(int l,int r){
if(dp[l][r]>-1)return dp[l][r];
int res=1e9;
for(int i=l;i<r;i++){
res=min(res,f(l,i)+f(i+1,r)+L[l]*R[i]*R[r]);
}
return dp[l][r]=res;
}
main(){
memset(dp,-1,sizeof(dp));
r(i,... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = n - 1, num = 0;
for (int i = 1; i < n; i++) {
if (s.at(i) == 'E') num++;
}
//cout << num << endl;
ans = min(ans, num);
for (int i = 0; i < n - 1; i++) {
if (s.at(i) =... | #include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | 0 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int n;
cin>>n;
int a=pow(n,2);
int b=pow(n,3... | #include"bits/stdc++.h"
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
int a;
int ans;
cin>>a;
ans=a+a*a+a*a*a;
cout<<ans<<endl;
return 0;
} | 1 |
#pragma GCC optimize(3 , "Ofast" , "inline")
#include <bits/stdc++.h>
#define rep(i , a , b) for(register int i=(a);i<=(b);i++)
#define per(i , a , b) for(register int i=(a);i>=(b);i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int , int> pi;
template<class T>
inline v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
ll MOD = 1E+9 + 7;
int main() {
ll H, W, K;
cin >> H >> W >> K;
ll A[H+1][W+1] = {};
A[0][1] = 1;
ll c[8] = {1, 1, 2, ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <tuple>
#include <bitset>
#include <random>
int money[300];
int main(){
int x, y;
std::cin >> x >> y;
int ans = 0;
money[... | 0 |
// #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 1e5 + 7;
const double eps = 1e-9;
const ... | #include <iostream>
#include<cmath>
using namespace std;
int main()
{
int N,X,T;
cin>>N>>X>>T;
int k=ceil((double)N/X);
int val=k*T;
cout<<val<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string N, ans = "No";
cin >> N;
for(char s : N) {
if (s == '7') ans = "Yes";
}
cout << ans << endl;
}
| #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;
if(s.at(0)=='7' ||s.at(1)=='7' || s.at(2)=='7') cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int ans =a*b;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
int n=1;
int cnt=0;
cin >> a >> b;
if(n<b)
{
n=a, cnt++;
}
while(n<b)
{
n+=a-1;
cnt++;
}
cout << cnt << endl;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
cout << a + b + c + d - min(min(min(a, b), c), d) + max(e, f) << endl;
cin >> c;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 50;
ll p[64];
int st[64];
int tot = 0;
void ins(ll x) {
for (int i = 0; i < tot; ++i) {
if ((x >> st[i]) & 1) {
if (p[i]) x ^= p[i];
else {
p[i] = x;
break;
}
}
}
}
int n;
ll a[maxn];
int main()
{
ios::sync_... | #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX][MAX];
int prim() {
int a, min;
int d[MAX], p[MAX], color[MAX];
for ( int i = 0; i < n; i++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | #include <algorithm>
#include <iostream>
#include <string>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define FOR(i,k,n) for(int (i) = (k); (i) < (n); ++(i))
#define re... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int dp[111][111];
signed main(){
int n;
cin>>n;
int r[n],c[n];
for(int i=0;i<n;i++) cin>>r[i]>>c[i];
int INF=1LL<<55LL;
for(int i=0;i<111;i++) fill_n(dp[i],111,INF);
for(int i=0;i<n;i++) dp[i][i+1]=0;
for(int i=2;i<=n;i++)
for(int j=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int mod=1000000007;
int n;
cin >> n;
long to=0;
vector<int>a(n);
vector<int>b(n);
vector<int>c(n);
rep(i,n){
cin>>a.at(i)>>b.at(i... | 0 |
// https://atcoder.jp/contests/abc127/tasks/abc127_e
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(_i, n) printf("%d%c", a[_i], _i + 1 == n ? '\n' : ' ')
#define DUMP2D(a... | #include <bits/stdc++.h>
using namespace std;
const int64_t MAX = 510000;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i]... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;
int n, m;
int a[4][MAXN];
int b[MAXN];
int c[MAXN], d[MAXN];
void read(){
scanf("%d", &n);
for(int i = 1; i <= 3; i++){
for(int j = 1; j <= ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using Graph = vector<vector<bool>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1000000007;
const double PI = 3.141592653589793238463;
const int N=2e5+9;
char a[109][109];
int main()
{
FASTINOUT;
int r,c;
ci... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
vector<string> s(3);
rep(i,3){
cin >> s.at(i);
}
int c=0;
vector<int> a(3,0);
while(1){
int cp=c;
a.at(c)++;
for(int i=0;i<3;i++){
if(a.at(i)>s.at(i).size()){
char d='... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
while(t--)
{
string a,b,c;
cin>>a>>b>>c;
char ch ... | 1 |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | #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 |
#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, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i... | #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;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,le... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),... | //#define _GLIBCXX_DEBUG
#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... | 0 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b,m;
cin>>a>>b>>m;
int ref[a],mic[b];
for (int i=0;i<a;++i){
cin>>ref[i];
}
for (int i=0;i<b;++i){
cin>>mic[i];
}
int mini = INT_MAX;
for(int i=0;i<m;++i){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
vector<vector<int>>xyc(3, vector<int>(M));
for(int i=0; i<A; i++)cin >> a.at(i);
for(int i=0; i<B; i++)cin >> b.at(i);
for(int i=0; i<M; i++){
for(int j=0; j<3; j++){
... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#define int long long
using namespace std;
int cost[101][101];
int d[101];
bool used[101];
int V,k,o,a,b,c,di,e,ans;
void dij(int s){
fill(d,d+101,10000000);
fill(used,used+101,false);
d[s]=0;
while... | #include<iostream>
using namespace std;
int main(){
while(1){
int INF=100000100;
int n,k,ans[105][105],t,a,b,c;
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
for(int i=1;i<=n+2;i++){
for(int j=1;j<=n+2;j++){
ans[i][j]=INF;
if(i==j)ans[i][j]=0;
}
}
for(int i=0;i<k;i++){
scanf("%d",&t);
if(t==0){
sca... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b,c,d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << min(a,b)+min(c,d) <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
int sum = 0;
for (int i = 0; i < 4; i++) {
cin >> a >> b >> c >> d;
}
sum += (a < b) ? a : b;
sum += (c < d) ? c : d;
cout << sum << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
#define NM_MAX 2002
using namespace std;
int n, m;
bool ma[NM_MAX][NM_MAX];
int lg[NM_MAX][NM_MAX];
int v[NM_MAX];
int mxl[NM_MAX];
int mxr[NM_MAX];
stack <int> st;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
string s;
cin >> s;
for(int... | 0 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
const long long mod = 1e9 + 7;
int x[2];
cin >> x[0] >> x[1];
static long long line[2][100000] = {};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < x[i]; j++) {
cin >... | /*
Written by Nitrogens
Desire for getting accepted!!
*/
#include <cstdio>
#include <ctime>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <bitset>
#include <stack>
#include <set>
#include <vector>
using namespace std;
ty... | 1 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <iostream>
using namespace std;
int c[5];
int counts[14];
int countscounts[5];
bool IsFourCard()
{
return countscounts[4] == 1;
}
bool IsFullHouse(... | #include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int cards[5];
bool check ()
{
for (int i = 0; i < 5; i++) if (cards[i] > 0) return true;
return false;
}
void ref() { for (int i = 0; i < 5; i++) cards[i] = 0; }
int main()
{
while (scanf("%d,%d,%d,%d,%d", &cards[0], &car... | 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree < pairs , null_type , greater<pairs>, rb_tree_tag , tree_order_statistics_node_update >
#define ll long long
#define lld long double
#de... | 0 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
int main(){
int H, W; cin >> H >> W;
vector<vector<int> > A(H+1, vector<int>(W+1));
rep(i , 1, H+1) rep(j, 1, W+1) cin >> A[i][j];
re... | 1 |
#include <stdio.h>
int main() {
int h1, h2, m1, m2, k, ans;
scanf("%d%d%d%d%d", &h1, &m1, &h2, &m2, &k);
ans = (h2 - h1) * 60 + (m2 - m1) - k;
printf("%d\n", ans);
} | // Bismillahirrahmanirrahim
// by Batrrr Tolkynbayev
#include <bits/stdc++.h>
// skripi krasava
#define respa return 0
#define all(x) x.begin(), x.end()
#define sz size
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 17, M = N << 2, mo... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
static const int N = 1000;
int Edit_Distance(string s1,string s2){
int dp[N + 1][N + 1] = {};
int m,n;
m = s1.size();
n = s2.size();
for(int i = 0;i <= m;i++){
dp[i][0] = i;
}
for(int i = 0;i <= n;i++){
dp[0][... | #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... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll cl[1000000][2];
int main(void){
ll i,len,lv,cnt,p,pp,x;
char s[1000001];
cin>>s;
len=strlen(s);
for(i=0;i<len;i++) cl[i][1]=0;
cnt=1; p=0; pp=0;
if(s[0]=='J') cl[0][0]=0;
else if(s[0]=='O') cl[0][0]=1;
else cl[0][0]=2;
for(i=0;i<len;i++){
... | #include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
string s;
char t[1000001];
int ans;
int main(){
scanf("%s", t);
s = t;
for(int i=0; i<s.size(); i++){
int J, O, I;
if(s[i] == 'J'){
J = 0;
while(s[i] == 'J'){
i++;
J++;
}
if(s[i] == 'O'){
O = 0;
while(s[i... | 1 |
//---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
//-... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
ll s[200010];
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i+1]=s... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, Q;
cin >> N >> M >> Q;
vector<vector<int>> cnt_vec(N + 1, vector<int>(N + 1, 0));
int L, R;
for (int i = 0; i < M; ++i) {
cin >> L >> R;
cnt_vec.at(L).at(R) += 1;
}
vector<vector<int>> cumsum(N + 1, vector<int>(N + 1, 0));
for (int i = N;... | #include <cstdio>
using namespace std;
int n,d1,d2,s;
int f[620][620];
void work(int d){
int p=0;
while(d%4==0){
d/=4;
p++;
}
if(d&1){
for(int i=0;i<2*n;i++)
for (int j=0;j<2*n;j++)
if(((i>>p)+(j>>p))&1)
f[i][j]=1;
}else{
for(int i=0;i<2*n;i++)
for(int j=0;j<2*n;j++)
if((i>>p)&1)
f[... | 0 |
#include <iostream>
#include <climits>
using namespace std;
#define int long long
const int INF=1e18;
const int MAX_V=2000;
int v,g[MAX_V][MAX_V],r;
void warshall(){
for(int k=0;k<v;k++)
for(int i=0;i<v;i++)
for(int j=0;j<v;j++) g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
}
signed main(){
int e;
cin>>v>>e;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 |
#include <iostream>
#include <climits>
#include <vector>
#include <cstring>
using namespace std;
#define V_MAX 10040
int N,E;
int INF = INT_MAX/4;
struct edge {
int to,cap,rev;
edge(int _to, int _cap, int _rev) {to = _to; cap=_cap; rev=_rev;}
};
vector<edge> G[V_MAX];
bool used[V_MAX];
void add_edge(int fr... | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=1010000;
const int P=1000000007;
const db... | 0 |
// darksta5's template v2.0
#include <bits/stdc++.h>
#define ll long long
using namespace std;
class DisjointSet
{
private:
int _sz, _numSets;
vector<int> _par, _setSz, _rank;
public:
DisjointSet(int sz)
{
_sz = sz;
_numSets = sz;
_setSz.assign(sz, 1);
_rank.assign(sz, 0);
_par.assign(sz,... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
/*int main(){
int n, m;
cin >> n >> m;
vi vec(n);
vi num(n);
rep(i,m){
int si, ci;
cin >> si >> ci;
... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, q;
while (cin >> n >> q, n, q) {
int mem[110] = {};
int maxv = -1;
for (int i = 0; i < n; i++){
int m; cin >> m;
for (int j = 0; j < m; j++) {
int d; cin >> d;
mem[d]++;
maxv = max(maxv, d);
}
}
int ans = 0,... | #include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
int N;
cin >> N;
cin.ignore();
for(int i = 0; i < N; ++i) {
string str;
int out_count = 0, base[3] = {0, 0, 0}, point = 0;
while (true) {
getline(cin,str);
if (str == "O... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, r; cin >> n >> r;
n = min(n, 10);
cout << r + 100 * (10-n) << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout <... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
uint N; cin >> N;
vector<int> A(N, 0);
for (auto &a: A) cin >> a;
int cnt = 0;
bool exist = false;
while (!exist) {
for (size_t i=0; i<A.size(); ++i) {
if (A[i] % 2 != 0) {
exist = true;... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 80 + 1;
const int SIZ = 2 * 6400 + 1;... | #include <bits/stdc++.h>
#define rp(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
using G=vector<vector<int>>;
bool dp[6410][20000];
int abs(int x,int y){
if(x>=y) return x-y;
else return y-x;
}
int main(){
int h,w;
cin >> h >> w;
vector<int> a(h*w), b(h... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int waseda[10];
int keo[10];
for(int i = 0; i < 10; i++){
cin >> waseda[i];
}
for(int i = 0; i < 10; i++){
cin >> keo[i];
}
sort(waseda,waseda+10,greater<int>());
sort(keo,keo+10,greater<int>());
int sumW=0;
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(x, n) for (int x = 0; x < n; x++)
#define REP(x, a, b) for (int x = a; x <= b; x++)
#define all(container) (container).begin(), container.end()
#define rall(container) (container).begin(), container.end()
#define sz(container) (int) (... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<char> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int ans=0;
vector<int> E(N+1);
vector<int> W(N+1);
E[0]=0;
W[0]=0;
for(int i=0;i<N;i++){
if(S[i]=='E'){
E[i+1]=E[i]+1;
}else{
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 |
/* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int A;
int B;
int C;
cin >> A;
cin >> B;
cin>> C;
vector <int> seged_vector;
seged_vector.push_back(A+B);
seged_vector.push_back(A+C);
seged_vector.push_back(B+A);
seged_vector.push_back(B+C);
seged_vector.push_back(C+A);
... | 1 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
class Graph {
public:
int N;
vector<vector<int>> G;
vector<bool> vis... | 0 |
//ALDS1_13_A
#include <iostream>
#include <vector>
using namespace std;
void printChess(int chess[]){
for(int i=0;i<8;i++){
for(int j=0;j<8;j++){
if(j == chess[i])
cout<<"Q";
else
cout<<".";
}
cout<<endl;
}
}
bool isBlank(int chess[], int &r){
for(int i=0;i<8;i++){
if(chess[i] == 100){
r =... | // Phttps://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<b... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=305;
#define fi first
#define se second
typedef pair<int,int>P;
priority_queue<P>que;
int n,m,b[N],vi[N],cnt[N],a[N][N];
bool check(int mid){
while(!que.empty()) que.pop();
for(int i=1;i<=m;i++) b[i]=0;
for(int i=1;i<=n;i++) ++b[a[i][cnt[i]=1]];
for(int i=1;i... | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
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(a>b){a=b;return 1;}return 0;}
int main() {
i... | 1 |
// J'aime
// Chemise Blanche
#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()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, y;
cin >> n >> y;
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int mini = 101;
for (int i = 0; i < 4; ++i) {
int s;
cin >> s;
sum += s;
mini = min(s, mini);
}
int s1, s2;
cin >> s1 >> s2;
cout << sum - mini + max(s1, s2) << '\n';
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>a(n);
rep(i,n){
cin >> a[i];
}
int k=1000000;
int ans=0;
rep(i,n){
k=min(k,a[i]);
if(k==a[i]){
ans++;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define ld long double
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (long long i=a;i<n;i++)
#define sz(A) (int)(A.size())
#define all(x) (x).begin(),(x).end()
#define get(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
void solve() {
int n;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, x;
cin >> N;
cin >> K;
x = 1;
for (int i = 0; i < N; ++i)
{
if (x * 2 < x + K)
{
x = x * 2;
}
else
{
x = x + K;
}
}
cout << x << endl;
} | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#i... | 0 |
#include <bits/stdc++.h>
#define ll unsigned long long
#define MOD 1000000007
using namespace std;
ll a[2000005];
ll S[2000005];
ll add(ll a,ll b){
return (a%MOD+b%MOD)%MOD;
}
ll mul(ll a,ll b){
return (a%MOD*b%MOD)%MOD;
}
int main(){
int n ;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
S[1] = a[1];
for(int i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mod = 1e9+7;
int main()
{
int n;
cin>>n;
vector<ll> a(n);
ll s1 = 0, s2 = 0;
for (int i=0; i<n; i++) {
cin>>a[i];
s1 += a[i];
s2 += (a[i] * a[i]);
s1 %= mod;
s2 %= mod;
}
ll res = (... | 1 |
//#define _GLIBCXX_DEBUG
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
cout << A + B + C + D + E + F - min(A, min(B, min(C, D))) - min(E, F) << endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int x,y;
ll cnt=0;
cin >> x >> y;
if(x>=... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
ll a, b; cin >> a >> b;
if(a == 0){
if(b < 0) cout << abs(b) + 1 << endl;
else cout << abs(b) << e... | 1 |
#include <iostream>
using namespace std;
static const int MAX = 101;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX][MAX];
int prim()
{
int u, mincost;
int d[MAX], p[MAX], color[MAX];
for(int i=0; i<MAX; i++)
{
... | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int p[100];
pair<int, int> a[10000];
int root( int m ) {
if ( p[m] != m )
p[m] = root( p[m] );
return p[m];
}
void unit( int x, int y ) {
p[root( y )] = root( x );
}
bool same( int x, int y ) {
return root( x ) == root( y );
}
i... | 1 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 1e14;
void solve(){
int n; cin >> n;
string s; cin >> s;
if(s.length() <= n) cout << s;
else cout << s.substr(0, n) << "...";
}
int main() {
ios_base::sync_with_stdi... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
ll x;
ll y;
};
node a[5007];
int n;
bool cmp(node p,node q)
{
if (p.x+p.y==q.x+q.y) return p.y<q.y;
return p.x+p.y<q.x+q.y;
}
int main(){
ios::sync_with_stdio(false);
scanf("%d",&n);
for (int i=1;i<=n;i++)
... |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int... | 1 |
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n; cin >> n; cout << n / 3;
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;... | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll x, ll n){
ll res = 1;
ll mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Combination
{
int... | #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
//const int MOD=998244353;
const long long LINF=1e18;
#define int long long
//template
int black[2005][2005],ver[2005][2005],wid[2005][2005];
//main
signed main(){
int N,M,Q;cin>>N>>M>>Q;
std::vector<string> s(N+1);
for(int i=0;... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
x=0;char c=getchar();bool f=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t> inline void write(t x){
if(x<0){putch... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
vector<char> S(A + B + 1);
for (int i = 0; i < A + B + 1; i++) {
cin >> S.at(i);
}
string ans = "Yes";
if (S.at(A) != '-') ans = "No";
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == '-'... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (a); i < (int)(b); i++)
#define pw(x) (1LL<<(x))
static const int fast_io = [](){io... | #include <iostream>
#include <vector>
using namespace std;
int simulate(vector<long long int> A){
int N = A.size(), ret = 0;
while(1){
int t = 0;
for(int i = 0; i < N; ++i){
if(A[i] > A[t]) t = i;
}
if(A[t] < N) break;
for(int i = 0; i < N; ++i){
if(i != t) ++A[i];
else A[i] ... | 1 |
#include "bits/stdc++.h"
#define ll long long
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef pair<ll, ll> pairs;
typedef pair<ll, pairs> tpl;
ll c[4];
double dp[301][301][301];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a;
cin >> n;
for (ll i = 0; i < n; i++)
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return f... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
pii p[100005]... | #include <iostream>
#include <vector>
#include <functional>
using namespace std;
const int INF = 1001001001;
template<class M, class L> struct LazyPropagationSegmentTree
{
int n;
int size;
vector<M> data;
vector<L> lazy;
const function<M(M, M)> f_m;
const M e_m;
const function<L(L, L)> f_l;
const L e_l;
const... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace st... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;++i)
#define per(i,a,b) for(int i=(b),i##_end=(a);i>=i##_end;--i)
#define For(i,a,b) for(int i=(a),i##_end=(b);i<i##_end;++i)
#define foe(i,a) for(__typeof(a.begin())i=a.begin();i!=a.end();++i)
#define X first
#define Y... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Segtree {
int n;
T e;
vector<T> dat;
typedef function<T(T a, T b)> Func;
Func f;
Segtree(){}
Segtree(int n_input, Func f_input, T e_input){
initialize(n_input, f_input, e_input);
}
void initialize(int... | #include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
#define LP pair<LL, LL>
const LL inf = 1e17;
struct segtree {
int n = 1;
vector<LP> node;//cost, place
void init(int N) {
node.clear();
while (N > n) n *= 2;
node.resize(n * 2,... | 1 |
#define _GLIBCXX_DEBUG //エラーを出すためのおまじない
#include <bits/stdc++.h>
//#include <cstdlib> // abs() for integer
#include <cmath> // abs() for float, and fabs()
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cou... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT64_MAX;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
typedef pair<int, int> P; typedef pair<ll, ll> PL... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int p=1e9+7;
char s[300010];
int n,i,j,ans,k,f[300010][3][3];
int main(){
scanf("%s",s+1);
n=strlen(s+1);
f[0][0][0]=1;
for(i=1;i<=n;i++){
if(s[i]!='1'){
for(j=0;j<3;j++)
for(k=0;k<3;k++){
if(k==2){
f[i][j][k-1]=(f[i][j][k-1... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define rep(a,b,c) for (int a=b;a<=c;a++)
#define per(a,b,c) for (int a=b;a>=c;a--)
#define go(u) for (int o=ft[u],v;v=E[o].t,o;o=E[o].n)
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> par;
typedef double dob;
/*... | 1 |
#include <bits/stdc++.h>
using namespace std;
//TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#d... | #include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIR... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << end... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fore(b,c) for(int val0=b;val0<c;val0++)
#define forr(k,c,s) for(int k=c;k<s;k++)
#define pb push_back
#define mmp make_pair
#define oset(T) tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_updat... | 1 |
#include<bits/stdc++.h>
const int mod = 1e9 + 7;
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for(int i = 0; i < N; ++i) cin >> A[i];
for(int j = 0; j < M; ++j) cin >> B[j];
sort(A.begin(), A.end(), greater<int>());
sort(B.begin(), B.end(), greater<int>());
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
long long M = 1e9 + 7;
int a[N], b[N], n, m;
long long res = 1;
long long mrk[N * N];
vector <pair <int, int> > v;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int j = 0; j < m; j++)
cin >> b[j];
for (int i = 0; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind
{
vector<int> par; //par[i]:iの親の番号
//初めは全てが根であるとして初期化する
UnionFind(int N): par(N)
{
for (int i=0; i<N; i++) par[i]=i;
}
int root(int x)
{
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
... | #include <iostream>
#include <vector>
#include <algorithm>
#include<string>
using namespace std;
struct Edge{
int P1;
int P2;
int Wei;
};
int main(void){
vector<Edge> EdgeCol;
int V, E;
cin >> V >> E;
if (V == 1){cout << 0<<endl;return 0;}
vector<int>Select(V,0);
for (int i = 0; i < E; ++i){
int ... | 1 |
/**
*Makacha
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typenam... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1... | 1 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#incl... | 0 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mxN=2e5+5,M=1e9+7;
const int LINF = 0x3f3f3f3f3f3f3f3f;
//did u check when n=1?
//is mxN correct?
s... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,n,ans=0;
cin>>N>>n;
if(n){
puts("-1");
return 0;
}
for(int i=1;i<N;i++){
int a;
cin>>a;
if(n>=a)ans+=a;
else if(n+1==a)ans++;
else{
puts("-1");
return 0;
}
n=a;
}
cout<<a... | 0 |
#include "bits/stdc++.h"
#define ll long long
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef pair<ll, ll> pairs;
typedef pair<ll, pairs> tpl;
ll c[4];
double dp[301][301][301];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a;
cin >> n;
for (ll i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define long long ll
#define f(i,n) for(int i=0;i<n;i++)
const int maxn=305;
double dp[maxn][maxn][maxn];
double recur(int k, int b, int c,int n){
if(dp[k][b][c]>=0)return dp[k][b][c];
if(k==0&&b==0&&c==0)return 0.0;
double res=0.0;
// dp[k][b][c]=0.0;
if(k>0)res+=(k)*... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans, t;
cin >> s;
ans = 1000;
for ( int i = 2;i < s.size(); i++ ) {
t = (s[i-2] - '0') * 100 + (s[i-1] - '0') * 10 + s[i] - '0';
ans = min(ans, abs(t-753));
}
cout << ans << endl;
... | #include<bits/stdc++.h>
int main() {
int arr[26]{};
std::string name;
std::cin >> name;
int n=name.size();
bool yes = 1;
for (int x = 0; x < n; x += 2) {
if (name.substr(x, 2) != "hi") {
yes = false;
}
}
std::cout << (yes == 1 ? "Yes" : "No");
} | 0 |
#include <bits/stdc++.h>
#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main()
{
int m, min, max;
while (cin >> m >> min >> max... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret retur... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long int n,x;
cin >> n >> x;
vector<long int> a(n);
long int sum=0;
int i;
for(i=0; i<n; i++){
cin >> a.at(i);
sum+=a.at(i);
}
sort(a.begin(),a.end());
if(x>sum) cout << n-1 << endl;
else if(x==sum) cout... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp ... | 0 |
#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
type... | #include<iostream>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
int ans = 0;
for(int i=0;i<n;i++){
if(s[i] == 'O'){
int j = 0;
while( (i+j<n) && (s[i+j] == 'O') )j++;
int k = 0;
while( (0<=i-1-k) && (k<j) && (s[i-1-k] == 'J'))k++;
int... | 1 |
#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 ... | #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)
ty... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int64_t res = 0;
vector table(20, vector(20, 0));
for (int i = 0; i < N; i++) {
string s;
cin >> s;
auto pos = s.find(".");
if (pos == string::npos) {
s += string(9,... | //
// main.cpp
// ALDS1_4_A
//
// Created by ptyuan on 2018/10/22.
// Copyright © 2018 YY. All rights reserved.
//
#include <iostream>
#include <cstdio>
using namespace std;
int linearSearch(int *array, int n, int key) {
*(array + n ) = key;
int i = 0;
while (array[i] != key) {
i++;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int cnt = 0, min = 200001;
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (p.at(i) <= min) cnt++;
if (p.at(i) < min) min = p.at(i);
}
cout << cnt << endl;
return 0;... | //...Bismillahir Rahmanir Rahim...
// Code by Asad Bin Saber
#include <bits/stdc++.h>
using namespace std;
// typedefs...
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
// cons... | 1 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<functional>
#include<stack>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
ll n,arr[200010],a,b,c,ans=1e18,s1,s2,s3,s4;
ll sum( ll l , ll r ){ return arr[r]-arr[l-1]; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin ... | 0 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdlib>
#include <math.h>
#include<cstdio>
#include<cstring>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fo(i,n) for(ll i=0;i<n;i++)
#define sz(a) ll((a).size()... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
constexpr ll MOD = 1000000007;
int main() {
ll n;
cin >> n;
ll a;
vector<ll> one(60);
rep(i, 0, n) {
cin >> a;
rep(j, 0, 60) if (a >> j & 1) one[... | #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 reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n;
int cnt = 62;
vector<ll> vec;
ll mod = 1e9+7;
ll solve()... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2e5+500;
int w[N],n;
int main()
{
scanf("%d",&n);int ans=0;
for(int i=1;i<=2*n;i++)scanf("%d",w+i);
sort(w+1,w+n*2+1);
for(int i=1;i<=2*n;i+=2)ans+=w[i];
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
ans=0;
cin >> n;
vector<string> s(3);
for(int i=0;i<3;i++){
cin >> s[i];
}
for(int i=0;i<n;i++){
if(s[0][i]==s[1][i] && s[0][i]==s[2][i]);
else if(s[0][i]==s[1][i] || s[0][i]==s[2][i] || s[1][i]==s[2][i])ans++;
else ans+=... | 0 |
#include<iostream>
using namespace std;
int main(){
int N,x;
cin >> N >> x;
int a[N];
for(int i=0; i<N; i++){
cin >> a[i];
}
long long total = 0;
for(int pairIndex=0; pairIndex<N-1; pairIndex++){
int first = pairIndex;
int second = pairIndex+1;
if(a[first] >... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void go(int x) {
cout << x << endl;
exit(0);
}
void solve() {
int x, y;
cin >> x >> y;
if(x == 0 || y == 0) {
if(x == 0) {
if(y >= 0) go(y - x);
else go(abs(y) + 1);
} else if(y == 0) {
if(x < 0)... | 0 |
//
// main.c
// ITP1_5_D
//
// Created by ??±??°?????? on 2015/10/11.
// Copyright ?? 2015??´ HamadaShogo. All rights reserved.
//
#include <stdio.h>
void call(int n);
int main(int argc, const char * argv[]) {
int num;
scanf("%d", &num);
call(num);
return 0;
}
void call(int n){
int... | #include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define us unordered_set
#define um unordered_map
#define ms multiset
#define mm multimap
#define pb push_back
#define pf pu... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 1 |
// AtCoder Beginner Contest 167 - Problem F: Bracketing Sequencing (https://atcoder.jp/contests/abc167/tasks/abc167_f)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
string solve(int N, const vector<string>& xs)
{
vector<int> cs;
vector<ii> ds, es;
int open =... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
bool cmp(pii x, pii y) {
return 1ll *... | 1 |
#include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FOD(i, a, b) for(int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 1e5 + 10;
int n, m, res[N], deg[N];
vector <int> adj[... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | 1 |
#include <iostream>
#include <vector>
long int cnt = 0;
void swap(std::vector<int>& arr, int i, int j) {
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
void merge(std::vector<int>& arr, int start, int mid, int end) {
int length = end -start;
int left = start, right = mid;
std::vector<int>... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int e;
cin >> e;
while(e!=0){
int Min = 1000000;
for(int i=0; i<e+1; i++){
int z = i;
if(z*z*z > e){
break;
}
int y = 0;
int x = 0;
while( (y+1)*(y+1) <= e-z*z*z ){
y++;
}
x = e-z*z*z-y*y;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.