code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
int N;
int A[222222];
int s[222222];
bool check(int z){
memset(s,0,sizeof(s));
stack<int>st;
for(int i=1;i<N;i++){
if(i&&A[i-1]<A[i])continue;
while(st.size()&&st.top()>A[i]){
s[st.top()]=0;
st.pop();
}
int k=A[i];
while(true){
s[k]++;
if(st.size()==0||st.top()!=k)st.push(k);
if(s[k]<z)break;
s[k]=0;
st.pop();
k--;
if(k==0)return false;
}
}
return true;
}
signed main(){
cin>>N;
rep(i,N){
cin>>A[i];
}
bool ok=true;
rep(i,N-1)if(A[i]>=A[i+1])ok=false;
if(ok){
cout<<1<<endl;
return 0;
}
rep(i,N)chmin(A[i],222222-1);
int lb=1,ub=N;
while(ub-lb>1){
int mid=(ub+lb)/2;
if(check(mid))ub=mid;
else lb=mid;
}
cout<<ub<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
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; }
int main(void){
int N; cin >> N;
VS s(N); REP(i,N) cin >> s[i];
int ans = 0;
REP(i,N){
REP(j,s[i].size()-1) if(s[i][j]=='A'&&s[i][j+1]=='B') ans++;
}
int na=0, nb=0, nab=0;
REP(i,N){
if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A') nab++;
else if(s[i][0]=='B') nb++;
else if(s[i][s[i].size()-1]=='A') na++;
}
if(nab) ans += nab-1;
if(nab && na){
ans++;
na--;
}
if(nab && nb){
ans++;
nb--;
}
ans += min(na,nb);
cout << ans << endl;
return 0;
}
| 0 | 53,585,718 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define mst(a, b) memset(a, b, sizeof(a))
#define X first
#define Y second
#define lowbit(x) (x&(-x))
const int maxn = 100+10;
const int maxm = 10000+10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
ll x,y; cin>>x>>y;
if (x>y) swap(x,y);
if (x==y || x+1==y) cout<<"Brown\n"; else cout<<"Alice\n";
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
string t_cade,h_cade;
int t_point=0,h_point=0;
cin >>n;
for(int i=0;i<n;i++)
{
cin>>t_cade>>h_cade;
if(t_cade==h_cade)
{
t_point++;
h_point++;
}else
{
int index=0;
while (t_cade[index] == h_cade[index])
{
index++;
}
if(t_cade[index] > h_cade[index])
{
t_point+= 3;
}else
{
h_point += 3;
}
}
}
cout<<t_point<<" "<< h_point<<endl;
return 0;
}
| 0 | 51,436,993 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl
#define show2(a, n, m) rep(i, n) { rep(j, m) {cout << a[i][j] << ' ';} cout << endl;}
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const int INF = 1 << 30;
const long long INFL = 1LL << 60;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;
int main() {
int n, m;
cin >> n >> m;
vector<vll> d(n, vll(n, INFL));
rep(i, n) d[i][i] = 0;
rep(i, m) {
ll s, t, _d;
cin >> s >> t >> _d;
d[s][t] = _d;
}
rep(i, n) rep(j, n) rep(k, n) {
chmin(d[j][k], d[j][i] + d[i][k]);
}
bool neg = false;
rep(i, n) if(d[i][i] != 0) neg = true;
if(neg) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
const ll maxd = 10000000000;
rep(i, n) {
rep(j, n) {
if(d[i][j] > maxd) cout << "INF";
else cout << d[i][j];
if(j < n-1) cout << ' ';
}
cout << endl;
}
}
|
#include<string>
#include<iostream>
using namespace std;
class Dice{
int dn[6];
int up, front;
string qu;
public:
Dice(int d1, int d2, int d3, int d4, int d5, int d6){
dn[0] = d1;
dn[1] = d2;
dn[2] = d3;
dn[3] = d4;
dn[4] = d5;
dn[5] = d6;
}
void Result(string m){
int w;
qu = m;
for (int i = 0; i < qu.size(); i++){
switch (qu[i]){
case 'E':
w = dn[0];
dn[0] = dn[3];
dn[3] = dn[5];
dn[5] = dn[2];
dn[2] = w;
break;
case 'N':
w = dn[5];
dn[5] = dn[4];
dn[4] = dn[0];
dn[0] = dn[1];
dn[1] = w;
break;
case 'S':
w = dn[0];
dn[0] = dn[4];
dn[4] = dn[5];
dn[5] = dn[1];
dn[1] = w;
break;
case 'W':
w = dn[0];
dn[0] = dn[2];
dn[2] = dn[5];
dn[5] = dn[3];
dn[3] = w;
break;
}
}
}
string Dice2(int a,int b){
up = a;
front = b;
string qq;
if (up == dn[0]){
if (front == dn[2]){
qq = "WSE";
}
else if (front == dn[3]){
qq = "ESW";
}
else if (front == dn[4]){
qq = "WSSE";
}
}
else if (up == dn[1]){
if (front == dn[0]){
qq = "SEE";
}
else if (front == dn[2]){
qq = "WSEE";
}
else if (front == dn[3]){
qq = "ESWW";
}
else if (front == dn[5]){
qq = "N";
}
}
else if (up == dn[2]){
if (front == dn[0]){
qq = "SW";
}
else if (front == dn[1]){
qq = "W";
}
else if (front == dn[4]){
qq = "SSW";
}
else if (front == dn[5]){
qq = "NW";
}
}
else if (up == dn[3]){
if (front == dn[0]){
qq = "SE";
}
else if (front == dn[1]){
qq = "E";
}
else if (front == dn[4]){
qq = "SSE";
}
else if (front == dn[5]){
qq = "NE";
}
}
else if (up == dn[4]){
if (front == dn[0]){
qq = "S";
}
else if (front == dn[2]){
qq = "WS";
}
else if (front == dn[3]){
qq = "ES";
}
else if (front == dn[5]){
qq = "WWS";
}
}
else if (up == dn[5]){
if (front == dn[1]){
qq = "WW";
}
else if (front == dn[2]){
qq = "SWS";
}
else if (front == dn[3]){
qq = "ESE";
}
else if (front == dn[4]){
qq = "NN";
}
}
return qq;
}
int get_right(){
return dn[2];
}
};
int main()
{
int dnum[6];
int qno, ue, mae;
string q;
for (int i = 0; i < 6; i++){
cin >> dnum[i];
}
Dice d(dnum[0], dnum[1], dnum[2], dnum[3], dnum[4], dnum[5]);
cin >> qno;
for (int i = 0; i < qno; i++){
cin >> ue >> mae;
q = d.Dice2(ue, mae);
d.Result(q);
cout << d.get_right() << endl;
}
return 0;
}
| 0 | 25,771,373 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max))
#define xyrange(x, minX, maxX, y, minY, maxY) (range(x, minX, maxX) && range(y, minY, maxY))
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
const int INF = 0x3f3f3f3f;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
char a, b;
cin >> a >> b;
if (a == 'H') {
if (b == 'H') {
cout << 'H' << endl;
} else {
cout << 'D' << endl;
}
} else {
if (b == 'H') {
cout << 'D' << endl;
} else {
cout << 'H' << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"Yes"<<endl
#define cno cout<<"No"<<endl
#define sp <<" "<<
#define CST(x) cout<<fixed<<setprecision(x)
#define PI 3.14159265359
using namespace std;
using ll = long long;
using ld = long double;
int main(){
vector<ll> sum(100000,0);
int n;
ll k;
cin >> n >> k;
rep(i,n){
int num;
int kosuu;
cin >> num >> kosuu;
num--;
sum.at(num) += kosuu;
}
int point = 0;
while(k > 0){
k -= sum.at(point);
point++;
}
cout << point << endl;
}
| 0 | 29,368,509 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
int main(void){
int a,b;
cin>>a>>b;
if(a>b)cout<<"a > b"<<endl;
if(a<b)cout<<"a < b"<<endl;
if(a==b)cout<<"a == b"<<endl;
return 0;
}
|
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define mod 1000000007
int N;
map<int,int> primes;
void PrimeF(int N){
int M=N;
for(int i=2;i<sqrt(N)+1;i++){
int cnt=0;
while(M%i==0){
M/=i;
cnt++;
}
if(cnt>0){
if(primes.find(i)!=primes.end())primes[i]+=cnt;
else primes[i]=1;
}
}
if(M!=1){
if(primes.find(M)!=primes.end())primes[M]+=1;
else primes[M]=1;
}
return;
}
signed main(){
scanf("%lld",&N);
primes.clear();
for(int i=1;i<=N;i++){
PrimeF(i);
}
vector<int> nums;
int up3=0;
int up5=0;
int up25=0;
int up15=0;
int up75=0;
for(auto itr=primes.begin();itr!=primes.end();itr++){
nums.pb(itr->second+1);
if(itr->second+1>=3)up3++;
if(itr->second+1>=5)up5++;
if(itr->second+1>=15)up15++;
if(itr->second+1>=25)up25++;
if(itr->second+1>=75)up75++;
}
int ans=0;
if(up5>=2&&up3>=3)ans+=up5*(up5-1)/2*(up3-2);
if(up15>=1&&up5>=2)ans+=up15*(up5-1);
if(up25>=1&&up3>=2)ans+=up25*(up3-1);
if(up75>=1)ans+=up75;
printf("%lld\n",ans);
}
| 0 | 46,754,207 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
const int INF = 1001001001;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
sort(ALLr(a));
ll d[] = {0, 0};
ll j = 0;
REP(i, n-1){
if(a[i] == a[i+1]){
d[j] = a[i];
j++;
if(j == 2){
cout << d[0]*d[1] << endl;
return 0;
}
i++;
}
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int S = s.length();
vector<int> num(S + 1);
s = '>' + s + "<";
rep(k, 2) {
rep(i, S) {
if (s.substr(i, 2) == "><") {
num[i] = 0;
int j = i + 1;
while (s[j] == '<') {
num[j] = max(num[j], num[j - 1] + 1);
j++;
}
i = j - 1;
}
}
reverse(s.begin(), s.end());
int l = s.length();
rep(i, l) s[i] = (s[i] == '<') ? '>' : '<';
reverse(num.begin(), num.end());
}
ll ans = 0;
rep(i, S + 1) ans += num[i];
cout << ans << endl;
}
| 0 | 26,638,708 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string YES = "Yes";
const string NO = "No";
void solve(long long X, long long Y){
bool check = false;
for(ll i = 0; i <= 100; ++i){
for(ll j = 0; j <= 100; ++j){
if(2*i + 4*j == Y && i + j == X) check = true;
}
}
if(check){
cout << YES << endl;
return;
}
cout << NO << endl;
return;
}
int main(){
long long X;
scanf("%lld",&X);
long long Y;
scanf("%lld",&Y);
solve(X, Y);
return 0;
}
|
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<math.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
string s;
int k;
cin >> k >> s;
if (s.size() <= k)
{
cout << s << "\n";
}
else
{
rep(i, k) cout << s[i];
cout << "..." << "\n";
}
return 0;
}
| 0 | 91,689,031 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
typedef long long ll;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int N,M;
int pre[100010];
int dist[100010];
int INF = 200010;
vector<int> path[100010];
void bfs(){
dist[1] = 0;
pre[1] = 0;
queue<int> que;
que.push(1);
while(!que.empty()){
int q = que.front();que.pop();
for(int i=0;i<path[q].size();i++){
int nq = path[q][i];
if(dist[nq]>dist[q]+1){
dist[nq] = dist[q]+1;
pre[nq] = q;
que.push(nq);
}
}
}
}
int main(){
cin >> N >> M;
for(int i=0;i<M;i++){
int a,b;
cin >> a >> b;
path[a].push_back(b);
path[b].push_back(a);
}
memset(dist,INF,sizeof(dist));
bfs();
cout << "Yes" << endl;
for(int i=2;i<=N;i++){
cout << pre[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T>
void printlnVector(T v)
{
rep(i, v.size())
{
cout << v[i] << endl;
}
}
template <typename T>
void printVector(T v)
{
rep(i, v.size())
{
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
string s;
cin >> s;
int head = 0, tail = s.size() - 1;
int ans = 0;
while (tail - head > 0)
{
if (s[head] == s[tail])
{
head++;
tail--;
}
else if (s[head] == 'x')
{
head++;
ans++;
}
else if (s[tail] == 'x')
{
tail--;
ans++;
}
else
{
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| 0 | 3,663,524 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << 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 input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n = 4;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll ans = -LINF;
rep(i,2) {
for (int j = 2; j < n; ++j) {
chmax(ans, a[i]*a[j]);
}
}
cout << ans << '\n';
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) int x;cin>>x
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using vi = vector<int>;
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;}
#define P (1'000'000'007)
template<int MOD=P>
struct Mod {
public:
long long signed value;
Mod(long long signed val): value(val % MOD) {
if (value < 0) value += MOD;
}
constexpr Mod& operator+=(const Mod& other) noexcept {
value += other.value;
value %= MOD;
return *this;
}
constexpr Mod& operator-=(const Mod& other) noexcept {
value -= other.value;
if (value < 0) value += MOD;
return *this;
}
constexpr Mod& operator*=(const Mod& other) noexcept {
value *= other.value;
value %= MOD;
return *this;
}
constexpr Mod operator-() noexcept {
return value == 0 ? 0 : MOD - value;
}
constexpr Mod operator+(const Mod& other) const noexcept { return Mod(*this) += other; }
constexpr Mod operator-(const Mod& other) const noexcept { return Mod(*this) -= other; }
constexpr Mod operator*(const Mod& other) const noexcept { return Mod(*this) *= other; }
constexpr bool operator==(const Mod& other) const noexcept { return this->value == other.value; }
constexpr bool operator!=(const Mod& other) const noexcept { return this->value != other.value; }
};
signed main() {
capi(n);
int d[61][2] = {0};
rep(i, n) {
capi(a);
rep(j, 61) {
++d[j][a & 1];
a >>= 1;
}
}
Mod ans(0);
rep(j, 61) {
Mod x(1ll << j);
x *= d[j][0] * d[j][1];
ans += x;
}
cout << ans.value;
return 0;
}
| 0 | 75,834,852 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,l;
cin>>n>>l;
vector<str> s;
for(int i=0;i<n;i++)
{
str is;
cin>>is;
s.push_back(is);
}
sort(s.begin(),s.end());
for(int i=0;i<n;i++)cout<<s[i];
cout<<"\n";
return 0;
}
|
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int N=100+100;
const db pi=acos(-1.0);
#define lowbit(x) ((x)&(-x))
#define sqr(x) (x)*(x)
#define rep(i,a,b) for (register int i=a;i<=b;i++)
#define per(i,a,b) for (register int i=a;i>=b;i--)
#define go(u,i) for (register int i=head[u],v=sq[i].to;i;i=sq[i].nxt,v=sq[i].to)
#define fir first
#define sec second
#define mkp make_pair
#define pb push_back
#define maxd 998244353
#define eps 1e-8
inline int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
inline ll readll()
{
ll x=0;int f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
int n,m,f[N][N],col[N][N];
char s[N];
int main()
{
n=read();m=read();
rep(i,1,n)
{
scanf("%s",s+1);
rep(j,1,m) col[i][j]=(s[j]=='#');
}
memset(f,0x3f,sizeof(f));
f[1][1]=col[1][1];
rep(i,1,n) rep(j,1,m)
{
if ((i==1) && (j==1)) continue;
if (i>1)
{
int tmp=f[i-1][j];
if ((!col[i-1][j]) && (col[i][j])) tmp++;
f[i][j]=min(f[i][j],tmp);
}
if (j>1)
{
int tmp=f[i][j-1];
if ((!col[i][j-1]) && (col[i][j])) tmp++;
f[i][j]=min(tmp,f[i][j]);
}
}
printf("%d",f[n][m]);
return 0;
}
| 0 | 58,306,730 |
#include<bits/stdc++.h>
using namespace std;
typedef string ll;
int main ()
{
ll a,b,c; cin>>a>>b>>c;
if((a[a.size()-1]==b[0])&&(c[0]==b[b.size()-1])){
cout<<"YES"<<endl;
}
else
cout<<"NO"<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
int n,m;
cin>>n>>m;
map<int,string> mp;
vector<int> pena(n);
int ans=0;
int pans=0;
rep(i,m){
int p;
string s;
cin>>p>>s;
if(mp[p]=="AC") continue;
if(s=="AC"){
mp[p]="AC";
ans++;
}
if(s=="WA"){
pena[p-1]++;
}
}
rep(i,n){
if(mp[i+1]=="AC"){
pans+=pena[i];
}
}
cout<<ans<<" "<<pans<<endl;
}
| 0 | 62,091,334 |
#include <stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
if ((A == 1 && B == 2) || (A == 2 && B == 1))
{
printf("3");
} else if ((A == 1 && B == 3) || (A == 3 && B == 1))
{
printf("2");
} else if ((A == 2 && B == 3) || (A == 3 && B == 2))
{
printf("1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int A,B,C;
cin >> A >> B >> C;
if(C-(A-B)<0) {
cout << 0 << endl;
}
else{
cout << C-(A-B) << endl;
}
return 0;
}
| 0 | 42,995,991 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,d[10];
cin>>s;
int i,j,a,b;
a=s.size();
int c[a-2];
for(i=0;i<a-2;i++)
{
for(j=i;j<i+3;j++)
{
d[i]=d[i]+s[j];
}
c[i]=abs(753-stoi(d[i]));
}
sort(c,c+(a-2));
cout<<c[0]<<endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N+1);
rep(i, N){
int a;
cin >> a;
A[a]++;
}
sort(all(A));
auto itr = upper_bound(all(A), 0);
int A_size = A.end() - itr;
int ans = 0;
rep(i, A_size - K){
ans += *itr;
itr++;
}
cout << ans << endl;
}
| 0 | 84,405,769 |
#include <iostream>
using namespace std;
int main() {
int X, Y; cin >> X >> Y;
if (X <= 8 && Y <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1<<31;
const ll inf_l = 1LL<<61;
const int MAX = 1e5;
int main() {
int n; cin >> n;
vint p(n);
rep(i,n) cin >> p[i];
vint ans_a(n), ans_b(n);
rep(i,n) {
ans_a[i] = n * (i+1);
ans_b[i] = n * (n-i);
}
rep(i,n) {
ans_b[p[i]-1] += i;
}
rep(i,n) printf("%d%s",ans_a[i],i==n-1?"\n":" ");
rep(i,n) printf("%d%s",ans_b[i],i==n-1?"\n":" ");
}
| 0 | 100,671,241 |
#include<cstdio>
using namespace std;
typedef long long LL;
LL a[55];
int main(){
LL n, ans = 0;
scanf("%lld", &n);
for (int i = 0; i < n;i++){
scanf("%lld", a + i);
}
while(true){
LL ma = a[0], pos = 0;
for (int i = 1; i < n;i++){
if(a[i]>ma){
ma = a[i];
pos = i;
}
}
if(ma<n){
break;
}
LL tmp = ma / n;
a[pos] %= n;
for (int i = 0; i < n;i++){
a[i] += tmp;
}
a[pos] -= tmp;
ans += tmp;
}
printf("%lld", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,k;cin>>n>>k;
long a[n];
for(long i=0;i<n;++i){
a[i] =0;
}
long tmp;
for(long i=0;i<n;++i){
cin>>tmp;
a[tmp-1] +=1;
}
sort(a, a+n, greater<long>());
long ans=0;
for(long i=k;i<n;++i){
if(a[i]==0)break;
ans+=a[i];
}
cout<<ans<<endl;
return 0;
}
| 0 | 45,724,491 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a);
for(int i=0; i<a; i++){
cin >> p[i];
}
vector<int> q(b);
for(int i=0; i<b; i++){
cin >> q[i];
}
vector<int> r(c);
for(int i=0; i<c; i++){
cin >> r[i];
}
sort(p.begin(),p.end());
sort(q.begin(),q.end());
sort(r.begin(),r.end());
vector<int> apple(x+y+c);
for(int i=0; i<x; i++){
apple[i] = p[a-x+i];
}
for(int i=0; i<y; i++){
apple[x+i] = q[b-y+i];
}
for(int i=0; i<c; i++){
apple[x+y+i] = r[i];
}
sort(apple.begin(),apple.end());
reverse(apple.begin(),apple.end());
long ans = 0;
for(int i=0; i<x+y; i++){
ans += apple[i];
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <map>
int main()
{
std::map<std::string, int> count_map;
std::string str{};
int max_length = 0;
std::string max_str{};
int hist_max_count = 0;
std::string hist_max_str{};
while (std::cin >> str)
{
if (count_map.count(str) == 0)
{
count_map[str] = 1;
}
else
{
count_map[str]++;
}
if (max_length < str.length())
{
max_length = str.length();
max_str = str;
}
if (hist_max_count < count_map[str])
{
hist_max_count = count_map[str];
hist_max_str = str;
}
}
std::cout << hist_max_str << " " << max_str << std::endl;
return 0;
}
| 0 | 67,199,116 |
#include<iostream>
#include<map>
#include<string>
#include<stdio.h>
using namespace std;
int main (void){
string str,maxByLength("");
map<string,int> Y;
while (cin>>str){
if (str.size()>maxByLength.size()) maxByLength=str;
Y[str]++;
}
string maxByCount("");
int cnt = 0;
for(map<string, int>::iterator it = Y.begin(); it != Y.end(); ++it) {
if(it->second > cnt) {
maxByCount = it->first;
cnt = it->second;
}
}
cout << maxByCount << " " << maxByLength << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
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);
}
void Main()
{
str s;
cin >> s;
set<char> flag;
rep(i, s.size())
{
flag.insert(s[i]);
}
for (char i = 'a'; i <= 'z'; i++)
{
if (!flag.count(i))
fin(s + i);
}
if (s == "zyxwvutsrqponmlkjihgfedcba")
fin(-1);
vc SS;
SS.pb(s[s.size() - 1]);
s.pop_back();
while(1)
{
sort(all(SS));
for(ll i = 0;i < SS.size();i++)
{
if(s[s.size() - 1] < SS[i])
{
s.pop_back();
cout << s << SS[i] << endl;
return;
}
}
SS.pb(s[s.size() - 1]);
s.pop_back();
}
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0 | 57,196,209 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
string S;
cin >> S;
ll K;
cin >> K;
ll len = S.size();
ll sub_count = 0;
ll count = 0;
rep(i,len - 1){
if (S[i] == S[i + 1]){
sub_count++;
if (sub_count % 2 == 1){
count++;
}
}
else{
sub_count = 0;
}
}
ll count_net = 1;
ll ans = 0;
rep(i,len - 1){
if (S[0] == S[i + 1]) count_net++;
}
if (count_net == len){
ans = (len * K) / 2;
}
else if (S[0] != S[len - 1]){
ans = count * K;
}
else{
ll cnt1 = 1;
while(cnt1 < len){
if (S[cnt1 - 1] != S[cnt1]){
break;
}
else cnt1++;
}
ll cnt2 = 1;
while(cnt2 < len){
if (S[len - cnt2 - 1] != S[len - cnt2]){
break;
}
else cnt2++;
}
ans = count * K + ((cnt1 + cnt2) / 2) * (K - 1) - (cnt1 / 2) * (K - 1) - (cnt2 / 2) * (K - 1);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<bool> a(26,false);
string s; cin >> s;
if(s.size()<26){
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97]=true;
}
for(int i = 0; i < 26; i++) {
if(a[i]==false){
s += (char)(97+i);
cout << s << endl;
return 0;
}
}
}
else{
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
string t=s;
string ans;
next_permutation(t.begin(),t.end());
for(int i = 0; i < 26; i++) {
ans += t[i];
if(s[i]!=t[i]) break;
}
cout << ans << endl;
}
return 0;
}
| 0 | 94,630,156 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, D;
cin >> H >> W >> D;
ll m = 0;
map<ll, pll> ma;
rep(i, H) {
rep(j, W) {
ll a;
cin >> a;
ma[a] = {i, j};
m = max(m, a);
}
}
vector<ll> table(m + 1, 0);
for (int i = 0; i < m + 1; i++) {
if (table[i] != 0)
continue;
for (int j = i + D; j < m + 1; j += D) {
pll a = ma[j], b = ma[j - D];
table[j] = table[j - D] + abs(a.first - b.first) +
abs(a.second - b.second);
}
}
int Q;
cin >> Q;
vector<ll> L(Q), R(Q);
rep(i, Q) {
cin >> L[i] >> R[i];
cout << table[R[i]] - table[L[i]] << endl;
}
}
|
#include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include <iomanip>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<P>v;
bool cmp(P a,P b)
{
return atan2(a.second,a.first)<atan2(b.second,b.first);
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
P m;
cin>>m.first;
cin>>m.second;
v.push_back(m);
}
sort(v.begin(),v.end(),cmp);
for(int i = 0; i < n; i++)
v.push_back(v[i]);
long double maxN=0;
for(int start = 0; start < n; start++)
{
long long x = 0LL, y = 0LL;
for(int l = 1; l <= n; l++)
{
x += 1LL * v[start + l - 1].first;
y += 1LL * v[start + l - 1].second;
maxN = max(maxN, sqrtl(1LL * x * x + y * y));
}
}
cout << fixed << setprecision(60) << maxN << '\n';
return 0;
}
| 0 | 80,346,307 |
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
vector<int> edge[100001];
vector<int> child[100001];
vector<ll> a;
void dfs(int i, int p){
for(auto e: edge[i]){
if(e != p){
child[i].pb(e);
dfs(e, i);
}
}
}
bool calc(int i){
int bsum = 0;
if(sz(child[i]) == 0)return true;
bool ok = true;
for(auto e: child[i]){
bool cc = calc(e);
ok &= cc;
}
for(auto e: child[i])bsum += a[e];
ll k = bsum - a[i];
if(k < 0 || a[i] < k || bsum < 2 * k)return false;
for(auto e: child[i])if(bsum - a[e] < k)return false;
a[i] = a[i] - k;
return ok;
}
int main(int argc, char const* argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
INT(n);
a.resize(n); cin >> a;
if(n == 2){
if(a[0] == a[1])cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
rep(i, n - 1){
INT(a); INT(b); a--; b--;
edge[a].pb(b);
edge[b].pb(a);
}
int root = 0;
while(sz(edge[root]) == 1)root++;
dfs(root, -1);
if(calc(root) && a[root] == 0)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
const ll mod = 1000000007LL;
ll dp[100100][2];
vector<int> G[100100];
vector<int> visit(100100,0);
void dfs(int u, int p){
dp[u][0] = 1;
dp[u][1] = 1;
for(auto v: G[u]){
if(v == p) continue;
dfs(v,u);
dp[u][0] = dp[u][0]*(dp[v][0]+dp[v][1])%mod;
dp[u][1] = dp[u][1]*dp[v][0]%mod;
}
}
int main() {
int n;
cin >> n;
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(0,-1);
cout<<(dp[0][0]+dp[0][1])%mod<<endl;
return 0;
}
| 0 | 32,659,299 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
int main(){
string K = "keyence";
string S;
cin >> S;
ll s = S.size();
ll left = 0;
rep(i,7){
if(S.substr(0,i + 1) == K.substr(0,i + 1))left = i + 1;
}
ll right = 0;
rep(i,7){
if(S.substr(s - 1 - i,i + 1) == K.substr(6 - i,i + 1))right = i + 1;
}
if(left + right >= 7)cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main()
{
ll x, y;
cin >> x >> y;
ll a, b;
a = 2 * y - x;
b = 2 * x - y;
if (a % 3 != 0 || b % 3 != 0)
{
cout << 0 << endl;
return 0;
}
if (a < 0 || b < 0)
{
cout << 0 << endl;
return 0;
}
a /= 3;
b /= 3;
ll ab = a + b;
ll ans = 1, aa = 1, bb = 1, abab = 1;
for (ll i = 1; i <= a; i++)
{
aa = (aa * i) % mod;
}
for (ll i = 1; i <= b; i++)
{
bb = (bb * i) % mod;
}
for (ll i = 1; i <= ab; i++)
{
abab = (abab * i) % mod;
}
ans = (abab * modinv(aa, mod)) % mod * modinv(bb, mod);
cout << ans % mod << endl;
return 0;
}
| 0 | 91,528,938 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
int main(){
long long n,m,v,p;
cin>>n>>m>>v>>p;
vector<long long> a(n);
rep(i,n)cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
long long sum[n+1];
sum[0]=0;
rep(i,n)sum[i+1]=sum[i]+a[i];
long long border=a[p-1];
long long ans=0;
for(long long i=0;i<n;i++){
if(a[i]>=border){
ans++;
}
else{
long long L=n-(i+1);
long long voter=v-(L+1);
long long res=m*voter;
if(voter<=0 && a[i]+m>=border){
ans++;
}
else if(voter<p && a[i]+m>=border){
ans++;
}
else if(voter>=p){
voter-=(p-1);
res=voter*m;
long long new_border=a[i]+m;
if(a[p-1]>new_border){
continue;
}
else{
long long mergin=new_border*(i-(p-1))-(sum[i]-sum[p-1]);
res-=mergin;
}
if(res<=0)ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <limits>
#include <functional>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <queue>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 200010;
int n;
int a[N];
bool pred(int x) {
map<int, int> cur;
for (int i = 2; i <= n; ++i) {
if (a[i] > a[i - 1])
continue;
int pos = a[i] - 1;
cur.erase(cur.lower_bound(a[i]), cur.end());
while (pos && cur[pos] == x - 1)
cur.erase(pos--);
if (cur[pos] == x - 1)
return false;
++cur[pos];
}
return true;
}
int main() {
#ifdef LBT
freopen("test.in", "r", stdin);
int nol_cl = clock();
#endif
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
bool flag = true;
for (int i = 2; i <= n; ++i)
flag &= a[i] > a[i - 1];
if (flag) {
puts("1");
return 0;
}
int l = 2, r = n;
while (l < r) {
int mid = (l + r) >> 1;
if (pred(mid))
r = mid;
else
l = mid + 1;
}
printf("%d\n", l);
#ifdef LBT
LOG("Time: %dms\n", int((clock() - nol_cl) / (double)CLOCKS_PER_SEC * 1000));
#endif
return 0;
}
| 0 | 18,702,817 |
#include <bits/stdc++.h>
#include <fstream>
#include <string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
const int N=2e6+5;
int mod=1e9+7;
ll mul (ll a, ll b)
{
a%=mod;
b%=mod;
return (a*b)%mod;
}
ll add (ll a, ll b)
{
a%=mod;
b%=mod;
return (a+b+mod)%mod;
}
ll fastpow(ll b, ll p)
{
if(p==0)
return 1;
ll ans=fastpow(b,p/2);
ans=mul(ans,ans);
if(p%2)ans=mul(ans,b);
return ans;
}
int n,q;
int inter(int mx,pair<int ,int>p,pair<int ,int>f)
{
pair<int,int>ans;
ans.first=min(max(mx+1,p.first),p.second+1);
ans.second=max(min(p.second,f.first-1),p.first-1);
return max(0,((ans.second-ans.first)+1));
}
int xxx=0;
vector<int>build(vector<pair<int,int>>v)
{
vector<vector<int>>add(n+2),rem(n+2);
vector<int>t;
t.resize(v.size(),0);
set<int>st;
for(int i=0; i<v.size(); i++)
{
add[v[i].first].push_back(i);
rem[v[i].second+1].push_back(i);
}
for(int i=1;i<=n;i++)
{
while(add[i].size())
{
st.insert(add[i].back());
add[i].pop_back();
}
while(rem[i].size())
{
st.erase(rem[i].back());
rem[i].pop_back();
}
if(st.size()==0)
xxx++;
else if(st.size()==1)
{
t[*(st.begin())]++;
}
}
return t;
}
int solve2(vector<pair<int,int>>v)
{
vector<int>t=build(v);
int mn=1e9,mx=0;
for(int i=0; i<v.size(); i++)
{
mn=min(mn,t[i]);
}
return mn;
}
int solve(vector<pair<int,int>>v)
{
vector<int>t=build(v);
int mn=1e9;
for(int i=0; i<v.size(); i++)
{
mn=min(mn,t[i]);
}
int ans=1e9;
for(int i=v.size()-1; t.size(); i--)
{
if(t.back()==mn)
{
pair<int,int>tmp=v[i];
v.erase((v.begin()+i));
ans=min(ans,solve2(v));
v.insert((v.begin()+i),tmp);
}
t.pop_back();
}
return ans+mn;
}
int main()
{
FIO
ll n,k;
cin>>n>>k;
ll num=n/k;
ll ans=num*num*num;
if(k%2==0)
{
ll num2=n/(k/2);
num2-=num;
ans+=num2*num2*num2;
}
cout<<ans;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#include <cassert>
#include <climits>
using namespace std;
int main()
{
int numm[105];
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
numm[i] = temp;
}
int mincost = INT_MAX;
for (int i = -100; i < 101; i++)
{
int cost = 0;
for (int j = 0; j < n; j++)
{
cost += ((numm[j] - i) * (numm[j] - i));
}
if (cost < mincost) mincost = cost;
}
cout << mincost;
}
| 0 | 75,299,053 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string a,b,c; cin>>a>>b>>c;
if(a[a.size()-1]!=b[0]){
cout<<"NO"<<endl;
}
else if(b[b.size()-1]!=c[0]){
cout<<"NO"<<endl;
}
else cout<<"YES"<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int s, t;
int n;
s = 0;
t = 0;
for(int i=0;i<4;i++){
cin >> n;
s += n;
}
for(int i=0;i<4;i++){
cin >> n;
t += n;
}
if(s > t){
cout << s << endl;
}else{
cout << t << endl;
}
}
| 0 | 658,177 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll i,fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=0,i=0;while(n/10>0){i++;d++;}return d;}
llfor;ll ans=0;
int main(){
ll a,b,cnt[5]={0};
rep(i,0,6){
sc(a);cnt[a]++;
}
rep(i,1,5){
if(((i==1||i==4)&&cnt[i]!=1)||((i==2||i==3)&&cnt[i]!=2)){
pN;return 0;
}
}
pY;
return 0;}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 10000000000000000;
for (int bit = 0; bit < (1 << n); bit++){
int mx = 0;
int ok = 0;
ll cost = 0;
vector<int> tmp = a;
rep(i, n) {
if(bit & (1 << i)){
if(tmp[i] > mx){
mx = tmp[i];
}else{
cost += (mx + 1) - a[i];
mx++;
tmp[i] = mx;
}
}else{
if(a[i] > mx)mx = a[i];
}
}
mx = 0;
rep(i, n) {
if(tmp[i] > mx){
ok++;
mx = tmp[i];
}
}
if(ok >= k)ans = min(ans, cost);
}
cout << ans << endl;
}
| 0 | 79,775,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N, p;
cin >> K >> N;
vector<int> A(N+1);
for (int i=1; i<=N; i++) {
cin >> p;
A[i]=p;
A[0]=p;
}
int m=0;
for (int i=1; i<=N; i++) {
if (i==1) {
m=K-(A[0]-A[1]);
}
else {
m=max(m, A[i]-A[i-1]);
}
}
cout << K-m << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG
#include "../../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;
int main(void) {
ll n, l, t;
cin >> n >> l >> t;
vector<ll> x(n), w(n);
REP(i, n) cin >> x[i] >> w[i];
vector<ll> pos(n);
REP(i, n) {
if(w[i]==1) pos[i] = (x[i]+t)%l;
else pos[i] = ((x[i]-t)%l+l)%l;
}
ll pos0 = pos[0];
sort(ALL(pos));
ll cnt = 0;
REP(i, n) if(w[0] != w[i]) {
if(w[0]==1 && x[i]-x[0] <= 2*t) {
ll k = (2*t-x[i]+x[0]) / l;
cnt += k+1;
} else if(l-x[i]+x[0] <= 2*t) {
ll k = (2*t-l+x[i]-x[0]) / l;
cnt += k+1;
}
}
dump(cnt);
ll a = w[0]==1 ? cnt%n : ((-cnt)%n+n)%n;
ll base = -1;
REP(i, n) if(pos[i] == pos0) {
base = i;
if(w[0] == 2) break;
}
vector<ll> ans(n);
REP(i, n) ans[(i+a)%n] = pos[(base+i)%n];
dump(pos0, a, base);
REP(i, n) cout << ans[i] << "\n";
return 0;
}
| 0 | 36,112,016 |
#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 <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define no {cout << "No"; return;}
void solve() {
int n, m, sum = 0;
cin >> n >> m;
vector <int> mns;
loop(i, n) {
int x; cin >> x;
sum += x;
while (x) {
mns.pb(x - (x >> 1));
x >>= 1;
}
}
sort(all(mns), greater<int>());
loop(i, min(m, (int)mns.size()))
sum -= mns[i];
cout << sum;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
#define mii map<int,int>
#define mis map<int,string>
#define msi map<string,int>
#define mll map<ll,ll>
#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(c) c.begin(),c.end()
#define srta(a) sort(all(a))
#define srtd(a) sort(all(a),greater<型>())
#define rvs(s) reverse(all(s))
#define psb push_back
#define ppb pop_back
#define ers erase
#define isu isupper
#define isl islower
#define lb(a,k) lower_bound(all(a),k)
#define ub(a,k) upper_bound(all(a),k)
#define bs(a,k) binary_search(all(a),k)
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
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 int I_INF = 1001001001;
const ll LL_INF = 1001001001001001001;
const ld EPS = 0.001;
int main() {
char C;
cin >> C;
char ans = C + 1;
cout << ans << endl;
}
| 0 | 55,965,354 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int is_succeed(vector<int> Scores, int X)
{
bool result = true;
rep(i, Scores.size())
{
if (Scores.at(i) < X)
{
result = false;
break;
}
}
return result;
}
int main()
{
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
rep(i, N)
{
cin >> C.at(i);
rep(j, M) cin >> A.at(i).at(j);
}
int ans = 1e9;
for (int i = 0; i < (1 << N); i++)
{
vector<int> Scores(M, 0);
int cost = 0;
bitset<12> bit(i);
rep(j, N)
{
if (bit.test(j))
{
cost += C.at(j);
rep(k, M)
{
Scores.at(k) += A.at(j).at(k);
}
}
}
if (is_succeed(Scores, X))
{
ans = min(ans, cost);
}
}
if (ans == 1e9)
{
ans = -1;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n; cin>>n;
if(n==0)break;
int score[n]; for(int i=0;i<n;i++)cin>>score[i];
for(int i=0;i<n;i++){
bool flag=false;
for(int j=i;j<n;j++){
int minj=i;
if(score[i]>score[j]){
minj=j;
flag=true;
}
if(flag==true)swap(score[i],score[minj]);
}
}
int min=1000000;
for(int i=0;i<n-1;i++){
if(min>abs(score[i]-score[i+1]))min=abs(score[i]-score[i+1]);
}
cout<<min<<endl;
}
return 0;
}
| 0 | 33,692,135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
int N,M;
cin >> N;
map<string,int> s,t;
REP(i,N) {
string S; cin >> S; s[S]++;
}
cin >> M;
REP(i,M) {
string S; cin >> S; t[S]++;
}
int ans = 0;
for(auto p : s) {
if(t.count(p.first)) chmax(ans,p.second-t[p.first]);
else chmax(ans,p.second);
}
cout << ans << endl;
}
| 0 | 78,832,996 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
string a;
char buf;
while(scanf("%c",&buf)){
if(buf == '\n'){
break;
}
if(!isalpha(buf)){
a.push_back(buf);
}else if(isupper(buf)){
a.push_back(tolower(buf));
}else if(islower(buf)){
a.push_back(toupper(buf));
}
}
cout << a << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
using namespace std;
int H = 0;
int A[2000010];
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
void maxHeapify(int i) {
int l = left(i);
int r = right(i);
int largest;
if (l <= H && A[l] > A[i]) largest = l;
else largest = i;
if (r <= H && A[r] > A[largest]) largest = r;
if (largest != i) {
swap(A[i], A[largest]);
maxHeapify(largest);
}
}
void buildMaxHeap() {
rep1R(i, H / 2) maxHeapify(i);
}
void heapIncreaseKey(int i, int key) {
if (key < A[i]) cout << "エラー" << endl;
A[i] = key;
while (i > 1 && A[parent(i)] < A[i]) {
swap(A[i], A[parent(i)]);
i = parent(i);
}
}
void insert(int key) {
++H;
A[H] = INT_MIN;
heapIncreaseKey(H, key);
}
int heapExtractMax() {
if (H < 1) cout << "エラー" << endl;
int max = A[1];
A[1] = A[H];
--H;
maxHeapify(1);
return max;
}
int main() {
while (true) {
string com;
cin >> com;
if (com == "insert") {
int key;
cin >> key;
insert(key);
} else if (com == "extract") {
cout << heapExtractMax() << endl;
} else if (com == "end") {
break;
} else {
cout << "error" << endl;
}
}
return 0;
}
| 0 | 46,290,981 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(int argc, char **argv)
{
int n, m, *a, t, p;
while(1){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){
break;
}
a = (int *)calloc(n+1, sizeof(int));
t = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
t += a[i]*100;
}
if(a[m] == 0){
cout << a[m] << endl;
free(a);
continue;
}
t -=(t*p/100);
t /= a[m];
cout << t << endl;
free(a);
}
return 0;
}
|
#include <bits/stdc++.h>
#define _sel(_1, _2, x, ...) x
#define repn(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, ...) _sel(__VA_ARGS__, reps, repn)(i, __VA_ARGS__)
#define reppn(i, n) for (ll i = 1; i <= (n); i++)
#define repps(i, a, b) for (ll i = (a); i <= (b); i++)
#define repp(i, ...) _sel(__VA_ARGS__, repps, reppn)(i, __VA_ARGS__)
#define rrepn(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define rreps(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define rrep(i, ...) _sel(__VA_ARGS__, rreps, rrepn)(i, __VA_ARGS__)
#define rreppn(i, n) for (ll i = (n); i >= 1; i--)
#define rrepps(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepp(i, ...) _sel(__VA_ARGS__, rrepps, rreppn)(i, __VA_ARGS__)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define rng(v) (v).begin(), (v).end()
#define rrng(v) (v).rbegin(), (v).rend()
#define _shv(v) for (auto _t1 : v) cerr << _t1 << " "; cerr << endl;
#define dg(x) cerr << #x << ": " << (x) << endl;
#define dgv(v) cerr << #v << ": "; _shv(v);
#define dgm(m) cerr << #m << ":" << endl; for (auto _t2 : m) { _shv(_t2); }
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
const int DX[4] = {1, 0, -1, 0};
const int DY[4] = {0, 1, 0, -1};
template<typename T> inline void pt(T x) { cout << x << endl; }
template<typename T> inline void inv(T& v) { for (auto& t : v) cin >> t; }
template<typename T> inline int siz(T& x) { return x.size(); }
template<typename T> inline ll pow2(T n) { return 1ll << n; }
template<typename T, typename U> inline int bit(T x, U n) { return x >> n & 1; }
template<typename T, typename U>
inline bool umax(T& m, U x) { if (m < x) { m = x; return true; } return false; }
template<typename T, typename U>
inline bool umin(T& m, U x) { if (m > x) { m = x; return true; } return false; }
int main() {
int n; cin >> n;
vl a(n); inv(a);
vl d(n, INF);
rep(i, n) {
auto l = lower_bound(rng(d), a[i]);
*l = a[i];
}
rep(i, 1, n) {
if (d[i] == INF) {
pt(i);
return 0;
}
}
pt(n);
return 0;
}
| 0 | 3,973,059 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int xg=x;
for(int i=0;i<n;i++){
int xi;
cin>>xi;
xg=max(xg,xi);
}
int yl=y;
for(int i=0;i<m;i++){
int yi;
cin>>yi;
yl=min(yl,yi);
}
cout<<(xg<yl?"No War":"War")<<endl;
}
|
#include <iostream>
using namespace std;
void print(int a, int b, string str) {
cout << str.substr(a, b - a + 1) << endl;
}
string reverse(int a, int b, string str) {
string tmp = "";
for (int i = 0; i < str.length(); ++i) {
if (i < a || b < i) {
tmp.append(1, str[i]);
} else {
tmp.append(1, str[b + a - i]);
}
}
return tmp;
}
string replace(int a, int b, string p, string str) {
string h = str.substr(0, a);
string t = str.substr(b + 1, string::npos);
return h + p + t;
}
int main() {
string str;
cin >> str;
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
string cmd;
cin >> cmd;
if (cmd == "print") {
int j, k;
cin >> j >> k;
print(j, k, str);
continue;
}
if (cmd == "reverse") {
int j, k;
cin >> j >> k;
str = reverse(j, k, str);
continue;
}
if (cmd == "replace") {
int j, k;
cin >> j >> k;
string p;
cin >> p;
str = replace(j, k, p, str);
continue;
}
}
return 0;
}
| 0 | 55,472,578 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
using namespace std;
class Koch
{
public:
int solve( int x );
int koch( int n, pair<double, double> p1, pair<double, double> p2, list<pair<double, double> >& rs);
};
int Koch::solve( int x )
{
list<pair<double, double> > rs;
koch(x, make_pair(0,0), make_pair(100,0), rs);
for ( list<pair<double, double> >::iterator it = rs.begin(); it != rs.end(); it++ )
{
cout << fixed << setprecision(6) << (*it).first << " " << (*it).second << endl;
}
return x;
}
int Koch::koch( int n, pair<double, double> p1, pair<double, double> p2, list<pair<double, double> >& rs)
{
if ( n == 0 )
{
rs.push_back(p1);
rs.push_back(p2);
return 0;
}
const double r3 = 1.7320508;
list<pair<double, double> > rss[4];
pair<double, double> s = make_pair( (p1.first * 2.0 + p2.first) / 3.0, (p1.second * 2.0 + p2.second) / 3.0 );
pair<double, double> t = make_pair( (p2.first * 2.0 + p1.first) / 3.0, (p2.second * 2.0 + p1.second) / 3.0 );
double vx = t.first - s.first;
double vy = t.second - s.second;
double rvx = (vx - r3 * vy) / 2.0;
double rvy = (r3 * vx + vy) / 2.0;
pair<double, double> u = make_pair( s.first + rvx, s.second + rvy );
koch( n-1, p1, s, rss[0] );
koch( n-1, s, u, rss[1] );
koch( n-1, u, t, rss[2] );
koch( n-1, t, p2, rss[3] );
for ( int i = 0; i < 4; i++ )
{
if ( i ) rss[i].pop_front();
for ( list<pair<double, double> >::iterator it = rss[i].begin(); it != rss[i].end(); it++ )
{
rs.push_back(*it);
}
}
return 0;
}
int main()
{
int x;
Koch k;
cin >> x;
k.solve( x );
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define S size()
#define E end()
#define B begin()
#define L length()
#define endl "\n"
#define cnt count
#define in insert
#define er erase
#define fi first
#define se second
#define fl float
#define ld long double
#define ll long long
#define gcd __gcd
#define mp make_pair
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define all(v) v.B,v.E
#define acc(v) accumulate(all(v), 0)
#define psum partial_sum
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define np next_permutation
#define maxe *max_element
#define mine *min_element
#define forl(i,n) for(ll i = 0; i < n; i++)
#define fore(i,m,n) for (ll i = m; i <= n; i++)
#define rforl(i,n) for (ll i = n - 1; i >= 0; i--)
#define rfore(i,m,n) for (ll i = m; i >= n; i--)
#define iter(s) for(auto it:s)
#define prec(n) fixed<<setprecision(n)
#define popcnt(n) __builtin_popcountll(n)
#define parity(n) __builtin_parityll(n)
#define clz(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctzll(n)
#define sll set<ll>
#define sc set<char>
#define mll map<ll,ll>
#define vll vector<ll>
#define vc vector<char>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define msll multiset<ll>
#define msc multiset<char>
#define vvll vector<vector<ll>>
#define rev reverse
#define pat ll n;cin>>n;
#define pat1 vll a(n);forl(i,n)cin>>a[i];
#define pat2 ll n,k;cin>>n>>k;vll a;forl(i,n) cin>>a[i];
#define tc ll q;cin>>q;while(q--)
#define pats string s;cin>>s;
#define loop forl(i,n)
#define yesno if(flag)cout<<"Yes\n";else cout<<"No\n";
#define p0(a) cout << a << " ";
#define p1(a) cout << a << endl;
#define p2(a,b) cout << a << " " << b << endl;
#define p3(a,b,c) cout << a << " " << b << " " << c << endl;
#define p4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define mod1 1000000007
#define mod2 998244353
#define PI 3.1415926535897932384626433832
int main(){
ll x;cin>>x;
pat pat1
ll cnt[102]={0};
loop{
cnt[a[i]]++;
}
ll in1=-1,in2=-1;
fore(i,x,101){
if(cnt[i]==0){
in1=i;
break;
}
}
rfore(i,x,0){
if(cnt[i]==0){
in2=i;
break;
}
}
ll ans;
if(in1!=-1 && in2!=-1){
if(abs(in1-x)<abs(in2-x)){
ans=in1;
}else{
ans=in2;
}
}else if(in1!=-1){
ans=in1;
}else if(in2!=-1){
ans=in2;
}
cout<<ans<<endl;
}
| 0 | 49,556,371 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
#include <iomanip>
using namespace std;
void function()
{
}
int main()
{
string s;
int sum;
while (cin >> s)
{
if (s == "0")
{
break;
}
sum = 0;
for (int i = 0; i < s.length(); i++)
{
sum += (int)s[i] - (int)'0';
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
const long long MOD = 1000000007, INF = 1e17;
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
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;}
set<int>ng={'q','w','e','r','t','a','s','d','f','g','z','x','c','v','b'};
signed main()
{
IOS();
vector<int>ans;
while(1){
int N;
cin>>N;
if(N==0)break;
int flg = 0,l = 0,r = 0,cnt = 0;
while(N--){
string s;
cin>>s;
if(s == "ld")l = 0;
else if(s == "lu")l = 1;
else if(s == "rd")r = 0;
else r = 1;
if(flg == 0 && l && r){
cnt++;
flg ^= 1;
}else if(flg && l == 0 && r == 0){
cnt++;
flg ^= 1;
}
}
ans.push_back(cnt);
}
for(auto e:ans){
cout<<e<<endl;
}
}
| 0 | 36,281,191 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
string V="AB";
cin>>S;
if(S.length()==3){
if((S[0]==V[0]||S[1]==V[0]||S[2]==V[0])&&(S[0]==V[1]||S[1]==V[1]||S[2]==V[1])){
cout<<"Yes";
}
else{
cout<<"No";
}
}
return 0;
}
|
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
char ans[100];
char s[1100];
int value;
int h = 0,w,cnt;
bool judge;
char tmp[9][6] = {{".,!? "},{"abc"},{"def"},{"ghi"},{"jkl"},{"mno"},{"pqrs"},{"tuv"},
{"wxyz"}};
cin >> n;
while(n--){
value = 0;
memset(ans,0,sizeof(ans));
memset(s,0,sizeof(s));
cin >> s;
for(int i=0;i<strlen(s);i++){
cnt = 0;
h = 0;
while(1){
if(s[i] == '0') break;
h = s[i]%'0';
cnt++;
i++;
}
w = cnt-1;
judge = false;
switch (h-1){
case 1:
case 2:
case 3:
case 4:
case 5:
case 7:
ans[value] = tmp[h-1][w%3];
judge = true;
break;
case 6:
case 8:
ans[value] = tmp[h-1][w%4];
judge = true;
break;
case 0:
ans[value] = tmp[h-1][w%5];
judge = true;
}
if(judge) value++;
}
cout << ans << endl;
}
}
| 0 | 39,549,949 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,a,b;
vector<int> V[100005];
const ll MOD=1000000007;
int bio[100005];
ll dpW[100005];
ll dpB[100005];
pair<ll,ll> dfs (int a) {
dpW[a]=1;
dpB[a]=1;
for (int b : V[a]) {
if (bio[b]==1) {continue;}
bio[b]=1;
pair<ll,ll> ans=dfs(b);
dpW[a]*=(ans.first+ans.second);
dpB[a]*=ans.first;
dpW[a]%=MOD;
dpB[a]%=MOD;
}
if (dpW[a]==0) {dpW[a]++;}
return {dpW[a],dpB[a]};
}
int main() {
cin >> n;
for (int i=0;i<n-1;i++) {
cin >> a >> b;
V[a].push_back(b);
V[b].push_back(a);
}
for (int i=1;i<=n;i++) {
if (V[i].size()==1) {a=i;break;}
}
bio[a]=1;
dfs(a);
cout << (dpW[a]+dpB[a])%MOD << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int n;
cin >> n;
std::map<int, int> even;
std::map<int, int> odd;
rep(i, n)
{
int v;
cin >> v;
if (i % 2 == 0)
{
even[v]++;
}
else
{
odd[v]++;
}
}
int even_mx_1 = 0;
int even_mx_2 = 0;
int even_mx_num = 0;
for (auto i = even.begin(); i != even.end(); i++)
{
if (even_mx_1 < i->second)
{
even_mx_num = i->first;
even_mx_2 = even_mx_1;
even_mx_1 = i->second;
}
else if (even_mx_2 < i->second)
{
even_mx_2 = i->second;
}
}
int odd_mx_1 = 0;
int odd_mx_2 = 0;
int odd_mx_num = 0;
for (auto i = odd.begin(); i != odd.end(); i++)
{
if (odd_mx_1 < i->second)
{
odd_mx_num = i->first;
odd_mx_2 = odd_mx_1;
odd_mx_1 = i->second;
}
else if (odd_mx_2 < i->second)
{
odd_mx_2 = i->second;
}
}
if (odd_mx_num != even_mx_num)
{
cout << n - odd_mx_1 - even_mx_1 << endl;
}
else
{
cout << n - std::max(odd_mx_1 + even_mx_2, odd_mx_2 + even_mx_1) << endl;
}
return 0;
}
| 0 | 33,705,052 |
#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 <math.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i,n) for(int i=0; i<(int) (n); i++)
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 1000000021;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int krag(double xx) {
return INF - (int)(INF - xx);
}
int b_s(vector<int>& vec, int xx) {
return lower_bound(all(vec), xx) - vec.begin();
}
template<typename T>
void vecout(vector<T>& vec) { for (T t : vec) cout << t << " "; cout << endl; }
template<typename TT>
void vecin(vector<TT>& vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
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;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) {
return xx * yy / gcd(xx, yy);
}
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n, c, k, a = 0, b = INF, d, ans = 0;
cin >> n >> c >> k;
vector<int>vec(n);
vecin(vec);
sort(all(vec));
rep(i, n) {
d = vec[i];
a++;
if (b == INF) b = d;
if (b + k < d) {
a = 1;
b = d;
ans++;
continue;
}
if (a == c) {
ans++;
a = 0;
b = INF;
continue;
}
}
if (a > 0) ans++;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const int INF=1e9;
int main(){
int n,m,R;
cin>>n>>m>>R;
vector<int> r(R);
rep(i,R){
cin>>r[i];
r[i]--;
}
vector<vector<int>> d(n,vector<int>(n,INF));
rep(i,n) d[i][i]=0;
rep(i,m){
int a,b,c;
cin>>a>>b>>c;
a--; b--;
d[a][b]=min(c,d[a][b]);
d[b][a]=min(c,d[b][a]);
}
rep(k,n)rep(i,n)rep(j,n){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
int ans=INF;
sort(r.begin(),r.end());
do{
int res=0;
rep(i,R-1){
res+=d[r[i]][r[i+1]];
}
ans=min(ans,res);
}while(next_permutation(r.begin(),r.end()));
cout<<ans<<endl;
}
| 0 | 84,722,324 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b == 0) {
return (b);
}
else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
long long ans;
cin >> ans;
for (int i = 0; i < n - 1; i++) {
long long a;
cin >> a;
ans = gcd(ans, a);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9+7LL;
long long dp0[101][4];
long long dp1[101][4];
int main() {
string N; cin >> N;
int K; cin >> K;
int L = N.size();
fill( ( long long * )dp0, ( long long * )dp0 + sizeof( dp0 ) / sizeof( long long ), 0 );
fill( ( long long * )dp1, ( long long * )dp1 + sizeof( dp1 ) / sizeof( long long ), 0 );
dp0[0][0] = 1;
dp1[0][1] = 1;
dp0[0][1] = N.at(0)-'1';
for ( int i = 0; i < L-1; ++i ){
for ( int j = 0; j < K+1; ++j ){
dp0[i+1][j] = dp0[i][j];
if(j>0) dp0[i+1][j] += 9*dp0[i][j-1];
if(N[i+1]=='0'){
dp1[i+1][j] = dp1[i][j];
}
else{
if(j>0){
dp0[i+1][j] += (N[i+1]-'1')*dp1[i][j-1];
dp1[i+1][j] += dp1[i][j-1];
}
dp0[i+1][j] += dp1[i][j];
}
}
}
cout << dp0[L-1][K] + dp1[L-1][K] << endl;
}
| 0 | 97,593,455 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N;
ll A[int(3e5 + 5)];
ll Bit[62], cnt0[62], cnt1[62];
int main(){
Bit[0] = 1;
for (int i = 1; i < 62; i++){
Bit[i] = Bit[i-1] * 2;
Bit[i] %= MOD;
}
scanf("%d", &N);
for (int i = 0; i < N; i++){
scanf("%lld", A + i);
ll num = A[i];
for (int j = 0; j < 62; j++){
if (num % 2 == 0) cnt0[j]++;
else cnt1[j]++;
num /= 2;
}
}
ll ans = 0;
for (int i = 0; i < 62; i++){
ll now = cnt0[i] * cnt1[i] % MOD;
ans += Bit[i] * now;
ans %= MOD;
}
printf("%lld\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int dice[6],q;
char c;
for(int i=0;i<6;i++){
scanf("%d",&dice[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
int x,y;
scanf("%d %d",&x,&y);
if((x==dice[5] && y==dice[4])||(x==dice[4] && y==dice[0])||(x==dice[0] && y==dice[1])||(x==dice[1] && y==dice[5])){
printf("%d\n",dice[2]);
}else if((x==dice[0] && y==dice[2])||(x==dice[2] && y==dice[5])||(x==dice[5] && y==dice[3])||(x==dice[3] && y==dice[0])){
printf("%d\n",dice[4]);
}else if((x==dice[5] && y==dice[1])||(x==dice[1] && y==dice[0])||(x==dice[0] && y==dice[4])||(x==dice[4] && y==dice[5])){
printf("%d\n",dice[3]);
}else if((x==dice[0] && y==dice[3])||(x==dice[3] && y==dice[5])||(x==dice[5] && y==dice[2])||(x==dice[2] && y==dice[0])){
printf("%d\n",dice[1]);
}else if((x==dice[2] && y==dice[1])||(x==dice[1] && y==dice[3])||(x==dice[3] && y==dice[4])||(x==dice[4] && y==dice[2])){
printf("%d\n",dice[5]);
}else{
printf("%d\n",dice[0]);
}
}
return 0;
}
| 0 | 36,751,631 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
template<typename T> T gcd(T a,T b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
ll modpow(lll a,lll n,ll m){if(a==0)return a;lll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, m, l, r;
ll d;
struct UnionFind{
vpll p;
void init(int n){
p.resize(n);
FOR(i, 0, n) p[i] = pll(-1, 0);
}
pll find(int a){
if(p[a].fi < 0) return pll(a, 0);
pll t = find(p[a].fi);
p[a] = pll(t.fi, t.se+p[a].se);
return p[a];
}
bool merge(int l, int r, ll d){
pll _l = find(l);
pll _r = find(r);
if(_l.fi == _r.fi){
return _r.se-_l.se == d;
}else{
p[_r.fi] = pll(_l.fi, _l.se - _r.se + d);
}
return true;
}
};
UnionFind uf;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
uf.init(n+1);
FOR(i, 0, m){
cin >> l >> r >> d;
if(!uf.merge(l, r, d)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
struct stu
{
int x;
int y;
};
stu f;
int dir_x[2]={1,0};
int dir_y[2]={0,1};
int start_x,start_y;
int n,m;
int mapKK[16][16];
int bfs()
{
queue<stu> que;
int count=0;
f.x=start_x;
f.y=start_y;
que.push(f);
while(que.size())
{
stu p=que.front();
que.pop();
if(p.x==n-1&&p.y==m-1)
{
count++;
}
for(int i=0;i<2;i++)
{
stu q;
q.x=p.x+dir_x[i];
q.y=p.y+dir_y[i];
if((q.x<n)&&(q.y<m)&&(mapKK[q.x][q.y]!=1))
{
que.push(q);
}
}
}
return count;
}
int main()
{
start_x=start_y=0;
while(cin>>n>>m&&(m!=0||n!=0))
{
for(int i=0;i<n;i++) for(int j=0;j<m;j++) mapKK[i][j]=0;
int obj;
cin>>obj;
while(obj--)
{
int x,y;
cin>>x>>y;
mapKK[x-1][y-1]=1;
}
int count=bfs();
cout<<count<<endl;
}
return 0;
}
| 0 | 26,593,090 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
void answer() {
int m, k;
cin >> m >> k;
if(m == 0) {
if(k == 0) {
cout << "0 0" << '\n';
} else {
cout << -1 << '\n';
}
return;
}
if(m == 1) {
if(k == 0) {
cout << "0 0 1 1" << '\n';
} else {
cout << -1 << '\n';
}
return;
}
int lim = 1<<m;
if(lim <= k) {
cout << -1 << '\n';
return;
}
vector<int> ans;
rep(i, lim) if(i != k) ans.emplace_back(i);
ans.emplace_back(k);
REPCM(i, lim-1, 0) if(i != k) ans.emplace_back(i);
ans.emplace_back(k);
bool first = true;
for(const int a : ans) {
if(first) first = false; else cout << ' ';
cout << a;
}
cout << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const int INF=2e9;
int main() {
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
vector<int> a(n),b(n),c(m),d(m);
rep(i,n) cin >> a[i] >> b[i];
rep(i,m) cin >> c[i] >> d[i];
rep(i,n) {
int mi=INF;
int ans;
rep(j,m) {
int dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
if (dis<mi) {
mi=dis;
ans=j;
}
}
cout << ans+1 << endl;
}
return 0;
}
| 0 | 9,003,702 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll h,n;
cin>>h>>n;
ll a,sum=0;
rep(i,n){
cin>>a;
sum+=a;
}
if(sum>=h) cout<<"Yes";
else cout<<"No";
}
|
#include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
const int mod = 1000000007;
const int N=200005;
const int inf=1e18;
vector<vector<int>>adj(N);
bool isprime(int n){for(int i=2;i*i<=n;++i){if(n%i==0){return false;}}return true;}
int factorial(int n){return (n==1 || n==0) ? 1:n*factorial(n-1);}
int gcd(int a,int b){if (a==0)return b;return gcd(b%a,a);}
int lcm(int a,int b){return (a/gcd(a,b)*b);}
int max(int a,int b){int sol=a>b?a:b;return sol;}
int min(int a,int b){int sol=a<b?a:b;return sol;}
void fun(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main(){
flash;
fun();
int t=1;
while(t--){
int n;
cin>>n;
int cnt=0;
while(n>1){
n/=2;
cnt++;
}
cout<<pow(2,cnt);
}
return 0;
}
| 0 | 5,541,813 |
#include <iostream>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, a;
cin >> n >> a;
int amari = n / 500;
if(n % 500 <= a) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <chrono>
#include <ctime>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e5 + 10, INF = 1e9, K = 300;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<vector<ll>> g;
bool used[SIZE];
ll dfs(int v) {
used[v] = 1;
ll cur = 0;
for (auto to : g[v]) {
if (!used[to]) {
cur ^= (dfs(to) + 1);
}
}
return cur;
}
int main() {
fastInp;
ll n;
cin >> n;
g.resize(n);
for (int i = 0; i < n - 1; i++) {
ll u, v;
cin >> u >> v;
u--; v--;
g[u].push_back(v);
g[v].push_back(u);
}
if (dfs(0)) {
cout << "Alice";
}
else {
cout << "Bob";
}
return 0;
}
| 0 | 76,282,807 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = numeric_limits<int>::max() >> 2;
const ll linf = numeric_limits<ll>::max() >> 2;
const ull ulinf = numeric_limits<ull>::max() >> 2;
const double pi = acos(-1);
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const int dx8[8]={-1,0,1,-1,1,-1,0,1};
const int dy8[8]={-1,-1,-1,0,0,1,1,1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define umap(i,j) unordered_map<i,j>
#define P(p) cout<<(p)<<endl
#define PS(p) cout<<(p)<< " "
#define PN cout << endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i = (n-1); i >= (int)(m); i--)
#define inrep(n,a) for(int i = 0; i < (int)(n); i++)cin >> a[i];
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v,c) sort(v.begin(), v.end(), greater<c>())
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a,n,k) (lower_bound(a,a+n,k) - (a))
#define vlb(a,k) (lower_bound(a.begin(),a.end(),k) - a.begin())
#define ub(a,n,k) (upper_bound(a,a+n,k) - (a))
#define vub(a,k) (upper_bound(a.begin(),a.end(),k) - a.begin())
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
int main(){
string s;
cin >> s;
int a = 0;
int b = 0;
rep(i,0,3){
if(s[i] == 'R'){
b++;
}else b = 0;
a = max(a,b);
}
P(a);
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
void solve(){
int m,mn,mx;
cin>>m>>mn>>mx;
if(m==0){
exit(0);
}
vector<int>P(m);
REP(i,m){
cin>>P[i];
}
int mx_d=0;
int ans=0;
for(int i=mn;i<=mx;i++){
int dif=P[i-1]-P[i];
if(dif>=mx_d){
mx_d=dif;
ans=i;
}
}
cout<<ans<<endl;
}
int main(){
while(true)solve();
}
| 0 | 2,319,175 |
#include <iostream>
using namespace std;
int main(void){
int N, K;
cin >> N >> K;
if(K == 1){
cout << "0" << endl;
return 0;
}
int n = N - K;
cout << n << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (abs(a*b)/gcd(a,b))
#define sqr(a) (a*a)
#define tt int t; cin>>t; while(t--)
#define lo(i, a, b) for(int i=a; i<=b; i++)
#define rlo(i, a) for(int i=a; i>0; i--)
#define be(a) a.begin(),a.end()
#define sz(x) x.size();
#define nl cout<<"\n";
#define sp cout<<" ";
#define Y cout<<"YES"<<endl;
#define N cout<<"NO"<<endl;
#define nlng long long n; cin>>n;
#define nint int n; cin>>n;
#define br break;
#define cn continue;
#define vec vector < int >
#define vecll vector < long long >
#define op() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
int main()
{
op();
string u;
double s=0.0,x;int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x>>u;
if(u=="BTC")
{
x=x*380000.0;
}
s=s+x;
}
std::cout<<setprecision(8)<<fixed<<s<<endl;
return 0;
}
| 0 | 83,503,259 |
#include<iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int m,f,r,sum;
while(1) {
cin >> m >> f >> r;
sum = m + f;
if(m==-1 && f==-1 && r==-1) break;
else if(m==-1 || f==-1) cout << 'F' << endl;
else if(sum>=80) cout << 'A' << endl;
else if(80>sum && sum>=65) cout << 'B' << endl;
else if(65>sum && sum>=50) cout << 'C' << endl;
else if(50>sum && sum>=30 && r>=50) cout << 'C' << endl;
else if(50>sum && sum>=30 && r<50) cout << 'D' << endl;
else if(sum<30) cout << 'F' << endl;
}
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);
vector<vector<int> > edge(10);
int main() {
int N, M;
cin>>N>>M;
int a, b;
for(int i=0;i<M;++i) {
cin>>a>>b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
vector<int> node;
for(int i=0;i<N;++i) node.push_back(i);
int ans = 0;
bool can, tmp;
do {
if(node[0]!=0) can = false;
else can = true;
for(int i=0;i<N-1;++i) {
tmp = false;
for(int j=0;j<edge[node[i]].size();++j) {
if(edge[node[i]][j]==node[i+1]) tmp = true;
}
can = min(can, tmp);
}
if(can) {
ans++;
}
}while(next_permutation(node.begin(), node.end()));
cout<<ans<<endl;
}
| 0 | 88,077,502 |
#include<iostream>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
int a, total=0;
rep(i,m){
std::cin >> a;
total += a;
}
std::cout << (total > n ? -1 : n-total) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a_max, tmp = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec.at(i);
sort(vec.begin(), vec.end());
a_max = vec.back();
vector<bool> bl(a_max + 1, true);
for (size_t i = 0; i < vec.size(); i++) {
if (tmp == vec.at(i)) {
bl.at(vec.at(i)) = false;
}
if (bl.at(vec.at(i))) {
for (int j = 2; j * vec.at(i) <= a_max; j++) {
bl.at(vec.at(i) * j) = false;
}
}
tmp = vec.at(i);
}
int cnt = 0;
for (size_t x = 0; x < vec.size(); x++) {
if (bl.at(vec.at(x))) {
cnt++;
}
}
cout << cnt << endl;
}
| 0 | 57,575,632 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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() {
string s;
cin >> s;
int ans = 0;
if(s.find("R")!=-1) ans = 1;
if(s.find("RR")!=-1) ans = 2;
if(s.find("RRR")!=-1) ans = 3;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
LL N, M;
cin >> N >> M;
if(N >= M / 2) {
cout << M / 2 << endl;
return 0;
}
LL res = N;
M -= N * 2;
cout << res + M / 4 << endl;
return 0;
}
| 0 | 47,280,882 |
#include <stdio.h>
int main(){
char arr[20];
scanf ("%[^\n]", arr);
for (int i = 0; arr[i] != '\0'; i++)
if (arr[i] == ',') arr[i] = ' ';
puts (arr);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll P[100005];
ll modpow(ll n, ll r) {
ll p = n;
ll ret = 1;
while (r > 0) {
if (r & 1)
ret = (ret * p) % MOD;
p = (p * p) % MOD;
r >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll k = K; k > 0; --k) {
ll n = K / k;
ll p = modpow(n, N);
for (ll j = k; j <= K; j += k) {
p = (MOD + p - P[j]) % MOD;
}
ans = (ans + k * p) % MOD;
P[k] = p;
}
cout << ans << endl;
return 0;
}
| 0 | 11,059,297 |
#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 <iomanip>
#include<math.h>
#include <functional>
#include<climits>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<(ll)(n); ++i)
#define mod 1000000007
vector<ll>to[1000005];
int main(){
ll a,b=0,c=0,d=0;cin>>a;
rep(i,a){
ll e,f,g;cin>>e>>f>>g;
if(((e-b)-abs(c-f)-abs(d-g))%2!=0||((e-b)-abs(c-f)-abs(d-g))<0){
cout<<"No";
return 0;
}
b=e;
c=f;
d=g;
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
return (f) (begin (ALL), end (ALL), ##__VA_ARGS__); \
}) (x)
using namespace std;
using ll = int64_t;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> X (N, vector<int> (D, 0));
REP (i, N) REP (j, D) cin >> X[i][j];
int ans = 0;
REP (i, N) {
FOR (j, i + 1, N) {
int num = 0;
REP (k, D) num += pow (X[j][k] - X[i][k], 2);
double dbl = sqrt (num);
if (dbl == floor (dbl))
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 69,303,725 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(a * b < n || a + b - 1 > n) {
cout << -1 << '\n';
return 0;
}
ll r = a * b - n;
vl ans;
rep(i, a) {
ll nb;
if(r < b - 1) {
nb = b - r;
r = 0;
} else {
nb = 1;
r -= b - 1;
}
rep(j, nb) ans.push_back((i + 1) * b - j);
}
vl sa = ans;
sort(all(sa));
rep(i, n) {
ll in = lower_bound(all(sa), ans[i]) - sa.begin();
cout << in + 1 << (i == n - 1 ? '\n' : ' ');
}
}
|
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <string.h>
#include <map>
#include <iomanip>
#include <time.h>
using namespace std;
typedef long long ll;
int n, m;
bool vis[100010] = {};
vector<int> G[100010], tp;
void dfs(int v) {
if (!vis[v]) {
vis[v] = 1;
for (int i = 0; i < G[v].size(); i++) {
dfs(G[v][i]);
}
tp.push_back(v);
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
}
bool t[n + 5] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < G[i].size(); j++) {
t[G[i][j]] = 1;
}
}
int root = -1;
for (int i = 0; i < n; i++) {
if (!t[i]) {
root = i;
break;
}
}
for (int i = 0; i < n; i++) dfs(i);
reverse(tp.begin(), tp.end());
for (int i = 0; i < n; i++) cout << tp[i] << endl;
}
| 0 | 81,092,365 |
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(), v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define INT_SIZE 32
void solve() {
ll a, b;
char x;
cin >> a >> x >> b;
if (x == '+') {
cout << a + b;
}
else {
cout << a - b;
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll ntc;
ntc = 1;
REP(tc, 1, ntc + 1)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
string s; cin >> s;
if(s == "zyxwvutsrqponmlkjihgfedcba"){
out(-1);
return 0;
}
vl a(26);
int n = s.size();
rep(i,n)a[s[i] - 'a']++;
rep(i,26){
if(a[i] == 0){
string ans = s + char('a'+i);
out(ans);
return 0;
}
}
string t = s;
next_permutation(t.begin(),t.end());
rep(i,n){
cout << t[i];
if(s[i] != t[i])break;
}
cout << endl;
}
| 0 | 79,117,401 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
#define vecvec(a) vector<vector<(a)>>
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
struct edge{ll to,cost;};
ll N;const ll NMAX = 100005LL;
vector<edge> G[NMAX];
vector<ll> dist(NMAX,INF);
void dfs(ll from,ll par,ll d){
dist[from] = d;
for(auto x : G[from]){
if(x.to != par){
dfs(x.to,from,d + x.cost);
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b,c;
cin >> N;
rep(i,N - 1){
cin >> a >> b >> c;
a--;b--;
G[a].push_back({b,c});
G[b].push_back({a,c});
}
ll Q,K;
cin >> Q >> K;
dist[K - 1] = 0;
dfs(K - 1,-1,0);
ll A,B;
rep(i,Q){
cin >> A >> B;
cout << dist[A - 1] + dist[B - 1] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int x, y, z, k;
cin >> x >> y >> z >> k;
vll a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
RSORT(a); RSORT(b); RSORT(c);
vll abc;
rep(i, x) rep(j, y) {
if ((i+1)*(j+1)>k) break;
rep(h, z) {
if ((i+1)*(j+1)*(h+1)>k) break;
abc.pb(a[i]+b[j]+c[h]);
}
}
RSORT(abc);
rep(i, k) cout << abc[i] << endl;
return 0;
}
| 0 | 75,417,946 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
int main() {
string s;cin>>s;
ll ans=s.size()-2;
bool judge=true;
while(true){
judge=true;
for(int i=0;i<ans/2;i++){
if(s[i]!=s[(ans/2)+i]){
ans-=2;
judge=false;
break;
}
}
if(judge) break;
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
vector<char> vec1(s.size()),vec2(s.size());
for(int i=0;i<s.size();i++){
vec1[i]=s[i];
vec2[i]=s[i];
}
reverse(vec1.begin(),vec1.end());
bool a=true;
for(int i=0;i<s.size();i++){
if(vec1[i]!=vec2[i]){
a=false;
break;
}
}
if(!a){
cout<<"No"<<endl;
return 0;
}
int half=(s.size()-1)/2;
vector<char> vec3(half),vec4(half);
for(int i=0;i<half;i++){
vec3[i]=vec2[i];
vec4[i]=vec3[i];
}
reverse(vec3.begin(),vec3.end());
for(int i=0;i<half;i++){
if(vec3[i]!=vec4[i]){
a=false;
break;
}
}
if(!a)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
| 0 | 17,973,715 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;
bool query(string s) {
cout << "? " << s << endl;
string str;
cin >> str;
return str == "Y";
}
int main(void) {
ll digit;
{
auto check = [&](ll mid) {
return query('1' + string(mid-1, '0'));
};
ll lb = 1, ub = 11;
while(ub-lb > 1) {
ll mid = (lb+ub)/2;
if(check(mid)) lb = mid;
else ub = mid;
}
digit = lb;
}
if(digit == 10) {
auto check = [&](ll mid) {
return query(string(mid, '9'));
};
ll lb = 0, ub = 10;
while(ub-lb > 1) {
ll mid = (lb+ub)/2;
if(check(mid)) ub = mid;
else lb = mid;
}
cout << "! 1" << string(ub-1, '0') << endl;
}
else {
auto check = [&](ll mid) {
return query(to_string(mid*10));
};
ll lb = pow(10, digit-1)-1, ub = pow(10, digit)-1;
while(ub-lb>1) {
ll mid = (lb+ub)/2;
dump(lb, mid, ub);
if(check(mid)) ub = mid;
else lb = mid;
}
cout << "! " << ub << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, m;
vector<int> a, b;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
if (n % 2)
{
for (int i = 0; i < m; i++)
{
cout << i + 1 << " " << n - i << "\n";
}
}
else{
int j=0;
int cur=n/2;
int count=0;
int d=0;
bool c=false;
int dd=0;
rep(i,m){
if(count%2){
cout<<2+dd<<" "<<n-dd<<"\n";
dd++;
count++;
}
else{
cout<<cur-d<<" "<<cur+1+d<<"\n";
d++;
count++;
}
}
}
}
| 0 | 52,368,147 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
template<class T> ostream& operator<<(ostream &os, vector<T> V) {os << "[ "; for(auto v : V) os << v << " "; return os << "]";}
template<class L, class R> ostream& operator<<(ostream &os, pair<L,R> P) {return os << "(" << P.first << "," << P.second << ")";}
template <typename T,typename U>pair<T,U> operator+(const pair<T,U> & l,const std::pair<T,U> & r) { return {l.first+r.first,l.second+r.second};}
typedef long long int ll;
const ll mod =1e9+7;
const int maxn = 2000005;
#define endl '\n'
#define int ll
#define all(x) (x).begin(),(x).end()
int32_t main()
{
IOS
int n,k,s;
cin>>n>>k>>s;
int maxi = 1000000000;
if(s!=maxi){
for(int i = 1;i<=k;i++) cout<<s<<" ";
for(int i = 1;i<=n-k;i++) cout<<maxi<<" ";
}
else{
for(int i = 1;i<=k;i++) cout<<maxi<<" ";
for(int i = 1;i<=n-k;i++) cout<<1<<" ";
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
const int INF = 1001001001;
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s.at(i);
vector<vector<int>> dp(h, vector<int>(w, INF));
if(s.at(0).at(0) == '.') dp.at(0).at(0) = 0;
else dp.at(0).at(0) = 1;
rep(i, h){
rep(j, w){
int di[] = {1, 0}, dj[] = {0, 1};
rep(k, 2){
int ni = i + di[k], nj = j + dj[k];
if(nj < 0 || w <= nj || ni < 0 || h <= ni) continue;
int add = 0;
if(s.at(i).at(j) == '.' && s.at(ni).at(nj) == '#')add++;
dp.at(ni).at(nj) = min(dp.at(ni).at(nj), dp.at(i).at(j) + add);
}
}
}
cout << dp.at(h-1).at(w-1) << endl;
return 0;
}
| 0 | 79,673,779 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
typedef long long int lint;
#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl
lint power(lint x, lint n, lint m) {
lint res = 1;
x %= m;
while (n > 0) {
if (n % 2 == 1) {
res = res * x % m;
}
x = x * x % m;
n /= 2;
}
return res;
}
lint invmod(lint n, lint m) {
lint ret = 0;
ret = power(n, m - 2, m);
return ret;
}
int main() {
lint N, K;
cin >> N >> K;
lint MOD = pow(10, 9) + 7;
vector<lint>A(N);
rep(i, N) {
cin >> A[i];
}
lint S1 = 0;
lint S2 = 0;
rep(i, N) {
rep(j, N) {
if (A[i] > A[j]) {
S1++;
S1 %= MOD;
}
}
}
rep(i, N) {
rep(j, N) {
if (i < j) {
if (A[i] > A[j]) {
S2++;
S2 %= MOD;
}
}
}
}
lint ans = (K%MOD * S2%MOD)%MOD + K%MOD * (K - 1)%MOD*invmod(2,MOD)%MOD * S1%MOD;
ans %= MOD;
cout << ans << endl;
}
|
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a,count=0,count2=0;
cin>>a;
int b=a;
while(b!=0){
int rem=b%10;
count++;
b=b/10;
}
if(count==1){
for(int i=1;i<=a;i++){
count2++;
}
cout<<count2<<endl;
}
else if(count==2){
cout<<9<<endl;
}
else if(count==3){
for(int i=100;i<=a;i++){
count2++;
}
cout<<count2+9<<endl;
}
else if(count==4){
for(int i=1000;i<=a;i++){
count2++;
}
cout<<909<<endl;
}
else if(count==5){
for(int i=10000;i<=a;i++){
count2++;
}
cout<<count2+909<<endl;
}
else if(count==6){
cout<<90909<<endl;
}
return 0;
}
| 0 | 64,411,919 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
char x, y;
cin >> x >> y;
if(x == y) cout << "=" << endl;
else if(x > y) cout << ">" << endl;
else if(x < y) cout << "<" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> csum_a(n + 1,0), csum_b(n + 1,0);
for (int i = 1; i <= n; ++i) {
long long tmp;
cin >> tmp;
csum_a[i] = csum_a[i - 1] + tmp;
csum_b[i] = csum_b[i - 1] + max(tmp, 0LL);
}
long long ans = INT64_MIN;
for (int i = 1; i + k - 1 <= n; ++i) {
auto left = csum_b[i - 1];
auto center = max(csum_a[i + k - 1] - csum_a[i - 1], 0LL);
auto right = csum_b[n] - csum_b[i + k - 1];
ans = max(ans, left + center + right);
}
cout << ans << endl;
return 0;
}
| 0 | 61,001,681 |
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <utility>
using namespace std;
int N;
int cost[10][10];
pair<int, int> getMinCost() {
for (int k = 0; k < N; ++k) {
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (k == i || k == j) {
continue;
}
if (cost[i][k] != -1 && cost[k][j] != -1) {
int c = cost[i][k] + cost[k][j];
if (cost[i][j] == -1 || cost[i][j] > c) {
cost[i][j] = cost[j][i] = c;
}
}
}
}
}
int sum[10];
for (int i = 0; i < N; ++i) {
sum[i] = 0;
for (int j = 0; j < N; ++j) {
sum[i] += cost[i][j];
}
}
pair<int, int> result;
result.second = INT_MAX;
for (int i = 0; i < N; ++i) {
if (sum[i] < result.second) {
result = make_pair(i, sum[i]);
}
}
return result;
}
int main() {
int R;
while (scanf("%d", &R) == 1 && R != 0) {
N = 0;
memset(cost, -1, sizeof(cost));
for (int i = 0; i < 10; ++i) {
cost[i][i] = 0;
}
int a, b, c;
for (int i = 0; i < R; ++i) {
scanf("%d%d%d", &a, &b, &c);
N = max(N, max(a, b));
if (cost[a][b] == -1 || cost[a][b] > c) {
cost[a][b] = cost[b][a] = c;
}
}
N++;
pair<int, int> result = getMinCost();
printf("%d %d\n", result.first, result.second);
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
char s[55][55];
int main() {
int h,w;
cin >> h >> w;
for(int i = 1;i<=h;i++) {
for(int j = 1; j<=w;j++) {
cin >> s[i][j];
}
}
int cnt = 0;
for(int i = 1;i<=h;i++) {
for(int j = 1;j<=w;j++) {
if(s[i][j] == '#' && s[i-1][j] != '#' && s[i+1][j] != '#' && s[i][j-1] != '#' && s[i][j+1] != '#') cnt++;
}
}
if(cnt==0) cout<<"Yes" << endl;
else cout << "No" << endl;
}
| 0 | 82,948,754 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
#define bet(x, a, b) (a) <= (x) && (x) < (b)
typedef long long ll;
typedef unsigned long long ull;
int main()
{
int N, K;
cin >> N >> K;
if (K == 1) cout << 0 << endl;
else cout << (N - (K - 1)) - (1) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef pair<int, int> P_i;
typedef pair<double,double> P_d;
#define rep(i,n) for(int i=0;i<(n);++i)
#define alrep(i,j,n) for(int i=0;i<(n);++i)for(int j=i+1;j<(n);++j)
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;int ans=0;
#define answer cout << ans << endl;
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 int MOD=1e9+7;
const long long INF = 1LL << 60;
signed main(){
string X,Y; cin >> X >> Y;
vector<vector<int>> dp(1010,vector<int>(1010,INF));
dp[0][0]=0;
for(int i=-1;i<(int)X.size();i++) for(int j=-1;j<(int)Y.size();j++){
if(i==-1 && j==-1) continue;
if(i>=0 && j>=0){
if(X[i]==Y[j]){
chmin(dp[i+1][j+1],dp[i][j]);
}
else{
chmin(dp[i+1][j+1],dp[i][j]+1);
}
}
if(i>=0) chmin(dp[i+1][j+1],dp[i][j+1]+1);
if(j>=0) chmin(dp[i+1][j+1],dp[i+1][j]+1);
}
cout << dp[X.size()][Y.size()] << endl;
return 0;
}
| 0 | 37,453,772 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
n += 1;
bool *p = new bool[n];
fill(p, p + n, true);
p[0] = p[1] = false;
for (int i = 2; i * i < n; i++)
if (p[i] == true)
for (int j = i * i; j < n; j += i)
p[j] = false;
for (int i = 0; i < n; i++)
if (p[i] == true)
ans++;
cout << ans << endl;
delete[] p;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
ll n, k, v[51];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k;
n = 50;
for (int i = 0 ; i < 50 ; i++) {
v[i] = 49 + k / 50;
}
k %= 50;
for (int i = 0 ; i < k ; i++) {
v[i] += n + 1;
for (int j = 0 ; j < n ; j++) {
v[j]--;
}
}
cout << n << '\n';
f (n) {
cout << v[i] << ' ' ;
}
cout << '\n';
}
| 0 | 28,887,355 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;
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; }
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N, M; cin >> N >> M;
vi e(N), a(M), b(M);
REP(i, M) cin >> a[i] >> b[i], a[i]--, b[i]--;
REP(i, M)
{
if(a[i] == 0) e[b[i]] = 1;
if(b[i] == 0) e[a[i]] = 1;
}
REP(i, M)
{
if((a[i] == N-1 && e[b[i]] == 1) || b[i] == N-1 && e[a[i]] == 1)
{
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
}
|
#include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,y) for(long long x=0;x<y;x++)
#define makevec(x,y,n) vector <x> y(n); for(ll i=0;i<n;i++) cin>>y[i]
#define M (ll)1000000007
#define MM (ll) 1e8
#define INF (ll) 1e18
# define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
template <typename T>
T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
bool sortbysec(const pair <ll,ll> &a,const pair <ll,ll> &b){
return a.second<b.second;
}
struct cmp {
bool operator() (const pair<int, int> &a, const pair<int, int> &b) const {
int lena = a.second - a.first + 1;
int lenb = b.second - b.first + 1;
if (lena == lenb) return a.first < b.first;
return lena > lenb;
}
};
struct c_h {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
ll calcpow(ll x, ll y)
{
ll temp;
if(y == 0)
return 1;
temp = calcpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
{
if(y > 0)
return x * temp * temp;
else
return (temp * temp) / x;
}
}
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll egcd(ll a, ll b, ll &x,ll &y){
if(b==0){
x=1;
y=0;
return a;
}
ll x1;
ll y1;
ll g=egcd(b,a%b,x1,y1);
x=y1;
y=x1-y1*(a/b);
return g;
}
bool isprime(ll a){
bool flag=1;
for(ll i=2;i*i<=a;i++){
if(a%i==0) {flag=0; break;}
}
return flag;
}
ll dx8[8]={1,0,-1,0,1,-1,1,-1};
ll dy8[8]={0,1,0,-1,1,-1,-1,1};
ll dx4[4]={0,0,1,-1};
ll dy4[4]={1,-1,0,0};
int main(){
IOS;
make(ll,n);
makevec(ll,a,n);
unordered_map <ll,ll> um;
fr(i,n) um[a[i]]++;
ll ans=0;
for(auto x : um){
ans+=(x.second*(x.second-1))/2;
}
fr(i,n){
cout<<ans-um[a[i]]+1<<endl;
}
return 0;
}
| 0 | 81,220,426 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
int lower_index(T a, U i) { return lower_bound(all(a), i) - begin(a); }
template <class T, class U>
int upper_index(T a, U i) { return upper_bound(all(a), i) - begin(a); }
template <class T, class U>
bool binary(T a, U i) { return binary_search(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
void solve(int n, vi a) {
deque<int> q;
rep(i, n)
if(i % 2)q.push_front(a[i]);
else q.push_back(a[i]);
while(!q.empty())
if(n % 2) {
CSP(q.back());
q.pop_back();
}else {
CSP(q.front());
q.pop_front();
}
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
int n;
cin >> n;
vi a(n);
for(int i = 0 ; i < n ; i++){
cin >> a[i];
}
solve(n, move(a));
}
#pragma endregion main
|
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
long long A[100000];
long long diff_A[100000];
long long x[100000];
long long y[100000];
int main(){
int N;
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[i];
}
for(int i = 0; i < N; i++){
diff_A[i] = A[(i + 1) % N] - A[i];
}
long long sum_A = accumulate(A, A + N, (long long) 0);
long long sum_N = (long long) N * (long long)(N + 1) / 2;
if((sum_A % sum_N) != 0){
cout << "NO" << endl;
return 0;
}
long long op_num = sum_A / sum_N;
for(int i = 0; i < N; i++){
if((op_num - diff_A[i]) < 0 || (op_num - diff_A[i]) % N != 0){
cout << "NO" << endl;
return 0;
}
y[i] = (op_num - diff_A[i]) / N;
x[i] = op_num - y[i];
}
long long A0 = 0;
for(int i = 0; i < N; i++){
A0 += (N - i) * y[i];
}
if(A0 == A[0]){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| 0 | 45,070,753 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++) {
cin >> A.at(i);
}
int64_t inner_inv = 0;
for (int64_t i = 0; i < N; i++) {
for (int64_t j = i + 1; j < N; j++) {
if (A.at(i) > A.at(j)) {
inner_inv++;
}
}
}
int64_t outer_inv = 0;
for (int64_t i = 0; i < N; i++) {
for (int64_t j = 0; j < N; j++) {
if (A.at(i) > A.at(j)) {
outer_inv++;
}
}
}
int64_t ans = inner_inv * K % 1000000007;
ans += (outer_inv% 1000000007) *( K * (K-1) / 2% 1000000007);
ans %= 1000000007;
cout << ans;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#define bFor(i,a,b) for(i=a;i>=b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define pb push_back
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
double distance(ddatas& x,ddatas& y){
double a=x.first-y.first,b=x.second-y.second;
return sqrt(a*a+b*b);
}
ll modinv(ll a) {
ll b=mod,u=1,v=0,t;
while(b){
t=a/b;
a-=t*b; swap(a,b);
u-=t*v; swap(u,v);
}
return (u+mod)%mod;
}
ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}
vec modncrlistp,modncrlistm;
ll modncr(ll n,ll r){
ll i,size=modncrlistp.size();
if(size<=n){
modncrlistp.resize(n+1);
modncrlistm.resize(n+1);
if(!size){
modncrlistp[0]=modncrlistm[0]=1;
size++;
}
For(i,size,n+1){
modncrlistp[i]=modncrlistp[i-1]*i%mod;
modncrlistm[i]=modinv(modncrlistp[i]);
}
}
return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}
ll modpow(ll a,ll n){
ll res=1;
while(n){
if(n&1)res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll countdigits(ll n){
ll ans=0;
while(n){n/=10;ans++;}
return ans;
}
ll sumdigits(ll n){
ll ans=0;
while(n){ans+=n%10;n/=10;}
return ans;
}
int main(){
ll i,x,bf=0,N,ans=1;
cin>>N;
vec m(N,1),M(N),sec(N);
rep(i,N){
cin>>M[i];
if(i==0||M[i]!=M[i-1]){
m[i]=M[i];
}
}
rep(i,N)cin>>sec[i];
brep(i,N){
x=sec[i];
if(x>bf||x==1||i==N-1){
if(m[i]>x||M[i]<x){
ans=0;
break;
}else{
bf=m[i]=M[i]=x;
}
}else{
if(m[i]==M[i]&&M[i]>x){
ans=0;
break;
}else{
chmin(M[i],x);
}
}
ans=ans*(M[i]-m[i]+1)%mod;
}
cout<<ans<<endl;
return 0;
}
| 0 | 75,381,311 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
int M = 10000001;
int main()
{
int n, m;
cin >> n >> m;
int minn = M;
int maxx = 0;
rep(i, m) {
int l, r;
cin >> l >> r;
minn = min(minn, r);
maxx = max(maxx, l);
}
if (maxx > minn)
cout << 0;
else
cout << minn - maxx + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
int main() {
int n;
cin>>n;
for(int i=1;i<=n;i++)
scanf("%d", &a[i]);
if(a[n] != 2){
cout<<-1<<endl;
return 0;
}
long long mn = 2, mx = 2;
for(int i=n;i;i--) {
long long x = mn / a[i] + (mn %a[i] != 0), y = mx/a[i];
if(y * a[i] < mn) {
cout<<-1<<endl;
return 0;
}
mn = x * a[i];
mx = (y * a[i]) + a[i] - 1;
}
cout<<mn<<' '<<mx<<endl;
return 0;
}
| 0 | 90,147,612 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
int n; cin>>n;
string ans="Yes";
vector<vector<int>> v(n,vector<int>(3));
rep(i,n){
cin>>v[i][0]>>v[i][1]>>v[i][2];
}
int t,x,y;
rep(i,n){
if(i==0){
t=v[0][0];x=v[0][1];y=v[0][2];
}
else{
t=v[i][0]-v[i-1][0];
x=max(v[i][1]-v[i-1][1],-v[i][1]+v[i-1][1]);
y=max(v[i][2]-v[i-1][2],-v[i][2]+v[i-1][2]);
}
if((-t+x+y)%2!=0||t<x+y){ans="No";break;}
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
return num%mod;
}
}
double eps = .000000001;
int main(){
prep();
int n;
cin >> n;
int arr[n];
int a[n];
int b[n];
int rank[n];
for (int i=0; i<n; i++){
cin >> arr[i];
arr[i]--;
rank[arr[i]] = i+2;
}
a[0] = 1;
b[0] = rank[0]-1;
int vals[n];
for (int i=1; i<n; i++){
int aval = a[i-1];
int bval = b[i-1];
int newsum = rank[i];
int nexta = aval+1;
int nextb = bval-1;
if (newsum < nexta+nextb){
nextb -= nexta+nextb-newsum;
}else if (newsum > nexta+nextb){
nexta += newsum-nexta-nextb;
}
a[i] = nexta;
b[i] = nextb;
}
int lowesta = 1000000000;
for (int i=0; i<n; i++){
lowesta = min(lowesta, a[i]);
}
if (lowesta <= 0){
lowesta = abs(lowesta)+1;
}else{
lowesta = 0;
}
int lowestb = 1000000000;
for (int i=0; i<n; i++){
lowestb = min(lowestb, b[i]);
}
if (lowestb <= 0){
lowestb = abs(lowestb)+1;
}else{
lowestb = 0;
}
for (int i=0; i<n; i++){
a[i] += lowesta;
b[i] += lowestb;
}
for (int i=0; i<n; i++){
cout << a[i] << " ";
}
cout << '\n';
for (int i=0; i<n; i++){
cout << b[i] << " ";
}
return 0;
}
| 0 | 15,211,313 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
int lower_index(T a, U i) { return lower_bound(all(a), i) - begin(a); }
template <class T, class U>
int upper_index(T a, U i) { return upper_bound(all(a), i) - begin(a); }
template <class T, class U>
bool binary(T a, U i) { return binary_search(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
void solve(int h, int w) {
int ans = (h % 3) * (w % 3) == 0 ? 0 : min(h, w);
rep(i, 1, h) {
vi v = {i * w, (h - i) * (w / 2), (h - i) * ((w + 1) / 2)};
SORT(v);
amin(ans, v[2] - v[0]);
}
rep(i, 1, w) {
vi v = {i * h, (w - i) * (h / 2), (w - i) * ((h + 1) / 2)};
SORT(v);
amin(ans, v[2] - v[0]);
}
COUT(ans);
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
int h;
cin >> h;
int w;
cin >> w;
solve(h, w);
}
#pragma endregion main
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
const int M = 1e9;
int h, w, n;
unordered_set<int> black, used;
int ans[10], C;
void check(P point){
for(int i=-2;i<=2;i++){
for(int j=-2;j<=2;j++){
int y1 = point.first + i;
int x1 = point.second + j;
int y2 = y1 + 2;
int x2 = x1 + 2;
if( y1 < 0 || x1 < 0 || h <= y1 || w <= x1 ) continue;
if( y2 < 0 || x2 < 0 || h <= y2 || w <= x2 ) continue;
if( used.count( y1 * M + x1 ) ) continue;
used.insert( y1 * M + x1 );
int cnt = 0;
for(int k=y1;k<=y2;k++){
for(int l=x1;l<=x2;l++){
if( black.count( k * M + l ) ) cnt++;
}
}
if( cnt == 0 ) continue;
ans[cnt]++;
C++;
}
}
}
int a[100005], b[100005];
signed main(){
cin>>h>>w>>n;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
black.insert( (a[i]-1) * M + b[i]-1 );
}
for(int i=0;i<n;i++){
check( P( a[i] - 1, b[i] - 1 ) );
}
cout<<(h-2)*(w-2)-C<<endl;
for(int i=1;i<10;i++) cout<<ans[i]<<endl;
return 0;
}
| 0 | 29,056,579 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main(){
int n;cin>>n;
int a=(1<<30);
int ans=0;
rep(i,n){
int b=0;
cin>>b;
if(b<a){
ans++;
}
a=min(a,b);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int h,n;cin >> h >> n;
vector<P> magic(n);
vector<int> dp(h+1,INF);
rep(i,n){
int a,b;cin >> a >> b;
magic[i] = make_pair(a,b);
}
dp[0]=0;
for(int i = 1;i<=h;i++){
for(auto p:magic){
dp[i] = min(dp[i],dp[max(0,i-p.first)]+p.second);
}
}
cout << dp[h] << endl;
}
| 0 | 34,635,498 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
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; }
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int gcd(int a, int b){return b ? gcd(b, a%b) : a;}
int lcm(int a, int b){return a*b / gcd(a, b);}
int main(){
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
ll min_3 = min(min(4*q, 2*h), s);
cout << min(n*min_3, n/2*d+n%2*min_3) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
string s;
cin>>s;
n=s.length()+1;
vector<ll> bef(n,0),lar(n,0);
for(i=0;i<n-1;i++)
{
if(s[i]=='<')
{
bef[i+1]=bef[i]+1;
}
}
for(i=n-2;i>=0;i--)
{
if(s[i]=='>')
{
lar[i] = lar[i+1]+1;
}
}
for(i=0;i<n;i++)
{
ans+=max(lar[i],bef[i]);
}
cout<<ans<<endl;
return 0;
}
| 0 | 95,129,912 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1011, inf = 1000111222;
long long mabs(long long x) {
if (x < 0) {
return -x;
}
return x;
}
int n;
long long x[max_n], y[max_n];
int f[2];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
f[(((x[i] + y[i]) % 2) + 2) % 2] = 1;
}
if (f[0] + f[1] == 2) {
cout << -1 << endl;
return 0;
}
vector<long long> all;
if (f[0]) {
all.push_back(1);
}
for (int i = 33; i >= 0; --i) {
all.push_back(1LL << i);
}
cout << all.size() << endl;
for (long long x : all) {
cout << x << " ";
}
cout << endl;
if (f[0]) {
all.erase(all.begin());
}
for (int i = 0; i < n; ++i) {
long long sum = accumulate(all.begin(), all.end(), 0LL);
if (f[0]) {
cout << 'R';
--x[i];
}
for (long long a : all) {
sum -= a;
if (mabs(x[i] - a) + mabs(y[i]) <= sum) {
cout << 'R';
x[i] -= a;
} else if (mabs(x[i] + a) + mabs(y[i]) <= sum) {
cout << 'L';
x[i] += a;
} else if (mabs(x[i]) + mabs(y[i] - a) <= sum) {
cout << 'U';
y[i] -= a;
} else if (mabs(x[i]) + mabs(y[i] + a) <= sum) {
cout << 'D';
y[i] += a;
} else {
exit(228);
}
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info{
int nx;
int ny;
int cost;
int target;
info(int a,int b,int c,int d){
nx = a;
ny = b;
cost = c;
target = d;
}
}info;
bool isNumChar(char c){
if((0 <= c-48)&&(c-48 <= 9))return true;
return false;
}
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int W,H;
int N;
int sx[16] = {0};
int sy[16] = {0};
char field[1024][1024] = {""};
int record[1024][1024][12] = {0};
bool flag[16] = {false};
queue<info> que;
int ans;
int recordReset(){
for(int i = 0;i < 1024;i++){
for(int j = 0;j < 1024;j++){
for(int k = 0;k < 12;k++){
record[i][j][k] = INF;
}
}
}
}
int bfs(){
info now(0,0,0,0);
info next(0,0,0,0);
for(int i = 0;i < N;i++){
next = info(sx[i],sy[i],0,i+1);
que.push(next);
}
recordReset();
while(!que.empty()){
now = que.front();
que.pop();
if(!flag[now.target]){
if(record[now.nx][now.ny][now.target] > now.cost){
record[now.nx][now.ny][now.target] = now.cost;
if((sx[now.target] == now.nx)&&(sy[now.target] == now.ny)){
flag[now.target] = true;
ans += record[now.nx][now.ny][now.target];
}
else{
switch(field[now.nx][now.ny]){
case 'X':
break;
default:
for(int i = 0;i < 4;i++){
next = info(now.nx + dx[i],now.ny + dy[i],now.cost + 1,now.target);
que.push(next);
}
break;
}
}
}
}
}
}
int main (void){
scanf("%d%d",&H,&W);
scanf("%d",&N);
ans = 0;
for(int i = 0;i < 1024;i++){
for(int j = 0;j < 1024;j++){
field[j][i] = 'X';
}
}
for(int i = 0;i < 16;i++){
flag[i] = false;
}
for(int i = 1;i <= H;i++){
scanf(" ");
for(int j = 1;j <= W;j++){
scanf("%c",&field[j][i]);
if(isNumChar(field[j][i])){
sx[field[j][i]-48] = j;
sy[field[j][i]-48] = i;
}
else if(field[j][i] == 'S'){
sx[0] = j;
sy[0] = i;
}
}
}
bfs();
printf("%d\n",ans);
return 0;
}
| 0 | 70,703,281 |
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
typedef pair<int,int> P;
const ll mod=1000000007;
int ketatume(int a){
if(a<10)cout<<"00000"<<a;
else if(a<100)cout<<"0000"<<a;
else if(a<1000)cout<<"000"<<a;
else if(a<10000)cout<<"00"<<a;
else if(a<100000)cout<<"0"<<a;
else if(a<1000000)cout<<a;
}
int main() {
int n,m;
cin >> n >> m;
P a[m+1];
vector<vector<P>> p(n+1);
r(i,m){
int a,b;
cin >> a >> b;
p[a].push_back(P(b,i+1));
}
r(i,n){
if(p[i+1].empty()) continue;
sort(p[i+1].begin(),p[i+1].end());
vector<P> v=p[i+1];
int s=1;
for(auto && e:v){
a[e.second]=P(i+1,s);
s++;
}
}
r(i,m){
ketatume(a[i+1].first);
ketatume(a[i+1].second);
cout<<endl;
}
}
|
#include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf 1e18
#define deci(x, y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define nitin ios_base::sync_with_stdio(false); cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
int32_t main() {
nitin;
int n,k;
cin>>n>>k;
int ans=0;
for(int p=k;p<=n;p++) {
ans = (ans+p*(n-p+1)+1)%mod;
}
cout<<ans+1<<endl;
return 0;
}
| 0 | 51,056,822 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
cin >> x[i];
sort(x, x+n);
int beg = x[0], end = x[n-1];
int ans;
for (int i = 0; i < end-beg+1; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += pow((x[j]-(beg + i)), 2);
}
if (i == 0)
ans = sum;
else if (sum < ans)
ans = sum;
}
cout << ans;
}
|
#include <bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
map<ll, ll> mp;
for (ll i = 0; i < n; ++i) {
ll x;
cin >> x;
mp[x]++;
}
vector<ll> a;
for (auto p : mp) {
if (p.second >= 4) for (int i = 0; i < 2; ++i) a.emplace_back(p.first);
else if (p.second >= 2) a.emplace_back(p.first);
}
sort(a.rbegin(), a.rend());
if (a.size() < 2) cout << 0 << endl;
else cout << a[0] * a[1] << endl;
}
| 0 | 100,348,224 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define xrep(i,a,b) for(int i=int(a);i<int(b);++i)
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
xrep(i, 1, 10000) {
if((int)(i*0.08)==A && (int)(i*0.1)==B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#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 rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
#define dame { puts("-1"); return 0;}
#define YES { cout << "YES" << endl; return 0; }
#define NO { cout << "NO" << endl; return 0; }
#define Yes { cout << "Yes" << endl; return 0; }
#define No { cout << "No" << endl; return 0; }
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 dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
ves s(N); vi t(N); int ans = 0;
string X;
rep(i,N) cin >> s[i] >> t[i];
cin >> X;
int i = 0;
while(X!=s[i]) {
i++;
}
i++;
while(i < N) {
ans += t[i];
i++;
}
cout << ans << endl;
}
| 0 | 60,860,051 |
#include<iostream>
using namespace std;
#define MAX 100005
#define NIL -1
class Node{
public:
int p,l,r,d;
};
Node T[MAX];
int n;
void print(int u){
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << T[u].d << ", ";
if(T[u].p == NIL) cout << "root, ";
else if(T[u].l == NIL) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
int i,c;
for(i = 0, c = T[u].l;c != NIL;i++, c = T[c].r){
if(i) cout << ", ";
cout << c;
}
cout << "]" << endl;
}
int rec(int u,int p){
T[u].d = p;
if(T[u].r != NIL) rec(T[u].r,p);
if(T[u].l != NIL) rec(T[u].l,p+1);
}
int main(int argc, char const *argv[])
{
int v,d,l,r,c;
cin >> n;
for(int i = 0;i < n;i++) T[i].p = T[i].l = T[i].r = T[i].d = NIL;
for(int i = 0;i < n;i++){
cin >> v >> d;
for(int j = 0;j < d;j++){
cin >> c;
if(j == 0) T[v].l = c;
else T[l].r = c;
l = c;
T[c].p = v;
}
}
for(int i = 0;i < n;i++){
if(T[i].p == NIL) r = i;
}
rec(r,0);
for(int i = 0;i < n;i++) print(i);
return 0;
}
|
#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 ll inf = LLONG_MAX;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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;
}
int main() {
string s;
cin >> s;
bool be[30];
fill(be,be+30,false);
rep(i, s.size()) be[s[i]-'a'] = true;
rep(i, 26) if(!be[i]) {
cout << char(i+'a') << endl;
return 0;
}
cout << "None" << endl;
return 0;
}
| 0 | 91,409,498 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define INF 1LL << 60
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,ll> p;
const long long MOD=1000000007;
int main(void)
{
int N; cin>>N; int cnt = 0;
std::vector<int> v;
for(int i=0; i<N ;i++){
int h; cin>>h;
v.push_back(h);
}
bool flag=true;
for(int i=1; i<N ;i++){
for(int j=0; j<i ;j++){
if(v[j] > v[i]) flag = false;
}
if(flag) cnt++;
flag = true;
}
cout<<cnt+1<<endl;
return 0;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
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; }
int main()
{
int n, h; cin >> n >> h;
priority_queue<int> a, b;
rep(i, n){
int x, y; cin >> x >> y;
a.push(x);
b.push(y);
}
int ans = 0;
while(h > 0 && !b.empty() && b.top() > a.top()){
int c = b.top(); b.pop();
h -= c;
ans++;
}
if(h > 0){
int c = a.top();
ans += h / c;
if(h%c>0) ans++;
}
pr(ans);
return 0;}
| 0 | 59,281,873 |
#include <bits/stdc++.h>
using namespace std;
int n, a[201], ans;
int main() {
scanf("%d", &n); n <<= 1;
for(int i = 1;i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for(int i = 1;i <= n; i += 2)
ans += a[i];
printf("%d\n", ans);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#define Endl endl
#define mp make_pair
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define ceil(a,b) ((a-1)/b+1)
#define srand() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rand(l,r) uniform_int_distribution<int>(l,r)(rng)
typedef unsigned long long ull;
const int inf=1039074182;
using namespace std;
ll n;
ll d[100005];
map <ll,ll> m;
pair<ll,ll> p[100005];
ll sub[100005];
ll sz[100005];
vector <pair<ll,ll> >res;
vector <int>vec[100005];
ll dp[100005];
int dfs(int x,int p=-1)
{
sz[x]=1;
for(int i=0;i<vec[x].size();i++)
{
if(vec[x][i]==p) continue;
sz[x]+=dfs(vec[x][i],x);
}
return sz[x];
}
int go(int x,int p=-1)
{
dp[x]=sz[x]-1;
for(int i=0;i<vec[x].size();i++)
{
if(vec[x][i]==p) continue;
dp[x]+=go(vec[x][i],x);
}
return dp[x];
}
int main()
{
ios_base::sync_with_stdio(false);
cin>>n;
for(ll i=0;i<n;i++)
{
cin>>d[i];
m[d[i]]=i;
p[i].first=d[i];
p[i].second=i;
sz[i]=1;
}
sort(p,p+n);
reverse(p,p+n);
memset(sub,-1,sizeof(sub));
for(ll i=0;i<n-1;i++)
{
ll de=p[i].first;
ll x=p[i].second;
sub[x]=n-sz[x]*2;
if(sub[x]==0) over("-1");
if(m.find(de-sub[x])==m.end()) over("-1");
ll par=m[de-sub[x]];
sz[par]+=sz[x];
dp[par]+=dp[x];
res.push_back(mp(x,par));
}
for(int i=0;i<n-1;i++)
{
vec[res[i].first].push_back(res[i].second);
vec[res[i].second].push_back(res[i].first);
}
dfs(p[n-1].second);
go(p[n-1].second);
if(dp[p[n-1].second]!=p[n-1].first) over("-1");
for(ll i=0;i<n-1;i++)
{
cout<<res[i].first+1<<' '<<res[i].second+1<<endl;
}
return 0;
}
| 0 | 41,338,142 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
void solve()
{
ll n,m;
cin>>n>>m;
vector<pair<ll,ll>> a(m);
vector<ll> v,k;
for(ll i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
if(a[i].first==1)
v.push_back(a[i].second);
if(a[i].second==1)
v.push_back(a[i].first);
if(a[i].first==n)
k.push_back(a[i].second);
if(a[i].second==n)
k.push_back(a[i].first);
}
if(m==1)
{
cout<<"IMPOSSIBLE";
return;
}
map<ll,ll> mp;
for(ll i=0;i<v.size();i++)
{
mp[v[i]]++;
}
for(ll i=0;i<k.size();i++)
{
if(mp[k[i]]>0)
{
if(k[i]!=1)
{
cout<<"POSSIBLE";
return;
}
}
}
cout<<"IMPOSSIBLE";
return;
}
int main()
{
fast;
int q;
q=1;
while(q--)
{
solve();
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
int main(){
ll W, H, N;
cin >> W >> H >> N;
ll t = H, b = 0, l = 0, r = W;
ll x, y, a;
rep(i, N){
cin >> x >> y >> a;
switch(a){
case 1:
l = max(l, x);
break;
case 2:
r = min(r, x);
break;
case 3:
b = max(b, y);
break;
case 4:
t = min(t, y);
break;
}
}
if(t <= b || l >= r){
cout << 0 << endl;
}else{
cout << (t - b) * (r - l) << endl;
}
return 0;
}
| 0 | 33,320,901 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template<class T> inline bool chmin(T& a,T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if (a < b) {a = b; return true;} return false;}
const ll MOD = 1000000007;
const int INF = 1<<30;
int main(){
int N; cin >> N;
int ans;
for (int i = 1; i <= 9; ++i){
if (N <= 100 * i + 10 * i + i) {
ans = 100 * i + 10 * i + i;
break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
while(1){
int n;
cin>>n;
if(n==0)break;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=INF;
for(int i=0;i<n-1;i++){
int d=a[i+1]-a[i];
ans=min(ans,d);
}
cout<<ans<<endl;
}
}
| 0 | 98,436,359 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int main(void)
{
int N;
cin >> N;
vector<int> a;
int tmp;
for (int i = 0; i < N; i++)
{
cin >> tmp;
a.push_back(tmp);
}
int cnt = 0;
int now = a[0];
for (int i = 0; i < N; i++)
{
now = min(now, a[i]);
if (now == a[i])
{
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
int a,c,b,n,x,y[100];
cin>>n>>a>>b>>c>>x;
if(n+a+b+c+x==0)break;
for(int i=0;i<n;i++){
cin>>y[i];
}
int cnt=0,count=0;
while(1){
if(x==y[cnt]){
cnt++;
}
if(cnt==n){
cout<<count<<endl;
break;
}
if(count==10000){
cout<<-1<<endl;
break;
}
x=(a*x+b)%c;
count++;
}
}
return 0;
}
| 0 | 20,586,875 |
#include <stdio.h>
int main(void) {
int a[3]={0}, i, n;
for (i = 1; i <= 10; i++){
scanf("%d",&n);
if (a[0] < n){
a[2] = a[1];
a[1] = a[0];
a[0] = n;
}
else if (a[1] < n){
a[2] = a[1];
a[1] = n;
}
else if (a[2] < n){
a[2] = n;
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
long long int n,m,a,b,c,d,e,f,g,sum;
cin>>n>>m;
a=n*(n-1)/2;
b=m*(m-1)/2;
sum=a+b;
cout<<sum<<endl;
return 0;
}
| 0 | 724,332 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
#define int long long
#define P pair<int,int>
signed main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
int ans = 0;
if(k % 2 == 0){
cout << a - b << endl;
} else {
cout << b - a << endl;
}
}
|
#include <stdio.h>
int main(){
char X[3];
scanf("%s",&X);
if(X[0]=='7'){
printf("Yes\n");
}
else if(X[1]=='7'){
printf("Yes\n");
}
else if(X[2]=='7'){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
}
| 0 | 41,665,564 |
#include <bits/stdc++.h>
#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;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const int INF=1e9;
int main(){
int h,n;
cin>>h>>n;
int tot=0;
rep(i,n){
int a;
cin>>a;
tot+=a;
}
if(tot>=h){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
char c1, c2;
cin >> c1 >> c2;
if (c1 == c2)
{
cout << "=" << endl;
}
else if (c1 < c2)
{
cout << "<" << endl;
}
else
{
cout << ">" << endl;
}
return 0;
}
| 0 | 59,747,280 |
#include <bits/stdc++.h>
using namespace std;
string s;
int N,w,i;
int main(){
cin>>s>>w; N = s.size();
for(i=0;i<N;i+=w){printf("%c",s[i]);}
}
|
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functional>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<ll,ll>
#define sz(v) ((int)((v).size()))
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define pf push_front
#define F first
#define S second
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const double PI = 3.14159265358979323846;
const ll inf=2e9,MOD=998244353,MAX=1e2+2;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int n;
cin>>n;
vector<int>a(n),b(n),c(n);
lp(i,0,n)
cin>>a[i],c[i]=i+1;
lp(i,0,n)
cin>>b[i];
int cnt=1,x=0,y=0;
do{
if(c==a)
x=cnt;
if(c==b)
y=cnt;
cnt++;
}while(next_permutation(all(c)));
cout<<abs(x-y);
}
| 0 | 74,747,098 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
string s;
cin>>s;
int y = stoi(s.substr(0,4));
int m = stoi(s.substr(5,2));
int d = stoi(s.substr(8,2));
if(y<2019||(y==2019&&m<=4)||(y==2019&&m==4&&d<=30)) {
cout<<"Heisei";
}else cout<<"TBD";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
|
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.14159265358979323846264338327950L
#define VI vector<int>
#define VLL vector<long long>
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
const ll MOD = 1e9 + 7;
using namespace std;
template<typename T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template<typename T>
T lcm(T a, T b) {
ll g = gcd(a, b);
return a / g * b;
}
template<typename T>
T binarysearch(vector<T> A, T key) {
ll left = 0;ll right = 4;ll mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) return 1;
if (key > A[mid]) left = mid + 1;
else if (key < A[mid]) right = mid;
}
return 0;
}
template<typename T>
T finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
ll frac(ll n)
{
if (n == 0) {
return 1;
}
return (n * frac(n - 1)) % MOD;
}
template<typename T>
T keta(T a) {
ll kazu = 1;
while (1) {
if (a / 10 != 0) { a /= 10;kazu++; }
else break;
}
return kazu;
}
template<typename T>
bool IsPrime(T num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
template<typename T>
T nCr(ll n, T r) {
ll ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int main() {
string s;cin >> s;
for (ll i = 0;i < s.size();i++) {
if (s[i] != ',')cout << s[i];
else cout << " ";
}
}
| 0 | 8,265,422 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
long long b;
for(long long i = 1; i * i <= n; i++) {
if(n % i == 0)
b = n / i;
}
int ans = 0;
while(b > 0) {
b /= 10;
ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, num;
int tmpW, tmpH, que;
int cnt = 0;
cin >> w >> h >> num;
vector<vector<int>> data(w, vector<int>(h));
for (int i = 0; i < w; i++) {
for (int j = 0; j < h; j++) data.at(i).at(j) = 0;
}
for (int i = 0; i < num; i++) {
cin >> tmpW >> tmpH >> que;
if (que == 1) {
for (int i = 0; i < tmpW; i++) {
for (int j = 0; j < h; j++) {
data.at(i).at(j) = 1;
}
}
} else if (que == 2) {
for (int i = tmpW; i < w; i++) {
for (int j = 0; j < h; j++) {
data.at(i).at(j) = 1;
}
}
} else if (que == 3) {
for (int i = 0; i < w; i++) {
for (int j = 0; j < tmpH; j++) {
data.at(i).at(j) = 1;
}
}
} else if (que == 4) {
for (int i = 0; i < w; i++) {
for (int j = tmpH; j < h; j++) {
data.at(i).at(j) = 1;
}
}
}
}
for (int i = 0; i < w; i++) {
for (int j = 0; j < h; j++) {
if (data.at(i).at(j) == 0) cnt++;
}
}
cout << cnt;
}
| 0 | 63,794,147 |
#include <bits/stdc++.h>
int main() {
std::string S, T;
std::cin >> S >> T;
if (S.size() + 1 != T.size()) {
std::cout << "No" << std::endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (S[i] != T[i]) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double f(double x, int *v, int *l, int *r, int N) {
double V = INT_MAX;
for (int i = 0; i < N; i++) {
if (x < l[i]) {
V = min(V,v[i]+l[i]-x);
} else if (x <= r[i]) {
V = min(V,1.0*v[i]);
} else {
V = min(V,v[i]+x-r[i]);
}
}
return V;
}
int main() {
int N;
cin >> N;
int t[N+1];
t[0] = 0;
for (int i = 1; i <= N; i++) {
cin >> t[i];
t[i] += t[i-1];
}
N += 2;
int v[N], l[N], r[N];
double distance = 0;
v[0] = 0;
v[N-1] = 0;
l[0] = 0;
r[0] = 0;
l[N-1] = t[N-2];
r[N-1] = t[N-2];
for (int i = 1; i < N-1; i++) {
l[i] = t[i-1];
r[i] = t[i];
cin >> v[i];
}
for (double x = 0.5; x <= t[N-2]; x += 0.5) {
distance += 0.25*(f(x,v,l,r,N)+f(x-0.5,v,l,r,N));
}
cout.precision(20);
cout << fixed << distance;
}
| 0 | 91,580,525 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
int ans[h][w];
rep(i,b){
rep(j,a){
ans[i][j]=0;
}
for(int j=a;j<w;j++){
ans[i][j]=1;
}
}
for(int i=b;i<h;i++){
rep(j,a){
ans[i][j]=1;
}
for(int j=a;j<w;j++){
ans[i][j]=0;
}
}
rep(i,h){
rep(j,w){
cout<<ans[i][j];
}
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin>>a;
int max=0,flag=0,temp=0;
for(int i=0;i<a.size();i++){
if(a[i]=='R'){
if(flag==0){
flag=1;
temp=1;
}
else
temp++;
}
else{
if(max<temp)
max=temp;
flag=0;
temp=0;
}
}
if(max<temp)
max=temp;
cout<<max;
return 0;
}
| 0 | 100,189,751 |
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
int a, b; cin >> a >> b;
double x =((double)a + b) / 2;
cout <<ceil(x) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;
#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 REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
typedef long long ll;
int main(){
int N;
cin>>N;
REP(i,N){
int a,b,c;
cin>>a>>b>>c;
if(a*a==b*b+c*c)cout<<"YES"<<endl;
else if(b*b==a*a+c*c)cout<<"YES"<<endl;
else if(c*c==a*a+b*b)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
| 0 | 83,374,821 |
#include <bits/stdc++.h>
typedef long long ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define AA(i) cout << i << endl;
#define AS(i) cout << i << " ";
const int INF = 1001001001;
const double PI = 3.14159;
using namespace std;
int main() {
char c;
cin >> c;
c++;
AA(c);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
ll f(ll x, ll m) {
return x % m;
}
ll sums[201010], vis[202020];
int main() {
ll N, X, M;
cin >> N >> X >> M;
if (N <= 1000000) {
ll sum = X;
ll A = f(X * X, M);
rep(i, N-1) {
sum += A;
A = f(A * A, M);
}
cout << sum << endl;
}
else {
ll ans = 0, cnt = 0;
fill(vis, vis+M, -1);
while (N > 0) {
if (vis[X] >= 0) {
ll len = cnt - vis[X];
ll tmpAns = ans;
ans += (tmpAns - sums[vis[X]]) * (N / len);
N %= len;
break;
}
if (N > 0) {
vis[X] = cnt++;
ans += X;
sums[cnt] = ans;
X = f(X * X, M);
N--;
}
}
while (N > 0) {
if (N > 0) {
ans += X;
X = f(X * X, M);
N--;
}
}
cout << ans << endl;
}
}
| 0 | 57,341,378 |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) putchar(x+'0');
else
{
write(x/10);
putchar(x%10+'0');
}
}
void print(int x,char c='\n')
{
write(x);
putchar(c);
}
signed main()
{
int n=read(),k=read();
print(n-k+1);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class dice {
public:
dice(int* a) {
set(a[0], a[1], a[2], a[3], a[4], a[5]);
}
dice(int& a, int& b, int& c, int& d, int &e, int& f) {
set(a, b, c, d, e, f);
}
void turn(int n) {
if (n < 4)
{
turndice(n);
return;
}
switch (n)
{
case 'N':
turndice(0);
break;
case 'E':
turndice(1);
break;
case 'S':
turndice(2);
break;
case 'W':
turndice(3);
break;
}
}
void turn(const char* str)
{
for (size_t i = 0; str[i] != '\0' ; i++)
{
turn(str[i]);
}
}
int getcurrent(int n = 0) { return label[n]; }
int topfronttoright(const int & top, const int & front) {
char n3[] = { "NES" };
const char ne[][3] = { "N","N","N","E","EE" };
for (size_t i = 0; i < 6; i++)
{
if (top == getcurrent())
for (size_t j = 0; j < 4; j++)
{
if (front == getcurrent(1))
{
return getcurrent(2);
}
turn(n3);
}
turn(ne[i]);
}
return 0;
}
private:
int label[6];
void set(int& a, int& b, int& c, int& d, int &e, int& f) {
label[0] = a;
label[1] = b;
label[2] = c;
label[3] = d;
label[4] = e;
label[5] = f;
}
void turndice(int n)
{
int m = (n > 1) ? n - 2 : n + 2;
int f[] = { 1, 3, 4, 2 };
int tmp;
tmp = label[0];
label[0] = label[f[n]];
label[f[n]] = label[5];
label[5] = label[f[m]];
label[f[m]] = tmp;
}
};
#define B
#ifdef B
int main(void)
{
int label[6];
int n;
for (auto &a : label)
{
cin >> a;
}
dice d(label);
cin >> n;
vector<int> ans(n);
for (auto &a : ans)
{
int top, frnt;
cin >> top >> frnt;
a = d.topfronttoright(top, frnt);
}
for (auto a : ans)
{
cout << a << endl;
}
return 0;
}
#endif
| 0 | 71,684,788 |
#include<stdio.h>
struct STACK
{
int num[ 10 ] ;
int p ;
int Top( void ) ;
void Push( int ) ;
void Pop( void ) ;
void Init( void ) ;
} stack ;
int main( void )
{
stack.Init() ;
int kale ;
while( scanf( "%d" ,&kale ) != EOF )
{
if( kale == 0 )
{
printf( "%d\n" ,stack.Top() ) ;
stack.Pop() ;
}
else
{
stack.Push( kale ) ;
}
}
return 0 ;
}
void STACK::Init( void )
{
p = 0 ;
}
void STACK::Push( int kale )
{
num[ p++ ] = kale ;
}
void STACK::Pop( void )
{
--p ;
}
int STACK::Top( void )
{
return num[ p - 1 ] ;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string o,e;
cin>>o>>e;
string password;
for(int i=0; i<o.size(); i++){
password.push_back(o[i]);
if(e.size()==i){
continue;
}
password.push_back(e[i]);
}
cout<<password<<endl;
}
| 0 | 33,609,803 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll MOD=1e9+7;
const ll INF=1e18;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
const int MAX=510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll>b(n+1);
rep(i,n-1) cin >> b[i+1];
b[0]=INF;
b[n]=INF;
ll ans = 0;
rep(i,n){
ans += min(b[i],b[i+1]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
int isvacant(int i)
{
std::cout << i << endl;
fflush(stdout);
string s;
cin >> s;
if (s[0] == 'V')
{
exit(0);
}
else if (s[0] == 'F')
{
return 0;
}
else
{
return 1;
}
}
void solve()
{
int N;
cin >> N;
int l = 0, r = N - 1;
int sl = isvacant(l);
int sr = isvacant(r);
while (true)
{
int m = (l + r) >> 1;
int sm = isvacant(m);
if ((sm == sl) != (l % 2 == m % 2))
{
r = m;
sr = sm;
}
else
{
l = m;
sl = sm;
}
}
}
int main(int argc, char const *argv[])
{
solve();
return 0;
}
| 0 | 68,982,526 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
int ans = 1;
while (ans <= n) {
ans *= 2;
}
cout << ans / 2 << endl;
return 0;
}
|
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
char a[15]={'a','b','c','d','e','f','g','q','r','s','t','v','w','x','z'};
using namespace std;
int main(){
char str[33]={0};
while(1){
scanf("%s",str);
if(str[0] == '#')break;
int len = 0;
len = strlen(str);
int cnt = 0;
int x = 0;
int f = 0;
for(int i = 0;i < len; i++){
for(int j = 0;j < 15; j++){
if(str[i] == a[j]){
f = 1;
break;
}
else {
f = 0;
}
}
if(i == 0){
x = f;
continue;
}
if(x == f){
continue;
}
cnt++;
x = f;
}
printf("%d\n",cnt);
}
return 0;
}
| 0 | 92,094,341 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <class Abel> struct BIT {
vector<Abel> dat[2];
Abel UNITY_SUM = 0;
BIT(int n) { init(n); }
void init(int n) { for (int iter = 0; iter < 2; ++iter) dat[iter].assign(n + 1, UNITY_SUM); }
inline void sub_add(int p, int a, Abel x) {
for (int i = a; i < (int)dat[p].size(); i += i & -i)
dat[p][i] = dat[p][i] + x;
}
inline void add(int a, int b, Abel x) {
sub_add(0, a, x * -(a - 1)); sub_add(1, a, x); sub_add(0, b, x * (b - 1)); sub_add(1, b, x * (-1));
}
inline Abel sub_sum(int p, int a) {
Abel res = UNITY_SUM;
for (int i = a; i > 0; i -= i & -i) res = res + dat[p][i];
return res;
}
inline Abel sum(int a, int b) {
return sub_sum(0, b - 1) + sub_sum(1, b - 1) * (b - 1) - sub_sum(0, a - 1) - sub_sum(1, a - 1) * (a - 1);
}
void print() {
for (int i = 1; i < (int)dat[0].size(); ++i) cout << sum(i, i + 1) << ",";
cout << endl;
}
};
using pll = pair<long long, long long>;
int N;
long long D, A;
vector<long long> X, H;
long long solve() {
vector<int> ids(N);
for (int i = 0; i < N; ++i) ids[i] = i;
sort(ids.begin(), ids.end(), [&](int i, int j) {
return X[i] < X[j]; });
vector<long long> nX(N), nH(N);
for (int i = 0; i < N; ++i) nX[i] = X[ids[i]], nH[i] = H[ids[i]];
X = nX, H = nH;
BIT<long long> bit(N+10);
for (int i = 0; i < N; ++i) bit.add(i+1, i+2, H[i]);
long long res = 0;
for (int i = 0; i < N; ++i) {
long long cur = bit.sum(i+1, i+2);
if (cur <= 0) continue;
long long need = (cur + A - 1) / A;
long long right = X[i] + D * 2;
int id = upper_bound(X.begin(), X.end(), right) - X.begin();
bit.add(i+1, id+1, -need * A);
res += need;
}
return res;
}
int main() {
cin >> N >> D >> A;
X.resize(N); H.resize(N);
for (int i = 0; i < N; ++i) cin >> X[i] >> H[i];
cout << solve() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const char itos[2] = {'S', 'W'};
int id[256];
bool dif(char A, char T) {
return (A == 'S' && T == 'x') || (A == 'W' && T == 'o');
}
string solve(int N, const string &S, int a, int b) {
int M = S.size();
string res(M, 'A');
res[0] = itos[a], res[1] = itos[b];
for(int i = 1; i < M - 1; ++i) {
res[i + 1] = itos[id[res[i - 1]] ^ dif(res[i], S[i])];
if(i + 1 >= N && res[i + 1 - N] != res[i + 1]) return "";
}
return res.substr(N);
}
int main() {
int N; string S;
cin >> N >> S;
S += S;
id['S'] = 0; id['W'] = 1;
for(int i = 0; i < 2; ++i) {
for(int j = 0; j < 2; ++j) {
auto res = solve(N, S, i, j);
if(res != "") {
cout << res << '\n';
return 0;
}
}
}
cout << -1 << '\n';
return 0;
}
| 0 | 85,020,530 |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 2e5 + 10 ;
long long A[MAX] , B[MAX] ;
int n ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
long long sum1 = 0 , sum2 = 0 , sum = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cin>>A[i]>>B[i] ;
if(A[i] > B[i])
sum1 += A[i] - B[i] ;
if(A[i] < B[i])
sum2 += B[i] - A[i] ;
sum += A[i] ;
}
long long ans = 0ll ;
if(sum1 == 0 && sum2 == 0)
return cout<<0<<"\n" , 0 ;
if(sum2 > sum1)
return cout<<sum<<"\n" , 0 ;
for(int i = 0 ; i < n ; ++i)
{
if(A[i] > B[i])
ans = max(ans , sum - B[i]) ;
}
return cout<<ans<<"\n" , 0 ;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
inline bool cek_bit(ll mask, int x){
return mask&(1ll<<x);
}
int n;
ll li[N+5];
int depan[65];
int urut = 0;
int matrix[65][N+5];
bool masuk(int bit){
urut++;
for(int i=1;i<=n;i++){
if(cek_bit(li[i],bit)){
matrix[urut][i] = 1;
} else {
matrix[urut][i] = 0;
}
}
matrix[urut][n+1] = 1;
for(int i=1;i<urut;i++){
if(matrix[urut][depan[i]] == 1){
for(int j=1;j<=n+1;j++){
matrix[urut][j]^=matrix[i][j];
}
}
}
int awal = -1;
for(int i=1;i<=n;i++){
if(matrix[urut][i] == 1){
awal = i;
break;
}
}
if(awal == -1 && matrix[urut][n+1] == 0){
urut--;
return 1;
} else if(awal == -1 && matrix[urut][n+1] == 1){
urut--;
return 0;
}
depan[urut] = awal;
return 1;
}
int main(){
scanf("%d",&n);
ll ans = 0ll;
for(int i=1;i<=n;i++){
scanf("%lld",&li[i]);
}
for(int i=59;i>=0;i--){
int cnt = 0;
for(int j=1;j<=n;j++){
if(cek_bit(li[j],i)){
cnt++;
}
}
if(cnt&1){
ans+=(1ll<<i);
} else {
if(masuk(i)){
ans+=(1ll<<(i+1));
}
}
}
printf("%lld\n",ans);
return 0;
}
| 0 | 60,780,812 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a + b == 15) {
cout << '+' << "\n";
}
else if(a * b == 15) {
cout << '*' << "\n";
}
else {
cout << 'x' << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int N, M; cin >> N >> M;
vec v(N, 0);
rep(i, M){
int a, b; cin >> a >> b;
a--; b--;
v[a]++;
v[b]++;
}
rep(i, N){
if(v[i]%2){
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0 | 30,182,801 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
typedef unsigned int ui;
int main() {
int i, j,k;
ll h, w; int n, a, b;
cin >> h >> w >> n;
map<P, int> m;
vector<P> s;
for (i = 0; i < n; i++) {
cin >> a >> b;
for (j = a - 1; j <= a + 1; j++) {
for (k = b - 1; k <= b + 1; k++) {
if (j >= 2 && k >= 2 &&j <= h-1 &&k <= w-1) {
P p = make_pair(j, k);
s.push_back(p);
m[p]++;
}
}
}
}
if (s.empty()) {
cout << (h - 2)*(w - 2) << endl;
for (i = 1; i < 10; i++) {
cout << 0 << endl;
}
return 0;
}
sort(s.begin(), s.end());
int len = s.size(); int out[10] = {};
out[m[s[0]]]++;
for (i = 1; i < len; i++) {
if (s[i] != s[i - 1]) {
out[m[s[i]]]++;
}
}
ll sum = (h-2)*(w-2);
for (i = 1; i < 10; i++) {
sum -= out[i];
}
cout << sum << endl;
for (i = 1; i < 10; i++) {
cout << out[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef set<ll> Set;
const ll maxs = 1e5+3;
const ll maxs1 = 1e3+4;
const ll mod = 1e9 + 7;
inline ll add(ll a, ll b) { return (mod + a + b) % mod; }
inline ll sub(ll a, ll b) { return (a - b + mod) % mod; }
inline ll mul(ll a, ll b) { return (1ll * a * b) % mod; }
ll fastpow(ll x,ll y)
{ll res = 1;x = x % mod;while (y > 0){ if (y & 1)res = (res * x) % mod; y = y >> 1 ; x = (x * x) % mod; } return res;}
ll inv(ll x){ return fastpow(x , mod - 2);}
bool isPrime(ll n) { if (n <= 1) return false; if (n <= 3) return true;if (n%2 == 0 || n%3 == 0) return false; for (int i=5; i*i<=n; i=i+6) if (n%i == 0 || n%(i+2) == 0) return false; return true; }
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int A, B;
cin >> A >> B;
for(int i=1;i<=1000;i++)
{
if((int)(i*0.08)==A && (int)(i*0.1)==B)
{
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
}
| 0 | 56,729,279 |
#include <iostream>
int main() {
int n, x;
int sum, count;
do{
count = 0;
std::cin >> n >> x;
for(int i = 0; i < n; i++){
for(int j = 1+i; j < n; j++){
for(int k = 1+j; k < n; k++){
sum = (n-i)+(n-j)+(n-k);
if(sum == x) {
count += 1;
}
}
}
}
if(!(n == 0 && x == 0)){
std::cout << count <<std::endl;
}
} while(!(n == 0 && x == 0));
}
|
#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);
int main(){
string s;
int ans=0;
cin >>s;
set<char>dis;
for(char i:s){
dis.insert(i);
}
dis.insert('z' + 6);
for (char i = 'a'; i <= 'z'; i++) {
if(*dis.lower_bound(i)!=i){
cout << i << endl;
return 0;
}
}
cout << "None" << endl;
}
| 0 | 23,263,740 |
#include<iostream>
using namespace std;
int main(){
int a, b;
std::cin >> a >> b;
if((a*b)%2==1){
std::cout << "Odd";
}else{
std::cout << "Even";
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int n;
void Counting_Sort(int A[],int B[],int k){
int *C = new int[k+1];
for(int i=0;i<=k;i++)C[i]=0;
for(int j=1;j<=n;j++)C[A[j]] = C[A[j]] + 1;
for(int i=1;i<=k;i++)C[i]=C[i]+C[i-1];
for(int j=n;j>=1;j--){
B[C[A[j]]] = A[j];
C[A[j]] = C[A[j]]-1;
}
delete [] C;
}
int main(){
while(scanf("%d",&n) != EOF){
int k=0;
int *A = new int[n+2];
int *B = new int[n+2];
for(int i=1;i<=n;i++){
scanf("%d",&A[i]);
if(k<A[i])k=A[i];
}
Counting_Sort(A,B,k);
for(int i=1;i<=n;i++){
cout << B[i];
if(i != n)cout << " ";
}
cout << endl;
delete [] A;
delete [] B;
}
return 0;
}
| 0 | 88,938,612 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a, b, k;
cin >> a >> b >> k;
if(k <=a){
cout << a-k << " " << b << endl;
} else {
cout << 0 << " " << max((long long)0,a+b-k) << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned long long int
#define test int t;cin>>t; while(t--)
#define um unordered_map
#define en '\n'
#define us unordered_set
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
bool check_prime(long long n)
{
int flag = 0;
for (long long i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
flag = 1;
break;
}
}
if (n == 1)
return false;
else if (flag == 0 || n == 2 || n == 3)
{
return true;
}
else
{
return false;
}
}
int BE(int x, int n, int m)
{
int result = 1;
while (n > 0)
{
if (n % 2 == 1)
result = result * x % m;
x = x * x % m;
n = n / 2;
}
return result;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
int n;
cin >> n;
int a[n]; zip(i, 0, n) cin >> a[i];
int x = a[0];
zip(i, 1, n)
{
x = __gcd(a[i], x);
}
cout << x << en;
return 0;
}
| 0 | 93,646,164 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.