code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int a[5],i,j;
for(i=0;i<3;i++){
cin >> a[i];
}
int ans=(1<<29);
for(i=0;i<3;i++){
for(j=i+1;j<3;j++){
ans=min(ans,a[i]+a[j]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
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 (b < a) { a = b; return 1; } return 0; }
void func(long long N, std::vector<long long> A){
SORT(A);
lli start = 0;
lli nowSize = A[0];
lli now = 1;
while(now<N){
if(nowSize*2 < A[now]){
start = now;
}
nowSize += A[now];
now++;
}
cout<<N-start<<endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
func(N, std::move(A));
return 0;
} | 0 | 13,942,791 |
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
if (n == k) { cout << "0\n"; return 0; }
int h[n]; for (int i = 0; i < n; i++) cin >> h[i];
long long dp[n+1][n+1];
const long long INF = 1LL<<60;
long long ans = INF;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) dp[i][0] = INF;
for (int i = 1; i <= n; i++) {
dp[i][1] = h[i-1];
for (int j = 2; j <= n; j++) {
dp[i][j] = INF;
for (int x = 1; x < i; x++)
dp[i][j] = min(dp[i][j], dp[x][j-1] + max(0, h[i-1]-h[x-1]));
if (j >= n-k) ans = min(ans, dp[i][j]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(){
ll n,k;
ll v[56];
int i;
ll sum = 0;
int p = 0;
int m = 0;
scanf("%lld %lld", &n, &k);
for(i = 0;i < n;i++){
scanf("%lld", &v[i]);
}
ll limit = min(n,k);
ll a,b;
vector <ll> get;
ll mx = 0;
for(a = 0;a <= limit;a++){
for(b = 0;b <= limit;b++){
if(a + b > limit) break;
if(!(get.empty())) get.clear();
sum = 0;
for(i = 0;i < a;i++){
get.push_back(v[i]);
}
for(i = 0;i < b;i++){
get.push_back(v[n - 1 - i]);
}
sort(get.begin(),get.end());
ll t = get.size();
ll limit2 = min(t,k - a - b);
for(i = 0;i < limit2;i++){
if(get[i] < 0) get[i] = 0;
else break;
}
for(i = 0;i < get.size();i++){
sum += get[i];
}
if(mx < sum) mx = sum;
}
}
printf("%lld\n", mx);
return 0;
} | 0 | 99,760,626 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) reverse((a).begin(),(a).end())
#define REP(i, n) for(int i = 0; i < n; i++)
const int MOD = 1e9+7;
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<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; }
int main(){
string s;
cin>>s;
vector<char>a(s.length());
for(int i=0;i<s.length();i++){
a[i]=s[i];
}
int right=s.length()-1;
int left=0;
int count=0;
while(right-left>=1){
if(a[right]==a[left]){
right--;
left++;
}else if(a[right]=='x'){
right--;
count++;
}else if(a[left]=='x'){
left++;
count++;
}else break;
}
if(right-left>=1) cout<<"-1"<<endl;
else cout<<count<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> v(n, vector<int>(m+1));
for(int i=0; i<n; i++) for(int j=0; j<m+1; j++) cin >> v[i][j];
int ans = 10000000;
vector<int> data(m, 0);
for(int bit=0; bit<(1<<n); bit++) {
int sum = 0;
for(int i=0; i<n; i++) {
if(bit & (1<<i)) {
sum += v[i][0];
for(int j=0; j<m; j++) {
data[j] += v[i][j+1];
}
}
}
bool check = true;
for(int i=0; i<m; i++) if(data[i]<x) check = false;
if(check && sum<ans) ans = sum;
for(int i=0; i<m; i++) data[i] = 0;
}
if(ans==10000000) cout << -1 << endl;
else cout << ans << endl;
return 0;
} | 0 | 9,021,068 |
#include <bits/stdc++.h>
using namespace std;
#define R (long long)(1e9 + 7)
#define INF (long long)(1e16L + 5)
#define ll long long
#define grid vector<vector<ll>>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, w, m;
cin >> h >> w >> m;
vector<pair<int, int>> p(m);
for(pair<int, int>& x : p)
cin >> x.first >> x.second;
map<int, vector<int>> x, y;
for(auto point : p)
{
x[point.first].push_back(point.second);
y[point.second].push_back(point.first);
}
int ans = 0;
for(auto point : p)
{
ans = max(ans, (int)x[point.first].size() + (int)y[point.second].size() - 1);
}
int mx_x = 0;
for(auto e : x)
{
mx_x = max(mx_x, (int)(e.second.size()));
}
map<int, int> ys;
int cnt = 0;
for(auto e : x)
{
if(e.second.size() == mx_x)
{
for(auto y : e.second)
ys[y]++;
cnt++;
}
}
for(int i = 1; i <= max(w, h); i++)
{
if(ys[i] != cnt)
{
ans = max(ans, (int)y[i].size() + mx_x);
}
}
cout << ans << '\n';
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int a,b;
string s;
cin >> a >> b >> s;
bool f = true;
if (s[a] == '-') f = true;
else f = false;
for (int i = 0;i < s.size();i++){
if (i != a){
if (s[i] == '-') f = false;
}
}
if (f) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 26,288,241 |
#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 >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
rep(i,n-m+1){
rep(j,n-m+1){
bool x = true;
rep(k,m){
if(b.at(k) != a.at(i+k).substr(j,m)){
x = false;
}
}
if(x){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main(){
string s;
getline(cin,s);
int i;
for(i=0;i<s.length();i++){
if(s.at(i)>='a'&&s.at(i)<='z'){
cout << char(s.at(i)+'A'-'a');
}
else if(s.at(i)>='A' &&s.at(i)<='Z'){
cout << char(s.at(i)+'a'-'A');
}
else cout << s.at(i);
}
cout << endl;
return 0;
} | 0 | 42,741,759 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin>>n;
vector<int>a(n);
vector<int>ans(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
ans[a[i]-1]=i+1;
}
for(int i=0;i<n;i++)cout<<ans[i]<<" ";
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
int count=0;
cin>>n;
char ar[100000];
for(int i=0; i<n; i++)
{
cin>>ar[i];
}
for(int i=0; i<n; i++)
{
if(ar[i]==ar[i+1])
{
continue;
}
count++;
}
cout<<count;
} | 0 | 20,429,199 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '1')
cout << 9;
else if (s[i] == '9')
cout << 1;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
int paSize = printArray.size();
for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
if (between != '\n') {cerr << endl;}
}
int n;
map<char, vector<char>> mp = {
{'1', {'.', ',', '!', '?', ' '}},
{'2', {'a', 'b', 'c'}},
{'3', {'d', 'e', 'f'}},
{'4', {'g', 'h', 'i'}},
{'5', {'j', 'k', 'l'}},
{'6', {'m', 'n', 'o'}},
{'7', {'p', 'q', 'r', 's'}},
{'8', {'t', 'u', 'v'}},
{'9', {'w', 'x', 'y', 'z'}},
};
void solve() {
debug(mp['1'][0])
debug(mp['1'][1])
debug(mp['1'][2])
exit(0);
}
int main() {
cin >> n;
while (n--) {
string s;
cin >> s;
string ans = "";
int size = s.size();
for (int i = 0; i < size; i++) {
if (s[i] == '0') continue;
int cnt = 0;
int idx = i;
repp (j, i, size) {
if (s[i] != s[j]) break;
idx = j;
cnt++;
}
int tSize = mp[s[i]].size();
cnt--;
if (cnt >= 0) {
char c = mp[s[i]][cnt % tSize];
ans += c;
}
i = idx;
}
cout << ans << endl;
}
return 0;
} | 0 | 2,180,441 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define maxn 200005
LL s[maxn],ans;
map<int,int>mp;
int main(){
int n,x,k;scanf("%d%d",&n,&k);
mp[0]++;
for(int i=1;i<=n;i++){
scanf("%d",&x),s[i]=s[i-1]+x;
if(i>=k)mp[(s[i-k]-i+k)%k]--;
ans+=mp[(s[i]-i)%k]++;
}
printf("%lld",ans);
return 0;
} | #include <stdio.h>
#include<stdlib.h>
#define MAX 2000000
#define VMAX 10000
using namespace std;
int main()
{
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = (unsigned short *)malloc(sizeof(unsigned short) * n + 1);
B = (unsigned short *)malloc(sizeof(unsigned short) * n + 1);
for(i = 0; i < VMAX; i++) C[i] = 0;
for(i = 0; i < n; i++) {
scanf("%hu", &A[i+1]);
C[A[i+1]]++;
}
for(i = 1; i <= VMAX; i++) {
C[i] = C[i] + C[i-1];
}
for(i = 1; i <= n; i++) {
B[C[A[i]]] = A[i];
C[A[i]]--;
}
for(int i = 1; i <= n; i++) {
printf("%d", B[i]);
if(i != n) printf(" ");
}
printf("\n");
return 0;
} | 0 | 67,050,659 |
#include "iostream"
#include "string"
#include <stack>
#include <queue>
#include <sstream>
#include <cstring>
using namespace std;
void A()
{
stack<int> stack;
string str;
while (cin >> str)
{
if (str == "+" || str == "-" || str == "*")
{
int b = stack.top();
stack.pop();
int a = stack.top();
stack.pop();
int c;
if (str == "+")
{
c = a + b;
}
else if (str == "-")
{
c = a - b;
}
else
{
c = a * b;
}
stack.push(c);
}
else
{
int num = stoi(str);
stack.push(num);
}
}
cout << stack.top() << endl;
}
void B()
{
queue<string> name;
queue<int> time;
int spendTime = 0;
int N;
int Q;
cin >> N;
cin >> Q;
cin.ignore();
string line;
string s;
for (int i = 0; i < N;i++)
{
getline(cin, line);
stringstream ss(line);
ss >> s;
name.push(s);
ss >> s;
time.push(stoi(s));
}
while (!time.empty())
{
int left = time.front();
time.pop();
string n = name.front();
name.pop();
if (Q >= left)
{
spendTime += left;
cout << n << " " << spendTime<<endl;
}
else
{
spendTime += Q;
time.push(left - Q);
name.push(n);
}
}
}
struct Cell
{
int data;
Cell *prev;
Cell *next;
};
Cell *start;
void insert(int x)
{
Cell *c = (Cell *)malloc(sizeof(Cell));
c->data = x;
c->prev = start;
c->next = start->next;
start->next->prev = c;
start->next = c;
}
void delete_x(int x)
{
Cell *c = start->next;
while (c != start && c->data != x)
{
c = c->next;
}
if (c == start)return;
c->prev->next = c->next;
c->next->prev = c->prev;
free(c);
}
void deleteFirst()
{
Cell *c = start->next;
if (c == start)return;
c->prev->next = c->next;
c->next->prev = c->prev;
free(c);
}
void deleteLast()
{
Cell *c = start->prev;
if (c == start)return;
c->prev->next = start;
start->prev = c->prev;
free(c);
}
void print()
{
Cell *c = start->next;
int i = 0;
while (true)
{
if (c == start)break;
if (i != 0)cout << " " << flush;
cout << c->data << flush;
i++;
c = c->next;
}
cout << endl;
}
void C()
{
int N;
int x = 0;
scanf("%d",&N);
start = (Cell *)malloc(sizeof(Cell));
start->next = start;
start->prev = start;
char command[20];
for (int i = 0; i < N;i++)
{
scanf("%s",command);
if (command[0] == 'i')
{
scanf("%d", &x);
insert(x);
}
else if (strlen(command)> 6)
{
if (command[6]== 'F')
{
deleteFirst();
}
else if (command[6] == 'L')
{
deleteLast();
}
}
else if (command[0] == 'd')
{
scanf("%d", &x);
delete_x(x);
}
}
print();
}
void D()
{
}
int main()
{
C();
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int n;
cin>>n;
vector<ll>a(n);
for(int i=0;i<n;i++)cin>>a[i];
ll ans = 0;
while(true){
bool flag = true;
int j=0;
for(int i=0;i<n;i++){
if(a[i]>=n){
flag=false;
ll num = a[i]/n;
for(int j=0;j<n;j++){
if(j==i)a[i]-=num*n;
else a[j]+=num;
}
ans+=num;
}
}
if(flag)break;
}
cout<<ans<<endl;
return 0;
} | 0 | 85,820,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
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; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2,t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
ll len = 0;
vector<ll> vec(2e6,0);
void insert(ll k){
vec[len] = k;
ll t1,t2;
t1 = len;
while(t1 != 0){
t2 = (t1-1)/2;
if(vec[t2] < vec[t1]){
swap(vec[t2],vec[t1]);
}else{
break;
}
t1 = t2;
}
len++;
}
ll extract(){
ll ret = vec[0];
ll piv = 0;
ll t1,t2;
while(1){
t1 = piv*2+1;
t2 = piv*2+2;
if(t1 >= len){
break;
}else if(t2 == len){
vec[piv] = vec[t1];
piv = t1;
break;
}else{
if(vec[t1] < vec[t2]){
vec[piv] = vec[t2];
piv = t2;
}else{
vec[piv] = vec[t1];
piv = t1;
}
}
}
vec[piv] = vec[len-1];
t1 = piv;
while(t1 != 0){
t2 = (t1-1)/2;
if(vec[t2] < vec[t1]){
swap(vec[t2],vec[t1]);
}else{
break;
}
t1 = t2;
}
len--;
return ret;
}
int main(){
string str;
ll ret;
while(1){
cin >> str;
if(str == "insert"){
cin >> t1;
insert(t1);
}else if(str == "extract"){
ret = extract();
cout << ret << endl;
}else if(str == "end"){
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
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;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(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 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;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n,m;
cin>>n>>m;
vector<ll> a(n),b(n);
rep(i,n) cin>>a[i]>>b[i],a[i]--;
vector<ll> v[100010];
rep(i,100010) v[i].push_back(0);
rep(i,n) v[a[i]].push_back(b[i]);
priority_queue<ll> que;
ll ans=0;
rep(i,m){
rep(j,v[i].size()) que.push(v[i][j]);
ans+=que.top();que.pop();
}
cout<<ans<<endl;
} | 0 | 28,629,511 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
int main()
{
int a , b , c;
cin >> a >> b >> c;
if(c >= a && c <= b){
cout << "Yes" << endl;
}
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
string s;
cin>>s;
int n=s.size();
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout<<-1<<endl;
return 0;
}
if(n==26){
string t=s;
next_permutation(all(s));
string ans="";
rep(i,n){
ans+=s[i];
if(s[i]>t[i]) break;
}
cout<<ans<<endl;
return 0;
}
vector<int> cnt(26,0);
rep(i,n){
cnt[s[i]-'a']++;
}
rep(i,26){
if(cnt[i]==0){
string ans=s+char('a'+i);
cout<<ans<<endl;
return 0;
}
}
} | 0 | 90,171,202 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
string ans;
for(int i=0; i<e.size(); i++){
ans+=o.at(i);
ans+=e.at(i);
}
if(o.size()>e.size()){
ans+=o.at(o.size()-1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
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--)
int main(){
string s,hako;
cin >> s;
int ans= 1000,tmp;
for(int i = 0;i < s.size()-2;i++){
hako = s.substr(i,3);
tmp = stoi(hako);
if(ans > abs(753 - tmp))
ans = abs(753 - tmp);
}
cout << ans << endl;
} | 0 | 75,149,115 |
#define _GLIBCXX_DEBUG
#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();
typedef long long ll;
ll calc(vector<ll> & vec, ll mode, ll add) {
ll ans = 0;
rep(i, vec.size()) {
if (add ) {
}
if (vec[i] > 0 && mode != i) {
ans += 1;
}
}
return ans;
}
bool sortbysec(const pair<ll,ll> &a,
const pair<ll,ll> &b)
{
return (a.second > b.second);
}
vector<pair<ll, ll>> convert(vector<ll> &vec) {
vector<pair<ll, ll>> seq;
rep(i, vec.size()) {
if (vec[i] == 0) {
continue;
}
seq.push_back(make_pair((ll)i, vec[i]));
}
sort(seq.begin(), seq.end(), sortbysec);
return seq;
}
int main()
{
int n;
cin >> n;
vector<ll> vec_even(pow(10, 5)+10, 0);
vector<ll> vec_odd(pow(10, 5)+10, 0);
int even_size = 0;
int odd_size = 0;
rep(i, n) {
int x;
cin >> x;
if (i%2 == 0) {
even_size++;
vec_even[x]++;
} else {
odd_size++;
vec_odd[x]++;
}
}
vector<pair<ll, ll>> even_pairs = convert(vec_even);
vector<pair<ll, ll>> odd_pairs = convert(vec_odd);
ll res = pow(10, 8);
if (even_pairs[0].first == odd_pairs[0].first) {
ll a, b;
a = even_size - even_pairs[0].second;
b = odd_size - (odd_pairs.size() == 1 ? 0 : (odd_pairs[1].second));
res = min(res, a + b);
a = odd_size - odd_pairs[0].second;
b = even_size - (even_pairs.size() == 1 ? 0 : (even_pairs[1].second));
res = min(res, a + b);
} else {
ll a = even_size - even_pairs[0].second;
ll b = odd_size - odd_pairs[0].second;
res = a + b;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define VREP(s, ite) for (auto ite = s.begin(); ite != s.end(); ++ite)
#define FI first
#define SE second
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
#define eb emplace_back
#define vint vector<int>
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main()
{
ciosup;
int n;
cin >> n;
vector<ll> a(n), sa(n);
ll tot = 0;
REP(i, n) {
cin >> a[i];
tot += a[i];
}
REP(i,n-1){
sa[i] = a[i + 1] - a[i];
}
sa[n - 1] = a[0] - a[n - 1];
ll wari = n;
wari *= n + 1;
wari /= 2;
if (tot % wari == 0)
{
ll kai = tot / wari;
bool flag = true;
ll kait = 0;
REP(i, n)
{
if ((kai - sa[i]) % n == 0 && (kai-sa[i])/n >= 0){
kait += (kai - sa[i]) / n;
}
else
{
flag = false;
break;
}
}
if (flag && (kait == kai)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
else
{
cout << "NO" << endl;
}
} | 0 | 31,706,824 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=false;
string str;
cin>>n>>k;
l=n-2;
sum=(l*(l+1))/2;
if(sum<k)
{
cout<<-1<<endl;
return 0;
}
vector<pll>v;
for(i=2; i<=n; i++)
{
v.eb(1,i);
}
k=sum-k;
for(i=2; i<=n; i++)
{
for(j=i+1; j<=n && k; j++)
{
v.eb(i,j);
k--;
}
}
cout<<v.size()<<endl;
for(auto x : v)
cout<<x.F<<" "<<x.S<<endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
typedef vector<vector<int> > VVi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
char c[4] = {'m', 'c', 'x', 'i'};
int d[4] = {1000, 100, 10, 1};
int main()
{
int n;
cin >> n;
rep(i,0,n) {
string a[2];
cin >> a[0] >> a[1];
int b[2] = {};
rep(i,0,2) {
rep(j,0,4) {
rep(k,0,a[i].size()) {
if (a[i][k] == c[j]) {
if (k == 0) {
b[i] += d[j];
a[i] = a[i].substr(1);
}
else {
int e = a[i][k-1] - '0';
b[i] += e * d[j];
a[i] = a[i].substr(2);
}
}
}
}
}
int sum = b[0] + b[1];
string ans;
rep(i,0,4) {
int x = sum / d[i];
sum %= d[i];
if (x >= 2) ans += '0'+x;
if (x) ans += c[i];
}
cout << ans << endl;
}
return 0;
} | 0 | 34,055,318 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
signed main(){
int N, X, M;
cin >> N >> X >> M;
vector<int> kou;
set<int> num;
kou.push_back(X);
num.insert(X);
int ans = 0;
for( int i = 1; i < N; i++ ){
int A = kou[i-1]*kou[i-1];
A %= M;
int ichi = 0;
if( num.count(A) ){
for( int j = 0; j < kou.size(); j++ ){
if( kou[j] == A ){
ichi = j;
break;
}
ans += kou[j];
}
int roop = 0;
for( int j = ichi; j < kou.size(); j++ ){
roop += kou[j];
}
ans += (N-ichi)/(kou.size()-ichi)*roop;
int amari = (N-ichi)%(kou.size()-ichi);
for( int j = ichi; j < ichi+amari; j++ ) ans += kou[j];
cout << ans << endl;
return 0;
}else{
num.insert(A);
kou.push_back(A);
}
}
for( int i = 0; i < kou.size(); i++ ) ans += kou[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
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 double PI = 3.14159265358979323846;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
#define H_MAX 500
#define W_MAX 500
#define INF 1e9 + 7
int main() {
int N, cnt = 0, cnt2 = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int x = i;
cnt = 0;
while (x) {
cnt++;
x /= 10;
}
if (cnt % 2 == 1) {
cnt2++;
}
}
cout << cnt2 << endl;
} | 0 | 97,190,444 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int tmp,i = 0,j,k = 0,f[11];
vector<int> ans;
while(cin>>tmp){
if(tmp == 0){
ans.push_back(f[i-1]);
f[i-1] = '\0';
i--;
k++;
}
else{
f[i] = tmp;
i++;
}
}
for(j = 0;j < k;j++){
cout<<ans[j]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, k;
cin >> n >> k;
ll ans1 = 0;
ll ans2 = 0;
for(int i = 1; i <= n; ++i) {
if(i%k == 0) ans1++;
else if(i%k == k/2) ans2++;
}
if(k%2==0) {
cout << ans1 * ans1 * ans1 + ans2 * ans2 * ans2 << endl;
}else {
cout << ans1 * ans1 * ans1 << endl;
}
return 0;
} | 0 | 34,298,800 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k=1,m=0;
scanf("%d",&n);
while (k*k<n)
{
m=(n/k-k)*2+m+1;
if (n%k==0) m-=2;
k++;
}
printf("%d",m);
return 0;
} | #include <cstdio>
int main( void )
{
while ( true )
{
int h, w;
scanf( "%d %d", &h, &w );
if ( ( h == 0 ) && ( w == 0 ) ) break;
for ( int j = 0; j < w; j++ ) { printf("#"); }
printf("\n");
for ( int i = 1; i < ( h - 1 ); i++ )
{
printf("#");
for ( int j = 1; j < ( w - 1 ); j++ ) { printf("."); }
printf("#\n");
}
for ( int j = 0; j < w; j++ ) { printf("#"); }
printf("\n");
printf("\n");
}
return 0;
} | 0 | 30,841,492 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double answer,x1,x2,y1,y2,a,b;
cin >> x1 >> y1 >> x2 >> y2;
a = pow(x1 - x2, 2.0);
b = pow(y1 - y2, 2.0);
answer = sqrt(a + b);
printf("%lf\n",answer);
return 0;
} | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
template <typename T>
struct cumulative_sum {
vector<T> data;
vector<long long int> sum;
cumulative_sum(const int n) {
data.assign(n, 0);
}
T& operator[](const int k) {
return data[k];
}
void build() {
sum.assign(data.size() + 1, 0);
for (int i = 0; i < (int)data.size(); i++) {
sum[i + 1] = sum[i] + data[i];
}
}
long long int query(const int a, const int b) {
return sum[b] - sum[a];
}
};
int main() {
lint n, k;
cin >> n >> k;
cumulative_sum<lint> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a.build();
vector<lint> b;
for (int left = 0; left <= n; left++) {
for (int right = left + 1; right <= n; right++) {
b.push_back(a.query(left, right));
}
}
lint ans = 0;
for (int i = 45; i >= 0; i--) {
int num_bit = 0;
for (int j = 0; j < b.size(); j++) {
if (b[j] & (1LL << i)) {
num_bit++;
}
}
if (num_bit >= k) {
for (int j = 0; j < b.size(); j++) {
if ((b[j] & (1LL << i)) == 0) {
b[j] = 0;
}
}
ans += 1LL << i;
}
}
cout << ans << endl;
} | 0 | 8,717,574 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int K,N;
cin >> K >> N ;
vector<int>A(N);
vector<int>B(N);
int maxB;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N-1; i++){
B[i] = A[i+1]-A[i];
}
B[N-1] = A[0]+K-A[N-1];
maxB = B[0];
for(int i=0; i<N; i++){
if(maxB < B[i]){
maxB = B[i];
}
}
cout << K-maxB;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << '\n';}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
int n;
int memo[10000001];
signed main() {
cin >> n;
vi v;
RREP(i, n) memo[i] = i;
REPS(i, 2, n + 1) memo[i] += memo[i - 1];
RREP(i, n) {
if (memo[i] >= n) {
v.eb(i);
break;
}
}
int sum = v.front();
DEPS(i, v.front() - 1, 1) {
if (sum == n) break;
if (sum + i <= n) {
sum += i;
v.eb(i);
}
}
print(v, "\n");
return 0;
} | 0 | 92,748,425 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3], minv;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 2; j > i; j--) {
if (a[j - 1] > a[j]) {
swap(a[j - 1], a[j]);
}
}
}
for (int i = 0; i < 3; i++) {
cout << a[i];
if (i != 2) {
cout << " ";
}
}
cout << 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);
void stat();
constexpr ll mod = 1000000000 + 7;
int main()
{
ll x, a, b;
cin >> x >> a >> b;
if (b > a + x ) { cout << "dangerous" << endl; }
else if ( a+ x>=b && b > a)
{
cout << "safe" << endl;
}else{
cout<<"delicious"<<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
} | 0 | 72,411,667 |
#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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define _GLIBCXX_DEBUG
#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 INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
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;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int sumDight(int x) {
int sum = 0;
while (x > 0) {
sum += (x % 10);
x /= 10;
}
return sum;
}
int divideReverse(int x) {
int reverse = 0;
int r;
while (x > 0) {
r = x % 10;
reverse = reverse * 10 + r;
x /= 10;
}
return reverse;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vector<ll> t(110);
rep(i, n) cin >> t[i];
ll sum = 0;
rep(i, n) { for (ll j = i + 1; j < n;j++){
sum += t[i] * t[j];
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
bool posible=false;
int data[x+1];
for(int i=0;i<=x;i++){
data[i]=(4*(x-i)+(i*2));
}
for(int i=0;i<x+1;i++){
if(data[i]==y)
posible=true;
}
if(posible){
cout<<"Yes";
}
else{
cout<<"No";
}
} | 0 | 7,389,806 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define PI 3.141592653
#define rep(i, n) for(ll i = 0; i < n; i++)
int main(){
ll n; cin >> n;
vector<tuple<ll, ll , ll, ll>> v(n);
rep(i, n){
cin >> get<0>(v[i]);
get<1>(v[i]) = i+1;
}
sort(v.begin(), v.end());
rep(i, n){
get<2>(v[i]) = i+1;
get<3>(v[i]) = 0;
}
sort(v.begin(), v.end());
rep(i, n){
if(i == 0){
get<3>(v[0]) = (n-get<2>(v[i])+1)*(get<0>(v[i]));
}
else{
get<3>(v[i]) = (n-get<2>(v[i])+1)*(get<0>(v[i])-get<0>(v[i-1]));
}
}
ll memo = get<1>(v[n-1]);
ll res = n-1;
for(ll i = n-1; i >= 0; i--){
if(memo < get<1>(v[i])){
get<3>(v[res]) += get<3>(v[i]); get<3>(v[i]) = 0; continue;
}
if(memo > get<1>(v[i])){
memo = get<1>(v[i]); res = i; continue;
}
}
rep(i, n){
swap(get<1>(v[i]), get<0>(v[i]));
}
sort(v.begin(), v.end());
rep(i, n){
cout << get<3>(v[i]) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
int main(){
ll n,m;
priority_queue <int> PQ;
pair <int,int> a[100006];
scanf("%lld %lld", &n ,&m);
int i;
for(i = 0;i < n;i++){
scanf("%d %d", &a[i].first, &a[i].second);
}
sort(a,a + n);
int j;
j = 0;
int t;
ll ans = 0;
for(i = 1;i <= m;i++){
while(a[j].first == i){
t = a[j].second;
j++;
PQ.push(t);
}
if(!(PQ.empty())){
ans += PQ.top(); PQ.pop();
}
}
printf("%lld\n", ans);
return 0;
} | 0 | 6,287,396 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int size = s.size(), cnt = 0;
bool flg = true;
if (s.at(0) != 'A') flg = false;
for (int i=1; i<size; i++){
if (s.at(i) == 'C'){
cnt++;
if ((i < 2) || (i>=(size-1)) || (cnt!=1)){
flg = false;
}
continue;
}
if (isupper(s.at(i))) flg = false;
}
if (cnt == 0) flg = false;
if (flg) cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <boost/foreach.hpp>
using namespace std;
#define pi 2*asin(1.0)
#define MAX 10000000
#define MOD 1000000007
#define _GLIBCXX_DEBUG
vector<long> fac(MAX);
vector<long> finv(MAX);
vector<long> inv(MAX);
vector<long> Primelist;
void Prinit(){
long PR=10000001;
vector<long> P(PR,0);
for(long i=2;i*i<PR;i++){
if(P.at(i)==0){
long j=i;
j+=i;
while(j<PR){
P.at(j)=1;
j+=i;
}
}
}
for(long i=2;i*i<PR;i++){
if(P.at(i)==0){
Primelist.push_back(i);
}
}
}
void Cominit(){
fac.at(0)=fac.at(1)=1;
finv.at(0)=finv.at(1)=1;
inv.at(1)=1;
for(long i=2;i<MAX;i++){
fac.at(i)=(fac.at(i-1)*i)%MOD;
inv.at(i)=MOD-inv.at(MOD%i)*(MOD/i)%MOD;
finv.at(i)=finv.at(i-1)*inv.at(i)%MOD;
}
}
long facComb(long N,long M){
if(N<M) return 0;
if(N<0||M<0) return 0;
return fac.at(N)*(finv.at(M)*finv.at(N-M)%MOD)%MOD;
}
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
long GCM(long A,long B){
long W,r;
if(A<B){
W=B;
B=A;
A=W;
}
while(A%B!=0){
r=A%B;
A=B;
B=r;
}
return B;
}
long LCM(long A,long B){
return (A*B)/GCM(A,B);
}
long upDiv(long a,long b){
return (a+b-1)/b;
}
long strtolong(string str){
istringstream ss;
ss=istringstream(str);
long num;
ss>>num;
return num;
}
long chartolong(char ch){
long num;
num=ch-'0';
return num;
}
string longtostr(long N){
string str;
str=to_string(N);
return str;
}
int main() {
long N,r,s;
cin>>N;
r=sqrt(N);
for(int i=r;i>0;i--){
if(N%i==0){
s=i;
break;
}
}
cout<<s+(N/s)-2<<endl;
} | 0 | 78,247,731 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
while(cin>>a){
if(a=="#") break;
int len=a.size();
int k=0,m=2;
for(int i=0;i<len;i++){
if(a[i]=='q'||a[i]=='w'||a[i]=='e'||a[i]=='r'||a[i]=='t'||a[i]=='a'||a[i]=='s'||a[i]=='d'||a[i]=='f'||a[i]=='g'||a[i]=='z'||a[i]=='x'||a[i]=='c'||a[i]=='v'||a[i]=='b'){
if(m==1){
k++;
}
m=0;
}
else{
if(m==0){
k++;
}
m=1;
}
}
cout<<k<<endl;
}
return 0;
} | #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(){
int N; string S, T;
cin >> N >> S >> T;
for (int i = 0; i < N; i++){
string ans = "";
for (int j = 0; j < i; j++) ans += S[j];
for (int j = 0; j < N; j++) ans += T[j];
bool flag = true;
for (int j = 0; j < N; j++){
if (ans[j] != S[j]) flag = false;
}
if (flag){
cout << ans.length() << endl;
return 0;
}
}
cout << N * 2 << endl;
return 0;
} | 0 | 244,192 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const int INF=2e9;
int main() {
ios_base::sync_with_stdio(false);
string o,e;
cin >> o >> e;
string ans;
rep(i,e.size()) {
ans.push_back(o[i]);
ans.push_back(e[i]);
}
if (o.size()>e.size()) ans.push_back(o[o.size()-1]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a-1; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define rALL(x) x.rbegin(), x.rend()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
ll n; cin >> n;
vector<ll> v(n);
vector<pair<ll, ll>> res;
rep(i, n) cin >> v[i];
sort(ALL(v));
FOR(i, 1, n-1){
if(0<v[i]){
res.emplace_back(v[0], v[i]);
v[0] -= v[i];
}else{
res.emplace_back(v[n-1], v[i]);
v[n-1] -= v[i];
}
}
res.emplace_back(v[n-1], v[0]);
cout << v[n-1] - v[0] << endl;
for(auto x: res) cout << x.first << ' ' << x.second << endl;
} | 0 | 85,487,351 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
typedef long long lint;
template< typename T > void modMul(T& a, T b, T m) { a = (a*b)%m; }
template< typename T > void modAdd(T& a, T b, T m) { a = (a+b+m)%m; }
class Combination {
private:
const int MAX_NUM;
vector< lint > fact, inv;
const lint MOD;
lint powMod(lint x, lint k) {
lint res = 1;
while (k) {
if (k&1) modMul(res, x, MOD);
modMul(x, x, MOD);
k >>= 1;
}
return res;
}
void pre() {
fact[0] = fact[1] = 1;
for_(i,2,MAX_NUM) fact[i] = (fact[i-1] * i) % MOD;
for_(i,0,MAX_NUM) inv[i] = powMod(fact[i], MOD-2);
}
public:
Combination(int __MAX_NUM, lint __MOD)
: MAX_NUM(__MAX_NUM), fact(__MAX_NUM, 0), inv(__MAX_NUM, 0), MOD(__MOD) { pre(); }
lint calc(int n, int k) {
if (n < k) return 0;
lint res = fact[n];
modMul(res, inv[n-k], MOD);
modMul(res, inv[k], MOD);
return res;
}
};
int n, a[100005];
const lint mod = (lint)1e9 + 7;
int main() {
cin >> n;
for_(i,0,n+1) cin >> a[i];
lint x = accumulate(a, a+n+1, lint()) - (lint)n*(n+1)/2;
int L = -1, R = -1;
for_(i,0,n+1) {
if (a[i] == x) {
if (L == -1) L = i;
else R = n-i;
}
}
Combination comb(n+2, mod);
cout << n << endl;
for_(k,2,n+2) {
lint ans = comb.calc(n+1,k);
modAdd(ans, -comb.calc(L+R, k-1), mod);
cout << ans << endl;
}
} | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
ll n; cin >> n;
vector<ll> t(n), a(n);
rep(i, n) cin >> t[i];
rep(i, n) cin >> a[i];
if(t[n-1] != a[0]) {
cout << 0 << endl;
return 0;
}
set<ll> fixed;
ll now = 0;
rep(i, n) {
if(now != t[i]) {
now = t[i];
fixed.insert(i);
}
}
now = 0;
rep(i, n) {
if(now != a[n-1-i]) {
now = a[n-1-i];
if(now > t[n-1-i]) {
cout << 0 << endl;
return 0;
}
fixed.insert(n-1-i);
}
}
ll ans = 1;
rep(i, n) {
if(!fixed.count(i)) {
ans = mtime(ans, min(t[i], a[i]), 1);
}
}
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
} | 0 | 15,794,435 |
#include <stdio.h>
int main()
{
int A, P;
int slice = 0, pie = 0;
scanf("%d %d", &A, &P);
while (A>0){
slice += 3;
A--;
}
slice += P;
while (slice >= 2){
slice -= 2;
pie++;
}
printf("%d", pie);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223372036854775807LL
using ll = int64_t;
template<typename T>
using vec = vector<T>;
using P = pair<ll, ll>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
fill((T *)array, (T *)(array + N), val);
}
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
bool dp[5002][5002] = {};
signed main(){
IOS;
ll n, k;
cin >> n >> k;
vec<ll> a(n + 1);
ll sum = 0;
REP(i,n){
cin >> a[i];
sum += a[i];
}
a[n] = 0;
if(sum < k){
dump(n);
return 0;
}
sort(ALL(a),greater<ll>());
ll left = 0, right = n;
ll mid;
while(right - left > 1){
Fill(dp,false);
dp[0][0] = true;
mid = (right + left) / 2;
for(int i = 0;i < n;i++){
for(int j = 0;j < k;j++){
if(i == mid)dp[i + 1][j] = dp[i][j];
else {
dp[i + 1][j] = dp[i][j];
if(j >= a[i])dp[i + 1][j] |= dp[i][j - a[i]];
}
}
}
bool ok = false;
for(int j = max(k - a[mid],(ll)0);j < k;j++)if(dp[n][j])ok = true;
if(ok)left = mid;
else right = mid;
}
left++;
dump(n - left);
} | 0 | 49,569,712 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
int K, S;
cin >> K >> S;
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
if (S - i - j >= 0 && S - i - j <= K) {
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll d,t,s;
cin>>d>>t>>s;
float time = (float)d/s;
if(time <= t)
{
cout<<"Yes"<<'\n';
}
else
{
cout<<"No"<<'\n';
}
} | 0 | 35,251,070 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 5000000000000000000;
int main() {
int N, K;
cin >> N >> K;
vector<int> x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
vector<pair<int, int>> S1(N);
rep(i, N) S1[i] = pair<int, int>{x[i], i};
sort(ALL(S1));
vector<int> X(N, 0);
X[S1[0].second] = 0;
REP(i, N) X[S1[i].second] = X[S1[i - 1].second] + 1;
vector<pair<int, int>> S2(N);
rep(i, N) S2[i] = pair<int, int>{y[i], i};
sort(ALL(S2));
vector<int> Y(N, 0);
Y[S2[0].second] = 0;
REP(i, N) Y[S2[i].second] = Y[S2[i - 1].second] + 1;
vector<vector<int>> S(N, vector<int>(N, 0));
rep(i, N) S[X[i]][Y[i]] = 1;
vector<vector<int>> sum(N + 1, vector<int>(N + 1, 0));
rep(i, N) rep(j, N) sum[i + 1][j + 1] = S[i][j] + sum[i + 1][j] + sum[i][j + 1] - sum[i][j];
ll ans = INF;
rep(i, N + 1) rep(j, N + 1) rep(k, N + 1) rep(l, N + 1) {
if (i < j && k < l) {
if (sum[j][l] - sum[i][l] - sum[j][k] + sum[i][k] >= K) {
ans = min(ans, ((ll)S1[j - 1].first - (ll)S1[i].first) * ((ll)S2[l - 1].first - (ll)S2[k].first));
}
}
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int main(){
int N,i,j,p,a = 10000000;
cin >> N;
int X[N];
for(i = 0;i < N;i++) cin >> X[i];
for(i = 0;i <= 100;i++){
p = 0;
for(j = 0;j < N;j++){
p += pow(X[j] - i,2);
}
if(a > p){
a = p;
}
}
cout << a << endl;
} | 0 | 39,899,671 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
vector<ll> L;
ll count = 0;
cin >> N;
L.resize(2 * N);
rep(i, 2 * N) cin >> L[i];
sort(L.begin(), L.end());
rep(i, N) count += L[2 * i];
cout << count << endl;
return 0;
} | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <ctype.h>
using namespace std;
int m,mmin,mmax,check;
int psa,sa;
vector<int> mem;
int main() {
while(1) {
sa = 0;
cin >> m >> mmin >> mmax;
if(m==0) break;
vector<int> mem(m,0);
for(int i = 0;i < m;i++) {
cin >> mem[i];
}
for(int i = mmin-1;i < mmax;i++) {
psa = mem[i] - mem[i+1];
if(psa >= sa) {
check = i;
sa = psa;
}
}
cout << check+1 << endl;
}
return 0;
} | 0 | 59,541,524 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N, M; cin >> N >> M;
int a[N];
vector<vector<int>> G(N);
int v1,v2;
for (int i = 0; i < M; i++) {
cin >> v1 >> v2; v1--; v2--;
G[v1].push_back(v2);
G[v2].push_back(v1);
}
for (int i = 0; i < N; i++) {
a[i] = i;
}
int cnt = 0; bool check;
do{
for (int i = 0; i < N-1; i++) {
check = false;
for ( int v : G[a[i]] ){
if(v == a[i+1]){
check = true;
}
}
if(!check){
break;
}
}
if(check){
cnt++;
}
} while(next_permutation(a + 1, a + N));
printf("%d\n", cnt);
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N;
ll K;
cin >> N >> K;
map<int, ll> A;
rep(i, N){
int a, b;
cin >> a >> b;
if(A.count(a)) A[a] += b;
else A[a] = b;
}
ll ans_i = K;
for(auto i : A){
if(ans_i <= i.second){
cout << i.first << endl;
break;
}
ans_i -= i.second;
}
} | 0 | 28,669,873 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
int n,m,f=0,sum=0;
cin>>n>>m;
vector<int>a(1000000);
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
sort(a.begin(),a.end(),greater<>());
for(int i=0;i<m;i++){
if(4*a[i]*m<sum){
f=1;
break;
}
}
if(f==1){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int N=S.size();
for(int i=0;i<N;i++){
bool bo=false;
for(int j=0;j<N;j++){
if(S[(j+i)%N]!=T[j]){
bo=true;
break;
}
}
if(bo)
continue;
cout<<"Yes"<<endl;
return 0;
}
cout<<"No"<<endl;
} | 0 | 13,276,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if ((N / 1000 == N % 1000 / 100 && N % 1000 / 100 == N % 100 /10) || ( N % 1000 / 100 == N % 100 /10 && N % 100 /10 == N % 10) ) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s;
cin >> s;
int sz = s.size();
rep(i, sz){
if(s[i] != s[sz - i - 1]){
cout << "No" << endl;
return 0;
}
}
int sz1 = (sz - 1)/2;
int sz2 = (sz + 3)/2;
rep(i, sz1){
if(s[i] != s[sz1 - i - 1]){
cout << "No" << endl;
return 0;
}
}
for (int i = 0; sz2 < sz; sz2++){
if(s[sz/2+1+i] != s[sz - i - 1]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | 0 | 73,000,526 |
#include <bits/stdc++.h>
using namespace std;
typedef struct _dot{
int a;
int b;
}Dot;
int Distance(Dot a,Dot b){
return abs(a.a-b.a) + abs(a.b - b.b);
}
int main(void){
int N,M;
cin >> N >> M;
Dot student[N];
Dot CheckPoint[M];
for(int i=0;i<N;i++){
cin >> student[i].a;
cin >> student[i].b;
}
for(int i=0;i<M;i++){
cin >> CheckPoint[i].a;
cin >> CheckPoint[i].b;
}
for(int i=0;i<N;i++){
int max,index=1;
for(int j=0;j<M;j++){
if(j==0){max = Distance(student[i],CheckPoint[j]);}
else{if(max > Distance(student[i],CheckPoint[j])){ max = Distance(student[i],CheckPoint[j]); index = j+1;}}
}
cout << index << endl;
}
} | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
〈;/ く刈＿ 个 - ＜} ./|/_〉
r-っ'~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ~ﾞ|___
/／ニつ ､ ノﾆﾆ ＼
. | ニ⊃ ./ / ── / / ..⊆ﾆﾆ :|
. | 丁´ /|￣|￣ ─‐ /|￣|￣ .￣|丁 |
. | ﾉ. |￣|￣ ─‐ |￣|￣ .|八 |
. | ||. |￣|￣ |￣| |￣|￣ .| |
. | || ￣￣￣ ￣ ￣￣￣ .| | |
. ||＿＿＿＿＿＿＿＿＿＿＿＿______|__ ',
,′ | ７ﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆ} ,′
. { |/ }ﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆﾆ{/
*
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <limits>
using namespace std;
#define rep(a) _rep(0,int(a))
#define repj(a) for(int j=0;j<int(a);j++)
#define _rep(a,b) for(int i=int(a);i<int(b);i++)
#define ll long long
#define fst first
#define snd second
#define pf(b) printf("%.12f\n",(double)b)
#define _GLIBCXX_DEBUG
const double pai = 3.1415926535897;
#define _cos(n) cos(n*pai/180)
#define int long long
int fact(int n) {
int a = 1;
for (int i = 1;i <= n;i++) a *= i;
return a;
}
int sa(int n, int m) {
if (n < m)return m - n;
else return n - m;
}
int n, a, b,ans;
signed main() {
cin >> n >> a >> b;
ans =1+ ((b - a) * (n - 2));
if (ans < 0)ans = 0;
cout << ans << endl;
} | 0 | 13,704,339 |
#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 k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x,y) (int)(pow(x,y))
#define ceil(x) (int)(ceil(x))
#ifndef ONLINE_JUDGE
#define debug(x) cout<<x<<endl;
#else
#define debug(x) 42
#endif
const int MAX=1e4;
const int MOD=1e9+7;
const int MAAX=1e15;
const long double EPS=1e-6;
const int N=1e6;
int power(int x,int y)
{
if (y == 0)
return 1;
int a=power(x,y/2);
if (y % 2 == 0)
return a * a % MOD;
else
return x * a * a % MOD;
}
long double sq(int x){
long double s=0,e=x,mid;
while(e-s>=EPS){
mid=(s+e)/2;
if(mid*mid<=x){
s=mid;
}
else{
e=mid-EPS;
}
}
return s;
}
vector<int> primes;
bool visted[N+5];
void sieve(){
visted[0]=visted[1]=1;
for(int i=2;i*i<=N;i++){
if(visted[i]==0){
primes.pb(i);
for(int j=i*i;j<=N;j+=i){
visted[j]=1;
}
}
}
for(int i=sqrt(N)+1;i<=N;i++){
if(visted[i]==0)
primes.pb(i);
}
return;
}
in main()
{
int tc=1;
while(tc--)
{
string s;
cin>>s;
int x=-1,y=-1;
for(int i=0;i<s.size()-1;i++){
if(s[i]==s[i+1])
x=i+1,y=i+2;
}
if(x==-1){
for(int i=0;i<s.size()-2;i++){
if(s[i]==s[i+2])
x=i+1,y=i+3;
}
}
cout<<x<<" "<<y<<endl;
}
RETURN;
} | 0 | 1,807,940 |
#include<bits/stdc++.h>
using namespace std;
namespace FastIO
{
static char c;
static int top,buf[12],f;
template<typename T>
inline void read(T& x)
{
x=0,c=getchar(),f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();x*=f;
}
template<typename T>
inline void write(T x,int f=0)
{
top=0;
if(x<0)putchar('-'),x=-x;
do buf[top++]=x%10,x/=10;while(x);
for(int i=top-1;~i;i--)putchar(buf[i]+48);
if(f)putchar(f&1?' ':'\n');
}
}
using FastIO::read;
using FastIO::write;
const int maxn=1e5+5;
int N,L,T,st,a[maxn],dt;
int main()
{
read(N),read(L),read(T),dt=T%L;
for(int i=0,w;i<N;i++)
{
read(a[i]),read(w);
if(w==1)
{
st=(st+T/L)%N;
a[i]+=dt;
if(a[i]>=L)a[i]-=L,st=(st+1)%N;
}
else
{
st=((st-T/L)%N+N)%N;
a[i]-=dt;
if(a[i]<0)a[i]+=L,st=(st+N-1)%N;
}
}
sort(a,a+N);
for(int i=st;i<st+N;i++)write(a[i%N],2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,sum=0,ans=0;
cin >> N;
vector<int> A(100001,0);
for(int i=0;i<N;i++){
int a;
cin >> a;
A[a]++;
}
for(int i=0;i<100001;i++){
if(A[i]!=0){
ans++;
if(A[i]!=1){
sum += (A[i]-1)%2;
}
}
}
cout << ans-(sum%2) << endl;
} | 0 | 72,170,702 |
#include<iostream>
int main(){
long int n,M;
M = 100000;
std::cin >> n;
for(int i=0;i<n;i++){
M = M * 1.05;
if(M%1000!=0){
M = M - (M%1000) + 1000;
}
}
std::cout << M << std::endl;
} | #include<iostream>
#include<cstdio>
#include<deque>
#include<string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,i,x;
string s;
deque<int> intlist;
cin >> n;
for(i=0;i<=n-1;i++){
cin >> s;
if (s=="insert"){
cin >> x;
intlist.push_front(x);
}else if(s=="delete"){
cin >> x;
deque<int>::iterator it =intlist.begin();
while (1){
if (*it == x ){
it=intlist.erase(it);
break;
}else if(it == intlist.end()){
break;
}
it++;
}
}else if(s=="deleteFirst"){
intlist.pop_front();
}else if(s=="deleteLast"){
intlist.pop_back();
}
}
deque<int>::iterator it =intlist.begin();
cout << *it;
it++;
while(1){
if (it == intlist.end()){
cout << "\n";
break;
}
cout << " " << *it;
it++;
}
return 0;
} | 0 | 88,937,473 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,sum=0;
cin>>n>>m;
int arr[m];
for(int i=0;i<m;i++) {
cin>>arr[i];
sum+=arr[i];
}
if(sum>n) cout<<-1<<endl;
else cout<<n-sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
#define pow10(n) int(1e##n + n)
void solve()
{
int N, M;
cin >> N >> M;
map<int, int> mp;
REP0 (i, M)
{
int a, b;
cin >> a >> b;
mp[a]++;
mp[b]++;
}
for (auto p : mp)
{
if (p.second%2==1)
{
std::cout << "NO" << endl;
return;
}
}
std::cout << "YES" << endl;
}
int main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
} | 0 | 31,254,612 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define loop(i,a,b) for(int i=a; i<b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout<<fixed<<setprecision(10)<<x
ll solve(vector<int>& v, int n, int k)
{
ll dp[n+2][k+2];
for(int i=0; i<=k; i++)
dp[1][i]= (i>v[1]) ? 0 : 1;
for(int i=2; i<=n; i++){
for(int j=0; j<=k; j++){
if(j==0)
dp[i][j]= dp[i-1][j];
else dp[i][j]= (mod + dp[i][j-1] + dp[i-1][j] - ((j-v[i]-1 >=0) ? dp[i-1][j-v[i]-1] : 0))%mod;
}
}
return dp[n][k]%mod;
}
int main()
{
FASTIO;
int n,k;
cin>>n>>k;
vector<int> v(n+1);
loop(i,1,n+1) cin>>v[i];
cout<<solve(v, n, k);
return 0;
} | #include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<complex>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=k;i++)
#define in(i,j,k) ((i)>=(j)&&(i)<=(k))
#define INF (1<<28)
#define pb(i) push_back(i)
#define fs first
#define sc second
const char dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int d[512][512];
int main(){
int n,m;
while(cin >> n && n){
m = 0;
fill_n(d[0],512*512,INF);
rep(i,n){
int a,b,c;
cin >> a >> b >> c;
d[a][b] = d[b][a] = c;
m = max(m,max(a+1,b+1));
}
rep(i,m)d[i][i] = 0;
rep(k,m)rep(i,m)rep(j,m){
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
int city = -1, val = INF;
rep(i,m){
int tmp = 0;
rep(j,m){
tmp += d[i][j];
}
if(tmp < val){
val = tmp;
city = i;
}
}
cout << city << " " << val << endl;
}
return 0;
} | 0 | 60,780,468 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define print(ele) cout << ele << endl
#define print10(ele) cout << fixed << setprecision(10) << ele << endl
using namespace std;
typedef long long ll;
typedef vector<int> ivec;
typedef vector<string> svec;
typedef vector<ll> lvec;
const int mod = 1e9 + 7;
const ll INF = 1000000000000000000LL;
int main() {
int n;
cin >> n;
ivec a(n + 2);
REP(i, n) cin >> a[i + 1];
int d = 0;
REP(i, n + 1) { d += abs(a[i] - a[i + 1]); }
FOR(i, 1, n + 1) {
int ans = d - abs(a[i - 1] - a[i]) - abs(a[i] - a[i + 1]) +
abs(a[i - 1] - a[i + 1]);
print(ans);
}
return 0;
} | # pragma GCC target("avx")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include <stack>
# include <map>
# include <iomanip>
# include <stdexcept>
# include <functional>
# include <tuple>
# include <set>
# include <bitset>
# include <complex>
# include <cassert>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using grapth = vec<vec<T>>;
#define rep(i, n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(ll i=(n)-1; i >= 0; --i)
#define rrep1(i, n) for(ll i=(n); i > 0; --i)
#define step(i, a, n) for(ll i=(a), i##_len=(a)+(n); i<i##_len; ++i)
#define rstep(i, a, n) for(ll i=(a)+(n)-1, i##_len=(a); i>=i##_len; --i)
#define range(i, a, b) for(ll i=(a), i##_len=(b); i<i##_len; ++i)
#define rrange(i, a, b) for(ll i=(b)-1, i##_len=(a); i>=i##_len; --i)
constexpr int INF = numeric_limits<int>::max();
constexpr ll INFL = numeric_limits<ll>::max();
constexpr ull INFUL = numeric_limits<ull>::max();
std::string strMulti(const char c, const int n) {
std::string out = "";
for (int i = 0; i < n; i++) { out += c; }
return out;
}
std::string strMulti(const std::string t, const int n) {
std::string out = "";
for (int i = 0; i < n; i++) { out += t; }
return out;
}
std::string tab(const int n)
{
return strMulti('\t', n);
}
std::string join(const std::vector<std::string>& v, const char* delim = 0) {
std::string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim) s += delim;
s += v[i];
}
}
return s;
}
string to_string(string& s) { return '"' + s + '"'; }
string to_string(char& c) { return string({ '\'', c, '\'' }); }
template<class T1, class T2> string to_string(pair<T1, T2> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template<class Tuple, size_t ...I> string _to_string_tuple(Tuple&& t, std::index_sequence<I...>) {
vector<string> texts = { to_string(std::get<I>(t))... };
return "(" + join(texts, ", ") + ")";
}
template<class ...Args> string to_string(tuple<Args...> t) {
using Tuple = tuple<Args...>;
return _to_string_tuple(std::forward<Tuple>(t),
std::make_index_sequence<std::tuple_size<std::decay_t<Tuple>>::value>{});
}
template<class T> string to_string(vector<T> ar) {
vector<string> texts(ar.size());
for (size_t i = 0; i < ar.size(); ++i)
{
texts[i] = to_string(ar[i]);
}
return "{" + join(texts, ", ") + "}";
}
template<class T> string to_string(initializer_list<T> il) {
vector<string> texts(il.size());
size_t i = 0;
for (T v : il)
{
texts[i] = to_string(v);
i++;
}
return "{" + join(texts, ", ") + "}";
}
#define debugvar(x) debugln(#x, (x))
#define debugvartab(x, t) debugln(tab(t) + #x, (x))
void debug(string name) {
std::cerr << name;
}
void debugln(string name) {
std::cerr << name << '\n';
}
template<class T> void debug(string name, T v) {
std::cerr << name << " = " << to_string(v);
}
template<class T> void debugln(string name, T v) {
std::cerr << name << " = " << to_string(v) << '\n';
}
template<class T> void debug(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il);
}
template<class T> void debugln(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il) << '\n';
}
template<class ...Args> void debug(string name, Args ...args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...));
}
template<class ...Args> void debugln(string name, Args ...args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...)) << '\n';
}
#define all(x) (x).begin(), (x).end()
#define pair(a, b) make_pair(a, b)
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
template<class T> T divup(const T a, const T b) { if (a % b == 0) { return a / b; } return a / b + 1; }
template<class T> bool cmp_2nd(pair<T, T> a, pair<T, T> b) { if (a.second != b.second) { return a.second < b.second; } return a.first < b.first; }
ll mod_pow(ll x, ll n, const ll& p) { ll ret = 1; while (n > 0) { if (n & 1) { (ret *= x) %= p; } (x *= x) %= p; n >>= 1; } return ret; }
template<class T> T modinv(T a, const T& p) { T b = p, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= p; if (u < 0) { u += p; } return u; }
template<class T> T math_P(T m, T n) { T ret = 1; for (T i = m; i > m - n; i--) { ret *= i; } return ret; }
template<class T> T math_C(T m, T n) { T ret = math_P(m, n); for (T i = 2; i <= n; i++) { ret /= i; } return ret; }
ll extended_euclidean(ll u, ll v) { ll r0 = u; ll r1 = v; ll s0 = 1; ll s1 = 0; ll t0 = 0; ll t1 = 1; while (r1 != 0) { ll q = r0 / r1; ll r = r0 - q * r1; ll s = s0 - q * s1; ll t = t0 - q * t1; r0 = r1; s0 = s1; t0 = t1; r1 = r; s1 = s; t1 = t; } if (t0 < 0) { return t0 + u; } else { return t0; } }
ll math_C_mod(ll n, ll c, const ll& p) { ll upe = 1; ll dow = 1; for (ll i = 1; i < c + 1; ++i) { upe = upe * n % p; dow = dow * i % p; n -= 1; } return (upe * extended_euclidean(p, dow)) % p; }
template<class T> T math_gcd(T a, T b) { if (b == 0) { return a; } else { return math_gcd(b, a % b); } }
template<class T> T math_lcm(T a, T b) { return a * b / math_gcd(a, b); }
template<class T> T SumStep(T a, T n, T d) { return n * (2 * a + (n - 1) * d) / 2; }
template<class T> T SumRange(T a, T b, T d) { return SumStep(a, (b - a) / d, d); }
constexpr ll MOD = 1000000007;
ll N, M;
void Main()
{
ll N;
cin >> N;
grapth<pll> G(N);
rep(i, N - 1)
{
ll a, b, c;
cin >> a >> b >> c;
a--; b--;
G[a].emplace_back(pair(b, c));
G[b].emplace_back(pair(a, c));
}
ll Q, K;
cin >> Q >> K;
K--;
vec<ll> R(N, -1);
{
queue<ll> q;
q.push(K);
R[K] = 0;
while (!q.empty())
{
ll now = q.front();
q.pop();
for (auto toData : G[now])
{
ll to = toData.first;
if (R[to] == -1)
{
R[to] = R[now] + toData.second;
q.push(to);
}
}
}
}
debugvar(R);
string out;
rep(Qi, Q)
{
ll x, y;
cin >> x >> y;
x--; y--;
out += to_string(R[x] + R[y]);
out += '\n';
}
cout << out;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
Main();
std::cerr << flush;
std::cout << endl;
return 0;
} | 0 | 97,356,590 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[11000];
const string MINUSINF = "-";
void chmax_str(string &a, string b) {
if (a == MINUSINF) a = b;
else if (a.size() < b.size()) a = b;
else if (a.size() == b.size()) {
if (a < b) a = b;
}
}
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
rep(i, M) cin >> A[i];
rep(i, 11000) dp[i] = MINUSINF;
dp[0] = "";
rep(i, N) {
if (dp[i] == MINUSINF) continue;
for (auto a: A) {
chmax_str(dp[i + match[a - 1]], dp[i] + (char) ('0' + a));
}
}
cout << dp[N] << endl;
} | #include<iostream>
#include<stdio.h>
using namespace std;
int main() {
int H,a[250],i;
cin>>H;
for (i = 1;i <= H;i++)cin>>a[i];
for (i = 1;i <= H;i++) {
if (i / 2 == 0) {
printf("node %d: key = %d, left key = %d, right key = %d, \n", i,a[i], a[2 * i], a[2 * i + 1]);
}
else if (2 * i > H) {
printf("node %d: key = %d, parent key = %d, \n",i,a[i],a[i/2]);
}
else if (2 * i + 1>H) {
printf("node %d: key = %d, parent key = %d, left key = %d, \n", i, a[i], a[i / 2], a[2 * i]);
}
else {
printf("node %d: key = %d, parent key = %d, left key = %d, right key = %d, \n", i, a[i], a[i / 2], a[2 * i], a[2 * i + 1]);
}
}
return 0;
} | 0 | 13,420,470 |
#include <stdio.h>
int main( void )
{
int A,B,C ;
scanf("%d %d %d", &A, &B, &C ) ;
printf("%s\n", (A==B&&A==C) ? "Yes" : "No" ) ;
return 0 ;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
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(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n; cin >> n;
ll sum = 0, last = 0;
for(ll i=1; i<=n; i++){
sum += i;
last = i;
if(sum >= n) break;
}
ll excess = sum - n;
for(ll i=1; i<=last; i++){
if(i == excess) continue;
cout << i << endl;
}
} | 0 | 2,297,563 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
vector<int> Solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> xs(n);
for (int i = 0; i < n; i++) {
xs[i] = s[i] == 'x';
}
vector<int> ys(n + 2);
for (int y0 = 0; y0 < 2; y0++) {
for (int y1 = 0; y1 < 2; y1++) {
ys[0] = y0;
ys[1] = y1;
for (int i = 2; i < n + 2; i++) {
ys[i] = xs[(i - 1) % n] ^ ys[i - 2] ^ ys[i - 1];
}
if (ys[0] == ys[n] && ys[1] == ys[n + 1]) {
ys.pop_back();
ys.pop_back();
return ys;
}
}
}
return vector<int>();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> ans = Solve();
if (ans.empty()) {
cout << -1 << endl;
} else {
for (int v : ans) {
cout << "SW"[v];
}
cout << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll >
#define vps vector< pair< string, string> >
#define vpi vector< pair< int, int> >
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn(i,a,n) for(ll i=a;i<n;i++)
#define forr(i,n,a) for(ll i=n-1;i>=a;i--)
#define scan(arr,a,n) for(int i=(a);i<(n);i++)cin>>(arr)[i];
#define print(arr,a,n) for(int i=(a);i<(n);i++)cout<<(arr)[i]<<' ';
const ll inf = 1e18;
ll add(ll x, ll y) {ll res = x + y; return (res >= mod ? res - mod : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= mod ? res % mod : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + mod : res);}
ll power(ll x, ll y) {ll res = 1; x %= mod; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, mod - 2);}
int main(){
fast;
ll n;
cin>>n;
ld a[n], ans = 0;
forn(i, 0, n){
cin>>a[i];
a[i] = (1.0)/a[i];
ans+=a[i];
}
cout<<fixed<<setprecision(10)<<(1/ans)<<endl;
} | 0 | 46,445,592 |
#include<iostream>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,money;
while(cin >>n>>money &&( n>0||money>0)){
pair<int,int> PD[10010];
int p,d;
for(int i=0;i<n;i++){
cin >>d>>p;
PD[i]=make_pair(p,d);
}
sort(PD,PD+n);
int need;
int ans=0;
for(int i=0;i<n;i++){
need=i;
if(PD[n-1-i].second<=money){
money-=PD[n-1-i].second;
}else{
ans+=PD[n-1-i].first*(PD[n-1-i].second-money);
break;
}
}
for(int j=0;j<n-1-need;j++){
ans+=PD[j].first*PD[j].second;
}
cout << ans <<endl;
}
} | #include<stdio.h>
#include<string.h>
int main(){
char s1[101],s2[101];
int n,i,taro=0,hana=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %s",s1,s2);
if(strcmp(s1,s2)==0){
taro++;
hana++;
}
if(strcmp(s1,s2)>0){
taro=taro+3;
}
if(strcmp(s1,s2)<0){
hana=hana+3;
}
}
printf("%d %d\n",taro,hana);
return(0);
} | 0 | 22,377,919 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#include <cstdio>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)return x;
return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y)*y;
}
ll kai(ll x, ll y, ll m) {
ll res = 1;
for (ll i = x - y + 1; i <= x; i++) {
res *= i; res %= m;
}
return res;
}
ll mod_pow(ll x, ll y, ll m) {
ll res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
ll comb(ll x, ll y, ll m) {
if (y > x)return 0;
return kai(x, y, m) * mod_pow(kai(y, y, m), m - 2, m) % m;
}
int n;
int cnt[300010];
int cum[300010];
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a; cin >> a;
cnt[a]++;
}
sort(cnt + 1, cnt + n + 1);
reverse(cnt + 1, cnt + n + 1);
cum[1] = cnt[1];
for (int i = 2; i <= n; i++)cum[i] = cum[i - 1] + cnt[i];
int k = 1;
for (int i = 1; i <= n; i++) {
while (n - cum[k] < cnt[k] * (i - k) && k + 1 < i)k++;
if (n - cum[k] < cnt[k] * (i - k))cout << (n - cum[k]) / (i - k) << endl;
else cout << (n - cum[k - 1]) / (i - k + 1) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<int> h(N);
int ans = 0;
rep(i, N){
cin >> h[i];
if(i == 0){
ans += h[i];
} else {
if(h[i] <= h[i-1]){
continue;
} else {
ans += h[i] - h[i-1];
}
}
}
cout << ans << endl;
return 0;
} | 0 | 40,626,559 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define modd 998244353
#define inf 1e18
#define ff first
#define ss second
#define pb push_back
#define pii pair<int,int>
#define mii map<int,int>
#define vi vector<int>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> pbds;
const int N = 300005;
void solve() {
int n, m; cin >> n >> m;
vi a(m);
int s = 0;
for (int i = 0; i < m; i++) cin >> a[i], s += a[i];
if (s > n) cout << "-1\n";
else cout << (n - s) << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int T = 1;
for (int i = 1; i <= T; i++) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
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;
}
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
}
signed main() {
string S;
cin >> S;
SORT(S);
if (S[0] == S[1] && S[2] == S[3] && S[1] != S[2]) {
COUT("Yes");
} else {
COUT("No");
}
return 0;
} | 0 | 18,824,190 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000005
bool vis[N];
int ret[N];
void solve() {
int m,k;scanf("%d %d ", &m,&k);
int r = (1<<m)-1;
if(k<=r) {
if(k==0) {
for(int i=0;i<=r;++i) {
printf("%d %d ", i,i);
}
putchar('\n');
return;
} if(m==1) {
printf("-1\n");
return;
} else {
int check = k&(k-1);
vector<int> go;
vis[k] = true;
if(check==0) {
go.push_back(r);
vis[r] = true;
for(int i=0;i<m;++i) {
if( (k&(1<<i)) ==0) {
go.push_back(1<<i);
vis[1<<i] = true;
}
}
} else {
for(int i=0;i<m;++i) {
if( (k&(1<<i)) ) {
go.push_back(1<<i);
vis[1<<i] = true;
}
}
}
int pos = 0;
for(int i=0;i<go.size();++i) {
ret[pos++] = go[i];
}
for(int i=0;i<=r;++i) {
if(!vis[i]) {
ret[pos++] = i;
}
}
ret[pos++] = k;
for(int i=r;i>=0;--i) {
if(!vis[i]) {
ret[pos++] = i;
}
}
for(int i=go.size()-1;i>=0;--i) {
ret[pos++] = go[i];
}
ret[pos++] = k;
for(int i=0;i<pos;++i) {
printf("%d ", ret[i]);
}
putchar('\n');
}
} else {
printf("-1\n");
}
}
int main() {
solve();
return 0;
} | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> c(n - 1), s(n - 1), f(n - 1);
rep(i, n - 1) cin >> c[i] >> s[i] >> f[i];
vector<int> ans(n, 0);
rep(k, n - 1) {
int tot = 0;
forr(i, k, n - 1) {
if(tot < s[i]) tot = s[i];
else if((tot - s[i]) % f[i] != 0) {
tot = tot + f[i] - tot % f[i];
}
tot += c[i];
}
ans[k] = tot;
}
for(auto x : ans) cout << x << endl;
return 0;
} | 0 | 37,298,178 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
ll N,M;
scanf("%lld %lld",&N,&M);
if(N >= M/2){
printf("%lld\n",M/2);
}else{
ll ans = N;
M -= 2*N;
ans += M/4;
printf("%lld\n",ans);
}
return 0;
} | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define maxim INT_MAX
#define fi first
#define se second
#define INF 1e16
#define mod 1000000007
int main()
{
ll n,m;
cin>>n>>m;
ll dp[n+1][m+1];
memset(dp,0,sizeof(dp));
char ar[n][m];
for(ll i=0;i<n;i++)
cin>>ar[i];
for(ll i=1;i<=m;i++)
{
if(ar[0][i-1]!='#')
dp[1][i]=1;
else
break;
}
for(ll i=1;i<=m;i++)
{
if(ar[i-1][0]!='#')
dp[i][1]=1;
else
break;
}
for(ll i=2;i<=n;i++)
{
for(ll j=2;j<=m;j++)
{
if(ar[i-1][j-1]!='#')
{
dp[i][j]=(dp[i-1][j]+dp[i][j-1])%mod;
}
}
}
cout<<dp[n][m]<<endl;
} | 0 | 98,619,167 |
#include <iostream>
#include <iomanip>
using namespace std;
const int mxN = 2e5 + 5;
long long a[mxN], cnt[mxN];
int main() {
double l;
cin >> l;
cout << fixed << setprecision(7) << l * l * l / 27;
} | #include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd;
};
vector<vector<int>>adj(10);
ll n;
bool check(string s,string t)
{
int n1=s.length(),n2=t.length(),j=0;
for(int i=0;i<n1;i++)
{
if(s[i]==t[j])
j++;
if(j==n2)
return 1;
}
return 0;
}
int main()
{
_IOS();
int i=1;
int a,b,c;
cin>>a>>b>>c;
set<int>s;
while(!s.count((a*i)%b))
s.insert((a*i)%b),i++;
if(s.count(c))
cout<<"YES";
else
cout<<"NO";
} | 0 | 45,536,227 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout << 10-(N/100)/2 << endl;
} | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define rep0(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define reprev1(i,n) for(int i=n;i>0;i--)
#define reprev0(i,n) for(int i=n-1;i>=0;i--)
#define reprev(i,x,y) for(int i=x;i>=y;i--)
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define si set<int>
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define usi unordered_set<int>
#define umii unordered_map<int,int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int,vi,greater<int> >
#define sp(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define in(a,n) vi a(n);rep0(i,n)cin>>a[i];
#define in1(a,n) vi a(n+1);rep1(i,n)cin>>a[i];
#define w(t) int t;cin>>t;while(t--)
#define endl '\n'
#define mod 1000000007
#define M (int)1e6+6
#define inf 1e18
using namespace std;
int n,m,k,x,y,z,a1,b,c,d,i,j;
void sol()
{ string s,t;
cin>>s>>t;
c=0;
rep0(i,3)if(s[i]==t[i])c++;
cout<< c<<endl;
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
sol();
return 0;
} | 0 | 14,528,869 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
void File(){
freopen("1.in","r",stdin);
freopen("2.out","w",stdout);
}
#define REP(i,a,b) for(register int i=a;i<=b;++i)
#define DREP(i,a,b) for(register int i=a;i>=b;--i)
#define MREP(i,x) for(register int i=beg[x];i;i=E[i].last)
#define ll long long
int n;
int main(){
scanf("%d",&n);
REP(i,1,n){
ll a,b;
scanf("%lld%lld",&a,&b);
ll dd=sqrt(a*b),ans=dd*2-1;
if(dd*dd==a*b){
if(a==b)ans--;
else ans-=2;
}
else if(dd*(dd+1)>=a*b)ans--;
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007;
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y);}
int size(int x) { return -d[find(x)];}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m; cin >> n >> m;
UnionFind uf(n);
vector<int> p(n);
rep(i,n){
cin >> p[i];
p[i]--;
}
rep(i,m){
int x,y; cin >> x >> y;
x--;y--;
uf.unite(x,y);
}
int ans = 0;
rep(i,n)
ans += (uf.same(i,p[i]));
cout << ans << endl;
} | 0 | 21,324,708 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
const ll MOD = 1000000007;
int main(){
int a[3];
rep(i, 3) cin >> a[i];
int b[3];
b[1] = abs(a[1] - a[0]);
b[0] = abs(a[2] - a[0]);
b[2] = abs(a[2] - a[1]);
cout << min(b[0]+b[1], min(b[1]+b[2], b[0]+b[2])) <<endl;
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n);
vector<int> w(n);
rep(i, n) cin >> w[i];
vector<int> s(n + 1);
rep(i, n) s[i + 1] = s[i] + w[i];
int ans = 1000000;
rep(i, n + 1) ans = min(ans, abs(s[n] - 2 * s[i]));
out(ans);
} | 0 | 88,572,997 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n;
cin>>n;
vector<long long int> v(n+1,1);
for(int i=2;i<=n;i++){
for(int j=i;j<=n;j+=i){
v[j]++;
}
}
long long sum=0;
for(int i=1;i<=n;i++){
sum+=v[i]*i;
}
cout<<sum<<endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
int dp[1 << 26];
int main() {
string s;
cin >> s;
int bit = 0, opt;
fill(dp, dp + (1 << 26), INF);
dp[0] = 0;
rep(i, s.size()) {
bit ^= (1 << (s[i] - 'a'));
opt = INF;
rep(j, 26) {
opt = min(opt, dp[bit ^ (1 << j)] + 1);
}
if (bit == 0) opt = 1;
dp[bit] = min(dp[bit], opt);
}
cout << opt << endl;
} | 0 | 1,484,252 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
map<int, int> m;
rep(i, N){
int a; cin >> a;
m[a]++;
}
ll ans1 = 0;
ll ans2 = 0;
for(auto p : m){
auto key = p.first;
auto value = p.second;
if(value >= 4){
ans2 = key;
ans1 = key;
} else if (value >= 2){
ans1 = ans2;
ans2 = key;
}
}
cout << ans1*ans2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define revrep(i,n,g) for (int i = n; i >= g; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int m,k;
cin >> m >> k;
if (m <= 1) {
if (m == 0 && k == 0) {
cout << "0 0" << endl;
} else if (m == 1 && k == 0) {
cout << "0 0 1 1" << endl;
} else {
cout << "-1" << endl;
}
} else {
if ((1<<m) <= k) cout << -1 << endl;
else {
rep(i,0,1<<m) {
if (i == k) continue;
cout << i << " ";
}
cout << k << " ";
revrep(i,(1<<m)-1,0) {
if (i == k) continue;
cout << i << " ";
}
cout << k << endl;
}
}
return 0;
} | 0 | 41,905,209 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n; cin>>n;
vi a(n),b(n);
for (int &i: a) cin >> i ;
for (int &i: b) cin >> i ;
int ok = 0,s=0;
for (int i=0;i<n;i++){
s += max(0LL,(a[i]-b[i]));
ok += max(0LL,(b[i]-a[i])/2);
}
if (ok >= s ) printf("Yes\n");
else printf("No\n");
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
string ans;
string kekka = "";
bool chk = false;
cin >> str >> ans;
if (str.size() < ans.size()) {
cout << "UNRESTORABLE" << endl;
return 0;
}
reverse(str.begin(), str.end());
reverse(ans.begin(), ans.end());
for (int i = 0; i <= str.size() - ans.size(); i++) {
chk = false;
for (int j = 0; j < ans.size(); j++) {
if (str.at(i + j) == ans.at(j) || str.at(i + j) == '?') {
chk = true;
} else {
chk = false;
break;
}
}
if (chk == true) {
if (i == 0) {
kekka += ans;
for (int j = ans.size(); j < str.size(); j++) {
if (str.at(j) == '?') {
kekka += 'a';
} else {
kekka += str.at(j);
}
}
} else {
for (int j = 0; j <= i - 1; j++) {
if (str.at(j) == '?') {
kekka += 'a';
} else {
kekka += str.at(j);
}
}
kekka += ans;
for (int j = i + ans.size(); j < str.size(); j++) {
if (str.at(j) == '?') {
kekka += 'a';
} else {
kekka += str.at(j);
}
}
}
reverse(kekka.begin(), kekka.end());
cout << kekka;
cout << endl;
return 0;
}
}
cout << "UNRESTORABLE" << endl;
} | 0 | 45,776,195 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
const int N=1011111;
int fa[N],d[N];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
int find(int x) {
if (!fa[x]) return x;
int f=find(fa[x]);
d[x]+=d[fa[x]];
return fa[x]=f;
}
int main(void) {
int n=read(),m=read();
for (;m--;) {
int x=read(),y=read(),k=read();
int fx=find(x),fy=find(y);
if (fx==fy) {
if (d[y]-d[x]!=k) return 0&puts("No");
} else fa[fy]=fx,d[fy]=d[x]+k-d[y];
}
return 0&puts("Yes");
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
map<int, int> mp;
for(int i=0; i<n; i++){
int a;
cin >> a;
mp[a]++;
}
int typs = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for(int i=0; i<=200000; i++){
if(mp[i] > 0){
typs++;
pq.push(mp[i]);
}
}
int ans = 0;
while(typs > k){
typs -= 1;
ans += pq.top();
pq.pop();
}
cout << ans << endl;
return 0;
} | 0 | 35,557,033 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
int ax = a.size();
int bx = b.size();
int cx = c.size();
string flag = "NO";
if(a.at(ax-1) == b.at(0)){
if(b.at(bx-1) == c.at(0)){
flag = "YES";
}
}
cout << flag;
} | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL p[100005], q[100005];
int main() {
LL w, h;
cin >> w >> h;
for (int i = 0; i < w; i++) {
cin >> p[i];
}
p[w] = 999999999;
sort(p, p + w);
for (int i = 0; i < h; i++) {
cin >> q[i];
}
q[h] = 999999999;
sort(q, q + h);
LL pi = 0, qi = 0;
LL wc = 0, hc = 0;
LL need = w * h + w + h;
LL ans = 0;
while (true) {
if (p[pi] < q[qi]) {
LL num = h - hc + 1;
if (num >= need) {
ans += p[pi] * need;
break;
} else {
ans += p[pi] * num;
need -= num;
}
wc++;
pi++;
} else {
LL num = w - wc + 1;
if (num >= need) {
ans += q[qi] * need;
break;
} else {
ans += q[qi] * num;
need -= num;
}
hc++;
qi++;
}
}
printf("%lld\n", ans);
} | 0 | 44,280,597 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
int ans = 0;
int cur_H = 0;
rep(i, n){
int a;
cin >> a;
cur_H = max(cur_H, a);
if(a == cur_H) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX
#define MIN_I INT_MIN
#define MAX_UI UINT_MAX
#define MAX_LL LLONG_MAX
#define MIN_LL LLONG_MIN
#define MAX_ULL ULLONG_MAX
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef pair<ll,ll> PLL;
typedef pair<char,int> PCI;
typedef pair<int,char> PIC;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<ll,char> PLC;
typedef pair<char,ll> PCL;
inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}
int main(void){
SPEEDUP
cout << setprecision(15);
int N;cin >> N;
ll K;cin >> K;
vector<ll> v(N);
vector<ll> w(N);
rep(i,N)cin >> v[i] >> w[i];
int M = 30;
ll ans = 0;
rep(i,M){
ll k;
if(i==0) k = K;
else if((K>>i)&1) k = (K - (1ll<<i)) | ((1ll<<i) - 1ll);
else continue;
ll sum = 0;
rep(i,N) if(k == (k|v[i])) sum+=w[i];
ans = max(ans,sum);
}
cout << ans << endl;
return 0;
} | 0 | 19,535,897 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#include <math.h>
#include <cstring>
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
#define INF (lint)10000000000000000
#define mod = (int)1000000007;
#pragma endregion
lint n;
vector<lint> d;
void input() {
cin >> n;
d.resize(n);
for (int i = 0; i < n; i++)
cin >> d[i];
return;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
ulint lcm(ulint a, ulint b) {
return a / gcd(a, b) * b;
}
unsigned long long solve() {
if (n == 1) return d[0];
unsigned long long ans;
ans = lcm(d[0], d[1]);
for (int i = 2; i < n; i++) {
ans = lcm(ans, d[i]);
}
return ans;
}
int main(void) {
input();
printf("%llu\n", solve());
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define db double
#define pi 3.14159265358979323846
#define pow pw
int pw(int a,int b){
int ans=1;
while(b){
if (b%2) ans*=a;
a*=a;
b/=2;
}
return(ans);
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
vector<int> sieve(n+1);
for (int i=2;i<=sqrt(n);i++)
if (sieve[i]==0)
for (int j=i*i;j<=n;j+=i) sieve[j]=i;
int ans=0;
for (int i=1;i<=n;i++)
{
int j=i,res=1;
while(sieve[j])
{
int d=sieve[j],c=0;
while(j%d==0)
{
c++;
j/=d;
}
res*=(c+1);
}
if (j>1) res*=2;
ans+=i*res;
}
cout<<ans;
return 0;
} | 0 | 16,147,699 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int n,q;
vector<int> tree[200005];
int cnt[200005];
ll sum[200005];
int seen[200005];
void dfs(int n) {
for(int i = 0;i<int(tree[n].size());i++) {
if(!seen[tree[n][i]]) {
seen[tree[n][i]] = 1;
sum[tree[n][i]] = cnt[tree[n][i]] + sum[n];
dfs(tree[n][i]);
}
}
}
int main() {
cin>>n>>q;
rep(i,n-1) {
int a,b;cin>>a>>b;
tree[a-1].push_back(b-1);
tree[b-1].push_back(a-1);
}
rep(i,q) {
int p,x;cin>>p>>x;
cnt[p-1]+=x;
}
seen[0]=1;
sum[0]=cnt[0];
dfs(0);
rep(i,n) {
cout<<sum[i]<<" ";
if(i==n-1) cout<<endl;
}
} | #include <cstdio>
#define MAX(a, b)((a) < (b) ? (b) : (a))
using namespace std;
int pow32(int base, int exp)
{
int ret = 1;
while (exp) {
if ((exp & 1) == 1) ret *= base;
exp >>= 1;
base *= base;
}
return ret;
}
void YES()
{
printf("YES\n");
}
void NO()
{
printf("NO\n");
}
int main() {
int N;
int a, b, c;
int longest;
scanf("%d", &N);
while (N--) {
scanf("%d %d %d", &a, &b, &c);
longest = MAX(a, MAX(b, c));
if (longest == a) {
if (pow32(a, 2) == (pow32(b, 2) + pow32(c, 2))) YES();
else NO();
} else if (longest == b) {
if (pow32(b, 2) == (pow32(a, 2) + pow32(c, 2))) YES();
else NO();
} else if (longest == c) {
if (pow32(c, 2) == (pow32(a, 2) + pow32(b, 2))) YES();
else NO();
}
}
return 0;
} | 0 | 86,072,285 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a;
cin >> n >> a;
if (n % 500 <= a)
cout << "Yes" << endl;
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
scanf("%d",&n);
queue <ll> q;
for(int i=1; i<10; i++) q.push(i);
ll ans = 0;
while(!q.empty()){
ll a = q.front();
q.pop();
n--;
if(n==0){
ans = a;
break;
}
ll r = a%10;
if(r==0){
q.push(10*a);
q.push(10*a+1);
}
else if(r==9){
q.push(10*a+8);
q.push(10*a+9);
}
else{
q.push(10*a+r-1);
q.push(10*a+r);
q.push(10*a+r+1);
}
}
cout<<ans<<endl;
return 0;
} | 0 | 58,779,356 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
string N; cin >> N;
int su = 0;
for (int i = 0; i < N.size(); i++) {
su += N[i] - '0';
}
if (su%9) cout << "No\n";
else cout << "Yes\n";
} | #include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int inf=1e9+7;
int N,A,B,C;
int l[8];
int dfs(int cur,int a,int b,int c){
if(cur==N){
if(a==0||b==0||c==0) return inf;
return abs(A-a)+abs(B-b)+abs(C-c)-30;
}
int r0,r1,r2,r3;
r0=dfs(cur+1,a,b,c);
r1=dfs(cur+1,a+l[cur],b,c)+10;
r2=dfs(cur+1,a,b+l[cur],c)+10;
r3=dfs(cur+1,a,b,c+l[cur])+10;
return min({r0,r1,r2,r3});
}
int main(){
cin>>N>>A>>B>>C;
for(int i=0;i<N;i++) cin>>l[i];
cout<<dfs(0,0,0,0)<<endl;
} | 0 | 2,353,405 |
#include <cstdio>
using LL = long long;
const int MAXN = (int)1e5;
LL a[MAXN];
struct LinearBasis {
static const int MAXL = 64;
LL a[MAXL];
LinearBasis() {
for (int i = 0; i < MAXL; ++i) a[i] = 0;
}
void Add(LL vec) {
for (int j = MAXL - 1; j >= 0 && vec > 0; --j) {
if (((vec >> j) & 1) == 0) continue;
if (a[j] > 0) {
vec ^= a[j];
continue;
}
for (int k = 0; k < j; ++k) {
if ((vec >> k) & 1) vec ^= a[k];
}
for (int k = j + 1; k < MAXL; ++k) {
if ((a[k] >> j) & 1) a[k] ^= vec;
}
a[j] = vec;
break;
}
}
void Build(LL *vec_array, int len) {
for (int i = 0; i < len; ++i) Add(vec_array[i]);
}
void Merge(const LinearBasis &another) {
for (int i = 0; i < MAXL; ++i) Add(another.a[i]);
}
LL GetMax() {
LL res = 0;
for (int i = MAXL - 1; i >= 0; --i) {
res ^= a[i];
}
return res;
}
};
LL solve(int n) {
LL xor_sum = 0;
for (int i = 0; i < n; ++i) xor_sum ^= a[i];
LinearBasis lb;
for (int i = 0; i < lb.MAXL; ++i) {
if (((xor_sum >> i) & 1) == 0) continue;
for (int j = 0; j < n; ++j) {
if ((a[j] >> i) & 1) a[j] ^= (1LL << i);
}
}
lb.Build(a, n);
LL lb_max = lb.GetMax();
return lb_max * 2 + xor_sum;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%lld", a + i);
printf("%lld\n", solve(n));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=1000000000;
int main() {
int h,n;
cin>>h>>n;
ll dp[1010][10010];
ll a[n];
ll b[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(int i=0;i<1010;i++){
for(int j=0;j<10010;j++){
dp[i][j]=inf;
}
}
dp[0][0]=0;
for(int i=0;i<n;i++){
for(int j=0;j<=h;j++){
dp[i+1][j]=min(dp[i+1][j],dp[i][j]);
dp[i][(j+a[i])<=h?(j+a[i]):h]=min(dp[i][j]+b[i],dp[i][(j+a[i])<=h?(j+a[i]):h]);
}
}
cout<<dp[n-1][h]<<endl;
} | 0 | 9,061,117 |
#include<iostream>
using namespace std;
int goban[18][18] = { 0 };
int ans;
void check(int x,int y,int a,int b) {
if (x == a&&y == b) { ans++; }
else {
if (goban[x + 1][y] == 1) {
check(x + 1, y, a, b);
}
if (goban[x][y + 1] == 1) {
check(x, y + 1, a, b);
}
}
}
int main(void) {
while (1) {
ans = 0;
int a, b;
cin >> a >> b;
if (a == 0) break;
int n;
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= b; j++) goban[i][j] = 1;
}
cin >> n;
while (n) {
int x, y;
cin >> x>>y;
goban[x][y] = 0;
n--;
}
check(1,1,a,b);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,sum=0;
cin>>n;
vector<long long> v(n), l(n);
for(long long &i:v)cin>>i,sum+=i;
long long g=n*(n+1)/2;
if(sum%g){
cout<<"NO";
return 0;
}
long long op=sum/g;
long long lds=0;
for(int i=0; i<n; i++){
l[i]=v[i]-v[i?i-1:n-1];
}
long long o2=0;
for(int i=0; i<n; i++){
if(op-l[i]<0 || (op-l[i])%n){
cout<<"NO";
return 0;
}
o2+=(op-l[i])/n;
}
cout<<(o2==op?"YES":"NO");
return 0;
} | 0 | 62,195,059 |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define foo(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define deb(x) cout << #x << " --> " << x << endl;
#define deb1a(v) cout << #v << "--->" << endl; for (auto it : v) cout << it << " "; cout << endl;
#define deb2a(v) cout << #v << "--->" << endl;for (auto it:v){for(auto it1 : it){cout << it1 << " ";}cout<< endl;}
#define deb3a(v) cout << #v << "-->" << endl; for(auto it:v){cout << it.fi << " " << it.se << endl;}
#define mod 998244353
#define so(v) sort(v.begin(),v.end())
#define fi first
#define se second
#define db1(x) cout<<#x<<"="<<x<<endl
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl
int power(int x, unsigned int y, int p){ int res = 1;x = x % p;while (y > 0) { if (y & 1)res = (res*x) % p;y = y>>1; x = (x*x)% p;} return res;}
int mI(int a, int m) {return power(a, m - 2, m);}
#define double long double
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
n++;
vec pos(n+5,1);
vec m(n + 5, 0);
vec v(n);
fo(i,n){
cin >> v[i];
}
if(n==1){
if(v[0]==1){
cout << 1;
return 0;
}
else{
cout<<-1;
return 0;}
}
if(v[0]!=0){
cout << -1;
return 0;
}
int in = 0;
int ans = 0;
int curr = 0;
foo(i,1,n){
int vall = v[i];
if(i==n-1)
vall--;
while(vall>0){
if(in>=i){
cout << -1;
return 0;
}
int fii = pos[in]+curr;
if(fii>vall){
ans += (vall) * (i - in);
m[i] -= vall;
m[in + 1] += vall;
pos[in] -= vall;
vall = 0;
}
else{
ans += (fii) * (i - in);
m[i] -= fii;
m[in + 1] += fii;
vall -= fii;
in++ ;
curr += m[in];
}
}
}
cout << n + ans;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> groups;
char key = '1';
int cnt_key = 0;
for(int i=0;i<N;i++){
if(S.at(i)==key){
cnt_key++;
}
else{
groups.push_back(cnt_key);
key = (key=='0')?'1':'0';
cnt_key = 1;
}
}
groups.push_back(cnt_key);
if(groups.size()%2 == 0)groups.push_back(0);
int max_people = 0;
if(K >= groups.size()/2){
max_people = N;
}
else{
for(int i=0;i<groups.size()-2*K;i+=2){
int sum_groups = 0;
for(int j=i;j<i+1+2*K;j++){
sum_groups += groups.at(j);
}
if(max_people < sum_groups)max_people = sum_groups;
}
}
cout << max_people << endl;
} | 0 | 43,478,438 |
#include <bits/stdc++.h>
int main(void)
{
int K, S;
std::cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int z = S - x - y;
if (z >= 0 && z <= K) {
ans++;
}
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++i)
#define repr(i,n) for(int _i=(n),i=_i;i>0;--i)
#define db(x) cerr<<#x<<" = "<<x<<" ";
#define db2(x,y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<") ";
#define db3(x,y,z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = ("<<x<<", "<<y<<", "<<z<<") ";
#define ln cout<<endl;
#define all(a) (a).begin(),(a).end()
#define dig(n) to_string(n).length()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define se second
#define fi first
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> iP;
typedef pair<P,P> PP;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
bool flag=false;
ll ans=0,sum=0;
vector<int> a(4);
vector<int> t = {1,4,7,9};
cin>>a[0]>>a[1]>>a[2]>>a[3];
sort(all(a));
if(a == t)cout << "YES" <<endl;
else cout << "NO" <<endl;
return 0;
} | 0 | 31,339,028 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int gcd(int a,int b){
int temp;
while(b!=0){
temp=b;
b=a%b;
a=temp;
}
return a;
}
int main(){
int n,x; cin>>n>>x;
int xi,ans; cin>>xi;
ans=abs(x-xi);
rep(i,n-1){
cin>>xi;
ans=gcd(ans,abs(x-xi));
}
cout<<ans<<endl;
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
lli n;
mat g;
lli u,k,v;
queue<lli> q;
queue<lli> d;
vbl vis;
vll ans;
int main(){
cin >> n;
g = mat(n+1);
vis = vbl(n+1);
ans = vll(n+1,-1);
for(lli i = 0;i < n;i++){
cin >> u >> k;
for(lli j = 0;j < k;j++){
cin >> v;
g[u].push_back(v);
}
}
q.push(1);
d.push(0);
while(!q.empty()){
lli p = q.front();
lli r = d.front();
q.pop();
d.pop();
if(vis[p]) continue;
vis[p] = true;
ans[p] = r;
for(lli i = 0;i < g[p].size();i++){
if(!vis[g[p][i]]) q.push(g[p][i]),d.push(r+1);
}
}
for(lli i = 1;i <= n;i++) cout << i << " " << ans[i] << endl;
return 0;
} | 0 | 76,341,594 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
if(x>=400&&x<600)
cout << "8" << endl;
if(x>=600 && x<800)
cout << "7" << endl;
if(x>=800 && x<1000)
cout << "6" << endl;
if(x>=1000 && x<1200)
cout << "5" << endl;
if(x>=1200 && x<1400)
cout << "4" << endl;
if(x>=1400 && x<1600)
cout << "3" << endl;
if(x>=1600 && x<1800)
cout << "2" << endl;
if(x>=1800 && x<2000)
cout << "1" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int mod=1e9+7;
int main()
{
int n,k;
cin >> n >> k;
int a[n+1];
for(int i=1;i<=n;i++)
{
cin >> a[i];
}
int dp[n+1][k+1];
dp[0][0]=1;
for(int i=1;i<=k;i++)
{
dp[0][i]=0;
}
for(int i=1;i<=n;i++)
{
int sums[k+1];
sums[0]=dp[i-1][0];
for(int j=1;j<=k;j++)
{
sums[j]=(sums[j-1]+dp[i-1][j])%mod;
}
for(int j=0;j<=k;j++)
{
int tr=sums[j];
int unreachable=j-a[i]-1;
if(unreachable>=0)
{
tr=(tr-sums[unreachable]+mod)%mod;
}
dp[i][j]=tr;
}
}
cout << dp[n][k];
return 0;
} | 0 | 55,922,726 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d,x=0,y=0,x2=0,y2=0;
string s;
cin>>s;
a=s[0]-'0';
b=s[1]-'0';
c=s[2]-'0';
d=s[3]-'0';
if(a+b+c+d==7){
cout<<a;cout<<"+";
cout<<b;cout<<"+";
cout<<c;cout<<"+";
cout<<d;cout<<"=7";
}
else if(a+b+c-d==7){
cout<<a;cout<<"+";
cout<<b;cout<<"+";
cout<<c;cout<<"-";
cout<<d;cout<<"=7";
}
else if(a+b-c+d==7){
cout<<a;cout<<"+";
cout<<b;cout<<"-";
cout<<c;cout<<"+";
cout<<d;cout<<"=7";
}
else if(a-b+c+d==7){
cout<<a;cout<<"-";
cout<<b;cout<<"+";
cout<<c;cout<<"+";
cout<<d;cout<<"=7";
}
else if(a+b-c-d==7){
cout<<a;cout<<"+";
cout<<b;cout<<"-";
cout<<c;cout<<"-";
cout<<d;cout<<"=7";
}
else if(a-b+c-d==7){
cout<<a;cout<<"-";
cout<<b;cout<<"+";
cout<<c;cout<<"-";
cout<<d;cout<<"=7";
}
else if(a-b-c+d==7){
cout<<a;cout<<"-";
cout<<b;cout<<"-";
cout<<c;cout<<"+";
cout<<d;cout<<"=7";
}
else if(a-b-c-d==7){
cout<<a;cout<<"-";
cout<<b;cout<<"-";
cout<<c;cout<<"-";
cout<<d;cout<<"=7";
}
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"GREATER":"LESS")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
string a, b;
cin >> a >> b;
while (a.size() < b.size()) a = "0" + a;
while (a.size() > b.size()) b = "0" + b;
if (a == b) {
put("EQUAL");
}
else if (a < b) {
put("LESS");
}
else {
put("GREATER")
}
return 0;
} | 0 | 69,196,441 |
#include <iostream>
#define FLAME_MAX 10000
#define REP(i, n) for(int i = 0; i < (n); i++)
#define linear(x, A, B, C) ((A) * (x) + (B)) % (C)
using namespace std;
int main()
{
while(1){
int N, A, B, C, X;
cin >> N >> A >> B >> C >> X;
if(N == 0 && A == 0 && B == 0 && C == 0 && X == 0){
break;
}else{
int Y;
int x = X;
int f = 0;
REP(i, N){
cin >> Y;
if(x != Y){
while(x != Y && f <= FLAME_MAX){
f++;
x = linear(x, A, B, C);
}
}
if(i > 0)
f++;
x = linear(x, A, B, C);
}
if(f <= FLAME_MAX)
cout << f << endl;
else
cout << "-1" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string O,E,p;
cin>>O>>E;
int a=O.length();
int b=E.length();
for(int i=0;i<(a+b);i++){
if(i&1){
p+=E[i/2];
}else{
p+=O[i/2];
}
}
cout<<p<<endl;
} | 0 | 83,104,245 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
cout << n * (n+1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> students, pos;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
students.push_back(make_pair(a, b));
}
for (int i = 0; i < M; i++) {
int c, d;
cin >> c >> d;
pos.push_back(make_pair(c, d));
}
for (int i = 0; i < N; i++) {
int dis_min = INT_MAX;
int ans = INT_MAX;
for (int j = 0; j < M; j++) {
int dis = abs(students[i].first - pos[j].first) +
abs(students[i].second - pos[j].second);
if (dis < dis_min) {
dis_min = dis;
ans = j + 1;
}
}
cout << ans << endl;
}
} | 0 | 39,301,758 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template<typename T>vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type
fill_v(U& u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type
fill_v(U& u, const V... v) { for (auto& e : u) fill_v<T>(e, v...); }
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() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxv = 11;
int d[maxv][maxv];
int V;
int x[maxv];
void warshall_floyd()
{
for(int k=0; k<V; k++)
for(int i=0; i<V; i++)
for(int j=0; j<V; j++)
d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
}
int main()
{
int E;
while(scanf("%d", &E)==1 && E)
{
memset(d, 0x3f, sizeof(d));
for(int i=0; i<maxv; i++)
d[i][i] = 0;
V = 0;
for(int i=0; i<E; i++)
{
int u, v, cost;
scanf("%d%d%d", &u, &v, &cost);
d[u][v] = cost;
d[v][u] = cost;
V = max(V, max(v, u)+1);
}
warshall_floyd();
memset(x, 0, sizeof(x));
for(int i=0; i<V; i++)
{
for(int j=0; j<V; j++)
x[i] += d[i][j];
}
int ans = min_element(x, x + V) - x;
cout << ans << ' ' << x[ans] << endl;
}
return 0;
} | 0 | 13,248,538 |
#include<bits/stdc++.h>
using namespace std;
long long int k;
#define MAX 50
long long int ans[MAX];
int main(){
scanf("%lld", &k);
long long int rest = k / MAX;
for (int i = 0; i < MAX; i++){
ans[i] += rest*MAX;
ans[i] -= rest*(MAX-1);
ans[i] += 49;
}
k %= MAX;
for (int i = 0; i < k; i++){
ans[i] += MAX;
for (int j = 0; j < MAX; j++){
if (i != j){
ans[j]--;
}
}
}
puts("50");
for (int i = 0; i < MAX; i++){
if (i)printf(" ");
printf("%lld", ans[i]);
}
puts("");
return 0;
} | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N, A;
int rest;
cin >> N >> A;
rest = N % 500;
if((rest==0)||(rest<=A)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 | 68,305,954 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
int cnt = x;
int tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
cnt += (d-1) / tmp + 1;
}
cout << cnt << endl;
return 0;
} | # include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<=b){
if(b<=c){
printf("%d %d %d\n",a,b,c);
}else if(b>c){
if(a<=c){
printf("%d %d %d\n",a,c,b);
}else if(a>c){
printf("%d %d %d\n",c,a,b);
}
}
}else if(a>b){
if(a<=c){
printf("%d %d %d\n",b,a,c);
}else if(a>c){
if(b<=c){
printf("%d %d %d\n",b,c,a);
}else if(b>c){
printf("%d %d %d\n",c,b,a);
}
}
}
return 0;
} | 0 | 3,130,818 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
ll n; cin >> n;
ll ans = n*(n-1)/2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
ll MODP = 998244353;
ll kai(ll x,ll y){
if(y == 0)return 1;
if(y == 1)return x;
if(y&1){
return (x*kai(x,y-1))%MOD;
}else{
ll t = kai(x,y/2);
return (t*t)%MOD;
}
}
ll comb(ll a,ll b,vector<ll> &p){
if(a == 0)return 1;
if(b == 0)return 1;
ll ans = p[a+b];
ans = (ans*kai(p[a],MOD-2))%MOD;
ans = (ans*kai(p[b],MOD-2))%MOD;
return ans;
}
ll mind(int x,vector<int> &v){
int ok = v.size()-1,ng = -1;
while(ok - ng > 1){
int next = (ok+ng)/2;
if(v[next] > x){
ok = next;
}else{
ng = next;
}
}
return ok;
}
ll maxd(int x,vector<int> &v){
int ok = 0,ng = v.size();
while(ng - ok > 1){
int next = (ok+ng)/2;
if(v[next] < x){
ok = next;
}else{
ng = next;
}
}
return ok;
}
int main(){
ll N,K;
cin >> N >> K;
vector<ll> P(N+1),C(N+1);
for(int i = 1;i <= N;i++)cin >> P[i];
for(int i = 1;i <= N;i++)cin >> C[i];
vector<vector<ll>> score(N+10,vector<ll> (N+10,0));
vector<vector<ll>> count(2,vector<ll> (N+1,0));
for(int i = 1;i <= N;i++){
ll cur = i;
for(int j = 1;j <= N;j++){
score[j][i] = score[j-1][i] + C[P[cur]];
cur = P[cur];
if(cur == i){
count[0][i] = j;
count[1][i] = score[j][i];
}
}
}
ll ans = (-1)*INFL;
for(int i = 1;i <= N;i++){
for(int j = 1;j <= N;j++){
ll a = count[0][j],b = count[1][j];
if(i > a)continue;
if(i > K)continue;
ll res = score[i][j];
if(b > 0)res += ((K-i)/a)*b;
if(res > ans){
ans = res;
a = i;
b = j;
}
}
}
cout << ans << endl;
return 0;
} | 0 | 25,350,449 |
#include <bits/stdc++.h>
using namespace std;
int SumDigit(int i) {
int res=0;
int tmp, digit;
for (int n=4; n>=0; n--) {
digit=pow(10,n);
tmp=i/digit;
i-=tmp*digit;
res+=tmp;
}
return res;
}
int Calc(int i, int a, int b) {
int x=SumDigit(i);
if (a <= x && x <=b) return i;
return 0;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans=0;
for (int i=1; i<=N; i++) {
ans+=Calc(i, A, B);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n,k[100]={0},max=0;
while(cin>>n){
k[n]++;
if(max<k[n]){
max=k[n];
}
}
for(int i=0;i<100;i++){
if(k[i]==max){
cout<<i<<endl;
}
}
} | 0 | 43,312,990 |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt = greater<int>;
using minq = priority_queue<int, vector<int>, gt>;
using P = pair<ll,ll>;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i]) continue;
primes.push_back(i);
f[i] = i;
for (ll j = i*i; j <= n; j += i) {
if (!f[j]) f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x;}
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<ii> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0) return {};
vector<ii> res(1, ii(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
vector<pair<ll,int>> factor(ll x) {
vector<pair<ll,int>> res;
for (int p : primes) {
int y = 0;
while (x%p == 0) x /= p, ++y;
if (y != 0) res.emplace_back(p,y);
}
if (x != 1) res.emplace_back(x,1);
return res;
}
};
int main() {
int n; cin >> n;
Sieve sieve(n+2);
map<int, int> primes;
for (int i=1; i<=n; i++) {
vii vec = sieve.factor(i);
for (auto p: vec) {
primes[p.first] += p.second;
}
}
auto num = [&](int n) {
int ret = 0;
for (auto p: primes) {
if (p.second >= n-1) ++ret;
}
return ret;
};
ll ans = num(75) + num(25) * (num(3)-1) + num(15) * (num(5)-1) + num(5)*(num(5)-1)*(num(3)-2)/2;
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
#define PI 3.14159265359
#define dij priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>
typedef long long ll;
int get_ans(int n){
int ans=1;
if(n%2==0||n==1)ans=0;
else{
int co=0,t=3;
vector<int> v;
while(n>1){
if(n%t==0){
n/=t;
co++;
}
if(n%t!=0){
t++;
v.push_back(co);
co=0;
}
}
rep(i,v.size()){
ans*=v[i]+1;
}
}
return ans;
}
int main(){
int n;cin>>n;
int ans=0;
FOR(i,1,n){
if(get_ans(i)==8)ans++;
}
cout<<ans<<endl;
} | 0 | 26,711,205 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin>>n;
int h[n];
for (int i=0;i<n;i++){
cin>>h[i];
}
int mx = 0;
int ans = 0;
for (int i=0;i<n;i++){
if (mx<=h[i]){
ans++;mx=h[i];
}
}
cout<<ans;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
ll a[n+1];
for(int i=0;i<n+1;i++)cin >> a[i];
ll b[n];
for(int i=0;i<n;i++)cin >> b[i];
ll c=0;
for(int i=0;i<n;i++){
if(a[i]>=b[i]){
c+=b[i];
}
else if(b[i]<a[i]+a[i+1]){
c+=b[i];
a[i+1]=a[i+1]-(b[i]-a[i]);
}
else{
c+=a[i]+a[i+1];
a[i+1]=0;
}
}
cout <<c << endl;
} | 0 | 89,764,891 |
#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 sperase(v,n) (v).erase(remove(all(v), n), (v).end())
#define vdelete(v) (v).erase(unique(all(v)), (v).end())
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1000000007
#define INF 9223372036854775807
int w;
string s,ans;
signed main() {
cin >> s >> w;
rep(i,s.size()) if (!(i%w)) ans.pb(s[i]);
cout << ans << endl;
} | #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, m, k, ans;
int main() {
cin >> n;
if (n == 25)
cout << "Christmas" << endl;
else if (n == 24)
cout << "Christmas Eve" << endl;
else if (n == 23)
cout << "Christmas Eve Eve" << endl;
else if (n == 22)
cout << "Christmas Eve Eve Eve" << endl;
return 0;
} | 0 | 12,344,984 |
#include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
long long sum=0;
int n;
long long a[200100];
cin>>n;
REP(i,n){
cin>>a[i];
sum+=a[i];
}
long long s1=0;
long long ans=1e18;
for(int i=0;i<n-1;i++){
s1+=a[i];
long long s2=sum-s1;
long long sa=s1-s2;
if(sa<0)sa*=-1;
ans=min(ans,sa);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#define Ns 5005
string s;
ll n,m,o,x,y,z,d,k,l,r;
ll dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t=1;
while(t--){
ll ans=0;
cin>>n;
dp[0]=1;
for(int i=1;i<=n;i++){
for(int k=3;k<=i;k++){
dp[i]=(dp[i]+dp[i-k])%mod;
}
}
cout<<dp[n]<<"\n";
}
return 0;
} | 0 | 29,698,791 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
string op;
cin >> A >> op >> B;
if(op == "+")
cout << A + B << endl;
if(op == "-")
cout << A - B << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
int main() {
INIT;
ll H, W;
cin >> H >> W;
vector<string> S(H);
rep(i, H) cin >> S[i];
vector<vector<ll>> cntX(H, vector<ll>(W, 0));
vector<vector<ll>> cntY(H, vector<ll>(W, 0));
rep(i, H) {
ll cnt = 0;
rep(j, W) {
if (S[i][j] == '#')
cnt = 0;
else
cnt++;
cntX[i][j] = cnt;
}
}
repr(i, H - 1) {
ll max_cnt = 0;
repr(j, W - 1) {
if (S[i][j] == '#')
max_cnt = 0;
else
chmax(max_cnt, cntX[i][j]);
cntX[i][j] = max_cnt;
}
}
rep(i, W) {
ll cnt = 0;
rep(j, H) {
if (S[j][i] == '#')
cnt = 0;
else
cnt++;
cntY[j][i] = cnt;
}
}
repr(i, W - 1) {
ll max_cnt = 0;
repr(j, H - 1) {
if (S[j][i] == '#')
max_cnt = 0;
else
chmax(max_cnt, cntY[j][i]);
cntY[j][i] = max_cnt;
}
}
ll ans = 0;
rep(i, H) {
rep(j, W) { chmax(ans, cntX[i][j] + cntY[i][j] - 1); }
}
cout << ans << endl;
return 0;
} | 0 | 68,222,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
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 (b < a)
{
a = b;
return 1;
}
return 0;
}
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 n, m;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin >> a>>b>>c>>d;
if(abs(a-c)<=d)return yes,0;
if (abs(a - b) <= d && abs(b - c) <= d)
return yes, 0;
no;
} | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
while (1) {
int steps, count=0;
cin >> steps;
string leg1, leg2;
if (steps == 0){ break; }
int loops;
if (steps % 2 == 1) { loops = (steps + 1) / 2; }
else { loops = steps / 2; }
for (int i = 0; i < loops; i++)
{
if (loops - i == 1) {
if (steps % 2 == 1) {
cin >> leg1;
break;
}
}
cin >> leg1 >> leg2;
if (leg1=="lu"&&leg2=="ru")
{ count = count + 1;}
if (leg1 == "ru"&&leg2 == "lu")
{count = count + 1;}
if (leg1 == "ld"&&leg2 == "rd")
{count = count + 1;}
if (leg1 == "rd"&&leg2 == "ld")
{count = count + 1;}
}
cout << count<<endl;
};
return 0;} | 0 | 59,218,049 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
using namespace std;
typedef long long int lli;
int main(void)
{
int a[3];
for (int i = 0; i < 3; i++)
{
cin >> a[i];
}
sort(a, a + 3);
cout << a[1] - a[0] + a[2] - a[1] << endl;
return 0;
} | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#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;
typedef long double ld;
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
const long long INF = 1e12;
const int MOD = 1e9 + 7;
#define MAXR 100000
#define Umap unordered_map
#define Uset unordered_set
#define int long long
#define LD long double
#define P pair<int, int>
#define PB push_back
#define MP make_pair
#define VI vector<int>
#define VVI vector<vector<int>>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define FORD(i, a, b) for (int i = (int)(b)-1; i >= (int)a; i--)
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 int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
long long power(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a *= a;
n >>= 1;
}
return res;
}
long long comb(int n, int k) {
vector<vector<long long>> v(n + 1, vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
return v[n][k];
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
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;
}
int N, M;
VI signs;
using Graph = vector<vector<int>>;
signed main() {
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> sign(N, -1);
queue<int> q;
sign[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int nv : G[v]) {
if (sign[nv] != -1)
continue;
sign[nv] = v + 1;
q.push(nv);
}
}
for (int v = 0; v < N; ++v) {
if (sign[v] == -1) {
print("No");
exit(0);
}
}
print("Yes");
FOR(v, 1, N) { print(sign[v]); }
} | 0 | 48,623,608 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if (a + b >= k)
{
cout<<min(a, k);
}
else
{
cout<<a-(k-a-b);
}
return 0;
} | #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);
vector<ll> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2]-A[0] << endl;
return 0;
} | 0 | 86,972,717 |
#include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute()
{
int N;
cin >> N;
if (N < 1200)
cout << "ABC" << endl;
else
cout << "ARC" << endl;
return;
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
execute();
int stop;
cin >> stop;
return 0;
} | #include<iostream>
#include<vector>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<iomanip>
using std::cout;
using std::endl;
using std::flush;
using std::cin;
namespace Util{
using StringVector = std::vector<std::string>;
StringVector split( const std::string &s, const std::string &delim = std::string(" ") ){
const int len = s.size();
char tmp[len+1];
strcpy( tmp, s.c_str() );
std::vector<std::string> res;
char *tmpStr = std::strtok( tmp, delim.c_str() );
if( tmpStr == NULL ) return res;
while( tmpStr != NULL ){
res.push_back( tmpStr );
tmpStr = NULL;
tmpStr = std::strtok( NULL, " " );
}
return res;
}
template<typename T>
std::string toString( T data, int width = 0 ){
std::stringstream ss;
ss << std::setw(width) << data;
return ss.str();
}
template<> std::string toString( bool flg, int width ){
if( width == 1 && flg ) return std::string("T");
if( width == 1 && !flg ) return std::string("F");
if( flg ) return std::string("true");
return std::string("false");
}
}
namespace Original{
using Data = std::vector<int>;
using Table = std::vector< Data >;
}
int main( void ){
cin.tie(0);
std::ios::sync_with_stdio(false);
const int INF = 123456789;
std::string tmpNum;
std::getline( cin, tmpNum );
Util::StringVector t = Util::split( tmpNum );
int n = std::atoi( t[0].c_str() );
int m = std::atoi( t[1].c_str() );
int x = std::atoi( t[2].c_str() );
Original::Table table;
for( int i = 0; i < n; i++ ){
std::string s;
getline( cin, s );
Util::StringVector sv = Util::split( s );
Original::Data d;
for( int j = 0; j < m+1; j++ ){
d.push_back( std::atoi( sv[j].c_str() ) );
}
table.push_back( d );
}
int ans = INF;
for( int bit = 0; bit < (1 << n); bit++ ){
std::vector<int> vec(m+1,0);
for( int i = 0; i < n; i++ ){
if( (bit >> i) & 1 ){
vec[0] += table[i][0];
for( int j = 1; j <= m; j++ ) vec[j] += table[i][j];
}
}
bool isAllowed = true;
for( int i = 1; i <= m; i++ ){
if( vec[i] < x ){ isAllowed = false; break; }
}
if( isAllowed ) ans = std::min( ans, vec[0] );
}
if( ans == INF ) cout << -1 << endl;
else cout << ans << endl;
return 0;
} | 0 | 10,665,521 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
vector<int> dy={1,0,-1,0};
vector<int> dx={0,1,0,-1};
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main(){
int n,k;
cin>>n>>k;
vector<ll> sum(n+1);
rep(i,n) {
ll a;
cin>>a;
sum[i+1]=sum[i]+a;
}
vector<ll> beauty;
FOR(r,1,n){
FOR(l,0,r-1){
beauty.push_back(sum[r]-sum[l]);
}
}
int m=sz(beauty);
vector<bool> check(m,true);
rrep(d,41){
int cnt=0;
rep(i,m){
if(!check[i]) continue;
if(beauty[i]&(1ll<<d)) cnt++;
}
if(cnt<k) continue;
rep(i,m){
if(!(beauty[i]&(1ll<<d))) check[i]=false;
}
if(cnt==k) break;
}
ll ans=-1;
int cnt=0;
rep(i,m) if(check[i]) {
if(ans==-1) ans=beauty[i];
else ans &= beauty[i];
cnt++;
if(cnt==k) break;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 200;
typedef long long ll;
typedef pair<int, int> pii;
int n, siz[MAX_N], id[MAX_N], fa[MAX_N], head[MAX_N], current;
ll D[MAX_N];
set<ll> st[2];
map<ll, int> mp;
struct edge
{
int to, nxt;
} edges[MAX_N << 1];
void addpath(int src, int dst)
{
edges[current].to = dst, edges[current].nxt = head[src];
head[src] = current++;
}
ll dfs(int u, int up)
{
ll ret = 0;
for (int i = head[u]; i != -1; i = edges[i].nxt)
if (edges[i].to != up)
ret += dfs(edges[i].to, u) + siz[edges[i].to];
return ret;
}
int main()
{
memset(head, -1, sizeof(head));
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &D[i]), mp[D[i]] = i, siz[i] = 1, id[i] = i;
sort(id + 1, id + 1 + n, [](const int &rhs1, const int &rhs2) { return D[rhs1] > D[rhs2]; });
for (int i = 1; i < n; i++)
{
int u = id[i];
ll transfer = D[u] - (n - siz[u]) + siz[u];
if (mp.count(transfer) == 0)
puts("-1"), exit(0);
fa[u] = mp[transfer], siz[fa[u]] += siz[u], addpath(fa[u], u), addpath(u, fa[u]);
}
if (dfs(id[n], 0) == D[id[n]])
{
for (int i = 1; i <= n; i++)
if (fa[i] != 0)
printf("%d %d\n", i, fa[i]);
}
else
puts("-1");
return 0;
} | 0 | 25,111,382 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = (ll) 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 1000005;
int main() {
FAST
int n;
cin>>n;
ll arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
ll mx=arr[0];
ll ans=0;
for(int i=1;i<n;i++){
if(arr[i]<arr[i-1])
{
ans+=abs(arr[i]-mx);
arr[i]=mx;
}
mx=max(mx,arr[i]);
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
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; }
void solve(){
ll n,k;
cin >> n >> k;
Vi a(n);
rp(i,n) cin >> a.at(i);
Vi kind;
sort(all(a));
ll ctr=1;
rp(i,n-1){
if(a[i]==a[i+1]) ctr++;
else{
kind.pb(ctr);
ctr=1;
}
}
kind.pb(ctr);
sort(all(kind));
ll to_delete=kind.size()-k;
ll ans=0;
rp(i,to_delete){
ans+=kind[i];
}
print(ans);
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
} | 0 | 94,620,466 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,aa=0,bb=0;
string a,b;
cin >> n;
while(n--){
cin >> a >> b;
if(a>b)aa+=3;
else if(a<b)bb+=3;
else aa++,bb++;
}
cout << aa << ' ' << bb << endl;
} | #include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <algorithm>
#define FOREVER for (;;)
#define FOR(i,a,b) \
for (int (i)=(a);(i)<(b);(i)++)
#define REP(i,a,b) \
for (int (i)=(a);(i)<=(b);(i)++)
#define log(exp) \
printf(#exp" = %d\n", exp)
#define INF 100000000
using namespace std;
const int maxn = 10+3;
int graph[maxn][maxn];
set<int> Set;
int main(void) {
int N;
while (cin>>N && N) {
FOR(i,0, maxn) FOR(j, 0, maxn) graph[i][j] = INF;
FOR(i,0,10) graph[i][i] = 0;
REP(i,1,N) {
int u,v,d;
cin>>u>>v>>d;
graph[u][v] = graph[v][u] = d;
Set.insert(u);
Set.insert(v);
}
FOR(k,0,10)
FOR(i,0,10)
FOR(j,0,10)
graph[i][j] = min(graph[i][j], graph[i][k]+graph[k][j]);
int ans = INF, ansNode = 0;
set<int>::iterator it;
for (it = Set.begin(); it!=Set.end(); it++) {
int node = *it;
int res = 0;
set<int>::iterator anotherIt;
for (anotherIt = Set.begin(); anotherIt!=Set.end(); anotherIt++)
res+=graph[node][*anotherIt];
if (res<ans) ans = res, ansNode = node;
}
printf("%d %d\n", ansNode, ans);
Set.clear();
}
return 0;
} | 0 | 90,732,718 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define ALL(x) (x).begin(),(x).end()
signed _main(); signed main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
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; }
template<class T> using v = vector<T>;
template<class T> using vv = vector<v<T>>;
const int MOD=1e9+7;
const long long INF = 1LL << 60;
using P=pair<int,int>;
signed _main(){
int H,W,A,B; cin >> H >> W >> A >> B;
if(W/2>=A && H/2>=B);
else{
No
return 0;
}
vv<int> field(H,v<int>(W,1));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i<B && j<A) field[i][j]=0;
else if(i>=B && j>=A) field[i][j]=0;
}
}
rep(i,H){
rep(j,W-1){
cout << field[i][j];
}
cout << field[i][W-1] << endl;
}
return 0;
} | #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--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
rep(i, n){
int x, y;
cin >> x >> y;
r[i] = make_pair(y, x);
}
rep(i, n){
int x, y;
cin >> x >> y;
b[i] = make_pair(x, y);
}
sort(r.begin(), r.end());
sort(b.begin(), b.end());
int cnt = 0;
bool used[n];
rep(i, n) used[i] = false;
rep(i, n){
rrep(j, n){
if(!used[j] && b[i].first > r[j].second && b[i].second > r[j].first){
used[j] = true;
cnt ++;
break;
}
}
}
cout << cnt << endl;
return 0;
} | 0 | 70,314,204 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int a,b,c,max;
cin>>a>>b>>c;
if(a>=b && a>=c){
max=a;
printf("%d",max*10+b+c);
}
else if(b>=a && b>=c){
max=b;
printf("%d",max*10+a+c);
}
else{
max=c;
printf("%d",max*10+a+b);
}
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
int main(){
int n;
cin >> n;
int h[n];
for(int i=0;i<n;i++) cin >> h[i];
int m=0,c=0;
for(int i=1;i<n;i++){
if(h[i-1]>=h[i]){
c++;
m = max(m,c);
}else{
c=0;
}
}
cout << m << endl;
} | 0 | 95,938,719 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<ll>>;
using Graph = vector<vector<Edge>>;
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
return gcd(b, a%b);
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll keta(ll N){
int tmp{};
while( N > 0 ){
tmp += ( N % 10 );
N /= 10;
}
N = tmp;
return N;
}
bool kai(string S){
bool flag = true;
for(ll i=0;i<S.size()/2;++i){
if(S[i] != S[S.size()-i-1]){
flag = false;
break;
}
}
return flag;
}
string solve(ll x){
string sx = to_string(x);
string re = "";
for(ll i=0;i<6-sx.size();++i){
re += "0";
}
re += sx;
return re;
}
int main(){
ll n, m;
cin>>n>>m;
vector<ll> p(m), y(m);
vector<ll> c[n];
for(ll i=0;i<m;++i){
cin>>p[i]>>y[i];
p[i]--;
c[p[i]].push_back(y[i]);
}
for(ll i=0;i<n;++i){
sort(c[i].begin(), c[i].end());
}
for(ll i=0;i<m;++i){
string fir = solve(p[i]+1);
ll flag = lower_bound(c[p[i]].begin(), c[p[i]].end(), y[i]) - c[p[i]].begin() + 1;
string sec = solve(flag);
string ans = fir + sec;
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
typedef tuple<int,int,int> T;
typedef struct Edge {
ll to, cost;
} Edge;
vector<vector<Edge>> g;
bool ok = true;
ll dist[252525];
bool vi[252525];
void dfs(int x, ll d) {
if (vi[x]) return;
vi[x] = true;
dist[x] = d;
for (auto &&e: g[x]) dfs(e.to,d+e.cost);
return;
}
int main(int argc, char const *argv[]) {
int n,m;
cin >> n >> m;
vector<ll> l(m),r(m),d(m);
g.resize(n);
REP(i,m) {
cin >> l[i] >> r[i] >> d[i];
--l[i],--r[i];
g[l[i]].push_back({r[i],d[i]});
g[r[i]].push_back({l[i],-1ll*d[i]});
}
memset(dist,0,sizeof(dist));
memset(vi,0,sizeof(vi));
for (int i = 0; i < n; ++i) dfs(i, 0);
REP(i,m) {
if (dist[r[i]]-dist[l[i]] != d[i]) ok = false;
}
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 28,892,012 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
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;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int sum_1 = 0;
int sum_2 = 0;
for(int i = 0; i < N; i++) { sum_1 += i; cerr << sum_1 << endl;}
for(int j = 0; j < M; j++) { sum_2 += j; cerr << sum_2 << endl;}
int ans = sum_1 + sum_2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
ll l, r;
cin >> l >> r;
ll mi = 2019;
for (ll i = l; i < l + 2019; i++) {
for (ll j = i + 1; j <= min(r, i + 2020); j++) {
mi = min(mi, ((i % 2019) * (j % 2019)) % 2019);
}
}
put(mi)
return 0;
} | 0 | 5,316,731 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S.insert(4, " ");
cout << S << '\n';
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
double x1, x2, x3, x4, y1, y2, y3, y4;
int n;
cin >> n;
rep(i, n)
{
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (abs((y2 - y1) * (x4 - x3) - (y4 - y3) * (x2 - x1)) < 0.0000000001)
{
OP("YES")
}
else
{
OP("NO")
}
}
return 0;
} | 0 | 92,969,483 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
ll h,w;
cin >> h >> w;
ll ans = h * w;
for(ll i=0;i<2;i++){
for(ll j=1;j<h;j++){
ll s1,s2,s3;
s1 = w * j;
s2 = w * ((h-j)/2);
s3 = w*h - s1 - s2;
ans = min(ans,max({s1,s2,s3}) - min({s1,s2,s3}));
s1 = w * j;
s2 = (h-j) * (w/2);
s3 = w*h - s1 - s2;
ans = min(ans,max({s1,s2,s3}) - min({s1,s2,s3}));
}
swap(h,w);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define pii pair<int,int>
#define sz size()
#define all(v) v.begin(),v.end()
#define pb push_back
#define pf push_front
#define PB pop_back
#define pll pair<long long, long long>
#define vl vector<int>
#define mp make_pair
#define mod 1000000007
typedef unsigned long long ull;
const int N = 200005;
const int MOD = 998244353 ;
void solve(){
int n;
string s, t, ans;
cin>>n>>s>>t;
f(i,n){
ans.pb(s[i]);
ans.pb(t[i]);
}
cout<<ans;
}
int32_t main() {
fast
int t;
t = 1;
while(t--)solve();
return 0;
} | 0 | 52,894,746 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;
vector<ll> a(n), b(n);
ll as = 0, bs = 0;
rep(i, n){
cin >> a[i];
as += a[i];
}
rep(i, n){
cin >> b[i];
bs += b[i];
}
if(as < bs){
cout << -1 << endl;
return 0;
}
vector<pair<ll, ll>> c;
ll cs = 0, ds = 0, cnt = 0;
rep(i, n){
if(a[i] < b[i]) cs += a[i], ds += b[i], cnt++;
else c.emplace_back(a[i]-b[i], a[i]);
}
if(cnt == 0){
cout << cnt << endl;
return 0;
}
sort(c.rbegin(), c.rend());
rep(i, c.size()){
cs += c[i].second, ds += c[i].second - c[i].first;
if(cs >= ds){
cout << cnt + i + 1 << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 998244353;
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define FW freopen("data2.txt", "w", stdout);
template <class T>
inline bool Read(T& ret)
{
char c;
int sgn;
if (static_cast<void>(c = getchar()), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (static_cast<void>(c = getchar()), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
template <class T>
inline void Write(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
Write(x / 10);
putchar(x % 10 + '0');
}
LL sum[N * 2] = { 0 }, num = 1;
void slove(int qnum)
{
LL n, x, m;
cin >> n >> x >> m;
LL ans = x;
LL pos = 0;
unordered_set<LL> k;
unordered_map<LL, int> order;
k.insert(x);
order[x] = 1;
sum[num] = x;
for (int i = 2; i <= n; ++i) {
LL cur = (x * x) % m;
if (cur == 0) {
cout << ans << endl;
return;
}
if (k.count(cur)) {
pos = order[cur];
break;
}
num++;
sum[num] = sum[num - 1] + cur;
k.insert(cur);
ans += cur;
x = cur;
order[cur] = i;
}
if (pos == 0) {
cout << ans << endl;
return;
}
ans += (ans - sum[pos - 1]) * ((n - num - 1) / (num - pos + 1));
n = (n - num - 1) % (num - pos + 1);
ans += (sum[pos + n] - sum[pos - 1]);
cout << ans << endl;
}
int main()
{
int qnum = 1;
for (int i = 1; i <= qnum; ++i) {
slove(i);
}
return 0;
} | 0 | 46,503,171 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;j<=(n);++i)
#define all(x) (x).begin(),(x).end()
using pii = pair<int,int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
signed main(){
int n;
string s;
cin >> s >> n;
int sn = s.size();
for(int i=0;i<sn;i+=n){
cout << s[i];
}
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
string s;
int main()
{
_FastIO;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '1')
cout << '9';
else
cout << '1';
}
cout << endl;
return 0;
} | 0 | 26,585,606 |
#include <vector>
#include <string>
#include <iostream>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
#include <set>
#include <numeric>
using namespace std;
template <typename T>
using TABLE = vector<vector<T>>;
using LONG = long long;
using LVEC = vector<long long>;
#define FOR(i, s, e) for(i = s; i < e; ++i)
#define FOR_INV(i, s, e) for(i = e - 1; i >= s; --i)
long long PRIME = 1e9 + 7;
long long PRIME2 = 998244353;
using pos = std::pair<LONG, LONG>;
LONG i, j, k;
LONG count(string N, int start_pos, int K){
int keta = N.size() - start_pos;
if(K == 1){
if(keta == 0){
return 0;
}
return 9 * (keta - 1) + (N[start_pos] - '0');
}
else if(K == 2){
if(keta < 2){
return 0;
}
else{
LONG sum = 9 * 9 *((keta - 2) * (keta - 1)) / 2;
sum += (N[start_pos] - '0' - 1) * 9 * (keta - 1);
++start_pos;
while(start_pos < N.size() && N[start_pos] == '0'){
++start_pos;
}
sum += count(N, start_pos, 1);
return sum;
}
}
else{
if(keta < 3){
return 0;
}
else{
LONG sum = 9 * 9 * 9 * ((keta - 1) * (keta - 2) * (keta - 3)) / 6;
sum += (N[start_pos] - '0' - 1) * 9 * 9 * ((keta - 2) * (keta - 1)) / 2;
++start_pos;
while(start_pos < N.size() && N[start_pos] == '0'){
++start_pos;
}
sum += count(N, start_pos, 2);
return sum;
}
}
}
int main(){
string N;
LONG K;
cin >> N >> K;
cout << count(N, 0, K);
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
int a = t.size();
string p = t.erase(a - 1);
if(s == p){
cout << "Yes" << '\n';
}
else{
cout << "No" << '\n';
}
return 0;
} | 0 | 26,051,549 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void solve() {
string s;
cin >> s;
int len = s.size() - 2;
while (s.substr(0, len/2) != s.substr(len/2, len/2)) {
len -= 2;
}
cout << len;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
void Main()
{
str s; cin >> s;
ll Max = 0;
ll tmp = 0;
rep(i, s.size())
{
if(s[i] == 'R') tmp ++;
else
{
Max = max(Max, tmp);
tmp = 0;
}
}
Max = max(Max, tmp);
fin(Max);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(4);
Main();
return 0;
} | 0 | 78,011,060 |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
int main()
{
int A, B,C;
cin >> A >> B >> C;
if (A == B && B == C)
{
cout << "Yes";
}
else
{
cout << "No";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
const int MAX_ROW = 110;
const int MAX_COL = 100005;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int n;
void GaussJordan(BitMatrix &A, bool is_extended = false) {
vector<bool> used(A.H, 0);
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1) break;
int pivot = -1;
for (int row = 0; row < A.H; ++row) {
if (used[row]) continue;
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1) continue;
for (int row = 0; row < A.H; ++row) {
if (row != pivot && A[row][col]) A[row] ^= A[pivot];
}
used[pivot] = true;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<int> odd(61);
ll res = 0;
BitMatrix B(61, n + 1);
for (ll i = 60; i >= 0; --i) {
int cnt = 0;
rep(j, n) {
if (a[j] & (1LL << i)) cnt++;
}
if (cnt & 1) {
odd[i] = 1;
res += (1LL << i);
} else if (cnt == 0) {
odd[i] = 1;
} else {
rep(j, n) {
if (a[j] & (1LL << i)) B[60 - i][j] = 1;
}
B[60 - i][n] = 1;
}
}
GaussJordan(B, true);
for (int i = 60; i >= 0; --i) {
if (odd[i]) continue;
bool ok = false;
rep(j, n) if (B[60 - i][j]) ok = true;
if (!B[60 - i][n]) ok = true;
if (ok) { res += (2LL << i); }
}
cout << res << endl;
} | 0 | 15,729,356 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int W, H, N;
cin >> W >> H >> N;
int X = 0;
int Y = 0;
for (int i = 0; i < N; i++) {
int x, y, a;
cin >> x >> y >> a;
switch (a) {
case 1: X = X < x ? x : X; break;
case 2: W = x < W ? x : W; break;
case 3: Y = Y < y ? y : Y; break;
case 4: H = y < H ? y : H; break;
}
}
cout << max(W - X, 0) * max(H - Y, 0) << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> plus, minus;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a > 0)plus.push_back(a);
else minus.push_back(a);
}
sort(plus.begin(), plus.end()), sort(minus.begin(), minus.end());
int ret = 0;
vector<vector<int>> ope;
if (plus.size() > 0 && minus.size() > 0) {
for (int i = 1; i < minus.size(); i++) {
ope.push_back({plus.front(), minus[i]});
plus.front() -= minus[i];
}
for (int i = 1; i < plus.size(); i++) {
ope.push_back({minus.front(), plus[i]});
minus.front() -= plus[i];
}
ope.push_back({plus.front(), minus.front()});
ret = plus.front() - minus.front();
} else if (plus.size() > 0) {
for (int i = 2; i < plus.size(); i++) {
ope.push_back({plus.front(), plus[i]});
plus.front() -= plus[i];
}
ope.push_back({plus[1], plus.front()});
ret = plus[1] - plus.front();
} else {
for (int i = 0; i < minus.size() - 1; i++) {
ope.push_back({minus.back(), minus[i]});
minus.back() -= minus[i];
}
ret = minus.back();
}
cout << ret << endl;
for (auto x:ope)cout << x[0] << " " << x[1] << endl;
return 0;
} | 0 | 75,936,378 |