code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
usin... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define inf 1e9
#define mod 1000000007
#define ff first
#define ss second
void solve()
{
int k;
string s;
cin >> k >> s;
if (s.length() <= k)
cout << s;
else
{
string ans = s.substr(0, k) + "...";
cout << ans;
}
}
signe... | 0 | 89,365,470 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
const ll INF = 0x3f3f3f3f;
const ll LINF = 1ll << 55;
const ll MOD = 1e9 + 7;
const ll MAXN = 400 + 5;
const ll MAXK = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
int main() ... | 0 | 2,620,250 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
int a=1e9,ans=0;
rep(i,n){
int p;cin>>p;
if(a>p){
ans++;
a=p;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 8,883,545 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> v(N+1), c(5);
for (int i = 2; i <= N; i++) {
int x = i;
for (int j = 2; j <= i; j++) {
while (x % j == 0) {
v[j]++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int nijou(int n){
ll ans=1;
for(int i = 0; i < n; i++) {
ans *= 2;
}
return ans;
}
int main() {
int n,k;
cin >> n >> k;
double ans=0;
int b;
for(int i = 1; i <= n; i++) {
int a;
if(i>=k){
... | 0 | 87,342,197 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0,MIN=1e10;
cin >> n;
long long a[n],b[n];
bool f=true;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
ans+=a[i];
if(a[i]>b[i]) MIN=min(MIN,b[i]);
if(a[i]!=b[i]) f=false;
}
if(f){
cout << 0 << endl;
return 0;
}... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> s(N);
rep(i,0,N-1) cin >> s[i].first >> s[i].second;
vector<pair<int, int>> c(M);
rep(i,0,M-1) cin >> c[i].first >> c[i].second;
vector<int> answers(N);
r... | 0 | 57,859,323 |
#include<bits/stdc++.h>
#define ll long long
#define N 500005
#define inf 1000000005
#define mod 1000000007
#define put putchar('\n')
#define F(i,a,b) for (int i=a;i<=b;i++)
#define D(i,a,b) for (int i=a;i>=b;i--)
#define go(i,t) for (int i=head[t];i;i=Next[i])
#define sqr(x) ((x)*(x))
#define re register
#define mp ma... | #include<iostream>
#include<stdio.h>
#include<math.h>
#define PI 3.14159265f
using namespace std;
int main() {
int a, b, C;
double S, L, h;
cin >> a >> b >> C;
S = a*b*0.5*sin(C*PI / 180);
L = a + b + sqrt(a*a + b*b - 2 * a*b*cos(C*PI / 180));
h = b*sin(C*PI / 180);
printf("%f %f %f\n", S, L, h);
return 0;
} | 0 | 73,403,824 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define INIT2(a,n,m,x); REP(i,(n)){ REP(... | 0 | 18,858,798 |
#include<bits/stdc++.h>
using namespace std;
int main() {
float d, t, s;
cin >> d >> t >> s;
if(d / s <= t) cout << "Yes\n";
else cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 48,855,413 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N), pos(N + 1);
for (int i = 0; i < N; i++) {
cin >> P[i];
pos[P[i]] = i + 1;
}
multiset<ll> st;
ll ans = 0;
st.insert(0);
st.insert... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
ll S;
cin>>S;
ll digit=0;
ll d=S;
while(d!=0){
digit++;
d/=10;
}
vector<ll> s(digit);
rep(i,digit){
s[i]=S%10;
S/=10;
}
reverse(s.begin(),s.end());
ll ans;
ll c... | 0 | 23,055,781 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define F first
#define S second
using ll = long long;
using P = pair<int,int>;
int main() {
int n, p;
cin >> n >> p;
string s;
cin >> s;
if(p == 2 || p == 5) {
ll res = 0;
for(int i = n - 1; i >= 0; i--) {
... | 0 | 63,256,627 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define mod 1000000007
int main() {
ll h, w, m;
ll hi, wi;
ll maxh = -1;
ll maxw = -1;
ll ans;
set <pair<int, int>>p;
cin >> h >> w >> m;
vector<int> vh(h);
vector<int> vw(w);
vector<int> buf1;
vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 0 << endl;
vector<string> ans(n);
cin >> ans[0];
if(ans[0] == "Vacant") return 0;
cout << n-1 << endl;
cin >> ans[n-1];
if(ans[n-1] == "Vacant") return 0;
int right = n-1;
int left = 0;
wh... | 0 | 31,598,210 |
#include<iostream>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int k[m],a[m][20];
for(int i=0;i<m;i++){
cin>>k[i];
for(int j=0;j<k[i];j++){
cin>>a[i][j];
}
}
int p[m],ans=0;
for(int i=0;i<m;i++) cin>>p[i];
for(int bit=0;bit<(1<<n);bit++){
int light=0;
for(int i=0;i<m;i... | #include <iostream>
#include <cstdint>
#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... | 0 | 37,708,080 |
#include<iostream>
using namespace std;
int main(){
int A, B, X;
cin >> A >> B >> X;
if (A <= X && X <= A+B){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
bool is_prime(int n){
for(int i=2; i*i <= n; i++){
if(n%i == 0) return false;
}
return n != 1;
}
int main(void){
int n;
cin >> n;
map<int, int> pr;
for(int i = 1; i <= n; i++){
for(in... | 0 | 85,087,159 |
#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 each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,M,count=0;
cin>>N;
vector<string> s(N);
for(int i=0;i<N;++i)cin>>s[i];
cin>>M;
vector<string> t(M);
for(int i=0;i<M;++i)cin>>t[i];
auto calc=[&](string find){
i... | 0 | 79,445,614 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int cnt[N], n;
int a[N], ans[N];
int main() {
cin>>n;for(int i = 1; i <= n; i++) {
int t; scanf("%d", &t);
cnt[t]++;
}
for(int i = 1; i <= n; i++) if (cnt[i]) {
a[++a[0]] = cnt[i];
}
sort(a + 1, a + 1 + a[0]);
int sum = 0;
for(int cs = 1... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define A... | 0 | 40,050,508 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
int x;
cin >> x;
... | #include <iostream>
#include <vector>
using namespace std;
void abc_170a();
void abc_171a();
void abc_172a();
void abc_173a();
void abc_174a();
void abc_175a();
void abc_170b();
int main()
{
abc_170b();
}
void abc_170a()
{
vector<int> x(5);
for (int i = 0; i < 5; ++i) cin >> x[i];
for (int i = 0; i < 5; ++i)
... | 0 | 78,648,912 |
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
int col[10][10];
int main(void)
{
int H,W,K;
scanf("%d%d%d",&H,&W,&K);
char s[10];
for (int i=1;i<=H;i++)
{
scanf("%s",s);
for (int j=0;j<W;j++)
i... | #include <cstdio>
#include <cstring>
int main()
{
char ring[101], p[101], line[505];
scanf("%s", ring);
scanf("%s", p);
int ring_length, p_length;
ring_length = strlen(ring);
p_length = strlen(p);
for(int i = 0; i < 5; i++){
strcpy((line+i*(ring_length)),ring);
}
char string[10... | 0 | 52,643,750 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int r;
cin >> r;
if(r < 1200){
cout << "ABC" << endl;
return 0;
}
if(r < 2800){
... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 6,871,552 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main() {
ll N, P;
cin >> N >> P;
ll cnt = 0;
vector<ll> A(N,0);
rep(i,N)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
ll l=1000000007;
string alphabet="abcdefghijklmnopqrstuvwxyz";
using graph = vector<vector<int>>;
double pi=3.14159265358979;
int main() {
int n,m; cin>>n>>m;
graph v(m)... | 0 | 8,668,055 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 43,979,774 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H;
cin >> H;
vector<int> dat(H);
for ( int i = 0; i < H; i++ ) cin >> dat[i];
for ( int i = 0; i < H; i++ ) {
printf("node %d: key = %d, ", i+1, dat[i]);
if ( i ) printf("parent key = %d, ", dat[(i-1)/2]);
if ( i*2+1 < H ) printf("left... | #include<iostream>
using namespace std;
int main()
{
int d;
while(cin>>d)
{
int right=600/d;
int ans=0;
for(int i=d;i<600;i+=d)
{
ans+=d*i*i;
}
cout<<ans<<endl;
}
return 0;
} | 0 | 47,184,229 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int a,b,c,d;
double e;
cin >> a >>b;
c = a/b;
d = a%b;
e = double(a)/double(b);
printf("%d %d %10.6f",c,d,e);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
cin >> m;
vector<string> t(m);
rep(i, m) cin >> t.at(i);
int ans = 0;
string say;
rep(i, n) {
... | 0 | 82,275,660 |
#include <iostream>
int main(int argc, char **argv){
for(int i = 1; i < 10; i++){
for(int j = 1;j < 10; j++){
std::cout << i << "x" << j << "=" << i * j;
std::cout << std::endl;
}
}
} | #include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#... | 0 | 18,678,635 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax) {
if (m == 0 && nmin == 0 && nmax == 0) {
break;
}
vector<int> d(m);
for (int i = 0; i < m; i++) {
cin >> d[i];
}
int MAX = d[nmin-1]-d[nmin];
int maxn = nmi... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
set<int> s;
for (int i = 0; i < k; i++) {
int d;
cin >> d;
for... | 0 | 95,802,113 |
#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 n, ans = 0;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int curmin = 1e9;
rep(i, n) {
curmin = min(curmin, a[i]);
if (a[i] == curmin) {
... | #include <bits/stdc++.h>
#define F first
#define S second
#define SZ size()
using namespace std;
typedef long long ll;
int in(){int a; scanf("%d", &a); return a;}
ll inll(){ll a; scanf("%lld", &a); return a;}
const int MAX = 8e3 + 5;
const int INF = 0x3f3f3f3f;
string s;
int X, Y;
vector <int> xsteps, ysteps;
int memx[... | 0 | 85,411,269 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
class UnionFindTree {
public:
vector<int> rank, parents;
UnionFindTree() {}
UnionFindTree(int n) {
rank.resize(n, 0);
parents.resize(n, 0);
for (int i = 0; i < n; i++) {
makeSet(i);
}
}
... | 0 | 60,957,035 |
#include <iostream>
using namespace std;
struct card {
char c;
int value;
};
void print(struct card C[], int n)
{
for (int i = 0; i < n; i++) {
if (i > 0) cout << " ";
cout << C[i].c << C[i].value;
}
cout << endl;
}
void bubbleSort(struct card C[], int n)
{
for (int i = 0; i < n; i++) {
for (int j = n - 1; ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 72,336,075 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if( (a % 500) <= b){
cout << "Yes" ;
}
else {
cout << "No";
}
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 58,095,957 |
#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 a,b,c,d;
cin >> a >> b >> c >> d;
int l=a+b,r=c+d;
string message;
if(l<r){
message="Right";
}else if(l>r){
message="Left";
}else{
message="Balanc... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"YES"<<endl;}else cout<<"NO"<<endl;
bool isK(string t){
... | 0 | 97,955,032 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 123456
using namespace std;
int n,a[N],ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+1+n);
for(int i=1;i<=n;i++)
if(a[i] == a[i-1]) ans++;
if(ans & 1) ans++;
printf("%d\n",n-ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
double x[3], y[3], xp, yp;
double cross(int a, int b){
return x[a] * y[b] - y[a] * x[b];
}... | 0 | 44,263,899 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define P pair<int,int>
#define PP pair<P,int>
#define fi first
#define se second
#define INF 1e9
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define F... | 0 | 77,930,425 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int... | 0 | 77,260,150 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 0 | 87,789,381 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int data[3];
int sum = 0;
for(int i=0;i<3;i++) cin >> data[i];
sort(data,data+3);
for(int i=1;i<3;i++){
sum += abs(data[i] - data[i-1]);
}
cout << sum <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx=1e5+5;
const int MOD=1e9+7;
ll ara[mx];
int main ()
{
ll n,m;
scanf ("%lld %lld",&n,&m);
ll sum1=0;
for (int i=0;i<n;i++) {
scanf ("%lld",&ara[i]);
if (i) {
ll x=ara[i]-ara[i-1];
sum1... | 0 | 88,198,959 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
long long H, W, ans = 0;
cin >> H >> W;
if((H == 1) || (W == 1)){
cout << 1 << endl;
return 0;
}
if((H % 2) && (W % 2)){
cout << (H * W) / 2 + 1 << endl;
}else{
cout << H * W / 2 << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 64,616,422 |
#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 RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <memory>
#include <cmath>
#include <algorithm>
#include <functional>
#incl... | 0 | 40,960,404 |
#include <iostream>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <sstream>
using namespace std;
int a[128];
char b[1001];
int s2i(string s) {
int ret = 0;
int N = s.size();
for(int i=0; i<N; i++) {
if(isdigit(s[i])) {
int temp = s[i]-'0';
i++;
ret += temp * a[s[i]];
}... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include<queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n; ++i)
#define ALL(a) (a).begin(),(a).end()
#define all_map(itr,mp) for(auto itr=mp.b... | 0 | 72,612,375 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cassert>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#d... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin >> s;
set<char> alphabet;
for (int i=0; i<s.size(); i++) {
alphabet.insert(s.at(i));
}
for (int i=0; i<26; i++) {
char alpha = 'a' + i;
if (alphabet.count(alpha) == 0) {
cout << alpha... | 0 | 64,929,446 |
#include <iostream>
#include <vector>
using namespace std;
void counting_sort(vector<size_t> const seq, vector<size_t>* res, size_t k)
{
vector<size_t> c(k, 0);
for (auto key : seq)
c[key]++;
size_t total = 0;
for (size_t i = 0; i < k; i++) {
auto old = c[i];
c[i] = total;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#def... | 0 | 26,373,128 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> nomal(n+1,1);
for (int i = 0; i < m; i++){
int a;
cin >> a;
nomal[a] = 0;
}
vector<int> dp(n+2);
const int mod = 1e9+7;
dp[0] = 1;
for (int now= 0; now < n; now++){... | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | 0 | 23,831,926 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<bitset>
using namespace std;
char p[8010];
bitset<16384>T;
int x, y, C[8010], ex, ey;
bool OK(int st, int d, int ed) {
int t = abs(ed - st);
if (t % 2 == d % 2 && t <= d)return true;
return false;
}
bool Pos(int ck, int d) {
if (abs(d) > 8000)return fal... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <complex>
using namespace std;
const double pi=3.141592653589793;
void koch_snowflake(size_t n, complex<double> p1, complex<double> p2) {
if (!n) return;
complex<double> s, t, u;
s = (2.0*p1 + p2) / 3.0;
t = (p1 + 2.0*p... | 0 | 14,787,690 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string sh, sh1; cin >> sh;
getchar();
cin >> sh1;
int length = sh.size();
for (int i = 0; i < length; ++i)
{
if (sh[i] != sh1[i])
{
cout << "No" << ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define pii pair<int, int>
#define vpli vector<pair<long long, int>>
#define deb(x) cout << "deb ... | 0 | 85,629,264 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
vector<pair<long long, long long>> V(n);
for (int i = 0; i < n; i++)
{
cin >> V.at(i).first >> V.at(i).second;
}
sort(V.begin(), V.end());
ll sum = 0;
for (int i = 0; i < n; i++)
{
sum +=... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 0 | 22,783,521 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (double)(x2 - x1) * (double)(x2 - x1);
double y = (double)(y2 - y1) * (double)(y2 - y1);
cout << fixed << setprecision(6) << (double)sqrt(x+y) << e... | #include <iostream>
#define MAX_LEN 1001
using namespace std;
int main() {
char num[MAX_LEN], tmp;
int pos, sum, value;
bool flag;
while (1) {
for (int i = 0; i < MAX_LEN; ++i) {
num[i] = '0';
}
pos = 0;
while ((tmp = getchar()) != '\n' && tmp != -1) {
... | 0 | 21,917,100 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define RFOR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3
const double EPS = 1e-14;
const double PI = acos(-1.0);
int ... | #include<bits/stdc++.h>
#include<vector>
#include<cmath>
#include<string>
using namespace std;
#define vc vector<int>
#define vcvc vector<vector<int>>
#define vcl vector<long int>
#define vccl vector<long long int>
#define pb(a) ... | 0 | 71,884,685 |
#include <cstdio>
int main() {
int n, m, d;
scanf("%d%d%d", &n, &m, &d);
if (d % 2 == 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
putchar("RG"[(i + j) & 1]);
}
puts("");
}
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
... | #include<iostream>
#include<vector>
using namespace std;
int main()
{
for(;;){
char todoset[2][51];
int n, m;
bool flg = 0;
cin >> n;
if(n == 0){
break;
}
for(int i = 0; i < n; i++){
cin >> todoset[0][i];
cin >> todoset[1][i];
}
cin >> m;
vector<char> str(m);
for(int i = 0; i < m; i++){
... | 0 | 21,251,225 |
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b)... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 0 | 12,331,416 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,k;string s;cin>>n>>s>>k;
char c=s[k-1];
rep(i,n){
if(s[i]!=c)s[i]='*';
}
cout<<s<<endl;
} | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i... | 0 | 97,902,907 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N,i;
cin>>N>>i;
cout<<N-i+1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<(n); i++)
#define REPS(i, n) for(int i=0; i<=(n); i++)
#define FOR(i, a, b) for(int i=a; i<(b); i++)
#define FORS(i, a, b) for(int i=a; i<=(b); i++)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).... | 0 | 74,412,788 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n,d,x;
cin>>n>>d>>x;
int sum=0;
rep(i,n){
int a;
int b;
cin>>a;
b=1;
while(b<=d){
b+=a;
sum++;
}
}
cout... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , k , h[N] , f[N];
int main()
{
cin >> n >> k;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
f[i] = INT_MAX;
}
f[1] = 0;
for(int i = 2 ; i <= n; ++i)
{
for(int j = 1 ; j <= k; ++j)
{
... | 0 | 26,298,092 |
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1}... | 0 | 43,157,885 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]==s[1]&&s[1]==s[2]&&s[2]==s[0])
cout<<"No\n";
else
cout<<"Yes\n";
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
ll n,x; cin>>n>>x;
ll ans = 0;
vector<ll[2]>dic(n+1);
dic[0][0] = dic[0][1] ... | 0 | 51,236,188 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int c = 0;
cin >> s;
for(int i=0; i<s.size()-1; i++){
if(s[i] == '0' && s[i+1] == '0'){
s[i+1] = '1';
c++;
}
if(s[i] == '1' && s[i+1] == '1'){
s[i+1] = '0';
c++;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 0 | 27,829,661 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t n, l;
cin >> n >> l;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
int f = -1;
for (int i = 0; i < n - 1; i++){
if (A[i] + A[i + 1] >= l){
f = i + 1;
}
}
if (f == -... | 0 | 57,403,026 |
#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;
ll ans = 0;
vector<string> s(n);
map<string,int> m;
rep(i,n){
cin >> s[i];
sort(s[i].begin(),s[i].end());
m[s[i]] += 1;
}
rep(i,n){
if(m[s[i]] >= 2){
... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
long long int mod=1e9+7,maximum=-1;
char ar[1001][1001];
long long int getmax(long long int n,long long int m)
{
long long int i,j;
long long int dp[n+1][m+1];
for(i=0;i<n+1;i++)
dp... | 0 | 65,978,102 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define mod 1000000007
const int sz=1e5+5;
ll inf=1e15;
ll dp[sz][2],n;
vector<int> ar[sz];
void dfs(int u,int pr)
{
dp[u][0]=1;
dp[u][1]=1;
for(int v:ar[u])
{
if(v!=pr)
{
dfs(v,u);
... | 0 | 15,077,196 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s;
cin >> s;
set<int> se;
for(int i=0;i<s.size();i++){
se.insert(s[i] -'a');
}
if(se.size()==3){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int x,n,ans=-1,cur=1e9;
cin >> x >> n;
map<int,int> p;
rep(i,n){
int a;
cin >> a;
p[a]++;
}
for(int i=0;i<=101;i++){
if(p[i]>0) continue;
if(abs... | 0 | 33,278,409 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<tuple<long long int,long long int>> drink(n);
int a,b;
for(int i=0; i<n; i++){
cin >> a >> b;
drink.at(i)=make_tuple(a,b);
}
sort(drink.begin(), drink.end());
int i=0;
long long i... | 0 | 45,878,606 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <utility>
#include <algorithm>
#include <set>
#include <queue>
#include <climits>
#include <limits>
#include <map>
#include <unordered_map>
#include <cstring>
#include <ctime>
using namespace std;
#de... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
while (true) {
string s;
cin >> s;
int hand[26] = {0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0,
1, 0, 0, 0, 1, 0};
if (s == "#") {
... | 0 | 72,765,840 |
#include<stdio.h>
int main()
{
long long int n,m,i;
scanf("%lld %lld",&n,&m);
long long int ans[n+1],a[m],sw;
sw=0;
ans[0]=1;
if(m>0){
for(i=0;i<m;++i)
{scanf("%lld",&a[i]);}
if(a[sw]==1) {ans[1]=0;
sw++;}
else ans[1]=1;
for(i=2;i<=n;++i)
{
if(i==a[sw]) {ans[i]=0;
sw... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define vecsort(v) sort(v.begin(),v.end())
#define lcm(x,y) (x/__gcd(x,y))*y
#define forn(i,n) for(i = 0 ; i < n ; i+... | 0 | 66,011,441 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b==0) return a;
else{
return gcd(b,a%b);
}
}
int main() {
ll a,b;
cin >> a >> b;
if((a+b)%3==0 || a%3 == 0 || b%3 == 0){
cout << "Possible" << endl;
}
else{
cout << "Impossible" << endl;
... | #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | 0 | 51,546,979 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define mrep(i,j,n) for(int i = j; i < n; i++)
#define mreps(i,j,n) for(int i = j; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll= long long;
using namespace std;
int main(){
int X;
cin>>X;
int N=X/100;
bool flag=false;
rep(i,N+1){
int rest=X-i*100;
if(rest>=0&&rest<=5*i){
flag=true;
break;
}
}
if(f... | 0 | 95,960,556 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll... | #include<iostream>
#include<vector>
using namespace std;
int n,m,x;
int c[12];
int a[12][12];
int main(){
cin >> n >> m >> x;
for(int i = 0;i < n;i++){
cin >> c[i];
for(int j = 0;j < m;j++){
cin >> a[i][j];
}
}
int ans = INT_MAX;
for (int bit = 0; bit < (1<<n); ++... | 0 | 96,794,533 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
double i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n;
i=n/(3.00);
cout<<(i*i*i);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.ti... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> A(N), accum(... | 0 | 27,969,648 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
ty... | #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,... | 0 | 61,172,822 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 59,573,275 |
#include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 0 | 16,474,262 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector< vector<ll> >
typedef long long ll;
typedef pair<int, int> P;
const ll INF = (1LL << 40);
int main(){
int N, M;
cin >> N >> M;
Grap... | 0 | 23,902,485 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int> A(N);
for(int i=0;i<N;i++) cin>>A.at(i);
int ans=0;
int now=1;
bool can=true;
while(can){
ans++;
now=A.at(now-1);
if(now==2) break;
if(ans==100000000) can=false;
}
if(can) cout<<ans<<endl;
else cout<<-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<char> vec(H*W);
for (int i = 0; i < H*W; i++) {
char a;
cin >> a;
vec.at(i) = a;
}
int h = 0, w = 0;
for (int i = H-1; i >= 0; i--) {
for (int j = W-1; j >= 0; j--) {
if (vec.at(i*W + j... | 0 | 71,107,282 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int main()
{
ios::sync_with_stdio(false);
int n ; cin >> n;
ll ans = 0;
for (int i = 1 ; i <= n ; i++){
for (int j = 1 ; j <= n ; j++){
if (i * j >= n) break;
... | #include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define PDD pair<double, double>
#define MOD ((int)1e9 + ... | 0 | 71,807,540 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 998244353
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> room[n];
rep(i,m) {
int a, b;
cin >> a >> b;
--a; --b;
room[a].push_back(b);
room[b].push_back(a);
}
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
using Graph = vector<vector<int>>;
using pint = pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ... | 0 | 72,623,454 |
#include <iostream>
using namespace std;
int main(){
int k,n;
cin >> n >> k;
long long a[n];
long long ans = 0;
long long p,m;
p = m = 0;
for(int i = 0;i<k;i++){
cin >> a[i];
if(a[i]>=0){
ans+=a[i];
p+=a[i];
}
else m+=abs(a[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 0 | 49,905,554 |
# 1 "a.cpp"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "a.cpp"
# 1 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 1
# 11 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp"
# 1 "/home/tysm/dev/cpplib/bin/../stdlib/bits/stdc++.h" 1
#include<bits/stdc++.h>
# 12 "/home/tysm/dev/cpplib/bin/../include/cpplib/... | #pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
signed main() {
intmax_t N, X, M;
scanf("%jd%jd%jd", &N, &X, &M);
const size_t L = 35;
std::vector<std::vector<intmax_t>> nxt_num(L + 1, std::vector<intmax_t>(M, 0));
std::vector<std::vector<intmax_t>> nxt_sum(L + 1, std::vector<int... | 0 | 15,316,298 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
map<int, int> mp;
int x;
for(int i = 0; i < 3; i++) {
cin >> x;
mp[x]++;
}
cout << mp.size();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int n,m,pi;
cin >> n >> m;
int correct = 0, penalty = 0;
int done[n] = {};
string si;
for (int i=0; i<m;i++){
cin >> pi >> si;
if ((si == "AC") && (done[pi-1] != -1)) {
penalt... | 0 | 29,161,650 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 0 | 11,732,088 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<double> a(n);
vector<string> b(n);
for(int i=0;i<n;i++){
cin>>a[i];
cin>>b[i];
}
double sum=0.00000;
for(int i=0;i<n;i++){
if(b[i]=="JPY"){
sum+=a[i];
}
else{
sum+=a[i]*380000;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int n, x, sol[200005];
vector<pair<int, int>> v;
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> x;
v.push_back(make_pair(x, i));
}
sort(v.begin(), v.end());
sol[v[n - 1].second] = v[n - 2].first;
for(int i = n - 2; i >= 0... | 0 | 42,639,938 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){
long double a ;
cin >> a;
a = a ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 74,767,443 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(1){
int n,k,b[100100]={},sum=0,sum1=0,ans=0,j=0;
cin>>n>>k;
if(n==0) break;
for(int i=0;i<n;i++){
cin>>b[i];
if(i<k){
sum+=b[i];
}else{
ans=max(ans,sum);
sum=sum-b[j]+b[i];
j++;
}
}
cout<<ans<<endl;
... | #include<bits/stdc++.h>
using namespace std;
#define MAX 100000
const long long INF=1145141919,MOD=1e9+7;
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 double EPS = 1e-9;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int m,nmin,nmax;
cin>>m>>nmin>>nmax;
wh... | 0 | 74,652,124 |
#include <iostream>
#include <set>
int main() {
std::set<int> st;
bool f=true;
int n; std::cin >> n;
for(int i=0; i<n; ++i) {
int a; std::cin >> a;
if (st.find(a) != st.end())
f=false;
st.insert(a);
}
std::cout << (f ? "YES" : "NO") << std::endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
signed main(){
int n,m;cin >>n >>m;
vector<P> res;
rep(i,n){
int a,b;cin >> a >> b;
res.emplace_back(a,b);
}
sort(res.begin(),r... | 0 | 17,632,763 |
#include<iostream>
using namespace std;
int N_MAX=200000;
typedef long long ll;
int main()
{
int n,i,j,x=0,s=0;
int a[N_MAX];
ll res=0;
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
for(i=0,j=0;i<n;i++){
for(;j<n;j++){
if(x!=s)
break;
x^=a[j];
s+=a[j];
}
if(x==s)
j=... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i*i <= x; i++) {
if (x % i == 0) return false;
}
return t... | 0 | 20,255,290 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
while(true){
int H,W;
cin >> H >> W;
if(H == 0 && W == 0){
break;
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i == 0 || i == H-1 || j == 0 || j == W... | #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 main(){
ll n;
cin>>n;
if(n%2==1){
cout<<0<<endl;
return 0;
}
n/=2;
ll ans=0;
... | 0 | 70,833,475 |
#include <iostream>
#include <vector>
using namespace std;
char map[20][20];
int W, H;
int sh, sw;
int dw[4] = {-1, 0, 1, 0};
int dh[4] = {0, 1, 0, -1};
int cnt;
void print_map(){
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cout << map[i][j];
}
cout << endl;
}
}
void solve(int w, int h... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
#define REP(i,a,b) for(in i=(in)(a);i<(in)(b);i++)
const double PI=3.14159265358979323846;
const in MOD = 998244353;
const in INF=1e18+7;
const in inf=1e9+7;
using P=pai... | 0 | 69,860,591 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int H,W;
string maze[2005];
vector<vector<int>> Up;
vector<vector<int>> Right;
vector<vector<int>> Down;
vector<vector<int>> Left;
void R(){
for(int i=0;i<H;++i){
int cur=0;
for(int j=0;j<W;++j){
if(maze[i][j]=='#'... | #include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<climits>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<cst... | 0 | 16,804,873 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | #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 = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 0 | 78,268,022 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | #include<iostream>
using namespace std;
int main(void){
string s;
cin >> s;
int cnt[3] = {0};
for (int i = 0; i < s.length(); i++)
{
if(s[i] == 'a'){
cnt[0]++;
}else if(s[i] == 'b'){
cnt[1]++;
}else if(s[i] == 'c'){
cnt[2]++;
}
... | 0 | 15,783,136 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 2e5 + 100... | 0 | 96,760,967 |
#include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
unsigned long N;
cin >> N;
deque<bool> A(2 * N);
{
deque<bool> B(2 * N);
string S;
cin >> S;
for(unsigned long i = 0; i < 2 * N; ++i)B[i] = S[i] & 1;
A[0] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> vec(n);
rep(i,n) {
cin >> vec.at(i);
}
vector<int> vec_2 = vec;
sort(vec_2.begin(), vec_2.end(), std::greater<int>());
rep(i, n){... | 0 | 30,139,796 |
#include <iostream>
#include <string>
using namespace std;
void solve()
{
string s;
cin >> s;
for (int i = 0; i < 4; ++i)
{
cout << s[i];
}
cout << " ";
for (int i = 4; i < s.size(); ++i)
{
cout << s[i];
}
cout << endl;
}
int main()
{
solve();
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 70,239,142 |
#include <iostream>
#include <vector>
#include <cmath>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
using namespace std;
typedef long long ll;
int main()
{
int n; cin >> n;
int ans = 0;
int highest = 0;
vector <ll> H(n, 0);
for (int i = 0; i < n; i ++){
cin >> H.at(i);
}
for (auto h: ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<P,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(... | 0 | 74,934,271 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s.find("YAKI")==0 ? "Yes": "No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
int ans1 = 0, ans2 = 0, ans = 1000;
for (int i = 0; i < vec.size(); ++i) {
ans1 += vec[i];
for (int j = i + 1; j < vec.size()... | 0 | 26,324,348 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
ll N;
... | #include <bits/stdc++.h>
using namespace std;
void chmax(int& a, int b) {
if (a < b) a = b;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> leftbound;
leftbound.push_back(0);
leftbound.push_back(0);
char temp = S[0];
for (int i = 0; i < N; i++) {
if (S[i] != temp) {
... | 0 | 68,851,313 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int selectionSort(vector<int>& A) {
int cnt = 0;
for (auto i = 0; i < A.size() - 1; i++) {
int mini = i;
for (auto j = i; j < A.size(); j++) {
if (A[j] < A[mini]) {
mini = j;
}
... | #include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 71,345,758 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pop_b pop_back
#define pf push_front
#define pop_f pop_front
typedef long long ll;
typedef pair<ll,ll> ii;
typedef long double ld;
typedef vector<int> vi;
#define error(args...) { string _... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n, p;
string s;
cin >> n >> p >> s;
long long res = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < n; i++) {
if ((s[i] - '0') % p == 0) {
res += i + 1;
}
... | 0 | 23,401,229 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
cin >> n >> a;
n = n - ((n / 500) * 500);
if (n <= a) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
int n;
string s;
cin >> n >> s;
string tmp[4]={"SS","SW","WS","WW"};
REP(i,4) {
FOR(j,2,n) {
if((s[j-1] == 'o') ^ (tmp[i][j-1] == 'S') ^ (tmp[i... | 0 | 99,492,351 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(13);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define int long long
#define double long... | 0 | 45,253,336 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double l;
while(cin>>l){
double x=l/3.0;
double ans=pow(x,3);
cout << fixed<<setprecision(9) << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int mxN=1e5+1;
vector<string>op(mxN);
vector<char>ans;
signed main(){
int n;
cin>>n;
int a,b;
cin>>a>>b;
for(int i=a;i<=b;i++){
if((i%n)==0)
{
cout<<"OK"<<endl;
return 0;
}
}
... | 0 | 22,223,958 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,v,p;
ll m;
cin>>n>>m>>v>>p;
ll a[n];
rep(i,0,n) cin>>a[i];
sort(a,a+n);
int b=0;
int c=n-p;
while(c>b){
int d=(b+c)/2;
int e=uppe... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> a(n), b(n);
map<int, long long> m;
rep(i, n) {
cin >> a[i] >> b[i];
m[a[i]] += b[i];
}
... | 0 | 28,641,192 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
using namespace std;
typedef long long ll;
int main(void){
ll n, a[100010];
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
ll ans = 0, mn = 2;
ans += a[0] - 1;
for (int i = 1; i < n; i++) {
if (a[i] == mn) m... | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int xi;
vector<int> X(n);
float S = 0.;
for (int i=0; i<n; i++){
cin >> X[i];
S += X[i];
}
int mu = round(S / n);
int dis... | 0 | 96,649,338 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define fast_io ios_base::sync_wi... | 0 | 64,466,864 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A, B,C,D;
cin >> A >> B >> C >> D;
if(A>B){
swap(A,B);
}
if(B>C){
swap(B,C);
}
if(C>D){
swap(C,D);
}
if(B>C){
swap(B,C);
}
if(A>B){
swap(A,B);
}
if(A==1 && B==4 && C==7 && D==9){
cout << "YES" << endl;
}
else... | #include <algorithm>
#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 ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >>... | 0 | 16,575,739 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.