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;
int read_int(int n) {
int s = 0;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
s = 10 * s + m;
}
return s;
}
int p, q;
int cnt_p, cnt_q;
int cnt = 0;
void func(int s, vector<int> a) {
if (a.size() == 0) {
cnt++;
i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | 0 | 1,525,362 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 49,631,677 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
bool to_mid[N+1] = {}, to_n[N+1] = {};
int a, b;
rep(i, M) {
cin >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int A, B;
cin >> A >> B;
int ans = -1;
for (int i=1; i<=1009; i++) {
int a = (i * 8) / 100;
int b = (i * 10) / 100;
if ((a == A) && (b == B)) ... | 0 | 51,169,706 |
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w; cin >> h >> w;
vector<string> s(h);
vector<vector<bool>> visited(h, vector<bool>(w));
rep(i,h) c... | 0 | 37,145,180 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <iterator>
#include <math.h>
#include <list>
#include <bits/stdc+... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string from,to;
cin>>from>>to;
int f[from.size()+1][to.size()+1];
for(int i=0;i<from.size()+1;i++){
for(int j=0;j<to.size()+1;j++){
f[i][j]=0;
}
}
for(int i=1;i<from.size()+1;i++){
f[... | 0 | 53,286,469 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
int a[101]={0};
int i,j,minj;
int cut=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n;i++){
minj=i;
for(j=i;j<n;j++){
if(a[j]<a[minj]){
minj=j;
}
}
if(minj!=i){
swap(a[i],a[minj]);
cut++;
}
}
for(i... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <numeric>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
templ... | 0 | 74,893,708 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vs... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define fastIO ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("ss... | 0 | 73,413,681 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
void test()
{
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = INT_MIN;
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
{
ans = max(ans, ... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline b... | 0 | 79,360,725 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
map<ll, ll> m;
rep(i, n) {
ll a, b;
cin >> a >> b;
m[a] += b;
}
ll cnt = 0;
for (auto e : m) {
cnt += e.secon... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define... | 0 | 65,624,166 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < m; i++) {
long long x;
cin >> x;
sum += x;
if (sum > n) {
cout << -1;
return 0;
}
}
cout << n - sum;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const ll mod =1e9+7;
int main() {
string l;
cin>>l;
ll n=l.size();
vector<vector<ll>> dp(n,vector<ll>(2));
dp[0][1]=1;
dp[0][0]=2;
rep(i,n-1){
if(l[i+1... | 0 | 50,960,310 |
#include<iostream>
using namespace std;
struct node
{
int p,l,r;
};
const int MAX=100005;
int D[MAX];
void print(node A[],int u){
cout<<"node "<<u<<": ";
cout<<"parent = "<<A[u].p<<", ";
cout<<"depth = "<<D[u]<<", ";
if(A[u].p==-1)cout<<"root, ";
else if(A[u].l==-1)cout<<"leaf, ";
else cout<<"interna... | #include <cstdint>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define SIZE 10000
static vector<uint32_t> graph[SIZE];
static vector<uint32_t> connected_num(SIZE, 0);
static queue<uint32_t> q;
static vector<uint32_t> sorted;
int32_t main()
{
uint32_t V, E;
cin >> V >> E;
for (uint3... | 0 | 88,034,399 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
if(n % 3 == 0){
cout << n / 3 << endl;
}else{
n /= 3;
cout << m... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll N,K;
cin>>N>>K;
vector<ll>vec(N);
for(ll i=0;i<N;i++){
cin>>vec.at(i);
}
vector<ll>voc(N,1);
for(ll i=0;i<K;i++){
ll a,b;
cin>>a>>b;
if(vec.at(a-1)>=vec.at(b-1)){
voc.at(b-1)=0;
... | 0 | 75,416,469 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using ll=long long;
int main() {
int N,M; cin>>N>>M;
priority_queue<int> q;
for (int i = 0; i < N; i++){
int A; cin>>A;
q.push(A);
}
for (int i = 0; i < M; i++){
if(q.size()){
int tmp=q.top();
... | 0 | 25,282,700 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int a, b;
cin >> a >> b;
int... | #include <bits/stdc++.h>
using namespace std;
vector<long long> rbd(vector<long long> mat) {
int n = mat.size();
int rk = 0;
for (int i = 60; i >= 0; i--) {
bool exist = false;
for (int j = rk; j < n; j++) {
if (mat[j] >> i & 1) {
exist = true;
swa... | 0 | 4,749,849 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll e = (c*d)/__gcd(c,d);
ll n = b-a+1;
ll n_cid,n_c,n_d;
if(a%e==0) n_cid = (b/e - a/e)+1;
else n_cid = b/e - a/e;
if(a%c==0) n_c = (b/c ... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... | 0 | 74,780,299 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main()
{
string s;
cin >> s;
int a(0), b(0) ;
rep(i,3)
{
if(s.at(i)=='A')
{
a++;
}
else
{
b++ ;
}
}... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <list>
#include <cmath>
#include <stack>
#include <iomanip>
using namespace std;
typedef long long ll;
using Pll = pair<ll,ll>;
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int main... | 0 | 78,763,951 |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define PI 3.141592653589793238
#define pq priorit... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string ansS;
{
int memo = 0;
int minmemo = 0;
for (int i = 0; i < S.size(); ++i) {
if ('(' == S[i]) {
memo++;
}
else {
memo--;
}
minmemo = min(memo, minmemo);
}
for (int i = 0; i < (-1 ... | 0 | 88,478,076 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n;
cin>>n;
vector<int> a(n);
... | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 0 | 73,920,393 |
#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);
voi... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
int i=0,n;
int num[6]={0};
int top,front;
for(i=0;i<6;i++){
cin >>num[i];
}
cin ... | 0 | 22,577,993 |
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
string num = "0123456789";
int ctoi(char c){
stringstream ss;
int n;
ss << c;
ss >> n;
return n;
}
string itos(int n){
stringstream ss;
string s;
ss << n;
ss >> s;
return s;
}
int mcxitoi(string s){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
class Die {
public:
Die(vector<int> numbers) {
vertical_ = vector<int>(4);
horizontal_ = vector<int>(4);
vertical_[0] = numbers[0];
vertical_[1] = numbers[4];
vertical_[2] = numbers[5];
vertical_[3] = numb... | 0 | 55,763,760 |
#include <iostream>
#include <stdio.h>
int main(){
int W,H,x,y,r,w,h;
std::cin >> W;
std::cin >> H;
std::cin >> x;
std::cin >> y;
std::cin >> r;
w=W-r;
h=H-r;
if(r<=x && x<=w && r<=y && y<=h)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 0 | 30,181,777 |
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,avx2,popcnt")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int maxn = 1<<19, mod = 1e9 + 7;
int main() {
cin.tie(0)->sync_with_stdio(0);
ll n, p, a... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_S = 100100;
int main()
{
int n; cin >> n;
... | 0 | 49,032,364 |
#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... | #include <iostream>
#include <stack>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A < B)
{
int temp = A;
A = B;
B = temp;
}
int r = A % B;
while (r != 0)
{
A = B;
B = r;
r = A % B;
}
stack<int> fgc;
for... | 0 | 35,864,796 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t H,W;
cin >> H >> W;
if (W==1 || H ==1){
cout << 1 << endl;
}
else if (H%2==1 && W%2==1){
cout << W*(H/2)+W/2+1 << endl;
}
else {
cout << H*W/2 << endl;
}
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
using ll = long long;
using ld = ... | 0 | 22,991,158 |
#include <iostream>
using namespace std;
#pragma warning (disable: 4996)
long long mod = 1000000007;
long long N, K, A[100009], B1, B2;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (A[i] > A[j]) B1++;
}
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<... | 0 | 15,464,068 |
#include <iostream>
#include <stdlib.h>
#include <cstring>
using namespace std;
int main() {
char num[1000];
int sum;
int int_num;
while (cin >> num) {
if ((int)num[0] - (int)'0' == 0) {
break;
}
sum = 0;
for (int i = 0; i < strlen(num); i++) {
sum += (int)num[i] - (int)'0';
}
cout << sum << endl;... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0 ; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007;
void solve(){
int n ;
cin>>n ;
string s ;
cin>>s ;
if(n%2!=0)
{
cout<<"No" ;
return ;
}
string t=s.substr(n/2) ;
t=t+t ;
if(s==t){
cout<<"Yes" ;
}
else{
cout... | 0 | 12,295,631 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define debug(x) (cout << # x ": " << x << endl)
#define ll long long int
#define repeat(n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
int main() {
int n, m;
cin >... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long
#define mpr make_pair
typedef long long ll;
#pragma GCC optimize("Ofast")
const int maxn = 1e6+10;
const int mod = 998244353;
const int inf = 1e18+10;
int n;
int a[maxn];
signed main()
{
cin>> n;
int sm = 0, m =... | 0 | 27,650,164 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
#define PB push_back
#define MP make_pair
void Input();
void Calc();
void Output();
int N=100;
int dp[100][100];
vector<int> ivr;
int n,x;
int main(int argc,char* argv[]){
memset(dp,15,sizeof(dp));
for(i... | 0 | 20,581,302 |
#include <iostream>
#include <string>
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 0, 19) {
if(i == 5 || i == 13) cout << " ";
else cout << s[i];
}
cout << "\n";
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 0 | 22,932,491 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define setpr... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 4,181,542 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
vector<int> a(6);
rep(i, 6) cin >> a[i];
vector<int> ans(4);
rep(i, 6) ans[a[i]-1]++;
bool b = true;
rep(i, 4) {
if (ans[i] == 3) b = false;
}
if (b) cout << "YES" << endl;
else cout << "NO" << endl;... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | 0 | 88,485,201 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | /*
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ... | 0 | 75,455,402 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vbool = vector<bool>;
using vvbool = ... | #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, n, m) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main()
{
int N, H, W;
cin >> N >> H >> W;
... | 0 | 69,929,847 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
bool ans=true;
while(n>0){
if(n>4&&s.at(n-5)=='d'&&s.at(n-4)=='r'&&s.at(n-3)=='e'&&s.at(n-2)=='a'
&&s.at(n-1)=='m'){
n-=5;
continue;
}
if(n>4&&s.at(n-5)=='e'&&s.at(n-4)=='r'&&s.at(n-3)==... | #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 | 67,796,256 |
#include<iostream>
using namespace std;
int main()
{
int a,b,s;
cin>>a>>b;
s=a+b;
if(s%2==0){cout<<s/2;}
else{cout<<(s/2)+1;}
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 24,714,615 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
ll ans;
void solve(ll a,ll b)
{
if(a<b) swap(a,b);
if(!b){ans+=a;return ;};
ll cnt=a%b?a/b:a/b-1;
ans+=cnt*b*2;
solve(b,a%b);
}
int main()
{
ll N,X;scanf("%lld %lld",&N,&X);
ans+=N;
solve(X,N-X);
printf("%lld\n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 24,672,068 |
#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<bits/stdc++.h>
using namespace std;
int main(void){
string s,t;cin>>s>>t;
int n=s.length(),c,p=0;
char x[n+1],y[n+1];
strcpy(x,s.c_str());
strcpy(y,t.c_str());
while(p<n-1){
for(int i=0;i<n;i++){
if(x[i]!=y[i])
break;
if(i==(n-1)){
cout<<"Yes"<<endl;return 0;
}}
for(int i=0;i<n;i++)... | 0 | 70,452,915 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX =510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2; i<MAX; i++){
fac[i]=fac[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD... | 0 | 34,637,128 |
#include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
ll A, B, M;
cin >> A >> B >> M;
vector<ll> a(A+1), b(B+1);
ll mn_a = pow(10,6), mn_b = pow(10,6);
for(ll i=1; i<=A; ++i){
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, maxn = 0, maxcnt = 0, cnt, tempi;
cin >> n;
if (n == 1)
{
cout << 1 << endl;
return 0;
}
for (int i = 1; i <= n; i++)
{
cnt = 0;
tempi = i;
while (tempi % 2 == 0)
{
t... | 0 | 72,394,853 |
#include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(1)
{
int n,score=10000000;
vector<int> a;
cin >> n;
if(n == 0) exit(0);
for(int i = 0 ; i < n; i++)
{
int tpn;
... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 0 | 62,707,984 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n, m, d;
cin >> n >> m >> d;
double exp = 1;
if(d != 0 && n > 2 * d) exp = 2 * (n-d) / n;
exp = exp / n * (m-1);
cout << fixed << setprecision(10) << exp << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000000000000000;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, ... | 0 | 99,421,760 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef pair<ll , ll> lli;
typedef vector<ii> vii;
typedef vector<il> vil;... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
int main(){
cin.t... | 0 | 50,577 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define pll pair<ll,ll>
#define pii pair<ll,ll>
#define all(s) s.begin(),s.end()
#define vll vector<ll>
#define vi ... | #include "bits/stdc++.h"
#include <unordered_set>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb... | 0 | 99,011,148 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
signed main() {
int n,a,b;
int num;
int ans ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const int INFI = 1000000000;
const ll INFL = (1LL << 60);
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) ... | 0 | 27,884,174 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> temp(n);
for(int& i:temp)
cin>>i;
int ans=0;
sort(temp.begin(),temp.end());
for(int i=0;i<k;i++){
ans+=temp[i];
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
vector<int> key(n,0);
int push = 1;
int count = 0;
while(1){
if(push == 2){
break;
}else if(key.at(push-... | 0 | 13,558,705 |
#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>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 89,355,233 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e5 * 2 + 10;
typedef long long ll;
ll st[N];
int vis[N];
int main()
{
ll n,a,p;
cin >> n >> a >> p;
memset(vis,-1,sizeof vis);
int i = 0;
ll j = a;
for(i = 0, j = a; vis[j] == -1; i ... | 0 | 72,182,225 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | #include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1e4 + 100;
int n;
long long x[maxn], y[maxn];
long long Abs(long long x) { return x < 0 ? -x : x;}
int main()
{
cin>>n;
int k = 0;
for(int i = 1; i <= n; i++){
cin>>x[i]>>y[i];
long long ax = Abs(x[i]), ay = Abs(y[i]... | 0 | 45,722,759 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a, b, x;
int ans[10000];
for(int i = 0; i <= 10000; i += 2){
cin >> a >> b;
if(a > b){
x = a;
a = b;
b = x;
}
ans[i] = a;
ans[i+1] = b;
if((a == 0) && (b == 0)){
break;
}
}
for(int j = 0; j <= 10... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int S=0;
for (int i=0; i<N; i++) {
cin >> A.at(i);
S+=A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int B;
if (S%(4*M)==0) {
B = S/(4*M);
}
else {
B = S/(4*M)... | 0 | 38,906,300 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define INF 1e9
int main(){
int N, K;
cin >> N >> K;
ll t, d;
vector<ll> A, king(N, -1);
int cnt = 0... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using Graph = std::vector<std::vector<intt>>;
Graph G;
int main() {
intt N; std::cin >> N;
for (intt i = ... | 0 | 57,732,048 |
#include <stdio.h>
int main(void){
double a, b;
scanf("%lf %lf", &a, &b);
printf("%d %d %f\n", (int)a / (int)b, (int)a%(int)b, a / b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
string s;
bool is_parindrome(string &dropped) {
int l = 0;
int r = dropped.size() - 1;
while (l <= r) {
if (dropped[l] != dropped[r]) {
return false;
}
l += 1;
... | 0 | 86,502,116 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
int u,v;
ll ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
ans+=1ll*i*(n-i+1);
}
for(int i=1;i<=n-1;i++)
{
scanf("%d%d",&u,&v);
if(u>v) swap(u,v);
ans-=1ll*u*(n-v+1);
}
printf("%lld",ans);
} | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
#define N 200000000
#define INF 200000001
int size;
int h[N];
void swap(int *a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void maxHeapify(int i) {
int l = 2*i;
int r = 2*i+1;
int valM;
if ( l <= size && h[l] > h[i] ) valM = l... | 0 | 86,488,659 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#de... | #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
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
ll dx[8] =... | 0 | 89,879,205 |
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define chmin(x,y) x = min(x, y)
#define chmax(x,y) x = max(x, y)
vector<int> dx = {... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 38,087,240 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main() {
int H,W,A,B;
cin >> H >> W >> A >> B;
REP(y,H) {
REP(x,W) {
string c = ( ((x >= A) && (y < B)) || ((x < A) && (y >= B)) ) ? "1" : "0";
cout << c;
}
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const int INF = INT_MAX / 2;
int main(){
int N; cin >> N;
string s, t; cin >> s >> t;
for (int i = 0; i < N; i++)
{
if(s.substr(i, N-i) == t.substr(0, N-i)){
s += t.substr(N-i, i);
... | 0 | 83,952,863 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
const int inf = 1e18 + 9;
int a[N], pre[N], suf[N], sum[N];
signed main()
{
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
if(a[i] > 0)
pre[i] = pre[i - 1] + a[i];
e... | 0 | 33,212,926 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
long long twoPrev = 2;
long long prev = 1;
long long ans = 1;
for(int i = 2; i <= n; i++) {
ans = prev + twoPrev;
twoPrev = prev;
prev = ans;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | 0 | 76,156,155 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
const int Nmax = 2e5;
int N;
ll A[Nmax], B[Nmax];
int main(){
cin >> N;
for(int i=0; i<N; i++) cin >> A[i] >> B[i];
ll sum = 0;
bool sa... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<iomanip>
#include<sstream>
#include<cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#define rrep(i,n) for(int i = n -1;i ... | 0 | 100,341,474 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | #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>;
const int inf{int(1e9)};
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {... | 0 | 97,068,820 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;cin>>N>>A;
int ans;
ans=N%500;
if(ans<=A){
cout<<"Yes"<<endl;
}
else if(N<=A){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 26,370,403 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
double x[4],y[4];
cin >> n;
while(n--){
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
y[1]-=y[0];
x[1]-=x[0];
y[3]-=y[2];
x[3]-=x[2];
if(fabs(y[1]*x[3] - y[3]*x[1]) < 10e-12)cout << "YES";... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | 0 | 13,345,497 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
cin >> s;
for (int i = 0; i < s.size(); i += 2)
t += s.at(i);
cout << t << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
int main(){
vector<int>a(5),b(5),c(5);
rep0(i,5){
cin>>a[i];
b[i]=a[i]%10;
... | 0 | 8,337,556 |
#include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(long long i = 0; i < (n); i++)
using namespace std;
int main()
{
const long long INF = 100000000;
long long N, M, R, ans = INF;
cin>>N>>M>>R;
vector<long long>r(R);
rep(i,R){
cin>>r[i];
--r[i];
}
vec... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb em... | 0 | 95,652,712 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N; cin >> N;
ll a[N], b[N];
rep(i,... | #include <cmath>
#include <iostream>
#include <vector>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int div_count(int n) {
vector<int> v;
for (int i = 1; i <= sqrt(n); ++i) {
if (n % i == 0) {
int d = n / i;
v.push_back(i);
if (i != d) {
v.push_back(d);
}
... | 0 | 81,857,546 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<pair<ll,ll>> a(n);
for(int i = 0;i < n;i++)cin >> a[i].... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
typedef vector<int> v_int;
typedef vector<lld> v_lld;
typedef vector<llu> v_llu;
typedef pair<int, int> p_int;
typedef pair<lld, lld> p_lld;
#define INDEPENDENT_CASES() cin >> (T3X0); T353 = T3X0; while(T3X0-... | 0 | 84,385,358 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<utility>
#include<cmath>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void sort(int &a,int &b)
{
if(a... | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#def... | 0 | 4,951,500 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
using vi = vector<int>;
using vll =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int p[N];
for(int i=0;i<N;i++){
cin >> p[i]; p[i]--;
}
int a[N];
int b[N];
int r[N];
for(int i=0;i<N;i++){
r[p[... | 0 | 32,926,203 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) ... | 0 | 9,579,547 |
#include <iostream>
int main()
{
int distance, time, speed;
std::cin >> distance >> time >> speed;
if (distance <= time * speed)
{
std::cout << "Yes" << std::endl;
}
else
{
std::cout << "No" << std::endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define very_slow ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb ... | 0 | 62,134,960 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... | 0 | 73,338,837 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll A, B;
ll f(ll x) {
ll ans = 0;
x++;
for (int i = 0; i < 41; i++) {
ll loop_cnt = (1LL << (i + 1));
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >>n;
vector<ll> a(n), b(n);
ll suma=0, sumb=0;
for(int i=0; i<n; i++){
cin >> a[i];
suma += a[i];
}
for(int i=0; i<n; i++){
cin >> b[i];
sumb += b[i];
}
if(suma<sumb)... | 0 | 97,059,542 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(200000);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
v.at(A - 1)++;
}
sort(v.begin(), v.end());
int ans = 0;
for ... | #include <stdio.h>
int main(){
char str[25];
scanf("%[^\n]", str);
for (int i=0; str[i] != '\0'; i++){
if (i == 5 || i == 13){
printf(" ");
}
else
{
printf("%c", str[i]);
}
}
return 0;
} | 0 | 32,554,549 |
#include <bits/stdc++.h>
template <class T>
T root(std::vector<T>& v, T x) {
return v[x] - x ? (v[x] = root(v, v[x])) : x;
}
template <class T>
bool same(std::vector<T>& v, T x, T y) { return root(v, x) == root(v, y); }
template <class T>
void unite(std::vector<T>& v, T x, T y) {
x = root(v, x);
y = root(v,... | #include <iostream>
#include <queue>
using namespace std;
int main(){
bool adj[100][100]={};
int d[100]={};
int n,u,v,k;
cin >> n;
for (int i=0; i<n; i++){
cin >> u >> k;
for (int j=0; j<k; j++){
cin >> v;
adj[u-1][v-1] = true;
}
}
queue<int> q;
bool pushed[100]={};
q.push(1);
... | 0 | 14,076,366 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include<iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <cmath>
using namespace std;
long long keta;
string ans;
int getDigit(vector<int> digits){
int digitLow = -1;
if (digits.size()== 0){
digitLow = 0;
}
int digitHigh = 9;
int j;
while (digitL... | 0 | 65,452,820 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000+5;
const int mod = 1000000007;
char maze[maxn][maxn];
long long dp[maxn][maxn];
int main(int argc, char const *argv[])
{
int n, m; scanf("%d %d\n", &n, &m);
memset(dp, 0, sizeof dp);
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
scanf... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 56,635,420 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 1; i < s.size(); ++i)
{
int sz = s.size() - i;
if (sz % 2 != 0)
continue;
if (s.substr(0, sz / 2) == s.substr(sz / 2, sz / 2)){
cout << sz;
break;
... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long ll;
using namespace std;
const int INF = 1<<29;
struct Edge
{
int to;
ll cost;
};
using Graph = vector<vector<Edge>>;
set<pai... | 0 | 68,354,805 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N,M;
cin >> N >> M;
vector<ll... | 0 | 36,121,138 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int N, K;
vector<int> A, B;
ll solve(int x) {
if (!(K & (1 << x))) return 0;
int f = (1 << x) - 1;
for (int i = x + 1; i <= 30; ++i)
f |= (K & (1 << i));
ll tmp = 0;
for (int i = 0; i < N; ++i)
if (... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 45,589,450 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
scanf("%lld%lld%lld", &n, &a, &b);
long long full = n / (a + b);
long long res = full * a + min(a, n - full * (a + b));
printf("%lld\n", res);
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) sw... | 0 | 65,139,575 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 3,103,827 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | 0 | 90,973,776 |
#include <iostream>
#include <math.h>
#include <algorithm>
#define ll long long
#define DIV 1000000007
using namespace std;
int s;
ll dp[2001], p[2001];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> s;
dp[3] = 1, p[3] = 1;
dp[4] = 1, p[4] = 2;
dp[5] = 1, p[5] = 3;
for (int i = 6; i <= s; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 11,338,450 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1000000007;
int main(){
int n,k;
cin>>n>>k;
if(n%k==0) cout<<"0"<<endl;
else cout<<"1"<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
... | 0 | 45,040,054 |
#include <stdio.h>
#include <iostream>
#include <math.h>
int main(){
int n, num;
while(scanf("%d", &n)!=EOF){
num = 0;
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
for(int k=0; k<10; k++){
for(int l=0; l<10; l++){
if(i+j+k+l==n) num++;
}
}
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<bool> GetSums(const vector<int> &nums, int k, int ignore)
{
vector<bool> valid(k, false);
for (size_t i = 0; i < nums.size(); i += 1) {
if ((int)i == ignore) {
continue;
}
for (int j = k - ... | 0 | 70,044,342 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | #include<iostream>
int a = 0 , b = 0 , c = 0 , i = 0 , j = 0 ;
int main()
{
std::cin >> a >> b >> c ;
for(;i == 0;)
{
i = 1 ;
if(a > b)
{
j = a ;
a = b ;
b = j ;
i = 0 ;
}
if(b > c)
{
j = b ;
b = c ;
c = j ;
i = 0 ;
}
}
std::cout << a << " " << b << " " << c << std::endl ;
} | 0 | 56,153,566 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main() {
int a,b;
cin>>a>>b;
a>b?cout<<"safe":cout<<"unsafe";
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 29,595,456 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> H(N);
for(int i=0; i<N; i++){
cin>>H[i];
}
int ans = 1;
int h = H[0];
for(int i=1; i<N; i++){
if(h<=H[i]){
ans++;
h = H[i];
}
}
cout<< ans <<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007;
int main() {
ll N,D,A;
... | 0 | 69,845,414 |
#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 <... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 71,589,180 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 85;
int main() {
int n;
cin >> n;
vector <int> a(n);
for(int i=0; i<n; i++) scanf("%d", &a[i]);
ll cash = 1000;
for(int i=1; i<n; i++) {
if(a[i] > a[i-1]) {
ll x = cash / a[i-1];
cash += x * (a[i... | #include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i, start, end) for(int i = (start); i < (end); ++i)
#define REP(i, n) FOR(i, 0, n)
constexpr double ROOT3 = 1.7320508075... | 0 | 61,239,142 |
#include <iostream>
#include <utility>
#include <queue>
using namespace std;
typedef pair<int,int> P;
P a;
priority_queue< int > pq;
int n;
string s;
int main(){
while(1){
cin >>s;
if(s=="insert"){
cin >>n;
pq.push(n);
}else if(s=="extract"){
cout <<pq.top() <<endl;
pq.pop();
}else if(s=="end"){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | 0 | 23,819,915 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
string a;
int ans = 0;
cin >> a;
if (a.at(0) == 'S') {
ans = 0;
if (a.at(1) == 'R') {
ans = 1;
if (a.at(2) == 'R') ans = 2;
} else {
if (a.at(2) == 'R') ans = 1;
... | #include <bits/stdc++.h>
#include <algorithm>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b) {
if(a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
ll n,... | 0 | 22,381,455 |
#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 len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout<<n<<endl
const int M=100111;
con... | 0 | 8,926,737 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
cout << N + T / 2 << endl;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>... | 0 | 75,325,991 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a , b ;
cin>>a>>b;
int t=0 , n;
for (int x=0 ; x<=a ; ++x)
{
for (int y=0 ; y<=a ; ++y)
{
n=b-x-y;
if (n>=0&&n<=a)
{
t+=1;
}
}
}
cout<<t<<endl... | 0 | 49,558,689 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <iomanip>
using namespace std;
#define SORT(v... | 0 | 81,674,098 |
#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 h, w, k;
cin >> h >> w >> k;
vector<string> v(h);
rep(i, h) cin >> v[i];
int ans = 0;
rep(is, 1... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define powerof2 ()
#define mp make_pair
#define pi acos(-1)
using ll = long long;
const ll M = 1000000007;
const ll M1= 998244353;
const int height=40;
using vl = vector<ll>;
using pll = pair<ll,ll>;
ll power(ll x,ll y)... | 0 | 94,089,065 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> vec(n,0);
vector<int> comp(n-1,0);
for(int i=0;i<n;i++){
cin >>vec.at(i);
}
sort(vec.begin(),vec.end());
for(int i=0;i<n-1;i++){
comp.at(i)=vec.at(i+1)-vec.... | #include <iostream>
#include <vector>
using namespace std;
long long int countP(vector<long long int>& num_level, vector<long long int>& pnum, int level, long long int x){
long long int ans = 0;
if(num_level[level] == x){
ans = pnum[level];
}else{
if(x-num_level[level-1]-2 > 0){
... | 0 | 83,335,901 |
#include<bits/stdc++.h>
#include<cstring>
typedef long long ll;
#define ull unsigned long long
#define pb push_back
#define ff first
#define ss second
#define all(v) (v.begin(), v.end())
#define pi acos(-1.0)
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define bug(a) cerr << #a << " : " << a ... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int a[500000],b[500000],n;
long long sums,ans;
int main()
{
scanf("%d",&n);
long long sums = 0;int tmp;
for(int i=0;i<n;++i){
scanf("%d",&tmp);++a[tmp-1];
}
vector<int> vn;
sort(a,a+n);reverse(a,a+n);
int j = n-1;
... | 0 | 50,301,661 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <iomanip>
#include <map>
#include <stack>
#include <sstream>
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
using namespace std;
con... | #include <bits/stdc++.h>
using namespace std;
long int Min(long int a, long int b);
long int Max(long int a, long int b);
long int Min(long int a, long int b){
return a > b ? b : a;
}
long int Max(long int a, long int b){
return a < b ? b : a;
}
int main() {
long int w,h, wh, div3;
long int max0, min0, max... | 0 | 80,783,604 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inlin... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;... | 0 | 48,809,175 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.