code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if(A == B)
{
cout << "Draw" << endl;
}
else if(A == 1)
{
cout << "Alice" << endl;
}
else if(B == 1)
{
cout << "Bob" << endl;
}
else if(A > B)
{
cout << "Alice" << endl;
}
else
{
cout << "Bo... | #include <iostream>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A>B){
if(B==1){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
else if(B>A){
if(A==1){
cout<<"Alice"<<endl;
}
else {
cout<<"Bob"<<endl;
}
}
else{
cout<<"Draw"<<endl;
}
} | 1 | 37,843,711 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N, M;
vector<long long> A;
int main(... | #include<bits/stdc++.h>
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 int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | 1 | 70,271,581 |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<vector>
#include<functional>
using namespace std;
typedef long long LL;
inline LL read()
{
LL kk=0,f=1;
char cc=getchar();
while(cc<'0'||cc>... | #include <bits/stdc++.h>
#ifdef DEBUG
using std::endl;
std::ifstream cin("input.txt");
std::ofstream cout("output.txt");
#endif
#ifndef DEBUG
using namespace std;
#endif
template <class T>
void print_vect(T v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
int gcd(int a , int b){
... | 1 | 29,484,789 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N;string s;
cin>>N>>s;
string ans[4]={"... | 1 | 44,680,647 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)1e8 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((ll)1e5 + 2)
#define pi (2.0*acos(0))
#define M ((int)1e6 + 7)
#define MOD ((int)1e9 + 7)
#define NN ((int)1e6 + 7)
#define N ((int)1e5 + 7)
#define e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n; ... | 1 | 42,172,076 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 1 | 91,081,597 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
map<int, int> A;
rep(i, N) {
int a; cin >> a;
A[a]++;
}
int ans = 0;
int two = 0;
for(auto a : A) {
if... | 1 | 30,256,513 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
int main(){
int n;
cin >> n;
vector<int> a(n), p(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int d = a[0], cnt=1... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int N;
cin >> N;
int P[N];
REP(i,N) cin >> P[i];
int mi = N+1;
int ans = 0;
REP(i,N){
if(P[i] <= mi){
... | 1 | 29,412,071 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #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();
int main() {
#ifdef FASTIO
cin.tie... | 1 | 5,449,843 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
char s[105];
ll... | 1 | 80,402,539 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
string C[200];
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < 2 * H; i += 2) {
cin >> C[i];
C[i + 1] = C[i];
}
for (int i = 0; i < 2 * H; ++i) {
printf("%s\n", C[i].c_str());
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
for(int i=0;i<H;i++){
string S;
cin>>S;
cout<<S<<endl<<S<<endl;
}
} | 1 | 62,177,829 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin >> A >> B >> K;
for(int k=0; k<K; k++){
if(k%2==0){
if(A%2 != 0){ A--; }
int diff= A/2;
A-= diff;
B+= diff;
}
else{
if(B%2 != 0){ B--; }
int diff= B/2;
B-= diff;
A+= diff;
}
}... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long A, B, K;
std::cin >> A >> B >> K;
for (int k = 0; k < K; ++k) {
A... | 1 | 36,050,237 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
int x, y, c;
int minA =1000000;
int minB =1000000;
for(int i=0;i<A;i++){
cin >> a.at(i);
if(a.at(i)<minA){
minA = a.at(i);
}
}
for(int i=0;i<B;i++){
cin >> b.at(i);... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,m;
cin >> a >> b >> m;
vector<int> veca(a);
vector<int> vecb(b);
for(int i=0;i<a;i++){
cin >> veca[i];
}
for(int i=0;i<b;i++){
cin >> vecb[i];
}
vector<int> x(m);
vector<int> y(m);
vector<int> c(... | 1 | 13,680,227 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#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> b (n - 1) ;
re... | #include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define num(a) a-'0'
#define maxself(a,b) if(b>a)a=b
#define minself(a,b) if(b<a)a=b;
#define debug(x) cout<<#x<<":"<<x<<" "
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#defi... | 1 | 85,990,471 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll W,H,x,y; cin >... | #include <bits/stdc++.h>
#define pi 3.14159
#include <map>
#include <iterator>
using namespace std;
int main()
{
long long int w,h,x,y;
cin>>w>>h>>x>>y;
cout << fixed << setprecision(9) <<w*h/2.0<<" ";
if(2*x==w&&2*y==h)
cout<<"1"<<endl;
else
cout<<"0"<<endl;
} | 1 | 98,404,371 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
if (S == "AAA" || S == "BBB") cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
if (s[0] != s[1] || s[1] != s[2]) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | 1 | 19,656,337 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#defin... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 1 | 97,179,974 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
cin>>a>>b>>c;
int m,n;
m=a.length();
m--;
n=b.length();
n--;
if(a[m]==b[0]){
if(b[n]==c[0]){
cout<<"YES"<<endl;
}
else
cout<<"NO"<<endl;
}
else
cout<<"NO"<<endl;
return 0;
} | #include <stdio.h>
#include <string.h>
int main (){
char A[11],B[11],C[11];
scanf("%s %s %s", &A, &B, &C);
strlen (A),(B);
if(A[strlen(A)-1] == B[0] && B[strlen(B)-1] == C[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 | 72,636,954 |
#include <stdio.h>
int x(int num, int sum, int n){
if (num == 0 && sum == 0){
return 1;
}
if (n > 9){
return 0;
}
return (x(num - 1, sum - n, n + 1) + x(num, sum, n + 1));
}
int main(void) {
int sum, num;
while (1){
scanf("%d%d", &num, &sum);
if (num == 0 && sum == 0) break... | #include <iostream>
using namespace std;
int dfs(int now, int n, int s) {
if (n == 0 && s == 0) return 1;
if (now < 10) return dfs(now + 1, n, s) + dfs(now + 1, n - 1, s - now);
return 0;
}
int main() {
while (true) {
int n, s;
cin >> n >> s;
if (n == 0 && s == 0) return 0;
int ans = dfs(0, n, s... | 1 | 52,984,055 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #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... | 1 | 42,820,656 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
int ans = 0;
while (x <= y) {
ans++;
x *= 2;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
int ans = 1;
while (1) {
ll c = a << 1;
if (c < a) break;
if (c <= b) {
++ans;
a = c;
} el... | 1 | 12,764,640 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&... | 1 | 15,055,301 |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va{0};
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
va.push_back(a);
}
va.push_back(0);
int dist_sum = 0;
for (int i = 0; i < va.size() - 1; ++i) {
dist_sum += abs(va[i] ... | 1 | 22,089,652 |
#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>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } re... | #include <bits/stdc++.h>
using namespace std;
int main(){
int P,Q,R;
cin >> P >> Q >> R;
int answer;
answer = min(min(P+Q,Q+R),R+P);
cout << answer << endl;
} | 1 | 71,951,809 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pie 3.142857143
#define ll long long int
#define fr(i,a,n) for(ll i=a;i<n;i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i,a) for(auto i:a)
#define sz(a) int((a).siz... | 1 | 42,147,949 |
#include <cstdio>
#include<bitset>
#include<algorithm>
#include<iostream>
#include<string>
#define ll long long
using namespace std;
long long n,k;
ll a[5010];
bitset<5010> bs;
bool check(int x)
{
bs.reset();
bs[0]=1;
for(int i=1;i<=n;i++)
if(i!=x) bs|=(bs<<a[i]);
for(int i=k-a[x];i<k;i++)
if(bs[i]==1) return fa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
int l = -1, r = n;
vector<vector<bool>> v(n+1,vector<bool>(k,false));
while(r - l > 1) {
int m = (l +... | 1 | 76,331,273 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <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 A,B;
string S;
cin >> A >> B >> S;
bool ans = true;
rep(i,A+B+1){
if(i!=A) {
... | 1 | 3,063,906 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long X,Y;
cin>>X>>Y;
long long tmp=X;
int ans=0;
while(tmp<=Y){
ans++;
tmp*=2;
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 1 | 52,745,722 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
ll combination(ll n,ll k){
ll ans = 1;
if (k == 1){
return n / k;
}
ans = n * combination(n-1, k-1) / k;
re... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A( N );
for( int i = 0; i < N; i++ ) {
cin >> A[i];
}
map<int, int> mp;
for( int i = 0; i < N; i++ ) {
mp[ A[i] ]++;
}
long long all = 0;
for( auto it = mp.begin(); it != mp.end(); it++ ) {
long long n = it->second;
... | 1 | 36,291,957 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | #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 a, p;
cin >> a >> p;
p += a*3;
cout << p/2 << endl;
return 0;
} | 1 | 53,219,729 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
double a, b, c, d;
while(cin >> a >> b >> c >> d){
double ans = sqrt( (c-a) * (c-a) + (d-b) * (d-b));
printf("... | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
double l=sqrt(((x1-x2)*(x1-x2))+((y1-y2)*(y1-y2)));
printf("%lf\n",l) ;
return 0;
} | 1 | 20,392,889 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
int jmoney = 0;
double bmoney = 0;
for(int i=0; i<n; i++){
cin >> x.at(i);
cin >> u.at(i);
if(u.at(i) == "BTC"){
bmoney += x.at(i)*380000;... | #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;
double sum = 0.0;
rep(i, n){
double x;
string u;
cin >> x >> u;
if(u == "JPY"){
sum += x;
}else{
sum += x * 380... | 1 | 46,468,809 |
#include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
bool divid[1000006];
int freq[1000006];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,ans=0;
cin>>n;
vecto... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
#define N 1000000
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> check(N + 1, 0);
vector<ll> num(N + 1, 0);
for (int i = 0; i < n; i++){
cin >... | 1 | 79,304,197 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll mod(ll a) {
if (a > 0) return a % MOD;
if (a % MOD == 0) return 0;
ll x = -a / MOD + 1;... | 1 | 2,783,052 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<functional>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
typedef long long int ll;
#defi... | 1 | 44,459,967 |
#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;
int ans = 0;
rep(i, n)ans += (n-1)/(i+1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int N;
cin >> N;
long long cnt = 0;
for(int i = 1; i < N; i++)
{
for(int j = 1; j < N; j++)
{
if(1ll*i*j < N)
cnt++;
else
break;
}
}
cout << cnt;
}
int main() {
int t;
solve();
return 0;
} | 1 | 74,040,435 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int maxn = 2e5 + 5;
typedef long long ll;
typedef uint64_t HT;
const int mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
int lens = s.length();
int lent = t.length();
int ans = 0x3f3f3f3f;
for (int i = 0; i <= len... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
int m = s.length(), n = t.length(), same, ans = 0;
for(int i = 0; i <= m-n; i++)
{
same = 0... | 1 | 77,030,175 |
#include <iostream>
using namespace std;
int main() {
size_t a, b, c;
cin >> a >> b >> c;
size_t op = 0;
while (!(a == b && b == c && c == a)) {
size_t array[3] = {a, b, c};
size_t max_index = (a >= b && a >= c) ? 0 : (b >= a && b >= c) ? 1 : 2;
size_t min_index = (a < b && a < c... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
if(a < std::max(b, c)){
if(b <= c){
std::swap(a, c);
}else{
std::swap(a, b);
}
}
int offset = 0;
if(a % 2 == b % 2 && a % 2 !... | 1 | 21,834,758 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | #include<bits/stdc++.h>
using namespace std;
int main(void){
long long H,W;
cin>>H>>W;
if(H==1||W==1){
cout<<1<<endl;
return 0;
}
if(H%2==0||W%2==0){
cout<<(H*W)/2<<endl;
}else{
cout<<(H*W+1)/2<<endl;
}
return 0;
} | 1 | 98,725,972 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
long long arr[n];
for (int i = 0; i < n; i++){
cin >> arr[i];
}
int maxi = 0,cnt = 0;
for(int i = 0; i < n - 1; i++){
if(arr[i] >= arr[i + 1]){
cnt += 1;
maxi = max(maxi,cnt);
continue;
}
cnt = 0;
}... | 1 | 23,343,133 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define ll long long
using namespace std;
int main() {
int s, w;
cin >> s >> w;
string ans = "safe";
if(s <= w) ans = "unsafe";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int S, W;
cin >> S >> W;
cout << (W >= S ? "unsafe" : "safe") << endl;
} | 1 | 18,338,631 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <ctime>
using namespace std;
const unsigned long long BASE = (unsigned long long)(1e9 + ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);... | 1 | 3,123,173 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n;
cin>>s;
int cnt=1;
for(int i=1;i<n;i++){
if(s[i]!=s[i-1])
cnt++;
}
cout<<cnt<<endl;
return 0;
} | 1 | 87,699,892 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <function... | #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;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protec... | 1 | 13,984,911 |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], p[maxn];
int main()
{
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
while (k--)
{
bool flag = true;
memset(p, 0, sizeof(p));
for (... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
int main(int, char**)
{
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(_,k) {
vector<int> d(n, 0);
int... | 1 | 14,043,579 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> d(n);
for(int i = 0; i < n; i++) cin >> d[i];
int ans = 0;
for(int i = 0; i < n; i++){
for (int j = i + 1; j < n; j++){
ans += d[i] * d[j];
}
}
cout << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int d[n];
rep (i, n) cin >> d[i];
int sum = 0;
rep (i, n) {
for (int j=i+1; j < n; j++) {
sum += d[i]... | 1 | 93,140,342 |
#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 argc, const char *argv[]) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(a - c) <= d) {
cout << "Yes\n";
return 0;
}
if (abs(a - b) <= d && abs(b - c) <= d) {
cout << "Yes\n";
return 0;
}
cout << "No\n";
return 0;
} | 1 | 4,895,644 |
#include<bits/stdc++.h>
using namespace std;
int editDistance(string a,string b){
int n=a.size();
int m=b.size();
vector< vector< int > > dp;
dp.resize(n+1);
for(int i=n;i>=0;i--){
dp[i].resize(m+1);
for(int j=m;j>=0;j--){
if(i==n){
dp[i][j]=m-j;
}else if(j==m){
dp[i][j]=n-... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>
int main(){
std::string s1, s2;
std::cin >> s1;
std::cin >> s2;
int map[s1.length()+5][s2.length()+5];
for (int j=0; j<=s2.length(); j++){
... | 1 | 84,239,605 |
#include <cstdio>
int n,k;
int main(){
scanf("%d %d",&n,&k);
if((1<<n)<=k || (n == 1 && k == 1))return printf("-1"),0;
if(n == 1&&k == 0)return printf("0 0 1 1"),0;
for(int i=0;i<(1<<n);++i)
if(i != k)printf("%d ",i);
printf("%d ",k);
for(int i=(1<<n)-1;~i;--i)
if(i != k)printf("%d ",i);
printf("%d ",k);
re... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int m,k;
cin>>m>>k;
if(k>=(1<<m))
{
cout<<"-1\n";
return 0;
}
if(m==1)
{
if(k==1)
cout<<"-1\n";
else
{
cout<<"0 0 1 1\n";
}
return 0;
}
for(int i... | 1 | 94,928,938 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s,t;
cin>>s>>t;
string ans="";
int i=0,j=0;
while(i<n||j<n)
{
ans.push_back(s[i]);
ans.push_back(t[j]);
i++;j++;}
cout<<ans<<endl;} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n;string s,t;
cin >> n >> s >> t;
rep(i,n){
cout << s.at(i) << t.at(i);
}
cout << endl;
} | 1 | 96,400,528 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 1 | 6,378,517 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
int main(){
fast;
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll s=max(a,c),e=min(b,d);
if(e-s>0)
cout<<e-s;
else
cout<<0;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;cin>>A>>B>>C>>D;
int P=max(A,C);
int Q=min(B,D);
if(P>Q) cout<<0<<endl;
else cout<<Q-P<<endl;
} | 1 | 70,330,448 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int left = 0;
int right = n - 1;
int sum = 0;
while(1) {
int lCount = left;
int rCount = right;
while(left < n && s[left] == 'x')left++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmi... | 1 | 40,096,642 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e7+1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x)... | #include<stdio.h>
int main()
{
char c;
int n;
int out;
int end;
int i;
scanf("%d",&n);
for(i=0;i<n+1;i++)
{
end=0;
while(1)
{
out=0;
while(1)
{
scanf("%c",&c);
if(out==0)
{
switch(c)
{
case '1':
out=1;
break;
case '2':
... | 1 | 51,611,037 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n, m;
cin >> n >> m;
if (2 *... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 1 | 17,139,785 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<cstdio>
#include<cstdlib... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000000
#define Edge pair<long long,int>
int main(){
long long N,X;
cin>>N>>X;
long long a = X,b = N-X;
long long ans = a+b;
while(true){
if(a>b){
if(a%b==0){
... | 1 | 50,612,662 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<=3;i++){
cout<<s[i];
}
cout<<" ";
for(int i=4;i<=s.size()-1;i++){
cout<<s[i];
}
cout<<endl;
} | 1 | 97,171,221 |
#include <cstdio>
long long n,m;
int main(){
scanf("%lld %lld",&n,&m);
long long x=0;
if(m<=n*2)x=m/2;
else x=(n*2+m)/4;
printf("%lld",x);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll s,c;
cin >> s >> c;
ll res = 0;
if(c / 2 <= s){
res = c / 2;
}
else... | 1 | 319,941 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int A[3];
scanf("%d %d %d", A, A+1, A+2);
int lowest = min({A[0], A[1], A[2]}), highest = max({A[0], A[1], A[2]});
unsigned candidate, answer = 78;
for (int goal = lowest; goal <= highest + 1; goal++){
candidate = 0;
... | #include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B, long long C){
long long current;
long long tarinai;
if(A >= B && A >= C) {
current = ((A-B)/2)+((A-C)/2);
tarinai = ((A-B)%2)+((A-C)%2);
}
else if(B >= A && B >= C) {
current = ((B-A)/2)+((B-C)/2);
tarinai = ((B... | 1 | 96,248,439 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
int main(){
int N;
cin>>N;
vector<int>A(N+1),B(N);
for(int i=0;i<N+1;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
cin>>B[i];
}
int64_t sum=0;
for(int i=0;i<N;i++){
if(A[i]<=B[i]... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> ... | 1 | 76,449,975 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ldb n, m, d; cin >> n >> m >> d;
if (d == 0) printf... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, m, d; cin >> n >> m >> d;
cout << fixed << setprecision(10);
if (d == 0) cout << (m - 1) / n << endl;
else cout << 2 * (n - d) * (m - 1) / (n * n) << endl;
} | 1 | 59,583,655 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
string s , t;
cin >> s >> t;
sort(s.begin() ,s.end());
sort(t.begin() ,t.end(),greater<char>());
if(s == t){
cout << "No" << en... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | 1 | 84,425,432 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int BFS(const vector<string> &board){
using coord= pair<int, int>;
constexpr char block= '#';
constexpr int TBC= INT_MAX;
const vector<coord> diff= {make_pair(1,0), make_pair(0,1)};
const int H= board.size();
const int W= board.at(0).size(... | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<lint> vl;
type... | 1 | 58,093,973 |
#include <stdio.h>
#include <string.h>
#include <math.h>
int main ()
{
int n;
scanf ("%d", &n);
int a[n], a1[n];
for (int i=0;i<n;i++) {
scanf ("%d",&a[i]);
a1[a[i]-1]=i+1;
}
for (int j=0;j<n;j++) {
printf ("%d ", a1[j]);
}
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define nl endl
#define tc \
ll t; \
cin >> t; \
while (t--)
#define fastio \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL); \
cout.tie(NULL);
using namespa... | 1 | 67,220,873 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
int n = a.size(), m = b.size();
int dp[n + 1][m + 1];
for(int j = 0; j <= m; j++){
for(int i = 0; i <= n; i++){
if(i == 0) dp[i][j] = j;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(string& s1, string& s2){
vector<vector<ll> > dp(s1.length()+1, vector<ll>(s2.length()+1,INT_MAX));
dp[0][0] = 0;
for (ll i = 0; i < s1.length(); i++)
{
dp[i+1][0] = i+1;
}
for (ll i = 0; i < s2.length(); i++)... | 1 | 46,354,177 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size() ;
vector<int> alphabet(26);
for(int i=0;i<size;i++){
int num = S[i] -'a' ;
alphabet.at(num) = 1;
}
char min_char;
bool judge = f... | #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;
cin >> S;
set<char> st;
rep(i, S.size()) st.insert(S[i]);
for (int i = 0; i < 26; i++) {
if (!st.erase((char)('a' + i))) {
cout << (char)('a' + i) << endl;
r... | 1 | 62,711,595 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b;
ll i,j,k;
ll x[100005];
bool solve(){
cin >> n >> a >> b;
if(n + a + b == 0){
return false;
}
for(i=0;i<n;i++){
cin >> x[i];
}
ll num = -100;;
ll ansind = -1;
for(i=a-1;i<b;i++){
ll sa = x[i] - x[i+1];
if(sa >= num){
num = s... | #include <bits/stdc++.h>
using namespace std;
int p[200];
int main() {
int m,n_min,n_max;
while(scanf("%d %d %d",&m,&n_min,&n_max),m) {
for(int i=0;i<m;i++) {
scanf("%d",&p[i]);
}
int max_gap=0;
int ans=0;
for(int i=n_min;i<=n_max;i++) {
if(p[i-1]-... | 1 | 54,973,346 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
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) {
... | 1 | 96,828,274 |
#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 ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
int a[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
vector<int> b;
for (int i=0; i<n; i++) {
if (a[i] < k) {
b.push_back(a[i]);
}
}
int size = b.size();
bool dp_left[size+1][k], dp_right[size+1][k];
for (int i=0; ... | 1 | 14,357,277 |
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(auto i=0;i<n;i++)
#define s(c) static_cast<int>((c).size())
int H = 0, A[2000002];
int parent(int i){
return i/2;
}
void heapIncreaseKey(int key){
int i = H;
if(key < A[i])
printf("err\n");
A[i] = key;
while(i > 1 && A[parent(i)] < A[i]){
swap(A[... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | 1 | 34,086,790 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
template<typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T> T lcm(... | #include<bits/stdc++.h>
using namespace std;
long long lcd(long long a,long long b){
if(a<b) swap(a,b);
while(b){
long long temp = a%b;
a = b;
b = temp;
}
return a;
}
int main(){
long long a,b;
cin>>a>>b;
cout<<a*b/lcd(a,b);
} | 1 | 54,556,676 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
if (x <= t)
cout << "0" << "\n";
else
cout << x - t << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll x,t;cin >>x>>t;
x-=t;
cout <<max(x,0LL)<<endl;
return 0;
} | 1 | 35,556,674 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
void solve()
{
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans=-1e18;
ans=max(ans,a*c);
ans=max(ans,a*d);
ans=max(ans,b*c);
ans=max(ans,b*d);
cout << ans << endl;
}
int main()
{
in... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 998244353;
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define FW freopen("data2.txt", "w", stdout);
template <class T... | 1 | 71,595,611 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i=a ; i<b ; ++i)
#define repr(i,a,b) for(int i=a ; i>=b ; --i)
#define deb(x) cout << #x << " - " << x <<... | 1 | 69,960,993 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll mBit(ll n){
return (1LL<<n)%mod;
}
int main(){
ll n,a,i,j,B[61] = {},ans = 0;scanf("%lld",&n);
for(i=0;i<n;i++){
scanf("%lld",&a);
for(j=0;j<=60;j++){
B[j] += a%2;
a >>= 1;
}
}
for(i=0;i<=6... | 1 | 72,809,565 |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll l = lcm(c, d);
ll A = a - 1 - (a - 1) / c - ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 | 6,763,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; i++) {
int x, y;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 1 | 9,602,709 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,H,W,ans = 0;
cin >> N >> H >> W;
vector<long long>A(N);
vector<long long>B(N);
for(int i=0; i<N; i++){
cin >> A[i] >> B[i];
if(A[i] >= H && B[i] >= W){
ans++;
}
}
cout << ans << endl;
} | 1 | 52,975,692 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
char ch;
cin>>ch;
if(ch>='A' && ch<='Z')
cout<<'A';
else
cout<<'a';
} | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#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++)
#define MAX_N 10000
using namespac... | 1 | 63,102,468 |
#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;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
stati... | 1 | 9,591,547 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> data(101);
int n;
while (cin >> n && n) {
data[n] ++;
}
int maxn = *max_element(data.begin(), data.end());
for (int i=0; i<101; ++i) {
if (data[i] == maxn) {
cout ... | #include <iostream>
#include <cstring>
using namespace std;
int main() {
int a[101];
int n, max;
memset(a, 0, sizeof(int)*101);
while (cin >> n) a[n]++;
for (int i=0; i<=100; i++) {
if (a[i] > max) max = a[i];
}
for (int i=0; i<=100; i++) {
if (a[i] == max) cout << i << endl;
}
return 0;
} | 1 | 44,174,573 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,m;
cin >> n >> m;
ll match[10] = {0,2,5,5,4,5,6,3,7,6};
vector<ll> a(m);
for(i = 0;i < m;++i){
cin >> a.at(i);
}
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | 1 | 90,726,973 |
#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()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n; cin >> n;
int ma = 0, ans = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff ... | 1 | 34,962,927 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll calc(ll bit,ll k,vector<ll>v){
if(bit==-1)return 0;
vector<ll> tmp;
for(ll i=0;i<(ll)v.size();i++)if((v[i]>>bit)&1)tmp.push_back(v[i]);
if(tmp.size()>=k)return (1ll<<bit) + calc(bit-1,k,tmp);
else return calc(bit-1,k,v);
}
int ma... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 1 | 98,960,935 |
#include<iostream>
#include<string.h>
using namespace std;
long long sin[100001];
int main(){
while(1){
memset(sin,0,sizeof(sin));
int n,k;
int i,j,max=0,x;
cin>>n>>k;
if(n==0&&k==0)break;
for(i=0;i<n;i++){
cin>>sin[i];
}
for(i=0;i<n-k+1;i++){
x=0;
for(j=0;j<k;j++){
x+=sin[i+j];
}
if(max<x)max=x;... | #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... | 1 | 43,885,203 |
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | 1 | 7,559,868 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
rep(i, n){
mp[a[i]]++;
}
int ans = 0;
for(auto i: mp){
if(i.sec... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
map<int, int> M;
for (auto &a : A) {
M[a] += 1;
}
int cnt = 0;
for (auto &m : M) {
if (m.first < m.second) {
cnt +=... | 1 | 79,949,378 |
#include <bits/stdc++.h>
#define REPI(x) for(int i=0;i<x;i++)
#define REPJ(x) for(int j=0;j<x;j++)
#define REPISE (s,e) for(int i=s,i<e;i++)
#define REPJSE (s,e) for(int j=s,j<e;j++)
typedef long long ll;
using namespace std;
int main ()
{
int N,b,res=0;
vector<int> B;
cin >> N;
REPI(N-1)
{
cin >> b;
... | #include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
int main()
{
int sum = 0;
int n; cin >> n;
... | 1 | 34,208,217 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s, t, u;
int a, b;
cin >> s >> t;
cin >> a >> b;
cin >> u;
if (s == u) a--;
if (t == u) b--;
cout << a << " " << b << '\n';
return 0;
} | #include <iostream>
#include <cmath>
#include <bits/stdc++.h>
#include <algorithm>
#include <complex>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(7)<<(x)
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
typedef pair<int , int > ... | 1 | 44,392,483 |
#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() {
ll N, A, B;
cin >> N >> A >> B;
ll devided = N / (A + B);
ll left = N % (A + B);
ll ans = 0;
ans += devided * A;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,a,b;
cin>>n>>a>>b;
ll sum=a+b;
ll ans=n/sum*a;
ll sum2=n%sum;
ans+=min(a,sum2);
cout <<ans;
return 0;
} | 1 | 3,039,392 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<vector<vector<char>>> Used(X, vector<vector<char>>(Y, vector<char>(Z, 0)));
vector<long long> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) cin >> A[i];
for... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 1 | 91,562,494 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=5e5+5;
const int mod=1e9+7;
inline int read(){
char c=getchar();int t=0,f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){t=(t<<3)+(t<<1)+(c^48);c=getchar();}
return t*f;
}
int n,sta[maxn],rec[maxn];
char s[maxn];... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
string S;
cin >> N >> S;
vector<ll> vec(2 * N);
vec[0] = 0;
rep(i,2 * N -... | 1 | 95,530,372 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int n,k; cin>>n>>k;
if(k==1) cout<<0<<"\n";
else cout<<abs(n-(k-1)-1)<<"\n";
return 0;
} | 1 | 70,083,530 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
string s;
cin>>n>>s;
for(int p=0;p<4;++p){
string t(n,'?');
t[0]=a=(p%2?'S':'W');
t[1]=b=(p/2%2?'S':'W');
for(int i=1;i<=n;++i){
int prev=(i%n==0?n-1:i-1);
int next=(i==n-1?0:i%n+1);
if((s[i%n]=='o'&&t[i%n]=='S... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i_l = (int)n; i < i_l; i++)
#define loop(i, a, b) for (int i = a; i < (int)(b); i++)
int N;
string s;
char reversed(char c) {
return c == 'S' ? 'W' : 'S';
}
string solve(char first, char second) {
char ans[N];
... | 1 | 67,382,826 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n , m ; cin >> n >> m;
vector<bool> chk(n,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;... | 1 | 51,338,313 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int tt;
tt = 1;
while (tt--)
{
double d, t, s;
cin >> d >> t >> s;
if ((d / s) <= t)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}... | 1 | 18,340,599 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s,t;
cin>>s>>t;
for(int i=0;i<n;i++)
{
string s_temp=s.substr(i);
string t_temp=t.substr(0,(int)s_temp.size());
if(s_temp==t_temp)
{
cout<<(2*i)+(s_temp.size());
return 0;
}
}
cout<<2*n;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
string a, b; cin >> a >> b;
int cnt=2*n;
for(int i=0; i<n; i++){
string s1 = a.substr(i);
string s2 = b.substr(0, n-i);
if(s1!=s2) continue;
cnt = 2*i+(n-i);
break... | 1 | 14,950,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<vector<tuple<int64_t,int64_t,int64_t,int64_t>>> p(8,vector<tuple<int64_t,int64_t,int64_t,int64_t>>(N));
vector<tuple<int64_t,int64_t,int64_t,int64_t>> q(8);
for(int i=0;i<N;i++){
int64_t a,b,c;
cin>>a>>b>>c;
for(i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
struct cake {
ll x;
ll y;
ll z;
};
int main() {
ll N, M; cin >> N >> M;
vector<cake> V(N);
rep(i, N){
cin >> V[i].x >> V[i].y >> V[i].z;
}
ll ans = 0;
for (int i... | 1 | 13,665,846 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using P =pair<int,int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n+1);
rep(i,n) cin >> a[i];
ll sum=0;
rep(i,n){
sum+=b[a[i]];
b[a[i]]++;
}
rep(i,n) cout << sum-b[a[i]]+1 << "\n";
... | 1 | 88,263,021 |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | #include <bits/stdc++.h>
using namespace std;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *i... | 1 | 27,409,774 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.