code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <cstdio>
#include <bitset>
#include <cmath>
#include <complex>
#include <vector>
#include <algorithm>
#include <stack>
#define EPS 1e-6
using namespace std;
typedef complex<double> coor;
double cross(coor a, coor b)
{
return a.real() * b.imag() - a.imag() * b.real();
}
double dot(coor a, coor b)
{
return a... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n; cin >> n; int x[n], y[n], xy[2]={0,0};
for(int i=0; i<n; i++) {
cin >> x[i] >> y[i];
xy[(x[i]+y[i])%2]=1;
}
if (xy[0] && xy[1]) {cout << -1 << endl; return 0;}
vector<int> v;
if (xy[0]) v.push_back(1);
for(int i=1<<30; i>0; i>>=1) ... | 0 | 58,304,191 |
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(void) {
string sentence;
getline(cin, sentence);
for (int i = 0; i < sentence.length(); i++) {
int ascii = (int) sentence[i];
if (65 <= ascii && ascii <= 90)
sentence[i] += 32;
if (97 <= ascii && ascii <= 122)
sentence... | #include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<i... | 0 | 65,188,012 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define fo(i,a,n) for (i = a; i <= n... | #include <bits/stdc++.h>
#define ll long long
#define rep(X,N) for(ll X = 0; X < (N); X++)
#define bitrep(X,N) for(ll X = 0; X < (1 << (N)); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(),(V).end()
using namespace std;
int main(){
int... | 0 | 14,623,767 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
int main()
{
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
vector<int> score(n);
for (int i = 0; i < n; i++) {
cin >> s... | #include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a... | 0 | 27,295,342 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int W, H, ans;
string maze[20];
bool check(int x, int y){
return x >= 0 && x < W && y >= 0 && y < H && maze[y][x] == '.';
}
void dfs(int x, int y){
for(int i = 0; i < 4; ++i){
int nx = x ... | #include <bits/stdc++.h>
#define check(x) cout<<(#x)<<": "<<x<<" ";
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ld long double
#define all(c) (c).begin(), (c).end()
#define FOR(i, a, b) fo... | 0 | 34,822,508 |
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n, k;
cin >> n >> k... | 0 | 35,887,029 |
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main() {
int m, ans = 0, bad = 0;
int popp;
string n;
cin >> n;
for(int i = 0;i < n.size();i++){
popp = n[i] - '0';
ans += (popp != (i % 2));
bad += (popp == (i % 2));
}
cout << min(ans, bad);
return 0;
} | #include <iostream>
#include <queue>
#include <cstring>
#include <utility>
using namespace std;
char a[1003][1003];
int r, c;
int bfs (int n)
{
bool done[1003][1003];
int cost[1003][1003];
queue<pair<int, int>> que;
memset(done, false, sizeof(done));
done[r][c]=true;
cost[r][c]=0;
que.push({... | 0 | 71,347,231 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s; getline(cin,s);
string word;
map<string,int> dic;
for(int i=0;i<s.size();i++){
if(s[i]!=' '){
word+=s[i];
}
else{
dic[word]++;
word="";
}
}
dic[word]++;
int num=0;
for(auto it:dic) num=max(num,it.sec... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, h;
cin >> n >> h;
int ans = 0;
vector<P> p(n);
int ... | 0 | 99,446,001 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
map<int,pair<int,int>> mp;
for(int i=0;i<H;i++) {
for(int j=0;j<W;j++) {
cin >> A[i][j];
mp[A[i][j]] = make_pair(i, j);
}
}
vector<int> wa(H*W+1, 0... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int H,W;
int K;
char c[6][6+1];
int main(void){
cin >> H >> W >> K;
REP(i,H){
REP(j,W... | 0 | 81,779,262 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
int cnt = 0, prv = -1, ans = 0;
for(int i = 0; i < N; i++){
int tmp; cin >> tmp;
if(prv == tmp) cnt++;
else{
ans += cnt/2;
cnt = 1;
}
prv = tmp;
}
ans += cnt/2;
cout << ans << endl... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> t(100000), x(1000000), y(100000);
for(int i=0; i<n; i++){
cin >> t[i] >> x[i] >> y[i];
}
bool flg = true;
if(t[0] != abs(x[0]) + abs(y[0])){
flg = false;
cout << "No" << endl;
re... | 0 | 67,091,453 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt X; std::cin >> X;
std::vector<intt> a(X);
std::map<intt, intt> MAP;
for (auto& r : a) {
std::cin >> r;
++MAP[r];
++MAP[... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(... | 0 | 6,095,885 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#d... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
string s;
cin >> s;
int i;
int n = s.size();
string not_x = "";
rep(i,n)
{
if(s[i] != 'x') not_x += s[i];
}
string rev_nx = not_x;
reverse(all(rev_nx... | 0 | 35,021,839 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d[200];
bool table[200][200];
void init(){
for(int i=0;i<200;i++){
d[i]=-1;
for(int j=0;j<200;j++){
table[i][j]=false;
}
}
}
void bfs(int itr, int dis, int n){
d[itr] = dis;
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pa... | 0 | 77,616,576 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int dp[20][50001];
int c[20];
int n;
int m;
cin >> n >>m;
for(int i=0;i<m;i++) cin>> c[i];
sort(c,c+m);
for(int i=0;i<m;i++){
for(int j=0;j<=n;j++){
if(i==0) dp[i][j] = j;
else if(j==0) dp[i][j] = 0;
}
}
fo... | #include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <... | 0 | 8,877,297 |
#include <iostream>
int main(void)
{
int x, y;
std::cin >> x >> y;
while (x != 0 || y != 0) {
if (x > y) {
std::cout << y << " " << x << std::endl;
}
else {
std::cout << x << " " << y << std::endl;
}
std::cin >> x >> y;
}
return 0;
} | #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 brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | 0 | 40,168,365 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | 0 | 22,392,117 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(ll a, ll b){
if(a == b) return a;
if(b > a) return solve(b, a);
ll k = ((a-1) / b);
return solve(a - k * b, b) + 2 * k * b;
}
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, x;
cin >> n >> x;
ll ans = solve(x, ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
char c='a',d;
cin>>s;
int a,i,j;
a=s.size();
for(j=0;j<26;j++)
{
d=c;
for(i=0;i<a;i++)
{
if(s[i]==c)
{
c++;
break;
}
}
if(d==c)
{
cout<<c<<endl;
return 0;
}
}
cout<<"None"<<endl;
} | 0 | 95,135,081 |
#include<iostream>
using namespace std;
int main(){
int n, d, x, count=0;
cin>>n;
cin>>d>>x;
int a[n];
for(int i=0; i<n; i++) cin>>a[i];
for(int i=0; i<n; i++){
for(int j=0; j<d; j+=a[i]){
count++;
}
}
cout<<count+x<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<(int)(n);i++)
int main(){
string S;
cin>>S;
int l=S.size()-1;
int num=1<<l;
rep(tmp, num){
bitset<10> bits(tmp);
int this_sum=(S[0]-'0');
rep(i, l){
if(bits.test(i)){
this_sum += (S[i+1]-'0');
}
... | 0 | 67,886,804 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b;
int main(... | 0 | 29,957,519 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
typedef long long LL;
using namespace std;
LL GCD(LL x, LL y){
... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define ... | 0 | 20,981,886 |
#include<bits/stdc++.h>
#define Bye return 0
#define ll long long
using namespace std;
void solve(){
int n, m; cin>>n>>m;
vector<int> h(n), cont_got(n), cont_total(n);
for (int i=0; i<n; i++) cin>>h[i];
for (int i=0; i<m; i++){
int u, v; cin>>u>>v; u--; v--;
cont_got[u] += (h[u]>h[v]);
... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 43,228,819 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
map<int,ll> m,f;
int N;
ll X;
ll solve(int n, ll x){
if(x == 1){
if(n == 0){
return 1;
} else {
return 0;
}
}
if(x <= 1 + m[n-1]){
return solve(n-1, x-1);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | 0 | 36,098,489 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << endl;
} else {
cout << "ARC" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 25,910,467 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
int match = n;
for (int i = 0; i < n; i++) {
string ss = s.substr(i);
string tt = t.substr(0, n-i);
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll x;
cin >> x;
ll ta=x%100;
ll judge=0;
while(ta>=5){
ta-=5;
judge++;
}
if(ta>0) judge++;
if(100*judge>x){
cout << 0 << endl;
}
else {
cout << 1... | 0 | 70,483,318 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool grid[52][52];
int main() {
int H, W;
cin >> H >> W;
for (int i=1; i<=H; i++) {
for (int j=1; j<=W; j++) {
char s;
cin >> s;
if (s == '#') grid[i][j] = true;
}
}
string ans = "Yes";
for (int i=1; i<=H; i++) {
for (int j=1; j<=W... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long llint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef t... | 0 | 94,687,574 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, n) for(int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define riverse(v) reverse((v).be... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | 0 | 6,003,756 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b)... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n; cin >> n;
V<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
... | 0 | 7,874,851 |
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<random>
#include<stdio.h>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
vector<string> S(N);
for (int i=0;i<N;i++){
cin>>S[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for(int i=0; i<m; i++){
int p,y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p,y);
c[p].emplace_back(y,i);
}
for(int i=0; i<n; i++){
so... | 0 | 98,671,009 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vecto... | #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... | 0 | 21,182,079 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #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 | 92,727,848 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector <int> a;
void insert(int t) {
int k = a.size();
a.push_back(t);
while (k != 0 && a[(k - 1) / 2] < a[k]) {
swap(a[k], a[(k - 1) / 2]);
k = (k - 1) / 2;
}
}
void maxheapify(int i) {
int l = 2 * i + 1;
... | #include <iostream>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define move(i) for(int i=-1;i<=1;i+=2)
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INF 1e9
using namespace std;
using P = pair<int,int>;
int h,w,M[1010][1010],C[1010][1010],D[1010][1010];
queue<P> Q;
int main()
{
cin>>h>>w;
... | 0 | 41,622,111 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, x, m, logn, ans = 0;
cin >> n >> x >> m;
logn = ceil(log2(n)) + 1;
vector<vector<ll>> nex(logn, vector<ll>(m)), sum(logn, vector<ll>(m));
rep(i, m) {
nex[0][i] = i * i % m;... | #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | 0 | 75,105,005 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 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<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | 0 | 37,609,918 |
#include <math.h>
#include <utility>
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
while(true) {
int n;
int k;
cin >> n >> k;
if ( n == 0 ) break;
vector<int> a;
int c;
for ( int i = 0; i < n ; i++ ) {
cin >> c;
a.push_back(c);
}
c... | #include <cstdio>
#include <iostream>
using namespace std;
static const int MAX_NUM = 10001;
int FindRoot(int elem[], int target)
{
int parent;
parent = target;
for (;;) {
if (parent == elem[parent]) {
break;
}
else {
parent = elem[parent];
}
}
... | 0 | 82,024,498 |
#include <iostream>
int main()
{
int N, R;
std::cin >> N >> R;
int S;
if(10 < N) {
S = R;
} else {
S = R + 100*(10-N);
}
std::cout << S << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<i... | 0 | 1,044,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,m;
cin>>n>>m;
if(n==1 || m==1){
cout<<1<<endl;
return 0;
}
ll ans=(n*m+1)/2;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
ll sub(ll A, ll B){
if(A == 0 || B == 0){
return 0;
}
if(A > B){
return sub(B, A);
}
if(B % A == 0){
return (B / A) * 2 * A - A;
}else{
return (B / A)... | 0 | 35,740,126 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int,int>> a(n), b(m);
for(int i = 0; i < n; i++)cin >> a[i].first >> a[i].second;
for(int i = 0; i < m; i++)cin >> b[i].first >> b[i].second;
for(int i = 0; i < n; i++) {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll m,k;
cin >> m >> k;
if(m==0){
if(k==0){
cout << "0 0" << endl;
}else{
cout << -1 << endl;
}
return 0;
}
if(m==1){
if(k==0){
cout << "1 0 0 1" << endl;
}else{
cout << -1 << endl;
... | 0 | 96,934,131 |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll in[N];
void solve() {
ll ret = 0;
int n;scanf("%d",&n);
for(int i=0;i<n;++i) {
scanf("%lld",&in[i]);
ret ^=in[i];
}
for(int i=0;i<n;++i) {
ll tmp = in[i]&ret;
in[i] -= tmp;
}
... | 0 | 69,359,476 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string k;
cin>>k;
int s[4];
for(int i=0;i<4;i++){
s[i]=k[i]-'0';
}
if(s[0]+s[1]+s[2]+s[3]==7)cout<<s[0]<<"+"<<s[1]<<"+"<<s[2]<<"+"<<s[3]<<"=7"<<endl;
else if(s[0]-s[1]+s[2]+s[3]=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[100010];
int b[100010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
for(int i=0;i<n+1;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
ll ans=0;
for(int i=0;i<n;i++)
{
ll s=min(a[i]+a[... | 0 | 83,817,371 |
#include <iostream>
int main()
{
int N, M;
std::cin >> N >> M;
int64_t sum = 0;
for (int i = 0; i < M; i++)
{
int temp;
std::cin >> temp;
sum += temp;
}
if (sum <= N)
{
std::cout << N - sum << std::endl;
}
else
{
std::cout << -1 << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 0 | 38,380,567 |
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for(int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for(LLI i = s, i##_l = (e); i < i##_l; i++)
#define ... | #include <iostream>
#include <vector>
#include <cstdio>
#include <stack>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long int ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
int main(){
string s;
while(... | 0 | 97,969,733 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cer... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name... | 0 | 57,946,922 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll a,b; cin >> a >> b;
ll A = a,B = b;
rep(i,b-1){
A *= 10;
... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 41,604,191 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5;
int n;
int a[N];
int gcd(int x, int y) {
... | #include <iostream>
#include <climits>
#include <queue>
#define INF (INT_MAX/3);
using namespace std;
class Edge{
public:
int to;
int cost;
};
typedef pair<int, int> D_V;
int main(){
int n;
int a, b, c;
while(true){
cin >> n;
if(n == 0) break;
int max_n = 0;
... | 0 | 51,726,568 |
#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... | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#define mp(n,m) make_pair(n,m)
#define ... | 0 | 20,906,220 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | 0 | 74,782,316 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(auto& x:a){
cin >> x;
}
sort(a.begin(), a.end());
vector<int> b;
int c = 1;
for(int i =1; i< n; i++){
if(a.at(i) == a.at(i-1)) c++;
if(a.at(i) != a.at(i-1)){
b.push_back(c);
c=1;
}
if(i == n-... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | 0 | 71,278,901 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define all(x) x.begin(),x.end()
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define sll set<ll>
#define pll pair<ll, ll>
#define vpll ... | 0 | 43,537,019 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 29,618,160 |
#include<cstdio>
const int N=2E5+10;
int n,h;
int a[N],p[N];
inline int gw(int x,int mod){
if(!x) return 0;
if(p[x]>=mod){
p[x]-=mod;
p[x-1]++;
return gw(x-1,mod);
}
return 1;
}
inline int ck(int x){
int now=0;
for(int i=1;i<=n;i++) p[i]=0;
for(int i=1;i<=n;i++){
if(a[i]>n){
now=a[i];
continue;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n;
cin >> n;
double a;
rep(i, n){
int d;
cin >> d;
a += (double)1/d;
}
cout << fixed << setprecision(10) << (double)1/a << endl;
return 0;
} | 0 | 15,507,429 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
string s;
cin >> s;
if(s[0] == 's' && s[1] == 'n' && s[2] == 'u' && s[3]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a > b) swap(a,b);
if (b > c) swap(b,c);
int count = 0;
if ((c-b)% 2 == 0 && (c-a)%2 == 0){
count += (c-b)/2 + (c-a)/2;
}
else if ((c-b)%2 == 1 && (c-a)%2 == 1){
count += (c-b)/... | 0 | 5,071,518 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, D;
cin >> H >> W >> D;
vector<pair<int, int>> A(H * W + D + 1);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
int a;
cin >> a;
A[a] = {i, j};
}
}
int Q;
cin >> Q;
vector<int> L(Q), R(Q);
for (i... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
vector<string> BubbleSort(vector<string> vs, int n)
{
int i, j, flag;
for(i=1; i<n; i++)
{
flag = 0;
for(j=0; j<n-i; j++)
{
if(vs[j][1] > vs[j+1][1])
{
swap(vs[j], vs[j+1]);
flag =... | 0 | 18,469,203 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int ans=0;
for(int i=1;i<=n;i+=2){
int z=0;
for(int j=1;j<=i;j++){
if(i%j==0)
z++;
}
if(z==8)
ans++;
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
struct DATA{
int number;
int count;
};
void PushWordCount(int, vector<DATA>&);
bool Compare(const int&, const int&);
int main(){
int i, n, max = 0;
vector<int> Max;
vector<DATA> data;
while(cin >> n)
PushWordCount(n, data);
... | 0 | 8,391,228 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
ll height[305];
ll dp[305][305];
ll INF = 0x3f3f3f3f3f3f3f3f;
int main() {
cin >> N >> K;
for (int i=1; i<=N; i++){
scanf("%lld", &height[i]);
}
memset(dp, INF, sizeof(dp));
for (int i=1; i<=N;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 85,163,627 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {;
vector<int> num{};
int ret = 0, tmp;
for (int i = 0; i < 3; i++) {cin >>tmp; num.push_back(tmp);}
while (num[0] != num[1] || num[1] != num[2]) {
sort(num.begin(), num.end());
if (num[2]-num[0] >... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int dx[4] = {-1, 1, ... | 0 | 50,966,298 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define deb(x) cerr << "\n" \
<< #x << "=" << x << "\n";
#define deb2(x, y) cerr << "\n" \
<< #x << "=" << x << "\n" \
<< #y << "=" << y << "\n... | 0 | 76,194,868 |
#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(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmax(... | #include <bits/stdc++.h>
using namespace std;
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) fo... | 0 | 4,725,336 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n];
rep(i,n)cin >>a[i];
int ans=a[0];
for(int i=1;i<n;i++){
ans=__gcd(ans,a[i]);
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long doubl... | 0 | 46,230,405 |
#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() {
ll a, b, c, k; cin >> a >> b >> c >> k;
ll ans = 0;
if (k%2) ans = b - a;
else ans = a - b;
cout << ans ... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 40,268,189 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main(){
ll a,b,n;cin>>n>>a>>b;
if(n==0||(n==1&&a!=b)){co(0);return 0;}
i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
const int max = 10000000;
int n, m, x, ans = max;
cin >> n >> m >> x;
vector<vector<int>> a(n, vector<int>(m));
vector<int> c(n), alg(m);
rep(i,... | 0 | 5,692,243 |
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
bool cmp(pair<long long int ,long long int > a , pair<long long int ,long long int > b){
return a.x > b.x || ((a.x == b.x )&&(a.y>b.y));
}
int main(){
long long int n,m,v,p;
cin >> n >> m >> v >> p;
long long int a[n];
for(long long ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#inc... | 0 | 56,661,293 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for (int i = 1; i <= n; i++){
cin >> a... | #include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include... | 0 | 840,502 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a,int b)
{
if(a==0) return b;
else return gcd(b%a,a);
}
int32_t main()
{
int t,n,i,j,k,l,l1;
cin>>n;
int a[n+1];
for(i=1;i<=n;i++) cin>>a[i];
j=1;
for(i=1;i<=n;i++)
{
if(a[i]==j)
{
j++;
}
}
if(j==1) co... | #include <iostream>
#include <vector>
#include <stack>
#include <utility>
#include <algorithm>
using namespace std;
const int kNil = -1;
enum class Color {
kWhite,
kGrey,
kBlack,
};
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_type w;
... | 0 | 14,859,891 |
#include <iostream>
using namespace std;
int main (void) {
int N, K, X, Y;
int sum = 0;
cin >> N >> K >> X >> Y;
for (int i = 1; i <= N; i++ ){
if (K >= i) {
sum += X;
}else if (K < i){
sum += Y;
}
}
cout << sum;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
typedef l... | 0 | 37,401,525 |
#include<cstdio>
int solve(int a,int b){
if(b==4){
if(a==0) return 1;
else return 0;
}
else{
int res=0;
for(int i=0;i<=a&&i<10;i++){
res+=solve(a-i,b+1);
}
return res;
}
}
int main(){
int n;
while(~scanf("%d",&n)){
printf("%d\n",solve(n,0));
}
return 0;
} | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
#define DtR(degrees) ((degrees)*(M_PI/180.0f))
void moveXY( double& x, double& y, double mx, double my, double si, double co )
{
double xy[3][1] = { {x},
{y},
{1}, };
double r[3][3] = { { co,... | 0 | 46,346,520 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int N,M;
cin >> N >> M;
vector<int>a(M + 5);
vector<int>b(M + 5);
int k = 0, j = 0;
if (N%2==1) {
for (int i = 1; i <= M; i++) {
a[i] = i;
b[i] = N - i + 1;
cout << a[i] << ' ' << b[i] << endl;
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 33,239,274 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
using ll = long long;
#define fi first
#define se second
int nPr(int in, int ir)
{
if(in<ir)return 0;
int ret=1;
for(int i=in;i>=ir+1;i--)ret*=i;
return ret;
}
ll nCr(ll in, ll ir)
{
if(in<ir)return 0;
ll ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> M;
bool compare_by_b(pair<int, double> a, pair<int, double> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
... | 0 | 46,970,506 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 200000
using namespace std;
typedef long long ll;
using P = pair<int, int>;
vector<int> G[MAX];
vector<ll> cnt(MAX, 0);
void dfs(int v, int p = -1)
{
for (auto u : G[v])
{
if (u == p) continue;
cnt[u] += cnt[v];
dfs(u, v);
}
}... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int,int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main(){
long long N,C,K; cin >> N >> C >> K;
vector<long long> v(N);
for(int i=0;i<N;i++)cin>>v[i];
sort(v.begin(),v.end());
long long next = v[0]+K;
int ... | 0 | 40,534,316 |
#include<iostream>
using namespace std;
int A[100];
void print(int A[], int n)
{
for (int i = 0; i < n-1; ++i)
{
cout<<A[i]<<" ";
}
cout<<A[n-1]<<endl;
}
int main()
{
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
cin>>A[i];
}
int cnt = 0;
for (int i = 0; i < n; ++i)
{
int minj = i;
for (i... | #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... | 0 | 73,763,302 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 0 | 58,409,601 |
#include "omp.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
#include <cassert>
#include <fstream>
#include <algorithm>
#include <list>
#include <random>
#include <ctime>
#include <random>
#in... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 56,733,632 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
vector<int> vec(3);
cin>>vec[0]>>vec[1]>>vec[2];
sort(vec.begin(),vec.end());
cout<<vec[0]+vec[1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n; cin >> n;
vector<int> T(n), X(n), Y(n);
loop(i,0,n) cin >> T[i] >> X[i] >> Y[i];
int prev_t = 0, prev_x = 0, prev_y = 0;
loop(i,0,n) {
int t =... | 0 | 34,823,406 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <ioman... | 0 | 76,051,115 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll INFF = 1e18;
const ll MAXN = 510;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
ll frek[200010];
ll tab[200010];
ll cnt(ll x)
{
return (x * (x - 1)) / 2;
}
int m... | #include<iostream>
#include<vector>
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
ll now=1;
ll MAX=1e18;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==0){
cout<<0<<endl;
return 0;
}
}
for(int i=0;i<n;i++){
if(MAX/now<a[i]){
cout<<-1<<e... | 0 | 60,453,008 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
int main(){
ll n; cin >> n;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll ans = 0;
rep(i,n-1){
if(a[i] / 2 > 0){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int x;
cin >> x;
if(x>=2000){
cout << 1 << endl;
return 0;
}
rep(a,20){
rep(b,20){
rep(c,20)... | 0 | 81,015,288 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <iostream>
#include <string>
#include <list>
#include <algorithm>
#include <map>
using namespace std;
#define D
#ifdef D
void fncPrint(string& str) {
int a, b;
cin >> a >> b;
cout << str.substr(a, 1 + b - a) << endl;
}
void fucreverse(string& str) {
int a, b;
cin >> a >> b;
string::iterator it = str.begi... | 0 | 63,667,307 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int x,n;
vector<int>v{};
cin>>x>>n;
if(!n)
cout << x;
else
{
int c;
for(int i = 0; i < n; i++)
{
cin >> c;
v.push_back(abs(c));
}
sort(v.begin(), v.end());
auto it = find(v.begin(),v.end(), x);
if (it ==... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 0 | 54,947,310 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
using ll = long lo... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | 0 | 14,462,173 |
#include <iostream>
#include <set>
#include <vector>
#include <iomanip>
#include <deque>
#include <algorithm>
#include <cfenv>
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<ll> As(A);
vector<ll> Bs(B);
vec... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repbit(bit,n) for (int bit = 0; bit < (1<<n); bit++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int x;
cin >> x;
int ans;
ans = x/200;
ans = 9 - (ans - 1);
cout << ans;
return 0;
} | 0 | 12,627,168 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
for(int i = 0; i < h;... | #include <stdio.h>
#include <string.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
getchar();
char str[a+b+1];
scanf("%s", &str);
int length = strlen(str);
int flag = 0;
for(int i=0; i<length; i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
continue;
}
else if ('0' > str[i] || str[i] > '9')
{
i... | 0 | 87,216,167 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | #include<bits/stdc++.h>
using namespace std;
#define Boost ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define all(cont) cont.begin(),cont.end()
#define rall(cont) cont.rbegin(),cont.rend()
#define foreach(cont) for(auto &val: cont)
#define dbg(arg... | 0 | 57,075,221 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | #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()
const int MAX_N = 1000010;
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = ... | 0 | 73,627,996 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
using namespace std;
typedef long long ll;
ll get_length(ll min_x, ll max_x){
ll length;
if(min_x == 0){
length = - max_x;
}else{
... | #include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pb push_back
using namespace std;
int main()
{
ll t,tp,mx=0,c=0,n,i,j,k;
cin >> n;
vl v(n+1,0);
for(i=1;i<=n;i++)
cin >> v[i];
set<ll> s;
s.insert(1);c=0;
i=1;
while(true)
... | 0 | 28,353,574 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else{
if(a == 1) cout << "Alice" << endl;
e... | 0 | 27,019,787 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#define IOS ios_base::sync_with_stdio(0); cin... | 0 | 9,728,083 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b, c, k; cin >> a >> b >> c >> k; k %= 2;
ll sum = (a + b + c)/ 2;
cout << (k ? (sum - a) - (sum - b) : (a - b)) << endl;
} | #include <bits/stdc++.h>
long long int MOD = 1000000007;
int main() {
std::string L;
std::cin >> L;
int length = L.length();
std::vector<long long int> pow3(L.length() + 1, 1), pow2(L.length() + 1, 1);
for (int i = 1; i <= length; i++) {
pow3[i] = pow3[i - 1] * 3 % MOD;
pow2[i] = pow... | 0 | 5,551,975 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max(... | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb pu... | 0 | 50,027,153 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N, K, ans = 0;
cin >> N >> K;
vector<int> item(N);
for (int i = 0; i < N; i++) cin >> item.at(i);
sort(item.begin(), item.end());
for (int j = 0; j < K; j++) {
ans = ans + item.at(j);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h,w, Min = 1e18;
int main(){
scanf("%lld%lld",&h,&w);
if(h % 3 == 0 || w % 3 == 0) printf("0\n");
else{
for(ll i = 1; i < w; i++){
ll One = i * h;
ll w1 = w - i;
ll Two = h / 2 * w1;
... | 0 | 53,086,747 |
#include <bits/stdc++.h>
using namespace std;
#define itn int
#define nibu(K, x) binary_search(K.begin(), K.end(), x)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define out(x) cout << x... | #include <iostream>
#include <cstdio>
using namespace std;
#define NIL -1
const int maxn = 100010;
struct Node{int p,l,r;};
Node T[maxn];
int n,D[maxn];
int depth(int u,int d){
D[u] = d;
if(T[u].l!=NIL) depth(T[u].l,d+1);
if(T[u].r!=NIL) depth(T[u].r,d);
}
int main() {
int id,k,m,c,i,left,start=0;
scanf("%d",&n... | 0 | 70,339,627 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,i,k;
scanf("%d %d",&a,&b);
if(a>b)
{
for(i=0;i<a;i++)
{
printf("%d",b);
}
}
else
{
for(i=0;i<b;i++)
{
printf("%d",a);
}
}
printf("\n");
return... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | 0 | 91,778,791 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, l;
vector<int> v;
cin >> N >> K;
for(int i = 1; i <= N; i++)
{
cin >> l;
v.push_back(l);
}
sort(v.begin(), v.end(), greater<int>());
int maxLength = 0;
int len = v.size();
for(int i = 0; i < K; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | 0 | 86,201,237 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
ll S;
cin >> S;
if (S == ll(1e18))
{
cout << "0 0 0 1000000000 1000000000 0" << endl;
return 0;
}
ll H = 1000000000;
ll W = S / H + ll(1);
ll a = S % 10000000... | #include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005;
vector<int> v[maxn];
int dfs(int root, int fa) {
int ret = 0;
for (int i = 0;i < v[root].size();i++) {
int to = v[root][i];
if (to == fa) continue;
... | 0 | 51,895,691 |
#include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint opera... | #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 codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 74,697,060 |
#include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int,int> > qu2;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#... | #include <stdio.h>
int x(int num, int sum, int n){
if (num == 0 && sum == 0){
return 1;
}
if (n > 9){
return 0;
}
return (x(num - 1, sum - n, n + 1) + x(num, sum, n + 1));
}
int main(void) {
int sum, num;
while (1){
scanf("%d%d", &num, &sum);
if (num == 0 && sum == 0) break... | 0 | 47,000,263 |
#include <vector>
struct union_find {
using size_type = std::size_t;
private :
size_type _size;
std::vector<int> node;
public :
union_find (size_type n) : node(n, -1), _size(n) { }
bool unite (size_type x, size_type y) {
if ((x = root(x)) == (y = root(y))) return false;
if (node[x] >... | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 41,616,304 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N; cin >> N;
vector<int> X(N); for (auto &x : X) cin >> x;
int L; cin >> L;
vector<vector<int>> dp(N, vector<int>(17));
for (int a = 0; a < N; a++) {
auto it = upper_bound(begin(X), end(X), X[a]+L) - 1;
dp[a][0] = it - be... | 0 | 39,656,530 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | #include <iostream>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <numeric>
#include <utility>
#define rep(i,n) for(int i = 0;i < n;i++)
#define rep2(i,n) for(int i = 1;i <= n;i++)
#define each(i,x) for(auto & i : x)
usi... | 0 | 405,027 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <cmath>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
typedef long long ll;
const ll inf = 1e18+7;
const ll mod = 1e9+7;
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vi=vector<int>;
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;}
template<class T> ll... | 0 | 4,955,506 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstdlib>
typedef long long ll;
using namespace std;
#define M 1020751
long long convert(string word);
void insert(long long *d,long long key);
int find_key(long long *d,long long key);
int h1(long long key)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define s(x, n) memset(x, n, sizeof(x));
#define pb(x) push_back(x)
#define NIL -1
#define MAXN 11
void solve()
{
ll h, w;
cin >> h >> w;
string s[h];
for (ll i = 0; i < h; i++)
cin >> s[i];
ll dp[h][w]... | 0 | 55,257,470 |
#include<iostream>
#include<vector>
#include<string>
#include<bitset>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n)
cin >> a[i];
vector<int> count(1e6 + 1, 0);
r... | #include<cstdio>
#include<algorithm>
const int MaxN=100010;
int N,L,T,X[MaxN],W[MaxN],mem[MaxN],*list[2],cnt[2],end[MaxN];
bool cmp(int i,int j){
return end[i]<end[j]||end[i]==end[j]&&W[i]>W[j];
}
void csort(int*l,int*r){
int*i=l+1;
while(i<r&&end[i[-1]]<end[*i])i++;
if(i<r)std::inplace_merge(l,i,r,cmp);
}
long lon... | 0 | 67,710,072 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.