code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, step = 5e4;
cin >> n;
int a[n], b[n];
a[0] = b[n - 1] = 1;
for (int i = 1; i < n; i++)
a[i] = a[i - 1] + step, b[n - i - 1] = a[i];
for (int i = 0; i < n; i++) {
int p;
cin >> p;
a[p - 1] += i;
}
for (int x : a)
cout << x << ' ';
cout << '\n';
for (int x : b)
cout << x << ' ';
cout << '\n';
return 0;
} | #include "bits/stdc++.h"
#include <unordered_set>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb push_back
#define pf push_front
#define ld long double
#define Sort(a) sort(a.begin(),a.end())
#define cSort(a,cmp) sort(a.begin(),a.end(),cmp)
#define reSort(a) sort(a.rbegin(), a.rend())
static ll llMAX = numeric_limits<long long>::max();
static int intMAX = numeric_limits<int>::max();
static ll llMIN = numeric_limits<long long>::min();
static int intMIN = numeric_limits<int>::min();
static ll d_5 = 100000;
static ll d9_7 = 1000000007;
static ll d_9 = 1000000000;
template<class T>
void Printvector(std::vector<T> a){
int size = a.size();
rep(i,size){
cout<<a[i]<<" ";
}
cout<<endl;
}
template<class T>
void Printvector(std::vector<std::vector<T>> a){
int size = a.size();
rep(i,size){
int size2=a[i].size();
rep(j,size2){
cout<<a[i][j]<<" ";
}
cout<<endl;
}
cout<<endl;
}
ll digitpower(ll a,ll b){
if(b==1){
return a;
}else if(b==0){
return 1;
}
if(b%2==1){
ll tmp = digitpower(a,(b-1)/2);
tmp%=d9_7;
tmp*=tmp;
tmp%=d9_7;
tmp*=a;
return (tmp)%d9_7;
}else{
ll tmp = digitpower(a,(b)/2);
tmp%=d9_7;
tmp*=tmp;
tmp%=d9_7;
return (tmp)%d9_7;
}
}
struct datas{
int cost;
int now;
vi past;
deque<pair<int,int>> edges;
};
int main(void){
int n,m;
cin>>n>>m;
vii graph(n,vi(n,intMAX/100));
vector<set<int>> nexts(n);
vi as(m),bs(m);
rep(i,m){
int a,b,c;
cin>>a>>b>>c;
a--;b--;
as[i]=a;
bs[i]=b;
graph[a][b]=c;
graph[b][a]=c;
nexts[a].insert(b);
nexts[b].insert(a);
}
rep(i,n){
graph[i][i]=0;
}
vii washa=graph;
rep(k,n)rep(i,n)rep(j,n){
washa[i][j]=min(washa[i][j],washa[i][k]+washa[k][j]);
}
int ans=0;
rep(k,m){
int flag=0;
rep(i,n)rep(j,n){
if(i==j)continue;
if(washa[i][as[k]]+graph[as[k]][bs[k]]+washa[bs[k]][j]==washa[i][j]){
flag=1;
}
}
ans+=flag;
}
cout<<m-ans<<endl;
return 0;
} | 0 | 80,401,187 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define ss cout << " ";
#define ct(x) cout << x;
#define nn cout << "\n";
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";
#define qr queries();
void solve();
void YN(bool b){if (b){ctn("YES");}else{ctn ("NO");}};
void yn(bool b){if (b){ctn("Yes");}else{ctn ("No");}};
void queries(){int n;cin >> n;while (n--)solve();}
int64 q, n;
void solve(){
return;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int a1,a2;
cin >> a1 >> a2;
ctn(6 - (a1 + a2));
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<climits>
#include<vector>
#define INF (1<<29)
#define all(c) (c).begin(),(c).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
vector<int>res;
bool check(int n,int mx){
for(int i=mx;i>0;i--){
if(n>=i){
n-=i;
res.push_back(i);
}
}
return n==0;
}
int main(void){
int n;
cin >> n;
int l=0,r=2*n;
vector<int>ans;
while(r-l>1){
res.clear();
int m = (r+l)/2;
if(check(n,m)){
r=m;
ans=res;
}
else l=m;
}
int size = ans.size();
for(int i=size-1;i>=0;i--)
cout << ans[i] << endl;
return 0;
} | 0 | 91,842,049 |
#include<vector>
#include<iostream>
using namespace std;
#define df 0
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long int li;
int dfs(const vector<vector<int>>& adj,int a=0,int seen=-1){
int s=0;
for(int v:adj.at(a)){
if(v==seen)continue;
s^=dfs(adj,v,a)+1;
}
return s;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >>n;
vector<vector<int>> adj(n);
rep(i,n-1){
int x,y; cin >>x >>y; x--; y--;
adj.at(x).push_back(y);
adj.at(y).push_back(x);
}
int ans=dfs(adj);
cout << (dfs(adj)?"Alice":"Bob");
} | #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<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
ll n;
cin >> n;
V<int> can = {1};
ll t = 1;
while (true) {
t *= 6;
if (t > n) break;
can.push_back(t);
}
t = 1;
while (true) {
t *= 9;
if (t > n) break;
can.push_back(t);
}
V<int> dp(n + 1, n);
dp[0] = 0;
rep(i, n) {
for (auto c : can) {
if (i + c > n) continue;
dp[i + c] = min(dp[i] + 1, dp[i + c]);
}
}
cout << dp[n] << endl;
} | 0 | 85,224,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int MAX_N = 2006;
int N, M;
int a[MAX_N];
int b[MAX_N];
ll dp[MAX_N][MAX_N];
void solve()
{
for(int i=1;i<=N;++i)for(int j=1;j<=M;++j){
(dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+MOD)%=MOD;
if(a[i-1]==b[j-1]) (dp[i][j]+=1+dp[i-1][j-1])%=MOD;
}
cout << (dp[N][M]+1)%MOD;
}
int main()
{
cin >> N >> M;
for(int i=0;i<N;++i) cin >> a[i];
for(int i=0;i<M;++i) cin >> b[i];
solve();
return 0;
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
using namespace std;
struct Grid{int x,y,t;};
struct Edge{int to,cost;};
struct Graph{vector<vector<Edge>>E;int V;
const ll Inf = llINF;const int MAX_V=1010;vector<ll>d;
Graph(int n):E(n){d.resize(MAX_V);E.resize(n);V=n;}
void init(){for(int i=0;i<MAX_V;i++)d[i]=Inf;}
void add_edge(int from,int to,int cost){E[from-1].pb({to-1,cost});}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
vector<ll>A(n);
ll sum=0;
for(int i=0;i<n;i++){
cin>>A[i];
sum+=A[i];
}
if(sum%((ll)n*(n+1)/2)==0){
ll cnt=0;
bool flag=true;
ll num=sum/((ll)n*(n+1)/2);
for(int i=0;i<n;i++){
ll d=A[(i+1)%n]-A[i]-num;
if(d>0)flag=false;
if((-d)%n)flag=false;
else{
cnt+=(-d)/n;
}
}
if(cnt!=num)flag=false;
YES(flag);
}else{
cout<<"NO"<<endl;
}
return 0;
} | 0 | 76,429,155 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a + b - 1 > n) {
cout << -1 << "\n";
return 0;
}
if (a * b < n) {
cout << -1 << "\n";
return 0;
}
vl arr;
arr.reserve(n);
ll val = 0;
ll to_add = n - b + 1;
ll lastb = 0;
for (int i = 0; i < to_add; ++i) {
arr.push_back(val++);
if (i % a == a - 1) {
lastb = val - 1;
val -= 2 * a;
if (i != a - 1)
to_add++;
}
}
for (int i = 0; i < n - to_add; ++i) {
lastb -= a;
arr.push_back(lastb);
}
vl sorted = arr;
sort(sorted.begin(), sorted.end());
for (int i = 0; i < n; ++i) {
cout << 1 + lower_bound(sorted.begin(), sorted.end(), arr[i]) - sorted.begin() << " ";
}
cout << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int a,b,x;
cin >> a >> b >> x;
int s;
double the;
double pi;
the=0;
pi=acos(-1);
s=a*a*b;
if(2*x>=s){
the=atan(double(2*(s-x))/double(a*a*a));
the*=(180.0/pi);
}
else{
the=atan(double(a*b*b)/double(2*x));
the*=(180.0/pi);
}
printf("%.10f",the);
return 0;
} | 0 | 69,361,479 |
#include <iostream>
#include <vector>
using namespace std;
int n;
vector<string> s;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
s.resize(n);
for(int i = 0; i < n; ++i) {
cin >> s[i];
s[i] = s[i] + s[i];
}
for(int i = 0; i < n; ++i) s.push_back(s[i]);
int ans = 0;
for(int i = 0; i < n; ++i) {
bool ok = true;
for(int j = 0; j < n; ++j) {
for(int k = j+1; k < n; ++k) {
if(s[i+j][k] != s[i+k][j]) {
ok = false;
break;
}
}
if(!ok) break;
}
if(ok) ++ans;
}
cout << ans * n << endl;
return 0;
} | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int ans[100010];
vector <int> v[100010];
int main(){
int n;
while(cin>>n){
ll tmp=1;
memset(ans, -1, sizeof ans);
ans[1]=2;
for(int i=3; tmp<100010; ++i){
tmp+=i-1;
ans[tmp]=i;
}
int cnt=1;
if(ans[n]!=-1){
cout<<"Yes"<<endl;
printf("%d\n",ans[n]);
for(int i=1; i<=ans[n]; ++i){
for(int j=i+1; j<=ans[n]; ++j){
v[i].push_back(cnt);
v[j].push_back(cnt);
++cnt;
}
}
for(int i=1; i<=ans[n] ;++i){
cout<<v[i].size()<<" ";
for(int j=0; j<v[i].size(); ++j){
printf("%d ",v[i][j]);
}
printf("\n");
}
}
else{
cout<<"No"<<endl;
}
}
return 0;
} | 0 | 34,501,080 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
#define ordered_set tree<int , null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int inf = int(1e9);
const int mod = inf + 7;
const int N = 1e6 + 555;
const double PI = acos(-1.0);
void mul(ll &x, ll y){
x *= y;
if(x >= mod) x %= mod;
}
void add(ll &x, ll y){
x += y;
if(x >= mod) x -= mod;
if(x < 0) x += mod;
}
ll bp(ll a, ll n){
ll r = 1;
while(n){
if(n & 1) mul(r, a);
mul(a, a);
n >>= 1;
}
return r;
}
void solve()
{
ll n, x;
cin >> n >> x;
ll a[n];
for(int i = 0; i < n; ++i){
cin >> a[i];
}
sort(a, a + n);
ll sum = x;
for(int i = 1; i < n; ++i){
ll d = a[i] - a[i - 1];
sum += x;
sum -= max(0ll, x - (a[i] - a[i - 1]));
}
cout << sum;
}
int main()
{
Red;
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int minCoins(int coinList[], int n, int value) {
int coins[value+1];
if(value == 0)
return 0;
coins[0] = 0;
for (int i=1; i<=value; i++)
coins[i] = INT_MAX;
for (int i=1; i<=value; i++) {
for (int j=0; j<n; j++)
if (coinList[j] <= i) {
int tempCoins = coins[i-coinList[j]];
if (tempCoins != INT_MAX && tempCoins + 1 < coins[i])
coins[i] = tempCoins + 1;
}
}
return coins[value];
}
int main() {
int coins[100100];
int ind = 0 ;
coins[ind++] = 1;
int value ;
cin >> value;
int ans = 6;
while(ans<=value)
{
coins[ind++] = ans;
ans *= 6 ;
}
ans = 9 ;
while(ans<=value)
{
coins[ind++] = ans;
ans *= 9 ;
}
sort(coins,coins+ind) ;
cout << minCoins(coins, ind, value);
return 0;
} | 0 | 24,867,528 |
#include<iostream>
using namespace std;
int dp[50];
int fibonacci(int x){
if(x==0 || x==1) return 1;
if(dp[x]!=0) return dp[x];
return dp[x]=fibonacci(x-1)+fibonacci(x-2);
}
int main(){
int n;
cin>>n;
cout<<fibonacci(n)<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
int main(int argc, char **argv)
{
long long N, Z, W;
std::cin >> N >> Z >> W;
std::vector<long long> a(N);
for(int i = 0; i < N; i++){
std::cin >> a.at(i);
}
if(N == 1){
std::cout << std::abs(a.at(0) - W) << std::endl;
return 0;
}else{
long long v = std::abs(a.at(N-1) - W);
long long w = std::abs(a.at(N-2) - a.at(N-1));
std::cout << std::max(v, w) << std::endl;
return 0;
}
} | 0 | 30,736,247 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int W[N];
int sum=0;
rep(i,N){
cin>>W[i];
sum+=W[i];
}
int T=0;
int m=1000000;
rep(i,N){
T+=W[i];
sum-=W[i];
m=min(m,abs(T-sum));
}
cout<<m<<endl;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define mod 1000000007
typedef long long ll;
using namespace std;
ll S[100100];
int main(){
ll n,m; cin >> n >> m;
ll A[100100];
S[0] = 0;
for(int i=1;i<=n;i++){
cin >> A[i];
S[i] = (S[i-1] + A[i]) % m;
}
map<ll,ll> mp;
ll ans = 0;
for(int i=1;i<=n;i++){
ans += mp[S[i]%m];
mp[S[i]%m]++;
}
ans += mp[0];
cout << ans << endl;
return 0;
} | 0 | 87,268,513 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i,n) for (int i=0; i<(n); i++)
#define reps(i,s,n) for (int i=(s); i<(n); i++)
#define rep1(i,n) for (int i=1; i<=(n); i++)
#define repr(i,s,n) for (int i=(s)-1; i>=(n); i--)
#define print(a) cout << (a) << endl;
#define all(v) v.begin(), v.end()
int main() {
int M;
ll K;
cin >> M >> K;
if (K == 0) {
rep(i,(1LL<<M)) {
cout << i << " " << i << " ";
}
cout << endl;
return 0;
} else if (M == 1) {
print(-1);
} else if (K<(1LL<<M)) {
rep(i,(1LL<<M)) {
if (i == K)
continue;
cout << i << " ";
}
cout << K << " ";
repr(i,(1LL<<M), 0) {
if (i == K)
continue;
cout << i << " ";
}
cout << K << endl;
} else {
print(-1);
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int MAXN = 2345;
const int MOD = (int)1e9 + 7;
int A[MAXN], B[MAXN];
int dp[MAXN][MAXN];
int main() {
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
for (int i = 1; i <= M; i++) scanf("%d", &B[i]);
for (int i = 0; i <= N; i++) dp[i][0] = 1;
for (int j = 0; j <= M; j++) dp[0][j] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
dp[i][j] =(dp[i][j] - dp[i - 1][j - 1] + MOD) % MOD;
if (A[i] == B[j]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % MOD;
}
}
printf("%d\n", dp[N][M]);
return 0;
} | 0 | 7,169,280 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 300000;
int mod = 1e9 + 7;
int x[N], y[N], a[N], b[N];
map < pair < int, int >, int > m;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
sort(a + 1, a + n + 1);
if (a[1] >= 0){
int res = 0;
for (int i = 2; i <= n; i++) res += a[i];
res -= a[1];
int s = a[1];
int r = 2;
cout << res << endl;
for (int i = 2; i < n; i++){
cout << s << " " << a[i] << endl;
s -= a[i];
}
cout << a[n] << " " << s;
return 0;
}
if (a[n] < 0){
int res = a[n];
for (int i = 1; i < n; i++){
res -= a[i];
}
cout << res << endl;
int s = a[n];
for (int i = 1; i < n; i++){
cout << s << " " << a[i] << endl;
s -= a[i];
}
return 0;
}
int res = 0;
for (int i = 1; i <= n; i++) res += abs(a[i]);
int s = a[1];
int r = 2;
cout << res << endl;
for (int i = 2; i < n; i++){
if (a[i] < 0) continue;
cout << s << " " << a[i] << endl;
s -= a[i];
}
cout << a[n] << " " << s << endl;
s = a[n] - s;
for (int i = 2; i < n; i++){
if (a[i] < 0){
cout << s << " " << a[i] << endl;
s -= a[i];
}
}
} | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define MAXN 100005
#define mod 1000000007
int syutugenlist[MAXN];
int a[MAXN];
ll Pow(ll a, ll n) {
if (n == 0) return 1;
if (n % 2) return (a * Pow(a, n - 1)) % mod;
else {
ll k = Pow(a, n / 2);
return (k * k) % mod;
}
}
ll gyakusuu[MAXN + 1];
int main () {
for (int i = 1; i <= MAXN; i++) {
gyakusuu[i] = Pow(i, mod - 2);
}
int n;
cin >> n;
memset(syutugenlist, 0, sizeof(syutugenlist));
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
syutugenlist[a[i]]++;
}
int index1 = 0;
int index2;
for (int i = 1; i <= n + 1; i++) {
if (syutugenlist[a[i]] == 2) {
if (index1 == 0) {
index1 = i;
}
else {
index2 = i;
}
}
}
n++;
ll p = n - (index2 - index1 + 1);
ll nCk = n;
ll pc = 1;
for (int k = 1; k <= n; k++) {
ll ret = nCk - pc;
if (ret < 0) ret += mod;
cout << ret << endl;
nCk = ((nCk * (n - k)) % mod) * gyakusuu[k + 1] % mod;
if (p < k) {
pc = 0;
}
else {
pc = (pc * (p - k + 1) % mod) * gyakusuu[k] % mod;
}
}
return 0;
} | 0 | 41,827,017 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S, T; cin >> S >> T;
int s = S.size(), t = T.size();
int count = 0;
for(int i = 0; i <= s - t; i++) {
int cnt = 0;
for(int j = 0; j < t; j++) {
if(S.at(i + j) == T.at(j)) cnt++;
}
if(count < cnt) count = cnt;
}
cout << t - count << endl;
} | #include <iostream>
using namespace std;
int main()
{
string S;
getline(cin,S);
int count=0;
if(S.find("R",0)<3)
{
int count=1;
int n=S.length();
for(int i=0; i<n; i++)
{
if(S[i]=='R')
{
if( i<n)
{
if(S[i]==S[i+1])
{
count++;
}
}
}
}
cout<<count;
}
else
{
cout<<count;
}
return 0;
} | 0 | 1,136,428 |
#include<bits/stdc++.h>
using namespace std;
vector<int> mkper(vector<int> p, int n){
vector<int> perm(n);
for (int i=0;i<n;i++){
perm[i] = i;
}
vector<int> nex(n);
int peak = n;
for (int i=0;i<n;i++){
nex[i] = perm[p[i]];
for (int j=p[i];j<peak-1;j++){
perm[j] = perm[j+1];
}
peak -= 1;
}
return nex;
}
int main(){
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
for (int i=0;i<R;i++){
cin >> r[i];
r[i] -= 1;
}
vector<vector<long long>> d(N, vector<long long>(N, 100000000000));
int A, B, C;
for (int i=0;i<M;i++){
cin >> A >> B >> C;
d[A-1][B-1] = C;
d[B-1][A-1] = C;
}
for (int k=0;k<N;k++){
for (int i=0;i<N;i++){
for (int j=0;j<N;j++){
if (d[i][j] > d[i][k] + d[k][j]){
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
vector<int> L(R);
vector<int> LL(R);
long long m = 100000000000000, tmp = 0, fact = 1, tmp2;
for (int i=0;i<R;i++){
fact *= i + 1;
}
for (int i=0;i<fact;i++){
tmp2 = i;
for (int j=0;j<R;j++){
LL[R-j-1] = tmp2 % (j+1);
tmp2 /= j + 1;
}
L = mkper(LL, R);
tmp = 0;
for (int j=0;j<R-1;j++){
tmp += d[r[L[j]]][r[L[j+1]]];
}
if (m > tmp){
m = tmp;
}
}
cout << m << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a;
int b;
cin >> a >> b;
string symbol;
if (a < b) {
symbol = " < ";
} else if (a > b) {
symbol = " > ";
} else {
symbol = " == ";
}
cout << 'a' << symbol << 'b' << endl;
} | 0 | 62,514,204 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int rate, kyu;
cin >> rate;
for(int r = 600, k = 8;k > 0;r += 200, k -= 1) {
if (rate < r) {
kyu = k;
break;
}
}
cout << kyu << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++){
cin >> W[i];
}
int sum = 0;
for (int i = 0; i < N; i++){
sum += W[i];
}
int sum2 = 0;
for (int i = 0; i < N; i++){
sum2 += W[i];
if (sum2 >= sum / 2.0){
if (sum2 - (sum - sum2) <= (sum - sum2 + W[i]) - (sum2 - W[i])){
cout << sum2 - (sum - sum2) << endl;
return 0;
}
else{
if ((sum - sum2 + W[i]) - (sum2 - W[i]) >= 0){
cout << (sum - sum2 + W[i]) - (sum2 - W[i]) << endl;
return 0;
}
else{
cout << (sum2 - W[i]) - (sum - sum2 + W[i]) << endl;
return 0;
}
}
}
}
} | 0 | 79,371,307 |
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "no" << endl;
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
const static ll MOD = 1e9 + 7;
ll n, cnt, ans, tmp, sum, a, b, c, d, k, m, h, w, q, x, y;
string s, t;
int main() {
cin >> a >> b >> x;
YN(a <= x && x <= a + b)
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
ll ans=0;
rep(i,10){
rep(j,10){
rep(k,10){
rep(m,10){
rep(n,10){
ll num=i*10000+j*1000+k*100+m*10+n;
if(num<=B && num>=A){
if(i==n && j==m){
ans++;
}
}
}
}
}
}
}
cout << ans << endl;
return 0;
} | 0 | 67,982,755 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int a, b;
cin >> a >> b;
cout << ( ( a * 3 + b ) / 2 ) << endl;
} | #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;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
ll ans=1000;
rep(i,n) cin >> a[i];
rep(i,n-1) {
if (a[i]<a[i+1]) {
ll j=ans/a[i];
ans+=(a[i+1]-a[i])*j;
}
}
cout << ans << endl;
return 0;
} | 0 | 8,156,470 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
# define ll int64_t
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<string,ll> a,pair<string,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) (x*=i)%=mod;
return x;
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b,a%b));
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> s(4,0);
rep(i,3){
ll a,b;
cin>>a>>b;
s[a-1]++;
s[b-1]++;
}
sort(ALL(s));
cout<<(s[3]>=3 ? "NO":"YES")<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a1,b1,c1,d1,a2,b2,c2,d2,T1,T2,T;
cin >> a1 >> b1 >> c1 >> d1;
cin >> a2 >> b2 >> c2 >> d2;
if(a1>100){
cout << "エラー" << endl;
return 0;
}
if(b1>100){
cout << "エラー" << endl;
return 0;
}
if(c1>100){
cout << "エラー" << endl;
return 0;
}
if(d1>100){
cout << "エラー" << endl;
return 0;
}
if(a2>100){
cout << "エラー" << endl;
return 0;
}
if(b2>100){
cout << "エラー" << endl;
return 0;
}
if(c2>100){
cout << "エラー" << endl;
return 0;
}
if(d2>100){
cout << "エラー" << endl;
return 0;
}
T1=a1+b1+c1+d1;
T2=a2+b2+c2+d2;
if(T1>T2){
T=T1;
}
if(T2>T1){
T=T2;
}
if(T1==T2){
T=T1=T2;
}
cout << T << endl;
return 0;
} | 0 | 72,159,886 |
#include<iostream>
using namespace std;
int main()
{
int i, n, a[10009],max ,min;
long long int sum = 0;
cin >> n;
max = -1000001;
min = -max;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i < n; i++)
{ sum += a[i];
if (a[i] > max)max = a[i];
if (a[i] < min)min = a[i];
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long lol;
lol gcd(lol a,lol b);
lol lcm(lol a,lol b);
int main(){
lol n;
cin>>n;
vector<lol> t(n+10,1);
for(lol i=0;i<n;i++){
cin>>t[i];
}
lol ans=lcm(t[0],t[1]);
for(lol i=2;i<n;i++){
ans=lcm(ans,t[i]);
}
cout<<ans<<"\n";
return(0);
}
lol gcd(lol a,lol b){
while(b!=0){
lol r=a%b;
a=b;
b=r;
}
return(a);
}
lol lcm(lol a,lol b){
return(a/gcd(a,b)*b);
} | 0 | 7,895,039 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int a=0,b=0,c=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='0'){
a++;
}
else if(s.at(i)=='1'){
b++;
}
}
c=min(a,b);
cout<<c*2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
class SegTree {
constexpr static int DEFAULT = INT_MAX;
int Combine(int l, int r) { return min(l,r); }
vector<int> seg_tree;
int n = 0;
void Build(vector<int>& A, int v, int tl, int tr) {
if (tl == tr) {
seg_tree[v] = A[tl];
} else {
int tm = tl + (tr - tl) / 2;
Build(A, v*2, tl, tm);
Build(A, v*2+1, tm+1, tr);
seg_tree[v] = Combine(seg_tree[v*2], seg_tree[v*2+1]);
}
}
public:
SegTree(vector<int>& A) {
n = A.size();
seg_tree.resize(4*n);
Build(A, 1, 0, n-1);
}
SegTree(int _n) : n(_n) {
seg_tree.resize(4*n, DEFAULT);
}
int Query(int l, int r, int tl, int tr, int v) {
if (l > r) return DEFAULT;
if (l == tl && r == tr) return seg_tree[v];
int tm = tl + (tr - tl) / 2;
return Combine(Query(l, min(r, tm), tl, tm, v*2),
Query(max(l, tm+1), r, tm+1, tr, v*2+1));
}
int Query(int l, int r) {
return Query(l, r, 0, n-1, 1);
}
void Update(int pos, int new_val, int tl, int tr, int v) {
if (tl == tr) {
seg_tree[v] = new_val;
return;
}
int tm = tl + (tr - tl) / 2;
if (pos <= tm) {
Update(pos, new_val, tl, tm, v*2);
} else {
Update(pos, new_val, tm+1, tr, v*2+1);
}
seg_tree[v] = Combine(seg_tree[v*2], seg_tree[v*2+1]);
}
void Update(int pos, int new_val) {
Update(pos, new_val, 0, n-1, 1);
}
};
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ll n;
cin >> n;
vector<int> A(n);
for (auto& _a : A) cin >> _a;
SegTree stree(A);
int ans = 0;
for (int i = 0; i < n; ++i) {
if (stree.Query(0, i) == A[i]) ++ans;
}
cout << ans << endl;
} | 0 | 12,529,864 |
#include <iostream>
using namespace std;
int main(){
int m,nmax,nmin;
while(cin>>m>>nmin>>nmax,m){
int P[m];
int M=0,ans=0;
for(int i=0;i<m;i++){
cin>>P[i];
}
for(int i=nmin-1;i<nmax;i++){
if(M<=P[i]-P[i+1]){
M=P[i]-P[i+1];
ans=i+1;
}
}
cout<<ans<<endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <deque>
using namespace std;
int d[100005];
int K;
void solve(){
fill(d,d+K,1<<30);
d[1]=1;
deque<int>que;
que.push_front(1);
while(!que.empty()){
int v=que.front();que.pop_front();
int to=(v+1)%K;
if(d[to]>d[v]+1){
d[to]=d[v]+1;
que.push_front(to);
}
to=(v*10)%K;
if(d[to]>d[v]){
d[to]=d[v];
que.push_back(to);
}
}
cout<<d[0]<<endl;
}
int main(){
scanf("%d",&K);
solve();
return 0;
} | 0 | 41,479,567 |
#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 main(){
string s,t;
cin >> s >> t;
vector<int> start(26,-1),goal(26,-1);
rep(i,s.size()){
int a = s[i] - 'a';
int b = t[i] - 'a';
if(start[a] != -1 || goal[b] != -1){
if(start[a] != b || goal[b] != a){
cout << "No" << endl;
return 0;
}
}else{
start[a] = b;
goal[b] = a;
}
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n, min, max;
cin >> n >> min >> max;
if(n == 0 && min == 0 && max == 0) break;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int max_gap = 0;
int target = 0;
for(int i = min; i <= max; i++){
int gap = a[i - 1] - a[i];
if(max_gap <= gap){
max_gap = gap;
target = i;
}
}
cout << target << endl;
}
} | 0 | 36,966,568 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int h; cin >> h;
int w; cin >> w;
vector<string> a(h);
for (int i = 0; i < h; i++) {
cin >> a[i];
}
vector<bool> row(h, false);
vector<bool> col(w, false);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '#') {
row[i] = true;
col[j] = true;
}
}
}
for (int i = 0; i < h; i++) {
if (row[i]) {
for (int j = 0; j < w; j++) {
if (col[j]) {
printf("%c", a[i][j]);
}
}
printf("\n");
}
}
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
map<long long, map<long long, long long>> memo;
long long n_num;
long long k_num;
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(long long(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
map<ll,ll> m;
rep(i,3){
ll a,b;
cin >> a >> b;
m[a]++; m[b]++;
}
map<ll,ll> m2;
for(auto it : m){
m2[it.second]++;
}
bool ans = m2[1] == 2 && m[2] == 2;
if(ans) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
int getDigit(int n) {
int i = 1;
while(1) {
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while(n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi() {
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k) {
ll ret;
if(memo[n][k] != 0) {
ret = memo[n][k];
} else if(n == k || k == 0) {
memo[n][k] = 1;
ret = 1;
} else {
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
long long Combi::nPk_modp(long long n, long long k, long long p) {
ll ans = 1;
for(long long i = k; i <= n; i++) {
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long,long long>> prime_factorize(long long p) {
vector<pair<long long,long long>> ret;
for(long long x = 2; x * x <= p; ++x) {
if(p % x != 0) continue;
long long num = 0;
while(p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x,num));
}
if(p != 1) ret.push_back(make_pair(p, 1));
return ret;
} | 0 | 23,017,188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t min = 0;
int n, k;
cin >> n >> k;
vector<int> monsters(n);
for (int i = 0; i < n; i++){
cin >> monsters.at(i);
}
sort(monsters.begin(), monsters.end(), std::greater<int>() );
if (n <= k){
cout << 0 << endl;
return 0;
}
for (int i = k; i < n; i++){
min += monsters.at(i);
}
cout << min << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
vector<ll> sum(N+1);
for (int i = 0; i < N; i++) sum[i+1] = sum[i] + a[i];
map<ll, ll> mp;
for (int i = 0; i < N+1; i++) mp[sum[i] % M]++;
ll ans = 0;
for (int i = 0; i < N; i++) {
mp[sum[i] % M]--;
ans += mp[sum[i] % M];
}
cout << ans << '\n';
} | 0 | 97,384,389 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for(int i = (int)(k);i < (int)(n);i++)
int K, a = 1, b = 1;
vector<map<int, int>> dp(11);
void c() {
while(K > dp[a][b]) {
K -= dp[a][b];
b++;
}
cout << b;
if(0 < b) b--;
a--;
}
int main() {
cin >> K;
vector<int> S(11);
rep(i, 0, 10) dp[1][i] = 1;
S[1] = 9;
rep(i, 2, 11) rep(j, 0, 10) rep(k, -1, 2) {
dp[i][j] += dp[i-1][j+k];
if(j > 0) S[i] += dp[i-1][j+k];
}
while(K > S[a]) {
K -= S[a];
a++;
}
while(a > 0) c();
cout << endl;
} | #include <iostream>
#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 main() {
int h, w, k;
int ans = 0;
cin >> h >> w >> k;
vector<string> s(h);
rep(i, h) cin >> s[i];
rep(is, 1 << h) rep(js, 1 << w){
int pat = 0;
rep(i, h)rep(j, w) {
if ((is >> i) & 1) {
if ((js >> j) & 1) {
if (s[i][j] == '#') {
pat++;
}
}
}
}
if (pat == k) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 70,267,286 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector< pair<int,int> > vii;
const double pi = 2*acos(0) ;
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i,n) for(ll i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define sq(a) (a)*(a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z,x) cout<<"Case "<<z<<": "<<x<<"\n"
int main()
{
ll n,p,t;
cin>>n;
map<ll,ll>m;
for0(i,n){
cin>>p;
m[p]++;
}
ll x=0,y=0;
for(auto it:m){
if(it.se>=2){t=it.fi ; x = max(x,t); }
}
m[x] -= 2;
for(auto it:m){
if(it.se>=2){t=it.fi; y = max(y,t);}
}
ll ans = x*y;
cout<<ans<<nw;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int sumOfDigits( int x )
{
int sum = 0;
while ( x > 0 )
{
sum += x % 10;
x /= 10;
}
return sum;
}
int main(void)
{
int n,a,b;
cin >> n >> a >> b;
int ans = 0;
for ( int i = 1; i <= n; i++ )
if ( sumOfDigits(i) >= a && sumOfDigits(i) <= b )
ans += i;
cout << ans << endl;
} | 0 | 1,865,588 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
ll v[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
ll n, m;
cin >> n >> m;
vl a(m);
rep(i, m) {
cin >> a[i];
}
sort(rall(a));
vl dp(n+1, -INF);
dp[0] = 0;
exrep(i, 1, n) {
rep(j, m) {
if(i - v[a[j]] >= 0) {
chmax(dp[i], dp[i - v[a[j]]] + 1);
}
}
}
ll x = n;
rep(i, dp[n]) {
rep(j, m) {
if(x - v[a[j]] >= 0 && dp[x] == dp[x - v[a[j]]] + 1) {
cout << a[j];
x -= v[a[j]];
break;
}
}
}
cout << endl;
re0;
} | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = atan(1.0) * 4;
const int di[4] = { -1, 0, 1, 0} ;
const int dj[4] = {0, -1, 0, 1} ;
const ll INF = (ll)2e18 + 50;
const int maximum = numeric_limits<int>::min();
const int minimum = numeric_limits<int>::max();
ll power(ll a , ll e) {
ll res = 1LL ;
while (e > 0) {
if (e % 2 == 1) res = res * a;
a = a * a ;
e /= 2 ;
}
return res ;
}
bool isBalanced(const string &exp) {
bool flag = true;
int count = 0;
for (int i = 0; i < exp.length(); i++) {
if (exp[i] == '(') {
count++;
}
else {
count--;
}
if (count < 0) {
flag = false;
break;
}
}
if (count != 0) {
flag = false;
}
return flag;
}
bool sortbysec(const pair<pair<int, int>, int> &a,
const pair<pair<int, int>, int> &b) {
return (a.second < b.second);
}
void uniformly_distribute_k_numbers_in_a_square_grid(int n , int k ) {
int p = 0 , q = 0 ;
vector<vector<int>> a(n, vector<int>(n)) ;
for (int i = 1 ; i <= k ; ++i ) {
a[p][q] = 1 ;
p = p + 1 ;
q = (q + 1) % n ;
if (p == n) {
p = 0 ;
q = (q + 1) % n ;
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n , m ;
cin >> n >> m ;
ll ans = 0 ;
ll rem = m ;
vector<pair<ll, ll>> p(n) ;
for (int i = 0 ; i < n ; i++) {
cin >> p[i].first >> p[i].second ;
}
sort(p.begin() , p.end()) ;
for (int i = 0 ; i < n ; i++) {
if (rem < p[i].second) {
ans += p[i].first * rem ;
break ;
} else {
rem -= p[i].second ;
ans += p[i].first * p[i].second ;
}
}
cout << ans << "\n";
return 0 ;
} | 0 | 93,854,516 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, A, B;
cin >> N >> A >> B;
vector<int> cnt(3);
for (int i = 0; i < N; i++) {
int p; cin >> p;
if (p <= A) cnt[0]++;
else if (p <= B) cnt[1]++;
else cnt[2]++;
}
cout << *min_element(cnt.begin(), cnt.end()) << '\n';
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i,n) for (int i = 1;i <= (int)(n); ++i)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repv(i,a,b) for(int i=b-1;i>=a;i--)
#define SET(A, val) memset(A, val, sizeof(A))
typedef tree<int ,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set ;
#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
const int N=10005;
vi x1,y2;
int dp1[2][4*N],dp2[2][4*N];
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(NULL) ; cout.tie(NULL) ;
string s;
int x,y;
cin>>s>>x>>y;
s+="T";
while(sz(s) && s[0]=='F')
s.erase(s.begin()),x--;
int cnt=0,side=1;
rep(i,0,sz(s))
{
if(s[i]=='T')
{
if(cnt)
{
if(side) x1.pb(cnt);
else y2.pb(cnt);
}
side=1-side;
cnt=0;
}
else cnt++;
}
dp1[0][N]=1;
int bit1=1;
for(auto it:x1)
{
rep(i,-N,N)
if(dp1[1-bit1][i+N])
dp1[bit1][i+it+N]=dp1[bit1][i-it+N]=1;
rep(i,0,4*N)
dp1[1-bit1][i]=0;
bit1=1-bit1;
}
int bit2=1;
dp2[0][N]=1;
for(auto it:y2)
{
rep(i,-N,N)
if(dp2[1-bit2][i+N])
dp2[bit2][i+it+N]=dp2[bit2][i-it+N]=1;
rep(i,0,4*N)
dp2[1-bit2][i]=0;
bit2=1-bit2;
}
if(dp1[1-bit1][x+N] && dp2[1-bit2][y+N])
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0 ;
} | 0 | 51,341,444 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int n, k = 0, i = 0; cin >> n;
vector<ll> a(n), x(n-1), y(n-1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
while (k+1 < n-1 && a[k+1] < 0) k++;
ll ans = 0, p = a[n-1], m = a[0];
for (int j = 1; j <= k; j++) {
x[i] = p; y[i] = a[j];
p -= a[j]; i++;
}
for (int j = k+1; j < n-1; j++) {
x[i] = m; y[i] = a[j];
m -= a[j]; i++;
}
x[i] = p; y[i] = m;
cout << p - m << endl;
for (int j = 0; j < n-1; j++)
cout << x[j] << " " << y[j] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
rep(i,N) cin >> H.at(i);
ll ans = 0;
sort(H.begin(), H.end(), greater<ll>());
if (N > K) {
for (int i = K; i < N; ++i) {
ans += H.at(i);
}
}
cout << ans << endl;
} | 0 | 100,305,714 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
const ll MAX = 1e9;
int main() {
ll n;
cin >> n;
vl a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
ll m = n*(n+1)/2;
if(sum%m != 0) {
out("NO");
re0;
}
ll t = sum/m;
vl b(n);
rep(i, n-1) {
b[i] = a[i+1] - a[i] - t;
}
b[n-1] = a[0] - a[n-1] - t;
rep(i, n) {
if(b[i] > 0) {
out("NO");
re0;
}
if(abs(b[i])%n != 0) {
out("NO");
re0;
}
}
out("YES");
re0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <ctype.h>
#include <numeric>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vl = vector<ll>;
using vvl = vector<vl >;
using pairi = pair<int, int>;
using pairl = pair<ll, ll>;
#define TR ","
#define TS " "
#define rep(i,N) for(ll i=0;i<(ll)N;++i)
#define rpt(i,a,b) for(ll i=a;i<(ll)b;++i)
#define all(v) v.begin(), v.end()
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y) * y;
}
ll waz = 76543217;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
int main()
{
IO;
long double N, K; cin >> N >> K;
cout << ceil((N - 1) / (K - 1)) << endl;
} | 0 | 47,856,412 |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r){
if(n < r) return 0;
if(r == 0||r == n) return 1;
else if(r == 1) return n;
return (combination(n - 1, r - 1) + combination(n - 1, r));
}
bool checkKaibun(string str){
string checkStr = str;
reverse(checkStr.begin(), checkStr.end());
if(str == checkStr) return true;
else return false;
}
int keta(ll num){
int digits = 0;
while(num > 0){
num /= 10;
digits++;
}
return digits;
}
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
int gcd(int a, int b){
if(a % b == 0) return b;
else return (gcd(b, a%b));
}
int main(){
int N;
cin >> N;
vector<int> c(N), s(N), f(N);
rep(i, N - 1)cin >> c[i] >> s[i] >> f[i];
rep(i, N){
ll ans = 0;
for(int j = i; j < N - 1; j++){
if(ans < s[j]) ans = s[j] + c[j];
else{
if(ans % f[j] != 0){
ans += f[j] - (ans % f[j]);
}
ans += c[j];
}
}
cout << ans << endl;
}
} | #include <iostream>
using namespace std;
int main()
{
int num;
const string kei[] = {".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz" };
cin >> num;
for (int i = 0; i < num; i++) {
string inp;
char bf = '0';
int cnt = 0;
cin >> inp;
for (int i = 0; i < inp.size(); i++) {
if (inp[i] != '0') {
bf = inp[i];
cnt++;
}
else if (inp[i] == '0' && bf != '0') {
int ind = bf - '0' - 1;
cnt--;
cnt = cnt % kei[ind].size();
cout << kei[ind][cnt];
cnt = 0;
bf = '0';
}
}
cout << endl;
}
return 0;
} | 0 | 18,679,845 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
# define ll int64_t
# define str string
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define INF 2000000000
#define MAX_V 10
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<string,ll> a,pair<string,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll modpow(ll a,ll n,ll mod1) {
ll res=1;
while(n>0){
if(n&1) res=res*a%mod1;
a = a*a%mod1;
n >>= 1;
}
return res;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) (x*=i)%=mod;
return x;
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b,a%b));
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
const ll MAX = 5100000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
using graph = vector<vector<ll>>;
string divide[4]={"dream","dreamer","erase","eraser"};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
reverse(ALL(s));
rep(i,4) reverse(ALL(divide[i]));
bool can=true;
for(ll i=0;i<s.size();){
bool can2=false;
rep(j,4){
string d=divide[j];
if(s.substr(i,d.size())==d){
can2=true;
i+=d.size();
}
}
if(!can2){
can=false;
break;
}
}
cout<<(can ? "YES":"NO")<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n);i++)
int main() {
long long N,buf;
vector<int> ans;
cin >> N;
for(long long i=1;i*i<=N;i++){
if(N%i==0){
buf = N/i;
if(to_string(buf).length()>to_string(i).length()){
ans.push_back(to_string(buf).length());
}else{
ans.push_back(to_string(i).length());
}
}
}
sort(ans.begin(),ans.end());
cout << ans.at(0) << endl;
} | 0 | 51,896,253 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> p(n);
rep(i, n) cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
ll ans = 0;
rep(i, n) {
if (p[i].second < m) {
ans += p[i].first * p[i].second;
m -= p[i].second;
} else {
ans += p[i].first * m;
break;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include<algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include<map>
#include<set>
#include<sstream>
#define INF 0x3f3f3f3f
#define DOF 0x7f7f7f7f
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int maxn=2e5+10;
ll a[maxn],sum[maxn];
map<unsigned int,ll>num;
ll ans;
int main()
{
int n,k;cin>>n>>k;
for(int i=1;i<=n;++i){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
for(int i=0;i<=n;++i){
if(i>=k){
num[((sum[i-k]-(i-k))%k)]--;
}
if(num[(sum[i]-i)%k]){
ans+=num[(sum[i]-i)%k];
}
num[(sum[i]-i)%k]++;
}
cout<<ans<<endl;
return 0;
} | 0 | 35,518,421 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb(x) push_back(x)
#define INF 1e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int di[4] = {1,0,-1,0};
const int dj[4] = {0,1,0,-1};
int main() {
int h,w,k; cin >> h >> w >> k;
vector<string> c(h);
rep(i,h) cin >> c[i];
int ans = 0;
rep(i,1<<(h+w)) {
int cnt = 0;
set<int> st;
rep(j,w) {
if (i>>(h+j) & 1) st.insert(j);
}
rep(j,h) {
if (i>>j & 1) {
continue;
}
rep(k,w) {
if (st.find(k)!=st.end()) continue;
if (c[j][k]=='#') cnt++;
}
}
if (cnt==k) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i,n) ;for( int i =0; i < n ; i ++)
#define all(a) a.begin(),a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define f(i,a,b) for(int i=a;i<b;i++)
#define pri(a) printf("%.14lf\n",a);
#define MOD 1000000007
bool is_int_lround(double x){
return std::lround(x)==x;
}
ll keta(ll x){
ll n=0;
while(x>0){
x /=10 ;
n ++;
}
return n;
}
ll conbi(int n,int m){
cin>>n>>m;
vector<ll> a(100);
a[0] =1;
for(int i=0;i<14;i++){
a[i+1]=a[i]*(i+1);
}
return a[n] /(a[m] *a[n-m]);
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll kaijo(ll x){
ll z=1;
if(x==0){
return 1;
}
while(x>0){
z *=x;
z %=MOD;
x--;
}
return z;
}
ll yakusu_num(ll n){
vl yakusu(n+1,1);
for(ll i=2;i*i<=n;i++){
while(n%i==0){
n /=i;
yakusu[i]++;
}
}
if(n!=1)yakusu[n]++;
ll num=1;
for(ll i=0;i <=n;i++){
num*=yakusu[i];
}
return num;
}
int main(){
int a,b,c,d;cin>>a>>b>>c>>d;
if(abs(a-c)<=d || (abs(a-b)<=d && abs(b-c)<=d))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 0 | 98,167,119 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
char S[205];
int main(){
scanf("%s",S);
int LEN;
for(LEN = 0; S[LEN] != '\0'; LEN++);
int ans = 0;
for(int tail = 1; tail < LEN-1; tail += 2){
bool FLG = true;
int len = (tail+1)/2;
for(int i = 0; i < len; i++){
if(S[i] != S[len+i]){
FLG = false;
break;
}
}
if(!FLG)continue;
ans = (tail+1);
}
printf("%d\n",ans);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n,a,b;
string str,ch,p;
char c;
cin>>str;
cin>>n;
for(int i=0;i<n;i++){
cin>>ch;
if(ch=="replace"){
cin>>a>>b>>p;
for(int j=a,k=0;j<=b;j++,k++)str[j]=p[k];
}
if(ch=="reverse"){
cin>>a>>b;
for(int j=a,k=b;j<(a+b+1)/2;j++,k--){
swap(str[j],str[k]);
}
}
if(ch=="print"){
cin>>a>>b;
for(int j=a;j<b+1;j++)cout<<str[j];
cout<<endl;
}
}
return 0;
} | 0 | 50,366,331 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>>n;
ll u=pow(2,n);
ll a[u];
for(ll i=0;i<u;i++)cin>>a[i];
ll mm[u][2];
for(ll i=0;i<u;i++){
mm[i][0]=a[0];
mm[i][1]=0;
}
ll ma=0;
for(ll i=1;i<u;i++){
if(a[i]>=mm[i][0]){
mm[i][1]=mm[i][0];
mm[i][0]=a[i];
}
else if(a[i]>=mm[i][1])mm[i][1]=a[i];
ma=max(ma,mm[i][0]+mm[i][1]);
cout<<ma<<endl;
ll b=i;
b=i|(b+1);
while(b<u){
if(a[i]>=mm[b][0]){
mm[b][1]=mm[b][0];
mm[b][0]=a[i];
}
else if(a[i]>=mm[b][1])mm[b][1]=a[i];
b=i|(b+1);
}
}
for(ll i=0;i<u;i++){
}
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
int change = 'a' - 'A';
string str;
getline( cin, str );
for( int i = 0; i < str.size(); i++ )
{
if( str[i] >= 'A' && str[i] <= 'Z' )
str[i] += change;
else if( str[i] >= 'a' && str[i] <= 'z' )
str[i] -= change;
else;
}
cout << str << endl;
return 0;
} | 0 | 54,212,560 |
#include<bits/stdc++.h>
using namespace std;
long long n;
int main(){
ios::sync_with_stdio(false);
cin>>n;cout<<800*n-n/15*200<<endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
rep(i,(1<<3)){
int num = (s[0] - '0');
rep(j,3){
if(i>>j & 1){
num += (s[j+1] - '0');
}
else{
num -= (s[j+1] - '0');
}
}
if(num == 7){
cout << s[0] << ((i>>0 & 1) ? "+" : "-");
cout << s[1] << ((i>>1 & 1) ? "+" : "-");
cout << s[2] << ((i>>2 & 1) ? "+" : "-");
cout << s[3] << "=7" << endl;
return 0;
}
}
return 0;
} | 0 | 64,787,683 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
int main() {
cin >> N >> K;
ll cnt = N / K;
if (K % 2 == 1) {
cout << cnt * cnt * cnt << endl;
} else {
ll ans = cnt * cnt * cnt;
ll tmp = 0;
for (int i = 1; i <= N; i++) {
if (i % K == (K / 2)) tmp++;
}
ans += tmp * tmp * tmp;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 1000005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define endl "\n"
using namespace std;
void solve(){
int k,a,b;
cin>>k>>a>>b;
for(int i=a; i<=b; i++) {
if(i%k ==0 ) {
cout<<"OK";
return;
}
}
cout<<"NG";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while (t--)
{
solve();
}
} | 0 | 74,006,234 |
#include <stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1,x2,x3,x4,y1,y2,y3,y4;
int n;
scanf("%d",&n);
for(int i=0; i<n; i++){
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
if(abs((y2 - y1)*(x4 - x3) - (y4 - y3)*(x2 - x1) ) < 0.0000000001){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<iostream>
using namespace std;
int main() {
const int n = 6;
int dice[n];
int top, front;
int p;
int dice_result[6];
const int dice_tem[4][6] = { { 3,2,6,1,5,4 },{ 2,6,3,4,1,5 },
{ 5,1,3,4,6,2 },{ 4,2,1,6,5,3 } };
for (int i = 0; i < n; i++) {
cin >> dice[i];
}
int num;
cin >> num;
for (int v = 0; v < num; v++) {
cin >> top >> front;
for (int d = 0; dice[0] != top ; d++) {
if (d == 0)continue;
for (int i = 0; i < n; i++) {
dice_result[i] = dice[dice_tem[d % 2][i] - 1];
}
for (int i = 0; i < n; i++)dice[i] = dice_result[i];
}
for (p = 0; p < 4; p++) {
for (int i = 0; i < n; i++) {
dice_result[i] = dice[dice_tem[p][i]-1];
}
if (front == dice_result[0]) break;
}
int a = p == 0 ? 2 : p == 1 ? 0 : p == 2 ? 3 : p == 3 ? 1 : -1;
int y[6];
for (int i = 0; i < n; i++)y[i] = dice[dice_tem[a][i] - 1];
cout << y[0] << endl;
}
return 0;
} | 0 | 8,606,920 |
#include<bits/stdc++.h>
using namespace std;
int n,m,i,j,a,b,c,d,x=0,y=200;
int main()
{
cin>>n>>m>>a>>b;
a+=100;b+=100;
for(;i<n;i++)cin>>c,x=max(x,c+100);
for(i=0;i<m;i++)cin>>d,y=min(y,d+100);
if(min(y,b)-max(x,a)>0)cout<<"No War";
else cout<<"War";
} | #include <bits/stdc++.h>
using namespace std;
bool in_range(int a, int b, int x) {
if(a <= x && x <= b) {
return 1;
}
else {
return 0;
}
}
int main() {
int N, M;
cin >> N >> M;
int L_max = 1;
int R_min = N;
for(int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
if(L > L_max) {
L_max = L;
}
if(R < R_min) {
R_min = R;
}
}
int ans = 0;
for(int i = 1; i <= N; i++) {
if(in_range(L_max, R_min, i)) {
ans++;
}
}
cout << ans << endl;
} | 0 | 56,943,146 |
#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 pb push_back
#define solve(a) ((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;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n, m;
int sum = 0;
int ans = 0;
cin >> n >> m;
Vi a(n);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
rep(i, n) {
if (a[i] >= ((double)sum / (4 * m))) {
ans++;
}
}
cout << solve(ans >= m) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T, class V> istream& operator>> (istream& ist, pair<T, V>& p) { return ist >> p.first >> p.second; }
template<class T> ostream& operator<< (ostream& ost, pair<T, T>& p) { return ost << p.first << ", " << p.second; }
template<class T> istream& operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) ist >> e; return ist; }
typedef long long ll;
constexpr int MOD = 1e9+7;
namespace math { namespace integer {
template<class T> T mod_mul(T x, T k, T m) { if(k == 0) { return 0; } if(k % 2 == 0) { return mod_mul((x + x) % m, k / 2, m); } else { return (x + mod_mul(x, k - 1, m)) % m; } }
template<class T> T mod_pow(T x, T n, T mod) { if(n == 0) { return 1; } if(n % 2 == 0) { return mod_pow(mod_mul(x, x, mod) % mod, n / 2, mod); } else { return mod_mul(x, mod_pow(x, n - 1, mod), mod); } }
template<class T> T extgcd(T a, T b, T& x, T& y) { T d = a; if(b != 0) { d = extgcd(b, a % b, y, x); y -= (a / b) * x;} else { x = 1, y = 0; } return d; }
template<class T> T mod_inverse(T x, T mod) { return mod_pow(x, T(mod - 2), mod); }
template<class T> T mod_inverse_composite_num_mod(T a, ll mod) { T x, y; extgcd(a, mod, x, y); return (mod + x % mod) % mod; }
}}
using namespace math::integer;
typedef long long ll;
int const inf = INT_MAX / 2;
namespace sort_algorithm {
long long inversion_count(int n, vector<int> const& a) {
long long ret = 0;
rep(i, n) REP(j, i + 1, n) {
ret += a[i] > a[j];
}
return ret;
}
}
int main() {
ll N, K; cin >> N >> K;
vector<int> A(N); rep(i, N) cin >> A[i];
ll ans = (sort_algorithm::inversion_count(N, A) * K) % MOD;
rep(i, N) {
vector<int> B;
ll Y = 0;
rep(j, N) Y += A[i] > A[j];
ll p = ((K - 1) * K / 2) % MOD;
(ans += (Y * p) % MOD) %= MOD;
}
cout << ans << endl;
} | 0 | 84,317,398 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); ++i) {
if (i%2 == 0) cout << s[i];
}
cout << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<set>
int main () {
int n;
std::cin >> n;
std::vector<std::string> w(n);
std::set<std::string> ws;
for (int i = 0; i < n; i++)
{
std::cin >> w[i];
ws.insert(w[i]);
}
bool f1 = ws.size() == n ? true : false;
bool f2 = true;
for (int i = 0; i < n - 1; i++)
{
if(w[i][w[i].size()-1] != w[i+1][0]) {
f2 = false;
}
}
std::string ans = (f1 && f2) ? "Yes" : "No";
std::cout << ans << "\n";
} | 0 | 65,470,739 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, ans;
cin >> N;
ans=0;
vector<int> a(N);
for (int i=0; i<N; i++) {
cin >> a[i];
}
for (int j=0; j<N; j++) {
if (a[a[j]-1]==j+1) {
ans=ans+1;
}
}
cout << ans/2 << endl;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
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; }
#define pb push_back
#define mp make_pair
#define F .first
#define S .second
using ll=long long;
using ld=long double;
const ll INF = 1LL<<60;
const ll mod=1e9+7;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }
ll a[110000];
vector<ll> ap,am;
vector<ll>x,y;
int main(){
ll n,t,a1,a2,cnt=0;
cin>>n;
rep(i,0,n)cin>>a[i];
sort(a,a+n);
rep(i,0,n-1){
if(a[i]<0)am.pb(a[i]);
else ap.pb(a[i]);
}
if(am.empty()){a2=ap[0];cnt++;}
else if(ap.empty()) {a1=am[am.size()-1];a2=am[0];cnt++;}
else a2=am[0];
a1=a[n-1];
while(cnt<ap.size()){
x.pb(a2),y.pb(ap[cnt]);
a2-=ap[cnt];
cnt++;
}
x.pb(a1),y.pb(a2);
a1-=a2;
cnt=1;
while(cnt<am.size()){
x.pb(a1),y.pb(am[cnt]);
a1-=am[cnt];
cnt++;
}
cout<<a1<<endl;
rep(i,0,x.size())cout<<x[i]<<" "<<y[i]<<endl;
} | 0 | 45,579,891 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char str[256];
char f[4]={'m','c','x','i'};
int n;
for(scanf("%d\n",&n);n--;){
int c;
int ans[2]={0,0};
for(int i=0;i<2;i++){
int tmp=0;
while((c=getchar())!=' '&&c!='\n'){
if(isdigit(c)){
tmp*=10;
tmp+=c-'0';
}else{
if(tmp==0) tmp=1;
switch(c){
case 'm':
tmp*=1000;
break;
case 'c':
tmp*=100;
break;
case 'x':
tmp*=10;
break;
case 'i':
break;
}
ans[i]+=tmp;
tmp=0;
}
}
}
int a=ans[0]+ans[1];
int s[4];
for(int i=0;i<4;i++){
s[i]=a%10;
a/=10;
}
for(int i=0;i<4;i++){
if(s[3-i]!=0){
if(s[3-i]==1)
printf("%c",f[i]);
else
printf("%d%c",s[3-i],f[i]);
}
}
puts("");
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct Node{
int key;
Node *prev, *next;
};
Node *nil;
void init(){
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key){
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = nil->next;
nil->next->prev = x;
nil->next = x;
x->prev = nil;
}
Node* listSearch(int key){
Node *cur = nil->next;
while(cur != nil && cur-> key != key){
cur = cur->next;
}
return cur;
}
void deleteNode(Node *t){
if(t == nil) return;
t->prev->next = t->next;
t->next->prev = t->prev;
free(t);
}
void deleteFirst(){
deleteNode(nil->next);
}
void deleteLast(){
deleteNode(nil->prev);
}
void deleteKey(int key){
deleteNode(listSearch(key));
}
void printList(){
Node *cur = nil->next;
while(cur != nil){
cout << cur->key;
if(cur->next != nil) cout << " ";
cur = cur->next;
}
cout << endl;
}
int main(void){
int n, key;
char command[20];
init();
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%s", command);
if(command[0] == 'i'){
scanf("%d", &key);
insert(key);
}else if(command[0] == 'd' && command[6] == '\0'){
scanf("%d", &key);
deleteKey(key);
}else if(command[0] == 'd' && command[6] == 'F'){
deleteFirst();
}else if(command[0] == 'd' && command[6] == 'L'){
deleteLast();
}
}
printList();
return 0;
} | 0 | 90,351,537 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
#include<stdio.h>
using namespace std;
typedef struct{
int x,y;
}p;
char a[1005][1005];
p acm[11];
p s,g;
int b[1005][1005];
int H,W,N;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int bfs(p s,p g)
{
queue<p> q;
p n;
memset(b,-1,sizeof(b));
q.push(s);
b[s.x][s.y]=0;
while(!q.empty())
{
p h;
h=q.front();
q.pop();
if(h.x==g.x&&h.y==g.y)
{
break;
}
for(int i=0;i<4;i++)
{
n.x=h.x+dx[i];
n.y=h.y+dy[i];
if(n.x>=0&&n.x<H&&n.y>=0&&n.y<W&&a[n.x][n.y]!='X'&&b[n.x][n.y]==-1)
{
q.push(n);
b[n.x][n.y]=b[h.x][h.y]+1;
}
}
}
return b[g.x][g.y];
}
int main()
{
int i,j,t,step=0;
scanf("%d%d%d",&H,&W,&N);
for(i=0;i<H;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<H;i++)
for(j=0;j<W;j++)
{
if(a[i][j]>='1'&&a[i][j]<='9')
{
t=a[i][j]-'0';
acm[t].x=i;
acm[t].y=j;
}
else if(a[i][j]=='S')
{
s.x=i;
s.y=j;
a[i][j]='.';
}
}
for(i=1;i<=N;i++)
{
g.x=acm[i].x;
g.y=acm[i].y;
step+=bfs(s,g);
s.x=g.x;
s.y=g.y;
a[g.x][g.y]='.';
}
printf("%d\n",step);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(true){
string S;
cin >> S;
if( S == "0")
break;
int sum = 0;
for(auto& c : S){
sum += c - '0';
}
cout << sum << endl;
}
return 0;
} | 0 | 85,688,516 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::endl;}
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; }
const int inf = 1 << 30;
const ll INF = 1LL << 62;
int main(){
int n, k;
cin >> n >> k;
VL x(n), y(n);
vector<pair<ll, ll>> c(n);
rep(i,n){
cin >> x[i] >> y[i];
c[i].first = x[i];
c[i].second = y[i];
}
sort(all(x));
sort(all(y));
ll ans = INF;
for(int xi = 0; xi < n; xi++){
for(int xj = xi+1; xj < n; xj++){
for(int yi = 0; yi < n; yi++){
for(int yj = yi+1; yj < n; yj++){
ll xl = x[xi], xr = x[xj];
ll yl = y[yi], yh = y[yj];
int cnt = 0;
rep(i,n){
bool inx = xl <= c[i].first && c[i].first <= xr;
bool iny = yl <= c[i].second && c[i].second <= yh;
if (inx && iny) cnt++;
}
if (cnt >= k){
ll area = (xr - xl) * (yh - yl);
ans = min(ans, area);
}
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int a[303][303];
int posx[90001];
int posy[90001];
int cost[303][303];
int f(int from,int to){
int fx = posx[from];
int fy = posy[from];
int tx = posx[to];
int ty = posy[to];
return abs(fx-tx) + abs(fy-ty);
}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int h,w,d;
cin >> h >> w >> d;
rep(i,h)rep(j,w){
cin >> a[i][j];
int now = a[i][j];
posx[now] = i;
posy[now] = j;
}
vector<vector<ll>> memo(d+1);
for(int i=1;i<=d;i++){
int start = i;
memo[i].push_back(0);
for(int j=start;j+d<=h*w;j+=d){
memo[i].push_back(memo[start].back()+f(j,j+d));
}
}
int q;
cin >> q;
rep(i,q){
ll ans = 0;
int l,r;
cin >> l >> r;
int type;
if(l%d==0 || r % d == 0)type = d;
else type = l%d;
cout << memo[type][(r-type)/d] - memo[type][(l-type)/d] << endl;
}
} | 0 | 55,993,802 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int a,b;
cin >> a >> b;
if(b==1){
cout << 0 << endl;
}else{
cout << a-b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll pCount(int x){
if(x==0) return 1;
return pCount(x-1)*2 + 1;
}
ll allCount(int x){
if(x==0) return 1;
return allCount(x-1)*2 + 3;
}
signed main() {
int n;
cin >> n;
unordered_map<int,int> even;
unordered_map<int,int> odd;
int v;
for(int i=0;i<n;i++){
cin >> v;
if(i%2==0) even[v]++;
else odd[v]++;
}
multimap<int,int,greater<int>> invEven;
multimap<int,int,greater<int>> invOdd;
for(auto e:even){
invEven.insert(make_pair(e.second,e.first));
}
for(auto o:odd){
invOdd.insert(make_pair(o.second,o.first));
}
int maxCount = 0;
for(auto ie:invEven){
for(auto io:invOdd){
if(ie.second!=io.second){
maxCount = max(maxCount,ie.first+io.first);
break;
}
}
}
if(maxCount==0)maxCount=n/2;
cout << n-maxCount << endl;
return 0;
} | 0 | 30,000,412 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<string> T={"dream","dreamer","erase","eraser"};
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){
reverse(T.at(i).begin(),T.at(i).end());
}
bool all_cut=true;
for(int i=0;i<S.size();){
bool cut=false;
for(int j=0;j<4;j++){
string U=S.substr(i,T.at(j).size());
if(U==T.at(j)){
i+=T.at(j).size();
cut=true;
break;
}
}
if(!cut){
all_cut=false;
break;
}
}
if(all_cut){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int H, W; cin >> H >> W;
vector<string> ss(H);
for (int i = 0; i < H; ++i) cin >> ss[i];
vector<bool> br(H, true), bc(W, true);
for (int r = 0; r < H; ++r) {
for (int c = 0; c < W; ++c) {
if (ss[r][c] == '#') {
br[r] = false, bc[c] = false;
}
}
}
for (int r = 0; r < H; ++r) {
if (br[r]) continue;
for (int c = 0; c < W; ++c) {
if (bc[c]) continue;
cout << ss[r][c];
}
cout << endl;
}
} | 0 | 15,216,225 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI =3.14159265358979323846;
const ll M=1e9+7;
const ll inf=1e18;
const ll ms=2e5+5;
fast;
ll n,m,c,ans;
bool compare(ll &a,ll &b)
{
return ((a-1)%10+1)>((b-1)%10+1);
}
void solve()
{
vector<ll> ar(5);
for(int i=0;i<5;i++)
cin>>ar[i];
sort(ar.begin(),ar.end(),compare);
for(int i=0;i<5;i++)
{
ans=ceil(ans*1.0/10)*10+ar[i];
}
cout<<ans<<endl;
}
int main()
{
{
solve();
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
long long n = 50;
long long k; cin >> k;
long long a = k / n;
long long b = k % n;
vector<long long> ans(n, a + n - 1);
for(long long i = 0; i < b; i++){
for(long long j = 0; j < n; j++){
if(i == j){
ans[j] += n;
}else{
ans[j]--;
}
}
}
cout << n << endl;
for(int i = 0; i < n-1; i++){
cout << ans[i] << " ";
}
cout << ans[n-1] << endl;
return 0;
} | 0 | 63,458,389 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod = 1000000007;
int main() {
int N;
cin>>N;
vector<int>B(N-1);
int sum=0;
for(int i=0;i<N-1;i++){
cin>>B[i];
if(i==0){sum+=B[i];}
else{sum+=min(B[i],B[i-1]);}
}
sum+=B[N-2];
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
void solve()
{
ll N;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> xa = a;
sort(xa.begin(), xa.end());
xa.erase(unique(xa.begin(), xa.end()), xa.end());
for (int i = 0; i < N; i++) {
a[i] = (ll)(lower_bound(xa.begin(), xa.end(), a[i]) - xa.begin());
}
vector<ll> imos(xa.size() + 1);
for (int i = 0; i < N; i++) {
imos[0]++;
imos[a[i] + 1]--;
}
for (int i = 0; i < xa.size(); i++)
imos[i + 1] += imos[i];
vector<ll> ans(N);
vector<pll> p;
for (int i = 0; i < N; i++) {
if (p.empty())
p.push_back({ a[0], i });
if (p[p.size() - 1].first < a[i])
p.push_back({ a[i], i });
}
ll sum = 0;
ll idx = 0;
for (int i = 0; i < xa.size(); i++) {
if (i == 0) {
sum += xa[i] * imos[i];
} else {
sum += (xa[i] - xa[i - 1]) * imos[i];
}
if (p[idx].first == i) {
ans[p[idx].second] = sum;
sum = 0;
idx++;
}
}
for (int i = 0; i < N; i++) {
cout << ans[i] << endl;
}
}
int main(void)
{
cin.tie(0);
ios_base::sync_with_stdio(false);
solve();
return 0;
} | 0 | 6,795,146 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
int main() {
ll N;
cin >>N;
ll n = sqrt(N)+1;
ll max=1;
rep2(i,n){
if((N%i) == 0){
max = i;
}
}
ll ans = max + N/max -2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
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;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
for(auto &e:t) fill_v(e,v);
}
const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD) a -= MOD;
}
void mulM(long long &a, long long b) {
a = ((a%MOD)*(b%MOD))%MOD ;
}
long myPow(long a,long b,int M) {
long ret = 1;
long tmp = a;
while(b>0) {
if((b&1)==1) ret = (ret * tmp) % M;
tmp = (tmp * tmp) % M;
b = b>>1;
}
return ret;
}
int nCk(int n,int k,int M) {
long ret = 1;
int mi = min(k, n-k);
for(int i=1;i<=mi;i++) {
ret = (ret * myPow(i,M-2,M)) % M;
}
for(int i=n-mi+1;i<=n;i++) {
ret = (ret * i) % M;
}
return (int)ret;
};
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int main() {
int H,W;
cin >> H >> W;
string ans="";
REP(i,H) REP(j,W){
string s;
cin >> s;
if(s=="snuke"){
ans = (char)('A'+j);
ans += to_string(i+1);
}
}
pl(ans)
return 0;
} | 0 | 23,266,976 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0;i < N;i++)
cin >> A.at(i);
double ans = 0,goukei = 0;
for(int i = 0;i < N;i++){
goukei += 1 / (double)A.at(i);
}
ans = 1 / goukei;
printf("%.12f\n",ans);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n;
ll a[N], p[62];
void insert(ll x) {
for(int i = 60; i >= 0; i--) {
if(x >> i & 1) {
if(!p[i]) {
p[i] = x;
break;
}
x ^= p[i];
}
}
}
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> n;
ll all = 0;
for(int i = 1; i <= n; i++) cin >> a[i], all ^= a[i];
for(int i = 0; i <= 60; i++) {
if(all >> i & 1) {
for(int j = 1; j <= n; j++) {
if(a[j] >> i & 1) a[j] -= (1ll << i);
}
}
}
for(int i = 1; i <= n; i++) insert(a[i]);
ll ans = 0;
for(int i = 60; i >= 0; i--) {
if((p[i]!=0)&&((ans&(1ll<<i))==0))
{
ans=p[i]^ans;
}
}
cout << ans + (ans ^ all);
return 0;
} | 0 | 50,902,865 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int P , Q , R , S ;
cin >> P >> Q >> R ;
S = fmin(P , fmax(Q , R));
Q = fmin( Q , R);
cout << S + Q << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
int ans;
if(H%3==0 || W%3==0) ans=0;
else if(H==2 && W==2) ans=1;
else{
int pall = min(H, W);
int triH = max({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)})-min({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)});
int triW = max({W/3*H, (W-W/3)*(H/2), (W-W/3)*((H+1)/2)})-min({W/3*H, (W-W/3)*(H/2), (W-W/3)*((H+1)/2)});
int traH = max({(H+2)/3*W, (H-(H+2)/3)*(W/2), (H-(H+2)/3)*((W+1)/2)})-min({(H+2)/3*W, (H-(H+2)/3)*(W/2), (H-(H+2)/3)*((W+1)/2)});
int traW = max({(W+2)/3*H, (W-(W+2)/3)*(H/2), (W-(W+2)/3)*((H+1)/2)})-min({(W+2)/3*H, (W-(W+2)/3)*(H/2), (W-(W+2)/3)*((H+1)/2)});
ans =min({pall, triH, triW, traH, traW});
}
cout << ans << endl;
} | 0 | 7,498,015 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
using PPI=pair<P,int>;
ll const mod=998244353;
const ll MAX=200000;
using vi=vector<int>;
using vl=vector<ll>;
using vc=vector<char>;
using vd=vector<double>;
using vs=vector<string>;
using vp=vector<P>;
using vb=vector<bool>;
using vvi =vector<vector<int>>;
using vvd=vector<vector<double>>;
using vvc=vector<vector<char>>;
using vvp =vector<vector<P>>;
using vvb=vector<vector<bool>>;
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
ll gcd(ll a,ll b){
if(b==0)return a;
return gcd(b,a%b);
}
int main(){
int n;
cin>>n;
vl t(n);
rep(i,n)cin>>t[i];
ll tmp=0;
ll lcm=1;
rep(i,n){
tmp=gcd(t[i],lcm);
lcm/=tmp;
lcm*=t[i];
}
cout<<lcm<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N,M;
cin >>N>>M;
vector<int>a(M),b(M),c(M);
rep(i,M){
cin>>a.at(i)>>b.at(i)>>c.at(i);
a.at(i)--;
b.at(i)--;
}
vector<vector<int>>d(N,vector<int>(N));
rep(i,N){
rep(j,N){
if(i==j){
d.at(i).at(j)=0;
}
else{
d.at(i).at(j)=1001001001;
}
}
}
rep(i,M){
d.at(a.at(i)).at(b.at(i))=c.at(i);
d.at(b.at(i)).at(a.at(i))=c.at(i);
}
for(int k = 0; k < N; k++) {
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
d[i][j] =min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int ans=M;
rep(i,M){
bool ex=false;
rep(j,N){
if(d.at(j).at(a.at(i))+c.at(i)==d.at(j).at(b.at(i))){
ex=true;
}
}
if(ex){
ans--;
}
}
cout<<ans<<endl;
} | 0 | 24,795,730 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
ll n;
ll cnt = 0;
ll base = 5;
cin >> n;
if(n % 2 == 1){
cout << 0 << endl;
return 0;
}
n /= 2;
while(base <= n){
cnt += (n / base);
base *= 5;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <ctype.h>
using namespace std;
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
#define TR ","
#define fi first
#define se second
#define rep(i,N) for(int i=0;i<(int)N;++i)
#define all(v) v.begin(), v.end()
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y) * y;
}
ll waz = 76543217;
ll inv(ll x) {
if (x == 1) { return 1; }
if (x == 0) { return 0; }
else {
ll a = (waz - inv(waz % x) * (waz / x)) % waz;
if (a >= 0) { return a; }
else { return waz + a; }
}
}
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
vector<ll> p;
ll phi(ll x) {
ll a = x;
ll b = x;
for (ll k = 0; k != p.size(); ++k) {
if (a % p[k] == 0) {
while (a % p[k] == 0) {
a /= p[k];
}
b = b / p[k] * (p[k] - 1);
}
if (a == 1) { break; }
}
return b;
}
bool my_compare(pair<string, int> a, pair<string, int> b) {
if (a.first != b.first) {
return a.first < b.first;
}
if (a.second != b.second) {
return a.second > b.second;
}
else {
return true;
}
}
int main()
{
IO;
int N; cin >> N;
vi d(N);
rep(i, N) cin >> d[i];
sort(d.begin(), d.end());
cout << d[N / 2] - d[N / 2 - 1] << endl;
} | 0 | 22,321,481 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
using namespace std;
#define ALL(X) X.begin(),X.end()
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD=1000000007;
const int INTMAX=2147483647;
const ll LLMAX=9223372036854775807;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin>>N;
vll a(N);
for(ll i=0;i<N;i++){
cin>>a[i];
a[i]--;
}
ll ans=0;
for(ll i=0;i<N;i++){
if(a[i]>i && a[a[i]]==i)ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
map<P, ll> dis{};
int N;
vector<vector<int>> tunagari(0, vector<int>(0, 0));
vector<ll> Ans(0);
void dfs(int sectionid, int beforeid) {
for (int i = 0; i<tunagari[sectionid].size(); i++) {
int a = tunagari[sectionid][i];
int sec = sectionid;
if (a == beforeid) continue;
Ans[a] = Ans[sectionid] + dis[P(sectionid, a)];
dfs(a, sectionid);
}
}
int main() {
cin >> N;
tunagari.resize(N);
Ans.resize(N);
REP(i, N - 1) {
int a, b, c;
cin >> a >> b >> c, a--, b--;
dis[P(a, b)] = c;
dis[P(b, a)] = c;
tunagari[a].push_back(b);
tunagari[b].push_back(a);
}
int Q, K;
cin >> Q >> K, K--;
Ans[K] = 0;
dfs(K, -1);
REP(i, Q) { int x, y;
cin >> x >> y,x--,y--;
cout << Ans[x] + Ans[y] << endl;
}
} | 0 | 34,200,809 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define REP(var, a, b) for (int var = (a); var < (b); var++)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define ALL(c) (c).begin(), (c).end()
#define rALL(c) (c).rbegin(), (c).rend()
ll MOD = 1000000007;
const ll INF = 1LL << 62;
bool can(vl& xs, ll x) {
vector<bool> dp(40001, false);
dp[20000] = true;
for (auto& dx : xs) {
vector<bool> ndp(40001, false);
rep(i, 40001) {
if (dp[i]) {
if (i - dx >= 0) ndp[i - dx] = true;
if (i + dx < 40001) ndp[i + dx] = true;
}
}
dp = ndp;
}
return dp[20000 + x];
}
int main() {
string s;
cin >> s;
int n = s.size();
ll X, Y;
cin >> X >> Y;
bool xmove = true;
bool first = true;
vl dx, dy;
ll cnt = 0;
rep(i, s.size()) {
if (s[i] == 'F') {
cnt++;
} else {
if (xmove) {
if (first) {
first = false;
X -= cnt;
} else {
dx.push_back(cnt);
}
} else {
dy.push_back(cnt);
}
xmove = !xmove;
cnt = 0;
}
}
if (cnt > 0) {
if (xmove) {
if (first) {
X -= cnt;
} else {
dx.push_back(cnt);
}
} else {
dy.push_back(cnt);
}
}
if (can(dx, X) && can(dy, Y)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <list>
#include <string>
#include <cmath>
#include <stack>
#include <cstdio>
#include <fstream>
#include <climits>
#include <set>
#include <vector>
#include <tuple>
#include <cstring>
#include <functional>
#include <utility>
#include <iomanip>
using namespace std;
#define endl '\n'
#define f(k,a,b) for(int k=(a);k<(b);++k)
#define vi vector <int>
#define vvi vector <vector <int> >
#define vii vector <pair <int, int > >
#define int long long
#define lli long long
#define pii pair <int,int>
#define piii pair< pair<lli,lli>, lli >
#define fsd fflush(stdout);
#define pb(x) push_back(x)
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ret return
const int fix = (int)1e9 + 7;
int po2(lli a){double temp = a;if(log2(temp)==(int)log2(temp))return log2(temp);return -1;}
void tc(int i){cout<<"Case #"<<i+1<<": ";}
void yes(){cout<<"YES"<<endl;}
void no(){cout<<"NO"<<endl;}
void impb(){cout<<"IMPOSSIBLE"<<endl;}
int ct(){int t;scanf("%lld",&t);return t;}
int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}
int pwr(int a, int b){ int x=1, y=a; while(b>0){if(b%2) x = (x*y)%fix; y=(y*y)%fix; b/=2;} return x;}
int pmodinv(int a){return pwr(a,fix-2);}
vvi adj;
const int N = 1e5+5;
bool visited[N]= {};
queue <int> q;
int comanc(int u, int v,int parent[]){
while(u^v){
if(u==1||v==1)
return 1;
u = parent[u];
v = parent[v];
}
return u;
}
int x;
int max(int a, int b){
if (a>b)
return a;
return b;
}
vector <int> factorial((int)4002);
int nCr(int n, int k){
return (factorial[n]*((pmodinv(factorial[k])*pmodinv(factorial[n-k]))%fix))%fix;
}
int dsu_par[N];
int sze[N];
void make_set(int n){
f(j,1,n+1){
dsu_par[j]=j;
sze[j]=1;
}
}
int find_set(int a){
if(dsu_par[a]==a)
return a;
return dsu_par[a] = find_set(dsu_par[a]);
}
void union_set(int a, int b){
a = find_set(a);
b = find_set(b);
if (a^b) {
if (sze[a] < sze[b])
swap(a, b);
dsu_par[b] = a;
sze[a] += sze[b];
}
}
map <pii, int> mp;
vvi up;
vi tin, tout;
int dfs_timer=0;
int lim;
int dist[N]={};
void _dfs(int v, int par){
tin[v] = ++dfs_timer;
up[v][0] = par;
f(j,1,lim+1)
up[v][j] = up[up[v][j-1]][j-1];
for(int u:adj[v]){
if(u^par){
dist[u] = dist[v] + mp.find(pii(u,v))->second;
_dfs(u,v);
}
}
tout[v] = ++dfs_timer;
}
bool is_anc(int u, int v){ return tin[u] <= tin[v] && tout[u] >= tout[v];}
int lca(int u, int v){
if(is_anc(u,v))
return u;
if(is_anc(v,u))
return v;
for(int i=lim;i>=0;i--)
if(is_anc(up[u][i],v)^1)
u = up[u][i];
return up[u][0];
}
int min(int a,int b){if(a<b)ret a;ret b;}
int nn;
int bisearch(int w, int h, int limit){
int lo = 1, hi = limit;
while(lo<hi){
int mid = lo + (hi-lo)/2;
if((mid)/max(w,h)>=nn||log2((long double)(mid/h))+log2((long double)(mid/w))>=log2((long double)(nn)))
hi = mid;
else
lo = mid +1;
}
return lo;
}
int p,f;
int S,W;
int s,w;
int ans(int para){
}
int32_t main() {
int t=1;
f(ii,0,t){
int h,w,m;
vi H,W;
cin>>h>>w>>m;
H.assign(h+1,0), W.assign(w+1,0);
multimap <int,int> bomb;
int mah = 0, maw = 0;
map <int,int> store;
f(j,0,m){
int a,b;
cin>>a>>b;
bomb.insert(pii(a,b));
H[a]++;
mah = max(mah, H[a]);
W[b]++;
maw = max(maw, W[b]);
}
int cnth = 0, cntw = 0;
f(j,1,w+1){
if(W[j] == maw)cntw++;
}
f(j,1,h+1){
if(H[j]==mah)cnth++;
}
int ans = maw + mah - 1;
int cnt = 0;
for(auto it: bomb){
if((H[it.first]==mah&&W[it.second]==maw)){
cnt++;
}
}
if(cnt<cntw*cnth){
ans++;
}
cout<<ans<<endl;
}
ret 0;
} | 0 | 51,635,812 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n)
{
int ipt;
cin >> ipt;
a[i] = ipt - (i + 1);
}
sort(a.begin(), a.end());
int ans = 0;
if (n % 2 == 1)
{
ans = a[n / 2];
}
else
{
ans = (a[(n / 2) - 1] + a[n / 2]) / 2;
}
ll total = 0;
rep(i, n)
{
total += abs(a[i] - ans);
}
cout << total << endl;
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 100000007;
using Graph = vector<vector<int>>;
int main(){
int A,B;
cin >> A >> B;
int ans = -1;
for(int p = 1; p < 2000;++p){
int a = p*2;
a/=25;
int b = p/10;
if(a==A&&b==B){
ans = p;
break;
}
}
cout << ans << endl;
} | 0 | 62,848,749 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(b <= c || a >= d) cout << 0 << endl;
else cout << min(b, d) - max(a, c) << endl;
} | #include<bits/stdc++.h>
#include<tuple>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;vector<ll>v[100005];
cin>>n>>m;map<ll,ll>pos;
ll p[m+1],y[m+1];
for(int i=1;i<=m;i++){
cin>>p[i]>>y[i];
v[p[i]].push_back(y[i]);
}
for(int i=1;i<=n;i++){
sort(v[i].begin(),v[i].end());
for(int j=0;j<v[i].size();j++){
pos[v[i][j]]=j+1;
}
}
for(int i=1;i<=m;i++){
if(p[i]>=0&&p[i]<=9){cout<<"00000"<<p[i];}
else if(p[i]>=10&&p[i]<=99){cout<<"0000"<<p[i];}
else if(p[i]>=100&&p[i]<=999){cout<<"000"<<p[i];}
else if(p[i]>=1000&&p[i]<=9999){cout<<"00"<<p[i];}
else if(p[i]>=10000&&p[i]<=99999){cout<<"0"<<p[i];}
else if(p[i]>=100000&&p[i]<=999999){cout<<p[i];}
if(pos[y[i]]>=0&&pos[y[i]]<=9){cout<<"00000"<<pos[y[i]];}
else if(pos[y[i]]>=10&&pos[y[i]]<=99){cout<<"0000"<<pos[y[i]];}
else if(pos[y[i]]>=100&&pos[y[i]]<=999){cout<<"000"<<pos[y[i]];}
else if(pos[y[i]]>=1000&&pos[y[i]]<=9999){cout<<"00"<<pos[y[i]];}
else if(pos[y[i]]>=10000&&pos[y[i]]<=99999){cout<<"0"<<pos[y[i]];}
else if(pos[y[i]]>=100000&&pos[y[i]]<=999999){cout<<pos[y[i]];}
cout<<endl;
}
} | 0 | 52,683,993 |
#include<iostream>
using namespace std;
int main(){
int a;
int b;
int c;
int y = 0;
cin >> a;
cin >> b;
cin >> c;
for (int x = a; x <= b; ++x){
if (c % x == 0){
++y;
}
}
cout << y << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
cin >> str;
int y, m;
y = stoi(str.substr(0,4));
m = stoi(str.substr(5,2));
if(y < 2019){
cout << "Heisei" << endl;
}else if(y > 2019){
cout << "TBD" << endl;
}else{
if(m <= 4){
cout << "Heisei" << endl;
}else if(m > 4){
cout << "TBD" << endl;
}
}
} | 0 | 53,979,559 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, D, X, s{}, A; cin >> N >> D >> X;
while (N--) cin >> A, s += (D - 1) / A + 1;
cout << s + X;} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <boost/multiprecision/cpp_int.hpp>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = std::pair<ll, ll>;
using namespace boost::multiprecision;
constexpr ll INF = 1ll<<60;
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 S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll N;
ll A[100010];
cpp_int r[100010];
int main()
{
std::cin >> N;
rep( i, N+1 )
std::cin >> A[i];
cpp_int rb = 1;
rep( i, N+1 )
{
rb -= A[i];
r[i] = rb;
if( (rb <= 0 && i != N) || (rb < 0 && i == N) )
{
std::cout << -1 << std::endl;
return 0;
}
rb *= 2;
}
ll ans = A[N];
ll p = A[N];
repd( i, N )
{
ll mi = std::min( p, (ll)r[i] )+A[i];
ans += mi;
p = mi;
}
std::cout << ans << std::endl;
return 0;
} | 0 | 28,014,825 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
string S;
cin>>S;
int a=S.size();
for(int i=a; 0<i; i--){
if(i!=a){
if(i%2==0){
bool t=true;
rep(j,i/2){
if(S[j]!=S[j+i/2]){
j+=i;
t=false;
}
}
if(t==true){
cout<<i<<endl;
break;
}
}
else{
continue;
}
}
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dp[1000000];
int INF = 1001001001;
int main() {
int N; cin >> N;
rep(i, N+1){
dp[i] = i;
}
for (int i = 0; i < N; i++){
int now6 = 6;
while(now6 <= N){
dp[i+now6] = min(dp[i+now6], dp[i] + 1);
now6 *= 6;
}
int now9 = 9;
while(now9 <= N){
dp[i+now9] = min(dp[i+now9], dp[i] + 1);
now9 *= 9;
}
}
cout << dp[N] << endl;
return 0;
} | 0 | 88,402,032 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using uintl = unsigned long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a) - 1; i >= (intl)(b); i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define debug(x) cout << #x << ":" << x << endl
#define pb push_back
#define mp make_pair
#define pii pair<intl,intl>
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld EPS = 1.0e-14;
const ld 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; }
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
intl fact(intl k){ intl a = 1; for(int i = 2; i <= k; i++){ a *= i; } return a; }
intl digit10(intl a){ intl b = 0; do{ a /= 10; b++; }while(a); return b; }
signed main(){
cout << fixed << setprecision(10);
intl n;
cin >> n;
intl a[n];
intl b[n];
rep(i,n)cin >> a[i];
rep(i,n)cin >> b[i];
intl cnt = 0;
intl ans = 0;
intl sub[n];
m0(sub);
rep(i,n){
if(a[i] < b[i]){
cnt += (b[i] - a[i]);
ans++;
}
else sub[i] = (a[i] - b[i]);
}
sort(sub, sub + n, greater<>());
intl add = 0;
rep(i,n){
if(cnt <= add){
cout << ans << endl;
return 0;
}
add += sub[i];
ans++;
}
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
cout << 6 - A - B << '\n';
return 0;
} | 0 | 32,380,685 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n) cout<<fixed<<setprecision(n)
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define sort(a) sort(all(a))
#define uniq(a) sort(a);(a).erase(unique(all(a), (a).end())
#define reverse(a) reverse(all(a))
#define ctos(c) string(1, (c))
#define out(d) cout << (d)
#define outl(d) std::cout<<(d)<<"\n"
#define YES() cout << "YES" << endl
#define NO() cout << "NO" << endl
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define ceil(x, y) ((x + y - 1) / (y))
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << '\n'
#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){ cerr << #v << "[" << _ << "] : " << v[_] << '\n'; }
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
void solve() {
int n, m, k; cin >> n >> m >> k;
for (int a = 0; a <= n; a++) {
for (int b = 0; b <= m; b++) {
if (a * m + b * n - 2 * a * b == k) {
Yes();
return;
}
}
}
No();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
srand((unsigned)time(NULL));
fix(12);
solve();
} | #include <algorithm>
#include <iostream>
#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 main() {
string O, E;
cin >> O >> E;
if (O.size() == E.size()) {
for (int i = 0; i < O.size(); ++i) {
cout << O[i] << E[i];
}
cout << endl;
} else {
for (int i = 0; i < O.size()-1; ++i) {
cout << O[i] << E[i];
}
cout << O[O.size() - 1] << endl;
}
return 0;
} | 0 | 91,117,305 |
#include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
ll a[100005],b[100005];
void solve(){
ll n,res=0;
cin>>n;
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=n;i++)
cin>>b[i];
for(ll i=1;i<=n;i++)
if(a[i]>b[i])
res-=a[i]-b[i];
else
res+=(b[i]-a[i])/2;
if(res>=0)
cout<<"Yes";
else
cout<<"No";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w", stdout);
#endif
clock_t z=clock();
ll qc=1;
for(ll i=1;i<=qc;i++){
solve();
}
debug("Total Time:%.4Lf\n",(ld)(clock()-z)/CLOCKS_PER_SEC);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
struct UnionFind{
vector<int> d;
UnionFind(int n): d(n,-1){}
int root(int x){
if(d[x] <0)return x;
return d[x] = root(d[x]);
}
int unite(int x,int y){
x = root(x),y = root(y);
if(x == y) return false;
if(d[x] < d[y])swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int n){
return -d[root(n)];
}
};
int main()
{
int n,m;
cin >> n >> m;
vector<int> p(n);
rep(i,n)cin >> p[i];
UnionFind uf(n);
rep(i,m){
int x,y;
cin >> x >> y;
x--;y--;
uf.unite(x,y);
}
int ans = 0;
rep(i,n){
if(uf.root(i) == uf.root(p[i]-1))ans++;
}
cout << ans << endl;
return 0;
} | 0 | 61,544,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
cin >> n;
vector<int> A(n);
for (int i = 1; i <= n; ++i) {
cin >> a;
A[i-1] = a - i;
}
sort(A.begin(), A.end());
int b = A[n/2];
long long res = 0;
for (int i = 0; i < n; ++i) {
res += abs(A[i]-b);
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
long r = 0;
long g = 0;
long b = 0;
for(int i=0;i<s.length();i++){
if(s[i] == 'R')r++;
else if(s[i]=='G')g++;
else b++;
}
long tmp = r*g*b;
int maxLen = s.length();
for(int i=1;i<4000;i++){
for(int j=0;j<maxLen;j++){
if(j+i+i >= maxLen)break;
if(s[j] != s[j+i] && s[j] != s[j+i+i] && s[j+i] != s[j+i+i])tmp--;
}
}
cout << tmp << endl;
} | 0 | 54,936,644 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T, class U>T rem(T a, U b) { return a - b*floor(a/b); }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N, K;
cin >> N >> K;
vll A(N);
rep(i, 0, N) cin >> A[i];
map<ll, ll> mp;
rep(i, 0, N) {
mp[A[i]]++;
}
vector<pll> tmp;
for (auto el : mp) {
tmp.push_back(pll{el.second, el.first});
}
sort(all(tmp));
ll ans = 0;
if (len(tmp) <= K) {
cout << 0 << endl;
return 0;
} else {
rep(i, 0, len(tmp)-K) {
ans += tmp[i].first;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r)
{
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
template <typename T, T N>
class UnionFind {
T parent_[N];
T rank_[N];
T size_[N];
public:
UnionFind();
T Root(T idx);
bool IsSame(T x, T y);
void Unite(T x, T y);
T GetSize(T idx);
};
template <typename T, T N>
UnionFind<T, N>::UnionFind()
{
for (T i = 0; i < N; i++) {
parent_[i] = i;
rank_[i] = 0;
size_[i] = 1;
}
}
template <typename T, T N>
T UnionFind<T, N>::Root(T idx)
{
return parent_[idx] == idx ? idx : parent_[idx] = Root(parent_[idx]);
}
template <typename T, T N>
bool UnionFind<T, N>::IsSame(T x, T y)
{
return Root(x) == Root(y);
}
template <typename T, T N>
void UnionFind<T, N>::Unite(T x, T y)
{
x = Root(x);
y = Root(y);
if (x == y) {
return;
}
if (rank_[x] < rank_[y]) {
parent_[x] = y;
size_[y] += size_[x];
} else {
parent_[y] = x;
size_[x] += size_[y];
if (rank_[x] == rank_[y]) {
rank_[x]++;
}
}
}
template <typename T, T N>
T UnionFind<T, N>::GetSize(T idx)
{
return size_[Root(idx)];
}
long long pow_mod(long long n, long long p, long long m)
{
if (p == 0) {
return 1;
}
if (p % 2 == 0) {
long long t = pow_mod(n, p / 2, m);
return t * t % m;
}
return n * pow_mod(n, p - 1, m) % mod;
}
long long nCr_mod(long long n, long long r)
{
long long x = 1;
for (long long i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
long long a = 1;
for (long long i = 1; i <= r; i++) {
a *= i;
a %= mod;
}
long long y = pow_mod(a, mod - 2, mod) % mod;
return x * y % mod;
}
bool is_prime(long long n)
{
if (n == 1) {
return false;
}
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
bool is_leap(long long y)
{
return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}
void next_day(long long& y, long long& m, long long& d)
{
d++;
if (d > last_days[m - 1] + (m == 2 && is_leap(y) ? 1 : 0)) {
d = 1;
m++;
}
if (m > 12) {
y++;
m = 1;
}
}
long long fib(long long n)
{
long long a = 0, b = 1;
for (int i = 0; i < n; i++) {
long long t = a;
a = b;
b = a + t;
}
return a;
}
template <typename T>
std::vector<size_t> calculate_ranks(const std::vector<T>& v)
{
std::vector<T> sorted = v;
std::sort(sorted.begin(), sorted.end());
std::map<T, long long> m;
for (auto i = 0LU; i < v.size(); i++) {
m.insert(std::make_pair(sorted[i], i));
}
std::vector<size_t> rank(v.size());
for (auto i = 0LU; i < v.size(); i++) {
rank[i] = m.find(v[i])->second + 1;
}
return rank;
}
std::map<long long, long long> prime_factors_and_num(long long n)
{
std::map<long long, long long> m;
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
return m;
}
inline long long calculate_sum(const std::vector<long long>& v)
{
return std::accumulate(v.begin(), v.end(), 0LL);
}
int main()
{
long long n;
std::cin >> n;
std::string s;
std::cin >> s;
std::vector<long long> d(n + 1, 0);
long long min = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + (s[i] == '(' ? 1 : -1);
min = std::min(min, d[i + 1]);
}
for (int i = 0; i < -min; i++) {
putchar('(');
}
std::cout << s;
for (int i = 0; i < d[n] - min; i++) {
putchar(')');
}
} | 0 | 66,463,467 |
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int mxN = 1e5 + 5;
int color[mxN], red[mxN], green[mxN];
int main() {
int n, m, r, g, c;
cin >> n >> m >> r >> g >> c;
for(int i = 0; i < r; ++i)
cin >> red[i];
for(int i = 0; i < g; ++i)
cin >> green[i];
for(int i = 0; i < c; ++i)
cin >> color[i];
sort(red, red + r, greater<int>());
sort(green, green + g, greater<int>());
sort(color, color + c, greater<int>());
long long ans = 0;
priority_queue<int> pq;
vector<int> v;
for(int i = 0; i < n; ++i)
v.push_back(red[i]);
for(int i = 0; i < m; ++i)
v.push_back(green[i]);
for(int i = 0; i < c; ++i)
v.push_back(color[i]);
sort(v.begin(), v.end(), greater<int>());
for(int i = 0; i < n + m; ++i)
ans += v[i];
cout << ans;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
#define MAX_N 100000
vector<vi> g(MAX_N);
vi used(MAX_N,-1);
bool x;
void dfs(int now){
rep(i,g[now].size()){
int ne = g[now][i];
if(used[ne]==used[now])x = false;
if(used[ne]==-1){
used[ne] = 1 - used[now];
dfs(ne);
}
}
}
int main(void) {
int n, m;
cin >> n >> m;
rep(i,m){
int u, v;
cin >> u >> v;
u--,v--;
g[u].push_back(v);
g[v].push_back(u);
}
ll a=0,b=0,c=0;
rep(i,n)if(used[i]==-1){
used[i] = 0;
if(g[i].size()==0){
a++;
}else{
x = true;
dfs(i);
if(x)b++;
else c++;
}
}
cout << 2*b*b + 2*b*c + c*c + a*a + 2*a*(n-a) << endl;
} | 0 | 10,120,902 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
ll binomialCoeff(ll n, ll k)
{
ll C[k+1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (ll i = 1; i <= n; i++)
{
for (ll j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j-1];
}
return C[k];
}
int n,m,r;
vector <int> towns;
vector <vector <int> > dist;
vector <vector <int> > g;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
n=nxt();m=nxt();r=nxt();
towns.resize(r);
generate(all(towns),nxt);
vector <int> r1;
r1.resize(n+1,1e9);
dist.resize(n+1,r1);
for(int i=1;i<=n;i++)
dist[i][i]=0;
for(int i=0;i<m;i++)
{
int u=nxt(),v=nxt(),c=nxt();
dist[u][v]=dist[v][u]=c;
}
for (int k = 1; k <=n; k++)
{
for (int i = 1; i <=n; i++)
{
for (int j = 1; j <=n; j++)
{
if (dist[i][k] + dist[k][j] < dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
int tot=1;
for(int i=2;i<=r;i++)
tot*=i;
int test=INT_MAX;
for(int i=0;i<tot;i++)
{
int temp=0;
for(int i=0;i<r-1;i++)
temp+=dist[towns[i]][towns[i+1]];
if(temp<test)
test=temp;
next_permutation(all(towns));
}
cout<<test<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n-1; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
template<typename T>
ll sz(vector<T> &vec){ return (ll)vec.size(); }
ll sz(string &s){ return (ll)s.size(); }
ll gcd(ll a,ll b){ return ((!b) ?a :gcd(b, a%b)); }
int main(){
ll l,r;
cin >> l >> r;
if(abs(r-l) > 2019) cout << 0 << endl;
else{
ll ans = 2018;
rep(i,l,r+1){
rep(j,i+1,r+1){
ans = min(ans,(i*j)%2019);
}
}
cout << ans << endl;
}
return 0;
} | 0 | 86,780,481 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int a,b;cin >> a >> b;
cout << a*a-b << endl;
} | #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;
vector<ld> x(n);
ves u(n);
ld sum = 0;
rep(i,n){
cin >> x[i] >> u[i];
if(u[i]=="BTC") x[i] *=380000.0;
sum += x[i];
}
cout << fixed << setprecision(5) << sum <<endl;
return 0;
} | 0 | 47,328,866 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[1001][1001],n,m,mod=1e9+7;
char a[1001][1001];
int call(int i,int j){
if(i>=n || j>=m || a[i][j]=='#')
return 0;
if(i==n-1 && j==m-1)
return 1;
if(dp[i][j]!=-1)
return dp[i][j];
int res=(call(i+1,j)+call(i,j+1))%mod;
return dp[i][j]=res;
}
int main(){
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
memset(dp,-1,sizeof(dp));
cout<<call(0,0)<<endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include <fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using vb = vector<bool>;
using mll = map<ll, ll>;
using sll = stack<ll>;
#define REP(i,n) for(ll i(0);(i)<(n);(i)++)
#define rep(i,n) for(ll i(0);(i)<(n);(i)++)
#define ALL(a) a.begin(), a.end()
#define enld endl
const ll INF = 1LL << 60;
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; }
struct TopologicalSort{
vector<vll> G;
TopologicalSort(ll N){ G.resize(N); }
void add_edge(ll a, ll b) { G[a].push_back(b); }
bool visit_by_dfs(vll &order, vll &color, ll v) {
color[v] = 1;
for(auto u: G[v]) {
if(color[u] == 2) continue;
if(color[u] == 1) return false;
if(!visit_by_dfs( order, color, u)) return false;
}
order.push_back(v);
color[v] = 2;
return true;
}
bool sort(vll &order) {
ll n = G.size();
vll color(n, 0);
REP(u, n) if( !color[u] && !visit_by_dfs(order, color, u)) return false;
reverse(order.begin(), order.end());
return true;
}
};
int main(){
ll N, M; cin >> N >> M;
TopologicalSort st(N);
REP(_, M){
ll u, v; cin >> u >> v;
st.add_edge(u, v);
}
vll order;
st.sort(order);
REP(i, N) cout<< order[i] << endl;
return 0;
} | 0 | 28,442,219 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> using ord_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ll x, y;
cin >> x >> y;
if (abs(x - y) <= 1) cout << "Brown";
else cout << "Alice";
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
int N;
cin >> N;
vector<int> vec(10000010,0);
rep(i,10000000)
{
vec[N] ++;
if(vec[N]==2)
{
cout << i + 1 << endl;
return 0;
}
if(N%2==0)
{
N /= 2;
}
else
{
N *= 3;
N += 1;
}
}
return 0;
} | 0 | 57,284,564 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int o = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a.size(); j++) {
if (i != j) {
if (a[i] == a[j]) {
o++;
}
}
}
}
if (o == 0) {
cout << "yes" << endl;
}
else {
cout << "no" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define SCD(t) scanf("%d",&t)
#define SCLD(t) scanf("%ld",&t)
#define SCLLD(t) scanf("%lld",&t)
#define SCC(t) scanf("%c",&t)
#define SCS(t) scanf("%s",t)
#define SCF(t) scanf("%f",&t)
#define SCLF(t) scanf("%lf",&t)
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define foreach(i, a) for(auto i: a)
#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(A, B, C) assert( B <= A && A <= C)
#define mp make_pair
#define pb push_back
#define end "\n"
#define endl "\n"
#define inf (int) (1e9 + 7)
#define epsi 1e-9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define read(type) readInt<type>()
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
#define left tuyiuoi
#define right fgjhk
#define ss second
#define ff first
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) rep(i, l, r) cout << a[i] << " "; cout << endl
#define Flag(n) cout << "here " << n << endl
const double pi=acos(-1.0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<ll, ll> pll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int main() {
io;
string s;
cin>>s;
int count = 0;
for(int i=0;i<s.length();i++){
if(s[i]=='x'){
count++;
}
}
if (count>7){
cout<<"NO"<<endl;
}
else
cout<<"YES";
return 0;
} | 0 | 7,257,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int count = 0;
for (int i = 0; i < N-1; i++) {
for (int j = i+1; j < N; j++) {
count += d.at(i)*d.at(j);
}
}
cout << count << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
int n,k;
cin >> n >> k;
ll a[n+1];
a[0]=0;
for(int i=0;i<n;i++)cin >> a[i+1];
ll sum[n+1]={};
sum[0]=0;
vector<ll> v;
for(int i=0;i<n;i++)sum[i+1]=sum[i]+a[i+1];
for(int i=1;i<=n;i++){
for(int j=0;j<=i-1;j++){
v.push_back(sum[i]-sum[j]);
}
}
ll ans=0;
vector<ll> temp;
for(int i=40;i>=0;i--){
int cnt=0;
temp.clear();
for(int j=0;j<v.size();j++){
if (v[j] & (1ll<<i)){
cnt++;
temp.push_back(v[j]);
}
}
if(cnt>=k){
ans+=(1ll<<i);
v.swap(temp);
}
}
cout << ans << endl;
return 0;
} | 0 | 26,764,607 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,k;cin>>n>>k;
cout<< (k==1? 0 :(n-k) );
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a <= 8 && a >= 0 && b <= 8 && b >= 0)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | 0 | 40,674,463 |
#include<bits/stdc++.h>
using namespace std;
string s;
char a[10][10];
int sum;
int ans;
int main()
{
int h,w,k;cin>>h>>w>>k;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>a[i][j];
if(a[i][j]=='#')
{
sum++;
}
}
}
int cnt=0;
for(int i=0;i<(1<<h);i++)
{
for(int j=0;j<(1<<w);j++)
{
cnt=0;
for(int x=0;x<h;x++)
{
for(int y=0;y<w;y++)
{
if(((i&(1<<x))||(j&(1<<y)))&&a[x][y]=='#')cnt++;
}
}
if(cnt==sum-k)
{
ans++;
}
}
}
cout<<ans;
} | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector< pair<int,int> > vii;
const double pi = 2*acos(0) ;
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define sq(a) (a)*(a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z,x) cout<<"Case "<<z<<": "<<x<<"\n"
int main()
{
string a,b,s;
cin>>a;
cin>>b;
int x = a.size();
int y = b.size();
int n = min(x,y);
for0(i,n){
s += a[i];
s += b[i];
}
if(x>y) s+=a[x-1];
else if(y>x) s+=b[y-1];
cout<<s<<nw;
return 0;
} | 0 | 15,445,375 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
using VB = vector<bool>;
using VVB = vector<VB>;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define RREP(i,m,n) for(int i=(m);i>=(n);i--)
int main(){
int n,m;
cin >> n >> m;
VI a(m),b(m),sign(n+1,-1);
VVI g(n+1, VI());
REP(i,0,m){
cin >> a[i] >> b[i];
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
queue<PII> q;
q.push(make_pair(1,0));
while(!q.empty()){
PII cur = q.front();
q.pop();
int x = cur.first;
int y = cur.second;
for(int z : g[x]){
if(sign[z] == -1){
q.push(make_pair(z,x));
sign[z] = x;
}
}
}
cout << "Yes" << endl;
REP(i,2,n+1){
cout << sign[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
const ll inf=1e9;
int main(void){
int n,m,R;cin>>n>>m>>R;
vector<int> r(R);
rep(i,R){
cin>>r[i];
r[i]--;
}
sort(r.begin(),r.end());
vector<vector<ll>> t(n,vector<ll>(n,inf));
rep(i,m){
int a,b;ll c;cin>>a>>b>>c;a--;b--;
t[a][b]=t[b][a]=c;
}
rep(i,n)t[i][i]=0;
rep(k,n)rep(i,n)rep(j,n)chmin(t[i][j],t[i][k]+t[k][j]);
ll res=1e18;
do{
ll buf=0;
rep(i,R-1)buf+=t[r[i+1]][r[i]];
chmin(res,buf);
}while(next_permutation(r.begin(),r.end()));
cout<<res<<endl;
} | 0 | 89,342,571 |
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <tuple>
using namespace std;
using ii = pair < int, int >;
using ti = tuple < int, int, int>;
using lint = long long;
const int N = 105;
int a[N];
vector < int > v;
bool c[N];
int n;
int mx;
bool rem() {
sort(v.begin(), v.end());
auto t = v.end();
t--;
mx = *t;
for (int i = 0; i <= mx; i++) {
int val;
val = max(mx - i, i);
bool o = false;
for (int i = 0; i < n; i++) {
if (!c[i] && v[i] == val) {
c[i] = true;
o = true;
break;
}
}
if (!o)return false;
}
return true;
}
bool chk() {
if (n == mx-1)return true;
int lb = mx / 2 + mx % 2 + 1;
int ub = mx;
for (size_t i = 0; i < n; i++) {
if (c[i])continue;
if (v[i] < lb || ub < v[i]) {
return false;
}
}
return true;
}
#define Ia
int main() {
#ifdef I
freopen("in.txt", "r", stdin);
#endif
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
v.push_back(a[i]);
}
if (rem()) {
if (chk()) {
puts("Possible");
}
else {
puts("Impossible");
}
}
else {
puts("Impossible");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define add(x) accumulate(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
int main(){
ll t=1;
while(t--){
ll n;
cin>>n;
int arr[n];
vll vec(21,0);
rep(i,0,n)
cin>>arr[i];
ll ans=0,l=0;
rep(i,0,n){
ll k=arr[i],p=0;
while(k){
if(k&1)
vec[p]++;
++p;
k>>=1;
}
rep(j,0,20){
if(vec[j]>1){
rep(r,l,i){
k=arr[r],p=0;
while(k){
if(k&1)
vec[p]--;
++p;
k>>=1;
}
++l;
if(vec[j]==1)
break;
}
}
}
ans+=(i-l+1);
}
cout<<ans<<'\n';
}
} | 0 | 89,942,999 |
#include <bits/stdc++.h>
#define dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<
using namespace std;
void NO() {
cout << "-1\n";
exit(0);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> leaves(n + 1);
for (int &x : leaves) {
cin >> x;
}
if (n == 0) {
cout << (leaves[0] == 1 ? "1" : "-1") << endl;
return 0;
}
if (leaves[0] != 0) NO();
vector<int64_t> suff(n + 1);
for (int i = n - 1; i >= 0; --i) {
suff[i] = suff[i + 1] + leaves[i + 1];
}
vector<int64_t> internal(n + 1);
internal[0] = 1;
for (int d = 1; d <= n; ++d) {
internal[d] = min(2 * internal[d - 1] - leaves[d], suff[d]);
if (internal[d] < 0) NO();
}
int64_t ans = 0;
for (int i = 0; i <= n; ++i) {
ans += internal[i] + leaves[i];
}
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int main()
{
map<char, int> mp;
mp['r'] = 0;
mp['p'] = 1;
mp['s'] = 2;
int n, k, val[3], ans = 0;
string s;
cin >> n >> k >> val[2] >> val[1] >> val[0] >> s;
vector<int> prev(n, 1);
for (int i = 0; i < n; i++)
{
if (i - k >= 0 && s[i] == s[i - k] && !prev[i - k]) continue;
ans += val[mp[s[i]]];
prev[i] = 0;
}
cout << ans << "\n";
} | 0 | 3,322,565 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N>>T;
int t[N];
for(int i=0;i<N;i++){
cin>>t[i];
}
int ans=T;
for(int i=0;i<N-1;i++){
if(t[i+1]-t[i]<T){
ans+=t[i+1]-t[i];
}
else{
ans+=T;
}
}
cout<<ans<<endl;
} | #include <stdio.h>
#include <string.h>
int main(int argc, const char * argv[]) {
char str[1000][33]={};
int strId[1000]={};
char strTmp[33]={};
int i, j, l = 0;
int mt=0;
int cm=0;
int mm=0;
char ch;
for(i=0;i<1000;i++){
scanf("%c", &ch);
if(ch==' '||ch=='\n'){
strTmp[l]='\0';
for(j=0;strcmp(str[j],"\0")!=0;j++){
if(0==strcmp(str[j], strTmp)){
l=0;
break;
}
}
strcpy(str[j], strTmp);
strId[j]++;
l=0;
if(ch=='\n'){
break;
}
}else{
strTmp[l]=ch;
l++;
}
}
for(i=0;strcmp(str[i],"\0")!=0;i++){
if(mt<strId[i]){
mt=strId[i];
}
}
for(i=0;strcmp(str[i],"\0")!=0;i++){
if(mt==strId[i]){
printf("%s ",str[i]);
}
}
for(i=0;strcmp(str[i],"\0")!=0;i++){
cm=(int)strlen(str[i]);
if(mm<cm){
mm=cm;
}
}
for(i=0;strcmp(str[i],"\0")!=0;i++){
if(mm==strlen(str[i])){
printf("%s\n",str[i]);
}
}
return 0;
} | 0 | 67,241,246 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> arr(n, vector<int>(3));
for(int i = 0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for(int i=1;i<n;i++){
for(int j=0;j<3;j++){
for(int k =0;k<3;k++){
if(j==k) continue;
dp[i][j] = max(dp[i][j], dp[i-1][k] + arr[i][j]);
}
}
}
int ans = -1;
for(int j=0;j<3;j++){
ans = max(ans, dp[n-1][j]);
}
cout<<ans<<endl;
} | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main()
{
map<long long, long long> pp, p;
long long m, n, a, s = 0, ss = 0, i;
string ks;
cin >> m >> n;
while (n--)
{
cin >> a >> ks;
if (ks[0] == 'W' && p[a] == 0)
pp[a]++;
else if (ks[0]=='A')
p[a]++;
}
for (i = 1; i <= m; i++)
{
if (p[i] > 0)
{
s++;
ss += pp[i];
}
}
cout << s << " " << ss;
} | 0 | 53,962,390 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
vector<long long int>a(200000);
long long int n,c=-1,ans=0;
cin>>n;
for(long long int i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),greater<>());
for(long long int i=0;i<n;i++){
if(a[i]!=a[i+1]){
if(a[i]>i-c){
ans+=(i-c);
}
else{
ans+=(i-c-a[i]);
}
c=i;
}
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; ++i) {
for (int j = 1; j < 10 ; ++j) {
cout << i;
cout << 'x';
cout << j;
cout << '=';
cout << i * j;
cout << endl;
}
}
return 0;
} | 0 | 46,975,895 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define all(x) (x).begin(), (x).end()
#define sf(a) scanf("%d",&a)
#define llsf(a) scanf("%lld", &a)
#define l l
#define r r
#define lch (o << 1)
#define rch (o << 1 | 1)
#define mid ((l + r) >> 1)
#define mem(x, y) memset(x, y, sizeof(x))
const int inf = 2e9 + 7;
const ll INF = INT64_MAX;
double eps = 1e-6;
int mod = 1e9 + 7;
const int N = 1e6 + 10;
const double pi = acos(-1.0);
int main() {
#ifdef local
freopen("in.txt", "r", stdin);
#endif
char s[5]; cin >> s;
f(i, 0, 2)if (s[i] == '1') {
s[i] = '9';
}
else s[i] = '1';
cout << s;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <functional>
#include <map>
#include <queue>
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> n(4);
REP(i, 4){
cin >> n[i];
}
sort(n.begin(), n.end());
if(n[0] == 1 && n[1] == 4 && n[2] == 7 && n[3] == 9){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
} | 0 | 49,275,037 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0;
cin >> n;
vector<long> a(n),b(n);
set<long> x;
for(long i=0;i<n;i++) {
cin >> a[i];
b[i]=a[i];
}
sort(b.begin(),b.end());
for(long i=0;i<n;i+=2) x.insert(b[i]);
for(long i=1;i<n;i+=2) if(x.count(a[i])) ans++;
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
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();}
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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll N,ans=0;
cin>>N;
ll A[N],CNT[200010];
REP(i,200010) CNT[i]=0;
REP(i,N){
cin>>A[i];
CNT[A[i]]++;
}
REP(i,200010){
ans+=CNT[i]*(CNT[i]-1)/2;
}
ans++;
REP(i,N) co(ans-CNT[A[i]]);
return 0;
} | 0 | 44,155,942 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x) BEGIN(x), END(x)
#define PAIR make_pair
#define VEC(type) vector<type >
#define FOR(i, A, B) for(auto i = (A);i != (B); i++)
#define FORD(i, A, B) for(auto i = (A);i != (B); i--)
#define READRANGE(begin, end) FOR(it, begin, end) cin >> *it
#define READVEC(V) READRANGE(BEGIN(V), END(V))
using namespace std;
typedef long long lint;
typedef pair<int, int> Pii;
typedef pair<int, lint> Pil;
typedef pair<lint, lint> Pll;
typedef pair<lint, int> Pli;
void io_init()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
int main(int argc, char **argv)
{
io_init();
int N, K;
cin >> N >> K;
VEC(int) V(N);
READVEC(V);
int ret = 0;
FOR(l, 0, N + 1)
FOR(r, 0, N + 1)
if (l + r <= min(K, N)) {
VEC(int) taken;
FOR(i, 0, l)
taken.push_back(V[i]);
FOR(i, 0, r)
taken.push_back(V[N - 1 - i]);
sort(ALL(taken));
int best = 0, ops = K - l - r;
for(int v : taken) {
if (v < 0 && ops > 0) {
ops--;
}
else best += v;
}
ret = max(ret, best);
}
cout << ret << endl;
return 0;
}; | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define watch(x) cout << "["<<(#x) << " is " << (x) << "]" << endl
void watchVecI(vector<int>a){
for(int i = 0; i < a.size(); ++i){
cout << a[i] << " ";
}
cout << endl;
}
void watchVecS(vector<string>a){
for(int i = 0; i < a.size(); ++i){
cout << a[i] << " ";
}
cout << endl;
}
void watchVecC(vector<char>a){
for(int i = 0; i < a.size(); ++i){
cout << a[i];
}
cout << endl;
}
long double binets(double n){
long double first = (1+sqrt(5.0))/2.0;
long double second = (1-sqrt(5.0))/2.0;
long double third = pow(first,n)-pow(second,n);
return (third/sqrt(5.0));
}
void solve(){
int n;
cin >> n;
int k;
cin >> k;
vector<int>a(n);
for(int i =0 ; i < n; ++i){
cin >> a[i];
}
int ans = 0;
sort(a.begin(), a.end());
for(int i =0 ; i < k; ++i){
ans += a[i];
}
cout << ans;
}
int main(){
int t = 1;
while(t--){
solve();
}
return 0;
} | 0 | 67,731,254 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int n, l;
bool comp (string x, string y) {
return x+y<y+x;
}
int main() {
cin >> n >> l;
vector<string> s(n);
rep(i,n) cin >> s.at(i);
sort(s.begin(), s.end(), comp);
string ans = "";
ans.reserve(n*l);
rep(i,n) ans += s.at(i);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
int main() {
int n;
cin >> n;
vector<pr > Q;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
Q.push_back({ a,i });
}
sort(Q.begin(), Q.end());
for (pr p : Q) {
cout << p.second+1<<' ';
}
return 0;
} | 0 | 93,837,035 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;
int main(){
int h,w;
cin >> h >> w;
int a,b;
cin >> a >> b;
int ans[1005][1005];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(i<b && j<a){
ans[i][j] = 1;
} else if (i < b && j >= a){
ans[i][j] = 0;
} else if (i >= b && j < a){
ans[i][j] = 0;
}else{
ans[i][j] = 1;
}
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << ans[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
long long int A, B, K; cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 != 0) A--;
B += A / 2;
A /= 2;
}
else {
if (B % 2 != 0) B--;
A += B / 2;
B /= 2;
}
}
printf("%lld %lld", A, B);
} | 0 | 64,847,366 |
#include <iostream>
#include <cmath>
using namespace std;
int s;
void com(int c,int p[100],int a,int b){
if(c==a){
int m = 0;
for(int i=1;i<=a;i++) m += p[i];
if(b==m) s++;
}
else{
for(int i=p[c]+1;i<=min(9,b-p[c]);i++){
p[c+1] = i;
com(c+1,p,a,b);
}
}
}
int main(){
int a,b;
while(1){
cin >> a >> b;
if(a+b==0) break;
s = 0;
int p[100];
p[0] = -1;
com(0,p,a,b);
cout << s << endl;
}
} | #include <bits/stdc++.h>
#define int long long
#define For(i,a,b) for (int i = a; i <= (b); ++i)
#define For2(i,a,b) for (int i = a; i >= (b); --i)
#define test int _t; cin >> _t; while (_t--)
#define pii pair<int, int>
#define mpii map<int, int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define sz(a) (int)a.size()
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define INF 2147483647
#define EPS 1e-9
using namespace std;
const int MAXN = (1 << 18) + 5;
int a[MAXN], ans[MAXN];
multiset<int, greater<int> > s[MAXN];
multiset<int, greater<int> > two_last(multiset<int, greater<int> > f) {
int p = 0;
if (sz(f) <= 2) return f;
multiset<int, greater<int> > res;
for (int i: f) {
if (++p == 3) break;
res.insert(i);
}
return res;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifdef FILEOPEN
freopen("input.in", "r", stdin);
freopen("input.out", "w", stdout);
#endif
int n;
cin >> n;
For(i,0,(1 << n) - 1) cin >> a[i];
For(i,0,(1 << n) - 1) {
s[i].insert(a[i]);
}
For(bit,0,n - 1) {
For(x,0,(1 << n) - 1) {
if (!(x & (1 << (bit)))) {
int f = (x | (1 << bit));
for (auto i: s[x]) s[f].insert(i);
s[f] = two_last(s[f]);
}
}
}
ans[0] = -INF;
For(k,1,(1 << n) - 1) {
int sum = 0;
for (int i: s[k]) sum += i;
ans[k] = max(ans[k - 1], sum);
cout << ans[k] << endl;
}
} | 0 | 42,353,678 |
#include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int x,y;
cin >> x;
cin >> y;
printf("%d %d %.5lf",x/y,x%y,(double)x/y);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
string s;
vector<string> a(0);
for(int i=0; i<H; i++)
{
cin >> s;
for(int j=0; j<W; j++)
if(s[j]!='.'){
a.push_back(s);
break;
}
}
for(int j=0; j<W; j++){
int wi=0;
for(int i=0; i<(int)a.size(); i++)
if(a[i][j]=='.')
wi++;
if(wi==(int)a.size())
for(int i=0; i<(int)a.size(); i++)
a[i][j]=0;
}
for(auto i:a){
for(auto j:i)
if(j!=0) cout << j;
cout << endl;
}
} | 0 | 19,690,441 |
#include<iostream>
#include<vector>
using namespace std;
bool check(vector<int> u, int x)
{
for(int i=0;i<u.size();i++)
{
if(u[i]<x)
return false;
}
return true;
}
int main()
{
int n,flag=0,y,m,x,ans=INT_MAX;
cin>>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<=m;j++)
{
if(j==0)
cin>>c[i];
else
cin>>a[i][j-1];
}
}
int tot=1<<n;
int cost;
for(int mask=0;mask<tot;mask++)
{
vector<int> u(m,0);
cost=0;
for(int i=0;i<n;i++)
{
if((mask&(1<<i))!=0)
{
cost+=c[i];
for(int j=0;j<m;j++)
u[j]+=a[i][j];
}
}
if(check(u,x))
{
flag=1;
ans=min(ans,cost);
}
}
if(flag==0)
cout<<-1;
else
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
for(int i=0; i<M; i++) cin >> a[i] >> b[i];
vector<int> cnt(N+1, 0);
for(int i=0; i<M; i++)
{
cnt[a[i]]++;
cnt[b[i]]++;
}
string ans = "YES";
for(auto num : cnt)
{
if(num%2==1) ans = "NO";
}
cout << ans << endl;
return 0;
} | 0 | 78,204,746 |
#include <bits/stdc++.h>
const int N=100005,M=20;
using namespace std;
int n,L,q,ar[N],nx[M][N];
int calc(int i){
int l=i,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
if(ar[m]-ar[i]<=L){
ans=m;
l=m+1;
}else{
r=m-1;
}
}
return ans;
}
int kth(int cur,int k){
for(int i=M-1;i>=0;i--){
if(k>=(1<<i)){
k-=(1<<i);
cur=nx[i][cur];
}
}
return cur;
}
int main()
{ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>ar[i];
cin>>L>>q;
for(int i=1;i<=n;i++)nx[0][i]=calc(i);
for(int i=1;i<M;i++){
for(int j=1;j<=n;j++){
nx[i][j]=nx[i-1][nx[i-1][j]];
}
}
while(q--){
int a,b;cin>>a>>b;
if(a>=b)swap(a,b);
int l=1,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
if(kth(a,m)>=b){
ans=m;
r=m-1;
}else{
l=m+1;
}
}
cout<<ans<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define maxN 200005
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
#endif
string s;
cin >> s;
int n = 0;
for (int i = 0; i < s.size(); i++) {
n += (s[i] - '0');
}
if (n % 9) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | 0 | 31,269,512 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int main() {
int n, m, sum = 0, res = 0;
cin >> n >> m;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
rep(i, n) if ((double)a[i] >= (double)sum / (4 * m)) res++;
cout << ((res >= m) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using ll=long long;
using namespace std;
ll mod=10007;
ll i,j,k,l;
vector<ll> dp(200001),cnt(10000);
int main(){
int n,p;cin>>n>>p;
string s;
cin>>s;
cnt.resize(p);
for(i=0;i<200001;i++){dp[i]=0;}
for(i=0;i<p;i++){cnt[i]=0;}
cnt[0]++;
ll pow_ten=1,ans=0;
if(!(p==2 || p==5)){
for(i=s.size()-1;i>=0;i--)
{
dp[i]=(dp[i+1]+(s[i]-'0')*pow_ten)%p;
pow_ten*=10;
pow_ten%=p;
cnt[dp[i]]++;
}
for(i=0;i<p;i++){
ans+=cnt[i]*(cnt[i]-1)/2;
}
}else{
for(i=0;i<s.size();i++)
{
if((int)(s[i]-'0')%p==0){
ans+=(i+1);
}
}
}
cout<<ans<<endl;
return 0;
} | 0 | 75,174,677 |
#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 n;
cin >> n;
vi a(n+1);
rep(i, n+1) cin >> a[i];
int mi = a[n];
vll ma(n+1);
ma[n] = a[n];
repr(i, n) {
mi = (mi + 1) / 2 + a[i];
ma[i] = ma[i+1] + a[i];
}
if (mi > 1) {
cout << -1 << endl;
return 0;
}
ll ans = 1, now = 1;
rep1(i, n) {
now = min(now*2, ma[i]);
ans += now;
now -= a[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec[i];
}
sort(vec.begin(), vec.end());
double ans = 0, tmp;
for (int i = 0; i < N; i++){
tmp = vec[i];
if(i == 0){
tmp /= pow(2, N - 1);
ans += tmp;
}
else{
tmp /= pow(2, N - i);
ans += tmp;
}
}
cout << ans;
} | 0 | 26,966,862 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
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<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
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; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
ll n;
cin >>n;
mes(n*(n-1)/2);
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--; b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> dist(n, INF);
dist[0] = 0;
priority_queue<int> q;
q.push(0);
while (q.size()) {
int u = q.top(); q.pop();
for (int v: g[u]) {
if (chmin(dist[v], dist[u] + 1)) {
q.push(v);
}
}
}
cout << (dist[n-1] == 2 ? "POSSIBLE" : "IMPOSSIBLE") << endl;
} | 0 | 29,874,265 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int prev = 0; long long ans = 0;
for (int i = 0; i < n; i++) {
int t = prev + 1;
int s = v[i] - t;
if (s > 0) {
ans += (s + t-1) / t;
v[i] = 1;
}
prev = max(v[i], prev);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
lli n;
vll p;
mat t;
vll d;
lli depth(lli x){
if(p[x] == -1) return d[x] = 0;
if(d[x]) return d[x];
return d[x] = depth(p[x]) + 1;
}
int main(){
cin >> n;
p = vll(n,-1);
t = mat(n);
d = vll(n);
for(lli i = 0;i < n;i++){
lli node,k;
cin >> node >> k;
for(lli j = 0;j < k;j++){
lli c;
cin >> c;
t[node].push_back(c);
p[c] = node;
}
}
for(lli i = 0;i < n;i++){
cout << "node " << i << ": ";
cout << "parent = " << p[i] << ", ";
cout << "depth = " << depth(i) << ", ";
if(p[i] == -1) cout << "root, ";
else if(t[i].size() == 0) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
for(lli j = 0;j < t[i].size();){
cout << t[i][j];
if(++j < t[i].size()) cout << ", ";
}
cout << "]" << endl;
}
return 0;
} | 0 | 100,304,007 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int dp[1002][1002];
int main(){
int n;cin >> n;
string x, y;
while(n--){
cin >> x >> y;
for(int i = 1;i <= x.size();i++){
for(int j = 1;j <= y.size();j++){
if(x[i-1] == y[j-1])dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}
cout << dp[x.size()][y.size()] << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 50
int v[MAX_N];
int n;
int k;
int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int i;
for(i = 0; i < n; ++i){
cin >> v[i];
}
int j;
for(i = 1; i <= n; ++i){
priority_queue<int, vector<int>, greater<int> > q;
int max_sum = 0;
for(j = 0; j < i; ++j){
max_sum += v[j];
q.push(v[j]);
}
favour_left[i - 1][i] = max_sum;
for(j = i; j < n; ++j){
if(v[j] > q.top()){
max_sum -= q.top();
q.pop();
max_sum += v[j];
q.push(v[j]);
}
favour_left[j][i] = max_sum;
}
}
for(i = 1; i <= n; ++i){
priority_queue<int, vector<int>, greater<int> > q;
int max_sum = 0;
for(j = 0; j < i; ++j){
max_sum += v[n - 1 - j];
q.push(v[n - 1 - j]);
}
favour_right[i - 1][i] = max_sum;
for(j = i; j < n; ++j){
if(v[n - 1 - j] > q.top()){
max_sum -= q.top();
q.pop();
max_sum += v[n - 1 - j];
q.push(v[n - 1 - j]);
}
favour_right[j][i] = max_sum;
}
}
int max_favour = 0;
int p, q;
for(i = 0; i < n; ++i){
for(p = i + 1; p >= 0; --p){
int op_left = i + 1 + (i + 1 - p);
if(op_left > k){
break;
}
max_favour = max(max_favour, favour_left[i][p]);
}
}
for(j = 0; j < n; ++j){
for(q = j + 1; q >= 0; --q){
int op_right = j + 1 + (j + 1 - q);
if(op_right > k){
break;
}
max_favour = max(max_favour, favour_right[j][q]);
}
}
for(i = 0; i < n; ++i){
for(j = 0; j < n && i + j + 1 < n; ++j){
for(p = i + 1; p >= 0; --p){
int op_left = i + 1 + (i + 1 - p);
if(op_left > k){
break;
}
for(q = j + 1; q >= 0; --q){
int op_right = j + 1 + (j + 1 - q);
if(op_left + op_right > k){
break;
}
max_favour = max(max_favour, favour_left[i][p] + favour_right[j][q]);
}
}
}
}
cout << max_favour << '\n';
return 0;
} | 0 | 92,560,749 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X,N){
int c=0;
bool f=true;
rep(i,N){
int y;
cin>>y;
for(;;c++){
if(c>10000){
f=false;
break;
}
if(X==y) break;
X=(A*X+B)%C;
}
X=(A*X+B)%C;
c++;
}
if(f) cout<<c-1<<endl;
else cout<<-1<<endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<iomanip>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
int N, K; cin >> N >> K;
int tmp, cnt;
long double ans=0.0, t;
for(int i=1; i<=N; i++){
tmp = i;
t = 1.0/N;
while(tmp < K){
tmp *= 2;
t *= 0.5;
}
ans += t;
}
cout << std::fixed << std::setprecision(15) << ans;
} | 0 | 61,785,011 |
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> divisor(int64_t n){
vector<int64_t> div;
for(int64_t i=1;i*i<= n;++i) {
if(n%i==0) {
div.push_back(i);
if(i*i!=n) div.push_back(n/i);
}
}
sort(begin(div),end(div));
return (div);
}
int main(){
int64_t N;
cin>>N;
vector<int64_t> d;
d=divisor(N);
int64_t sum=0;
for(int i=0;i<d.size();++i){
int64_t m=(N/d[i])-1;
if(d[i]<m){
sum +=m;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N;
cin >> N;
vll A(N);
rep(i, 0, N) cin >> A[i];
set<ll> s;
rep(i, 0, N) s.insert(A[i]);
if (even(len(s))) {
cout << len(s) - 1 << endl;
} else {
cout << len(s) << endl;
}
} | 0 | 32,128,175 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#define pii pair<int,int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[]={0,0,+1,-1};
int fy[]={+1,-1,0,0};
using namespace std;
const int maX=1e5+1;
vector<ll>Graph[maX],cost[maX];
ll visit[maX];
ll x[10];
ll y[10];
int main()
{
ll n,i,j;
ll ara[3];
cin>>ara[0]>>ara[1]>>ara[2];
sort(ara,ara+3);
cout<<ara[0]+ara[1];
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
const int INF = 1000000000;
const int MOD = 1000000007;
int ans = INF;
vector<int> l;
int A,B,C;
int N;
void rec(int a,int b,int c,int n,int cnt_a,int cnt_b,int cnt_c){
if(n == N){
if(a > 0 && b > 0 && c > 0)ans = min(ans,10 * (cnt_a+cnt_b+cnt_c-3) + abs(A-a)+abs(B-b)+abs(C-c));
return;
}
rec(a+l[n],b,c,n+1,cnt_a+1,cnt_b,cnt_c);
rec(a,b+l[n],c,n+1,cnt_a,cnt_b+1,cnt_c);
rec(a,b,c+l[n],n+1,cnt_a,cnt_b,cnt_c+1);
rec(a,b,c,n+1,cnt_a,cnt_b,cnt_c);
}
int main(){
cin >> N >> A >> B >> C;
l.resize(N);
for(int i = 0;i < N;i++)cin >> l[i];
rec(0,0,0,0,0,0,0);
cout << ans << endl;
} | 0 | 3,011,678 |
#include<iostream>
using namespace std;
string s;
int a,n;
int main(){
cin>>n>>s>>a;
for(register int i=0;i<n;i++){
if(s[i]!=s[a-1])cout<<'*';
else cout<<s[i];
}
} | #include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
ll n;cin>>n;
ll cnta =0,cntb =0,cntba =0, out=0;
for(ll i=0;i<n;++i){
string s;cin>>s;
if(s[0]=='B'&&s[s.size()-1]=='A'){
++cntba;
} else if(s[0]=='B'){
++cntb;
} else if(s[s.size()-1]=='A') {
++cnta;
}
for(int j=0;j<s.size()-1;++j)if(s.substr(j,2) == "AB")++out;
}
out += max(0LL, cntba-1);
if(cntba>0){
if(cntb>0){
++out;
--cntb;
}
if(cnta>0){
++out;
--cnta;
}
}
out += min(cnta,cntb);
cout << out << endl;
return 0;
} | 0 | 99,384,243 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
n++;
vector<int> a(n);
for(int i=0; i<n; i++) cin>>a[i];
vector<ll> dep_ub(n);
ll lb = a[n-1], ub = a[n-1];
dep_ub[n-1] = ub;
for(int i=n-2; i>=0; i--){
lb = (lb + 1) / 2 + a[i];
ub = ub + a[i];
dep_ub[i] = ub;
}
if(!(lb <= 1 && 1 <= ub)){
cout << -1 << endl;
return 0;
}
ll cur = 1, ans = 1;
for(int i=1; i<n; i++){
cur = min(cur * 2, dep_ub[i]);
ans += cur;
cur -= a[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<bool> from1(N, false), fromN(N, false);
rep(i, M) {
cin >> a >> b;
if (a == 1) from1[b] = true;
if (b == N) fromN[a] = true;
}
rep(i, N) {
if (from1[i] && fromN[i]) {
cout << "POSSIBLE\n";
return 0;
}
}
cout << "IMPOSSIBLE\n";
} | 0 | 56,498,257 |