code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;
int main()
{
string str = "";
while (getline (cin, str)){
int n = 0;
int res = 0;
stringstream ss(str);
ss >> n;
for (int i = 0; i < 10000; ++i){
int a = i/1000;
int b = (i/100) % 10;
int c = (i/10) % 10;
int d = i % 10;
if (a + b + c + d == n){
++res;
}
}
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int n, a, b, c, d, hasil;
int main(){
while(cin >> n){
hasil = 0;
for(int j = 0; j <= 9; j++){
for(int k = 0; k <= 9; k++){
for(int l = 0; l <= 9; l++){
for(int m = 0; m <= 9; m++){
if(j + k + l + m == n){
hasil++;
}
}
}
}
}
cout << hasil << "\n";
}
return 0;
} | 1 | 51,565,699 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<functional>
#include<iomanip>
#include<queue>
#include<cassert>
#include<tuple>
#include<set>
#include<map>
#include<list>
#include<bitset>
#include<utility>
#include<numeric>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define dwn(a) (a).begin(),(a).end(), greater<int>()
#define rep(i, m) for (int i = 0; i < m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define V vector<int>
#define VV vector<V>
#define VVV vector<VV>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const ll MOD{ (ll)1e9 + 7 };
const long double EPS = 1e-10;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) {
cout << "+" << endl;
}
else if (a * b == 15) {
cout << "*" << endl;
}
else {
cout << "x" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int a, b;
cin >> a >> b;
cout << (a + b == 15 ? '+' : (a * b == 15 ? '*' : 'x')) << '\n';
return 0;
} | 1 | 84,861,994 |
#include <bits/stdc++.h>
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
typedef long long ll;
using namespace std;
int main(){
io
ll n,ans(0);
cin >> n;
for(int i(1); i<=n; i++){
string s = to_string(i);
if(s.length() % 2 == 1) ans++;
}
cout << ans << ENDL;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll N;
cin >> N;
ll cnt = 0;
for (int i = 1; i <= N; i++) {
if((i >= 1 && i <= 9) || (i >= 100 && i <= 999) || (i >= 10000 && i <= 99999)){
cnt++;
}
}
cout << cnt << endl;
} | 1 | 19,001,055 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
char X, Y;
cin >> X >> Y;
if(X>Y){
cout << ">" << endl;
}else if(X<Y){
cout << "<" << endl;
}else{
cout << "=" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
char X, Y; cin >> X >> Y;
if (X < Y) cout << "<" << endl;
else if (X == Y) cout << "=" << endl;
else cout << ">" << endl;
return 0;
} | 1 | 20,561,111 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
vector<int>a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= h && b.at(i) >= w) ans++;
}
cout << ans << endl;
} | #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;
int h, w; cin >> h >> w;
vector<int> a(n), b(n);
REP(i, n) cin >> a[i] >> b[i];
int cnt = 0;
REP(i, n)
if (a[i] >= h && b[i] >= w) cnt++;
cout << cnt << '\n';
return 0;
} | 1 | 80,375,906 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define check(v) rep(i,v.size()) cout << v[i] << " ";\
cout << endl
#define INF 1e8
typedef long long ll;
using namespace std;
int main() {
int n, m; cin >> n >> m;
if(n%m==0) cout << -1 << endl;
else cout << n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;
cin >> X >> Y;
int ans=1;
if(X%Y==0) cout << -1 << endl;
else{
while(true){
ans*=X;
if(ans%Y!=0){
cout << ans << endl;
break;
}
}
}
} | 1 | 52,176,742 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N,K;
ll A[20];
int main(){
cin >> N >> K;
for(int i=0;i<N;i++) cin >> A[i];
ll min_cost = 1e12;
for(int i=0;i<(1<<N);i++){
ll cost = 0;
bitset<15> bt(i);
if(bt.count() != K) continue;
ll h = 0;
for(int j=0;j<N;j++){
if(bt[j] == 1){
if(A[j] <= h){
cost += h - A[j] + 1;
h++;
}else{
h = A[j];
}
}else{
h = max(A[j], h);
}
}
min_cost = min(cost, min_cost);
}
cout << min_cost << endl;
return 0;
} | #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define pb emplace_back
#define mp make_pair
using namespace std;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
#else
#define PRINT(A)
#endif
typedef pair<ll, ll> P;
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;
}
return false;
}
ll R, C, N, K;
bool v[15][10005];
ll a[20];
signed main() {
cin >> N >> K;
rep(i,N){
cin >> a[i];
}
int minCost = INF;
rep(i, 1ll << N){
ll newA[15];
rep(j,N) newA[j] = a[j];
int count = 0;
rep(j, N){
if(i >> j & 1){
count ++;
}
}
if(count == K){
rep(j,N){
if(i >> j & 1){
rep(k,j){
chmax(newA[j], newA[k]+1);
}
}
}
int cost = 0;
rep(j,N){
PRINT(newA[j])
cost += (newA[j] - a[j]);
}
PRINT(cost)
chmin(minCost, cost);
}
}
cout << minCost << endl;
} | 1 | 60,885,390 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int x1, x2, x3, x4, y1, y2, y3, y4;
cin >> x1 >> y1 >> x2 >> y2;
int a = x2-x1;
int b = y2-y1;
x3 = x2-b;;
y3 = y2+a;
x4 = x1-b;
y4 = y1+a;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X1,X2,Y1,Y2;
cin >> X1 >> Y1 >> X2 >> Y2;
int A = X2-X1;
int B = Y2-Y1;
int X3 = X2-B;
int Y3 = Y2+A;
int X4 = X3-A;
int Y4 = Y3-B;
cout << X3 << " " << Y3 << " " << X4 << " " << Y4 << endl;
} | 1 | 48,473,712 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> n;
for (int i=0;i<n;i++) {
bool ok = false;
cin >> a >> b >> c;
if (a < c && b < c) {
ok = (a*a+b*b == c*c);
} else if (a < b && c < b) {
ok = (a*a+c*c == b*b);
} else {
ok = (b*b+c*c == a*a);
}
cout << (ok?"YES":"NO") << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main() {
int N,a,b,c;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a >> b >> c;
if (a*a + b*b == c*c || a*a + c*c == b*b || b*b + c*c == a*a) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
} | 1 | 62,681,495 |
#include <bits/stdc++.h>
using namespace std;
map<int,vector<int>> P;
set<string> RT;
vector<bool> ans;
int count1=0;
void prog(int a,vector<bool>T){
T.at(a-1)=true;
if(T==ans){
count1++;
return;
}
for(int i:P.at(a)){
if(T.at(i-1))continue;
prog(i,T);
}
}
int main (){
int N,M;
cin >> N >> M;
for(int i=0;i<M;i++){
int j,k;
cin >> j >> k;
P[j].push_back(k);
P[k].push_back(j);
}
ans=vector<bool>(N,true);
prog(1,vector<bool>(N,false));
cout << count1 << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<class T, class U> void chmin(T &a, U b) { if (b < a) a = b; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
int n, m, ans;
void dfs(int cur, vi visit, const vector<vi> &edge)
{
visit[cur] = 1;
bool end = true;
rep(i, n) if (visit[i] == 0) end = false;
if (end) {
++ans;
return;
}
for (auto next : edge[cur]) {
if (visit[next]) continue;
dfs(next,visit,edge);
}
}
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
vi visit(n,0);
vector<vi> edge(n);
rep(i, m) {
int a, b; cin >> a >> b;
edge[a-1].emplace_back(b-1);
edge[b-1].emplace_back(a-1);
}
dfs(0,visit,edge);
cout << ans << endl;
return (0);
} | 1 | 73,447,344 |
#include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int n;
while(cin >> n, n){
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = INF;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i != j){
ans = min(ans, abs(a[i]-a[j]));
}
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
std::vector<int> a(1000);
int main() {
int i, n;
while(std::cin >> n, n != 0) {
for(i=0; i<n; ++i) {
std::cin >> a[i];
}
std::sort(a.begin(), a.begin()+n);
int min = INT_MAX;
for(i=0; i<n-1; ++i) {
min = std::min(min, a[i+1] - a[i]);
}
std::cout << min << std::endl;
}
} | 1 | 69,467,173 |
#include <iostream>
#include <string>
#include <typeinfo>
struct Card {
char suit;
int value;
};
void traceALDS12C(Card arr[], int max) {
for (int i = 0; i < max; ++i) {
if (i)
std::cout << " ";
std::cout << arr[i].suit << arr[i].value;
}
std::cout << std::endl;
}
void BubbleSort(Card arr[], int N) {
for (int i = 0; i < N; ++i) {
for (int j = N - 1; j > i; --j) {
if (arr[j - 1].value > arr[j].value) {
std::swap(arr[j - 1], arr[j]);
}
}
}
traceALDS12C(arr, N);
std::cout << "Stable" << std::endl;
}
void SelectionSort(Card arr[], int N) {
for (int i = 0; i < N; ++i) {
int minIdx = i;
for (int j = i; j < N; ++j) {
if (arr[minIdx].value > arr[j].value) {
minIdx = j;
}
}
if (minIdx != i) {
std::swap(arr[minIdx], arr[i]);
}
}
traceALDS12C(arr, N);
}
bool check(Card str1[], Card str2[], int N) {
for (int i = 0; i < N; ++i) {
if (str1[i].suit != str2[i].suit || str1[i].value != str2[i].value) {
return false;
}
}
return true;
}
int main() {
int N;
std::cin >> N;
Card cards[N];
for (int i = 0; i < N; ++i) {
std::cin >> cards[i].suit >> cards[i].value;
}
Card cards2[N];
for (int i = 0; i < N; ++i)
cards2[i] = cards[i];
BubbleSort(cards, N);
SelectionSort(cards2, N);
if (check(cards, cards2, N)) {
std::cout << "Stable" << std::endl;
} else {
std::cout << "Not stable" << std::endl;
}
return 0;
} | #include <iostream>
#include <climits>
#include <stdio.h>
using namespace std;
struct Card
{
char suit;
char value;
};
void bubbleSort(Card C[], int N)
{
for (int i = 0; i <= N - 1; i++)
{
for (int j = N - 1; j >= i + 1; j--)
{
if (C[j].value < C[j - 1].value)
{
std::swap(C[j], C[j - 1]);
}
}
}
}
void selectionSort(Card C[], int N)
{
for (int i = 0; i <= N - 1; i++)
{
int mini = i;
for (int j = i; j <= N - 1; j++)
{
if (C[j].value < C[mini].value)
{
mini = j;
}
}
std::swap(C[i], C[mini]);
}
}
void print(Card C[], int N)
{
for (int i = 0; i < N; i++)
{
if (i > 0)
cout << " ";
cout << C[i].suit << C[i].value;
}
cout << endl;
}
bool isStable(Card C1[], Card C2[], int N)
{
for (int i = 0; i < N; i++)
{
if (C1[i].suit != C2[i].suit)
return false;
}
return true;
}
int main(int argc, char *argv[])
{
Card C1[100], C2[100];
int N;
char ch;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> C1[i].suit >> C1[i].value;
}
for (int i = 0; i < N; i++)
{
C2[i] = C1[i];
}
bubbleSort(C1, N);
selectionSort(C2, N);
print(C1, N);
cout << "Stable" << endl;
print(C2, N);
if (isStable(C1, C2, N))
{
cout << "Stable" << endl;
}
else
{
cout << "Not stable" << endl;
}
return 0;
} | 1 | 16,166,595 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
cout << K * ll(pow(K - 1LL, N - 1LL)) << endl;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N, K;
cin >> N >> K;
int ans = K;
for (int i = 1; i < N; ++i) {
ans *= K - 1;
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | 1 | 40,366,343 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1 << 28;
const int MAX_N = 50010;
const int MAX_M = 21;
int c[MAX_M];
int dp[MAX_N];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
fill(dp, dp + MAX_N, INF);
int n, m;
cin >> n >> m;
dp[n] = 0;
for(int i = 0; i < m; ++i){
cin >> c[i];
}
for(int i = n; i > 0; --i){
for(int j = 0; j < m; ++j){
if(i >= c[j]){
dp[i - c[j]] = min(dp[i] + 1, dp[i - c[j]]);
}
}
}
cout << dp[0] << endl;
return 0;
} | #include <iostream>
#include <set>
#include <unordered_map>
std::set<int> coins;
std::unordered_map<int, int> memo;
int get_minimum_count(int n) {
if (coins.find(n) != coins.end()) {
return 1;
} else if (memo.find(n) != memo.end()) {
return memo[n];
} else {
int min_count = n;
for (int next : coins) {
if (next < n) {
min_count = std::min(get_minimum_count(n - next), min_count);
}
}
min_count += 1;
memo[n] = min_count;
return min_count;
}
}
int main() {
int n, m;
std::cin >> n >> m;
for (int i = 0; i < m; i ++) {
int c;
std::cin >> c;
coins.insert(c);
}
std::cout << get_minimum_count(n) << std::endl;
} | 1 | 6,279,112 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
ll a;
V vi;
int main(){
REP(i, 5){
cin >> a;
vi.push_back(a);
}
sort(ALL(vi), greater<int>());
REP(i, 5){
cout << vi[i];
if (i == 4)cout << endl;
else cout << " ";
}
} | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
int arr[5];
for(int i=0;i<5;i++) cin>>arr[i];
sort(arr,arr+5);
for(int i=4;i>=1;i--) cout<<arr[i]<<" ";
cout<<arr[0]<<endl;
return 0;
} | 1 | 10,192,304 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define RRep(i, r, n) for (ll i = n - 1; i <= r; i--)
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define int long long
#define pb push_back
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
const int MOD = (1000000007);
const int INF = (1LL << 60)-1;
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
using Graph = vector<vector<pair<int, int>>>;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
vector<int> a(3);
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(all(a));
if(a[0]==a[1]&&a[1]==a[2]){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const long long MOD = (ll)1e6+3;
const long long MAX = (ll)170 * 80;
int main(void) {
ll A,B,C;
cin>>A>>B>>C;
bool flag = ((A==B) && (B==C));
if (flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 49,842,828 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; }
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int h,w,d;
cin>>h>>w>>d;
int a[h][w];
vector<P> c(h*w+1);
rep(i,h) rep(j,w){
cin>>a[i][j];
c[a[i][j]]=P(i,j);
}
vec b(90000+100);
for(int i=1;i<=d;i++){
int memo=i;
b[memo]=0;
while(memo+d<=h*w){
b[memo+d]=b[memo]+abs(c[memo+d].fs-c[memo].fs)+abs(c[memo+d].sc-c[memo].sc);
memo+=d;
}
}
int q;
cin>>q;
rep(i,q){
int l,r; cin>>l>>r;
int ans=b[r]-b[l];
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define ll long long int
#define mod_ceil(a, b) (a % b) ? a / b + 1 : a / b
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll h, w, d, tmp, n;
cin >> h >> w >> d;
n = h * w;
vector<pair<ll, ll>> cost(n + 10);
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
cin >> tmp;
cost[tmp] = {i, j};
}
}
vector<ll> magic(n + 10, 0);
for (int i = 1; i <= n; i++)
{
if (i + d <= n)
{
magic[i + d] = magic[i] + abs(cost[i].first - cost[i + d].first) + abs(cost[i].second - cost[i + d].second);
}
}
ll q, l, r;
cin >> q;
while (q--)
{
cin >> l >> r;
cout << magic[r] - magic[l] << endl;
}
} | 1 | 84,973,822 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i)=(n); (i)<(m); ++i)
int main(){
int M;
cin >> M;
ll n = 0, s= 0;
REP(i, M){
ll d, c;
cin >> d >> c;
n+=c, s+= d*c;
}
ll ans = (9*n+s)/9;
ll x = (9*n+s)%9;
while(x < 10){
x+=9;
ans--;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll modpow(ll a, ll n){
if(n==0)return 1;
if(n%2==0){
ll t=modpow(a,n/2);
return t*t%MOD;
}
return a*modpow(a,n-1)%MOD;
}
ll modinv(ll a){
return modpow(a,MOD-2);
}
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n = 1) {
init(n);
}
void init(int n = 1) {
par.resize(n); rank.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y);
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
return true;
}
};
vector<vector<int>>G;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int m;
cin >> m;
ll tot=0;
ll sum=0;
rep(i,m){
ll d,c;
cin >> d >> c;
tot+=d*c;
sum+=c;
}
ll ans=0;
ans+=sum-1+(tot-1)/9;
cout << ans << endl;
} | 1 | 4,876,845 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> vecA(N);
vector<int> vecB(M);
rep(i, N) {
cin >> vecA.at(i);
}
rep(i, M) {
cin >> vecB.at(i);
}
sort(vecA.begin(), vecA.end());
sort(vecB.begin(), vecB.end());
reverse(vecA.begin(), vecA.end());
if(vecA.at(0) >= vecB.at(0)) {
cout << "War" << endl;
}
else if(X < vecB.at(0) && vecA.at(0) < Y){
cout << "No War" << endl;
}
else {
cout << "War" << endl;
}
} | #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() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int>xn(n);
rep(i,n){
cin>>xn[i];
}
vector<int>ym(m);
rep(j,m){
cin>>ym[j];
}
xn.push_back(x);
ym.push_back(y);
sort(xn.begin(),xn.end());
sort(ym.begin(),ym.end());
if(xn[n]<ym[0])cout<<"No War"<<endl;
else cout<<"War"<<endl;
return 0;
} | 1 | 54,360,003 |
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n",sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2)));
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main()
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double dis;
dis = sqrt( (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
printf("%f10\n",dis);
} | 1 | 13,367,159 |
#include <bits/stdc++.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum = 0, p = 1, i;
for (i = 0; i < strlen(str); i++) {
sum += p * getChar(str[i]);
p *= 5;
}
return sum;
}
int h1(int key) {
return key % M;
}
int h2(int key) {
return 1 + (key % (M - 1));
}
int find(char str[]) {
long long key, i, h;
key = getKey(str);
for (i = 0; ; i++) {
h = (h1(key) + i * h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0) return 0;
}
return 0;
}
int insert(char str[]) {
long long key, i, h;
key = getKey(str);
for (i = 0; ; i++) {
h = (h1(key) + i * h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0) {
strcpy(H[h], str);
return 0;
}
}
return 0;
}
int main() {
int n, h;
char str[L], com[9];
for (int i = 0; i < M; i++) H[i][0] = '\0';
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s %s", com, str);
if (com[0] == 'i') {
insert(str);
} else {
if (find(str)) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <cstdio>
#define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#include <cmath>
#include <map>
#include <utility>
#include <numeric>
#include <set>
#include <map>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define INF 999999999
#define atcoder 1e9+7
using namespace std;
int main() {
set<string>s;
string s1, s2;
int n;
cin >> n;
REP(i, n) {
cin >> s1 >> s2;
if (s1 == "insert")
s.insert(s2);
else if (s1 == "find") {
if (s.find(s2) != s.end())cout << "yes" << endl;
else cout << "no" << endl;
}
}
return 0;
} | 1 | 52,449,059 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % 3 == 0) {
cout << "Possible" << endl;
return 0;
} else if (B % 3 == 0) {
cout << "Possible" << endl;
return 0;
} else if ((A + B) % 3 == 0) {
cout << "Possible" << endl;
return 0;
}
cout << "Impossible" << endl;
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll max(ll a,ll b){
return a>b? a:b;
}
ll T;
ll a,b,c;
int main(){
cin>>a>>b;
if(a%3==0||b%3==0||(a+b)%3==0){
cout<<"Possible\n";
}
else cout<<"Impossible\n";
return 0;
} | 1 | 73,766,594 |
#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){
ll A,B,K;
cin>>A>>B>>K;
if(K>A){
K-=A;
A=0;
}
else{
A-=K;
K=0;
}
if(K>B){
B=0;
}
else{
B-=K;
}
cout<<A<<' '<<B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
const int BIG_NUM = 1e9;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a, b, k;
cin >> a >> b >> k;
if(k <= a) {
cout << a - k << " " << b;
} else if(k <= a + b) {
cout << 0 << " " << b - (k - a);
} else {
cout << 0 << " " << 0;
}
return 0;
} | 1 | 72,132,697 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
int dp[10100];
int main(){
int N,M; cin >> N >> M;
vector<Pi> A(M);
rep(i,M){
cin >> A[i].first;
}
rep(i,M){
if(A[i].first == 1) A[i].second = 2;
else if(A[i].first == 4) A[i].second = 4;
else if(A[i].first == 6 || A[i].first == 9) A[i].second = 6;
else if(A[i].first == 7) A[i].second = 3;
else if(A[i].first == 8) A[i].second = 7;
else A[i].second = 5;
}
rep(i,10100) dp[i] = -1;
dp[0] = 0;
rep(i,N+1)rep(j,M){
if(i-A[j].second >= 0) dp[i] = max(dp[i],dp[i-A[j].second]+1);
}
sort(A.begin(),A.end(),greater<Pi>());
string ans = "";
int k = dp[N];
while(N > 0){
rep(i,M){
if(N-A[i].second >= 0){
if(dp[N-A[i].second] == k-1){
ans += A[i].first+'0';
k--;
N -= A[i].second;
break;
}
}
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = P<ll, ll>;
using Pdd = P<double, double>;
template<typename T1, typename T2> using M = std::map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REP2(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
#define RREP(i,s,e) for(int i=(int)(s);i>=(int)(e);--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin(),ie=(c).end();i!=ie;++i)
#define ALL(c) (c).begin(), (c).end()
const double PI = acos(-1);
const ll MOD = 1e9+7;
int n, m;
int main() {
cin >> n >> m;
Vi a(m);
REP(i, m) cin >> a[i];
Vi need = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
auto func = [](string &l, string &r) {
if (l.size() == r.size()) return l < r;
return l.size() < r.size();
};
V<Vs> dp(n+1, Vs(m, "x"));
REP(i, m) dp[0][i] = "";
REP2(i, 1, n+1) {
REP(j, m) {
if (i < need[a[j]]) continue;
Vs v;
REP(k, m) {
string s = dp[i-need[a[j]]][k];
if (s == "x") continue;
string t = s.insert(
lower_bound(ALL(s), '0' + a[j], greater<char>()) - s.begin(),
to_string(a[j])
);
v.push_back(t);
}
if (v.empty()) continue;
sort(ALL(v), func);
dp[i][j] = v.back();
}
}
Vs res;
for (auto x: dp[n]) {
if (x != "x") res.push_back(x);
}
cout << *max_element(ALL(res), func) << '\n';
return 0;
} | 1 | 4,590,009 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
bool comp(pair<ll, ll> a, pair<ll , ll> b) {
if(a.first != b.first){
return a.first > b.first;
}
if(a.second != b.second){
return a.second > b.second;
}else{
return true;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str,stra="CODEFESTIVAL2016";
ll k;
ll w,x,y;
ll h;
cin>>n;
vector<ll> v(n);
rep(i,n) cin>>v[i];
map<ll,ll> m1;
map<ll,ll> m2;
set<ll> s1;
set<ll> s2;
rep(i,n){
if(i%2) {
s1.insert(v[i]);
m1[v[i]]++;
}else{
s2.insert(v[i]);
m2[v[i]]++;
}
}
vector<pair<ll,ll>> p1(s1.size()+1);
vector<pair<ll,ll>> p2(s2.size()+1);
p1[s1.size()]=make_pair(0,-1);
p2[s2.size()]=make_pair(0,-2);
ll i=0;
for(auto itr=s1.begin();itr!=s1.end();itr++,i++){
p1[i]=make_pair(m1[*itr],*itr);
}
i=0;
for(auto itr=s2.begin();itr!=s2.end();itr++,i++){
p2[i]=make_pair(m2[*itr],*itr);
}
sort(all(p1),comp);
sort(all(p2),comp);
if(p1[0].second==p2[0].second){
cout<<n-max(p1[1].first+p2[0].first,p1[0].first+p2[1].first)<<endl;
}else{
cout<<n-(p1[0].first+p2[0].first)<<endl;
}
return 0;
} | #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 DIV = 1000000007;
using ipair = pair<ll,ll>;
bool operator>(const ipair a,const ipair b){return a.second > b.second;};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
ll n;
cin >> n;
vector<ll> v(n);
map<ll, ll> odd;
map<ll, ll> even;
for(size_t i=0;i<n; i++)
{
cin >> v[i];
if( (i+1) % 2 != 0) odd[v[i]]++;
else even[v[i]]++;
}
vector<pair<ll, ll>> a, b;
for (auto o : odd) a.emplace_back(o.second, o.first);
for (auto e : even) b.emplace_back(e.second, e.first);
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
if (a.front().second == b.front().second) {
int ans = a.front().first;
if (a.size() == 1 && b.size() == 1) {
cout << n / 2 << endl;
return 0;
}
ll index_a = 0, index_b = 0;
if(a.size()>1) index_a++;
if(b.size()>1) index_b++;
if(index_a == index_b)
{
if (a[index_a].first >= b[index_b].first) {
ans += a[index_a].first;
}
else {
ans += b[index_b].first;
}
cout << n - ans << endl;
}else
{
if(index_a > index_b)
ans += a[index_a].first;
else
ans += b[index_b].first;
cout << n - ans << endl;
}
}
else {
cout << n - a.front().first - b.front().first << endl;
}
return 0;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
} | 1 | 64,487,982 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
typedef long long ll;
using namespace std;
int arr[1007];
int main() {
int n, k; cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr, arr + n);
int res = 0;
for (int i = 0; i < k; ++i) {
res += arr[i];
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> f(N);
for(int i=0;i<N;i++) cin >> f.at(i);
sort(f.begin(),f.end());
int res=0;
for(int i=0;i<K;i++) {
res += f.at(i);
}
cout << res << endl;
} | 1 | 31,422,962 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin>>n,n)
{
int data[n],dp[n+1];
int tmp=0,ans;
for (int i = 0; i < n; ++i)
{
cin>>data[i];
}
dp[0]=data[0];
for (int i = 1; i < n; ++i)
{
dp[i]=max(dp[i-1]+data[i],data[i]);
}
sort(dp,dp+n);
cout<<dp[n-1]<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if ( n == 0 ) break;
int a[5000];
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
int ans = a[0];
int pn;
for ( int i = 0; i < n; i++ ) {
pn = 0;
for ( int j = 0; i + j < n; j++ ) {
pn += a[i + j];
if ( pn > ans ) ans = pn;
}
}
cout << ans << endl;
}
} | 1 | 90,362,546 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
#define ll long long
const ll mod=1e9+7;
int main(){
int n;cin>>n;
vector<ll> a(n);
for(int i=0;i<n;i++) cin>>a[i];
vector<ll> d0(60,0),d1(60,0);
for(int i=0;i<n;i++){
for(int j=0;j<60;j++){
if(a[i]&1) d1[j]++;
else d0[j]++;
a[i]>>=1;
}
}
ll ans=0;
ll x=1;
for(int i=0;i<60;i++){
ans=(ans+(d0[i]*d1[i]%mod)*x%mod)%mod;
x=x*2%mod;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
rep(i, 60)
{
ll p = 0, q, tmp;
rep(j, n)
{
if (a[j] & (1LL << i))
p++;
}
q = n - p;
tmp = p * q % MOD;
rep(j, i) tmp = tmp * 2 % MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
} | 1 | 91,688,375 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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; }
template<typename T>
struct BIT{
int n;
vector<T> d;
BIT(int n = 0):n(n), d(n+1){}
void add(int i, T x = 1){
for(i++; i <= n; i += i&-i){
d[i] += x;
}
}
T sum(int i){
T x = 0;
for(i++; i; i -= i&-i){
x += d[i];
}
return x;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll d, a;
cin >> n >> d >> a;
vector<P> p;
rep(i,n){
ll x, h;
cin >> x >> h;
p.emplace_back(x, h);
}
sort(p.begin(), p.end());
BIT<ll> bit(n+1);
ll ans = 0;
rep(i,n){
ll x = p[i].first;
ll h = p[i].second;
h -= bit.sum(i);
if(h <= 0) continue;
ll num = (h + a - 1) / a;
ans += num;
ll damage = num * a;
bit.add(i, damage);
int rx = min(x+d*2, 1000000007LL);
int range = upper_bound(p.begin(), p.end(), P(rx+1, -1)) - p.begin();
bit.add(range, -damage);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
long long MOD = 1000000000 + 7;
bool compare(pii x, pii y){
return x.first < x.second;
}
int main(){
cout << setprecision(10);
ll N,D,A;
cin >> N >> D >> A;
vector<pii> v;
for(int i = 0; i < N; i++){
ll tmp1,tmp2;
cin >> tmp1 >> tmp2;
v.push_back(make_pair(tmp1, (tmp2+A-1)/A));
}
sort(v.begin(), v.end());
auto tmp_last_monstar = v[v.size()-1];
v.push_back(make_pair(tmp_last_monstar.first + 2*D + 2, 0));
vector<ll> x(N);
vector<ll> d(N+1,0);
vector<ll> a(N);
vector<ll> x_2D(N);
for(int i = 0; i < N; i++){
x[i] = v.at(i).first;
a[i] = v.at(i).second;
}
for(int i = 0; i < N; i++){
auto itr = lower_bound(x.begin(), x.end(), x[i] + 2*D+1);
int index = itr - x.begin();
x_2D[i] = index;
}
ll ans = a[0];
d[0] = a[0];
d[x_2D[0]] -= a[0];
for(int i = 1; i < N; i++){
d[i] = d[i-1] + d[i];
a[i] -= d[i];
if(a[i] > 0){
ans += a[i];
d[i] += a[i];
d[x_2D[i]] -= a[i];
}
}
cout << ans << endl;
} | 1 | 46,370,271 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a,b,c,h,w,i,j,k,l,m,n,x,y;
ll ans = 0;
cin >> h >> w;
vector<string> s(h);
vector<vector<ll>> lh(h+1 , vector<ll>(w+1)),lw(h+1, vector<ll>(w+1));
for(i=0;i<h;i++) cin >> s[i];
for(i=0;i<h;i++) for(j=0;j<w;j++) {
if (s[i][j]=='.') lw[i+1][j+1] = lw[i+1][j] + 1;
}
for(i=1;i<=h;i++) for(j=w-1;j>0;j--) {
if ((lw[i][j]!=0)&&(lw[i][j+1]!=0)) lw[i][j] = lw[i][j+1];
}
for(j=0;j<w;j++) for(i=0;i<h;i++) {
if (s[i][j]=='.') lh[i+1][j+1] = lh[i][j+1] + 1;
}
for(j=1;j<=w;j++) for(i=h-1;i>0;i--) {
if ((lh[i][j]!=0)&&(lh[i+1][j]!=0)) lh[i][j] = lh[i+1][j];
}
for(i=1;i<=h;i++) for(j=1;j<=w;j++) {
a = lw[i][j] + lh[i][j] - 1;
ans = max(ans , a);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define ll long long
int l[100005] = {};
vector<int> pc(1000000,-1);
vector<int> f(1000000,-1);
int lc[2001][2001];
int co[2001][2001][2];
int main() {
int h,w;
string s;
cin >> h >> w;
for(int i= 0;i<h;i++){
cin >> s;
for(int j =0;j<w;j++){
lc[i][j] = s[j];
}
}
int c = 0;
int mx = 0;
for(int i= 0;i<h;i++){
for(int j =0;j<w;j++){
if(lc[i][j] == '.'){
if(i> 0 && lc[i-1][j] != '#'){
co[i][j][0] = co[i-1][j][0];
}else{
c = 0;
for(int k =i;k < h;k++){
c++;
if(lc[k+1][j] != '.'){break;}
}
co[i][j][0] = c;
}
if(j> 0 && lc[i][j-1] != '#'){
co[i][j][1] = co[i][j-1][1];
}else{
c = 0;
for(int k =j;k < w;k++){
c++;
if(lc[i][k+1] != '.'){break;}
}
co[i][j][1] = c;
}
}
mx = max(co[i][j][0] + co[i][j][1]-1,mx);
}
}
cout << mx;
} | 1 | 39,078,918 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
vector<int> arr(n),dp(n);
for(int i=0;i<n;i++)
cin>>arr[i];
dp[0]=0;
for(int i=1;i<n;i++){
dp[i]=INT_MAX;
for(int j=max(0,i-k);j<i;j++)
dp[i]=min(dp[i],dp[j]+abs(arr[i]-arr[j]));
}
cout<<dp[n-1];
}
int main(){
ios::sync_with_stdio(false); cin.tie(0);
solve(); cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int getCount(vector<int> &arr, int index, int K, vector<int>& mem){
if(mem[index] != -1) return mem[index];
int ans = INT_MAX;
for(int i = 1; i <= K && index+i < arr.size(); i++){
ans = min(ans, abs(arr[index] - arr[index+i])+getCount(arr, index+i, K, mem));
}
if(ans == INT_MAX)
ans = 0;
mem[index] = ans;
return ans;
}
int main(){
int N, K;
cin >> N >> K;
vector<int> arr(N);
for(int i = 0; i < N; i++)
cin >> arr[i];
vector<int> mem(N, -1);
cout << getCount(arr, 0, K, mem) << endl;
} | 1 | 37,553,367 |
#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()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
} | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
const double PI = 3.141592653589793;
int main(){
IO;
ll n;
cin>>n;
cout<<(n-1)*n/2<<"\n";
return 0;
} | 1 | 89,990,818 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
struct Node
{
int to, next;
}edge[maxN * 2 + 1];
int n;
int head[maxN + 1], tot;
int sg[maxN + 1];
inline int read()
{
int num = 0, f = 1;
char ch = getchar();
while( !isdigit( ch ) ) { if(ch == '-') f = -1; ch = getchar(); }
while( isdigit( ch ) ) num = (num << 3) + (num << 1) + (ch ^ 48), ch = getchar();
return num * f;
}
inline void add(int x, int y)
{
tot ++;
edge[tot].to = y;
edge[tot].next = head[x];
head[x] = tot;
}
inline void dfs(int u, int pa)
{
sg[u] = 0;
for(int i = head[u]; i; i = edge[i].next)
{
int v = edge[i].to;
if(v == pa) continue;
dfs(v, u);
sg[u] ^= (sg[v] + 1);
}
}
int main()
{
n = read();
for(int i = 1; i < n; i++)
{
int x = read(), y = read();
add(x, y); add(y, x);
}
dfs(1, 0);
if(sg[1]) puts("Alice");
else puts("Bob");
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
using namespace std;
const int N=2e5+100;
vector <int> g[N];
ll ans[N];
ll dfs(ll v,ll p){
ll cnt=0;
for (int i=0;i<g[v].size();i++){
ll u=g[v][i];
if (u==p){
continue;
}
dfs(u,v);
cnt^=ans[u]+1;
}
ans[v]=cnt;
}
int32_t main(){
ll n;
cin >> n;
for (int i=0;i<n-1;i++){
ll u,v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1,1);
if (ans[1]){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
} | 1 | 89,638,444 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) a.size()
#define md(a, b) ((a) % b + b) % b
#define mod(a) md(a, MOD)
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define f first
#define s second
#define forn(i, n) for(int i = 0; i < n; i++)
#define fore(i, b, e) for(int i = b; i < e; i++)
#define forg(i, b, e, m) for(int i = b; i < e; i+=m)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int tam = 100010;
const int MOD = 1000000007;
const int MOD1 = 998244353;
const double EPS = 1e-9;
const double PI = acos(-1);
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
int a, b, c, t;
cin>>a>>b>>c>>t;
int x, y, z;
fore(i, 0, t + 1)
fore(j, 0, t + 1)
fore(k, 0, t + 1)
{
if(i + j + k == t)
{
x = a;
y = b;
z = c;
fore(u, 0, i)
x *= 2;
fore(u, 0, j)
y *= 2;
fore(u, 0, k)
z *= 2;
if(x < y && y < z)
{
cout<<"Yes\n";
return 0;
}
}
}
cout<<"No\n";
return 0;
} | #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, b, c, k;
cin >> a >> b >> c >> k;
while (b <= a && k--) b *= 2;
while (c <= b && k--) c *= 2;
if (k >= 0 && (c > b && b > a)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 93,400,977 |
#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 a[n+2] = {};
rep(i,n) cin >> a[i+1];
int cost_change[n+1];
for (int i = 1; i < n+1; i++) {
int pre = abs(a[i] - a[i-1]) + abs(a[i+1] - a[i]);
int post = abs(a[i+1] - a[i-1]);
cost_change[i] = post - pre;
}
int64_t standard_cost = 0;
rep(i,n+1) {
standard_cost += abs(a[i+1] - a[i]);
}
for (int i = 1; i < n+1; i++) {
int64_t cost = standard_cost + cost_change[i];
cout << cost << endl;
}
} | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;++i)
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
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 g[15][15];
const int INF = 1001001001;
const int dx[4] = { -1,0,1,0 };
const int dy[4] = { 0,-1,0,1 };
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x / gcd(x, y) * y);
}
vector<pair<ll, int>>factorize(ll n) {
vector<pair<ll, int>>res;
for (ll i = 2;i * i <= n;++i) {
if (n % i)continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)res.emplace_back(n, 1);
return res;
}
int bingo[3][3];
bool flag[3][3];
int cnt[2][105];
int h, w;
int choco[1010][1010];
int s[11][11];
int main() {
int n;
cin >> n;
vector<int>a(n+2);
for (int i = 1;i <= n;++i) {
cin >> a[i];
}
ll ans = 0;
for (int i = 1;i <= n+1;++i) {
ans += abs(a[i] - a[i - 1]);
}
for (int i = 1;i <= n;++i) {
int res = ans;
res -= abs(a[i] - a[i - 1]);
res -= abs(a[i + 1] - a[i]);
res += abs(a[i + 1] - a[i - 1]);
cout << res << endl;
}
return 0;
} | 1 | 5,349,258 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
int main(){
ll m;cin>>m;
ll result = 0;
ll digits_counter=-1;
ll sum=0;
rep(i, m){
ll d,c;cin>>d>>c;
digits_counter+=c;
sum+= d*c;
}
if(sum%9==0)cout << sum/9+digits_counter-1 << endl;
else cout << sum/9+digits_counter << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1000000007
#define INF LONG_LONG_MAX
int n,d,c,sum,m;
signed main() {
cin >> n;
rep(i,n) cin >> d >> c, sum += d*c, m += c;
cout << (sum-1)/9+m-1 << endl;
} | 1 | 87,551,003 |
#include <stdio.h>
#include <vector>
class DisjointSet
{
public:
std::vector<int> rank, p;
DisjointSet()
{}
DisjointSet(int size)
{
rank.resize(size, 0);
p.resize(size, 0);
for (int i = 0; i < size; i++) {
makeSet(i);
}
}
void makeSet(int x)
{
p[x] = x;
rank[x] = 0;
}
bool same(int x, int y)
{
return findSet(x) == findSet(y);
}
void unite(int x, int y)
{
link(findSet(x), findSet(y));
}
void link(int x, int y)
{
if (rank[x] > rank[y]) {
p[y] =x;
} else {
p[x] = y;
if (rank[x] == rank[y]) {
rank[y]++;
}
}
}
int findSet(int x)
{
if (x != p[x]) {
p[x] = findSet(p[x]);
}
return p[x];
}
};
int main()
{
int n, a, b, q;
int t;
scanf("%d %d", &n, &q);
DisjointSet ds = DisjointSet(n);
for (int i = 0; i < q; i++) {
scanf("%d %d %d", &t, &a, &b);
if (t == 0) {
ds.unite(a, b);
} else if (t == 1) {
printf("%d\n", ds.same(a, b) ? 1 : 0);
}
}
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF 1<<30
#define LINF 1LL<<60
struct UnionFind {
vector<int> par;
int n, cnt;
UnionFind(const int& x = 0) { init(x); }
void init(const int& x) { par.assign(cnt = n = x, -1); }
inline int find(const int& x) { return par[x] < 0 ? x : par[x] = find(par[x]); }
inline bool same(const int& x, const int& y) { return find(x) == find(y); }
inline bool unite(int x, int y) {
if ((x = find(x)) == (y = find(y))) return false;
--cnt;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
inline int count() const { return cnt; }
inline int count(int x) { return -par[find(x)]; }
};
/* example : http:
int main() {
cin.tie(0); ios::sync_with_stdio(false);
ll n, q; cin >> n >> q;
UnionFind uf(n);
for (int i = 0; i < q;i++) {
ll com, x, y; cin >> com >> x >> y;
if (com == 0) {
uf.unite(x, y);
}
else if (com == 1) {
if (uf.same(x, y)) {
cout << 1 << endl;
}
else {
cout << 0 << endl;
}
}
}
return 0;
} | 1 | 867,988 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
int main() {
ll n, z, w; cin >> n >> z >> w;
vector<ll>a(n); for (auto&& x : a)cin >> x;
ll ans = 0;
if (n == 1) {
ans = abs(a[0] - w);
}
else {
ans = max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1]));
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <assert.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(int argc, char** argv) {
long long N, Z, W;
cin >> N >> Z >> W;
vector<long long> a(N);
REP(i, N) cin >> a[i];
if (N == 1) {
cout << abs(W - a[0]) << endl;
}
else {
cout << max(abs(W - a[N - 1]), abs(a[N - 1] - a[N - 2])) << endl;
}
} | 1 | 37,558,811 |
#include <iostream>
using namespace std;
const int MAX_N = 1e5 + 5;
char colors [4] = {'R', 'G', 'B', 'Y'};
int main () {
ios::sync_with_stdio(false);
int n, m, d;
cin >> n >> m >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int dd = ((MAX_N + i + j) / d) % 2;
int ud = ((MAX_N + i - j) / d) % 2;
cout << colors[dd + 2 * ud];
}
cout << '\n';
}
} | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll mod = 1000000007;
ll rui(ll number1,ll number2){
if(number2 == 0){
return 1;
}else{
ll number3 = rui(number1,number2 / 2);
number3 *= number3;
number3 %= mod;
if(number2%2==1){
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
ll gcd(ll number1,ll number2){
if(number1 > number2){
swap(number1,number2);
}
if(number1 == 0 || number1 == number2){
return number2;
}else{
return gcd(number2 % number1,number1);
}
}
void YES(bool condition){
if(condition){
p("YES");
}else{
p("NO");
}
return;
}
void Yes(bool condition){
if(condition){
p("Yes");
}else{
p("No");
}
return;
}
ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r;
ll x[500005],y[500005],z[1200005];
ll dp[1005][1005];
bool flag,dame;
ll sta;
ll po[1200000];
int main(){
cin >> h >> w >> n;
ll syuki = 2 * n;
for(i=0;i<2*n;i++){
for(j=0;j<2*n;j++){
a = 0;
if(0 <= (i + j) % syuki && ((i + j) % syuki) < n)a += 2;
if(0 <= ((i - j + 1000 * syuki) % syuki) && ((i - j + 1000 * syuki) % syuki) < n)a += 1;
dp[i][j] = a;
}
}
for(i=0;i<h;i++){
for(j=0;j<w;j++){
a = i % syuki;
b = j % syuki;
if(dp[a][b] == 1)pu("R");
if(dp[a][b] == 2)pu("Y");
if(dp[a][b] == 3)pu("G");
if(dp[a][b] == 0)pu("B");
}
el;
}
return 0;
} | 1 | 44,033,152 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
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;
}
return false;
}
const ll INF = 10010001010;
const int inf = 1000034000;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
cout<<fixed << setprecision(16);
int N, K;
cin >> N >> K;
long double ans = 0;
for (int i = 1; i <= N;i++)
{
ll mul = 0;
for (int j = i; j < K;)
{
j *= 2;
mul++;
}
ans += (long double)(1.0 / N) * (long double)(1.0 / pow(2, mul));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, n) for(ll i = 1; i <= ll(n); i++)
#define all(v) (v).begin(), (v).end()
bool chmin(ll &a, ll b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const ll MAX = 1e9;
const char newl = '\n';
ll pow2(ld x) {
ll cnt=0;
while(x>1) {x/=2; cnt++;}
return cnt;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(30);
ld n, k;
cin >> n >> k;
ld ans=0, one=1;
rep2(i, n) ans+=one/(1LL << pow2(k/i));
cout << ans/n << newl;
return 0;
} | 1 | 70,814,191 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
double a, b, c, degc, radc;
double s, r, l, h;
double pi = 4 * atan( 1.0 );
cin >> a >> b >> degc;
radc = degc * pi / 180.0;
s = b * a * sin( radc ) / 2.0;
c = sqrt( a*a + b*b - 2*a*b*cos( radc ) );
r = c / ( 2.0 * sin( radc ) );
l = 2.0 * r * pi;
l = a + b + c;
h = b * sin( radc );
cout << fixed << s << endl << l << endl << h << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
long double a, b,c;
cin >> a >> b >> c;
c = c / 180.0 * 3.141592653589793;
double h,S,L;
cout <<fixed<< a*b*sin(c)*0.5 << endl << a + b + abs(sqrt((a - b*cos(c))*(a - b*cos(c)) + (b*sin(c))*b*sin(c))) << endl << b*sin(c) << endl;
return 0;
} | 1 | 28,672,779 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, D, X, ans;
cin >> N >> D >> X;
vector<int> A(N+1);
for(int i = 1; i <= N; ++i) cin >> A[i];
ans = X;
for(int i = 1; i <= N; ++i){
ans += (D-1) / A[i] + 1;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int people, day, choco;
cin >> people >> day >> choco;
vector<int> a(people);
rep(i, people)
{
cin >> a[i];
int eat_day = a[i] + 1;
for (int j = 0; a[i] * j < day; j++)
{
choco++;
}
}
cout << choco << endl;
return 0;
} | 1 | 39,785,735 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long R, G, B, N;
long long count = 0;
cin >> R >> G >> B >> N;
for(long long i = 0; i <= N; i++){
for(long long j = 0; j <= N-i; j++){
if((N >= ((R*i)+(G*j))) && ((N - ((R*i)+(G*j))) % B == 0)) count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i <= (n) ; i ++ )
#define all(x) (x).begin(),(x).end()
using ll = long long;
using namespace std;
int main() {
ll r,g,b,n;
cin>>r>>g>>b>>n;
int ans=0;
rep(i,n/r){
rep(j,n/g){
if((n-i*r-j*g)>=0&&(n-i*r-j*g)%b==0){
ans++;
}
}
}
cout <<ans<<endl;
} | 1 | 73,572,890 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std ;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
int main()
{
int n, k ;
cin >> n >> k ;
if(k==1){
cout << 0 << endl ;
}
else{
cout << n-k <<endl ;
}
return 0 ;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 1e5 + 10;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
if (k == 1) return cout << 0, 0;
cout << n - k;
return 0;
} | 1 | 88,571,365 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,s=0;
string str;
cin>>str;
for(int i=0;i<str.size();i++){
int j=str[i]-48;
s+=j;
}
if(s%9==0)
cout<<"Yes";
else cout<<"No";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
inline void fastIO(){
ios_base::sync_with_stdio(0);cin.tie(0);
}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif
int main(){
fastIO();
int sum=0;
string s;
cin>>s;
for(int i=0;i<s.length();i++){
sum+=(s[i]-'0');
}
if(sum%9==0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 44,167,880 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define sc1(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
int main(){
int n,m,ans=0;
sc2(n,m);
int k[15][15];
int p[15]={0};
rep(i,15) rep(j,15) k[i][j]=0;
rep(i,m) {
sc1(k[i][0]);
rep(j,k[i][0]) sc1(k[i][j+1]);
}
rep(i,m) sc1(p[i]);
rep(i,pow(2,n)) {
int x=i;
int s[15]={0};
rep(j,n) {
if (x&1) s[j]=1;
x=x>>1;
}
int chk=0;
rep(j,m) {
int cnt=0;
rep(a,k[j][0]) if (s[k[j][a+1]-1]==1) cnt=(cnt+1)%2;
if (cnt==p[j]) chk++;
}
if (chk==m) ans++;
}
printf("%d\n",ans);
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m, k, t;
cin >> n >> m;
vector<int> p(n), on(n, 0);
vector<vector<int>> s(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
scanf("%d", &k);
for (int j = 0; j < k; j++) {
scanf("%d", &t);
s[i][t-1] = 1;
}
}
for (int i = 0; i < m; i++) scanf("%d", &p[i]);
int maxi = 1 << n;
int ans = 0;
for (int pat = 0; pat < maxi; pat++) {
bool ok = true;
for (int i = 0; i < m; i++) {
int on = 0;
for (int j = 0; j < n; j++) {
if (s[i][j] && (pat >> j & 1)) on++;
}
if (on % 2 != p[i]) ok = false;
}
if (ok) ans++;
}
cout << ans << endl;
} | 1 | 17,916,327 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N; cin >> N;
int ans =0;
rep(i,N) ans += i+1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int sum=0;
for(int i=1;i<=n;i++){
sum+=i;
}
printf("%d\n",sum);
} | 1 | 22,957,269 |
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
int main(){
double x1,y1,x2,y2,answer;
cin >> x1 >> y1 >> x2 >>y2;
answer = sqrt(pow((x1 - x2),2) + pow((y1 - y2),2));
cout << fixed << setprecision(8) << answer << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
int main(){
long double x1,x2,y1,y2,d;
cin >> x1 >> y1 >> x2 >> y2;
d = powl(powl(x1 - x2, 2.0) + powl(y1 - y2, 2.0), 0.5);
cout << fixed << d << "\n";
return 0;
} | 1 | 87,315,384 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k; cin >> k;
queue<ll> que;
for(int i=1; i<10; i++) que.push(i);
for(int i=0; i<k-1; i++) {
ll n = que.front();
que.pop();
for(int j=-1; j<2; j++) {
ll m = (n % 10) + j;
if(m >= 0 && m <= 9) {
que.push(n * 10 + m);
}
}
}
cout << que.front() << endl;
} | #include<bits/stdc++.h>
using namespace std;
queue<long long> yui;
int main()
{
int k;
cin>>k;
for(int i=1;i<10;i++) yui.push(i);
while(--k)
{
long long x=yui.front();
int y=x%10;
yui.pop();
for(int i=max(0,y-1);i<=min(9,y+1);i++)
yui.push(x*10+i);
}
cout<<yui.front();
} | 1 | 61,828,376 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
typedef tuple<ll, char> t;
vector<t> v;
v.push_back(make_tuple(q * 8, 'q'));
v.push_back(make_tuple(h * 4, 'h'));
v.push_back(make_tuple(s * 2, 's'));
v.push_back(make_tuple(d * 1, 'd'));
sort(v.begin(), v.end(),
[](t const &lhs, t const &rhs) {
if (get<0>(lhs) != get<0>(rhs)) return get<0>(lhs) < get<0>(rhs);
if (get<1>(lhs) != get<1>(rhs)) return get<1>(lhs) < get<1>(rhs);
return true;
}
);
ll res = 0;
REP(i, v.size()) {
switch (get<1>(v[i])) {
case 'q':
if (n > 0) {
res += 4 * q * n;
n = 0;
}
break;
case 'h':
if (n > 0) {
res += 2 * h * n;
n = 0;
}
break;
case 's':
if (n >= 1) {
res += s * n;
n = 0;
}
break;
case 'd':
if (n >= 2) {
res += d * (n / 2);
if (n % 2 == 0) {
n = 0;
} else {
n = 1;
}
}
break;
}
if (n == 0) {
break;
}
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
long long q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
n *= 100;
long long ans = 0;
long long t = n / 200;
n -= t * 200;
ans += min(min(t * d, 2 * t * s), min(4 * t * h, 8 * t * q));
t = n / 100;
n -= t * 100;
ans += min(t * s, min(2 * t * h, 4 * t * q));
t = n / 50;
n -= t * 50;
ans += min(t * h, 2 * t * q);
t = n / 25;
n -= t * 25;
ans += t * q;
cout << ans << endl;
return 0;
} | 1 | 33,163,083 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define pb push_back
#define f first
#define int long long
#define float long double
#define all(c) (c).begin(), (c).end()
#define endl '\n'
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
string s;
cin >> s;
string t;
cin >> t;
int n = t.length();
int count = 0;
fo(i,0,n){
if(s[i] != t[i])count++;
}
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define READ(FILE) freopen(FILE,"r",stdin)
#define WRITE(FILE) freopen(FILE,"w",stdout)
#define loop(i,s,e) for(int i=s;i<e;i++)
#define mego fast();
using namespace std;
void fast()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll lcm(ll x, ll y)
{
return (x*y)/__gcd(x,y);
}
int sum(string s)
{
int x=0,sz=s.size();
loop(i,0,sz)x+=(s[i]-'0');
return x;
}
int main()
{
mego
string s,t;
cin>>s>>t;
map<int,int> ma;
int ans=0;
loop(i,0,t.size())
ans+=(s[i]!=t[i]);
cout<<ans;
return 0;
} | 1 | 66,923,534 |
#include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl
#define dd(x) cout<<#x<<"="<<x<<" "
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp(u,v) make_pair(u,v)
#define sz(a) (int)a.size()
#define pb push_back
#define PI acos(-1.0)
#define qc std::ios::sync_with_stdio(false)
#define all(a) a.begin(),a.end()
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef double db;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
const ll mod = 1000000007;
const int N = 1e5+6;
const int M = 2e6+6;
const double eps = 1e-6;
const int inf = 0x3f3f3f3f;
bool eq(const db &a, const db &b) { return fabs(a - b) < eps; }
bool ls(const db &a, const db &b) { return a + eps < b; }
bool le(const db &a, const db &b) { return eq(a, b) || ls(a, b); }
ll gcd(ll a,ll b) { return a==0?b:gcd(b%a,a); };
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
ll kpow(ll a,ll b) {ll res=1;a%=mod; if(b<0) return 1; for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll read(){
ll x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
ll a[N];
ll p[62];
void add(ll x) {
repd(i, 60, 0) {
if(!(x&(1ll<<i))) continue;
if(p[i]) x ^= p[i];
else {
p[i] = x;
break;
}
}
}
int main() {
int n; scanf("%d",&n);
ll sum = 0;
rep(i, 0, n) scanf("%lld",a+i), sum ^= a[i];
rep(i, 0, 60) if(sum & (1ll<<i)) {
rep(j, 0, n) if(a[j] & (1ll<<i)) a[j] ^= (1ll<<i);
}
rep(i, 0, n) add(a[i]);
ll ret = 0;
repd(i, 60, 0) if(!(ret&(1ll<<i))) ret ^= p[i];
printf("%lld\n", (sum ^ ret) + ret);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define read(x) scanf("%d",&x)
using namespace std;
const int maxn = 1e5 + 10;
int n;
ll a[maxn];
int zero[64], tot;
ll p[64];
void insert(ll x){
for(int i=0;i<tot;i++){
if((x>>zero[i])&1){
if(!p[i]){
p[i] = x;
break;
}else{
x^=p[i];
}
}
}
}
int main()
{
read(n);
ll sum = 0;
tot = 0;
for(int i=0;i<n;i++) cin>>a[i],sum^=a[i];
for(int i=60;i>=0;i--)
if(!((sum>>i)&1)) zero[tot++] = i;
for(int i=0;i<n;i++) insert(a[i]);
ll res = 0;
for(int i=0;i<tot;i++){
if(!((res>>zero[i])&1)) res ^= p[i];
}
cout<<(sum^res)+res<<endl;
return 0;
} | 1 | 44,236,633 |
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
string s;
string t;
cin>>s>>t;
if(s>t){cout<<">";}
else if(s<t){cout<<"<";}
else{cout<<"=";}
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); i < (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 main() {
char x, y; cin >> x >> y;
if(x < y) cout << '<' << ln;
else if(x == y) cout << '=' << ln;
else cout << '>' << ln;
} | 1 | 95,439,498 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 55;
int n, m;
pair<int, int> person[N], check[N];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> person[i].first >> person[i].second;
for(int i = 1; i <= m; i++)
cin >> check[i].first >> check[i].second;
for(int i = 1; i <= n; i++) {
int ans = -1, best = 1e9;
for(int j = 1; j <= m; j++) {
if(best > abs(person[i].first - check[j].first) + abs(person[i].second - check[j].second)) {
best = abs(person[i].first - check[j].first) + abs(person[i].second - check[j].second);
ans = j;
}
}
cout << ans << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, M; cin >> N >> M;
vector<pair<int, int>> student(N), check(M);
for(int i = 0; i < N; i++) {
int a, b; cin >> a >> b;
student[i].first = a;
student[i].second = b;
}
for(int i = 0; i < M; i++) {
int c, d; cin >> c >> d;
check[i].first = c;
check[i].second = d;
}
for(int i = 0; i < N; i++) {
int m = inf;
int move = -1;
for(int j = 0; j < M; j++) {
int mdist = abs(student[i].first - check[j].first) + abs(student[i].second - check[j].second);
if(mdist < m) {
move = j + 1;
m = mdist;
}
}
cout << move << endl;
}
return 0;
} | 1 | 43,884,613 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
reverse(S.begin(),S.end());
while (1) {
int N = S.size();
if (N >= 5) {
string S5 = S.substr(0,5);
if (S5 == "maerd" || S5 == "esare") {
S.erase(0,5);
} else if (N >= 6) {
string S6 = S.substr(0,6);
if (S6 == "resare") {
S.erase(0,6);
} else if (N >= 7) {
string S7 = S.substr(0,7);
if (S7 == "remaerd") {
S.erase(0,7);
} else {
break;
}
} else {
break;
}
} else {
break;
}
} else {
break;
}
}
if (S.size() == 0) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
bool judge(int idx, string &s)
{
int len = s.size();
if (idx == len)
{
return true;
}
bool flag1 = false;
bool flag2 = false;
bool flag3 = false;
if (idx + 5 <= len && (s.compare(idx, 5, "dream") == 0 || s.compare(idx, 5, "erase") == 0))
{
flag1 = true;
}
if (idx + 7 <= len && (s.compare(idx, 7, "dreamer") == 0))
{
flag2 = true;
}
if (idx + 6 <= len && (s.compare(idx, 6, "eraser") == 0))
{
flag3 = true;
}
return (flag1 ? judge(idx + 5, s) : false) || (flag2 ? judge(idx + 7, s) : false) || (flag3 ? judge(idx + 6, s) : false);
}
int main()
{
string s;
cin >> s;
if (judge(0, s))
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
} | 1 | 36,894,995 |
#include <bits/stdc++.h>
using namespace std;
inline void FAST_IO(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
template<class F, class S> ostream& operator<<(ostream& os, pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template<class T, class S> ostream& operator<<(ostream& os, map<T, S> &v) {
os << "{";
for(auto &i : v) cout << "{" << i.first << "," << i.second << "}";
os << "}";
return os;
}
template<class T> ostream& operator<<(ostream& os, set<T> &v) {
os << "{";
for(auto &i : v) cout << i << ",";
os << "}";
return os;
}
template<class T> ostream& operator<<(ostream& os, vector<T> &v) {
os << "[";
if(v.size()) os << v[0];
for(int i = 1; i < v.size(); ++i) os << "," << v[i];
os << "]";
return os;
}
class UF{
public:
int *a, *sz;
int n;
UF(int n){
sz = new int[n];
a = new int[n];
this->n = n;
for(int i =0 ; i < n; i++)
a[i] = i, sz[i] = 1;
}
~UF(){
delete sz;
delete a;
}
int root(int p){
while(a[p] != p) {
a[p] = a[a[p]];
p = a[p];
}
return p;
}
void merge(int p, int q){
int i = root(p);
int j = root(q);
if(i == j) return;
if(sz[i] > sz[j]) a[j] = i, sz[i] += sz[j];
else a[i] = j, sz[j] += sz[i];
}
bool find(int p, int q){
return root(p) == root(q);
}
};
int main (){
int n,m;
cin >> n >> m;
UF uf(n+1);
int resp = 1;
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d %d", &a, &b);
if (!uf.find(a,b)) {
uf.merge(a,b);
resp = max(resp, uf.sz[uf.root(a)]);
}
}
cout << resp << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int f[200010],sz[200010];
int zzs(int u)
{
return f[u]==u?u:f[u]=zzs(f[u]);
}
void sq(int u,int v)
{
int a,b;
a=zzs(u);
b=zzs(v);
if(a!=b)
f[b]=a;
}
int main()
{
int n,m,u,v,sn=0;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
f[i]=i;
}
for(int i=1;i<=m;i++)
{
scanf("%d%d",&u,&v);
sq(u,v);
}
for(int i=1;i<=n;i++)
{
sz[zzs(i)]++;
}
for(int i=1;i<=n;i++)
{
sn=max(sn,sz[i]);
}
printf("%d\n",sn);
return 0;
} | 1 | 99,398,981 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "Yes";
int h, w;
cin >> h >> w;
vector<string> S(h);
for (int i = 0; i < h; ++i)
{
cin >> S[i];
}
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
for (int i = 0; i < h; ++i)
{
for (int j = 0; j < w; ++j)
{
if (S[i][j] == '#')
{
bool can = false;
for (int k = 0; k < 4; ++k)
{
int ni = i + dx[k];
int nj = j + dy[k];
if (ni < 0 || ni > h - 1)
{
continue;
}
if (nj < 0 || nj > w - 1)
{
continue;
}
if (S[ni][nj] == '#')
{
can = true;
}
}
if (can == false)
{
ans = "No";
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
int main()
{
int h, w;
cin >> h >> w;
vector<string> vs;
rep(i, h)
{
string s;
cin >> s;
vs.push_back(s);
}
rep(i, h)
{
rep(j, w)
{
int adj[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
bool f = false;
if (vs[i][j] == '.')
{
continue;
}
for (size_t k = 0; k < 4; k++)
{
int x = i + adj[k][0];
int y = j + adj[k][1];
if (x < 0 || x >= h || y < 0 || y >= w)
{
continue;
}
else if (vs[x][y] == '#')
{
f = true;
break;
}
}
if (!f)
{
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | 1 | 48,824,340 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
vector<P> p(n);
rep(i, n) {
ll a;
cin >> a;
p[i] = {a, i + 1};
}
sort(all(p));
rep(i, n) cout << p[i].second << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int N,m;
cin >> N;
vector<int> vec(N);
rep(i, N) {
cin >> m;
vec.at(m - 1) = i + 1;
}
rep(i, N) {
cout << vec.at(i) << " ";
}
} | 1 | 36,848,220 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;cin >> n;
vector<int> a(n);
for(auto &i:a) cin >> i;
for(int i=0;i<n;i++){
int p = (i-1)/2;
int l = 2*i+1;
int r = 2*i+2;
cout << "node " << i+1 << ": key = " << a[i] << ", ";
if(i) cout << "parent key = " << a[p] << ", ";
if(l<n) cout << "left key = " << a[l] << ", ";
if(r<n) cout << "right key = " << a[r] << ", ";
cout << endl;
}
} | #include<iostream>
using namespace std;
struct Node {
int key;
int parent = -1;
int left = -1;
int right = -1;
};
Node T[251];
void prop(int num) {
int div = num / 2;
int tmp = num % 2;
T[num].parent = div;
if (tmp == 0) {
T[div].left = num;
}
else {
T[div].right = num;
}
}
int main() {
int n;
cin >> n;
cin >> T[1].key;
for (int i = 2; i <= n; i++) {
cin >> T[i].key;
prop(i);
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << T[i].key << ", ";
if (T[i].parent != -1) {
cout << "parent key = " << T[T[i].parent].key << ", ";
}
if (T[i].left != -1) {
cout << "left key = " << T[T[i].left].key << ", ";
}
if (T[i].right != -1) {
cout << "right key = " << T[T[i].right].key << ", ";
}
cout << endl;
}
} | 1 | 87,659,687 |
#include <iostream>
#include <algorithm>
using namespace std;
int res[300000];
int main(){
long long n, a, b;
cin >> n >> a >> b;
if(a+b > n+1 || a*b < n){
cout << -1 << endl;
return 0;
}
int r = n;
int past = 0;
int i=0;
while(r > 0){
int len;
len = min(a, r - b + past + 1);
for(int m=r-len+1; m<=r; m++)
res[i++] = m;
past += 1;
r = r - len;
}
cout << res[0];
for(int i=1; i<n; i++)
cout << " " << res[i];
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define f(i,n) for(ll i=0;i<n;i++)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define nl "\n"
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define cout1(a) cout<<a<<nl
#define cout2(a,b) cout<<a<<" "<<b<<nl
#define cout3(a,b,c) cout<<a<<" "<<b<<" "<<c<<nl
#define cout4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d<<nl
#define vcout(v,i) cout<<v[i].fi<<" "<<v[i].se<<nl
#define x first
#define y second
#define vc vector
#define pb push_back
#define ar array
#define all(a) (a).begin(), (a).end()
#define ms(v,n,x) fill(v,v+n,x);
#define init(c,a) memset(c,a,sizeof(c))
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define sll set<ll>
#define vll vector<ll>
#define vpll vector<pll>
#define maxi(a,b,c) max(a,max(b,c))
#define maxii(a,b,c,d) max(max(a,b),max(c,d))
#define mini(a,b,c) min(a,min(b,c))
#define md(a,b) ((a%mod)*(b%mod)+mod)%mod
#define inf 9e18
#define cases ll T;cin>>T;while(T--)
#define BLOCK 500
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int32_t main()
{
fast
cout << fixed << setprecision(12);
ll n,a,b;
cin>>n>>a>>b;
if(a+b-1>n || a*b<n){
cout<<-1;
return 0;
}
ll c=0;
while(n>0){
ll x=min(a,n-b+1);
for(ll i=n-x+1;i<=n;i++)
cout<<i<<" ";
b--;
n-=x;
}
return 0;
} | 1 | 76,910,134 |
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x),outst[outst_N++] = ' '
#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
#define scouts(x) strout(x),outst[outst_N++] = ' '
#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
char outst[20'000'000]; int outst_N = 0;
char outst_tmp[200];
template<class NUM >
void numout(NUM n){
if(n<0) { n*=-1; outst[outst_N++] = '-';}
if(n==0){ outst[outst_N++] = '0'; return;}
int cnt = 0;
while(n>0){
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i,0,cnt){
outst[outst_N++] = outst_tmp[i];
}
}
void strout(std::string s){
for(auto x: s){
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 55;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
void solve(){
ll m, k; cin >> m >> k; int n = 1<<(m+1);
if(k>=(1<<m) || (m==1 && k==1)) {coutn(-1); return;}
if(m==1 && k == 0){ couts(1); couts(1); couts(0); couts(0);return;}
IFOR(i,0,n/2){
if(i==k) continue;
ncouts(i);
}
ncouts(k);
FOR(i,0,n/2){
if(i==k) continue;
ncouts(i);
}
ncouts(k);
printf("%s", outst);
}
int main(void){
cin.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void init () {
srand (time(0));
int XOR[20] = {0};
for (int n = 1; n <= 3; ++n) {
for (int k = 1; k < (1<<n); ++k) {
vector <int> a(1<<(n+1));
for (int i = 0; i < (1<<n); ++i) a[i] = i, a[i+(1<<n)] = i;
sort (a.begin(),a.end());
cout << "n = " << n << ", k = " << k << endl;
int times = 0;
do {
random_shuffle(a.begin(),a.end());
int cnt = 0;
vector <int> pos[1<<n];
XOR[0] = 0;
for (auto &x : a) ++cnt, XOR[cnt] = XOR[cnt-1] ^ x, pos[x].push_back(cnt);
bool flag = true;
for (int i = 0; i < (1<<n); ++i) {
int pos1 = pos[i][0], pos2 = pos[i][1];
if (pos1 > pos2) swap (pos1, pos2);
int t = XOR[pos2] ^ XOR[pos1-1];
if (t != k) flag = false;
}
if (flag) {
cout << "YES : " << n << " " << k << endl;
for (auto &x : a) cout << x << " "; cout << endl;
for (int i = 0; i < (1<<n); ++i) cout << pos[i][0] << " " << pos[i][1] << endl;
break;
}
} while (++times < 12345678);
}
}
}
int main () {
int n, k; cin >> n >> k;
if (k >= (1<<n) || (n == 1 && k == 1)) puts("-1");
else if (n == 1) puts("0 0 1 1");
else {
vector <int> ans;
for (int i = 0; i < (1<<n); ++i) if (i != k) ans.push_back (i);
ans.push_back (k);
for (int i = (1<<n)-1; i >= 0; --i) if (i != k) ans.push_back (i);
ans.push_back (k);
for (auto &x : ans) cout << x << " "; cout << endl;
}
return 0;
} | 1 | 83,133,060 |
#include <iostream>
#include <algorithm>
using namespace std;
long long N, A[1 << 18], B[1 << 18], sum = 0, minx = (1LL << 60);
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i] >> B[i]; sum += A[i];
if (A[i] > B[i]) minx = min(minx, B[i]);
}
if (minx == (1LL << 60)) cout << "0" << endl;
else cout << sum - minx << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll ans,minb=2e9;
bool ok;
int main(){
scanf("%d",&n);
while(n--){
ll a,b;
scanf("%lld%lld",&a,&b);
ans+=b;
if(a!=b)ok=1;
if(b<a)minb=min(minb,b);
}
if(ok)printf("%lld",ans-minb);
else puts("0");
return 0;
} | 1 | 33,081,093 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#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 REPA(i,a) for(ll i=0;i<(ll)(a.size());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 COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i,a) for(ll i=0;i<(ll)(a.size());i++) {cout << (a)[i] << " ";} cout << endl;
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const unsigned int BIT_FLAG_8 = (1 << 8);
const unsigned int BIT_FLAG_9 = (1 << 9);
const unsigned int BIT_FLAG_10 = (1 << 10);
const unsigned int BIT_FLAG_11 = (1 << 11);
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI=3.14159265358979323846;
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
vs a(n, "");
REP(i, n) {
string s_in;
cin >> s_in;
sort(s_in.begin(), s_in.end());
a[i] = s_in;
}
SORT(a);
string check = "";
ll count=1;
ll total=0;
REP(i, n) {
if (check == a[i]) {
count++;
}
else {
total += (count * (count - 1) / 2);
count=1;
}
check = a[i];
}
total += (count * (count - 1) / 2);
COUT(total);
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> S;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
++S[s];
}
ll res = 0;
for (auto &s : S) {
res += (ll)s.second * (s.second - 1) / 2;
}
printf("%lld\n", res);
} | 1 | 6,176,108 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, k, ans;
int main() {
cin >> n >> k;
if (k % 2 == 0) {
ll a = (n - k / 2) / k + (k / 2 <= n ? 1 : 0);
ll b = n / k;
cout << a * a * a + b * b * b << endl;
} else {
ll a = n / k;
cout << a * a * a << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
if (k & 1) {
ll t = n / k;
t = pow(t, 3);
ans = t;
} else {
ll t = n / k;
ll t2 = n / (k / 2);
t2 = (t2 + 1) / 2;
ans = pow(t, 3) + pow(t2, 3);
}
cout << ans << endl;
} | 1 | 16,379,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N, M, X, Y;
cin >> N >> M >> X >> Y;
ll maxx = X;
ll miny = Y;
REP(i, N){
ll x;
cin >> x;
maxx = max(maxx, x);
}
REP(i, M){
ll y;
cin >> y;
miny = min(miny, y);
}
if(maxx < miny){
cout << "No War" << endl;
}
else{
cout << "War" << endl;
}
return 0;
} | #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(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define decp(n) cout<<fixed<<setprecision((int)n)
#define _GLIBCXX_DEBAC
#include <functional>
using namespace std;
ll gcd(ll a, ll b) {
ll c;
if (a < b) {
c = a; a = b; b = c;
}
while (b != 0) {
c = a % b; a = b; b = c;
}
return a;
}
ll lcm(ll a, ll b) {
ll c;
c = a * b / gcd(a, b);
return c;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z()
{
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i]; a[i] = a[minj]; a[minj] = t;
if (i != minj) sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1) return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return true;
}
const ll mod = 1000000007;
map<string, int> memo;
using P=pair<int, int>;
ll findIndex(int value, vector<ll> a)
{
for (ll i = 0; i < a.size(); i++) {
if (a[i] == value) {
return i;
}
}
return -1;
}
ll nCr(ll n, ll r) {
ll a = 1;
for (ll i = n; i > n - r; --i) {
a = a * i;
}
for (ll i = 1; i < r + 1; ++i) {
a = a / i;
}
return a;
}
void comb(vector<vector <long long int> >& v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (ll j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
int n, m,X,Y;
cin >> n >> m>>X>>Y;
vector<int> x(n), y(m);
rep(i, n)cin >> x[i];
rep(i, m)cin >> y[i];
sort(rall(x)); sort(all(y));
x[0]++;
if (x[0] <= y[0]&&X<x[0]&&x[0]<=Y)cout << "No War";
else cout << "War";
return 0;
} | 1 | 21,952,600 |
#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() {
ll N, M;
cin >> N >> M;
ll ans = min(N,M/2);
N-=ans;
M-=ans*2;
cout << ans + M/4 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, m;cin>>n>>m;
ll ans=min(n, m/2);
m = max(0LL, m - n*2);
ans += m / 4;
cout << ans;
} | 1 | 62,177,893 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int siz = s.size(),c=0;
bool flag = true;
for(int i=0; i<siz; i++)
{
if(i == 0)
{
if(s[i]!='A')
{
flag=false;
}
}
if(i>0&&i<siz&&s[i]!='C')
{
if(!(s[i]>='a'&&s[i]<='z'))
{
flag = false;
}
}
if(i>1&&i<siz-1 && s[i]=='C')
++c;
}
if(c!=1)
{
flag = false;
}
if(flag)
cout<<"AC";
else
cout<<"WA";
} | #include<bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(i=0;i<n;i++)
#define rep1(i,n) for(i=1;i<n;i++)
#define test(a) cout << "*" << a << endl;
int main(){
string s;
bool existAC = false;
int i;
int existC=false;
int placeC;
cin >> s;
if(s[0]=='A'){
for(i=2;i<s.size()-1;i++){
if(s[i]=='C'){
if(existC==true){
existC=false;
break;
}
placeC=i;
existC = true;
}
}
if(existC==true){
rep1(i,s.size()){
if(i==placeC){
continue;
}
if('a'<=s[i] && s[i]<='z'){
if(i==s.size()-1){
existAC = true;
}
}
else{
break;
}
}
}
}
if(existAC==true)
cout << "AC" << endl;
else
cout << "WA" << endl;
} | 1 | 35,596,539 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr<< #x <<": "<<x<<"\n"
#define debug2(x,y) std::cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<"\n"
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int> > vvi;
typedef std::vector<ll> vll;
typedef std::vector<std::vector<ll> > vvll;
typedef std::deque<bool> db;
template<class T> using vv=std::vector<std::vector< T > >;
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<std::deque<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& v) {
s<<"\n";for(auto elm : v){s<<elm<<"\t";}s<<"\n";return s; }
inline void scan(int&a){scanf("%d",&a);}
inline void scan(int&a,int&b){scanf("%d%d",&a,&b);}
inline void scan(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void scan(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void scan(std::vector<int>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<int> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void scan(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void scan(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void scan(std::vector<ll>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<ll> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(std::vector<char>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<char> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(int a,int b){printf("%d %d\n",a,b);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(ll a,ll b){printf("%lld %lld\n",a,b);}
inline void print(std::string s){std::cout << s << "\n";}
inline void print_yn(bool flg){if(flg){printf("Yes\n");}else{printf("No\n");}}
using namespace std;
int main() {
string s;
scan(s);
int x, y;
scan(x, y);
vi arms;
int cnt = 0;
int sz = s.length();
if (s[sz-1] == 'F') {
s += 'T';
sz += 1;
}
for (char c : s) {
if (c == 'F') {
cnt += 1;
} else {
arms.push_back(cnt);
cnt = 0;
}
}
x -= arms[0];
vi xy = {abs(x), abs(y)};
vvi arm(2);
sz = arms.size();
FOR (i, 1, sz) {
if (arms[i] == 0) { continue; }
arm[i%2].push_back(arms[i]);
}
rep (i, 2) {
int sum = 0;
sz = arm[i].size();
rep (j, sz) {
sum += arm[i][j];
}
if (xy[i] < -sum || sum < xy[i] || (sum - xy[i]) % 2 == 1) {
print_yn(false);
return 0;
}
int aim = (sum - xy[i]) / 2;
vv<bool> dp(sz+1, vector<bool>(aim+1, false));
dp[0][0] = true;
rep (j, sz) {
rep (k, aim+1) {
if (dp[j][k]) {
dp[j+1][k] = true;
if (k + arm[i][j] <= aim) {
dp[j+1][k + arm[i][j]] = true;
}
}
}
}
if (!dp[sz][aim]) {
print_yn(false);
return 0;
}
}
print_yn(true);
return 0;
} | #include<cstdio>
#include<cstring>
int f[2][16005];
int x[8005],y[8005];
char s[8005];
void getReach(int n,int a[],int start){
int offset = 8000;
for(int i = -8000; i <= 8000; i++) f[0][i+offset] = 0;
f[0][start+offset] = 1;
for(int i = 1; i <= n; i++){
int v = i%2; int u = !v;
int step = a[i];
for(int j = -8000; j <= 8000; j++){
f[v][j+offset] = 0;
int last = j-step;
if(last>=-8000) f[v][j+offset] |= f[u][last+offset];
last = j+step;
if(last<=8000) f[v][j+offset] |= f[u][last+offset];
}
}
}
int main(){
int tx,ty;
scanf("%s%d%d",s+1,&tx,&ty);
int n = strlen(s+1);
int p = 1, baseX = 0;
while(p<=n && s[p]=='F') p++, baseX++;
int sizeX = 0, sizeY = 0; int direct = 0;
while(p<=n){
if(s[p]!='F'){
direct = !direct;
p++;
}
else{
int np = p;
while(np+1<=n && s[np+1]=='F') np++;
int step = np-p+1;
if(!direct) x[++sizeX] = step;
else y[++sizeY] = step;
p = np+1;
}
}
int ok = 1;
getReach(sizeX,x,baseX);
int offset = 8000;
if(f[sizeX%2][tx+offset]==0) ok = 0;
getReach(sizeY,y,0);
if(f[sizeY%2][ty+offset]==0) ok = 0;
if(ok) printf("Yes\n");
else printf("No\n");
return 0;
} | 1 | 7,295,288 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int a,b,c;
cin>>a>>b>>c;
int ans=3;
if(a==b&&a!=c)ans=2;
else if(a==b&&a==c)ans=1;
else if(a==c)ans=2;
else if(a!=c&&b==c)ans=2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define pi (acos(-1))
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
#define vec std::vector
#define oreq |=
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
ll extgcd(ll a, ll b, ll &x, ll &y);
ll nCr(ll n, ll r);
void stat();
constexpr ll mod = 1000000000 + 7;
int main()
{
stat();
unordered_set<int> s;
rep(i,3){
int x;cin>>x;s.insert(x);
}
cout<<s.size()<<endl;
return 0;
}
ll extgcd(ll a, ll b, ll &x, ll &y)
{
if (b == 0)
{
x = 1, y = 0;
return a;
}
ll d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
std::vector<unsigned ll> genprimevec(const unsigned ll N)
{
std::vector<bool> is_prime(N + 1);
for (unsigned ll i = 0; i <= N; i++) { is_prime[i] = true; }
std::vector<unsigned ll> P;
for (unsigned ll i = 2; i <= N; i++)
{
if (is_prime[i])
{
for (unsigned ll j = 2 * i; j <= N; j += i) { is_prime[j] = false; }
P.emplace_back(i);
}
}
return P;
}
void stat() {
#ifdef local
rep(i, 2) {std::cout << "local enable" << std::endl;
}
#endif
#ifdef hacks
rep(i, 2) { std::cout << "boost enable" << std::endl; }
#endif
}
ll nCr(ll n, ll r)
{
ll num = 1;
for (ll i = 1; i <= r; i++) { num = num * (n - i + 1) / i; }
return num;
} | 1 | 94,448,154 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a,b;
cin>>a>>b;
if(a>=b){cout<<10<<endl;
}
else cout<<0<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main()
{
int64 xx, aa;
cin >> xx >> aa;
cout << (xx < aa ? 0 : 10) << endl;
return 0;
} | 1 | 20,317,441 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector <int> str;
str.resize(n);
for(int i =0; i < n ; i++){
cin >> str[i] ;
}
int cnter =0;
for( int i=0 ; i <= ( n-1 ) ; i++ ){
int minj = i;
int p = 0;
for(int j = i ; j<= ( n-1 ); j++ ){
if( str[j] < str[minj]){
minj = j;
p++;
}
}
if(p!=0){
int temp = str[i];
str[i] = str[minj];
str[minj] = temp;
cnter ++;
}else{
}
}
for(int i =0; i<n ; i++){
cout << str[i] ;
if(i != (n-1)){
cout << " ";
}
}
cout << endl;
cout << cnter << endl;
return 0;
} | #include<stdio.h>
int main(){
int n, array[100], i, j, tmp, min, count=0;
scanf("%d", &n);
for(i=0;i<=n-1;i++)scanf("%d",&array[i]);
for(i=0;i<=n-1;i++){
min = i;
for(j=i;j<=n-1;j++)if(array[j]<array[min])min=j;
if(min!=i){
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
count++;
}
}
for(i=0;i<=n-1;i++){
if(i>=1)printf(" ");
printf("%d", array[i]);
}
printf("\n");
printf("%d\n", count);
return 0;
} | 1 | 22,891,615 |
#include "bits/stdc++.h"
#define MOD 1000000007
#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()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
struct UnionFind{
ll N;
llvec p;
llvec cnt;
UnionFind(ll n){
N = n;
p=llvec(N);
cnt=llvec(N, 0);
rep(i, N){
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b){
P at = root(a);
P bt = root(b);
if(at.second!=bt.second){
if(at.first>bt.first){
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second]+=cnt[at.second];
p[a]=bt.second;
}
}
P root(ll a){
ll atmp = a;
ll c=0;
while(atmp!=p[atmp]){
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b){
P at=root(a);
P bt=root(b);
return at.second == bt.second;
}
};
struct dijkstra{
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n){
N = n;
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost){
e[from].push_back({to, cost});
}
void run(ll start){
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start]=0;
while(!que.empty()){
P q = que.top();que.pop();
ll dc = q.first;
ll x = q.second;
if(dc>d[x]){
continue;
}else{
for(auto ip: e[x]){
if(d[ip.x]<=d[x]+ip.c){
continue;
}else{
d[ip.x]= d[x]+ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
int main(){
ll N;
cin >> N;
llvec a(N);
rep(i, N)cin >> a[i];
ll ans = 1e18;
for(ll i=-100;i<=100;i++){
ll tmp =0;
rep(j, N){
tmp += pow(a[j]-i, 2);
}
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans=INT_MAX;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
for(int i=-100;i<=100;i++)
{
int cost=0;
for(auto j:v)
cost+=pow(i-j,2);
ans=min(ans,cost);
}
cout<<ans;
return 0;
} | 1 | 54,724,616 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
getline(cin, s);
int n = s.size();
for (int i = 0; i < n; i++){
if ((s[i] >= 'A' && s[i] <= 'Z') || (s[i] >= 'a'&&s[i] <= 'z'))
cout << (char)(s[i] ^ 32);
else
cout << s[i];
}
cout <<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c", &ch);
if ( ch == '\n' ) break;
if(isalpha(ch)){
if(islower(ch)){
printf("%c", toupper(ch));
}
else if(isupper(ch)){
printf("%c", tolower(ch));
}
}
else{
cout << ch;
}
}
cout << endl;
} | 1 | 91,541,530 |
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,x;
string str;
list <int> lst;
list<int>::iterator it;
cin >> n;
while (n--){
cin >> str;
if (str == "insert"){
cin >> x;
lst.push_front(x);
}else if (str == "deleteFirst") lst.pop_front();
else if (str == "deleteLast") lst.pop_back();
else{ cin >> x;
for (it = lst.begin(); it!=lst.end(); ++it){
if (*it == x){
lst.erase(it); break;
}
}
}
}
for (it = lst.begin(); it != --lst.end(); ++it){
cout << *it<<" ";
}cout <<*it<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int value;
Node* prev,* next;
};
Node* head;
void Init()
{
head=(Node*)malloc(sizeof(Node));
head->next=head;
head->prev=head;
}
Node* FindNode(int x)
{
Node*temp=head->next;
while(temp!=head&&temp->value!=x)
temp=temp->next;
return temp;
}
void Insert(int x)
{
Node*temp=(Node*)malloc(sizeof(Node));
temp->value=x;
head->next->prev=temp;
temp->next=head->next;
head->next=temp;
temp->prev=head;
}
void Delete(Node*temp)
{
if(temp==head)
return ;
temp->next->prev=temp->prev;
temp->prev->next=temp->next;
free(temp);
}
void DeleteFirst()
{
Delete(head->next);
}
void DeleteLast()
{
Delete(head->prev);
}
int main()
{
int n;
int i;
scanf("%d",&n);
char str[12];
int x;
Init();
while(n--)
{
scanf("%s%d",str,&x);
if(str[0]=='i'){Insert(x);}
else if(str[0]=='d'&&str[6]=='F')DeleteFirst();
else if(str[0]=='d'&&str[6]=='L')DeleteLast();
else if(str[0]=='d'){Delete(FindNode(x));}
}
Node* temp=head->next;
while(temp->next!=head)
{
printf("%d ",temp->value);
temp=temp->next;
}
printf("%d\n",temp->value);
return 0;
} | 1 | 58,608,190 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m), n){
typedef pair<int, int> P;
vector<P> v;
int res = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
v.push_back(P(b, a));
res += a * b;
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int p = 0;
while (m > 0 && p < n){
if (v[p].second == 0){
++p;
continue;
}
int t = min(m, v[p].second);
res -= v[p].first * t;
v[p].second -= t;
m -= t;
}
printf("%d\n", res);
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
typedef pair< int , int > P;
int main(){
int N, M;
while(cin >> N >> M , N){
int d[11] = {};
for(int i = 0 ; i < N ; i++ ){
int a, b;
cin >> a >> b;
d[b] += a;
}
for(int i = 10 ; i && M ; i-- ){
int t = min( d[i], M);
d[i] -= t;
M -= t;
}
int ret = 0;
for(int i = 0 ; i < 11 ; i++ ) ret += d[i] * i;
cout << ret << endl;
}
} | 1 | 7,329,588 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
unordered_set<int> st;
for (int i=1; i<=n; i++) {
st.insert(i);
};
for (int i=0; i<k; i++) {
int d; cin >> d;
for (int j=0; j<d; j++) {
int t;
cin >> t;
if (st.find(t) != st.end()) {
st.erase(t);
}
}
}
cout << st.size();
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<int> d(k);
vector<int> t(n, 0);
for(int i=0; i<k; ++i){
cin >> d[i]; d[i]--;
for(int j=0; j<=d[i]; ++j){
int a;
cin >> a; a--; t[a]++;
}
}
int res = 0;
for(int i=0; i<n; ++i){
if(t[i]==0){res++;}
}
cout << res << endl;
return 0;
} | 1 | 44,942,362 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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; }
signed main(){
int n; cin>>n;
vi vec(n);
rep(i,0,n) cin>>vec[i];
sort(all(vec));
int m=n/2;
cout<<vec[m]-vec[m-1];
return 0;
} | #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_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N;
cin>>N;
vector<int>d(N);
for(int i=0;i<N;i++){
cin>>d[i];
}
sort(d.begin(),d.end());
cout<<d[N/2]-d[N/2-1]<<endl;
return 0;
} | 1 | 56,652,763 |
#include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#define int long long
#define KETA(n) floor(log10(n) + 1)
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if(a == b)
cout << "Draw" << endl;
else if((a > b && a != 13) || a == 1)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0);
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b == 1) {
cout << "Draw" << endl;
} else if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else {
if (a == b)
cout << "Draw" << endl;
else if (a > b)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
}
} | 1 | 35,527,716 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll ra = 0, lb = 0, ba = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 2) if (s[i][j] == 'A' && s[i][j + 1] == 'B') ans++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ba++;
else if (s[i][0] == 'B')
lb++;
else if (s[i][s[i].size() - 1] == 'A')
ra++;
}
if (ba == 0)
ans += min(lb, ra);
else {
if (lb + ra > 0)
ans += ba + min(lb, ra);
else
ans += ba - 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define REP(i,x) for(ll i = 1;i<=x;i++)
#define mp make_pair
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const dou pi = 3.14159265358;
const ll mod = 1000000007LL;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a / gcd(a,b) * b;
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n,ll m,ll MOD){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n,ll m){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
ll num(ll n){
ll res = 0;
rep(i,n){
res += mypow(10,i);
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
vector<string> vec(N);
rep(i,N){
cin >> vec[i];
}
ll naka = 0,A = 0,B = 0,both = 0;
rep(i,N){
ll s = vec[i].size();
if(vec[i][0] == 'B' && vec[i][s - 1] == 'A')both++;
else if(vec[i][0] == 'B')B++;
else if(vec[i][s - 1] == 'A')A++;
rep(j,s - 1){
if(vec[i][j] == 'A' && vec[i][j + 1] == 'B'){
j++;
naka++;
}
}
}
ll ans = naka;
if(A == 0 && B == 0){
ans += (both ? both - 1:0);
}
else{
ans += both + min(A,B);
}
cout << ans << endl;
} | 1 | 96,409,188 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const int MAX = 1000000;
const int MOD = 1000000007;
int main(){
int n;
cin >> n;
set<ll>st;
rep(i, 0, n){
ll p;
cin >> p;
st.insert(p);
}
if(st.size()==n){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | #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 > pairs;
typedef complex<ll> G;
const int N=2e5+5;
const ll INF = 1e18;
void done() {
int n;cin >> n;
set<int>ans;
for(int i=0;i < n;i++) {
int a;cin >> a;
ans.insert(a);
}
if(ans.size()==n)cout << "YES";
else cout << "NO";
}
void solve() {
int n;
cin >>n;
vector<int>a(n);
vector<int>b(n);
vector<long double>c;
for(int i=0;i < n;i++) {
cin >> a[i];
}
int r = 0;
for(int i=0;i < n;i++) {
cin >> b[i];
if(a[i]!=0) {
c.push_back(b[i]/a[i]*1.0);
}else if(b[i]=='0') {
r++;
c.push_back(-999999999);
}
else {
c.push_back(-999999999);
}
}
int sum = 1;
int best = 0;
sort(c.begin(), c.end());
for(int i=1;i < n;i++) {
if(c[i]==c[i-1] && c[i-1]!=-999999999) {
sum++;
}
else {
if(sum > best && c[i-1]!=-999999999) {
best = sum;
sum = 1;
}
}
}
if(sum > best && c[n-1]!=-999999999) {
best = sum;
}
cout << best+r << '\n';
}
void another() {
int n;cin >> n;
string s;
cin >> s;
int left= 0, right = 0;
int d = (s[0]=='<') ?1 : 0;
int c = (s[n-1]=='>')?1 : 0;
for(int i=0;i < n;i++) {
if(i!=0 && s[i]=='<')left++;
else if(i!=n-1 && s[i]=='>')right++;
}
if(left <= right) {
swap(left, right);
swap(d, c);
}
if(d) {
cout << max(1, right-1) << '\n';
}
else cout << max(0, right-1) << '\n';
}
void test_case() {
int t;
cin >> t;
while(t--)solve();
}
int main() {
fast;
done();
} | 1 | 78,973,171 |
#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>;
bool isOn(int bit,int i){
return bit & 1<<(i-1);
}
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> lights;
vector<int> conditions;
rep(i, m){
int k; cin >> k;
vector<int> light;
rep(j, k){
int s; cin >> s;
light.push_back(s);
}
lights.push_back(light);
}
rep(i, m){
int p; cin >> p;
conditions.push_back(p);
}
int res = 0;
for(int bit=0; bit < (1<<n); ++bit){
int lightOn = 0;
rep(i, lights.size()){
int cnt_swc = 0;
for(auto swc : lights[i]){
if(isOn(bit, swc)) ++cnt_swc;
}
if(cnt_swc%2 == conditions[i]) ++lightOn;
}
if(lightOn == m) ++res;
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
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;
}
return false;
}
void hr() {
cerr << "--------------" << endl;
}
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, 0, m) {
int k;
cin >> k;
rep(j, 0, k) {
int s;
cin >> s;
s--;
a[s] |= 1 << i;
}
}
int p = 0;
rep(i, 0, m) {
int pi;
cin >> pi;
p |= pi << i;
}
int ans = 0;
rep(S, 0, 1 << n) {
int t = 0;
rep(i, 0, n) {
if ((S >> i) & 1) {
t ^= a[i];
}
}
if (t == p) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 44,759,099 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
if (ch=='-'){
int s=0;
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return -s;
}
int s=ch-'0';
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return s;
}
const int N = 100010;
int nxt[N];
int fa[N];
int n,m;
struct edge{
int x,nxt;
}e[N*4];
int h[N],tot;
int s[N];
int label[N];
bool bz[N];
int getfather(int x){
if (fa[x]==x)return x;
return fa[x]=getfather(fa[x]);
}
void inse(int x,int y){
e[++tot].x=y;
e[tot].nxt=h[x];
h[x]=tot;
}
bool dfs(int x,int lab){
bool pd=1;
s[x]=1;
if (label[x]&&lab!=label[x])pd=0;
else label[x]=lab;
for(int p=h[x];p;p=e[p].nxt)
if (!s[e[p].x]){
pd&=dfs(e[p].x,lab%2+1);
s[x]+=s[e[p].x];
}
else pd&=(label[e[p].x]!=lab);
return pd;
}
int main(){
n=get();m=get();
fo(i,1,n)fa[i]=i;
fo(i,1,m){
int x=get(),y=get();
inse(x,y);inse(y,x);
x=getfather(x),y=getfather(y);
if (x<y)fa[y]=x;else fa[x]=y;
}
LL ans=0;
int cnt=0,cnt_single=0,cnt_bit=0;
fo(i,1,n)
if (getfather(i)==i){
bz[i]=dfs(i,1);
cnt++;
if (s[i]==1)cnt_single++;
else if (bz[i])cnt_bit++;
}
fo(i,1,n)
if (fa[i]==i){
if (s[i]==1)ans=ans+n;
else{
if (!bz[i])ans=ans+1ll*cnt_single*s[i]+cnt-cnt_single;
else ans=ans+1ll*cnt_single*s[i]+cnt-cnt_single+cnt_bit;
}
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,m;
vector<int>edge[100005];
int col[100005];
bool bad[100005];
bool used[100005];
vector<int>C; int cnt;
void dfs(int v,int p,int c){
if(used[v]) return;
used[v] = 1; if(col[v] && col[v]!=c) bad[p]=1;
col[v] = c; cnt++;
for(int i=0;i<edge[v].size();i++){
if(used[edge[v][i]] == 0){
dfs(edge[v][i],p,-1*c);
}
else if(col[edge[v][i]] && col[edge[v][i]]==c)bad[p]=1;
}
}
int main(){
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;cin>>a>>b;
edge[a].pb(b);
edge[b].pb(a);
}
ll ans = 0; int cnt2;
for(int i=1;i<=n;i++){
if(used[i]) continue;
cnt=0;
dfs(i,i,1);
if(cnt==1);
else if(bad[i]) ans++;
else ans+=2;
if(cnt!=1) C.pb((bad[i]?1:2)); else cnt2++;
}
ans+=1LL*n*n-1LL*(n-cnt2)*(n-cnt2);
for(int i=0;i<C.size();i++){
for(int j=i+1;j<C.size();j++){
if(C[i]==2&&C[j]==2) ans+=4;
else ans+=2;
}
}
cout<<ans<<endl;
} | 1 | 66,012,243 |
#include "bits/stdc++.h"
using namespace std;
const string number={'2','3','4','5','6','7','8','9'};
const string moji={'i','x','c','m'};
void hantei(string MCXI,int *digit){
for(int i=MCXI.size();i>1;--i){
if(MCXI[i-1]==moji[0]){
digit[0]=1;
for(int j=0;j<number.size();++j){
if(MCXI[i-2]==number[j]){
digit[0]=j+2;
--i;
break;
}
}
}else if(MCXI[i-1]==moji[1]){
digit[1]=1;
for(int j=0;j<number.size();++j){
if(MCXI[i-2]==number[j]){
digit[1]=j+2;
--i;
break;
}
}
}else if(MCXI[i-1]==moji[2]){
digit[2]=1;
for(int j=0;j<number.size();++j){
if(MCXI[i-2]==number[j]){
digit[2]=j+2;
--i;
break;
}
}
}else if(MCXI[i-1]==moji[3]){
digit[3]=1;
for(int j=0;j<number.size();++j){
if(MCXI[i-2]==number[j]){
digit[3]=j+2;
--i;
break;
}
}
}
}
if(MCXI[0]==moji[0])digit[0]=1;
else if(MCXI[0]==moji[1])digit[1]=1;
else if(MCXI[0]==moji[2])digit[2]=1;
else if(MCXI[0]==moji[3])digit[3]=1;
}
string answer(int *digit1,int *digit2){
string ans;
int ans_digit[4]={(digit1[0]+digit2[0])%10,
(digit1[1]+digit2[1]+(digit1[0]+digit2[0])/10)%10,
(digit1[2]+digit2[2]+(digit1[1]+digit2[1]+(digit1[0]+digit2[0])/10)/10)%10,
digit1[3]+digit2[3]+(digit1[2]+digit2[2]+(digit1[1]+digit2[1]+(digit1[0]+digit2[0])/10)/10)/10};
for(int i=4;i>0;--i){
if(ans_digit[i-1]==1)ans.push_back(moji[i-1]);
else if(ans_digit[i-1]>1){
ans.push_back(number[ans_digit[i-1]-2]);
ans.push_back(moji[i-1]);
}
}
return ans;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string MCXI1,MCXI2;
cin >> n;
while(n){
int digit1[4]={0};
int digit2[4]={0};
cin >> MCXI1 >>MCXI2;
hantei(MCXI1,digit1);
hantei(MCXI2,digit2);
cout << answer(digit1,digit2) << endl;
n--;
}
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using pci = pair<char, int>;
using vpci = vector<pci>;
#define out(S) cout<<(S)<<endl;
#define REP(i,b) for(size_t i=0;i<(b);i++)
#define rREP(i,b) for(int i=(b)-1;i>=0;i--)
#define FOR(i,a,b) for(size_t i=(a);i<(b);i++)
#define rFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define Foreach(item,collection) for(auto item:collection)
#define mod(i) ((i) % (ll)(1e9 + 7))
ll modpow(ll i, ll j) { ll tmp = 1; while (j) { if (j % 2)tmp = mod(tmp*i); i = mod(i*i); j /= 2; }return tmp; }
#define divmod(a,b) (mod(a * modpow((ll)b,(ll)(1e9 + 5))))
#define Yes out("Yes")
#define No out("No")
#define NO out("NO")
#define YES out("YES")
#define INF 1e10;
#define ShowAll(collection) for(auto i:collection){out(i);}
#define IfOut(condition,text) if((condition)){out(text);return 0;}
#define IfeOut(condition,itext,etext) if(condition){out(itext);return 0;}else{out(etext);return 0;}
#define Select(collection,condition,result) Foreach(i,collection){result+=condition;}
#define GetAuto(_N,vect) {cin>>_N;vect.resize(_N);REP(i,_N){cin>>vect[i];}}
#define beginend(vec) (vec).begin(),(vec).end()
#define pb(item) push_back(item)
#define removeAll(vec,deleg) auto itr=remove_if(beginend(vec),deleg);vec.erase(itr,vec.end());
void removeAt(string& s, int index) { s.erase(index, 1); }
template<typename T> void removeAt(vector<T>& v, int index) { v.erase(v.begin() + index); }
ll manhattanDistance(ll x1, ll y1, ll x2, ll y2) { return (abs(x2 - x1) + abs(y2 - y1)); }
vector<ll> sieveOfEratosthenes(int max) {ll prime;double sqrtmax = sqrt(max);vector<ll> primeVec, searchVec;FOR(i, 2, max + 1) searchVec.push_back(i);do{prime = searchVec[0];primeVec.push_back(prime);auto itr = remove_if(beginend(searchVec), [=](ll x)->bool {return x%prime == 0; });searchVec.erase(itr, searchVec.end());} while (prime < sqrtmax);primeVec.reserve(primeVec.size() + searchVec.size());primeVec.insert(primeVec.end(), beginend(searchVec));return primeVec;}
bool isPrime(ll x) {if (x == 2) return true;if (x < 2 || x % 2 == 0) return false;ll i = 3;while (i <= sqrt(x)) {if (x%i == 0) return false;i += 2;}return true;}
map<char, int> si;
ll decode(string x) {
ll rt = 0;
int coeff = 0;
Foreach(i, x) {
if (i == 'm' || i == 'c' || i == 'x' || i == 'i') {
rt += (coeff ? coeff : 1)*si[i];
coeff = 0;
}
else {
coeff = coeff * 10 + (i - '0');
}
}
return rt;
}
vpci bbs;
string encode(ll x) {
string rt = "";
Foreach(i, bbs) {
int pre = x / i.second;
x %= i.second;
if (pre == 1) {
rt = rt + i.first;
}
else if (pre != 0) {
rt += to_string(pre) + i.first;
}
}
return rt;
}
void solve() {
string a, b;
cin >> a >> b;
ll la = decode(a), lb = decode(b);
la += lb;
string ans=encode(la);
out(ans);
}
int main() {
int n;
cin >> n;
si['m'] = 1000;
si['c'] = 100;
si['x'] = 10;
si['i'] = 1;
bbs.pb(pci('m', 1000));
bbs.pb(pci('c', 100));
bbs.pb(pci('x', 10));
bbs.pb(pci('i', 1));
REP(i, n) {
solve();
}
return 0;
} | 1 | 96,062,863 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int total = 0;
for( int i = 0; i < N; ++i ){
int l = 0, r = 0;
cin >> l >> r;
r -= l;
total += r + 1;
}
cout << total;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int n;
cin>>n;
int ans=0;
rep(i,n){
int l,r;
cin>>l>>r;
ans+=r-l+1;
}
cout<<ans<<endl;
} | 1 | 20,313,855 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
double x1, x2;
double y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%08f\n", sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double a_square = (x2 - x1) * (x2 - x1);
double b_square = (y2 - y1) * (y2 - y1);
double c_square = a_square + b_square;
double ans = sqrt(c_square);
printf("%.5f\n", ans);
return 0;
} | 1 | 92,836,480 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector <int> C(N), S(N), F(N);
for (int i = 1; i < N; i++) {
cin >> C[i] >> S[i] >> F[i];
}
for (int stpos = 1; stpos < N; stpos++) {
int now = 0;
for (int i = stpos; i < N; i++) {
if (now < S[i]) now = S[i];
if ((now % F[i]) != 0) {
now = (now+F[i])/F[i] * F[i];
}
now += C[i];
}
cout << now << endl;
}
cout << 0 << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r)
{
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
template <typename T, T N>
class UnionFind {
T parent_[N];
T rank_[N];
T size_[N];
public:
UnionFind();
T Root(T idx);
bool IsSame(T x, T y);
void Unite(T x, T y);
T GetSize(T idx);
};
template <typename T, T N>
UnionFind<T, N>::UnionFind()
{
for (T i = 0; i < N; i++) {
parent_[i] = i;
rank_[i] = 0;
size_[i] = 1;
}
}
template <typename T, T N>
T UnionFind<T, N>::Root(T idx)
{
return parent_[idx] == idx ? idx : parent_[idx] = Root(parent_[idx]);
}
template <typename T, T N>
bool UnionFind<T, N>::IsSame(T x, T y)
{
return Root(x) == Root(y);
}
template <typename T, T N>
void UnionFind<T, N>::Unite(T x, T y)
{
x = Root(x);
y = Root(y);
if (x == y) {
return;
}
if (rank_[x] < rank_[y]) {
parent_[x] = y;
size_[y] += size_[x];
} else {
parent_[y] = x;
size_[x] += size_[y];
if (rank_[x] == rank_[y]) {
rank_[x]++;
}
}
}
template <typename T, T N>
T UnionFind<T, N>::GetSize(T idx)
{
return size_[Root(idx)];
}
long long pow_mod(long long n, long long p, long long m)
{
if (p == 0) {
return 1;
}
if (p % 2 == 0) {
long long t = pow_mod(n, p / 2, m);
return t * t % m;
}
return n * pow_mod(n, p - 1, m) % mod;
}
long long nCr_mod(long long n, long long r)
{
long long x = 1;
for (long long i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
long long a = 1;
for (long long i = 1; i <= r; i++) {
a *= i;
a %= mod;
}
long long y = pow_mod(a, mod - 2, mod) % mod;
return x * y % mod;
}
bool is_prime(long long n)
{
if (n == 1) {
return false;
}
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
bool is_leap(long long y)
{
return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}
void next_day(long long& y, long long& m, long long& d)
{
d++;
if (d > last_days[m - 1] + (m == 2 && is_leap(y) ? 1 : 0)) {
d = 1;
m++;
}
if (m > 12) {
y++;
m = 1;
}
}
long long fib(long long n)
{
long long a = 0, b = 1;
for (int i = 0; i < n; i++) {
long long t = a;
a = b;
b = a + t;
}
return a;
}
template <typename T>
std::vector<size_t> calculate_ranks(const std::vector<T>& v)
{
std::vector<T> sorted = v;
std::sort(sorted.begin(), sorted.end());
std::map<T, long long> m;
for (auto i = 0LU; i < v.size(); i++) {
m.insert(std::make_pair(sorted[i], i));
}
std::vector<size_t> rank(v.size());
for (auto i = 0LU; i < v.size(); i++) {
rank[i] = m.find(v[i])->second + 1;
}
return rank;
}
int main()
{
long long n;
std::cin >> n;
std::vector<long long> c(n - 1), s(n - 1), f(n - 1);
for (int i = 0; i < n - 1; i++) {
std::cin >> c[i] >> s[i] >> f[i];
}
for (int i = 0; i < n - 1; i++) {
long long time = s[i] + c[i];
for (int j = i + 1; j < n - 1; j++) {
if (time < s[j]) {
time = s[j] + c[j];
} else if (time % f[j] == 0) {
time += c[j];
} else {
time += f[j] - time % f[j] + c[j];
}
}
std::cout << time << std::endl;
}
std::cout << 0 << std::endl;
} | 1 | 50,208,876 |
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define sz(a) (ll)a.size()
#define endl "\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b))
#define all(vec) vec.begin(),vec.end()
#define ms(a, b) memset(a,b,sizeof(a))
#define TEST_CASE(t) for(int zz=1;zz<=t;zz++)
#define PRINT_CASE printf("Case %d: ",zz)
#define fii freopen("input.txt","r",stdin);
#define foo freopen("output.txt","w",stdout);
#define FAST ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
const ll M = 1e9+7;
const ll mxn = 1e5+7;
int main()
{
ll i,j,k,a,b,c,d,n,m,t,x,y,z,u,v;
cin>>n>>m;
vector<ll>vec(n);
for(auto &a:vec)
{
cin>>a;
}
sort(all(vec));
ll sum=0;
for(i=0;i<m;i++)
{
sum+=vec[i];
}
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(void){
int n, k, ans=0;
cin >> n >> k;
vector<int> p(n);
rep(i,n) cin >> p[i];
sort(p.begin(),p.end());
rep(i,k) ans += p[i];
cout << ans << endl;
return 0;
} | 1 | 1,027,541 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll a, b; cin >> a >> b;
bool flag = 1;
rep(i, a) {
char c; cin >> c;
ll tmp = c - '0';
if (!(0<=tmp && tmp<=9)) flag = 0;
}
char c; cin >> c;
if (c != '-') flag = 0;
rep(i, b) {
cin >> c;
ll tmp = c - '0';
if (!(0<=tmp && tmp<=9)) flag = 0;
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <stdio.h>
int main(){
int a,b;
char str[15];
scanf("%d %d %s" , &a, &b, &str);
for(int i = 0 ; i < a ; i++){
if(str[i] != '-'){
continue;
}
else{
printf("No");
return 0;
}
}
for(int i = a+1 ; i <= a+b ; i++){
if(str[i] != '-'){
continue;
}
else{
printf("No");
return 0;
}
}
if(str[a] == '-'){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | 1 | 1,062,767 |
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
int N, M; pair<int, int> T[100100];
int main()
{
scanf ("%d %d", &N, &M);
for (int i = 0; i < N; i++) scanf ("%d %d", &T[i].first, &T[i].second);
sort(T, T + N);
priority_queue<int> Q;
long long ans = 0;
for (int i = 1, j = 0; i <= M; i++){
while (j < N && T[j].first <= i){
Q.push(T[j].second);
j++;
}
if (!Q.empty()){
ans += Q.top();
Q.pop();
}
}
printf ("%lld\n", ans);
return 0;
} | #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;
priority_queue<int> q;
vector<vector<int>> v(k);
rep(i,n){
int x,y;
cin >> x >> y;
int z=k-x;
if(z>=0) v[z].push_back(y);
}
ll ans=0;
for(int i=k-1;i>=0;i--){
for(int x:v[i]){
q.push(x);
}
if(!q.empty()){
int y=q.top();q.pop();
ans+=y;
}
}
cout << ans << endl;
} | 1 | 85,962,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string YES = "Yes";
const string NO = "No";
int main()
{
ll A;
scanf("%lld",&A);
ll B;
scanf("%lld",&B);
ll C;
scanf("%lld",&C);
if (A==B&&B==C) cout << YES << endl;
else cout << NO << endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
using namespace std;
int main () {
int a , b , c;
scanf ( "%d%d%d" , &a , &b , &c );
if ( a == b && b == c ) printf ( "Yes\n" );
else printf ( "No\n" );
return 0;
} | 1 | 6,195,100 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
signed main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
vector<int> s(n, 0);
for (int i = 0; i < k; i++) {
cin >> d.at(i);
for (int j = 0; j < d.at(i); j++) {
vector<int> a(d.at(i));
cin >> a.at(j);
s.at(a.at(j) - 1) = 1;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += s.at(i);
}
cout << n - ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll n,k;cin>>n>>k;
unordered_map<ll,ll> mp;
for(ll i=0;i<k;i++){
ll d;cin>>d;
for(ll j=0;j<d;j++){
ll x;cin>>x;
mp[x]=i;
}
}
cout<<n-mp.size()<<endl;
return 0;
} | 1 | 96,000,585 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int m;
int coin[6] = {500, 100, 50, 10, 5, 1};
while (cin >> m, m){
int cnt = 0;
int change = 1000 - m;
for (int i = 0; i < 6; i++){
cnt += change / coin[i];
change %= coin[i];
}
cout << cnt << endl;
}
return (0);
} | #include<iostream>
using namespace std;
int main(){
int n,count;
while(cin >> n, n){
count = 0;
n = 1000 - n;
if(n >= 500){
count++;
n -= 500;
}
while(n >= 100){
count++;
n -= 100;
}
while(n >= 50){
count++;
n -= 50;
}
while(n >= 10){
count++;
n -= 10;
}
while(n >= 5){
count++;
n -= 5;
}
cout << n+count << endl;
}
} | 1 | 68,956,045 |
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const double eps = 1e-8;
#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<29)
#define INFLL (1L<<62)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(0);
int N;
while (cin >> N, N) {
vector<int> A(N);
rep(i, N) cin >> A[i];
int min_abs = INF;
rep(i, N) rep(j, N) {
if (i == j) continue;
min_abs = min(abs(A[i] - A[j]), min_abs);
}
cout << min_abs << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
for( ;; ) {
int n;
cin >> n;
if( n == 0 ) { break; }
vector<int> a( n );
for( auto& v: a ) { cin >> v; }
int result = 1000000;
for( int i = 0; i < n; ++i ) {
for( int j = i+1; j < n; ++j ) {
result = min( result, abs( a.at(i) - a.at(j) ) );
}
}
cout << result << endl;
}
} | 1 | 95,466,630 |
#include<iostream>
#include<string>
using namespace std;
int a[5000000];
int first=0,last=0;
int n,m,q;
string w;
void insert(){
a[last]=n;
last++;
}
void deleteFirst(){
last--;
}
void deleteLast(){
first++;
}
void _delete(){
for(int k=last-1;k>=first;k--){
if(a[k]==n){
m=k;
for(int k=m;k<last-1;k++){
a[k]=a[k+1];
}
last--;
break;
}
}
}
void owata(){
for(int k=last-1;k>=first;k--){
cout<<a[k];
if(k==first){
cout<<endl;
}
else{
cout<<' ';
}
}
}
void hantei(){
if(w=="insert"){
cin>>n;
insert();
}
if(w=="delete"){
cin>>n;
_delete();
}
if(w=="deleteFirst"){
deleteFirst();
}
if(w=="deleteLast"){
deleteLast();
}
}
int main(){
cin>>q;
for(int i=0;i<q;i++){
cin>>w;
hantei();
}
owata();
return 0;
} | #include <iostream>
#include <algorithm>
#include <list>
#include <string>
using namespace std;
int main(){
list<int> lst;
int N;
cin >> N;
string command;
int num;
for(int i=0; i<N; i++){
cin >> command;
if( command == "insert" ){
cin >> num;
lst.push_front(num);
}else if( command == "delete"){
cin >> num;
for( auto itr = lst.begin(); itr != lst.end(); itr++){
if(*itr == num){
lst.erase(itr);
break;
}
}
}else if( command == "deleteLast"){
lst.pop_back();
}else if( command == "deleteFirst"){
lst.pop_front();
}
}
for(auto itr = lst.begin(); itr != lst.end(); itr++){
if(itr == lst.begin()){
cout << *itr;
}else{
cout << " " << *itr;
}
}
cout << endl;
return 0;
} | 1 | 57,011,410 |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(){
vector<long long> inv(100002);
vector<long long> fact(100002);
vector<long long> factInv(100002);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
for(int i=2;i<=100001;i++){
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
fact[i] = fact[i-1] * i % MOD;
factInv[i] = factInv[i-1] * inv[i] % MOD;
}
auto comb = [&](int n, int r){
if(n < r) return 0LL;
return fact[n] * factInv[n-r] % MOD * factInv[r] % MOD;
};
int N;
while(cin >> N){
vector<int> a(N+1);
vector<int> c(N+1, 0);
int d = 0;
for(auto& t : a){
cin >> t;
c[t]++;
if(c[t] == 2) d = t;
}
int cnt = 0, one = 0;
for(const auto& t : a){
if(t == d) ++one;
else if(one%2 == 0) ++cnt;
}
cout << N << endl;
for(int i=2;i<=N+1;i++){
long long all = comb(N+1, i);
long long sub = comb(cnt, i-1);
cout << (all + MOD - sub) % MOD << endl;
}
}
} | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
int inv[MAX_N],fac[MAX_N],finv[MAX_N];
void make()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i=2;i<MAX_N;i++){
inv[i] = MOD - (ll)inv[MOD%i] * (MOD/i) % MOD;
fac[i] = (ll)fac[i-1] * i % MOD;
finv[i] = (ll)finv[i-1] * inv[i] % MOD;
}
}
int comb(int a,int b)
{
if(a<b || b<0){
return 0;
}
return (ll)fac[a] * ((ll)finv[b] * finv[a-b] % MOD) % MOD;
}
int add(int x,int y)
{
return (x+y)%MOD;
}
int sub(int x,int y)
{
return (x+MOD-y)%MOD;
}
int mul(int x,int y)
{
return (ll)x*y%MOD;
}
int mod_pow(int a, int n, int mod){
int ret = 1;
while(n){
if(n & 1) ret = (ll)ret * a % mod;
a = (ll)a * a % mod;
n >>= 1;
}
return ret;
}
template<int mod, int primitive_root>
class NTT {
public:
int get_mod() const { return mod; }
void _ntt(vector<ll>& a, int sign) {
const int n = len(a);
const int g = 3;
int h = mod_pow(g, (mod - 1) / n, mod);
if (sign == -1) h = mod_pow(h, mod-2, mod);
int i = 0;
for (int j = 1; j < n - 1; ++j) {
for (int k = n >> 1; k >(i ^= k); k >>= 1);
if (j < i) swap(a[i], a[j]);
}
for (int m = 1; m < n; m *= 2) {
const int m2 = 2 * m;
const ll base = mod_pow(h, n / m2, mod);
ll w = 1;
rep(x, m) {
for (int s = x; s < n; s += m2) {
ll u = a[s];
ll d = a[s + m] * w % mod;
a[s] = u + d;
if (a[s] >= mod) a[s] -= mod;
a[s + m] = u - d;
if (a[s + m] < 0) a[s + m] += mod;
}
w = w * base % mod;
}
}
for (auto& x : a) if (x < 0) x += mod;
}
void ntt(vector<ll>& input) {
_ntt(input, 1);
}
void intt(vector<ll>& input) {
_ntt(input, -1);
const int n_inv = mod_pow(len(input), mod-2, mod);
for (auto& x : input) x = x * n_inv % mod;
}
void convolution(const vector<ll>& a, const vector<ll>& b, vector<ll>& _a, vector<ll>& _b){
int ntt_size = 1;
while (ntt_size < len(a) + len(b)) ntt_size *= 2;
_a = a, _b = b;
_a.resize(ntt_size); _b.resize(ntt_size);
ntt(_a);
ntt(_b);
rep(i, ntt_size){
_a[i] = (ll)_a[i] * _b[i] % mod;
}
intt(_a);
}
};
ll garner(vector<P> mr, int mod){
mr.emplace_back(mod, 0);
vector<ll> coffs(len(mr), 1);
vector<ll> constants(len(mr), 0);
rep(i, len(mr) - 1){
ll v = (mr[i].second - constants[i]) * mod_pow(coffs[i], mr[i].first-2, mr[i].first) % mr[i].first;
if (v < 0) v += mr[i].first;
for (int j = i + 1; j < len(mr); j++) {
(constants[j] += coffs[j] * v) %= mr[j].first;
(coffs[j] *= mr[i].first) %= mr[j].first;
}
}
return constants[len(mr) - 1];
}
typedef NTT<167772161, 3> NTT_1;
typedef NTT<469762049, 3> NTT_2;
typedef NTT<1224736769, 3> NTT_3;
void fast_int32mod_convolution(vector<ll>& a, vector<ll>& b,vector<ll>& res){
NTT_1 ntt1; NTT_2 ntt2; NTT_3 ntt3;
vector<ll> x,_x,y,_y,z,_z;
ntt1.convolution(a, b, x, _x);
ntt2.convolution(a, b, y, _y);
ntt3.convolution(a, b, z, _z);
const int m1 = ntt1.get_mod(), m2 = ntt2.get_mod(), m3 = ntt3.get_mod();
const int m1_inv_m2 = mod_pow(m1, m2-2, m2);
const int m12_inv_m3 = mod_pow((ll)m1 * m2 % m3, m3-2, m3);
const int m12_mod = (ll)m1 * m2 % MOD;
res.resize(len(x));
rep(i, len(x)){
ll v1 = (ll)(y[i] - x[i]) * m1_inv_m2 % m2;
if (v1 < 0) v1 += m2;
ll v2 = (ll)(z[i] - (x[i] + (ll)m1 * v1) % m3) * m12_inv_m3 % m3;
if (v2 < 0) v2 += m3;
ll constants3 = (ll)(x[i] + (ll)m1 * v1 + (ll)m12_mod * v2) % MOD;
if (constants3 < 0) constants3 += MOD;
res[i] = constants3;
}
}
int cnt[MAX_N];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n);
rep(i,n+1){
cin >> a[i];
cnt[a[i]]++;
}
int l = -1, r = -1;
rep(i,n+1){
if(cnt[a[i]] == 2){
if(l < 0){
l = i;
}else{
r = i;
}
}
}
make();
vl x(l+1),y(n-r+1),res;
rep(i,len(x)){
x[i] = comb(l,i);
}
rep(i,len(y)){
y[i] = comb(n-r,i);
}
fast_int32mod_convolution(x,y,res);
srep(k,1,n+2){
int ans = add(add(comb(n-1,k),mul(2,comb(n-1,k-1))),comb(n-1,k-2));
cout << sub(ans,(k-1<len(res))?(res[k-1]):(0)) << "\n";
}
return 0;
} | 1 | 71,948,523 |
#include <functional>
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <cstring>
#include <math.h>
using namespace std;
int main() {
long long a,b,c;
cin >> a >> b >> c;
long long ans = 0;
if (a < c){
c = c - a;
a = 0;
if (b < c){
b = 0;
cout << a << " "<< b << endl;
}else {
b = b - c;
cout << a << " "<< b << endl;
}
}else {
a = a - c;
cout << a << " "<< b << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
long long int a,b,k,m,n;
cin>>a>>b>>k;
if (a>=k)
{
m=a-k;
n=b;
cout<<m<<" "<<n<<endl;
}
else if(a+b<=k)
{
m=0;
n=0;
cout<<m<<" "<<n<<endl;
}
else if(a<=k && a+b>=k)
{m=k-a;
n=b-m;
m=0;
cout<<m<<" "<<n<<endl;
}
return 0;
} | 1 | 71,218,681 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
long long tv = -100;
long long fv = INF;
while (fv - tv > 1){
long long mid = (tv + fv) / 2;
vector<long long> b(N);
for (int i = 0; i < N; i++){
b[i] = a[i] + mid;
}
long long cnt = 0;
for (int i = 0; i < N; i++){
cnt += b[i] / (N + 1) - 1;
}
if (cnt >= mid){
tv = mid;
} else {
fv = mid;
}
}
long long ans = tv;
long long curr = tv;
while (1){
vector<long long> b(N);
for (int i = 0; i < N; i++){
b[i] = a[i] + curr;
}
long long cnt = 0;
for (int i = 0; i < N; i++){
cnt += b[i] / (N + 1);
}
ans = curr - 1;
if (cnt < curr && curr > 0 || curr == tv + 1000000){
break;
}
curr++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
ll arr[n];
for(int i = 0;i < n;i++)
cin >> arr[i];
sort(arr, arr + n);
if(arr[n - 1] <= n - 1){
cout << 0;
return 0;
}
ll k = 0;
ll res = 0;
for(int i = n - 1;i >= 1;i--){
ll op = (arr[i] - arr[i - 1]) / (n + 1);
res += op * (n - i);
for(int j = i;j < n;j++)
arr[j] -= op * (i + 1);
for(int j = 0;j < i;j++)
arr[j] += op * (n - i);
}
if(arr[0] >= n){
ll op = (arr[0] - (n - 1));
res += n * op;
for(int i = 0;i < n;i++)
arr[i] -= op;
}
while(arr[n - 1] >= n){
arr[n - 1] -= n;
for(int j = 0;j < n - 1;j++)
arr[j]++;
for(int j = n - 1;j >= 1 && arr[j] < arr[j - 1];j--)
swap(arr[j], arr[j - 1]);
res++;
}
cout << res;
} | 1 | 66,694,619 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
ll lo = s.size()-1;
ll ans = 0;
ll w = 0;
for(int i = 0; i<lo+1;i++){
if(s[i]=='W'){
ans+=i-w;
w++;
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
ll ans = 0;
ll w = 0;
for (ll i = s.size() - 1;i >= 0;--i) {
if (s[i] == 'W')++w;
else ans += w;
}
cout << ans << endl;
} | 1 | 8,880,820 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int a,b,c;
cin>>a>>b>>c;
map<int,int> cnt;
cnt[a]++;cnt[b]++;cnt[c]++;
cout<<cnt.size()<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
set <int>d{a,b,c};
cout << d.size() ;
return 0;
} | 1 | 88,413,551 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
for (int i=0; i<10; i++){
if (111*i<N&&N<=111*(i+1)){
cout<<111*(i+1)<<endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int x[] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int main()
{
int n;
cin >> n;
for(int i = 0; i < 9; i++){
if(x[i] >= n)
return cout << x[i] << '\n', 0;
}
return 0;
} | 1 | 1,795,425 |