code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll t;
cin >> t;
if(t < 1200)
cout ... | #include <math.h>
#include <iostream>
int main() {
int n;
std::cin >> n;
int loan = 100000;
for (int i = 0; i < n; i++) {
loan *= 1.05;
if (int tmp = loan % 1000)
loan += 1000 - tmp;
}
std::cout << loan << std::endl;
} | 0 | 44,514,582 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if(n==25) cout << "Christmas" << "\n";
else if(n==24) cout << "Christmas Eve" << "\n";
else if(n==23) cout << "Christmas ... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
using namespace std;
int spf[1000001];
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n]... | 0 | 72,233,857 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> vec(n);
for(int i = 0; i < n; i++){
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<" ---------------------------------------------- "<<endl
#define uint unsigned int
#define ULL unsigned long long
#define DB long double
#define LDB long double
#d... | 0 | 84,700,923 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
#include <cstring>
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
inline bool chmax(T &lhs, const U... | 0 | 48,386,303 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int keta(int a){
int count = 0;
while(a>0){
a /=10;
count++;
}
return... | #include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x,... | 0 | 75,106,432 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
unsigned long long n, c, k;
cin >> n >> c >> k;
vector<unsigned long long> arrive_time(n);
for (unsigned long long i = 0; i < n; ++i) cin >> arrive_time[i];
sort(arrive_time.begin(), arrive_time.end());
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int t;
int n,m,p;
int ans;
string s;
string str;
string c;
vector<int>x;
while(true) {
s="";
while(true){
getline(cin,str);
s+=str;
if(str.back()!='.')s.push_back(' ');
... | 0 | 97,425,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
vector<long long> A(k);
for (int i = 0; i < k; ++i){
cin >> A[i];
}
long long minv = 2, maxv = 2;
for (int i = k - 1; i >= 0; --i){
long long tmp1;
if (minv % A[i] == 0){
tmp1 = minv;
}else{
tmp1 = A[i]*(m... | 0 | 22,289,466 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int q;
LL a, b;
int main() {
scanf("%d", &q);
while(q--) {
scanf("%lld%lld", &a, &b);
LL n = a * b;
LL temp = sqrt(n);
LL res = temp * 2LL;
if(temp * temp == n) {
res -= 2LL... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define LEN(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
using vpii = vector<pii>;
template<t... | 0 | 63,675,164 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF INT_MAX / 3
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin(... | #include "cstdio"
#include "vector"
#include "queue"
using namespace std;
const int maxm=100;
struct edge{int to,w;};
edge edges[maxm];
vector<int>g[maxm];
int n,m,p;
int vis[maxm],dis[maxm];
int max(int a,int b){return a>b?a:b;}
void add(int u,int v,int w)
{
edges[++p].to=v;
edges[p].w=w;
g[u].push_back(p);
}
void ... | 0 | 22,774,818 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n;
cin>>s;
if(s.size()>n){
string k= s.substr(0,n);
cout<<k<<"...";
} else cout<<s;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n_min,n_max;
int m;
int p;
int result=0;
vector <int> point;
while(1)
{
cin >> m >> n_min >> n_max;
if(m==0 && n_min==0 && n_max==0) break;
for(int i=0;i<m;i++)
{
cin >> p;
point... | 0 | 100,583,064 |
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int>v[10000];
vector<bool>vis(10000);
stack<int>order;
void dfs(int u){
vis[u]=1;
for(auto i:v[u]){
if(!vis[i])dfs(i);
}
order.emplace(u);
}
int main(){
cin>>n>>m;
while(m--){
int l,r;
cin>>l>>r;
v[l].emplace_back(r);
}
for(int i=0;i<n;i++){
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | 0 | 96,306,247 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 70,160,092 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
string s;
cin>>s;
int arr[26]={0},cnt=0;
for(int i=0;i<s.length();i++)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int a[N], b[N];
int n, k;
int main()
{
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> a[i] >> b[i];
long long ans = 0;
int res = 0;
++k;
for (int x = 30; x >= 0; --x) {
res ^= (1 << x);
if (k & (1 << x)) {
long long cur = 0;
f... | 0 | 44,222,195 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #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<ll,ll>;
#define FOR(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(x) *min_element... | 0 | 8,523,372 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#define PB push_back
void Input(int*,vector<string>&);
void Bubblesort(int*,vector<string>);
void Selectionsort(int*,vector<string>);
void Output(int*,vector<string>);
int main(int argc,char* argv[]){
int n... | 0 | 204,767 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int f(const vector<pair<int, int>>& vp, int a) {
int b = 0, e = vp.size() - 1;
w... | 0 | 1,809,014 |
#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... | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
t... | 0 | 66,996,817 |
#define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#pragma GCC target("avx2")
#pragma GCC op... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> edges(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--; b--;
edges.at(a).push_back(b);
edges.at(b... | 0 | 73,220,538 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin >> N;
cout << (N*(N+1))/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
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; }
int main() {
... | 0 | 75,901,897 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
bool eq = 1;
string s,t;
cin >> s >> t;
int n = s.size();
for(int i=0;i<n;i++) if(s[i]!=t[i]) eq = 0;
cout << (eq ? "Yes":"No") << '\n';
re... | #include <iostream>
#include <math.h>
#include <cstdio>
#include <utility>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int n,x;
int main() {
while(1){
cin>>n>>x;
if(n==0) break;
int ans=0;
for(int i=n; i>=3; i--){
for(int j=1; j<=i-1; j++){
if(j>=x-i-j){
... | 0 | 4,267,911 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
string result = "";
for (int i = 0; i < n; i++) {
result += s[i];
result += t[i];
}
cout << result << '\n';
return 0;
} | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 0 | 93,170,002 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rr... | #include <bits/stdc++.h>
using namespace std;
int N,K;
vector<int> A;
bool need(int idx) {
int a = A[idx];
if (a >= K) return true;
vector<int> dp(K+1);
dp[0] = 1;
int max_j = 0;
for (int i = 0; i < N; i++) {
if(i == idx) continue;
int b = A[i];
int max_j2 = max_j;
for (int j = 0; j <= max_j... | 0 | 62,437,046 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
ll func(ll n){
return n * (n-1) / 2;
}
int main(){
int N;
cin >> N;
map<string, ll> mp;
... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
int d;
int sum;
int main() {
d = -1;
cin >> d;
while (d != -1) {
sum = 0;
for (int ... | 0 | 76,795,207 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n);
rep(i, 0, n... | #include <iostream>
#include <vector>
struct Node{
Node () :
parent (-1),
id(-1),
depth(0)
{}
int id;
int depth;
int parent;
std::vector<Node*>children;
};
int FindRoot(Node* nodes, int n){
for(int i=0; i<n; i++){
if(nodes[i].parent == -1){
return i;
}
}
return n-1;
}
voi... | 0 | 77,931,818 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<int>a(n);
rep(i,n)cin>>a[i];
int cnt=1,ans=a[0];
for(int i=1;i<n;i++){
if(a[i]<ans){
ans=a[i];
cnt++;
}
}
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
int n;
char s[100006];
int f = 0;
int fi = -1;
int en = -1;
scanf("%s", s);
n = strlen(s);
int i;
for(i = 0;i < n - 1;i++){
if(s[i] == s[i + 1]){
... | 0 | 60,075,683 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 62,476,400 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int INF = 100000000;
ll i,j,k;
vector<ll> a,p;
ll hamburger(ll level,ll x){
if(level==0){
if(x<=0){return 0;}
else{return 1;}
}
if(x<=1+a[level-1]){
return hamburger(level-1,x-1);
}
else{
return p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
ll price[4];
rep(i,4){
cin >> price[i];
}
price[0] *= 4; price[1] *= 2;
ll price_1L(min({price[0],price[1],price[2]}));
ll n; ... | 0 | 61,294,271 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string ch;
cin >> ch;
if(ch == "a" || ch == "i" || ch == "u" || ch == "e" || ch == "o"){
cout << "vowel" << endl;}
else{
cout << "consonant" << endl;}
} | #include <iostream>
#include <string>
#include <vector>
class Node
{
private:
int _id;
int _parent;
int _depth;
std::vector<int> _children;
public:
Node() {
this->_id = -1;
this->_parent = -1;
this->_depth = 0;
}
Node(int id) {
this->_id = id;
this->_p... | 0 | 39,436,950 |
#include<bits/stdc++.h>
using namespace std;
string s="RYBG";
int n,m,d;
int cal(int x,int y){
if (d&1) return x%2<<1|y%2;
return ((x+y)%(d*2)/d)*2 + ((x+d-(x+y)%d/2)%d < d/2);
}
int main(){
cin>>n>>m>>d;
for (int i=0;i<n;i++){
for (int j=0;j<m;j++)
printf("%c",s[cal(i,j)]);
puts("");
}
} | #include <bits/stdc++.h>
using namespace std;
#define N 100000
int dist[N];
int main()
{
int ans = 0;
int k;
cin >> k;
for( int i = 0; i < N; i++ ) {
dist[i] = INT32_MAX;
}
typedef pair< int, int> P;
priority_queue<P> p;
p.push( make_pair(-1, 1) );
while( !p.empty() ) {
int c = -p.top().first;
int n = p.... | 0 | 91,789,062 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int people, day, choco;
cin >> people >> day >> choco;
vector<int> a(people);
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 80,040,821 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i=0,a=0;
string s,e="keyence";
cin>>s;
for(int t=0;t<s.size();t++)
{
if(s[t]!=e[i])
{
break;
}
else
{
i++;
a++;
}
}
i=6;
for(int t=s.size()-1;t>=0;t--)
{
if(s[t]!=e[i])
{
break;
}
else
{
i--;
a++;
}
}
if... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long int i,s=0,j;
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j=j+i)
{ s=s+j;
}
}
cout<<s<<endl;
} | 0 | 72,435,525 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int pre;
cin >> pre;
ll sum = 0;
for(int i = 1; i < n; ++i)
{
int nxt;
cin >> nxt;
if(nxt < pre)
{
sum += (pre - nxt);
pre = ... | 0 | 17,051,985 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
cout<<(n%k ? 1 : 0)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 31,694,319 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
int main()
{
int n; cin>>n;
cout << 0 << endl;
string t; cin >> t;
if (t == "Vacant") return 0;
int l = 1;
int r = n;
while (true) {
int m = (l+r)/2;
cout << m << endl;
string s;... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 73,416,490 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
int D , X ;
cin >> D >> X ;
vector<int> A(N) ;
int cnt = 0 ;
for( int i = 0 ; i < N ; i++){
cin >> A.at(i) ;
cnt += (D-1)/A.at(i) + 1 ;
}
cout << cnt + X << endl ;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 0 | 16,460,417 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], maxm;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
maxm = a[0];
for (int i = 1; i < n; i++) {
if (a[i] > maxm) maxm = a[i];
sum += (maxm - a[i]);
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, V, P;
int64_t M;
cin >> N >> M >> V >> P;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
sort(A.rbegin(), A.rend());
int Ab = A.at(P - 1);
int64_t acc = 0;
vector<int64_t> diff(N);
... | 0 | 63,466,844 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N;
cin>>N;
vector<double>a(N);
for(int i=0;i<N; i++){
cin>>a.at(i);
}
double answer=0.00000;
for(int i=0; i<N; i++){
double k=1/a.at(i);
answer+=k;
}
cout<< 1/answer<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a[i];
vector<int> r(h), c(w);
rep(i,h){
rep(j,w... | 0 | 83,559,398 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll T[100010], A[100010];
int main()
{
int N; cin >> N;
l... | #include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define INVALID -1
#define mod 1e9+7
#define rep(n) for(int i=0;i<n;++i)
using namespace std;
int main(void){
int n,m;
cin>>n>>m;
vector<ll> dp(n+1,0);
dp[0]=1;
dp[1]=1;
for(int i=0;i<m;i++){
int a;
cin>>a;
dp[a]=INVALID;
}
for(in... | 0 | 4,048,211 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll pre[100005];
ll pos[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n, k;
cin >> n >> k;
for(int i=1; i<=n; i++){
int x;
ci... | #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 | 81,665,704 |
#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (; ... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char s[100];
bool is_palindrome(char *s) {
int n = strlen(s);
for (int i=0;i<n;i++) {
if (s[i] != s[n-i-1])
return false;
}
return true;
}
void solve() {
int n = strlen(s);
if (!is_palindrome(s)) {... | 0 | 29,177,654 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,T,t;
cin>>N>>X>>T;
if(N%X==0){
t=(N/X)*T;
}
else{
t=(N/X+1)*T;
}
cout<<t<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >>t;
int ans = s.size() + t.size();
int i = n;
int j = 0;
int leng = 1;
int counts = 0;
int kouho = 0;
int kotae = s.si... | 0 | 46,904,372 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n,k;cin>>n>>k;
ll a[n];
for(int i=1;i<=n;i++)cin>>a[i];
a[0]=0;
ll M=1e9+7;
ll dp[n+1][k+1]={0},prefix[n+1][k+1]={0};
for(int i=0;i<=n;i++){
for(int j=0;j<=k;j++){
if(j==0){
dp[i][j]=1;
prefix[i][j]=1;
}else if(... | #include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[3],num;
int i;
scanf("%d",&num);
for(i = 0; i < num; i++){
scanf("%d %d %d",&a[0],&a[1],&a[2]);
sort(a,a+3);
if(a[0] * a[0] + a[1] * a[1] == a[2] * a[2]){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
} | 0 | 907,724 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
int x = 1;
rep(cnt, N) {
if (x < K) {
x *= 2;
} else {
x += K;
}
}
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
cin>>n;
std::deque<int> deq;
deq.emplace_back(0);
int sum=0;
for (int i=0;i<=n;i++) {
if (i!=n) {
cin>>a;
deq.emplace_back(a);
sum+=abs(deq[i]-deq[i+1]);
} else {
... | 0 | 9,605,077 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
vector<vector<int>> ans(100, vector<int>(100, 0));
int i = 1;
int j = 1;
bool makeBlock = false;
while (A > 1) {
makeBlock = true;
ans[3 * i - 3][3 * j - 3] = 1;
ans[3 * i - 3][3 * j ... | 0 | 51,000,787 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A;
string S;
cin >> A >> S;
int64_t B = 0;
for (int i = 0; i < S.size(); i++)
{
if (S.at(i) == '.')
continue;
int j = S.at(i) - '0';
B = 10 * B + j;
}
cout << A * B / 100 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | 0 | 25,052,241 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll x, a, b;
cin >>... | #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>
using namespace std;
typedef long long ll;
typedef... | 0 | 47,297,277 |
#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)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int main()
{
string s;
cin >> s;
int res = 0;
if (s == "RRR") res = 3;
... | #include <stdio.h>
int main(){
int K, A, B;
scanf("%d", &K);
scanf("%d %d", &A, &B);
int L = B - A;
int count = 0;
for(int i = 0; i <= L ; i++){
int total = A % K;
A++;
if(total == 0){
count++;
}
else{
count = count + 0;
}
}
... | 0 | 4,328,109 |
#include <iostream>
#include <string>
using namespace std;
int dp[1100][1100];
int main() {
string s, t;
cin >> s;
cin >> t;
for (int i = 0; i < 1100; i++) {
dp[0][i] = i;
dp[i][0] = i;
}
for (int i = 1; i <= s.size(); i++) {
for (int j = 1; j <= t.size(); j++) {
int d = 0;
if (s[i -... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int x;
cin>>x;
bool * dp = new bool[x+1]();
dp[0] = true;
for(int i=100;i<=x;i++)
{
if( i-100 >=0 )
dp[i ] = dp[i ] || dp[i-100];
if( i-101 >=0 )
dp[i ] = dp[i ] || dp[i-101];
... | 0 | 81,971,523 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
cout<<(x+y+1)/2<<endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
long long R = 0;
long long G = 0;
long long B = 0;
for (int n = 0; n < S.size(); ++n) {
if ('R' == S[n]) {
++R;
}
else if('G'==S[n]){
++G;
}
else {
++B;
}
}
long long ans = R * G * B;
for (int i = ... | 0 | 77,923,665 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using P = pair<int, int>;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> map(h, vector<char>(w));
vector<vector<int>> visit(h, vector<int>(w));
queue<P> q;
rep(y, h) {
string s... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | 0 | 12,112,051 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
ll ans;
ll pre[200005][26];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>s;
for(int i=s.size()-1;i>=0;i--){
int c=s[i]-'a';
for(int j=0;j<26;j++){
pre[i][j]=pre[i+1][j];
}
pre[i][c]++;
}
ans=... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main(){
string l;
cin >> l;
int n = l.length();
vector<long long int> pow3(n,1);
for(int i=1; i<n; i++){
pow3[i] = 3 * pow3[i-1];
pow3[i] %= MOD;
}
reverse(l.begin(),l.end());
long long i... | 0 | 74,144,949 |
#include <string>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
const char R[11] = { 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'u', 'y' };
string S;
bool right[2];
int Answer;
vector<int> Ans;
while (true)
{
Answer = 0;
cin >> S;
if (S == "#")
{
break;
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,S;
cin >> N >> K >> S;
int count=0;
int x;
for(int i=1e9;i>=1;i--){
if(i!=S){
x=i;
break;
}
}
for(int i=0;i<N;i++){
if(count>=K){
cout << x;
}else{
cout << S;
count++;
}
if(i==N-1){
... | 0 | 37,937,482 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int n, l, t, sh = 0;
vector <int> p;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> l >> t;
for(int i = 0; i < n; i++){
int x, ty;
cin >> x >> ty;
if(ty == 1){
p.push_back((x + t) % l);
sh += ((x +... | #include <bits/stdc++.h>
#include <atcoder/dsu>
#include <boost/range/adaptors.hpp>
#include <boost/range/combine.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, q;
cin >> n >> q;
atcoder::dsu d(n);
for (auto _ :... | 0 | 3,295,124 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> as(n);
vector<int> bs(n);
int t;
long long sum = 0;
long long minus = 0;
int count = 0;
for (int &a : as) cin >> a;
for (int i = 0; i < n; ++i) {
cin >> t;
bs[i] = as[i] - t;
sum += bs[i];
if ... | 0 | 100,784,642 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='7')
cout<<"Yes"<<endl;
else if(s[1]=='7')
cout<<"Yes"<<endl;
else if(s[2]=='7')
cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
#ifdef LOCAL
string to_string(char a) { return string(1,a); }
string to_string(bool a) { return a ? "1" : "0"; }
string to_string(const char* a) { return (string)a; }
string to_string(string a) { return a; }
string to_string(vector<bool> v) {
string s = "... | 0 | 95,187,891 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int,int>
#define ll long lo... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 0 | 3,921,725 |
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long LL;
const int M=305;
const LL INF=(LL)M*(1000000000);
LL dp[M][M];
LL h[M];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%lld",&h[i]);
for(int i=1;i<=n-k;i++)
{
for(int j=i;j<=n;j++)
{
if(i==1)
{
... | #include<stdio.h>
#include<string.h>
int main(void)
{
char a[20];
int i,s;
scanf("%s",a);
s=strlen(a);
for(i=s-1;i>=0;i--){
printf("%c",a[i]);
}
printf("\n");
return 0;
} | 0 | 93,473,000 |
#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>
using namespace std ;
const int MAX = 2e5 + 10 ;
long long A[MAX] , B[MAX] ;
int n ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
long long sum1 = 0 , sum2 = 0 , sum = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cin>>A[i]>>B[i] ;
if(A[i] > B[i])
sum1 += A[i] - B[i] ;
... | 0 | 87,053,409 |
#include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
int main(){
LL a;
LL b;
LL ans=0;
vector<LL> num(5);
cin >> a >> b;
for(LL i=a; i<=b; i++){
LL tmp=i;
for(LL j=0; j<5; j++){
num[j]=tmp%10;
tmp/=10;
}
if(num[0... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a,b,c,d,sum;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&a,&b);
c=a*b;
d=sqrt(c);
if(d*(d+1)<c)
sum=d*2-1;
else if(d*d==c)
{
if(a==b)
... | 0 | 30,855,080 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 0 | 12,973,384 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A+B<=16 && A<=8 && B<=8) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {... | 0 | 83,763,592 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int minnum = 200050;
int cnt = 0;
int n; cin>> n;
ve... | #include<iostream>
using namespace std;
int main(){
int x,y,i;
for(i = 1; i <= 3000; i++){
cin >> x >> y;
if((x == 0) && (y == 0)) break;
if(x <= y){
cout << x << " " << y << endl;
} else {
cout << y << " " << x << endl;
}
}
return 0;
} | 0 | 43,675,773 |
#include <stdio.h>
int main() {
char S[102];
char T[102];
scanf("%s%s", &S, &T);
printf("%s%s", T, S);
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const i... | 0 | 29,525,444 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | #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 debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 7,078,657 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
int main(){
ll n,m;
priority_queue <int> PQ;
pair <int,int> a[100006];
scanf("%lld %lld", &n ,&m);
int i;
for(i = 0;i < n;i++){
scanf("%d %d", &a[i].first, &a[i].second);
}
sort(a,a... | 0 | 2,363,965 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_checkpoints(void) {
int n, m;
int a[60], b[60];
int c[60], d[60];
int num = 1;
long int min_distance = 200000000;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
f... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int flag=0;
for(int i=0; i<a.length(); i++)
{
if(a[i]==b[a.length()-1-i])
continue;
else
flag=1;
}
if(flag==0)
cout<<"YES";
else
cout<<"NO";
return... | 0 | 13,556,180 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<list>
#include<cctype>
#include<utility>
#include<algorithm>
#include<cmath>
#include<cctype>
using namespace std;
enum FACE { TOP,BACK, RIGHT ,LEFT , FRONT, BOTTOM};
template <class T>
class dice {
public:
dice() {
id[TO... | 0 | 36,782,991 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int> I(N);
for(int i=0;i<N;i++){
int a;
cin >> a;
I.at(a-1)++;
}
int ans=0;
sort(I.begin(),I.end());
for(int i=0;i<N-K;i++){
ans += I.at(i);
}
cout << ans <<e... | 0 | 38,945,012 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | 0 | 18,245,282 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n;
cin>>n;
vector<int>a(n);
rep(i,n){
cin>>a.at(i);
}
... | #include<iostream>
using namespace std;
int main() {
int h, w;
while (1) {
cin >> h >> w;
if (h == 0 && w == 0)
break;
for (int i = 0; i < h; i++) {
for (int k = 0; k < w; k++) {
if (i == 0 || i == h - 1 || k == 0 || k == w - 1) {
cout << '#';
}
else cout << '.';
}
cout << endl;
}... | 0 | 8,717,423 |
#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<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
#define MAX_M 100000000
int n;
int m;
char D[MAX_M];
char a,b;
int use[MAX_M];
typedef pair<char,char> P;
vector<P> A;
int main(){
while(true){
scanf("%d",&n);
if(n ==0)
break;
for(int i = 0;i < n;i++){
cin >>a>>b;
A.push_back... | 0 | 96,153,617 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n;
cin >> n;
vector<int>p(n),q(n);
for(int i = 0; i < n; i++) cin >> p[i];
for(int i = 0; i < n; i++) cin >> q[i];
if(p == q)
{
cout << 0 << endl;
return 0;
}
int k = 0;
int ... | #include <iostream>
#include <cmath>
using namespace std;
const double PI = 3.14159265;
int n;
void koch(double p1[2], double p2[2], int i) {
if (i == n) return;
double s[2], t[2], u[2];
s[0] = (2 * p1[0] + p2[0]) / 3;
s[1] = (2 * p1[1] + p2[1]) / 3;
t[0] = (p1[0] + 2 * p2[0]) / 3;
t[1] = (p1[1] + 2 * p2[1]) / 3;... | 0 | 46,553,274 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
vector<int> v(n);
for(int& x : v)
scanf("%d",&x);
int k = v[0];
long long ans = 0;
for(int i = 1; i < n; i++){
if(v[i] > k)
k = v[i];
else
ans += k-v[i];
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace std;... | 0 | 92,721,661 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<long long int, long l... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int match(int a){
if(a == 1) return 2;
else if(a == 2) return 5;
else if(a == 3) return 5;
else if(a == 4) return 4;
else if(a == 5) return 5;
else if(a == 6) return 6;
else if(a == 7) return 3;... | 0 | 39,304,438 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
char A[N][N];
char B[M][M];
for(int i=0;i<N;i++) cin>>A[i];
for(int i=0;i<M;i++) cin>>B[i];
bool can=false;
for(int i=0;i<=N-M;i++){
for(int l=0;l<=N-M;l++){
bool isyes=true;
for(int j=0;j<M;j++){
for(int ... | #include<bits/stdc++.h>
using namespace std;
#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 all(v) v.begin(),v.end()
#define inf (int)(3e18)
#define P pair<int,int>
#define mod (int)(1e9+7)
#define mod2 998244353
template<class T> inline void chmin(T &a, T b) {... | 0 | 99,855,209 |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int pare[200005];
int rak[200005];
void init(int n)
{
for(int i=0;i<n;i++)
{
pare[i]=i;
rak[i]=0;
}
}
int find(int x)
{
if(pare[x]==x... | #include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespac... | 0 | 79,796,331 |
#define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#pragma GCC target("avx2")
#pragma GCC op... | #include <iostream>
using namespace std;
#define MAX 1000000
int main()
{
int prime[MAX];
fill(prime, prime + MAX, 1);
prime[0] = prime[1] = 0;
for (int i = 2; i < MAX; i++) {
if (prime[i]) {
for (int j = 2*i; j < MAX; j += i) {
prime[j] = 0;
}
}
... | 0 | 85,823,637 |
#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 FOR(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(x) *min_eleme... | #include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a... | 0 | 62,658,975 |
#include<stdio.h>
#include<string.h>
int main(){
char str1[15], str2[15], trash[15];
int balls1, balls2;
scanf("%s %s", &str1, &str2);
scanf("%d %d", &balls1, &balls2);
scanf("%s", &trash);
(strcmp(trash, str1) == 0) ? balls1-- : balls2--;
printf("%d %d\n", balls1, balls2);
return 0;
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <functional>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <complex>
#include <list>
#include <cassert>
#include <deque>
#i... | 0 | 50,931,845 |
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 14,225,271 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long int i,a,b,z=0;
cin>>a>>b;
for(i=a;i<=b;i++)
{
int n,x=0;
ostringstream str1;
str1 <<i;
string s = str1.str();
n=s.size();
for(int j=0;j<n/2;j++)
{
if(s[j]==s[n-j-1])
{
x++;
}
else
{
break;
}
}
... | 0 | 68,286,981 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
... | #include<iostream>
#include<cstdio>
using namespace std;
#define int long long
signed main(){
int a;
while( scanf("%lld", &a) != EOF ){
int b=1;
for(int i=2; i<=a; i++){
b*=i;
}
printf("%lld\n", b);
}
... | 0 | 14,329,386 |
#include <stdio.h>
#include <string.h>
int main(){
char S[12];
scanf("%[^\n]", S);
for(int j=0;S[j] != '\0';j++){
if(S[j] == 'B'){
S[j] = '-';
for(int i=j;S[i] == '-';i--)
if(S[i-1]!='-'){
S[i-1]='-';
break;
}
}
}
for(int i=0;S[i] != '\0';i++){
if(S[i] !='-'){
printf(... | #include <bits/stdc++.h>
using namespace std;
int gcd_func(int a, int b){
return b? gcd_func(b, a%b) : a;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int h, w, k; cin >> h >> w >> k;
char gd[7][7];
for(int i = 0; i < h; i++){
for(int j = 0; j<w; j++){
... | 0 | 33,119,424 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 1000000
int dp[25][50005];
int c[25];
int main(void) {
int n,m;
scanf("%d%d",&n,&m);
for(int i=1; i<=m; i++)
scanf("%d",&c[i]);
for(int i=0; i<=20; i++)
for(int j=0; j<=50000; j++)
dp[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 54,661,188 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int i;
vector<int> h(n);
for(i=0;i<n;i++) cin >> h[i];
sort(h.begin(),h.end());
long long cnt = 0;
for(i=0;i<n-k;i++) cnt += h[i];
cout << cnt << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long mul=1;
long long a[n];
long long z = 0;
for(int i=0;i<n;i++) {
cin>>a[i];
if(a[i]==0) z =1;
}
if(z==1){
cout<<0;
return 0;
}
for(int i=0;i<n;i++){
if(a[i]<=1000000000000000000/mul){
mul*=a[i];
... | 0 | 37,698,145 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,x,g;
cin >> n >> x;
cin >> g;
g = abs(g-x);
rep(i,n-1){
int a;
cin >> a;
g = gcd(g,abs(a-x));
}
cout << g << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) for(int i = 0; i < n; i++) cin >> a[i];
#define print(a) for(int i = 0; i < n; i++) cout << a[i] << " ";
#define pb push_back
#define pql priority_queue<int>
#define pqs priority_queue... | 0 | 51,098,389 |
#include <cstdio>
#include <climits>
#include <algorithm>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n)&&n!=0) {
long long int a[n];
for (int i=0; i<n; i++) scanf("%lld", &a[i]);
long long int dp[n];
dp[0] = a[0];
long long int res = dp[0];
for ... | #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,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(_i, n) printf("%d%c", a[_i], _i + 1 == n ? '\n' : ' ')
#define DUMP2D(a, n, m) REP(_i, n) REP(_j, m) printf("%d%c", a[_i][_j], _... | 0 | 70,748,469 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int hoge(vector<int> &ans, int x, int i, int v) { return x + ans[i - x * v]; }
int main() {
vector<int> vec = {1};
for (int i = 1; pow(6, i) <= 100000; ++i)
vec.push_back(pow(6, i));
for (int i ... | void solve();
int main() {
solve();
return 0;
}
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
using namespac... | 0 | 59,001,088 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
int n,k;
int w[1000000];
int main(){
int r;
cin >> r;
cout << r*r<<endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int data[ 4 ] [ 3 ] [ 10 ] = {} ;
int n ;
std::cin >> n ;
for( int i = 0 ; i < n ; i++ ) {
int b , f , r , v ;
std::cin >> b >> f >> r >> v ;
data[ b - 1 ] [ f - 1 ] [ r - 1 ] += v ;
}
for( int b = 0 ; b < 4 ; b++ ) {
... | 0 | 91,653,513 |
#include <iostream>
#include <queue>
using namespace std;
using ll = long long;
const ll MAX = 10000000000000;
int h,w,n;
bool matrix[1001][1001]={{}};
bool visited[1001][1001]={{}};
pair<int,int> target;
struct state{
int x;
int y;
int depth;
};
ll min(ll x,ll y){
if(x < y){
return x;
}else{
return y;
}
}
ll... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
void dfs(int v, Graph& g, vector<bool>& visited, set<int>& path) {
visited[v] = true;
path.insert(v);
for (int nv : g[v]) {
if (!visited[nv]) {
dfs(nv, g, visited, path);
}
}
}
int main() {
int n, m;
cin >> n >> m... | 0 | 26,985,513 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1000000000000000000LL
#define INF 200000000
#define MOD 10000
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vecto... | 0 | 45,681,280 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if(s.at(0) == s.at(1)... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
const int N=1011111;
int fa[N],d[N];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x... | 0 | 48,121,802 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int q; cin>>q;
vector<long long> a(q),b(q);
for(int i=0; i<q; ++i) cin>>a[i]>>b[i];
for(int i=0; i<q; ++i){
long long ab=a[i]*b[i]-1,sqr=sqrtl(ab),sq=sqr*2;
if(a[i]==1&&b[i]==1) cout<<0<<endl;
else if(a[i]==b[i]) cout<<sq<<endl;
else i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 54,607,970 |
#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>;
const int INF = 1 << 29;
int main() {
vector<int> letter(26, 0);
string s;
cin >> s;
rep(i,s.size()) {
char c = s[i];
letter[c-'a']++;
}
rep(i, 26) {
if (letter[i] ==... | #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 << (i == a.size() - 1 ? "\n":" ");}
using ll = ... | 0 | 17,850,627 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_A... | #include <bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define ll long long
#define X first
#define Y second
const int N = 3E5 + 10;
int n, m;
ll a[N], Sum[N], d[N];
void Input()
{
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
}
bool check(int mid, int k)
{
int pos = upper_bound(a + ... | 0 | 65,545,946 |
#include <iostream>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
int z=x/y;
int w=z*y;
if((x-w)==0){cout<<0<<endl;}
else {cout<<1<<endl;}
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | 0 | 90,224,624 |
#include <iostream>
#include <array>
#include <algorithm>
int main() {
std::array<long long int, 5> arr;
std::cin >> arr[0] >> arr[1] >> arr[2]
>> arr[3] >> arr[4];
std::sort(arr.begin(), arr.end(), std::greater<long long int>());
std::cout << arr[0] << " " << arr[1] << " "
<<... | #include<bits/stdc++.h>
#include<cassert>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_s... | 0 | 12,070,972 |
#include <iostream>
using namespace std;
int main(){
int i=0;
char a[20],x;
while(cin>>x){
a[i]=x;
i++;
if(i>=20)break;
}
for(int f=i-1;f>=0;f--){
cout<<a[f];
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, -1)), next(n, vector<int>(n, -1)),
indeces(n, vector<int>(n, -1));
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--... | 0 | 60,240,875 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int w, h; cin >> w >> h;
priority_queue<ll, vector<ll>, greater<ll>> p, q;
for (int i = 0; i < w; ++i) {
ll pi; cin >> pi;
p.push(pi);
}
for (int i = 0; i < h; ++i) {
ll qi; cin >> qi;
q.... | 0 | 8,272,414 |
#include <bits/stdc++.h>
using namespace std;
long long N,X;
long long T[50];
long long P[50];
long long countpati(long long N,long long X){
if(X==1){
if(N==0){
return 1;
}
else return 0;
}
if(1<X && X<=1+T[N-1]){
return countpati(N-1,X-1);
}
if(X==2+T[N-1]){
return 1+P[N-1];
}
i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 95,034,247 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.