code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<bool>dp(n+1, false);
dp[0] = true;
for(int i = 100; i <= 105; i++)
{
for(int j = 0; j + i <= n; j++)
{
if(dp[j]) dp[j+i] = true;
}
}
if(dp[n]) cout << 1 << endl;
else cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (a).size()
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define forn(i, n) for (int i = 1; i <= n; i++)
#define ford(i, n) for (int i = n; i >= 0; i--)
#define REP(i, a, n) for (int i = a; i < n; i++)
#define foreach(itr, c) for (__typeof((c).begin(), (c).end()) itr = c.begin(); itr != c.end(); itr++)
#define fill(a, b) memset(a, b, sizeof(a))
#define re return
#define INF 1e9
#define LINF 1e18
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<char> vs;
typedef vector<pi> vpi;
using namespace std;
int main()
{
int n = 3;
int count = 0;
int max = 0;
vs S(n);
rep(i, n)
{
cin >> S[i];
if (i == 0)
{
if (S[i] == 'R')
{
count++;
max = 1;
}
}
else
{
if (S[i] == 'R')
{
count++;
if (max < count)
{
max = count;
}
}
else
{
count = 0;
}
}
}
cout << max;
} | 0 | 60,492,322 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#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 SORT(s) sort((s).begin(),(s).end())
int main(){
ll s; cin >> s;
set<ll> a;
ll count = 1;
while(a.find(s) == a.end()){
a.insert(s);
if(s%2 == 0){
s /= 2;
}else{
s = 3*s + 1;
}
count += 1;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<long long int> sa(n+1);
for(int i=0; i<n; i++){
sa[i+1] = sa[i] + a[i];
}
map<long long int, long long int> count;
for(int i=0; i<n+1; i++){
if(count.find(sa[i]) == count.end()) count[sa[i]] = 1;
else count[sa[i]] += 1;
}
long long int ans = 0;
for(auto c : count){
ans += c.second * (c.second - 1) / 2;
}
cout << ans << endl;
return 0;
} | 0 | 85,172,905 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, x4, y4;
int n;
cin >> n;
for(int p=0; p < n; p++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
x1 -= x2; y1 -= y2; x3 -= x4; y3 -= y4;
cout << (abs(x1*y3-y1*x3) < 1e-10?"YES":"NO") << endl;
}
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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(){
ll n;
cin>>n;
V<ll> a(n);
for(int i=0;i<n;i++)cin>>a[i];
ll sum=0;
for(int i=0;i<n;i++){
sum+=a[i];
}
ll d=n*(n+1)/2;
if(sum%d!=0){
cout<<"NO"<<"\n";
return 0;
}
if(n==1){
cout<<"YES"<<"\n";
return 0;
}
ll times=sum/d,cnt=0;
for(int i=0;i<n;i++){
if(a[i]-a[(i+1)%n]>0){
cnt+=(a[i]-a[(i+1)%n]+n-2)/(n-1);
}
}
if((sum-cnt*d)%(d*n)==0)cout<<"YES"<<"\n";
else cout<<"NO"<<"\n";
} | 0 | 16,427,647 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9 + 7;
const int INF = 2e18;
signed main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
cin >> a;
vector<int> countLeft(N, 0), countRight(N, 0);
countLeft[0] = max(0LL, a[0]); countRight[N - 1] = max(0LL, a[N - 1]);
for (int i = 1; i < N; i++) {
if (a[i] > 0) countLeft[i] = countLeft[i - 1] + a[i];
else countLeft[i] = countLeft[i - 1];
}
for (int i = N - 2; i >= 0; i--) {
if (a[i] > 0) countRight[i] = countRight[i + 1] + a[i];
else countRight[i] = countRight[i + 1];
}
vector<int> sum(N + 1, 0);
int ans = 0;
for (int i = 1; i <= N; i++) sum[i] = sum[i - 1] + a[i - 1];
for (int i = 0; i + K - 1 < N; i++) {
int temp = 0;
if (i != 0) temp += countLeft[i - 1];
if (i + K - 1 != N - 1) temp += countRight[i + K];
temp += max(0LL, sum[i + K] - sum[i]);
ans = max(ans, temp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll H,W;
cin >> H >> W;
if(H%3==0||W%3==0){
cout << 0 << endl;
}else{
ll ans = min(H,W);
FOR(i,H/3-5,H/3+5){
FOR(j,W/2-5,W/2+5){
if(i<0||i>H-1||j<0||j>W-1) continue;
ll x = i*W;
ll y = (H-i)*j;
ll z = (H-i)*(W-j);
ll MAX = max(x,max(y,z));
ll MIN = min(x,min(y,z));
ans = min(ans,MAX-MIN);
}
}
FOR(i,W/3-5,W/3+5){
FOR(j,H/2-5,H/2+5){
if(i<0||i>W-1||j<0||j>H-1) continue;
ll x = i*H;
ll y = (W-i)*j;
ll z = (W-i)*(H-j);
ll MAX = max(x,max(y,z));
ll MIN = min(x,min(y,z));
ans = min(ans,MAX-MIN);
}
}
cout << ans << endl;
}
} | 0 | 23,779,497 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,v;
string z,w="Yes";
cin>>x>>y>>z;
for(v=0;v<x+y+1;v++){
if(v==x&&z.at(v)!='-'){w="No";break;}
else if(v!=x&&z.at(v)=='-'){w="No";break;}
}
cout<<w<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main(){
ll n,m;cin >>n>>m;
vector<ll>co(n,0);
for (int i = 0; i < m; ++i) {
ll a,b;cin >>a>>b;
a--;b--;
co[a]++;co[b]++;
}
bool flg=true;
for (int i = 0; i < n; ++i) {
if(co[i]%2==1)flg=false;
}
if(flg)puts("YES");
else puts("NO");
return 0;
} | 0 | 22,493,812 |
#include <bits/stdc++.h>
#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 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;
int table[9];
int bamboo[9];
int n, a, b, c;
int ans =INF;
void dfs(int len=0) {
if (len == n) {
int sumA=0, sumB=0, sumC=0;
int now = 0;
for (int i=0; i<n;i++) {
int num = table[i];
if (num==3) {
if (sumC) now+=10;
sumC += bamboo[i];
}
if (num==2) {
if (sumB) now+=10;
sumB += bamboo[i];
}
if (num==1) {
if (sumA) now += 10;
sumA += bamboo[i];
}
}
if (sumA==0 || sumB==0 || sumC==0) return;
now += abs(sumC-c);
now += abs(sumB-b);
now += abs(sumA-a);
chmin(ans, now);
return ;
}
for (int i=1; i<5;i++) {
table[len] = i;
dfs(len+1);
}
}
int main() {
cin >> n >> a >> b >> c;
rep(i,n) cin >> bamboo[i];
dfs();
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int maps[17][17];
int cnt(int x,int y);
int main(){
while(1){
int a,b,n,x,y;
cin >> a >> b;
if(a == 0 && b== 0)break;
for(int i=0;i<17;i++){
for(int j=0;j<17;j++){
maps[i][j] = 0;
}
}
cin >> n;
for(int i=0;i<n;i++){
cin >> x >> y;
maps[x][y] = -1;
}
for(int i=0;i<a+1;i++){
maps[i][0]= -1;
}
for(int i=0;i<b+1;i++){
maps[0][i]=-1;
}
int ans = cnt(a,b);
cout << ans << endl;
}
}
int cnt(int x,int y){
if(maps[x][y]== -1)return 0;
else if(x == 1 && y == 1) return 1;
return (cnt(x-1,y) + cnt(x,y-1));
} | 0 | 30,365,940 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll=long long;
const int MOD=998244353;
int main(){
ll n,m;
cin>>n>>m;
cout<<abs((n-2)*(m-2))<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#define MAX 5000000
#define INFTY (1<<30)
int n, H[MAX];
void maxHeapify(int i) {
int l, r, largest;
l = 2 * i;
r = 2 * i + 1;
if ( l <= n && H[l] > H[i]) largest = l;
else largest = i;
if ( r <= n && H[r] > H[largest]) largest = r;
if (largest != i) {
std::swap(H[i], H[largest]);
maxHeapify(largest);
}
}
int heapExtraMax() {
if (n < 1) return -1;
int max = H[1];
H[1] = H[n--];
maxHeapify(1);
return max;
}
void heapIncreaseKey(int key, int i) {
if ( H[i] > key ) return;
H[i] = key;
while ( i > 1 && H[int(i/2.0)] < H[i] ) {
std::swap(H[int(i/2.0)], H[i]);
i = int(i/2.0);
}
}
void insert(int key) {
n++;
H[n] = -INFTY;
heapIncreaseKey(key, n);
}
int main() {
int key;
char moji[10];
n = 0;
while (1) {
scanf("%s", moji);
if (moji[0] == 'e' && moji[1] == 'n') break;
if (moji[0] == 'i') {
scanf("%d", &key);
insert(key);
} else {
printf("%d\n", heapExtraMax());
}
}
return 0;
} | 0 | 86,646,821 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ar array
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define f(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define pi 3.14159265
#define umii unordered_map<int,int>
#define umci unordered_map<char,int>
#define umsi unordered_map<string,int>
void k_007()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("ip1.txt", "r", stdin);
freopen("op1.txt", "w", stdout);
#endif
}
bool sortbysec(const pair<int, int> &a,
const pair<int, int> &b);
int gcd(int a, int b) ;
int prime(int n);
int power(int x, int y);
int lcm(int a, int b);
int32_t main()
{
k_007();
int n, m;
cin >> n >> m;
int p[m];
string s[m];
f(i, m)
{
cin >> p[i] >> s[i];
}
int corr = 0;
int pen = 0;
map<int, int> wa, ac;
for (int i = 0; i < m; i++)
{
if (ac[p[i]]) continue;
if (s[i] == "AC")
{
corr++;
ac[p[i]] = 1;
pen += wa[p[i]];
}
else
{
wa[p[i]]++;
}
}
cout << corr << " " << pen << endl;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second < b.second);
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int prime(int n) {
int flag = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {flag = 0; break;}
}
return flag;
}
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return ((power(x, y / 2) % MOD) * ( power(x, y / 2) % MOD)) % MOD;
else
return ((x % MOD) * (power(x, y / 2) % MOD) * (power(x, y / 2) % MOD)) % MOD;
}
int lcm(int a, int b)
{
return (a * b) / gcd(a, b);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+100;
vector<int>ve[N];
int ans[N];
int vis[N];
queue<int>q;
void bfs()
{
q.push(1);
vis[1]=1;
while(q.size()){
int k=q.front();q.pop();
for(auto v:ve[k]){
if(!vis[v]){
ans[v]+=ans[k];
vis[v]=1;
q.push(v);
}
}
}
}
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n,q;
cin>>n>>q;
for(int i=1;i<=n-1;i++){
int a,b;
cin>>a>>b;
ve[a].push_back(b);
ve[b].push_back(a);
}
for(int i=1;i<=q;i++){
int a,b;
cin>>a>>b;
ans[a]+=b;
}
bfs();
for(int i=1;i<=n;i++){
cout<<ans[i]<<" ";
}
return 0;
} | 0 | 64,258,549 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1,x2,y1,y2;cin>>x1>>y1>>x2>>y2;
int tmp_x,tmp_y;
tmp_x=x2-x1;
tmp_y=y2-y1;
cout <<x2-tmp_y<<' '<<y2+tmp_x<<' ';
cout <<x1-tmp_y<<' '<<y1+tmp_x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 1;
int i;
while (cin >> i,i)
{
cout << "Case " << n << ": " << i<< "\n";
n++;
}
return 0;
} | 0 | 51,659,549 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
stack<char> St;
int frontnum = 0;
for(int i = 0; i < n; i++){
if(s[i] == '('){
St.push(s[i]);
}else if(!St.empty()){
St.pop();
}else{
frontnum++;
}
}
string ans = "";
for(int i = 0; i < frontnum; i++) ans += '(';
ans += s;
for(int i = 0; i < St.size(); i++) ans += ')';
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
long long extGCD(long long a, long long b, long long *px, long long *py){
if(b == 0){
*px = 1;
*py = 0;
return a;
}
long long d = extGCD(b, a%b, py, px);
*py -= a/b * (*px);
return d;
}
int main(){
long long N;
cin >> N;
long long T[N];
long long i;
for(i=0; i<N; i++){
cin >> T[i];
}
long long x, y;
long long val=T[0];
for(i=1; i<N; i++){
val=val*(T[i]/extGCD(val,T[i],&x,&y));
}
cout << val << endl;
system("pause");
return 0;
} | 0 | 11,147,397 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(i,n) for(int i=0; i<(n); i++)
#define REPinit(a,n) for(int i=a; i<(n); i++)
#define REPinitj(a,n) for(int j=a; j<n; j++)
#define CLR(a) memset((a), 0 ,sizeof(a))
template <typename T>
void swapAlgorithm(T& a, T& b) {
T tmp = a;
a = b;
b = tmp;
}
LL euclideanAlgorithm(LL a, LL b) {
LL a_tmp = a;
LL b_tmp = b;
if (a_tmp > b_tmp) {
swapAlgorithm<LL>(a_tmp, b_tmp);
}
LL r = a_tmp % b_tmp;
while (r != 0) {
a_tmp = b_tmp;
b_tmp = r;
r = a_tmp % b_tmp;
}
return b_tmp;
}
LL getLCM(LL a, LL b) {
return (a * b)/(euclideanAlgorithm(a, b));
}
double eauclidDistance(pair<double, double>& x1, pair<double, double>& x2) {
return sqrt((x1.first - x2.first) * (x1.first - x2.first) + (x1.second - x2.second) * (x1.second - x2.second));
}
void swap(int& a, int& b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
int main(int argc, char const *argv[])
{
int A,B,C;
cin >> A >> B >> C;
if((A+B)>=C) cout << "Yes";
else cout << "No";
return 0;
} | #include<string>
#include<iostream>
#include<vector>
using namespace std;
int main() {
int most_views = 0,views=0,most_long=0,len=0;
char tmp_sentence[1000];
string sentence,mo_ma_word,longest_word,word="";
vector<string> words;
cin.getline(tmp_sentence, sizeof(tmp_sentence));
sentence = tmp_sentence;
for (int i = 0; i < sentence.size(); i++) {
if (sentence[i] == ' ') { words.push_back(word); word = ""; }
else word = word + sentence[i];
}
words.push_back(word);
for (int i = 0; i < words.size(); i++) {
for (int j = 0; j < words.size(); j++) {
if (words[i] == words[j])views++;
}
if (most_views < views) {
most_views = views;
mo_ma_word = words[i];
}
views = 0;
}
for (int i = 0; i < words.size(); i++) {
if (most_long < words[i].size()) {
most_long = words[i].size();
longest_word = words[i];
}
}
cout << mo_ma_word <<' '<<longest_word<<endl;
} | 0 | 15,413,660 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n,d;
cin>>n>>d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin>>x[i][j];
}
}
int ans=0;
rep(i,n){
for(int j=i+1;j<n;++j){
int norm=0;
rep(k,d){
int diff=x[i][k]-x[j][k];
norm+=diff*diff;
}
bool flg=false;
for(int k=0;k<=norm;++k){
if(k*k==norm)flg=true;
}
if(flg)++ans;
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#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) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << ((a == b && b == c) ? "Yes" : "No") << endl;
return 0;
} | 0 | 85,821,624 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long int ll;
struct edge{ int to,cost; };
#define M (1e12+1)
int main(void){
ll v,e;
cin>>v>>e;
vector<vector<edge> > g(v);
vector<vector<ll> > ans(v,vector<ll>(v,M));
for(int i=0;i<v;i++){
ans[i][i]=0;
}
ll s,t,d;
for(int i=0;i<e;i++){
cin>>s>>t>>d;
ans[s][t]=d;
}
for(int k=0;k<v;k++){
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
if(ans[i][k]!=M&&ans[k][j]!=M){
ans[i][j]=min(ans[i][j],ans[i][k]+ans[k][j]);
}
}
}
}
bool f=true;
for(int i=0;i<v;i++){
if(ans[i][i]!=0)f=false;
}
if(f){
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
if(ans[i][j]>=M){
cout<<"INF";
}else{
cout<<ans[i][j];
}
if(j!=v-1)cout<<' ';
}
cout<<endl;
}
}else{
cout<<"NEGATIVE CYCLE"<<endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
const ll MOD=998244353;
int main(){
int N; cin >> N; int p[N];
rep(i, N){
cin >> p[i]; p[i]--;
}
vector<ll> a(N), b(N);
rep(i, N-1){
if(p[i+1]>p[i]){
a[p[i+1]] = a[p[i]]+2*(p[i+1]-p[i])*10000;
b[p[i+1]] = b[p[i]]-2*(p[i+1]-p[i])*10000+1;
}
else{
a[p[i+1]] = a[p[i]]-2*(p[i]-p[i+1])*10000+1;
b[p[i+1]] = b[p[i]]+2*(p[i]-p[i+1])*10000;
}
}
int t = a[0];
rep(i,N){
a[i]+=(1-t);
}
t = b[N-1];
rep(i, N){
b[i]+=(1-t);
}
rep(i, N){
cout << a[i]; cout << " ";
}
cout << endl;
rep(i, N){
cout << b[i]; cout << " ";
}
cout << endl;
} | 0 | 3,477,481 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
#define REP(i, a,b) for(i=a;i<b;i++)
#define output(x) cout<<x<<endl;
typedef long long int ll;
int main()
{
ll i, j, k, l, m, sum, flag,ans,W,H,N;
sum = 0;
flag = 0;
cin >> N;
vector<ll>A(N);
REP(i, 0, N) {
cin >> A[i];
}
j = 1;
sum += A[0] - 1;
REP(i, 1, N) {
if (A[i] == j + 1) {
j++;
}
else {
sum += (A[i] - 1) / (j + 1);
}
}
output(sum);
return 0;
} | #include <cstdio>
#define swap(a,b) {a^=b;b^=a;a^=b;}
int main() {
int a1,a2,a3;
while(~scanf("%d%d%d", &a1, &a2, &a3)) {
if (a1 > a2) {
swap(a1,a2);
}
if (a1 > a3) {
swap(a1,a3);
}
if (a2 > a3) {
swap(a2,a3)
}
printf("%d %d %d\n", a1, a2, a3);
}
return 0;
} | 0 | 39,319,409 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x, y, z, ans=0;
cin>>N;
if(N%2==1) {
cout<<ans<<endl;
}
else {
x=N/2;
vector<int> n(N);
for(int i=0; i<N; i++){
cin>>n.at(i);
}
sort(n.begin(), n.end());
y = n.at(x-1);
z = n.at(x);
if(y==z) cout<<ans<<endl;
else {
y++;
while(y<=z){
ans++;
y++;
}
cout<<ans<<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
int x = 0, y = 1;
vector<vector<int>> v(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
if (i == b)
swap(x, y);
for (int j = 0; j < w; ++j) {
if (j < a)
v[i][j] = x;
else
v[i][j] = y;
}
}
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
cout << v[i][j];
}
cout << endl;
}
} | 0 | 92,626,965 |
#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<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
int main()
{
std::string str;
char alph[26]={0};
int x;
while (std::getline(cin, str))
{
for (int i = 0; i < str.size(); i++)
{
if (isalpha(str[i]))
{
if (isupper(str[i]))
str[i] = tolower(str[i]);
x = str[i] - 'a';
alph[x]++;
}
}
}
for (int i = 0; i < 26; i++)
printf("%c : %d\n", 97+i, alph[i]);
return 0;
} | 0 | 98,850,761 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char k_s = s[k-1];
rep(i,s.size()){
if(s[i]!=k_s)
s[i] = '*';
}
cout << s << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int a, b; cin >> a >> b;
if(a + b == 15) {
cout << "+" << endl;
} else if(a * b == 15) {
cout << "*" << endl;
} else {
cout << "x" << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 62,200,902 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int , int > P;
P data[101];
int in;
int main(void)
{
for(int i = 0; i <= 100; i++)
data[i].second = i;
while(cin >> in, !cin.eof()){
data[in].first++;
}
sort(data,data+101);
int def = data[100].first;
for(int i = 0; i <= 100; i++)
if(data[i].first == def)
cout << data[i].second << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cmath>
#include<string>
#include<stdlib.h>
using namespace std;
#define ll long long int
#define ld long double
#define reps(i,f,n) for(int i=f;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define m1 cout<<"move1"<<endl
#define m2 cout<<"move2"<<endl
#define m3 cout<<"move3"<<endl
#define m4 cout<<"move4"<<endl
int main(){
ll num = 0;
string s;
char data[10][7] = {".,!? $","abc$$","def$$","ghi$$","jkl$$","mno$$","pqrs$","tuv$","wxyz$"};
char ans;
ll temp = 0;
ll cou = 0;
cin>>num;
rep(i,num){
cin>>s;
rep(i,s.size()){
ans = '#';
cou = 0;
while(s[i] != '0'){
temp = s[i] - '0' -1;
ans = data[temp][cou];
if(data[temp][cou] == '$'){
cou = 0;
ans = data[temp][cou];
}
cou++;
i++;
}
if(ans != '#'){
cout<<ans;
}
}
cout<<endl;
}
return 0;
} | 0 | 9,966,198 |
#include <iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main() {
double a,b,c,pi=3.1415926535897932;
cin>>a>>b>>c;
cout<<fixed<<setprecision(5)<<a*b*sin(c*pi/180.0)/2<<endl<<a+b+sqrt(a*a+b*b-2.0*a*b*cos(c*pi/180.0))<<endl<<b*sin(c*pi/180.0)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin >> N >> M;
string A[N];
string B[M];
for(int i = 0; i < N;i++)cin >> A[i];
for(int i = 0; i < M;i++)cin >> B[i];
bool flag;
for(int i = 0; i <= N - M;i++){
for(int j = 0; j <= N - M;j++){
flag = true;
for(int k = 0; k < M;k++){
for(int l = 0; l < M;l++){
if(A[i+k][j+l]!=B[k][l]){
flag = false;
break;
}
}
if(!flag)break;
}
if(flag){
cout << "Yes"<<endl;
return 0;
}
}
}
cout << "No"<<endl;
return 0;
} | 0 | 17,735,242 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
vector<string> vstr;
string str;
vector<int> vint;
vector<vector<int> > vvint;
int i, j, m, h, n = 0;
while(1) {
cin >> str;
if(str == "-") break;
++n;
vstr.push_back(str);
cin >> m;
for(i=0; i<m; ++i) {
cin >> h;
vint.push_back(h);
}
vvint.push_back(vint);
vint.clear();
}
for(i=0; i<n; ++i) {
for(j=0; j<vvint[i].size(); ++j) {
str = vstr[i].substr(0, vvint[i][j]);
vstr[i].erase(0, vvint[i][j]);
vstr[i].append(str);
}
cout << vstr[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<(k) ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=(k) ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef jayinnn
#define TIME(i) Timer i(#i)
#define debug(...) do{\
fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
_s<<"{";
for(It _it=_ita;_it!=_itb;_it++)
{
_s<<(_it==_ita?"":",")<<*_it;
}
_s<<"}";
return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
string scope_name;
chrono::high_resolution_clock::time_point start_time;
public:
Timer (string name) : scope_name(name) {
start_time = chrono::high_resolution_clock::now();
}
~Timer () {
auto stop_time = chrono::high_resolution_clock::now();
auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
double mlength = double(length) * 0.001;
debug(scope_name, mlength);
}
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 100005;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main () {
TIME(main);
IOS();
string s;
cin >> s;
ll tmp = 0;
for(auto i:s){
tmp += i - '0';
}
cout << (tmp % 9 == 0 ? "Yes" : "No") << endl;
return 0;
} | 0 | 67,701,027 |
/*http:
#include <list>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int n;
list<int> data;
string command;
int value;
list<int>::iterator it;
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
for(int i=0;i<n;i++){
cin>>command;
if(command=="deleteFirst"){
data.pop_front();
}else if(command=="deleteLast"){
data.pop_back();
}else{
cin>>value;
if(command=="insert"){
data.push_front(value);
}else{
it=find(data.begin(),data.end(),value);
if(it!=data.end()){
data.erase(it);
}
}
}
}
it=data.begin();
while(it!=data.end()){
cout<<*it++;
if(it!=data.end()){
cout<<" ";
}
}
cout<<endl;
return 0;
} | #include <stdio.h>
int main (void){
int x1=0, x2 = 0, x3 = 0, input, s;
for(s=0; s<10; s++){
scanf("%d\n" ,&input);
if(x1 < input){
x3 = x2;
x2 = x1;
x1 = input;
}else{
if(x2 < input){
x3 = x2;
x2 = input;
}else if(x3 < input) x3 = input;
}
}
printf("%d\n%d\n%d\n",x1,x2,x3);
return(0);
} | 0 | 89,008,694 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <set>
#include <deque>
using namespace std;
typedef long long LL;
const int inf = 1 << 30;
const LL INF = 1LL << 60;
const int MaxN = 100000;
int n;
int ans[505][505];
int main()
{
while(scanf("%d", &n) != EOF)
{
int tmp = (int)sqrt(2.0 * n);
if(tmp * (tmp + 1) != 2 * n) printf("No\n");
else {
printf("Yes\n");
printf("%d\n", tmp + 1);
int sta = 1;
for(int col = 1; col <= tmp; col++) {
for(int j = col; j <= tmp; j++) {
ans[col][j] = sta + (j - col);
ans[j + 1][col] = sta + (j - col);
}
sta += (tmp - col + 1);
}
for(int i = 1; i <= tmp + 1; i++) {
printf("%d", tmp);
for(int j = 1; j <= tmp; j++) printf(" %d", ans[i][j]);
printf("\n");
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
vector<int> pref(n+1);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i-1] + i;
pref[i] %= MOD;
}
long long ans = 0;
for (int i = k; i <= n + 1; i++) {
if (i < n + 1) {
ans += (pref[n] - pref[n-i]) - pref[i-1] + 1;
}
else {
ans++;
}
ans = ((ans % MOD) + MOD) % MOD;
}
cout << ans << '\n';
return 0;
} | 0 | 30,461,994 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w, d; cin >> h >> w >> d;
vector <pair <ll, ll>> v(h*w, pair <ll, ll> ());
rep(i, h) {
rep(j, w) {
ll a; cin >> a;
v.at(a-1) = make_pair(i, j);
}
}
vector <ll> imos(h*w, 0);
rep(i, d) {
ll tmp = i;
while (tmp+d < h*w) {
imos.at(tmp+d) = imos.at(tmp)+abs(v.at(tmp+d).first-v.at(tmp).first)+abs(v.at(tmp+d).second-v.at(tmp).second);
tmp += d;
}
}
ll q; cin >> q;
rep(i, q) {
ll l, r; cin >> l >> r;
l--; r--;
cout << imos.at(r) - imos.at(l) << endl;
}
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <class T>
ostream &operator<<(ostream &o, const vector<T>&obj) {
o << "["; for (int i = 0; i < (int)obj.size(); ++i) o << (i > 0 ? ", " : "") << obj[i]; o << "]"; return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U>&obj) {
o << "(" << obj.first << ", " << obj.second << ")"; return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U>&obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
template <class T>
ostream &operator<<(ostream &o, const set<T>&obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
template <class T>
ostream &operator<<(ostream &o, const queue<T>&obj) {
queue<T> obj_cp = obj;
bool first = true;
o << "{";
while (!obj_cp.empty()) { o << (!first ? ", " : "") << obj_cp.front(); obj_cp.pop(); first = false; }
o << "}"; return o;
}
void print() {
cout << "\n";
}
template<class Head, class... Body>
void print(Head head, Body... body) {
cout << head << " ";
print(body...);
}
int main(int argc, char const *argv[]) {
int N, M;
cin >> N >> M;
vector<ll> x(N), y(N), z(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i] >> z[i];
}
vector<int> idxs(N);
for (int i = 0; i < N; ++i) {
idxs[i] = i;
}
ll ans = 0;
for (int s = 0; s < 8; ++s) {
int sx = ((s >> 0) & 1) * 2 - 1;
int sy = ((s >> 1) & 1) * 2 - 1;
int sz = ((s >> 2) & 1) * 2 - 1;
sort(idxs.begin(), idxs.end(), [&](int a, int b) {
return x[a]*sx + y[a]*sy + z[a]*sz > x[b]*sx + y[b]*sy + z[b]*sz;
});
ll sum = 0;
for (int i = 0; i < M; ++i) {
sum += x[idxs[i]]*sx + y[idxs[i]]*sy + z[idxs[i]]*sz;
}
if (ans < sum) {
ans = sum;
}
}
cout << ans << endl;
return 0;
} | 0 | 51,903,810 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int c(int x)
{
int m = 0, t = 0, ret = 0;
while(m <= x)
{
ret++;
t++;
m+=t;
}
return ret-1;
}
void solve()
{
ll n;
cin >> n;
ll ogn = n;
ll cnt = 0, twos = 0;
while(n%2==0)
{
twos++;
n/=2;
}
cnt += c(twos);
for(ll i = 3; i*i<ogn; i+=2)
{
twos = 0;
while(n%i==0)
{
twos++;
n/=i;
}
cnt += c(twos);
}
if(n>1)
cnt++;
cout << cnt << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
ll modpow(ll a, int n) {
ll res = 1;
while (n) {
if (n & 1)
(res *= a) %= MOD;
(a *= a) %= MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string L;
cin >> L;
int N = L.length();
ll pow2 = 1, pow3 = modpow(3, N);
ll ans = 0;
for (int i = 0; i < N; ++i) {
(pow3 *= 333333336) %= MOD;
if (L[i] == '0')
continue;
ans += pow2 * pow3 % MOD;
ans %= MOD;
(pow2 *= 2) %= MOD;
}
ans += pow2;
cout << ans % MOD << endl;
return 0;
} | 0 | 47,160,424 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll n;
cin>>n;
map<ll,ll> m;
for(int i=0;i<n;i++){
ll a;
cin>>a;
m[a]++;
}
ll ans=0;
for(auto x:m){
if(x.second<x.first) ans+=x.second;
else ans+=x.second-x.first;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int,int>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = 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 (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
IOS;
string s; cin >> s;
int ans = INF;
REP(i,2) {
int tot=0;
REP(j,s.size()) {
if (j%2) {
if (s[j]-'0' == i) {
tot++;
}
} else {
if (s[j]-'0' != i) {
tot++;
}
}
}
chmin(ans,tot);
}
COUT(ans);
return 0;
} | 0 | 49,168,339 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
int N;
long long L, T;
while(cin >> N >> L >> T){
L *= 2;
T *= 2;
vector<pair<long long, int>> X(N);
for(auto& p : X){
cin >> p.first >> p.second;
p.first *= 2;
p.second = (p.second == 1 ? 1 : -1);
}
long long add = 0;
for(int i=0;i<N;i++){
if(X[i].second == X[0].second) continue;
long long pos0 = X[0].first;
long long pos1 = X[i].first;
if(X[0].second == -1) swap(pos0, pos1);
if(pos1 < pos0) pos1 += L;
long long first = (pos1 - pos0)/2;
if(T < first) continue;
long long rest = T - first;
add++;
add += rest/(L/2);
}
long long endPos = (X[0].first + L + T%L * X[0].second) % L;
vector<pair<long long, long long>> vp;
for(auto p : X){
vp.emplace_back((p.first + L + T%L * p.second) % L, p.second);
}
sort(vp.begin(), vp.end());
int start = -1;
for(int i=0;i<vp.size();i++){
if(vp[i].first == endPos && vp[i].second == X[0].second) start = i;
}
start = (start + N - add%N * X[0].second) % N;
for(int i=0;i<vp.size();i++){
cout << vp[(i+start)%vp.size()].first/2 << endl;
}
}
} | #include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
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;}
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;
ll cnt[MAX*100]={};
int main(void) {
ll i, j, k;
ll N;
cin >> N;
ll a[MAX];
map<ll, ll> mp[2];
for(i=0; i<N; i++) {
cin >> a[i];
mp[i&1][a[i]]++;
}
mp[0][-1]=0;
mp[1][-1]=0;
priority_queue<pll> qu[2];
for(i=0; i<2; i++) {
for(auto it=mp[i].begin(); it!=mp[i].end(); it++) {
qu[i].push(pll(it->sc, it->ft));
}
}
pll p=qu[0].top(); qu[0].pop();
pll q=qu[1].top(); qu[1].pop();
if(p.sc==q.sc) {
pll p1=qu[0].top(), q1=qu[1].top();
pt(min(N-p.ft-q1.ft, N-p1.ft-q.ft));
}else {
pt(N-p.ft-q.ft);
}
} | 0 | 53,465,786 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
int main(){
ll N;
cin >> N;
V v(N);
rep(i, N)cin >> v[i];
ll l = 2, h = 2;
rrep(i, N){
ll l2 = (l / v[i] + (l % v[i] > 0)) * v[i];
ll h2 = (h / v[i]) * v[i] + (v[i] - 1);
if(l2 > h2){
cout << -1 << endl;
return 0;
}
l = l2;
h = h2;
}
cout << l << " " << h << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REV(c) reverse((c).begin(),(c).end())
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
return b != 0 ? gcd(b, a % b) : a;
}
int64_t lcm(int64_t a, int64_t b) {
return a * b / gcd(a, b);
}
int ctoi(char c){
return c - '0';
}
struct UnionFind {
vector< int > data;
UnionFind(int sz) {
data.assign(sz, -1);
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
data[y] = x;
return (true);
}
int find(int k) {
if(data[k] < 0) return (k);
return (data[k] = find(data[k]));
}
int size(int k) {
return (-data[find(k)]);
}
};
int main(){
int64_t n,l,t;
cin >> n >> l >> t;
vector<pair<int, int>> xw(n);
REP(i,n){
cin >> xw.at(i).first >> xw.at(i).second;
}
int x = xw.at(0).first;
int w = xw.at(0).second;
int64_t r = 0;
for (auto i:xw){
if (i.first != x){
if (i.second != w){
if (w == 1){
r += t*2/l;
if ((t*2%l) > (i.first - x)){
r++;
}
}else{
r -= t*2/l;
if ((t*2%l) >= (l - (i.first - x))){
r--;
}
}
}
}
}
if (r<= 0){
r = n + r % n;
}else{
r = r % n;
}
int key;
if (w == 1){
key = (x + t % l) % l;
}else{
key = x - t % l;
if (key < 0){
key = l + key;
}
}
vector<int64_t> vec(n);
REP(j,n){
pair<int, int> i = xw.at(j);
int64_t z;
if (i.second == 1){
z = (i.first + t % l) % l;
}else{
z = i.first - t % l;
if (z < 0){
z = l + z;
}
}
vec.at(j) = z;
}
SORT(vec);
int index;
REP(i, n){
if (vec.at(i) == key){
index = i;
break;
}
}
REP(i, n){
int last = (i + index - r)%n;
if (last < 0){
last = n + last;
}
cout << vec.at(last) << endl;
}
return 0;
} | 0 | 63,155,118 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
}
int a=1;
int b=vec.at(0);
while(a<N){
if(b==2) break;
else{
b=vec.at(b-1);
a++;
}
}
if(a==N) cout << -1;
else cout << a;
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;cin>>s;
int so = 0;
if(s == 4||s==2||s==1){
cout<<"4";
return 0;
}
for(int i = 1;;i++){
if(s%2 == 0) s=s/2;
else s = 3*s+1;
if(s == 4){
so+= 1;
if(so == 2){
cout<<i+1;
return 0;
}
}
}
return 0;
} | 0 | 68,092,147 |
#include<stdio.h>
#include<string.h>
int main(){
int k, l;
char str[105];
scanf("%d%s", &k, str);
l = strlen(str);
for (int i=0 ; i<k ; i++){
if (str[i]=='\0'){
break;
}
printf("%c", str[i]);
}
if (l>k){
printf("...");
}
puts("");
return 0;
} | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
set<ll> ans;
ll max_v = 3234566667;
int rec(vector<ll> &n) {
int ei = -1;
rep(i,0,10) {
if (n[i] == -1) {ei = i; break;}
}
ll k = 1;
ll l = 0;
rep(i,0,10) {
if (n[i] == -1) break;
l += k*n[i];
k *= 10;
}
if (1 <= l && l <= max_v) {
ans.insert(l);
}
if (ei == -1) return 0;
rep(i,n[ei-1]-1,n[ei-1]+2) {
if (i == -1 || i == 10) continue;
n[ei] = i;
rec(n);
}
n[ei] = -1;
return 0;
}
int main() {
vector<ll> n(10,-1);
rep(i,0,10) {
n[0] = i;
rec(n);
}
int k;
cin >> k;
auto itr = ans.begin();
rep(i,0,k-1) {
++itr;
}
cout << *itr << endl;
return 0;
} | 0 | 39,641,376 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S, Ans;
cin >> S;
int N = S.size();
for (int i = 0; i < N; i++){
if (S[i] == 'B'){
if (i != 0){
for (int j = i; j >= 0; j--){
if (S[j] != 'B' && S[j] != '?'){
S[j] = '?';
break;
}
}
}
}
}
for (int i = 0; i < N; i++)
if (S[i] != '?' && S[i] != 'B')
Ans += S[i];
cout << Ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
inline void fastIO(){
ios_base::sync_with_stdio(0);cin.tie(0);
}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif
int main(){
fastIO();
int h,w,k,ans=0;
cin>>h>>w>>k;
char grid[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>grid[i][j];
}
}
for(int row=0;row<pow(2,h);row++){
for(int col=0;col<pow(2,w);col++){
char temp[h][w];
int cnt=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
temp[i][j]=grid[i][j];
}
}
for(int bit=0;bit<h;bit++){
if(row&(1<<bit)){
for(int i=0;i<w;i++){
temp[bit][i]='?';
}
}
}
for(int bit=0;bit<w;bit++){
if(col&(1<<bit)){
for(int i=0;i<h;i++){
temp[i][bit]='?';
}
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(temp[i][j]=='#')cnt++;
}
}
if(cnt==k)ans++;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 94,231,087 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define all(obj) (obj).begin(),(obj).end()
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long lint;
using namespace std;
int main(){
float t,x;
cin>>t>>x;
cout<<t/x<<endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
string S,T;
cin >> S >> T;
int flag2 = 0;
vector<string> A;
REP(i,S.size()-T.size()+1){
int flag=0;
REP(j,T.size()){
if(S.at(i+j)!='?'&&S.at(i+j)!=T.at(j)){
flag=1;
}
}
if(flag==0){
flag2=1;
string U=S;
REP(j,T.size()){
U.at(i+j)=T.at(j);
}
A.push_back(U);
}
}
if(flag2==0){
cout << "UNRESTORABLE" << endl;
}else{
REP(i,A.size()){
REP(j,A.at(i).size()){
if(A.at(i).at(j)=='?'){
A.at(i).at(j)='a';
}
}
}
sort(ALL(A));
cout << A.at(0) << endl;
}
} | 0 | 6,383,605 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define uno unordered_map
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define foreach(var,i) for(auto i = var.begin();i!=var.end();i++)
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
ll power(ll a, ll n) {ll res = 1; while (n) {if (n % 2) {res *= a;} n >>= 1; a *= a;} return res;}
ll powerm(ll a, ll n, ll m) {ll res = 1; while (n) {if (n % 2) {res = (res * a) % m;} n >>= 1; a = (a * a) % m;} return res;}
const int M=1e9+7;
ll mod(ll x){
return ((x%M + M)%M);
}
ll add(ll a, ll b){
return mod(mod(a)+mod(b));
}
ll mul(ll a, ll b){
return mod(mod(a)*mod(b));
}
int main(){
fast();
int t=1;
while(t--){
int x,y;
cin>>x>>y;
if(y>=2*x && y<=4*x){
cout<<(y%2==0?"Yes":"No")<<endl;
}
else{
cout<<"No"<<endl;
}
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct WordCount{
string word;
int count;
};
void PushWordCount(const vector<string>, vector<WordCount>&);
vector<string> split(string);
bool space(char);
bool not_space(char);
int main(){
int max=0, longest=0;
string s, Max, Longest;
vector<string> str;
vector<WordCount> data;
getline(cin, s);
str = split(s);
PushWordCount(str, data);
for(vector<WordCount>::size_type i=0; i != data.size(); ++i){
if(data[i].count > max){
max = data[i].count;
Max = data[i].word;
}
if(data[i].word.size() > longest){
longest = data[i].word.size();
Longest = data[i].word;
}
}
cout << Max << " " << Longest << endl;
return 0;
}
void PushWordCount(const vector<string> s, vector<WordCount>& words){
int isFound;
WordCount NewWord;
vector<WordCount>::iterator iter;
for(string::size_type i=0; i != s.size(); ++i){
isFound = 0;
iter = words.begin();
while(iter != words.end()){
if(iter->word == s[i]){
++iter->count;
break;
}
++iter;
}
if(isFound == 0){
NewWord.word = s[i];
NewWord.count = 1;
words.push_back(NewWord);
}
}
}
vector<string> split(string str){
string _str;
vector<string> Str;
string::iterator i, j;
j = str.begin();
while(i < str.end() || j < str.end()){
i = find_if(j, str.end(), not_space);
j = find_if(i, str.end(), space);
copy(i, j, back_inserter(_str));
Str.push_back(_str);
_str.clear();
}
return Str;
}
bool space(char c){
return (isspace(c));
}
bool not_space(char c){
return (!isspace(c));
} | 0 | 69,905,804 |
#include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
int count = 0;
for(int i = 0; i < n / 2; ++i) {
string op1, op2;
cin >> op1 >> op2;
if((op1 == "lu" && op2 == "ru") || (op1 == "ru" && op2 == "lu") || (op1 == "ld" && op2 == "rd") || (op1 == "rd" && op2 == "ld")) ++count;
}
if(n % 2) {
string a;
cin >> a;
}
cout << count << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 100005
#define MOD 1000000007
using namespace std;
int n,k,a[105],dp[105][M];
int pre[M];
int mod(int x) { x %= MOD; if (x<0) x += MOD; return x; }
int main()
{
scanf("%d %d", &n, &k);
REP(i,1,n) scanf("%d", &a[i]);
REP(i,0,a[1]) dp[1][i] = 1;
REP(i,2,n) {
pre[0] = dp[i-1][0];
REP(j,1,k) pre[j] = mod(pre[j-1] + dp[i-1][j]);
REP(j,0,k) {
int r = j;
int l = max(0, j-a[i]);
int sum = pre[r];
if (l>0) sum = mod(sum - pre[l-1]);
dp[i][j] = sum;
}
}
printf("%d\n", dp[n][k]);
return 0;
} | 0 | 1,364,270 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main()
{
string s1,s2,tmp,ans;
int n,m;
while(1){
s1.clear();s2.clear();ans.clear();
cin>>n; if(n==0) return 0;
for(int i=0;i<n;i++){
cin>>tmp; s1+=tmp;
cin>>tmp; s2+=tmp;
}
cin>>m;
for(int i=0;i<m;i++){
cin>>tmp; ans+=tmp;
for(int j=0;j<n;j++){
if(ans[i]==s1[j]){ans[i]=s2[j]; break;}
}
}
cout<<ans<<endl;
}
} | #include <iostream>
using namespace std;
int main(void){
int A, B, C;
cin >> A >> B >> C;
for(int x=0; x<=B; x++){
for(int y=0; y<=A; y++){
if(A*x == B*y+C){
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | 0 | 61,630,329 |
#include<iostream>
#define ll long long
#define endl "\n"
using namespace std;
bool check(int n)
{
int r;
while(n>0)
{
r=n%10;
if(r==7)
{
return true;
}
n=n/10;
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int t;
cin>>t;
if(check(t))
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define deb(x) cout<<#x<<" "<<x<<'\n';
#define rep(i,a,b) for (int i = (a); i < (b); ++i)
const ll mod = 1e9+7;
const ll inf = 1e18;
const ld pie = acos((ld)-1);
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main(){
double d,t,s;
cin>>d>>t>>s;
if(d/t > s){
puts("No");
}else{
puts("Yes");
}
return 0;
} | 0 | 2,988,613 |
#include <iostream>
#include <cstdlib>
#include <algorithm>
int main() {
long long int a, b, c, d;
long long int m1, m2, m3, m4;
std::cin >> a >> b >> c >> d;
m1 = a*c;
m2 = a*d;
m3 = b*c;
m4 = b*d;
std::cout << std::max({m1, m2, m3, m4}) << "\n";
return 0;
} | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for (ll i = m ; i < (ll)n ; ++i)
#define INF (ll)1e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
int main()
{
auto myCin = [](ll &a){cin >> a;};
ll N;
cin >> N;
vector<ll> a(N), b(N);
for_each(ALL(a), myCin);
for_each(ALL(b), myCin);
string ans = "No";
ll amari = 0;
ll fusoku = 0;
REP(i, N) {
ll diff = abs(a[i] - b[i]);
if (a[i] < b[i]) {
amari += diff / 2;
} else {
fusoku += diff;
}
}
if (fusoku <= amari) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} | 0 | 4,580,755 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LIM = 1e9;
ll s;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> s;
string ss = to_string(s);
int n = ss.length();
if (n == 19) {
cout << "0 0 1000000000 1 0 1000000000";
return 0;
}
ll si = 0;
for (int i = 0; i < n / 2; i++) {
if (ss[n - i - 1] == '0') continue;
si += (10 - (ss[n - i - 1] - '0')) * powl(10, i);
s += (10 - (ss[n - i - 1] - '0')) * powl(10, i);
ss = to_string(s);
}
n = ss.length();
ll x3 = si, y2 = 1;
int uhalf = ceil((double)n / 2);
string x2 = ss.substr(0, uhalf) , y3 = "1" + ss.substr(uhalf, n - uhalf);
cout << "0 0 " << x2 << ' ' << y2 << ' ' << x3 << ' ' << y3;
} | #include<bits/stdc++.h>
#include<atcoder/all>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
using namespace atcoder;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,q,type,u,v;
cin>>n>>q;
dsu d(n);
while(q--&&cin>>type>>u>>v){
if(type==0)
d.merge(u,v);
else
cout<<d.same(u,v)<<"\n";
}
return 0;
} | 0 | 63,051,806 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODADD(ADD_X,ADD_Y) (ADD_X+ADD_Y)%MOD;
#define MODSUB(SUB_X,SUB_Y) (SUB_X-SUB_Y)+MOD)%MOD;
#define MODMUL(MUL_X,MUL_Y) (MUL_X*MUL_Y)%MOD;
#define LCM(LCM_X,LCM_Y) (LCM_X*LCM_Y)/__gcd(LCM_X,LCM_Y);
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
int dx[]= {1,0,-1,0,1,-1,1,-1};
int dy[]= {0,1,0,-1,1,-1,-1,1};
int main()
{
FastRead
string s;
cin>>s;
sort(all(s));
int f=0;
if(s[0]==s[1] && s[2]==s[3] && s[1]!=s[2])
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
{
int A,B,C;
cin >> A >> B >> C;
if(A!=B&&B==C){
cout << A << endl;
}
else if(A!=B&&A==C){
cout << B << endl;
}
else{
cout << C << endl;
}
} | 0 | 5,717,242 |
#include <iostream>
using namespace std;
int main()
{
int R;
cin >> R;
if (R < 1200)
{
printf("ABC");
}
else if (R >= 1200 && R < 2800)
{
printf("ARC");
}
else
{
printf("AGC");
}
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> oset;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
#define INF 1000000000000000000ll
#define MOD 1000000007
#define EPS 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define sz(x) (int)(x).size()
#define len(x) (int)x.length()
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))
#ifdef bhartiya
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T>
void __p(std::vector<T> a) { cout << "{ "; for (auto p : a) __p(p); cout << "}"; }
template<typename T, typename F>
void __p(pair<T, F> a) { cout << "{ "; __p(a.first); __p(a.second); cout << "}"; }
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) { __p(a1); __p(a...); }
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";__p(arg1);cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(; ;i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<"| ";
__f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll modpow(ll b, ll e, ll mod=MOD) {
ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans; }
ld find(ll x,ll y)
{
return sqrt(x*x+y*y);
}
void solve()
{
vector<pair<ld,pair<ll,ll>>>v;
ll n;
ld ans=0;
cin>>n;
rep(i,n)
{
ll x,y;
cin>>x>>y;
ans=max(ans,find(x,y));
ld z=atan2(y,x);
v.pb(mp(z,mp(x,y)));
}
sort(all(v));
rep(i,n)
{
for(ll j=i;j<n;j++)
{
ll x1=0,y1=0;
for(ll k=i;k<=j;k++)
{
x1+=v[k].ss.ff;
y1+=v[k].ss.ss;
}
ans=max(ans,find(x1,y1));
x1=0,y1=0;
for(ll k=j+1;k<n;k++)
{
x1+=v[k].ss.ff;
y1+=v[k].ss.ss;
}
for(ll k=0;k<=i;k++)
{
x1+=v[k].ss.ff;
y1+=v[k].ss.ss;
}
ans=max(ans,find(x1,y1));
}
}
cout<<ans<<endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0), cout.precision(15);
#ifdef bhartiya
cin.exceptions(cin.failbit);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t=1;
fr(i,1,t)
{
solve();
}
end_routine();
} | 0 | 90,013,268 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long int infLL = 9000000000000000000;
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(a) (a).begin(),(a).end()
#define mx_int_prime 999999937
const int inf = 2000000000;
const double PI = acos(-1);
const double eps = 1e-9;
typedef long double ld;
#define MOD 1000000007
typedef long long ll;
const int mx=2e5+125;
ll p[mx],a[mx],b[mx];
#define PB push_back
#define S second
#define F first
int main()
{
faster();
char a,b;
cin>>a>>b;
int len1,len2;
len1=a-'0';
len2=b-'0';
string s1,s2;
s1="",s2="";
for(int i=0; i<len2; i++)
s1+=a;
for(int i=0; i<len1; i++)
s2+=b;
if(s1>=s2)
cout<<s2<<endl;
else
cout<<s1<<endl;
return 0;
} | #include <vector>
#include <iostream>
#include <functional>
using namespace std;
struct edge {
int to, cost;
};
int main() {
int N, M;
cin >> N >> M;
vector<vector<edge> > G(N);
for (int i = 0; i < M; ++i) {
int L, R, D;
cin >> L >> R >> D; --L, --R;
G[L].push_back(edge{ R, D });
G[R].push_back(edge{ L, -D });
}
vector<bool> vis(N);
vector<long long> pot(N);
function<bool(int)> dfs = [&](int pos) {
vis[pos] = true;
for (edge e : G[pos]) {
if (vis[e.to] && e.cost + pot[pos] != pot[e.to]) {
return false;
}
if (!vis[e.to]) {
pot[e.to] = pot[pos] + e.cost;
bool res = dfs(e.to);
if (!res) return false;
}
}
return true;
};
bool ans = true;
for (int i = 0; i < N; ++i) {
if (!vis[i]) {
ans = ans && dfs(i);
}
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | 0 | 4,246,607 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n; cin >> n;
int node[n+1];
for(int i=1; i<=n; ++i){
cin >> node[i];
}
for(int i=1; i<=n; ++i){
cout << "node " << i << ": key = " << node[i] << ", ";
int x = floor(i/2);
if (i != 1) cout << "parent key = " << node[x] << ", ";
if (2*i <= n) cout << "left key = " << node[2*i] << ", ";
if (2*i + 1 <= n) cout << "right key = " << node[2*i+1] << ", ";
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Bsort(a) sort(a.begin(), a.end(), greater<ll>())
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll r, s, p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
for (ll i = 0; i < k; i++) {
if (t[i] == 'r') ans += p;
else if (t[i] == 's') ans += r;
else ans += s;
}
for(ll i = k; i < t.size(); i++) {
if (t[i] == 'r') {
if (t[i-k] == 'r') {
t[i] = '0';
}
else {
ans += p;
}
}
else if (t[i] == 's') {
if (t[i-k] == 's') {
t[i] = '0';
}
else {
ans += r;
}
}
else {
if (t[i-k] == 'p') {
t[i] = '0';
}
else {
ans += s;
}
}
}
cout << ans << '\n';
} | 0 | 29,463,031 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
const int INTMAX = 2147483647;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
int main(){
int n,a,b,c;cin >> n >> a >> b >> c;
vi l(n);
rep(i,n) cin >> l[i];
int ans = INF;
for(int i=0;i<(1<<n);++i){
bitset<8> one(i);
for(int j=0;j<(1<<n);++j){
bitset<8> two(j);
int A = 0, B = 0, C = 0;
int Acount = 0, Bcount = 0, Ccount = 0;
for(int k=0;k<n;++k){
if(one.test(k) && two.test(k)){
A += l[k];
++Acount;
}else if(one.test(k) && !two.test(k)){
B += l[k];
++Bcount;
}else if(!one.test(k) && two.test(k)){
C += l[k];
++Ccount;
}
}
if(Acount==0 || Bcount==0 || Ccount==0) continue;
--Acount;--Bcount;--Ccount;
int tmp = (Acount + Bcount + Ccount) * 10 + abs(A - a) + abs(B - b) + abs(C - c);
chmin(ans, tmp);
}
}
cout << ans << endl;
} | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<double,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long nCr(long long n, long long r) {
long long A = 1, B = 1;
for (long long i = n - r + 1; i <= n; i++) {
A = A * i % MOD;
}
for (long long i = 1; i <= r; i++) {
B = B * i % MOD;
}
B = mod_pow(B, MOD - 2);
B %= MOD;
return (A * B) % MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
bool ok(long long key,long long index){
if(index > key) return true;
else if(index <= key) return false;
}
long long binary_search(long long key,long long size){
long long left = -1,right = size;
while(right - left > 1){
long long mid = left + (right-left)/2;
long long hantei = ok(key,mid);
if(hantei) right = mid;
else left = mid;
}
if(left == -1)return 0;
return left;
}
int main() {
int N,D,X;cin >> N >> D >> X;
vector<int> retu(N);
for(int i = 0;i<N;i++) cin >> retu.at(i);
for(int i = 0;i<N;i++){
int now = 1;
while(now <= D){
X++;
now += retu.at(i);
}
}
cout << X << endl;
} | 0 | 8,039,105 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int INT_INF = 1LL << 30;
int tosec(string S){
int h = stoi(S.substr(0, 2));
int m = stoi(S.substr(3, 2));
int s = stoi(S.substr(6, 2));
return h * 3600 + m * 60 + s;
}
int main(){
while(true){
int n;
cin >> n;
if(n == 0) break;
map<int, int> ma;
vector<P> imos(0);
for(int i = 0; i < n; i++){
string s1, s2;
cin >> s1 >> s2;
int start = tosec(s1), goal = tosec(s2);
if(!ma.count(start)){
ma[start] = imos.size();
imos.push_back(P(start, 1));
}
else imos.at(ma.at(start)).second++;
if(!ma.count(goal)){
ma[goal] = imos.size();
imos.push_back(P(goal, -1));
}
else imos.at(ma.at(goal)).second--;
}
sort(ALL(imos));
int ans = 0;
for(int i = 1; i < imos.size(); i++){
imos.at(i).second += imos.at(i-1).second;
chmax(ans, imos.at(i).second);
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define rep1(i, n) for (long long i=0; i<(long long)(n); i++)
#define rep2(i, s, e) for (long long i=(s); i<(long long)(e); i++)
#define GET_MACRO(_1,_2,_3,NAME,...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
int main(){
int n;
cin >> n;
map<string, int> mp;
rep(i, n){
string str;
cin >> str;
vector<char> vec(10);
rep(i, 10) vec[i] = str[i];
sort(all(vec));
rep(i, 10) str[i] = vec[i];
mp[str]++;
}
ll sum = 0;
for(auto p : mp){
ll num = p.second;
sum += num*(num-1)/2;
}
cout << sum << endl;
return 0;
} | 0 | 53,840,131 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int c[20];
int lp[50005] = {};
int solve(int x){
if(lp[x] != 0)
return lp[x];
int t = INT_MAX;
for(int i = 0; i < m; i++)
if(x > c[i])
t = min(t, solve(x - c[i]) + 1);
lp[x] = t;
return t;
}
int main(){
cin >> n >> m;
for(int i = 0; i < m; i++){
cin >> c[i];
lp[c[i]] = 1;
}
cout << solve(n) << endl;
} | #include <iostream>
#include <bits/stdc++.h>
#define mod 1000000007
#define point complex<long long>
#define pi acos(-1)
#define pb push_back
typedef long long ll;
using namespace std;
void Fastio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long adotb(point a, point b){
return (conj(a)*b).real();
}
long long acrossb(point a, point b){
return (conj(a)*b).imag();
}
long long sinseta(point a, point b){
return abs(acrossb(a,b)/(abs(a)*abs(b)));
}
ll fact[1000006], inv[1000006];
ll fp(ll base, ll exp)
{
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
void calcFacAndInv(ll n)
{
fact[0] = inv[0] = 1;
for (ll i = 1; i <= n; i++)
{
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r)
{
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
ll npr(ll n, ll r)
{
return (fact[n] * inv[n - r]) % mod;
}
ll lcm(ll a, ll b){
return (a*b)/__gcd(a,b);
}
long double NCR(int n, int m){
if(n<m)return 0;
long double res = 1;
m = min(m, n - m);
for(int i = 0; i < m; i++){
res = res * ( n - i) / (i + 1);
}
return res;
}
ll stolong(string a){
ll res=0;
while(a[0]=='0'){
a.erase(a.begin());
}
if(a=="")a="0";
for(int i=0; i<a.size(); i++){
res*=10; res+=a[i]-'0';
}
return res;
}
const int MAXN=1e7+2;
int spf[MAXN];
void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++)
spf[i] = i;
for (int i=4; i<MAXN; i+=2)
spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
if (spf[i] == i)
{
for (int j=i*i; j<MAXN; j+=i)
if (spf[j]==j)
spf[j] = i;
}
}
}
set<int> getFactorization(int x)
{
set<int> ret;
while (x != 1)
{
ret.insert(spf[x]);
x = x / spf[x];
}
return ret;
}
class data{
public:
ll x, y, d;
};
double distance(point a, point b){
return abs(b-a);
}
string ltobin(int x){
string res="";
while(x){
res+=('0'+(x%2)); x/=2;
}
reverse(res.begin(), res.end());
return res;
}
ll bintol(string a){
ll res=0;
reverse(a.begin(), a.end());
for(int i=0; i<a.size(); i++){
if(a[i]=='1')res+=pow(2,i);
}
return res;
}
void primeFactors(int n)
{
while (n % 2 == 0 && n)
{
cout<<2<<" ";
n = n/2;
}
for (int i = 3; i <= sqrt(n); i = i + 2)
{
while (n % i == 0)
{
cout<<i<<" ";
n = n/i;
}
}
if (n > 2)
cout<<n<<" ";
}
vector<int> Sieve(int n)
{
int p[1000005];
for(int i=2; i<=n; i++){
for(int y=i+i; y<=n; y+=i){if(!p[y])p[y]=i;}
}
vector<int>v;
for(int i=2; i<=n; i++){
if(!p[i])v.push_back(i);
}
return v;
}
int main()
{
Fastio();
int ttt=1;
while(ttt--){
ll n; cin>>n;
ll arr[n+2]={0};
for(int i=0; i<=n; i++){cin>>arr[i];}
ll res=0;
for(int i=0; i<n; i++){
ll x; cin>>x;
ll t=min(x, arr[i]); arr[i]-=t; res+=t; x-=t;
if(x){
t=min(x, arr[i+1]);
arr[i+1]-=t; res+=t;
}
}
cout<<res<<'\n';
}
return 0;
} | 0 | 97,928,768 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c;
cin >> a >> b >>c;
bool can = false;
for(int i=1;i<=b;++i){
if((i*a)%b==c){
can = true;
}
}
if(can) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
vector<int> x{1,9,7,4};
int count = 0;
REP(i,4) {
int n; cin >> n;
REP(j,4) {
if (x[j] == n) {
count++;
x[j] = 0;
break;
}
}
}
CFYN(count == 4)
return 0;
} | 0 | 10,667,630 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1000003 ;
int main(){
int n;
cin >> n;
cout << 180*(n-2) << endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define PB push_back
#define PII pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int MAXN = 2e5 + 10 , INF = 1e9;
int main() {
int n;
cin >> n;
int l = 1 , r = n + 1;
cout << l - 1 << endl;
string s , s2;
cin >> s;
if(s == "Vacant") {
return 0;
}
while(1) {
int mid = (r + l) / 2;
cout << mid - 1 << endl;
cin >> s2;
int dis = mid - l - 1;
if(s2 == "Vacant") {
return 0;
}
else if(s2 == s) {
if(dis % 2 == 0) {
r = mid;
}
else {
l = mid;
s = s2;
}
}
else {
if(dis % 2) {
r = mid;
}
else {
l = mid;
s = s2;
}
}
}
} | 0 | 55,416,654 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double x, ff = 0;
for (int i = 1; i <= N; i++) {
x = 1.0;
for (int v = i; v < K; v *= 2) {
x /= double(2.0);
}
ff += x / double(N);
}
cout << fixed << setprecision(12) << ff << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int dp[1001][1001];
int main() {
string s1, s2;
cin >> s1 >> s2;
int A = s1.size(), B = s2.size();
rep(i, A + 1) dp[i][0] = i; rep(i, B + 1) dp[0][i] = i;
FOR(i, 1, A + 1) FOR(j, 1, B + 1) {
int cost = (s1[i - 1] == s2[j - 1]) ? 0 : 1;
int tmp = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
dp[i][j] = min(tmp, dp[i - 1][j - 1] + cost);
}
cout << dp[A][B] << endl;
return 0;
} | 0 | 37,859,295 |
#include <iostream>
#include <algorithm>
using namespace std;
#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 rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int n;
int a[100001];
int main(){
cin.tie(0);
cin>>n;
rep(i, n)cin>>a[i];
sort(a, a+n);
cout<<a[0]<<' '<<a[n-1]<<' ';
long long s = 0;
rep(i, n)s += a[i];
cout<<s<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1000000000;
int main() {
int H, W;
cin >> H >> W;
string abc = "ABCDEFGHIJKLMNOPQRSTUVWZXYZ";
for (int i=0; i<H; i++){
for (int j=0; j<W; j++){
string s;
cin >> s;
if (s == "snuke"){
cout <<abc[j] << i+1 << endl;
exit(0);
}
}
}
} | 0 | 53,841,960 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
int main(void){
string s,t,u;
int a,b;
cin>>s>>t>>a>>b>>u;
if(s==u) a--;
else b--;
cout<<a<<" "<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define f1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define cases ll t;cin >> t;while(t--)
#define rr return 0
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define deb(a) std::cerr<<#a<<"="<<(a)<<"\n"
#define deb2(a,b) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define deb3(a,b,c) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
const int MOD = 1000 * 1000 * 1000 + 7;
ll getRes(ll arr[], ll n,ll k)
{
ll dp[n + 1] = { 0 };
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (ll i = 3; i <= n; i++)
{
ll ans = INT_MAX;
for (ll j = 1; j <= k && j<i; j++)
{
ans = min(ans, dp[i - j] + abs(arr[i - 1] - arr[i - j - 1]));
}
dp[i] = ans;
}
return dp[n];
}
void solve()
{
ll n,k;
cin >> n >> k;
ll arr[100001];
f(i, n)
cin >> arr[i];
if (n < 2)
{
cout << 0 << "\n";
return;
}
ll res = getRes(arr, n,k);
cout << res << "\n";
}
int main()
{
fast;
ll t = 1;
while (t--)
{
solve();
}
rr;
} | 0 | 58,815,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
char buf[1024] = { '\0' };
while (fgets(buf, sizeof(buf), stdin) != NULL) {
if (buf[0] == '0') { break; }
int sum = 0;
for (char* p = buf; isdigit(*p); ++p) {
sum += (*p - '0');
}
fprintf(stdout, "%d\n", sum);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H), debug_out(T...);
}
const int MAX = 10000001;
ll cnt[MAX + 1];
bitset < MAX + 1 > marked;
void sieve() {
fill(cnt, cnt + MAX + 1, 1);
marked[0] = marked[1] = true;
for (int i = 2; i <= MAX; i++) if (!marked[i]) {
cnt[i]++;
for (int j = i * 2; j <= MAX ; j += i) {
int n = j, c = 1;
while (n % i == 0) n /= i, c++;
cnt[j] *= c;
marked[j] = true;
}
}
}
int main() {
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
freopen("in.txt", "r", stdin);
#else
#define debug(...) 3
fastIO;
#endif
sieve();
int n;
cin >> n;
ll ans = 0;
for(ll i = 1; i <= n; i++)ans += cnt[i] * i;
cout << ans << endl;
return 0;
} | 0 | 945,114 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=max(a*c,max(a*d,max(b*c,b*d)));
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(long long x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(long long x,long long y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou((int)bunbo,MOD-2) % MOD;
}
struct unionfind{
vector<int> par;
vector<int> hukasa;
unionfind(int n){
par = vector<int>(n);
hukasa = vector<int>(n,0);
for(int i=0;i<n;i++){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x)return x;
return root(par.at(x));
}
void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry)return;
if(hukasa.at(rx) >= hukasa.at(ry)){
par.at(ry) = rx;
hukasa.at(rx) = max(hukasa.at(ry) + 1,hukasa.at(rx));
}
else{
par.at(rx) = ry;
}
}
bool same(int x,int y){
return root(x) == root(y);
}
};
int ctoi(char a){
return a - '0';
}
long long gcd(long long a,long long b){
long long c = max(a,b);
long long d = min(a,b);
if(d % c == 0)return c;
return gcd(c,d%c);
}
long long lcm(long long a,long long b){
return a * b / gcd(a,b);
}
int main(){
int n;
cin >> n;
vector<int> s(n+1,1);
for(int i=2;i<=n;i++){
for(int j=1;i*j<=n;j++){
s.at(i*j)++;
}
}
long long ans = 0;
for(long long i=1;i<=n;i++)ans += i * s.at(i);
cout << ans << endl;
} | 0 | 80,332,957 |
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std;
int main(int argc, const char* argv[])
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
uint64_t minCost = numeric_limits<uint64_t>::max();
for(int i = 0; i < (1 << n); ++i)
{
if(bitset<32>(i).count() < k)
{
continue;
}
uint64_t cost = 0;
int maxHeight = 0;
for(int j = 0; j < n; ++j)
{
if(((i >> j) & 1) == 1)
{
if(maxHeight < a[j])
{
maxHeight = a[j];
}
else
{
cost += maxHeight - a[j] + 1;
maxHeight++;
}
}
else
{
maxHeight = max(maxHeight, a[j]);
}
}
minCost = min(minCost, cost);
}
cout << minCost << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for(int i=1;i<sz;i++)cout<<" "<<a[i];cout<<endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int>pi;
typedef pair<ll,ll>pll;
bool check(int n,int p){return (1<<p)&n;}
vector<string>v;
string temp;
vector<string>x;
bool vis[20];
int n;
int main()
{
IOS;
int ans=0;
cin>>n;
for(int i=0;i<n;i++)
{
string s;cin>>s;
v.pb(s);
}
int ba=0,_a=0,b_=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<v[i].length()-1;j++)
{
if(v[i][j]=='A'&&v[i][j+1]=='B')ans++;
}
int l=v[i].length();
string s;
s+=v[i][0];
s+=v[i][l-1];
if(s=="BA")ba++;
else if(s[0]=='B')b_++;
else if(s[1]=='A')_a++;
}
if(ba>0){
ans+=ba-1;
if(b_>0)b_--,ans++;
if(_a>0)_a--,ans++;
}
ans+=min(_a,b_);
cout<<ans<<endl;
} | 0 | 17,364,532 |
#include <stdio.h>
#include <string.h>
int main(){
int n;
scanf("%d", &n);
char c[n+1];
int flag=1;
scanf("%s", c);
if(n%2==1){
puts("No");
return 0;
}else{
for(int i=0; i<n/2;i++){
if(c[i] != c[i+n/2]){
flag=0;
}
}
}
if(flag){
puts("Yes");
}else{
puts("No");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>prime(1000005,0);
bool mark[1000005];
int nprime;
void sieve(int n)
{
int limit=sqrt(n*1.0)+1,s=0;nprime=0;
mark[1]=true;
mark[2]=false;
prime[nprime++]=2;
for(int i=3;i<=n;i+=2){
if(!mark[i]){prime[nprime++]=i;
if(i<=limit){
for(int j=i*i;j<=n;j+=i*2){
mark[j]=true;
}
}
}
}
}
ll nod(ll n)
{
ll nod=1,x3=1,sqrtN=sqrt(n)+1;
for(int i=0;prime[i]<=sqrtN&&i<nprime;i++){
if(n%prime[i]==0){
while(n%prime[i]==0){
n/=prime[i];
x3++;
}nod*=x3;x3=1;
}
}
if(n>1)nod*=2;
return nod-1;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll dg[201]={0};
for(int i=1;i<=200;i++){
for(int j=i;j<=200;j+=i){
dg[j]++;
}
}
ll n;
cin>>n;
ll s=0;
for(int i=1;i<=n;i+=2){
if(dg[i]==8)s++;
}
cout<<s;
} | 0 | 94,538,908 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[100005];
int n;
inline int dfs(int x, int fa)
{
int l1=g[x].size();
int res=0;
for(int i=0;i<l1;i++)
{
int v=g[x][i];
if(v!=fa)
res+=dfs(v,x);
}
if(res>=2)
{
printf("First\n");
exit(0);
}
if(res==0)
return 1;
return 0;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
g[x].push_back(y);
g[y].push_back(x);
}
if(dfs(1,-1))
printf("First\n");
else
printf("Second\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
queue<char> que;
que.push(s[0]);
int res = 0;
for (int i = 1; i < s.size(); i++)
{
if(que.empty()) que.push(s[i]);
else if(s[i] == que.back()) que.push(s[i]);
else {
res += 2;
que.pop();
}
}
cout << res << endl;
return 0;
} | 0 | 46,587,615 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int, int> P;
typedef std::pair<P, int> PP;
const double esp = 1e-9;
const int infi = (int)1e+9 + 10;
const ll infll = (ll)1e+17 + 10;
int main(){
std::string a, b;
std::cin >> a >> b;
a += a;
if (a.find(b) != std::string::npos)std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(b==1) return a;else if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
string s,t;
cin>>s>>t;
set<char> kind;
char c='a';
int ans=1;
for(int i=0;i<26;i++){
for(int j=0;j<s.length();j++){
if(s[j]==c){
kind.insert(t[j]);
}
}
if(kind.size()>=2){
ans=0;
break;
}else{
kind.clear();
}
for(int j=0;j<s.length();j++){
if(t[j]==c){
kind.insert(s[j]);
}
}
if(kind.size()>=2){
ans=0;
break;
}else{
kind.clear();
}
c++;
}
yn(ans);
} | 0 | 16,868,519 |
#include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
const double EPS = (1e-10);
using namespace std;
using Int = long long;
const Int MOD = 1000000007;
Int mod_pow(Int x, Int n) {
Int res = 1;
while(n > 0) {
if(n & 1) res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
vector<vector<int>> ss;
int main(){
cin.tie(0);
Int N; cin >> N;
Int S;
int flag = 1;
for (Int i = 1; i*(i-1) <= 2*N; i++){
if (i*(i-1) == 2*N){
cout << "Yes" << endl;
S = i;
flag = 0;
break;
}
}
if (flag){
cout << "No" << endl;
return 0;
}
int cnt = 1;
ss = vector<vector<int>> (S);
for (int i = 0; i < S; i++){
for (int j = i+1; j < S; j++){
ss[i].push_back(cnt);
ss[j].push_back(cnt);
cnt++;
}
}
cout << ss.size() << endl;
for (auto i : ss){
cout << i.size() << " ";
for (int j = 0; j < i.size(); j++){
cout << i[j];
if (j != i.size()-1) cout << " ";
}
cout << endl;
}
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define debug_() cerr << "AAAAA" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
if (s <= "2019/04/30")
{
cout << "Heisei" << endl;
}
else
{
cout << "TBD" << endl;
}
return 0;
} | 0 | 42,908,441 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define LB(a,x) lb(all(a), x) - a.begin()
#define UB(a,x) ub(all(a), x) - a.begin()
#define MOD 1000000007
#define itn int
#define enld endl
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
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;}
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
int N; cin >> N;
int A[100100];
reps(i,1,N) cin >> A[i];
int ans = 0;
reps(i,1,N){
if(A[A[i]] == i && i < A[i]) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll N, x;
cin >> N;
set<ll>s;
for (int i = 0; i < N; i++) {
cin >> x;
s.insert(x);
}
if (s.size() % 2 == 0) {
cout << s.size() - 1 << endl;
} else {
cout << s.size() << endl;
}
} | 0 | 23,006,562 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
ll mod = 1e9 + 7;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
long long modpow(long long a, long long n, long long mod=(1LL<<62)){
long long res = 1;
while (n > 0){
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
string l;
COMinit();
ll ans = 0LL;
cin >> l;
int one = 0;
reverse(all(l));
for (int i = l.size() - 1; i >= 0;i--){
if(l[i]=='1'){
ans += modpow(3,i , mod)*modpow(2,one,mod)%mod;
one++;
}
ans %= mod;
}
ans += modpow(2, one, mod);
cout << ans%mod << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int WHITE = 0;
const int BLACK = 1;
vector<pair<int, int>> V[MAX];
int color[MAX], d[MAX], N;
void dfs_visit(int u, bool& flg) {
color[u] = BLACK;
for (int i = 0; i < V[u].size(); i++) {
int v, w;
v = V[u][i].first;
w = V[u][i].second;
if (color[v] == BLACK && d[v] != d[u] + w) flg = false;
if (color[v] == WHITE) {
d[v] = d[u] + w;
dfs_visit(v, flg);
}
}
}
bool dfs() {
for (int i = 0; i < N; i++) color[i] = WHITE;
bool flg = true;
for (int i = 0; i < N; i++) {
if (color[i] == WHITE) {
d[i] = 0;
dfs_visit(i, flg);
}
}
return flg;
}
int main() {
int M, L, R, D;
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d %d %d", &L, &R, &D);
V[L].push_back(make_pair(R, D));
V[R].push_back(make_pair(L, -D));
}
bool flg = dfs();
if (flg) printf("Yes\n");
else printf("No\n");
return 0;
} | 0 | 44,373,931 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
long long int mod = 1000000007;
vector<ll> G[100005];
vector<P> tree[100010];
priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <ll,vector<ll>,greater<ll>> pqls;
priority_queue <P,vector<P>,greater<P>> pqps;
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll rui(ll abc,ll bed){
if(bed==0){return 1;}
else{
ll ced = rui(abc,bed/2);
ced *= ced;
ced %= mod;
if(bed%2==1){ced*=abc; ced%=mod;}
return ced;
}
}
ll i,j,k,ii,jj;
ll n,m,num,sum;
ll ans;
ll a,b,c,d,e,f,g,h,w;
char s[500][500];
ll x[800005],y[800005],z[900005];
ll xd[600006],yd[600006];
ll xm[500005],ym[500005];
ll dp[500][500];
int main(){
cin>>n>>m;
for(i=0;i<n;i++){
cin>>x[i];
}
for(i=0;i<m;i++){
cin>>y[i];
}
for(i=0;i<n-1;i++){
xd[i] = x[i+1] - x[i];
xd[i] %= mod;
}
for(i=0;i<m-1;i++){
yd[i] = y[i+1] - y[i];
yd[i] %= mod;
}
for(i=0;i<n-1;i++){
xm[i] = (((xd[i] * (i+1))%mod) * (n-i-1))%mod;
}
for(i=0;i<m-1;i++){
ym[i] = yd[i] * (i+1);
ym[i] %= mod;
ym[i] *= (m-i-1);
ym[i] %= mod;
}
ll sumx=0,sumy=0;
for(i=0;i<n-1;i++){
sumx += xm[i];
sumx %= mod;
}
for(i=0;i<m-1;i++){
sumy += ym[i];
sumy %= mod;
}
p(sumx * sumy %mod);
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n;
vector<int> vec[100005];
int visited[100005];
long long int ans[100005][2];
void dfs(int u){
visited[u] = 1;
long long int pro1 = 1, pro2 = 1;
for(int v:vec[u]){
if(!visited[v]){
dfs(v);
long long int a = (ans[v][0] + ans[v][1])%mod;
long long int b = ans[v][0];
pro1 = (pro1 *a)%mod;
pro2 = (pro2 *b)%mod;
}
}
ans[u][0] = pro1;
ans[u][1] = pro2;
}
int main(){
cin >> n;
for(int i=1;i<n;i++){
int u, v;
cin >> u >> v;
vec[u].push_back(v);
vec[v].push_back(u);
}
dfs(1);
cout << (ans[1][0] + ans[1][1])%mod;
} | 0 | 24,606,294 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define n_p(v) next_permutation(v.begin(),v.end())
#define to_ll(b) stoll(b)
#define MOD 1000000007
signed main(){
int a,b,c; cin>>a>>b>>c;
if(a==b) cout<<c;
else if(a==c) cout<<b;
else if(b==c) cout<<a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
pr(b);
}
int ans = 0;
int main()
{
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2])
Yes();
else
No();
return 0;
} | 0 | 100,270,400 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define lb lower_bound
#define up upper_bound
#define setp setprecision
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define spc(x) cout<<fixed<<setp(x)
const long long inf = 1e18;
const long long cs = 200005;
const long long mod = 1000000007;
const double PI = 2 * acos(0.0);
void solve()
{
ll t,n,m,a,b,c,d,e,i,j,k,x,y,z,cnt=0,cnt1=0;
bool flag = false;
cin>>a>>b>>c>>d;
cout<<max({a*c,a*d,b*c,b*d})<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
long ansiter = -1, ans = 0;
void solve(int depth, long pre, long k, long *flag, int flag0){
if(depth==10){
if(ansiter<k)ansiter++;
if(ansiter==k){
rep(i,10){
ans += flag[9-i]*pow(10,i);
}
}
return;
}
if(ansiter==k)return;
if(flag0==0 && pre==0){
rep(i,10){
flag[depth] = i;
if(ansiter<k && i==0)solve(depth+1,0,k,flag, flag0);
else if(ansiter<k)solve(depth+1,i,k,flag, 1);
}
}else if(pre==0){
flag0 = 1;
flag[depth] = 0;
if(ansiter<k)solve(depth+1,0,k,flag,flag0);
flag[depth] = 1;
if(ansiter<k)solve(depth+1,1,k,flag,flag0);
}else if(pre==9){
flag0 = 1;
flag[depth] = 8;
if(ansiter<k)solve(depth+1,8,k,flag,flag0);
flag[depth] = 9;
if(ansiter<k)solve(depth+1,9,k,flag,flag0);
}else{
flag0 = 1;
flag[depth] = pre-1;
if(ansiter<k)solve(depth+1,pre-1,k,flag,flag0);
flag[depth] = pre;
if(ansiter<k)solve(depth+1,pre,k,flag,flag0);
flag[depth] = pre+1;
if(ansiter<k)solve(depth+1,pre+1,k,flag,flag0);
}
}
int main(){
long k;
cin >> k;
long flag[10];
solve(0,0,k,flag,0);
cout << ans << endl;
return 0;
} | 0 | 47,100,755 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long int> ;
int pref[1000075] ;
int main(){
FAST_IO ;
string S , T ; cin >> S >> T ;
int N = ( int ) S.size() ;
int L = ( int ) T.size() ;
int ans = L ;
for( int i = 0 ; i < N - L + 1 ; i++ ){
int d = 0 ;
for( int j = 0 ; j < L ; j++ ){
if( S[i+j] != T[j] )
d++ ;
}
ans = min( d , ans ) ;
}
cout << ans << endl ;
return 0 ;
} | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
const long long INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
typedef long long ll;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
return ret;
}
vector<int> dx={1,0,-1,0};vector<int> dy={0,-1,0,1};
signed main () {
int m;scanf("%d",&m);
vector<vector<int>> cost(m+1,vector<int>(m+1));
vector<int> p(m+1);
FOR(i,1,m+1){
int a,b;scanf("%d %d",&a,&b);
p[i-1] = a;p[i]=b;
}
REP(i,m)cost[i][i] = 0;
int min_cost;
for (int l = 2; l <= m; l++) {
for (int i = 1; i <= m - l + 1; i++) {
int j = i + l - 1;
for (int k = i; k < j; k++) {
if (k == i) min_cost = cost[i][k] + cost[k+1][j] + p[i-1] * p[k] * p[j];
else min_cost = min(min_cost, cost[i][k] + cost[k+1][j] + p[i-1] * p[k] * p[j]);
}
cost[i][j] = min_cost;
}
}
cout << cost[1][m] << endl;
} | 0 | 91,097,733 |
#include <iostream>
using namespace std;
int main()
{
char x,y;
cin >> x >> y;
if((int)x < (int)y){
cout << " < ";
} else if((int)x > (int)y){
cout << " > ";
} else {
cout << " = ";
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, bool> M;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int main()
{
ll h, w, n, all, a[112345], b[112345], ans[10] = {0};
map<P, bool> mp, pos;
cin >> h >> w >> n;
REP(i, n)
{
cin >> a[i] >> b[i];
a[i]--, b[i]--;
pos[P(a[i], b[i])] = true;
}
all = (h - 2) * (w - 2);
REP(i, n)
{
for (int j = -2; j <= 0; j++)
{
if (j + a[i] < 0 || a[i] + j + 2 >= h)
continue;
for (int k = -2; k <= 0; k++)
{
if (k + b[i] < 0 || b[i] + k + 2 >= w)
continue;
if (mp[P(a[i] + j, b[i] + k)])
continue;
all--;
mp[P(a[i] + j, b[i] + k)] = true;
int num = 0;
for (int l = 0; l <= 2; l++)
{
for (int m = 0; m <= 2; m++)
{
if (pos[P(a[i] + j + l, b[i] + k + m)])
num++;
}
}
ans[num]++;
}
}
}
ans[0] = all;
REP(i, 10)
cout << ans[i] << endl;
return 0;
} | 0 | 30,177,528 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,c,d;
cin>>a>>b>>c>>d;
int first=max(a*c,a*d);
int second=max(b*c,b*d);
int res=max(first,second);
cout<<res;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
ll mod = 1000000007;
ll n, m;
cin >> n >> m;
ll a[n];
fill(a, a + n, 0);
rep(i, m){
ll b;
cin >> b;
a[b] = 1;
}
ll dp[n+1];
dp[0] = 1;
if(a[1] == 1){
dp[1] = 0;
}else{
dp[1] = 1;
}
for (ll i = 2; i <= n; i++){
if(a[i] == 1) dp[i] = 0;
else {
dp[i] = dp[i-1] + dp[i-2];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
} | 0 | 19,681,911 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define ALL(a) (a).begin(),(a).end()
#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 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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<class T> std::vector<std::vector<T>> VV(int n) {
return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
int dp[1 << 26];
signed main() {
INIT;
VAR(std::string, s);
REP(i, 1 << 26) dp[i] = INFINT;
dp[0] = 0;
int now = 0;
REP(i, s.size()) {
now ^= 1 << (s[i] - 'a');
REP(j, 26) {
CHMIN(dp[now], dp[now ^ (1 << j)] + 1);
}
}
OUT(std::max(1, dp[now]))BR;
return 0;
} | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<cassert>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<bitset>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
#define str string
#define rep(i,j) for(ll i=0;i<(long long)(j);i++)
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
const ll gosenchou = 5000000000000000;
short gh[2][4] = { { 0,0,-1,1 },{ -1,1,0,0 } };
struct P {
ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
};
bool operator<(E a, E b) {
return a.cost < b.cost;
}
struct H {
ll x, y;
};
bool operator<(H a, H b) {
if (a.x != b.x) return a.x < b.x;
return a.y < b.y;
}
bool operator>(H a, H b) {
if (a.x != b.x) return a.x > b.x;
return a.y > b.y;
}
bool operator==(H a, H b) {
return a.x == b.x&&a.y == b.y;
}
bool operator!=(H a, H b) {
return a.x != b.x || a.y != b.y;
}
ll gcm(ll i, ll j) {
if (i > j) swap(i, j);
if (i == 0) return j;
return gcm(j%i, i);
}
ld rad(H a, H b) {
return sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0));
}
ll ari(ll a, ll b, ll c) {
return (a + b)*c / 2;
}
ll fact(ll x, ll k, ll p) {
ll sum = 1;
for (int i = 0; i < k; i++) {
sum *= (x--);
sum %= p;
}
return sum;
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res*x%p;
x = x*x%p;
n >>= 1;
}
return res;
}
short ctos(char a) {
return (int)(a - '0');
}
#define int long long
const long long Inf = 4523372036854775807;
const int inf = 15000000000;
int n;
int a[100000];
vector<int>b;
vector<H>ans;
signed main() {
cin >> n;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > ma) {
b.push_back(i);
ma = a[i];
}
}
priority_queue<int>p;
int sum = 0;
for (int i = n - 1; i > b[b.size() - 1]; i--) {
p.push(a[i]);
}
for (int i = b.size() - 1; i > 0; i--) {
int res = (a[b[i]] - a[b[i - 1]])*sum;
while (!p.empty() && p.top() >= a[b[i - 1]]) {
res += p.top() - a[b[i - 1]];
sum++;
p.pop();
}
for (int j = b[i]; j > b[i - 1]; j--) {
if (a[j] >= a[b[i - 1]]) {
res += a[j] - a[b[i - 1]];
sum++;
}
else p.push(a[j]);
}
ans.push_back(H{ b[i], res });
}
int rep = a[0] * sum;
p.push(a[0]);
while (!p.empty()) {
rep += p.top();
p.pop();
}
ans.push_back(H{ 0,rep });
for (int i = ans.size() - 1; i >= 0; i--) {
cout << ans[i].y << endl;
for (int j = ans[i].x + 1; j < (i == 0 ? n : ans[i - 1].x); j++) {
cout << 0 << endl;
}
}
} | 0 | 49,547,414 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define x first
#define y second
#define pi pair <int, int>
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define int ll
const ll mod = 998244353;
int n, c, a[100010], v[100010], pr[100010], s[100010], ans;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin>>n;
for(int i=1; i<=n; i++) cin>>a[i];
sort(a+1, a+n+1);
for(int i=1; i<=n; i++) if(abs((double)a[n]/2-a[i])<abs((double)a[n]/2-ans)) ans=a[i];
cout<<a[n]<<" "<<ans;
} | #include <bits/stdc++.h>
using namespace std;
multiset<int> ms;
bool del(int x){
auto it = ms.find(x);
if (it == ms.end()) return false;
else ms.erase(it);
return true;
}
int main(){
int n;
scanf("%d",&n);
int a[n];
int k = 0;
for (int i = 0; i < n; i++){
scanf("%d",&a[i]);
ms.insert(a[i]);
k = max(k,a[i]);
}
int half = (k+1)/2;
for (int i = half; i <= k; i++){
if (i == half && (k & 1) == 0){
if (!del(i)){
printf("Impossible");
return 0;
}
}
else{
if (!del(i)){
printf("Impossible");
return 0;
}
if (!del(i)){
printf("Impossible");
return 0;
}
}
}
for (auto x : ms){
if (x < half+1){
printf("Impossible");
return 0;
}
}
printf("Possible");
} | 0 | 53,558,635 |
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
void solve() {
int n;
cin >> n;
vi32 a(n);
cin >> a;
vi32 sa = a;
sort(all(sa));
int diff = 0;
rep(i, n) {
int x = a[i];
int j = lower_bound(all(sa), x) - sa.begin();
if (abs(i - j) & 1) diff++;
}
cout << diff / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;++i)
#define repf(i,n) for(int i=0;i<=n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define eachdo(v, e) for(const auto& e : v)
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (ll)distance(v.begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (ll)distance(v.begin(), upper_bound((v).begin(), (v).end(), e))
ll mpow(ll a, ll n,ll mod=MOD){ll res=1;while(n>0){if(n&1)res=res*a%mod;a=a*a%mod;n>>=1;}return res;}
template<class T1, class T2> ll bcount(T1 v, T2 a){return upper_index(v,a)-lower_index(v,a);}
template<class T> bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
template<class T> void debug2(T v){rep(i,v.size()){rep(j,v[i].size())cout<<v[i][j]<<" ";cout<<endl;}}
template<class T> void rdv(T &v){rep(i,v.size())cin>>v[i];}
template<class T> void rdvv(T &v){rep(i,v.size()){rep(j,v[i].size())cin>>v[i][j];}}
struct SegmentTree{
private:
ll unit = 0;
ll op(ll a,ll b){return a ^ b;}
ll n;
vector<ll> node;
public:
SegmentTree(vector<ll> v){
ll sz = (ll)v.size();
n = 1;while(n<sz) n *= 2;
node.resize(2*n-1,unit);
for(ll i=0;i<sz;i++) node[i+n-1]=v[i];
for(ll i=n-2;i>=0;i--) node[i]=op(node[2*i+1],node[2*i+2]);
}
void update(ll x,ll val){
x += n-1;
node[x] += val;
while(x>0){
x = (x-1)/2;
node[x] = op(node[2*x+1],node[2*x+2]);
}
}
ll query(ll a,ll b,ll k = 0,ll l = 0,ll r = -1){
if (r<0) r = n;
if (r<=a || b<=l) return unit;
if (a<=l && r<=b) return node[k];
ll vl = query(a,b,2*k+1,l,(l+r)/2);
ll vr = query(a,b,2*k+2,(l+r)/2,r);
return op(vl,vr);
}
};
vl s(200005,0);
ll vq(ll l, ll r){
return s[r] - s[l];
}
int main(){
ll N; cin >> N;
vl a(N); rdv(a);
rep(i,N){
s[i+1] = s[i] + a[i];
}
ll ans = 0;
SegmentTree t(a);
ll l = 0, r = 1;
while(r < N+1){
if(t.query(l,r) == vq(l,r)){
ans += r-l;
++r;
}else{
++l;
}
}
cout << ans << endl;
return 0;
} | 0 | 21,467,670 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
using namespace std;
#define i64 long long
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return;std::cout << e << std::endl;}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T> void DEBUG(string str, T e){if(DEBUG_OUT == false)return;std::cout <<str<<" ";DEBUG(e);};
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int X;
cin>>X;
if(X<1200)
{
cout<<"ABC"<<endl;
}
else if(X < 2800)
{
cout<<"ARC"<<endl;
}
else
{
cout<<"AGC"<<endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
cin>>n>>k;
vector<long long> tower(n);
vector<long long> tallest(n,-1);
for(long long i=0;i<n;i++){
cin>>tower.at(i);
tallest.at(i)=max(tallest.at(max((long long)0,i-1)),tower.at(i));
}
long long ans=inf*1000;
for(long long tmp=0;tmp<(1<<n);tmp++){
bitset<15> bits=tmp;
long long cnt=0;
for(long long i=0;i<n;i++){
if(bits.test(i)) cnt++;
}
if(cnt!=k) continue;
long long pre=0;
vector<long long> high=tallest;
for(long long i=0;i<n;i++){
if(!bits.test(i)) continue;
if(i==0 || high.at(i-1)<tower.at(i)){
pre+=0;
}else{
pre+=high.at(i)-tower.at(i)+1;
long long now=high.at(i)+1;
for(long long j=i;j<n;j++){
high.at(j)=max(high.at(j),now);
}
}
}
ans=min(ans,pre);
}
cout<<ans<<endl;
return 0;
} | 0 | 67,665,122 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M=1e9+7;
ll dp[100005][2];
vector<vector<ll>> adj;
void prepare(vector<pair<ll,ll>>&e){
for(auto i:e){
adj[i.first].push_back(i.second);
adj[i.second].push_back(i.first);
}
}
ll ways(ll start,ll parent=-1,ll c=0){
if(dp[start][c]==-1){
ll count=1;
for(ll i:adj[start]){
if(i!=parent){
ll cnt=0;
cnt+=ways(i,start,0);
cnt%=M;
if(c==0){
cnt+=ways(i,start,1)%M;
cnt%=M;
}
count=(count*cnt)%M;
}
}
dp[start][c]=count;
}
return dp[start][c];
}
int main(){
ll n;
cin>>n;
vector<pair<ll,ll>> v(n-1);
for(ll i=0;i<n-1;i++){
ll a,b;
cin>>a>>b;
v[i]={a,b};
}
adj.resize(n+1);
prepare(v);
memset(dp,-1,sizeof(dp));
ll ans=(ways(1)+ways(1,-1,1))%M;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string o, e;
cin >> o >> e;
if (o.size() == e.size())
{
rep(i, o.size())
{
cout << o[i] << e[i];
}
cout << "\n";
}
else
{
rep(i, e.size())
{
cout << o[i] << e[i];
}
cout << o.back() << "\n";
}
return 0;
} | 0 | 81,449,117 |
#include<bits/stdc++.h>
using namespace std;
#define ll long
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
int a, b;
cin >> a >> s >> b;
if (s == "+") {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r)
{
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
template <typename T, T N>
class UnionFind {
T parent_[N];
T rank_[N];
T size_[N];
public:
UnionFind();
T Root(T idx);
bool IsSame(T x, T y);
void Unite(T x, T y);
T GetSize(T idx);
};
template <typename T, T N>
UnionFind<T, N>::UnionFind()
{
for (T i = 0; i < N; i++) {
parent_[i] = i;
rank_[i] = 0;
size_[i] = 1;
}
}
template <typename T, T N>
T UnionFind<T, N>::Root(T idx)
{
return parent_[idx] == idx ? idx : parent_[idx] = Root(parent_[idx]);
}
template <typename T, T N>
bool UnionFind<T, N>::IsSame(T x, T y)
{
return Root(x) == Root(y);
}
template <typename T, T N>
void UnionFind<T, N>::Unite(T x, T y)
{
x = Root(x);
y = Root(y);
if (x == y) {
return;
}
if (rank_[x] < rank_[y]) {
parent_[x] = y;
size_[y] += size_[x];
} else {
parent_[y] = x;
size_[x] += size_[y];
if (rank_[x] == rank_[y]) {
rank_[x]++;
}
}
}
template <typename T, T N>
T UnionFind<T, N>::GetSize(T idx)
{
return size_[Root(idx)];
}
template <typename T>
T pow_mod(T n, T p, T m)
{
if (p == 0) {
return 1;
}
if (p % 2 == 0) {
T t = pow_mod(n, p / 2, m);
return t * t % m;
}
return n * pow_mod(n, p - 1, m) % mod;
}
template <typename T>
T nCr_mod(T n, T r)
{
T x = 1;
for (T i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
T a = 1;
for (T i = 1; i <= r; i++) {
a *= i;
a %= mod;
}
T y = pow_mod(a, mod - 2) % mod;
return x * y % mod;
}
template <typename T>
bool is_prime(T n)
{
if (n == 1) {
return false;
}
for (T i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
template <typename T>
bool is_leap(T y)
{
return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}
template <typename T>
void next_day(T& y, T& m, T& d)
{
d++;
if (d > last_days[m - 1] + (m == 2 && is_leap(y) ? 1 : 0)) {
d = 1;
m++;
}
if (m > 12) {
y++;
m = 1;
}
}
template <typename T>
T fib(T n)
{
T a = 0, b = 1;
for (T i = 0; i < n; i++) {
T t = a;
a = b;
b = a + t;
}
return a;
}
template <typename T>
std::vector<size_t> calculate_ranks(const std::vector<T>& v)
{
std::vector<T> sorted = v;
std::sort(sorted.begin(), sorted.end());
std::map<T, long long> m;
for (auto i = 0LU; i < v.size(); i++) {
m.insert(std::make_pair(sorted[i], i));
}
std::vector<size_t> rank(v.size());
for (auto i = 0LU; i < v.size(); i++) {
rank[i] = m.find(v[i])->second + 1;
}
return rank;
}
template <typename T>
std::map<T, T> prime_factors_and_num(T n)
{
std::map<T, T> m;
for (T i = 2; i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
return m;
}
inline long long calculate_sum(const std::vector<long long>& v)
{
return std::accumulate(v.begin(), v.end(), 0LL);
}
template <typename T, T N>
class Graph {
std::vector<std::vector<T>> weights_;
std::vector<T> predecessors_;
std::vector<T> shortest_path_estimate_;
std::vector<std::vector<T>> edges_;
void InitializeSingleSource(T start);
void Relax(T v, T u);
public:
Graph(std::vector<std::vector<T>> weights, std::vector<std::vector<T>> edges);
Graph(std::vector<std::vector<T>> weights, T inf);
T BellmanFord(T start, T end);
T Dijkstra(T start, T end);
};
template <typename T, T N>
Graph<T, N>::Graph(std::vector<std::vector<T>> weights, std::vector<std::vector<T>> edges)
{
weights_ = weights;
predecessors_ = std::vector<T>(N, -1);
shortest_path_estimate_ = std::vector<T>(N, mod);
edges_ = edges;
}
template <typename T, T N>
Graph<T, N>::Graph(std::vector<std::vector<T>> weights, T inf)
{
weights_ = weights;
predecessors_ = std::vector<T>(N, -1);
shortest_path_estimate_ = std::vector<T>(N, inf);
edges_ = std::vector<std::vector<T>>(N, std::vector<T>());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (weights_[i][j] != inf) {
edges_[i].push_back(j);
}
}
}
}
template <typename T, T N>
void Graph<T, N>::InitializeSingleSource(T start)
{
for (int i = 0; i < N; i++) {
shortest_path_estimate_[i] = mod;
predecessors_[i] = -1;
}
shortest_path_estimate_[start] = 0;
}
template <typename T, T N>
void Graph<T, N>::Relax(T u, T v)
{
if (shortest_path_estimate_[v] > shortest_path_estimate_[u] + weights_[u][v]) {
shortest_path_estimate_[v] = shortest_path_estimate_[u] + weights_[u][v];
predecessors_[v] = u;
}
}
template <typename T, T N>
T Graph<T, N>::BellmanFord(T start, T end)
{
InitializeSingleSource(start);
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N; j++) {
for (auto edge : edges_[j]) {
Relax(j, edge);
}
}
}
for (int i = 0; i < N; i++) {
for (auto edge : edges_[i]) {
if (shortest_path_estimate_[edge] > shortest_path_estimate_[i] + weights_[i][edge]) {
fprintf(stderr, "Graph contains negative circle!\n");
exit(1);
}
}
}
return shortest_path_estimate_[end];
}
template <typename T, T N>
T Graph<T, N>::Dijkstra(T start, T end)
{
InitializeSingleSource(start);
std::set<T> s;
auto compare_d = [=](const T& x, const T& y) {
return shortest_path_estimate_[x] > shortest_path_estimate_[y];
};
std::priority_queue<T, std::vector<T>, decltype(compare_d)> q(compare_d);
for (int i = 0; i < N; i++) {
q.push(i);
}
while (q.size()) {
T u = q.top();
q.pop();
s.insert(u);
for (auto v : edges_[u]) {
Relax(u, v);
}
}
return shortest_path_estimate_[end];
}
template <typename T>
std::vector<T> Divisor(T n)
{
std::vector<T> ans;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
if (i * i != n) {
ans.push_back(n / i);
}
}
}
return ans;
}
int main()
{
long long h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for (int i = 0; i < h; i++) {
std::cin >> s[i];
}
std::vector<std::vector<long long>> dp(h, std::vector<long long>(w, mod));
dp[0][0] = s[0][0] == '#';
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i + 1 < h) {
dp[i + 1][j] = std::min(dp[i + 1][j], dp[i][j] + (s[i][j] == '.' && s[i + 1][j] == '#'));
}
if (j + 1 < w) {
dp[i][j + 1] = std::min(dp[i][j + 1], dp[i][j] + (s[i][j] == '.' && s[i][j + 1] == '#'));
}
}
}
std::cout << dp[h - 1][w - 1] << std::endl;
} | 0 | 32,051,297 |
#include<iostream>
#include<cmath>
using namespace std;
const long long size=2e5+1;
long long a[size],x[size];
long long n,s;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
x[i]=x[i-1]+a[i];
s+=a[i];
}
long long min=2e10+5,result;
for(int i=1;i<n;i++)
{
result=abs(2*x[i]-s);
if(min>result)
min=result;
}
cout<<min;
return 0;
} | #include <iostream>
#include <vector>
int main(){
int n = 0;
std::cin >> n;
std::vector<unsigned long long int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
if (a[i] == 0)
{
std::cout << 0 << std::endl;
return 0;
}
}
unsigned long long int prod = 1;
for (int i = 0; i < n; i++)
{
if (a[i] <= 1000000000000000000LL / prod)
{
prod *= a[i];
}
else
{
std::cout << -1 << std::endl;
return 0;
}
}
std::cout << prod << std::endl;
return 0;
} | 0 | 98,728,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W ,H , N;
cin >> W >> H >> N;
vector <tuple <int , int , int >> A(N);
for ( int i=0 ; i<N ; i++){
int a,b,c;
cin >> a >> b >> c;
A.at(i)=make_tuple(c,a,b);
}
int x_max=W ,x_min=0 , y_max=H , y_min=0;
for ( int i=0 ; i< N ; i++){
int c,b, a;
tie(c,a,b) = A.at(i) ;
if ( c == 1){
x_min=max(x_min,a);
continue ;
}
if ( c == 2){
x_max=min(x_max,a);
continue ;
}
if ( c == 3){
y_min =max(y_min,b);
continue ;
}
if ( c == 4){
y_max =min(y_max,b);
}
}
if (x_min<x_max && y_min < y_max){
cout << (x_max-x_min)*(y_max-y_min) <<endl;
}else cout << 0 << endl;
} | #include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
void fnDictionary(set<string>& rsesKey, vector<string>& rvsFnd)
{
int nCmdCnt;
cin >> nCmdCnt;
for (int i = 0; i < nCmdCnt; i++)
{
string sCmd;
string sKey;
cin >> sCmd >> sKey;
if (sCmd[0] == 'i')
rsesKey.insert(sKey);
else if (sCmd[0] == 'f')
{
auto itsesKey = rsesKey.find(sKey);
if (itsesKey != end(rsesKey))
rvsFnd.push_back("yes");
else
rvsFnd.push_back("no");
}
}
}
void fnResult(const vector<string>& cnrvsFnd)
{
for (int i = 0; i < cnrvsFnd.size(); i++)
cout << cnrvsFnd[i] << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
set<string> sesKey;
vector<string> vsFnd;
fnDictionary(sesKey, vsFnd);
fnResult(vsFnd);
return 0;
} | 0 | 21,295,400 |
#include<bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vl = vector<ll>;
int main() {
ll n;
cin >> n;
vl h(n);
rep(i,n) cin >> h[i];
ll ans = 0, cnt = 0;
rep(i,n-1) {
if (h[i] >= h[i+1]) cnt++;
else cnt = 0;
ans = max(ans, cnt);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
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; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll n;
cin >> n;
vll a(n+1);
rep(i, 1, n+1) cin >> a[i-1] >> a[i];
vllvll dp(110, vll(110, inf));
rep(i, 0, 110) dp[i][i] = 0;
rep(width, 2, n+1) {
rep(left, 1, n-width+2) {
ll right = left + width - 1;
rep(div, left, right) {
chmin(dp[left][right], dp[left][div] + dp[div+1][right] + a[left-1] * a[div] * a[right]);
}
}
}
cout << dp[1][n] << endl;
} | 0 | 56,571,520 |
#include <iostream>
#include <vector>
using namespace std;
class Rand
{
public:
Rand(int a, int b, int c, int x);
public:
void rand(int y);
int Num();
private:
int rand();
private:
int m_a, m_b, m_c;
int prev_x;
int m_num;
bool flag;
};
Rand::Rand(int a, int b, int c, int x)
{
m_a = a;
m_b = b;
m_c = c;
prev_x = x;
m_num = 0;
flag = true;
}
int Rand::rand()
{
if (flag)
{
flag = false;
return prev_x;
}
int result = ( m_a * prev_x + m_b ) % m_c;
prev_x = result;
++m_num;
return result;
}
void Rand::rand(int y)
{
while (m_num < 10001)
{
if (y == rand() ) break;
}
}
inline int Rand::Num()
{
return (m_num == 10001 ? -1 : m_num);
}
int main(void)
{
while (true)
{
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if ( n == 0 ) break;
vector<int> reel(n);
for (int& r : reel)
{
cin >> r;
}
Rand rand(a, b, c, x);
for (int r : reel)
{
rand.rand(r);
}
cout << rand.Num() << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
vector< vector < vector <int> > > a(4,vector< vector <int> >(3,vector<int>(10)));
int n;
cin >> n;
while(n--)
{
int b,f,r,v;
cin >> b >> f >> r >> v;
a[b-1][f-1][r-1] +=v;
}
for(int i = 0; i < 4; i++)
{
for(int j=0 ; j<3; j++)
{
for(int k=0;k<10; k++)
{
cout << ' ' << a[i][j][k];
}
cout << endl;
}
if(i+1 < 4)
{
cout << "####################" << endl;
}
}
return 0;
} | 0 | 77,811,475 |
#include<cstdio>
#include<vector>
using namespace std;
int n;
int a,b;
vector<int>g[100001];
bool f[100001];
bool dfs(int x,int fa)
{
f[x]=1;
int cnt=0;
for(int i=0;i<g[x].size();i++)
{
if(g[x][i]==fa)continue;
if(dfs(g[x][i],x))return 1;
if(f[g[x][i]])
{
cnt++;
f[x]=0;
if(cnt==2)return 1;
}
}
return 0;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<n;i++)
{
scanf("%d%d",&a,&b);
g[a].push_back(b);
g[b].push_back(a);
}
if(dfs(1,0)||f[1])printf("First");
else printf("Second");
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (auto &t : a) {
cin >> t;
}
vector<int> seen = a;
sort(seen.begin(), seen.end());
seen.resize(unique(seen.begin(), seen.end()) - seen.begin());
reverse(seen.begin(), seen.end());
seen.push_back(0);
map<int, int> moc;
map<int, int> occ;
for (int i = 0; i < n; i++) {
if (!moc.count(a[i])) moc[a[i]] = i;
occ[a[i]]++;
}
int cm = n;
int cnt = 0;
for (int i = 0; i + 1 < (int)seen.size(); i++) {
cm = min(cm, moc[seen[i]]);
cnt += occ[seen[i]];
ans[cm] += (seen[i] - seen[i + 1]) * cnt;
}
for (auto t : ans) {
cout << t << ' ';
}
cout << '\n';
} | 0 | 3,004,200 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
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; }
int main(){
int n, m;
cin >> n >> m;
map<int, int> mp;
rep(i,m){
int a, b;
cin >> a >> b;
a--; b--;
mp[a]++;
mp[b]++;
}
rep(i,n){
if (mp[i] % 2 != 0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int M, K; cin >> M >> K;
if (M == 0) {
cout << (K == 0 ? "0 0" : "-1") << "\n";
return 0;
}
if (M == 1) {
cout << (K == 0 ? "0 0 1 1" : "-1") << "\n";
return 0;
}
if (1<<M <= K) {
cout << "-1\n";
return 0;
}
cout << K;
for (int i = 0; i < 1<<M; i++)
if (i != K) cout << " " << i;
cout << " " << K;
for (int i = (1<<M)-1; i >= 0; i--)
if (i != K) cout << " " << i;
} | 0 | 93,725,395 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
ll c=0,ans=0;
for(int i=0;i<n-1;i++)
{
if(a[i+1]>a[i])
{
ans= max(ans,c);
c=0;
}
else
c++;
}
ans= max(ans,c);
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
#define addm(X, Y) ((X) = ((X) + (Y) % mod) % mod)
int n;
int a[100000 + 5];
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
int ans = 0;
ans += a[0] - 1;
int mn = 2;
rep2(i, 1, n) {
if (a[i] == mn) mn += 1;
else if (a[i] > mn) {
if (a[i] % mn == 0) {
ans += a[i] / mn - 2;
ans++;
}
else ans += a[i] / mn;
}
}
cout << ans << endl;
} | 0 | 81,871,409 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
int a,b,c,d; cin>>a>>b>>c>>d;
bool ans = (abs(a-c) <= d) || (abs(a-b) <= d && abs(b-c) <= d);
COUT(ans ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end int endtime = clock(); \
cerr << "\n\n" << "Time elapsed: " << \
(endtime - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n"; \
return 0;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 998244353
#define inf 100000000000000007
#define eps 0.000000000001
#define pi acosl(-1)
#define pdd pair<ld,ld>
#define pll pair<ll,ll>
#define ff first
#define ss second
#define vpl vector<pll>
#define vll vector<ll>
#define mseti multiset <ll>
#define msetd multiset <ll,greater<ll>>
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define stp fixed<<setprecision(20)
#define endl '\n'
ll a[100009],b[64];
ll gmatrix[100009][64];
ll basis[100009];
void add(ll x,ll index)
{
for(ll i=63;i>=0;i--)
{
if(b[i])
continue;
if(x&((ll)1<<i))
{
if(gmatrix[index][i])
x^=gmatrix[index][i];
else
{
gmatrix[index][i]=x;
basis[index]++;
return;
}
}
}
}
ll maximum(ll x,ll index)
{
for(ll i=63;i>=0;i--)
{
if(b[i])
continue;
if(!(x&((ll)1<<i)))
{
x^=gmatrix[index][i];
}
}
return x;
}
void solve()
{
ll n;
cin>>n;
ll x;
ll z=0;
for(ll i=0;i<n;i++)
{
cin>>a[i];
x=a[i];
for(ll j=0;j<62;j++)
{
ll p=x%2;
b[j]^=p;
x/=2;
}
}
for(ll i=0;i<n;i++)
{
x=a[i];
z^=x;
add(x,0);
}
ll p=maximum(0,0);
z^=p;
cout<<p+z;
}
int main()
{
FAST
#ifdef ayk_16
freopen("input.txt","rt",stdin);
freopen("output.txt","wt",stdout);
#endif
time_taken_start
ll t=1;
for(ll i=0;i<t;i++)
{
solve();
}
time_taken_end
} | 0 | 14,458,460 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dp[100010];
int INF=INT_MAX;
int main(){
int n;
cin>>n;
for(int i = 0; i <= n; i++){
dp[i]=INF;
}
dp[0]=0;
for(int i=1; i <=n; i++){
if(i>=1) chmin(dp[i],dp[i-1]+1);
if(i>=6) chmin(dp[i],dp[i-6]+1);
if(i>=9) chmin(dp[i],dp[i-9]+1);
if(i>=36) chmin(dp[i],dp[i-36]+1);
if(i>=81) chmin(dp[i],dp[i-81]+1);
if(i>=216) chmin(dp[i],dp[i-216]+1);
if(i>=729) chmin(dp[i],dp[i-729]+1);
if(i>=1296) chmin(dp[i],dp[i-1296]+1);
if(i>=6561) chmin(dp[i],dp[i-6561]+1);
if(i>=7776) chmin(dp[i],dp[i-7776]+1);
if(i>=46656) chmin(dp[i],dp[i-46656]+1);
if(i>=59049) chmin(dp[i],dp[i-59049]+1);
}
cout<<dp[n]<<endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-11;
int main() {
ll N;
cin >> N;
ll X[N], Y[N];
int mark = -1;
bool ok = true;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
if (i == 0) {
mark = (abs(X[i]) + abs(Y[i])) % 2;
} else {
if (mark != (abs(X[i]) + abs(Y[i])) % 2) {
ok = false;
}
}
}
if (!ok) {
cout << -1 << endl;
return 0;
}
if (mark == 0) {
for (int i = 0; i < N; i++) {
Y[i]--;
}
}
ll u[N], v[N];
for(int i = 0; i < N; i++) {
u[i] = X[i] + Y[i];
v[i] = X[i] - Y[i];
}
ll m = 31;
if (mark == 0) {
m++;
}
ll d[m];
for (int i = 0; i < 31; i++) {
d[i] = 1 << i;
}
if (mark == 0) {
d[31] = 1;
}
string ans[N];
fill(ans, ans + N, "");
for (int i = 0; i < N; i++) {
ll unum = (u[i] + (1 << 31) - 1) / 2;
ll vnum = (v[i] + (1 << 31) - 1) / 2;
for (int j = 0; j < 31; j++) {
bool uok, vok;
if ((unum & (1 << j)) > 0) {
uok = true;
} else {
uok = false;
}
if ((vnum & (1 << j)) > 0) {
vok = true;
} else {
vok = false;
}
if (uok) {
if (vok) {
ans[i].push_back('R');
} else {
ans[i].push_back('U');
}
} else {
if (vok) {
ans[i].push_back('D');
} else {
ans[i].push_back('L');
}
}
}
if (mark == 0) {
ans[i].push_back('U');
}
}
cout << m << endl;
for (int i = 0; i < m; i++) {
cout << d[i];
if (i != m - 1) {
cout << " ";
} else {
cout << endl;
}
}
for (int i = 0; i < N; i++) {
cout << ans[i] << endl;
}
} | 0 | 24,284,732 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) sort(ALL(v));
#define DESC(v) sort(ALL(v), greater<int>());
#define UNIQ(a) sort(ALL(a));(a).resize(unique(ALL(a)) - a.begin());
#define PRINTD(x, d) cout << fixed << setprecision(d) << x << "\n";
#define DEBUG(x) cout<<#x<<": "<<x<<"\n"
const double PI = acos(-1);
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
bool isprime(int x){ int i; if(x<2)return 0; else if(x==2) return 1; if(x%2==0) return 0; for(i=3; i*i<=x; i+=2) if(x%i==0) return 0; return 1; }
int digsum(int n) { int r=0; while(n>0) { r+=n%10; n/=10; } return r; }
vector<string> split(string s, char p){vector<string>v;stringstream m(s);string b;while(getline(m,b,p))v.push_back(b);return 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; }
struct nya{ nya(){ cin.tie(0); ios::sync_with_stdio(false); } }nyan;
int main(){
string top, under;
cin >> top >> under;
reverse(ALL(under));
if (top == under) cout << "YES\n";
else cout << "NO\n";
} | #include <iostream>
using namespace std;
int main(){
long long n, cnt=0;
cin >> n;
for(long long i=1; i*i<=n; i++){
if(n % i != 0){
continue;
}
long long a = i, m = n / i - 1;
if(m > a) cnt += m;
}
cout << cnt << endl;
return 0;
} | 0 | 27,607,581 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#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 REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int,int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
const int N = 1<<18;
mat dp(N,vec(2,0));
void solve(int x, int y){
vec a = {dp[x][0],dp[x][1],dp[y][0],dp[y][1]};
sort(a.rbegin(),a.rend());
a.resize(2);
dp[y] = a;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(1<<n);
REP(i,1<<n) cin >> a[i], dp[i][0] = a[i];
REP(i,n){
REP(j,1<<n){
if(j&(1<<i)) continue;
solve(j,j|(1<<i));
}
}
int mx = 0;
FOR(i,1,1<<n){
mx = max(mx,dp[i][0]+dp[i][1]);
cout << mx << "\n";
}
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main(){
ll n,m;
cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n){
cin >> a[i];
}
rep(i,m){
cin >> b[i];
}
for(ll i=0;i+m-1<n;i++){
for(ll j=0;j+m-1<n;j++){
bool ok=true;
rep(p,m){
rep(q,m){
if(a[i+p][j+q]!=b[p][q]) ok=false;
}
}
if(ok){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | 0 | 9,415,552 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
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() {
vector<string> S;
vector<int> T;
int N;
cin >> N;
REP(i,N){
string s;
int t;
cin >> s >> t;
S.push_back(s);
T.push_back(t);
}
string X; cin >> X;
int ans = 0;
REP(i,N){
if (X == S[i]){
for (size_t k = i + 1; k < N; k++) {
ans += T[k];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pll;
const int N = 105;
int n, m, r[N], c[N];
char arr[N][N];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 0;i < n;++i)
{
for(int j = 0;j < m;++j)
{
cin >> arr[i][j];
if(arr[i][j] == '.')
++r[i], ++c[j];
}
}
for(int i = 0;i < n;++i)
{
if(r[i] != m)
{
for(int j = 0;j < m;++j)
if(c[j] != n)
cout << arr[i][j];
cout << '\n';
}
}
return 0;
} | 0 | 32,360,170 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI =3.14159265358979323846;
const ll M=1e9+7;
const ll inf=1e18;
const ll ms=2e5+5;
fast;
ll n,m,x,y,ans;
void solve()
{
ll x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
ll diff1=x2-x1,diff2=y2-y1;
cout<<x2-diff2<<" "<<y2+diff1<<" "<<x1-diff2<<" "<<y1+diff1<<endl;
}
int main()
{
{
solve();
}
return 0;
} | # include <algorithm>
# include <cassert>
# include <cctype>
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <cmath>
# include <iostream>
# include <map>
# include <queue>
# include <set>
# include <sstream>
# include <stack>
# include <string>
# include <vector>
# include <iomanip>
# define rep(i, n) for (int i = 0; i < (int)(n); i++)
# define irep(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define FOR(i, m, n) for (int i = int(m); i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> A(n);
rep (i, n) cin >> A[i];
ll max = -1000001;
ll min = 1000001;
ll sum = 0;
for (ll e : A) {
min = (e < min) ? e : min;
max = (e > max) ? e : max;
sum += e;
}
cout << min << ' ' << max << ' ' << sum << endl;
} | 0 | 7,828,943 |
#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 s, ans = 0;
cin >> s;
set<ll> num;
num.insert(s);
ans++;
while(1) {
if((s%2) == 0) {
s /= 2;
ans++;
if(num.count(s)) {
break;
}
else {
num.insert(s);
}
}
else {
s = 3*s + 1;
ans++;
if(num.count(s)) {
break;
}
else {
num.insert(s);
}
}
}
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;
} | #include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> beg, end;
for (int i = 0, a; i < n; i++) {
cin >> a;
if (i % 2 == 0) {
beg.emplace_back(a);
} else {
end.emplace_back(a);
}
}
vector<int> ans;
for (int i = (int)beg.size() - 1; ~i; i--) {
ans.emplace_back(beg[i]);
}
for (int i = 0; i < (int)end.size(); i++) {
ans.emplace_back(end[i]);
}
if (n % 2 == 0) reverse(ans.begin(), ans.end());
cout << ans[0];
for (int i = 1; i < n; i++) {
cout << ' ' << ans[i];
}
cout << '\n';
return 0;
} | 0 | 48,200,003 |
#include<iostream>
using namespace std;
#include<iomanip>
int main()
{
int a, b, r, d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (a * 1.0) / b;
cout << d << " " << r << " " << fixed << setprecision(10) << f << endl;
return 0;
} | #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 <numeric>
#include <cmath>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for(int i=0;i<(n);i++)
#define REP(i, n) for(int i=1;i<=(n);i++)
#define P pair<int,int>
int mx8[] = {0, 0, 1, -1, -1, 1, -1, 1};
int my8[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int mx4[] = {1, -1, 0, 0};
int my4[] = {0, 0, -1, 1};
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
unsigned long long ans = 1;
vector<unsigned long long> a(n);
rep(i, n)
{
cin >> a[i];
}
sort(a.begin(), a.end());
rep(i, n)
{
if (a[i] == 0)
{
cout << 0 << endl;
return 0;
}
if (ans > 1000000000000000000 / a[i])
{
cout << -1 << endl;
return 0;
}
ans *= a[i];
}
cout << ans << endl;
} | 0 | 92,367,277 |
#include <stdio.h>
int main(){
int a,b,c,tmp;
scanf("%d %d %d",&a,&b,&c);
if(a>b){
tmp=a;
a=b;
b=tmp;
}
if(a>c){
tmp=a;
a=c;
c=tmp;
}
if(b>c){
tmp=b;
b=c;
c=tmp;
}
printf("%d %d %d\n",a,b,c);
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 105
struct Info{
double limit,t;
};
struct Data{
void set(int arg_left,int arg_right,int arg_limit){
left = arg_left;
right = arg_right;
limit = arg_limit;
}
double left,right,limit;
};
int N;
double from_L[NUM],from_R[NUM],ans[NUM];
Info info[NUM];
Data data[NUM];
int main(){
scanf("%d",&N);
info[0].t = 0;
for(int i = 1; i <= N; i++){
scanf("%lf",&info[i].t);
info[i].t += info[i-1].t;
}
info[N+1].t = info[N].t;
info[0].limit = 0;
for(int i = 1; i <= N; i++){
scanf("%lf",&info[i].limit);
}
info[N+1].limit = 0;
data[0].set(0,0,0);
for(int i = 1; i <= N; i++){
data[i].set(info[i-1].t,info[i].t,info[i].limit);
}
data[N+1].set(info[N].t,info[N].t,0);
double ans = 0,pre = 0,minimum;
int index;
for(double current = 0; current < info[N+1].t || fabs(info[N+1].t-current) < EPS; current += 0.5){
minimum = BIG_NUM;
for(index = 0; current-data[index].right >= EPS; index++){
minimum = min(minimum,data[index].limit+(current-data[index].right)*1);
}
minimum = min(minimum,data[index].limit);
for(++index; index <= N+1; index++){
minimum = min(minimum,data[index].limit+(data[index].left-current)*1);
}
ans += (pre+minimum);
pre = minimum;
}
printf("%.10lf\n",ans/4);
return 0;
} | 0 | 85,903,194 |
#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>
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;
int main(){
ll N,K;
cin >> N >> K;
vector<ll> H(N);
rep(i,N)cin >> H[i];
sort(H.begin(),H.end());
if(K >= N)cout << 0 << endl;
else{
ll ans = 0;
rep(i,N-K)ans += H[i];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
int main(){
int n,m;
cin >> n >> m;
int k[m];
vector<vector<int>> ss(m);
int p[m];
rep(i,m){
cin >> k[i];
rep(ii,k[i]){
int d;
cin >> d;
ss[i].push_back(d);
}
}
rep(i,m)cin >> p[i];
int ans=0;
for (int tmp = 0; tmp < (1 << n); tmp++) {
bitset<12> s(tmp);
int pp=0;
rep(i,m){
int d=0;
for(auto f:ss[i]){
if(s[f-1])d++;
}
if((d+2)%2==p[i])pp++;
}
if(pp==m)ans++;
}
cout << ans << endl;
} | 0 | 7,724,542 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int a=0;
int b=0;
int ba=0;
int ans = 0;
for(int i = 0; i < N; i++){
string S;
cin >> S;
if(S[0] != 'B' && S[S.size()-1] == 'A') a++;
if(S[0] == 'B' && S[S.size()-1] != 'A') b++;
if(S[0] == 'B' && S[S.size()-1] == 'A') ba++;
for(int i = 0; i < S.size() -1; i++){
if(S[i] == 'A' && S[i+1] == 'B') ans++;
}
}
cerr << a << " "<< b << " " << ba << " " << ans << endl;
if(ba == 0){
ans += min(a,b);
} else {
if(a + b > 0){
ans += ba + min(a,b);
}
if(a+b==0){
ans += ba-1;
}
}
cout << ans << endl;
} | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
vector<ll> v;
map<ll,ll> mp;
rep(i,N){
ll A;
cin >> A;
if(mp.count(A)) mp[A]++;
else{
mp.emplace(A,1);
v.push_back(A);
}
}
ll ex = 0;
rep(i,v.size()){
ex += mp[v[i]]-1;
}
if(ex%2==1) ex++;
ll out = N-ex;
cout << out << endl;
return 0;
} | 0 | 5,151,731 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int i=0,max=0,maxNumber=-1,maxN=0,maxNNumber=0;
string str[1000];
while(cin>>str[i]){
i++;
}
int wordCount[i+1];
for(int j=0;j<i+1;j++){
wordCount[j]=0;
}
bool kaburi[i+1];
for(int j=0;j<i+1;j++){
if(kaburi[j]) continue;
if(max<str[j].length()){
max=str[j].length();
maxNumber=j;
}
for(int k=0;k<i+1;k++){
if(str[j]==str[k]){
wordCount[j]++;
kaburi[k]=true;
}
}
}
for(int j=0;j<i+1;j++){
if(maxN<wordCount[j]){
maxN=wordCount[j];
maxNNumber=j;
}
}
cout<<str[maxNNumber]<<' '<<str[maxNumber]<<endl;
return 0;
} | #include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
#define MAXN 0x3f3f3f3f
ll a[1005];
ll s[500501];
ll ss[41];
ll kkk[41];
int n,k;
vector<ll> K,S;
int pp=40;
void solve(int pos)
{
for(int p=pos-1;p>=0;p--)
{
int ppp=0;
for(int i=0;i<K.size();i++)
{
if(K[i]>>p&1)
ppp++;
}
if(ppp>=k)
{
pp=p;
kkk[pp]=1;
break;
}
}
if(pos==pp)
return;
for(int i=0;i<K.size();i++)
{
if(K[i]>>pp&1)
S.push_back(K[i]);
}
K=S;
S.clear();
solve(pp);
}
int main()
{
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
int po=0;
for(int i=0;i<n;i++)
{
ll sum=0;
for(int j=i;j<n;j++)
{
sum+=a[j];
K.push_back(sum);
}
}
solve(41);
ll ssss=1,ans;
for(int i=0;i<=40;i++)
{
if(kkk[i]==1)
ans+=ssss;
ssss*=2;
}
printf("%lld\n",ans);
return 0;
} | 0 | 20,610,540 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
int n,a,b;
cin>>n>>a>>b;
if(n<a+b-1||n>a*b){
cout<<-1;
return 0;
}
if(b==1){
for(int i=1;i<=n;i++)cout<<i<<' ';
return 0;
}
if(a==1){
for(int i=1;i<=n;i++)cout<<n+1-i<<' ';
return 0;
}
int k=(n-a)/(b-1),t=(n-a)%(b-1);
for(int i=0;i<k;i++){
for(int j=b;j>0;j--)cout<<i*b+j<<' ';
}
if(n!=a*b){
for(int i=t+1;i>0;i--)cout<<k*b+i<<' ';
for(int i=a-k-1;i>0;i--)cout<<n+1-i<<' ';}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
vector<int64_t> vec(N);
int64_t sum = 0;
for(int i=0; i<N; i++){
cin >> vec[i];
sum += vec[i];
}
vector<int64_t> d(N);
for(int i=0; i<N-1; i++){
d[i] = vec[i+1] - vec[i];
}
d[N-1] = vec[0] - vec[N-1];
bool flag = true;
int64_t cnt = sum / (N*(N+1)/2);
if(sum % (N*(N+1)/2) != 0){
flag = false;
}
int64_t num = 0;
for(int i=0; i<N; i++){
int64_t C = 0;
while(cnt - C != d[i]){
if(d[i] > cnt){
flag = false;
break;
}
d[i] += N-1;
C++;
num++;
}
}
if(flag && num == cnt){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | 0 | 64,873,559 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int a[5],i;
while(cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]){
sort(a,a+5,greater<int>());
i=0;
for(int i=0;i<5;i++){
cout << a[i];
if(i!=4)cout << " ";
else cout << endl;
}
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
string S; cin >> S;
int cnt = 0; int s_flg = 0;
for (int ii = 0; ii < 3; ii++) {
if (S[ii] == 'R') {
if (s_flg == 1) {
cnt = 1;
s_flg = 0;
} else {
cnt++;
}
}
else s_flg = 1;
}
cout << cnt << endl;
} | 0 | 1,862,705 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
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 int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
vector<int> a(4);
rep(i,4)cin >> a[i];
sort(all(a));
if(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#define int long long int
#define gif(a,b) (a/b +(a%b?1:0))
#define pi 3.14159265358
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n";
#define float long double
using namespace std;
int32_t main()
{
cin.tie(NULL);
std::ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.length();
int flag = 0 , flag2 = 0;
if(s[0] == 'A')
flag++;
for(int i = 1; i < n ; ++i)
{
if(!(s[i] == 67 || s[i] >= 97))
{
cout << "WA";
return 0;
}
}
if(s[n -1] == 67)
{
cout << "WA";
return 0;
}
for(int i = 2; i < n - 1; ++i)
if(s[i] == 67)
flag2++;
if(flag == 1 && flag2 == 1)
cout << "AC";
else
cout << "WA";
return 0;
} | 0 | 71,990,704 |
#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> pii;
typedef pair<pii,pii> ppii;
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 cho=0,aok=0;
int n;
cin >>n;
vector<pii>a_b;
vector<pii>ab;
rep(i,n){
int a,b;
cin>>a>>b;
ab.emplace_back(a,b);
a_b.emplace_back(a+b,i);
}
sort(all(a_b),greater<pii>());
int ch=0,ao=n-1;
rep(i,n){
if(i%2==0){
cho += ab[a_b[i].se].fi;
}else{
aok += ab[a_b[i].se].se;
}
}
ll ans = cho - aok;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define DEBUG(x) cerr << #x << ": " << x << "\n"
#define PRINTALL(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << "\n";
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair< int, int >
using namespace std;
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;
}
template < class T > using vec = std::vector< T >;
template < class T > void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF = 1061109567, INF2 = INF * INF;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int a[100100];
int mat[100100][60];
int absum[60];
int matVal[60];
bool flg[60];
int calcRank(int M, int N, int a[100100][60]) {
int cnt = 0;
REP(i, N) {
int pivot = cnt;
FOR(j, cnt, N) {
if (abs(a[j][i]) > abs(a[pivot][i]))
pivot = j;
}
swap(a[cnt], a[pivot]);
if (abs(a[cnt][i]) < EPS) {
continue;
}
REP(j, M) {
if (cnt != j) {
FOR(k, i + 1, N) a[j][k] -= a[j][i] * a[cnt][k];
}
}
REP(j, M) a[j][i] = (j != cnt) ? 0 : 1;
cnt++;
}
return cnt;
}
int calcRankXor(int M, int N, int a[100100][60]) {
int cnt = 0;
REP(i, N) {
int pivot = cnt;
FOR(j, cnt, N) {
if (a[j][i] == 1) {
pivot = j;
break;
}
}
swap(a[cnt], a[pivot]);
if (a[cnt][i] == 0)
continue;
REP(j, M) {
if (cnt != j) {
FOR(k, i + 1, N) a[j][k] = (a[j][k] + a[j][i] * a[cnt][k]) % 2;
}
}
REP(j, M) a[j][i] = (j != cnt) ? 0 : 1;
cnt++;
}
return cnt;
}
int bb[100100][60];
signed main() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
cin >> N;
REP(i, N) { cin >> a[i]; }
REP(i, N) {
REP(j, 60) {
if (a[i] & BIT(j)) {
absum[j]++;
}
}
}
int cnt = 0;
REPR(i, 59) {
if (absum[i] % 2 == 0 && absum[i] > 0) {
matVal[cnt] = BIT(i);
REP(j, N) { mat[j][cnt] = (a[j] & BIT(i)) ? 1 : 0; }
cnt++;
}
}
int res = calcRankXor(N, cnt, mat);
int tmpres = res;
res = N;
int ans = 0;
vec< int > b(res, 0);
bool flg = false;
REP(j, res) {
REP(i, cnt) { b[j] += (mat[j][i]) ? matVal[i] : 0; }
if (j >= tmpres && b[j] > 0) {
flg = true;
}
}
if (flg) {
DEBUG(N);
PRINTALL(a);
cout << "\n";
}
REP(i, res) chmax(ans, ans ^ b[i]);
ans *= 2;
REP(i, 60) {
if (absum[i] % 2 == 1) {
ans += BIT(i);
}
}
print(ans);
} | 0 | 91,347,439 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define REP(var, a, b) for (int var = (a); var < (b); var++)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define ALL(c) (c).begin(), (c).end()
#define rALL(c) (c).rbegin(), (c).rend()
ll MOD = 1000000007;
const ll INF = 1LL << 60;
int main() {
ll n, k;
cin >> n >> k;
vl h(n + 1, 0);
rep(i, n) cin >> h[i + 1];
vvl data(n + 1, vl(n + 1, 0));
REP(x, 1, n + 1) data[x][1] = h[x];
REP(x, 1, n + 1) {
REP(y, 2, n - k + 1) {
ll tmp = INF;
REP(i, 1, x) { tmp = min(tmp, data[i][y - 1] + max(0LL, h[x] - h[i])); }
data[x][y] = tmp;
}
}
ll ans = INF;
REP(i, 1, n + 1) { ans = min(ans, data[i][n - k]); }
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int prime[1000000];
bool is_prime[1000000];
int seive(int n){
int p=0;
for(int i=0;i<=n;i++) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=n;i++){
if(is_prime[i]){
prime[p++]=i;
for(int j=2*i;j<=n;j+=i){
is_prime[j]=false;
}
}
}
return p;
}
int main() {
int n;
while(cin>>n){
cout<<seive(n)<<endl;
}
} | 0 | 82,880,702 |
#include <iostream>
int memo[7][7] = {-1};
int x[3][5] = {{1,2,6,5,1}, {1,3,6,4,1}, {2,3,5,4,2}};
int sides[3][2] = {{4, 3}, {2, 5}, {6, 1}};
int detect_right_side_index(int *dice, int top, int front) {
int top_index, front_index;
bool top_flag = false, front_flag = false;
for (int i = 1; i <= 6; i ++) {
if (!top_flag && dice[i] == top) top_index = i, top_flag = true;
if (!front_flag && dice[i] == front) front_index = i, front_flag = true;
}
return memo[top_index][front_index];
}
int main() {
int dice[7];
int top, front, q;
char command;
for (int j = 0; j < 3; j ++) {
for (int i = 1; i < 5; i ++) {
memo[x[j][i]][x[j][i-1]] = sides[j][0];
memo[x[j][i-1]][x[j][i]] = sides[j][1];
}
}
for (int i = 1; i < 7; i ++)
std::cin >> dice[i];
std::cin >> q;
for (int i = 0; i < q; i ++) {
std::cin >> top >> front;
std::cout << dice[detect_right_side_index(dice, top, front)] << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
int count(int c[6][6]){
long res=0;
long long i,j;
for(i=0;i<6;i++){
for(j=0;j<6;j++){
res+=c[i][j];
}
}
return res;
}
int main(void){
long long h,w,k;
long long i,j,l,m;
string tmp;
long long res=0;
int tmp2;
cin>>h>>w>>k;
int c[6][6];
int c_tmp[6][6]={};
int c_tmp2[6][6]={};
for(i=0;i<6;i++){
for(j=0;j<6;j++){
c[i][j]=0;
}
}
for(i=0;i<h;i++){
cin>>tmp;
for(j=0;j<w;j++){
c[i][j]=(tmp[j]=='#');
}
}
for(i=0;i<pow(2,h);i++){
for(l=0;l<6;l++){
for(m=0;m<6;m++){
c_tmp[l][m]=c[l][m];
}
}
if((i&1)==1){
for(l=0;l<6;l++){
c_tmp[0][l]=0;
}
}
if((i&2)==2){
for(l=0;l<6;l++){
c_tmp[1][l]=0;
}
}
if((i&4)==4){
for(l=0;l<6;l++){
c_tmp[2][l]=0;
}
}
if((i&8)==8){
for(l=0;l<6;l++){
c_tmp[3][l]=0;
}
}
if((i&16)==16){
for(l=0;l<6;l++){
c_tmp[4][l]=0;
}
}
if((i&32)==32){
for(l=0;l<6;l++){
c_tmp[5][l]=0;
}
}
for(j=0;j<pow(2,w);j++){
for(l=0;l<6;l++){
for(m=0;m<6;m++){
c_tmp2[l][m]=c_tmp[l][m];
}
}
if((j&1)==1){
for(l=0;l<6;l++){
c_tmp2[l][0]=0;
}
}
if((j&2)==2){
for(l=0;l<6;l++){
c_tmp2[l][1]=0;
}
}
if((j&4)==4){
for(l=0;l<6;l++){
c_tmp2[l][2]=0;
}
}
if((j&8)==8){
for(l=0;l<6;l++){
c_tmp2[l][3]=0;
}
}
if((j&16)==16){
for(l=0;l<6;l++){
c_tmp2[l][4]=0;
}
}
if((j&32)==32){
for(l=0;l<6;l++){
c_tmp2[l][5]=0;
}
}
tmp2=count(c_tmp2);
if(k==tmp2){
res++;
}
}
}
cout<<res<<endl;
return 0;
} | 0 | 72,643,994 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int n;cin>>n;
string a[n];
int b[n];
vector<string>c;
string tmp;
rep(i,n){
cin>>a[i];
c.push_back(a[i]);
b[i]=a[i].size();
}
sort(c.begin(),c.end());
rep(i,n-1){
if(a[i+1][0]!=a[i][b[i]-1] ||c[i+1]==c[i]){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | #include <iostream>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <vector>
using namespace std;
void solver() {
int my=0,n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
my+=arr[i];
}
int var,var1;
var=my/n;
var1=var+1;
int ans=0;
int ans1=0;
for(int i=0;i<n;i++)
{
int m=(var-arr[i])*(var-arr[i]);
ans+=m;
int m1=(var1-arr[i])*(var1-arr[i]);
ans1+=m1;
}
cout<<min(ans,ans1);
}
int main() {
int n=1;
while(n--)
{
solver();
}
} | 0 | 60,960,994 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a == b) {
cout << a << endl;
exit(0);
}
if (a + 1 == b) {
cout << (a ^ b) << endl;
exit(0);
}
if (a % 2 == 1) {
ans ^= a;
a++;
}
if (b % 2 == 0) {
ans ^= b;
b--;
}
if ((b - a + 1) % 4) {
ans ^= 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
string S;
cin >> S;
vec A(26, 0);
REP(i,0,SZ(S)) A[S[i]-'a'] = i + 1;
if(SZ(S) < 26) {
ll k = 0;
while(A[k] > 0) ++k;
PR(S+(char)(k+'a'));
}
else {
ll k = 25;
while(k > 0 && S[k-1] > S[k]) --k;
if(k > 0) {
char c = 'z';
REP(i,k,26) {
if(S[i] > S[k-1]) c = MIN(c,S[i]);
}
PR(S.substr(0,k-1)+c);
}
else PR(-1);
}
return 0;
} | 0 | 83,719,283 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main() {
int n;
int ans = 0;
cin >> n;
vector<int> button(n + 1, 0);
vector<int> check(n + 1, -1);
rep(i, n) cin >> button[i + 1];
int next = 1;
while(check[next] == -1 && next != 2)
{
check[next] = 0;
next = button[next];
ans ++;
}
if(next == 2) cout << ans << endl;
else cout << -1 << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
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; }
template <typename F,typename T>
struct SegTree{
T identity;
F merge;
int size;
vector<T> dat;
SegTree(F f,T id):merge(f),identity(id){}
void init(int n){
size = 1;
while(size<=n) size *= 2;
dat.resize(size*2-1,identity);
}
void build(vector<T> vec){
rep(i,vec.size()) dat[size-1+i] = vec[i];
dfs(0);
}
T dfs(int k){
if(k>=size-1) return dat[k];
else return dat[k] = merge(dfs(2*k+1),dfs(2*k+2));
}
void update(int k,T a){
k += size - 1;
dat[k] = a;
while(k > 0){
k = (k-1)/2;
dat[k] = merge(dat[2*k+1],dat[2*k+2]);
}
}
T query(int a,int b,int k,int l,int r){
if(r<=a||b<=l) return identity;
if(a<=l&&r<=b) return dat[k];
else return merge(query(a,b,2*k+1,l,(l+r)/2),query(a,b,2*k+2,(l+r)/2,r));
}
void show(){
int index = 0;
int num = 1;
while(index<size){
rep(i,num){
if(dat[i+index]==identity) cout << "e ";
else cout << dat[i+index] << " ";
}
cout << "\n";
num *= 2;
index = index*2+1;
}
}
};
vector<int> compress(vector<int> a) {
int n = a.size();
vector<int> vals;
rep(i,n) vals.push_back(a[i]);
sort(vals.begin(), vals.end());
vals.erase(unique(vals.begin(), vals.end()), vals.end());
vector<int> res;
rep(i,n) {
int id = lower_bound(vals.begin(), vals.end(), a[i]) - vals.begin();
res.push_back(id);
}
return res;
}
int LIS(vector<int> a) {
int n = a.size();
a = compress(a);
auto f = [&](int a, int b) { return max(a, b); };
int id = 0;
SegTree<decltype(f), int> seg(f, id);
seg.init(n);
int res = 0;
rep(i,n) {
int x = seg.query(0, a[i], 0, 0, seg.size);
seg.update(a[i], x+1);
chmax(res, x+1);
}
return res;
}
int main()
{
int n;cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
cout << LIS(a) << "\n";
return 0;
} | 0 | 33,043,283 |
#include <iostream>
int main() {
int a,b,c,res;
std::cin >> a >> b >> c;
if (a == b && b == c) {
res = 1;
} else if ( a == b || b == c || c == a) {
res = 2;
} else {
res = 3;
}
std::cout << res << std::endl;
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
#define int long long
signed main() {
string s;cin >> s;
reverse(all(s));
rep(i, s.size()) {
if(s[i]=='m') {
if(s.substr(i,5) == "maerd") {
i+=4;
continue;
}
cout << "NO\n";
return 0;
}
else if(s[i]=='e') {
if(s.substr(i, 5)=="esare") {
i+=4;
continue;
}
cout << "NO\n";
return 0;
}
else if(s[i]=='r') {
if(s.substr(i,6)=="resare") {
i+=5;
continue;
}
else if(s.substr(i, 7)=="remaerd") {
i+=6;
continue;
}
cout << "NO\n";
return 0;
cout << "NO\n";
return 0;
}
else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
return 0;
} | 0 | 91,004,968 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
using ll = long long;
int main() {
string S;
cin >> S;
rep(i, 0, 7){
string S2 = S.substr(0, i) + S.substr(S.size()-7+i, 7-i);
if(S2 == "keyence"){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i,n) for(i = 0; i < n; i++)
#define f1(i,n) for(i = 1; i <= n; i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin(), v.end(), val)
#define lower(v,val) lower_bound(v.begin(), v.end(), val)
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x,y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x,y,z) cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << endl
#define dbg4(x,y,z,q) cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << ", " << #q << " = " << q << endl
#define jaldi_chal() ios_base::sync_with_stdio(false); cin.tie(NULL);
#define S second
#define F first
#define fm(it,m) for(it = m.begin(); it != m.end(); it++)
#define ct_set(n) __builtin_popcount(n)
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265
#define precision cout << setprecision(15)
#define print_arr(a,n) for(int i = 0; i < n; i++) cout << a[i] << " ";
#define print_vec(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " ";
using namespace std;
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a,ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = (a * b) / g;
return ans;
}
ll add(ll a, ll b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
ll mul(ll a, ll b) {
return (a * b) % mod;
}
vector <ll> primes;
bool prime[10005];
void seive() {
mem(prime, 1);
prime[0] = 0;
prime[1] = 0;
for(ll i = 2; i <= 10000; i++)
{
if(prime[i] == 1)
{
for(ll j = i * i; j <= 10000; j += i)
prime[j] = 0;
}
}
}
ll power(ll a, ll b) {
ll ans = 1;
while(b > 0)
{
if(b % 2 == 1)
ans = (ans % mod * a % mod) % mod;
a = (a * a) % mod;
b = b / 2;
}
return ans;
}
template <typename T>
std::string NumberToString ( T Number ) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string num_to_bits(ll n) {
string ans = "";
while(n) {
ans += (n % 2) + '0';
n /= 2;
}
reverse(all(ans));
return ans;
}
ll bits_to_num(string s) {
ll ans = 0;
for(ll i = 0; i < s.size(); i++) {
ll x = s.size() - i - 1;
ll val = pow(2LL, x);
if(s[i] == '1') {
ans = ans + val;
}
}
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
ll modDivide(ll a, ll b, ll m) {
a = a % m;
ll inv = modInverse(b, m);
return (inv * a) % m;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0)
{
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
void solve() {
ll n, m;
cin >> n >> m;
ll arr[n][3], i, j;
for(i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
ll ans = 0;
for(i = 0; i < 8; i++) {
vector <ll> v;
for(j = 0; j < n; j++) {
ll s = 0;
for(ll k = 0; k < 3; k++) {
if(i & (1 << k)) {
s += arr[j][k];
} else {
s -= arr[j][k];
}
}
v.pb(s);
}
sort(all(v));
reverse(all(v));
ll curr = 0;
for(j = 0; j < m; j++) {
curr += v[j];
}
ans = max(ans, curr);
}
cout << ans;
}
int main() {
jaldi_chal()
bool codechef = 0;
ll t = 1;
if(codechef) {
cin >> t;
}
while(t--) {
solve();
}
return 0;
} | 0 | 43,612,683 |