code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const ll inf = 1e9+7;
const ll mod = 1e9+7;
int main(){
int x,a,b;
cin>>x>>a>>b;
x*=-1;
string ans;
if(a-b>=0)ans="delicious";
else if(a-b>=x)ans="safe";
else ans="dangerous";
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int N, M, R;
cin >> N >> M >> R;
vector<int> town(R);
rep(i, R)
{
cin >> town[i];
town[i]--;
}
sort(town.begin(), town.end());
long long INF = 100000000;
vector<vector<long long>> d(N, vector<long long>(N, INF));
rep(i, M)
{
int A, B, C;
cin >> A >> B >> C;
A--;
B--;
d[A][B] = C;
d[B][A] = C;
}
rep(i, N)
{
d[i][i] = 0;
}
rep(k, N) rep(i, N) rep(j, N) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
long long ans = INT32_MAX;
do
{
long long cost = 0;
rep(i, R - 1)
{
cost += d[town[i]][town[i + 1]];
}
ans = min(ans, cost);
} while (next_permutation(town.begin(), town.end()));
cout << ans << endl;
return 0;
}
| 0
| 59,804,562
|
#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 pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1000000007;
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
string s, t;
cin >> s >> t;
set<string> ans;
for(int i = 0; i + t.size() - 1 < s.size(); i++) {
bool ok = true;
for(int j = 0; j < t.size(); j++) {
if(!(s[i+j] == t[j] || s[i+j] == '?')) ok = false;
}
if(ok) {
string pos = s;
for(int j = 0; j < t.size(); j++) {
pos[i + j] = t[j];
}
for(int j = 0; j < pos.size(); j++) if(pos[j] == '?') pos[j] = 'a';
ans.insert(pos);
}
}
if(ans.size() == 0) {
cout << "UNRESTORABLE" << endl;
} else {
cout << *(ans.begin()) << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
int main(){
int N,Z,W; cin >> N >> Z >> W;
vector<int> a(N);
rep(i,N) cin >> a[i];
if(N == 1){
cout << abs(a[0]-W) << endl;
return 0;
}
int ans = max(abs(a[N-1]-W),abs(a[N-1]-a[N-2]));
cout << ans << endl;
}
| 0
| 1,752,954
|
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int v,A[100][100],u,k,w;
int main(){
cin >> v ;
for (int i=0; i<v; ++i){
cin >> u >> k;
for(int j=0; j<k; ++j){
cin >> w;
A[u-1][w-1] = 1;
}
}
for (int i=0; i<v; ++i){
for (int j=0; j<v; ++j){
cout << A[i][j];
if (j < v-1)
cout << " ";
}
cout << endl ;
}
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define llong long long
using namespace std;
int main()
{
llong H, W;
while (true) {
cin >> H >> W;
if (H == 0 && W == 0) {
break;
}
REP(i,H){
REP(j,W) cout << "#";
cout << endl;
}
cout << endl;
}
return 0;
}
| 0
| 37,498,320
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e3;
int val[M], cost[M], n, memo[10001];
int solve(int h) {
if (h < 1)
return 0;
int &result = memo[h];
if (result == -1) {
result = 2e9;
for (int i = 0; i < n; i++)
result = min(result, solve(h - val[i]) + cost[i]);
}
return result;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(memo, -1, sizeof memo);
int h;
cin >> h >> n;
for (int i = 0; i < n; i++)
cin >> val[i] >> cost[i];
cout << solve(h) << '\n';
}
|
#include <vector>
namespace cp {
struct union_find {
std::vector<int> p; union_find(int n) : p(n, -1) { }
int find(int x) { return p[x] < 0 ? x : p[x] = find(p[x]); }
bool unite(int x, int y) {
int xp = find(x), yp = find(y);
if (xp == yp) return false;
if (p[xp] > p[yp]) std::swap(xp,yp);
p[xp] += p[yp], p[yp] = xp;
return true;
}
int size(int x) { return -p[find(x)]; }
};
}
#include <cstdio>
int main() {
int n, q;
scanf("%d %d", &n, &q);
cp::union_find d(n);
for (int i = 0; i < q; i++) {
int t, u, v;
scanf("%d %d %d", &t, &u, &v);
if (t == 0)
d.unite(u, v);
else
printf("%d\n", d.find(u) == d.find(v));
}
return 0;
}
| 0
| 65,988,166
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using M = map<int, int>;
using Ml = map<ll, ll>;
ll const INF = 1ll<<61;
double pi = 3.141592653589793238;
int main() {
ll a, b;
string s;
cin >> a >> b >> s;
rep(i, a) {
ll isnumber = false;
rep(j, 10) {
if(s[i] == '0' + j) isnumber = true;
}
if (!isnumber) {
cout << "No" << endl;
return 0;
}
}
if (s[a] != '-' ) {
cout << "No" << endl;
return 0;
}
repI(i, a+1, a+b+1) {
ll isnumber = false;
rep(j, 10) {
if(s[i] == '0' + j) isnumber = true;
}
if (!isnumber) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion
#define int long long
signed main()
{
int n;
cin >> n;
int Y = 5 * 20 + 5 * 19;
int Y_3 = 10 * 20;
int ml = 0;
for(int i=1; i<=999; ++i) {
if(i%3==0) ml += Y_3;
else ml += Y;
}
ml += 1;
while(n--) {
int y, m, d;
cin >> y >> m >> d;
int cur = 0;
for(int i=1; i<y; ++i) {
if(i%3==0) cur += Y_3;
else cur += Y;
}
if(y%3!=0) {
for(int j=1; j<m; ++j) {
if(j%2==1) cur += 20;
else cur += 19;
}
} else cur += (m-1)*20;
cur += d;
cout << ml-cur << endl;
}
return 0;
}
| 0
| 70,746,621
|
#include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim) for(int j=stt;j<llim;j++)
#define eifor(st,lim) for(int i=st;i<=lim;i++)
#define ejfor(stt,llim) for(int j=stt;j<=llim;j++)
#define blank cout<<'\n'
void solve()
{
string s; cin>>s;
if(s[0] == s[1] && s[1] == s[2] && s[0] == 'R') cout<<"3";
else if(s[0] == s[1] && s[0] == 'R') cout<<"2";
else if(s[1] == s[2] && s[1] == 'R') cout<<"2";
else if(s[0] == 'R' || s[1] == 'R' || s[2] == 'R') cout<<"1";
else cout<<"0";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
while(t--){
solve();
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct Node {
vector<int> edge_to;
vector<int> edge_from;
vector<ll> edge_cost;
vector<ll> edge_from_cost;
bool done;
bool contain;
ll cost;
};
int main() {
int n, m, R;
cin >> n >> m >> R;
vector<int> r(R);
for(int i = 0; i < R; i++) {
cin >> r[i];
r[i]--;
}
sort(r.begin(), r.end());
vector<Node> node(n);
for(int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
node[a].edge_to.push_back(b);
node[a].edge_cost.push_back(c);
node[b].edge_to.push_back(a);
node[b].edge_cost.push_back(c);
}
vector<vector<ll>> dis(n + 1, vector<ll>(n + 1, -1));
for(int i = 0; i < R; i++) {
for(int j = 0; j < n; j++) {
node[j].done = false;
node[j].cost = -1;
}
auto compare = [](Node *a, Node *b) { return a->cost < b->cost; };
priority_queue<Node, vector<Node*>, decltype(compare)> q{compare};
node[r[i]].cost = 0;
q.push(&node[r[i]]);
while(!q.empty()) {
Node doneNode = *q.top();
q.pop();
doneNode.done = true;
for(int j = 0; j < doneNode.edge_to.size(); j++) {
ll to = doneNode.edge_to[j];
ll cost = doneNode.cost + doneNode.edge_cost[j];
if(node[to].cost < 0 || cost < node[to].cost) {
node[to].cost = cost;
if(node[to].contain == false){
q.push(&node[to]);
}
}
}
}
for(int j = 0; j < R; j++) {
dis[r[i]][r[j]] = node[r[j]].cost;
}
}
ll ans = 100101001001001;
do {
ll sum = 0;
for(int i = 0; i < R - 1; i++) {
sum += dis[r[i]][r[i + 1]];
}
ans = min(ans, sum);
} while(next_permutation(r.begin(), r.end()));
cout << ans << endl;
return 0;
}
| 0
| 80,849,794
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0;
int ans = 1;
for (int i = 1; i <= N; i++)
{
int a = i;
int count = 0;
while (a % 2 == 0)
{
a /= 2;
count++;
}
if(max < count) {
max = count;
ans = i;
}
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;} cout << endl;
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool comp (pi a, pi b)
{
return atan2(a.fi, a.se) < atan2(b.fi, b.se);
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
read(n);
pi a[n + 1];
FOR (i, 1, n) cin >> a[i].fi >> a[i].se;
sort(a + 1, a + n + 1, comp);
double ans = 0;
FOR (i, 1, n)
{
int x = 0, y = 0;
FOR (j, i, n)
{
x += a[j].fi, y += a[j].se;
ans = max(ans, sqrt(x*x + y*y));
}
FOR (j, 1, i - 1)
{
x += a[j].fi, y += a[j].se;
ans = max(ans, sqrt(x*x + y*y));
}
}
cout << fixed << setprecision(15) << ans;
}
| 0
| 5,628,968
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, sum=0;
cin >> K;
int N = K;
while (true){
sum += N%10;
N = (N-N%10)/10;
if (N==0) break;
}
if (K%sum==0) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) for(lint i{}; i < (lint)(h); ++i)for(lint j{}; j < (lint)(w); ++j)
#define DREP2(i, j, n) for(lint i{}; i < (lint)(n - 1); ++i)for(lint j{i + 1}; j < (lint)(n); ++j)
#define SZ(x) ((lint)(x).size())
using lint = long long; lint N, M, H, W;
using namespace std;
const long long INF{ 1LL << 60 };
const long double PI{ 3.1415926535897932 };
const long long NUM97{ 1000000007 };
template<class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return 1; } return 0; }
template<class T> inline bool chmin(T& x, T y) { if (x > y) { x = y; return 1; } return 0; }
std::vector<std::string> field;
std::vector<std::vector<bool>> seen(H, std::vector<bool>(W));
const std::vector<int> dx{ 1, 0, -1, 0 };
const std::vector<int> dy{ 0, 1, 0, -1 };
bool first_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.first != b.first) return{ a.first > b.first };
else return { a.second > b.second };
}
bool second_smaller(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second < b.second };
else return { a.first < b.first };
}
bool second_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second > b.second };
else return { a.first > b.first };
}
lint get_digit(lint& n) {
return log10(n) + 1;
}
bool is_prime(lint N) {
if (N == 1) return false;
for (lint i = 2; i * i <= N; ++i) { if (N % i == 0) return false; }
return true;
}
std::vector<lint> divisors(lint N) { std::vector<lint> divisor;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { divisor.push_back(i);
if (N / i != i) divisor.push_back(N / i); }
} std::sort(divisor.begin(), divisor.end());
divisor.erase(std::unique(divisor.begin(), divisor.end()), divisor.end());
return divisor;
}
std::vector<lint> prime_divisors(lint N) { std::vector<lint> p_divisor;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { if (is_prime(i)) { p_divisor.push_back(i); }
if (N / i != i) { if (is_prime(N / i)) { p_divisor.push_back(N / i); } } }
} std::sort(p_divisor.begin(), p_divisor.end());
p_divisor.erase(std::unique(p_divisor.begin(), p_divisor.end()), p_divisor.end());
return p_divisor;
}
int main() {
lint N; std::cin >> N;
vector<lint> A = divisors(N);
std::cout << get_digit(A[SZ(A) / 2]);
}
| 0
| 27,709,685
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
int N;
cin >> N;
vi data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
vll count(N + 1, 0);
for (int x : data) {
count[x]++;
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
if (count[i] > 1) {
ll j = count[i];
ans += j * (j - 1) / 2;
}
}
for (int i = 0; i < N; i++) {
ll ansa = ans;
if (count[data[i]] > 1) {
ll j = count[data[i]];
ansa -= j * (j - 1) / 2;
ansa += (j - 1) * (j - 2) / 2;
}
cout << ansa << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll N; cin >> N;
vector<string> S(N);
REP(i,N){
cin >> S[i];
sort(ALL(S[i]));
}
sort(ALL(S));
ll cnt = 0;
ll ans = 0;
string str = S[0];
REP(i,N){
if(str == S[i]){
cnt++;
}else{
ans += cnt*(cnt-1)/2;
str = S[i];
cnt = 1;
}
}
ans += cnt*(cnt-1)/2;
cout << ans << endl;
return 0;
}
| 0
| 40,571,229
|
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int div = a; div <= b; div++)
{
if (!(c%div))
count++;
}
cout << count << endl;
return 0;
}
|
#ifdef _DEBUG
#include ".vscode/debug_print.hpp"
#else
#define debug(...)
#endif
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
constexpr int INF32 = 1050000000;
constexpr long long INF64 = 4000000000000000000;
constexpr int MOD7 = 1000000007;
constexpr int MOD53 = 998244353;
constexpr long double PI = 3.14159265358979323846;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&... args) {
std::cin >> head;
scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
for (auto &&i : v) {
scan(i);
}
}
void vprint() { std::cout << '\n'; }
template <class H, class... T> void vprint(H &&head, T &&... args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << '\n';
vprint(std::forward<T>(args)...);
}
template <class T> void vprint(std::vector<T> &v) {
for (auto &&i : v) {
std::cout << i << '\n';
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
string s;
scan(s);
if (s[2]==s[3] && s[4]==s[5]) {
print("Yes");
} else {
print("No");
}
return 0;
}
| 0
| 60,452,476
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
class SegmentTree {
private:
int n;
vector<int> lo, hi, max_el;
void init(int i, int a, int b) {
lo[i] = a;
hi[i] = b;
if (a == b) {
return;
}
int m = (a+b)/2;
init(2*i, a, m);
init(2*i+1, m+1, b);
}
void update(int i, int a, int val) {
if (lo[i] > a || hi[i] < a) {
return;
}
if (lo[i] == hi[i] && hi[i] == a) {
max_el[i] = val;
return;
}
update(2*i, a, val);
update(2*i + 1, a, val);
max_el[i] = max(max_el[2*i], max_el[2*i+1]);
}
int maximum(int i, int a, int b) {
if (lo[i] > b || hi[i] < a) {
return -1;
}
if (lo[i] >= a && hi[i] <= b) {
return max_el[i];
}
int left = maximum(2*i, a, b);
int right = maximum(2*i + 1, a, b);
return max(left, right);
}
public:
SegmentTree(int _n) : n(_n), lo(4*n+1), hi(4*n+1), max_el(4*n+1) {
init(1,0,n-1);
}
void update(int a, int val) {
update(1, a, val);
}
int maximum(int a, int b) {
return maximum(1, a, b);
}
};
int main () {
int N, M;
cin >> N >> M;
vector<pii> v(N);
int a, b;
rep(i,N) {
cin >> a >> b;
v[i] = make_pair(b,a);
}
sort(v.begin(), v.end());
SegmentTree st(M+1);
rep(i,M+1) {
st.update(i,i);
}
int ans = 0;
rep(i,N) {
int a = v[N-1-i].second;
int b = v[N-1-i].first;
int ind = st.maximum(0, M-a);
if (ind == -1)
continue;
ans += b;
st.update(ind, -1);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#define gcd(a, b) __gcd(a , b)
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define test int t;cin>>t;for(int l=0;l<t;l++)
#define nl "\n"
#define End return 0
#define gt greater<int>()
#define ll long long
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define mod 1000000007
#define sp(n) fixed<<setprecision(n)
#define pi acos(-1)
int main()
{
MP;
{
int n;
string s1,s2;
cin>>n;
cin>>s1>>s2;
for(int i=0;i<n;i++)
{
cout<<s1[i]<<s2[i];
}
}
End;
}
| 0
| 27,508,781
|
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> v(100000);
for (int i = 0; i < N; i++) {
int n;
cin >> n;
v.at(n)++;
}
int ans = 0;
for (int i = 1; i < v.size() - 1; i++) {
int sum = v.at(i - 1) + v.at(i) + v.at(i + 1);
if (sum > ans) ans = sum;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long INF = 1LL<<60;
void YN(bool x){
if(x) cout<<"Yes";
else cout<<"No";
return;
}
int main() {
int N,H,K; cin>>N>>H>>K;
bool finish=false;
rep(i,N){
if(K-i*H==0) finish=true;
else if(i==N-i) continue;
else{
if(K-i*H>0 && N-i-i>0){
if((K-i*H)%(N-i-i)==0&&(K-i*H)/(N-i-i)<=H) finish=true;
}
else if(K-i*H<0 && N-i-i<0){
if((H*i-K)%(i+i-N)==0&&(H*i-K)/(i+i-N)<=H) finish=true;
}
}
}
YN(finish);
}
| 0
| 74,572,411
|
#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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int N, K;
int main() {
cin >> N >> K;
vector<int> p(N);
rep(i,N) cin >> p[i];
sort(p.begin(), p.end());
int res = 0;
rep(i,K) res += p[i];
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const ll INFL = 1LL << 60;
const int INFI = (1 << 30);
int N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) return INFI;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int res = rec(i + 1, a, b, c);
res = min(res, rec(i + 1, a + L.at(i), b, c) + (a ? 10 : 0));
res = min(res, rec(i + 1, a, b + L.at(i), c) + (b ? 10 : 0));
res = min(res, rec(i + 1, a, b, c + L.at(i)) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++) cin >> L.at(i);
cout << rec(0, 0, 0, 0) << endl;
}
| 0
| 94,969,850
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long H, W;
cin >> H >> W;
long ans = H * W;
long S1, S2, S3;
for (int w1 = 1; w1 < W; w1++) {
S1 = H * w1;
if (H % 2 == 0 || (W - w1) % 2 == 0) {
S2 = H * (W - w1) / 2;
ans = min(ans, abs(S1 - S2));
} else if (H <= W - w1) {
S2 = H * ((W - w1) / 2);
S3 = S2 + H;
ans = min(ans, max({S1, S2, S3}) - min({S1, S2, S3}));
} else {
S2 = (W - w1) * (H / 2);
S3 = S2 + (W - w1);
ans = min(ans, max({S1, S2, S3}) - min({S1, S2, S3}));
}
}
for (int h1 = 1; h1 < H; h1++) {
S1 = W * h1;
if (W % 2 == 0 || (H - h1) % 2 == 0) {
S2 = W * (H - h1) / 2;
ans = min(ans, abs(S1 - S2));
} else if (W <= H - h1) {
S2 = W * ((H - h1) / 2);
S3 = S2 + W;
ans = min(ans, max({S1, S2, S3}) - min({S1, S2, S3}));
} else {
S2 = (H - h1) * (W / 2);
S3 = S2 + (H - h1);
ans = min(ans, max({S1, S2, S3}) - min({S1, S2, S3}));
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int n,now=1,ans=0;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
for(int i=0;i<n;i++){
if(a[i]==now){
now++;
}
else ans++;
}
if(ans==n) cout<<"-1";
else cout<<ans;
}
| 0
| 10,555,017
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
#define Yes "Yes"
#define No "No"
#define YES "YES"
#define NO "NO"
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; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N,K;
cin>>N>>K;
vector<pair<ll,ll>> dt(N);
rep(i,N){
ll t,d;
cin>>t>>d;
dt[i] = {d, t};
}
sort(all(dt));
reverse(all(dt));
map<ll, ll> map;
ll ans = 0;
ll sum = 0;
ll l = 0;
rep(i,N){
if(i < K){
map[dt[i].second]++;
sum += dt[i].first;
if(i == K-1){
ll syu = map.size();
ans = sum + syu * syu;
l = K-1;
}
}
else{
if(map[dt[i].second] == 0){
while(0 <= l && map[dt[l].second] == 1){
l--;
}
if(l == -1)break;
sum += dt[i].first;
sum -= dt[l].first;
map[dt[i].second]++;
map[dt[l].second]--;
l--;
ll syu = map.size();
chmax(ans, sum + syu * syu);
}
}
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstring>
using namespace std;
int main(void){
int n;
long a[5000];
long long max, tmp;
while(cin >> n && n != 0){
for(int i = 0; i < n; i++) cin >> a[i];
max = a[0]; tmp = 0;
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
tmp += a[j];
if(max < tmp) max = tmp;
}
tmp = 0;
}
cout << max << endl;
}
return 0;
}
| 0
| 98,928,578
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
string s; cin >> s;
vector<ll> key(26, 0);
REP(i, s.size()){
key[s[i]-'a'] += 1;
}
if(s.size()<26){
cout << s;
REP(i, 26){
if(0<key[i]) continue;
printf("%c\n", i+'a');
return 0;
}
}else{
int n=s.size();
priority_queue<char, vector<char>, greater<char>> que;
REPD(i, n-1){
que.push(s[i+1]);
if(s[i]<s[i+1]){
cout << s.substr(0, i);
while(1){
if(que.top()<s[i]){
que.pop(); continue;
}
cout << que.top() << endl;
return 0;
}
}
}
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
Graph G;
vector<int> to_exit;
void bfs(int start) {
queue<int> que;
que.push(start);
while (!que.empty())
{
int cur = que.front();
que.pop();
for (auto nex: G[cur]) {
if (to_exit[nex] != -1) continue;
to_exit[nex] = cur;
que.push(nex);
}
}
}
int main() {
int N, M;
cin >> N >> M;
G.assign(N, vector<int>());
to_exit.assign(N, -1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
to_exit[0] = -2;
bfs(0);
cout << "Yes" << endl;
for (auto i: to_exit) {
if (i == -2) continue;
cout << i + 1 << endl;
}
return 0;
}
| 0
| 34,124,317
|
#include <bits/stdc++.h>
using namespace std;
long long n,i,j,a,b,c,d;
int main(){
cin>>a>>b>>c;
long long m=max(a,max(b,c));
m*=3;
d=a+b+c;
if(m%2==d%2)cout<<(m-d)/2;
else cout<<(m-d+3)/2;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define FOR(i, a, b) for (ll i = (a), i < (N): i++)
#define all(A) (A).begin(), (A).end()
int main(){
int N;
cin >> N;
int V[N];
rep(i, N) cin >> V[i];
vector<pii> A(1e5 + 10), B(1e5+10);
rep(i, 1e5+10) {
A[i].first = 0;
B[i].first = 0;
A[i].second = i;
B[i].second = i;
}
rep(i, N) {
if (i % 2 == 0) {
A[V[i]].first++;
}
else B[V[i]].first++;
}
sort(all(A), [](pii a, pii b) {return a.first > b.first;});
sort(all(B), [](pii a, pii b) {return a.first > b.first;});
int ans = 0;
if (A[0].second == B[0].second) {
ans = N - max(A[0].first + B[1].first, A[1].first + B[0].first);
}
else ans = N - A[0].first - B[0].first;
cout << ans << endl;
return 0;
}
| 0
| 83,098,981
|
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define no cout << "No" << endl
#define yes cout << "Yes" << endl
#define tc ll t; cin >> t; while (t--)
#define sz(c) (ll) (c).size()
#define trav(x,c) for(auto &x : c)
#define all(c) (c).begin(), (c).end()
#define rll(c) (c).rbegin(), (c).rend()
#define _for(i,a,n) for(ll i = a ; i < n; ++i)
#define _rfor(i,a,n) for(ll i = n-1 ; i >= a; --i)
#define dx(x) cout << #x << ": " << x << endl;
#define dc(c) trav(x,c) cout << x << " "; cout << endl;
#define godspeed ios::sync_with_stdio(0); cin.tie(0);
int main() {
godspeed;
ll n, m, x; cin >> n >> m;
while(m--) {
cin >> x;
n -= x;
}
if(n <= 0) yes;
else no;
}
|
#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 Int;
int main() {
string S;
cin >> S;
Int K, N;
cin >> K;
N = S.size();
set<char> X;
rep(i,N) X.insert(S[i]);
if (X.size() == 1) {
cout << (K * N) / 2 << endl;
return 0;
}
vector<bool> changed(N,false);
Int m = 0;
if (N > 1) {
rep(i,N-1) {
if (S[i] == S[i+1] && !changed[i]) {
m++;
changed[i+1] = true;
}
}
}
Int ans = 0;
ans = m * K;
if (S[0] == S[N-1]) {
Int y, z;
rep1(i,N-1) {
if (S[i] != S[0]) {
y = i;
break;
}
}
for (int j = N-2; j>=0; j--) {
if (S[j] != S[N-1]) {
z = N-1-j;
break;
}
}
if (y % 2 == 1 && z % 2 == 1) ans += K-1;
}
cout << ans << endl;
}
| 0
| 10,804,878
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int k,x;
cin>>k>>x;
if(k*500>=x) cout<<"Yes";
else cout<<"No";
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[2] * a[2] == a[0] * a[0] + a[1] * a[1]) {
cout << "YES\n";
}
else {
cout << "NO\n";
}
}
return 0;
}
| 0
| 54,222,187
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define mp make_pair
#define bitcnt __builtin_popcount
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
#define CINT(...) \
int __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
typedef long long ll;
typedef vector<int> V;
typedef vector<ll> VL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef priority_queue<int> PQ;
typedef priority_queue<int, V, greater<int>> PQG;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll N;
vector<char> S, tmp;
int main() {
cin >> N;
S.resize(N * N);
tmp.resize(N * N);
REP(i, N) REP(j, N) { cin >> S[i * N + j]; }
ll ans = 0;
REP(k, N) {
REP(i, N) REP(j, N) { tmp[i * N + j] = S[i * N + (j + k) % N]; }
bool judge = true;
REP(i, N) REP(j, N) {
if(tmp[i * N + j] != tmp[j * N + i]) {
judge = false;
break;
}
}
if(judge) ans += N;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
string o,e; cin>>o>>e;
int ko=o.size();
int ke=e.size();
rep(i,ko){
cout<<o[i];
if(i==ke) continue;
else cout<<e[i];
}
}
| 0
| 35,475,980
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i) for(int i=0;i<2;i++)
void solve() {
int n; cin >> n;
vector<bool> a(n);
{
string s; cin >> s;
for (int i = 0; i < n; i++) {
a[i] = s[i]=='x';
}
}
vector<bool> res(n);
rep(_x)rep(_y){
res[0] = _x; res[1] = _y;
for (int i = 2; i < n; i++) {
res[i] = res[i-1]^a[i-1]^res[i-2];
}
if ((res[0]^res[1]^res[n-1]) == a[0] && a[n-1] == (res[n-2]^res[n-1]^res[0])) {
for (bool x: res) {
cout << (x?'W':'S');
}
return;
}
}
cout << -1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long pow(long long p,long long q,long long r){
if(q==0)return 1;
else if(q%2==0)return pow(p,q/2,r)*pow(p,q/2,r)%r;
else return pow(p,q-1,r)*p%r;
}
int main() {
int n;
cin>>n;
long long a[n],b[n];
for(int i=0;i<n;i++){
long long k;
cin>>k;
a[i]=k;
b[i]=0;
}
long long ans=1,mod=998244353;
if(a[0]!=0)ans=0;
for(int i=1;i<n;i++){
b[a[i]]++;
}
if(b[0]==0)b[0]=1;
else ans=0;
sort(a,a+n);
for(int i=1;i<a[n-1]+1;i++){
ans=ans*pow(b[i-1],b[i],mod)%mod;
}
cout<<ans<<endl;
}
| 0
| 88,797,677
|
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << '\n'
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pi;
typedef double db;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a; }
void solve(){
string s, t;
cin >> s >> t;
int a, b;
cin >> a >> b;
string u;
cin >> u;
if (u == s) a--;
else b--;
cout << a << ' ' << b << '\n';
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string q, word;
set<string> dic;
for(int i=0; i < n; ++i){
cin >> q >> word;
if(q=="insert"){
dic.insert(word);
}else{
if(dic.count(word)){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
}
}
}
| 0
| 9,608,901
|
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int pop[24*3600+5];
inline int ss(char c) { return c-'0'; }
int stoi(string s) {
return (ss(s[0])*10+ss(s[1]))*3600 + (ss(s[3])*10 + ss(s[4]))*60
+ ss(s[6])*10 + ss(s[7]);
}
int main() {
int n;
string s,t;
while(cin>>n, n) {
memset(pop, 0, sizeof(pop));
for(int i=0; i<n; ++i) {
cin>>s>>t;
int ts = stoi(s), tt = stoi(t);
for(int i=ts; i<tt; ++i) pop[i]++;
}
int ans = 0;
for(int i=0; i<=24*3600; ++i) ans = max(ans, pop[i]);
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,k; cin>>n>>k;
ll ma=(n-1)*(n-2)/2;
if(ma<k){
cout<<-1<<endl;
return 0;
}
vpll v;
rep(i,n-1){
v.emplace_back(n,i+1);
}
ll cnt=ma-k;
if(cnt){
reps(i,n-2){
ireps(j,i+1,n-1){
v.emplace_back(i,j);
cnt--;
if(cnt<=0) break;
}
if(cnt<=0) break;
}
}
cout<<v.size()<<endl;
rep(i,v.size()){
cout<<v[i].first<<' '<<v[i].second<<endl;
}
}
| 0
| 1,544,608
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 205;
int deg[5];
signed main(void){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int M = 3;
while (M--){
int u, v;
cin >> u >> v;
deg[u]++; deg[v]++;
}
int res = 0;
for (int i=1; i<=4; ++i)
if (deg[i] == 1) ++res;
if (res <= 2) cout << "YES";
else cout << "NO";
}
|
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
int lower_index(T a, U i) { return lower_bound(all(a), i) - begin(a); }
template <class T, class U>
int upper_index(T a, U i) { return upper_bound(all(a), i) - begin(a); }
template <class T, class U>
bool binary(T a, U i) { return binary_search(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
void solve(string s) {
int n = sz(s) / 2;
rrep(i, n) {
bool ok = true;
rep(j, i)if(s[j] != s[i + j])ok = false;
if(ok) {
COUT(i * 2);
return;
}
}
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
string s;
cin >> s;
solve(s);
}
#pragma endregion main
| 0
| 80,814,520
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, l;
cin>>n>>l;
int a[n + 1];
for(int i = 1; i <= n; i++){
cin>>a[i];
}
int ind = -1;
for(int i = 1; i < n; i++){
if(a[i] + a[i + 1] >= l){
ind = i;
break;
}
}
if(ind == -1){
cout<<"Impossible\n";
exit(0);
}
cout<<"Possible\n";
for(int i = 1; i < ind; i++){
cout<<i<<'\n';
}
for(int i = n - 1; i > ind; i--){
cout<<i<<'\n';
}
cout<<ind<<'\n';
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int sum, n, mmin, mmax, a;
while(1) {
sum = 0; mmax = -1; mmin = 114514810;
cin >> n;
if(n == 0) break;
for(int i=0; i<n; i++) {
cin >> a;
sum += a;
mmax = max(mmax, a);
mmin = min(mmin, a);
}
sum = sum - mmax - mmin;
cout << sum / (n-2) << endl;
}
return 0;
}
| 0
| 58,244,365
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
const int win = 3;
const int draw = 1;
string str;
cin >> str;
int n = stoi(str);
int taro = 0, hanako = 0;
string str_taro, str_hanako;
for(int i = 0; i < n; i++)
{
cin >> str_taro;
cin >> str_hanako;
if (str_taro > str_hanako){ taro += win; }
else if(str_taro < str_hanako){ hanako += win; }
else { taro += draw; hanako += draw; }
}
cout << taro << " " << hanako << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 10e15;
const ll MINF = -10e10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
typedef priority_queue<P, vector<P>, greater<P>> PQ_ASK;
const int mod = 1000000007;
ll searchCenter(ll border, ll a, ll b) {
ll floor = a + 1;
ll ceil = b;
while (floor + 1 < ceil) {
ll mid = (floor + ceil) / 2;
if (mid * mid <=border) {
floor = mid;
} else {
ceil = mid;
}
}
return floor;
}
ll searchPair(ll border, ll center, ll b) {
ll i = center - 1;
while ((center * (i + 1)) < border) {
i++;
}
if (i == b) i--;
return i;
}
int main() {
ll q;
cin >> q;
rep(i, q) {
ll a, b;
cin >> a >> b;
if (a > b) {
swap(a, b);
}
ll border = a * b;
ll center = searchCenter(border, a, b);
ll pair = searchPair(border, center, b);
ll left = pair - 1;
ll right = center - 2;
ll ans = right + left;
if (center == b && pair == a) {
} else {
ans++;
}
if (center + 1 == pair - 1) {
ans--;
}
cout << ans << endl;
}
}
| 0
| 68,399,813
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 0, max_height = 0;
long long sum = 0;
cin >> n;
vector<int> a(n);
for(int i = 0 ; i < n; i++)
{
cin >> a.at(i);
}
for(int i = 0; i < n; i++)
{
max_height = max(a.at(i),max_height);
sum += max_height - a.at(i);
}
cout << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define MP make_pair
#define MT make_tuple
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
ll POW(ll x,ll n){
x%=MOD;
if(n==0)return 1;
if(n%2==0)return POW(x*x,n/2)%MOD;
return x%MOD*POW(x,n-1)%MOD;
}
ll POW2(ll x,ll n){
if(n==0)return 1;
if(n%2==0)return POW2(x*x,n/2);
return x*POW2(x,n-1);
}
ll POW3(ll x,ll n,ll m){
x%=m;
if(n==0)return 1;
if(n%2==0)return POW3(x*x,n/2,m)%m;
return x*POW3(x,n-1,m)%m;
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v; u = v; v = r;
}
return u;
}
ll lcm(ll u, ll v) {
return u/gcd(u,v)*v;
}
ll KAI(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI(m-1)%MOD;
}
ll KAI2(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI2(m-1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI(m)%MOD*modinv(KAI(n)%MOD*KAI(m-n)%MOD)%MOD;
}
ll COM2(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI2(m)/KAI2(n)/KAI2(m-n);
}
ll DEC(ll x,ll m,ll n)
{
return x%POW2(m,n+1)/POW2(m,n);
}
ll keta(ll x,ll n)
{
if(x==0)return 0;
return keta(x/n,n)+1;
}
ll DIV(ll x,ll n)
{
if(x==0)return 0;
return x/n+DIV(x/n,n);
}
ll ORD(ll x,ll n)
{
if(x==0)return INF;
if(x%n!=0)return 0;
return 1+ORD(x/n,n);
}
ll SUP(ll x,ll n)
{
if(x==0)return 0;
if(x%n!=0)return x;
return SUP(x/n,n);
}
ll SGS(ll x,ll y, ll m)
{
if(y==0)return 0;
if(y%2==0){
return (1+POW3(x,y/2,m))*SGS(x,y/2,m)%m;
}
return (1+x*SGS(x,y-1,m))%m;
}
ll SSGS(ll x,ll y,ll m)
{
if(y==0)return 0;
if(y==1)return 1;
if(y%2==0){
return (SSGS(x,y/2,m)*(POW3(x,y/2,m)+1)%m+SGS(x,y/2,m)*y/2%m)%m;
}
return (SSGS(x,y-1,m)*x%m+y)%m;
}
void shuffle(ll array[], ll size) {
for(ll i = 0; i < size; i++) {
ll j = rand()%size;
ll t = array[i];
array[i] = array[j];
array[j] = t;
}
}
ll SQRT(ll n){
ll ok,ng,mid;
ng=n+1;
if(303700500<ng)ng=303700500;
ok=0;
while(abs(ok-ng)>1){
mid=(ok+ng)/2;
if(mid*mid<=n){
ok=mid;
}
else{
ng=mid;
}
}
return ok;
}
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
rep(i,n) par[i] = i;
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return sizes[find(x)];
}
};
map< int64_t, int > prime_factor(int64_t n) {
map< int64_t, int > ret;
for(int64_t i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
bool is_prime(int64_t x) {
if(x==1)return false;
for(int64_t i = 2; i * i <= x; i++) {
if(x % i == 0) return false;
}
return true;
}
struct edge{ll to, cost;};
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<LP,vector<LP>, greater<LP> > que;
que.push(LP(0,s));
while(!que.empty()){
LP p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(LP(d[e.to],e.to));
}
}
}
}
};
ll d[300][300];
void warshall_floyd(ll n){
rep(i,n)rep(j,n)rep(k,n)d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
}
struct bit{
ll m;
vector<ll> b;
bit(ll i){
m=i;
b.resize(m+1);
}
ll num(ll i){
return b[i];
}
ll sum(ll i){
ll s=0;
while(i>0){
s+=b[i];
i-=i&-i;
}
return s;
}
void add(ll i, ll x){
while(i<=m){
b[i]+=x;
i+=i&-i;
}
}
};
int main(){
ll n,k,h[310]={},dp[310][1000][3],o=0;
cin >> n >> k;
rep(i,n)cin >> h[i+1];
rep(i,n+1)rep(j,k+1)rep(l,2)dp[i][j][l]=INF;
dp[0][0][1]=0;
rep(i,n){
rep(j,k+1){
rep(l,i+1)dp[i+1][j+i+1-l][0]=min(dp[l][j][1],dp[i+1][j+i+1-l][0]);
rep(l,i+1){
dp[i+1][j+i-l][1]=min(dp[l][j][1]+max(h[i+1]-h[l],o),dp[i+1][j+i-l][1]);
}
}
}
printf("%lld",min(dp[n][k][0],dp[n][k][1]));
}
| 0
| 6,439,068
|
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
void solve()
{
priority_queue<int> pque;
char order[10] = "";
while (true)
{
cin >> order;
if (order[2] == 'd')
{
break;
}
else if (order[0] == 'i')
{
int num;
scanf("%d", &num);
pque.push(num);
}
else
{
printf("%d\n", pque.top());
pque.pop();
}
}
}
int main()
{
solve();
return(0);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
}
ll stock = 0, money = 1000;
rep(i, n) {
if (i == n - 1) {
money += stock * a[i];
continue;
}
if (a[i + 1] > a[i]) {
if (stock == 0) {
stock = money / a[i];
money = money % a[i];
}
} else if (a[i + 1] < a[i]) {
money += stock * a[i];
stock = 0;
}
}
cout << money << '\n';
return 0;
}
| 0
| 56,701,393
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main()
{
static long i,j,k,l;
long n;
long cnt = 0;
long left,right,mid;
long ans = 0;
int a,b;
static int H[10000];
static int W[10000];
for(i = 0;; i++) {
scanf("%d %d",&H[i],&W[i]);
if(H[i] == 0)
break;
}
for(j = 0; j < i; j++) {
for(k = 0; k < H[j]; k++) {
for(l = 0; l < W[j]; l++) {
putchar('#');
}
putchar('\n');
}
putchar('\n');
}
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)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
ll k;
vector<ll> a;
ll co(ll n)
{
ll now = n;
rep(i, k)
{
now = now / a[i] * a[i];
}
return now;
}
int main()
{
cin >> k;
a = vector<ll>(k);
rep(i, k)
{
cin >> a.at(i);
}
ll ans = 0;
ll r = 0;
ll l = 1000000000000000000;
while (l - r > 1)
{
ll mid = (r + l) / 2;
if (co(mid) > 2)
{
l = mid;
}
else
{
r = mid;
}
}
ll r2 = 0;
ll l2 = 1000000000000000000;
while (l2 - r2 > 1)
{
ll mid = (r2 + l2) / 2;
if (co(mid) >= 2)
{
l2 = mid;
}
else
{
r2 = mid;
}
}
if (r2 + 1 < l - 1)
{
cout << r2 + 1 << " " << l - 1 << endl;
}
else
{
cout << -1 << endl;
}
}
| 0
| 17,249,408
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& x: vec) { is >> x; }
return is;
}
int main() {
ll ans = 0;
ll tmp;
int n; cin >> n;
vector<ll> a(n);
cin >> a;
bool ch = true;
ll choice[50] = {};
while(ch){
ll count = 0;
REP(i, n) choice[i] = 0;
REP(i, n){
if(a[i] >= n){
ll op = (a[i]-(n-1)+(n-1))/n;
count += op;
ans += op;
choice[i] = op;
a[i] -= op * n;
}
}
ch = false;
REP(i, n){
a[i] += count - choice[i];
if(a[i]>= n) ch = true;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> bool chmax(T& a, T b){ if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T& a, T b){ if (a > b) { a = b; return true; } return false; }
class UnionFind {
vector<int> data;
public:
UnionFind(int size = 0) {
resize(size);
}
void resize(int size) {
data.resize(size, -1);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) {
return -data[root(x)];
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
bool same(int x, int y) {
return root(x) == root(y);
}
int count() {
int cnt = 0;
for (int i = 0, n = data.size(); i < n; ++i) {
if (i == root(i))
cnt++;
}
return cnt;
}
};
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
UnionFind uf(n + 1);
while (m--) {
cin >> a >> b;
uf.unite(a, b);
}
for (int i = 0; i < n; ++i) {
chmax(ans, uf.size(i + 1));
}
cout << ans << endl;
return 0;
}
| 0
| 19,501,758
|
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include <fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using vb = vector<bool>;
using mll = map<ll, ll>;
using sll = stack<ll>;
#define REP(i,n) for(ll i(0);(i)<(n);(i)++)
#define rep(i,n) for(ll i(0);(i)<(n);(i)++)
#define ALL(a) a.begin(), a.end()
#define enld endl
const ll INF = 1LL << 60;
void solve(long long N, long long K, std::vector<long long> a){
vll s(N+1, 0);
REP(i, N){
s[i+1] = s[i]+a[i];
}
vll R;
REP(i, N){
for(ll j = i+1; j <= N; j++){
R.emplace_back(s[j]-s[i]);
}
}
vll rec;
for(ll digit=63; digit >=0; digit --){
ll tmp = 0;
sort(ALL(R)); reverse(ALL(R));
REP(i, R.size()){
if(R[i] >> digit & 1){
tmp++;
}
}
if(tmp < K){
REP(i, R.size()){
R[i] = R[i] & ~(1LL<<digit);
}
}
else{
R.resize(tmp);
rec.push_back(digit);
}
}
ll res = 0;
for(auto x: rec){
res += 1LL<<x;
}
cout<<res<<endl;
}
int main(){
long long N;
scanf("%lld",&N);
long long K;
scanf("%lld",&K);
std::vector<long long> a(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&a[i]);
}
solve(N, K, std::move(a));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int D;
int count;
cin >> N >> D;
vector<vector <int>> X(N,vector <int> (D));
for (int i=0; i<N;i++){
for(int j=0; j<D; j++){
cin >> X.at(i).at(j);
}
}
for (int i=0; i<N-1;i++){
for (int j=i+1;j<N;j++){
int Dis =0;
for (int k=0;k<D;k++){
Dis += pow((X.at(i).at(k) -X.at(j).at(k)),2);
}
for (int k=0;pow(k,2) <= Dis;k++){
if (Dis == pow(k,2))
count++;
}
}
}
cout << count <<endl;
}
| 0
| 37,134,790
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k, prev, ind = -1;
cin >> n >> k;
cin >> prev;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
if (x + prev >= k)
ind = i;
prev = x;
}
if (ind == -1)
cout << "Impossible\n";
else {
cout << "Possible\n";
for (int i = 1; i < ind; i++)
cout << i << '\n';
for (int i = n - 1; i > ind; i--)
cout << i << '\n';
cout << ind << '\n';
}
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < k; i++){
vector<int> cumulativeSum(n+1);
for (int j = 0; j < n; j++){
int l = max(0,j-a[j]);
int r = min(n,j+a[j] + 1);
cumulativeSum[l]++;
cumulativeSum[r]--;
}
for (int j = 0; j < n; j++) cumulativeSum[j+1] += cumulativeSum[j];
cumulativeSum.pop_back();
if (a == cumulativeSum) break;
a = cumulativeSum;
}
for (int p: a) cout << p << endl;
}
| 0
| 39,199,584
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
ll powm(ll a,ll n, ll m){
ll ret=1;
while(n>0){
if(n%2==1){
ret=(ret*a)%m;
}
n>>=1;
a=(a*a)%m;
}
return ret;
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
int main() {
int a,b,c;cin>>a>>b>>c;
set<int> ans;
ans.insert(a);
ans.insert(b);
ans.insert(c);
cout<<ans.size()<<endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <functional>
#define big ((long long)(1e9) + 7)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define DBG(x) cerr << #x << ": " << (x) << " (L" << __LINE__ << ")" << endl;
void setmin(int &a, int b)
{
if (a > b)
a = b;
}
int main()
{
int INF = 1000000;
int h, w;
cin >> h >> w;
vector<vector<char> > s(h, vector<char>(w));
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
cin >> s[i][j];
}
}
vector<vector<int> > dp(h + 1, vector<int>(w + 1, INF));
dp[1][1] = s[0][0] == '.' ? 0 : 1;
int dr[] = {-1, 0};
int dc[] = {0, -1};
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
for (int dir = 0; dir < 2; dir++)
{
int pr = i + dr[dir];
int pc = j + dc[dir];
if (dp[pr + 1][pc + 1] == INF)
continue;
int changed = s[i][j] != s[pr][pc];
setmin(dp[i + 1][j + 1], dp[pr + 1][pc + 1] + changed);
}
}
}
DBG(dp[h][w]);
cout << (dp[h][w] + 1) / 2 << endl;
}
| 0
| 74,493,854
|
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int A, P; cin >> A >> P;
cout << (A * 3 + P) / 2;
}
|
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define mp make_pair
#define fi first
#define sc second
typedef pair<int,int> P;
typedef pair<P,int> Pp;
int h,w,n;
char s[2000][2000];
bool used[2000][2000];
int bfs(int m){
REP(i,h)
REP(j,w)
used[i][j] = false;
int sx,sy;char c;
if(m == 0)
c = 'S';
else
c = m + '0';
REP(i,h)
REP(j,w)
if(c == s[i][j]){sx = i;sy = j;}
queue<Pp> que;
REP(i,4){
int x = sx + dx[i],y = sy + dy[i];
if((0 <= x && x < h && 0 <= y && y < w) && s[x][y] != 'X' && !used[x][y]){
if(s[x][y] == m + 1 + '0')
return 1;
que.push(Pp(P(x,y),1));
used[x][y] = true;
}
}
while(!que.empty()){
Pp p = que.front();que.pop();
REP(i,4){
int x = p.fi.fi + dx[i],y = p.fi.sc + dy[i];
if((0 <= x && x < h && 0 <= y && y < w) && s[x][y] != 'X' && !used[x][y]){
if(s[x][y] == m + 1 + '0')
return p.sc + 1;
que.push(Pp(P(x,y),p.sc + 1));
used[x][y] = true;
}
}
}
return 1000000000;
}
int main(){
scanf("%d%d%d",&h,&w,&n);
REP(i,h)
scanf("%s",s + i);
int sum = 0;
FOR(i,0,n){
sum += bfs(i);
}
printf("%d\n", sum);
return 0;
}
| 0
| 57,007,889
|
#include<stdio.h>
int main(void){
int n,i;
long long ans = 1;
scanf("%d", &n);
for(i = 1; i <= n; i++){
ans *= i;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n;
cin >> n;
int t[2],x[2],y[2];
t[0] = x[0] = y[0] = 0;
for(int i=0;i<n;i++){
cin >> t[1] >> x[1] >> y[1];
int dist = abs(x[1]-x[0])+abs(y[1]-y[0]);
int duration = t[1]-t[0];
if(duration<dist){
cout << "No" << endl;
return 0;
}
if( (duration-dist)%2 == 1 ){
cout << "No" << endl;
return 0;
}
t[0] = t[1];
x[0] = x[1];
y[0] = y[1];
}
cout << "Yes" << endl;
return 0;
}
| 0
| 53,680,643
|
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> v(n);
for(auto &e: v) {
cin >> e;
}
sort(v.begin(), v.end());
int x = v.size() / 2;
cout << v[x] - v[x - 1] << endl;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int testcase = 1;
for(int i = 0; i < testcase; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string a,b,c;
cin>>a>>b>>c;
if(a.back()==b[0]&&b.back()==c[0])YES;
else NO;
}
| 0
| 97,260,952
|
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }
int x, y, z, k;
int main() {
cin >> x >> y >> z >> k;
vector<ll> A(x, 0);
vector<ll> B(y, 0);
vector<ll> C(z, 0);
for(int i = 0; i < x; ++i) cin >> A.at(i);
for(int i = 0; i < y; ++i) cin >> B.at(i);
for(int i = 0; i < z; ++i) cin >> C.at(i);
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vector<ll> AB;
for(int i = 0; i < x; ++i) {
for(int j = 0; j < y; ++j) {
ll sum = A.at(i)+B.at(j);
AB.emplace_back(sum);
}
}
sort(AB.begin(), AB.end(), greater<ll>());
vector<ll> ABC;
for(int i = 0; i < min(x*y, 3000); ++i) {
for(int j = 0; j < z; ++j) {
ll sum = AB.at(i) + C.at(j);
ABC.emplace_back(sum);
}
}
sort(ABC.begin(), ABC.end(), greater<ll>());
for(int i = 0; i < k; ++i) {
cout << ABC.at(i) << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
char prev = '2', now;
int cnt = 0;
for (int i=0; i<s.size(); i++) {
now = s[i];
if (now == prev || prev == '2') {
cnt++;
prev = now;
} else {
cnt--;
if (cnt == 0) {
prev = '2';
}
}
}
cout << s.size() - cnt << endl;
}
| 0
| 73,458,833
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>> x(m,vector<int>(2));
rep(i,m)rep(j,2) cin >> x.at(i).at(j);
bool ans = false;
map<int,int> mp;
rep(i,m){
if(x.at(i).at(0) == 1) mp[x.at(i).at(1)]++;
else if(x.at(i).at(1) == n) mp[x.at(i).at(0)]++;
}
for(auto itr = mp.begin(); itr != mp.end(); itr++){
if(itr->second == 2) ans = true;
}
cout << (ans?"POSSIBLE":"IMPOSSIBLE") << endl;
}
|
#include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(b>=a)
printf("unsafe\n");
else
printf("safe\n");
return 0;
}
| 0
| 16,301,385
|
#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(void){
int a, b;
cin >> a >> b;
cout << 6-a-b << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int n; cin >> n;
vector<P> r(n), b(n);
rep(i, n) {
cin >> r[i].fr >> r[i].sc;
}
rep(i, n) {
cin >> b[i].fr >> b[i].sc;
}
int ans = 0;
vector<bool> used(n, 0);
sort(all(b));
rep(i, n) {
int k = -1, ma = -1;
rep(j, n) {
if(r[j].fr < b[i].fr && r[j].sc < b[i].sc && !used[j]) {
if(chmax(ma, r[j].sc)) {
k = j;
}
}
}
if(k != -1) {
used[k] = 1;
++ ans;
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 16,703,381
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string A; cin >> A;
int N = A.size();
vector<vector<int>> cnt(N, vector<int>(26, 0));
cnt[0][A[0] - 'a'] = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < 26; j++) {
cnt[i][j] = cnt[i - 1][j];
if (A[i] - 'a' == j) {
cnt[i][j]++;
}
}
}
ll ans = 1;
for (int i = 0; i < N; i++) {
int j = A[i] - 'a';
ans += (N - i - 1) - (cnt[N - 1][j] - cnt[i][j]);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n, k;
cin >> n >> k;
if(k > (n-1)*(n-2)/2ll){
cout << -1 << endl;
return 0;
}
vector<pair<int, int> > ans;
for(int i=1;i<n;i++){
ans.push_back(make_pair(0, i));
}
k-=(n-1)*(n-2)/2ll;
int now=1;
while(k != 0){
for(int i=now+1;i<n;i++){
if(k==0) break;
ans.push_back(make_pair(now, i));
k++;
}
now++;
}
cout << ans.size() << endl;
for(size_t i=0;i<ans.size();i++){
cout << ans[i].first+1 << " " << ans[i].second+1 << endl;
}
return 0;
}
| 0
| 97,568,698
|
#include <iostream>
#include <vector>
#include <string>
#include <climits>
using namespace std;
vector<vector<long long int> > dp(101,vector<long long int>(4,-1));
long long int digitSum(const string &a,int idx,int k,bool tight,const int &n){
if(idx==n)
return k==0?1:0;
if(tight){
if(!k)
return digitSum(a,idx+1,k,a[idx]-48==0?1:0,n);
long long int ans = digitSum(a,idx+1,k,a[idx]-48==0?1:0,n);
for(int i=1;i<=a[idx]-48;i++)
ans += digitSum(a,idx+1,k-1,i==(a[idx]-48),n);
return ans;
} else {
if(dp[idx][k]!=-1)
return dp[idx][k];
if(!k)
return dp[idx][k] = 1;
dp[idx][k] = digitSum(a,idx+1,k,0,n);
for(int i=1;i<10;i++)
dp[idx][k] += digitSum(a,idx+1,k-1,0,n);
return dp[idx][k];
}
}
int main()
{
string a;
int k,n;
cin >> a >> k;
n = a.size();
cout << digitSum(a,0,k,1,n);
return 0;
}
|
#include <iostream>
#include <numeric>
using namespace std;
long long gcd(long long a,long long b){
long long tmp;
if(a > b){
while(b != 0){
tmp = b;
b = a%b;
a = tmp;
}
return a;
}else{
while(a != 0){
tmp = a;
a = b%a;
b = tmp;
}
return b;
}
}
long long lcm(long long a,long long b){
long long max_common = gcd(a,b);
return (a/max_common)*b;
}
int main(){
long long a, b, c, d, cnt=0;
cin >> a >> b >> c >> d;
long long x = lcm(c,d);
long long ans = (b-a+1) - ( (b/c - (a-1)/c) + ((b/d) - (a-1)/d) - (b/x-(a-1)/x) );
cout << ans << endl;
return 0;
}
| 0
| 10,206,974
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)
#define DEBUG(x) cout<<#x<<": "<<(x)<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()
template<typename T> inline void CHMAX(T& a, const T b) {if(a<b) a=b;}
template<typename T> inline void CHMIN(T& a, const T b) {if(a>b) a=b;}
constexpr ll MOD=1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin>>n>>a>>b;
if(a+b-1>n || (ll)a*b<n){
cout<<-1<<'\n';
return 0;
}
FOR(i, n-a, n){
cout<<i+1<<' ';
}
int now=0;
while(now<n-a){
FORR(i, now, now+b-1){
if(i>=n-a){
continue;
}
cout<<i+1<<' ';
}
now+=b-1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M=0;
int L=0;
cin>>N;
vector<long long>vec(N);
for(int X=0;X<N;X++){
cin>>vec.at(X);
if(X>0 && vec.at(X)<=vec.at(X-1)){
M++;
}
else if(X>0 && vec.at(X)>vec.at(X-1)){
if(M>=L){
L=M;
M=0;
}
else{
M=0;
}
}
}
cout<<max(L,M)<<endl;
}
| 0
| 25,880,016
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string S; cin >> S;
int N = S.size();
int ans = 0;
REP(i, N-1){
if(S[i] != S[i+1]) ans++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int m,f,r;
vector<char> g(0);
for (int i=0; ; i++)
{
g.push_back(0);
cin>>m>>f>>r;
if (m==-1 && f==-1 && r==-1) break;
if ((m==-1 || f==-1) || m+f<30) g[i]='F';
else if ((m+f>=30 && m+f<50) && r<50) g[i]='D';
else if (((m+f>=30 && m+f<50) && r>=50) || (m+f>=50 && m+f<65)) g[i]='C';
else if (m+f>=65 && m+f<80) g[i]='B';
else if (m+f>=80) g[i]='A';
}
for (int i=0; i<g.size()-1; i++)
{
cout<<g[i]<<'\n';
}
return 0;
}
| 0
| 67,919,897
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cmath>
using namespace std;
int main(){
long long a,n,max;
long long goukei = 0;
long long min = 999999999;
long long array[1000000];
cin>>n;
for(;;){
for(a=0; a<n; a++) cin>>array[a];
int max = array[0];
for(a=0; a<n; a++) if(array[a] > max)max = array[a];
for(a=0; a<n; a++) if(array[a] < min)min = array[a];
for(a=0; a<n; a++) goukei += array[a];
cout<<min<<" "<<max<<" "<<goukei<<endl;
break;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
map<long long int, int> prime_factorization(long long int a)
{
map<long long int, int>ans;
for (long long i = 2; i*i <= a; ++i) {
while (a%i == 0) {
ans[i]++;
a /= i;
}
}
if (a != 1)ans[a]++;
return ans;
}
long long int gcd(long long int x, long long int y){
if (x < y) swap(x,y);
while (y > 0){
long long int r = x % y;
x = y;
y = r;
}
return x;
}
int main()
{
int a, b;
cin >> a >> b;
if(a==1)
a = 100;
if(b==1)
b = 100;
if (a < b)
puts("Bob");
else if (a > b)
puts("Alice");
else
puts("Draw");
return 0;
}
| 0
| 71,874,433
|
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
bool judge(int w,int h,int x,int y,int r)
{
if(x-r>=0&&x+r<=w&&y-r>=0&&y+r<=h) return true;
else return false;
}
int main()
{
int x,y,w,h,r;
cin>>w>>h>>x>>y>>r;
bool flag=judge(w,h,x,y,r);
if(flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> buf;
vector<bool> seen;
vector<string> ss;
void dfs(int i, const int size, const int range_start, const int range_end)
{
if (i == size) {
string str;
for (int j = 0; j < buf.size(); j++) {
str.push_back((char)(buf[j] + 48));
}
ss.push_back(str);
}
else {
for (int j = range_start; j <= range_end; j++) {
buf[i] = j;
dfs(i + 1, size, range_start, range_end);
}
}
}
int main(void)
{
int n;
cin >> n;
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int size = n;
int range_start = 0;
int range_end = 3;
buf.resize(size);
seen.resize(range_end + 1);
dfs(0, size, range_start, range_end);
int minn = 1000000;
for (int i = 0; i < ss.size(); i++) {
bool zeroflg = false;
bool ichiflg = false;
bool niflg = false;
for (int j = 0; j < n; j++) {
if (ss[i][j] == '0') { zeroflg = true; }
else if (ss[i][j] == '1') { ichiflg = true; }
else if (ss[i][j] == '2') { niflg = true; }
}
if (zeroflg == false || ichiflg == false || niflg == false) { continue; }
int aa = 0;
int bb = 0;
int cc = 0;
int mp = 0;
for (int j = 0; j < n ; j++) {
if (ss[i][j] == '0') {
if (aa != 0) { mp += 10; }
aa += l[j];
}
else if (ss[i][j] == '1') {
if (bb != 0) { mp += 10; }
bb += l[j];
}
else if (ss[i][j] == '2') {
if (cc != 0) { mp += 10; }
cc += l[j];
}
}
mp += abs(a[0] - aa) + abs(a[1] - bb) + abs(a[2] - cc);
minn = min(minn, mp);
}
cout << minn << endl;
return 0;
}
| 0
| 29,622,879
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(N), B(N);
for (int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
long long S = 0;
for (int i = N - 1; i >= 0; i--){
int r = (A[i] + S) % B[i];
if (r != 0){
S += B[i] - r;
}
}
cout << S << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll ,ll> pll;
typedef pair<ld,ld> pld;
typedef unordered_map<ll,ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5+7;
const ll MAX7 = 1e+7+7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9+7;
const ll N = 2*1e6;
ll T=1;
ll n,x,y,m;
string s,t;
void MAIN() {
cin >> x >> y;
ll ans = 0;
for(ll i=0;i<=x;i++) {
for(ll j=0;j<=x;j++) {
if(i+j <= y && (y - i - j) <= x) ans++;
}
}
cout<<ans;
}
int main() {
fastio;randomINT;
while(T--) {
MAIN();
}
return 0;
}
| 0
| 18,040,667
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<math.h>
#include<algorithm>
using namespace std;
#define INF 987654321
#define ll long long
ll Max, Min, gap;
int N, M;
vector<pair<pair<int, int>, int> > q;
vector<pair<int, int> > g[100101];
int parent[100101], dp[20][100101], p[100101], h[100101];
ll depth[100101];
vector<bool> visited(100101);
int Find(int n)
{
if (n == parent[n]) return n;
return parent[n] = Find(parent[n]);
}
void Union(int l, int r, int d)
{
int pl = l, pr = r;
l = Find(l); r = Find(r);
if (l == r)
{
q.push_back({ {pl, pr}, d });
return;
}
parent[l] = r;
g[pl].push_back({ pr, d });
g[pr].push_back({ pl, -d });
}
void DFS(int n, int prev)
{
Max = max(Max, depth[n]);
Min = min(Min, depth[n]);
visited[n] = true;
for (int i = 0; i < g[n].size(); i++)
{
int next = g[n][i].first, cost = g[n][i].second;
if (next == prev) continue;
p[next] = n;
depth[next] = depth[n] + cost;
h[next] = h[n] + 1;
DFS(next, n);
}
}
int LCA(int a, int b)
{
if (h[a] != h[b])
{
if (h[a] < h[b]) swap(a, b);
int diff = h[a] - h[b];
for (int i = 0; diff; i++)
{
if (diff % 2) a = dp[i][a];
diff /= 2;
}
}
if (a == b) return a;
for (int i = 19; i >= 0; i--)
if (dp[i][a] != dp[i][b])
{
a = dp[i][a];
b = dp[i][b];
}
return p[a];
}
int main()
{
for (int i = 0; i < 100101; i++)
parent[i] = i;
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++)
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
Union(a, b, c);
}
for (int i = 1; i <= N; i++)
{
if (!visited[i])
{
Max = 0;
Min = 0;
depth[i] = 0;
h[i] = 0;
DFS(i, 0);
gap = max(gap, Max - Min);
}
}
if (gap > 1'000'000'000LL)
return !printf("No");
for (int i = 1; i <= N; i++)
dp[0][i] = p[i];
for (int i = 1; i < 20; i++)
for (int j = 1; j <= N; j++)
dp[i][j] = dp[i - 1][dp[i - 1][j]];
for (int i = 0; i < q.size(); i++)
{
int l = q[i].first.first, r = q[i].first.second, d = q[i].second;
int lca = LCA(l, r);
if (abs(depth[l] - depth[r]) != (ll)d)
return !printf("No");
}
printf("Yes");
return 0;
}
|
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
typedef pair<ll,int> P;
vector<ll> dijkstra(int s, const vector<vector<pair<int,int> > >& G){
priority_queue< P, vector<P>, greater<P> > que;
vector<ll> d(G.size(), LINF);
d[s] = 0;
que.push(P(0, s));
while(!que.empty()){
int curr = que.top().second;
ll dcurr = que.top().first;
que.pop();
if(d[curr] < dcurr) continue;
int i;
for(i=0; i<(int)G[curr].size(); i++){
int next = G[curr][i].first;
ll dist = G[curr][i].second;
if(d[next] > d[curr] + dist){
d[next] = d[curr] + dist;
que.push(P(d[next], next));
}
}
}
return d;
}
vector<vector<pair<int, int> > > g;
void solve()
{
int n;
scanf("%d", &n);
g.resize(n);
int i;
for (i = 0; i < n - 1; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c); a--; b--;
g[a].push_back(make_pair(b, c));
g[b].push_back(make_pair(a, c));
}
int Q, K;
scanf("%d%d", &Q, &K); K--;
vector<ll> dist = dijkstra(K, g);
for (i = 0; i < Q; i++) {
int x, y;
scanf("%d%d", &x, &y); x--; y--;
ll ans=dist[x] + dist[y];
printf("%lld\n", ans);
}
return;
}
int main(int argc, char* argv[])
{
#if 1
solve();
#else
int T;
scanf("%d%d", &T, &B);
int t;
for(t=0; t<T; t++) {
solve();
}
#endif
return 0;
}
| 0
| 66,700,815
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
const long double EPS = 1e-12;
const int INF = 10000;
int main(){
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x){
if(n==0&&a==0)break;
int cnt=0;
REP(i,n){
int y;cin>>y;
while(x!=y){
if(cnt>=10001)break;
x=(a*x+b)%c;cnt++;
}
if(x==y&&i!=n-1){
x=(a*x+b)%c;cnt++;
}
}
if(cnt<=10000)cout<<cnt<<endl;
else cout<<-1<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
typedef pair<int,int> P;
const ll MOD = 1000000007;
const int INF = 1001001001;
int main(){
string x,y; cin >> x >> y;
int lx=x.size();
int ly=y.size();
int dp[ly][lx];
bool b1=0,b2=0;
if(x[0]!=y[0]) dp[0][0]=1;
else{
dp[0][0]=0;
b1=b2=1;
}
rep(i,ly-1){
if(y[i+1]!=x[0]||b1) dp[i+1][0]=dp[i][0]+1;
else{
dp[i+1][0]=dp[i][0];
b1=1;
}
}
rep(i,lx-1){
if(y[0]!=x[i+1]||b2) dp[0][i+1]=dp[0][i]+1;
else{
dp[0][i+1]=dp[0][i];
b2=1;
}
}
for(int i=1;i<ly;i++){
for(int j=1;j<lx;j++){
int c=0;
if(y[i]!=x[j])c++;
dp[i][j]=min(dp[i-1][j]+1,min(dp[i][j-1]+1,dp[i-1][j-1]+c));
}
}
cout << dp[ly-1][lx-1] << endl;
return 0;
}
| 0
| 30,418,303
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
const ll mod=998244353;
int n;
cin>>n;
vector<int>d(n);
map<int,int>mp;
rep(i,n){
cin>>d[i];
mp[d[i]]++;
}
bool ok=true;
if(d[0]!=0)ok=false;
if(mp[0]!=1)ok=false;
if(ok==false){cout<<0<<endl; return 0;}
ll ans=1;
for(int i=1; i<n; ++i){
ans*=mp[d[i]-1];
ans%=mod;
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\n'
#define dbv(v) cout<<endl;cout<<#v<<"-->> ";for(auto it:v){cout<<it<<" ";}cout<<endl;
#define dbm(m)cout<<endl;cout<<#m<<"-->> ";for(auto it:m){cout<<it.fi<<" "<<it.se.fi<<" "<<it.se.se<<endl;}
#define dbs(s)cout<<endl;cout<<#s<<"-->> ";for(auto it:s){cout<<it<<" ";}cout<<endl;
#define mod 1000000007
#define db1(x) cout<<#x<<"="<<x<<endl;
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl;
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl;
#define mx 1e18
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define double long double
#define re(s) reverse(s.begin(),s.end())
#define io std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
int powe(int x,int n)
{
if(n==0)return 1;
if(n%2==0)
return powe((x%mod*x%mod)%mod,n/2)%mod;
return (x%mod*powe((x%mod*x%mod)%mod,(n-1)/2))%mod;
}
int gcd(int A,int B)
{
if(B==0)return A;
return gcd(B,A%B);
}
int32_t main()
{
io
int s,w;
cin>>s>>w;
if(w>=s)
{
cout<<"unsafe"<<endl;
}else cout<<"safe"<<endl;
}
| 0
| 21,162,468
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
string res;
int size = s.size();
for(int i=0; i<size; i++)
{
if(s[i] != 'B')
{
res.push_back(s[i]);
}
else
{
res = res.substr(0,res.size()-1);
}
}
cout<<res<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
signed main(){
map<int, int> sticks;
int n;
cin >> n;
rep(i,n){
int a;
cin >> a;
sticks[a]++;
}
priority_queue<int> q;
for(auto p : sticks){
rep(i,min<int>(p.second/2, 2)) q.push(p.first);
}
if(q.size() <= 1){
cout << 0 << endl;
}else{
int ans = q.top();
q.pop();
ans *= q.top();
cout << ans << endl;
}
}
| 0
| 95,647,656
|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
int a, b, c;
cin >> a >> b >> c;
string ans = "No";
if (a >= c || b >= c || (a + b) >= c)
ans = "Yes";
cout << ans << endl;
}
int main(void)
{
solve();
}
|
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define lppi pair<pair<int, int>, int>
#define vppi vector<pair<int, int>>
#define sppi stack<pair<int int>>
#define qppi queue<pair<int, int>>
#define f first
#define s second
#define pb(x) push_back(x)
#define mkp(i, j) make_pair(i, j)
#define lmkp(i,j,k) make_pair(make_pair(i,j),k)
#define rmkp(i,j,k) make_pair(i,make_pair(j,k))
#define loop(i,n) for (i = 0; i < n; ++i)
#define loops(i,k,n) for (i = k; i <= n; ++i)
#define looprev(i,k,n) for (i = k; i >= n; --i)
#define inf (int)1e9
#define eps 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define prd(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define prdn(n) printf("%d\n", n)
#define prln(n) printf("%lld\n", n)
#define prf(n) printf("%f", n)
#define scd(n) scanf("%d", &n)
#define scd2(a, b) scanf("%d %d", &a, &b)
#define scd3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define scl(n) scanf("%lld", &n)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define scf(n) scanf("%f", &n)
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli i, j, k, n;
cin>>n>>k;
vi A(n+1);
loops(i, 1, n){
cin>>A[i];
}
int dp[n+1][k+1];
dp[0][0] = 1;
loops(i, 1, k){
dp[0][i] = 0;
}
loops(i, 1, n){
vi sum(k+1);
sum[0] = dp[i-1][0];
loops(j, 1, k){
sum[j] = (sum[j-1] + dp[i-1][j])%MOD;
}
loops(j, 0, k){
if(j <= A[i]){
dp[i][j] = sum[j];
}
else{
int ne = j-A[i]-1;
dp[i][j] = (sum[j]-sum[ne]+MOD)%MOD;
}
}
sum.clear();
}
cout<<dp[n][k]<<endl;
return 0;
}
| 0
| 44,317,378
|
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#define lli long long int
#define pairs pair<int,int>
#define mod 1000000007
const double PI = 3.141592653589793238460;
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
using namespace std;
ll pows(ll a,ll n,ll m)
{
ll res=1;
while(n)
{
if(n%2!=0)
{
res=(res*a)%m;
n--;
}
else
{
a=(a*a)%m;
n=n/2;
}
}
return res%m;
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
bool isprime(ll n)
{
if(n==1)
{
return false;
}
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
return false;
}
}
return true;
}
bool istrue(string s)
{
int i=0;
int j=s.size()-1;
while(i<j)
{
if(s[i]==s[j])
{
i++;
j--;
}
else
{
return false;
}
}
return true;
}
int n;
int a[100001];
int dp[100001];
int getans(int i)
{
if(i>=n-1)
{
return 0;
}
if(dp[i]!=-1)
{
return dp[i];
}
int ans=mod;
if(i+1<=n-1)
{
ans=min(ans,getans(i+1)+abs(a[i]-a[i+1]));
}
if(i+2<=n-1)
{
ans=min(ans,getans(i+2)+abs(a[i]-a[i+2]));
}
return dp[i]=ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<=n;i++)
{
dp[i]=-1;
}
cout<<getans(0)<<endl;
}
|
#include <iostream>
#include <string>
using namespace std;
string replace(string str, int a, int b, string p);
string reverse(string str, int a, int b);
void print(string str, int a, int b);
int main() {
string str, order, p;
int a, b, q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> order;
if (order == "replace") {
cin >> a >> b >> p;
str = replace(str, a, b, p);
}
else if (order == "reverse") {
cin >> a >> b;
str = reverse(str, a, b);
}
else if (order == "print") {
cin >> a >> b;
print(str, a, b);
}
}
return 0;
}
string replace(string str, int a, int b, string p) {
string ret = str;
for (int i = 0; i < b-a+1; i++) {
ret[a+i] = p[i];
}
return ret;
}
string reverse(string str, int a, int b) {
string ret = str;
for (int i = 0; i < b-a+1; i++) {
ret[a+i] = str[b-i];
}
return ret;
}
void print(string str, int a, int b) {
string ret = str.substr(a, b-a+1);
cout << ret << endl;
}
| 0
| 25,307,211
|
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int INF=1<<30;
int main(){
string s;cin>>s;
if (s=="zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
int n = s.size();
int index = -1;
char m;
vector<bool> cnt(26,false);
if (n < 26){
for(int i = 0; i < n; i++) {
cnt[s[i] - 'a'] = true;
}
for(int i = 0; i < 26; i++) {
if (cnt[i] == false){
m = char('a' + i);
break;
}
}
cout << s << m << endl;
}
else{
for(int i = n - 1; i >= 0; i--) {
if (s[i] > s[i + 1]){
cnt[s[i] - 'a'] = true;
}
else{
cnt[s[i] - 'a'] = true;
for(int j = 0; j < i; j++) {
cout << s[j];
}
for(int j = 25; j >= 0; j--) {
if (cnt[j] && s[i] - 'a' < j){
m = char('a' + j);
}
}
cout << m << endl;
break;
}
}
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; 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;
}
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N;
ll A[201010];
ll sum[201010];
ll xorsum[201010];
int main() {
cin >> N;
repe(i, 1, N) {
cin >> A[i];
sum[i] = sum[i - 1] + A[i];
xorsum[i] = xorsum[i - 1] ^ A[i];
}
A[N + 1] = INF;
sum[N + 1] = INF;
xorsum[N + 1] = INF;
int r = 1;
ll ans = 0;
repe(l, 1, N) {
r = max(r, l);
ll ssum = sum[r] - sum[l - 1];
ll xxorsum = xorsum[r] ^ xorsum[l - 1];
repe(j, r + 1, N + 1) {
ssum += A[j];
xxorsum ^= A[j];
r = j - 1;
if (ssum != xxorsum) {
break;
}
}
ans += r - l + 1;
}
cout << ans << endl;
}
| 0
| 4,585,588
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<int> p(m),y(m);
vector<int> s[n];
rep(i,m){
cin >> p[i] >> y[i];
p[i]--;
s[p[i]].push_back(y[i]);
}
rep(i,n) sort(s[i].begin(),s[i].end());
rep(i,m){
auto it = lower_bound(s[p[i]].begin(),s[p[i]].end(),y[i]);
int now = distance(s[p[i]].begin(),it);
printf("%012lld\n",ll(p[i]+1)*1000000+ll(now+1));
}
return 0;
}
|
#include <iostream>
using namespace std;
int bm[] = {20, 19, 20, 19, 20, 19, 20, 19, 20, 19};
int lm[] = {20, 20, 20, 20, 20, 20, 20, 20, 20, 20};
const int Y = 1000, M = 10;
int days[Y] = {};
int main(){
int n, y, m, d, ds;
int bms = 0, lms = 0;
cin >> n;
for(int i = 0;i < M;++i){
bms += bm[i];
lms += lm[i];
}
for(int i = 0;i < n;++i){
cin >> y >> m >> d;
ds = 0;
for(int ms = m; ms <= M; ++ms){
ds += (y % 3 == 0) ? lm[ms - 1] : bm[ms - 1];
if(ms == m){
ds -= d;
++ds;
}
}
for(int ys = y + 1; ys < Y; ++ys){
if(ys % 3 == 0){
ds += lms;
}
else{
ds += bms;
}
}
cout << ds << endl;
}
}
| 0
| 91,297,453
|
#include <bits/stdc++.h>
using namespace std;\
typedef long long ll;
typedef pair<ll,ll> P;
int main() {
int n,m,a,b; cin>>n>>m;
ll s=0;
vector<P> v; for(int i=0;i<n;i++) cin>>a>>b,v.push_back(P(a,b));
sort(v.begin(),v.end());
for(P p:v){
if(m>p.second) m-=p.second,s+=p.first*p.second;
else{
s+=p.first*m;
break;
}
}
cout<<s;
}
|
#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 sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
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); }
int dy[4] = {0, 0, 1, -1};
int dx[4] = {1, -1, 0, 0};
int main() {
int h,w;
cin>>h>>w;
vector<vector<int>> dist(h,vin(w,0));
vector<string> a(h);
rep(i,0,h)cin>>a[i];
queue<pair<int, int>> que;
rep(i,0,h){
rep(j,0,w){
if(a[i][j]=='#'){
que.push(mp(i,j));
}
}
}
while (que.size() != 0) {
pair<int, int> now = que.front();
que.pop();
for (int i = 0; i < 4; i++) {
int ny = now.first + dy[i];
int nx = now.second + dx[i];
if (ny < 0 || h <= ny || nx < 0 || w <= nx) continue;
if (a[ny][nx] == '#') continue;
if (dist[ny][nx] != 0) continue;
que.push(make_pair(ny, nx));
dist[ny][nx] = dist[now.first][now.second] + 1;
}
}
int ans=0;
rep(i,0,h){
rep(j,0,w){
chmax(ans,dist[i][j]);
}
}
cout<<ans<<endl;
}
| 0
| 1,713,885
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
int main() {
ll N,K;
cin >>N>>K;
vector<ll> H(N);
rep(i,N){
cin>>H[i];
}
sort(all(H));
reverse(all(H));
ll ans = 0;
rep3(i,K,N){
ans += H[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll a, ll b){
if(a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll g = gcd(a, b);
return a / g * b;
}
int f(ll x){
int res = 0;
while (x % 2 == 0){
res++;
x /= 2;
}
return res;
}
int main(){
int n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
a[i] /= 2;
}
ll x = 1;
rep(i, n){
x = lcm(x, a[i]);
if (f(x) != f(a[i])){
cout << 0 << endl;
return 0;
}
}
ll ans = (m / x + 1) / 2;
cout << ans << endl;
}
| 0
| 27,556,500
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int A, B, C; cin >> A >> B >> C;
cout << ((A==B && B==C) ? "Yes" : "No") << endl;
return 0;
}
|
#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 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 N; cin >> N;
long double B = 0;
vector<double>A(N);
rep(i, N) {
cin >> A[i];
B += 1 / A[i];
}
cout << fixed << setprecision(100) <<1/B<< endl;
}
| 0
| 59,638,285
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N;
cin >> N;
vll A(N);
vll AA(N);
rep(i, 0, N) cin >> A[i];
rep(i, 1, N+1) AA[i-1] = A[i-1] - i;
sort(all(AA));
ll b;
if (odd(len(AA))) {
b = AA[N/2];
} else {
b = (AA[N/2-1] + AA[N/2]) / 2;
}
ll ans = 0;
rep(i, 1, N+1) {
ans += abs(A[i-1] - (b + i));
}
cout << ans << endl;
}
|
#include <iostream>
#include <set>
#include <vector>
#include <utility>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
int g[101][101],n;
int main() {
cin >> n;
for(int i = 0;i < n;i++) {
int u,k,v;
cin >> u >> k;
for(int j = 0;j < k;j++) {
cin >> v;
g[u][v]++;
}
}
for(int i = 1;i <= n;i++){for(int j = 1;j <n;j++)cout<<g[i][j] << " "; cout<<g[i][n] << endl;}
}
| 0
| 97,911,161
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if ( a%2 && b%2 ) {
puts("Odd");
}
else {
puts("Even");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const int N = 2e7+5;
ll a[N];
void solve(){
int n;
cin>>n;
ll sum = 0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
sum+=a[i]*a[j];
}
}
cout<<sum<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
while(t--)solve();
return 0;
}
| 0
| 33,714,018
|
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#define FORD1(i, n) for (int i = (int)n; i >= 1; i--)
#define debug(X) { cout << #X << " = " << (X) << endl; }
#define endl '\n'
#define int long long int
using namespace std;
vi adj[(int)2e5];
map<int, bool> vis;
map<int, bool> col;
bool bi = true;
void dfs(int cur, bool c){
if(vis[cur]){
if(col[cur] != c)bi = false;
return;
}
vis[cur] = true;
col[cur] =c;
for(int child:adj[cur]){
dfs(child, !c);
}
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n, m;cin >> n >> m;
FOR(i, m){
int x, y;cin >> x >> y;
x--, y--;
adj[x].pb(y);
adj[y].pb(x);
}
int comp1 = 0, bii= 0, bi1 = 0;
int prev = 0;
FOR(i, n){
if(!vis[i]){
bi = true;
dfs(i, false);
int gp = vis.size() - prev;
if(gp == 1)comp1++;
else if(bi)bii++;
else bi1++;
}
prev = vis.size();
}
int ans = comp1*comp1 + comp1 * (n- comp1) *2;
ans += bi1*bii*2;
ans += bii*bii*2;
ans += bi1*bi1;
cout << ans;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v) out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define SIZE 200010
int main(){
int N;
ll a[SIZE], b[SIZE] = {}, sum = 0;
scanf("%d", &N);
for(int i=0; i<N; i++) {
scanf("%lld", a+i);
b[i] = a[i];
sum ^= a[i];
}
N = max(N, 61);
for(int i=0; i<=60; i++) {
if(sum & (1LL << i)) {
b[N++] = 1LL << i;
}
}
for(int i=0; i<=60; i++) {
int id = -1;
for(int j=0; j<N; j++) {
if (b[j] < (1LL << ((60-i)+1)) && (1LL << (60-i)) & b[j]) {
id = j;
break;
}
}
if (id == -1) continue;
swap(b[i], b[id]);
for(int j=0; j<N; j++) {
if (j == i) continue;
if((1LL << (60-i)) & b[j]) b[j] ^= b[i];
}
}
for(int i=0; i<N; i++) {
debug(b[i]);
}
ll ans = 0;
for(int i=0; i<=60; i++) {
if(!((1LL << (60-i)) & sum)) {
ans ^= b[i];
sum ^= b[i];
}
}
cout << ans + sum << endl;
return 0;
}
| 0
| 70,975,772
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int k=a*(a-1)/2;
int l=b*(b-1)/2;
int sum=k+l;
cout<<sum<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n,m;
cin >> n >> m;
vvi g(n+1);
rep(i,m){
int a,b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
vi dist(n+1, -1);
queue<int> que;
vi ans(n+1);
dist[1] = 0;
que.push(1);
while(!que.empty()){
int v = que.front();
que.pop();
for(auto nv : g[v]){
if(dist[nv] != -1) continue;
dist[nv] = dist[v] + 1;
que.push(nv);
ans[nv] = v;
}
}
cout << "Yes" << endl;
for(int i=2; i<=n; i++) cout << ans[i] << endl;
}
| 0
| 51,070,541
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int sen=0,maxe[2]={0,0},lo=0;
string str[1000],s;
while(cin>>s){
lo=s.size();
if(maxe[0]<lo){
maxe[0]=lo;
maxe[1]=sen;
}
str[sen]=s;
sen++;
}
int co=-1,num;
for(int i=0;i<=sen;i++){
int cou=0;
for(int j=i;j<=sen;j++)if(str[i]==str[j])cou++;
if(co<=cou){
co=cou;
num=i;
}
}
cout<<str[num]<<" "<<str[maxe[1]]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#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++)
template<class T> inline int chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline int chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1<<29;
const ll LINF = 1LL<<58;
const int mod = 1000000007;
int main(){
int n, k;
cin >> n >> k;
ll ans = LINF;
vector<ll> A(n + 1, 0);
for (int i = 0; i < n; i++) cin >> A[i + 1];
for (int bit = 0; bit < 1 << n; bit++) {
ll money = 0;
int cnt = 0;
ll nax = 0;
for (int i = 0; i < n; i++) {
bool flag = (bit >> i & 1);
if(flag){
ll h = A[i + 1];
chmax(h, nax + 1);
chmax(nax, h);
money += max(0LL, h - A[i + 1]);
cnt++;
} else {
if(A[i + 1] > nax) cnt++;
chmax(nax, A[i + 1]);
}
}
if(cnt >= k) {
chmin(ans, money);
}
}
cout << ans << endl;
return 0;
}
| 0
| 36,580,753
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, count = 0;
cin >> A >> B;
for (int i = A; i <= B; i++) {
int x = i / 1000;
int y = i - (i / 100)*100;
int z = (y - (y / 10)*10)*10 + y / 10;
if(x == z){
count += 1;
}
}
cout << count << endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i <= n; i++)
#define REP2(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long LL;
typedef long long int LLI;
int solve(int a,int b);
int x,y,n,ans,c,d;
int road[20][20];
int memo[20][20];
int dx[2] = {0,1};
int dy[2] = {1,0};
int main()
{
int i;
while(cin >> x >> y, x||y){
ans = 0;
REP(i,1,y){
REP(j,1,x){
road[i][j]=true;
}
}
cin >> n;
REP2(i,0,n){
cin >> c >> d;
road[d][c] = false;
if(c==0 && d==0)break;
}
solve(1,1);
cout << ans << endl;
}
return 0;
}
int solve(int a,int b)
{
if(x == a && y == b)ans++;
for(int i=0; i < 2; i++){
int tempa = a + dx[i];
int tempb = b + dy[i];
if(tempa <= x && tempb <= y && road[tempb][tempa] == true )
solve(tempa, tempb);
}
}
| 0
| 88,398,430
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
const ll nax = 1e5;
vector<ll> v[nax];
const ll mod = 1e9 + 7;
pair<ll, ll> dfs(ll s, ll p){
ll white = 1;
ll black = 0;
for(ll &c : v[s]){
if(c == p) continue;
pair<ll, ll> pf = dfs(c, s);
black = ((1LL*(white+black)*pf.first)%mod + (1LL*black*pf.second)%mod)%mod;
white = (white*pf.second)%mod;
}
return make_pair(white, (white + black)%mod);
}
int main(){
ll n; cin >> n;
for (ll i = 1; i < n; ++i)
{
ll a, b; cin >> a >> b;
v[--a].push_back(--b);
v[b].push_back(a);
}
auto p = dfs(0, -1);
ll ans = (p.first+p.second)%mod;
cout << ans;
}
|
#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);
double n, m, d;
cin >> n >> m >> d;
if(d == 0){
cout << (m-1)/n << endl;
return 0;
}
double a = m-1;
double b = 2*(n-d);
double c = n*n;
cout << a*b/c << endl;
return 0;
}
| 0
| 91,000,405
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
int result = 0;
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
for (int i = 0; i < K; i++)
{
result += A[i];
}
cout << result << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vec vector<ll>
#define sortv(a); sort(a.begin(), a.end());
#define rev(a); reverse(a.begin(), a.end());
#define FOR(i,a,b) for (ll i = (ll)(a); i < (b); i++)
#define ROF(i,a,b) for (ll i = (ll)(b)-1; i >= (a); i--)
ll MOD = 1000000007;
ll INF = 1LL << 60;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int h,w,a,b;cin>>h>>w>>a>>b;
FOR(i,0,b) {
FOR(j,0,a) {
cout<<'0';
}
FOR(j,a,w) {
cout<<'1';
}
cout<<'\n';
}
FOR(i,b,h) {
FOR(j,0,a) {
cout<<'1';
}
FOR(j,a,w) {
cout<<'0';
}
cout<<'\n';
}
}
| 0
| 18,427,604
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
vector< pair <int,int> >graph[MAX];
int cost[MAX];
void dijkstra(int src)
{
priority_queue< pair<int,int> >q;
q.push(make_pair(0,src));
cost[src]=0;
while(!q.empty())
{
int parents_money=q.top().first*-1;
int parent=q.top().second;
q.pop();
for(int i=0; i<graph[parent].size(); i++)
{
int childs_money=graph[parent][i].first;
int child=graph[parent][i].second;
if(cost[child]==-1 || cost[child]>childs_money+cost[parent])
{
cost[child]=childs_money+cost[parent];
q.push(make_pair(-1*cost[child],child));
}
}
}
}
void create_graph(int n)
{
for(int i=1; i<=n; i++)
{
int u=i%n;
int v=(i+1)%n;
graph[u].push_back({1,v});
v=(i*10)%n;
graph[u].push_back({0,v});
}
}
int main()
{
FastRead
memset(cost,-1,sizeof(cost));
int n;
cin>>n;
create_graph(n);
dijkstra(1);
cout<<cost[0]+1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n,k;
cin >> n >> k;
deque<ll> v(n);
rep(i,n) cin >> v[i];
ll ans = 0;
rep(i,min(k+1,n+1)){
rep(j,min(k+1,n+1) - i){
vector<ll> minu;
ll now = 0;
rep(l,i) now += v[l], minu.push_back(v[l]);
rep(m,j) now += v[n - 1 - m], minu.push_back(v[n - 1 - m]);
sort(minu.begin(),minu.end());
rep(l, min( int(minu.size()), k - i - j )){
if(minu[l] < 0){
now -= minu[l];
}
}
ans = max(now,ans);
}
}
cout << ans << endl;
return 0;
}
| 0
| 89,142,515
|
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
using ll = long long;
int main(){
string s, t;
cin >> s;
t = s;
ll k, ans = 0, n = s.length();
cin >> k;
if (n == 1){
cout << k / 2 << '\n';
return 0;
}
int flag = 1;
for(int i = 0; i < n - 1; i++) {
if(s[i] == s[i+1]){
continue;
}else{
flag = 0;
break;
}
}
if(flag == 1){
cout << (n * k) / 2 << '\n';
return 0;
}
for(int i = 0; i < n - 1; i++) {
if(s[i] == s[i + 1]) {
s[i + 1] = '0';
ans++;
}
}
reverse(t.begin(), t.end());
ll tmp = 0;
for(int i = 0; i < n - 1; i++) {
if(t[i] == t[i + 1]) {
t[i + 1] = '0';
tmp++;
}
}
ans = min(ans, tmp);
ans *= k;
if(s[0] == s[n - 1] && t[0] == t[n - 1]) {
ans += k - 1;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int query(int i) {
cout << i << endl << flush;
string s;
cin >> s;
if(s=="Vacant") {
exit(0);
} else if(s=="Male") {
return 0;
} else {
return 1;
}
}
int main() {
int n;
cin >> n;
int l = 0, r = n, ls, rs;
ls = rs = query(l);
for(int t=1; t<20; t++) {
int m = (l + r + 1) / 2;
int ms = query(m);
if(((m-l)&1)^(ls^ms)) {
r = m;
rs = ms;
} else {
l = m;
ls = ms;
}
}
}
| 0
| 18,428,875
|
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int N =1e4+5;
int n,k,x,y;
int main(){
scanf("%d %d %d %d",&n,&k,&x,&y);
ll ans=0;
for(ll i=0;i<n;i++)
{
if(k>0)
{
ans+=x;
k-=1;
}
else
ans+=y;
}
printf("%lld\n",ans);
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
char ans[105][105];
int main(){
int a,b;
for (int i = 0 ; i < 100;i++){
for (int j = 0;j < 100; j++){
if ( j < 50) ans[i][j] = '#';
else ans[i][j] = '.';
}
}
cin>>a>>b;
int k = 0;
for (int i = 0;i < 100; i+=2){
for (int j = 0;j < 50;j++){
if ((i+j)%2==0){
if(a!=1){
ans[i][j] = '.';
a--;
}
else{
k = 1;
break;
}
}
}
if(k){
break;
}
}
k = 0;
for (int i = 0; i < 100;i+=2){
for (int j = 50;j < 100;j++){
if ((i+j)%2==1){
if(b!=1){
ans[i][j] = '#';
b--;
}
else{
k =1;
break;
}
}
}
if (k == 1){
break;
}
}
cout<<100<<" "<<100<<endl;
for (int i = 0;i < 100;i++){
for (int j = 0;j < 100; j++){
if (j == 99){
cout<<ans[i][j]<<endl;
}
else{
cout<<ans[i][j];
}
}
}
}
| 0
| 25,186,365
|
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
#define PI 3.14159265358979323846264338327950L
using namespace std;
const ll MOD = (pow(10, 9) + 7);
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
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 f(ll n) {
if (n == 0 || n == 1) return 1;
else return (n * f(n - 1));
}
ll dignum(ll N, ll d) {
ll x = pow(10, d);
N %= x;
ll y = pow(10, d - 1);
N /= y;
return N;
}
ll divcnt(ll N, ll d) {
ll ans = 0;
while (1) {
if (N%d == 0) {
ans++;
N /= d;
}
else break;
}
return ans;
}
bool prime(ll num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) return false;
}
return true;
}
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
if (n == 1) return 1;
else if (n == 2) return 1;
else if (memo[n] != 0) return memo[n];
else return memo[n] = fibo(n - 1) + f(n - 2);
}
ll RS(ll N, ll P, ll M) {
if (P == 0) return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2, M);
return t * t % M;
}
return N * RS(N, P - 1, M);
}
vector<int> IntegerToVector(int bit, int N) {
vector<int> S;
for (int i = 0; i < N; ++i) {
if (bit & (1 << i)) {
S.push_back(i);
}
}
return S;
}
int main() {
ll N, M;cin >> N >> M;
vector<ll> L(M), R(M);
rep(i,M) cin >> L[i] >> R[i];
sort(ALL(L));
sort(ALL(R));
if(R[0] - L[M-1] + 1 < 0) cout << 0 << endl;
else cout << R[0] - L[M-1] + 1 << endl;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <numeric>
#include <functional>
#include <cmath>
#include <cassert>
#include <string>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
#define PI (acos(-1))
ll lcm(ll a, ll b)
{
return a * b / __gcd(a, b);
}
vector<ll> divisor(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll a[101];
ll solve()
{
string s;
cin >> s;
map<char, ll> m;
m[s[0]]++;
m[s[1]]++;
if(s.length() == 2){
if(m[s[0]] == 2){
cout << 1 << " " << 2 << endl;
return 0;
}
}
for(int i=2; i < s.length(); i++){
m[s[i]]++;
if(m[s[i]] >= 2){
cout << i - 1 << " " << i + 1 << endl;
return 0;
}else if(m[s[i - 1]] >=2){
cout << i - 1 << " " << i + 1 << endl;
return 0;
}
m[s[i - 2]]--;
}
cout << -1 << " " << -1 << endl;
return 0;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
| 0
| 77,879,597
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define pb push_back
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int kaijo[200010];
struct edge{int to,cost;};
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
bool kosa(double ax,double ay,double bx,double by,double cx,double cy,double dx,double dy){
double ta=(cx-dx)*(ay-cy)+(cy-dy)*(cx-ax);
double tb=(cx-dx)*(by-cy)+(cy-dy)*(cx-bx);
double tc=(ax-bx)*(cy-ay)+(ay-by)*(ax-cx);
double td=(ax-bx)*(dy-ay)+(ay-by)*(ax-dx);
return tc*td<0&&ta*tb<0;
}
void init_fact(int n){
kaijo[0]=1;
for(int i=1;i<=n;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=MOD;
}
}
int modpow(int a,int b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%MOD;
int memo=modpow(a,b/2);
return memo*memo%MOD;
}
int comb(int a,int b){
if(b>a)return 0;
if(a==b)return 1;
return kaijo[a]*modpow(kaijo[a-b],MOD-2)%MOD*modpow(kaijo[b],MOD-2)%MOD;
}
int g(int x){
x=modpow(x,MOD-2);
return x;
}
int n,l,r,a[200010],ans=1;
string s;
signed main(){
cin>>n>>s;
init_fact(200000);
rep(i,2*n){
if(i==0||i==2*n-1){
if(s[i]=='W'){
puts("0");
return 0;
}
}
if(i==0)a[i]=1;
else{
if(s[i]==s[i-1])a[i]=1-a[i-1];
else a[i]=a[i-1];
}
}
rep(i,2*n){
if(a[i]==0){
ans*=l-r;
ans%=MOD;
}
if(a[i]==1)l++;
else r++;
}
ans*=kaijo[n];
ans%=MOD;
if(l==r)cout<<ans<<endl;
else puts("0");
return 0;
}
|
#include <stdio.h>
int main(){
long long int t;
scanf("%lld",&t);
long long int num[t]={0};
long long int hasil=1;
for (long long int i=0;i<t;i++){
scanf("%lld",&num[i]);
}
for(long long int i=0;i<t;i++){
if (num[i]==0){
printf("0\n");
return 0;
}
}
for (int i=0;i<t;i++){
if(num[i]<=1000000000000000000/hasil){
hasil*=num[i];
}
else{
printf("-1\n");
return 0;
}
}
printf("%lld",hasil);
return 0;
}
| 0
| 80,171,007
|
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
ll n,d[maxn],siz[maxn],f,dis;
map <ll,int> p;
vector <int> a1,a2;
inline bool cmp(ll a,ll b){return a>b;}
int main()
{
n=read(); f=0;
for(int i=1;i<=n;i++) d[i]=read(),p[d[i]]=i;
sort(d+1,d+n+1,cmp);
for(int i=1;i<=n;i++)
{
siz[p[d[i]]]++;
ll dfa=d[i]-n+2*siz[p[d[i]]];
if(dfa>d[i]) continue;
siz[p[dfa]]+=siz[p[d[i]]]; dis+=siz[p[d[i]]];
if(p[dfa]==0) {f=1; break;}
a1.push_back(p[d[i]]),a2.push_back(p[dfa]);
}
if(f==1||dis!=d[n]) {puts("-1"); return 0;}
for(int i=0;i<a1.size();i++) printf("%d %d\n",a1[i],a2[i]);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int table[64][100000];
int b[64];
int Abit[64][100000];
int shift[64];
int dim;
void dump(const vector<int>& look, const int N) {
for (int i=0; i<look.size(); i++) {
for (int j=0; j<N; j++) {
cerr << table[i][j] << " ";
}
cerr << endl;
}
}
int main() {
int N;
cin >> N;
long long A[100000];
for (int i=0; i<N; i++) cin >> A[i];
long long allxor = 0;
for (int i=0; i<N; i++) allxor ^= A[i];
vector<int> look;
{
long long i = allxor;
for (int step=0; step<64; step++, i/=2) {
if (i%2 == 0) {
look.push_back(step);
}
}
}
reverse(look.begin(), look.end());
for (int i=0; i<N; i++) {
long long x = A[i];
int step = 0;
while (x > 0) {
if (x % 2 == 1) {
Abit[step][i] = 1;
}
x /= 2;
step++;
}
}
{
int dim = 0;
for (int a: look) {
for (int i=0; i<N; i++) table[dim][i] = Abit[a][i];
b[dim] = 1;
dim++;
}
}
long long left = 0;
int rank = 0;
for (int level=0; level<look.size(); level++) {
int idx = -1;
for (int i=rank; i<N; i++) {
if (table[level][i] == 1) {
idx = i;
break;
}
}
if (idx == -1) {
if (b[level] == 0) {
left |= 1LL << look[level];
}
continue;
}
for (int i=0; i<look.size(); i++) {
int tmp = table[i][rank];
table[i][rank] = table[i][idx];
table[i][idx] = tmp;
}
for (int i=0; i<look.size(); i++) {
if (i == level) continue;
if (table[i][rank] == 0) continue;
for (int j=0; j<=N; j++) {
table[i][j] ^= table[level][j];
}
b[i] ^= b[level];
}
left |= 1LL << look[level];
rank++;
}
cout << left + (allxor ^ left) << endl;
return 0;
}
| 0
| 40,688,459
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define No cout<<"No"<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a,a+n);
#define sr() sort(a,a+n,greater<ll>());
#define v() sort(v.begin(),v.end());
#define vr() sort(v.begin(),v.end(),greater<ll>());
#define mod 1000000007
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);}
ll power(ll x,ll y,ll p){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
int main() {
fast();
{
ll n,a[3],b;
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3,greater<ll>());
ll ans=(a[0]*10+a[1])+a[2];
cout<<ans<<endl;
}
return 0;
}
|
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a,count=0,count2=0;
cin>>a;
int b=a;
while(b!=0){
int rem=b%10;
count++;
b=b/10;
}
if(count==1){
for(int i=1;i<=a;i++){
count2++;
}
cout<<count2<<endl;
}
else if(count==2){
cout<<9<<endl;
}
else if(count==3){
for(int i=100;i<=a;i++){
count2++;
}
cout<<count2+9<<endl;
}
else if(count==4){
for(int i=1000;i<=a;i++){
count2++;
}
cout<<909<<endl;
}
else if(count==5){
for(int i=10000;i<=a;i++){
count2++;
}
cout<<count2+909<<endl;
}
else if(count==6){
cout<<90909<<endl;
}
return 0;
}
| 0
| 72,183,901
|
#include <bits/stdc++.h>
using namespace std;
long n, m;
long comb(long x) {
if (x < 2) return 0;
return (x * (x - 1)) / 2;
}
int main(void) {
cin >> n >> m;
cout << comb(n) + comb(m) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b,ll c){if(a==b)out(c);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi ans;
int cnt,n;
bool solve(int a,int b){
if(b<=0)return false;
if(b==1){
if(a<cnt)return false;
rep(i,cnt)ans[i]=n-cnt+1+i;
return true;
}
if(b>=cnt-a+1){
rep(i,b)ans[i]=n-cnt+b-i;
REP(i,b,cnt)ans[i]=n-cnt+i+1;
return true;
}
rep(i,a)ans[cnt-a+i]=n-cnt+i+1;
cnt-=a;
return solve(a,b-1);
}
int main(){
ll a,b;cin>>n>>a>>b;
ans=vi(n);
if(a>n||b>n)dame(-1);
if(a==n){
if(b!=1)dame(-1);
rep(i,n)ans[i]=i+1;
outv(ans);
return 0;
}
if(b==n){
if(a!=1)dame(-1);
rep(i,n)ans[i]=n-i;
outv(ans);
return 0;
}
if(a==1||b==1)dame(-1);
if(a+b>n+1)dame(-1);
cnt=n-a;
rep(i,a)ans[n-i-1]=a-i;
if(solve(a,b-1))outv(ans);
else dame(-1);
}
| 0
| 55,415,985
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#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 ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main()
{
int n;
cin >> n;
int ans = 0;
vector<int> type(4);
REP(i, n) {
string s;
cin >> s;
if (s[0]=='B'){
if (s[s.size()-1] == 'A') type[2]++;
else type[3]++;
}else{
if (s[s.size()-1] == 'A') type[1]++;
else type[0]++;
}
REP(j, s.size()-1){
if (s[j]=='A' && s[j+1]=='B') ans++;
}
}
if (type[2] > 0){
ans += (type[2]-1);
if (type[1]>0) {
ans++;
type[1]--;
}
if (type[3]>0) {
ans++;
type[3]--;
}
}
ans += min(type[1], type[3]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(arr))
#define forn(i,n) forr(i,0,n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
int a, b;
string s;
bool sol;
int main(){
ios::sync_with_stdio(0);
cin >> a >> b;
cin >> s;
sol = true;
if((int)s.length() != a+b+1) sol = false;
forn(i,(int)s.length()){
if(i == a){
if(s[i] != '-'){
sol = false;
}
continue;
}
if(s[i] < '0' || s[i] > '9'){
sol = false;
}
}
if(sol){
cout << "Yes\n";
}else{
cout << "No\n";
}
return 0;
}
| 0
| 22,729,731
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(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; }
int main() {
ll n;
cin >> n;
vector<ll> a(n, 0);
map<ll, ll> m;
rep1(i, n) cin >> a[i];
rep1(i, n){
if (m[a[i]]!=0){
cout << "NO" << endl;
return 0;
}
m[a[i]]++;
}
cout << "YES" << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
auto check = [&](long long mid) {
vector<pair<int, int>> v;
v.emplace_back(0, 0);
for (int i = 1; i < n; i++) if (a[i - 1] >= a[i]) {
while (v.back().first > a[i]) v.pop_back();
if (v.back().first == a[i]) {
v.back().second++;
} else {
v.emplace_back(a[i], 1);
}
while (v.back().second == mid) {
int pos = v.back().first; v.pop_back();
if (v.back().first == pos - 1) {
v.back().second++;
} else {
v.emplace_back(pos - 1, 1);
}
}
if (v.front().second) return false;
}
return true;
};
auto binary_search = [&](long long ok, long long ng) {
while (abs(ng - ok) > 1) {
long long mid = (ng + ok) / 2;
(check(mid) ? ok : ng) = mid;
}
return ok;
};
bool inc = true;
for (int i = 0; i + 1 < n; i++) if (a[i] >= a[i + 1]) inc = false;
if (inc) return !(cout << 1 << endl);
cout << binary_search(n, 1) << endl;
return 0;
}
| 0
| 79,682,690
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
string ans = "Yes";
vector<string> w(n);
cin >> w.at(0);
for(int i = 1; i < n; ++i){
cin >> w.at(i);
if(w.at(i - 1).back() != w.at(i).at(0)) ans = "No";
}
for(int i = 0; i < n; ++i){
for(int j = i + 1; j < n; ++j){
if(w.at(i) == w.at(j)) ans = "No";
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define debug(x) cout<<#x<<": "<<(x)<<endl
typedef long long ll;
bool ques(ll n){
cout<<"? "<<n<<endl<<flush;
string ans;
cin>>ans;
return (ans=="Y");
}
bool pow10(ll n){
ll d=1;
rep(i,10){
d*=10;
if(n==d)return true;
}
return false;
}
void select(ll l,ll r){
if(l==0)l=1;
while(l<=r){
if(ques(l*10)){
cout<<"! "<<l<<endl;
return;
}
l++;
}
}
void bin(ll l,ll r){
if(l>1e10){
cout<<"! 1"<<endl;
return;
}
ll m = (l+r)/2;
bool yes = ques(m);
if(m%10==9 && yes && (pow10(r)^ques(r))){
select(m-9,m);
return;
}
if(m+1==r && yes) bin(m*10,(m+1)*10);
else if(yes) bin(m,r);
else bin(l,m);
}
int main(void){
bin(0,10);
return 0;
}
| 0
| 3,765,665
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<int> numbers;
numbers.push_back(a);
numbers.push_back(b);
numbers.push_back(c);
sort(numbers.begin(),numbers.end());
cout << numbers[0] << " " << numbers[1] << " " << numbers[2] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int maxHappiness(vector<vector<int>>& tasks, int row, int col, vector<vector<int>>& mem){
if(row >= tasks.size()) return 0;
if(mem[row][col] != -1) return mem[row][col];
int ans = INT_MIN;
for(int i = 0; i < 3; i++){
if(i == col) continue;
ans = max(ans, tasks[row][col]+maxHappiness(tasks, row+1, i, mem));
}
mem[row][col] = ans;
return ans;
}
int main(){
int N;
cin >> N;
vector<vector<int>> tasks(N, vector<int>(3));
vector<vector<int>> mem(N, vector<int>(3, -1));
for(int i = 0; i < N; i++){
cin >> tasks[i][0] >> tasks[i][1] >> tasks[i][2];
}
int ans = INT_MIN;
for(int i = 0; i < 3; i++){
ans = max(ans, maxHappiness(tasks, 0, i, mem));
}
cout << ans << endl;
}
| 0
| 46,879,110
|
#include <iostream>
#include <bitset>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N ;
long L = sqrt(N) + 1;
long ans = 100000000000;
for (long i = 1; i < L ; i++) {
if (N % i != 0){
continue;
}
long A = i;
long B = N / i;
long a_s = to_string(A).size();
long b_s = to_string(B).size();
long temp_max = max(a_s, b_s);
if (ans > temp_max){
ans = temp_max;
}
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
char t[9][5] = {
{'.',',','!','?',' '},
{'a','b','c',0,0},
{'d','e','f',0,0},
{'g','h','i',0,0},
{'j','k','l',0,0},
{'m','n','o',0,0},
{'p','q','r','s',0},
{'t','u','v',0,0},
{'w','x','y','z',0}};
int sz[9] = {5,3,3,3,3,3,4,3,4};
int main(){
int n;
scanf("%d\n", &n);
rep(i,n){
char last=0; int cnt=0;
while(true){
char c;
scanf("%c",&c);
if(c==last){
cnt++;
}
else if(c=='0' && last!=0){
printf("%c", t[last-'1'][cnt%sz[last-'1']]);
last=0;
cnt=0;
}
else if(c=='\n'){
break;
}
if(c!='0') last = c;
else last = 0;
}
cout << endl;
}
}
| 0
| 16,440,600
|
#include <iostream>
#include <queue>
using namespace std;
#define N 100
#define INFTY 1000000
int M[N][N],d[N];
int i,j,n,u,k,v;
void bfs(int s){
queue <int> Q;
for( i = 0; i < N; i++ ) d[i] = INFTY;
d[s] = 0;
Q.push(s);
while ( !Q.empty() ){
u = Q.front(); Q.pop();
for( int v = 0; v < n; v++ ){
if( M[u][v] == 0 ) continue;
if( d[v] != INFTY ) continue;
d[v] = d[u] + 1;
Q.push(v);
}
}
for( i = 0; i < n; i++ ){
cout << i+1 << " ";
if ( d[i] == INFTY ) cout << -1;
else cout << d[i];
cout << endl;
}
}
int main(){
for( i = 0; i < n; i++ ){
for( j = 0; j < n; j++ ) M[u][v] = 0;
}
cin >> n;
for( i = 0; i < n; i++ ){
cin >> u;
u--;
cin >> k;
for( j = 0; j < k; j++ ){
cin >> v;
v--;
M[u][v] = 1;
}
}
bfs(0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long pow_mod(long long n, long long k, long long m) {
if ( k == 0 ) { return 1; }
if ( k%2 == 0 ) {
long long t = pow_mod(n, k/2, m);
return t*t % m;
}
return n * pow_mod(n, k-1, m) % m;
}
long long comb_mod(long long n, long long r, long long m) {
if ( r == 0 ) { return 1; }
long long x = 1;
for ( long long i = 1; i <= r; i++ ) {
x *= n - r + i;
x %= m;
}
long long y = 1;
for ( long long i = 1; i <= r; i++ ) {
y *= i;
y %= m;
}
return x * pow_mod(y, m-2, m) % m;
}
int main() {
long long x, y;
cin >> x >> y;
long long ans = 0;
if ( (x+y)%3 == 0 ) {
long long x1_y2 = (2*y - x) / 3;
long long x2_y1 = y - 2*x1_y2;
if ( x1_y2 >= 0 && x2_y1 >= 0 ) {
ans = comb_mod(x1_y2+x2_y1, x1_y2, mod);
}
}
cout << ans << endl;
return 0;
}
| 0
| 56,364,308
|
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int K;
string S;
cin >> K >> S;
if (K >= S.size()) cout << S << endl;
else{
rep(i,K){
cout << S.at(i);
}
cout << "..." << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < m; i++){
cin >> a[i];
}
int s = 0;
for(int i = 0; i < m;i++)
s += a[i];
if (s > n)
{
cout << "-1" << endl;
}
else
{
cout << n - s << endl;
}
return 0;
}
| 0
| 5,084,034
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;cin >> S;
if(S[0]==S[1]&&S[1]==S[2]){
cout << "Yes" << endl;
}else if(S[1]==S[2]&&S[2]==S[3]){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int loopCount(const int button, const int count) {
if (button == 1) {
return (count - 1) % 5;
} else if (button == 7 || button == 9) {
return (count - 1) % 4;
}
return (count - 1) % 3;
}
int main() {
const char keitaiChar[][6] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz",};
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string input;
cin >> input;
int preButton = 0, count = 0;
for (string::iterator it = input.begin(); it < input.end(); it++) {
int button = *it - '0';
if (button == 0) {
if (preButton != 0) {
cout << keitaiChar[preButton - 1][loopCount(preButton, count)];
count = 0;
}
} else {
count++;
}
preButton = button;
}
cout << endl;
}
}
| 0
| 2,614,612
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
int main() {
INIT;
ll N;
cin >> N;
vector<ll> a(N), b(N);
rep(i, N) cin >> a[i];
rep(i, N) cin >> b[i];
ll sum_a = 0, sum_b = 0;
rep(i, N) {
if (a[i] < b[i]) sum_b += (b[i] - a[i]) / 2;
if (a[i] > b[i]) sum_a += a[i] - b[i];
}
if (sum_b >= sum_a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
map<int, int> mp;
for(int i=0; i<n; i++){
int a;
cin >> a;
mp[a]++;
}
int typs = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for(int i=0; i<=200000; i++){
if(mp[i] > 0){
typs++;
pq.push(mp[i]);
}
}
int ans = 0;
while(typs > k){
typs -= 1;
ans += pq.top();
pq.pop();
}
cout << ans << endl;
return 0;
}
| 0
| 2,940,833
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n, a, b;
int main(void){
cin >> n >> a >> b;
if(a > b || (n == 1)&&(a != b)){
cout << 0 << endl;
return 0;
}
lli x = (n-1)*b+a;
lli y = (n-1)*a+b;
cout << x-y+1 << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
using namespace std;
int main()
{
while(1){
int n;
cin >> n;
if(n == 0){
break;
}else{
queue<string> move;
for(int i = 0; i < n; i++){
string x;
cin >> x;
move.push(x);
}
int ans = 0;
while(!move.empty()){
string x;
x = move.front();
move.pop();
if(!move.empty()){
if(x == "lu"){
if(move.front() == "ru"){
ans++;
move.pop();
}else{
move.pop();
}
}else if(x == "ru"){
if(move.front() == "lu"){
ans++;
move.pop();
}else{
move.pop();
}
}else if(x == "ld"){
if(move.front() == "rd"){
ans++;
move.pop();
}else{
move.pop();
}
}else if(x == "rd"){
if(move.front() == "ld"){
ans++;
move.pop();
}else{
move.pop();
}
}
}
}
cout << ans << endl;
}
}
}
| 0
| 2,746,995
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
b += a;
cout << b << "\n";
return 0;
}
|
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;
const long long MAX = 1000000000;
bool query(long long x)
{
cout << "? " << x << endl;
char c;
cin >> c;
return c == 'Y';
}
int main()
{
long long n = 0;
for(int i=0; i<9; ++i){
int left = 0;
int right = 9;
if(i == 0)
++ left;
while(left < right){
int mid = (left + right) / 2;
long long x = (n * 10 + mid + 1) * MAX - 1;
if(!query(x))
left = mid + 1;
else
right = mid;
}
n *= 10;
n += left;
if(left < 9){
long long x = n + 1;
if(query(x)){
cout << "! " << n << endl;
return 0;
}
}
else{
long long x = 10 * n - 1;
if(!query(x)){
cout << "! " << n << endl;
return 0;
}
}
}
n *= 10;
cout << "! " << n << endl;
return 0;
}
| 0
| 80,715,847
|
#include<iostream>
#include<vector>
#include<algorithm>
int main(void)
{
std::vector<int> data;
int n;
while(std::cin >> n)
{
data.push_back(n);
}
std::vector<int> count(data.size());
for(size_t i=0; i<data.size(); ++i)
{
for(size_t j=0; j<data.size()-i; ++j)
{
if(data[i]==data[i+j])
{
++count[i];
}
}
}
count.push_back(0);
int countmax = *std::max_element(count.begin(),count.end());
std::vector<int> answer;
for( size_t i=0; i<count.size(); ++i )
{
if(count[i]==countmax)
{
answer.push_back(data[i]);
}
}
std::sort(answer.begin(),answer.end());
for( size_t i=0; i<answer.size(); ++i)
{
std::cout << answer[i] << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct UnionFind{
vector<int> par;
UnionFind(int N) : par(N){
for(int i = 0; i < N; i++){
par[i] = i;
}
}
int root(int x){
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(){
int N, M;
cin >> N >> M;
vector<int> P(N);
for(int i = 0; i < N; i++) cin >> P[i];
UnionFind tree(N);
for(int i = 0; i < M; i++){
int x, y;
cin >> x >> y;
tree.unite(x-1, y-1);
}
int cnt = 0;
for(int i = 0; i < N; i++){
if(tree.same(i, P[i]-1)){
cnt++;
}
}
cout << cnt << endl;
}
| 0
| 62,328,711
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
char A,B;
cin>>A;
B=A+1;
cout<<B<<endl;
}
|
#include<stdio.h>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
string a;
string b;
int ans[1000+1][1000+1];
int lcs()
{
int al=a.size();
int bl=b.size();
int maxn=-1;
a=" "+a;
b=" "+b;
for (int i=1;i<=al;i++)
{
for (int j=1;j<=bl;j++)
{
if(a[i]==b[j])
{
ans[i][j]=ans[i-1][j-1]+1;
}
else {
ans[i][j]=max(ans[i-1][j],ans[i][j-1]);
}
if(ans[i][j]>maxn)
maxn=ans[i][j];
}
}
return maxn;
}
int main()
{
int q;
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
cin>>a;
cin>>b;
int sum=lcs();
cout<<sum<<endl;
}
return 0;
}
| 0
| 7,350,543
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> path(N);
rep(i, M) {
int A, B;
cin >> A >> B;
A--, B--;
path[A].push_back(B);
path[B].push_back(A);
}
vector<bool> visited(N, false);
vector<int> ans(N, -1);
queue<int> q;
q.push(0);
visited[0] = true;
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto nv: path[v]) {
if (visited[nv]) continue;
visited[nv] = true;
ans[nv] = v;
q.push(nv);
}
}
cout << "Yes" << endl;
for (int i = 1; i < ans.size(); i++) cout << ans[i] + 1 << endl;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=998244353;
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=2e5+5;
int main(void){
int N;
cin >> N;
lint A[N];
rep(i,N) cin >> A[i];
lint dp[N]={};
dp[0]=1000;
rep(i,N-1){
lint stk=dp[i]/A[i];
lint money=dp[i]%A[i];
dp[i+1]=max(dp[i],stk*A[i+1]+money);
}
cout << dp[N-1] << endl;
}
| 0
| 56,665,564
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main () {
int N, M;
cin >> N >> M;
int ans =0;
if(N>1) ans +=N*(N-1)/2;
if(M>1) ans +=M*(M-1)/2;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
int paSize = printArray.size();
for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
if (between != '\n') {cerr << endl;}
}
int dp[11111][11111];
void print(string s, string t) {
int n = s.size(), m = t.size();
rep (i, n+1) {
rep (j, m+1) {
printf("%2lld ", dp[i][j]);
}
puts("");
}
}
int dist(string s, string t) {
fill(dp[0], dp[1010], 1 << 28);
dp[0][0] = 0;
dp[0][0] = 0;
int N = s.size(), M = t.size();
rep (i, N+1) dp[i][0] = i;
rep (i, M+1) dp[0][i] = i;
rep (i, N) {
rep (j, M) {
dp[i+1][j+1] = min({dp[i][j+1]+2, dp[i+1][j]+2, dp[i][j] + (s[i] != t[j])});
}
}
cout << dp[N][M] << endl;
}
int lcs(string s, string t) {
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
dp[i+1][j+1] = (s[i] == t[j] ? dp[i][j]+1 : max(dp[i][j+1], dp[i+1][j]));
}
}
return dp[s.size()][t.size()];
}
signed main() {
int n;
cin >> n;
while (n--) {
string s, t;
cin >> s >> t;
cout << lcs(s, t) << endl;
}
return 0;
}
| 0
| 55,476,113
|
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
typedef struct{
double x;
double y;
}XY;
bool flagfirst=true;
bool test=true;
int counter=0;
void kochCurve(XY p1,XY p2,int n){
XY s,u,t;
s.x=(2*p1.x+p2.x)/3;
s.y=(2*p1.y+p2.y)/3;
t.x=(p1.x+2*p2.x)/3;
t.y=(p1.y+2*p2.y)/3;
u.x=(t.x-s.x)*cos(M_PI/3)-(t.y-s.y)*sin(M_PI/3)+s.x;
u.y=(t.x-s.x)*sin(M_PI/3)+(t.y-s.y)*cos(M_PI/3)+s.y;
if(flagfirst==true) {
printf("%.8f %.8f\n",p1.x,p1.y);
flagfirst=false;
}
if(n>0){
kochCurve(p1,s,n-1);
printf("%.8f %.8f\n",s.x,s.y);
kochCurve(s,u,n-1);
printf("%.8f %.8f\n",u.x,u.y);
kochCurve(u,t,n-1);
printf("%.8f %.8f\n",t.x,t.y);
kochCurve(t,p2,n-1);
}
}
int main(){
int n;
XY p1,p2;
cin >>n;
p1.x=0;
p1.y=0;
p2.x=100;
p2.y=0;
kochCurve(p1,p2,n);
printf("%.8f %.8f\n",p2.x,p2.y);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>void print(T x){cout << x << endl;}
template<class T>void printvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} cout << a[a.size()-1] << endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int x, y, a, b, c; cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
rep(i, a) cin >> p[i];
rep(i, b) cin >> q[i];
rep(i, c) cin >> r[i];
sort(ALL(p), greater<int>());sort(ALL(q), greater<int>());sort(ALL(r), greater<int>());
vector<int> eat(x+y);
int pi=0, qi=0, ei=0;
while(ei<x+y){
if(qi==y || (pi<x && p[pi]>q[qi])){
eat[ei] = p[pi];
pi++;
}else{
eat[ei] = q[qi];
qi++;
}
ei++;
}
int ri=0, tail=x+y-1;
while(r[ri] > eat[tail]){
eat[tail] = r[ri];
tail--;
ri++;
}
ll ans=0;
rep(i, x+y) ans+=(ll)eat[i];
print(ans);
return 0;
}
| 0
| 46,659,531
|
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
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;
}
}
int main(void)
{
int x;
string s;
cin >> x;
s = to_string(x);
int sum = 0;
for (int i = 0; i < s.length(); i++)
{
sum += s[i] - '0';
}
if (x % sum == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int i=0; i<H; i++) cin >> s[i];
vector<vector<int>> dp(H, vector<int>(W, INT_MAX));
if (s[0][0]=='#') dp[0][0] = 1;
else dp[0][0] = 0;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
for (int dir = 0; dir<2; dir++) {
int ni = i+dx[dir], nj = j+dy[dir];
if (ni>=H||nj>=W) continue;
int add = 0;
if (s[ni][nj]=='#'&&s[i][j]=='.') add = 1;
dp[ni][nj] = min(dp[ni][nj], dp[i][j]+add);
}
}
}
cout << dp[H-1][W-1] << endl;
return 0;
}
| 0
| 88,509,249
|
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#include <math.h>
#include <cstring>
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ui = unsigned int;
using qul = queue<ll>;
using pql = priority_queue<ll>;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
#pragma region header
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i <= n; i++)
#define INF (ll)10000000000000000
#define mod (ll)1000000007
#define P pair<lint,lint>
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;
}
#pragma endregion
#pragma endregion
lint n, m;
vector<vector<lint>> G(n + 15, vector<lint>(0));
void dfs(lint v, vector<bool>& seen, lint& res) {
bool end = true;
for (int i = 0; i < seen.size(); ++i)
if (!seen[i] && i != v)
end = false;
if (end) {
++res;
return;
}
seen[v] = true;
for (auto nv : G[v]) {
if (seen[nv])
continue;
dfs(nv, seen, res);
}
seen[v] = false;
}
int main(void) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
lint a, b; cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<bool> seen(n, false);
lint res = 0;
dfs(0, seen, res);
printf("%lld\n", res);
return 0;
}
|
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,M,K,B,res=0,L[2005]={},Lsum[4005]={};
int main()
{
cout << fixed << setprecision(18);
cin>>N;
cout<<N/3<<endl;
}
| 0
| 40,636,736
|
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << endl;
}
const int mod = 1e9 + 7;
int main(){
ll n; cin >> n;
ll mx = 0;
vl a(n); rep(i,n) cin >> a[i], chmax(mx,a[i]);
ll h = (mx+1)/2;
sort(rall(a));
vl cnt(mx+1,0);
rep(i,n){
if(a[i]<h){
puts("Impossible");
return 0;
}
cnt[a[i]]++;
}
for(ll i=h+1; i<=mx; i++){
if(cnt[i] < 2){
puts("Impossible");
return 0;
}
}
if(mx&1){
if(cnt[h] == 2) puts("Possible");
else puts("Impossible");
}else{
if(cnt[h] == 1) puts("Possible");
else puts("Impossible");
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define float long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define pii pair<int, int>
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define all(x) x.begin(), x.end()
#define fill(a,b) memset(a, b, sizeof(a))
#define sz(x) (int)x.size()
#define sp(x) setprecision(x)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
signed main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string s; cin>>s;
int x=0;
for(int i=0;i<3;i++) if(s[i]=='R') x++;
if(s[1]=='R' || x==0) cout<<x<<endl;
else cout<<1<<endl;
}
| 0
| 69,582,181
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldINF = 1e18; const double EPS = 1e-6;
template<typename T, typename U, typename O> void caut(T a, U b, O c){cout<<"("<<a<<","<<b<<","<<c<<") ";} template<typename T, typename U> void caut(T a, U b){cout<<"("<<a<<","<<b<<") ";} template<typename T> void caut(T a){cout<<"("<<a<<") ";}
using P=pair<double,int>;
const ll M = 998244353;
void add(ll& x, ll y) {x+=y; x%=M;}
void chmax(ll& x, ll y) {if (x<y) x=y;}
int main() {
string s; cin>>s;
int n=s.size();
for(int i=0;i<n;i++) {
for(int j=0;j<=n-i;j++) {
if (s.substr(0,i) + s.substr(i+j,n-i-j) == "keyence") {
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
int main() {
int N, K;
cin >> N >> K;
vector<int> sunuke(N,0);
rep(i, K) {
int d;
cin >> d;
rep(j, d) {
int a;
cin >> a;
sunuke[a-1]++;
}
}
int ans = 0;
rep(i, N) {
if (sunuke[i] == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 62,788,421
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
int X, t;
cin >> X >> t;
int ans = X - t;
if (ans > 0) {
cout << ans << endl;
} else if ((ans == 0) || (ans < 0)) {
cout << 0 << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
char map[20][20];
int W, H, start_x, start_y, ans = 0;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void dfs(int x, int y)
{
ans++;
if(map[x][y] != '#'){
map[x][y] = '#';
for(int i = 0; i < 4; i++){
int next_x = x + dx[i], next_y = y + dy[i];
if(next_x < W && next_x >= 0 && next_y < H && next_y >= 0){
if(map[next_x][next_y] == '#')
continue;
dfs(next_x, next_y);
}else{
continue;
}
}
}
}
int main()
{
while(1){
cin >> W >> H;
if(W == 0 && H == 0){
break;
}else{
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> map[j][i];
if(map[j][i] == '@'){
start_x = j;
start_y = i;
}
}
}
dfs(start_x, start_y);
cout << ans << endl;
ans = 0;
}
}
}
| 0
| 67,582,334
|
#include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G];
long long dp[G];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
}
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++){
dp[i] = min(dp[i-1] + abs(a[i] - a[i-1]),dp[i-2] + abs(a[i] - a[i-2]));
}
cout << dp[n-1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, c, k;
cin >> n >> c >> k;
vector<long long int> t(n);
for(int i=0; i<n; i++){
cin >> t[i];
}
sort(t.begin(),t.end());
long long int ans = 0, time = t[0], num = 1;
for(int i=1; i<n; i++){
if(num == c || t[i] - time > k){
ans += 1;
num = 1;
time = t[i];
}
else num += 1;
}
ans += 1;
cout << ans << endl;
return 0;
}
| 0
| 23,315,778
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
#define pl pair<ll,ll>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a)
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
int n, s;
int ans=0;
int solve(int i,int j, int k){
if(i==n){
if(k==s)ans++;
}else{
FOR(l,j+1,10){
if(k+l<=s){
solve(i+1,l,k+l);
}
}
}
return ans;
}
int main(){
while(cin>>n>>s&&(n||s)){
ans=0;
cout<<solve(0,-1,0)<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k;
cin>>n>>k;
cout<<n-k+1;
return 0;
}
| 0
| 41,272,310
|
#include<iostream>
using namespace std;
int main(){
string s;
cin >> s;
if(s[1]=='R'){
if(s[0]=='R'&& s[2]=='R'){
printf("%d\n",3);
}else if(s[0]=='R'|| s[2]=='R'){
printf("%d\n",2);
}else{
printf("%d\n",1);
}
}else if(s[0]=='R' || s[2]=='R'){
printf("%d\n",1);
}else{
printf("%d\n",0);
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG pf("Hi\n")
#define INF 1000000000
#define i64 long long int
#define eps (1e-8)
#define xx first
#define yy second
#define ln 17
#define off 8002
using namespace __gnu_pbds;
using namespace std ;
typedef tree< i64, null_type, less<i64>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef pair<int, int> pii;
#define maxn 200005
int ask(i64 n)
{
printf("? %lld\n",n) ;
fflush(stdout) ;
char s[5] ;
scanf("%s",s) ;
return (s[0]=='Y') ;
}
int findLength1()
{
i64 st = 1 ;
int len = 0 ;
while( 1 )
{
int res = ask(st) ;
if( res )
{
len++ ;
st = st*10 ;
}
else break ;
}
return len ;
}
int findLength2()
{
i64 st = 9 ;
int len = 0 ;
while( 1 )
{
int res = ask(st) ;
len++ ;
if( res == 0 )
{
st = st*10 + 9 ;
}
else break ;
}
return len ;
}
int main()
{
int res = ask(555555555555LL) ;
int len ;
if(res) len = findLength2() ;
else len = findLength1() ;
i64 lo = 1 , hi ;
for(int i=1 ; i<len ; i++) lo = lo*10 ;
hi = 10*lo - 1 ;
while( lo < hi )
{
i64 mid = (lo+hi)/2 ;
int res = ask(mid*10) ;
if(res) hi = mid ;
else lo = mid+1 ;
}
printf("! %lld\n",lo) ;
return 0 ;
}
| 0
| 45,705,080
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,m; cin >> n >> m;
vector<int> l(m),r(m); rep(i,m) cin >> l[i] >> r[i];
int left = 1,right = n;
rep(i,m){
left = max(left,l[i]);
right = min(right,r[i]);
}
int ans = left>right ? 0:right-left+1;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std ;
const int N= 3e5;
int Mod = 1e9+7 ;
long long cum [N];
int main(){
string N;
cin >> N;
int ans = 0;
int tmp = 0;
for (int i = 0; i < N.length(); ++i) {
if (N[i] == 'R') {
tmp++;
ans = tmp;
} else {
if (ans < tmp) {
ans = tmp;
}
tmp = 0;
}
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 95,845,174
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool to_I[200000];
bool to_N[200000];
int main() {
int N, M;
cin >> N >> M;
int a, b;
for (int i=0; i<M; i++) {
cin >> a >> b;
if (a == 1) to_I[b] = true;
if (b == 1) to_I[a] = true;
if (a == N) to_N[b] = true;
if (b == N) to_N[a] = true;
}
string ans = "IMPOSSIBLE";
for (int i=2; i<N; i++) {
if (to_I[i] && to_N[i]) ans = "POSSIBLE";
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 998244353;
ll T = 1;
ll n, q, x, K;
string s,t;
void MAIN() {
cin>>n;
map<ll,ll,greater<ll>> cnt;
for(ll i=0;i<n;i++) {
cin>>x;
cnt[x]++;
}
ll len = -1, bre = -1;
for(auto it : cnt) {
if(it.s > 1) {
if(len == -1) {
len = it.f;
it.s -=2;
}
else if(bre == -1) {
bre = it.f;
it.s -=2;
break;
}
if(it.s > 1 && bre == -1) {
bre = it.f;
break;
}
}
}
if(len == -1 || bre == -1) cout<<0;
else cout<<len*bre;
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
| 0
| 48,379,201
|
#include "bits/stdc++.h"
using namespace std;
struct Solver {
Solver() {
ios::sync_with_stdio( false );
}
void solve() {
int N, K;
string S;
cin >> N >> S >> K;
for( int i = 0; i < N; ++i ) {
if( S[i] == S[K-1] ) {
cout << S[i];
}
else {
cout << '*';
}
}
cout << endl;
}
};
int main() {
Solver().solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int tc; cin>>tc; while(tc--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
int n, s1= 0, s2=0;
cin>> n;
int a[n];
for(int i=0; i<n; i++)
cin>> a[i];
for(int i=n-1, j=0; i>=j; )
{
if( s1< s2)
{
s1+= a[i];
i--;
}
else
{
s2+= a[j];
j++;
}
}
cout << abs( s2-s1);
return 0;
}
| 0
| 24,363,424
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.