code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 1000000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 1000005;
const ... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 21,064,603 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N,K; cin >> N >> K;
vector<int> A(N, 0);
for(int i = 0; i < N; i++){
cin >> A[i];
}
for(int i = 0; i < K; i++){
vector<int> B(N+1, ... | #include <iostream>
#include <stdio.h>
#include <utility>
#define MAX_N 100
void select_sort(int*,int);
void bubble_sort(int*,int);
int A[MAX_N];
int count = 0;
int n;
int d[MAX_N];
char c[MAX_N];
struct card
{
char c;
int d;
int initial_index;
} card[MAX_N];
struct card_s
{
char c;
int d;
int i... | 0 | 99,199,841 |
#include <iostream>
using namespace std;
int main(){
int x,y,a=0;
cin >> x >> y;
for (int i = 0; i <= x;i++)
if (i * 4 + (x - i) * 2 == y)
a++;
if (a == 0)
cout << "No";
else
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<long long> par;
UnionFind(int n){
par.assign(n,-1);
}
void unite(long long x, long long y){
x=root(x);y=root(y);
if(x==y) return;
if(par[x]>par[y]){
swap(x,y);
}
par[x]+=par[y];
par[y]=x;
}
long long roo... | 0 | 17,046,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5;
vector< pair<ll,ll> > adj[N];
ll vis[N],dist[N],n,m;
void dfs(ll u,ll d)
{
if(vis[u]==1)
{
if(dist[u]!=d)
{
cout<<"No";
exit(0);
}
return;
}
vis[u]=1;
dist[u]=d;
f... | #include<bits/stdc++.h>
#include<climits>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define pqmaxi priority_queue<int>
#define pqmini ... | 0 | 19,798,687 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int b[100000];
int main() {
int N, H;
cin >> N >> H;
int max_a = 0;
for (int i=0; i<N; i++) {
int a;
cin >> a >> b[i];
max_a = max(max_a, a);
}
sort(b, b+N, greater<int>());
int max_b = b[0];
int ans = 0;
for (int i=0; i<N; i++) {
if (... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
... | 0 | 71,944,433 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
in... | 0 | 81,730,601 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int a[100010];
int main() {
int n;
cin >> n;
rep(i,n) cin >> a[i];
sort(a,a+n);
int ans = 1;
ll ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
int wari(int a,int b) {
if(a%b==0)
return a/b;
else
return a/b+1;
}
int keta(int... | 0 | 14,176,916 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main () {
ll X,Y;
cin >> X >> Y;
ll ans = 0;
ll tmp =... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main(){
int n, m;
cin >> n >> m;
long long x[n], y[m];
for(int i = 0; i < n; i++) cin >> x[i];
for(int i = 0; i < m; i++) cin >> y[i];
long long sum1 = 0, sum2 = 0;
for(int k = 1; k <= n; k++){
sum1 += (k -... | 0 | 71,008,386 |
#include <atcoder/dsu>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
atcoder::dsu t(n);
while (q--) {
int op, u, v;
cin >> op >> u >> v;
if (op == 0) {
t.merge(u, v);
} else {
cout << (int)t.same(u, v) << "\n";... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll f(ll A) {
A++;
ll res = 0;
for (ll i = 0; i < 41; i++) {
ll loop_cnt = 1LL << (i + 1);
ll one... | 0 | 54,903,031 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,k;
cin>>a>>b>>c>>k;
int cnt=0;
while(b<=a){
b*=2;
cnt++;
}
while(c<=b){... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, m, p;
string s;
scanf("%d", &n);
scanf("%d", &m);
int prob[n] = {};
bool bprob[n] = {};
for (int i = 0; i < m; i++)
{
cin >> p;
cin >> s;
if (!bprob[p - 1])
{
if (s == "WA")
... | 0 | 93,634,984 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i-... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
int mina = INT_MAX, minb = INT_MAX;
for (auto &p : a) {
cin >> p;
mina = ... | 0 | 86,550,666 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
int a,b;
char op[2];
scanf("%d %s %d", &a, op, &b);
if(op[0] == '+') printf("%d", a + b);
else printf("%d", a - b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define MAX 100010
struct Node{
int parent, left, right;
};
Node T[MAX];
int Depth[MAX];
void rec(int u, int p){
Depth[u] = p;
if(T[u].right != NIL) rec(T[u].right, p);
if(T[u].left != NIL) rec(T[u].left, p + 1);
}
void print(int u){
print... | 0 | 84,757,956 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | #include <iostream>
using namespace std;
int main(){
int n,d,x;
int a;
int ans=0;
cin>>n>>d>>x;
for(int i=0;i<n;i++){
cin>>a;
int j=0;
int y=1;
while(y<=d){
j++;
y=j*a+1;
}
ans+=j;
}
cout<<ans+x<<'\n';
return 0;
} | 0 | 88,764,072 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
#define LENGTH 100
int cnt=0;
void dfs(int sum, int s, int n, int i){
if(sum==s && n==0){
cnt++;
}
if(n<=0 || sum>s || i>9){
return;
}
dfs(sum+i, s, n-1, i+1);
dfs(sum, s, n, i+1);
}
int main(){
int n;... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T... | 0 | 78,150,938 |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> par,rank;
UnionFind(int n){
par.resize(n);
rank.resize(n);
for(int i=0; i<n; i++){
par[i]=i;
rank[i]=0;
}
}
void unite(int x,int y)
{
x = root(x);y = root(y);
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstdio>
#define F(i,n) for(int i=0;i<(int)(n);i++)
#define INF 100000000
#define ll long long
using namespace std;
typedef pair<int, int> P;
int main() {
ll n, m, d,p[10],q,ans;
while (1) {
ans =... | 0 | 45,728,923 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> v(n);
for (size_t i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (size_t i = 1; i < n; i++) {
ans = (double)(ans + v[i])/2;
}
... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | 0 | 37,675,174 |
#include <iostream>
int main(void) {
int a;
int count[100] = {};
int max = 0;
while(std::cin >> a) {
count[a - 1]++;
}
for (int i = 0; i < 100; i++) {
if (count[i] > max) {
max = count[i];
}
}
for (int i = 0; i < 100; i++) {
if (count[i] == ma... | #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i = 0; i <n;i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define MP make_pair
#define SZ(v) ((int)((v).size()))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int OO = (int)1e6;
const int N = (int)1e7;
void init(){
ios_base... | 0 | 53,343,048 |
#include<iostream>
#include<algorithm>
#include <array>
int main(void){
int a, b, c,count=0;
std::cin >> a >> b >> c;
for (a; a <= b; a++){
if (c%a == 0){
count++;
}
}
std::cout << count << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | 0 | 8,146,749 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i,j,buf;
int k=2000000;
int n;
vector<int> A,B,C;
cin >> n;
for(i=0;i<n;i++){
cin >> buf;
A.push_back(buf);
}
for(i=0;i<k;i++){C.push_back(0);}
for(i=0;i<n;i++){
C[A[i]]++;
}
for(i=1;i<k;i++){C[i]+=C[i-1];}... | #include<iostream>
using namespace std;
int f(int x){
return x*x;
}
int main(){
int d;
int area=0;
while(cin >> d){
int w = 600/d;
for(int i=0;i<w;i++){
area += d*f(i*d);
}
cout << area << endl;
area = 0;
}
} | 0 | 5,888,644 |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%2!=0)
{
int k=n/2;
cout<<k<<endl;
}
else
{
int k=n/2;
cout<<k-1<<endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 7,574,409 |
#include <bits/stdc++.h>
#include<limits.h>
#include<stdio.h>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define fi first
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define get(vv, times) for(int ii = 0; ii < times; ++ii) {int jj; cin >> jj; (vv).pb(jj);}
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for(int ii = jj; ii <... | 0 | 3,250,915 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll n;
cin >> n;
ll ans = 10000000000000;
for(ll i=1; i*i<=n; i++){
if(n%i != 0) continue;
ll j = n/i;
ans = min(ans, i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
A.at(i)--;
}
int now = 0;
for(int i = 0; i < N; i++) {
now = A.at(now);
if(now == 1) {
... | 0 | 20,611,345 |
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x%y==0 ? -1: x);
} | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> rnum(n+1);
for(int i = 0; i < n; i++){
cin >> rnum[i] >> rnum[i+1];
}
vector<vector<int>> memo(n, vector<int>(n, INF));
for(int i = 0; i < n; i++) memo[i][i... | 0 | 63,326,829 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 84,041,184 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b) swap(a,b);
if(b < c) swap(b,c);
int ab = b-a;
int bc = b-c;
if((ab + bc)%2 == 0){
cout << (ab+bc)/2 << endl;
}else{
cout << (ab+bc+3)/2 << endl;
}
} | #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++)
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
rep(i,N) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return p... | 0 | 66,572,669 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll m[101][101];
vector<ll> p;
int main() {
int n;
cin >> n;
ll a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (i == 0)
p.push_back(a);
p.push_back(b);
}
for (int i = 0; i ... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main(){
long max;
char str[10];
int i, j, k;
int num, nnum;
long setdata[2][5001], tmp;
int focus;
while(cin>>num){
if(num==0) break;
for(i=0; i<num; i++){
cin>>str;
setdata[0][i]=(long)atol(str);
}
max=100001*(-1... | 0 | 66,901,049 |
#include<iostream>
#include<vector>
#include<utility>
using namespace std;
using ll = long long;
vector<pair<ll,ll> > primeFactorize(ll x) {
vector<pair<ll,ll> > res;
for (ll i=2;i*i<=x;i++) {
ll ex=0;
while (x%i == 0) {
ex++;
x/=i;
}
if (ex>0) res.push_back({i, ex});
}
if (x>1) res.... | #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>
#pragma GCC... | 0 | 10,765,313 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,y,z,i;
cin>>n;
x=n*800;
y=n/15;
z=y*200;
i=x-z;
cout<<i<<endl;
return 0;
} | #include <bits/stdc++.h>
#define forn(i, n) for (llong i = 0ll; i < (llong) n; ++i)
#define fornn(i, l, r) for (llong i = (llong) l; i < (llong) r; ++i)
#define size(x) ((int) (x.size()))
using namespace std;
typedef long long llong;
const llong inf = (llong) 1e+9 + 7ll;
const llong linf = (llong) 1e+18 + 7ll;
const lo... | 0 | 96,758,026 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
long long gcd(long long m,long long n){
if(n==0){
return m;
}
return gcd(n,m%n);
}
long long lcm(long lo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int cnt[100010];
int main(){
int n,m;
cin>>n>>m;
rep(i,m){
int a,b;
cin>>a>>b;
cnt[a]++... | 0 | 62,888,203 |
#include<iostream>
using namespace std;
static const int MAX = 100000;
struct Node{
int parent, left, right;
};
Node node[MAX];
int getDepth(int i){
int j = i;
int d = 0;
while(node[j].parent!=-1){
j = node[j].parent;
d++;
}
return d;
}
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 | 3,058,571 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const ll INF = 1LL<<60;
const int ny[4] = {-1,1,0,0}, nx[4] = {0,0,-1,1};
int sy,sx,gy,gx;
int main(){
string ... | #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;
#pragma GCC optimize("unroll-loops,no-stack-protector")
using ll = long long;
using ld = long double;
using pii = pair<ll,ll>;
typedef tree<int, null_type, less<int>, rb... | 0 | 64,809,404 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int a,b,c,d;
int wa[2];
for (int i = 0; i < 2; i++) {
cin >> a >> b >> c >> d;
wa[i] = a + b + c + d;
}
if (wa[0] > wa[1]) {
cout << wa[0] << endl;
} else {
cout << wa[1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <regex>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ba back
#define ppb pop_back
#define debug(x) cout<<"debug--->>"<<" "<<x<<endl
#define eb emplace_back
#define eps 1e-6
# define M_PI 3.14159265358979323846
#define vll vector... | 0 | 89,545,998 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
ll n, y, x_s, y_s, z_s;
cin >> n >> y;
x_s = y / 10000;
rep(x_s, n + 1) ... | #include <cstdio>
int main(void)
{
int N, A, B, C, X;
int Y[100], k = 0, i;
while(1){
scanf("%d %d %d %d %d", &N ,&A, &B, &C, &X);
if(N == 0 && A == 0 && B == 0 && C == 0 && X == 0)
break;
for(i = 0; i < N; i++)
scanf("%d", Y + i);
k = 0;
for(i... | 0 | 52,514,096 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
string inp, s;
while(getline(cin, inp)) {
s += inp;
}
const int N = 26;
for (int i = 0; i < N; ++i) {
char alp = (char)('a' + i), ALP = (char)('A' + i);
cout << alp << " : " << count(s.begin(), s.end(), alp) + count(s.begin(), s.end(), ALP) << end... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll=long long;
const int MOD=998244353;
int main(){
int h,n;
cin>>h>>n;
vector<int> a(n),b(n),dp(h+1e5,1e9);
rep(i,n) cin>>a[i]>>b[i];
dp[0]=0;
rep(i,h+1){
rep(j,n){
if(i+a[j]>=h){
... | 0 | 29,650,140 |
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include<stdio.h>
int main(){
int n, a, b, ii, temp=0;
long long int sum=0;
scanf("%d %d %d", &n, &a, &b);
for (int i=1 ; i<=n ; i++){
ii=i;
temp=0;
while(ii>0){
temp+=ii%10;
ii/=10;
}
if(temp>=a && temp<=b){
sum+=i;
}
... | 0 | 56,796,124 |
#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,C,K;
cin >> N >> C >> K;
vector<int> T(N);
rep(i,N) cin >> T[i];
sort(T.begin(),T.end());
int ans=0;
for(int i=0; i<N;) {
ans++;
int start = i;
while(i < N && T[i] -... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 0 | 49,956,596 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
int gcd(int a,int b){
if(a%b==0){
return b;
}
else{
return gcd(b,a%b);
}
}
int main(){
string s,t;
cin>>s;
for(int i=0;i<s.size();i++){
if(i%2==0){
t+=s[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long unsigned int ull;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::syn... | 0 | 22,770,397 |
#include <iostream>
#include <algorithm>
#define MAXN 100000
typedef long long ll;
using namespace std;
ll A[MAXN];
bool comlarge ( const ll x, const ll y ) { return x > y; }
ll find ( int N )
{
ll f,s,cnt,i;
cnt = 0;
f = A[0];
for ( i = 0; i < N; ++i ) {
if ( f == A[i] ) {
++cnt;
if ( cnt >= 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
const ll MOD=1000000007;
int main(){
int N;
ll Z,W;
cin >> N >> Z >> W;
vector<ll> a(N);
rep (i,N){
cin >> a[i];
}
int ans;
... | 0 | 57,375,496 |
#include<stdio.h>
int main(){
int a;
while(1){
scanf("%d",&a);
if(a==0)return 0;
long long int n[10000];
for(int i=0;i<a;i++)scanf("%lld",n+i);
long long int dp[10000];
dp[0]=n[0];
long long int max=dp[0];
for(int i=1;i<a;i++){
if(dp[i-1]>0)dp[i]=dp[i-1]+n[i];
else dp[i]=n[i];
if(max<dp[i])ma... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int X,Y,Z,K;cin>>X... | 0 | 35,890,965 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (int)(b); i--)
#define all(x) (x).begin(), (x).end()
using i32 = int32_t;
using i64 = int64_t;
using f32 = float;
using f64 = double;
using P = pair<int, int>;
template ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n; cin >> n;
vector<int> a(n+1), b(n);
rep(i,n+1) cin >> a[i]; rep(i,n) cin >> b[i];
ll ans = 0;
for(int i = n-1; i >= 0; i--) {
if(b[i]... | 0 | 49,772,769 |
#include<iostream>
using namespace std;
struct Card {
char mark;
int value;
};
void bubbleSort (struct Card C[], int n) {
int i, j;
Card v;
for (i = 0; i < n; i++) {
for (j = n - 1; j >= i + 1; j--) {
if (C[j].value < C[j - 1].value) {
v = C[j];
C[... | #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 vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<doub... | 0 | 16,495,365 |
#include <bits/stdc++.h>
#define FOR(i, n) for(ll i = 0; i < n; i++)
#define FORR(i, n) for(ll i = n; i >= 0; i--)
#define FORS(i, m, n) for(int i = m;i < n;i++)
#define ALL(v) accumulate(v.begin(),v.end(),0)
#define SORT(v) sort(v.begin(),v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#define IN... | #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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 10,288,177 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
cin >> s;
ll ans = 0 , ans2=0;
for(int i=0; i<s.size(); i++)
{
if (i%2==0)
{
... | 0 | 25,722,357 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
... | 0 | 46,394,653 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;... | 0 | 40,218,673 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double a, b, c;
cin >> a >> b >> c;
c *= M_PI / 180.0;
double sinC = sin(c);
double cosC = cos(c);
double S = 0.5 * a * b * sinC;
double L = a + b + sqrt(a * a + b * b - 2 * a * b * cosC);
double h = b * sinC;
co... | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li h, w, d;
cin >> h >> w >> d;
if (d % 2 == 1) {
for (int r = 0; r < h; ++r) {
for (int c = 0; c < w; ++c) {
if ((r + c) % 2 == 1) {
... | 0 | 22,378,145 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < k; ++i) {
vector<int> b(n +... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
long long modpow(long long x, long long y, long long p=1) {
long l... | 0 | 18,150,346 |
#include<iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a >= b && a >= c)
cout << b + c;
if(b > a && b >= c)
cout << a + c;
if(c > a && c > b)
cout << a + b;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include"bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n) for(ll i=1,i##_l... | 0 | 85,519,627 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
int main(){
ll Q;
cin >> Q;
rep(i,Q){
ll a,b,t;
cin >> a >> b;
if(a>b)swap(a,b);
t=(ll)sqrt(a*b-1);
while((t+1)*(t+1)<a*b) ... | #include<bits/stdc++.h>
using namespace std;
#define INF (1<<20)
typedef pair<int,int> P;
vector<P> edge[10];
int dijkstre(int pos){
int min_cost[10];
fill_n(min_cost,10,INF);
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0,pos));
while(!que.empty()){
P p = que.top(); que.pop();
int cost = p... | 0 | 54,403,966 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
int h, w;
cin >> h >> w;
string s;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
cin >> s;
if(s == "snuke") {
cout << char(j + 'A') << i + 1 << endl;
}
}
}
} | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, a[60], k, ans;
vector<int> v[60][60];
int main()
{
IO
cin>>n>>k;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=0; i... | 0 | 70,266,697 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n;
int a[100007],par[100007],cur[100007],cnt[100007];
int u,v;
vector <int> edge[100007];
void dfs(int u){
int sum=0,ct=0,mx=0;
for(int i=0;i<(int)edge[u].size();i++){
int v=edge[u][i];
if(v==par[u]) continue;
par[v]=u;... | #include <stdio.h>
int main(){
int height[10], rank[3] = {0};
int i;
for(i = 0; i < 10; i++){
scanf("%d\n", &height[i]);
if (rank[0] < height[i]){
rank[2] = rank[1];
rank[1] = rank[0];
rank[0] = height[i];
}else if (rank[1] < height[i]){
rank[2] = rank[1];
... | 0 | 25,343,092 |
#include<iostream>
using namespace std;
int main()
{
int n,money=100000;
cin>>n;
for(int i=1;i<=n;i++){
money*=1.05;
if(money%1000>0){
money+=1000;
money-=money%1000;
}
}
cout<<money<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
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=... | 0 | 50,741,970 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if (a ... | 0 | 11,099,200 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
template <typename T>
ostream& operator<<(ostream& out, vector<T> const& base) {
for (T const& i : base) {
out << i << ' ';
}
return out;
}
int main() {
int H, W;
cin >> H >> W;
string grid[H];
for(int i = 0; i < H; ++i)... | 0 | 53,158,710 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | 0 | 98,579,666 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long s, x, y;
cin>>s;
x=sqrt(s);
if(x*x==s) y=x;
else if(x*(x+1)>=s) y=x+1;
else y=++x;
printf("0 0 %lld 1 %lld %lld", x, (x*y)-s, y);
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 0 | 1,746,801 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >> n; ... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string S;
ci... | 0 | 66,172,008 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
double a;
int b;
cin >> a >> b;
int x, y;
int ans;
int p = ... | 0 | 98,625,297 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const ll MNA = -1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
#endif
ll n, k;
cin >> n >> k;
ll p[n+1], c[n+1];
for (int i=1; i<=n; i++) cin >> p[i];
for (int i=1; i<=n; i++)... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = ve... | 0 | 89,233,880 |
#include<iostream>
#include<string>
using namespace std;
int Judge(string WordT, string WordH){
int c;
if(WordT.size() < WordH.size()){
c = WordT.size();
}else{
c = WordH.size();
}
for(int i = 0; i < c; i++){
if(WordT[i] != WordH[i]){
if(WordT[i] > WordH[i]) return 1;
if(WordT[i] < WordH[i]) return 2;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
a.at(i) -= i+1;
}
sort(a.begin(), a.end());
ll ans=pow(10,18);
int s;
s=a.at(n/2);
ll cnt=0;
for(int i=0; ... | 0 | 30,660,334 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
const int mod = 998244353;
void Main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
v.push_back({a, b});
}
vector<vector<ll>> dp(n, vector<ll>(n, -1));
function<ll(int, int... | 0 | 51,001,095 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T>... | #include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
vector<int> m[100005];
int n,u,v;
int dfs(int pos,int pre){
int len=m[pos].size(),ans=0;
for(int i=0;i<len;i++)
if(m[pos][i]!=pre) ans+=dfs(m[pos][i],pos);
if(ans>=2){
printf("First\n");
exit(0);
}
else if... | 0 | 89,110,555 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
if (buf.find("replace ") != string::npos)
{
char cmd[10] = {0};
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstring>
#include <tuple>
#include <utility>
#include <list... | 0 | 24,444,244 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
long k;
cin >> s >> k;
int n = s.size();
for (int i=0; i<n; i++) {
if (i+1 == k) {
cout << s[i] << endl;
return 0;
}
if (s[i] != '1') {
cout << s[i] << endl;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
using namespace std;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define reppe(i,a,b) for(int i = (int)(a) ; i <= (int)(b) ; ++i)
#define repm(i,a,b) for(int i... | 0 | 39,150,259 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (i... | #include <bits/stdc++.h>
using namespace std;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
f... | 0 | 12,062,061 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
ll n,d,x;
cin>>n>>d>>x;
ll ans=x;
rep(0,i,n){
ll a;
cin>>a;
ans+=(d+a-1)/a;
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
int main()
{
int n, k; cin>>n>>k;
vector<ll> a(n, 0);
rep(i, n) cin>>a[i];
ll nin = 1LL<<60;
rep(bits, 1<<(n-1)) {
ll bef = a[0];
ll cost = 0;
int nk = 1;
for (int i=1; i<n; i++) {
... | 0 | 100,475,721 |
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
#define rep(i, j) for(int i = 0; i < j; i++)
#define f(i, k, j) for(int i = k; i... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long int lli;
const long long int MaxN=200005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.14159265358979323... | 0 | 1,555,326 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(-1)
#define eps (1e-8)... | 0 | 100,759,249 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
int __cd(int a,int b, int k) {
int maxd = min(a,b);
int cnt = 0;
for(int i=maxd;i>0;i--) {
if(a%i==0 && b%i==0) {
cnt++;
if(cnt == k){
return i;
}
}
}
return 1;
}
int main(void) {
in... | 0 | 44,671,549 |
#include<bits/stdc++.h>
using namespace std;
typedef long long lol;
lol gcd(lol a,lol b);
lol lcm(lol a,lol b);
int main(){
lol n;
cin>>n;
vector<lol> t(n+10,1);
for(lol i=0;i<n;i++){
cin>>t[i];
}
lol ans=lcm(t[0],t[1]);
for(lol i=2;i<n;i++){
ans=lcm(ans,t[i]);
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,K;
cin >> N >> K;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll ans... | 0 | 22,655,555 |
#include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | 0 | 29,937,451 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | #include <stdio.h>
int right_side_table[ 6 ][ 6 ] =
{
{ -1 , 3 , 5 , 2 , 4 , -1 },
{ 4 , -1 , 1 , 6 , -1 , 3 },
{ 2 , 6 , -1 , -1 , 1 , 5 },
{ 5 , 1 , -1 , -1 , 6 , 2 },
{ 3 , -1 , 6 , 1 , -1 , 4 },
{ -1 , 4 , 2 , 5 , 3 , -1 },
};
int search_index( const int* number_table , int numbe... | 0 | 75,899,209 |
#include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define in_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 0 | 28,543,609 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 98,017,077 |
#include <bits/stdc++.h>
using namespace std;
long long min_ans(const vector<long long>&a) {
long long res = 2;
for (auto& e : a) if (res%e != 0) res = res - (res%e) + e;
return res;
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (auto& e : a) cin >> e;
reverse(a.begin(), a.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ret, lap = 0; scanf("%d", &n);
char s[n], t[n]; scanf("%s%s", s, t);
for (int i = 0; i <= n; i++) {
bool tf = true;
int k = 0;
for (int j = i; j < n; j++) {
tf = (s[j] == t[k++]);
if (!tf) brea... | 0 | 26,977,339 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 15,667,912 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b,x;
cin>>a>>b>>x;
for(int i=0;i<b;i++)
{
if(a==x)
{
cout<<"YES"<<endl;
break;
}
else if(a<x)
{
a++;
}
else if(a>x)
{
cout<<"NO"<<endl;
break;
}
}
if(a<x)
{
cou... | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
for(int i = n; i <= 1111; i++){
int first = i / 100;
int second = i % 100 / 10;
... | 0 | 1,410,445 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll A;
double B;
cin >> A >> B;
ll ib = B * 100 + 0.5;
A *= ib;
A /= 100;
cout << A << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int INF = 1e8;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> a(n,vector<int>(m));
vector<int> c(n);
for(int i=0; i<n; i++){
cin >> c[i];
for(int j=0; j<m; j++)... | 0 | 72,212,487 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define puts(i) cout<<i<<endl
#define pi 3.14159265358979323846264338
#define pb push_back
#define mp make_pair
#define inf 10000
using ll = long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
ll divisor=1000000007;
int main(){... | #include<bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const ll INF=1e18;
int main (){
int n;
cin >> n;
ar<ll,3> a={0,0,0};
ar<ll,3> buffer;
ar<ll,3> buffer1;
for(int i=0; i<n; ++i){
cin >> buffer[0] >> buffer[1] >> buffer[2];
buffer1=a;
a[0]=max(buffer1[1]+buffer[0], buffer1[2]+... | 0 | 93,013,113 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a,b,c,h,i,j,k,l,m,n,x,y;
ll ans = 0;
string s;
cin >> a >> b >> c;
ans = a + b + c - max(a , max(b,c));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | 0 | 56,852,504 |
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std ;
int mod = 1e9 + 7 ;
const int N = 1e5 + 5 ;
int dp[105][N] ;
int n ,x ;
int a[N] ;
signed main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
cin >> n >> x;
for(int i = 0 ; i < n ; ++i)
cin >> a[i] ;
dp[0][0]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long lon... | 0 | 11,251,189 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n;
while(cin >> n, n){
vector<int> dp(n), vec(n);
for(int i=0;i<n;i++)cin >> vec[i];
dp[0]=vec[0];
for(int i=1;i<n;i++)dp[i]=max(dp[i-1]+vec[i],vec[i]);
cout << *max_element(dp.begin(), dp.end()... | #include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
voi... | 0 | 36,558,530 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
string s;
long long ans;
deque<char> dq;
cin >> s;
rep(i, s.size())
{
dq.push_back(s[i]);
}
ans = 0;
while(!(dq.size() <= 1))
{
char f = dq.front();
char b = dq.back();
if (f == b)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 56,712,825 |
#include <stdio.h>
int main(void)
{
int m=0, f=0, r=0;
while(1) {
scanf("%d%d%d",&m,&f,&r);
if ((m==-1)&&(r==-1)&&(f==-1))
return 0;
if((m==-1)||(f==-1))
printf("F\n");
else if(m+f<30)
printf("F\n");
else if(m+f<50) {
if(r>... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 99,861,284 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rrep(i, n... | 0 | 17,782,154 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll x,y;
cin >> x >> y;
ll ans = 0;
if(x > 0 && y > 0){
if(abs(x) <= abs(y)){
ans = y-x;
}else{
ans = x-y+2;
}
}else if(x > 0 && y < 0){
if(abs(x) <= abs(y)... | #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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 68,478,671 |
#include <iostream>
using namespace std;
int main() {
int N;
string s;
cin>>N>>s;
int l= 0;
int r = 0;
for (int i=0; i<N; i++){
if (s[i]=='(') l++;
else l--;
if (l<0){
l=0;
r++;
}
}
while(r--) cout<<'(';
cout << s;
while(l--) cout<<')';
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll a;
cin>>a;
vector<string>vec(a);
string b;
cin>>b;
char c=b.at(b.size()-1);
vec.at(0)=b;
for(ll i=1;i<a;i++){
string d;
cin>>d;
vec.at(i)=d;
if(c!=d.at(0)){
cout<<"No"<<endl;
return 0;
}
... | 0 | 8,637,799 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define ... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, x;
char com[20];
list<int> v;
cin >> n;
... | 0 | 71,165,132 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll n, m, d;
cin >> n >> m >> d;
long double... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned... | 0 | 13,005,235 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> work;
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
pair<int, int> p = make_pair(a,b);
work.push_back(p);
}
sort(work.begin(), work.end()... | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main(){
char str[1001],p[1001];
string command;
int q,i,a,b,j,c,k;
cin >> str;
cin >> q;
for(i=0;i<q;i++){
cin >> command;
if( command != "replace" ) cin >> a >> b;
else{
cin >> a >> b >> p;
}
if( comm... | 0 | 2,350,851 |
#include <bits/stdc++.h>
using namespace std;
int ans = 0;
vector<int> t(1<<26);
vector<bool> v(1<<26);
int main() {
ios_base::sync_with_stdio(0);
string s;
cin>>s;
int q = 0;
int ans = 0;
int n = s.size();
v[0] = 1;
for(int i = 0; i < n; ++i) {
q ^= 1<<(s[i]-'a');
int mi = 1e9;
if(v[q]) {
mi = min(mi,... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | 0 | 94,881,990 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#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 lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 19,464,187 |
#include<bits/stdc++.h>
using namespace std;
string mn="zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz";
int main()
{
string s,t;
cin>>s>>t;
for(int i=s.size()-t.size();i>=0;--i)
{
bool b=1;
for(int j=0;j<t.size();++j)
{
if(s[i+j]=='?')
continue;
else if(s[i+j]!=t[j])
{
b=0;
br... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
const int N = 1e6 + 5;
int ar[N], cnt[N], spf[N];
int n;
void sieve() {
for (int i = 1; i < N; i++) {
spf[i] = i;
}
for (int i = 2; i < N; i += 2) {
spf[i] = 2;
}
for (int i = 3; i * i < N; i++) ... | 0 | 27,646,619 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include <vector>
#include <cstdlib>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false... | 0 | 64,696,899 |
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e+9 + 7;
int solve(vector<int>&a, int n, long long k){
long long res1 = 0;
vector<long long>original(n, 0);
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
if(a[i] > a[j]){
res1 += 1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
vector<vector<int>> g;
int visit_cnt;
vector<int> parent;
void bfs(int s) {
queue<int> que;
set<int> visited;
que.push(s);
visited.insert(s);
visit_cnt = 1;
while (!que.empty()) {
int u = ... | 0 | 63,096,247 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
const ll N = 2... | 0 | 51,488,570 |
#include <iostream>
#include <map>
int main() {
uint32_t N = 0;
std::cin >> N;
std::map<int64_t, uint32_t> dict;
int64_t sum = 0;
dict[0]++;
uint64_t ans = 0;
for (size_t i = 0; i < N; i++) {
int64_t A = 0;
std::cin >> A;
sum += A;
ans += dict[sum];
dict[sum]++;
}
std::cout << ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | 0 | 11,682,434 |
#include <bits/stdc++.h>
using namespace std;
int main(){
#define int long long
int answer = 0;
string S, FS = "";
cin >> S;
for(int i = 0; i < (int) S.size(); i++) {
if(S.at(i) != 'x'){
FS += S.at(i);
}
}
for(int i = 0; i < (int) FS.size(); i++) {
if(FS.at(i) != FS.at((int) FS.size() - ... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i+1; j <= r; j++) {
ans = min(ans, i*j%2019)... | 0 | 8,782,499 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 0xfffffff
using namespace std;
int map[1100][1100];
int main()
{
int n,m,k,i,j,a,b,c,sum1;
while(scanf("%d",&n),n)
{
for(i=0;i<1100;i++)
for(j=0;j<1100;j++)
{
map[i][j]=INF;
map[i][i]=0;
}
int Max=0;
for(i=0;i<n;i++)
{
scanf(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
if(a[n-1] <= 0) {
int ans = a[n-1];
rep(i,n-1) ans -= a[i];
cout << ans << endl;
rep(i,n-1) {
c... | 0 | 35,612,614 |
#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:
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
#include <numeric>
#include <set>
using namespace std;
typedef long long li;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
li n;
cin >> n;
vector<li> xs(n);
li negs = 0;
for (int i ... | 0 | 68,967,453 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.