code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
using namespace std;
double cutup(double x) {
if (x - (double)((int)x / 1000) * 1000 > 0) {
x = (double)((((int)x / 1000) + 1) * 1000);
}
return x;
}
double money(double x, int target, int depth = 0) {
if (target == depth) { return x; }
return money(cutup(x * 1.05), t... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define RREP(i,n) for(int i=int(n)-1; i>=0; i--)
#define FOR(i,f,t) for(int i=int(f); i<=int(t); i++)
#define RFOR(i,f,t) for(int i=int(f); i>=int(t); i--)
#define ALL(vec) (vec).begin(),... | 0 | 77,534,922 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int ans = 0;
if(n > k){
... | #include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#i... | 0 | 3,065,479 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | #include<iostream>
#include<bits/stdtr1c++.h>
#include<vector>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define zn(a,b,c) for(ll a=b;a<c;a++)
#define nz(a,b,c) for(ll a=b;a>c;a--)
using namespace std;
double nthRoot(int A, int N)
{
double xPre = rand() % 10;
... | 0 | 68,787,549 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;vector<int>A(26,100);
for(int i=0;i<N;i++){string S;cin>>S;vector<int>B(26);for(int j=0;j<S.size();j++)B[S.at(j)-'a']++;for(int j=0;j<26;j++)A[j]=min(A[j],B[j]);}
for(int i=0;i<26;i++)for(int j=0;j<A[i];j++)cout<<char(i+'a');
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, great... | 0 | 32,493,209 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
string N;
int K, l;
cin >> N >> K;
l = N.size();
vector<int> n(l);
rep(i,l) n[i] = N.at(i) - '0';
vector... | #include<iostream>
using namespace std;
int main() {
int tate, yoko;
cin >> tate >> yoko;
while (tate != 0 || yoko != 0) {
for (int i = 0; i < yoko; i++)cout << "#";
cout << endl;
for (int i = 1; i < tate-1; i++) {
for (int j = 0; j < yoko; j++) {
if (j == 0||j==yoko-1)cout << "#";
else cout << '.';... | 0 | 100,722,031 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 0 | 60,384,581 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
int cnt=0;
int len=S.size();
bool AC=true;
if(S[0]!='A'){
AC=false;
}
for(int i=2;i<len-1;i++){
if(S[i]=='C'){
cnt++;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
;
ll ans = 0;
rep(i, n) {
if(b[i] >... | 0 | 17,437,580 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
vector<pair<ll,ll>> a;
for(int i=0;i<n;i++){
ll b;
cin >>b;
a.push_back(make_pair(b,i+1));
}
sort(a.begin(),a.end());
for(int i=1;i<n+1;i++){
if(a[n... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 0 | 21,420,534 |
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ll long long
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define VAR(v, i) __typeof( i) v=(i)
#define forit(i, c) for(VAR(i, (c).begin()); i != (c).... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
ll tmp = 0;
ll ans = 1e9;
rep(i,n){
cin >> a[i];
}
sort(ALL(a));... | 0 | 37,085,174 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(i==4){
cout<<" "<<flush;
}
cout<<s[i]<<flush;
}
cout<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 21,778,103 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int k,a,b,sum;
cin>>k>>a>>b;
sum = (b / k)* k;
if(a <= sum){
cout<<"OK";
}
else{
cout<<"NG";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 70,743,403 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int N; cin >> N;
vector<int> C(N, 0), S(N, 0), F(N, 0);
REP(i, N - 1) cin >> C[i] >> S[i] >> F[i];
REP(i, N - 1) {
int res = S[i] + C[i];
for (int j = i + 1; j < N -... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll)x.size()
#defin... | 0 | 57,993,362 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
#define MAX_INT ((1 << 31) - 1);
using namespace std;
ifstream fin("../data.txt");
int n, x, sum, ans, diff;
vector<int> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
int N,mem;
int A[100010];
int sum[100010] = {0};
int side = 0;
ll D[100010],R[100010];
ll power(ll a,ll b)
{
if(b == 0)return 1;
ll res = power(a * a % mod,b / 2);
if(b & 1)res = res * a % mod;
return res;
}
ll con... | 0 | 37,192,763 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,X;cin>>N>>X;
vector<int>x(N+1);
x[0]=X;
for(int i=1;i<=N;i++){
cin>>x[i];
}
sort(x.begin(),x.end());
int A[N];
for(int i=0;i<N;i++){
A[i]=x[i+1]-x[i];
}
long long ans=x[1]-x[0];
for(int i=1;i<... | 0 | 39,533,644 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m, k;
bool a = false;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
int sum = 0;
for(int j = 1; j <= m; j++){
sum = (n - i) * j + (m - j)* i;
if(sum == k)
{
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 31,176,698 |
#include <cstdio>
using namespace std;
int n;
int y, m, d;
int main() {
scanf("%d", &n);
for (int i=0; i<n; i++) {
scanf("%d%d%d", &y, &m, &d);
int cnt = 0;
while (!(y == 1000 && m == 1 && d == 1)) {
int days = 19;
if (y%3 == 0 || m%2 == 1) days = 20;
cnt += days-d+1;
d = 1;
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1e9;
int main() {
int N; cin >> N;
vector<int> t(N + 1), v(N + 2);
for (int i = 1; i <= N; i++) {cin >> t[i]; t[i] *= 2;}
for (int i = 1; i <= N; i++) {cin >> v[i]; v[i] *= 2;}
vector<int> l(N + 2), r(N ... | 0 | 86,815,871 |
#include<stdio.h>
using namespace std;
int main(){
while(true){
int m,f,r;
scanf("%d%d%d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1)break;
if(m==-1 || f==-1)printf("F\n");
else if(m+f>=80)printf("A\n");
else if(m+f>=65&&m+f<80)printf("B\n");
else if(m+f>=50&&m+f<65)pr... | #include <iostream>
#include <string>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <iomanip>
#include <vector>
#include <functional>
#include <algorithm>
#include <cstdio>
#include <random>
#include <ctime>
#include <cstdlib>
#include <unordered_map>
#include <string.h>
#incl... | 0 | 18,400,295 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
double ans;
int n;
signed main(){
ios_base::sync_with_stdio(0);
cin>>n;
w... | #include <iostream>
using namespace std;
int main()
{
int n, m, p;
int num[101];
while (cin >> n >> m >> p, n|m|p) {
int total = 0;
for (int i = 1; i <= n; i++) {
cin >> num[i];
total += num[i] * (100-p);
}
if (!num[m]) {
cout << 0 << endl;... | 0 | 95,582,746 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s;
cin>>s;
if(isupper(s)) cout<<'A'<<endl;
else cout<<'a'<<endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#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... | 0 | 79,583,839 |
#include<stdio.h>
int main()
{
long long int n;
while(scanf("%lld",&n)==1)
{
long long int sum=1;
for(long long int i=n;i>0;i--)
sum*=i;
printf("%lld\n",sum);
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <tuple>
#include <functional>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
ty... | 0 | 39,823,518 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int a[105];
int main() {
int n;
cin >> n;
for (int i = 1; i < n + 1; i++) {
int u = i;
for (int j ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 45,615,019 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
cons... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mo... | 0 | 52,341,051 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
bool b=0;
int x[n];
for(int i=0;i<n;i++) cin>>x[i];
sort(x,x+n);
for(int i=0;i<n;i++)
if(x[i]==x[i+1]){
b=1;
break;
}
if(b==0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
} | #include<iostream>
#define LL long long
LL K;
LL A[50];
int main(){
std::cin>>K;
std::cout<<50<<std::endl;
for(int i=0;i<50;i++){
A[i]=49+(K/50);
}
for(int i=0;i<K%50;i++){
A[i]+=50;
A[i]-=K%50-1;
}
for(int i=K%50;i<50;i++){
A[i]-=K%50;
}
for(int i=0;i... | 0 | 71,627,668 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string o, e;
cin >> o >> e;
string ans = "";
for (int i = 0, j = 0; i < o.size() || j < e.size();)
{
if (i < o.size())
{
ans += o[i];
i++;
}
if (j < e.size())
{
ans += e[j];
j++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const int MAXS = (1 << 26) + 5;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = g... | 0 | 74,418,653 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <numeric>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define all(v) v.begin()... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 69,012,771 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
const int INF = (1LL<<31)-1;
int main(){
ll K; cin >> K;
vector<vector<P> > G(K);
for(int i=0;i<K-1;i++){
G[i].push_back({10*i%K,0});
G[i].push_back({(i+1),... | #include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define F... | 0 | 31,103,963 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
for (int k = 0; k < 10; k++)
for (int l = 0; l < 10; l++)
if (i + j + k + l == n)
ans++;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
int H,W,ans=0; cin>>H>>W;
vector<vector<char>> S(H,vector<char>(W));
queue<pa... | 0 | 398,190 |
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const ... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(int)n;i++)
typedef long long ll;
using namespace std;
long long modpow(long long a, long long n,ll mod){
long long r = 1;
while (n) {
r = r * ( (n%2)?a:1 ) %mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
int main(void){
ll n,mod;cin>>n>>mod;
... | 0 | 67,316,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, Bl, Br;
char dot;
cin >> A;
cin >> Bl >> dot >> Br;
int64_t result;
result = A * (Bl * 100 + Br);
result /= 100;
cout << result << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,h;
cin >> n >> h;
int a[n],b[n];
for(int i=0;i<n;i++)cin >> a[i] >> b[i];
sort(a,a+n);
sort(b,b+n);
int ans=0;
for(int i=n-1;i>=0;i--){
h -= b[i];
ans++;
if(h<=0)break;
if(a[n-1]>b[i-1])break;
... | 0 | 43,288,495 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,i,j;cin>>n;int a[n];
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n;i++) a[i]-=(i+1);
sort(a,a+n);
ll s=0;
for(i=0;i<n;i++) s+=abs(a[i]-a[n/2]);
cout<<s;
return 0;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 72,501,937 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,s,t;
cin>>v>>t>>s;
if (t*s>=v)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
static const int INFH = (1<<30)-1;
static const int INFL = -INFH;
vector<pair<char, int>> runLength(string x)
{
char now = x[0];
int count = 1;
vector<pair<char, int>> ret;
for (int i = 1; i < x.size(); ++i)
{
if(x[i] != now)
{
ret.push_back(make_pair(now, count... | 0 | 61,658,098 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define Q int tt,qq; cin>>tt ;for(qq=1;qq<=tt;qq++)
#define I ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main()
{
ll n,i,j,ans=0;
cin>>n;
ll a[n+1],b[n];
for(i=0;i<n+1;i++)cin>>a[i];
for(i=0;i<n;i++)cin>>b[i];
for(... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <utility>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
ll n, m;
ll get_edge_len(ll n, vector<ll> X) {... | 0 | 43,114,335 |
#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];
int cl=99999;
int ans=0;
for(int i=0;i<N-1;i++){
if(a[i]==a[i+1]){
a[i+1]=cl;
cl--;
ans++;
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define X first
#define Y second
const int N = 2e5 + 5;
typedef pair<int,int> ii;
ii F[1 << 18];
void upd(int i,int x) {
if (F[i... | 0 | 71,711,705 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,j,k,l,n,cnt;
while(scanf("%d",&n)!=EOF) {
cnt=0;
for(i=0;i<=9;i++) {
for(j=0;j<=9;j++) {
for(k=0;k<=9;k++) {
for(l=0;l<=9;l++) {
if(i+j+k+l==n) {
cnt++;
}
}
... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long ... | 0 | 61,294,982 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
ll n,a,t[100005]={},ans[2]={},r=0,k;
cin>>n;
map<ll,ll>m;
for(ll i=0;i<n;i++)
{
cin>>a;
m[a]++;
}
vector<ll>v;
for(auto i=m.begin();i!=m.end();i++)
{
ll s=i->second;
if(s>=4)r=i->first;
if(s>... | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
int main(){
ll n, m;
cin >> n >> m;
ll po = 0, yo = 0;
for(ll i = 0; i < n; i++){
ll x;
cin >> x;
x *= (2 * i - n + 1);
po += x;
if(po < 0) po += -po / MOD * MOD + (-po % MOD ... | 0 | 57,928,223 |
#include <cstdio>
using namespace std;
char s[] = "RGYB";
int n, m, k;
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; putchar(10), i++)
for (int j = 0; j < m; j++)
putchar(s[(i + j) / k % 2 * 2 + (i + m - j) / k % 2]);
} | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<V<T>>;
struct Idx {
ll i1, i2;
};
const ll S = (1ll << 18) + 10;
V<Idx> memo(S, Idx{0, 0});
V<ll> ans(S, 0);
int main() {
ll N;
cin >> ... | 0 | 81,274,327 |
#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>;
int main()
{
int n;cin >> n;
ll a[n+1];
rep(i,n)cin >> a[i];
sort(a,a+n);
ll ans = a[n-1] - a[0];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
using namespace std;
int q;
int len[1005][1005];
int common(string a,string b,int m,int n){
int i,j;
for(i=0;i<=m;i++)len[i][0]=0;
for(i=0;i<=n;i++)len[0][i]=0;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(a[i]==b[j])len[i+1][j+1]=le... | 0 | 25,349,610 |
#include <bits/stdc++.h>
using namespace std;
int main(){
constexpr int Ndig= 10;
int N;
string S;
cin >> N >> S;
vector<vector<int>> positions(Ndig);
for(int i=0; i<N; i++){
int d= stoi(S.substr(i,1));
positions.at(d).emplace_back(i);
}
vector<int> existdig;
for(int d=0; d<Ndig; d++){
if(... | #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 n;
cin>>n;
ll arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
ll b[... | 0 | 42,383,320 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << (n+k-1)/k - n/k << endl;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 94,485,876 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
#include <numeric>
#include <functional>
#include <stack>
#include <iomanip>
#include <map>
#include <cstdio>
int main() {
long long n;
std::cin >> n;
std::vector<long long> v(n);
for (long long i = 0; ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
typedef pair<ll,ll> pint;
int main(){
ll n,k;cin>>n>>k;
vector<ll> a(n);rep(i,n)cin>>a[i];
vector<ll> s(n+1,0);
vector<ll... | 0 | 71,778,330 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define sort_be(a) sort(a.begin(), a.end());
#define reverse_be(a) reverse(a.begin(), a.end());
#define vi vector<int>
#define vvii(a, b, c) vector<vector<int>> a(b, vector<int>(c));
using namespace std;
using ll = long long;
int main(){
l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n... | 0 | 66,524,676 |
#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;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | 0 | 10,328,505 |
#include <iostream>
#include <iomanip>
#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 <cfloat>... | #include <iostream>
#include <stdio.h>
#define INF 10000
using namespace std;
struct edge {
int from, to, cost;
};
edge es[100];
int d[11];
int n,maxV=0;
int shortest_path(int s){
int sum=0;
for(int i=0;i<maxV+1;i++){
d[i] = INF;
}
d[s] = 0;
while(1){
bool update = false;
... | 0 | 10,219,432 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
string N;
cin>>N;
rep(i,4-3+1)
{
if(N[i]==N[i+1]&&N[i+1]==N[i+2])
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001;
int main() {
ll n; cin >> n;
ll k; cin >> k;
ll a[n];
rep(i... | 0 | 18,077,516 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
if (i * j % 2019 == 0) {
... | 0 | 77,588,661 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a<b&&b<c){
printf("Yes\n");
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y;
int main(){
scanf("%d%d", &n, &m);
if(m >= (1<<n)) printf("-1\n");
else if(m == 0){
for(i=0; i<=(1<<n)-1; i++){
printf("%d %d ", i, i);
}
}
else if(n < 2) printf("-1\n");
else{
for(i=0; i<=(1<<n)-1; i=++x){
if((j=i^m) < i) continue... | 0 | 53,963,902 |
#include <iostream>
using namespace std;
void swap(int *, int *);
int main()
{
int x,y;
while (1)
{
cin >> x >> y;
if (x == 0 && y == 0)
break;
if (x>y)
swap(&x, &y);
cout << x << " " << y << endl;
}
return 0;
}
void swap(int *a, int *b)
{
int temp;
temp = *b;
*b = *a;
*a = temp;
} | #include <bits/stdc++.h>
#define llint long long int
#define MOD 2019
using namespace std;
int main()
{
int L, R;
cin >> L >> R;
if (R - L > 2 * MOD)
{
R = L + 2 * MOD;
}
int min = 2019;
for (int i = L; i <= R; i++)
{
for (int j = i + 1; j <= R; j++)
{
... | 0 | 5,673,914 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int MN = 100005;
unsigned long long s = 0;
ll n, a[MN];
ll max_p[MN];
int main() {
cin >> n;
for (int i = 0; i <= n; ++i) {
cin >> a[i];
s += a[i];
}
if (a[0] > 0) {
if (n == 0 && a[0] < 2) {
cout << a[0] << endl;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 7,637,622 |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
int p=1;
for(int i=1;i<=n;i++){
if(k>p)p*=2;
else p+=k;
}
cout<<p<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = -1;
for(int i = 0; i < (1 << n); i++) {
long long cost = 0;
long long hmax = 0;
int color = 0;
for(int ... | 0 | 41,169,988 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
const int SIZE = 100000;
int dp[3][SIZE];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;cin>>n>>k;
int r, s, p;cin>>r>>s>>p;
string t;cin>>t;
vector<bool> success;
int a... | #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() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
sort(h.begin(), h.end());
reverse(h.begin(),... | 0 | 73,369,866 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,h; c... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans;
cin >> N;
if (N<105) {
ans=0;
}
else {
if (N<135) {
ans=1;
}
else {
if (N<165) {
ans=2;
}
else {
if (N<189) {
ans=... | 0 | 58,523,631 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxN ... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main(){
long long N, X, M;
cin >> N >> X >> M;
vector<long long> cnt;
cnt.push_back(X);
set<long long> s;
s.insert(X);
int ind;
while(1){
X = X * X % M;
if(s.count(X)) {
... | 0 | 13,009,315 |
#include <bits/stdc++.h>
using namespace std ;
int main(){
string A,B;
cin >> A >> B;
int Ak = A.size();
int Bk = B.size();
int Ans=-1;
if(Ak>Bk)Ans=0;
else if(Ak<Bk)Ans =1;
else{
for(int i=0;i<A.size();i++){
if(A[i]>B[i]){
Ans =0;
brea... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 0 | 51,997,069 |
#include<cstdio>
bool done[21][21];
int W,H;
char s[21][21];
bool map[21][21];
void init(){
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
done[i][j]=false;
map[i][j]=false;
s[i][j]=0;
}}
}
void solve(int h,int w){
if(s[h][w]=='.' || s[h][w]=='@'){
map[h][w]=true;
done[h][w]=true;
... | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
... | 0 | 51,757,679 |
#include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_st... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=1, tmp=0;
vector<ll> T, A, Tmins, Amins;
signed main(){
cin >> N;
Tmins.resize(N, 1);
tmp = 0;
for(int i=0;i<N;i++) {
l... | 0 | 81,773,923 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define print(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int bexp(int a, int b, int mod)
{
int res = 1;
while (b)
{
if (b & 1) res = (res * a) % mod;
a ... | #include<stdio.h>
int main(){
int A;
int B;
scanf("%d",&A);
scanf("%d",&B);
if(A==1&&B==2){
printf("%d\n",A+B);
}
else if(A==2&&B==1){
printf("%d\n",A+B);
}
else if(A==3&&B==1){
printf("%d\n",A-B);
}
else if(A==2&&B==3){
printf("%d\n",B-A);
}
else if(A==3&&B==2){
printf("%d\n",A-B);
}
else if(... | 0 | 81,577,940 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | 0 | 63,053,856 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pll = pair<ll, ll>;
int main() {
ll n; cin>>n;
vector<pll> v(n);
rep(i,n){cin>>v[i].first>>v[i].second;}
ll ans=0;
for(int i=n-1; i>=0; i--){
ll... | #include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int x,n; cin>>x>>n;
int p[n];
rep(i,n) cin>>p[i];
bool n... | 0 | 15,364,301 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN = 1e5+20;
int n;
int64_t v[mxN+1][3];
int64_t dp[mxN+1][4];
int64_t go(int idx, int last) {
if(idx == n) {
if(last == 1) {
return max(v[idx][1... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | 0 | 4,661,855 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int sum = 0, t , d;
cin >> t;
vector <int> vec;
for (int i ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 0 | 86,173,471 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define... | #include <bits/stdc++.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =999999999;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(ll a, ll b){
retur... | 0 | 59,632,319 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int N;
vector... | #include <bits/stdc++.h>
#define N 100005
using namespace std;
int n;
vector<int> g[N];
int dfs(int u, int fa) {
int sg = 0;
for(auto v : g[u]) {
if(v == fa) continue;
sg ^= dfs(v, u) + 1;
}
return sg;
}
int main() {
scanf("%d", &n);
for(int i = 1, u, v; i < n; ++i) {
sca... | 0 | 62,431,254 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
char fi[100][100];
int main(){
int a,b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(i<50)fi[i][j]='#';
else fi[i]... | 0 | 66,622,043 |
#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 N, M;
cin >> N >> M;
vector<int> A(N);
int S = 0;
rep(i, N) {
cin >> A[i];
S += A[i];
}
int ans = 0;
for(int x : A) {
if (x >= floa... | #include<cstdio>
#include<iostream>
using namespace std;
class ReverseSequence{
public:
void solve(string str){
int n=str.size();
for(int i=n-1;i>=0;i--){
printf("%c",str[i]);
}
printf("\n");
}
};
int main(){
string str;
cin... | 0 | 89,769,287 |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int f(ll n){
int res=0;
while(n){
res+=n%10;
n/=10;
}
return res;
}
int main(){
ll n;
cin>>n;
cout<<(n%f(n)?"No":"Yes");
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x, n;
cin >> x >> n;
vector<bool> is_in(101, false);
for (int i = 0; i < n; ++i)
{
int p;
cin >> p;
is_in[p] = true;
}
int left = x, right = x;
while (is_in[x])
{
left--;
right++;
if (!is_in[right]) x = right;
if (!is_in[left]) x = lef... | 0 | 16,715,592 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 0 | 68,491,881 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll x, y;
cin >> x >> y;
y /= 2;
cout << x + y << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
static const int N = 100000;
static const int NIL = -1;
struct Node
{
int parent;
int left;
int right;
};
struct Node T[N];
int D[N];
void setDepth(int u, int parent)
{
D[u] = parent;
if (T[u].right != NIL) setDepth(T[u].right, parent);
if ... | 0 | 92,210,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int N,K;
cin>>N>>K;
vector<int>A(N);
vector<int>B(300000);
rep(i,N){
cin>>A[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);... | 0 | 92,742,892 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=200005;
const int MOD=1000000007;
int n;
char s[N];
int a[N];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
if(s[1]=='W')
{
printf("0");
return 0;
}
a[0]=1;
for(int i=1;i<=n*2;i++)
if(s[i]==s[i-1]) a[i]=a[i-1]^1;
else a[i]=a[i-1];
int ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 29,382,940 |
#include <bits/stdc++.h>
typedef long long ll;
ll n, x;
ll GetAns(ll a, ll b) {
if(a < b) std::swap(a, b);
return a % b ? GetAns(b, a % b) + 2 * (a / b) * b : 2 * (a / b) * b - b;
}
int main() {
scanf("%lld%lld", &n, &x);
printf("%lld", GetAns(x, n - x) + n);
return 0;
} | #include <math.h>
#include <iostream>
#include <iomanip>
#define PI 3.14159265358979
#define DEG_TO_RAD(deg) (((deg) / 180 ) * PI)
using namespace std;
int main()
{
double a, b, C;
double S, L, h;
double c;
cin >> a >> b >> C;
c = sqrt((a * a) + (b * b) - (2 * a * b * cos(DEG_TO_RAD(C))));
S = a * b * sin(DEG_TO_... | 0 | 86,597,634 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 35,370,177 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a,b,c; cin >> a >> b >> c;
double rad = M_PI/180.0*c;
double h = b*sin(rad);
double S = 0.5*a*h;
double L = a + b + sqrt(a*a+b*b-2*a*b*cos(rad));
cout << fixed << setprecision(8) << S << endl;
cout << fixed << setprecision(8) << L << endl;
cout <<... | #include <iostream>
#include<bits/stdc++.h>
int main(int argc, const char * argv[]) {
std::string str;
std::cin>>str;
long long int sum=0;
std::vector <int>vec(str.length()+1);
vec.at(0)=0;
for(int i=0;i<str.length();i++){
if(str.at(i)=='<'){
vec.at(i+1)=vec.at(i)+1;
... | 0 | 6,320,164 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
while(true){
int n;
cin>>n;
if(n==0)break;
vector<string> v;
rep(i,n){
string s;
cin>>s;
v.push_back(s);
}
int cnt=0;
rep(i,n-1){
if((v[i]=="lu"&&v[i+1]=="ru")||(v[i... | #include <iostream>
#include <cmath>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <cctype>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
locale l = locale::class... | 0 | 69,128,350 |
#ifndef _WIN32
#include<iostream>
#endif
#include<string>
#include<iomanip>
#include<vector>
#include<string>
using namespace std;
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main() {
int n;
while (cin >> n, n) {
int prv = 0;
int l = 0;
i... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | 0 | 12,508,754 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define mod 1000000007
#define pi 2 * acos(0.0)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rloop(i, a, b) for (int i = a; i >= b; i--)
void fu... | 0 | 21,580,729 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 2000000000
#define MOD 1000000007
using namespace std;
... | 0 | 40,614,544 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t Gcd(int64_t n, int64_t m){
if(n%m==0) return m;
return Gcd(m,n%m);
}
int main(){
int64_t N,K; cin>>N>>K;... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), y(n);
bool type;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
bool odd = (x[i] + y[i]) & 1;
if (!... | 0 | 41,646,535 |
#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];
}
vector<int>X;
vector<int>Y;
for (int i = 0; i < N; ++i) {
if (0 == i%2) {
X.push_back(A[i]);
}
else {
Y.push_back(A[i]);
}
}
vector<int>Ans(N);
for (int i ... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 75,494,188 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for(int i=0... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int f(int n) {
if (n % 2) return 3 * n + 1;
return n / 2;
}
signed main() {
cin.tie(0);
ios:... | 0 | 95,338,709 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
int k, a, b;
cin >> k >> a >> b;
bool ok = false;
for (int i = 0; i < 5000; i++) {
if (ok) break;
if... | #include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace st... | 0 | 83,887,317 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
int sum = accumulate(a.begin(), a.end(), 0);
int num = a.size();
int ave = sum ... | 0 | 44,389,956 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,diff;
cin >> a >> b >> c >> diff;
string ans= (abs(c-a) <= diff || (abs(b-a) <= diff && abs(c-b) <= diff)) ? "Yes" : "No";
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 0 | 97,514,391 |
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i,s,e) for (i... | 0 | 73,187,863 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
char s1,s2;
cin>>s1>>s2;
if((s1-'A')>(s2-'A'))cout<<">"<<endl;
else if((s1-'A')<(s2-'A'))cout<<"<"<<endl;
else cout<<"="<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main(){
int n;
cin >> n;
int s = 0, g = n - 1;
string info;
cout << n - 1 << "\n";
cout.flush();
cin >> info;
if(info == "Vacant"){
return 0;
}
while(true){
int mid = (s + g) / 2;... | 0 | 87,849,868 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 27,518,370 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H;
cin >> N >> H;
vector<ll> a(N);
vector<ll> b(N);
for(int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
}
ll am = *max_element(a.begin(), a.end());
s... | 0 | 37,203,386 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
int h[maxn],go[maxn*2],nxt[maxn*2];
int i,j,k,l,t,n,m,tot;
void add(int x,int y){
go[++tot]=y;
nxt[tot]=h[x];
h[x]=tot;
}
int dfs(int x,int y){
int l=0,t=h[x];
while (t){
i... | 0 | 99,649,863 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(... | 0 | 100,136,454 |
#include<iostream>
#include<cmath>
using namespace std;
#define EPS 1e-10
double x[4],y[4];
double det(){
double x1,x2,y1,y2;
x1 = x[0] - x[1];
y1 = y[0] - y[1];
x2 = x[2] - x[3];
y2 = y[2] - y[3];
return x1 * y2 - y1 * x2;
}
int main(void){
int n;
cin >> n;
while(n--){
for(int i = 0 ; i < 4 ; i +... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll... | 0 | 88,885,890 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
faster;
ll n;
cin >> n;
vector<ll> a(n);
ll balance = 1000,stock = 0;
for(auto &x: a) cin >> x;
for(ll i = 0; i < n; i++){
if(i != n-1 && a... | 0 | 46,637,576 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define re register
#define ll long long
inline int gi()
{
int f=1,sum=0;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getcha... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
vector<vector<int> > g(n);
for(int i = 0;i < n-1;i++){
int x, y;
scanf("%d %d", &x, &y);
x -= 1;
y -= 1;
g[x].push_back(y);
g[y].push_back(x);
... | 0 | 42,803,675 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#d... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x;
... | 0 | 69,225,988 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | 0 | 55,706,554 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+7;
int n,k;
ll sum[MAXN],sum2[MAXN],a[MAXN],ans;
int main() {
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%lld",&a[i]);
if(a[i]>0) sum[i]+=a[i];
}
for(int i=1;i<=n;i++) {
sum[i]+=sum[i-1];
sum2[i]=sum2[i-1]+a[i];
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define NIL -1
using namespace std;
int count(const string& X, int i, const string Y, int j,
vector<vector<int> >& MEMO){
if (i >= X.size() || j >= Y.size()) return 0;
if (MEMO[i][j] != NIL) return MEMO[i][j];
int next_X = co... | 0 | 20,465,396 |
#include <bits/stdc++.h>
using namespace std;
int lr(char a){
if(a == 'q') return 0;
else if(a == 'w') return 0;
else if(a == 'e') return 0;
else if(a == 'r') return 0;
else if(a == 't') return 0;
else if(a == 'a') return 0;
else if(a == 's') return 0;
else if(a == 'd') return 0;
else if(a == 'f') return 0;
e... | #include <iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void){
int n,d;
cin>>n>>d;
vector<vector<int>> vec(n+1, vector<int>(d+1));
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
cin>>vec[i][j];
}
}
int answer=0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
... | 0 | 31,384,551 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int cnt[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cnt[x]++;
}
vector<int> c, p;
for (int i = 1; i <= n; i++) {
if (cnt[i])
c.push_back(cnt[i]);
}
sor... | #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | 0 | 38,038,351 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const int MAX=1e5+5;
int n,f[MAX];
ii a[MAX];
vector<iii> V;
int32_t main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a[i].first;
a[i].second=i;
}
sort(a+1,a+n+1);
V.push_back({a[1],1});
for(in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
int right = 0;
int sum = ... | 0 | 92,046,926 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main() {
ll m = INF;
int n;
cin >> n;
vector<int> xs(n);
rep(i, n) cin >> xs[i];
for (int i = 1; i <= 100; i++) {
ll sum = 0;
rep(j, n) { sum += (xs[... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define INF 100000000
#define MAXN 10010
typedef... | 0 | 8,933,806 |
#include <iostream>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main() {
ll K, A, B;
cin >> K >> A >> B;
ll res = 0;
if (A >= B - 2 || A + 1 > K) {
res = K + 1;
} else {
K -= A + 1;
ll t = K / 2;
res = (t + 1) * B - t * A + K % 2;
}
printf("%lld\n", res);
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> b(n);
for(int i = 1 ; i<=n;++i){
b[i-1]=a[i-1]-i;
}
sort(b.be... | 0 | 16,592,286 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
string S;
cin >> S;
int year = 0, month = 0, day = 0;
for (int i = 0; i < 4; i++) {
year += (S[i] - '0') * pow(10, 3 - i);
}
for (int i = 5; i < 7; i++) {
month +=... | #include <iostream>
using namespace std;
int main() {
int size,k;cin>>size;string s;
cin>>s>>k;
for(int i=0;i<size;i++)
{
if(!(s[i]==s[k-1]))
s[i]='*';
}cout<<s<<endl;
return 0;
} | 0 | 47,745,681 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.