code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#define DIV 1000000007
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int S[N+1], T[M+1];
for(int i=0; i<N; i++){
cin >> S[i];
}
S[N] = -1;
for(int i=0; i<M; i++){
cin >> T[i];
}
T[M] = -1;
long dp[N+1][M+1];
long sum[N+1][M+1];
... | #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define NUM 100
#define INF 1000000000
int X_dim[NUM];
int Y_dim[NUM];
int M[NUM][NUM];
void init(){
for(int i = 0; i < NUM; i++){
for(int j = 0; j < NUM; j++){
if(i == j){
M[i][j] = 0;
}els... | 0 | 62,001,066 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0;i < N;i++){
cin >> vec[i];
}
int max = *max_element(vec.begin(),vec.end());
for(int i = 0;i < N;i++){
vec[i] *= 2;
}
*max_element(vec.begin(),vec.end()) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | 0 | 66,815,201 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,y,z,i;
cin>>n;
x=n*800;
y=n/15;
z=y*200;
i=x-z;
cout<<i<<endl;
return 0;
} | #include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int x;
scanf("%d",&x);
if(x>=400&&x<=599)
printf("8");
else if(x>=600&&x<=799)
printf("7");
else if(x>=800&&x<=999)
printf("6");
else if(x>=1000&&x<=1199)
printf("5");
else if(x>=1200&&x<=1399)
printf("4");
else if(x>=1400&&x<=1599)
pr... | 0 | 71,653,678 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
vector<long long int> a(k);
for(int i=0; i<k; i++){
cin >> a[i];
}
reverse(a.begin(),a.end());
if(a[0] != 2){
cout << -1 << endl;
return 0;
}
long long int nmax = 2, nmin = 2;
for(i... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 65,372,136 |
#include<stdio.h>
#include<stdlib.h>
#define MAX 2000000
#define VMAX 10000
int main(){
int *A,*B;
int C[VMAX + 1];
int n, i,j;
scanf("%d", &n);
A = new int[n+1];
B = new int[n+1];
for (i = 0; i <= VMAX; i++){
C[i] = 0;
}
for (int i = 0; i < n; i++){
scanf("%d", &j);
A[i + 1] = j;
C[A[i + 1]]++;
}
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 90000000000000000;
int PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll,ll>>>;
struct UnionF... | 0 | 29,063,845 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N,M; cin >> N... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void... | 0 | 88,380,667 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to) - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typena... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <climits>
#include <utility>
typedef long long ll;
using namespace std;
int main(void){
int h, w, i, j, d, q, l, r, a;
vector<pair<int,int> > b;
vector<int> ... | 0 | 51,452,834 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long fact(int num){
if(num==0) return 1;
return num*fact(num-1);
}
int main(){
unsigned long long n =0;
cin>>n;
n = fact(n);
cout<<n<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <s... | 0 | 80,283,227 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a / 2 * 2 == a || b / 2 * 2 == b) {
cout << "Even" <<endl;
}
else {
cout << "Odd" <<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
ll dp[110][2][5];
int main() {
string N;
int K;
cin>>N>>K;
int n=N.size();
dp[0][0][0]=1;
rep(dgt,n){
rep(isless,2)... | 0 | 99,604,543 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
int N;
int a[1001];
cin >> N;
while(N>0){
REP(i,N)cin >> a[i];
int m = 1e9;
REP(i,N){
REP(j,N){
if(i != j)m = min(m, abs(a[i] - a[j]));
}
}
cout << m << endl;
cin >> N;
}
return 0;
} | # include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n = 0, c, d, e, f;
cin >> a >> b;
for (int i = a; i <= b; i++)
{
c = i / 10000;
d = i % 10;
e = (i / 10) % 10;
f = (i / 1000) % 10;
if (c == d && e == f) n++;
}
cout << n;
} | 0 | 47,709,298 |
#include <vector>
#include <iostream>
using namespace std;
using ll = long long int;
int main(){
int n; cin >> n;
int current = 0;
ll ans = 0;
for(int i=0; i<n; i++){
int a; cin >> a;
if(i == 0){
current++;
if(a > 1){
ans += a-1;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 71,057,492 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n;
vector<string> blue(n);
for(int i=0; i<n; i++)
cin >> blue.at(i);
cin >> m;
vector<string> red(m);
for(int i=0; i<m; i++)
cin >> red.at(i);
int r=0, b=0;
for(int i=0; i<n; i++){
b = 0;
for(int j=0; j<n; j++){
if(blue.at(i) ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S;
ll K;
cin >> S >> K;
vector<p... | 0 | 90,056,351 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inli... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define countof(a) (sizeof(a)/sizeof(*a))
#define vi vector<int>
#define vvi vector<vector<int> >
#define vpi vector<pi >
#define pi pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FR... | 0 | 61,238,613 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
int A[N];
string s;
int32_t main(){
fast;
cin >> s;
int n = s.size() ;
int ans = 0 , c = 0;
for(int i = 0; i < n ; ++i)... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll Gc... | 0 | 64,748,385 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i, N){
cin >> vec.at(i);
}
int light = 1;
int count = 0;
bool goal = false;
rep(i, N)
{
light = vec.at(light - 1... | #include<iostream>
using namespace std;
const int N = 1e5 + 7;
bool vis[N][100];
int suma(int n)
{
int res = 0;
while(n > 0)
{
res += n % 10;
n /= 10;
}
return res;
}
int n;
void dfs(int r, int s)
{
if(s >= 50) return;
if(vis[r][s]) return;
vis[r][s] = 1;
for(int i = ... | 0 | 21,742,797 |
#include<bits/stdc++.h>
using namespace std;
int main (void){
int x[5];
int y[5];
cin >> x[0] >> y[0] >> x[1] >> y[1];
double l = 0,g = 0,j = 0,h = 0;
int a = 0,b = 0;
a = x[0] - x[1];
b = y[0] - y[1];
x[2] = b + x[1];
y[2] = -a + y[1];
a = x[1] - x[0];
b = y[1] - y[0];
x[3] = -b + x[0];
y[3] ... | #include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 100000;
int n, pa[MAX], ch[MAX], br[MAX];
void solve(){
for(int i=0;i<n;i++){
cout << "node " << i << ": parent = " << pa[i] << ", depth = " << flush;
int cnt = 0;
for(int j=i; pa[j]!=-1; j=pa[j]) cnt++;
cout << cnt << ", " ... | 0 | 65,966,243 |
#include <bits/stdc++.h>
int gcd(int a, int b) {
if (a < b) {
std::swap(a, b);
}
while (b > 0) {
int tmp_b = a - b * (a / b);
a = b;
b = tmp_b;
}
return a;
}
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> vals(N);
std::cin >> vals[0];
... | #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;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 93,220,279 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s;
int ans = 0;
t = "YAKI";
if(s.substr(0,4)==t.substr(0,4)) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define pb push_back
#define pf push_front
#define eb... | 0 | 100,540,558 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){
if(a>b) {
a = b;
return true;
}
return false;
}
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
... | #include <iostream>
#include <vector>
#include <algorithm>
namespace ABC169
{
class B
{
public:
B() = default;
~B() = default;
void Run()
{
int N;
long long A[100001];
std::cin >> N;
bool over = false;
long long accm = 1;
for (int i = 0; i < N; ++i)
{
... | 0 | 4,431,017 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int ans=1e18;
int n;
vector<int> a(n);
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N), y(M);
for (int i=0; i<N; i++) cin >> x[i];
for (int i=0; i<M; i++) cin >> y[i];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
if (x[N-1] >= y[0]){
cout <... | 0 | 61,017,837 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,h,w;
cin>>n>>h>>w;
int a,b,ans=0;
for (int i = 0; i < n; ++i)
{
cin>>a>>b;
if (h<=a&&w<=b)
{
++ans;
}
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 85,914,436 |
#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;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int a[5];
rep(i,5) cin >> a[i];
int ten[5] = {0};
int max = 0,maxnum = 0;
int cou = 0;
for(int i = 0; i < 5; i++){
while((a[i] + cou) % 10 != 0){
ten[i]++;
cou++;
}
if(ten... | 0 | 52,262,339 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main(){
cin >> s >> t;
int cnt = 0;
for (int i=0; i<3; i++){
if(s.at(i) == t.at(i)){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#de... | 0 | 69,538,038 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(100001, 0);
for (int i = 0; i < N; i++){
cin >> A.at(i);
B.at(A.at(i))++;
}
int count_1 = 0, count_2 = 0;
for (int i = 1; i <= 100000; i++){
if (B.at(i) != 0... | 0 | 12,572,080 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define lwr lower_bound
#define upr upper_bound
#define pq priority_queue
#define umap unordered_map
#define rep(i,n) for(i=0; i<... | #ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x),... | 0 | 15,367,534 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<int> a(n, 0);
vector<ll> ans(n, 0);
ll fee = 0;
for (ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll tmp = 0;
for (ll i = 0; i < n + 1; i++)
{
if (i == n)
{
fee += abs(tmp - 0);
... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
template <typename T>
class WeightedUnionFind{
private:
std::vector<int> par;
std::vector<int> rnk;
std::vector<T> diff;
public:
WeightedUnionFind(int n):par(n),rnk(n),dif... | 0 | 24,445,590 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | #include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
int n;
string str;
int l=0, r=0;
int before=0;
int cnt=0;
cin >> n;
if(!n) break;
for(int i=0;i<n;++i){
cin >> str;
if(str == "lu") l = 1;
... | 0 | 84,119,894 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | #include <iostream>
using namespace std;
const int INF = 1<<29;
const int N = 10;
int main(){
int n;
while(true){
cin >> n;
if(!n) break;
int dp[N][N];
for(int i=0;i<N;i++)
for(int j=0;j<N;j++) dp[i][j] = INF;
int a,b,c;
while(n--){
cin >> a >>... | 0 | 61,389,078 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define loop(i,x,n) for(ll i = x;i<n;i++)
#define S(v) sort(v.begin(), v.end());
#define ff first
#define ss second
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
set<char> s;
loop(i,0,4){
char x;
cin>>x;
s.insert(x);
}
c... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
Int W, H;
cin >> W >> H;
vector<pair<Int, Int>> cost;
for (int i = 0; i < W; ++i) {
Int p; cin >> p;
cost.emplace_back(p, 0);
}
for (int i = 0; i < H; ++i) {
Int q; cin >> q;
cost.emplace_back(q, 1);
}
sort(cost.begin(), cost... | 0 | 11,169,589 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int a, b, c; cin >> a >> b >> c;
int k; cin >> k;
int sum = 0;
while (a >= b) {
b *= 2;
sum++;
}
while (b >= c) {
c *= 2;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll ar[500009],br[500009],cr[500009];
int main()
{
ll a,b,c,i,j=0,k;
string s;
cin>>a;
for(i=1; i<=a; i++)
{
cin>>ar[i];
}
for(i=0;i<=a+1;i++)
{
j=j+abs(ar[i]-ar[i-1]);
}
for(i=1; i<=a; i++)
... | 0 | 83,392,739 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 0 | 94,921,894 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
cout << 8 - ((x - 400) / 200) << endl;
} | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define acc(v) accumulate(v.begin(), v.end(), 0)
using namespace std;
typedef long long ll;
const int INF = 1e9... | 0 | 57,677,169 |
#include <iostream>
#include <cstdio>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <string>
#include <ctype.h>
using namespace std;
void solve()
{
string x;
while (cin >> x)
{
if (x == "0")
{
break;
}
int ans = 0;
for (int i = 0; i < x.size(); ++i)
{
ans += x[i] - '0';
}... | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a;
while(cin>>a>>b>>c){
if(a>b){
if(c>a){
if(c*c==a*a+b*b){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}else{
if(a*a==c*c+b*b){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}
}else{
if... | 0 | 12,350,251 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.length();
if (n <= 1)
cout << "-1 -1";
else {
bool flag = false;
if (str[1] == str[0]) {
cout << "1 2";
flag = true;
}
else {
for (int i=2; i<str.length(); i++) {
if (str[i] == str[i-1]) {
cou... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 72,827,414 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(); cout.tie(0)
#define MAXX 1005
int n , k;
string s;
int main()
{
_FastIO;
cin >> n;
cin >> s;
cin >> k;
char c = s[k - 1];
for(int i = 0; i < n;... | 0 | 31,975,228 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
int main(){
long long N,T;
cin >> N >> T;
vector<long long> t(N,0);
long long sum=0;
for(long long i=0;i<N;i++){
cin >> t[i];
if(i==0){
sum+=0;
}
if(i>=1){
... | 0 | 42,677,012 |
#include <bits/stdc++.h>
#define N 100010
using namespace std;
int n,a[N],fir[N],to[N<<1],nxt[N<<1],c[N<<1],tot(1),d[N],root,s[N],ok(0);
template <class Aqua>
inline void read(Aqua &s){
s=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) s=s*10+c-'0',c=getchar();
}
inline void add(int u,int v)... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#de... | 0 | 9,215,471 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 1999999999
#define pa pair<int,int>
using namespace std;
int nibun(int a[],int d,int l,int h){
if(h-l<=1 && a[h]>d) return l;
else if(h-l<=1) ret... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 29,354,711 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main() {
int a, b;
int d, r;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (double)a / (double)b;
printf("%d %d %lf\n", d, r, f);
} | #include <iostream>
using namespace std;
const int MAX = 100005;
const int NIL = -1;
struct Node{
int p;
int l;
int r;
};
Node T[MAX];
int n, D[MAX];
void print(int u){
int i, c;
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << D[u] << ", ";
if(T[u].p == NIL) co... | 0 | 39,454,211 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | 0 | 52,571,785 |
#include<cstdio>
#include<iostream>
using namespace std;
const int N=100010;
struct tyc{
int to,next;
}e[4*N];
int head[N],n,m,size=0;
int x,y;
int oh,si,oth;
long long ans;
bool p=0;
bool vis[N],color[N];
void add(int x,int y)
{
size++;
e[size].to=y;
e[size].next=head[x];
head[x]=size;
}
void dfs(int x,int fa)
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dob double
int main(){
int a,b;
cin>>a>>b;
if (a + b == 3){
cout<<3;
}
else if (a + b == 4){
cout<<2;
}
else{
cout<<1;
}
return 0;
} | 0 | 62,703,103 |
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int M = 1e9+7;
const int N = 2*1e5;
int hasSnack[105];
int main(){
AC
int n, k;
cin>>n>>k;
for(int i=0; i<k; i++){
int d;
cin>... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 52,658,374 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a, b;
int x;
cin >> a >> b;
x = (a+b)/2+0.5;
cout << x;
} | #include<bits/stdc++.h>
using namespace std;
const bool DBG = 1;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a,b) TRACE(for(auto it=a; it!=b;) cout<<*(it++)<<" ";cout<<endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begi... | 0 | 89,647,229 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
#define endll "\n"
#define fin freopen("input.txt","r",stdin);
#define fout freopen("output.txt","w",stdout);
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k,s,c=0;
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 0 | 9,358,528 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n, sum;
bool flg = false;
cin >> n;
vector<ll> t(n+1,0), x(n+1,0), y(n+1,0);
for (int i = 1; i <= n;i++){
cin >> t[i] >> x[i] >> y[i];
sum = t[i] - t[i - 1];
sum -= abs(x[i - 1] - x[i]) + abs(y[i - 1] - y[i]);
if... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9+7;
using Graph = vector<vector<ll>... | 0 | 49,217,134 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
lli k;
int main(void){
cin >> s >> k;
while(s[0] == '1'){
k--;
if(k == 0){
cout << s[0] << endl;
return 0;
}
s = s.substr(1);
}
cout << s[0] << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
... | 0 | 82,737,809 |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
#define db(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<'\n'
const int inf = 1e9+7;
const int N = 1e6+9;
int main() {
ios_base::sync_with_stdio(0);
int a,b,n;
cin>>n>>a>>b;
int ok=0;
... | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#defin... | 0 | 1,829,951 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) nu... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A;
int B;
int C;
int D;
int L;
int R;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
L = A + B;
R = C + D;
if(L > R)
{
cout << "Left" << endl;
}
else if(L == R)
{
cout << "Balanced... | 0 | 26,783,397 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout <<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main(){
int N;
cin >> N;
int l = -1,r = N;
cout << 0 << endl;
string S;
cin >> S;
if(S == "Vacant") {
... | 0 | 52,131,510 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int n,m,A[1100000],sum = 0;
cin >> n >> m;
for(int i = 0; i <m; i++) {
cin >> A[i];
sum += A[i];
}
if(sum <= n) cout << n-sum <... | #include<cstdio>
int a[100005], b[100005];
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++) scanf("%d%d",&a[i],&b[i]);
long long ans = 0;
for(int i = 1; i <= n; i++){
int left = a[i]&(~k);
if(left==0) ans += (long long)b[i];
}
int allOne = (1<<30)-1;
... | 0 | 35,938,068 |
#include <iostream>
using namespace std;
int main(void) {
int x, y;
cin >> x >> y;
string s = "";
if (x == y)
{
s = " == ";
} else if (x > y) {
s = " > ";
} else {
s = " < ";
}
cout << "a" << s << "b" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 92,738,452 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,maxv=INT_MIN,minv=INT_MAX;
int temp;
cin >> n;
while(n--){
cin >> temp;
maxv=max(maxv,temp);
minv=min(temp,minv);
}
cout << maxv-minv << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 7,761,143 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
string a;
cin>>a;
for(int i=0;i<12;i++){
if(i==4) cout<<" ";
cout<<a[i];
}
cout<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#d... | 0 | 82,827,299 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i=0;i<(n);i++)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
using namespace std;
void solve(long long N, long long M, std::vector<long long> A, std::vector<long long> B){
vector<pair<ll,ll>> vec(N);
REP(i,N) vec[i] = pair<ll,ll>(A[i]... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> d(3);
for (int i = 0; i < 3; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int x = d.at(2) - d.at(1);
int y = d.at(2) - d.at(0);
int ans;
if (x % 2 == 0 && y % 2 == 0) {
ans... | 0 | 73,641,052 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint ans;
vector<lint> enum_divisors(lint N) {
vector<lint> res;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), r... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef char str255[256];
#define BIG_PRIME 1'000'000'007
#define BP_remainder(x) ((x) % BIG_PRIME)
const int INF = 1 << 30;
const int INF_NEG = INF * -... | 0 | 99,892,121 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
long double L,ans;
cin >> L;
ans = pow(L/3,3);
cout << fixed;
cout << setprecision(12) <<ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
string S; cin>>S;
int K; cin>>K;
int64_t ans;
bool allSame=true;
rep(i,0,S.size()) if(S.at(i... | 0 | 12,756,580 |
#include<iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <cstdio>
#include <cstring>
#include<cmath>
#include <bitset>
typedef long long ll;
const int maxn = 1e5+7;
int c[maxn],v[maxn];
using namespace std;
int main() {
ll x,y;... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <utility>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#define rep(i, a, n) for(int (i) = (int)(a);(i) < (int)(n);++(i))
#define repe(i, a, n) ... | 0 | 71,841,153 |
#include<cstdio>
int main(void)
{
int n,k;
scanf("%d %d" ,&n,&k);
printf("%d" , n%k>0);
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | 0 | 20,573,773 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | #include<stdio.h>
#include<math.h>
int main(void){
double x1,x2,x3,xp,y1,y2,y3,yp,l12,l23,l13,l1p,l2p,l3p,S123,S12p,S23p,S13p;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp)!=EOF){
l12=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
l23=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
l13=sqrt((x1-... | 0 | 40,516,502 |
#include <bits/stdc++.h>
#define rep(a,n) for (int a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool c... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 94,327,271 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) pu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E12;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_bac... | 0 | 55,729,158 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> W(N);
bool ok = true;
for (int i = 0; i < N; i++) {
cin >> W.at(i);
for (int j = 0; j < i; j++) {
if (W.at(i) == W.at(j)) {
ok = false;
}
}
}
for (int i = 1; i < N; i++) {
int C ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
... | 0 | 30,361,654 |
#include<bits/stdc++.h>
using namespace std;
#define NitroBoost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long
#define fori(i,l,n) for(int i=l;i<n;i++)
#define ford(i,n,l) for(int i=n;i>l;i--)
#define All(i,x) for(auto i=x.begin();i!=x.end();++i)
#define gcd(a,b) __gcd((a),(b)... | #include <bits/stdc++.h>
int main() {
long long n;
std::cin >> n;
std::vector<long long> a(n);
for (int i = 0; i < n; i++) std::cin >> a[i];
std::vector<std::set<long long>> g(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
std::cin >> a >> b; a--; b--;
g[a].insert(b);
... | 0 | 47,468,560 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
double x1,x2,y1,y2;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
string a;
cin >> a;
int n = a.length();
int cnt[26];
for (int i = 0; i < 26; i++) cnt[i] = 0;
ll ans = 1;
for (int i = 0; i < n; i++) {
int c = a[i... | 0 | 51,895,663 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> c(h,vector<char>(w));
rep(i,h){
rep(j,w){
cin >> c... | 0 | 89,263,266 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
t... | #include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | 0 | 61,501,659 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
vector<vector<char>> c(2,vector<char>(3));
rep(i,2){
rep(j,3){
cin >> c.at(i).at(j);
}
}
bool a=true... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> cards;
while (true) {
int m;
string now;
cin >> now;
if (now == "-")
break;
cin >> m;
for (int i=0;i<m;i++) {
int h;
cin >> h;
now = now + now.substr(0, h);
... | 0 | 46,808,653 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int A[1];
int size=1;
int m=2;
#define N 101
#define mod 1000000007
#define f(i,n) for(int i=0;i<n;i++)
bool Binary(vector<int> arr,int n,int ele,int b)
{ int l=0,r=n-1,m;
while(l<=r)
{... | 0 | 39,725,847 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
rep(i, n)cin >... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B;
cin >> S;
int l = A + B + 1;
if(S.length() != l) {
cout << "No" << endl;
return 0;
}
if(S[A] != '-') {
cout << "No" << endl;
return 0;
}
char num[10];
for(int i=0; i<=9... | 0 | 17,780,458 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
int result = 0;
for(int h : vec){
if (k <= h){
result++;
}
}
cout << result << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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 ... | 0 | 91,067,630 |
#include <stdio.h>
int main(void) {
int H[100000], W[100000];
int i, j, k, n = 0;
do {
scanf("%d %d", &H[n], &W[n]);
n++;
} while (!(H[n - 1] == 0 && W[n - 1] == 0));
for (j = 0; j < H[0]; j++) {
for (k = 0; k < W[0]; k++) {
printf("#");
}
puts("");
}
for (i = 1; i < n; i++) {
... | #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 | 92,519,161 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
stack<int> stk;
int input;
in... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int N, M; cin >> N >> M;
vector<ll> S;
ll A[N]; rep(i, N) cin >> A[i];
ll ruiseki[N+1]; ruiseki[0] = 0; rep(i, N) ruiseki[i+1] = ruiseki[i] + A[i];
f... | 0 | 11,859,846 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, num, prenum;
ll h = 0;
cin >> n;
cin >> num;
n--;
prenum = num;
while(n--) {
cin >> num;
if(num < prenum) {
h += prenum-num;
num = prenum;
}
prenum = num;
}
cout << h;
return 0;
} | #include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<map>
#include<set>
#include<vector>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<numeric>
#include<string>
#include<tuple>
using namespace std;
#define BEGIN ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#de... | 0 | 32,153,084 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
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 < ... | #include<iostream>
using namespace std;
int main(){
int count = 0;
int counter = 0;
int a[10000][3];
while (1){
for (int i = 0; i < 3; i++){
cin >> a[count][i];
}
if (a[count][0] == -1 && a[count][1] == -1 && a[count][2] == -1){
break;
}
count += 1;
}
while (1){
if (a[counter][0] == -1 || a[coun... | 0 | 41,598,834 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A;
cin >> A;
int G = A, M = A;
for (int i = 1; i < N; i++) {
int a;
cin >> a;
G = __gcd(a, G);
M = max(a, M);
}
if (K <= M && K % G == 0) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << end... | #include <queue>
#include <vector>
#include <cstdio>
#include <algorithm>
int v,e,in[10005];
std::queue<int> q;
std::vector<int> g[10005];
int main()
{
scanf("%d%d",&v,&e);
while(e--)
{
int x,y;
scanf("%d%d",&x,&y);
g[x].push_back(y);
in[y]++;
}
for(int i=0;i<v;i++)
... | 0 | 57,955,724 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
set<int> reach;
vector<pair<int, int> > p(m);
rep(i, m)
{
cin >> p[i].first >> p[i].second;
if (p[i].second == n)
reach.insert(p[i].first);
}
rep(i, m)
{
if (p[i].f... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
ll pow(ll a, ll b, ll m)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
}
return ans;
}
int... | 0 | 98,295,867 |
#include <iostream>
#include <string>
using namespace std;
int parse(string str) {
int rtn = 0;
int tmp = 1;
for (int i=0; i<str.size(); i++) {
if (str[i] >= '2' && str[i] <= '9') {
tmp = (int) str[i] - (int) '0';
} else {
switch (str[i]) {
case 'm':
rtn += tmp * 1000;
break;
case 'c':
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for(int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
ll... | 0 | 77,656,576 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
long long int ans = 0;
for(int i = n-1; i >= 0; i--){
if((a[i]+ans)%b[i] != 0){
ans += b[i] - (a[i]+ans)%b[i];
... | #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... | 0 | 67,633,740 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
ll n;
vector<bool> tobit(ll inp) {
vector<bool> v(n, 0);
int i = 0;
while(inp) {
v[i] = inp % 2;
inp /= 2;
i++;
}
return v;
}
int main() {
ll k... | 0 | 96,927,470 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
set<int>s;
for(int i = 0;i<n; i++)
{
int j;
cin>>j;
s.insert(j);
}
if(s.size()&1) cout<<s.size()<<endl... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 0 | 48,209,434 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 1050000000
using namespace std;
int par[10001];
... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cstdint>
using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using namespace std;
vector<int> create_primes(){
char is_prime[1001] = {0};
for(int i = 2; i < 1001; i++){
... | 0 | 52,885,015 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 17,824,334 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> h(N);
int M;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
M = max(M, h.at(i));
}
int ans = 0;
for (int i = 1; i <= M; i++) {
int memo = 0;
for (int j = 0; j < N; j++) {
if (h.at(j) >= i) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll res = 0;
ll two_factor = 1;
for (int d = 0; d < 60; ++d) {
... | 0 | 34,712,870 |
#include<bits/stdc++.h>
#define lg long long int
#define loop(i,s,e) for(lg i=s;i<=e;i++)
#define iloop(i,s,e) for(lg i=e;i>=s;i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
lg min(lg a,lg b)
{return a<b?a:b;}
lg max(lg a,lg b)
{return a>b?a:b;}
lg lcm(lg a ,lg b)
{
retur... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <climits>
using namespace std;
int main() {cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
long long... | 0 | 3,909,418 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <iostream>
#include <string>
#define rep(i, n) for(int i = 0 ; i < n ; i++)
using namespace std;
void dfs(int x, int y);
int cnt = 0;
string data[20];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int w, h;
int main()
{
while(true){
cin >> w >> h;
if(w == 0 && h == 0) break;
int sx,... | 0 | 18,755,773 |
#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;
bool find(string s,char c){
for(char cc:s){
if(c == cc)return 1;
}
return 0;
}
main(){
string s1 = "qwertasdfgzxcvb";
string S;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h,w;
ll direction2[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
bool valid(int a,int b)
{
if(a>=1&&a<=h&&b>=1&&b<=w)return true;
else return false;
}
int main()
{
cin>>h>>w;
char l1[h+1][w+1];
for(int i=1;i<=h;i++){
for(int j=1;j<=w;... | 0 | 70,755,283 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a,b;
cin>>a>>b;
double ans=1.0*(a/(1.0*b));
printf("%0.5lf\n",ans);
return 0;
} | #include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector <int>
#define vlli vector <lli>
#define vulli vector <ulli>
#define vchar v... | 0 | 72,770,586 |
#include <iostream>
#define MAX 36
using namespace std;
void showArray(char C[][3], int N){
int flag = 0;
for (int p = 0; p < N - 1; p++){
cout << C[p][0] << C[p][1] << " ";
if (C[p][1] == C[p + 1][1] && C[p][2] > C[p + 1][2]){
flag = 1;
}
}
cout << C[N - 1][0] << C[N - 1][1]<< endl;
if (flag == 0){
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
typedef tuple<ll, ll, ll> P;
int main() {
int n; cin >> n;
n--;
vector<P> A;
loop(i,0,n) {
int a, b, c; cin >> a >> b >> c;
A.emplace_back(a, b, c);
}
vector... | 0 | 83,021,246 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #include <iostream>
#include <map>
using namespace std;
const int maxn=3e5+10;
struct point {
int x,y;
}p[maxn];
map<int,int>xcnt,ycnt;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m,k;
cin>>n>>m>>k;
int x,y,maxr=0,maxc=0;
for(int i=1; i<=k; i++){
cin>>x>>y;
... | 0 | 17,660,304 |
#include<bits/stdc++.h>
#include<vector>
#define inf 1000000
#define ll unsigned long long
#define boostUP ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define fsr(i,n) for(ll i=0;i<n;i++)
#define fcr(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define sz(arr) sizeof(arr)/sizeof(arr[0])
using namespace std;... | #include <iostream>
#include <cstdlib>
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
int i,j,len,lenr,lenp;
string s,m,m2,n,m3,n2;
cin >> s;
len=s.size();
lenr=(len-1)/2;
m=s;
m2=s.substr(0,lenr);
n=m2;
m3=s.substr((len+3)/2-1,lenr);
n2=m3;
rev... | 0 | 82,687,391 |
#include <bits/stdc++.h>
#define mid ((l+r)>>1)
using namespace std;
typedef long long lnt;
template <class T> inline void read(T &x) {
x = 0; int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar()) if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f*(c-'0');
}
int n; lnt a[55], s, tot;
bool c... | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define ... | 0 | 39,974,680 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using itn = int;
int main(void){
int x;
cin >> x;
for(int i = 1;i <= 10000;i++){
if(i * x % 360 == 0){
cout << i << endl;
break;
}
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
vector<int> G[100 + 5];
int d[105];
bool travel[105];
int main()
{
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
int u, k, now;
for (int i = 1; i <= n; ++i) {
cin >> u >> k;
wh... | 0 | 26,957,892 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cin>>ara[i];
}
#define eb emplace_back
int... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | 0 | 62,665,379 |
#include<iostream>
using namespace std;
int main(){
long N;
cin >> N;
long sum = 0,num[10000];
for (int i = 0; i < N; i++){
cin >> num[i];
sum = sum + num[i];
}
long max0=num[0], min0=num[0];
for (int i = 0; i < N; i++){
if (max0 < num[i]){
max0 = num[i];
}
if (min0 > num[i]){
min0 = num[i];
}
... | #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 _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double p... | 0 | 57,111,830 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int n;
int main(void){
cin >> n;
vector<int> p(n), q(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
vector<int> a(n);
rep(i, n) a[i] = i+1;
int pi, qi;
int c = 1;
do{
bool fp, fq;
fp = fq = true;
rep(i, n){
if(a[i] !... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } retu... | 0 | 55,707,711 |
#include<iostream>
using namespace std;
int main() {
int n,k;
string s;
cin >> n >> s >> k;
for(char c:s){
if(c != s[k-1]) cout << '*';
else cout << c;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
int main() {
int n,k;
cin >> n >> k;
ll ans = 1e18;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < (1 << n); i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if ((i >> j) & 1) cnt... | 0 | 93,748,355 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
long long int power(long long int x,long long int y,long long int mod)
{
long long int res=1LL;
while(y>0)
{
if(y&1) res=(res*x)%mod;
y>>=1;
x=(x*x)%mod;
}
return res;
}
mt19... | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9+10;
const ll LINF = 1LL*INF*INF;
const i... | 0 | 51,251,143 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> h(n);
rep(i,n) {
cin >> h.at(i);
}
vector<int> a;
int count = 0;
rep(i,n - 1) {
if(h.at(i) >= h.at(i + 1)) {
... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<cstdio>
#include<cstring>
#include<sstream>
#define X fi... | 0 | 100,448,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 61,969,424 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 100 + 17;
int n, a[MAXN], ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >>... | #include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int64_t mod = 1e9 + 7;
unordered_map<int64_t, int64_t> memo;
int64_t mod_pow(int64_t x, int64_t n) {
int64_t key = x * 1e6 + n;
if (memo.count(key)) return memo[key];
int64_t r... | 0 | 35,377,661 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.