code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const int MAX = 1e5+1;
int a[MAX];
bool b[MAX];
int search(int i, int sum){
if(b[i] == true) return -1;
if(i == 2) return sum;
b[i] = true;
return search(a[i], sum + 1);
}
void solve(){
int n; cin>>n;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0;i < n;i++){
cin >> a[i];
a[i]--;
}
vector<long long> c(n,0);
for (long long i = 0;i < n;i++){
... | 0 | 89,285,598 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 1000000007
#define inf 100000000000000000
using namespace std;
typedef long long ll;
typ... | 0 | 21,584,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x[1000];
ll y[1000];
ll z[1000];
ll s[8][1000];
int main() {
int N, M;
cin >> N >> M;
for (int i=0; i<N; i++) {
cin >> x[i] >> y[i] >> z[i];
}
for (int i=0; i<N; i++) {
s[0][i] = x[i] + y[i] + z[i];
}
for (int i=0; i<N; i++) {
s[1][i] =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
string L;
ll dpC[100010] = { 0 };
ll dpUC[100010] = { 0 };
int main(){
cin >> L;
int len = L.size();
dpUC[0] = 1;
for(int i = 0; i < len; i++){
if(L[i] == '0'){
dpC[i+1] = (3 * dpC[i]) % MOD;
dpUC[... | 0 | 39,164,248 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int n,k;
string s;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
sort(v.begin(),v.end()... | #include "bits/stdc++.h"
using namespace std;
long long dp[303][303];
int main() {
int N, K;
cin >> N >> K;
int M = N - K;
vector<int>H(N + 1);
for (int i = 0; i < N; ++i) {
cin >> H[i + 1];
}
for (int i = 0; i < N + 1; ++i) {
for (int j = 0; j < M + 1; ++j) {
dp[i][j] = 1e18;
}
}
dp[0][0] = 0;
for (... | 0 | 78,291,517 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int x,a,b,c,n,f,I;
vector<int> y;
int dam;
while(1){
I=0;
f=0;
y.clear();
cin >> n >> a >> b >> c >> x;
if(n==0&&a==0&&b==0&&c==0&&x==0)break;
for(int i=0;i<n;i++){
cin >> dam;
y.push_back(dam);
}
wh... | 0 | 77,002,257 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,j,s,l;
cin>>n;
ll ans = n-1;
for(ll i=1;i<=sqrt(n);i++)
{
if(n%i==0){
j = i;
s = n/j;
ans = min(ans,(j-1)+(s-1));
l = 1;
}
}
if(l==1)
cout<<ans<<endl;
else
cout<<n-1<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 66,179,050 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <map>
using namespace std;
int main(){
int n, a;
cin >> n;
map<int,int>mp;
for(int i=0; i<n; i++){
cin >> a;
mp[a]++;
mp[a+1]++;
mp[a-1]++;
}
int M = 0;
for(auto itr = mp.begin(); itr != mp.end(); ++itr) {
M = max(itr-... | 0 | 34,125,351 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<double> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
double ans = 0;
for(int i = 0; i < N; i++) {
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | 0 | 18,768,584 |
#include <iostream>
#include <string>
int main() {
int a, b;
auto mark = ">";
std::cin >> a >> b;
if (a > b)
{
mark = ">";
}
else if(a < b)
{
mark = "<";
}
else mark = "==";
std::cout << "a" << " " << mark << " " << "b" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
for(int i=0;i<k;i++){
if(i%2 == 0){
if(a%2 != 0) a--;
b += a/2;
a/=2;
}
else{
if(b%2 != 0) b--;
a += b/2;
... | 0 | 17,500,213 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ifstream fin("parimpar2.in");
ofstream fout("parimpar2.out");
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int ans=k;
for(int i=0; i<n-1; ++i)
ans*=k-1;
cout... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 30,325,500 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
int main(){
int N; cin >> N;
string S; cin >> S;
S.erase(unique(ALL(S)),S.end());
cout << S.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
int main() {
string str;
cin >> str;
vector<ll>... | 0 | 11,023,614 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
set<char> s;
for(int i = 0;i < 4;i++){
cin >> c;
s.insert(c);
}
if(s.size() == 2)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<long long> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LLi i = 0; i < (n); i++)
#define FOR(in) for(LLi i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev... | 0 | 16,159,129 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int a,b;
cin>>a>>b;
if(a * b == 15)
{
printf("*");
}
else if(a + b == 15)
{
printf("+");
}
else
{
printf("x");
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
int dp[100001][2];
int solve(int u, bool constr, int pr)
{
if (dp[u][constr] != -1)
ret... | 0 | 34,228,193 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll,ll>
#define fs first
#define sc second
template<class ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | 0 | 85,119,781 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int k,s;
cin >> k >> s;
int ans = 0;
int z = 0;
REP(x,k+1){
REP(y,k+1){
z = s - x - y;
if(x + y + z == s && z >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll x){
if(x == 1) return 1;
return f(x/2)*2+1;
}
int main(){
string s;
cin >> s;
int ans(1000);
for(int i=0;i<s.size()-2;i++){
string t = s.substr(i,3);
int num = atoi(t.c_str());
ans = min(ans,abs(... | 0 | 73,794,473 |
#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
const int MAXN =1e5+10;
const long long mod = 1e14 ;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int ... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define PI acos(-1.0)
typedef long long ll;
const int maxn=1e5+5;
int main()
{
ll k;
scanf("%lld",&k);
int n=50;
cout << n << endl;
ll res=k%50;
ll x=k/50-1;
ll cnt=res;
for(ll i=1;i<=50;i++)
{
if(cnt>0)
... | 0 | 1,741,050 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N, K;
cin >> N >> K;
double p = 0;
for(int i=1; i<=N; i++){
double tmp = 1.0/N;
int now = i;
while(now<K){
now *= 2;
tmp /= 2;
}
p += tmp;
}
printf("%.12lf\n", p);
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | 0 | 17,396,406 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int n;
long long int ans=1;
cin>>n;
rep(i,1,n+1){
ans*=i;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 0 | 21,580,054 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N,M;
cin>>N>>M;
vector<long> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
a[i]%=M;
}
long ans=0;
vector<long> r(N);
r[0]=a[0];
if(r[0]==0) ans++;
for(int i=1;i<N;i++){
r[i]=r[i-1]+a[i];
r[i]%=M;
if(r[i]==0) ans++;
}
map<long,long> modm;
for(int i=0;i<N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
ll x, y;
cin >> x >> y;
ll ans = INF;
if (y >= x) {
ans = min(ans, y - x);
}
if (y >= x * (-1)) {
ans = min(ans, y + x + 1);
}... | 0 | 28,195,032 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
ll n,a[200000],sum,x,ans;
int main(){
cin>>n;
rep(i,n)cin>>a[i];
rep(i,n){
while(x<n&&(sum^a[x])==sum+a[x]){
sum+=a[x];
x++;
}
ans+=x-i;
sum^=a[i]... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 998244353
using namespace std;
typedef long long ll;
ll power(ll n, ll p, ll mod) {
ll ans = 1;
while (p > 0) {
if (p & 1) ans = ans * n % mod;
n = n * n % mod;
p >>= 1... | 0 | 40,907,973 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
string s;
cin >> s;
if(s[2] == s[3] & s[4... | #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 FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define ... | 0 | 2,115,240 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define pf(n) cout << n << endl
#define ps() cout <<" ";
#define sf(n) cin >> n
#define vi vector<int>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | 0 | 60,789,168 |
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int MOD = 1e9+7;
const int N = 5*1e5;
int main(){
AC
int s, w;
cin>>s>>w;
if(w>=s)
cout<<"unsafe"<<endl;
else
cout<<"safe"<<endl;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 0 | 36,615,448 |
#include <iostream>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#define INF long long int(1e18+1)
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long int>... | #include<bits/stdc++.h>
#define endl "\n"
#define ll long long
#define PI acos(-1.0)
#define test cout<<"\n****\n"
#define precise fixed(cout);cout<<setprecision(12)
#define fast ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
int main(){
string str;
cin>>str;
if(st... | 0 | 37,135,503 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#de... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<vector>
#include<ctime>
#define ll long long
#define pr(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define N 2010000
struct node
{
ll to,next;
}e[N*3];
ll size,o,p,vis[N],tag[N],g[N],f,n,m,i,du[N],I,P,Q... | 0 | 33,525,493 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n; cin >> n;
rep(i,25){
rep(y,14){
if(4*i+7*y==n){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "N... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;
int ans = 0;
map<char, bool> flag;
for (int i = 0; i < n; i++) {
if (i >= k && t[i] == t[i - k]) {
t[i] = 'x';
continue;
... | 0 | 86,402,642 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 17,154,134 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s,left,right;
int a, b;
while (cin >> s, s != "-") {
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
left = s.substr(0, b);
right = s.substr(b);
s = right + left;
... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 22,722,462 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#include <string>
const int mxN=2e5;
const int maxN=5e3;
#define ld long double
#define pb push_back
#define mp make_pair
#define ins insert
#define vi vector<int>
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n);
for(int i=0;i<n;i++... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 54,536,964 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep2(i, 1, n + 1) cin >> a[i];
if (n % 2 != 0) {
for (int ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
using ull = unsigned long long;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
static int divisors[1 << 24];
for (int i = 1; i < 1 << 24; ++i) {
for (int j = 1; i*j <=n; ++j) {
... | 0 | 81,249,981 |
#include<bits/stdc++.h>
int a[100035],n,l,t,x,y;
long long cnt;
int main()
{
scanf("%d%d%d",&n,&l,&t);
for (int i=1; i<=n; i++)
{
scanf("%d%d",&x,&y);
if (y==1){
x += t;
cnt += x/l;
x %= l;
}else{
cnt += (x-t)/l;
x = (x-t)%l... | #include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B) { cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | 0 | 83,272,705 |
#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 () {
ios::sync_with_stdio(0);
cin.tie(0);
int S,W;
cin >> S >> W;
if (S <= W) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
retu... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int t[N+1];
int x[N+1];
int y[N+1];
t[0] = x[0] = y[0] = 0;
for(int i = 0; i < N; i++) {
cin >> t[i+1] >> x[i+1] >> y[i+1];
}
bool flag = true;
for(int i = 0; i < N; i++){
i... | 0 | 57,729,395 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define sep cout<<"\n";
#define Yes cout<<"Yes\n";
#define No cout<<"No\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
inline string shift(string s){
int n = s.length();
string r = "";
r+=s[n-1];
for(int i=0;i<n-1;i++)r+=s[i];
return r;
}... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 70,033,955 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[n-1] << " " << sum << endl;
return 0;
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
int main() {
long long int N, A, B, ans;
cin >> N >> A >> B;
if (A > B || (N == 1 && A != B)) {
a... | 0 | 74,376,971 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, x;
cin >> n >> x;
int dd[n];
for (int i = 0; i < n; i++) {
int xx;
cin >> xx;
dd[i] = abs(x - xx);
}
if (n == 1) {
cout << dd[0] << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
ll price[4];
rep(i,4){
cin >> price[i];
}
price[0] *= 4; price[1] *= 2;
ll price_1L(min({price[0],price[1],price[2]}));
ll n; ... | 0 | 65,597,051 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int x;
cin >> x;
for (int i = 0; i < 10011; i++) {
if (100 * i <= x && x <= 100 * i + 5 * i) {
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
using namespace std;
const long long N = 1e10 + 7;
const int maxn = 2e5 + 5;
const long long INF = 8e18;
typedef long long ll;
#define for0(i,n) for(int i = 0;i < n;i++)
#define... | 0 | 29,544,840 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
while(true){
int ans = mod;
int N; cin >> N;
if(N == 0) break;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int min(vector<int> x) {
int min = -1;
rep(i, x.size()) {
if(min == -1 || min > x[i])
min = x[i];
}
return min;
}
int main() {
int A, B, M;
cin >> A >> B >> M;
... | 0 | 68,836,804 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c;
cin>>k;
for(int i=0;i<k;i++)
{
if(a>=b)
{
b*=2;
}
else if(b>=c)
{
c*=2;
}
}
if(a<b && b<c)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <=... | 0 | 50,875,975 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<ll>;
using vvi=vector<vi>;
using vd=vector<double>;
using vvd=vector<vd>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using vs=vector<string>;
#define rep(i,n) range(i,0,n)
#define range(i,a,n) for(int i=a;i<n;i++)... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
bool flag = true;
unordered_map<int, int> mp;
for (int i = ... | 0 | 68,576,219 |
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
char c[10][5];
c[1][0] = '.';c[1][1] = ',';c[1][2] = '!';c[1][3] = '?';c[1][4] = ' ';
c[2][0] = 'a';c[2][1] = 'b';c[2][2] = 'c';
c[3][0] = 'd';c[3][1] = 'e';c[3][2] = 'f';
c[4][0] = 'g';c[4][1] = 'h';c[4][2] = 'i';
c[5][0] = 'j';c... | 0 | 20,674,274 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1;... | 0 | 31,592,615 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 91,106,305 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | 0 | 16,597,587 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int N;
cin >> N;
vector<float> v(N);
rep(i,N) cin >> v.at(i);
sort(v.begin(),v.end());
float x;
rep(i,N-1){
x = (v.at(i)+v.at(i+1))/2;
v.at(i+1) = x;
}
cout << v.at... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 40,861,522 |
#include <iostream>
#include <vector>
int main()
{
int n; std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
{
std::cin >> v[i];
}
std::sort(v.begin(), v.end());
size_t dd = n / 2;
std::cout << (v[dd] - v[dd-1]) << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli h, n;
int main(void){
cin >> h... | 0 | 65,412,981 |
#pragma region _head
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#include<regex>
#pragma region _define
#define int LL
#define f(i,a,b) for(LL i=a;i<b;i++)
#defi... | #include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<sstream>
#include<iostream>
using namespace std;
struct Data{
char c;
int n;
};
int main(void){
int n;
cin>>n;
string str;
string c[... | 0 | 15,136,094 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #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... | 0 | 63,538,418 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n; cin >> n;
long cnt = 0;
string s; cin >> s;
vector<int> v(3);
for(int i=0;i<1000;i++){
v[0] = i/100; v[1] = (i%100)/10; v[2] = i%10;
long a = 0;
for(int j=0;j<n;j++){
if(v[a] == (int)(s[j]-'0'))a++;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | 0 | 57,667,783 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int popcount( int a ) {
int ... | #include <iostream>
using namespace std;
int main()
{
int r,c;
cin >> r >> c;
char arr[r][c];
char aaa[r][c];
char bbb[r][c];
for (int i =0;i<r;i++){
for (int j =0;j<c;j++){
cin>>arr[i][j];
}
}
for (int i=0;i<r;i++){
for (int j=0;j<c;j++){
... | 0 | 57,441,682 |
#include<iostream>
using namespace std;
int main() {
int N;
cin>>N;
long a[N], b[N], c[N];
long sum = 0;
for(int i=0;i<N;++i){
cin>>a[i];
}
for(int i=0;i<N;++i){
cin>>b[i];
c[i] = a[i] - b[i];
sum -= c[i];
}
bool ans = true;
if(sum<0)ans=false;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vec... | 0 | 26,861,220 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int n=t.size();
int m=s.size();
int ans=10000;
for(int i=0;i<m-n+1;i++){
int cnt=0;
for(int j=0;j<n;j++){
if(s.at(i+j)==t.at(j)) cnt++;
}
ans=min(ans,n-cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#def... | 0 | 14,310,838 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if ((a * b) % 2)
{
cout << "Odd\n";
}
else
{
cout << "Even\n";
}
} | #include <iostream>
#include <bitset>
#include <vector>
using namespace std;
typedef unsigned long long ll;
bitset<61> a[100005];
int main() {
int n;
cin >> n;
bitset<61> tmp(0);
for(int i = 0; i < n; i++) {
ll A; cin >> A;
a[i] = A;
tmp ^= A;
}
for(int i = 0; i < n; i++) {
for(int j = 0; j... | 0 | 40,581,804 |
#include <iostream>
#include <iomanip>
#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 <unorder... | #include<iostream>
#include<cmath>
#include<vector>
#include<bitset>
#include<bitset>
#include<string>
#include<utility>
#include<queue>
using namespace std;
int main(){
string s;
cin >> s;
int ansa=0,ansb=0;
for(int i=0;i<s.size();i++){
if(i&1){
if(s.at(i)=='0'){
ans... | 0 | 96,413,749 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define me memse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 1001001001;
int main(){
int n;
... | 0 | 21,922,825 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
int main() {
int N;
cin>>N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin>>a[i];
}
sort(a.rbegin(),a.rend());
int a1=a[0],a2,dist=2e9+5;
for (int i = 1; i < N; ++i) {
if(abs(a[... | #include<stdio.h>
struct Vector2D{
double x;
double y;
};
Vector2D sub(const Vector2D a, const Vector2D b){
Vector2D ret;
ret.x = a.x-b.x;
ret.y = a.y-b.y;
return ret;
}
bool hittest_point(Vector2D A, Vector2D B, Vector2D C, Vector2D P){
Vector2D AB = sub(B, A);
Vector2D BP = sub(P, B);
... | 0 | 79,902,541 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
long long int a[10],temp,i,j;
for(i=0;i<10;i++){
cin>>a[i];
}
for(i=0;i<10;i++){
for(j=0;j<10-i-1;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
... | 0 | 40,153,801 |
#include<stdio.h>
#include<string.h>
int main(){
int n,i;
char s1[21];
scanf("%s",s1);
int len=strlen(s1);
len--;
for(i=len;i>=0;i--){
printf("%c",s1[i]);
}
printf("\n");
return(0);
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
vector<int>vec[26];
char str[MAX];
void Get_Pos()... | 0 | 18,953,917 |
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int n;
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<pair<int, ll>>>;
const int INF = 1001001001;
ll h, w;
ll solve1(ll a){
ll res = h - a;
ll b = res/2, c = res - b;
return max(abs(a-b), max(abs(a-c), abs(b-c))) * w;
}
ll solve2(ll a){
ll res = h - a;
ll b... | 0 | 94,572,626 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
#define INF 1000000000000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i,n) cin >> h[i];
long long dp[110000];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = INF;
for (int j =... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
... | 0 | 75,159,251 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s,t,u;
int M=0,l=0;
map<string,int>m;
for(;cin>>u;){
if(++m[u]>M)M=m[u],s=u;
if(t.size()<u.size())t=u;
}
cout<<s<<' '<<t<<endl;
} | #include<iostream>
#include<algorithm>
#define MOD 1000000007
#define Nmax 2000010
using namespace std;
long long inv[Nmax],fact[Nmax],invfact[Nmax];
void PRE(){
inv[1]=fact[0]=invfact[0]=1;
for(int i=1;i<Nmax;i++){
if(i>1)inv[i]=(MOD-(MOD/i)*inv[MOD%i]%MOD)%MOD;
fact[i]=fact[i-1]*i%MOD;
invfact[i]=invfact[i-1]... | 0 | 1,480,908 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
... | 0 | 78,181,590 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
bool cmp(pair<int, int> &x, pair<int, int> &y)
{
return x.second > y.second;
}
int main(void)
{
int n, m;
while(cin >> n >> m, n > 0){
int j = 0, ans = 0;
vector<pair<in... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, d, a;
cin >> n >> d >> a;
vector < pair < ll, ll > > v;
for(int i = 0; i < n; i++){
ll x, h;
cin >> x >> h;
v.push_back({x, (h + a - 1) / a});
}
... | 0 | 17,000,992 |
#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 ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | 0 | 80,302,287 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint n, k;
scanf("%lld", &n);
scanf... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
string w;
cin >> w;
char last = w.at(w.size() - 1);
vector<string> used;
used.push_back(w);
bool ans = true;
rep(i, N - 1){
... | 0 | 38,585,087 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c; cin>>a>>b>>c;
cout<<(a + b >= c ? "Yes\n" : "No\n");
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 14,459,986 |
#include <iostream>
int main()
{
long long N;
std::cin >> N;
long long ans = 0;
for (long long i=1; i<N+1; i++)
{
long long n = N/i;
ans += i*(n*(n+1))/2;
}
std::cout << ans;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 0 | 13,984,449 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
string s, right = "yuiopjhklnm";
int count;
bool use_right;
while (cin >> s, s != "#") {
count = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> a(n), b(n), c(m), d(m);
rep(i, n){
cin >> a[i] >> b... | 0 | 73,921,454 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int m,k;
cin>>m>>k;
if(k==0){
rep(i,1<<m)
cout<<i<<" "<<i<<endl;
return 0;
}
if(k==1&&m==1){
cout<<-1<<endl;
return 0;
}
if(k>=1<<m){
cout<<-1<<endl;
return 0;
... | 0 | 41,831,613 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int main(){
string str, ans;
int i;
cin >> str;
for(i=0 ; i<str.size() ; i++){
ans += str[str.size()-i-1];
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
void aaa(int *a,int start,int end){
if(start<end){
for(int i=start;i<end; i++){
if(a[i]>a[i+1]){
int tmp=a[i];
a[i]=a[i+1];
a[i+1]=tmp;
}
}
aaa(a,start,end-1);
}
}
int main(void){
using namespace std;
int n,m,count[101];
string... | 0 | 15,207,478 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 100010
int n;
bool t[N];
unordered_set<int> v[N];
unordered_set<int>::iterator it;
queue<int> Q;
void BFS(int ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (i... | 0 | 70,940,039 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n, k;
long long cnt1, cnt2, ans;
cin >> n >> k;
cnt1 = cnt2 = ans = 0;
for(int i = 1; i <= n; i++)
{
if (i % k == 0)
cnt1++;
if (k % 2 == 0 && i % k == k / 2)
cnt2++;
}
ans = cnt1 * cnt... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin >> a >> b >> s;
if(s[a] == '-'){
for(int i = 0; i < s.size(); i++){
if(i != a){
if(!(s[i] >= 48 && s[i] <= 57)){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
retu... | 0 | 94,448,460 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#i... | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>... | 0 | 56,088,330 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#define ll long long
#define int long long
#define Size(v) (int)v.size()
using namespace std;
const int nax = 5e6 + 5;
int ... | #include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include <string.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265358979323846264338327950L
#define MAX 12
#define SUM_INIT 10000000000
int main() {
int N, M, X;
int C[MAX];
int A[MAX][MAX];
cin >> N >> M >> X;
for (int ii = 0; ... | 0 | 17,999,626 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c[3], d[3];
cin >> c >> d;
cout << (c[0] == d[2] && c[1] == d[1] && c[2] == d[0] ? "YES" : "NO") << endl;;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n,k;
cin >> n >> k;
k--;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 1e18;
for(int bit = 0; bit < (1 << (n - 1)); bit++){
int cnt = 0;
... | 0 | 18,194,628 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | #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 N;
cin >> N;
vector<string> s(N + 1);
cout << "0\n";
cin >> s[0];
s[N] = s[0];
int m = 0, l = 0, r = N;
while (s[m] != "Vacant") {
m = (l + r) / 2;
c... | 0 | 14,190,824 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
int h,m,s,s1,ti[100001];
char a,b;
while(1){
cin>>n;
if(n==0) break;
for(i=0;i<86400;i++) ti[i]=0;
for(i=0;i<n*2;i++){
cin>>h>>a>>m>>b>>s;
if(i%2==0) ti[h*3600+m*60+s]++;
else ti[h*3600+m*60+s]--;
}
for (i=0;i<86400;i++) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii p... | 0 | 26,345,838 |
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
using namespace std;
using ll = long long;
using ld = long double;
const ... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | 0 | 38,368,817 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <bits/stdc++.h>
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--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 0 | 76,250,508 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).b... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
int d[101][101];
int inf=INT_MAX;
int v;
int warshall_floyd(){
rep(k,v)rep(i,v)rep(j,v){
if(d[i]... | 0 | 68,669,568 |
#include <iostream>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n][n];
for( int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = 0;
}
}
int p[n + 1];
for ( int i = 0; i < n; i++) {
cin >> p[i] >> p[i+1];
}
for (int l = 2; l <= n; l++) {
for (int i = 0; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, sum = 0,a;
vector<pair<ll, int>> v(4);
for (int i = 0; i < 4; i++) {
cin >> a;
if(i==0){
v[i].first=a*8;
}else if(i==1){
v[i].first=a*4;
}else if(i==2){
v[i].first=a*2;
... | 0 | 89,825,423 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int ans1,ans2;
int main(void){
string s; cin>>s;
for(int i=0;i<s.size();i++){
if(i%2==0){
if(s[i]!='0'){
ans1++;
}
}else{
if(s[i]=='0'){
... | #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;
int main(){
int ... | 0 | 94,950,330 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
M = N;
int sum = 0;
for (int i=8; i>=0; i--) {
int W=1;
for (int j=0; j<i; j++){
W *= 10;
}
int x;
x = N / W;
sum += x;
N = N - x*W;
}
if (M % sum == 0) {
cout << "Yes" << endl;
}
else ... | #include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
using namespace std;
#define rep(i, n) for (int i... | 0 | 76,413,260 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void frog(int *A,int n)
{
ll t[n+1];
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3){
t[i]= min( (t[i-1]+abs(A[i]-A[i-1])),
(t[i-2]+abs(A[i]-A[i-2])) );
}
else t[... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while(n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int res = 0;
REP(i, N) {
... | 0 | 23,924,636 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#d... | #include <iostream>
#include <cstddef>
#include <string>
using ll = long long;
ll n;
std::string s, s2;
char t[4];
char p;
ll ans;
int main() {
std::cin >> n;
std::cin >> s;
for (int i = 0; i < 1000; i++) {
bool torf = true;
std::snprintf(t, 4, "%03d", i);
s2 = t;
long long i... | 0 | 92,986,629 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 70,174,388 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-... | #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 one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 0 | 36,224,088 |
#include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int H, W, D, Q;
int A[301][301];
int dp[300 * 300 + 1];
int L[100000], R[100000];
int main(int argc, char* argv[]) {
cin >> H >> W >> D;
unordered_map<int, pair<int, int>> map;
for (int i = 1... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 0 | 98,634,723 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n);
rep(i,n-1) cin >> b[i];
int ans = b[0]+b[n-2];
rep(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii ... | 0 | 3,510,669 |
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define elif else if
string a;
signed main()
{
cin>>a;
rep(i,4){
cout<<a[i];
}
cout<<" ";
rep(i,8){
cout<<a[i+4];
}
cout<<endl;
} | 0 | 52,629,244 |
#include<bits
using namespace std;
int main()
{
int n,i,j,k;
cin>>n;
if(n<3)
cout<<"0"<<endl;
else cout<<n/3<<endl;
} | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a[i];
map<int,int> mp;
int ans = 0;
for (int i=0; i<n; i++) {
if (mp[a[i]] == i+1) {
ans++;
}
mp[i+1] =... | 0 | 55,506,400 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | #include <iostream>
using namespace std;
int main()
{
int a[4], b[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
cin >> b[0] >> b[1] >> b[2] >> b[3];
if (a[0] + a[1] + a[2] + a[3] >= b[0] + b[1] + b[2] + b[3])
cout << a[0] + a[1] + a[2] + a[3] << endl;
else
cout << b[0] + b[1] + b[2] + b[3] << endl;
return 0;
} | 0 | 57,725,668 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
string s;
cin>>s;
int n=s.size();
vector<int>a(n+1,0);
rep(i,n){
if(s[i]=='<')if(a[i]>=a[i+1])a[i+1]=a[i]+1;
}
for(int i=n; i>0; --i){
if(s[i-1]=='>')if(a[... | 0 | 45,539,158 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p, q;
cin >> n;
vector<int> P(n), Q(n), R(n);
for (int i = 0; i < n; i++)
{
cin >> P.at(i);
}
for (int i = 0; i < n; i++)
{
cin >> Q.at(i);
}
for (int i = 1; i <= n; i++)
{
R.at(i - 1) = i;
}
int cnt = 0;
do
{
... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | 0 | 55,559,109 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[2] = {-1, 1};
ll dy[4] = {0, 1, 0, -1};
int main(void){
ll n;
cin >> n;
l... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
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++){
cin >> a[i][j];
}
}
... | 0 | 50,085,886 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 5,352,055 |
#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, min, ans;
ans = 0;
min = pow(10, 6);
cin >> n;
rep(i, n) {
int p;
cin >> p;
if (p <= min) {
ans++;
min = p;
}
}
cout... | #include<iostream>
#include<queue>
using namespace std;
int N;
int D[101],d[101][101];
void bfs(int src){
int u,k,a;
bool visit[101];
for(int i=1;i<=N;++i){
cin>>u>>k;
for(int j=0;j<k;++j){
cin>>a;
d[u][a]=1;
}
visit[i]=true;
}
queue<int>Q;
... | 0 | 66,249,541 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
ll H, W, N;
map<pii,ll> mp;
ll ans[10] = {};
void solve() {
cin >> H >> W >> N;
rep(i,N) {
in... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200001;
ll N, ans=0, tmp=0;
vector<ll> A(MAXN, 0);
map<ll, ll> M;
signed main(){
cin >> N;
M[0]++;
for(int i=1;i<=N;i++) {
ll a;
cin >> a;
A[i] = A[i-1]+a;
M[A[i]]++;
... | 0 | 68,825,473 |
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define Fast ios::sync_with_stdio... | #include<stdio.h>
#include <cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<utility>
char a[9999999+99];
using namespace std;
int fact(int n)
{
int i,k=1;
for(i=1;i<=n;i++)
k*=i;
... | 0 | 22,055,158 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int gcd(int a,int b){
if(b==0){
return a;
}
else{
return gcd(b,a%b);
}
}
int main(){
int i,j,n;
cin >> n;
int a[1000010],b[1000010];
for(i=0;i<n;i++){
cin >> a[i];
b[i]=a[i];
}
vector<int> x(1... | 0 | 50,254,516 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
#include <cstdio>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {
int parent;
int left;
int right;
};
Node Tree[MAX];
int D[MAX];
void print(int u) {
printf("node %d: ",u);
printf("parent = %d, ",Tree[u].parent);
printf("depth = %d, ",D[u]);
if (Tree[... | 0 | 85,403,493 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.