code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define S second
template <typename T>
struct countmap {
std::map<T, long long> dict;
countmap() {
dict = map<T, long long>();
}
bool contains(T key) {
return (dict.find(... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 73,678,138 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[110][5],dp2[110][5];
signed main(){
string N;
int K;
cin>>N>>K;
dp2[0][0]=1;
for(int i=0;i<N.size();i++){
for(int j=0;j<=K;j++){
dp[i+1][j]=dp[i][j]+(N[i]!='0'?dp2[i][j]:0);
dp2[i+1][j]=(N[i]=='0'?dp2[i][j]:0);
}
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<... | 0 | 77,538,134 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int len = s.size();
string buf = "";
for (int i = 0; i < len; i++)
{
if(s[i] == 'x')continue;
buf = buf + s[i];
}
bool can = true;
int blen = buf.size();
for (int i = 0; i <= blen; i++)... | #include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
#pragma war... | 0 | 40,738,691 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name... | 0 | 21,797,309 |
#pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | 0 | 25,523,507 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int> I(N);
for(int i=0;i<N;i++){
int a;
cin >> a;
I.at(a-1)++;
}
int ans=0;
sort(I.begin(),I.end());
for(int i=0;i<N-K;i++){
ans += I.at(i);
}
cout << ans <<e... | 0 | 46,503,316 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a == b && b == c ){
cout << 1 << endl;
}
else if(a == b && b != c && c != a ){
cout << 2 << endl;
}
else if (a != b && b != c && c == a){
cout << 2 << endl;
}
else if(a != b && b == c && c != a){... | #include<iostream>
#include<vector>
using namespace std;
vector<int> ans;
int cf[20][20];
bool field[20][20];
int w,h;
void dfs(int i,int j,int count);
int main(){
while(1){
cin >> w >> h;
if(w + h == 0) break;
for(int i = 0;i < 20;i++){
for(int j = 0;j < 20;j++){
cf[i][j] = -1;
field[i][j] = false;
... | 0 | 34,311,364 |
#include <bits/stdc++.h>
int main()
{
int d,t,s;
scanf("%d %d %d",&d,&t,&s);
if (d <= t * s)
printf("Yes");
else
printf("No");
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
static void printArray(vector<string> vector) {
int size = vector.size();
for (int i = 0; i < size; ++i) {
if (i == size - 1) {
cout << vector[i] << endl;
} else {
cout << vector[i] << " ";
... | 0 | 71,441,007 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using veci = vector<int>;
using ll = long long;
int c[10010];
int a[2020202];
int b[2000200];
void countingsort(int a[], int b[], int k, int n){
for (int i=0; i<k; i++){
c[i] = 0;
}
for (int j=1; j<= n; j++){
... | #include <cstdio>
#include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int a, b;
int main() {
while(1) {
cin >> a >> b;
if(a == 0 && b == 0) break;
rep(i,a) {
rep(j,b) {
if(i == 0 || i == a - 1) cout << "#";
else {
if(j ... | 0 | 59,648,300 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
map< int, int > mp;
int n;
cin >> n;
int cnt=0;
int arr[n+1];
for(int i=1; i<=n; i++){
cin >> arr[i];
mp[i] = arr[i];
}
for(int i=1; i<=n; i++) {
if(mp[arr[i]]==i) cnt++;
}
cout << cnt/2 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int ret = 0;
void dfs(const Graph &G, int v, vector<bool> visited) {
if (adjacent_find(visited.begin(), visited.end(), not_equal_to<>()) == visit... | 0 | 36,877,611 |
#include <complex>
#include <cmath>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
double x[4],y[4];
string ok;
double cross_product(xy_t a,xy_t b) {
return (conj(a)*b).imag()/2.0;
}
int main () {
while (true) {
for (int i=0; i<4; ++i) {
cin >> x[i] >> y[i];
}
if (!cin) bre... | #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... | 0 | 41,122,937 |
#include<iostream>
using namespace std;
int main(){
int m,f,r;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1) break;
if(m==-1||f==-1) cout<<"F"<<endl;
else if(m+f>=80) cout<<"A"<<endl;
else if(80>m+f&&m+f>=65) cout<<"B"<<endl;
else if(65>m+f&&m+f>=5... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double A, B;
cin >> A >> B;
for (int i = 1; i < 1e8; i++) {
if (floor(i * 0.08) == A && floor(i * 0.1) == B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | 0 | 90,495,653 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string sam="abcdefghijklmnopqrstuvwxyz";
vector<int> num(26);
for(int i=0; i<s.size(); i++){
for(int j=0; j<26; j++){
if(s.at(i)==sam.at(j)){
num.at(j)++;
break;
}
}
}
bool judge=true;
for(int i=0; i<26; i++){
if(n... | 0 | 12,384,420 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
string S;
cin >> S;
string key = "keyence";
int N = (int)S.size();
bool is ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647 >> 1);
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5... | 0 | 34,804,118 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
ll on[100010];
ll off[100010];
int main(){
string s; cin >> s;
int n = s.size();
on[0] = 2, off[0] = 1;
for( int i = 0; i < n; ++i ){
if( s[i+1] == '1' ){
on[i+1] = on[i... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if (n == 0) return 0;
vector<int> V(n);
int ans = 1000001;
for (int i=0;i<n;i++) cin >> V[i];
for (int i=0;i<n-1;i++){
for (int j=i+1;j<n;j++){
ans... | 0 | 10,093,108 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
string subS;
string leftS, rightS;
int maxLength = 1;
for (int i = 1; i < S.size() - 1; i++)
{
subS = S;
for (in... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int na=1;
int ac=n+1;
long long int mid=(ac+na)/2;
while(na+1<ac){
if(mid*(mid+1)/2>=n){
ac=mid;
}else{
na=mid;
}
mid=(ac+na)/2;
}
int point=n;
for(int i=ac;i>0;i--){
if(i<=point){
cout<<i<<endl;
... | 0 | 12,297,327 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#ifndef LOCAL
#define endl '\n'
#endif
const int mod = 1e9 + 7;
int pwr(int a,int b) {
int ans = 1;
while(b) {
if(b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
int n, m;
const int N = 1e5 + 5;
int cnt[N... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<pair<string, int>> s(n);
rep(i, 0, n){
cin >> s[i].first >> s[i].second;
}
... | 0 | 93,096,046 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
int main()
{
int R, G;
cin >> R >> G;
int S = 2 * G - R;
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 43,055,751 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
void minimization()
{
int n, k;
cin >> n >> k;
cout << ceil((float)(n - 1) / (float)(k - 1)) << "\n";
}
void linear_approximation()
{
int n;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n; ++i)
{
int ... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <class T>
ostream &operator<<(ostream &o, const vector<T>&obj) {
o << "["; for (int i = 0; i < (int)obj.size(); ++i) o << (i > 0 ? ", " : "") << obj[i]; o << "]"... | 0 | 65,746,040 |
#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(){
ll a;
double b;
cin>>a>>b;
ll ib=b*100+0.1;
a*=ib;
a/=100;
printf("%lld\n", a);
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 19,076,967 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, m;
cin >> n >> m;
int a[n+1]={};
for(int i=0; i<m; i++){
int l, r;
cin >> l >> r;
l--;
a[l] += 1;... | #include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | 0 | 83,491,153 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string C[2];
cin >> C[0] >> C[1];
bool isMatch = C[0][0] == C[1][2] && C[0][1] == C[1][1] && C[0][2] == C[1][0];
cout << (isMatch ? "YES" : "NO") << endl;
} | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | 0 | 69,019,448 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll H, W;
cin >> H >>W;
ll ans;
ans = (H * W) / 2;
bool flag = true;
if( H == 1 || W == 1) {
ans = 1;
}
else if( H % 2 == 1 && W % 2 == 1) {
ans++;
flag = false;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<lli> vlli;
typedef vector<bool> vb;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
long long int ... | 0 | 23,775,341 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long X, Y;
cin >> X >> Y;
if((X-Y) % 3 == 0){
if(X == Y) cout << "Brown" << endl;
else cout << "Alice" << endl;
}else{
if(abs(X-Y) == 1) cout << "Brown" << endl;
else cout << "Alice" << endl;
}
return 0;
} | #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, M;
cin >> N >> M;
vec<string> A(N);
rep(i, N) cin >> A[i];
vec<string> B(M);
... | 0 | 7,287,677 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
double l;
cin >> l;
double x = l / 3;
double ans = pow(x, 3);
cout << fixed << setprecision(10) << ans << endl;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
ll min_cost = INF;
for(int i=-100; i<=100; i++) {
ll cost=0;
for(int j=0; j<N; j++) {
... | 0 | 63,148,965 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> x(n),y(n);
for(int i=0;i<n;i++){
cin >> x[i] >> y[i];
}
for(int i=0;i<n;i++){
if(abs((x[0] + y[0]) % 2) != abs((x[i] + y[i]) % 2)){
cout << -1 << endl; return 0;
}
}
int par = (1==abs((x[0] + y... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char check = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) != check) {
S.at(i) = '*';
}
}
cout << S << endl;
} | 0 | 27,729,375 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 20,535,697 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int numb(int n, int k){
int cntr = 0;
while(n < k){
cntr ++;
n *= 2;
}
return cntr;
}
int main(){
Hello
double n, k;
cin >> ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll ... | 0 | 44,091,577 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h; cin >> w >> h;
long long ans = 0;
vector<pair<long long, int>> v;
for (int i = 0; i < w; i++) {
long long p; cin >> p;
v.emplace_back(p, 0);
}
for (int i = 0; i < h; i++) {
long long q; cin >> q;
... | #include <cstdio>
void swap(int z[], int a, int b) {
int tmp = z[a];
z[a] = z[b];
z[b] = tmp;
}
int main ()
{
int n;
scanf("%d", &n);
int A[100];
for (int i=0; i<n; i++) scanf("%d", &A[i]);
int swp = 0;
for (int i=0; i<n-1; i++) {
int mini = i;
for (int j=i+1; j<n; j+... | 0 | 95,683,270 |
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iomanip>
#include<complex>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VV... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
if (lhs ... | 0 | 95,559,912 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()... | 0 | 59,687,403 |
#include <iostream>
using namespace std;
void ABC80(void);
void ABC81(void);
void ABC83(void);
void ABC85(void);
void ABC86(void);
void ABC87(void);
void ABC88(void);
void ABC89(void);
int main(void){
ABC83();
}
void ABC83(void){
int a,b,c,d;
cin>>a>>b>>c>>d;
if((a+b)>(c+d))cout<<"Left"<<endl;
else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K, a;
cin >> N >> K;
vector<int> d(K);
vector<vector<int>> A(K);
for (int i=0; i<K; i++) {
cin >> d[i];
for (int j=0; j<d[i]; j++) {
cin >> a;
A[i].push_back(a-1)... | 0 | 84,469,429 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
if((A%2+B%2+C%2)%3==0)
cout<<(max({A,B,C})*3-(A+B+C))/2<<endl;
else if(A%2+B%2+C%2==1)
cout<<((max({A,B,C})/2*2+1)*3-(A+B+C))/2<<endl;
else if(A%2+B%2+C%2==2)
cout<<(((max({A,B,C})+1)/2*2)*3-(A+B+C))/2<<endl;
} | #include<iostream>
using namespace std;
main(){
int N;
int x[110000];
int y[110000];
int t[110000];
cin >> N;
x[0] = 0;
y[0] = 0;
t[0] = 0;
for (int i = 1; i <= N;i++) cin >> t[i] >> x[i] >> y[i];
bool arrive = true;
int dist = 0;
int dt = 0;
for (int j = 1; j <= N; j... | 0 | 33,849,301 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | #include<bits/stdc++.h>
using namespace std;
const long long mod=1000000000+7;
const long long INF=9e18;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<long long, long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define... | 0 | 33,568,236 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #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 | 5,852,057 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> a(n);
for(auto &e : a) cin >> e;
vector<int64_t> sum(n + 1), pos(n + 1);
for(int i = 0; i < n; ++i) sum[i + 1] = sum[i] + a[i];
for(int i = 0; i < n; ++i) pos[i + 1] = pos[i] + (a[i] > 0 ? a[i... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
bool match;
string ans... | 0 | 72,914,665 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 9,291,636 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
string s;
cin>... | #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 FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 0 | 4,623,654 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll a[N];
for(ll i=0;i<N;i++){
cin >> a[i];
}
ll j = 1;
bool go = false;
for(ll i=0;i<N;i++){
if(a[i]==j){
j++;
go = t... | #include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k, n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 100010
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans, cnt;
int main() {
ll R;
cin >> R ;
if (R < 1200) {
cout << "ABC" << endl;
}
else if (R < 2... | 0 | 69,455,726 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scan... | #include<bits/stdc++.h>
using namespace std;
bool provera(vector<long long> &niz,int &m,long long &x)
{
for (int i=0;i<m;i++)
if(niz[i]<x)
return false;
return true;
}
long long f(vector<vector<long long>> &v,vector<long long> &cene,int &n,int &m,long long &x,vector<long long> niz,int index,... | 0 | 3,222,415 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,m;
cin>>n>>m;
vector<string> s(m);
vector<int>p(m);
for(int i=0;i<m;i++) cin>>p[i]>>s[i];
int val[n+1]={0};
int cor[n+1]={0};
for(int i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<string> S;
vector<map<int, int>> m(n);
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
S.push_back(str);
for (int j = 0; j < st... | 0 | 23,858,427 |
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main(){
string str;
while(getline(cin,str) && str != "."){
vector<char> c;
for(int i = 0 ; i < str.size() ; i++)
if(str[i] == ')' || str[i] == '(' || str[i] == '[' || str[i] == ']')
c.push_back(str[i]);
stack<char> s;
bool ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 23,594,738 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int (i) = 0; (i) < (N); ++(i))
#define READALL(c) for (auto &e : c) { cin >> e; }
#define PRINTALL(c) for (const auto &e : c) { cout << e << "\t"; } cout << "\n";
template <typename T>
using V = vector<T>;
typedef long double ld;
int N;
string S;
int ... | #include <iostream>
#include <list>
#include <string>
using namespace std;
void display(list<int> & lst){
if (!lst.empty()){
cout << lst.front();
lst.pop_front();
}
for (auto element : lst){
cout << ' ' << element;
}
cout << endl;
}
int main()
{
ios::sync_with_stdio(f... | 0 | 55,490,228 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
while(1){
int k=0;
cin>>a>>b;
if(a==0&&b==0)break;
for(int i = 1;i<=a;i++){
for(int j = i+1;j<=a;j++){
for(int l = j+1;l<=a;l++){
if(b==i+j+l){
k++;
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 92,674,390 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N;
cin >> N;
set<int> se;
int A;
rep(i,N){
cin >> A;
se.insert(A);
}
if((N-se.size())%2){
cout << se.size()-1 << endl;
}else{
cout << se.size() <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 0 | 26,618,345 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 100000
typedef long long ll;
typedef pair<int,int> P;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
i... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 72,310,250 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int K, S;
cin >> K >> S;
int count=0;
for(int x = 0; x <= K; x++){
for(int y = 0; y <= K; y++){
if(S - (x + y) >= 0 && S - (x + y) <= K) count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 9,828,966 |
#ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main() {
int n, m;
cin >> n >> m;
auto a = vector<int>(n);
for (auto& ai : a) {
cin >> ai;
ai /= 2;
}
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | 0 | 10,616,293 |
#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;
vector<vector<int>> a(n+1,vector<int>(3,0));
rep(i,n) cin >> a[i+1][0] >> a[i+1][1] >> a[i+1][2];
vector<vector<int>> dp(n+1,vector<int>(3,0));... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(ist... | 0 | 51,421,828 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(m);
int inf = -1e9;
for(int i = 0; i < m; i++)
cin >> a[i];
sort(a.begin(), a.end());
vector<int> cost(m);
for(int i = 0; i < m; i++){
if(a[i] == 1) cost[i] = 2;
else i... | #include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
const int maxn=1005;
int n,m,k,dx[]={-1,1,0,0},dy[]={0,0,1,-1},vis[maxn][maxn];
char map[maxn][maxn];
struct maze
{
maze(int xx=0,int yy=0,int tt=0):x(xx),y(yy),time(tt){}
int x,y,time;
};
maze bfs(int bx,int by,char ch)
{
memset(vis,0,size... | 0 | 98,494,942 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int H[N];
for (int i = 0; i < N; i++) cin >> H[i];
sort(H, H + N, greater<>());
long long ans = 0;
for (int i = K; i < N; i++) ans += H[i];
cout << ans << endl;
return 0;
} | #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 | 48,059,396 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long answer = 0;
cin>>n;
long long tmp_n = n;
for(long long i=2;i*i<=n;i++) {
long long tmp = i;
while(tmp_n % tmp == 0) {
tmp_n/=tmp;
answer++;
tmp*=i;
}
... | 0 | 15,198,887 |
#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() {
string s, t;
cin >> s >> t;
string ans = t+s;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
#define ld long double
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const int mod = 1e9 + 7;
int check(string s) {
int n = s.size();
int dp[n... | 0 | 63,669,014 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
string S;
cin >>... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int,int> pii;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) (a).begin(),(a).end()
template<class T>
class UF{
private:
vector<T> par,rank;
int _size;
int groups;
public:
UF(int __size):_size(__size) , par(__size) , rank(__size,0) ... | 0 | 72,316,236 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" ... | 0 | 81,605,886 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) ... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 96,444,296 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 | 6,845,038 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout<<n<<"\n"
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<int> X[200010];
bool dfs(int from, int pre, int cnt,int goal){
if(from == goal ... | #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,i;
cin >> n;
vector <ll> a(n),b(n),c(n),d(n+1);
d[n]=0;
rep(i,n){
cin >> a[i] >> b[i];
}
for (int i=n-1; i>=0 ; --i){
if ((a... | 0 | 71,763,827 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
#define mod 1000000007
#define fo(i,n) for(int i=1;i<=n;i++)
#define tol(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define tou(s) transform(s.begin(),s.end(),s.begin(... | #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;
ll dp[2005][2005];
int main() {
int n, m;
cin >> n >> m;
vector<int> S(n);
vector<int> T(m);
rep(i, n) cin >> S[i];
rep(i, m) ci... | 0 | 9,573,597 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << max(0,n-k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define ff(i, n) for (int i = 1; i <= n; i++)
#define... | 0 | 60,905,991 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100005];
int main(){
std::ios::sync_with_stdio(false);
int a,b,k,cot=0;
cin>>a>>b>>k;
for(int i=min(a,b);i>=1;i--){
if(a%i==0&&b%i==0){
cot++;
}
if(k==cot){
... | #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
typedef long long ll;
int main() {
ll N,M; cin >> N >> M;
vector<p... | 0 | 97,037,326 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int GCD(int a,int b){
if(b == 0)return a;
return GCD(b,a%b);
}
int main(void){
int N,X;
cin >> N >>X;
int x[N];
for(int i=0;i<N;i++){
cin >> x[i];
x[i] = abs(X-x[i])... | #include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include... | 0 | 7,503,807 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string o, e; cin >> o >> e;
rep(i,o.size()) {
cout << o[i];
if (i < e.size()) cout << e[i];
}
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
ll sum[n + 1] = {};
rep(i, 0, n) {
int a;
cin >> a;
... | 0 | 13,721,233 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int k,s;
ll ans=0;
cin >> k >> s;
rep(i,k+1){
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#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 = 100000000... | 0 | 54,851,853 |
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[20000... | #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... | 0 | 85,283,228 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int N = 2 * 1e5 + 5;
int n, q, a, b;
vector<vector<int>> r;
vector<int> ans;
void dfs(int v, int p = -1) {
for (int u : r[v]) {
if (u == p) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int num;
cin >> num;
mp[num]++;
}
if ((int)mp.size() <= K) {
cout << 0 << endl;
return 0;
}
vector<int> v;
for (auto itr = mp.be... | 0 | 58,786,210 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << var << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void solve() {
int a, b, c, d; cin >> a >> b >> c >> d;
if (a+b > c+d) cout << "Left";
else if (a+b < c+d) co... | #include <iostream>
#include <iomanip>
#include <utility>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstring>
#include <map>
#include <climits>
#include <bitset>
#define ll long long
const ll MOD = 1e9 + 7;
const ll INF = 1 << 29;
ll Add(ll a, ll b)
{
ll resu... | 0 | 35,172,446 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int> C(N-1),S(N-1),F(N-1);
for(int i = 0; i < N-1; i++) cin >> C[i] >> S[i] >> F[i];
for(int i = 0; i < N; i++){
int ans = 0;
for(int j = i; j < N-1; j++){
if(ans <= S[j]) ans = S[j];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template... | 0 | 13,248,840 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int max = 0;
int maxn = 0;
for(int i = 0; i < n; i++){
if(max < a[i]) {
max = a[i];
maxn =... | 0 | 33,861,198 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll memo[21];
ll fact( int n ) {
if ( memo[n] != -1 ) return memo[n];
if ( n <= 1 ) return 1;
return memo[n] = n * fact(n-1);
}
int main() {
memset(memo,-1,sizeof(memo));
int n; cin >> n;
ll ret = fact(n);
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[105][105];
signed main() {
for(int i = 0; i < 105; i++) {
for(int j = 0; j < 105; j++) {
if(i != j) {
... | 0 | 5,098,767 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main(void)
{
int i,j,k,l;
int a,b,c,d;
int memory[2];
int n;
for(i=1;i<=9;i++) {
for(j=1;j<=9;j++) printf("%dx%d=%d\n",i,j,i*j);
}
return 0;
} | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
double calc(int a,int b){
return abs(a - b) * abs(a - b);
}
int main(){
int ans = 0;
int N, D;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
for (int i = 0; i < N;i++)
{
for (int j = 0; j... | 0 | 70,197,790 |
#include <iostream>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define INF 100000000;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
int c[500],s[5... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pcc = pair<char, char>;... | 0 | 3,618,589 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | 0 | 14,494,137 |
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
vector<int> lst[100010];
int main() {
scanf("%d", &n);
int lo = 1, hi = n;
while(lo < hi) {
int mid = (lo + hi) / 2;
if(1ll*mid*(mid+1)/2 < n) lo ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | 0 | 64,209,988 |
#include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int , int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n ;
cin >> n ;
vector<int> a (n);
int mx ;
rep(i, n){
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | 0 | 39,925,127 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main() {
char a[10];
rep(i,10) cin>>a[i];
string year,month,day;
rep(i,4) year += a[i];
rep2(i,5,7) month += a[i];
rep2(i,8,1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vector<vl> graph;
ll A[101010];
ll n;
ll dfs(ll p,ll r)
{
if(graph[p].size() == 1) return A[p];
vector <ll> X;
ll s = 0;
for(auto t: graph[p])
{
if(t != r)
{
ll x = dfs(t, p);
s += x;
X.push_back(x);
}
}
if... | 0 | 81,595,186 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
char s[105][105];
int ans[105][105];
int main() {
int H, W; cin >> H >> W;
rep(i, H){
rep(j, W){
cin >> s[i][j];
}
}
if(s[0][0] == '.')... | 0 | 31,423,144 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
vector<int> a(M),b(M);
for(int i=0;i<M;i++){
cin>>a[i]>>b[i];
a[i]--;
b[i]--;
}
vector<vector<int>> graph(N);
for(int i=0;i<M;i++){
graph[a[i]].push_back(b[i]);
}
string ans="IMPOSSIBLE";
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; fo... | 0 | 96,893,431 |
#include <iostream>
using namespace std;
bool initComb(bool* b, int n)
{
if (n>10) return false;
for (int i=0; i<n; i++) b[i] = true;
return true;
}
bool nextComb(bool* b)
{
int pos;
int last_true_pos;
for (pos=9; pos>=0; pos--) {
if (!b[pos]) {
last_true_pos = pos + 1;
break;
}
}
for (pos--; pos>=0; ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 63,996,591 |
#include <vector>
#include <stdio.h>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <bitset>
#include <set>
#include <map>
#include <random>
#include <time.h>
#include <cassert>
#define prev askdnsajd
#define rank asasdmdnasd
#define next lsjndajbs
#define hash asmdklansd
using namespace std... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>> n;
for(int i=0; i<n; i++){
int Y, M, D;
cin>> Y>> M>> D;
int ans=0;
for(int y=1; y<=Y; y++){
if(y==Y){
for(int m=1; m<=M; m++){
if(m==M){
... | 0 | 71,060,319 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> ab(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> ab.at(i).at(1) >> ab.at(i).at(0);
}
vector<vector<int>> cd(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> cd.at(i).at(0) >> cd.at(i)... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
using lli = long long int;
using ll = long long ;
using ld=long double;
using d= double;
bool isPrime(ll n){if(n<2)return false;for(ll i=2;i*i<=n;++i){if(n%i==0){return false;}}return t... | 0 | 60,156,904 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using lli = long long int;
int main(){
int n;
std::cin >> n;
vector<lli> a(n);
for (int i = 0; i < n; i++) std::cin >> a[i];
lli ans = a[0] - 1, price = 2;
a[0] = 1;
for (int i = 1; i < n; i++) {
if(a[i] < price)continue;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
vector<pair<double, int>> order(n);
for (int i = 0; i < n; i++){
double p = atan2((double)y[i], (double)x[i]);
order[... | 0 | 82,098,562 |
#include<iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll ans = a*b/gcd(a,b);
return ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll a,b;
cin >> a >> b;
cout << lcm(a,b);
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include... | 0 | 94,857,675 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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> A(N);
rep(i,N) cin >> A[i];
do... | #include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep1(i,n) for(int i = 1; i < (n); i++)
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i,n-1) cin >> b[i];
... | 0 | 60,898,914 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
int64_t c=0, w;
cin >> n >> k;
priority_queue<int64_t> hs;
for(int i=0; i<n; i++){
cin >> w;
hs.push(w);
}
if (k >= n){
cout << c << '\n';
return 0;
}
n -= k;
for(int i=0; i<k; i++... | #include <bits/stdc++.h>
using namespace std;
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int N; cin>>N;
vector<int> A(N);
rep(i,N){
cin>>A.at(i);
}
int A_total = accumulate(A.begin(),A.en... | 0 | 39,669,916 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=(1<<29);
int main(){
ll n,p,i,j... | #include <iostream>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a= -1, b = -1, c = -1;
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < n - i + 1; j++) {
int n_d = n - i - j;
int total = 10000 * i + 5000 * j + 1000 * n_d;
if (total == y)... | 0 | 82,674,967 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
int main(void)
{
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
ll d = 'A'- 'a';
printf("%c%c%c\n", (char)(s1[0]+d), (char)(s2[0]+... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 10,860,127 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
pair<int,int> second_max(pair<int,int> a,pair<int,int> b){
vector<int> v(0);
v.push_back(a.first);
v.push_back(a.second);
v.push_back(b... | 0 | 12,990,074 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retur... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 76,977,184 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include<iostream>
#include<string>
using namespace std;
int main() {
int n,i,j,k,A=0,B=0,count=0;
string str1,str2,str;
cin >> n;
for (i = 0; i < n; i++) {
cin >> str1 >> str2;
str = str1 + str2;
for (j = 0; j < str.size(); j++) {
if (str1[j] < str2[j]) {
B += 3;
break;
}
else if (str1[j] > ... | 0 | 64,804,296 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7 , N = 1e5 + 5;
int memo[N][2];
string s;
int add(int a , int b) {
a += b;
while (a >= MOD) a -= MOD;
return a;
}
int mul(int a , int b) {
return a * 1ll * b % MOD;
}
int solve (int i , bool l) {
if (i == s.size())
return 1... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int H,N;
cin >> H >> N;
vector<int> A;
rep(i,N){
int a;
cin >>a;
A.push_back(a);
}
int sum =0;
rep(i,N){
sum += A[i];
}
if(sum >= H)... | 0 | 1,591,038 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
long long Comb(in... | 0 | 42,786,686 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include<iostream>
using namespace std;
int main() {
int w,h;
while (1) {
cin >> h >> w;
if ( w == 0 && h == 0 ) {
break;
}
for ( int i = 0; i < h; i++ ) {
for ( int j = 0; j < w; j++ ) {
cout << "#";
}
cout << "\n";
}
cou... | 0 | 26,475,065 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include <cstdio>
#include <cctype>
#include <algorithm>
#define MAXN 1100005
using namespace std;
int a[MAXN];
int fst[MAXN]={0};
int sec[MAXN]={0};
int tmp[25];
int temp[5];
int f[MAXN];
int read(void);
void write(int x);
int main(void){
int len,n;
len=read();
n=1<<len;
for (int i=0;i<n;i++)
f... | 0 | 79,265,362 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | #include <iostream>
using namespace std;
int main()
{
int n,k,a[100000],temp;
while(cin >> n >> k,n || k){
cin >> a[0];
for(int i = 1;i < n;i++){
cin >> temp;
a[i] = a[i - 1] + temp;
}
temp = 0;
for(int i = 0;i < n - k;i++)
if(temp < a[i + k] - a[i])
temp = a[i + k] - a[i];
cout << temp << en... | 0 | 94,399,268 |
#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(){
ll n;
cin >> n;
vector<ll> a(n);
map<ll ,ll> cnt;
ll sum=0;
rep(i,n){
cin >> a.at(i);
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 0 | 84,602,385 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
int m, n_min, n_max;
while (1) {
cin >> m >> n_min >> n_max;
if (m == 0) break;
vector< int > p(m);
for_(i,0,m) cin >> p[i];
int ans = 0, max_diff = 0;
for_(i,n_min,n_max+1) {
int diff = p[i-1] - p[i... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstr... | 0 | 68,683,730 |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
const int m = 1000002;
int n, t, ans = 0;
cin >> n;
vector<bool> a(m, false);
vector<int> b(n);
rep(i, n)
{
cin >> b[i];
}
sort(b.begin(), b.end());
rep(i, n - 1)... | 0 | 25,057,537 |
#include <iostream>
using namespace std;
const int MAX_LEN = 1000;
int lcs(string x, string y) {
int a[MAX_LEN + 1][MAX_LEN + 1];
for (int i = 0; i <= MAX_LEN; i++)
a[i][0] = a[0][i] = 0;
for (int i = 1; i <= x.size(); i++) {
for (int j = 1; j <= y.size(); j++) {
if (x[i-1] == y[j-1]) {
a[i]... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef... | 0 | 94,435,035 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P... | 0 | 88,737,161 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.