code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
int max=a.at(0),min=a.at(0);
for(int i=1;i<n;i++){
if(min>a.at(i))
min=a.at(i);
if(max<a.at(i))
max=a.at(i);
}
cout << max-min << 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 H, W, K;
cin >> H >> W >> K;
vector<vector<char>> blocks(H, vector<char>(W));
rep(i, H) {
rep(j, W) {
cin >> blocks.at(i).at(j);
}
}
int... | 0 | 55,739,416 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#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;
vector<int> x(n);
rep(i,n) cin >> x[i];
int mean = 0;
rep(i,n) {
mean += x[i];
}... | #include<iostream>
#include<vector>
#include<math.h>
#include<map>
#define TakeInput freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
TakeInput
#endif
int i,j,m,n,k,r,c;
cin>>n>>m>>k;
string a[n];
for(i=0;i<n;i++){
... | 0 | 40,038,300 |
#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... | #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 H, W;
cin >> H >> W;
vector<string> c(H);
rep(i, H) cin >> c[i];
int ans = 0;
vector<vector<int>> cnt(H, vector<int>(W, 0));
rep(i, H... | 0 | 29,532,578 |
#include <bits/stdc++.h>
#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 vi vector<int>
#define pb push_back
typedef long long ll;
using namespace std;
int main(){
int m,nmn,nmx;
while(cin >> m >> nmn >> nmx,m) {
int gmx = 0,mxn = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int main() {
long long Height[15];
long long copyHeight[15];
long long ans = 1000000000000;
cin >> N >> K;
for ( int i = 0; i < N; ++i ) {
cin >> Height[i];
}
for ( int bit = 0; bit < (1 << N); ++bit ) {
int... | 0 | 57,127,203 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 56,854,882 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#d... | #include <bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0)
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define S second
#define F first
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 2e5 + ... | 0 | 69,351,690 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main(){
ll N,K;
cin >> N >> K;
double ans=0;
for(ll i=0;i<N;i++){
int nn = i+1;
double tmp = 1.0/N;
while(nn<K){
nn*=2;
tmp/=2;
}
ans += t... | #include <iostream>
#include<algorithm>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << 1 << endl;
}
else if (2 <= N && N < 4) {
cout << 2 << endl;
}
else if (4 <= N && N < 8) {
cout << 4 << endl;
}
else if (8 <= N && N < 16) {
cout << ... | 0 | 64,445,669 |
#include<bits/stdc++.h>
#define mxn 200005
#define ll long long
using namespace std;
ll seg[4*mxn], lazy[4*mxn];
vector<int>adj[mxn];
void propagate(int n, int s, int e)
{
lazy[n*2]+= lazy[n];
lazy[n*2 +1]+= lazy[n];
int mid= (s+e)>>1;
seg[n*2]+= lazy[n]*(mid-s+1);
seg[n*2 +1]+= lazy[n]*(e-mid);
... | #include <iostream>
#include <deque>
#include <string>
using namespace std;
int stateA(deque<string>& a);
int stateB(deque<string>& a);
int stateC(deque<string>& a);
int stateD(deque<string>& a);
int stateE(deque<string>& a);
int stateF(deque<string>& a);
int main(){
int n;
while(true){
cin >> n;
if(n == 0)... | 0 | 97,360,891 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
long long a;
double b;
cin >> a >> b;
if(a==0 || b==0){
cout << 0 << endl;
return 0;
}
long long num=b*100+0.000001;
long long ans=num*a;
ans/=100;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, D;
cin >> N >> D;
vector<vector<l... | 0 | 1,333,123 |
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(void) {
io;
int i; cin >> i;
cout << (i < 1200 ? "ABC" : "ARC");
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <cmath>
std::vector<int> PRIMES;
void init_primes(int max)
{
if (max < 2) return;
std::set<int> candidate;
PRIMES.push_back(2);
for (int i = 3; i < max; i+=2) {
candidate.insert(i);
}
for (int i = 3; i < sqrt(max); i+=2) {
auto it = candi... | 0 | 52,522,394 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <math.h>
#include <stack>
#include <deque>
#include <queue>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
#define debug(var) do{std::cout << #var << " : ";view(v... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 27,685,565 |
#include <vector>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for(int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
}
vector<int> p(N + 1);
for(int i = 0; i < M; ++i) {
++p[L[i] - 1];
--p[R[i]];
}
int sum = 0, ans = 0;
for(int i = 0; i < N; ++i) {
... | #include <bits/stdc++.h>
#define ll long long
#define pb(x) push_back((x))
#define line() cerr << "DEBUG @" << __LINE__ << endl;
#define debug(x) \
cerr << "DEBUG @" << __LINE__ << " -> " << #x << " = " << x << endl;
using namespace std;
vector<int> m[(int) 1e6 + 1];
int main() {
ios::sync_with_stdio(false);
... | 0 | 70,966,441 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
ll h,w;
ll ans = 1e10+1;
cin >> h >> w;
rep(x,1,h){
ll m,M;
m = min(x*w,(h-x)*(w/2));
M = max(x*w,(h-x)*((w+1)/2));
ans = min(ans,M-m);
... | #include <stdio.h>
int main(void){
long long N,M;
long long ans;
scanf("%lld%lld",&N,&M);
if(N < M/2){
ans = N;
M -= 2*N;
ans += M/4;
}
else{
ans = M/2;
}
printf("%lld\n",ans);
return 0;
} | 0 | 11,247,881 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<utility>
#include<string>
#include<map>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> p(n), x(n + 1);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
x.at(p.at(i)) = i;
}
multiset<ll> s;
s.insert(x.at(n));
s.insert(-1);
s.insert... | 0 | 71,086,003 |
#include <bits/stdc++.h>
using namespace std;
int ctos, son;
int A[10005];
int D[50005];
int main(){
ios::sync_with_stdio(false);
cin>>ctos>>son;
for(int i=1; i<=son; i++){
cin>>A[i];
}
for(int i=1; i<=ctos; i++){
D[i]=50001;
}
for(int k=1; k<=son; k++){
for(int i=1; ... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | 0 | 66,537,798 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
string S;
int a = 0;
int b = 0;
int c = 0;
int y = 0;
int x = 0;
cin>>S;
string s = S;
reverse(s.begin(),s.end());
if(s == S){
a = 1;
}
y = ((S.size() - 1 / 2) - 1) / 2;
string d2;
for... | 0 | 41,480,090 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
int main(void){
int N, M; cin >> N >> M;
int S[N+1] = {}; rep(i, N) cin >> S[i+1];
int T[M+1] = {}; rep(i, M) cin >> T[i+1];
ll dp[N+1][M+1];
rep(i, N+1) rep(j, M+1)... | 0 | 32,102,348 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> s( H );
for( int i = 0; i < H; i++ ) {
cin >> s[i];
}
vector<vector<int>> dp( H, vector<int>( W, INT32_MAX / 2 ) );
dp[0][0] = 0;
if( s[0][0] == '#' ) dp[0][0] = 1;
int dx[2] = { 0, 1 };
int dy[2] = { 1, 0 };
... | #include <iostream>
#include <stack>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
stack<int> st;
int i, s;
int cnt = 0;
while (cin >> n >> x && (n > 0 || x > 0)) {
st = stack<int>();
i = 1; s = 0;
cnt = 0;
if (x == 0) {
... | 0 | 49,898,342 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, A;
cin >> N >> A;
cout << N * N - A << endl;
} | #include <iostream>
#include <string>
int main(void)
{
std::string s, p;
std::cin >> s >> p;
s += s;
int count;
bool contains = false;
for (int i = 0; i + p.size() <= s.size(); i++)
{
count = 0;
while (count < p.size() && p[count] == s[i + count])
{
count++;
}
if (count == p.size())
{
contains ... | 0 | 10,236,609 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a,b;
char x;
cin>>a>>x>>b;
if(x == '+'){
cout<<a+b<<"\n";
}
else{
cout<<a-b<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
bool a[100005];
int p[100005];
int main() {
int n, m;
cin >> n >> m;
int ac = 0, pena = 0;
rep(i, m) {
int x;
string s;
cin >> x >> s;
if (a[x]) continue;
... | 0 | 62,709,889 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack> ... | #include<bits/stdc++.h>
using namespace std;
int main( void )
{
string s, t;
cin >> s >> t;
int size;
bool large = false;
int count = 0;
sort( s.begin(), s.end() );
sort( t.begin(), t.end() ,greater<int>() );
if( s.size() > t.size() )
size = t.size();
else
size = s.size();
for( int i = 0; i ... | 0 | 47,755,644 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int row1, col1, row2, col2;
cin >> row1 >> row2;
col1 = row1;
col2 = row2;
vector<string> vec(row1);
vector<string> vec2(row2);
for (int i = 0; i < row1; i++) cin >> vec.at(i);
for (int i = 0; i < row2; i++) cin >> vec2.at(i);
... | #include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
using namespace std;
int n;
vector <int> G[101];
queue <int> Q;
int d[100];
int dis[101];
int visit(int x){
int t,i;
Q.push(x);
dis[x] = 0;
d[x] = 1;
while(Q.empty() == false) {
t = Q.front();
Q.pop();
for(i=0; i<G[t].size(... | 0 | 55,621,209 |
#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,sf,sl;
vector <int> m(n,0);
cout << 0 << endl;
cin >> s;
if(s=="Vacant"){
exit(0);
}
else{
sf=s;... | #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... | 0 | 31,535,523 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
string a,b,c;
cin >> a >> b >> c;
cout << char(a[0]-'a'+'A') << char(b[0]-'a'+'A') << char(c[0]-'a'+'A') << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
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)... | 0 | 100,872,034 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 100100100100;
int v, e;
int main()
{
cin >> v >> e;
vector<vector<ll>> D(v, vector<ll>(v, INF));
rep(i, e)
{
int s, t;
ll d;
cin >> s >> t >> d;
... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 27,967,426 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
vector<int> A, B;
int calc(int b) {
int ret = 0;
for (int i = 1; i <= N; i++) {
ret += abs(A[i-1] - (b + i));
}
return ret;
}
signed main() {
cin >> N;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
... | #define MYDEBUG
#include <bits/stdc++.h>
#ifdef MYDEBUG
#define dbp(x) cout<<#x<<": "<<x<<endl
#define dbp2(x,y) cout<<#x<<","<<#y<<": "<<x<<","<<y<<endl
#define dbp3(x,y,z) cout<<#x<<","<<#y<<","<<#z<<": "<<x<<","<<y<<","<<z<<endl
#define dbp4(w,x,y,z) cout<<#w<<","<<#x<<","<<#y<<","<<#z<<": "<<w<<","<<x<<","<<y<<","<... | 0 | 41,159,646 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
string solve(){
string s;
cin>>s;
ll sm=0;
for(char c:s) sm+=(c-'0');
return (sm%9)?"No":"Yes";
}
int main()
{
#ifndef ONLINE_JUDG... | #include <iostream>
#include <cmath>
#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>
#inclu... | 0 | 92,116,331 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int a[300010],num2[300010],num[300010],sum_num[300010],sum_tot[300010];
int check(int m,int n)
{
int p=0;
p+= sum_num[n]-sum_num[m-1];
p+= sum_tot[m-1]/m;
return p;
}
int main()
{
int n;scanf("%d",&n);
... | 0 | 77,042,728 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::... | #include <iostream>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; ++x) {
for (int y = 0; y <= K; ++y) {
int z = S - x - y;
if (0 <= z && z <= K) ++ans;
}
}
cout << ans << endl;
return 0;
} | 0 | 61,684,485 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct UnionFind
{
std::vector<int> par, cou;
UnionFind(int N = 0) : par(N), cou(N, 1) {
iota(par.begin(), par.end(), 0);
}
int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
bool unite(int x, int y) {
x = find(x), y = fin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 0 | 16,330,535 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, fN = 0;
cin >> N;
M = N;
for(int i = 0; i < 8; i++) {
fN += N % 10;
N /= 10;
if (N == 0) {
break;
}
}
if(M % fN == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <map>
#include <queue>
#include <set>
#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 <<endl
#define cs(x) cout << x <<" "
#define A... | 0 | 85,454,559 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repa(i,a,n) for(int i=a;i<=n;i++)
#define repb(i,a,n) for(int i=a;i>=n;i--)
#define trav(a,x) for(auto a=x.begin();a!=x.end();a++)
#define all(x) x.begin(),x.end()
#define fst first
#define snd second
#define pb push_back
#define... | #include <cmath>
#include <cstdio>
#include <vector>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <stdio.h>
#include <functional>
#include <chrono>
#include <boost/version.hpp>
using namespace std;
... | 0 | 35,429,691 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
using n... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int A, B, C, D;
A = s.at(0) - '0';
B = s.at(1) - '0';
C = s.at(2) - '0';
D = s.at(3) - '0';
for (int tmp; tmp < (1 << 3); tmp++){
bitset<3> bit(tmp);
int sum = A;
char op1 = '-';
char op2 = '-';
char op3 =... | 0 | 43,341,314 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n; cin >> n;
map<ll, ll> m;
for(int i = 0; i < n; i++){
ll a; cin >> a;
m[a]++;
}
l... | #include <bits/stdc++.h>
using namespace std;
struct matrix
{
int r, c;
};
int min_chain_mul(vector<matrix> M) {
int c[M.size() + 1][M.size() + 1];
for (int i = 1; i <= M.size(); i++) {
c[i][i] = 0;
}
for (int l = 2; l <= M.size(); l++) {
for (int i = 1; i <= M.size() - l + 1; i++) ... | 0 | 91,513,622 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i =0; i < (n); ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
rep(i,m) cin >> L[i] >> R[i];
sort(R.begin(), R.end());
sort(L.begin(), L.end(),greater<int>());
int sms = R[0];
int ler = L[0];
int ans = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long num;
cin >> num;
vector<long long> vec(num+1);
for (int i = 0; i < num; i++) cin >> vec.at(i+1);
if (num % 2 == 0){
for (int i = num; i > 1; i -= 2){
cout << vec.at(i) << " ";
}
for (int i = 1; i... | 0 | 12,796,292 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main()
{
int n;
double ans=0;
cin>>n;
rep(i,n){
double a;
cin>>a;
ans+=1/a;
}
ans=1/ans;
printf("%.10f",ans);
} | #include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int i, j, d[7], d_next[7], num, top, front;
cin >> d[1] >> d[2] >> d[3] >> d[4] >> d[5] >> d[6];
cin >> num;
for(i=0;i<num;i++){
cin >> top >> front;
if (top == d[1]){
... | 0 | 81,180,505 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
string S;
cin >... | 0 | 20,352,799 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
ll a,b,k;
cin >> a >> b >> k;
if(a < k){
b -= k - a;
a = 0;
... | #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... | 0 | 95,337,826 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200005
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 10... | #include <iostream>
#include <vector>
#include <string>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
struct Four_digit {
string s1;
string s2;
int m;
int c;
int x;
int i;
};
vector<int> rewrite (string str);
void sum(vector<int> &v1, vector<int> &v2); ... | 0 | 73,417,871 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<max({a,b,c})-min({a,b,c})<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 91,652,315 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int X,Y;
cin>>X>>Y;
for(int i=0;i<=X;i++){
int t=X-i;
int asi=i*2+t*4;
if(asi==Y){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | 0 | 82,744,756 |
#include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define P 1000000007
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
void solve() {
int h, n, a[100010];
cin >> h... | #include <iostream>
using namespace std;
int main() {
int n,x;
int ans;
while(true){
ans = 0;
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n-2; ++i){
for(int j = i+1; j <= n-1; ++j){
if(i == j) continue;
for(int k = j+1; k <= n; ++k){
if(i == k || ... | 0 | 93,950,422 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a[100005];
scanf("%s",&a);
int n=strlen(a);
int p=0,q=0;
for(int i=0; i<n-1; i++)
{
if(a[i]==a[i+1])
{
q=i+1;
break;
}
}
for(int i=0; i<n-2; i++)
{
if(a[i]==a[i+2])
... | #include <bits/stdc++.h>
using namespace std;
int64_t msb(int64_t v){
v = v | (v >> 1);
v = v | (v >> 2);
v = v | (v >> 4);
v = v | (v >> 8);
v = v | (v >> 16);
v = v | (v >> 32);
return v ^ (v >> 1);
}
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int main(){
int N;
cin >> N;
... | 0 | 88,141,955 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<vector<int64_t>> data(N ,vector<int64_t>(3));
for(int i=0;i < N;i++){
for(int j=0;j < 3;j++){
cin >> data.at(i).at(j);
}
}
int64_t m=0;
int64_t sum=0;
vector<int64_t> datb(N, 0);
for(int i=0;i < N;i++){
datb.at... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | 0 | 99,304,626 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define all(x) (x).begin(),(x).end()
using ll = long long;
using namespace std;
int main() {
ll x,y;
cin>>x>>y;
ll a=x;
ll ans=1;
while(a<=y){
a*=2;
if(a<=y){
ans++;}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
map<int,int> mp;
rep(i,N) {
int a;
cin >> a;
++mp[a];
... | 0 | 40,667,618 |
#include "bits/stdc++.h"
#define int long long
#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 FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x <<... | 0 | 17,626,066 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int push = 0;
vector<int> a(n+1, 0);
for (int i = 1; i <= n; i++) cin >> a[i];
set<int> s;
int touch = 1;
while(true) {
s.insert(touch);
touch = a[touch];
push++;
if(touch == 2) break;
else if(s.count(touch))... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string ans = "No";
if (str.size() >= 4) {
if (str.at(0) == 'Y') {
if (str.at(1) == 'A') {
if (str.at(2) == 'K') {
if (str.at(3) == 'I') {
ans = "Yes";
}
}
}
}
}
... | 0 | 21,138,755 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h; cin >> h;
int h_lst[h+0];
for(int i=0;i<h+0;i++) cin >> h_lst[i];
for(int i=0;i<h+0;i++){
cout << "node " << i+1 << ": key = " << h_lst[i] << ", ";
if(i>0)
cout << "parent key = " << h_lst[(i-1)/2] << ", ";
... | 0 | 31,592,507 |
#include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 42,779,442 |
#include <stdio.h>
int main()
{
int n, Y, M, D;
int year = 20*5 + 19*5, year3 = 20*10;
int yearsum = 999*year + (int)(1000/3)*5;
scanf("%d", &n);
for( int i=0; i<n; i++ ){
scanf("%d %d %d", &Y, &M, &D);
Y--;M--;D--;
printf( "%d\n", yearsum - ( Y*year + (int)(Y/3)*5 + M*19 + D + (((Y+1)%3)?(int)((M+1)/2):M) )... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <map>
#include <iomanip>
#include <stdio.h>
#include <bitset>
typedef long long LL;
constexpr long long INFLL = 1e18;
using namespace std;
LL solve(LL temp)
{
LL ans;
LL count;
LL x = 0;
count = tem... | 0 | 98,700,403 |
#include <iostream>
using namespace std;
int main() {
int n;
int building[4][3][10] = {0};
int b,f,r,v;
cin >> n;
for(int i=0; i < n; ++i){
cin >> b >> f >> r >> v;
building[b-1][f-1][r-1] += v;
}
for(int i=0; i < 4; ++i){
if(i) cout << "####################" << endl;
for(int j=0; j < 3; +... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...)... | 0 | 72,562,919 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include<iostream>
#include<string>
#include<cctype>
#define rep(i,start,n) for(int i=start ; i<n ; i++)
using namespace std;
int main(){
int count=0,count2=0,x=0;
string taro,hanako;
cin >> x;
rep(i,0,x){
cin >> taro >> hanako; ... | 0 | 64,374,475 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <numeric>
#include <iterator>
using namespace std;
namespace {
}
int main()
{
int N;
cin >> N;
vector<int> a(N,0);
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 22,925,791 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define ALL(T) T.begin(), T.end()
using namespace std;
typedef pair<int, int> p... | #include <bits/stdc++.h>
#define MOD 1e9+7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
ll n;
cin >> n;
vector<ll> VA(n);
vector<ll> VB(n);
rep(i, n)
{
ll x, y;
cin >> x >> ... | 0 | 6,758,399 |
#include <stdio.h>
int main(void)
{
int a,b;
int d,r;
double aa,bb,f;
double ba = 1;
scanf("%d%d",&a,&b);
d = a / b;
r = a % b;
aa = a / ba;
bb = b / ba;
f = aa / bb;
printf("%d %d %f\n",d,r,f);
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | 0 | 56,748,263 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M;
cin >> N >> M;
vector<int> ok(N);
int ans1 = 0;
vector<int> memo(N);
int ans2 = 0;
for (int i = 0; i < M; i++) {
int a;
string b;
cin >> a >> b;
if (ok.at(a - 1) == 0 && b == "WA") {
memo.at(a - 1)++;
}
els... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 63,351,039 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,a,b;
cin>>n>>a>>b;
ll sum=a+b;
ll ans=n/sum*a;
ll sum2=n%sum;
ans+=min(a,sum2);
cout <<ans;
return 0;
} | #include<bits/stdc++.h>
typedef long long int lli;
#define vi vector<int>
#define vs vector<string>
#define pb push_back
#define endl "\n"
#define sortin sort(arr.begin(),arr.end())
#define inputArray for(int i{};i<n;i++){cin>>arr[i];}
#define inputArray1 for(int i{};i<m;i++){cin>>arr1[i];}
#define intloop for(int i{};... | 0 | 2,537,135 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
long long a,b,ans=0LL,mi=1000000000000000LL;
int f=0;
for (int i = 0; i < n; ++i)
{
cin>>a>>b;
if (a>b)
{
ans+=a;
mi=min(mi,b);
f=1;
}
else if (a<b)
{
ans+=a;
f=1;
}
else
{
ans... | #include<bits/stdc++.h>
typedef long long ll;
#define ff first
#define ss second
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
gcd(b,a%b);
}
ll lcd(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
int main()
{
i... | 0 | 91,582,474 |
#include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
typedef pair<lli, int> pii;
int main()
{
lli s;
cin >> s;
lli x = 1e9;
cout << "0 0 " << x << " 1 ";
lli c = (s+x-1)/x;
lli m = s%x;
co... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 84,043,513 |
#include <stdio.h>
#define N 2000000
int main(){
int n;
scanf("%d",&n);
int i;
int A[N];
for(i=1;i<=n;i++){
scanf("%d",&A[i]);
}
for(i=1;i<=n;i++){
printf("node %d: key = %d, ",i,A[i]);
if(i/2>0)printf("parent key = %d, ",A[i/2]);
if(i*2<=n)printf("left key = %d, ",A[i*2]);
if(i*2+1<=n)printf("right ke... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (n); i++)
#define REP(i,s,n) for(long long i = (s); i <= (n); i++)
#define repr(i,n) for(long long i = (n - 1); i >= 0; i--)
#define REPR(i,s,n) for(long long i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
#define rall... | 0 | 17,083,712 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc109_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 60,052,458 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allo... | #include<iostream>
using namespace std;
void show(int* a, int n)
{
for(int i = 0; i < n - 1; i++) cout << a[i] << " ";
cout << a[n - 1] << endl;
}
void SelectionSort(int* a, int n)
{
int i, j, c, minj, count;
count = 0;
for(i = 0; i < n; i++){
minj = i;
for(j = i; j < n; j++){
... | 0 | 2,472,845 |
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long M, long long X, long long Y, std::vector<long long> x, std::vector<long long> y){
sort(x.begin(), x.end(), greater<long long>());
sort(y.begin(), y.en... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <utility>
#include<functional>
#include <unordered_map>
#include <set>
using namespace std;
... | 0 | 2,281,385 |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 9982443... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 27,598,221 |
#include<bits/stdc++.h>
using namespace std;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(int i=a;i<(int)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(int)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
int K = 0,cnt = 1;
for(;K < N;cnt++)K += cnt;
if(K != N){
cout << "No" << endl;
return 0;
}
... | 0 | 11,329,532 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,b_num=0,ans=0,i=0;
cin >> N;
int data[N];
for(int i=0;i<N;i++) cin >> data[i];
for(int i=0;i<N;i++) data[i]--;
while(1){
ans++;
if(data[b_num] == 1) break;
int next = data[b_num];
if(i > 1... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 86,448,258 |
#include <iostream>
using namespace std;
int main(void){
int v[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<v[k-1];
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | 0 | 25,254,871 |
#include<iostream>
#include<string>
using namespace std;
int main ()
{
int a,b,c;
cin>>a>>b>>c;
if ((c<=b)&&(c>=a))
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N+1);
rep(i,N+1) {
cin >> a[i];
}
vector<long int> d_max(N+1), d_min(N+1), max(N+1);
bool tf = true;
reverse(a.begin(), a.end());
rep(i,N+1... | 0 | 49,849,013 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
long long N;
cin >> N;
long long count=0;
long long val;
long long min_val = N;
for(int i=0; i<N; i++){
cin >> val;
if(val <= min_val){
count += 1;
min_val = val;
... | #include<stdio.h>
int solve (int d)
{
int ans = 0;
int i=d;
while(i<600)
{
ans+=d*i*i;
i=i+d;
}
return ans;
}
int main()
{
int d;
while(scanf("%d",&d)==1)
{
printf("%d\n",solve(d));
}
return 0;
} | 0 | 66,467,152 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
int n, a[1010]={0};
while(cin >> n){
int min=1000001;
if(n == 0) break;
for(int i=0; i< n; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
... | #include<bits/stdc++.h>
#include<stack>
using namespace std;
int main(void) {
char str[105];
while(1){
cin.getline(str, sizeof(str));
if(str[0] == '.') break;
stack<char> s;
s.push('0');
int flag = 1;
for(int i = 0; str[i] != '\0'; i++){
if(str[i] == '... | 0 | 80,526,188 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
using namespace std;
int a[110];
int main()
{
int n, md = 0; cin >> n;
for (int i = 0; i < n; i ++){
int d; cin >> d; a[d] ++;
md = max(d, md);
}
int r = (md + 1) / 2;
for (int i = 0; i < r; i ++){
if (a[i] >= 1) return cout << "Impossible", 0;
}... | 0 | 10,292,144 |
#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;
bool ans = false;
sort(s.begin(), s.end());
if(s.at(0) == s.at(1) && s.at(2) == s.at(3) && s.at(0) != s.at(2))
cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (N < A + B - 1 || N > A * B) {
cout << "-1\n";
return 0;
}
if (B == 1) {
rep(i, N) {
cout << i + 1;
... | 0 | 54,092,083 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
LL k,maxx=9;
void bfs(){
queue<pair<LL,LL> > q;
q.push(make_pair(1ll,1ll));
q.push(make_pair(2ll,2ll));
q.push(make_pair(3ll,3ll));
q.push(make_pair(4ll,4ll));
q.push(make_pair(5ll,5ll));
q.push(make_pair(6ll,6ll));
q.push(make_pair(7... | 0 | 52,421,045 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<(n); i++)
#define REPS(i, n) for(int i=0; i<=(n); i++)
#define FOR(i, a, b) for(int i=a; i<(b); i++)
#define FORS(i, a, b) for(int i=a; i<=(b); i++)
#define ALL(v) (v).begin(),(v).end()
#define RAL... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> a;
int main() {
while (cin >> n) {
if (n == 0) break;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
int res = 1<<29;
for (int i = 0; i ... | 0 | 28,898,215 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+9;
ll a[N],p[69],n,sum,res;
void insert(ll x){
for(int i=60;i>=0;i--)if(x&(1ll<<i)){
if(!p[i]){p[i]=x;break;}
x^=p[i];
}
}
void solve(){
for(int i=60;i>=0;i--){
if(res+(res^sum)<(res^p[i])+(res^p[i]^su... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for... | 0 | 41,598,441 |
#include <iostream>
using namespace std;
struct point{
double x;
double y;
};
int ccw(point p0, point p1, point p2){
double dx1, dx2, dy1, dy2;
dx1 = p1.x - p0.x;
dy1 = p1.y - p0.y;
dx2 = p2.x - p0.x;
dy2 = p2.y - p0.y;
if(dx1 * dy2 > dy1 * dx2){
return 1;
}else if(dx1 * dy2 < dy1 * dx2){
return -1;
}else... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int h, w, k;
cin >> h >> w >> k;
char arr[h + 1][w + 1];
for(int i = 1;i <= h;i++)
{
for(int j = 1;j <= w;j++)
{
cin >> arr[i][j];
}
}
int cnt = 0;
for(int c1 = 0;c1 < (1 << h);c1++)
{
for(int c2 = 0;c2 < (1 << w);c2++)
... | 0 | 83,397,701 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong N,M;
llong cnt=0;
double total = 0.0;
cin >> N >> M;
vector<ll... | 0 | 14,245,674 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = 5 + 1e5;
int main(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++)
{
if (a % i == 0 && b % i == 0)
{
ans.push_back(i);
}
}
co... | 0 | 96,351,004 |
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,k;
cin >> n >> k;
vector<int> p(n);
rep(i,0,n) cin >> p[i];
sort(p.begin(),p.end());
int sum = 0;
rep(i,0,k) sum += p[i];
cout << sum << endl;... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e6;
int d[MAXN+1];
bool prime[MAXN+1];
int n;
void sieve(){
memset(prime,true,sizeof(prime));
for(int p=2; p*p<=MAXN; p++){
if(prime[p]){
for(int i=p*p; i<=MAXN; i+=p){
prime[i] = false;
d[i]... | 0 | 95,385,693 |
#include<stdio.h>
int main(){
int a,b,c,d,x,y;
while(1){
scanf("%d %d",&x,&y);
if(x==0&&y==0)break;
for(c=1;c<=y;c++){
printf("#");
}
printf("\n");
for(b=3;b<=x;b++){
printf("#");
for(a=3;a<=y;a++){
printf(".");
}
printf("#\n");
}
for(d=1;d<=y;d++){
printf("#");... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,ans=10000000;
cin >> N;
vector<int> ary(N);
for(int i = 0 ; i < N ; i++){
cin >> ary[i];
}
sort(ary.begin(),ary.end());
for(int i = 1 ; i <= ary[N-1] ;i ++){
int P = i;
int tmp = 0;
for(int j = 0 ; j < N ; j++){
tm... | 0 | 30,676,226 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int cnt[86401];
int toSec(string s) {
int h = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[3] - '0') * 10 + (s[4] - '0');
int sec = (s[6] - '0') * 10 + (s[7] - '0');
return h * 3600 + m * 60 + sec;
}
int main() {
while (cin >> n... | #include<bits/stdc++.h>
using namespace std;
int i,j,bo,ans;
string st;
int main()
{
getline(cin,st);
i=0;j=st.size()-1;
while(i<=j)
{
if(st[i]==st[j]) {i++;j--;continue;}
if(st[i]=='x') {i++;ans++;continue;}
if(st[j]=='x') {j--;ans++;continue;}
bo=1;break;
}
if(bo!=1) cout<<ans<<"\n";
else cout<<-1<... | 0 | 90,710,304 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begi... | #include<bits/stdc++.h>
using namespace std;
long long LCM(long long a,long long b);
signed main(){
int n;
cin>>n;
long long t[n+2];
for(int i=0;i<n;i++){
cin>>t[i];
}
long long sum=t[0];
for(int i=0;i<n;i++){
sum=LCM(sum,t[i]);
}
cout<<sum<<"\n";
return(0);
... | 0 | 82,363,833 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n-6>=0){
cout<<n/3;
}
else{
cout<<0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll N,cn=0,A=0,B=0,BA=0;cin>>N;
string s[10010];
rep(i,0,N){
cin>>s[i];
rep(j,0,s[i].size()-1){
if(s[i].at(j)=='A'&&s[i].at(j+1)=='B')cn++;
}
... | 0 | 53,956,766 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n,max,p,q;
max=0;
cin>>n;
vector<int> a(n);
vector<int> aa(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
if(max<a.at(i))
{
max=a.at(i);
p=i;
}
}
for(int i=0;i<n;i++)
{
aa.at(i)=a.at(i);
}
sort(aa.begin(),aa... | #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include... | 0 | 47,460,820 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
vector<string>S(N);
for(int i=0;i<N;i++){
vector<char>C(10);
string A; cin>>A;
for(int j=0;j<10;j++)C[j]=A.at(j);
sort(C.begin(),C.end());
for(int j=0;j<10;j++)A.at(j)=C[j];
S[i]=A;
}
sort(S.begin(),S.end());
lo... | #include<stdio.h>
#include<string.h>
char a[105][3],b[105][3],c[105][3];
void squt(char a[],char b[]){
char s[105];
strcpy(s,a);memset(a,0,strlen(a));
strcpy(a,b);memset(b,0,strlen(b));
strcpy(b,s);
}
int main(){
char s;
int n,m,i,j,k,bo=1;
scanf("%d%c",&n,&s);
for(i=0;i<n;i++){
scanf("%s",a[i])... | 0 | 68,090,304 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
ll table[1000][1000];
const ll mod =1000000007;
int main(){
string s;
cin >> s;
int st=-1;
int end=-1;
for (int ... | 0 | 55,903,224 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
#define endk '\n'
co... | #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 | 58,180,327 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <string>
using namespace std;
class cIsRightTriangle
{
public:
bool judge(vector<int>&);
};
bool cIsRightTriangle::judge(vector<int> &v)
{
sort(v.begin(), v.end());
if (v[2] * v[2] == (v[0] * v[0] + v[1] * v[1]))
return true;
e... | #include <bits/stdc++.h>
using namespace std;
bool lrp[2];
int lr[2];
void c(bool f,char s){
if(s=='u'){
if(lrp[f]==0){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=1;
}else {
if(lrp[f]==1){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=0;
}
}
int main(){
i... | 0 | 76,076,853 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define INF INT_MAX
vector<ll> dp;
ll f(vector<ll> &v,ll n,ll k)
{
ll i,j;
dp[0]=0;
for(i=1;i<=min(n,k);i++)
{
for(j=0;j<i;j++)
{
dp[i]=min(dp[i],dp[j]+abs(v[j]-v[i]));
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<vector<int> > A(3,vector<int>(3,0));
vector<vector<bool> > Abool(3,vector<bool>(3,0));
int ans = 0;
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
cin >> A.at(i).at(j);
}
}
... | 0 | 78,796,593 |
#include<bits/stdc++.h>
using namespace std;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
int ans=0;
struct UnionFind {
vector<int> sz;
vector<int> par;
UnionFind(int N) : sz(N),par(N) {
for(int i = 0; i < N; i++){
sz[i] = 1;
par[i] = i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int ,int > pii;
typedef map<int,int>mii;
#define test int ct;cin>>ct;while(ct--)
#define fo(i,n) for( i=0;i<n;i++)
#define el <<"\n"
#define sc(n) scanf("%d",&n)
#define scl(n) scanf("%lld",&n)
#define sq(a) (a)*(a)
... | 0 | 3,178,615 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;
int main(){
ll n, k;
cin >> n >> k;
vector<ll> a(n), b(n);
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
ll ans = 0;
for(int i = 0; i <= 30; i++){
if(i != 0 && (k & (1L... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<string>
using namespace std;
int temp[5];
bool compare(int a,int b)
{
return a>b;
}
int main()
{
while(~scanf("%d",&temp[0]))
{
for(int i=1;i<5;i++)
cin>>temp[i];
sort(temp,temp+5,c... | 0 | 81,231,944 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
int main() {
ll n, p;
ll ans = 0;
cin >> n >> p;
string s;
cin >> s;
if (p == 2 || p == 5) {
rep(i, n) {
if ((s[i] - '0') % p == 0)ans += i + 1;
}
cout << ans << endl;
return 0;
}
else {
... | #include <bits/stdc++.h>
using namespace std;
struct dice{
vector<int> diceindex{0,1,2,3,4,5};
vector<int> dicenum{1,2,3,4,5,6};
void setNumber(vector<int> &setnum){
for(int i = 0; i < 6; i++){
dicenum[diceindex[i]] = setnum[diceindex[i]];
}
return;
}
vector<int> get... | 0 | 76,012,546 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#de... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 46,211,546 |
#include <stdio.h>
#include <string.h>
int main() {
char n[255];
scanf("%[^\n]", &n);
int len = strlen(n);
for(int i = 0; i < len; i++){
if(n[i] == ','){
printf(" ");
}
else {
printf("%c", n[i]);
}
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#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 ... | 0 | 22,360,546 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define X real()
#define Y imag()
using namespace std;
us... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int N, K; cin >> N >> K;
ll A[N]; rep(i, N) cin >> A[i];
vector<ll> bt(N*(N+1)/2);
int idx = 0;
for(int i = 0; i < N; i++){
ll ... | 0 | 87,354,783 |
#include <iostream>
using namespace std;
const int mxN = 2e5 + 5;
int a[mxN];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i];
int answer = 0, look = 1;
if(n == 1)
return cout << (a[1] == 1 ? 0 : -1), 0;
for(int i = 1; i <= n; ++i) {
if(a[i] == look) {
++look;
continue;
}
++... | #include<bits/stdc++.h>
#define rep(X,A,B) for(int X=A;X<=B;X++)
#define tep(X,A,B) for(int X=A;X>=B;X--)
#define LL long long
#define DB double
const int N=400010;
const int M=800010;
using namespace std;
int n;
map<LL,int> mp;
LL sz[N];
int fa[N],edge[M],lst[N],nxt[M],t=0;
struct nn{
LL d;
int id;
}a[N];
int cmp(nn... | 0 | 57,462,306 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, a, b;
cin >> n >> m;
vector<vector<bool>> vn(n, vector<bool>(n,false));
for(int i=0; i<m; ++i){
cin >> a >> b;
--a; --b;
vn[a][b] = true;
vn[b][a] = true;
}
vector<vector<int>> dp(n, vector<int>((1<<n),0));
dp[0][1] = 1;
... | 0 | 23,918,971 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | #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()
{
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
... | 0 | 5,458,179 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main() {
int n, a[MAX];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int L[MAX], l;
L[0] = a[0];
l = 1;
for (int i = 1; i < n; i++) {
if (L[l - 1] < a[i]) {
L[l++] = a[i];
} else {
*lower_bound(L, L + l, a[i]) = a[i];
}
}
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<climits>
#define MOD 1000000007
typedef long long ll;
using namespace std;
struct UnionFind{
vector<int> par;... | 0 | 44,190,015 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
ll a[... | #include<iostream>
using namespace std;
int main()
{
int h[10];
int i,j;
int temp=0;
for(i=0; i<10; i++)
{
cin>>h[i];
}
for(i=0; i<9; i++)
{
for(j=i+1; j<10; j++)
{
if(h[j]>h[i])
{
temp=h[j];
h[j]=h[i];
h[i]=temp;
}
}
}
f... | 0 | 94,938,937 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.