code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int x;
cin >> x;
int num = x / 100;
int l = num * 100;
int r = num * 105;
if(x >= l && x <= r) cout << 1 << endl;
else cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for (int i=a; i<b; ++i)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll H,W; cin >> H >> W;
vector <string> Grid(H);
loop(i,0,H) cin >> Grid[i];
queue <pair <pair<int, int>, int> > Q;
vector < vector <bool> > visited(H, vector<bool> (W, false));
for (int i=0; i<H; ++i) {
for (int j=0; j<W; ++j) {
if (Grid[i][j]=='#') {
Q.push({{i,j},0});
visited[i][j]=true;
}
}
}
int ans=0;
while (!Q.empty())
{
pair <int,int> cur=Q.front().first;
int op=Q.front().second;
ans=max(ans,op);
Q.pop();
if (cur.first>0 && !visited[cur.first-1][cur.second]) {
visited[cur.first-1][cur.second]=true;
Q.push({{cur.first-1, cur.second}, op+1});
}
if (cur.second>0 && !visited[cur.first][cur.second-1]) {
visited[cur.first][cur.second-1]=true;
Q.push({{cur.first, cur.second-1}, op+1});
}
if (cur.first<H-1 && !visited[cur.first+1][cur.second]) {
visited[cur.first+1][cur.second]=true;
Q.push({{cur.first+1, cur.second}, op+1});
}
if (cur.second<W-1 && !visited[cur.first][cur.second+1]) {
visited[cur.first][cur.second+1]=true;
Q.push({{cur.first, cur.second+1}, op+1});
}
}
cout << ans << "\n";
return 0;
}
| 0
| 88,215,615
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
int main(){
ll N,Z,W; cin>>N>>Z>>W;
vector<ll> A(N);
rep(i,N) cin>>A[i];
if(N==1) cout<<abs(A[0]-W);
else{
cout<<max(abs(A[N-1]-W),abs(A[N-2]-A[N-1]));
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long H,W,N;
cin >>H>>W;
long long Sa,Sb,Sc,ans;
ans=100000000;
for(int i=1;i<H;i++){
Sa=i*W;
Sb=(H-i)*(W/2);
Sc=(H-i)*(W-(W/2));
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
for(int i=1;i<H;i++){
Sa=i*W;
Sb=((H-i)/2)*W;
Sc=(H-i-(H-i)/2)*W;
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
for(int i=1;i<W;i++){
Sa=i*H;
Sb=(W-i)*(H/2);
Sc=(W-i)*(H-(H/2));
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
for(int i=1;i<W;i++){
Sa=i*H;
Sb=((W-i)/2)*H;
Sc=(W-i-(W-i)/2)*H;
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
cout<<ans<<endl;
}
| 0
| 10,820,851
|
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, L;
std::vector<string> S;
std::string tmp;
std::cin >> N >> L;
for (int i = 0; i < N; i++) {
std::cin >> tmp;
S.push_back(tmp);
}
std::sort(S.begin(), S.end());
std::string ans = "";
for (int i = 0; i < N; i++) {
ans += S.at(i);
}
std::cout << ans << std::endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
#define Y first
#define X second
int H, W, N;
vector<string> ts;
int main(void) {
cin >> H >> W >> N;
ts = vector<string>(H);
for (auto &line : ts) cin >> line;
string seq(N, '0');
iota(seq.begin(), seq.end(), '1');
PII start;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
if (ts[y][x] == 'S') {
start.Y = y;
start.X = x;
}
}
}
int total_time = 0;
queue<pair<int, PII>> q;
q.push(make_pair(0, start));
vector<vector<bool>> done(H, vector<bool>(W));
for (int i = 0; i < N; i++) {
while(q.size()) {
int now = q.front().first;
int y = q.front().second.Y;
int x = q.front().second.X;
q.pop();
if (done[y][x]) continue;
done[y][x] = true;
if (ts[y][x] == seq[i]) {
q = queue<pair<int, PII>>();
q.push(make_pair(0, make_pair(y, x)));
done = vector<vector<bool>>(H, vector<bool>(W));
total_time += now;
break;
}
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
if (!(!dx ^ !dy)) continue;
int nx = x + dx;
int ny = y + dy;
if (nx < 0 || ny < 0 || nx >= W || ny >= H) continue;
if (done[ny][nx]) continue;
if (ts[ny][nx] == 'X') continue;
if (!done[ny][nx]) {
q.push(make_pair(now + 1, make_pair(ny, nx)));
}
}
}
}
}
cout << total_time << endl;
return 0;
}
| 0
| 86,539,950
|
#include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <iterator>
#define loop(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 debug(x) cout << #x << " = " << (x) << endl;
using namespace std;
using LL = long long;
using ULL = unsigned long long;
int main() {
string s; cin >> s;
int index = 0;
while (index + 1 < s.size()){
if (s[index] == s[index + 1]) {
cout << index + 1 << " " << index + 2 << endl;
return 0;
}
index++;
}
index = 0;
while (index + 2 < s.size()) {
if (s[index] == s[index + 2]) {
cout << index + 1 << " " << index + 3 << endl;
return 0;
}
index++;
}
cout << "-1 -1" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll h,w,d;cin>>h>>w>>d;
pair<ll,ll> a[100010];
rep(i,0,h){
rep(j,0,w){
ll b;cin>>b;
a[b]=make_pair(i+1,j+1);
}
}
vector<ll> mod[100010];
rep(i,1,d+1){
ll j=0;
while(i+j*d<=h*w){
if(j==0)mod[i].push_back(0);
else mod[i].push_back(mod[i][mod[i].size()-1]+abs(a[i+j*d].first-a[i+(j-1)*d].first)+abs(a[i+j*d].second-a[i+(j-1)*d].second));
j++;
}
}
ll q;cin>>q;
rep(i,0,q){
ll x,y;cin>>x>>y;
ll ama=x%d;
if(ama==0)ama=d;
ll l=(x-ama)/d,r=(y-ama)/d;
cout<<mod[ama][r]-mod[ama][l]<<endl;
}
}
| 0
| 67,275,219
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
const long long INF = 1LL << 60;
struct Edge {
long long from;
long long to;
long long cost;
Edge(int s, int d) : to(s),cost(d) {}
Edge(int s) : to(s) {}
};
using Graph = vector<vector<Edge>>;
using Edges = vector<Edge>;
void dijkstra(const Graph &G, int s, vector<long long> &dis) {
int N = G.size();
dis.resize(N, INF);
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (dis[v] < p.first) {
continue;
}
for (auto &e : G[v]) {
if (dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
pq.emplace(dis[e.to], e.to);
}
}
}
}
bool bellman_ford(const Edges &Es, int V, int s, vector<long long> &dis) {
dis.resize(V, INF);
dis[s] = 0;
int cnt = 0;
while (cnt < V) {
bool end = true;
for (auto e : Es) {
if (dis[e.from] != INF && dis[e.from] + e.cost < dis[e.to]) {
dis[e.to] = dis[e.from] + e.cost;
end = false;
}
}
if (end) break;
cnt++;
}
return (cnt == V);
}
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
prev[i][j] = prev[k][j];
}
}
}
}
}
vector<int> get_path(const vector<vector<long long>> &prev, int s, int t) {
vector<int> path;
for (int cur = t; cur != s; cur = prev[s][cur]) {
path.push_back(cur);
}
path.push_back(s);
reverse(path.begin(), path.end());
return path;
}
bool is_negative(const vector<vector<long long>> &dist) {
int V = dist.size();
for (int i = 0; i < V; i++) {
if (dist[i][i] < 0) {
return true;
}
}
return false;
}
int main() {
int V,E;
cin >> V >> E;
vector<vector<ll>>dist(V,vector<ll>(V));
rep(i,V) rep(j,V) {
if(i==j) dist[i][j] = 0;
else dist[i][j] = INF;
}
rep(i,E) {
int a,b,c;
cin >> a >> b >> c;
dist[a][b] = c;
}
vector<vector<ll>>prev(V,vector<ll>(V));
warshall_floyd(dist,prev);
if(is_negative(dist)) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
} else {
rep(i,V) {
rep(j,V) {
if(dist[i][j] >= INF/2) {
cout << "INF";
} else {
cout << dist[i][j];
}
if(j != V-1) cout << " ";
}
cout << endl;
}
}
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(ll i = 0; i < n; i++)
int main() {
ll n;
cin >> n;
vector<string> s(n);
vector<ll> t(n);
REP(i, n) {
cin >> s[i] >> t[i];
}
string x;
cin >> x;
ll ans = 0;
bool f = false;
REP(i, n) {
if (f) ans += t[i];
if (s[i] == x) f = true;
}
cout << ans << endl;
}
| 0
| 26,431,168
|
#include<iostream>
#include<string>
#include<vector>
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int temp = 0;
int cost_input[10];
int cost_return = 0;
int num[10];
int j = 0;
for (int i = 0; i < 10; ++i) {
CI temp;
if (temp == 0) {
j = i;
break;
}
cost_input[i] = temp;
cost_return = 1000 - cost_input[i];
num[i] = 0;
if (cost_return < 5) {
num[i] = cost_return;
continue;
}
else {
if (cost_return < 10) {
num[i] = 1 + cost_return - 5;
continue;
}
}
if (cost_return >= 500) {
++num[i];
cost_return -= 500;
}
while (1) {
if (cost_return >= 100) {
++num[i];
cost_return -= 100;
}
if (cost_return < 100)break;
}
if (cost_return >= 50) {
++num[i];
cost_return -= 50;
}
while (1) {
if (cost_return >= 10) {
++num[i];
cost_return -= 10;
if (cost_return < 10)break;
}
}
if (cost_return >= 5) {
++num[i];
cost_return -= 5;
}
while (1) {
if (cost_return >= 1) {
++num[i];
cost_return -= 1;
}
if (cost_return < 1)break;
}
}
for (int i = 0; i < j; ++i) {
CO num[i] E
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
int main(){
int n;
cin >> n;
vector<ll> A(n);
for(int i=0;i<n;i++){
cin >> A[i];
}
map<ll,int> m;
for(int i=0;i<n;i++){
m[A[i]]++;
}
vector<ll> q(1,0);
vector<ll> p(2,0);
for(auto x:m){
if(x.second >= 4){
q.push_back(x.first);
}
if(x.second >= 2){
p.push_back(x.first);
}
}
sort(q.begin(),q.end(),greater<ll>());
sort(p.begin(),p.end(),greater<ll>());
cout << max(q[0]*q[0],p[0]*p[1]) << endl;
}
| 0
| 86,915,473
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
ll k;
cin >> s >> k;
bool all_same_flg = true;
ll n = s.size();
rep(i, n-1) {
if (s[i] != s[i+1]) all_same_flg = false;
}
if (all_same_flg) {
cout << s.size() * k / 2 << endl;
return 0;
}
string ss = s + s;
ll m = ss.size();
ll cnt = 1;
ll change_cnt = 0;
rep(i, n) {
if (s[i] == s[i+1]) {
++cnt;
}
else {
change_cnt += cnt / 2LL;
cnt = 1;
}
}
cnt = 1;
ll change_cnt2 = 0;
rep(i, m) {
if (ss[i] == ss[i+1]) {
++cnt;
}
else {
change_cnt2 += cnt / 2LL;
cnt = 1;
}
}
cout << change_cnt + (change_cnt2 - change_cnt) * (k - 1LL) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
int i;
for(i = 0; i < n; i++){
bool flag = true;
for(int j = i; j < n; j++){
if(s[j] != t[j-i]) flag = false;
}
if(flag) break;
}
cout << n + i << endl;
return 0;
}
| 0
| 83,936,935
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pl(s) cout << (s) << "\n";
#define pls(...) {bool space = false; for(auto i : __VA_ARGS__) (cout << (space?" ":"") << i), space = true; cout << "\n";}
#define plexit(s) {cout << (s) << "\n"; exit(0);}
#define yes(s) cout << ((s)?"Yes":"No") << "\n";
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using ll = long long; using ull = unsigned long long; using ld = long double;
template<typename T = int> using V = vector<T>; template<typename T = int> using P = pair<T, T>;
using Vi = V<int>; using Vl = V<ll>; using Vd = V<ld>; using VVi = V<Vi>; using VVl = V<Vl>; using Pi = P<int>; using Pl = P<ll>; using Pd = P<ld>;
constexpr ll MOD = 1000000007; constexpr int INF = (1 << 30) - 1; constexpr ll INFL = 1LL << 60; constexpr ld EPS = 1e-12; constexpr ld PI = 3.141592653589793238462643383279;
int main(void) {
string s; cin >> s;
const int N = sz(s);
Vi a(N+1);
rep(i,N) if (s[i] == '<') chmax(a[i+1],a[i]+1);
rrep(i,N) if (s[i] == '>') chmax(a[i],a[i+1]+1);
ll ans = 0;
rep(i,N+1) ans += a[i];
pl(ans)
return 0;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
string s;
cin >> s;
if (s[5] == '1') {
mes("TBD");
re0;
}
if (s[6] == '5' || s[6] == '6' || s[6] == '7' || s[6] == '8' || s[6] == '9') {
mes("TBD");
re0;
}
mes("Heisei");
}
| 0
| 72,417,947
|
#include<bits/stdc++.h>
using namespace std;;
int main(){
string s,t; cin>>s>>t;
cout<<t<<s<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=1; i<=(int)(n); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<char> vc;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin>>N;
map<int,int,greater<int>> m;
rep(i,N) {
int A;
cin>>A;
m[A]++;
}
ll a=0,b=0;
for(auto c : m) {
if(c.se>=2) {
a=c.fi;
m[a]-=2;
break;
}
}
for(auto c : m) {
if(c.se>=2) {
b=c.fi;
break;
}
}
cout<<a*b<<endl;
}
| 0
| 91,113,257
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
while(1)
{
int x,y;
cin>>x>>y;
if(x==0&&y==0)break;
cout<<min(x,y)<<" "<<max(x,y)<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
using vii = vector < ii >;
using vli = vector < li >;
using vpll = vector < pll >;
using vi3 = vector < i3 >;
using vlii = vector < lii >;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9 , PI = acos(-1);
int n , m;
void solve(int testCase){
string s , t;
cin >> s >> t;
int n = s.length();
int m = t.length();
int ans = 1e9;
for(int i = 0 ; i <= n - m ; i ++) {
int cnt = 0;
for(int j = i ; j < i + m ; j ++) {
if(s[j] != t[j - i]) cnt ++;
}
ans = min(ans , cnt);
}
printf("%d\n" , ans);
}
main(){
int t = 1;
for(int testCase = 1 ; testCase <= t ; testCase ++){
solve(testCase);
}
return 0;
}
| 0
| 57,328,840
|
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n;
cin >> n ;
std::vector<ll> a(n);
std::vector<ll> b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
ll count=0,sur,push;
for(ll i=n-1;i>=0;i--){
a.at(i)+=count;
sur=a.at(i)%b.at(i);
if(sur==0){
continue;
}
else{
push=b.at(i)-sur;
count+=push;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
const int N = 1e5+5, M = 1e6+6, OO = 0x3f3f3f3f;
int a[N], b[N];
int h, n;
int main()
{
cin>>n>>h;
int mxa = -1;
for (int i = 0; i < n; i++)
{
cin>>a[i]>>b[i];
mxa = max(mxa, a[i]);
}
ll ans = 0;
sort(b, b+n, greater<int>());
for (int i = 0; i < n && h > 0 ; i++)
{
if(b[i] >= mxa)
{
h -= b[i];
ans++;
}
else
break;
}
if(h > 0)
ans += (ll)(h + mxa - 1) / mxa ;
cout<<ans;
return 0;
}
| 0
| 65,996,456
|
#include <iostream>
using namespace std;
int route = 0;
int a, b, n;
bool road[17][17];
void dfs(int x, int y) {
if (x == a && y == b) {
route++;
return;
}
if (x > a || y > b) return;
if (road[y][x]) return;
dfs(x + 1, y);
dfs(x, y + 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >> a >> b, a, b) {
cin >> n;
for (int y = 0; y < 17; y++)
for (int x = 0; x < 17; x++)
road[y][x] = false;
while (n-- > 0) {
int x, y;
cin >> x >> y;
road[y][x] = true;
}
route = 0;
dfs(1, 1);
cout << route << endl;
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n+1);
for(int i = 0; i < n; i++){
cin >> v[i];
}
long long r = 0;
for(int i = 0;i < n; i++){
if(v[i] % 2 == 1){
v[i]--;
if(v[i+1]){
v[i+1]++;
}
}
r += v[i];
}
cout << r/2;
}
| 0
| 70,713,140
|
#include<iostream>
using namespace std;
int coin[] = { 500, 100, 50, 10, 5, 1 };
int main() {
int n,res;
while(true) {
cin>>n;
if(!n) break;
n=1000-n,res=0;
for(int i=0; i<6; i++) {
res+=n/coin[i];
n%=coin[i];
}
cout<<res<<endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define int long long
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int A, B; cin >> A >> B;
for (int i = A; i <= B*A; i += A) {
if (i % B == 0) {
cout << i << endl;
return 0;
}
}
}
| 0
| 38,861,807
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef long long ll;
#define INF 10e17
#define rep(i,n) for(int i=0; i<n; i++)
#define rep_r(i,n,m) for(int i=m; i<n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
ll sums(vector<ll> vec) {
ll limit = vec.size();
ll sumvec = 0;
for (int k = 1; k <= limit; ++k) {
sumvec += (k - 1) * vec[k-1] - (limit - k) * vec[k-1];
sumvec %= MOD;
}
return (sumvec + MOD);
}
int main() {
ll n,m;
vector<ll> x, y;
cin >> n >> m;
x = vector<ll>(n), y = vector<ll>(m);
rep(i,n) {
scanf("%lld", &x[i]);
}
rep(i,m) {
scanf("%lld", &y[i]);
}
ll sumx = sums(x);
ll sumy = sums(y);
cout << (sumx * sumy) % MOD << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
sort(a.begin(), a.end(), greater<ll>());
ll ans=1;
int cnt=0;
rep(i,n){
if(a[i]==a[i+1]){
ans*=a[i];
cnt++;
++i;
}
if(cnt==2){
cout<<ans<<endl;
return 0;
}
}
cout<<0<<endl;
return 0;
}
| 0
| 72,994,322
|
#include <iostream>
#include <complex>
#include <cmath>
#include <iomanip>
using namespace std;
int main(int argc, char *argv[])
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(20) << sqrt(pow(x1-x2, 2.0)+pow(y1-y2, 2.0)) << endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int a[200010];
rep(i, N) cin >> a[i];
rep(i, N) a[i]--;
int b[200010];
rep(i, N) b[a[i]] = i;
multiset<int> st;
st.insert(-1); st.insert(-1);
st.insert(N); st.insert(N);
int ans = 0;
RREP(i, N - 1, 0) {
int idx = b[i];
auto itrL2 = (--(--st.lower_bound(idx)));
auto itrL1 = --st.lower_bound(idx);
auto itrR1 = st.lower_bound(idx);
auto itrR2 = ++st.lower_bound(idx);
ans += (i + 1) * (*itrL1 - *itrL2) * (*itrR1 - idx);
ans += (i + 1) * (idx - *itrL1) * (*itrR2 - *itrR1);
st.insert(idx);
}
cout << ans << endl;
return 0;
}
| 0
| 39,051,232
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i=0;i<12;i++){
if(i==4) cout << ' ';
cout << s[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin >> k;
long long a = 49 + k / 50;
int m = (int) (k % 50);
cout << 50 << endl;
for (int i = 0; i < 50; i++)
{
if (i != 0)
cout << " ";
if (i < m)
cout << a + 50 - (m - 1);
else
cout << a - m;
}
cout << endl;
return 0;
}
| 0
| 45,498,296
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n,m;
cin>>n>>m;
int a[m],b[m],ca[200010];
MEMSET(ca,0);
vector<int> v;
REP(i,m)
{
cin>>a[i]>>b[i];
if(a[i]==1)v.emplace_back(b[i]);
if(b[i]==n)ca[a[i]]=1;
}
string ans="IMPOSSIBLE";
REP(i,SZ(v)){
if(ca[v[i]]==1)ans="POSSIBLE";
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n, y, m, d;
cin>>n;
for(n;n;n--){
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0) ans+=20*10;
else ans+=(20+19)*5;
}
if(y%3==0) ans+=20*(10-m);
else{
for(int i=m+1;i<=10;i++){
if(i%2) ans+=20;
else ans+=19;
}
}
if(y%3==0) ans+=20-d;
else{
if(m%2) ans+=20-d;
else ans+=19-d;
}
cout<<ans+1<<endl;
}
return 0;
}
| 0
| 79,062,746
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
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...));
}
#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))
int main(){
ll K;
cin>>K;
vector<ll> A(K);
REP(i,K) cin>>A[i];
ll x1,x2;
x1=2;
x2=3;
REP(i,K-1){
x1=max(((x1-1)/A[K-2-i]+1)*A[K-2-i],x1);
x2=(1+x2/A[K-2-i])*A[K-2-i]-1;
}
if(x1>x2||A[K-1]!=2){
cout<<-1<<endl;
}else{
cout<<x1<<" "<<x2<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll cnt1 = 0, cnt2 = 0, cnt3 = 0;
rep(i, N) {
ll num;
cin >> num;
if (num <= A)
cnt1++;
else if (num <= B)
cnt2++;
else
cnt3++;
}
cout << min(min(cnt1, cnt2), cnt3) << "\n";
return 0;
}
| 0
| 15,966,856
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#define int long long
#define double long double
#define fre(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
using namespace std;
inline int read(){
int sum=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){sum=sum*10+ch-'0';ch=getchar();}
return f*sum;
}
const int N=100005;
struct node{int x,y;}a[N];
int H,W,n;
map < pair<int,int> ,int> mp;
int f[101];
inline int get(int x,int y){
return mp.count(make_pair(x,y));
}
inline int getsum(int x,int y){
int ret=0;
if(x+2>H||y+2>W) return 0;
for(int i=x;i<=x+2;i++)
for(int j=y;j<=y+2;j++) ret+=get(i,j);
return ret;
}
signed main(){
H=read();W=read();n=read();
for(int i=1;i<=n;i++) a[i].x=read(),a[i].y=read();
for(int i=1;i<=n;i++) mp[make_pair(a[i].x,a[i].y)]=1;
for(int i=1;i<=n;i++){
int x=a[i].x,y=a[i].y;
for(int i=max((int)1,x-2);i<=x;i++){
for(int j=max((int)1,y-2);j<=y;j++){
int ret=getsum(i,j);
if(ret>0) f[ret]++;
}
}
}
for(int i=1;i<=9;i++) f[i]/=i;
int ret=0;
for(int i=1;i<=9;i++) ret+=f[i];
f[0]=(H-2)*(W-2)-ret;
for(int i=0;i<=9;i++) printf("%lld\n",f[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double ESP=1e-8;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
#define eq(a,b) a-b<ESP
double x[3],y[3];
double xp,yp;
int main(){
while (cin>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>xp>>yp){
bool r=false,l=false;
REP(i,3){
double ax,ay,bx,by;
ax=x[(i+1)%3]-x[i];
ay=y[(i+1)%3]-y[i];
bx=xp-x[i];
by=yp-y[i];
if (ax*by-bx*ay<0){
r=true;
}
else{
l=true;
}
}
cout<<(r^l ? "YES" : "NO")<<endl;
}
return 0;
}
| 0
| 62,527,144
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
REP(i, s.size()) {
if (s[i] == '0') cnt0++;
else cnt1++;
}
cout << min(cnt0, cnt1) * 2 << '\n';
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main()
{
int64 nn, aa, bb, cnt = 1;
cin >> nn;
vector<int64> pp(nn), qq(nn), memo(nn);
for(int64 ii = 0;ii < nn;ii++)
{
memo[ii] = ii + 1;
cin >> pp[ii];
}
for(int64 ii = 0;ii < nn;ii++)
{
cin >> qq[ii];
}
do
{
bool tmp1 = true, tmp2 = true;
for(int64 ii = 0;ii < nn;ii++)
{
if(pp[ii] != memo[ii])
{
tmp1 = false;
}
if(qq[ii] != memo[ii])
{
tmp2 = false;
}
}
if(tmp1)
{
aa = cnt;
}
if(tmp2)
{
bb = cnt;
}
cnt++;
}while(next_permutation(memo.begin(), memo.end()));
cout << abs(aa - bb) << endl;
return 0;
}
| 0
| 87,414,051
|
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
int a[55];
int main(void)
{
int n, k, i, j, p, q, ans = 0;
scanf("%d %d" ,&n, &k);
for (i = 0; i < n; i++)
scanf("%d" ,&a[i]);
for (i = 0; i <= min(n, k); i++)
for (j = 0; i + j <= min(n, k); j++)
{
v.clear();
for (p = 0; p < i; p++)
v.push_back(a[p]);
for (q = 0; q < j; q++)
v.push_back(a[n - q - 1]);
sort(v.begin(), v.end());
int sum = 0;
for (p = 0; p < v.size(); p++)
sum += v[p];
for (p = 0; p < min(k - i - j, (int)v.size()); p++)
if (v[p] < 0)
sum -= v[p];
ans = max(ans, sum);
}
printf("%d" ,ans);
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}
long long COM(ll n, ll k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}
int main() {
int x,a;
cin>>x>>a;
if(x>=a){
cout<<10<<endl;
return 0;
}
cout<<0<<endl;
}
| 0
| 9,175,845
|
#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 <random>
#include <cassert>
#include <numeric>
#define ll long long int
#define LL unsigned long long
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
const int MOD = 1000000007;
int main() {
string s; cin >> s;
int n = s.size();
int i = 0, j = n-1,ans = 0;
while(i < j){
if(s[i] == s[j]){
i++;
j--;
}else{
if(s[i] == 'x'){
ans++;
i++;
}else if(s[j] == 'x'){
ans++;
j--;
}else{
cout << -1 << endl;
return 0;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int M,N;
cin>>M>>N;
vector<pair<pair<int,int>,int>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first.second>>A[i].first.first;
A[i].second=i;
}
sort(A.begin(),A.end());
vector<int> B(M+1,1),C(N),D(N);
for(int i=0;i<N;i++){
C[A[i].second]=B[A[i].first.second];
B[A[i].first.second]++;
D[A[i].second]=A[i].first.second;
}
for(int i=0;i<N;i++){
for(int j=to_string(D[i]).size();j<6;j++)
cout<<0;
cout<<D[i];
for(int j=to_string(C[i]).size();j<6;j++)
cout<<0;
cout<<C[i]<<endl;
}
}
| 0
| 30,199,648
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) cin >> A[i];
ll mx = -1;
for (int i = 0; i < 1 << N; i++) {
ll ibitcount = bitset<32>(i).count();
if (ibitcount < K) continue;
ll cost = 0;
ll now = -1;
ll now_max = 0;
vector<ll> tmp(N);
REP(j, N) {
if ((i & 1 << j) == false) {
now_max = max(now_max, A[j]);
continue;
}
cost += now_max < A[j] ? 0 : now_max - A[j] + 1;
tmp[j] = max(A[j],now_max + 1);
REP(k, j+1) {
now_max = max(now_max, A[j]);
now_max = max(now_max, tmp[j]);
}
}
if (mx == -1) {
mx = cost;
} else {
mx = min(cost, mx);
}
}
cout << mx << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n,j,i,ans,k;
bool ha=true;
n=s.size();
j=n-1;
ans=0;
i=0;
int med=n/2;
while(i<=j){
if(s[i]=='x' && s[j]!='x'){
ans++;
i++;
}else if(s[j]=='x' && s[i]!='x'){
ans++;
j--;
}else if(s[i]!=s[j] && s[i]!='x' && s[j]!='x'){
ha=false;
i=j;
}else if(s[i]==s[j]){
i++;
j--;
}
}
if(ha==true){
cout << ans << endl;
}else{
ans=-1;
cout << ans << endl;
}
return 0;
}
| 0
| 80,835,822
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) cin >> h[i];
int count = 0;
for (int l = 0; l < N; l++) {
int r;
while (h[l] != 0) {
int Min = h[l];
for (r = 1; l + r < N; r++) {
if (h[l + r] == 0) break;
Min = min(Min, h[l + r]);
}
for (int i = l; i < l + r; i++) {
h[i] -= Min;
}
count += Min;
}
}
cout << count << endl;
return 0;
}
|
#include <bitset>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t divider = 1000000007;
int main() {
int64_t N, M;
cin >> N >> M;
bitset<1000001> steps;
for (int m = 0; m < M; ++m) {
int s;
cin >> s;
steps.set(s);
if (steps.test(s - 1)) {
cout << 0 << endl;
return 0;
}
}
vector<int64_t> pat(N+1);
pat[0] = 1;
for (size_t i = 0; i <= N; ++i) {
if (!steps.test(i+1)) {
pat[i+1] = (pat[i+1] + pat[i]) % divider;
}
if (!steps.test(i+2)) {
pat[i+2] = (pat[i+2] + pat[i]) % divider;
}
}
cout << pat[N] << endl;
return 0;
}
| 0
| 64,539,124
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector <int> a(n);
map <int, int> cnt;
for (int i = 0; i < n; i++) {
cin >> a[i];
++cnt[a[i]];
}
ll ans = 0;
for (auto &i : cnt) {
ans += (ll)i.y * (i.y - 1ll) / 2ll;
}
for (int i = 0; i < n; i++) {
ans -= (ll)cnt[a[i]] * (cnt[a[i]] - 1ll) / 2ll;
ans += (ll)(cnt[a[i]] - 1ll) * (cnt[a[i]] - 2ll) / 2ll;
cout << ans << '\n';
ans += (ll)cnt[a[i]] * (cnt[a[i]] - 1ll) / 2ll;
ans -= (ll)(cnt[a[i]] - 1ll) * (cnt[a[i]] - 2ll) / 2ll;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2);
return memo*memo%mod;
}else{
return rep_pow(a, b-1)*a%mod;
}
}
ll nCr(ll n, ll r){
ll ret=1;
rep(i,r){
ret *= n-i;
ret %= mod;
ret *=rep_pow(r-i, mod-2);
ret %= mod;
}
return ret;
}
ll gcd(ll a, ll b){ if(b==0) return a; return gcd(b, a%b);}
int counter(int x){
if(x==0) return 0;
return counter(x>>1)+(x&1);
}
int main(){
fast_io
int n,k;
cin>>n>>k;
int ans=0;
if(k==1) ans=0;
else ans=n-k;
cout<<ans<<endl;
return 0;
}
| 0
| 80,258,148
|
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
#include<math.h>
#include <cmath>
#include<iomanip>
using namespace std;
int main(){
double a, b, C;cin >> a >> b >> C;
double rad = M_PI /180 *C;
double S = a * b * sin(rad)/ 2;
double L = sqrt(a * a + b * b -2*a*b*cos(rad)) + a + b;
double h = 2 * S / a;
cout << fixed << setprecision(12) << S << endl;
cout << L << endl;
cout << h << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
int bu[5] = {0};
rep(i, 0, 6){
int n; cin >> n;
bu[n]++;
}
bool f = true;
Rep(i, 1, 4){
if(bu[i] == 0 || bu[i] >= 3) f = false;
}
if(f) cout << "YES" << endl;
else cout << "NO" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0
| 55,532,829
|
#include<stdio.h>
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<=b && b<=c) printf("%d %d %d\n",a,b,c);
else if(b<=a && a<=c) printf("%d %d %d\n",b,a,c);
else if(a<=c && c<=b) printf("%d %d %d\n",a,c,b);
else if(c<=a && a<=b) printf("%d %d %d\n",c,a,b);
else if(b<=c && c<=a) printf("%d %d %d\n",b,c,a);
else if(c<=b && b<=a) printf("%d %d %d\n",c,b,a);
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int n,p; cin >> n >> p;
int even = 0, odd = 0;
rep(i,n){
int a; cin >> a;
even += 1-a%2;
odd += a%2;
}
vector<vector<ll>> nCr(n+1,vector<ll>(n+1));
nCr[0][0] = 1;
rep(i,n) rep(j,i+1){
nCr[i+1][j+1] += nCr[i][j];
nCr[i+1][j] += nCr[i][j];
}
ll ans = 0;
rep(i,even+1){
for(int j = p; j < odd+1; j+=2){
ans += nCr[odd][j]*nCr[even][i];
}
}
cout << ans;
cout << "\n";
return 0;
}
| 0
| 36,407,158
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,x,y,s;
cin>>n>>k>>x>>y;
if(n<=k)
{
cout<<x*n<<"\n";
}
else
{
s=(k*x)+(n-k)*y;
cout<<s<<"\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;
using P =pair<int,int>;
int main(){
int n,m;
cin >> n >> m;
vector <vector <int>> c(m+1);
int a,b;
rep(i,n){
cin >> a >> b;
if(a<=m){
c[a].push_back(b);
}
}
priority_queue <int> q;
ll su;
su=0;
int u;
int l;
rep(i,m){
l=c[i+1].size();
rep(j,l){
q.push(c[i+1][j]);
}
if(q.size()==0){
continue;
}
u=q.top();
q.pop();
su+=u;
}
cout << su << endl;
return 0;
}
| 0
| 50,845,922
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
char c;
cin >> c;
if(c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o')cout << "vowel" << endl;
else cout << "consonant" << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
struct multi {
long double first;
long double second;
long double third;
multi(long double first, long double second, long double third)
: first(first), second(second), third(third) {}
};
bool multicomp(const multi &a, const multi &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vector<long double> t(N, 0), v(N, 0);
vector<multi> P;
REP(i, N) cin >> t[i];
REP(i, N) cin >> v[i];
P.push_back(multi(0, 0, 0));
REP(i, N) { P.push_back(multi(P[i].second, P[i].second + t[i], v[i])); }
P.push_back(multi(P[N].second, P[N].second, 0));
long double last_speed = 0;
long double ans = 0;
for (long double a = 0; a <= P[N].second; a += (long double)0.5) {
long double speed = llINF;
REP(i, N + 2) {
if (a <= P[i].first) {
speed = min(speed, P[i].third + P[i].first - a);
} else if (a >= P[i].second) {
speed = min(speed, P[i].third + a - P[i].second);
} else {
speed = min(speed, P[i].third);
}
}
ans += (long double)0.25 * (last_speed + speed);
last_speed = speed;
}
cout << SP(20) << ans << endl;
return 0;
}
| 0
| 53,844,874
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
pair<int,int> p;
map<int,int> m;
deque<int> d;
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int x[n];
for(int i=0;i<n;i++)
cin>>x[i];
int sum = 0;
for(int i=0;i<n;i++)
sum += x[i];
float p = float(sum)/float(n);
int sum2 = 0;
for(int i=0;i<n;i++)
sum2+=pow(x[i]-round(p),2);
cout<<sum2<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argv,char* argc[])
{
vector<pair<string,int> >ar;
int n;
cin>>n;
string s; int t;
for(int i=0;i<n;++i)
{
cin>>s>>t;
ar.push_back(make_pair(s,t));
}
string x;
cin>>x;
int sum=0;
for(int i=n-1;i>=0;--i)
{
if(ar[i].first!=x)
sum+=ar[i].second;
else break;
}
cout<<sum;
return 0;
}
| 0
| 34,770,438
|
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 77;
int main(){
int n , x , t ; cin >> n >> x >> t ;
if(n%x==0) cout << n/x * t << endl;
else cout << (n/x + 1) *t << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
ll num[26];
ll mod = 1000000000LL+7LL;
int main() {
int n;
cin>>n;
string s;
cin>>s;
for(auto c:s)num[c-'a']++;
ll ans = 1;
rep(i,26){
ans *= num[i]+1;
ans%=mod;
}
print((ans+mod-1)%mod);
return 0;
}
| 0
| 57,588,221
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
ll N, P;
string S;
ll pow_mod(ll n, ll k, ll mod) {
if (k == 0) return 1;
else if (k % 2 == 1) {
return pow_mod(n, k-1, mod) * n % mod;
}
else {
ll tmp = pow_mod(n, k/2, mod);
return tmp * tmp % mod;
}
}
int main() {
cin >> N >> P >> S;
if (P == 2 || P == 5) {
ll ans = 0;
for (int i = N-1; i >= 0; i--) {
if ((S[i] - '0') % P == 0) {
ans += (i+1);
}
}
cout << ans << endl;
}
else {
ll dp[N+1];
dp[0] = 0;
dp[1] = (S[N-1] - '0') % P;
for (ll i = 2; i <= N; i++) {
dp[i] = (dp[i-1] + pow_mod(10, i-1, P) * (S[N-i] - '0') % P) % P;
}
map<ll, ll> mp;
for (int i = 0; i <= N; i++) {
mp[dp[i]]++;
}
ll ans = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
ll val = itr->second;
ans += val * (val-1) / 2;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define EPS 1e-10
using namespace std;
int main(){
int n;
cin>>n;
int a[105][105]={};
int s,t,u;
rep(i,n){
cin>>s>>t;
rep(j,t){
cin>>u;
a[s][u]=1;
}
}
rep(i,n){
rep(j,n){
cout<<a[i+1][j+1];
if(j!=n-1)cout<<" ";
}cout<<endl;
}
return 0;
}
| 0
| 942,683
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
for (int i = 0; i < 3; i++) cin >> V.at(i);
sort(V.rbegin(), V.rend());
if (V.at(0) == V.at(1) && V.at(1) == V.at(2)) return cout << 0 << "\n", 0;
int ans = 0;
int tmp = V.at(0) - V.at(1);
ans += tmp;
V.at(2) += tmp;
tmp = V.at(0) - V.at(2);
if (tmp % 2 == 0) cout << ans + tmp / 2 << "\n";
else cout << ans + tmp / 2 + 2 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n+2];
a[0] = 0;
a[n+1] = 0;
for(int i = 1; i < n+1; i++){
cin >> a[i];
}
int sum = 0;
for(int i = 0; i < n+1; i++){
sum += abs(a[i] - a[i+1]);
}
for(int i = 1; i < n+1; i++){
int p = abs(a[i-1] - a[i+1]);
int q = abs(a[i-1] - a[i]) + abs(a[i] - a[i+1]);
cout << sum + p - q << endl;
}
return 0;
}
| 0
| 72,383,078
|
#include <iostream>
#include <string>
#include <ctype.h>
using namespace std;
int main(int argc, char *argv[])
{
string input;
getline(cin, input);
for (int i = 0; i < input.size(); i++)
{
if (islower(input[i]))
{
input[i] = toupper(input[i]);
}
else
{
input[i] = tolower(input[i]);
}
}
cout << input << endl;
return 0;
}
|
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9;
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
Int solve(Int A, Int B){
if(A > B) swap(A, B);
auto check=[&](Int x){
Int v = (x + 1 - A) / 2;
Int mx = 0;
for(Int i = v - 10; i < v + 10; i++){
Int a = A + i;
Int b = (x - i + 1);
if(!(A + 1 <= a && a <= A + x)) continue;
if(!(1 <= b && b <= x)) continue;
Max(mx, a * b);
}
return mx < A * B;
};
Int L = 0, R = B;
while(L + 1 < R){
Int M = (L + R) / 2;
check(M)? (L=M):(R=M);
}
Int res = (A - 1) + L;
return res;
}
signed main(){
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int Q;
cin>>Q;
while(Q--){
Int A, B;
cin>>A>>B;
Int ans = solve(A, B);
cout<<ans<<endl;
}
return 0;
}
| 0
| 51,907,564
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "a" ){
cout << "vowel" << endl;
}
else if (S == "i"){
cout << "vowel" << endl;
}
else if (S == "u"){
cout << "vowel" << endl;
}
else if (S == "e"){
cout << "vowel" << endl;
}
else if (S == "o"){
cout << "vowel" << endl;
}
else{
cout << "consonant" << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n+1];
bool pressed[n+1] = {};
for (int i=1; i<=n; i++) {
cin >> a[i];
}
int on = 1, cnt = 0;
while (on != 2) {
if (pressed[a[on]] == false) {
pressed[a[on]] = true;
on = a[on];
cnt++;
} else {
cout << -1 << endl;
return 0;
}
}
cout << cnt << endl;
}
| 0
| 37,324,001
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 243000000000000001
#define minf -243000000000000001
signed main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
ans[0]=0;
ans[1]=abs(v[1]-v[0]);
for(int i=2;i<=n-1;i++){
int val=inf;
for(int j=i-1;j>=max((int)0,i-k);j--){
val=min(val,ans[j]+abs(v[j]-v[i]));
}
ans[i]=val;
}
puts(ans[n-1]);
}
|
#include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
using namespace std;
int main()
{
FastRead
ll int n,m,i;
cin>>n>>m;
string a[n];
f(i=0; i<n; i++)
{
cin>>a[i];
}
sort(a,a+n);
f(i=0; i<n; i++)
{
cout<<a[i];
}
return 0;
}
| 0
| 6,431,765
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >>S;
int r=0;
int b=0;
for(size_t i=0;i<S.size();i++){
if(S.at(i)=='0') r++;
else b++;
}
cout <<2*min(r,b)<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <stdlib.h>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
struct node
{
int c;
int a[15];
}book[15];
int b[15];
int main()
{
int n,m,x;
cin>>n>>m>>x;
for (int i=0; i < n; i++)
{
cin>>book[i].c;
for (int j = 0; j<m; j++)
cin>>book[i].a[j];
}
int ans=2e9;
for (int i = 0;i<(1<<n); i++)
{
memset(b,0,sizeof b);
int sum=0;
for(int j=0;j < n;j++)
if(i>>j&1){
sum+=book[j].c;
for(int k=0; k < m; k++)
b[k]+=book[j].a[k];
}
bool flag=1;
for (int j = 0; j < m; j++)
if(b[j] < x)
flag=0;
if(flag)
ans=min(ans,sum);
}
if(ans==2e9)
cout<<"-1";
else
cout<<ans;
return 0;
}
| 0
| 97,407,052
|
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stdio.h>
#include <string>
#include <string.h>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main (void)
{
string a;
cin >> a;
int k = 0;
k = a.size();
for (int i = k; i > 0; i--)
{
cout << a.substr(i - 1,1);
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
vector<ll> distances;
vector<vector<pll>> edges;
ll INF = 1e16;
bool dfs(int node)
{
for (auto edge : edges.at(node))
{
ll nextNode, distance;
tie(nextNode, distance) = edge;
if (distances.at(nextNode) != INF && distances.at(nextNode) - distances.at(node) != distance)
{
return false;
}
if (distances.at(nextNode) == INF)
{
distances.at(nextNode) = distances.at(node) + distance;
if (!dfs(nextNode))
{
return false;
}
}
}
return true;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
edges = vector<vector<pll>>(N + 1, vector<pll>());
for (int i = 0; i < M; i++)
{
ll L, R, D;
cin >> L >> R >> D;
edges.at(L).emplace_back(R, D);
edges.at(R).emplace_back(L, D * -1);
}
distances = vector<ll>(N + 1, INF);
string answer = "Yes";
for (int i = 1; i <= N; i++)
{
if (distances.at(i) == INF)
{
distances.at(i) = 0;
if (!dfs(i))
{
answer = "No";
break;
}
}
}
cout << answer << endl;
return 0;
}
| 0
| 86,670,206
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
const int MAXM=10000;
int A[MAXM];
int main(){
int N,M;cin >> N >> M;
int ma= 0;
rep(i,M){
cin >> A[i];
ma += A[i];
}
int ans = max(N-ma, -1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
if(str==".") break;
stack<char> stk;
string res = "yes";
for(int i=0;i<str.size();i++){
if(str[i]=='(') stk.push('(');
if(str[i]=='[') stk.push('[');
if(str[i]==')'){
if(!stk.empty() && stk.top() != '(') res = "no";
else if(stk.empty()) res = "no";
else stk.pop();
}
if(str[i]==']'){
if(!stk.empty() && stk.top() != '[') res = "no";
else if(stk.empty()) res = "no";
else stk.pop();
}
}
if(!stk.empty()) res = "no";
cout << res << endl;
}
}
| 0
| 5,332,044
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
string S; cin >> S;
set<char> st;
vector<char> v(26);
rep(i,26){
st.insert('a'+i);
v[i] = 'a'+i;
}
rep(i,S.size()){
st.erase(S[i]);
}
if(S == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
if(S.size() < 26){
cout << S + *st.begin() << endl;
return 0;
}else{
char cur = S[25], tar;
int p;
for(int i=1;i<26;i++){
tar = S[25-i];
if(cur > tar){
p = 26-i;
char ch = '{';
for(int j=p;j<26;j++){
if(S[j] > S[p-1])ch = min(ch, S[j]);
}
S[p-1] = ch;
rep(j,p){
cout << S[j];
}
cout << endl;
return 0;
}
cur = tar;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int n;
cin >> n;
ll d_sum = 0;
ll d_cou = 0;
rep(_, n) {
ll d;
ll c;
cin >> d >> c;
d_cou += c;
d_sum += (d * c);
}
cout << (d_cou - 1) + ((d_sum - 1) / 9) << endl;
}
| 0
| 38,550,094
|
#include<iostream>
using namespace std;
int main(){
int x,y;
while(cin>>y>>x){
if(x!=0||y!=0){
for(int i=0;i<y;i++){
for(int j=0;j<x;j++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
}
}
}
|
#include<iostream>
using namespace std;
int main(){
int a,b,c;
int x = 0;
cin >> a >> b >> c;
for (int y = a; y <= b; ++y){
if (c % y == 0){
++x;
}
}
cout << x << endl;
return 0;
}
| 0
| 52,124,358
|
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n[5];
scanf("%d%d%d%d%d", n+0, n+1, n+2, n+3, n+4);
sort(n, n+5);
printf("%d %d %d %d %d\n", n[4], n[3], n[2], n[1], n[0]);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
const int MAX = 1000001;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(void){
int N; cin >> N;
int ans = 0;
int A[N][N];
rep(i, N){
string S; cin >> S;
rep(j, N){
A[i][j] = S[j] - 'a';
}
}
int B[N][N];
for(int b = 0; b < N; b++){
bool ok = true;
rep(i, N){
rep(j, N){
int x1 = i, y1 = (j+b) % N;
int x2 = j, y2 = (i+b) % N;
if(A[x1][y1] != A[x2][y2]) ok = false;
}
}
if(ok) ans += N;
}
cout << ans << endl;
return 0;
}
| 0
| 19,658,288
|
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define ll long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,y) fixed << setprecision(y) << x
#define pb push_back
#define mp make_pair
int32_t main()
{
fast;
string s; cin >> s;
int a, b, c, d;
a = s[0] - '0', b = s[1] - '0', c = s[2] - '0', d = s[3] - '0';
if (a -b -c - d ==7) printf ("%d-%d-%d-%d=7\n " ,a ,b ,c , d );
else if (a -b - c + d ==7) printf ("%d-%d-%d+%d=7\n " ,a ,b ,c , d );
else if (a - b +c - d ==7) printf ("%d-%d+%d-%d=7\n " ,a ,b ,c , d );
else if (a - b + c + d ==7) printf ("%d-%d+%d+%d=7\n " ,a ,b ,c , d );
else if ( a +b -c - d ==7) printf ("%d+%d-%d-%d=7\n " ,a ,b ,c , d );
else if ( a +b - c + d ==7) printf ("%d+%d-%d+%d=7\n " ,a ,b ,c , d );
else if ( a + b +c - d ==7) printf ("%d+%d+%d-%d=7\n " ,a ,b ,c , d );
else if ( a + b + c + d ==7) printf ("%d+%d+%d+%d=7\n " ,a ,b ,c , d );
return 0;
}
|
#include <iostream>
using namespace std;
const int N = 100 + 1;
int main() {
int A[N][N] = {{0}};
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int u;
cin >> u;
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int x;
cin >> x;
A[u-1][x-1] = 1;
}
}
for (int i = 0; i < n; ++i) {
int j = 0;
for (; j < n-1; ++j) {
cout << A[i][j] << " ";
}
cout << A[i][j] << endl;
}
return 0;
}
| 0
| 48,186,024
|
#include <vector>
#include <iostream>
using namespace std;
void dfs(const vector<vector<int>> &G, vector<int> &C,
int v, int prev){
for(auto v_ : G[v]){
if(v_ == prev) continue;
C[v_] += C[v];
dfs(G,C,v_,v);
}
}
int main(){
int N, Q;
cin >> N >> Q;
vector<vector<int>> G(N);
for(int i = 1; i < N; ++i){
int a, b;
cin >> a >> b;
--a,--b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> C(N,0);
for(int i = 0; i < Q; ++i){
int p, x;
cin >> p >> x;
--p;
C[p] += x;
}
dfs(G,C,0,-1);
cout << C[0];
for(int i = 1; i < N; ++i)
cout << " " << C[i];
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, a[110];
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
pair<ll, ll> p[210];
for(int i = -100; i <= 100; i++)
{
ll sum=0;
for(int j = 0; j < n; j++)
sum+=(a[j]-i)*(a[j]-i);
p[i+100] = make_pair(sum, i);
}
sort(p, p+201);
cout << p[0].first;
}
| 0
| 13,860,567
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll choose(ll a) {
return a * (a - 1) / 2;
}
void solve() {
int n;
cin >> n;
vector<string> v(n);
rep(i,n) cin >> v[i];
vector<vector<int>> u(n, vector<int>(26));
rep(i,n) {
string s = v[i];
rep(j,10) {
u[i][(s[j] - 'a')]++;
}
}
ll ans = 0;
map<vector<int>, int> mp;
for (int i = 0; i < n; i++) {
mp[u[i]]++;
}
for (auto p: mp) {
if (p.second <= 1) continue;
ans += choose(p.second);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
struct Span{
int d;
int p;
Span():d(0),p(0){}
Span(int d, int p):d(d),p(p){}
bool operator>(const Span &t)const{ return p>t.p; }
};
int main(){
while(true){
int ans = 0;
int n,m;
vector<Span> vspan;
scanf("%d%d", &n, &m);
if(n==0&&m==0)break;
for(int i = 0; i < n; ++i){
int d,p;scanf("%d%d", &d, &p);
vspan.push_back( Span(d,p) );
ans += d * p;
}
sort(vspan.begin(), vspan.end(), greater<Span>());
for(unsigned int i = 0; i < vspan.size(); ++i){
if( m >= vspan[i].d ){
m -= vspan[i].d;
ans -= vspan[i].d * vspan[i].p;
}else if( m > 0 ){
ans -= m * vspan[i].p;
m -= m;
}
}
printf("%d\n", ans);
}
return 0;
}
| 0
| 57,540,593
|
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int n,k;
cin >> n >> k;
cout << (k == 1?0:n-k) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int inf = 1001001001;
template <typename T>
struct UnionFind {
vector<T> par;
UnionFind(T N) : par(N) {
for(T i = 0; i < N; i++) par[i] = i;
}
int root(T x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(T x, T y) {
T rx = root(x);
T ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(T x, T y) {
T rx = root(x);
T ry = root(y);
return rx == ry;
}
};
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << c-(d-b) << " " << d+(c-a) << " " << (c-d+b)-(c-a) << " " << (d+c-a)-(d-b) << endl;
}
| 0
| 17,350,857
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll>A(N);
int flagN = -1;
int flagP = -1;
for (int i = 0; i < N; ++i) {
cin >> A[i];
if(A[i] < 0) flagN = i;
if(A[i] > 0) flagP = i;
}
ll M = 0;
if(flagN == -1){
int x = 0;
M = A[0];
for (int i = 1; i < N; ++i) {
if(A[x] > A[i]) x = i;
M += A[i];
}
M = M - (2 * A[x]);
cout << M << endl;
if(x == 0){
for (int i = 2; i < N; ++i) {
cout << A[0] << " " << A[i] << endl;
A[0] -= A[i];
}
cout << A[1] << " " << A[0] << endl;
}else{
for (int i = 1; i < N; ++i) {
if(i != x){
cout << A[x] << " " << A[i] << endl;
A[x] -= A[i];
}
}
cout << A[0] << " " << A[x] << endl;
}
}else if(flagP == -1){
int x = 0;
M -= A[0];
for (int i = 1; i < N; ++i) {
if(A[x] < A[i]) x = i;
M -= A[i];
}
M = M + (2 * A[x]);
cout << M << endl;
for (int i = 0; i < N; ++i) {
if(i != x){
cout << A[x] << " " << A[i] << endl;
A[x] -= A[i];
}
}
}else{
for (int i = 0; i < N; ++i) {
M += abs(A[i]);
}
cout << M << endl;
for (int i = 0; i < N; ++i) {
if(A[i] >= 0 && i != flagP){
cout << A[flagN] << " " << A[i] << endl;
A[flagN] -= A[i];
}
}
for (int i = 0; i < N; ++i) {
if(A[i] < 0){
cout << A[flagP] << " " << A[i] << endl;
A[flagP] -= A[i];
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
long long i,count=0,ans=0;
for(i=0; i<s.size(); i++)
{
if(s[i]=='B')
count++;
else if(s[i]=='W')
ans=ans+count;
}
cout<<ans;
}
| 0
| 68,634,357
|
#include<iostream>
#include<math.h>
#define PI 3.141592/180
using namespace std;
int main()
{
int a,b,C;
double S,L,h;
cin >> a >> b >>C;
h = b * sin(C*PI);
S = a * h / 2;
L = sqrt((a*a)+(b*b)-(2*a*b*cos(C*PI))) + a + b;
cout << S << ' ' << L << ' ' << h << endl ;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string search[4] = {"maerd", "remaerd", "esare", "resare"};
int d = 0, k;
for (int i = 0; i < s.length();)
{
for (int j = 0; j < 4; j++)
{
k = 0;
if (s.substr(i, search[j].length()) == search[j])
{
i += search[j].length();
k++;
break;
}
}
if (k == 0)
{
d++;
break;
}
}
if (d == 0) cout << "YES";
else cout << "NO";
}
| 0
| 3,040,961
|
#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 srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
int main() {
int n,k;
cin >> n >> k;
int a[n];
int count = 0;
rep(i,n){
cin >> a[i];
if(a[i]<k)count++;
}
sort(a,a+n);
int b[count];
rep(i,count){
b[count-1-i] = a[i];
}
rep(i,count){
}
cout << endl;
int last = count;
int dp[k] = {};
int dp2[k] = {};
rep(i,count){
rep(j,k){
dp2[j] = dp[j];
}
rep(j,k){
if(j==b[i]){
dp2[j] = 1;
}
if(dp[j]>0){
if(j+b[i]>=k){
last = count - 1 - i;
}else{
dp2[j+b[i]] = 1;
}
}
}
rep(j,k){
dp[j] = dp2[j];
}
}
cout << last << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int,vector<int>> P;
set<string> RT;
vector<bool> ans;
void prog(int a,string r,vector<bool>T){
T.at(a-1)=true;
if(T==ans){
RT.insert(r);
return;
}
for(int i:P.at(a)){
if(T.at(i-1))continue;
r.push_back(i+'0');
prog(i,r,T);
r.pop_back();
}
}
int main (){
int N,M;
cin >> N >> M;
for(int i=0;i<M;i++){
int j,k;
cin >> j >> k;
P[j].push_back(k);
P[k].push_back(j);
}
ans=vector<bool>(N,true);
prog(1,"1",vector<bool>(N,false));
cout << RT.size() << endl;
}
| 0
| 76,078,148
|
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define pb push_back
using namespace std;
const ll mod = 1e9+7;
ll n, d[10000001], ans=0;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("A.txt", "r", stdin);
#endif
cin >> n;
d[1] = 1;
for(int i=2; i<=n; i++){
d[i]++;
for(int j=i; j<=n; j+=i){
d[j]++;
}
}
for(int i=1; i<=n; i++){
ans += i*d[i];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
string s; cin >> s;
string t; cin >> t;
int len = s.size();
for (int i = 0; i < len; i++)
{
string ans;
for (int j = i; i < len; j++)
{
ans += s[j];
if (j == len - 1 && ans.size() < len)
j = -1;
if (ans.size() == len)
break;
}
if (ans == t)
{
cout << "Yes" << endl; return 0;
}
}
cout << "No" << endl;
return 0;
}
| 0
| 11,817,474
|
#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 res = 0;
for (int i = 0; i < N;) {
int j = i + 1;
while (j < N && a[j] <= a[j-1]) ++j;
res = max(res, j - i - 1);
i = j;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
using namespace std;
typedef long long int ll;
typedef pair <ll, ll> P;
const ll MOD=1000000007;
int N;
P A[1<<18];
ll dp[1<<18];
P getmax(P x, P y){
ll a[4];
a[0]=x.fr; a[1]=x.sc; a[2]=y.fr; a[3]=y.sc;
sort(a,a+4);
return P(a[3], a[2]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin>>N;
rep(i,0,1<<N){
ll a;
cin>>a;
A[i]=P(a,0);
}
rep(i,0,N){
rep(j,0,1<<N){
if (j&(1<<i)){
A[j]=getmax(A[j], A[j^(1<<i)]);
}
}
}
dp[1]=A[1].fr+A[1].sc;
cout <<dp[1]<<"\n";
rep(i,2,1<<N){
dp[i]=max(dp[i-1], A[i].fr+A[i].sc);
cout <<dp[i]<<"\n";
}
}
| 0
| 25,519,991
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
cin>>n>>m;
int a[m],b[m],c[m];
set<pair<int,int>>edges[n][n];
int dist[n][n];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++){
if(i==j)
dist[i][j]=0;
else
dist[i][j]=100000;
}
}
for(int i=0;i<m;i++)
{
cin>>a[i]>>b[i]>>c[i];
a[i]--;
b[i]--;
}
for(int i=0;i<m;i++)
{
dist[a[i]][b[i]]=min(dist[a[i]][b[i]],c[i]);
dist[b[i]][a[i]]=min(dist[b[i]][a[i]],c[i]);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
for(int k=0;k<n;k++)
{
dist[j][k]=min(dist[j][k],dist[j][i]+dist[i][k]);
}
}
}
int ans=m;
for(int i=0;i<m;i++)
{
bool inc=false;
for(int j=0;j<n;j++)
{
if(dist[j][a[i]]+c[i]==dist[j][b[i]])
inc=true;
}
if(inc==true)
ans--;
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e13;
const int MAX = 510000;
bool graph[nmax][nmax];
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
struct SegmentTree
{
private:
ll n;
vector<ll> node;
public:
SegmentTree(vector<ll> v)
{
ll sz = v.size();
n = 1;
while (n < sz)
{
n *= 2;
}
node.resize(2 * n - 1, INF);
for (ll i = 0; i < sz; i++)
{
node[i + n - 1] = v[i];
}
for (ll i = n - 2; i >= 0; i--)
{
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(ll x, ll val)
{
x += (n - 1);
node[x] = val;
while (x > 0)
{
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1)
{
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
void warshall_floyd(ll n)
{
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < n; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind
{
public:
vector<ll> Parent;
UnionFind(ll N)
{
Parent = vector<ll>(N, -1);
}
ll find(ll A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A)
{
return -Parent[find(A)];
}
bool Union(ll A, ll B)
{
A = find(A);
B = find(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b)
{
return (((a % MOD) * (b % MOD)) % MOD);
}
ll powMod(ll a, ll p)
{
if (p == 0)
{
return 1;
}
else if (p % 2 == 0)
{
ll half = powMod(a, p / 2);
return mulMod(half, half);
}
else
{
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b)
{
return (a + b - 1) / b;
}
vector<ll> tsort(Graph G)
{
ll N = G.size();
vector<ll> in(N);
for (auto &&edges : G)
{
for (auto &&edge : edges)
{
in[edge]++;
}
}
queue<int> que;
for (int i = 0; i < N; i++)
{
if (in[i] == 0)
{
que.push(i);
}
}
int cnt = 0;
vector<ll> ans;
while (!que.empty())
{
int v = que.front();
que.pop();
ans.push_back(v);
for (auto &&next : G[v])
{
in[next]--;
if (in[next] == 0)
{
que.push(next);
}
}
}
return ans;
}
void solve(long long N, std::vector<long long> A)
{
vector<pair<ll,ll>> leafs(N+1,make_pair(0,0));
leafs[N] = make_pair(A[N],A[N]);
for (int i = N-1; i >= 0; i--)
{
ll minimum = ceil(leafs[i+1].first,2) + A[i];
ll maximum = leafs[i+1].second + A[i];
leafs[i] = make_pair(minimum,maximum);
}
if(leafs[0].first <= 1 && 1 <= leafs[0].second){
vector<ll> tops(N+1,0);
tops[0] = 1;
ll ans = 1;
for (int i = 1; i < N+1; i++)
{
tops[i] = min(tops[i-1]*2,leafs[i].second)-A[i];
ans += tops[i] + A[i];
}
cout << ans << endl;
}else{
cout << -1 << endl;
}
}
int main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> A(N - 0 + 1);
for (int i = 0; i < N - 0 + 1; i++)
{
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| 0
| 6,903,033
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int f(ll a, ll b, ll div){
ll qa = a / div;
ll qb = b / div;
ll ra = a % div;
ll rb = b % div;
if (qa % 2 == 0 && qb % 2 == 0) return 0;
else if (qa % 2 != 0 && qb % 2 != 0){
if ((ra + rb) % 2 == 0) return 1;
else return 0;
}
else if (qa % 2 != 0){
if (ra % 2 != 0) return 1;
else return 0;
}
else if (qb % 2 != 0){
if (rb % 2 == 0) return 1;
else return 0;
}
}
int main(){
ll a, b;
cin >> a >> b;
ll div = 1;
while(div <= b) div *= 2;
div /= 2;
ll ans = 0;
while(div > 1){
ans *= 2;
ans += f(a, b, div);
div /= 2;
}
ans *= 2;
ll n = b-a+1;
if (b % 2 != 0 && a % 2 != 0){
if ((n / 2 + 1) % 2 != 0) ans++;
}
else{
if ((n/2) % 2 != 0) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 3;
void solve(){
int N, K;
ll X[101], Y[101];
cin >> N >> K;
for(int i = 0; i < N; ++i) cin >> X[i] >> Y[i];
set<int> xx, yy;
for(int i = 0; i < N; ++i) xx.insert(X[i]);
for(int i = 0; i < N; ++i) yy.insert(Y[i]);
ll ans = -1;
for(int sx : xx){
for(int sy : yy){
for(int tx : xx){
for(int ty : yy){
if (sx <= tx && sy <= ty) {
ll area = 1LL * (tx - sx) * (ty - sy);
int c = 0;
for(int i = 0; i < N; ++i){
if (sx <= X[i] && X[i] <= tx && sy <= Y[i] && Y[i] <= ty){
c++;
}
}
if (K <= c) {
if (ans < 0) ans = area;
ans = min(ans, area);
}
}
}
}
}
}
cout << ans << endl;
return;
}
int main() {
#ifdef MYLOCAL
vector<string> filenames {"input1.txt", "input2.txt", "input3.txt", "input4.txt"};
cout << "------------\n";
for(int i = 0; i < CASES; ++i){
ifstream in(filenames[i]);
cin.rdbuf(in.rdbuf());
solve();
cout << "------------\n";
}
#else
solve();
#endif
return 0;
}
| 0
| 86,758,476
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb push_back
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define lb lower_bound
#define ub upper_bound
#define D2(x) { cerr << "[" << #x << ": "; for(auto it:x) cerr << it << " "; cerr << "]\n"; }
#define all(x) (x).begin(), (x).end()
#define mem(a) memset(a , 0 ,sizeof a)
#define deb(x) cout << #x << " - " << x << "\n";
#define ps(x,y) fixed<<setprecision(y)<<x
#define setbit(x) __builtin_popcountll(x)
#define deb2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"
#define rep(i,a,b) for(int i=a ; i<b ; ++i)
#define repr(i,a,b) for(int i=a ; i>=b ; --i)
#define PI 3.141592653589793
const ll p = 5;
const ll INF = 1000000000;
const ll MAX_N = 1e5 + 2;
int main() {
IOS;
int n,k,num; cin >> n >> k;
priority_queue<int>pq;
rep(i,0,n) { cin >> num, pq.push(num); }
while(k){
int top = pq.top();
pq.pop();
top >>= 1;
pq.push(top);
k--;
}
ll sum = 0;
while(!pq.empty()){
sum += pq.top();
pq.pop();
}
cout << sum;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
vec l(1e5+5),r(1e5+5),num(1e5+5);
int main() {
ll n;
cin >> n;
for(ll i=1;i<=n;i++) {
ll tmp;
cin >> tmp;
num[tmp]=i;
l[i]=i-1;
r[i]=i+1;
}
ll ans=0;
for(ll i=1;i<=n;i++) {
ll x=l[num[i]],w=l[x];
ll y=r[num[i]],z=r[y];
if(x!=0) ans+=1LL*(x-w)*(y-num[i])*i;
if(y!=n+1) ans+=1LL*(z-y)*(num[i]-x)*i;
l[y]=x;
r[x]=y;
}
cout << ans << endl;
}
| 0
| 20,756,384
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int x;
cin >> x;
int n = x / 100;
if (5 * n >= x % 100)
cout << 1 << endl;
else
cout << 0 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool betemp(string sleft, string sright, int left, int right) {
if (sleft == sright) return (right - left) % 2 == 1;
else return (right - left) % 2 == 0;
}
void solve(int N) {
string vac = "Vacant";
string sleft, sright, str;
int left = 0, right = N/2;
cout << left << endl;
cin >> sleft;
if (sleft == vac) return;
cout << right << endl;
cin >> sright;
if (sright == vac) return;
if (!betemp(sleft, sright, left, right)) {
swap(sleft, sright), left = right, right = N;
}
while (right - left > 1) {
int mid = (left + right) / 2;
cout << mid << endl;
cin >> str;
if (str == vac) return;
if (betemp(sleft, str, left, mid)) sright = str, right = mid;
else sleft = str, left = mid;
}
}
int main() {
int N;
while (cin >> N) solve(N);
}
| 0
| 68,651,765
|
#include<bits/stdc++.h>
using namespace std;
#define fr(i, n) for(ll i = 0; i < n; i++)
#define frr(i, n) for(ll i = 1; i <= n; i++)
#define frm(i, n) for(ll i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<double, double> ponto;
typedef vector<vector<ll>> matrix;
#define mem(v, k) memset(v, k, sizeof(v));
#define db cout << "Debug" << endl;
#define mp make_pair
#define pq priority_queue
#define mx(a, b) a = max(a, b);
#define mod(a, b) a = a%b;
#define MAXN 100010
#define MOD 1000000007
#define MAXL 30
#define ROOT 1
#define INF 987654321
ll x, y, a, b, c;
ll r[MAXN], g[MAXN];
ll ans = 0;
pq<ll> notColor;
pq<ll, vector<ll>, greater<ll>> chosen;
void build(){
cin >> x >> y >> a >> b >> c;
frr(i, a){
cin >> r[i];
}
sort(r + 1, r + a + 1);
for(ll j = a; j > a - x; j--){
chosen.push(r[j]);
ans+=r[j];
}
frr(i, b){
cin >> g[i];
}
sort(g + 1, g + b + 1);
for(ll j = b; j > b - y; j--){
chosen.push(g[j]);
ans+=g[j];
}
fr(i, c){
ll aux;
cin >> aux;
notColor.push(aux);
}
}
void solve(){
while(!notColor.empty() && notColor.top() > chosen.top()){
ans-=chosen.top();
chosen.pop();
ans+=notColor.top();
chosen.push(notColor.top());
notColor.pop();
}
}
int main(){
ios::sync_with_stdio(false);
build();
solve();
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ENDL '\n'
#define print(i) std::cout << std::setprecision(16) << (i) << '\n'
#define int long long
#define all(v) (v).begin(), (v).end()
int gcd(int a, int b) {
if (b==0) return a;
return gcd(b,a%b);
}
inline int sign(int a) {
if(a>0) return 1;
if(a<0) return -1;
return 0;
}
signed main() {
int n;
std::cin >> n;
std::vector<std::pair<int,int> > vec;
rep(i,n) {
int x,y;
std::cin >> x >> y;
bool cont = true;
for(auto& v:vec) {
if(sign(v.first)*sign(x)<0 || sign(v.second)*sign(y)<0) continue;
if(v.first==0 && x!=0) continue;
if(v.first!=0 && x==0) continue;
if(v.second==0 && y!=0) continue;
if(v.second!=0 && y==0) continue;
if(x==0&&y==0) {
cont=false;
break;
}
if(v.first==0 && x==0 && y>0 && v.second>0) goto here;
if(v.first==0 && x==0 && y<0 && v.second<0) goto here;
if(v.first>0 && x>0 && y==0 && v.second==0) goto here;
if(v.first<0 && x<0 && y==0 && v.second==0) goto here;
if(v.first==0 && x==0 && y<0 && v.second>0) continue;
if(v.first==0 && x==0 && y>0 && v.second<0) continue;
if(v.first<0 && x>0 && y==0 && v.second==0) continue;
if(v.first>0 && x<0 && y==0 && v.second==0) continue;
if(std::abs(x)*std::abs(v.second)==std::abs(y)*std::abs(v.first)) {
here:
v.first+=x;
v.second+=y;
cont = false;
break;
}
}
if(x==0&&y==0) cont = false;
if(cont) vec.emplace_back(x,y);
}
n=vec.size();
if(n==0) {
print(0);
return 0;
}
std::vector<std::vector<int> > dot(n, std::vector<int>(n,0));
rep(i,n) rep(j,n) {
dot[i][j] = vec[i].first*vec[j].first + vec[i].second*vec[j].second;
}
std::vector<std::vector<int> > d(n, std::vector<int>(n,0));
rep(i,n) rep(j,n) {
d[i][j] = (-vec[i].second)*vec[j].first + vec[i].first*vec[j].second;
}
long double max = 0;
rep(i,n) {
int sumx1 = 0;
int sumy1 = 0;
int sumx2 = 0;
int sumy2 = 0;
std::vector<int> used(n,false);
rep(j,n) {
if(i==j) {
continue;
}
if(d[i][j]>=0) {
sumx1+=vec[j].first;
sumy1+=vec[j].second;
used[j] = true;
}
}
rep(j,n) {
if(!used[j]) {
sumx2+=vec[j].first;
sumy2+=vec[j].second;
}
}
int zumx1 = 0;
int zumy1 = 0;
int zumx2 = 0;
int zumy2 = 0;
std::vector<int> used2(n,false);
rep(j,n) {
if(i==j) {
continue;
}
if(d[i][j]<=0) {
zumx1+=vec[j].first;
zumy1+=vec[j].second;
used2[j] = true;
}
}
rep(j,n) {
if(!used2[j]) {
zumx2+=vec[j].first;
zumy2+=vec[j].second;
}
}
int sumx3 = 0;
int sumy3 = 0;
rep(j,n) {
if(d[i][j]>=0) {
sumx3+=vec[j].first;
sumy3+=vec[j].second;
}
}
int sumx4 = 0;
int sumy4 = 0;
rep(j,n) {
if(d[i][j]<=0) {
sumx4+=vec[j].first;
sumy4+=vec[j].second;
}
}
long double dist1 = std::sqrtl((long double)(sumx1*sumx1) + (long double)(sumy1*sumy1));
long double dist2 = std::sqrtl((long double)(sumx2*sumx2) + (long double)(sumy2*sumy2));
long double zdist1 = std::sqrtl((long double)(zumx1*zumx1) + (long double)(zumy1*zumy1));
long double zdist2 = std::sqrtl((long double)(zumx2*zumx2) + (long double)(zumy2*zumy2));
long double dist3 = std::sqrtl((long double)(sumx3*sumx3) + (long double)(sumy3*sumy3));
long double dist4 = std::sqrtl((long double)(sumx4*sumx4) + (long double)(sumy4*sumy4));
max = std::max({max,dist1,dist2,dist3,dist4,zdist1,zdist2});
}
print(max);
return 0;
}
| 0
| 54,460,552
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int N, Y; cin >> N >> Y;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
if (i + j > N) continue;
int k = N - i - j;
if (k < 0) continue;
int m = 10000 * i + 5000 * j + 1000 * k;
if (m == Y) {
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
}
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> a;
if(s.length() < 26){
for(int i = 0; i < s.length(); i++){
a[s[i]]++;
}
for(int i = 0; i < 26; i++){
if(a['a' + i] == 0){
char b = 'a' + i;
cout << s + b << endl;
return 0;
}
}
}else{
for(int i = s.length()-1; i > 0; i--){
if(s[i] > s[i-1]){
for(int j = 0; j <= i-1; j++){
a[s[j]]++;
}
for(int j = 0; j < 26; j++){
if(a['a' + j] == 0 && 'a' + j > s[i-1]){
char b = 'a' + j;
for(int k = 0; k < i-1; k++){
cout << s[k];
}
cout << b << endl;
return 0;
}
}
}
}
cout << -1 << endl;
}
return 0;
}
| 0
| 55,261,642
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll q,h,s,d; cin >> q >> h >> s >> d;
ll n; cin >> n;
h=min(2*q,h);
s=min(2*h,s);
ll w=n/2;
ll y=n%2;
ll ans=min(2*s,d)*w+y*s;
cout << ans << endl;
}
|
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define DEC(i, s) for (int i = (s); i >= 0; i--)
#define SIZE(v) (int)((v).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
#define FIND(m, w) ((m).find(w) != (m).end())
int decode(char *str) {
int num = 0;
int prev = 1;
for (int i = 0; str[i]; i++) {
if (str[i] == 'm') { num += prev * 1000; }
if (str[i] == 'c') { num += prev * 100; }
if (str[i] == 'x') { num += prev * 10; }
if (str[i] == 'i') { num += prev * 1; }
prev = 1;
if (isdigit(str[i])) { prev = str[i] - '0'; }
}
return num;
}
void decode(int num) {
if (num >= 1000) {
if (num >= 2000) {
printf("%d", num / 1000);
}
printf("m");
}
num %= 1000;
if (num >= 100) {
if (num >= 200) {
printf("%d", num / 100);
}
printf("c");
}
num %= 100;
if (num >= 10) {
if (num >= 20) {
printf("%d", num / 10);
}
printf("x");
}
num %= 10;
if (num >= 1) {
if (num >= 2) {
printf("%d", num / 1);
}
printf("i");
}
puts("");
}
int main() {
char left[100];
char right[100];
int test;
scanf("%d", &test);
while (test--) {
scanf("%s %s", left, right);
int l = decode(left);
int r = decode(right);
decode(l + r);
}
}
| 0
| 27,170,483
|
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <deque>
#include <string>
using namespace std;
#define endl "\n"
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#define db long double
#define fast cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define mod2 998244353
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar,val) memset(ar, val, sizeof(ar))
#define print(arr,n) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n) cout<<arr[i]<<" "; cout<<endl
#define print2(arr,n,m) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n){ rep(j,m) cout<<arr[i][j]<<" "; cout<<endl; }
#define dyn1(arr,n) ll* arr=new ll[n]; rep(i,n) arr[i]=0;
#define dyn2(arr,n,m) ll** arr=new ll*[(n)]; rep(i,n) arr[i]=new ll[m]; rep(i,n) rep(j,m) arr[i][j]=0
#define carr(arr,n) rep(i,n) cin>>arr[i]
#define carr2(arr,n,m) rep(i,n) rep(j,m) cin>>arr[i][j]
#define debug(a) cout<<" :: "<<#a<<" == "<<a<<endl
#define debug2(a,b) cout<<" :: "<<#a<<" == "<<a<<" :: "<<#b<<" == "<<b<<endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
#define debugx(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debugx("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
inline ll maxim(ll a,ll b) {if(a>b) return a; else return b;}
inline ll minim(ll a,ll b) {if(a<b) return a; else return b;}
inline bool equals(double a, double b){ return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b){ return b==0 ? a : gcd(b, a%b); }
ll sum(ll* arr,ll n)
{
ll total=0;
rep(o,n)
{
total+=arr[o];
}
return total;
}
ll Extended_gcd(ll a,ll b,ll& x,ll& y)
{
if(a==0)
{
x=0;
y=1;
return b;
}
else
{
ll x1,y1;
ll g=Extended_gcd(b%a,a,x1,y1);
x=y1-(b/a)*x1;
y=x1;
return g;
}
}
bool leap(ll y)
{
if(y%400==0) return true;
if((y%4==0)&&(y%100!=0)) return true;
return false;
}
ll isprime(ll n)
{
if(n==1) return false;
if(n==2) return true;
for(int i=2;i*i<=n;i++)
{
if(n%i==0) return false;
}
return true;
}
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1) res = (res * a);
a = (a * a);
b >>= 1;
}
return res;
}
ll result[1000010];
ll tempo[1000010];
ll per[1000010];
void permutation_exp(ll n,ll x)
{
fr(o,1,n)
{
result[o]=o;
}
while(x>0)
{
if(x&1)
{
fr(o,1,n)
{
tempo[o]=result[o];
}
fr(o,1,n)
{
result[o]=tempo[per[o]];
}
}
fr(o,1,n)
{
tempo[o]=per[o];
}
fr(o,1,n)
{
per[o]=tempo[tempo[o]];
}
x>>=1;
}
}
ll modpow(ll a, ll b,ll x)
{
ll res = 1;
while (b > 0)
{
if (b & 1) res = (res * a)%x;
a = (a * a)%x;
b >>= 1;
}
return res;
}
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
vector<ll> adj[1000010];
ll visited[1000010]={0};
void dfs(ll x)
{
visited[x]=1;
rep(o,adj[x].size())
{
if(!visited[adj[x][o]])
{
dfs(adj[x][o]);
}
}
}
ll f(ll x)
{
return x;
}
ll ternary_search(ll l, ll r)
{
while (r - l > 10)
{
ll m1 = l + (r - l) / 3;
ll m2 = r - (r - l) / 3;
ll f1 = f(m1);
ll f2 = f(m2);
if (f1 > f2)
l = m1;
else
r = m2;
}
ll mino=f(l);
fr(o,l,r)
{
mino=minim(mino,f(o));
}
return mino;
}
ll func(ll x)
{
return (x*(x+1))/2;
}
ll bs(ll low,ll high,ll target)
{
while(low+3<high)
{
ll mid=(low+high)/2;
if(func(mid)<=target)
{
low=mid;
}
else
{
high=mid-1;
}
}
frr(o,high,low)
{
if(func(o)<=target) return o;
}
return -1;
}
map<ll,ll> x_map;
map<ll,ll> y_map;
int arr[1000010]={0};
int opt[1000010]={0};
int dp[67108865];
vector<ll> cont;
int main()
{
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout<<setprecision(10)<<fixed;
string s;
cin>>s;
ll n=s.length();
rep(o,67108865)
{
dp[o]=mod;
}
dp[0]=0;
arr[0]=0;
fr(o,1,n)
{
arr[o]=arr[o-1]^(1<<(s[o-1]-'a'));
}
fr(o,1,n)
{
ll mino=mod;
fr(x,0,25)
{
mino=minim(mino,dp[arr[o]^binpow(2,x)]);
}
mino=minim(mino,dp[arr[o]]);
opt[o]=mino+1;
dp[arr[o]]=minim(dp[arr[o]],opt[o]);
}
cout<<opt[n]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N, Z, W;
cin >> N >> Z >> W;
vector<ll> A(N);
REP(i, N){
cin >> A[i];
}
if(N >= 2){
cout << max(abs(A[N-1]-W), abs(A[N-2]-A[N-1])) << endl;
}
else{
cout << abs(A[N-1]-W) << endl;
}
return 0;
}
| 0
| 2,861,760
|
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
string s;
vector<vector<char> > b{
vector<char>{},
vector<char>{'.',',','!','?',' '},
vector<char>{'a','b','c'},
vector<char>{'d','e','f'},
vector<char>{'g','h','i'},
vector<char>{'j','k','l'},
vector<char>{'m','n','o'},
vector<char>{'p','q','r','s'},
vector<char>{'t','u','v'},
vector<char>{'w','x','y','z'},
};
int main(){ _;
int n;cin>>n;
REP(i,n){
cin>>s;
int last=0;
int count=0;
for(int j=0;j<(int)s.size();j++){
if(last==0){
count=0;
}else if(s[j]=='0'){
cout<<b[last][count%(int)b[last].size()];
}else{
count++;
}
last=(s[j]-'0');
}
cout<<endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll minimum;
ll frog(ll *A,ll n,ll k)
{
ll ans=0,p=0;
ll t[n+1];
for(int i=0;i<=n;i++)
t[i]=INT_MAX;
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3&&k>=2)
{
for(int j=i-1;j>=max(i-k,p);j--)
{
ans=abs(A[i]-A[j])+t[j];
t[i]=min(ans,t[i]);
}
}
else t[i]=abs(A[i]-A[i-1])+t[i-1];
}
return t[n];
}
int main()
{
ll n,k,sum=0;
cin >>n>>k;
minimum=INT_MAX;
ll A[n];
for(int i=1;i<=n;i++)
cin >>A[i];
if(k==1)
{
for(int i=1;i<n;i++)
sum+=abs(A[i]-A[i+1]);
cout <<sum;
}
else cout <<frog(A,n,k);
}
| 0
| 49,798,099
|
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0; i<n; i++){
int a, b, c;
cin >> a >> b >> c;
T[a][b] = T[b][a] = c;
if(a+1>m){
m = a+1;
}
if(b+1>m){
m = b+1;
}
}
int minT[m][m];
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
minT[i][j]=T[i][j];
}
}
for(int k=0; k<m; k++){
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
if(minT[i][j]>minT[i][k]+minT[k][j])
minT[i][j]=minT[i][k]+minT[k][j];
}
}
}
int d[m];
for(int i=0; i<m; i++){
d[i]=0;
for(int j=0; j<m; j++){
d[i]=d[i]+minT[i][j];
}
}
int min=0;
for(int i=1; i<m; i++){
if(d[min]>d[i])
min=i;
}
cout <<min<<' '<<d[min]<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
long long int start=0;
long long int end=s.size()-1;
bool ok=true;
long long int ans=0;
while(start<end){
if(s[start]=='x'&&s[end]=='x'){
start++;
end--;
continue;
}
if(s[start]=='x'){
start++;
ans++;
continue;
}else if(s[end]=='x'){
ans++;
end--;
continue;
}
if(s[start]==s[end]){
start++;
end--;
}else{
ok=false;
break;
}
}
if(ok){
cout<<ans<<endl;;
}else{
cout<<-1<<endl;
}
}
| 0
| 36,676,156
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(){
cout << "Yes" << endl;
}
void no (){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
int main() {
int n; cin >> n;
cout << "Christmas ";
rep(i,max(0,24-n)) cout << "Eve ";
if (n <=24) cout << "Eve" << endl;
else cout << endl;
}
|
#include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define repp(i, a, b) for(int i = (a); i <= (b); i++)
#define repm(i, a, b) for(int i = (a); i >= (b); i--)
#define all(v) v.begin(), v.end()
int n;
ll m;
vector<ll> a;
vector<ll> s;
map<ll, ll> mod_map;
int main(){
cin >> n >> m;
a.resize(n);
rep(i, n){
int a_i; cin >> a_i;
a[i] = a_i % m;
}
s.resize(n+1);
s[0] = 0; mod_map[s[0]]++;
rep(i, n){
s[i+1] = (s[i] + a[i]);
mod_map[ s[i+1] % m ]++;
}
ll ans = 0;
for(auto k: mod_map){
ans += k.second * (k.second-1) / 2;
}
cout << ans << endl;
}
| 0
| 72,233,100
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9+7;
ll n;
map<ll, int> mp;
int ans=0;
int bs(int x){
int ans=1;
for(int i=x; i>0; i/=2){
while((ans+i+1)*(ans+i)/2<=x){
ans+=i;
}
}
return ans;
}
int main(){
cin.sync_with_stdio(0); cin.tie();
cin.exceptions(cin.failbit);
cin >> n;
for(ll i=2; i*i<=n; i++){
while(n%i==0){
n/=i;
mp[i]++;
}
}
if(n>1) mp[n]++;
trav(p, mp){
ans+=bs(p.second);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int H,N,A;
cin >> H >> N;
for(int i=0;i<N;i++){
cin >> A;
H -= A;
if(H <= 0){
cout << "Yes" <<endl;
return 0;
}
}
cout << "No" <<endl;
}
| 0
| 20,567,410
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, k; cin >> n >> k;
vector<ll> sum(n + 1);
for(int i = 1; i <= n; i++) {
int a; cin >> a;
sum[i] = (sum[i - 1] + a - 1) % k;
sum[i] = (sum[i] + k) % k;
}
map<ll, ll> mp;
ll ans = 0;
for(int i = 0; i <= n; i++) {
if(i - k >= 0)mp[sum[i - k]]--;
ans += mp[sum[i]];
mp[sum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
ll mod = 998244353;
signed main()
{
ll n;
ll ans = 100000;
auto f = [](ll x) {
ll a = 0;
while (x > 0)
{
x /= 10;
a++;
}
return a;
};
cin >> n;
for (ll i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
ll j = n / i;
chmin(ans, max(f(i), f(j)));
}
}
cout << ans << endl;
return 0;
}
| 0
| 16,208,715
|
#include<stdio.h>
int main()
{
int N,i;
scanf("%d %d",&N,&i);
N=N+1-i;
printf("%d",N);
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 1LL<<60;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -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<typename T> inline string toString(const T &a){
ostringstream oss;
oss << a;
return oss.str();
};
struct edge{
int from;
int to;
int cost;
};
int main(){
int N,M;
cin >> N >> M;
vector<edge> G(M);
for(int i=0; i<M; i++){
cin >> G[i].from >> G[i].to >> G[i].cost;
G[i].from--;
G[i].to--;
}
vector<vector<int>> dist(N, vector<int> (N));
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
if(i==j){
dist[i][j] = 0;
}else{
dist[i][j] = inf;
}
}
}
for(int i=0; i<M; i++){
chmin(dist[G[i].from][G[i].to],G[i].cost);
chmin(dist[G[i].to][G[i].from],G[i].cost);
}
for(int k=0; k<N; k++){
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
chmin(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
int ans = 0;
for(int i=0; i<M; i++){
bool sh = false;
for(int j=0; j<N; j++){
if(dist[j][G[i].from]+G[i].cost == dist[j][G[i].to]) sh = true;
}
if(sh){
ans++;
}
}
cout << M-ans << endl;
return 0;
}
| 0
| 98,887,577
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int A,B,C,D;cin>>A>>B>>C>>D;
if(abs(A-C)<=D||(abs(A-B)<=D&&abs(B-C)<=D))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
vector<int> c(30);
for(auto i : s) c.at(i-'a')++;
for(int i = 0; i < 26; i++){
if(c.at(i) >= 2){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
| 0
| 5,335,016
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int64_t L; cin>>L;
vector<int64_t>a(N);
for(int i=0;i<N;i++)
cin>>a.at(i);
int64_t ans=0;
for(int i=0;i<N-1;i++)
if(L<=a.at(i)+a.at(i+1)){ans=i+1; break;}
if(ans==0)
cout<<"Impossible"<<endl;
else{
cout<<"Possible"<<endl;
for(int i=1;i<ans;i++)
cout<<i<<endl;
for(int i=N-1;ans<i;i--)
cout<<i<<endl;
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
int n1;
int n2;
int num;
int cnt;
int ans = 0;
int tmpans;
int m;
while (cin>>n>>n1>>n2,n!=0||n1!=0||n2!=0){
vector<int> vec(n);
m = 0;
for(m = 0;m < n;m++){
cin >> num;
vec.at(m) = num;
}
ans = 0;
while(n1<=n2){
tmpans = vec.at(n1-1) - vec.at(n1);
if (tmpans >= ans){
ans = tmpans;
cnt = n1;
}
n1 = n1 + 1;
}
cout<<cnt<<endl;
}
}
| 0
| 71,096,911
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> fridge(a), microwave(b);
int minf = 1e6, minm = 1e6;
for(int i=0; i<a; i++){ cin >> fridge[i]; minf = min(minf, fridge[i]); }
for(int i=0; i<b; i++){ cin >> microwave[i]; minm = min(minm, microwave[i]); }
int ans = minf + minm;
for(int i=0; i<m; i++){
int x, y, c;
cin >> x >> y >> c;
x -= 1;
y -= 1;
ans = min(ans, fridge[x] + microwave[y] - c);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string str;
int ans[26] = {0};
while (getline(cin, str)) {
for (int i = 0; i < str.size(); i++) {
if ('a' <= str[i] && str[i] <= 'z') {
ans[str[i] - 'a']++;
} else if ('A' <= str[i] && str[i] <= 'Z') {
ans[str[i] - 'A']++;
}
}
}
for (int i = 0; i < 26; i++) {
cout << (char)('a' + i) << " : " << ans[i] << endl;
}
return 0;
}
| 0
| 30,392,697
|
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
vector<int> graph[250000];
bool besucht[250000];
ll query[250000];
ll res[250000];
void dfs( int p, ll sum ){
if( besucht[p] ) return;
besucht[p] = true;
res[p] = sum;
for( auto next : graph[p] ){
dfs( next, sum+query[next] );
}
}
int main(){
int n, q; cin >> n >> q;
for( int i = 0; i < n-1; ++i ){
int a, b; cin >> a >> b; --a; --b;
graph[a].push_back(b);
graph[b].push_back(a);
}
for( int i = 0; i < q; ++i ){
int p; ll x; cin >> p >> x;
query[p-1] += x;
}
dfs(0, query[0]);
for( int i = 0; i < n; ++i ){
cout << res[i] << ' ';
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF 1e09
using std::cin;
using std::cout;
using std::endl;
using std::setprecision;
using std::fixed;
using std::pair;
using std::make_pair;
using std::min;
using std::max;
using std::string;
using std::vector;
using std::list;
using std::map;
using std::set;
using std::queue;
using std::priority_queue;
using std::stack;
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, pair<int, int> > PIII;
int main(void) {
while(1) {
int n;
cin >> n;
if (n == 0) {
break;
}
VI time(60 * 60 * 24 + 1);
for (int i = 0; i < n; i++) {
int s_h;
int s_m;
int s_s;
int e_h;
int e_m;
int e_s;
scanf("%d:%d:%d %d:%d:%d", &s_h, &s_m, &s_s, &e_h, &e_m, &e_s);
int start = 60 * 60 * s_h + 60 * s_m + s_s;
int end = 60 * 60 * e_h + 60 * e_m + e_s;
for (int j = start; j < end; j++) {
time[j]++;
}
}
int res = 0;
for (int i = 0; i < (int)(time.size()); i++) {
res = std::max(res, time[i]);
}
cout << res << endl;
}
return 0;
}
| 0
| 90,763,850
|
#pragma gcc optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,r,n) for(ll i=(ll)(r);i<(ll)(n);++i)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define pb(n) push_back(n)
#define endl '\n'
#define P(x) cout << #x << " = " << (x) << endl
#define IN(n) cin >> n
#define IN2(a,b) cin >> a >> b
#define IN3(a,b,c) cin >> a >> b >> c
#define VIN(V) for(int i = 0; i < (V).size(); i++) {cin >> (V).at(i);}
#define OUT(n) cout << n << endl
#define VOUT(V) REP(i, (V).size()) {cout << (V)[i] << endl;}
#define VOUT2(V) REP(i, (V).size()) {cout << (V)[i] << " ";} cout<<endl;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll> > vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, count = 0; string s; char c;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
ll r;
IN(r);
if (r < 1200) {
OUT("ABC");
} else if (r < 2800){
OUT("ARC");
} else {
OUT("AGC");
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, char> P;
int n = 0;
int encode(string a){
vector<int> l;
for(int i = 0; i < a.size(); i++){
switch(a[i]){
case 'm':
l.push_back(1000);
break;
case 'c':
l.push_back(100);
break;
case 'x':
l.push_back(10);
break;
case 'i':
l.push_back(1);
break;
default :
l.push_back(int(a[i] - '0'));
break;
}
}
int i = 0;
int sum = 0;
while(1){
bool flag = false;
if(i == l.size()) break;
if(2 <= l[i] && l[i] <= 9){
sum += l[i] * l[i + 1];
flag = true;
}
else{
sum += l[i];
}
if(flag){
i += 2;
}
else i++;
}
return sum;
}
int keisu(int a){
if(2 <= a && a <= 9) return 1;
else if(a == 1) return 2;
return 0;
}
vector<char> decode(int a){
int m = a / 1000;
int c = (a % 1000) / 100;
int x = ((a % 1000) % 100) / 10;
int i = ((a % 1000) % 100) % 10;
vector<P> tmp;
tmp.push_back(P(m, 'm'));
tmp.push_back(P(c, 'c'));
tmp.push_back(P(x, 'x'));
tmp.push_back(P(i, 'i'));
vector<char> res;
for(int i = 0; i < 4; i++){
if(keisu(tmp[i].first) == 1){
res.push_back(char(tmp[i].first + '0'));
res.push_back(tmp[i].second);
}
else if(keisu(tmp[i].first) == 2){
res.push_back(tmp[i].second);
}
}
return res;
}
void display(vector<char> res){
for(int i = 0; i < res.size(); i++){
cout << res[i];
}
cout << endl;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
string a, b;
cin >> a >> b;
int sum = encode(a) + encode(b);
vector<char> res = decode(sum);
display(res);
}
return 0;
}
| 0
| 40,771,793
|
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popcount __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
#define printpii(a) cout << a.ft << " " << a.sd << endl;
#define printpiii(a) cout << a.ft << " " << a.sd.ft << " " << a.sd.sd << endl;
#define print(a, n) rep(i, n) cout << a[i] << " "; cout << endl;
#define printv(v) for(auto x: v)cout << x << " "; cout << endl;
#define printm(a, n, m) rep(i, n) { rep(j, m) cout << a[i][j] << "\t"; cout << endl;}
ll dx[4] = {0, 0, 1, -1};
ll dy[4] = {1, -1, 0, 0};
void fast(){ios_base::sync_with_stdio(false);cin.tie(0);cout << setprecision(12) << fixed;}
void solve(){
string n, m; cin >> n >> m;
if(n == m) ANS("EQUAL");
if(n.size() == m.size()) cout << (n > m? "GREATER" : "LESS");
else cout << (n.size() > m.size()? "GREATER" : "LESS");
}
main(){
fast();
ll t = 1;
while(t--){
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const int MAX_N = 100000;
const int MAX_S = 317;
int n, s, j, skip, nextskip, lis, idx, nextidx;
int a[MAX_N], sz[MAX_S * 2], top[MAX_S * 2], p[MAX_S], nextp[MAX_S];
int PatienceSorting(int nexti){
int r = -1;
int l = -1;
if(p[0] == -1) r = 0;
for(int i = 0; i < 2 * s; i++){
top[i] = INF;
sz[i] = 0;
}
for(int i = 0; i < n; i++){
if(i < skip) continue;
else if(r + 1 < idx && a[i] == p[r + 1]){
r++;
continue;
}else if(r == -1 || a[i] < p[r] || (l >= j && a[i] > top[j])) continue;
int h;
if(l == -1 || a[i] > top[l]){
l++;
h = l;
}else{
h = lower_bound(top, top + MAX_S * 2, a[i]) - top;
}
top[h] = a[i];
sz[h]++;
if(h == nexti){
if(nextskip == -1) nextskip = i;
nextp[nextidx++] = a[i];
}
}
return l;
}
int main(){
cin >> n;
s = MAX_S;
j = 2 * s - 1;
for(int i = 0; i < n; i++) cin >> a[i];
p[0] = -1;
idx = 1;
while(1){
int l = PatienceSorting(-1);
if(l < 2 * s - 1){
lis += l + 1;
break;
}
int nexti = -1;
for(int i = 2 * s - 1; i >= s; i--){
if(sz[i] <= s && sz[i] > 0){
nexti = i;
break;
}
}
nextskip = -1;
nextidx = 0;
PatienceSorting(nexti);
idx = nextidx;
swap(p, nextp);
skip = nextskip;
lis += nexti + 1;
}
cout << lis << endl;
}
| 0
| 29,940,617
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int a,b;
cin>>a>>b;
if((a+b)%3==0||a%3==0||b%3==0)cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int letter_to_int(char c) {
return tolower(c) - 'a';
}
int compare_array(vector<int> a1, vector<int>a2) {
if (a1.size() != a2.size()) {
return a1.size() - a2.size();
}
for (int i=0; i<a1.size(); i++) {
if (a1.at(i) != a2.at(i)) {
return a1.at(i) - a2.at(i);
}
}
return 0;
}
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
return gcd(b, a % b);
}
char int_to_char(int a) {
if (a == -1) {
return 'z';
}
else {
return 'a' + a;
}
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int divide_count(int a, int divider) {
int r = 0;
while(a % divider == 0) {
a /= divider;
r++;
}
return r;
}
bool is_prime(int a) {
int i = 2;
while(i * i <= a) {
if(a % i == 0) {
return false;
}
i++;
}
return true;
}
vector<vector<int>> all_comb(int n, int k) {
vector<vector<int>> combs(nCr(n, k), vector<int>(k));
for(int i=0; i<k; i++) {
combs[0][i] = i;
combs[1][i] = i;
}
for(long i=1; i<nCr(n, k); i++) {
int p = 1;
while(combs[i][k - p] == n - p) {
p++;
if(p > k) {
break;
}
}
combs[i][k - p]++;
int q = combs[i][k - p];
for(int j=1; j<p; j++) {
combs[i][k - p + j] = q + j;
}
if(i < nCr(n, k) - 1) {
for(int j=0; j<k; j++) {
combs[i + 1][j] = combs[i][j];
}
}
}
return combs;
}
int main() {
static const double pi = 3.141592653589793;
std::cout << std::setprecision(9);
double a, b, x;
cin >> a >> b >> x;
double tan = 0.0;
if(x >= a * a * b / 2) {
tan = 2 * b / a - 2 * x / a / a / a;
}
else {
tan = a * b * b / 2 / x;
}
double theta = atan(tan);
double ans = theta * 180 / pi;
cout << ans << endl;
}
| 0
| 70,242,510
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
int N, M;
cin >> N >> M;
vector<P> A(N);
REP(i,N) cin >> A[i].first >> A[i].second;
vector<P> B(M);
REP(i,M) cin >> B[i].first >> B[i].second;
int check[N] = {0};
REP(i,N){
int MIN = INF;
REP(j,M){
if(MIN>abs(A.at(i).first-B.at(j).first)+abs(A.at(i).second-B.at(j).second)){
MIN=abs(A.at(i).first-B.at(j).first)+abs(A.at(i).second-B.at(j).second);
check[i] = j;
}
}
}
REP(i,N){
cout << check[i]+1 << endl;
}
}
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
map<ll, ll> ma;
rep(i, N) { cin >> A[i]; }
sort(all(A));
int cnt = 1;
ll prev = 0;
bool judge = 0;
rep(i, N) {
if (i != 0) {
if (prev * 2 >= A[i])
cnt++;
else
cnt = 1;
}
prev += A[i];
}
cout << cnt << endl;
}
| 0
| 95,213,488
|
#include <iostream>
using namespace std;
int main(){
int n,a[10000],q,q1,q2,q3,q3s;
cin >> n >> q;
for (int i = 0; i <= n; i++){
a[i] = i;
}
for (int i = 0; i < q; i++){
cin >> q1 >> q2 >> q3;
if (q1){
if (a[q2] == a[q3]){
cout << 1 << endl;
} else{
cout << 0 << endl;
}
} else {
q3s = a[q3];
for (int j = 0; j <= n; j++){
if (a[j] == q3s){
a[j] = a[q2];
}
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve(){
vector<int>a(5);
for(int i=0;i<5;i++)cin >> a[i];
int mxdif=0;
int mndif=1e9;
int mxidx=-1;
int ans=0;
for(int i=0;i<5;i++){
if(a[i]%10==0) ans+=a[i];
else ans+=((10-(a[i]%10))+a[i]);
if(10-a[i]%10>mxdif && a[i]%10!=0){
mxdif=10-a[i]%10;
mxidx=i;
}
}
if(mxidx!=-1){
ans-=(10-(a[mxidx]%10))+a[mxidx];
ans+=a[mxidx];
}
cout << ans << endl;
}
int main(){
solve();
return 0;
}
| 0
| 7,684,264
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string from,to;
cin>>from>>to;
int f[from.size()+1][to.size()+1];
for(int i=0;i<from.size()+1;i++){
for(int j=0;j<to.size()+1;j++){
f[i][j]=0;
}
}
for(int i=1;i<from.size()+1;i++){
f[i][0]=i;
}
for(int i=1;i<to.size()+1;i++){
f[0][i]=i;
}
for(int i=1;i<from.size()+1;i++){
for(int j=1;j<to.size()+1;j++){
if(from[i-1]==to[j-1]){
f[i][j]=f[i-1][j-1];
}else{
int min1=min(f[i-1][j-1],f[i][j-1]);
f[i][j]=min(min1,f[i-1][j])+1;
}
}
}
cout<<f[from.size()][to.size()]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll MOD=1000000007;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
ll n,k;
cin>>n>>k;
ll r[100001];
rep(i,100001){
r[i]=0;
}
rep(i,n){
ll a,b;
cin>>a>>b;
r[a]+=b;
}
ll ans=0;
rep(i,100001){
ans+=r[i];
if(ans>=k){
cout<<i;
break;
}
}
return 0;
}
| 0
| 17,371,063
|
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>
#include <random>
using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
VT<VT<string>> S;
int main(void) {
int H, W;
cin >> H >> W;
S.resize(H, VT<string>(W));
for_each(ALL(S), [](VT<string> &v) {
for_each(ALL(v), [](auto &e){cin >> e;});
});
REP(i, H)REP(j, W) {
if (S[i][j] == "snuke") {
cout << (char)('A' + j) << i + 1 << endl;
return 0;
}
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string a[50];
string b[50];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
bool ok = false;
for (int sy = 0; sy < n; sy++) {
if (sy + m > n) {
break;
}
for (int sx = 0; sx < n; sx++) {
if (sx + m > n) {
break;
}
bool match = true;
for (int y = 0; y < m; y++) {
for (int x = 0; x < m; x++) {
if (a[sy + y][sx + x] != b[y][x]) {
match = false;
}
}
}
if (match) {
ok = true;
}
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 96,038,574
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<list>
#define N 10002
using namespace std;
vector<int> G[N+1];
list<int> ans;
bool visited[N+1];
int indeg[N+1];
int n;
void dfs(int node){
visited[node]=true;
for(int i=0;i<G[node].size();i++){
int v=G[node][i];
if(visited[v]==false){
dfs(v);
}
}
ans.push_front(node);
}
int main(){
int q;
cin>>n>>q;
for(int i=0;i<n;i++){
visited[i]=false;
indeg[i]=0;
}
for(int i=0;i<q;i++){
int s,t;
cin>>s>>t;
G[s].push_back(t);
indeg[t]++;
}
for(int i=0;i<n;i++){
if(visited[i]==false){
dfs(i);
}
}
for(list<int>::iterator it=ans.begin();it!=ans.end();it++){
cout<<*it<<endl;
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define CFOR(i, str) for(int i = 0; (str)[i]!='\0'; (i)++)
#define FOR(i, s, r) for(ll i = (s); i < (r); i++)
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define SORT(v) sort(v.begin(), v.end())
#define RSORT(v) sort(v.rbegin(), v.rend())
#define MAX(v) *max_element(v.begin(), v.end())
#define MIN(v) *min_element(v.begin(), v.end())
#define CNT(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define mp make_pair
#define n_l '\n'
#define P cout<<
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: "<<to_string(__VA_ARGS__)<<n_l;
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cerr << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cerr << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cerr << endl
#define rot(s, k) rotate(s.begin(), s.begin()+ s.size()-(k%s.size()), s.end());
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll mbp(ll a, ll b, ll m){ a %= m; ll res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; }
bool isPrime(ll n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (ll i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; }
int total(int n) { return int((-1 + sqrt(1 + 8 * n)) / 2); }
int a[5][5];
bool ok[5][5];
void solve() {
for(int i = 1; i <= 3; ++i)
for(int j = 1; j <= 3; ++j)
cin >> a[i][j];
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
{
int x;
cin >> x;
for(int xx = 1; xx <= 3; ++xx)
for(int yy = 1; yy <= 3; ++yy)
if(a[xx][yy] == x)
ok[xx][yy] = 1;
}
bool oki = 0;
for(int i = 1; i <= 3; ++i)
{
int s = 0;
for(int j = 1; j <= 3; ++j)
s += ok[i][j];
if(s == 3)
oki = 1;
s = 0;
for(int j = 1; j <= 3; ++j)
s += ok[j][i];
if(s == 3)
oki = 1;
if(i == 1)
{
s = 0;
for(int j = 1; j <= 3; ++j)
s += ok[j][j];
if(s == 3)
oki = 1;
s = 0;
for(int j = 3; j >= 1; --j)
s += ok[j][4 - j];
if(s == 3)
oki = 1;
}
}
cout << (oki == 1 ? "Yes" : "No");
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
clock_t start = clock();
solve();
clock_t stop = clock();
double elapsed = (double) 10 * (stop - start) / CLOCKS_PER_SEC;
cerr<<setprecision(5)<<fixed;
cerr<<"\nProcess finished in: "<<elapsed<<"ms\n";
return 0;
}
| 0
| 44,620,395
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int Q;
ll A,B;
bool judge(ll mid)
{
if(mid < A && mid < B)return true;
if(mid % 2)
{
ll mid1,mid2;
mid1 = mid2 = (mid + 1) / 2;
if(A <= mid1)mid1++;
if(B <= mid2)mid2++;
return mid1 * mid2 < A * B;
}
else
{
ll mid11,mid12,mid21,mid22;
mid11 = mid21 = mid / 2;
mid12 = mid22 = mid11 + 1;
if(A <= mid11)
{
mid11++;
mid12++;
}
else if(A <= mid12)mid12++;
if(B <= mid21)
{
mid21++;
mid22++;
}
else if(B <= mid22)mid22++;
return (mid21 * mid12 < A * B) && (mid11 * mid22 < A * B);
}
return false;
}
int main()
{
scanf("%d",&Q);
while(Q--)
{
scanf("%lld%lld",&A,&B);
ll l = 0,r = 2000000000;
while(r - l > 1)
{
ll mid = (l + r) / 2;
if(judge(mid))l = mid;
else r = mid;
}
printf("%lld\n",l);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+50;
int n,c[maxn],d[maxn],kd[maxn],f[maxn],res[maxn];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
int ai;
scanf("%d",&ai);
++c[ai];
}
for(int i=1;i<=n;++i) ++d[c[i]];
for(int i=0;i<=n;++i) kd[i]=i*d[i];
for(int i=1;i<=n;++i){
d[i]+=d[i-1];
kd[i]+=kd[i-1];
}
for(int i=1;i<=n;++i){
f[i]=(kd[i]+i*(d[n]-d[i]))/i;
}
int pos=n,ans=0,i=1;
while(pos){
while(pos<=f[i]) ++ans,++i;
res[pos--]=ans;
}
for(int i=1;i<=n;++i) printf("%d\n",res[i]);
return 0;
}
| 0
| 37,926,264
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll INF = 1LL<<60;
const ll MOD = 1e9 + 7;
int main() {
ll a,b,c,k;
cin >> a >> b >> c >> k;
ll cnt = 0;
while (a >= b) {
b *= 2;
cnt++;
}
while(b >= c) {
c *= 2;
cnt++;
}
if (cnt <= k) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
char mat[100][100];
string s = "#.";
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
mat[i][j] = s[i/50];
}
}
a--, b--;
for(int i = 0; i < 50; i++){
for(int j = 1 + i%2; a > 0 && j < 100; j += 3){
mat[i][j] = '.';
a--;
}
}
for(int i = 51; i < 100; i++){
for(int j = 1 + i%2; b > 0 && j < 100; j += 3){
mat[i][j] = '#';
b--;
}
}
cout << 100 << " " << 100 << endl;
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
cout << mat[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 36,275,638
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void print(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void print(H head, T ...tail) { cout << head << " "; print(tail...); }
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
map<ll, ll> freq;
int n; ll k; read(n, k);
rep(i, 0, n) { int a, b; read(a, b); freq[a] += b; }
ll ctl = 0;
for (auto p : freq) {
ctl += p.second;
if (ctl >= k) {
print(p.first);
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
vector<int>a[M];
bool vis[M];
int gcd(int a,int b){return a?gcd(b%a,a):b;}
main()
{
cin>>N;
for(int i=2;i<M;++i)for(int j=i;j<M;j+=i)a[j].push_back(i);
int g=0;
bool ok=true;
for(int i=0;i<N;++i){
int A;cin>>A;
g=gcd(g,A);
for(int j:a[A]){
ok&=!vis[j];
vis[j]=true;
}
}
cout<<(ok?"pairwise coprime":g==1?"setwise coprime":"not coprime")<<endl;
}
| 0
| 56,448,920
|
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long long MOD = 1000000007;
signed main(){
ll N, M;
cin >> N >> M;
PRINT((ll)pow(2, M) * ((N - M) * 100 + M * 1900));
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> c(n-1);
vector<ll> s(n-1);
vector<ll> f(n-1);
for (ll i = 0;i < n-1;i++){
cin >> c[i] >> s[i] >> f[i];
}
vector<ll> ans(505,0);
for (ll i = 0; i < n; i++){
for (ll j = i; j < n-1; j++){
if (s[j] >= ans[i]){
ans[i] = s[j] + c[j];
}
else{
ll x = (ans[i] + f[j] -1)/f[j];
ans[i] = f[j]*x + c[j];
}
}
}
for (ll i = 0; i < n; i++){
cout << ans[i] << endl;
}
}
| 0
| 94,577,610
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
int A, B, C, D;
string s, t;
cin >> s;
t = s[0];
A = stoi(t);
t = s[1];
B = stoi(t);
t = s[2];
C = stoi(t);
t = s[3];
D = stoi(t);
const int ADD = 0;
const int SUB = 1;
int tp = A;
bool find = false;
rep(i, 2)
{
rep(j, 2)
{
rep(k, 2)
{
s = to_string(A);
tp = A;
if (i == ADD) {
tp += B;
s += "+" + to_string(B);
}
else {
tp -= B;
s += "-" + to_string(B);
}
if (j == ADD) {
tp += C;
s += "+" + to_string(C);
}
else {
tp -= C;
s += "-" + to_string(C);
}
if (k == ADD) {
tp += D;
s += "+" + to_string(D);
} else {
tp -= D;
s += "-" + to_string(D);
}
if (tp == 7) {
find = true;
s += "=7";
cout << s << endl;
}
if (find) break;
}
if (find) break;
}
if (find) break;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
vector<ll> ss;
ll solve(const int N, const int M) {
map<int, ll> m;
ll ans = 0;
for (int i = 0; i <= N; i++) {
int x = ss[i] % M;
ans += m[x];
m[x]++;
}
return ans;
}
int main(void) {
int N, M;
cin >> N >> M;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
ss.resize(N + 1, 0);
for (int i = 0; i < N; i++) {
ss[i + 1] = ss[i] + as[i];
}
cout << solve(N, M) << endl;
return 0;
}
| 0
| 7,852,597
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <string>
using namespace std;
int main()
{
string s[1001], ms, fs, ss;
int m = 0, c, i = 0;
getline(cin, ss);
stringstream gs(ss);
while(gs >> s[i]){
if(s[i].size() > m){
m = s[i].size();
ms = s[i];
}
i++;
}
for(i = 0, c = 0; i < 1001; i++){
for(int j = i + 1; j < 1001; j++){
if(s[i].compare(s[j]) == 0){
int nc = 0;
nc++;
if(nc > c){
c = nc;
fs = s[i];
}
}
}
}
cout << fs << " " << ms << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n), num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
sum += num[i] * (num[i] - 1) / 2;
}
for (ll i = 0; i < n; i++) {
ll tmp = 0;
tmp += sum;
tmp -= num[a[i]] * (num[a[i]] - 1) / 2;
tmp += (num[a[i]] - 1) * (num[a[i]] - 2) / 2;
cout << tmp << endl;
}
return 0;
}
| 0
| 37,451,535
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsigned
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define ci m(char, ll)
#define ii m(ll, ll)
#define mid(a,b) ((a+b)/2)
#define pb push_back
#define LCM(a,b) ((a*b)/__gcd(x,y))
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
class triplet{
ll f, s, t;};
vl in(ll n){vl v;ll x;
f(i,n)
cin>>x, v.pb(x);
return v;}
void out(vl v){
fl(i,v)cout<<i;
}
void out(vl v, char ch){
fl(i,v)
cout<<i<<ch;
}
void solve(){
string S,T;
cin>>S>>T;
ll c=0;
f(i,3)
if(S.at(i) == T.at(i))
c++;
cout<<c;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
vector < pair < int , int > > a[N];
int vis[N];
int pos[N];
int valid = 1;
void dfs(int n, int cur)
{
vis[n] = 1;
pos[n] = cur;
for(int i=0;i<a[n].size();i++)
{
if(vis[a[n][i].first]==0)
{
dfs(a[n][i].first, cur+a[n][i].second);
}
else
{
if( pos[n] + a[n][i].second != pos[a[n][i].first] )
valid = 0;
}
}
}
int32_t main()
{
int n, m;
cin>>n>>m;
for(int i=0; i<m; i++)
{
int u, v, w;
cin>>u>>v>>w;
a[u].push_back({v, w});
a[v].push_back({u, -w});
}
for(int i=1;i<=n;i++)
pos[i] = -1;
int cur = 0;
for(int i=1;i<=n;i++)
{
if(vis[i]==0)
{
dfs(i, cur);
cur+=1e10;
}
}
if(valid == 0)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
return 0;
}
| 0
| 59,042,621
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
bool flag=false;
cin >> X >> Y;
for (int i=0; i<X+1; i++){
if (4*X-2*i == Y){
flag=true;
break;
}
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
vll a(k);
REP(i,k) cin >> a[i];
ll mx = 2;
ll mn = 2;
for(ll i=k-1;i>=0;--i){
ll x = ((mn-1)/a[i]+1)*a[i];
if(x>mx){
cout << -1 << endl;
return 0;
}
ll y = (mx/a[i])*a[i];
if(y<mn){
cout << -1 << endl;
return 0;
}
mx = y+a[i]-1;
mn = x;
}
cout << mn << " " << mx << endl;
return 0;
}
| 0
| 81,125,740
|
#include <bits/stdc++.h>
using namespace std;
using f32 = float;
using f64 = double;
using LL = long long;
using ULL = unsigned long long;
#define REP(i, n) for (LL i = 0; i < (int)(n); i++)
signed main()
{
string a;
cin >>a;
REP(i,2){
if(a[i]!=a[i+1]){
cout << "Yes";
return 0;
}
}
cout << "No";
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s1,s2;
int count=0;
cin>>s1>>s2;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(i==j)
{
if(s1[i]==s2[j])
{
count++;
}
}
}
}
cout<<count<<endl;
}
| 0
| 3,544,496
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; int w; cin >> s >> w;
string ans = "";
for (int i = 0; i < s.size(); i+=w) {
ans += s[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<pair<long long int ,long long int>>
#define pb push_back
#define mp make_pair
#define pp pop_back
#define iter vector<int>::iterator
#define pa pair<long long int ,long long int>
#define f(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,n) for (ll i=a ; i<n ;i+=1)
#define fe(d,e) for(auto d:e)
#define mod 1000000007
#define F first
#define S second
#define sett set<long long int>
#define um unordered_map<ll,ll>
# define N 100005LL
# define cout1(x) cout<<x<<"\n";
# define deb(x) cout<<#x<<" "<<x<<"\n";
#define vii vector<pa>;
using namespace std;
v visited(N);
vector<ll> ans={-1};
v level(N);
v ind(N);
ll sz[N];
int main(){
ll n;
cin>>n;
v arr(n);
f(i,n)cin>>arr[i];
v pre(n);
pre[n-1]=arr[n-1];
for(ll i=n-2;i>0;i--){
pre[i]=pre[i+1]+arr[i];
}
ll ans=0;
f(i,n-1){
ans+=(pre[i+1]*arr[i]);
}
cout1(ans);
}
| 0
| 35,902,269
|
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <climits>
#define mk make_pair
#define pb push_back
#define scanf scanf_s
#define printf printf_s
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> pos;
const ll N = 310, MOD = 1000000007;
ll mn(ll a, ll b) {
if (a == -1)return b;
if (b == -1)return a;
return min(a, b);
}
int bb(int v1) {
if (v1 % 2 == 0)return v1 / 2 - 1;
else return v1 / 2;
}
ll pw(ll a, ll b) {
ll v = 1;
for (; b > 0; b = (b >> 1), a = (a * a) % MOD) {
if ((b & 1) > 0)v = (v * a) % MOD;
}
return v;
}
ll h[N],dp[N][N][N],n,k;
int main() {
memset(dp, -1, sizeof(dp));
dp[0][0][0] = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)cin >> h[i];
for (int i = 0; i < n; i++) {
for (ll j = 0; j <= k; j++) {
for (int l = 0; l <= i; l++) {
if (dp[i][j][l] == -1)continue;
ll v1 = h[l];
if (j + 1 <= k && v1!=h[i+1]) {
dp[i + 1][j + 1][l] = mn(dp[i + 1][j + 1][l], dp[i][j][l]);
}
if (v1 != h[i + 1])
dp[i + 1][j][i + 1] = mn(dp[i + 1][j][i + 1], dp[i][j][l] + max((ll)0, h[i + 1] - v1));
else
dp[i + 1][j][i + 1] = mn(dp[i + 1][j][i + 1], dp[i][j][l]);
}
}
}
ll ans = -1;
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= n; j++) {
ans = mn(ans, dp[n][i][j]);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#define _USE_MATH_DEFINES
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const ll dx[4] = { 0,1,0,-1 };
const ll dy[4] = { -1, 0, 1,0 };
const int INF = 1e9 + 7;
int gcd(int x, int y) {
if (x < y)swap(x, y);
if (y == 0)return x;
return gcd(y, x%y);
}
void mul(ll a, ll b) {
a = a * b % INF;
}
double mysqrt(double x) {
double l = 0, r = x;
for (int i = 0; i < 64; ++i) {
double m = (l + r) / 2.0;
if (m*m < x)l = m;
else r = m;
}
return l;
}
int main() {
int N, K; cin >> N >> K;
int a[1010];
REP(i, N)cin >> a[i];
vector<ll>sum;
sum.push_back(0);
REP(i, N) {
sum.push_back(sum[i] + a[i]);
}
vector<ll>V;
for (int i = 0; i < N; ++i) {
for (int j = i+1; j <= N; ++j) {
V.push_back(sum[j] - sum[i]);
}
}
sort(V.begin(), V.end(),greater<ll>());
int n = V.size();
vector<int>ok(n, 1);
ll ans = 0;
for (int i = 60; i >= 0; --i) {
ll msk = 1LL << i;
int cnt = 0;
REP(j, n)if ((V[j] & msk) && ok[j])cnt++;
if (K <= cnt) {
ans += msk;
REP(j, n)if (!(V[j] & msk) && ok[j])ok[j] = 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 35,044,344
|
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
cout << fixed << setprecision(10);
int A,B,C;
cin >> A >> B >> C;
if(C-A+B>=0)
{
cout << C-A+B << endl;
}
else
{
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#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, a, b;
cin >> n >> a >> b;
int sum=0;
for(int i=1; i<=n; i++) {
string s=to_string(i);
int ibuff=0;
rep(i,s.size()) {
ibuff += s[i]-'0';
}
if (a<=ibuff && ibuff<=b) {
sum += i;
}
}
cout << sum << endl;
return 0;
}
| 0
| 51,491,481
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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 all(a) (a).begin(),(a).end()
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
map<int,int> mp;
rep(i,n) {
int a, b;
cin >> a >> b;
mp[a] += b;
}
int now = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
now += itr->second;
if (now >= k) {
cout << itr->first << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++) {
ans++;
}
}
for (int i = 0; i < m; i++){
for (int j = i+1; j < m; j++) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 24,328,859
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Base
{
ll d[65];
const ll mx;
Base(ll mx = 60) : mx(mx)
{
for(ll i = 0; i <= mx; i++) d[i] = 0;
}
void insert(ll x)
{
for(ll i = mx; ~i; --i)
{
if(x & (1LL << i))
{
if(!d[i])
{
d[i] = x;
break;
}
x ^= d[i];
}
}
}
bool Can(ll x, ll j)
{
for(ll i = mx; ~i; --i)
if(x & (1LL << i))
x ^= d[i];
x &= ((1LL << mx) - (1LL << j));
return x == 0;
}
};
ll Get(ll Mask, ll j)
{
return (Mask & (1LL << j)) ? 1LL : 0LL;
}
int main()
{
ll n; cin >> n;
ll Xor = 0;
vector <ll> a(n);
for(ll& x : a) scanf("%lld", &x), Xor ^= x;
vector <ll> Even;
for(ll k = 0; k < 60; k++)
if(!(Xor & (1LL << k)))
Even.push_back(k);
Base B(Even.size());
for(ll i = 0; i < n; i++)
{
ll x = 0;
for(ll j = 0; j < Even.size(); j++) x ^= (Get(a[i], Even[j]) << j);
B.insert(x);
}
ll Ans = 0;
for(ll j = (ll) Even.size() - 1, Mask = 0; ~j; --j)
{
if(B.Can(Mask | (1LL << j), j))
{
Mask |= (1LL << j);
Ans += 2LL * (1LL << Even[j]);
}
}
cout << Ans + Xor << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
vector<int> ans(n);
if(n%2==0)
{
int mid=n/2;
for(int i=0;i<n;i+=2)
{
int in=i/2;
ans[mid+in]=v[i];
ans[mid-in-1]=v[i+1];
}
for(auto i:ans)
cout<<i<<" ";
cout<<endl;
}
else
{
ans[n/2]=v[0];
for(int i=1;i<n;i+=2)
{
ans[n/2+(i+1)/2]=v[i];
ans[n/2-(i+1)/2]=v[i+1];
}
for(auto i:ans)
cout<<i<<" ";
cout<<endl;
}
}
| 0
| 67,900,501
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n,greater<int>());
int mid = n/2;
mid--;
cout<<arr[mid]-arr[mid+1]<<"\n";
}
|
#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, M;
cin >> N >> M;
vector<P>A(N);
rep(i,N)cin >> A[i].first >> A[i].second;
sort(A.begin(),A.end());
ll ans = 0;
rep(i,N){
while(A[i].second){
ans += A[i].first;
A[i].second--;
M--;
if(M == 0){
cout << ans << endl;
return 0;
}
}
}
}
| 0
| 70,720,036
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
bool alphabet[26];
rep(i, 26) alphabet[i] = false;
for (int i = 0; S[i] != '\0'; ++i) {
alphabet[S[i]-'a'] = true;
}
rep(i, 26) {
if (!alphabet[i]) {
cout << char(i + 'a') << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(xi, x) for (auto &&xi : x)
template <class T> using vec = vector<T>;
using ll = long long;
using vi = vec<ll>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<ll, ll>;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
template <class T> pair<T, size_t> max(vector<T> &x) {
auto it = max_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> pair<T, size_t> min(vector<T> &x) {
auto it = min_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> inline bool chmax(T &maxval, const T &newval) {
if (maxval < newval) {
maxval = newval;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &minval, const T &newval) {
if (minval > newval) {
minval = newval;
return 1;
}
return 0;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define inside(H, W, y, x) 0 <= (x) && (x) < (W) && 0 <= (y) && (y) < (H)
#ifdef LOCAL
#include "dump.hpp"
#define debug(x) cerr << #x << ": " << x << '\n'
#else
#define dump(...)
#define debug(x)
#endif
void yesno(bool ok, string yes = "Yes", string no = "No") {
cout << (ok ? yes : no) << endl;
}
void solve(std::vector<long long> A) {
auto it1 = min_element(all(A));
auto it2 = max_element(all(A));
cout << (*it2) - (*it1) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
std::vector<long long> A(3);
for (int i = 0; i < 3; i++) {
std::cin >> A[i];
}
solve(std::move(A));
return 0;
}
| 0
| 57,956,143
|
#include<iostream>
using namespace std;
char ans[2][10]={
"No\n",
"Yes\n"
};
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=0;
if(a<b)if(b<c)flag=1;
cout<<ans[flag];
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz=110;
vector<int> prime;
int siz;
bool mark[sz];
void seive()
{
int i,j,k,sq;
sq=sqrt(sz);
for(i=3;i<sz;i+=2) mark[i]=true;
for(i=3;i<=sq;i+=2){
if(mark[i]){
for(j=i*i;j<sz;j+=i) mark[j]=false;
}
}
prime.push_back(2);
for(i=3;i<sz;i+=2) if(mark[i]) prime.push_back(i);
}
int fun(int n)
{
int i,j,k;
seive();
siz=prime.size();
int sum[siz];
memset(sum,0,sizeof sum);
for(i=0;i<siz;i++){
int tit=prime[i];
while(tit<=n){
sum[i]+=(n/tit);
tit*=prime[i];
}
}
int ans=0;
for(i=0;i<siz;i++){
if(sum[i]>=74) ++ans;
for(j=i+1;j<siz;j++){
if(sum[i]>=2 && sum[j]>=24) ++ans;
if(sum[j]>=2 && sum[i]>=24) ++ans;
if(sum[i]>=4 && sum[j]>=14) ++ans;
if(sum[j]>=4 && sum[i]>=14) ++ans;
for(k=j+1;k<siz;k++){
if(sum[i]>=2 && sum[j]>=4 && sum[k]>=4) ++ans;
if(sum[j]>=2 && sum[k]>=4 && sum[i]>=4) ++ans;
if(sum[k]>=2 && sum[j]>=4 && sum[i]>=4) ++ans;
}
}
}
return ans;
}
int main()
{
int n;
cin>>n;
int ans=fun(n);
cout<<ans<<'\n';
}
| 0
| 39,632,417
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, l;
cin >> n >> l;
vector<string> ss(n);
rep(i, n) { cin >> ss[i]; }
sort(ss.begin(), ss.end());
rep(i, n) { cout << ss[i]; }
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){ if(a>b) a = b; }
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
template<class T> int former(const vector<T> &v, T x){
return upper_bound(v.begin(), v.end(), x) - v.begin() -1;
}
template<class T> int latter(const vector<T> &v, T x){
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a%b) : a; }
int main() {
string S, T;
cin >> S >> T;
bool ok = true;
map<char,char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) {
if (ma[s] != t) {
ok = false;
}
}
if (ima.count(t)) {
if (ima[t] != s) {
ok = false;
}
}
ma[s] = t; ima[t] = s;
}
if (ok) puts("Yes");
else puts("No");
}
| 0
| 40,168,947
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
vector<ll> pw2(51,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,50) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N,K; cin>>N>>K;
ll ans=0;
vector<ll> A(N,0);
rep(i,N) cin>>A[i];
ll tmp=0;
rep(i,N-1)FOR(j,i+1,N){
if(A[i]>A[j]) tmp++;
}
ans+=tmp*K;
ans%=MOD;
map<ll,ll> m;
rep(i,N){
if(m.find(A[i])==m.ed) m[A[i]]=1;
else m[A[i]]++;
}
tmp=0;
ll tmtmp=0;
for(auto it=m.bg;it!=m.ed;it++){
tmtmp+=(tmp*(it->b))%MOD;
tmtmp%=MOD;
tmp+=(it->b);
tmp%=MOD;
}
ll tmpK=(K*(K-1))/2;
tmpK%=MOD;
ans+=(tmtmp*tmpK)%MOD;
ans%=MOD;
cout<<ans<<endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int INF=1e9;
struct edge{
int to,cost;
edge(int a,int b):to(a),cost(b){}
edge(){}
};
struct data{
int At,cost;
data(int a,int b):At(a),cost(b){}
data(){}
bool operator>(const data &d)const{
return cost>d.cost;
}
};
vector<vector<edge> >E;
int all;
int dijkstra(int s){
vector<int>D(all,INF);
priority_queue<data,vector<data>,greater<data> >Q;
Q.push(data(s,0));
while(!Q.empty()){
int At=Q.top().At,cost=Q.top().cost;
Q.pop();
if(D[At]<=cost)continue;
D[At]=cost;
for(int i=0;i<E[At].size();i++){
edge e=E[At][i];
Q.push(data(e.to,e.cost+cost));
}
}
int sum=0;
for(int i=0;i<all;i++)sum+=D[i];
return sum;
}
int main(){
int n;
while(cin>>n,n){
E.clear();
E.resize(10);
all=0;
for(int i=0;i<n;i++){
int a,b,c;
cin>>a>>b>>c;
all=max(max(a,b),all);
E[a].push_back(edge(b,c));
E[b].push_back(edge(a,c));
}
all++;
int Min=INF,p;
for(int i=0;i<all;i++){
int latte=dijkstra(i);
if(Min>latte){
Min=latte;
p=i;
}
}
cout<<p<<" "<<Min<<endl;
}
}
| 0
| 17,725,002
|
#include <iostream>
#include <queue>
#include <vector>
#define MAXSIZE 100000
using namespace std;
void calculate(vector<long long int>& lunlun_num)
{
queue<long long int> lunlun_temp;
for (int i = 1; i <= 9; i++){
lunlun_temp.push(i);
lunlun_num.push_back(i);
}
int count = 9;
while (count <= MAXSIZE){
long long int temp = lunlun_temp.front(), num = temp * 10 + temp % 10;
lunlun_temp.pop();
if (temp % 10 != 0){
lunlun_temp.push(num - 1);
lunlun_num.push_back(num - 1);
count++;
}
lunlun_temp.push(num);
lunlun_num.push_back(num);
count++;
if (temp % 10 != 9){
lunlun_temp.push(num + 1);
lunlun_num.push_back(num + 1);
count++;
}
}
}
void getans(vector<long long int>& lunlun_num)
{
int index;
cin >> index;
cout << lunlun_num[index - 1] << '\n';
}
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
vector<long long int> lunlun_num;
calculate(lunlun_num);
getans(lunlun_num);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll long long
#define INF 1000000000000000000
#define MOD 998244353
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define uid uniform_int_distribution <int>
using namespace std;
const int N = 200 * 1000 + 5;
vector <pair<int, int>> v[N];
vector <bool> vis(N);
vector <int> d(N);
bool ok = true;
void dfs(int s) {
vis[s] = true;
for (auto g : v[s]) {
if(!vis[g.ff]) {
d[g.ff] = d[s] + g.ss;
dfs(g.ff);
}
else {
if(d[g.ff] != d[s] + g.ss) {
ok = false;
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y, w;
cin >> x >> y >> w;
v[x].push_back({y, w});
v[y].push_back({x, -w});
}
for (int i = 1; i <= n; i++) {
if(!vis[i]) {
dfs(i);
}
}
if(ok) {
cout << "Yes";
}
else {
cout << "No";
}
}
| 0
| 65,763,298
|
#include <iostream>
#include <vector>
using namespace std;
long long solve(long long A, long long B){
if(A > B) swap(A, B);
long long L = 0, R = B;
while(R - L > 1){
long long mid = (L+R)/2;
if(mid * mid < A * B) L = mid;
else R = mid;
}
if(L < A) return 2 * L;
if(L * (L+1) < A * B) return 2 * L - 1;
return 2 * L - 2;
}
int main(){
int Q;
while(cin >> Q){
while(Q--){
long long A, B; cin >> A >> B;
cout << solve(A, B) << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n)
{
for (int i = 0; i <= n; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main()
{
string s;
cin >> s;
int b = 0;
int r = 0;
for (size_t i = 0; i < s.length(); i++)
{
if (s[i] == '1')
{
b++;
}
else
{
r++;
}
}
cout << s.length() - abs(b - r) << endl;
return 0;
}
| 0
| 22,474,925
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k;
cin>>n>>k;
if(n<=k) cout<<"unsafe"<<endl;
else cout<<"safe"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using usize = std::size_t;
template<typename T>
using Vector = std::vector<T>;
using String = std::string;
template<typename T>
using UniquePointer = std::unique_ptr<T>;
using namespace std;
#define rep(i, max) for(usize i = 0; i < max; ++i)
#define loop while(true)
UniquePointer<String> readLine() {
UniquePointer<String> line(new String());
getline(cin, *line);
return line;
}
template<typename T1, typename T2>
pair<T1, T2> readPair(){
T1 res1;
cin >> res1;
T2 res2;
cin >> res2;
readLine();
return make_pair(res1, res2);
}
template<typename T>
UniquePointer<Vector<T>> readVector(usize num) {
UniquePointer<Vector<T>> list(new Vector<T>(num));
rep(i, num) {
cin >> (*list)[i];
}
readLine();
return list;
}
void readValues()
{
readLine();
}
template<typename H, typename... T>
void readValues(H& head, T&&... tails){
H a;
cin >> a;
head = a;
readValues(forward<T>(tails)...);
}
template<typename T>
void writeLine(T arg) {
cout << arg << endl;
}
template<typename T>
void write(T arg) {
cout << arg << std::flush;
}
void program();
int main()
{
ios::sync_with_stdio(false);
program();
}
void program() {
int h, n;
readValues(h, n);
auto a = readVector<i32>(n);
rep(i, n){
h -= (*a)[i];
if(h <= 0){
writeLine("Yes");
return;
}
}
writeLine("No");
}
| 0
| 17,400,066
|
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
int d[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll>a(n+1);
rep(i,n+1) cin >> a[i];
vector<ll>ans(n+1);
vector<P>m(n+1);
for(int i = n; i >= 0; i--){
if(i==n)m[i]=P(a[i],a[i]);
else{
ll mi = a[i] + (m[i+1].first+1)/2;
ll ma = a[i] + m[i+1].second;
m[i] = P(mi,ma);
}
}
if(1 < m[0].first || m[0].second < 1 ){
cout << -1 << endl;
return 0;
}
rep(i,n+1){
if(i == 0)ans[0] = 1;
else{
ans[i] = min(2*(ans[i-1]-a[i-1]),m[i].second);
}
}
ll res = 0;
rep(i,n+1) res += ans[i];
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ll;
typedef unsigned long long ull;
typedef double dd;
typedef string str;
#define vli vector<li>
#define vll vector<ll>
#define sli set<li>
#define sll set<ll>
#define pli pair<li, li>
#define pll pair<ll, ll>
#define vpi vector<pair<li, li>>
#define vpl vector<pair<ll, ll>>
#define mpl map<ll, ll>
#define test ll t; cin>>t; while(t--)
#define input(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define lp(a, i, b) for(ll i=a; i<b; i++)
#define rlp(a, i, b) for(ll i=a; i>=b; i--)
#define sz(x) x.size()
#define len(z) z.begin(), z.end()
#define ci(x) cin>>x;
#define co(x) cout<<x nl
#define fix(x) fixed<<setprecision(x)
#define mem(z, l) memset(z, l, sizeof(z))
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define nl <<endl
#define nll cout<<endl
#define sp <<" "<<
#define sl <<" "
#define cy cout<<"YES" nl
#define cn cout<<"NO" nl
#define rn return
#define good_bye return 0
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define input_txt() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
const ll MOD = 1e+7;
const double PI = 3.1415926536;
int dx[] = {0, 0, +1, -1, +1, +1, -1, -1};
int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1};
const int mX = 1e7+1;
ll n, sum=1;
vll f(mX, 2);
void sieve(ll MX)
{
for(ll i=2; i<=MX; i++)
for(ll j=i*2; j<=MX; j+=i) f[j]++;
}
void case_i()
{
cin>>n;
sieve(n);
for(ll i=2; i<=n; i++) sum+=i*f[i];
cout<<sum nl;
}
int main()
{
faster;
case_i();
good_bye;
}
| 0
| 47,452,455
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.