code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(2);
cin >> v[0] >> v[1];
sort(v.begin(), v.end());
if (v[0] == 2)
cout << 1 << endl;
else if (v[1] == 2)
cout << 3 << endl;
else
cout << 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
ll n = s.size() +1;
vector<ll> x(n,0);
for (ll i = 0; i < n; i++){
if (i == 0){
if (s[0] == '<'){
x[0] = max(0LL,x[... | 0 | 94,978,707 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <utility>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <queue>
using namespace std;
#define LL long long
#define ld long double
#define pii pair<int,int>
#define pLL pair<LL,LL>
#define vint v... | #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... | 0 | 51,472,015 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int k, n;
cin >> k >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int M = a[0];
for(int i = 1; i < n; i++){
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 15,027,722 |
#include<bits/stdc++.h>
#include<vector>
#define inf 1000000
#define ll unsigned long long
#define boostUP ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define fsr(i,n) for(ll i=0;i<n;i++)
#define fcr(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define sz(arr) sizeof(arr)/sizeof(arr[0])
using namespace std;... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define ... | 0 | 15,032,371 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
using namespace std;
int main() {
int H, W, i, j, k, l;
vector<vector<string>> str(26, vector<string>(26));
string ans="",in,s = "snuke";... | #include <stdio.h>
#define N (300010)
int n,a, b;
int ans[N];
int main(){
scanf("%d%d%d", &n, &a, &b);
if (a+b-1 > n || 1ll*a*b < n){
printf("-1\n");
return 0;
}
for (int t = 1; t <= b; ++t){
int c = n-1ll*t*a-(b-t-1);
if (c >= 1 && c <= a){
int cnt = n, pos =... | 0 | 57,014,220 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long llint;
#define inf 1e18
llint n,k;
void solve(){
cin >> n >> k;
llint ans=1;
if(n%k==0)ans=0;
cout << ans << endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while(getline(cin, s), s != ".") {
bool find = true;
string world = "";
for(int i = 0; i < s.size(); ++i) {
switch(s[i]) {
case '(':
case ')':
case '[':
... | 0 | 43,185,173 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool isPalindrome(string s) {
string sr = s;
reverse(sr.begin(), sr.end());
return s == sr;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
string s1 = s.substr((n + 1) / 2), s2 = s.substr(... | #include<iostream>
using namespace std;
int main()
{
long long a[200000],i,n,l,m,j,pos=1,k;
cin>>n>>l;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
m=a[0]+a[1];
for(j=1;j<n;j++)
{
if(m<(a[j]+a[j+1]))
{
m=a[j]+a[j+1];
pos=j;
}
}
if(m<l)
... | 0 | 98,040,610 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
cout<<setprecision(10)<<fixed;
double n,m,d;
cin>>n>>m>>d;
double p;
if(d==0) p=1/n;
else p=2*(n-d)/(n*n);
p*=m-1;
cout<<p<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 INF=1001001001;
int main() {
int N;
cin>>N;
vector<int... | 0 | 26,489,717 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <vector>
#include <set>
#include <cassert>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
#include <queue>
#include <cstdio>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
us... | 0 | 74,865,843 |
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repf(i,a,n) for(int i = (int)(a); i < (int)(n); i++)
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
int main(){
int n,m,k;
string ans = "No";
cin >> n >> m >> k;
int nm = n*m... | #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... | 0 | 57,484,595 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n, k; cin >> n >> k;
if(k == 1) cout << 0 << endl;
else if(0 < n - k) cout << n - k << endl;
else cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, Y; cin >> X >> Y;
if (X <= 8 && Y <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
} | 0 | 21,336,286 |
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 35,959,608 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
#d... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int h[2000000], n=0;
int key;
int i, m;
string com;
while(true) {
cin>>com;
if(com[0]=='i') {
cin>>key;
i = ++n;
... | 0 | 51,679,696 |
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
#include<functional>
#define int long long
#... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 80,279,141 |
#include<stdio.h>
int main(void) {
int i, n, minj, j, a[100], count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; ++i) scanf("%d", &a[i]);
for (i = 0; i < n; ++i)
{
minj = i;
for (j = i; j < n; ++j)
{
if (a[j] < a[minj]) minj = j;
}
if (i != minj)
{
temp = a[i];
a[i] = a[minj];
a[minj] = t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<ll> a(N), b(N);
... | 0 | 77,567,415 |
#include<bits/stdc++.h>
using namespace std ;
int main() {
int N ;
cin >> N ;
unordered_map<string , int> M ;
for(int i = 0 ; i < N ; i++){
string S ;
cin >> S ;
sort(S.begin(),S.end()) ;
M[S]++ ;
}
int64_t T = 0 ;
for (auto p : M) {
auto v = p.second;
for( int i = 0 ; i < v... | #include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#defi... | 0 | 80,240,352 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ITER(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int)((a).size())
... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
typedef long long ll;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> ra... | 0 | 40,034,436 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) ... | 0 | 22,576,113 |
#include<iostream>
using namespace std;
int main() {
string str, c;
int q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> c;
if (c == "print") {
int a, b;
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if (c == "reverse"... | #include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
double th = M_PI * 60.0 / 180.0;
struct Point {
double x;
double y;
};
void printP(Point p){
cout << fixed << setprecision(8) << p.x << " ";
cout << fixed << setprecision(8) << p.y << endl;
}
void koch(int n, Point a, Point b){
... | 0 | 89,729,010 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char C;
char Z='z';
cin>>C;
if(C!=Z){
cout<<char(C+1);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf (1LL<<60)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using ... | 0 | 92,113,161 |
#include <iostream>
#include <string>
using namespace std;
class Dice
{
public:
enum DICE_FACE
{
eTop,
eFront,
eRight,
eLeft,
eBack,
eBottom
};
Dice(int t, int f, int r, int l, int ba, int bo)
{
this->mTopValue = t;
this->mFrontValue = f;
this->mRightValue = r;
this->mLeftValue = l;
this->mBa... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 72,668,472 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N; cin >> N;
vector<int> A(N);
for(int i=0; i < N; i++){
cin >> A[i];
}
sort(A.begin(),A.end());
vector<int> hantei(1000000,0);
int temp=-1;
for(int i: A){
if(temp == i){
hantei[i] += 1;
co... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()... | 0 | 15,864,392 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> A(N+2);
ll cost = 0;
A[0] = 0, A[N+1] = 0;
for(int i=1; i<=N; i++) cin >> A[i];
for(int i=0; i<=N; i++) cost += abs(A[i] - A[i+1])... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
int64_t mod = 998244353 ;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
vector<int... | 0 | 87,594,824 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string x,y;
int sum = 0;
for(;a<=b;a++){
y = x = to_string(a);
reverse(y.begin(),y.end());
if(x==y) sum++;
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> d;
... | 0 | 47,920,190 |
#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,m,X,Y;
cin >>n >>m >>X >>Y;
int maxx = X;
int miny = Y;
rep(i,n) {
int x;
cin >>x;
maxx = max(maxx, x);
}
rep(i,m) {
int y;
cin >>y;
miny = min(miny,... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
float p[4][2], ab, cd;
cin >> n;
for(int i = 0; i < n; ++i){
for(int j = 0; j < 4; ++j){
for(int k = 0; k < 2; ++k){
cin >> p[j][k];
}
}
ab = (p[0][1] - p[1][1]) / (p[0][0] - ... | 0 | 23,730,988 |
#include<iostream>
#define MAX 45
using namespace std;
void Fibonachi(int F[], int n) {
F[0] = F[1] = 1;
for (int i = 2; i <= n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
}
int main() {
int n,F[MAX];
cin >> n;
Fibonachi(F,n);
cout << F[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 0 | 9,377,236 |
#include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T>
bool chmax(T& a, cons... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
cin >> N;
vector<int> t(N+1, 0), x(N+1, 0), y(N+1, 0);
t[0] = 0;
x[0] = 0;
y[0] = 0;
for (int i = 1; i < N+1; i++)
{
cin >> t[i] >> x[i] >> y[i];
}
bool reachable = false;
fo... | 0 | 40,098,009 |
#include <iostream>
#include <vector>
using namespace std;
int main () {
int n;
int sum, max_sum;
while(cin >> n, n){
vector<int> a;
for(int i = 0; i < n; i++){
int temp;
cin >> temp;
a.push_back(temp);
}
max_sum = a[0];
for(int begin = 0; begin < n; begin++){
sum = 0;
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
int main() {
long long N;
long long ans = 0;
cin >> N;
ans = (N+2)*N*(N+1)/6;
for (int... | 0 | 41,299,523 |
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= ... | 0 | 72,612,986 |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int a[100005];
vector<int> G[100005];
int dfs(int v, int prev)
{
if(G[v].size() == 1) return a[v];
int sum = 0; vector<int> vec;
for(int i = 0; i < G[v].size(); i++){
if(G[v][i] == prev) continue;
int res = dfs(G[v][i], v);
... | 0 | 13,492,918 |
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long int lint;
void answer()
{
int n, b, f, r, v;
int map[8][4][16] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
map[b][f][r] += v;
}
for (b = 1; b <= 4; b++) {
if (b != 1) cout << "####################" <<... | #include<bits/stdc++.h>
using namespace std;
int p = 1e9+7;
const int N = 2e6;
vector<int >fact(N);
vector<int >invf(N);
int mul(int a,int b){
return (1LL*a*b)%p;
}
int po(int a,int deg){
if(deg==0)return 1;
int temp = po(a,deg/2);
temp = mul(temp,temp);
if(deg%2!=0)temp=mul(temp,a);
return temp... | 0 | 68,270,051 |
#include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n;
cin >> n;
int res = n;
int counter;
for (int i = 0; i <= n; i++) {
counter = 0;
int t = i;
while (t > 0) {
counter += t % 6;
t = t / 6;
}
t = n - i;
while (t > 0) {
counter += t... | #include<bits/stdc++.h>
using namespace std;
signed main() {
string s;
cin >> s;
int k;
cin >> k;
char c = s[0];
int ccnt = 0;
for (int i = 0; i < s.size(); ++i) if (s[i] == c) ++ccnt;
if (ccnt == s.size()) {
long long a = (long long)k * ccnt / 2;
cout << a << endl;
return 0;
}
s.push_back('X');
long l... | 0 | 50,242,361 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
typedef pair<int,int> pii;
typedef vector<int> vi;
const int INF = (1<<25);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int w,h;
int sx,sy;
char room[20][21];
int res;
int dfs(int y,int x){
room[y][x]='#';
for(int i=... | #include <iostream>
using namespace std;
int main()
{
string x;
while (true) {
cin >> x;
if (x[0] == '0') {
return 0;
}
int sum = 0;
for (int i = 0; i < (int)x.size(); i++) {
sum += (int)x[i] - '0';
}
cout << sum << endl;
}
} | 0 | 4,278,995 |
#include <bits/stdc++.h>
using namespace std;
#define forloop(n) for(int i = 0; i < n; i++)
#define ll long long
#define mod 998244353
long long exp(long long taban, long long us) {
long long carpan = taban;
long long temp = us;
long long res = 1;
for(int i = 0;;i++){
if(temp % 2) res = (res*car... | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | 0 | 100,084,686 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
int sortedArr[n];
copy(arr, arr + n, sortedArr);
partial_sort(sortedArr, sortedArr + 2, sortedArr + n, greater<int>());
for(int i = 0; i < n; i++) {
... | #include <stdio.h>
int main ()
{
int box [3][3], n, num;
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
scanf ("%d", &box[i][j]);
}
}
scanf ("%d", &n);
for (int k = 0; k < n; k++){
scanf ("%d",&num);
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
if(num == box[i][j]){
b... | 0 | 75,257,916 |
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
set<int> pas;
int cnt = 0;
for (int i = 0; i < 1000; i++) {
string tmp;
if (i < 10) tmp = "00" + to_string(i);
else if (i < 100) tmp = '0' + to_... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | 0 | 38,653,867 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int n, sz1, sz2;
cin >> n;
vector<int> v, v1, v2;
v.push_back(n);
v1.push_back(n);
while(1){
sort(v1.begin(), v1.end());
sz1 = v.size();
sz2 = unique(v1.begin(), v1.end()) - v1.begin();
if... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 0 | 48,664,933 |
#include <iostream>
#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<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define F first
#define S sec... | #include <iostream>
#include <vector>
#include <list>
using namespace std;
const int MAX = 100000;
vector<int> G[MAX];
list<int> out;
vector<bool> visited;
void dfs(int u){
visited[u] = true;
for (auto v :G[u]) {
if (!visited[v])dfs(v);
}
out.push_front(u);
}
int main(){
int v,e;
cin >> ... | 0 | 5,104,273 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 1;
const int MOD = 1e9 + 7;
int dp[MAX];
void add_self(int &a, int b)
{
a += b;
if(a >= MOD)
a %= MOD;
}
void sub_self(int &a, int b)
{
a -= b;
if(a < 0)
a += MOD;
}
int main()
{
int n, k;
cin >> n >> k;
dp[0... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
int toInt(string a){
int ret = 0;
for(int i=0;a[i];i++){
int num = 1;
if(isdigit(a[i])){
num = a[i++]-'0';
}
if(a[i]=='m') ret += num * ... | 0 | 2,883,319 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo... | #include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define e... | 0 | 37,021,571 |
#include<iostream>
using namespace std;
int main()
{
long long n,an;
cin>>n;
an=n*(n-1)/2;
cout<<an<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pi 3.141... | 0 | 45,939,754 |
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
char b; cin >> b;
char p;
switch(b) {
case 'A': p = 'T'; break;
case 'T': p = 'A'; break;
case 'C': p = 'G'; break;
case 'G': p = 'C'; break;
}
cout << p << endl;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int index_search(vector<vector<int>> array, int m, int n)
{
int index;
for (int i = 0; i < 4; i++)
{
if (array[m][i] == n)
{
... | 0 | 12,312,740 |
#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>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | 0 | 94,656,668 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | 0 | 39,593,176 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
ll n;
cin >> n;
vector<ll> v(n+1,1);
for (ll i = 2;i <= n;i++){
for (ll j = i;j <= n;j+=i) v[j... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
char maps[7][7];
int sum;
int ans;
int a[7];
int b[7];
int main()
{
int n,m,k;
cin>>n>>m>>k;
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
cin>>maps[i][j];
if(maps[i][j]=='#')
{
... | 0 | 22,271,592 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rapido ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
void solve()
{
int n;cin>>n;
string s;cin>>s;
stack<char>st;
for(int i=0;i<n;i++)
{
if(st.empty() || st.top()!=s[i])
st.push(s[i... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000000+7
typedef long long int lint;
int main (){
lint N,M,sum,ans = 0,op_x = -1,op_y = -1,op_z = -1;
cin >> N... | 0 | 87,972,473 |
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 7,015,752 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
int K;
cin>>N>>S>>K;
for(int i=0;i<N;i++){
if(S.at(i)==S.at(K-1)){
cout<<S.at(i);
}else{
cout<<"*";
}
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
long long sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] -= i + 1;
}
sort(a.begin(), a.end());
long long ans = 0;
for (auto x : a) {
ans += abs(x - a[n/2]... | 0 | 5,227,149 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,L,T;
struct evol{long long x,w;}a[101010];
bool cmp(evol u,evol v){return u.x<v.x;}
int main()
{
scanf("%d%d%d",&n,&L,&T);
for(int i=1,x,y;i<=n;i++)
scanf("%lld%lld",&a[i].x,&a[i].w);
long long rk=0;
for(int i=1;i<=n;i++)
{
if(a... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> P;
typedef long long ll;
typedef pair<ll,ll> pll;
... | 0 | 13,725,552 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long int i = 0; i < n; i++)
#define _rep(i,m,n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
using Graph =... | #include <bits/stdc++.h>
using namespace std;
namespace IO
{
const int __S=(1<<20)+5;char __buf[__S],*__H,*__T;
inline char getc()
{
if(__H==__T) __T=(__H=__buf)+fread(__buf,1,__S,stdin);
if(__H==__T) return -1;return *__H++;
}
template <class __I>inline void read(__I &__x)
{
... | 0 | 18,657,545 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;
typedef long long ll;
const int INF = INT_MAX/3;
int main(){
int H, W;
cin >> H >> W;
while(H!=0 || W!=0){
... | #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 FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
ty... | 0 | 68,404,959 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void a_candy_easy(void) {
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) sum += i;
cout << sum << endl;
}
int main()
{
a_candy_easy();
return 0;
} | #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>;
#define FOR(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(x) *min_eleme... | 0 | 95,007,517 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define mod 1000000007
signed main()
{
int i,j,n;
cin>>n;
if(n==0) cout<<1<<endl;
else if(n<3) cout<<0<<endl;
else
{
int dp[n+1]={0};
dp[3]=1;
dp[0]=1;
for(i=4;i<=n;i++)
{
for(j=i-3;j>=0;j--)
... | 0 | 75,106,669 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | 0 | 95,907,588 |
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(ll i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fitr(it,it1,itr2) for(auto it=itr1;it!=itr2;++it)
#define fall(a) a.begin(),a.end()
#define pb push_back
#de... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 76,339,323 |
#include<cstdio>
#define f(i,a,b) for(register int i=(a),i##end=(b);i<=i##end;i=-(~i))
#define rf(i,a,b) for(register int i=(a),i##end=(b);i>=i##end;i=~(-i))
const int neko=100010,mod=1e9+7;
int n,a[neko],fac[neko],ifac[neko],ht[neko];
int spow(int m,int n)
{
int b=1;
for(;n;n>>=1,m=1ll*m*m%mod)if(n&1)b=1ll*b*m%mod;
... | #include <bits/stdc++.h>
using namespace std;
vector<int> two(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N;
cin >> N;
vector<int> w(N);
in... | 0 | 1,801,386 |
#include <iostream>
using namespace std;
int main() {
long long a, b;
string s;
cin >> a >> s;
b = (s[0]-'0')*100;
if (s.length() > 2)
b += (s[2]-'0')*10;
if (s.length() > 3)
b += (s[3]-'0');
cout << a * b / 100 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m, k;
bool a = false;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
int sum = 0;
for(int j = 1; j <= m; j++){
sum = (n - i) * j + (m - j)* i;
if(sum == k)
{
... | 0 | 91,241,744 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define ... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 73,603,556 |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
for(;;){
int n;
cin >> n;
if(!n) return 0;
vector<pair<string,int> > train;
REP(i,n){
stri... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long max_height = 0;
long long sum_height = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
if (A < max_height) {
sum_height += max_height - A;
}
else {
max_height = A;
}
}
co... | 0 | 86,634,512 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll,ll>>
#define vvl vector<vector<ll>>
#include<algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
templa... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll... | 0 | 49,844,606 |
#include "bits/stdc++.h"
#define ll long long
#define PI 3.1415926535897932384626433832795l
#define MAX_NUM 1000000000
#define line printf("-----------------\n");
using namespace std;
int SET(int N, int pos) { return N = N | (1 << pos); }
int RESET(int N, int pos) { return N = N & ~(1 << pos); }
bool CHECK(int N, int p... | #include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL<<60;
void Floyd_Warshall(int n, vector<vector<long long>> &dist){
for (int k = 0; k < n; k++){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (dist[i][k] == INF || dist[k][j] == INF... | 0 | 29,693,833 |
#include<iostream>
using namespace std;
int min(int a,int b){
return (a>=b) ? b : a ;
}
int main() {
int a,b,c,d ;
cin >> a >> b >> c >> d ;
cout << min(a,b)+min(c,d) << endl ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
const int MOD = 1000000007;
long long int n, k, a[5000];
int main(){
cin >> n >> k;
rep(i, n){
cin >> a[i];
}
long long int sum = 0;
rep(i, n){
long long int fw = 0, bw = 0;
... | 0 | 49,716,775 |
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int N, M, a, b;
cin >> N >> M;
set<int> p, q;
while (cin >> a >> b) if (a == 1) p.insert(b); else if (b == N) q.insert(a);
cout << (any_of(begin(p), end(p), [&](int x) { return q.count(x); })
? "POSSIBLE" ... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll s;
s = 0;
for(ll i=0;i<M;++i){
ll a;
cin >> a;
s += a;
}
if(N < s){
cout << -1 << endl;
}... | 0 | 97,719,542 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 1000000000
#define PB ... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 200005;
const int INF = 0x3f3f3f3f;
char s[MAXN];
int dp[1 << 26];
void load() {
scanf("%s", s);
}
int solve() {
memset(dp, INF, sizeof dp);
dp[0] = 0;
int pref = 0;
for (int i = 0; s[i]; i++) {
pref ^= 1 << s[i] - 'a... | 0 | 26,858,475 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#include<numeric>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
vector<string> vec;
vec.push_back(a);
vec.push_back(b);
sort(vec.begin(),vec.end());
for(int i = 0; i < stoi(vec[1]); i++){
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main(){
int n, m;
cin >> n >> m;
vector<long long> x(n), y(m);
for(int i = 0; i < n; i++){
cin >> x[i];
}
for(int i = 0; i < m; i++){
cin >> ... | 0 | 56,868,374 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = (a);i <= (b);i++)
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const... | #include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
using p=pair<int,int>;
int main(){
int n,m;
cin>>n>>m;
int a,b;
vector<vector<int>> to(n, vector<int>());
rep(i,m){
cin>>a>>b;
a--;b--;
... | 0 | 79,668,799 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int Y;
cin >> N >> Y;
Y /= 1000;
bool ok = true;
if (N * 10 < Y || N > Y) {
cout << "-1 -1 -1" << endl;
}
else {
for (int i = N; i >= 0; i--) {
int memo;
for (int j = (N - i); j >= 0; j--) {
memo = 10 * i + 5 *... | #include<iostream>
#include<string>
using namespace std;
int main(){
int t = 0;
int h = 0;
int n;
string str1, str2;
cin >>n;
for(int i = 0; i<n; i++){
cin >>str1 >>str2;
if(str1 == str2){
t += 1;
h += 1;
}else if(str1 > str2){
t += 3... | 0 | 8,607,160 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define bug(x) cerr<<#x<<" "<<x<<endl;
#define T int time; scanf("%d", &time); while(time--)
vector<ll>ar;
bool check(ll i,ll n){
if(abs(i-n)<=1)return true;
for(ll ii=n-1; ii>i; i... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n, a, l = -1, r = -1, rev[100010];
long long mod = 1000000007;
long long frac[100010];
long long pow(long long a, long long x){
if(x == 0){
return 1;
}else if(x == 1){
return a % mod;
}
a %= mod;
long long... | 0 | 74,061,395 |
#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (; ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 18,032,401 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout<<#x<<" = "<<(x)<<" (L"<<LINE<<")"<<endl;
#define vdeb(x) {cout<<#x<<" = { "; rep(i, x.size()) cout<<x[i]<<' '; cout... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main(int argc, char const *argv[])
{
ll n,k;
cin>>k>>n;
ll a1,a2;
cin>>a1;
ll ... | 0 | 39,928,594 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
while(n--){
string mcxi1, mcxi2;
cin >> mcxi1 >> mcxi2;
int dec1 = 0, dec2 = 0;
int mlp = 1;
for(int i = 0; i < mcxi1.size(); i++){
if('0' <= mcxi1[i] && mcxi1[i] <= '9') mlp = (mcxi1[i] - '0');
else {
swi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
map<int,int> m;
for(int i=0;i<n;i++)
{
int a;cin>>a;
m[a-1]++;
m[a]++;
m[a+1]++;
}
int ans=0;
for(auto mm:m... | 0 | 34,715,169 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
string s;
cin>>s;
int c... | #include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
int main(){
ll s,tmp;
ll x1,x2,y1,y2,x3,y3;
scanf("%lld",&s);
tmp=(ll)ceil(sqrt(s));
if(tmp*tmp==s){
printf("0 0 %lld 0 0 %lld\n",tmp,tmp);
return 0;
}
x2=tmp;... | 0 | 647,972 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<long long> test(N);
bool zero=false;
for(int i=0;i<N;i++){
cin>>test.at(i);
if(test.at(i)==0){
zero=true;
}
}
if(zero){
cout<<0<<endl;
}else{
long long sum=1;
bool dekakunai=true;
for(int i=0;i<N;i++)... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
string s;
getline(cin,s);
... | 0 | 60,148,454 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << "Draw" << endl;
exit(0);
}else if(b == 1){
cout << "Bob" << endl;
exit(0);
}else if(a == 1){
cout << "Alice" << endl;
exit(0);
}
... | 0 | 83,987,907 |
#include<bits/stdc++.h>
using namespace std;
int cnt[1000];
int main()
{
int n,i,j,k,a;
cin >> n;
int amax = 0;
for(i=0;i<n;i++)
{
cin >> a;
cnt[a]++;
amax = max(amax,a);
}
int mid ;
if(amax%2==0)
{
mid=amax/2;
if(cnt[mid]!=1)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int H; cin >> H;
int A[300];
rep(i, H){
cin >> A[i+1];
}
for (int i = 1; i <= H; i++){
cout << "node " << i << ": key = " << A[i] << ", ";
if(i/2 > ... | 0 | 79,541,266 |
#include<bits/stdc++.h>
using namespace std;
int64_t fib(int n){
int64_t a=0,b=1;
for(int i=0;i<n;i++){
a=(a+b)%1000000007;
b=(a-b+1000000007)%1000000007;
}
return a;
}
int main(){
int64_t n,m,ans=1;
cin >> n >> m;
vector<int>br(m);
for(int i=0;i<m;i++)
cin >> br.at(i);
int x=0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 27,123,529 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
const ll mod = 1e9+7;
const ld error = 2e-6;
const ld PI = acosl(-1);
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define eq(x, y) (fabs((x)-(y))<error)
... | #include <iostream>
#include <iomanip>
#include <cmath>
struct point {
double x, y;
};
point point1 = {0.0f, 0.0f}, point2 = {100.0f, 0.0f};
const long double pi = 3.141592653589793f;
void KochCurve(int depth, point point1, point point2) {
if (depth==0) return;
point A, B, C, dif;
dif.x = point2.x - poi... | 0 | 61,606,046 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
#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 rep2(i, s, n) for (int i = (s); i <= (int)(n); ... | 0 | 50,926,719 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
map<int, int> mp;
int x;
for(int i = 0; i < 3; i++) {
cin >> x;
mp[x]++;
}
cout << mp.size();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <u... | 0 | 63,208,546 |
#include<iostream>
using namespace std;
int main()
{
int n,k;
int suu[100000 + 100] = { 0 };
int a;
int i;
int mx;
cin >> n >> k;
while (n != 0 && k != 0)
{
for (i = 1; i <= n; i++)
{
cin >> a;
suu[i] = a + suu[i - 1];
}
for (i = k; i <= n; i++)
{
if (mx < suu[i] - suu[i - k])
{
mx = s... | #include<bits/stdc++.h>
using namespace std;
#define N 2000000
#define INFTY (1<<30)
int H, Heap[N+1];
void maxHeapify(int i){
int largest, tmp;
int l = 2 * i;
int r = 2 * i + 1;
if(l <= H && Heap[l] > Heap[i]){
largest = l;
}
else{
largest = i;
}
if(r <= H && Heap[r] > Heap[largest]){
large... | 0 | 12,471,938 |
#include <bits/stdc++.h>
int main() {
std::string str;
int temp;
for(;;) {
std::cin >> str;
if( str == "0" ) {
break;
}
temp = 0;
for(int i = 0; i < str.size(); ++i) {
temp += str[i] - '0';
}
std::cout << temp << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 60,996,087 |
#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 A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int min_a = INT_MAX;
int min_b = INT_MAX;
rep(i, A) {
cin >> a[i];
min_a = min(min_a, a[i]);
}
rep... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | 0 | 97,352,748 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
struct edge... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db long double
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define mi map<int,int>
#define ml map<ll,ll>
#define mii map<pii,int>
#define fi first
#define se second
#define ... | 0 | 55,181,322 |
#include<bits/stdc++.h>
using namespace std;
const int N=100000+5;
int a[N];
bool cmp(int x,int y){
return x>y;
}
int main()
{
int t;
int s[N][3];
int b[N];
memset(b,0,sizeof(b));
scanf("%d",&t);
for(int i=0;i<t;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<t;i++){
s[i][0]=a[i]+1;
s[i][1]=a[i]-1;
s[i][2]=a[... | #include <cstdio>
#include <ctype.h>
using namespace std;
int main(){
char str[1200];
gets(str);
int i = 0;
while(str[i] != '\0'){
char uc, lc;
uc = toupper(str[i]);
lc = tolower(str[i]);
if(lc == str[i]) printf("%c", uc);
else printf("%c", lc);
++i;
}... | 0 | 12,592,499 |
#include <iostream>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
int ky[8] = {-1,1,-2,2,-2,2,-1,1};
int kx[8] = {-2,-2,-1,-1,1,1,2,2};
int dy[4] = {-... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl... | 0 | 91,651,527 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll dp [1<<17];
ll binpow(ll a,ll b)
{
a%=mod;
ll res = 1;
while(b>0)
{
if(b&1) res = res * a%mod;
a = a*a%mod;
b>>=1;
}
return res;
}
int main()
{
ll n,k;
cin>>n>>k;
ll an... | #include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
#include <string.h>
#include <complex>
using namespace std;
const long long MOD = 1000000007;
const int ... | 0 | 72,354,302 |
#include <stdio.h>
int main(){
char kata [25];
scanf ("%[^\n]", kata);
for (int i= 0; kata[i]!='\0';i++){
if (kata[i]!=','){
printf ("%c", kata[i]);
}else{
printf (" ");
}
}
puts("");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
int main() {
int n;
cin >> n;
vector<int> w(n);
int sum = 0;
rep(i, 0, n) {
cin >> w[i];
sum += w[i];
}
vector<int> s(n + 1, 0);
rep(i, 0, ... | 0 | 30,268,547 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
map<int, int>mp;
int m = 0;
string ans = "YES";
rep(i, n){
int s;
cin >> s;
if(mp[s] == 0){
mp[s] = 1;
}else{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int INT;
int n,k;
int main()
{
cin>>n>>k;
INT ans=0;
vector<int> h(n);
for (int i=0;i<n;++i){
cin>>h.at(i);
}
if(n<=k){
ans=0;
}
else{
sort(h.begin(),h.end(),greater<int>());
for (int i=0;i<k;i... | 0 | 82,285,807 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string o, s;
cin >> o >> s;
int n=o.size();
int m=s.size();
for(int j=0; j<n-1; j++){
cout << o[j] << s[j];
}
if(n==m){
cout << o[n-1] << s[n-1];
}
else{
cout << o[n-1];
}
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <memory.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<int,int> pii;
typedef pa... | 0 | 57,780,656 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> cnt(n, 1);
rep(i, k) {
int d;
cin >> d;
rep(j, d) {
int a;
cin >> a, --a;
cnt[a] = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=100000000000000000;
int main() {
... | 0 | 1,334,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Long;
typedef vector<int> VI;
typedef vector<VI> VVI;
int main() {
int N;
cin >> N;
int sq = sqrt(2*N);
if (sq * (sq+1) == 2*N) {
cout << "Yes" << endl;
sq++;
VVI V(sq);
cout << V.size() << endl;
int idx = 0;
for (int i = 0; i < sq; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
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 INF=1001001001;
vector<pair<int64_t,int64_t... | 0 | 83,642,938 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 67,931,583 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
int ans = 0;
for(int i=2; i*i<=n; i++){
int ci = 0;
while(n % i == 0){
n /= i;
ci++;
}
if(ci != 0){
int tri = (-1.0 + sqrt(1.0+8.0*(ci+0... | 0 | 98,363,069 |
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char c) { string s = "'"; s += c; return s + "'"; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, type... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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 rep(i, n) for(int i=0;i<n;++i)
... | 0 | 16,733,007 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= b; i--)
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> yakusu;
fo... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
map<string,int> mp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
vector<ll> a(n),sum(n+1,0);
for(int i=0;i<n;i++)cin>>a.at(i);
for(int i=0;i<n;i++)sum.at(i+1)=a.at(i)+sum.at(i);
vector<ll> tmp;
for(int... | 0 | 35,591,609 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int n;
int m;
ll x[100010],y[100010];
vector<ll> h,w;
int main()
{
cin >> n >> m;
for(int i = 0;i < n;i++)
{
cin >> x[i];
}
for(int i = 0;i < m;i++)
{
cin >> y[i];
}
w.push_back(0);
h.pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; ... | 0 | 29,353,194 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
int main(){
int n; sc(n)
vector<int> A(n), dp(n+1,0);
for (int i = 0; i < n; i++) sc(A[i])
int tmp = abs(A[0]) + abs(A[n - 1]), ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bits... | 0 | 10,442,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <tuple>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
#include <li... | 0 | 37,367,485 |
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
string s,out="";cin>>s;
vector<bool> used(26,false);
if(s.size()<26){
out = s;
for(int i=0;i<s.size();++i){
i... | #include <iostream>
#include <vector>
#include <array>
using namespace std;
long minimum_product(const vector<int>& vec, int p, int q, vector<vector<int>>& dp){
if(q-p <= 1){
return 0;
}
if(dp[p][q]){
return dp[p][q];
}
int ret = 2000000000;
for(int i = p+1; i < q; ++i){
... | 0 | 90,555,132 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 100000
typedef long long ll;
typedef pair<int,int> P;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
i... | #include <bits/stdc++.h>
using namespace std;
int N;
int Pk,Qk;
int dfs(vector<int> &A, vector<bool> seen, int depth, int count, vector<vector<int>> &perm){
if(depth == N){
perm.push_back(A);
return count+1;
}
int same = 0;
for(int i = 0; i < N; i++){
if(seen[i]) continue;
A[depth] = i+1;
se... | 0 | 48,847,659 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.