code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
string N;
int S = 0;
cin >> N;
for (int i = 0; i < N.size(); i++)
S += N[i] - '0';
cout << ((S % 9 != 0) ? "No" : "Yes") << endl;
return (0);
} | #include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef pair<ll, ll> pa;
typedef vector<ll> vc;
typedef vector<pa> vp;
typedef vector<vc> vvc;
int mpow(int base, int exp);
void ipgraph(ll n,ll m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vc g[N];
int main() {
FAST;
ll t, i, j, k, p, q, r, x, y, u, v, n, m;
string s;
cin>>s;
ll sum=0;
Ff(i,0,s.size())
{
sum+=(s[i]-'0');
}
if(sum%9)
cout<<"No";
else
cout<<"Yes";
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(ll n, ll m){
int i, u, v;
while(m--){
cin>>u>>v;
g[u-1].pb(v-1);
g[v-1].pb(u-1);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
} | 1 | 12,816,187 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
map<int, set<int>> routes;
int ans = 0;
int N;
void search(int position, vector<bool> reached, int depth)
{
if (reached.at(position))
{
return;
}
reached.at(position) = true;
if (depth == N)
{
ans++;
return;
}
for (int next_position : routes[position])
{
int next_depth = depth + 1;
vector<bool> reached2;
copy(reached.begin(), reached.end(), back_inserter(reached2));
search(next_position, reached2, next_depth);
}
}
int main()
{
int M;
cin >> N >> M;
vector<int> a(M);
vector<int> b(M);
rep(i, M) cin >> a.at(i) >> b.at(i);
rep(i, M)
{
a.at(i)--;
b.at(i)--;
}
rep(i, M)
{
routes[a.at(i)].insert(b.at(i));
routes[b.at(i)].insert(a.at(i));
}
vector<bool> reached(N, false);
search(0, reached, 1);
cout << ans << 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>;
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
Graph G(n);
rep(i,m){
int a, b;
cin >> a >> b;
--a; --b;
G[a].push_back(b);
G[b].push_back(a);
}
int ans=0;
vector<int> v(n-1);
rep(i,n-1) v[i]=i+1;
do {
int pr=0;
for(int i=0; i<n-1; i++){
bool ok=false;
for(auto u : G[pr]){
if(u==v[i]) ok=true;
}
if(ok && i==n-2){
++ans;
}else if(ok && i!=n-2){
pr=v[i];
}else{
break;
}
}
} while(next_permutation(v.begin(),v.end()));
cout << ans << "\n";
return 0;
} | 1 | 96,091,771 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 10000000;
int H, W;
vector<string> grid;
ll solve(){
vector<vector<ll>> dp(H, vector<ll>(W, INF));
if(grid[0][0] == '#') dp[0][0] = 1;
else dp[0][0] = 0;
rep(i, H){
rep(j, W){
for(int dir = 0; dir < 2; dir++){
int next_i = i + dx[dir], next_j = j + dy[dir];
if(next_i >= H || next_j >= W) continue;
int add = 0;
if(grid[next_i][next_j] == '#' && grid[i][j] == '.') add = 1;
dp[next_i][next_j] = min(dp[i][j] + add, dp[next_i][next_j]);
}
}
}
return dp[H-1][W-1];
}
int main(){
cin >> H >> W;
grid.resize(H);
rep(i, H) cin >> grid[i];
cout << solve() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> cnt(h, vector<int>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 && j == 0) {
if (s[0][0] == '#') cnt[0][0] = 1;
} else if (i == 0) {
cnt[i][j] = cnt[i][j - 1] + (s[i][j - 1] == '.' && s[i][j] == '#');
} else if (j == 0) {
cnt[i][j] = cnt[i - 1][j] + (s[i - 1][j] == '.' && s[i][j] == '#');
} else {
cnt[i][j] = cnt[i][j - 1] + (s[i][j - 1] == '.' && s[i][j] == '#');
chmin(cnt[i][j],
cnt[i - 1][j] + (s[i - 1][j] == '.' && s[i][j] == '#'));
}
}
}
cout << cnt[h - 1][w - 1] << '\n';
return 0;
} | 1 | 35,812,807 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define each(i, mp) for(auto& i:mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template<class T>
ostream &operator<<(ostream &out, const vector<T> &list) {
ll n = list.size();
rep(i, n) out << list[i] << ' ';
return out;
}
template<class T>
istream &operator>>(istream &in, vector<T> &list) {
ll n = list.size();
rep(i, n) in >> list[i];
return in;
}
ll factorial(ll n) {
ll ans = 1;
while (n > 1) {
ans *= n;
ans %= mod;
n--;
}
return ans;
}
void solve() {
ll n;
cin >> n;
string s;
cin >> s;
n *= 2;
vector<bool> is_right(n);
rep(i, n) {
if (i % 2 == 0 && s[i] == 'W') is_right[i] = true;
if (i % 2 == 1 && s[i] == 'B') is_right[i] = true;
}
ll ans = 1;
ll left_sum = 0;
rep(i, n) {
if (is_right[i]) {
if (left_sum == 0) {
cout << 0 << '\n';
return;
}
ans *= left_sum;
ans %= mod;
left_sum--;
} else {
left_sum++;
}
}
if (left_sum > 0) cout << 0 << '\n';
else cout << ans * factorial(n / 2) % mod << '\n';
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
solve();
#ifdef MY_DEBUG
}
#endif
return 0;
} | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define ld long double
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int sum (int x) {return x*(x-1)%mod*((mod + 1)/2)%mod;}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, ans = 1, cur = 0;
string s;
cin >> n >> s;
for (char ch: s)
{
if (!cur)
{
if (ch == 'W') {cout << 0; return 0;}
else cur++;
}
else if (cur % 2)
{
if (ch == 'W') cur++;
else ans = ans * cur % mod, cur--;
}
else
{
if (ch == 'W') ans = ans * cur % mod, cur--;
else cur++;
}
}
if (cur) {cout << 0; return 0;}
FOR (i, 1, n) ans = ans*i % mod;
print(ans);
} | 1 | 36,919,643 |
#include<stdio.h>
int main(){
int x,y,i;
for(i=0;i<3000;i++){
scanf("%d %d",&x,&y);
if(x==0&&y==0){
break;
}
if(x<=y){
printf("%d %d\n",x,y);
}else if(x>y){
printf("%d %d\n",y,x);
}
}
return 0;
} | #include<iostream>
using namespace std;
int main (){
int a, b;
while (1){
cin >> a >> b;
if (a == 0 && b == 0) break;
if (a < b){
cout << a << " " << b <<endl;
}
else if (a > b){
cout << b << " " << a << endl;
}
else if (a == b){
cout << a << " " << b << endl;
}
}return 0;
} | 1 | 37,583,921 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<cctype>
using namespace std;
int main(){
char x;
while(1){
scanf("%c", &x);
if ( isalpha(x) ) {
if ( islower(x) ) {
printf("%c", toupper(x));
} else {
if ( isupper(x) ) {
printf("%c", tolower(x));
}
}
} else {
printf("%c",x);
}if(x == '\n' )break;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
char ch='A',x='A';
int k=0;
while(k<1200){
scanf("%c",&ch);
if(ch== '\n')break;
if(isalpha(ch)){
if(islower(ch)){
x=toupper(ch);
}else{
x=tolower(ch);
}
printf("%c",x);
}else{
printf("%c",ch);
}
k+=1;
}
cout<<endl;
return 0;
} | 1 | 98,550,570 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define loop3(i,j,k,a) for(int i=0; i<a; i++)for(int j=0; j<a; j++)if(i!=j)for(int k=0; k<a; k++)if(i!=k&&j!=k)
#define loop4(i,j,k,l,a) for(int i=0; i<a; i++)for(int j=0; j<a; j++)if(i!=j)for(int k=0; k<a; k++)if(i!=k&&j!=k)for(int l=0; l<a; l++)if(i!=l&&j!=l&&k!=l)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define scnd1(a) scanf("%d", &a)
#define scnd2(a,b) scanf("%d%d", &a,&b)
#define scnd3(a,b,c) scanf("%d%d%d", &a,&b,&c)
#define scnd4(a,b,c,d) scanf("%d%d%d%d", &a,&b,&c,&d)
#define cin1(a) cin >> a;
#define cin2(a,b) cin >> a >> b;
#define cin3(a,b,c) cin >> a >> b >> c;
#define cin4(a,b,c,d) cin >> a >> b >> c >> d;
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define prtd1(a) printf("%d\n", a)
#define prtd2(a,b) printf("%d %d\n", a,b)
#define prtd3(a,b,c) printf("%d %d %d\n", a,b,c)
#define prtd4(a,b,c,d) printf("%d %d %d %d\n", a,b,c,d)
#define mem(a,n) memset( a, n, sizeof(a))
#define INF 1000000000
typedef long long ll;
bool visted[100009];
int main() {
int K;
cin >> K;
mem(visted,false);
deque<pair<int,int>> q;
q.push_front({1,1});
while(true) {
pair<int,int> t = q.front(); q.pop_front();
if(visted[t.first]) continue;
visted[t.first] = true;
if(t.first==0){
cout1(t.second);
return 0;
}
q.push_front( { t.first*10%K, t.second} );
q.push_back( { (t.first+1)%K, t.second+1} );
}
} | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const int INF = 1e9;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 20000;
constexpr ll nx[4] = {1,0,-1,0};
constexpr ll ny[4] = {0,1,0,-1};
class Dijkstra{
private:
struct edge{
int to,cost;
};
vector<vector<edge>> G;
vector<int> d;
int siz;
public:
Dijkstra(int n){
G.resize(n);
siz = n;
}
void add_edge(int from,int to,int cost){
G[from].push_back(edge{to,cost});
}
vector<int> dijkstra(int s){
priority_queue<P,vector<P>,greater<P>> q;
d.assign(siz,INF);
d[s] = 0;
q.push(P(0,s));
while(!q.empty()){
P p = q.top();q.pop();
int v = p.second;
if (d[v] < p.first) continue;
for(edge &e:G[v]){
if (chmin(d[e.to],d[v]+e.cost)){
q.push(P(d[e.to],e.to));
}
}
}
return d;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int k;
cin >> k;
Dijkstra g(k);
rep(i,k){
g.add_edge(i,(i+1)%k,1);
g.add_edge(i,10*i%k,0);
}
vector<int> d;
d = g.dijkstra(1);
PRINT(d[0]+1);
} | 1 | 45,593,904 |
#include <cstdio>
int main()
{
char s[13];
scanf("%s", s);
printf("%.*s %.*s\n", 4, s, 8, s + 4);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
string s;
cin >> s;
rep(i, 4) cout << s[i];
cout << ' ';
rep2(i, 4, 12) cout << s[i];
cout << endl;
} | 1 | 30,735,514 |
#include<iostream>
#include<vector>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int N,M;
while(1){
cin>>N>>M;
if(N==0&&M==0) break;
vector<pair<int,int> > PD(N);
unsigned long long prob;
for(int i=0; i<N;i++) {
cin>>PD[i].second>>PD[i].first;
}
sort(PD.begin(),PD.end());
int k=N-1;
while(M>=0 && k>=0){
if (PD[k].second<=M) {
M-=PD[k].second;
PD[k].second=0;
}
else {
PD[k].second-=M;
M=-1;
}
k--;
}
prob=0;
for(int i=0;i<N;i++) prob+=PD[i].first*PD[i].second;
cout<<prob<<endl;
}
return 0;} | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n, m;
cin >> n >> m;
if(n == 0)
return 0;
vector<pair<int, int> > a(n);
for(int i=0; i<n; ++i)
cin >> a[i].second >> a[i].first;
sort(a.rbegin(), a.rend());
int ret = 0;
for(int i=0; i<n; ++i){
ret += max(0, a[i].second - m) * a[i].first;
m -= min(m, a[i].second);
}
cout << ret << endl;
}
} | 1 | 33,392,467 |
#include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstring>
#include<climits>
#include<deque>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> p64;
typedef vector<ll> v64;
const int N = 2 * 1e5 + 10;
const ll inf = 1e18 + 100;
const ll mod = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,s,e) for(long long i=s;i<=e;i++)
#define brep(i,s,e) for(long long i=s;i>=e;i--)
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define DANGER std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
vector<ll> ed[N];
ll val[N] , vis[N];
ll n , q;
void dfs(ll node , ll par , ll vv) {
ll sum = vv;
val[node] += sum;
for(auto i : ed[node]) {
if(i == par) continue;
dfs(i , node , val[node]);
}
}
void solve() {
cin>>n>>q;
for(int i = 0; i < n - 1; i++) {
ll u ,v ;
cin>>u>>v;
ed[u].pb(v);
ed[v].pb(u);
}
for(int i = 0 ; i < q ; i++) {
ll node , vv ;
cin>>node>>vv;
val[node] += vv;
}
dfs(1,-1 , 0);
for(int i = 1; i <= n ; i++) {
cout<<val[i]<<" ";
}
}
int main()
{
DANGER;
ll t = 1;
while(t--) {
solve();
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void transform(vector<vector<int>>& graph, vector<vector<int>>& tree, int parent, int current) {
for (int child : graph[current]) {
if (child != parent) {
tree[current].push_back(child);
transform(graph, tree, current, child);
}
}
}
void add(vector<vector<int>>& tree, vector<int>& counter, int parent_sum, int current) {
counter[current] += parent_sum;
for (int child : tree[current]) {
add(tree, counter, counter[current], child);
}
}
int main() {
int N, Q; cin >> N >> Q;
vector<vector<int>> graph(N);
for (int i = 0; i < N - 1; i++) {
int a, b; cin >> a >> b;
graph[a - 1].push_back(b - 1);
graph[b - 1].push_back(a - 1);
}
int p[Q];
int x[Q];
for (int j = 0; j < Q; j++) {
cin >> p[j] >> x[j];
p[j]--;
}
vector<vector<int>> tree(N);
transform(graph, tree, -1, 0);
vector<int> counter;
counter.assign(N, 0);
for (int i = 0; i < Q; i++) {
counter[p[i]] += x[i];
}
add(tree, counter, 0, 0);
for (int i = 0; i < N; i++) {
cout << counter[i];
if (i < N - 1) cout << " ";
}
cout << endl;
} | 1 | 19,591,467 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i,n) for (long long i = 0; i < (n); ++i)
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
rep(i, N) cin >> A[i] >> B[i];
vector<pair<ll, ll> > works;
rep(i, N) works.push_back(make_pair(B[i], A[i]));
sort(works.begin(), works.end());
map<ll, bool> days;
rep(i, M+1) days.insert(make_pair(i, true));
ll reward = 0;
for(int i = N-1; i >= 0; --i) {
ll daylimit = M - works.at(i).second;
auto iter = days.upper_bound(daylimit);
if (iter != days.begin()) {
iter--;
reward += works.at(i).first;
days.erase(iter);
}
}
cout << reward << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
template < typename T > string tost( const T& n ) { ostringstream stm; stm << n; return stm.str();}
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 const INF = 1001001001;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N,M; cin >> N >> M;
map<int, vi> mp;
rep(i,N) {
int a,b; cin >> a >> b;
mp[a].push_back(b);
}
priority_queue<int> que;
ll ans = 0;
rrep(i,M) {
for(auto x : mp[i]) que.push(x);
if(que.empty()) continue;
ans += que.top();
que.pop();
}
cout << ans << endl;
return 0;
} | 1 | 26,535,768 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a=0,b=0,c=0;
cin>>a>>b>>c;
int d=a-b;
if(d<c){
cout<<c-d<<endl;
}
else if(d>=c){
cout<<'0'<<endl;
}
} | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
return (f) (begin (ALL), end (ALL), ##__VA_ARGS__); \
}) (x)
using namespace std;
using ll = int64_t;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A < B + C ? B + C - A : 0) << endl;
return 0;
} | 1 | 13,678,544 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int d = v[2] - v[1] + v[2] - v[0];
if (v[0] % 2 == v[1] % 2 && v[1] % 2 == v[2] % 2) {
cout << d / 2 << endl;
} else if (v[0] % 2 == v[1] % 2) {
cout << d / 2 << endl;
} else {
cout << d / 2 + 2 << endl;
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
#include <bits/stdc++.h>
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define rrep(i,x) for(long long i=x-1;i>=0;i--)
#define rrepn(i,x) for(long long i=x;i>1;i--)
#define REP(i,n,x) for(long long i=n;i<x;i++)
#define REPN(i,n,x) for(long long i=n+1;i<x;i++)
#define pr printf
#define re return
#define mod 1000000007
#define INF 1e18+5
const double PI=3.14159265358979323846;
#define fi first
#define se second
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
typedef long long int ll;
typedef pair<long long, long long> P;
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;
}
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i*i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i) res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int gcd(const vector<int> &v) {
int ret = v[0];
for (int i = 1; i < v.size(); i++)
ret = gcd(ret, v[i]);
return ret;
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int lcm(const vector<int> &v) {
int ret = v[0];
for (int i = 1; i < v.size(); i++)
ret = lcm(ret, v[i]);
return ret;
}
vector<pair<long long,long long>> g[200020];
ll s[200020];
bool used[200020];
ll A,B,C,D,H,K,M,N,Q,T,W,X,Y;
double dA,dB,dC,dH,dK,dM,dN,dQ,dT,dW,dX,dY;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
long long ans,sum,cnt,cnt1,flg,flg1,flg2;
long long max,max1;
long long min,min1;
long long wk,wk1;
max=max1=wk=wk1=sum=ans=cnt=cnt1=flg1=flg2=0;
min=min1=INF;
double dwk,dwk1,dsum,dsum1,dans,dans1;
dwk=dwk1=dsum=dsum1=dans=dans1=0;
vector<ll>v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(),v.end());
if(v[2]%2==v[1]%2 && v[1]%2==v[0]%2){
pr("%lld",(v[2]-v[0])/2+(v[2]-v[1])/2);
}
else if(v[2]%2!=v[1]%2 && v[1]%2==v[0]%2){
pr("%lld",1+(v[2]-v[0]-1)/2+(v[2]-v[1]-1)/2);
}
else{
if(v[2]%2==v[1]%2){
pr("%lld",(v[2]-v[1])/2+1+((v[2]+1)-v[0])/2);
}
else{
pr("%lld",(v[2]-v[0])/2+1+((v[2]+1)-v[1])/2);
}
}
re 0;
re 0;
} | 1 | 41,802,327 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = int_fast64_t;
using pll = pair<ll,ll>;
constexpr ll INF = 1LL<<60;
constexpr ll MOD = 1e9+7;
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;}
#if loc||local
void dump(){cerr<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cerr<<h<<", ";dump(forward<Ts>(t)...);}
#else
void dump(){}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){}
#endif
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T> ostream &operator<<(ostream& os,vector<T>const& v){for(auto const& vi:v)os<<vi<<" ";return os;}
template<class T,class U> ostream &operator<<(ostream& os,pair<T,U>const& p){os<<p.first<<","<<p.second;return os;}
template<class T>vector<T> vec(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto vec(size_t a, Ts... ts){return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));}
signed main(){
ll n,m,v,p;
cin>>n>>m>>v>>p;
vector<ll> a(n);
cin>>a;
sort(rbegin(a),rend(a));
dump(a);
auto check = [&](ll idx)->ll{
auto b = a;
ll key = a[idx]+m;
rep(i,n){
if(b[i]<=key)b[i]=min(b[i]+m,key);
else if(b[i]>key)b[i]+=m;
}
vector<ll>d(n);
rep(i,n)if(b[i]-a[i]<m)d[i]=m-(b[i]-a[i]);
sort(rbegin(d),rend(d));
ll cnt = 0;
rep(i,n)cnt+=b[i]-a[i];
sort(rbegin(b),rend(b));
auto itr = lower_bound(b.begin(),b.end(),key,greater<>());
int id = itr-begin(b);
dump(cnt,id);
for(int i=0;i+id+1<p;++i){
cnt += d[i];
dump(d[i]);
}
dump(b);dump(d);
dump(a[idx],cnt,id);
return id+1<=p && cnt>=m*v;
};
ll loweq = 0;
ll high = n;
while(high-loweq>1){
ll mid = high+loweq>>1;
if(check(mid))loweq=mid;
else high=mid;
}
cout<<(high)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
int main(){
ll n,m,v,p;
cin>>n>>m>>v>>p;
ll a[n];
for(int i=0;i<n;i++)cin>>a[i];
ll pref[n+1];
pref[0]=0;
sort(a,a+n);reverse(a,a+n);
for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];
int ans=p;
for(int i=p;i<n;i++){
int left=max(v-p-(n-i-1),0LL);
if(a[i]+m>=a[p-1]&&((a[i]+m)*(i-p+1))>=((pref[i]-pref[p-1])+m*left)){
ans++;
}
}
cout<<ans;
} | 1 | 29,209,421 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int n;
cin >> n;
int l,r,ans=0;
for (int i = 0; i < n; i++)
{
cin >> l >> r;
ans += r-l+1;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
ll n,l,r,sum=0;cin>>n;
REP(i,n){
cin>>l>>r;
sum+=r-l+1;
}
cout<<sum<<endl;
return 0;
} | 1 | 48,118,426 |
#include <iostream>
using namespace std;
double area2(const double x[][2]){
double y[3][2];
for(int i = 0; i < 3; i++){
for(int j = 0; j < 2; j++){
y[i][j] = x[i][j];
}
}
for(int i = 0; i < 3; i++){
y[i][0] -= y[2][0];
y[i][1] -= y[2][1];
}
double s = y[0][0]*y[1][1]-y[0][1]*y[1][0];
if(s < 0){
s = -s;
}
return s;
}
bool isIn(double x[][2]){
double x1[][2] = {{x[0][0], x[0][1]}, {x[1][0], x[1][1]}, {x[3][0], x[3][1]}};
double x2[][2] = {{x[0][0], x[0][1]}, {x[2][0], x[2][1]}, {x[3][0], x[3][1]}};
double s = area2(x) - area2(x+1) - area2(x1) - area2(x2);
return !s;
}
int main(){
double x[4][2];
while(cin >> x[0][0]){
cin >> x[0][1];
for(int i = 1; i < 4; i++){
for(int j = 0; j < 2; j++){
cin >> x[i][j];
}
}
if(isIn(x)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
} | #include <iostream>
#include <cmath>
using namespace std;
double mnk(double a,double b,double c){
double s = (a + b + c) / 2;
double S = sqrt(s*(s - a)*(s - b)*(s - c));
return S;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,yp;
while( cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp ){
double a = sqrt(pow(x1-x2,2) + pow(y1-y2,2));
double b = sqrt(pow(x1-x3,2) + pow(y1-y3,2));
double c = sqrt(pow(x3-x2,2) + pow(y3-y2,2));
double S1 = mnk(a,b,c);
double x = sqrt(pow(x1-xp,2) + pow(y1-yp,2));
double y = sqrt(pow(x2-xp,2) + pow(y2-yp,2));
double z = sqrt(pow(x3-xp,2) + pow(y3-yp,2));
double S2 = mnk(x,y,a) + mnk(x,z,b) + mnk(y,z,c);
if ((float)S1 == (float)S2){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
} | 1 | 52,982,927 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define X real()
# define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef complex < ld > point;
const int N = (int)2e5 + 5;
const int inf = (int)1e9 + 7;
int n;
int a[N];
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
scanf("%d", a + i);
}
int cnt = 1, res = 0;
for(int i = 2; i <= n; ++i){
if(a[i] != a[i - 1]){
res += cnt / 2;
cnt = 1;
} else{
++cnt;
}
}
res += cnt / 2;
printf("%d\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,c=0;
cin >> n;
int ar[n];
for(int i=0; i<n; i++){
cin >> ar[i];
}
for(int i=1; i<n;){
if(ar[i]==ar[i-1])c++,i+=2;
else i++;
}
cout << c <<endl;
return 0;
} | 1 | 13,704,065 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<vector>
#include<set>
using namespace std;
typedef long long ll;
int H,W,N;
char mm[1005][1005];
bool v[1005][1005];
int xx,yy;
struct node{
int x,y,step;
};
queue<node> que;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
bool check(int x,int y){
if(1<=x&&x<=H&&1<=y&&y<=W&&!v[x][y]&&mm[x][y]!='X')return true;
else return false;
}
int bfs(int g){
while(!que.empty())que.pop();
node t;
t.x=xx;
t.y=yy;
t.step=0;
v[xx][yy]=1;
que.push(t);
while(!que.empty()){
t=que.front();
que.pop();
for(int i=0;i<4;i++){
int nx=t.x+dx[i];
int ny=t.y+dy[i];
if(check(nx,ny)){
if(mm[nx][ny]==g+'0'){
xx=nx;
yy=ny;
return t.step+1;
}
node tt;
tt.x=nx;
tt.y=ny;
tt.step=t.step+1;
v[nx][ny]=1;
que.push(tt);
}
}
}
}
int main(){
while(~scanf("%d%d%d",&H,&W,&N)){
for(int i=1;i<=H;i++){
scanf("%s",mm[i]+1);
}
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(mm[i][j]=='S'){
xx=i;
yy=j;
}
}
}
int ans=0;
for(int i=1;i<=N;i++){
memset(v,0,sizeof(v));
ans+=bfs(i);
}
printf("%d\n",ans);
}
return 0;
} | #include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
typedef struct{
int x;
int y;
}P;
char graph[1000][1000];
P aim[10];
P s,g;
int N,W,H;
int vis[1000][1000];
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
int bfs(P s,P g);
int main(){
int i,j,t,step=0;
cin>>H>>W>>N;
for(i=0;i<H;i++)
for(j=0;j<W;j++){
cin>>graph[i][j];
if(graph[i][j]<='9'&&graph[i][j]>='1'){
t=graph[i][j]-'0';
aim[t].x=i;
aim[t].y=j;
}
else if(graph[i][j]=='S'){
s.x=i;
s.y=j;
graph[i][j]='.';
}
}
for(i=1;i<=N;i++){
g.x=aim[i].x;
g.y=aim[i].y;
step+=bfs(s,g);
s.x=g.x;
s.y=g.y;
graph[g.x][g.y]='.';
}
cout<<step<<endl;
}
int bfs(P s,P g){
queue<P> que;
P n;
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)
vis[i][j]=-1;
que.push(s);
vis[s.x][s.y]=0;
while(que.size()){
P p=que.front();
que.pop();
if(p.x==g.x&&p.y==g.y)
break;
for(int i=0;i<4;i++){
n.x=p.x+dx[i];
n.y=p.y+dy[i];
if(0<=n.x&&n.x<H&&0<=n.y&&n.y<W&&graph[n.x][n.y]!='X'&&vis[n.x][n.y]==-1){
que.push(n);
vis[n.x][n.y]=vis[p.x][p.y]+1;
}
}
}
return vis[g.x][g.y];
} | 1 | 89,183,252 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
int main(){
int n;cin>>n;
int l[2*n];
for(int i=0;i<2*n;i++) cin>>l[i];
sort(l,l+2*n,greater<int>());
int ans=0;
for(int i=1;i<2*n;i+=2){
ans+=l[i];
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
ll n;
cin >> n;
n *= 2;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i += 2)
{
ans += min(v[i], v[i + 1]);
}
cout << ans << endl;
}
int main(void)
{
solve();
} | 1 | 51,320,083 |
#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>;
string s;
ll k;
ll num, len;
int main() {
cin >> s >> k;
len = 1000000000000000001;
rep (i, s.size()) {
if (s[i] != '1') {
num = s[i] - '0';
len = i + 1;
break;
}
}
if (k < len) {
cout << 1 << endl;
} else {
cout << num << endl;
}
return 0;
} | #include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
long long K;
scanf("%lld", &K);
for (int i = 0; i < K; i++) {
if (S[i] != '1') {
cout << S[i] << "\n";
return 0;
}
}
cout << "1\n";
return 0;
} | 1 | 95,487,189 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int n, i; cin >> n >> i;
cout << n - i + 1 << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
int main ()
{
int N , i ;
cin >> N >> i ;
cout << N - i + 1 ;
return 0 ;
} | 1 | 86,596,201 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
cout << a.back()-a.at(0) << endl;
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int main() {
in(int, n);
V<int> a(n);
rep(i, n) cin >> a[i];
out(*max_element(all(a)) - *min_element(all(a)));
} | 1 | 56,574,625 |
#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 n;
cin >> n;
ll a[n];
rep(i,0,n) cin >> a[i];
ll sxor[n+1] = {},ssum[n+1] = {};
rep(i,0,n){
sxor[i+1] = sxor[i] ^ a[i];
ssum[i+1] = ssum[i] + a[i];
}
ll cnt = 0;
rep(i,0,n){
ll ok = i,ng = n;
while(abs(ok-ng) > 1){
ll mid = (ok+ng)/2;
if((sxor[mid+1] ^ sxor[i]) == (ssum[mid+1] - ssum[i])){
ok = mid;
}
else{
ng = mid;
}
}
cnt += ok - i + 1;
}
cout << cnt << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
ll N;
cin >> N;
vl A(N);
rep(i, N) cin >> A[i];
ll left = 0, right = 0;
ll ans = 1;
ll calc = A[0];
while(right < N - 1){
if((calc ^ A[right + 1]) == (calc + A[right + 1])){
right++;
calc += A[right];
ans += right - left + 1;
} else{
calc -= A[left];
left++;
if(left > right){
right = left;
calc = A[left];
ans++;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 89,200,773 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
#define PI 3.141592653589
int main(int argc,char* argv[])
{
double a,b,c,S,L,h;
cin >> a >> b >> c;
S=a*b*sin(PI*c/180)*0.5;
L=a+b+sqrt(pow(a,2.0)+pow(b,2.0)-2*a*b*cos(PI*c/180));
h=b*sin(PI*c/180);
printf("%.8lf\n%.8lf\n%.8lf\n",S,L,h);
} | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
double a, b, C;
double S, L, h;
cin >> a >> b >> C;
double D = acos(-1.0) * C /180.0;
S = a * b * sin(D) / 2.0;
L = a + b + sqrt(a*a + b*b -2*a*b*cos(D));
h = b*sin(D);
printf("%lf\n%lf\n%lf\n",S, L, h);
return 0;
} | 1 | 96,031,085 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
char c;
cin>>n>>c>>m;
if(c=='+')cout<<n+m<<"\n";
else cout<<n-m<<"\n";
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; --i)
constexpr ll MOD = 0x3b9aca07;
constexpr int INF = 0x3f3f3f3f;
constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int a, b; char c;
cin >> a >> c >> b;
if (c == '+') cout << a + b;
else cout << a - b;
cout << endl;
return 0;
} | 1 | 50,602,521 |
#include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
bool check(int n, vector<int> a, int x) {
map<int, int> mp;
mp[a[1]-1] = 0;
for(int i=1;i<=n;++i) {
vector<int> to_erase;
if(a[i-1] < a[i]) {
for(auto itr=mp.begin();itr!=mp.end();++itr) {
if(itr->first >= a[i]) {
to_erase.push_back(itr->first);
}
}
} else if(a[i-1] == a[i]) {
bool added = false;
for(int j=a[i]-1;j>=0;--j) {
if(mp.find(j) == mp.end()) {
if(x == 1) return false;
mp[j] = 1;
added = true;
break;
} else if(mp[j] != x-1) {
++mp[j];
added = true;
break;
} else {
to_erase.push_back(j);
}
}
if(!added) return false;
} else {
bool added = false;
for(int j=a[i]-1;j>=0;--j) {
if(mp.find(j) == mp.end()) {
if(x == 1) return false;
mp[j] = 1;
added = true;
break;
} else if(mp[j] != x-1) {
++mp[j];
added = true;
break;
} else {
to_erase.push_back(j);
}
}
if(!added) return false;
for(auto itr=mp.begin();itr!=mp.end();++itr) {
if(itr->first >= a[i]) {
to_erase.push_back(itr->first);
}
}
}
for(int e: to_erase) mp.erase(e);
}
return true;
}
int main() {
int n;
cin >> n;
vector<int> a(n+1, 0);
for(int i=1;i<=n;++i) cin >> a[i];
int ng = 0, ok = 300000;
while(ok-ng > 1) {
int mid = (ok + ng) / 2;
if(check(n, a, mid)) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok << endl;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
#include<cassert>
#include<cmath>
#include<sstream>
#include<fstream>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int a[200005];
int b[200005];
int n;
map<int,int> mp;
bool check(int mid){
mp.clear();
for(int i=1;i<n;i++){
if(a[i]>a[i-1]) continue;
mp.erase(mp.upper_bound(a[i]),mp.end());
int j;
for(j=a[i];j>0;j--){
if(mp[j]<mid){
mp[j]++;
break;
}
mp.erase(mp.find(j));
}
if(j==0) return 0;
}
return 1;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
bool flag=0;
for(int i=0;i<n-1;i++) if(a[i]>=a[i+1]) flag=1;
if(!flag){
cout<<1;
return 0;
}
int l=1,r=n,res=-1;
while(l<=r){
int mid=l+r>>1;
if(!check(mid)){
l=mid+1;
}
else {
res=mid;
r=mid-1;
}
}
cout<<res+1;
} | 1 | 29,050,313 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) {
int x;
cin >> x;
a[x - 1]++;
}
sort(a.begin(), a.end());
vector<int> s(N + 1);
rep(i, N) s[i + 1] = s[i] + a[i];
for (int k = 1; k <= N; k++) {
int l = 0;
int r = N / k + 1;
while (l + 1 < r) {
int c = (l + r) / 2;
bool ok = [&](int c) {
int i = lower_bound(a.begin(), a.end(), c) - a.begin();
int sum = c * (N - i) + s[i];
return (sum >= c * k);
}(c);
if (ok) l = c; else r = c;
}
printf("%d\n", l);
}
} | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
const int INF = 1e18, MOD = 1e9 + 7;
template<class T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<class T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for(int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
signed main() {
INCANT;
int n, a, cnt[333333] = {}, sum[333333] = {};
cin>>n;
rep(i, n){
cin>>a;
a--;
sum[cnt[a]]++;
cnt[a]++;
}
int i = n, tmp = n;
rep(j, 1, n + 1){
while(tmp < i * j){
i--;
tmp -= sum[i];
}
cout<<i<<endl;
}
} | 1 | 48,880,166 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1;
}
return res;
}
int main() {
int MOD=1000000007;
int n;
cin>>n;
int t[n],a[n],check[n],pos_t[n],pos_a[n];
for(int i=0;i<n;i++){
cin>>t[i];
check[i]=0;
}
for(int i=0;i<n;i++){
cin>>a[i];
}
check[0]=1;
pos_t[0]=t[0];
for(int i=1;i<n;i++){
if(t[i-1]<t[i]){
check[i]=1;
}
pos_t[i]=t[i];
}
check[n-1]+=2;
pos_a[n-1]=a[n-1];
for(int i=n-2;i>=0;i--){
if(a[i+1]<a[i]){
check[i]+=2;
}
pos_a[i]=a[i];
}
ll ans=1;
for(int i=0;i<n;i++){
if(check[i]==0){
ans=mod(ans*min(pos_a[i],pos_t[i]),MOD);
}
else if(check[i]==1){
if(pos_t[i]<=pos_a[i])continue;
else ans=0;
}
else if(check[i]==2){
if(pos_a[i]<=pos_t[i])continue;
else ans=0;
}
else{
if(pos_a[i]==pos_t[i])continue;
else ans=0;
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
#define int long long
#define double long double
ll modpow(ll a, ll n, const ll &MOD = MOD){
ll ret = n == 0 ? 1 : modpow(a, n/2, MOD);
(ret *= ret) %= MOD;
if(n%2)((ret *= a) %= MOD);
return ret;
}
ll modinv(ll d, const ll &MOD = MOD){
return modpow(d, MOD-2, MOD);
}
map<int, int> prime_factor(int n){
map<int, int> ret;
for(int i = 2;i*i <= n;i++){
while(n % i == 0){
ret[i]++;
n /= i;
}
}
if(n != 1){
ret[n] = 1;
}
return ret;
}
int n,t[110000],a[110000],b[110000],c[110000];
signed main(){
cin>>n;rep(i,n)cin>>t[i];rep(i,n)cin>>a[i];
b[0] = 1;c[0] = t[0];
repd(i,1,n){
if(t[i-1] > t[i]){
cout << 0 << endl;return 0;
}else if(t[i-1] < t[i]){
b[i] = 1;
c[i] = t[i];
}else{
b[i] = t[i];
c[i] = 0;
}
}
b[n-1] = 1;
if(c[n-1] > 0 && c[n-1] != a[n-1] || (b[n-1] != 1 && a[n-1] > b[n-1])){
cout << 0 << endl;return 0;
}
for(int i = n-2;i >= 0;i--){
if(a[i+1] > a[i]){
cout << 0<< endl;return 0;
}else if(a[i+1] < a[i]){
b[i] = 1;
if((c[i] > 0 && c[i] != a[i]) || (b[i] != 1 && a[i] > b[i])){
cout << 0 << endl;return 0;
}
}else{
if(c[i] > a[i]){
cout << 0 << endl;return 0;
}
chmin(b[i], a[i]);
}
}
int ans = 1;
rep(i,n)ans = (ans*b[i])%MOD;
cout << ans << endl;
} | 1 | 59,425,280 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;
vector<int>v(n);
for(auto &x:v)
cin>>x;
auto it=minmax_element(v.begin(),v.end());
cout<<*(it.second)-*(it.first)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int mini = -1, maxi = -1;
for(int i=0; i<n; i++){
int a; cin >> a;
if(a > maxi || maxi == -1) maxi = a;
if(a < mini || mini == -1) mini = a;
}
cout << maxi - mini << endl;
} | 1 | 66,586,445 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
double t,x;cin>>t>>x;
printf("%.10f\n",t/x);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
long double t,x;
cin >> t >> x;
cout << t/x << endl;
} | 1 | 82,708,919 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
using namespace std;
int main()
{
int N, sum = 0;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
{
cin >> d.at(i);
}
for (int i = 0; i < N - 1; i++)
{
for (int j = i + 1; j < N; j++)
{
sum += d[i] * d[j];
}
}
cout << sum << endl;
} | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
for(j=i+1;j<n;j++)
ans+=a[i]*a[j];
}
cout<<ans;
}
int main()
{
cool;
int t;
t=1;
while(t--){
solve();
}
return 0;
} | 1 | 98,835,755 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T> void pr(const complex<T>& x) { cout << x; }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void print() { pr("\n"); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); print(ts...);
}
}
using namespace output;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string S; cin >> S;
int X, Y; cin >> X >> Y;
bitset<16001> pxs;
bitset<16001> pys;
pxs[0+8000] = true;
pys[0+8000] = true;
bool isX = true;
F0R(k, S.size()) {
if (S[k] == 'T') {isX = !isX; continue;}
int j = k;
while (j < S.size() && S[j] == 'F') ++j;
bitset<16001> newpxs;
bitset<16001> newpys;
int dist = j - k;
F0R(i, 16001) {
if (isX) {
if (pxs[i] && i + dist < 16001) newpxs[i+dist] = true;
if (k > 0 && pxs[i] && i - dist >= 0) newpxs[i-dist] = true;
} else {
if (pys[i] && i + dist < 16001) newpys[i+dist] = true;
if (pys[i] && i - dist >= 0) newpys[i-dist] = true;
}
}
if (isX) pxs = newpxs;
else pys = newpys;
k = j - 1;
}
print((pxs[X + 8000] && pys[Y + 8000]) ? "Yes" : "No");
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int dp[2][8001];
int main() {
int t;
t=1;
while(t--)
{
string s;
cin>>s;
int x,y;
cin>>x>>y;
int sumx=0, sumy=0;
vector<int> v[2];
int cur = 0;
int len=0;
int j=0,cnt=0;
while(j<s.length() && s[j]!='T'){
cnt++;
j++;
}
for(int i=j;i<s.length();i++){
if(s[i]=='T'){
if(len>0)
v[cur].push_back(len);
cur^=1;
len=0;
}
else{
len++;
}
}
if(len>0){
v[cur].push_back(len);
}
dp[0][0]=dp[1][0]=1;
for(int i=0;i<v[0].size();i++){
sumx+=v[0][i];
for(int j=8000;j>=v[0][i];j--){
if(dp[0][j-v[0][i]]){
dp[0][j]=1;
}
}
}
for(int i=0;i<v[1].size();i++){
sumy+=v[1][i];
for(int j=8000;j>=v[1][i];j--){
if(dp[1][j-v[1][i]]){
dp[1][j]=1;
}
}
}
bool fx=0,fy=0;
for(int i=0;i<=8000;i++){
if(dp[0][i] && ((2*i-sumx) == (x-cnt)))
fx=1;
if(dp[1][i] && ((2*i-sumy) == y))
fy=1;
}
if(fx && fy)
cout<<"Yes\n";
else
cout<<"No\n";
}
return 0;
} | 1 | 25,945,722 |
#include <bits/stdc++.h>
typedef long long LL;
const int N = 1005, K = 30;
std::vector<LL> v;
LL n, x[N], y[N];
void solve(LL x, LL y, int dep) {
if (dep == v.size()) return void(std::cout << '\n');
if (std::abs(x) > std::abs(y))
if (x < 0) x += v[dep], std::cout << 'R';
else x -= v[dep], std::cout << 'L';
else
if (y < 0) y += v[dep], std::cout << 'U';
else y -= v[dep], std::cout << 'D';
solve(x, y, dep + 1);
}
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> x[i] >> y[i];
if ((x[i] ^ x[1] ^ y[i] ^ y[1]) & 1)
return std::cout << "-1\n", 0;
}
for (int i = K; ~i; --i) v.push_back(1LL << i);
if ((x[1] ^ y[1] ^ 1) & 1) v.push_back(1);
std::cout << v.size() << '\n';
for (LL i : v) std::cout << i << ' ';
std::cout << '\n';
for (int i = 1; i <= n; ++i) solve(-x[i], -y[i], 0);
return 0;
} | #include<stdio.h>
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<set>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<stack>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define Pii pair<ll,int>
#define m_p make_pair
#define l_b lower_bound
#define u_b upper_bound
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 1e3 + 11;
const int maxm = 600 + 11;
const int mod = 1e9 + 7;
const double eps = 1e-5;
inline ll rd() { ll x = 0, f = 1; char ch = getchar(); while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }while (ch >= '0'&&ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }return x * f; }
inline ll qpow(ll a, ll b, ll p) { ll res = 1; while (b) { if (b & 1) { res *= a; res %= p; }b >>= 1; a = a * a%p; }return res; }
inline ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a%b); }
ll X[maxn],Y[maxn];
ll d[maxn];
int len=0;
void Print(ll x,ll y){
for(int i=1;i<=len;i++){
if(abs(x)>abs(y)){
if(x>0) x-=d[i],printf("R");
else x+=d[i],printf("L");
}
else{
if(y>0) y-=d[i],printf("U");
else y+=d[i],printf("D");
}
}
puts("");
}
void run(){
int n=rd();
int z=0,f=0;
for(int i=1;i<=n;i++){
X[i]=rd(),Y[i]=rd();
if(abs(X[i]+Y[i])%2) z=1;
else f=1;
}
if(z&&f) {
puts("-1");
return;
}
for(int i=30;i>=0;i--){
d[++len]=(1ll<<i);
}
if(f) d[++len]=1;
printf("%d\n",len);
for(int i=1;i<=len;i++){
if(i==len) printf("%lld\n",d[len]);
else printf("%lld ",d[i]);
}
for(int i=1;i<=n;i++){
Print(X[i],Y[i]);
}
}
int main() {
run();
} | 1 | 52,836,359 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#include<string>
using namespace std;
std::string S;
void solve (){
if((S[2] == S[3]) && (S[4] == S[5])){
cout << "Yes";
}
else{
cout << "No";
}
}
int main() {
cin >> S;
solve();
} | 1 | 46,785,434 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong N,K;
llong d;
llong ans=0;
cin >> N >> K;
vector<vector<llong> > Table(N, vector<llong>(K,0));
llong A;
llong cnt=0;
for(int i=0; i<K; i++){
cin >> d;
for(int j=0; j<d; j++){
cin >> A;
Table[A-1][i] = 1;
}
}
for(int i=0; i<N; i++){
cnt = 0;
for(int j=0; j<K; j++){
if(Table[i][j]==1){
cnt++;
}
}
if(cnt==0){
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) for (auto&& itr : x) { cerr << (itr) << " "; }
template <class T> inline void chmax(T &ans, T t) { if (t > ans) ans = t;}
template <class T> inline void chmin(T &ans, T t) { if (t < ans) ans = t;}
template <class T>
T inf = numeric_limits<T>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<bool> v(N+1);
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
for (int j = 0; j < d; ++j) {
int a;
cin >> a;
v[a] = true;
}
}
int ans = 0;
for (int i = 1; i <= N; ++i) {
if (!v[i]) ans += 1;
}
cout << ans << endl;
} | 1 | 1,670,301 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <list>
#include <map>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <bitset>
#include <utility>
#include <complex>
#include <assert.h>
#include <limits.h>
using namespace std;
#define rank rankk
#define mp make_pair
#define pb push_back
#define xo(a,b) ((b)&1?(a):0)
#define tm tmp
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<ll,int> pli;
typedef pair<int,ll>pil;
typedef pair<ll,ll> pll;
const int INF=0x3f3f3f3f;
const ll INFF=0x3f3f3f3f3f3f3fll;
const int MAX=5e5+5;
const ll MOD=1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
template<typename T>inline T abs(T a) {return a>0?a:-a;}
template<class T> inline
void read(T& num) {
bool start=false,neg=false;
char c;
num=0;
while((c=getchar())!=EOF) {
if(c=='-') start=neg=true;
else if(c>='0' && c<='9') {
start=true;
num=num*10+c-'0';
} else if(start) break;
}
if(neg) num=-num;
}
inline ll powMM(ll a,ll b,ll M){
ll ret=1;
a%=M;
while (b){
if (b&1) ret=ret*a%M;
b>>=1;
a=a*a%M;
}
return ret;
}
void open()
{
freopen("in2.txt","r",stdin);
freopen("out2.txt","w",stdout);
}
int q;
ll a,b,c;
int main()
{
scanf("%d",&q);
while(q--)
{
scanf("%lld%lld",&a,&b);
if(a>b)swap(a,b);
if(a==b||a+1==b)printf("%lld\n",2LL*a-2LL);
else
{
c=(ll)sqrt(a*b);
while(c*c>=a*b)--c;
if(c*(c+1LL)<a*b)
printf("%lld\n",2LL*c-1);
else printf("%lld\n",2LL*c-2);
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
int calc(int X,int B){
int lb=0,ub=X+114;
while(ub-lb>1){
int mid=(ub+lb)/2;
int tmp=X/(B+mid);
if(mid<=tmp)lb=mid;
else ub=mid;
}
return lb;
}
signed main(){
int Q;cin>>Q;
while(Q--){
int A,B;
cin>>A>>B;
if(A>B)swap(A,B);
int X=A*B;
int lb=0,ub=1001001001;
while(ub-lb>1){
int mid=(ub+lb)/2;
if(mid*mid<=X-1)lb=mid;
else ub=mid;
}
int a=1001001001;
for(int i=-1000;i<=1000;i++){
int x=lb+i;
if(x<=A)continue;
if((X-1)<x)continue;
chmin(a,x-A+(X-1)/x-1);
}
if(a==1001001001)a=0;
int b=A-1;
int ans=a+b;
cout<<ans<<endl;
}
return 0;
} | 1 | 70,766,717 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)
#define _sum(v,default_value) accumulate(v.begin(),v.end(),default_value )
#define _max_element(v) max_element(v.begin(),v.end())
#define _min_element(v) min_element(v.begin(),v.end())
#define _max_element_number(v) distance(v.begin(),max_element(v.begin(),v.end()))
#define _count(v,value) count(v.begin(),v.end(),value)
#define _round(v) round(v)
#define _square(v) pow(v,2)
#define _cube(v) pow(v,3)
#define _max(x,y) max(x,y)
#define _min(x,y) min(x,y)
#define _stringtoi(s) stoi(s)
#define _sqrt(x) sqrt(x)
#define _ceil(x) ceil(x)
#define _lower_bound(v,min) lower_bound(v.begin(), v.end(), min)
#define _upper_bound(v,min) upper_bound(v.begin(), v.end(), min)
#define _next_permutation(v) do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
} while (next_permutation(v.begin(), v.end()))
template<typename T>
static T _abs(const T x) { return (x > 0 ? x : -x); }
int64_t gcd(int64_t a, int64_t b) { while (b) { int64_t c = b; b = a % b; a = c; } return a; }
int64_t lcm(int64_t a, int64_t b) { if (!a || !b) return 0; return a * b / gcd(a, b); }
template<class T>
vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); }
int main()
{
string s,t;
cin >> s >> t;
t += s;
cout << t;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s1,s2,s3;
cin>>s1>>s2;
s3=s2+s1;
cout<<s3<<endl;
} | 1 | 88,610,626 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
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 nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n,k; cin >> n >> k;
ll ans = k;
rep(i,n-1){
ans *= (k-1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
unsigned int N, K;
cin >> N >> K;
unsigned int ans = K;
for (int i = 1; i < N; i++) {
ans *= K - 1;
}
cout << ans << endl;
return 0;
} | 1 | 24,108,773 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main() {
int n,k;
cin >> n >> k;
vector<P> v(n);
rep(i,n) cin >> v[i].first >> v[i].second;
sort(v.begin(),v.end());
ll ans = 5L*1e18L;
rep(l,n-k+1){
vector<ll> y;
rep(i,k-1) y.push_back(v[l+i].second);
for(int r=l+k-1;r<n;++r){
y.push_back(v[r].second);
sort(y.begin(),y.end());
ll dx = v[r].first - v[l].first;
ll dy = 1e18L;
rep(i,y.size()-k+1) dy = min(dy,y[i+k-1]-y[i]);
ans = min(ans,dx*dy);
}
}
cout << ans << endl;
} | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k;
cin>>n>>k;
vi x(n),y(n);
vi xarr,yarr;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
xarr.pb(x[i]);
yarr.pb(y[i]);
}
sort(xarr.begin(),xarr.end());
sort(yarr.begin(),yarr.end());
ll ans=1LL*(xarr[n-1]-xarr[0])*(yarr[n-1]-yarr[0]);
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++){
int num=0;
ll lx=xarr[xi],rx=xarr[xj];
ll by=yarr[yi],uy=yarr[yj];
for(int i=0;i<n;i++){
if(lx<=x[i] && x[i]<=rx && by<=y[i] && uy>=y[i]){
num+=1;
}
}
if(num>=k){
ans=min(ans,1LL*(rx-lx)*(uy-by));
}
}
}
}
}
cout<<ans<<endl;
return 0;
} | 1 | 85,953,026 |
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 1e5 + 10, MAXM = 2e5 + 10;
vector<pair<int, int> > vc[MAXN];
vector<pair<int, pair<int, int> > > e;
long long d[MAXN], n, m;
bool se[MAXN];
void dfs(int v, long long dis) {
d[v] = dis;
se[v] = 1;
for (int i = 0; i < vc[v].size(); i++)
if (!se[vc[v][i].first])
dfs(vc[v][i].first, dis + vc[v][i].second);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int li, ri, di;
cin >> li >> ri >> di;
vc[li].push_back({ri, di});
vc[ri].push_back({li, -di});
e.push_back({di, {li, ri}});
}
for (int i = 1; i <= n; i++)
if (!se[i])
dfs(i, 0);
for (int i = 0; i < m; i++)
if (d[e[i].second.second] - d[e[i].second.first] != e[i].first)
return cout << "No", 0;
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const int N = 2e5 + 5;
bool M[N];
int L[N], R[N], D[N], H[N];
vector<pii> G[N];
void DFS(int v, int w = 0) {
H[v] = w, M[v] = true;
for (pii e : G[v]) if (!M[e.first]) DFS(e.first, w + e.second);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> L[i] >> R[i] >> D[i];
G[L[i]].push_back(make_pair(R[i], D[i]));
G[R[i]].push_back(make_pair(L[i], -D[i]));
}
for (int i = 1; i <= n; i++) if (!M[i]) DFS(i);
bool flag = true;
for (int i = 0; i < m; i++) flag &= (H[R[i]] - H[L[i]] == D[i]);
cout << (flag ? "Yes" : "No") << endl;
return 0;
} | 1 | 50,102,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+5;
bool flg;
vector<ll> adj[N],col(N);
void dfs(ll node,ll clr){
if(col[node]!=0){
if(col[node]!=clr)flg=0;
return;
}
col[node]=clr;
for(auto &v:adj[node])dfs(v,-clr);
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,m;cin>>n>>m;
for(ll i=0;i<m;i++){
ll u,v;cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
ll c1=0,c2=0,c3=0;
for(ll i=1;i<=n;i++){
if(col[i]!=0)continue;
if(adj[i].size()==0)c1++;
else{
flg=1;
dfs(i,1);
if(flg)c2++;
else c3++;
}
}
ll ans = 2*n*c1 - c1*c1 + c3*c3 + 2*c3*c2 + 2*c2*c2;
cout<<ans;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(_,v.size())cout<<" "<<v[_];cout<<endl;
#define show2d(v) rep(_,v.size()){rep(__,v[_].size())cout<<" "<<v[_][__];cout<<endl;}cout<<endl;
using namespace std;
typedef long long ll;
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 1e18+10 : 1e9+10;
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};
int n,m;
vvi G;
vi used;
ll co1=0,co2=0,co3=0;
bool h;
void dfs(int a,int b){
used[a]=b;
rep(i,G[a].size()){
int to=G[a][i];
if(used[to]==-1)dfs(to,b^1);
else if(used[to]==b)h=false;
}
}
int main(){
cin>>n>>m;
G=vvi(n);
rep(i,m){
int a,b;
cin>>a>>b;
a--;b--;
G[a].pb(b);
G[b].pb(a);
}
used=vi(n,-1);
rep(i,n)if(used[i]==-1){
if(G[i].size()==0)co1++;
else{
h=true;
dfs(i,0);
if(h)co2++;
else co3++;
}
}
cout<<2*co1*n-co1*co1+2*co2*co2+2*co2*co3+co3*co3<<endl;
} | 1 | 80,535,509 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define mp make_pair
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define sz(x) (int)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
ll n;
cin>>n;
vll t(n),a(n);
rep(i,n) cin>>t[i];
rep(i,n) cin>>a[i];
vll tt(0),aa(0);
tt.pb(1);
aa.pb(1);
ll ma=a[0];
ll mt=t[0];
for(int i=1;i<n;i++){
mt=max(t[i],mt);
if(t[i]!=t[i-1]){
tt.pb(1);
}
else{
tt.pb(t[i]);
}
}
for(int i=n-1;i>0;i--){
ma=max(ma,a[i]);
if(a[i]!=a[i-1]){
aa.pb(1);
}
else{
aa.pb(a[i]);
}
}
if(ma!=mt){
COUT(0);
return 0;
}
ll ans=1;
ll k=1;
rep(i,n){
ans*=min(aa[n-i-1],tt[i]);
ans%=MOD;
if(a[i]==ma&&t[i]==mt)k=0;
if(aa[n-i-1]==1&&a[i]>t[i]){
COUT(0);
return 0;
}
if(tt[i]==1&&t[i]>a[i]){
COUT(0);
return 0;
}
}
if(k){
COUT(0);
return 0;
}
COUT(ans);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0;i < N;i++) {
cin >> A.at(i);
}
vector<int> B(N);
for(int i = 0;i < N;i++) {
cin >> B.at(i);
}
vector<P> cnt(N);
cnt.at(0).first = A.at(0);
cnt.at(0).second = A.at(0);
for(int i = 0;i < N - 1;i++) {
if(A.at(i) == A.at(i + 1)) {
cnt.at(i + 1).first = 1;
cnt.at(i + 1).second = cnt.at(i).second;
}
else {
cnt.at(i + 1).first = A.at(i + 1);
cnt.at(i + 1).second = A.at(i + 1);
}
}
vector<P> cnt2(N);
reverse(B.begin(),B.end());
cnt2.at(0).first = B.at(0);
cnt2.at(0).second = B.at(0);
for(int i = 0;i < N - 1;i++) {
if(B.at(i) == B.at(i + 1)) {
cnt2.at(i + 1).first = 1;
cnt2.at(i + 1).second = cnt2.at(i).second;
}
else {
cnt2.at(i + 1).first = B.at(i + 1);
cnt2.at(i + 1).second = B.at(i + 1);
}
}
reverse(cnt2.begin(),cnt2.end());
vector<P> ret(N);
bool ret2 = true;
for(int i = 0;i < N;i++) {
ret.at(i).first = max(cnt.at(i).first,cnt2.at(i).first);
ret.at(i).second = min(cnt.at(i).second,cnt2.at(i).second);
if(ret.at(i).first > ret.at(i).second) {
ret2 = false;
break;
}
}
if(ret2 == false) {
cout << 0 << endl;
}
else {
ll ret3 = 1;
for(int i = 0;i < N;i++) {
ret3 = ret3 * (ret.at(i).second - ret.at(i).first + 1) % MOD;
}
cout << ret3 << endl;
}
} | 1 | 7,863,150 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int lcm(int a, int b)
{
return a / gcd(a, b)*b;
}
signed main(void) {
int n;
cin >> n;
vector<int>t(n);
rep(i, n) {
cin >> t[i];
}
int ret = t[0];
rep1(i, n) {
ret = lcm(ret, t[i]);
}
print(ret);
} | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,char>;
using ll=long long;
int gcd (int a, int b) {
int d=a;
if (b!=0) {
d=gcd(b, a%b);
}
return d;
}
int lcm (int a, int b) {
return a*b/gcd(a,b);
}
int main() {
int N;
cin >> N;
vector<ll> T(N);
for (int i=0; i<N; i++) {
cin >> T[i];
}
ll s=1;
for (int i=0; i<N; i++) {
s=lcm(T[i], s);
}
cout << s << endl;
} | 1 | 69,533,439 |
#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> pp;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
int m;
cin >> m;
ll now = 0;
ll nine_count = 0;
ll d = 0;
rep(i,m){
ll a,b;
cin >> a >> b;
d += b;
nine_count += (a * b)/9;
now += (a * b) % 9;
}
nine_count += now/9;
if(now%9 == 0) cout << nine_count + d - 2 << endl;
else cout << nine_count + d - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define INF 900000000000000004
signed main(void){
int n;cin>>n;
int c=0,d=0;
rep(i,n){
int d0,c0;cin>>d0>>c0;
c+=c0;
d+=c0*d0;
}
cout<<c-1+(d-1)/9<<endl;
} | 1 | 55,299,950 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll A, B, C; cin >> A >> B >> C;
string ans = "NO";
REP(i, 100000) {
if((i * A) % B == C) ans = "YES";
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main()
{
int A, B, C, tmp;
cin >> A >> B >> C;
tmp = A;
for (int i = 0; i < B; i++)
{
if (tmp % B == C)
{
cout << "YES" << endl;
return 0;
}
tmp += A;
}
cout << "NO" << endl;
return 0;
} | 1 | 67,307,052 |
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}
else{
return par[a]=find(par[a]);
}
}
bool same(ll a,ll b){
return (find(a)==find(b));
}
ll size(ll a){
return -par[find(a)];
}
void unite(ll a,ll b){
ll c=find(a),d=find(b);
if(c==d)
return;
if(size(c)<size(d)){
swap(c,d);
}
par[c]+=par[d];
par[d]=c;
}
};
ll Nagaemon1;
void swap(ll i,ll j){
Nagaemon1=i;
i=j;
j=Nagaemon1;
}
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << c-(d-b) <<" "<< d+(c-a) <<" "<< a-(d-b) <<" "<< b+(c-a);
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int x1, x2, x3, x4, y1, y2, y3, y4;
cin >> x1 >> y1 >> x2 >> y2;
int a = x2-x1;
int b = y2-y1;
x3 = x2-b;;
y3 = y2+a;
x4 = x1-b;
y4 = y1+a;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
} | 1 | 33,645,828 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define hell 1000000007
#define PI 3.14159265358979323846
using namespace std;
ll hcf(ll a,ll b)
{
if(a%b==0)
return b;
else
return hcf(b,a%b);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
while(t--)
{
ll n,m,i;
cin>>n>>m;
ll arr[n+1];
for(i=0;i<n;i++)
cin>>arr[i];
ll p=arr[0];
for(i=1;i<n;i++)
{
ll h=hcf(p,arr[i]);
ll l=p*arr[i]/h;
p=l;
}
for(i=0;i<n;i++)
{
if((p/arr[i])%2==0)
break;
}
if(i<n || p>2*m)
cout<<0;
else
{
ll ans=2*m/p;
cout<<(ans+1)/2;
}
}
} | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> pii;
int t;
ull lcm(ull a, ull b){
return (a*b)/__gcd(a,b);
}
ull number_times_divided_by_two(ull a){
ull cnt=0;
while(a%2==0){
a/=2;
cnt++;
}
return cnt;
}
void solve(){
ull n, m;
cin>>n>>m;
vector<ull> a(n);
map<int,bool> mark;
for(int i=0;i<(int)n;i++){
cin>>a[i];
a[i]/=2;
mark[number_times_divided_by_two(a[i])]=true;
}
if(mark.size()>1){cout<<0<<endl;return;}
ull LCM=1;
for(auto it:a){
LCM=lcm(LCM,it);
}
cout<<(m/LCM+1)/2<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | 1 | 62,637,153 |
#include <iostream>
void exchange(int a, int *n_1000, int *n_5000, int *n_10000){
if (a == 1000)
{
*n_1000 -= 5;
*n_5000 += 1;
}
else if (a == 5000)
{
*n_5000 -= 2;
*n_10000 += 1;
}
else
{
std::cout << "Error" << std::endl;
}
}
int main(){
int n, y;
std::cin >> n >> y;
int n_1000 = y / 1000;
int n_5000 = 0;
int n_10000 = 0;
if (n == n_1000)
{
std::cout << n_10000 << " " << n_5000 << " " << n_1000 <<std::endl;
return 0;
}
while (n_1000 >= 5)
{
exchange(1000, &n_1000, &n_5000, &n_10000);
if (n_1000 + n_5000 + n_10000 == n)
{
std::cout << n_10000 << " " << n_5000 << " " << n_1000 <<std::endl;
return 0;
}
int count = 0;
while (n_5000 >= 2)
{
exchange(5000, &n_1000, &n_5000, &n_10000);
count++;
if (n_1000 + n_5000 + n_10000 == n)
{
std::cout << n_10000 << " " << n_5000 << " " << n_1000 <<std::endl;
return 0;
}
}
n_5000 += 2 * count;
n_10000 -= count;
}
std::cout << "-1 -1 -1" << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <bitset>
#include<iomanip>
#include <map>
#include<set>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define INF 2000000000
#define INF2 1000000000000000000
#define PI 3.1415926535
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int, int> P;
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;
#define MAX_N 50005
#define MAX_K 100005
double max(double a, double b) {
if (a > b) return a;
return b;
}
int main() {
int N,Y;
cin >> N >> Y;
for (int x = 0; x <= N; x++) {
for (int y = 0; y <= N; y++) {
int z = N - x - y;
if (z >= 0) {
if (1000*x + 5000 * y + 10000 * z == Y) {
cout << z << " " << y << " " << x << endl;
return 0;
}
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
return 0;
} | 1 | 82,072,060 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int H, W;
string line, p;
while (cin >> H >> W)
{
if (H == 0 && W == 0)
{
break;
}
for (int y = 0; y < H; y++)
{
line = "";
p = "";
for (int x = 0; x < W; x++)
{
if (x == 0 || x == W - 1)
{
p = "#";
}
else
{
if (y == 0 || y == H - 1)
{
p = "#";
}
else
{
p = ".";
}
}
line += p;
}
cout << line << "\n";
}
cout << "\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int h,w,i;
string ans="",temp1="#",temp2="";
while(1){
cin>>h>>w;
if (h==0&&w==0)break;
else{
for (i=0;i<w-2;i++)temp1+=".";
temp1+="#\n";
for (i=0;i<w;i++)temp2+="#";
temp2+="\n";
ans+=temp2;
for (i=0;i<h-2;i++)ans+=temp1;
ans+=temp2;
cout<<ans<<endl;
ans="";temp1="#";temp2="";
}
}
return 0;
} | 1 | 81,694,777 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
string match_matching(ll n, ll m, ll a[]) {
ll invalid = -100000000;
vector<ll> dp(n+1, invalid);
int b[9] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
dp[0] = 0;
for(ll i = 2;i<n+1;i++) {
ll max_digits = invalid;
for(int j = 0;j<m;j++) {
ll required_match = b[a[j] - 1];
if(i < required_match) {
continue;
}
ll count = dp[i - required_match] + 1;
max_digits = max(count, max_digits);
max_digits = max_digits < 0 ? invalid : max_digits;
}
dp[i] = max_digits;
}
ll remains = n;
string ans = "";
while(remains>0) {
ll target_digit = a[0];
for(ll i=0;i<m;i++) {
ll req_match = b[a[i] - 1];
if(remains < req_match) {
continue;
}
if(remains < b[target_digit - 1]) {
target_digit = a[i];
continue;
}
if(dp[remains - req_match] > dp[remains - b[target_digit - 1]]) {
target_digit = a[i];
continue;
}
if(dp[remains - req_match] == dp[remains - b[target_digit - 1]]) {
target_digit = target_digit > a[i] ? target_digit : a[i];
continue;
}
}
remains = remains - b[target_digit - 1];
ans = ans + to_string(target_digit);
}
return ans;
}
int main() {
ll n, m;
cin >> n;
cin >> m;
ll a[m];
for(int i=0;i<m;i++) {
cin >> a[i];
}
cout << match_matching(n, m, a);
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
typedef pair<ll, ll> P;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(m);
REP(i, m) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
vector<int> dp(n+1, -1);
int match_num[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
dp[0] = 0;
REPN(i, 1, n+1) {
REP(j, m) {
int prev = i - match_num[a[j]];
if(prev >= 0 && dp[prev] != -1) {
dp[i] = max(dp[i], dp[prev] + 1);
}
}
}
vector<int> ans;
int ketasu = dp[n];
int honsu = n;
REP(i, ketasu) {
REP(j, m) {
if(honsu - match_num[a[j]] >= 0){
if((dp[honsu] - 1) == dp[honsu - match_num[a[j]]]) {
ans.push_back(a[j]);
honsu -= match_num[a[j]];
break;
}
}
}
}
for(auto a: ans) cout << a;
cout << endl;
return 0;
} | 1 | 39,218,913 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)
using namespace std;
double smen(double x1, double y1, double x2, double y2, double x3, double y3){
return abs((x3-x2) * (y1-y2) - (x1-x2)*(y3-y2) )* 0.5;
}
int main(void){
double x1,y1,x2,y2,x3,y3,xp,yp;
while(cin >> x1 ){
cin >> y1 >> x2 >> y2 >> x3 >> y3;
cin >> xp >> yp;
double saa = smen(x1,y1,x2,y2,x3,y3);
double sa1 = smen(x1,y1,x2,y2,xp,yp);
double sa2 = smen(x1,y1,xp,yp,x3,y3);
double sa3 = smen(xp,yp,x2,y2,x3,y3);
if(saa == sa1 + sa2 + sa3) cout << "YES" <<endl;
else cout << "NO" << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
double area(double a, double b, double c)
{
double s = (a+b+c)/2;
return sqrt(s*(s-a)*(s-b)*(s-c));
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int main()
{
double x[3], y[3];
double xp, yp;
while (scanf("%lf %lf %lf %lf %lf %lf %lf %lf"
, &x[0], &y[0], &x[1], &y[1], &x[2], &y[2], &xp, &yp) != EOF)
{
double edge[3];
for (int i = 0; i < 3; ++i)
edge[i] = distance(x[i], y[i], x[(i+1)%3], y[(i+1)%3]);
double correctArea = area(edge[0], edge[1], edge[2]);
double totalArea = 0;
for (int i = 0; i < 3; ++i)
{
totalArea += area(distance(x[i], y[i], xp, yp)
, distance(x[(i+1)%3], y[(i+1)%3], xp, yp), edge[i]);
}
if (abs(correctArea - totalArea) < 0.0001)
puts("YES");
else
puts("NO");
}
return 0;
} | 1 | 52,852,949 |
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
char buf[109];
bool solve(){
vector<char> st;
for(int i=0; buf[i]!='.'; i++){
char c = buf[i];
if(c == '(' || c == '['){
st.push_back(c);
}
else if(c == ')' || c == ']'){
if(st.empty()) return false;
else if(c == ')' && st.back() == '(') st.pop_back();
else if(c == ']' && st.back() == '[') st.pop_back();
else return false;
}
}
return st.empty();
}
int main(){
while(scanf("%[^\n]%*c", buf), strcmp(buf,".")){
puts(solve()?"yes":"no");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SQ(n) (n) * (n)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
int main() {
string s;
while(getline(cin, s), s != ".") {
stack<char> balance;
REP(i, s.length()){
switch (s[i]) {
case '[':
balance.push('[');
break;
case '(':
balance.push(')');
break;
case ']':
if(balance.empty() || balance.top() != '[') {
cout << "no" << endl;
goto END;
}
balance.pop();
break;
case ')':
if(balance.empty() || balance.top() != ')') {
cout << "no" << endl;
goto END;
}
balance.pop();
break;
}
}
if(!balance.empty()) {
cout << "no" << endl;
goto END;
}
cout << "yes" << endl;
END:;
}
} | 1 | 35,279,931 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int k;
int n;
int a[2000005];
int main(){
cin>>k>>n;
int dis=0;
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
dis = max(dis,a[i]-a[i-1]);
}
dis = max(dis,a[1]+k-a[n]);
cout<<k-dis<<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 v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
int m = 0;
int k,n,a;
cin >> k >> n >> a;
int pa = a;
for(int i = 1; i<n;i++){
int an;
cin >> an;
if(m < (an-pa)) m = (an-pa);
pa = an;
}
int l = (k-pa) + a;
if(l > m) m = l;
cout << k - m << endl;
} | 1 | 59,058,595 |
#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;
cin >> n;
ll cnt[n+10] = {0};
ll a[n+10];
rep(i, n) {
cin >> a[i];
cnt[a[i]]++;
}
ll total = 0;
for(ll i = 1; i <= n; i++) {
if (cnt[i] == 0) continue;
total += cnt[i] * (cnt[i] - 1) / 2;
}
rep(i, n) {
cout << total - (cnt[a[i]] * (cnt[a[i]] - 1) / 2) + ((cnt[a[i]] - 1) * (cnt[a[i]] - 2) / 2) << endl;
}
return 0;
} | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
lll ii,jj,kk;
vector<int> ret;
int n;
cin >> n;
vector<lll> a(n);
vector<lll> num(n+1);
for(ii=0;ii<n;ii++){
cin >> a[ii];
num[a[ii]]++;
}
lll sum;
sum = 0;
for(ii=1;ii<=n;ii++){
if(num[ii] >= 2){
sum += num[ii] * (num[ii] -1) / 2;
}
}
lll ans;
for(ii=0;ii<n;ii++){
if(num[a[ii]] >= 2){
ans = sum;
ans -= num[a[ii]] * (num[a[ii]] -1) / 2;
ans += (num[a[ii]] -1) * (num[a[ii]] -2) / 2;
}
else{
ans = sum;
}
cout << ans << endl;
}
return 0;
} | 1 | 71,712,248 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
ll n;
cin >> n;
ll ans = 0;
rep(i,n){
ans += ll(i+1)*(n/ll(i+1))*(1 + (n/ll(i+1)))/2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const int MOD = 1000000007;
const int INF = 1001001001;
const int dy[] = {-1, 0, 1, 0};
const int dx[] = {0, -1, 0, 1};
ll g(ll k) {
ll x = k * (k + 1) / 2;
return x;
}
int main()
{
ll n;
cin >> n;
ll ans = 0;
repl(i, 1, n + 1) {
ans += i * g(n / i);
}
cout << ans << endl;
return 0;
} | 1 | 86,088,432 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
for(int i = a; i <= b*a; i+=a){
if(i%b == c){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
#define rep(i, x) for(ll i = 0; i < x; i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
const ld pi = 3.141592653589793238;
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (a % b == 0)return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll modpow(ll x, ll y) {
ll res = 1;
while (y) {
if (y % 2) { res *= x; res %= mod; }
x = x * x % mod; y /= 2;
}
return res;
}
ll res[1223456], kai1[123456], kai2[123456];
signed main() {
ll n, m, a, b, c, cnt = 0; cin >> a >> b >> c;
rep(i, 1000) {
cnt += a;
if (cnt % b == c) { cout << "YES\n"; return 0; }
}
cout << "NO\n";
return 0;
} | 1 | 52,912,842 |
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int kfactor(int a,int k){
vector<int>v1,v2;
for(int i=1;i<=sqrt(a);i++)
{
if(a%i==0)
{
v1.push_back(i);
v2.push_back(a/i);
}
}
if(k<=v2.size())
{
k--;
return v2[k];
}
if(sqrt(a)*sqrt(a)==a){
k++;
}
k-=v2.size();
k=v1.size()-k;
return v1[k];
}
int main(){
int a,b,k;
cin>>a>>b>>k;
int hcf=gcd(a,b);
cout<<kfactor(hcf,k);
} | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res = res * x % mod;
return res;
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int c = min(a, b);
int cnt = 0;
while (cnt < k) {
if (a % c == 0 && b % c == 0) {
cnt++;
}
c--;
}
c++;
cout << c << endl;
return 0;
} | 1 | 10,616,003 |
#include<unordered_map>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<chrono>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
int main(){
int a=0,b=0,c;
for(int i=0;i<4;i++){
cin>>c;
a+=c;
}
for(int i=0;i<4;i++){
cin>>c;
b+=c;
}
cout<<max(a,b)<<endl;
} | #include <stdio.h>
main()
{
int ai,am,as,ae,bi,bm,bs,be,s,t;
scanf("%d %d %d %d %d %d %d %d",&ai,&am,&as,&ae,&bi,&bm,&bs,&be);
s = ai+am+as+ae;
t = bi+bm+bs+be;
if (s>t) printf("%d\n",s);
else printf("%d\n",t);
} | 1 | 65,419,575 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define RFOR(i, a, b) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;
using vb = vector<bool>;
using vi = vector<int>;
using vl = vector<i64>;
using vd = vector<double>;
using pi = pair<int, int>;
using pl = pair<i64, i64>;
using pd = pair<double, double>;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
template <typename T>
void print(T &v) {
for (auto it = v.begin(); it != v.end(); ++it) {
if (it == v.begin()) cout << " ";
cout << *it;
}
cout << endl;
}
bool dfs(vector<vector<pi>> &v, vb &visited, vi &x, int q) {
visited[q] = true;
for (auto &&u : v[q]) {
if (visited[u.fst]) {
if (x[u.fst] != x[q] + u.snd) return false;
continue;
} else {
x[u.fst] = x[q] + u.snd;
if (!dfs(v, visited, x, u.fst)) return false;
}
}
return true;
}
bool solve(vector<vector<pi>> &v, vb &visited, vi &x) {
REP(i, v.size()) {
if (visited[i]) continue;
if (!dfs(v, visited, x, i)) return false;
}
return true;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<pi>> v(n);
vi x(n);
vb visited(n);
REP(i, m) {
int l, r, d;
cin >> l >> r >> d;
l--;
r--;
v[l].pb(mp(r, d));
v[r].pb(mp(l, -d));
}
cout << (solve(v, visited, x) ? "Yes" : "No") << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define ll long long
#define vel vector<ll>
#define vvel vector<vel>
#define vvvel vector<vvel>
#define veb vector<bool>
#define pin pair<ll,ll>
#define mkp make_pair
#define mot pair<D,D>
#define path pair<ll,int>
#define int long long
using namespace std;
vvel ta_min(0);
vvel ta_max(0);
int leth = 1024 * 512;
int p = 1000000007;
vel par;
vel dis;
int n;
void mmax(ll &a, ll b) { a = max(a, b); }
void mmin(ll &a, ll b) { a = min(a, b); }
pin root(int ser) {
if (par[ser] == -1) {return mkp(ser,0);}
pin x=root(par[ser]);
x.second += dis[ser];
par[ser] = x.first;
dis[ser] = x.second;
return x;
}
void uni(int a, int b,int d) {
pin p1 = root(a);
pin p2 = root(b);
int a1 = p1.first;
int b1 = p2.first;
if (a1 != b1) {
par[b1] = a1;
dis[b1] = d + dis[a] - dis[b];
}
}
bool issame(int x, int y) {
return root(x).first == root(y).first;
}
void ref(int &x) { x = x % p; x = (x + p) % p; }
signed main() {
cin >> n; int m; cin >> m;
par = vel(n, -1);
dis = vel(n,0);
for (int i = 0; i < m; i++) {
int l, r; cin >> l >> r; l--; r--;
int d; cin >> d;
pin l1=root(l);
pin r1= root(r);
if (l1.first != r1.first ) { uni(r, l, d); }
else {
if (dis[r] + d == dis[l]) { uni(r, l, d); }
else { cout << "No" << endl; return 0; }
}
}
cout << "Yes" << endl;
return 0;
} | 1 | 52,593,529 |
#include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define yes printf("YES\n")
#define no printf("NO\n")
#define lin printf("\n")
#define lp(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define what(x) cerr << #x << " : " << x << "\n"
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
#define M 1000000007
#define N 100005
int main()
{
int n,m,q,i,j,a,b,k;
in2(n,m);
in(q);
vii vp;
while(q--)
{
in2(a,b);
lp(i,a-2,a+1)
{
lp(j,b-2,b+1)
{
if(i>0 && j>0 && i+2<=n && j+2<=m)
vp.pb(i,j);
}
}
}
sort(all(vp));
vi v(10,0);
i=0;
ll ans;
ans=n-2,ans*=(m-2);
n=vp.size();
while(i<n)
{
j=i,k=0;
while(j<n && vp[i]==vp[j])
j++;
k=j-i;
v[k]++;
i=j;
}
k=0;
lp(i,1,10)
k+=v[i];
llout(ans-k);
lp(i,1,10)
out(v[i]);
} | #include<bits/stdc++.h>
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define re register
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define per(i,n,m) for(int i=m;i>=n;i--)
#define rrep(i,m,n) for(register int i=m;i<=n;i++)
#define rper(i,n,m) for(register int i=m;i>=n;i--)
#define ull unsigned long long
using namespace std;
const int INF =1e9+10;
const int N = 5e6 + 10;
ll h,w,node[N],n,cnt,zero,ans[20];
signed main(){
scanf("%lld%lld%lld",&h,&w,&n);
zero=(h-2)*(w-2);
rep(i,1,n){
ll a,b;
scanf("%lld%lld",&a,&b);
for (int i=-2;i<=0;i++){
for (int j=-2;j<=0;j++){
if(a+i>=1 && a+i <=h-2 && b+j>=1 &&b+j <=w-2){
node[cnt++]=INF*(a+i)+(b+j);
}
}
}
}
sort(node,node+cnt);
for (int i=0,tmp=1;i<cnt;i++){
if(node[i]==node[i+1]) tmp++;
else {
ans[tmp]++;
zero--;
tmp = 1;
}
}
pl(zero);
puts("");
rep(i,1,9)printf("%lld\n",ans[i]);
return 0;
} | 1 | 41,567,202 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<62)-10e15;
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
LL N,K;
LL x[50],y[50];
LL ans = INF;
LL max_num(LL a,LL b,LL c,LL d){
return max(a,max(b,max(c,d)));
}
LL min_num(LL a,LL b,LL c,LL d){
return min(a,min(b,min(c,d)));
}
void solve(){
for(int a=0;a<N;a++){
for(int b=0;b<N;b++){
for(int c=0;c<N;c++){
for(int d=0;d<N;d++){
LL right = max_num(x[a],x[b],x[c],x[d]);
LL upper = max_num(y[a],y[b],y[c],y[d]);
LL left = min_num(x[a],x[b],x[c],x[d]);
LL bottom = min_num(y[a],y[b],y[c],y[d]);
int counter = 0;
for(int i=0;i<N;i++){
if(bottom<=y[i] && y[i]<=upper && left<=x[i] && x[i]<=right) counter++;
}
if(counter<K) continue;
ans = min(ans,(right-left)*(upper-bottom));
}
}
}
}
}
int main(){
cin >> N >> K;
for(int i=0;i<N;i++){
cin >> x[i] >> y[i];
}
solve();
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 51;
int mp[MAX_N][MAX_N];
ll X[MAX_N], Y[MAX_N];
pair<ll, ll> dot[MAX_N];
int N, K;
int minmp(int i, int j) {
if(i >= 0 && j >= 0) return mp[i][j];
else return 0;
}
int main()
{
cin >> N >> K;
for(int i = 0; i < N; ++i)
cin >> dot[i].first >> dot[i].second;
map<ll, int> x_index, y_index;
sort(dot, dot + N);
for(int i = 0; i < N; ++i) {
X[i] = dot[i].first;
x_index[dot[i].first] = i;
}
sort(dot, dot + N,
[](pair<ll, ll> &x, pair<ll, ll> &y){ return x.second < y.second; });
for(int i = 0; i < N; ++i) {
Y[i] = dot[i].second;
y_index[dot[i].second] = i;
}
for(int i = 0; i < N; ++i) {
ll x = dot[i].first, y = dot[i].second;
int nx = x_index[x], ny = y_index[y];
++mp[nx][ny];
}
for(int i = 0; i < N; ++i) {
for(int j = 1; j < N; ++j)
mp[i][j] += mp[i][j-1];
}
for(int i = 1; i < N; ++i) {
for(int j = 0; j < N; ++j)
mp[i][j] += mp[i-1][j];
}
ll res = LLONG_MAX;
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j) {
for(int k = i + 1; k < N; ++k) {
for(int l = j + 1; l < N; ++l) {
int num = 0;
ll lx = X[i], rx = X[k];
ll by = Y[j], uy = Y[l];
for(int m = 0; m < N; ++m) {
if(lx <= dot[m].first && dot[m].first <= rx
&& by <= dot[m].second && dot[m].second <= uy)
++num;
}
if(num >= K) res = min(res, (rx - lx)*(uy - by));
}
}
}
}
cout << res << endl;
return 0;
} | 1 | 92,639,140 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF=1LL<<60;
string s;
vector<int> a(1000010);
int main(){
cin>>s;
int n=s.size();
rep(i,0,n+1) if(s[i]=='<') chmax(a[i+1],a[i]+1);
per (i,n+1,0) if(s[i]=='>') chmax(a[i],a[i+1]+1);
ll ans=0;
rep(i,0,n+1) ans+=a[i];
cout<<ans<<"\n";
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
#define replm(i, l, r) for (ll i = l; i >= r; i--)
#define repm(i, n) repl(i, n , 0)
using namespace std;
using ll = long long;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const long long mod = 1e9 + 7;
int main() {
int i;
string S;
cin >> S;
ll N;
N = S.size() + 1;
vector<ll>a(N, 0);
ll count = 100;
while (count != 0) {
count = 0;
repl(i, 1, N) {
if (S[i - 1] == '<' && a[i - 1] >= a[i]) {
a[i] = a[i - 1] + 1;
count++;
}
}
replm(i, N - 1, 1) {
if (S[i - 1] == '>' && a[i - 1] <= a[i]) {
a[i - 1] = a[i] + 1;
count++;
}
}
}
ll ans = 0;
rep(i, N) {
ans += a[i];
}
cout << ans;
return 0;
} | 1 | 33,050,927 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define mrep(i,n) for(ll i=n;i>=0;--i)
#define all(a) (a).begin(),(a).end()
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vb vector<bool>
#define vvb vector<vector<bool> >
#define pl pair<ll,ll>
#define inf 1001001001001001000
#define mod 998244353
#define pi 3.1415926535
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
}__init;
int main(void) {
ll k, x;
cin >> k >> x;
if (500 * k >= x) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cstring>
int main()
{
int K, X;
std::cin >> K >> X;
if (K * 500 >= X) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
return 0;
} | 1 | 2,006,799 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int p, q, r, m;
int main() {
cin >> p >> q >> r;
m = max(max(p, q), r);
cout << p + q + r - m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int tm[3];
for (int i = 0; i < 3; i++) {
cin >> tm[i];
}
sort(tm, tm + 3);
cout << tm[0] + tm[1] << endl;
return 0;
} | 1 | 91,808,643 |
#include <stdio.h>
int
main()
{
for (;;)
{
int m, f, r;
scanf("%d %d %d", &m, &f, &r);
if (m == -1 && f == -1 & r == -1)
break;
if (m == -1 || f == -1) puts("F");
else if (m+f >= 80) puts("A");
else if (m+f >= 65) puts("B");
else if (m+f >= 50) puts("C");
else if (m+f >= 30 && r >= 50) puts("C");
else if (m+f >= 30) puts("D");
else puts("F");
}
return 0;
} | #include <stdio.h>
int main(){
int data_sets[10000], data_sets2[10000], data_sets3[10000];
int i = 0, j = 0;
for(i=0;;i++){
scanf("%d %d %d", &data_sets[i], &data_sets2[i], &data_sets3[i]);
if(data_sets[i]==-1&&data_sets2[i]==-1&&data_sets3[i]==-1) break;
}
for(j=0;j<i;j++){
if(data_sets[j]==-1 || data_sets2[j]==-1){
printf("F\n");
}else{
int temp_add = data_sets[j] + data_sets2[j];
if(temp_add >= 80){printf("A\n");}
else if(temp_add >= 65){printf("B\n");}
else if(temp_add >= 50){printf("C\n");}
else if(temp_add >= 30){if(data_sets3[j]>=50){printf("C\n");}else{printf("D\n");}}
else{printf("F\n");}
}
}
return 0;
} | 1 | 50,179,559 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODADD(ADD_X,ADD_Y) (ADD_X+ADD_Y)%MOD;
#define MODSUB(SUB_X,SUB_Y) (SUB_X-SUB_Y)+MOD)%MOD;
#define MODMUL(MUL_X,MUL_Y) (MUL_X*MUL_Y)%MOD;
#define LCM(LCM_X,LCM_Y) (LCM_X*LCM_Y)/__gcd(LCM_X,LCM_Y);
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
int dx[]= {1,0,-1,0,1,-1,1,-1};
int dy[]= {0,1,0,-1,1,-1,-1,1};
int main()
{
FastRead
string x,y;
int cnt=0;
cin>>x>>y;
for(int i=0;i<3;i++)
if(x[i]==y[i])
cnt++;
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <regex>
#include <iostream>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
string s, t;
int ans = 0;
cin >> s >> t;
if(s[0] == t[0]) ans++;
if(s[1] == t[1]) ans++;
if(s[2] == t[2]) ans++;
cout << ans << endl;
return 0;
} | 1 | 12,645,565 |
#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() {
double l;
cin >> l;
double ans = l*l*l/27;
printf("%.7f\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
double n,i,l;
cin>>l;
double k,m;
m=l*l*l/27;
cout << fixed << setprecision(6) <<m<<endl;
} | 1 | 21,679,465 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define all(a) (a).begin(),(a).end()
#define X first
#define Y second
using namespace std;
const int mod=1e9+7;
void solve()
{
int n,k; cin>>n>>k;
int a[n],b[k+1]; b[0]=1;
for(int i=0;i<n;i++)cin>>a[i];
int dp[k+1];
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=0;i<n;i++)
{
for(int j=1;j<=k;j++)b[j]=(dp[j]+b[j-1])%mod;
for(int j=1;j<=k;j++)
{
if(j-a[i]-1<0)dp[j]=b[j];
else dp[j]=(b[j]-b[j-a[i]-1]+mod)%mod;
}
}
cout<<dp[k];
return;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t; t=1;
while(t--)solve();
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll dp[101][100001];
ll solve(int i, int j, int A[]){
if(j<0) return 0;
if(dp[i][j]!=-1) return dp[i][j];
if(i==1 && j>A[i-1]) return 0;
if(i==1 && j<=A[i-1]) return 1;
ll op=0;
dp[i][j]=(mod+solve(i,j-1,A)+solve(i-1,j,A)-solve(i-1,j-A[i-1]-1,A))%mod;
return dp[i][j];
}
int main(){
int n, k; cin>>n>>k;
int A[n];
memset(dp,-1,sizeof(dp));
for(int i=0;i<n;i++) cin>>A[i];
cout<<solve(n,k,A);
} | 1 | 98,417,418 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N;
string S;
ll mod = 1e9+7;
cin >> N >> S;
vector<ll> c(26,1);
for(auto ss : S){
c[ss-'a']++;
c[ss-'a'] %= mod;
}
ll ans = 1;
for(auto cc : c){
ans *= cc;
ans %= mod;
}
ans--;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<int> VI;
typedef pair<ll,ll> PLL;
typedef pair<int,int> PII;
#define pb push_back
#define F first
#define S second
#define SZ(a) int((a).size())
#define ALL(a) a.begin(),a.end()
#define fr(i,x,y) for(int i=x;i<y;i++)
#define frr(i,x,y) for(int i=x-1;i>=y;i--)
#define inf 1e18+1
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int mod=1000000007;
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll power(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;}a=a*a;b>>=1;}return ans;}
ll powerm(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;ans%=mod;}a=a*a;a%=mod;b>>=1;}return ans%mod;}
void solve()
{
ll n;
cin>>n;
string str;
cin>>str;
VL arr(26,0);
fr(i,0,n)
{
arr[str[i]-'a']++;
}
ll prod=1;
fr(i,0,26)
{
prod*=(arr[i]+1);
prod%=mod;
}
prod+=(mod-1);
prod%=mod;
cout<<prod<<endl;
return;
}
int main()
{
IOS;
ll t=1;
while(t--)
{
solve();
}
return 0;
} | 1 | 50,835,731 |
#include <iostream>
using namespace std;
int main()
{
int a;
int b;
int c;
cin >> a >> b >> c;
if (a <= 500 && a >= 1 && b <= 500 && b >= 1){
if (c <= 1000){
if (a + b >= c){
cout << "Yes";
}else{
cout << "No";
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll MRINF = 5000000000000000;
int main() {
int A, B, C;
cin >> A >> B >> C;
if(A+B>=C) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 21,152,425 |
#include<bits/stdc++.h>
using namespace std;
void min_self(int & a, int b){
if(b<a)
a=b;
}
int main(){
int h,w;
cin >> h >> w;
string grid[h];
for(int i =0;i<h;i++)
cin >> grid[i];
int dp[h][w];
dp[0][0] = 0;
for(int i =0;i<h;i++){
for(int j = 0;j<w;j++){
if(i+j==0)
dp[0][0] = (grid[0][0]=='#');
else{
dp[i][j] = INT_MAX;
if(i>0){
min_self(dp[i][j],dp[i-1][j]+(grid[i][j]=='#' && grid[i-1][j]=='.'));
}
if(j>0)
min_self(dp[i][j],dp[i][j-1]+(grid[i][j]=='#' && grid[i][j-1]=='.'));
}
}
}
cout << dp[h-1][w-1] << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template<typename T>
void vprint(vector<T> v) {
for(auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template<typename T>
void vvprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) {
cerr << vv[i][j] << " ";
}
cerr << endl;
}
}
template<typename T1, typename T2>
void vpprint(vector<pair<T1, T2>> vp) {
REP(i, SIZE(vp)) {
cerr << vp[i].first << ", " << vp[i].second << endl;
}
}
template<typename T1, typename T2>
void mprint(map<T1, T2> m) {
for(auto x : m) cerr << x.first << ", " << x.second << endl;
}
void yesno(bool flg) {
cout << (flg ? "Yes" : "No") << endl;
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T lcm(T a, T b) {
return (a / __gcd(a, b)) * b;
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 0) return 1;
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
#define FACT_SZ 100010
VLL _fact, _inv;
bool _fact_flg = true;
void _fact_init() {
_fact = VLL(FACT_SZ);
_inv = VLL(FACT_SZ);
_fact[0] = 1;
FOR(i, 1, FACT_SZ) _fact[i] = (_fact[i-1] * i) % MOD;
_inv[FACT_SZ-1] = mypow(_fact[FACT_SZ-1], MOD - 2);
for(int i = FACT_SZ - 2; i >= 0; i--) {
_inv[i] = ((i + 1) * _inv[i + 1]) % MOD;
}
}
LL mycomb(LL n, LL k) {
if(_fact_flg) {
_fact_flg = false;
_fact_init();
}
if(n < k) return 0;
return (((_fact[n] * _inv[k]) % MOD) * _inv[n-k]) % MOD;
}
VLL par, rnk, sz;
int root(int x) {
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
x = root(x);
y = root(y);
return x == y;
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
#define INF 1e15
typedef tuple<LL, LL, LL> T;
int main(void) {
LL h, w;
cin >> h >> w;
VVLL b(h, VLL(w, 0));
REP(i, h) {
string s;
cin >> s;
REP(j, w) if(s[j] == '#') b[i][j] = 1;
}
VVLL dst(h, VLL(w, INF));
dst[0][0] = b[0][0];
priority_queue<T, vector<T>, greater<T>> q;
q.push(make_tuple(dst[0][0], 0, 0));
VVI done(h, VI(w, 0));
while(!q.empty()) {
auto t = q.top();
q.pop();
LL sy = get<1>(t), sx = get<2>(t);
LL dy[] = {1, 0};
LL dx[] = {0, 1};
REP(i, 2) {
LL ty = sy + dy[i], tx = sx + dx[i];
if(ty >= h || tx >= w) continue;
if(done[ty][tx]) continue;
if(dst[ty][tx] > dst[sy][sx] + (!b[sy][sx] && b[ty][tx])) {
dst[ty][tx] = dst[sy][sx] + (!b[sy][sx] && b[ty][tx]);
q.push(make_tuple(dst[ty][tx], ty, tx));
}
}
done[sy][sx] = 1;
}
cout << dst[h-1][w-1] << endl;
} | 1 | 66,027,405 |
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const int MAX_N=8000;
string s;
int N;
vector<int> vx,vy;
int x,y;
bool C(const vector<int> &vec,int v){
bitset<MAX_N*2+1> dp;
dp[MAX_N]=true;
for(auto i:vec){
dp=(dp<<i)|(dp>>i);
}
if (v<-MAX_N){
return false;
}
return dp[v+MAX_N];
}
int main(){
cin>>s>>x>>y;
N=s.size();
{
bool f=false;
REP(i,N){
int j;
for(j=i;j<N && s[j]=='F';j++){
}
if (!f){
if (i==0){
x-=j-i;
}else{
vx.push_back(j-i);
}
}else{
vy.push_back(j-i);
}
f=!f;
i=j;
}
}
cout<<(C(vx,x) && C(vy,y) ? "Yes" : "No")<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace::std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace::std;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"");if(i>INF/2)cout<<"INF";else cout<<i;f=1;}cout<<"\n";}while(0)
#define output2(v) for(auto j:v)output(j);
#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define LINF 9223372036854775807
#define MOD 1000000007
#define endl "\n"
template<typename T=lint>T in(){return *istream_iterator<T>(cin);}
inline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}
inline lint lcm(lint a,lint b){return a*b/gcd(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};
int main(){
string s;
cin>>s;
lint x,y;
cin>>x>>y;
vec a,b;
lint cnt=0;
bool f=0;
rep(i,s.size()){
if(s[i]=='F')cnt++;
else {
f=!f;
if(f)a.push_back(cnt);
else b.push_back(cnt);
cnt=0;
}
}
f=!f;
if(f)a.push_back(cnt);
else b.push_back(cnt);
set<lint>dx,dy,dx2,dy2;
if(a.size()==0)dx.insert(0);
else dx.insert(a[0]);
dy.insert(0);
repi(i,1,a.size()){
dx2.clear();
for(lint d:dx){
dx2.insert(d+a[i]);
dx2.insert(d-a[i]);
}
dx=dx2;
}
rep(i,b.size()){
dy2.clear();
for(lint d:dy){
dy2.insert(d+b[i]);
dy2.insert(d-b[i]);
}
dy=dy2;
}
if(dx.count(x)&&dy.count(y))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 1 | 96,275,603 |
#include <iostream>
using namespace std;
int main() {
for (;;) {
int H, W;
cin >> H >> W;
if (H == 0 && W == 0) {
break;
} else {
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
}
} | #include <iostream>
int main() {
while( true ) {
int h , w ;
std::cin >> h >> w ;
if( h == 0 && w == 0 ) {
break ;
} else {
for( int i = 0 ; i < h ; i++ ) {
for( int ii = 0 ; ii < w ; ii++ ) {
std::cout << "#" ;
}
std::cout << std::endl ;
}
std::cout << std::endl ;
}
}
} | 1 | 5,998,230 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using P =pair<int,int>;
int main(){
int n;cin>>n;
vector<int>p(n);
vector<int>q(n);
rep(i,n)cin>>p[i];
rep(i,n)cin>>q[i];
int ans1=0;
int ans2=0;
do{
ans1++;
}while(next_permutation(p.begin(),p.end()));
do{
ans2++;
}while(next_permutation(q.begin(),q.end()));
cout<<abs(ans1-ans2);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int>a(n);
vector<int>p(n);
vector<int>q(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
rep(i, n) a[i]=i+1;
map<vector<int>,int> mp;
int i = 0;
do {
mp[a] = ++i;
}
while(next_permutation(a.begin(), a.end()));
cout << abs(mp[p]-mp[q]) << endl;
return 0;
} | 1 | 91,774,928 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N,M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int min_R;
int max_L;
for(int i=0;i<M;i++){
cin >> L[i] >> R[i];
}
for(int i=0;i<M;i++){
if(i==0){
min_R = R[i];
max_L = L[i];
}
else if(min_R > R[i]){
min_R = R[i];
}
else if(max_L < L[i]){
max_L = L[i];
}
}
int ans;
ans = min_R - max_L + 1;
if(ans<=0){
ans = 0;
}
cout << ans << endl;
} | #include<stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
int n, m;
scanf("%d %d", &n, &m);
int L, R;
int l=-1e9, r=1e9;
for (int i = 0; i < m; i++){
scanf("%d %d", &L, &R);
L = max(L, l);
l = L;
R = min(r, R);
r = R;
}
if (R - L + 1 < 0) {
printf("0");
return 0;
}
printf("%d",R-L+1);
} | 1 | 82,817,782 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a,int b){
while(b!=0){
int r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n){
cin >> a.at(i);
}
int ans=gcd(a.at(0),a.at(1));
rep(i,n){
ans=gcd(a.at(i),ans);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0;i < n;i++){
cin >> a[i];
}
ll ans = a[0];
for (ll i = 1; i < n; i++){
ans = gcd(ans, a[i]);
}
cout << ans << endl;
} | 1 | 84,627,245 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B; string S;
cin >> A >> B >> S;
int N= A+1;
int M= A+B+1;
bool ans=true;
for(int i=0; i<A; i++) {
if(S[i]=='-') ans =false;
}
for(int i=N; i<M; i++) {
if(S[i]=='-') ans =false;
}
if(S[A]!='-') ans=false;
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B;
cin>>A>>B;
string S;
cin>>S;
bool res=true;
for(int i=0;i<S.size();i++){
if(i==A){
if(isdigit(S[i])!=0){
res=false;
}
}
else{
if(S[i]=='-'){
res=false;
}
}
}
if(res){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 1 | 94,028,516 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
string S;
cin >> N >> S;
vector<ll> vec(2 * N);
vec[0] = 0;
rep(i,2 * N - 1){
if (S[i + 1] == S[i]){
if (vec[i] == 0) vec[i + 1] = 1;
if (vec[i] == 1) vec[i + 1] = 0;
}
else{
vec[i + 1] = vec[i];
}
}
vector<ll> left(2 * N, 0);
vector<ll> right(2 * N, 0);
ll ans = 1;
left[0] = 1;
rep(i,2 * N - 1){
if (vec[i + 1] == 0) left[i + 1]++;
if (vec[i + 1] == 1) right[i + 1]++;
left[i + 1] += left[i];
right[i + 1] += right[i];
}
vector<ll> fact(100005);
fact[0] = 1;
for (ll i = 1; i < 100005; i++){
fact[i] = (fact[i - 1] * i) % 1000000007;
}
rep(i,2 * N - 1){
if (vec[i + 1] == 1){
ans = (ans * (left[i] - right[i])) % 1000000007;
}
}
bool possible = true;
if (S[0] == 'W') possible = false;
if (left[2 * N - 1] != right[2 * N - 1]) possible = false;
if (!possible) cout << 0 << endl;
else{
cout << (ans * fact[N]) % 1000000007 << endl;
}
} | #include<bits/stdc++.h>
#define fo(i,a,b) for((i)=(a);i<=(b);i++)
#define rfo(i,a,b) for((i)=(a);i>=(b);i--)
#define inrange(x,y,z) (((x)>=(y))&&((x)<=(z)))
#define ALL(vec) ((vec).begin(),(vec).end())
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)),(vec).end())
using namespace std;
int n,lst,cur,cnt[2];
string s;
long long res,MOD=1000000007LL;
int main(){
#ifdef FILIN
#ifndef DavidDesktop
freopen(FILIN,"r",stdin);
freopen(FILOUT,"w",stdout);
#endif
#endif
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>s;
lst=0;
res=1LL;
cnt[0]=1;
if(s[0]=='W'||s[n*2-1]=='W'){cout<<0<<endl;return 0;}
for(int i=1;i<n*2;i++){
if(s[i]==s[i-1]) cur=1-lst;
else cur=lst;
if(cur==0&&i==n*2-1){cout<<0<<endl;return 0;}
if(cur==1){
if(cnt[0]<=cnt[1]){cout<<0<<endl;return 0;}
res=(res*(long long)(cnt[0]-cnt[1]))%MOD;
}
cnt[cur]++;
lst=cur;
}
if(cnt[0]-cnt[1]>0)
res=0;
for(int i=1;i<=n;i++) res=(res*(long long)(i))%MOD;
cout<<res<<endl;
return 0;
} | 1 | 31,083,287 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n, times=0;
cin >> n;
int A[n];
for(int i = 0; i<n; i++){
cin >> A[i];
}
int minj;
for(int i = 0; i<n; i++){
minj = i;
for(int j = i; j<n; j++){
if(A[j] < A[minj]){
minj = j;
}
}
if(i != minj){
swap(A[i],A[minj]);
times++;
}
}
for(int i = 0; i<n-1; i++){
cout << A[i] << " ";
}
cout << A[n-1] << endl;
cout << times << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i<n; i ++) cin >> a[i];
int count = 0;
for(int i = 0; i < n; i ++) {
int minj = i;
for(int j = i; j < n; j ++) {
if(a[j] < a[minj]) minj = j;
}
if(i != minj) count ++;
swap(a[i], a[minj]);
}
for(int i = 0; i < n; i ++) {
if(i==n-1) cout << a[i] << endl;
else cout << a[i] << " ";
}
cout << count << endl;
return 0;
} | 1 | 86,739,501 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
using P = pair<int,int>;
int main() {
int h,w,d;
cin >> h >> w >> d;
vector<P> p(h*w+1);
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
int a;
cin >> a;
p[a] = {i,j};
}
}
vector<long> csum(h*w+1, 0);
for (int i=1; i<=h*w; i++) {
if (i+d > h*w) break;
int dist = abs(p[i].first - p[i+d].first) + abs(p[i].second - p[i+d].second);
csum[i+d] += csum[i];
csum[i+d] += dist;
}
int q;
cin >> q;
for (int i=0; i<q; i++) {
int l,r;
cin >> l >> r;
cout << csum[r] - csum[l] << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,d,a,q,l,r,i,j;
cin>>h>>w>>d;
vector<int> x(h*w),y(h*w);
vector<vector<int>> z(d,vector<int>(0));
for(i=0;i<h;i++){
for(j=0;j<w;j++){
cin>>a;
x.at(a-1)=i;
y.at(a-1)=j;
}
}
for(i=0;i<h*w;i++){
if(i/d==0) z.at(i%d).push_back(0);
else z.at(i%d).push_back(z.at(i%d).at(i/d-1)+abs(x.at(i)-x.at(i-d))+abs(y.at(i)-y.at(i-d)));
}
cin>>q;
for(i=0;i<q;i++){
cin>>l>>r;
l--;
r--;
cout<<z.at(r%d).at(r/d)-z.at(l%d).at(l/d)<<endl;
}
} | 1 | 58,836,604 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string n;
cin >> n;
for (char& c : n) {
if (c == '1') {
c = '9';
} else {
c = '1';
}
}
cout << n << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
string n;
cin >> n;
for(int i = 0; i < n.length(); i++){
if(n[i] == '1') n[i] = '9';
else n[i] = '1' ;
}
cout << stoi(n) << endl;
return 0;
} | 1 | 54,397,275 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
if((a+b)>=c){
cout<<"Yes";
}
else{
cout<<"No";
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main() {
ll A, B, C;
cin >> A >> B >> C;
if((A + B) - C >= 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 18,567,593 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define pai 3.14159265358979323846
ll gcd(ll a, ll b){if (a%b == 0) return(b);else return(gcd(b, a%b));}
ll lcm(ll a, ll b){return a * b / gcd(a, b);}
pair <int,int> rotate (pair<int,int>,pair<int,int>);
int main() {
pair <int,int> p1, p2, p3,p4;
cin >> p1.first >> p1.second >> p2.first >> p2.second;
p3 = rotate(p1,p2);
p4 = rotate(p2,p3);
cout << p3.first << ' ' << p3.second << ' ';
cout << p4.first << ' ' << p4.second << endl;
}
pair <int, int> rotate(pair<int,int> s,pair<int,int> t) {
pair <int,int> p;
p.first = s.second - t.second + t.first;
p.second = t.second - s.first + t.first;
return p;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
ll x1,y1,x2,y2; cin >> x1 >> y1 >> x2 >> y2;
ll dif_x = x2-x1;
ll dif_y = y2-y1;
printf("%d %d %d %d\n",x2-dif_y,y2+dif_x,x1-dif_y,y1+dif_x);
} | 1 | 12,636,046 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
}
}
ans += sum / 2;
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector < ll >
#define vll vector < ll >
#define dt cout<<"HERE\n";
#define pii pair < ll , ll >
#define pll pair < ll , ll >
#define vpi vector < pii >
#define vpl vector < pll >
#define fi first
#define se second
#define sz size
#define len length
const ll inf=1e18+1e17;
const ll mod =1e9+7;
ll modInverse(ll a,ll m){ll m0=m;ll y=0,x=1;if(m == 1)return 0;while(a> 1){ll q=a/m;ll t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=m0;return x;}
ll powm(ll a,ll b){a=a%mod;ll res=1;while(b){if(b&1)res=(res*a)%mod;a= (a*a)%mod;b>>=1;}return (res%mod);}
const int N=1e5+5;
ll arr[N];
void solve(){
int n;
cin>>n;
for ( int i=0;i<n;i++)
cin>>arr[i];
arr[n]=0;
n++;
ll cnt=0,ans=0;
for ( int i=0;i<n;i++){
if ( arr[i]==0){
ans+=cnt/2;
cnt=arr[i];
}
else
cnt+=arr[i];
}
cout<<ans<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie( NULL);
cout.tie(NULL);
ll t=1;
for ( ll i=1;i<=t;i++){
solve();
}
} | 1 | 27,406,093 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, K;
ll S, d;
cin >> N >> K >> S;
d = INF;
if(S == INF){
d = 1;
}
rep(i, K){
cout << S << " ";
}
rep(i, N - K){
cout << d << " ";
}
cout << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include<iomanip>
using namespace std;
typedef long long ll;
int main() {
int N, K, S;
cin >> N >> K >> S;
vector<int> A(N, 1e9);
for (int i = 0; i < K; i++) A[i] = S;
if (S == 1e9) {
for (int i = K; i < N; i++) A[i] = 1;
}
for (int i = 0; i < N; i++) {
cout << A[i] << " ";
}
} | 1 | 51,157,405 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int m = BIG_NUM;
for (int i = 0; i < n - 1; i++) {
int s1 = 0;
for (int j = 0; j <= i; j++) {
s1 += w[j];
}
int s2 = 0;
for (int j = i + 1; j < n; j++) {
s2 += w[j];
}
m = min(m, abs(s1 - s2));
}
cout << m << endl;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n,w[100],i,j,k,a,b,ans,s1,s2;
cin>>n;
s1=0;s2=0;
for(i=0;i<n;i++)
{
cin>>w[i];
}
i=0;
j=n-1;
while(1)
{
if(s1<=s2){s1+=w[i];i++;}
else{s2+=w[j];j--;}
if(i==j)
{
if(s1<=s2){s1+=w[i];i++;}
else{s2+=w[j];j--;}
break;
}
}
cout<<abs(s1-s2)<<endl;
} | 1 | 92,007,559 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define iof freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define pi acos(-1)
const int mxn=1e9+5;
int main()
{
fast;
ll n,k;
cin>>n>>k;
vector<ll>p(n);
vector<ll>cost(n);
for(auto &i:p)
{
cin>>i;
i--;
}
for(auto &i:cost)
{
cin>>i;
}
ll mx=-1e18-5;
ll ans=-1e18-5;
for(ll i=0;i<n;i++)
{
vector<ll>vec;
ll sum=0;
ll x=i;
while(true)
{
x=p[x];
sum+=cost[x];
vec.pb(sum);
if(x==i)break;
}
ll loop=k/vec.size();
ll r=k%vec.size();
if(vec.back()>0&&k>vec.size())
{
ll mx1=-1e18-5;
for(auto i:vec)
{
mx1=max(mx1,i);
}
ans=max(ans,(loop-1)*vec.back()+mx1);
mx1=-1e9-5;
for(int i=0;i<(ll)r;i++)
{
mx1=max(mx1,vec[i]);
}
ans=max(ans,loop*vec.back()+mx1);
}
else
{
for(int i=0;i<(ll)min((ll)vec.size(),k);i++)
{
ans=max(ans,vec[i]);
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, K;
cin >> N >> K;
vec<ll> P(N);
rep(i, N) cin >> P[i], --P[i];
vec<ll> C(N);
rep(i, N) cin >> C[i];
ll ans = -1e18 - 9;
rep(i, N) {
ll now = i;
ll smS = 0;
vec<ll> t;
while (1) {
smS += C[now];
t.push_back(smS);
now = P[now];
if (now == i) break;
}
int L = t.size();
rep(j, L) {
ll zan = K - (j + 1);
if (zan < 0) break;
ll tmp = t[j];
ll e = zan / L;
ans = max({ans, tmp, tmp + smS * e});
}
}
cout << ans << '\n';
} | 1 | 64,404,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
ll dp[2000];
int main() {
ll s;
cin >> s;
dp[0] = 1;
rep2(i, 3, s + 1) {
dp[i] = dp[i - 1] + dp[i - 3];
dp[i] %= MOD;
}
cout << dp[s] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
return vector<vector<T>>( r, vector<T>( c, v ) ) ;
}
template<class T>
auto matrix( int o1, int o2, int o3, T v ){
return vector<vector<vector<T>>>( o1, vector<vector<T>>( o2, vector<T>( o3, v ) ) ) ;
}
#define v vector
int power( int x, int n ){
if( n == 0 ) return 1 ;
else if( n & 1 ) return ( x * power( (x*x) % mod, n / 2 ) ) % mod ;
return power( (x*x) % mod, n / 2 ) % mod ;
}
signed main(){
int s ; cin >> s ;
v<int> dp( s + 1, 0 ) ;
dp[0] = 1 ;
for( int i = 3 ; i <= s ; i++ ){
for( int j = 3 ; ( i - j ) >= 0 ; j++ ){
( dp[i] += dp[i-j] ) %= mod ;
}
}
cout << dp[s] ;
return 0 ;
} | 1 | 21,691,356 |
#include <iostream>
#include <vector>
using namespace std;
vector<long long> L, S;
long long rec(int N, long long X) {
if (N == 0) return 1;
if (X == 1) return 0;
else if (X <= L[N-1] + 1) return rec(N-1, X-1);
else if (X == L[N-1] + 2) return S[N-1] + 1;
else if (X <= L[N-1] * 2 + 2)
return rec(N-1, X - L[N-1] - 2) + S[N-1] + 1;
else return S[N-1] * 2 + 1;
}
int main() {
int N;
long long X;
cin >> N >> X;
L.assign(N+1, 1), S.assign(N+1, 1);
for (int n = 1; n <= N; ++n) {
L[n] = L[n-1] * 2 + 3;
S[n] = S[n-1] * 2 + 1;
}
cout << rec(N, X) << endl;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll DIV = 1000000007;
vector<ll> _dfs(ll start, const ll& depth, vector<ll>& burger)
{
vector<ll> next_burger;
if(start != depth)
{
if(start == 0)
{
next_burger.push_back(1);
}
else
{
next_burger.push_back(0);
next_burger.insert(next_burger.end(), burger.begin(), burger.end());
next_burger.push_back(1);
next_burger.insert(next_burger.end(), burger.begin(), burger.end());
next_burger.push_back(0);
}
start++;
burger = _dfs(start, depth, next_burger);
}
return burger;
}
ll dfs(ll N, ll X, vector<ll> & all, vector<ll>& p)
{
if(N==0)
{
if(X<=0) return 0;
else return 1;
}else if(X <= 1 + all[N-1])
{
return dfs(N-1, X-1, all, p);
}else
{
return p[N-1] + 1 + dfs(N-1, X - all[N-1] - 2, all, p);
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long N, X;
cin >> N >> X;
vector<ll> all(N);
vector<ll> p(N);
for(size_t i=0;i<N; i++)
{
if(i==0)
{
all[0] = 1;
p[0] = 1;
}else
{
all[i] = 2 * all[i-1] + 3;
p[i] = 2* p[i-1] + 1;
}
}
cout << dfs(N, X, all, p) << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
} | 1 | 55,750,538 |
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
int cnt = 0;
for(int a = 0; a <= 9; a++)
for(int b = 0; b <= 9; b++)
for(int c = 0; c <= 9; c++)
for(int d = 0; d <= 9; d++)
if(a + b + c + d == n) cnt++;
cout << cnt << endl;
}
} | #include <cstdio>
int main(void)
{
int a, b, c, d, n, cnt;
while (std::scanf("%d", &n) != EOF) {
cnt = 0;
for (a = 0; a <= 9; a++) {
for (b = 0; b <= 9; b++) {
for (c = 0; c <= 9; c++) {
for (d = 0; d <= 9; d++) {
if (a + b + c + d == n) {
cnt++;
}
}
}
}
}
std::printf("%d\n", cnt);
}
return 0;
} | 1 | 98,419,910 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
int N, M; cin >> N >> M;
vector<int> A(N), B(N), C(M), D(M), ans(N);
for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
for(int i = 0; i < M; i++) cin >> C[i] >> D[i];
for(int i = 0; i < N; i++){
int dis = 1e9, cp = 1;
int a = A[i], b = B[i];
for(int j = 0; j < M; j++){
int c = C[j], d = D[j];
int temp = abs(c-a) + abs(d-b);
if(temp < dis) {
dis = temp;
cp = j+1;
}
}
ans[i] = cp;
}
for(auto x : ans) cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
typedef long long ll;
ll A[51],B[51],C[51],D[51];
void solve()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;++i){
cin>>A[i]>>B[i];
}
for(int i=1;i<=m;++i){
cin>>C[i]>>D[i];
}
int ans;
for(int i=1;i<=n;++i){
ll small=1e16;
for(int j=1;j<=m;++j){
if(abs(A[i]-C[j])+abs(B[i]-D[j])<small){
small=abs(A[i]-C[j])+abs(B[i]-D[j]);
ans=j;
}
}
cout<<ans<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 52,751,067 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m), b(m);
rep(i, m) std::cin >> a[i] >> b[i];
std::map<int, int> map;
rep(i, m) {
if (b[i] == n) {
map[a[i]]++;
}
}
rep(i, m) {
if (a[i] == 1 && map[b[i]] > 0) {
std::cout << "POSSIBLE" << std::endl;
return 0;
}
}
std::cout << "IMPOSSIBLE" << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> v(N, vector<int>());
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v.at(a - 1).push_back(b - 1);
v.at(b - 1).push_back(a - 1);
}
for (int i = 0; i < v.at(0).size(); i++) {
int n = v.at(0).at(i);
if (v.at(n).size() == 0) continue;
for (int j = 0; j < v.at(n).size(); j++) {
if (v.at(n).at(j) == N - 1) {
cout << "POSSIBLE" << endl;
return 0;
}
}
}
cout << "IMPOSSIBLE" << endl;
} | 1 | 73,400,595 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int m=1e9+7;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio
int a,b,k;
cin>>a>>b>>k;
for(int i=min(a,b);i>0;--i){
if(a%i==0 && b%i==0) --k;
if(k==0){
cout<<i;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int a, b, k, i;
cin >> a >> b >> k;
vector<int> vec;
for(i = min(a, b); i > 0; i--) {
if(a % i == 0 && b % i == 0) {
vec.push_back(i);
}
}
cout << vec[k - 1] << '\n';
return 0;
} | 1 | 7,201,286 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main(){
ll n; cin >> n;
ll dp[n + 1] = {0};
dp[0] = 1;
for(ll i = 3; i <= n; ++i){
for(ll j = 3; j <= n; ++j){
if(i - j >= 0){
dp[i] += dp[i - j];
dp[i] %= mod;
}
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const ll mod = 1000000007;
ll calcA(vector<ll> a, int n) {
ll res = (a[n-1]+a[n-3]) % mod;
return res;
}
int main(void){
int s;
cin >> s;
vector<ll> a(s+1);
a[0] = 1;
a[1] = a[2] = 0;
for (int i = 3; i <= s; i++) {
a[i] = calcA(a, i);
}
cout << a[s] << endl;
return 0;
} | 1 | 54,277,262 |
#include <stdio.h>
#include <time.h>
#include <math.h>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <complex>
#include <cmath>
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
#define vvsort(v) sort(v.rbegin(),v.rend())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
string s;
int main() {
cin >> s;
string t="";
for (int i = s.length() - 1; i >= 0; i--) {
t += s[i];
}
cout << t << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++){
cout << str[str.size()-i-1];
}
cout << "\n";
cin >> str;
} | 1 | 27,535,557 |
#include <iostream>
using namespace std;
int main()
{
int d;
int n;
long square[600], s;
int max=0;
int i;
square[0]=0;
while(cin>>d){
n=600/d-1;
if(max<n){
for(i=max+1; i<=n; i++){
square[i]=square[i-1]+i*i;
}
max=n;
}
s=square[n]*d*d*d;
printf("%ld\n", s);
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int d;
while(cin >> d){
int area = 0;
for(int x = d; x <= 600-d; x += d){
area += x * x * d;
}
cout << area << endl;
}
return(0);
} | 1 | 48,207,538 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int r[n+1],c[n+1];
for (int i=1; i<n+1; i++) {
cin >> r[i] >> c[i];
}
int dp[n+1][n+1];
memset(dp,0,sizeof(dp));
for (int i=1; i<=n; i++) {
for (int j=1; j<=i; j++) {
if (j==1) {
continue;
}
if (j==2) {
dp[i][j]=r[i-1]*r[i]*c[i];continue;
}
int m;
for (int k=1; k<j; k++) {
if (k==1) {
m=dp[i][j-1]+r[i-j+1]*c[i-j+1]*c[i];
}
else m=min(m,dp[i-j+k][k]+dp[i][j-k]+r[i-j+1]*c[i-j+k]*c[i]);
}
dp[i][j]=m;
}
}
cout << dp[n][n] << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#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 <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rs(n + 1);
for (int i = 0; i < n; i++) {
int r, c;
cin >> r >> c;
rs[i] = r;
rs[i + 1] = c;
}
vector<vector<int>> dp(n + 1, vector<int>(n + 1, 1 << 25));
for (int i = 0; i <= n; i++) {
dp[i][i] = 0;
}
for (int j = 1; j < n; j++) {
for (int i = 0; i <= n - j; i++) {
for (int k = i + 1; k <= i + j; k++) {
dp[i][i + j] = min(dp[i][i + j], dp[i][k - 1] + dp[k][i + j] + rs[i] * rs[k] * rs[i + j + 1]);
}
}
}
cout << dp[0][n - 1] << endl;
} | 1 | 37,631,135 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
long double ans = 0.00000000;
long double coin = 0.00000000;
for (int i = 0; i < N; i++) {
long double x;
cin >> x;
string tmp;
cin >> tmp;
if (tmp == "JPY") ans += x;
else coin += x;
}
cout << ans + coin*380000.0 << endl;
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
long n;cin>>n;
long og=0;
double bg = 0;
for(int i = 0;i<n;i++){
double x;
string u;
cin>>x>>u;
if(u == "JPY") og += x;
if(u == "BTC") bg+= x;
}
bg = bg*380000.0;
cout<<og+bg;
return 0;
} | 1 | 66,017,303 |
#include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, class T2> using P = pair<T1, T2>;
using I = int;
using D = double;
using B = bool;
using C = char;
using S = string;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = P<I, I>;
using VPII = V<PII>;
using PLL = P<LL, LL>;
using VPLL = V<PLL>;
using VI = V<I>;
using VVI = VV<I>;
using VLL = V<LL>;
using VVLL = VV<LL>;
using VC = V<C>;
using VVC = VV<C>;
using VS = V<S>;
using VVS = VV<S>;
using VB = V<B>;
using VVB = VV<B>;
#define REP(type, i, n) for (type i = 0; i < (type)(n); ++i)
#define REP2(type, i, m, n) for (type i = (m); i < (type)(n); ++i)
#define REPR(type, i, n) for (type i = (n)-1; i >= 0; --i)
#define REPR2(type, i, m, n) for (type i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a, type) sort(ALL(a), greater<type>())
#define SORTF(a, comp) sort(ALL(a), comp)
#define REVERSE(a) reverse(ALL(a))
#define SIZE(a, type) ((type)(a).size())
#define bit_search(bit, n) REP(LL, bit, 1LL<<(n))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) lower_bound(ALL(a), (x)) - a.begin()
#define bisect_right(a, x) upper_bound(ALL(a), (x)) - a.begin()
#define INPUT(a) REPx(&x, a) cin >> x;
#define INPUT2(a) REPx(&x, a) INPUT(x);
#define INPUTP(a) REPx(&x, a) cin >> x.first >> x.second;
#define ENDL cout << endl;
const int INF = 2e9;
const LL MOD = 1e9+7;
template<class T> using PRIORITY_QUEUE = priority_queue< T, V<T>, greater<T> >;
template<class T> inline bool chmin(T &a, T b){if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){if (a < b) {a = b; return true;} return false;}
template<class T> inline void debug1(V<T> A){REP(int, i, SIZE(A, int)){if (A[i] == INF) cout << "I ";else cout << A[i] << " ";}ENDL}
template<class T> inline void debug2(VV<T> A){REP(int, i, SIZE(A, int)){REP(int, j, SIZE(A[i], int)){if (A[i][j] == INF) cout << "I "; else cout << A[i][j] << " ";}ENDL}}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
VLL p(a), q(b), r(c);
priority_queue<LL> A, B, L;
REP(int, i, a)
{
LL in;
cin >> in;
A.push(in);
}
REP(int, i, b)
{
LL in;
cin >> in;
B.push(in);
}
REP(int, i, c)
{
LL in;
cin >> in;
L.push(in);
}
PRIORITY_QUEUE<LL> R, G;
REP(int, i, x)
{
R.push(A.top());
A.pop();
}
REP(int, i, y)
{
G.push(B.top());
B.pop();
}
while(!L.empty())
{
int red, green, less;
red = R.top();
green = G.top();
less = L.top();
if (less <= red && less <= green) break;
if (red >= green)
{
G.pop();
L.pop();
G.push(less);
}
else
{
R.pop();
L.pop();
R.push(less);
}
}
LL ans = 0;
while(!R.empty())
{
ans += R.top();
R.pop();
}
while(!G.empty())
{
ans += G.top();
G.pop();
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
priority_queue<int> pq;
void inin(int a, int b) {
if (a < b) return;
vector<int> num(a);
rep(i,a) cin >> num[i];
sort(num.begin(), num.end(), greater<int>());
rep(i,b) pq.push(num[i]);
}
int p;
int main() {
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
inin(a,x);
inin(b,y);
rep(i,c) {
cin >> p;
pq.push(p);
}
ll ans = 0;
rep(i,x+y) {
ans += pq.top();
pq.pop();
}
cout << ans << endl;
return 0;
} | 1 | 9,423,648 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int digit = log10(N) + 1;
for (int i = 2; i <= sqrt(N); i++) {
if (N % i == 0) {
int dd = log10(N / i) + 1;
digit = min(digit, dd);
}
}
cout << digit << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template<class T>
inline set<T> divisorsList(T n) {
set<T> div;
for (T i = 1; i * i <= n; ++i) {
if (n % i == 0) {
div.insert(i);
if (i * i != n)
div.insert(n / i);
}
}
return div;
}
template<class T>
inline T cntDigit(T num) {
T cnt = 0;
while (num) {
num /= 10;
cnt++;
}
return cnt;
}
int main(){
cin.tie(0)->sync_with_stdio(false);
ll N;
cin >> N;
ll res = 0;
double sqr = sqrt(N);
if (floor(sqr) == sqr)
res = cntDigit((ll)sqr);
else {
set<ll> d = divisorsList(N);
ll n = d.size();
auto itr = d.begin();
REP(i, n / 2) itr++;
res = cntDigit(*itr);
}
cout << res << '\n';
return 0;
} | 1 | 49,268,079 |
Subsets and Splits