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;
typedef long long ll;
#define loop(i,a,b) for(i=a;i<b;i++)
#define rloop(i,a,b) for(i=a;i>=b;i--)
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
const int inf=1000000001;
const ll INF=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n,m; cin >> n >> m;
vector<vector<int>> v;v.... | 0 | 66,177,895 |
#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define pr1(a) (#a)<<"="<<(a)
#define pr2(a,b) pr1(a)<<", "<<pr1(b)
#define pr3(a,b,c) pr2(a,b)<<", "<<pr1(c)
#define pr4(a,b,c,d) pr3(a,b,c)<<", "<<pr1(d)
#define pr5(a,b,c,d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct UnionFind{
vector<int> par;
UnionFind(int N) : par(N){
for(int i = 0; i < N; i++){
par[i] = i;
}
}
int root(int x){
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx ... | 0 | 77,752,604 |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A <= C && C <= B ? "Yes" : "No") << endl;
} | #include<bits/stdc++.h>
#include <math.h>
#include <map>
#include <unordered_map>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pa... | 0 | 21,635,815 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int>a(n, 0);
for (int i = 0; i < n; i++) {
int tmp; cin >> tmp;
a[tmp-1]++;
}
int cnt = 0;
for (auto&& x : a) {
if (x)cnt++;
}
if (cnt <= k)cout << 0 << endl;
else {
int ans = 0;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1000000000100000000;... | 0 | 2,704,071 |
#include<cstdio>
#include<map>
int n,a[200100],ans;
bool bo=true;
std::map<int,int> mp;
bool check(int x){
mp.clear();
for(int i=2;i<=n;i++)
if(a[i-1]>=a[i]){
while(!mp.empty()){
int maxn=mp.rbegin()->first;
if(maxn>a[i])mp.erase(maxn);
else break;
}
int j=a[i];
while(mp[j]+1==x)
mp.era... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,... | 0 | 10,858,068 |
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define pb push_back
#define sx 200007
int main()
{
string s,t;
cin>>s>>t;
t=t+s;
cout<<t<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 68,960,454 |
#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;
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 | 48,142,956 |
#include "bits/stdc++.h"
#define F first
#define S second
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll h = 0, n = 0;
cin >> h >> n;
ll a[n];
for (ll i = 0; i < n; ++i)
cin >> a[i], ... | #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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vec... | 0 | 100,568,068 |
#include<cstdio>
#include<algorithm>
#define MAX_N 100000
using namespace std;
int numbers[MAX_N + 5], L[MAX_N + 5];
int main()
{
int n, i, length = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &numbers[i]);
}
L[0] = numbers[0];
for (i = 1; i < n; i++) {
if (numbers[... | #include<vector>
#include<cstdio>
class Tree{
private:
int numVertex;
int *parent, *depth;
std::vector<int> *child;
public:
Tree(int v);
~Tree();
void addEdge(int p,int c);
void printData();
void printData(int v);
bool isRoot(int v);
void computeDepth(int v);
void computeDept... | 0 | 99,779,943 |
#include<bits/stdc++.h>
#define mp make_pair
#define rep(i,n) for(int i=0;i<n;i++)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 9223372036854775807
#define END(s) {cout<<s;return 0;}
#define CON(s) {cout<<s;continue;}
#define BRE(s) {cout<<s;break;}
#define pb push_back
#define all(a) a.begin(),a.end()
#... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 7,539,658 |
#include <bits/stdc++.h>
using namespace std;
#define out cout
#define in cin
#define el endl
#define rep(i, N) for (int i = 0; i < N; i++)
#define ol(N) cout << N << endl
int main()
{
int x, y;
while (in >> x >> y, x || y){
int n, dp[17][17] = {0};
bool f[17][17] = {false};
in >> n;
rep(i, n){
int a, b;
... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; ++i) {
cin >> a >> b >> c;
a *= a;
b *= b;
c *= c;
if (a + b == c || b + c == a || c + a == b)
cout << "YES";
else
cout << "... | 0 | 25,081,448 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll N;
cin >> N;... | 0 | 52,064,973 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
ll a[maxn], num[maxn];
int main()
{
ll n,p;
scanf("%lld%lld",&n,&p);
for(int i=1;i<=n;i++)
{
scanf("%1d",&a[i]);
}
ll ans=0;
if(p==2 || p==5)
{
for(int i=1;i<=n;i++)
{
if(a[i]%p == 0) ans+=i;
}
}
else
{
num... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i += 2) {
int c = 1;
int h = i;
for (int j = 2; j < sqrt(i); j++) {
int k = 1;
while (h % j == 0) {
h /= j;
k++;
}
c *= k;
}
if (h !=... | 0 | 62,606,001 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s, t="keyence", u="";
cin >> s;
rep(i,s.size()) {
if(s.at(i)==t.at(i)) {
u += t.at(i);
if(u==t) {
cout << "YES" << endl;
}
continue;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
typedef pair<int, int> pint;
const int dx[4] = {0, 1, -1, 0}, dy[4] = {1, 0, 0, -1};
int W, H;
int solve(vector<string>& fld, int sx, in... | 0 | 28,798,017 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 98,731,090 |
#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 endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
vector<int> c(26,100);
for(int i=0;i<n;i++)
{
str s;cin>>s;
vector<int> bc(26,0);
for(int j=0;j<s.size();j++)bc[s[j]-... | 0 | 66,526,492 |
#include <bits/stdc++.h>
int main(){
int N, K;
std::cin >> N >> K;
std::vector< int > X(N);
std::vector< int > Y(N);
for(int i=0; i<N; i++){
std::cin >> X[i] >> Y[i];
}
long long min = 4e18;
for(int x1=0; x1<N; x1++){
for(int x2=x1+1; x2<N; x2++){
for(int y1=0... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 0 | 29,544,507 |
#include <cstdio>
#include <math.h>
double a, b, C;
double PI = acos(-1);
int main()
{
scanf("%lf %lf %lf", &a, &b, &C);
double rad = C * PI / 180;
double S = a * b * sin(rad) / 2.00000000;
double L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(rad));
double h = b * sin(rad);
printf("%.8f %.8f ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int min(int a,int b){
return a < b ? a : b;
}
int main(void){
int N,M,X;
cin >> N >> M >> X;
int C[N];
int A[N][M];
for(int i=0;i<N;i++){
... | 0 | 98,154,437 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #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;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
int main () {
cout << fixed << setprecision(18);
int n,k;cin>>n>>k;
... | 0 | 34,770,894 |
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
#define MAX_N 100000000
using namespace std;
bool debug=false;
int main(){
int n;
string str;
cin>>str>>n;
rep(i,0,n){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
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 INF 1000000000
#define PB ... | 0 | 52,474,663 |
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
vector<vector<int>> m;
bool possible(int s,int pre,int count){
bool ans = false;
if(count == 2){
if... | 0 | 70,646,771 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solv... | 0 | 22,694,782 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1e5+2;
const ll MX = 1e18;
int N;
ll A[MAX_N];
void solve()
{
ll nonleaf = 1;
for(int i=0;i<N+1;++i) {
nonleaf -= A[i];
if (nonleaf < 0) {
cout << -1 << '\n';
return;
}
nonleaf *= 2;
... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%3==0)
{
cout<<"Possible"<<endl;
}
else
if(b%3==0)
{
cout<<"Possible"<<endl;
}
else
if((a+b)%3==0){
cout<<"Possible"<<endl;
}
else
{
cout<<"Impossible"<<end... | 0 | 95,339,185 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n,k,d,c,ans;
cin>>n>>k;
vector<int> v(n,-1);
ans=n;
rep(i,k){
cin>>d;
rep(j,d){
cin>>c;
c--;
if(v[c]==-1){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K; cin >> N >> K;
long ans = 15000000000;
vector<long> a(N);
for (int i =0; i<N; i++) cin >> a[i];
vector<long> maxA(N); maxA[0] = a[0];
for (int i =1; i<N; i++)
maxA[i] = max(a[i-1],maxA[i-1]);
for (int i =0; i< (1<<(N-1)); i++) {
... | 0 | 82,240,519 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << n*n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {... | 0 | 42,383,284 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | #include <iostream>
#include <iomanip>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int a[3];
repi(i,3,0){
cin >> a[i];
}
int index[3] = {0,1,2};
int ans = INF;
d... | 0 | 57,212,295 |
#include <iostream>
using namespace std;
int main() {
int n, p; cin >> n >> p;
string s; cin >> s;
long long ans = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < n; i++) {
if ((s[n-i-1] - '0') % p == 0) ans += n - i;
}
}
else {
long long val[p] = {};
l... | #ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P>... | 0 | 86,962,552 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
vector<int>lk[N];
int sg[N];
void dfs(int x,int fr)
{
for(auto y:lk[x])
if(y!=fr)
{
dfs(y,x);
sg[x]^=sg[y]+1;
}
}
int main()
{
int n;
cin>>n;
rep(i,1,n-1)
{
int x,y;
scanf("%d%d",&x,&y);
lk[x].push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 | 52,838,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[... | #include <bits/stdc++.h>
using namespace std;
void print(vector<int> x){
int n;
for (n = 1; n < x.size()-1; n++){
cout << x.at(n) << " ";
}
cout << x.at(n) << endl;
}
void clean(vector<int> &x){
for (int n = 0; n < x.size(); n++){
x.at(n) = 0;
}
}
int main(){
int N, K;
cin >> N >> K;
vector<in... | 0 | 17,030,269 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline LL read() {
LL x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * fh;
}
int n, i;
L... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 0 | 90,706,813 |
#include<stdio.h>
int main()
{
int n,m,i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
printf("%dx%d=%d\n",i,j,i*j);
}
}
} | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main(){
int h, w, K; cin >> h >> w >> K;
vector<string> s(h);
for(int i = 0; i < h; i++){
cin >> s[i];
}
int ans = 0;
for(int i = 0; i < 1 << h; i++){
... | 0 | 68,490,680 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
ll A[N], B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<vector<ll>> G(M+1);
for (int i = 0; i < N; i++){
if (A[i] <= M) G[A[i]].push_back(B[i]);
}
ll ans = 0;
priority_queue<ll> ... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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>;
int main(void) {
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) {
cin >> ... | 0 | 79,277,925 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<bool> dp(N+1, false);
dp[0] = true;
for (int i = 1; i <= N; ++i) {
if (i >= 5 && dp[i-5] && S.substr(i-5, 5) == "erase") dp[i] = true;
if (i >= 6... | #include <iostream>
using namespace std;
int main() {
long long x, y; cin >> x >> y;
long long ans = 1LL<<60;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
long long res = i + j;
long long xx = x * (i ? -1 : 1);
long long yy = y * (j ? -1 : 1);
... | 0 | 83,529,996 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include <cstdio>
#include <iostream>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
inline char nc() {
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T &x) {
x = 0; int ... | 0 | 61,372,409 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << k * (int)pow(k - 1, n - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ALL(x) x.begin(),x.end()
const ll MOD=1000000007;
const long double PI=3.14159265358979;
ll x[4]={0,0,1,-1};
ll y[4]={1,-1,0,0};
int main(){
ll H,W;
cin>>H>>W;
ll Map[H][W];
queue <pair<ll,ll>> q;
for(int i=0;i<H;i++){
for(int j=0;... | 0 | 44,132,888 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 0 | 26,113,492 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <iostream>
#define NIL -1
using namespace std;
struct Node {
int parent;
int child;
int bro;
int kk;
};
void get_depth(Node T[], int depth[], int u, int p);
void get_children(Node T[], int children[], int i);
int main(){
int n;
cin >> n;
Node T[n];
int depth[n];
int children... | 0 | 76,995,042 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long x,y;
scanf("%lld%lld",&x,&y);
puts(abs(x-y)<=1?"Brown":"Alice");
} | #include<bits/stdc++.h>
# define all(a) a.begin(), a.end()
#define forn(i, a, b) for (int i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define MOD int(1e9+7)
using namespace std;
typedef long long int ll;
bool cmp(int a, int b) {
return a < b;
}
void printV(vector<int> nums) {
for (i... | 0 | 13,371,508 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int i=0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int hy[] = {0, 1, 0, -1};
int wx[] = {1, 0, -1, 0};
int H, W;
bool closed(int x, int y){
bool flag = true;
if(x<0 || W<=x)
flag = false;
if(y<0 || H<=y)
flag = false;
... | 0 | 54,531,527 |
#include <bits/stdc++.h>
int main()
{
std::string s1, s2;
std::cin >> s1 >> s2;
using vi = std::vector<int>;
std::vector<vi> dp(s1.size() + 1, (vi(s2.size() + 1)));
for (int i{}; i <= (int)s1.size(); i++)
dp[i][0] = i;
for (int i{}; i <= (int)s2.size(); i++)
dp[0][i] = i;
for (int i{1}; i <= (int)s1.size(); ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a... | 0 | 61,258,760 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
double sum = 0;
while(n--) {
int x;
cin >> x;
sum += 1 / (double)x;
}
cout << fixed;
setprecision(10);
cout << 1 / (double)sum << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <string>
#include <utility>
#include <cassert>
using namespace std;
typedef long long ll;
const int INF = 2e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);... | 0 | 30,217,254 |
#include <iostream>
#include <string>
using namespace std;
int main (void){
int a, b;
cin >>a >> b;
if(a < 9 && b < 9){
cout << "Yay!" << endl;
}else{
cout << ":(" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
if (h == 1 || w == 1) {cout << 1 << '\n'; return 0;}
int h1,h2,w1,w2;
if (h%2==0)
{
h1 = h/2;
h2 = h/2;
}
else
{
h1 = h/2+1;
h2 = h1-1;
}
if (w%2==0)
{
... | 0 | 55,040,454 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
int ans = -1;
for (int i = -100; i <= 100; ++i) {
int cost = 0;
for (int j = 0; j < va.size(); ++j) {
cost += pow(va[j]... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) (ll) a... | 0 | 23,384,700 |
#include <iostream>
using namespace std;
class Dice
{
public:
int top;
int front;
int right;
int left;
int back;
int bottom;
Dice(int a,int b,int c,int d,int e,int f){
top = a;
front = b;
right = c;
left = d;
back = e;
bottom = f;
}
void rotateN(){
int t = top;
top = front;
front = bottom;
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 80,498,259 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int b;
cin >> n >> b;
cout << n * n - b << endl;
} | #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 REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 5,915,773 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b; cin>>a>>b;
reverse(b.begin(), b.end());
puts(a==b? "YES":"NO");
} | #include <bits/stdc++.h>
#include <cstdio>
#include <cmath>
#include <set>
#define S scanf
#define P printf
#define D double
#define ll long long
#define ull unsigned long long
#define S1(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define S3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define SL1(a) scan... | 0 | 10,263,385 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
#define endl '\n'
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define rf(i,a,b) for(int i=a;i>=b;i--)
#define fast_io ios_base::sync_with_stdio(0);
#define show(x) cout<<x<<endl;
#define pret(x) cout<<x<<endl; return... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 41,729,963 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n;
cin >> n;
vector<pll> a(n);
for(ll i=0;i<n;i++) {
ll v;
cin >> v;
a[i]={v,i};
}
sort(a.rbegin(... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | 0 | 79,502,912 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,s,cnt;
void solve(int now, int sum, int dep){
if(sum==s&&dep==n){
cnt++;
return;
}
else if(sum>s||dep>n) return;
else{
for(int i=now+1;i<10;i++){
solve(i,sum+i,dep+1);
}
}
}
int main(){
while(scanf("%d %d",&n,&s)){
if(n==0&&s==0)
break;... | #include <stdio.h>
#include <math.h>
typedef long long ll;
int main(void) {
ll i, j, q, a, b, t, ans;
scanf("%lld", &q);
for(i = 0; i < q; ++i) {
scanf("%lld%lld", &a, &b);
if(a > b) t = b, b = a, a = t;
ans = sqrt(a * b - 1);
j = ans + 1;
if(j == a) ++j;
else {
if(ans != a && (a * b... | 0 | 19,937,901 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 0 | 68,346,873 |
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >>n;
cin >>m;
int a = 0;
for(int i = 1 ; i < n ; i++)
{
a = a + i;
}
for(int k = 1 ;k < m ;k++)
{
a = a + k;
}
cout<<a;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int n,sum,a[100005];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
a[0]=0,a[n+1]=0;
for(int i=1;i<=n+1;i++) sum+=abs(a[i]-a[i-1]);
for(int i=1;i<=n;i++)
{
int t1=abs(a[i+1]-a[i]);
int t2=abs(a[i]-a[i-1]);
... | 0 | 76,557,419 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
ll x... | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | 0 | 25,138,106 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> p(n); for(int i = 0; i < n; i++) cin >> p[i];
vector<int> a(n), pa(n), b(n), pb(n);
for(int i = 0; i < n; i++) a[i] = i + 1, b[i] = n - i;
int mk = 1;
for(int i = n - 1; i >= 0; i--){
p[i]--;
int val = (i + 1) * mk;
pa[p[... | #include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N, M;
int S[11][11] = {0};
int C[11] = {0};
std::cin >> N >> M;
for (int i = 0; i < M; i++) {
std::cin >> C[i];
for (int j = 0; j < C[i]; j++) {
int s;
std::cin >> s;
S[i][j] = (s - 1);
}
... | 0 | 52,046,245 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
while(cin>>n){
vector<int> prime(n);
int ptr=0;
if(n<=3){
switch(n){
case 0:
case 1: ptr=0; break;
case 2: ptr=1; break;
case 3: ptr=2; break;
}
}
else{
prime[ptr++]=2;
prime[ptr++]=3;
for(int no=5;no<=n;no+=2)... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 61,498,434 |
#include<cstdio>
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int t;
if(b > a){
t = a;
a = b;
b = t;
}
if(c > b){
t = b;
b = c;
c = t;
if(b > a){
... | #include <bits/stdc++.h>
using namespace std;
#define _USES_MATH_DEFINES
#define x first
#define y second
int cmp(pair<int, int> a, pair<int, int> b) {
auto f = [](long double Rad) -> long double {
if( Rad < 0 ) Rad += (2*M_PI);
return Rad;
};
return f(atan2l(a.y, a.x)) < f(atan2l(b.y, b.x)... | 0 | 67,084,611 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | 0 | 2,807,825 |
#include <bits/stdc++.h>
using namespace std;
typedef map<const long long, long long> lll;
long long n, k, a[200005], psfront[200005], pslast[200005], summ, cnt, targ;
lll lis;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i=0; i<n; i++) {
cin >> a[i];
a[i] = (a[i] -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N;
cin >> N;
vector<... | 0 | 60,647,052 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<'\n';
int main()
{
int p,q,r;
cin>>p>>q>>r;
cout<<min((p+q),min((p+r),(q+r)));
nl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 63,832,066 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
using namespace std;
#defin... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using Int = int64_t;
Int solve() {
Int N, sumA = 0, sumB = 0;
cin >> N;
vector<Int> A(N), B(N);
for (auto& i : A) {
cin >> i;
sumA += i;
}
for (auto& i : B) {
cin >> i;
sumB += i;
... | 0 | 3,378,897 |
#include <iostream>
void round_up(int *num, const int round_num)
{
int fraction;
int tmp;
tmp = *num;
fraction = tmp % round_num;
tmp /= round_num;
if (fraction != 0){
tmp++;
}
*num = tmp * round_num;
}
int debt(const int amount, const int weeks)
{
int ret;
int round_nu... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <stdio.h>
using namespace std;
typedef pair<int, int> p;
const int INF = 1000000000;
int main(){
int n; cin >> n;
for (int k = 0; k < n; k++) {
char s[... | 0 | 9,597,950 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef set<pii> pset;
int neighbor_search(const pset& bs, int y, int x) {
int r = 0;
for(int i=y-1; i<=y+1; i++) for(int j=x-1; j<=x+1; j++) {
if(bs.find(pii(i, j)) != bs.end()) {
r++;
}
... | 0 | 87,265,445 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
int ln = 100000;
int hn = 0;
for (int i = 0; i < n; ++i) {
int d;
cin >> d;
ln = min(d, ln);
hn = max(hn, d);
sum += d;
}
cout << (sum - hn - ln) / (n - 2) << endl;
}
retur... | #include<stdio.h>
#include<string.h>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<ctype.h>
#include<math.h>
#include<map>
#include<time.h>
#include<algorithm>
using namespace std;
const int N=100+1;
map<int,int> a;
typedef pair<int,int> PAIR;
bool cmp(const PAIR& left,const... | 0 | 5,656,220 |
#include <iostream>
using namespace std;
int main() {
for (int i = 0; true; i++) {
int x;
cin >> x;
if (!x)
return 0;
cout << "Case " << i + 1 << ": " << x << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >>n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int a_;
cin >>a_;
a.at(i) = a_;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a.at(a.at(i)-1)-1==i) ans++;
}
cout << ... | 0 | 14,384,706 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 52,442,349 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const double PI = 4*atan(1);
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
int a, b, c, k;
void solve() {
cin >> a >> b >> c;
cin >> k;
int ans = 0;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | 0 | 50,366,619 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
if(s.size()<=n)
{
cout<<s;
}
else{
for(int i=0;i<n;i++)
{
cout<<s[i];
}
cout<<"...";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<ll> a(N),b(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
cin>>b.at(i);
}
ll a_count=0,b_count=0;
for(int i=0;i<N;i++){
if(a.at(i)>b.at(i)){
b_c... | 0 | 80,358,043 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long X, long long A)
{
if (X < A)
cout << "0" << endl;
else
cout << "10" << endl;
}
int main()
{
long long X;
scanf("%lld", &X);
long long A;
scanf("%lld", &A);
solve(X, A);
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 0 | 28,948,627 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
using ll = long long;
using namespace std;
const ll INF = 10000000000000000;
const ll mod = 100000... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | 0 | 19,174,669 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N,count=-1,figure=1;
cin>>N;
vector<int> a(N);
for(int i=0; i<N; i++){
cin>>a.at(i);
if(a.at(i)==figure){
count++;
figure++;
}
}
cout<<(count>=0?N-count-1:count)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PLL> VP;
typedef vector<ll> VLL;
#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 rept(i,m,n) for(ll i=m; i<n; i... | 0 | 31,244,352 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, cnt;
string s, p;
cin >> s >> p;
for(i=0; i<s.length(); ++i) {
cnt = 0;
for(j=0; j<p.length(); ++j) {
if(s[(i+j)%s.length()] == p[j]) ++cnt;
}
if(cnt == p.length()) {
... | #include <stdio.h>
int main() {
char s[7];
scanf("%s", s);
if(s[2] == s[3] && s[4] == s[5]) puts("Yes");
else puts("No");
} | 0 | 34,431,491 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <stdio.h>
int main(void)
{
int m,f,r;
int su;
do{
scanf("%d%d%d",&m,&f,&r);
su = m + f;
if(m == -1 && f == -1 && r == -1)
break;
else if(m == -1 || f == -1)
putchar('F');
else if(su >= 80)
putchar('A');
else if(su >= 65 && su < 80)
putchar('B');
else if... | 0 | 39,141,638 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int x, a, b;
string ans = "dangerous";
cin >> x >> a >> b;
if(b<=a) ans = "delicious";
else if(b-a<=x) ans = "safe";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,M,A;
cin>>N>>M;
vector<int> D(N+100,-1000000),Z(0,0);
D[0]=0;
int set[10]={0,2,5,5,4,5,6,3,7,6};
unordered_map<int,int> MtoP;
for(int i=0; i<M; i++){
int A;
cin>>A;
MtoP[set[A]]=max(MtoP[set[A]],A);
Z.push_b... | 0 | 1,920,051 |
#include <iostream>
using namespace std;
int main() {
int a,b;
std::cin >>a>>b;
if(a>b)
std::cout << "a > b" <<std::endl;
else if(a<b)
std::cout << "a < b" <<std::endl;
else
std::cout << "a == b" <<std::endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
int main(){
std::vector<std::vector<int>> a(3, std::vector<int>(3));
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
std::cin >> a[i][j];
} ... | 0 | 79,395,978 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef unsig... | 0 | 84,544,816 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n, s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i <= min(n, s); i++) {
for (int j = max(s - i - n, 0LL); j <= min(n, s - i... | #include <iostream>
int main()
{
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
double x1, y1, x2, y2, x3, y3, x4, y4;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
double abx = x2 - x1, aby = y2 - y1, cdx = x4 - x3, cdy = y4 - y3;
if (abx * cdy - aby * cdx =... | 0 | 51,759,304 |
#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... | #include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdint>
#include <cassert>
using namespace std;
#define FOR(i, start, end) for(int i ... | 0 | 76,233,109 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <math.h>
#define FOR(i,b,e) for(int i=b;i<e;i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
struct Point { double x, y; };
void koch(int d, Point p1, Point p2) {
if (d == 0) return;
Point s, t, u;
double th = M_PI / 3.0;
... | #include <cstdio>
#include <vector>
using namespace std;
int n;
void counting_sort(vector<int>& A,vector<int>& B,int k) {
int C[k+1];
for(int i=0;i<=k;i++) {
C[i] = 0;
}
for(int j=1;j<=n;j++) {
C[A[j]]++;
}
for(int i=1;i<=k;i++) {
C[i] = C[i] + C[i-1];
}
for(int j=n;j>=1;j--) {
B[C[A[j]]... | 0 | 6,055,709 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | 0 | 90,550,980 |
#include <iostream>
#include <vector>
#include <string>
bool match4(const std::string& S,
std::string::const_iterator begin)
{
if (begin == S.end()) return true;
std::vector<std::string> match_list = {"dream", "dreamer", "erase", "eraser"};
bool judge = false;
for (auto m : match_list) {
std::st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | 0 | 100,572,255 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N+1);
for(int i = 1; i <= N; ++i){
cin >> A[i];
}
vector<int> tmp = A;
sort(tmp.begin()+1, tmp.end(), greater<int>());
for(int i = 1; i <= N; ++i){
if(tmp[1] == A[i]) cout << tmp[2] <<... | 0 | 32,371,962 |
#include<iostream>
using namespace std;
int main()
{
long long a[200000],i,n,l,m,j,pos=1,k;
cin>>n>>l;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
m=a[0]+a[1];
for(j=1;j<n;j++)
{
if(m<(a[j]+a[j+1]))
{
m=a[j]+a[j+1];
pos=j;
}
}
if(m<l)
... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 0 | 47,601,577 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x,a;
cin>>n>>x;a=x;
ll l1[n+5];
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i==1)x=__gcd(abs(a-l1[i]),abs(a-l1[i]));
else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 63,693,082 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> count;
for(int i=0;i<n;i++) {
int a;
cin >> a;
count[a]++;
}
int even = 0;
for(auto it = count.begin(); it != count.end(); it++) {
if(it->second % 2 == 0) {
it->second = 2;
even++;
}
... | #include<iostream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;
const int MAX_N = 10010;
typedef unsigned long long ull;
typedef long long ll;
const ull mod = 1000000000 + 7;
#define REP(i... | 0 | 40,742,927 |
#include <iostream>
int main()
{
int H,W,x,y,r;
bool in;
std::cin >> W;
std::cin >> H;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < 0 || x > W || y < 0 || y > H) {
in = false;
} else if ((y - r) < 0 || (y + r) > H) {
in = false;
} else if ((x - r) < 0 || ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | 0 | 19,651,871 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
int cnt=0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n, m, AC=0, WA=0;
... | 0 | 46,194,270 |
#include<bits/stdc++.h>
using namespace std;
void solve() {
int r,g,b,k,i=0;
cin>>r>>g>>b>>k;
while(i<k && !(r<g && g<b)) {
i++;
if(r>=g) g*=2;
else b*=2;
}
if(r<g && g<b) cout<<"Yes";
else cout<<"No";
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define Maxn 107
#define inf 1000007
char s[Maxn][Maxn];
int last[1000007],pre[1000007],other[1000007],len[1000007],cnt=0;
int n,m;
int calc(int x,int y)
{
return (x-1)*m+y;
}
void insert(int u,int v,int l)
{
other[++cnt]=v,pre[cnt]=last[u],last[u]=cnt;
len[cnt]... | 0 | 42,194,200 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long cnt,ans=0;
cin>>cnt;
for(int i=0;i<=cnt-3;i++)
{
ans+=180;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#defi... | 0 | 71,275,748 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int r;
cin>>r;
if(r<1200)
{
cout<<"ABC";
}
else if(r>=1200 && r<2800)
{
cout<<"ARC";
}
else
{
cout<<"AGC";
}
} | #include<stdio.h>
#include<iostream>
using namespace std;
const static int MAX = 100000;
const static int NIL = -1;
typedef struct {
int parent;
int left;
int right;
} Node;
Node T[MAX];
int D[MAX];
void printChildren(int u) {
int c = T[u].left;
int i = 0;
printf("[");
while (c != NIL) {
if (i > 0) pr... | 0 | 89,088,341 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
ll n, p;
string s;
cin >> n >> p >> s;
if(p == 2 || p == 5){
ll ans = 0;
rep(i, n) {
if(ll(s[i] - '0') % p == 0){
ans += i + 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B > C + D)
{
... | 0 | 13,608,326 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF (int)1e09
using std::cin;
using std::cout;
using std::endl;... | #include <bits/stdc++.h>
using namespace std;
long long N;
int findOfDigits(long long n) {
int sum = 0;
while (n > 0) {
sum += 1;
n /= 10;
}
return sum;
}
void solve() {
int res = 12;
for (long long i = 1; i <= (long long) pow(N, 0.5); ++i) {
if (N % i == 0) {
... | 0 | 89,433,860 |
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
int main() {
ll price[4];
for (int i = 0; i < 4; ++i) scanf("%lld", &price[i]);
ll n; scanf("%lld", &n);
price[0] /= 0.25, price[1] /= 0.5;
ll min_price = *min_element(price, price + 3);
ll ans = 0;
if (min_price > price[3] / 2)... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int gcd(long long s,long long t){
if(s%t==0){
return t;
}
else{
return gcd(t,s%t);
}
}
int main(){
long long n,x;
cin>>n>>x;
long long a[n];
f(i,0,n){
cin>>a[i];
a[i]=abs(a... | 0 | 100,300,779 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N,K;
cin>>N>>K;
ll h[N];
for(ll i=0;i<N;i++)
{
cin>>h[i];
}
ll dp[N];
dp[0]=0;
for(ll i=1;i<N;i++)
{
ll temp=i-1;
ll minm=abs(h[i]-h[i-1])+dp[i-1];
while(temp>=0 &&... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
int ans=0;
scanf("%d%d",&n,&m);
k=m;
int a[100005];
int u,v;
memset(a,0,sizeof(a));
while(m--)
{
scanf("%d%d",&u,&v);
a[u]++;
a[v+1]--;
}
... | 0 | 56,810,926 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | 0 | 8,223,441 |
#define MOD 998244353
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long pow(long a, long b) {
if (b == 0) return 1;
long c = pow(a, b / 2);
if (b % 2) c = a * c % MOD * c % MOD;
else c = c * c % MOD;
return c;
}
int main() {
int N;
cin >> N;
vector<long> D(N), a(N);
for (long... | #include <bits/stdc++.h>
using namespace std;
int main(){
long n; cin >> n;
long cnt = 0;
string s; cin >> s;
vector<int> v(3);
for(int i=0;i<1000;i++){
v[0] = i/100; v[1] = (i%100)/10; v[2] = i%10;
long a = 0;
for(int j=0;j<n;j++){
if(v[a] == (int)(s[j]-'0'))a++;... | 0 | 36,734,159 |
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
#define N 100000+5
using namespace std;
int n;
ll a[N],l=2,r=2;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=n;i>0;i--)
{
if(l % a[i]) l /= a[i],l = l*a[i]+a[i];
r = (r/a[i]+1)*a[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define MAX 1001000
#define MOD 1000000007
#define endl "\n"
lli arr[MAX];
lli N;
lli M;
lli Q;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli t;
t = 1;
while(t--){
lli N,M;
cin>>N>>M;
... | 0 | 27,640,778 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#define F first
#define S second
#define PLL pair<ll, ll>
using namespace std;
typedef long long ll;
ll n, k;
ll b[100005];
pair<ll, ll> a[100005];
priority_queue<PLL, vector<PLL>, greater<PLL> > pq;
priority_queue<PLL> pq2;
ll now;
ll ans;
ll ... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string line;
getline(cin, line);
line.append(line);
string search;
getline(cin, search);
if (line.find(search) != string::npos)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
... | 0 | 70,240,616 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> iii;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef priority_queue<pii, vector<pii>, greater<pii>> fila_prioridade;
typedef priority_queue... | 0 | 62,614,268 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair
#define F first
#d... | 0 | 79,175,772 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll N,K;
cin >> N >> K;
if(N < K){
cout << 0 << endl;
return 0;
}
vector<ll> H(N);
rep(i,N){
cin >> H.at(i);
}
sort(H.begin(),H.end());
ll ans = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 0 | 46,122,577 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, w, sum, row[100] = {}, col[100] = {};
char a[100][101];
cin >> h >> w;
for ( int i = 0; i < h; i++ ) {
cin >> a[i];
}
for ( int i = 0; i < h; i++ ) {
sum = 0;
for ( int j = 0; j < w; j++ ) {
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
vector<int> tree[200005];
vector<int> ans;
void dfs(int p, int u=-1) {
for (int t : tree[p]) {
if (t == u) continue;
ans[t] += ans[p];
dfs(t, p);
}
}
int main() {
int n... | 0 | 88,572,568 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.