code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <iostream>
#include <algorithm>
#include <map>
#include <functional>
#define fi first
#define sec second
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin >> n >> m,n||m){
P p[10000];
for(int i = 0; i < n; i++) cin >> p[i].sec >> p[i].fi;
sort(p,p+n,greater<P>());
for(int i = 0; i < n; i++){
if(p[i].sec >= m){
p[i].sec -= m;
break;
}
m -= p[i].sec;
p[i].sec = 0;
}
int ans = 0;
for(int i = 0; i < n; i++) ans += p[i].fi*p[i].sec;
cout << ans << endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
using namespace std;
void play(string str){
string mas[]={"x",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int lng = 0;
for(int i = 0; i < str.size() ; i++){
if(str[i] == '0'){
if(lng!=0){
cout << mas[str[i-1]-'0'][(lng-1)%mas[str[i-1]-'0'].size()];
lng = 0;
}
}
else lng++;
}
cout << endl;
}
main(){
int t;
string str;
cin >> t;
while(t--){
cin >> str;
play(str);
}
#ifdef GEREL
for(;;);
#endif
return 0;
}
| 0
| 21,811,271
|
#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 x;
cin >> x;
int ans = 8-(x-400)/200;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define mset(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
int a[N];
int vis[N];
ll f[N];
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv(ll b){return qpow(b,mod-2);}
void init() {
f[0] = 1;
for (int i = 1; i <= 100005; i++) {
f[i] = (f[i - 1] * i) % mod;
}
}
ll C(int x, int y) {
return f[x] * inv(f[y]) % mod * inv(f[x - y]) % mod;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
init();
int n;
cin >> n;
int Index1, Index2;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
if (vis[a[i]]) {
Index1 = vis[a[i]] - 1;
Index2 = i;
}
vis[a[i]] = i;
}
ll t1, t2;
for (int i = 1; i <= n + 1; i++) {
t1= C(n + 1, i) % mod;
if (n + 1 - Index2 + Index1 >= i - 1) {
t2 = C(n + 1 - Index2 + Index1, i - 1) % mod;
} else {
t2 = 0;
}
cout << (t1 - t2 + mod) % mod << "\n";
}
return 0;
}
| 0
| 62,222,287
|
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
int main(void)
{
string str, ans[100], p, ex;
int a, b, q, cou = 0;
char c;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> ex;
cin >> a >> b;
if (ex == "print") {
ans[cou] = str.substr(a, (b - a) + 1);
cou++;
}
if (ex == "reverse") {
for (int j = 0; j < (b - a + 1) / 2; j++) {
c = str[a + j]; str[a + j] = str[b - j]; str[b - j] = c;
}
}
if (ex == "replace") {
cin >> p;
str = str.replace(a, (b - a) + 1, p);
}
}
for (int i = 0; i < cou; i++) {
cout << ans[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m,a,b; cin >> n >> m;
ll x=0,acum=0;
map <ll,ll> mp;
while (n){
n--; cin >> a >> b;
mp[a] += b;
}
for (auto it=mp.begin() ; it!=mp.end() ; it++){
ll p=it->first;
if (acum+mp[p] >= m){
x += (m-acum)*p; break;
}
else{
x += p*mp[p];
acum += mp[p];
}
}
cout << x << endl;
return 0;
}
| 0
| 7,843,948
|
#include <iostream>
using namespace std;
int main()
{
int num;
while( cin >> num ) {
if (num == 0 )
break;
long int tmpsum = 0;
long int currnum;
long int maxnum = -999999999;
for( int i = 0; i < num; i++ ) {
cin >> currnum;
if( currnum + tmpsum > maxnum ) {
maxnum = currnum + tmpsum;
}
if( currnum + tmpsum > 0 )
tmpsum += currnum;
else
tmpsum = 0;
}
cout << maxnum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
string s;
cin >> s;
char alph[26] = {0};
rep(i, s.size())
{
int d;
d = s[i] - 'a';
alph[d]++;
}
rep(i, 26)
{
if (alph[i] == 0)
{
char out = i + 'a';
cout << out << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
| 0
| 11,791,046
|
#include <stdio.h>
#include <string.h>
int main(){
char a[15];
char b[15];
char c [15];
scanf("%s%s%s", a,b,c);
int d= strlen(a)-1;
int e = strlen(b)-1;
if (a[d]==b[0] && b[e]==c[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define MOD 1000000007
using namespace std;
int main(){
int H, W, M; cin >> H >> W >> M;
int rows[H] = {0};
int cols[W] = {0};
set<pair<int,int>> seen;
for(int i = 0; i < M; i++){
int h,w;
cin >> h >> w;
rows[h-1]++;
cols[w-1]++;
seen.insert(pair<int,int> (h-1, w-1));
}
int rowMax = *max_element(rows, rows+H);
int colMax = *max_element(cols, cols+W);
vector<int> rowMaxes;
vector<int> colMaxes;
for(int i = 0; i < H; i++){
if(rows[i] == rowMax) rowMaxes.push_back(i);
}
for(int i = 0; i < W; i++){
if(cols[i] == colMax) colMaxes.push_back(i);
}
bool overlap = true;
for(auto i = rowMaxes.begin(); i != rowMaxes.end() && overlap; i++){
FOREACH(j, colMaxes){
if(seen.find(pair<int, int>(*i,*j)) == seen.end()){ overlap = false; break;}
}
}
if(overlap) cout <<rowMax + colMax -1 << endl;
else cout << rowMax + colMax;
}
| 0
| 43,776,936
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) * y;
}
int main() {
int N;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++)
{
cin >> a[i];
}
for (int i = N - 1; i >= 0; i -= 2)
{
cout << a[i] << " ";
}
if (N % 2 == 1)
{
for (int i = 1; i < N; i += 2)
{
cout << a[i] << " ";
}
}else
{
for (int i = 0; i < N; i += 2)
{
cout << a[i] << " ";
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
string b;
int cnt = 0;
cin >> s;
cin >> b;
rep(i, s.size()) {
if(s[i] != b[i]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 64,025,171
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
string s;
cin >> s;
ll n = s.size() + 1;
vector<ll> ans(n,0);
for (ll i = 0; i < n;i++){
if (s[i] == '<') chmax(ans[i + 1], ans[i] + 1);
}
for (ll i = n - 2; i > -1;i--){
if (s[i] == '>') chmax(ans[i], ans[i + 1] + 1);
}
ll mini = *min_element(ans.begin(), ans.end());
for (ll i = 0; i < n; i++) {
ans[i] -= mini;
}
ll res = 0;
for (ll i = 0; i < n; i++) res += ans[i];
cout << res << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>a(N);
map<int,int>Map;
for(int i = 0; i < N; i++) {
cin >> a[i];
Map[a[i]]++;
}
int ans = 0;
for(auto x:Map) {
int X = x.first;
int Y = x.second;
if(X <= Y) {
ans+=(Y-X);
}
else {
ans+=Y;
}
}
cout << ans << endl;
}
| 0
| 37,877,484
|
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
signed main(){
int n;
string s;
while(1){
int l=0,r=0,ans=0,pre=0;
cin>>n;
if(n==0) break;
rep(i,0,n){
cin>>s;
if(s=="lu") l=1;
if(s=="ru") r=1;
if(s=="ld") l=0;
if(s=="rd") r=0;
if(l==r && l!=pre){
ans++;
pre=l;
}
}
o(ans);
}
}
|
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
class debug
{
public:
template<typename T> void vdeb(T vec);
template<typename T1, typename T2> void adeb(T1 *arr, T2 n);
template<typename T> void mdeb(T mp);
};
#endif
template<typename T> void debug::vdeb(T vec)
{
cout << "#vector set debug" << endl;
for(auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T1, typename T2> void debug::adeb(T1 *arr, T2 n)
{
cout << "#adebug" << endl;
for(int i=0; i<=n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T> void debug::mdeb(T mp)
{
cout << "#map pair debug" << endl;
for(auto const& m : mp) cout << m.first sp m.second << endl;
}
debug dbg;
class BAcrostic {
public:
void solve(std::istream& in, std::ostream& out)
{
string s;
int w;
in >> s >> w;
string res = "";
for(int i=0; i<s.length(); i++){
if(i%w == 0) res += s[i];
}
out << res << endl;
}
};
int main() {
BAcrostic solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 51,610,610
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
const ll MAX = 200010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,c,k;
cin >> n >> c >> k;
vector<ll> t(n);
cins(all(t));
SORT(t);
ll cnt = 0,l = t[0],ans = 1;
rep(i,n){
if (cnt < c && l <= t[i] && t[i] <= l+k){
cnt++;
}
else{
cnt = 1;
l = t[i];
ans++;
}
}
PRINT(ans);
}
|
#pragma GCC optimize ("-O2")
#define _CRT_SECURE_NO_WARNINGS 1
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
using namespace std :: chrono;
#define scu(n) scanf("%u",&n)
#define scl(n) scanf("%d",&n)
#define scll(n) scanf("%lld",&n)
#define sz(a) (int)a.size()
#define maxN 10000005
#define uu first
#define vv second
#define ll long long
#define U unsigned
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define Pi acos(-1.0)
#define endl "\n"
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define EPS 1e-9
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define TEST int tc;cin>>tc; while(tc--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define pb push_back
#define eb emplace_back
#define ALL(v) v.begin(),v.end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c),0)
#define For(i,a,b) for(ll i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define fr(i,n) for(int i=0;i<n;i++)
#define open freopen("input.txt","r",stdin);
#define close freopen("output.txt","w",stdout);
#define deb(a) cout << #a << " : " << a << " ";
#define debln(a) cout<< #a <<" : " << a << endl;
#define print(v) for(auto x : v) { cout<<x<<" "; } cout<<endl;
#define PRINT(v) for(auto x : v) { cout<<x.uu<<" "<<x.vv<<endl;}
void solve()
{
int k,a,b;
cin>>k;
cin>>a>>b;
for(int i=a; i<=b; ++i)
{
if(i%k==0)
{
puts("OK");
return;
}
}
puts("NG");
}
int main()
{
solve();
return 0;
}
| 0
| 71,620,904
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, D; cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D, 0));
for (int i = 0; i < N; i++) for (int j = 0; j < D; j++) cin >> X[i][j];
int cnt = 0; double x = 1.0;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
double M = 0.0;
for (int k = 0; k < D; ++k) {
M += pow(X[i][k] - X[j][k], 2);
}
if (modf(sqrt(M), &x) == 0) cnt++;
}
}
printf("%d\n", cnt);
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const int INF = (1 << 30);
const i64 INFL = (1LL << 62);
const i64 MOD = 1000000007;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
i64 mod_pow(i64 a, i64 n, T mod) {
mod = (i64)mod;
i64 res = 1, p = a % mod;
while (n) {
if (n & 1) res = res * p % mod;
p = p * p % mod;
n >>= 1;
}
return res;
}
void print() { std::cout << std::endl; }
template <typename T, typename... A>
void print(const T& first, const A&... rest) {
cout << sizeof...(rest) << endl;
std::cout << first;
if (sizeof...(rest)) std::cout << " ";
print(rest...);
}
template <typename... A>
void print(const A&... rest) {
print(rest...);
}
template <typename A>
void print(const std::vector<A>& v) {
std::for_each(v.begin(), v.end(), [](A x) { std::cout << x << " "; });
std::cout << std::endl;
}
i64 bit[50];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
i64 n, k;
cin >> n >> k;
vector<i64> a(n);
rep(i, n) cin >> a[i];
vector<i64> s(n + 1, 0);
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + a[i];
}
vector<i64> cands;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
cands.push_back(s[j + 1] - s[i]);
}
}
for (int i = 49; i >= 0; --i) {
vector<i64> cands2;
for (auto& c : cands) {
if (c & (1LL << i)) {
cands2.push_back(c);
}
}
if ((i64)cands2.size() >= k) {
cands = move(cands2);
}
}
i64 ans =
accumulate(all(cands), cands[0], [](i64 acc, i64 i) { return acc & i; });
cout << ans << endl;
return 0;
}
| 0
| 1,217,780
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <typename T> bool chmax(T &a, const T &b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, const T &b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const long long MOD = 1e9 + 7;
int main() {
ll N, ans = 0;
cin >> N;
if(N % 2 == 1) {
cout << 0 << endl;
} else {
ll den = 10;
while(N >= den) {
ans += N / den;
den *= 5;
}
cout << ans << endl;
}
}
|
#include<stdio.h>
int main(){
int N;
int R;
int K;
scanf("%d %d",&N,&R);
getchar();
if(N<10){
printf("%d",100 * (10-N) + R);
}
else if (N>=10){
printf("%d",R);
}
return 0;
}
| 0
| 57,563,649
|
#include <iostream>
#include <iterator>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[])
{
int n;
ll d, a;
cin >> n >> d >> a;
vector<pair<ll, ll>> monsters(n);
for (auto &m : monsters) {
cin >> m.first >> m.second;
}
sort(monsters.begin(), monsters.end());
ll ans = 0;
ll c_damage = 0;
vector<ll> expire(n, 0);
for (int i = 0; i < monsters.size(); i++) {
c_damage -= expire[i];
monsters[i].second = max(monsters[i].second - c_damage, 0ll);
auto right_it = upper_bound(monsters.begin(), monsters.end(),
monsters[i].first + 2 * d,
[](int r, auto &monster) { return monster.first > r; });
int right_idx = distance(monsters.begin(), right_it);
ll use_times = (monsters[i].second + a - 1) / a;
ll damage = use_times * a;
c_damage += damage;
ans += use_times;
if (right_it != monsters.end()) {
expire[right_idx] += damage;
}
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int c[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[5010][10010];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int A[10];
rep(i, 5010) rep(j, 10010) dp[i][j] = -INF;
dp[0][N] = 0;
rep(i, M) cin >> A[i];
sort(A, A + M, greater<int>());
for(int i = 0; i < N/2; i++) {
for(int k = 10000; k >= 0; k--) {
for(int j = 0; j < M; j++) {
dp[i + 1][k] = max(dp[i + 1][k], dp[i][k]);
int cost = k - c[A[j]];
if(cost >= 0) {
dp[i + 1][cost] = max(dp[i + 1][cost], dp[i][k] + 1);
}
}
}
}
string T;
int num = 0;
for(int i = N/2; i > 0; i--) {
for(int j = 0; j < M; j++) {
if(dp[i][num] == dp[i - 1][num + c[A[j]]] + 1) {
num += c[A[j]];
T += (char)('0' + A[j]);
break;
}
}
}
cout << T << endl;
return 0;
}
| 0
| 76,924,306
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int main() {
string s;
int i, len, flag = true;
cin >> s;
len = s.length();
for (i = 0; i < len; i++)
if (s[i] != s[len - i - 1]) flag = false;
for (i = 0; i < (len - 1) / 2; i++)
if (s[i] != s[(len - 1) / 2 - i - 1]) flag = false;
for (i = (len + 3) / 2; i < len; i++)
if (s[i] != s[len - i - 1]) flag = false;
cout << ((flag) ? "Yes" : "No") << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <limits>
using namespace std;
#define ll long long int
#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++)
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
int main(){
string s,t; cin >> s >> t;
int sz = s.size(),tz = t.size();
if(sz < tz){cout << "UNRESTORABLE" << endl; return 0;}
int i;
bool ok = false;
for(i = sz-1; i >= 0; --i){
int k = tz-1;
while(k >= 0){
int a = i-(tz-1-k);
if(a<0) break;
if(s[a] == '?' || s[a] == t[k]) {
k--;
if(k==-1) {ok = true; break;}
}else break;
}
if(ok) {
rep(j,i-tz+1){
if(s[j] == '?') s[j] = 'a';
}
for(int j = i+1; j < sz; j++) if(s[j] == '?') s[j] = 'a';
break;
}
}
if(ok) {
rep(j, i-tz+1) cout << s[j];
cout << t;
for(int j = i+1; j < sz; ++j) cout << s[j];
}else cout << "UNRESTORABLE" << endl;
}
| 0
| 76,898,171
|
#include <iostream>
#include <cstdint>
using namespace std;
int main() {
int64_t n, k; cin >> n >> k;
int64_t ans = 0;
while (k <= n + 1) {
int64_t min = k * (k - 1) / 2;
int64_t max = k * (2 * n - k + 1) / 2;
ans = (ans + (max - min + 1)) % 1000000007;
++k;
}
cout << ans << endl;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define ll long long
#define loop(i,n) for(int i=0; i<n; i++)
#define loop1(i,n) for(int i=1; i<=n; i++)
#define loopi(i,s,e) for(int i=s; i < e; i++)
#define loopiRev(i,s,e) for(int i=s; i >= e; i--)
#define PI 3.14159265359
#define x first
#define y second
#define point pair<double,double>
#define len(s) (int)s.length()
#define sz(v) (int)v.size()
#define all(a) a.begin(),a.end()
#define clr(x, val) memset((x), (val), sizeof(x))
void initialize(vector<int> &F, int n){
F = vector<int> (n+1, 0);
for(int i=2; i*i <= n; i++){
if(F[i] == 0)
for(int k=i*i; k <=n ; k+= i)
if(F[k] == 0) F[k] = i;
}
}
int l,n;
vector<int> cuts;
ll dp[1100][1100];
ll solve(int i, int j){
ll &ret= dp[i][j];
if(ret != -1)
return ret;
int cur= lower_bound(cuts.begin(), cuts.end(), i+1) - cuts.begin();
if(cur == cuts.size() || cuts[cur] >= j)
return ret= 0;
ret= 10000000;
while(cur < n && cuts[cur] < j){
ret = min(ret, solve(i, cuts[cur]) + solve(cuts[cur], j) + j - i);
cur++;
}
return ret;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n,t; cin>>n>>t;
vector<int> times(n);
loop(i, n) cin>>times[i];
int total=t;
loop1(i, n-1){
if(times[i] - times[i-1] < t)
total+= times[i]-times[i-1];
else
total+= t;
}
cout<<total;
}
| 0
| 22,029,428
|
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
using ll = long long;
using db = long double;
using st = string;
using ch = char;
using bl = bool;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using vbl = V<bl>;
using graph = V<V<int>>;
using pq = priority_queue<ll>;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rFOR(i,a,b) for(ll i=(a);i>=(b);i--)
#define oFOR(i,a,b) for(ll i=(a);i<(b);i+=2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn,(a).en)
#define REV(a) reverse((a).bgn,(a).en)
#define M(a,b) max(a,b)
#define rM(a,b) min(a,b)
#define fi first
#define se second
#define sz size()
#define gcd(a,b) __gcd(a,b)
#define co(a) cout<<a<<endl;
#define pb(a) push_back(a);
ll Sum(ll n) {
ll m=0;
while(n){
m+=n%10;
n/=10;
}
return m;
}
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void Comuse() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
#define comuse Comuse()
ll combi(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll perm(int n,int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * (finv[k] % MOD) % MOD;
}
ll lcm(ll a,ll b){
ll n;
n=a/gcd(a,b)*b;
return n;
}
vll div(ll n){
vll 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(ret);
return (ret);
}
ll modpow(ll a,ll n,ll mod){
ll ans=1;
while(n>0){
if(n&1){
ans=ans*a%mod;
}
a=a*a%mod;
n>>=1;
}
return ans;
}
void Solve();
const int MAX_N = 131072;
int NN;
int seg[MAX_N*2-1];
void seguse(){
for(int i=0;i<2*NN-1;i++){
seg[i]=INT_MAX;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<setprecision(20)<<fixed;
Solve();
}
void Solve(){
ll n,m;
cin>>n>>m;
vll A(n);
ll now=1;
ll past=0;
ll mo=0;
ll le=1000000;
FOR(i,0,n){
cin>>A[i];
now=lcm(now,A[i]/2);
past=gcd(past,A[i]/2);
if(now>m){
cout<<"0\n";
return;
}
ll is=A[i];
ll count=0;
while(is%2==0){
is/=2;
count++;
}
chmin(le,count);
chmax(mo,count);
}
ll ans=m/now;
ans=(ans+1)/2;
if(now%past!=0){
cout<<"0\n";
return;
}
if(le!=mo){
cout<<"0\n";
return;
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
int H, W, M;
set<i_i> st;
void input() {
cin >> H >> W >> M;
for(int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
st.insert({a, b});
}
}
void solve() {
map<int, int> mph, mpw;
int hmaxval = 0;
int wmaxval = 0;
vector<int> hmax, wmax;
for(auto tmp : st) {
chmax(hmaxval, ++mph[tmp.first]);
chmax(wmaxval, ++mpw[tmp.second]);
}
for(auto tmp : mph) {
if(hmaxval == tmp.second) hmax.push_back(tmp.first);
}
for(auto tmp : mpw) {
if(wmaxval == tmp.second) wmax.push_back(tmp.first);
}
int ANS = hmaxval + wmaxval - 1;
for(auto h : hmax) {
for(auto w : wmax) {
if(st.find({h, w}) == st.end()) {
ANS++;
cout << ANS << endl;
return;
}
}
}
cout << ANS << endl;
}
int main() {
input();
solve();
return 0;
}
| 0
| 78,193,240
|
#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>;
const int inf{int(1e9)};
ll a(int i){
if (i == 0) return 1;
else return 2 * a(i - 1) + 3;
}
ll p(int i){
if (i == 0) return 1;
else return 2 * p(i - 1) + 1;
}
ll f(int N, ll X){
if (N == 0) return 1;
else if (X == 1) return 0;
else if (X <= 1 + a(N - 1)) return f(N - 1, X - 1);
else if (X == 2 + a(N - 1)) return p(N - 1) + 1;
else if (X <= 2 + 2 * a(N - 1)){
return p(N - 1) + 1 + f(N - 1, X - 2 - a(N - 1));
}else return 2 * p(N - 1) + 1;
}
int main(void){
ll N, X;
cin >> N >> X;
cout << f(N, X) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n, x;
int main(int argc, char const *argv[]) {
cin >> n >> x;
int f = 0;
long long sum = n;
n -= x;
while(x){
if(n%x==0)sum+=n*2-x;
else sum += (n/x)*x*2;
long long t = x;
x = n%x;
n = t;
}
cout << sum;
return 0;
}
| 0
| 37,753,885
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
faster;
int x,y;
cin >> x >> y;
if(y % x == 0 && (y/x == 2 || y/x == 4)){
cout << "Yes";
}else {
bool flag = false;
for(int i = 1; i < x; i++){
if(i * 2 + (x-i) * 4 == y) {
flag = true;
break;
}
}
cout << (flag ? "Yes" : "No");
}
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
unsigned int k,a,b,sign=0,i;
cin>>k>>a>>b;
for(i=a/k;k*i<=b;i++){
if(k*i>=a && k*i<=b){
sign=1;
break;
}
}
if(sign==1) cout<<"OK"<<endl;
else cout<<"NG"<<endl;
return 0;
}
| 0
| 99,621,798
|
#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
int main(){
priority_queue<int> pq;
map<int,int> mp;
pair<ll,int>p[100010];
int N,K;cin>>N>>K;
int t;
ll d;
for(int i=0;i<N;i++){
cin>>t>>d;
p[i]={-d,t};
}
sort(p,p+N);
ll sum=0,kind=0;
for(int i=0;i<K;i++){
sum-=p[i].first;
mp[p[i].second]++;
if(mp[p[i].second]==1)kind++;
}
for(int i=0;i<K;i++)
if(mp[p[i].second]>=2)pq.push(i);
sum+=(ll)pow(kind,2);
ll ans=sum;
int i=K;
while(!pq.empty() && i<N){
if(mp[p[i].second]==0){
int m=pq.top();
ll k=kind;
while(mp[p[m].second]==1){
pq.pop();
if(pq.empty()){
cout<<ans<<endl;
return 0;
}
m=pq.top();
}
kind++;
sum+=(ll)pow(kind,2)-(ll)pow(k,2)+p[m].first-p[i].first;
ans=max(ans,sum);
mp[p[i].second]++;
mp[p[m].second]--;
pq.pop();
}
i++;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, n;
bool m[105];
for (bool &i : m) i = true;
cin >> x >> n;
for (int i = 1; i <= n; ++i) {
int p;
cin >> p;
m[p] = false;
}
for (int i = 0; i < n + 1; ++i) {
if (m[x - i]) {
cout << x - i << endl;
return 0;
}
if (m[x + i]) {
cout << x + i << endl;
return 0;
}
}
}
| 0
| 34,306,617
|
#include <iostream>
using namespace std;
#define MOD 1000000007
main(){
long long n,k,ans;
string s;
cin>>n>>s;
k = 0;
ans = 1;
for(int i=0;i<2*n;i++){
if(i > 0 && i <= n)
ans *= i;
ans %= MOD;
if(s[i] == 'B')
if(k%2 == 0)
k++;
else
ans *= k--;
else
if(k == 0)
k = MOD;
else if(k%2 == 0)
ans *= k--;
else
k++;
ans %= MOD;
}
if(k != 0)
ans = 0;
cout<<ans;
}
|
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
int n, K;
cin >> n >> K;
int a[n];
ll b[n];
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
ll ret = 0;
for (int i = 0; i < 30; i++) {
int k = 0;
if (i) {
if (!(K & 1 << i)) continue;
for (int j = i + 1; j < 30; j++) if (K & (1 << j)) k += (1 << j);
for (int j = 0; j < i; j++) k += (1 << j);
} else {
k = K;
}
ll ans = 0;
for (int j = 0; j < n; j++) {
bool flag = true;
for (int l = 0; l < 30; l++) {
if ((a[j] & 1 << l) && !(k & 1 << l)) flag = false;
}
if (flag) ans += b[j];
}
ret = max(ret, ans);
}
cout << ret << '\n';
return 0;
}
| 0
| 43,861,269
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int arr[3];
for (int i = 0; i < 3; i++) {
std::cin >> arr[i];
}
sort(arr,arr+3);
cout<<arr[0]+arr[1]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b){
ll res=1;
a%=mod;
while(b){
if(b%2) res=res*a%mod;
a=a*a%mod;
b/=2;
}
return res;
}
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
void solve(){
ll n,m,L=1;
cin>>n>>m;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
a[i]/=2;
L=lcm(L,a[i]);
}
for(int i=0;i<n;i++)
if(L/a[i]%2==0){
cout<<0<<endl;
return;
}
cout<<m/(2*L)+(m%(2*L)>=L ? 1 : 0)<<endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
| 0
| 55,252,969
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
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 Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
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 modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll INF=1e16;
ll n,m,R;
cin>>n>>m>>R;
vector<ll> r(R);
rep(i,R) cin>>r[i],r[i]--;
vector<vector<ll>> v(n,vector<ll>(n,INF));
rep(i,n) rep(j,n) if(i==j) v[i][j]=0;
rep(i,m){
ll a,b,c;cin>>a>>b>>c;a--;b--;
v[a][b]=c;
v[b][a]=c;
}
rep(k,n) rep(i,n) rep(j,n) chmin(v[i][j],v[i][k]+v[k][j]);
vector<ll> p;
rep(i,R) p.push_back(r[i]);
sort(ALL(p));
ll ans=INF;
do{
ll tmp=0;
rep(i,R-1) tmp+=v[p[i]][p[i+1]];
chmin(ans,tmp);
}while(next_permutation(ALL(p)));
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)x
const int MOD = 1e9 + 7;
const int INF = 2e9;
const int N = 1e3 + 5;
int R, C;
int dp[N][N];
char grid[N][N];
int add(int x, int y) {
return ((x % MOD) + (y % MOD)) % MOD;
}
bool inside(int r, int c) {
return r >= 1 && r <= R && c >= 1 && c <= C;
}
int f(int r, int c) {
if(grid[r][c] == '#') return 0;
if(!inside(r, c)) return 0;
if(r == R && c == C) return 1;
int &sol = dp[r][c];
if(sol != -1) return sol;
return sol = add(f(r + 1, c), f(r, c + 1));
}
void solve() {
cin >> R >> C;
for(int i = 1; i <= R; i++) {
for(int j = 1; j <= C; j++) {
cin >> grid[i][j];
}
}
memset(dp, -1, sizeof(dp));
cout << f(1, 1) % MOD << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
}
| 0
| 84,212,863
|
#include <iostream>
using namespace std;
int main(){
int min,max,n,i;
int *data;
long sum;
cin>>n;
data= new int[n];
for (i=0;i<n;i++)cin>>data[i];
min=data[0];max=data[0];sum=data[0];
for (i=1;i<n;i++){
sum+=data[i];
if (min>data[i])min=data[i];
else if (max<data[i])max=data[i];
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> array(n);
for(int i=0;i<n;i++){
cin >> array.at(i).first >> array.at(i).second;
}
sort(array.begin(),array.end());
ll money = 0;
for(int i=0;i<n;i++){
if(m <= array.at(i).second){
money += array.at(i).first * m;
break;
}else{
money += array.at(i).first * array.at(i).second;
m -= array.at(i).second;
}
}
cout << money << endl;
}
| 0
| 487,358
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << var << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int h, w; scanf("%d%d", &h, &w);
if (h > w) swap(h, w);
long long ans = 2e18;
for (long long i = 1; i < h; ++i) {
long long a = i*w;
long long b = (h-i)*(w/2);
long long c = (h-i)*(w/2+w%2);
ans = min(ans, max({a, b, c})-min({a, b, c}));
b = ((h-i)/2)*w;
c = ((h-i)/2+(h-i)%2)*w;
ans = min(ans, max({a, b, c})-min({a, b, c}));
}
for (long long i = 1; i < w; ++i) {
long long a = i*h;
long long b = (w-i)*(h/2);
long long c = (w-i)*(h/2+h%2);
ans = min(ans, max({a, b, c})-min({a, b, c}));
b = ((w-i)/2)*h;
c = ((w-i)/2+(w-i)%2)*h;
ans = min(ans, max({a, b, c})-min({a, b, c}));
}
printf("%lld", ans);
}
int main() {
init();
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
using ll = long long;
int main()
{
int n,a,b;
cin >> n >> a >> b;
int count[3] = {};
for(int i = 0;i < n;i++)
{
int p;
cin >> p;
if(p <= a)
{
count[0]++;
}
else if(p > b)
{
count[1]++;
}
else
{
count[2]++;
}
}
int ans = 100000;
for(int i = 0;i < 3;i++)
{
ans = min(ans,count[i]);
}
cout << ans << "\n";
return 0;
}
| 0
| 87,983,895
|
#include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>b;i--)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define Vout(a) rep(i,0,a.size()-1)cout<<a[i]<<' ';cout<<a[a.size()-1]<<endl;
#define INF 9000000000000000000
#define MOD 1000000007
using namespace std;
int f(int n){int s=0;while(n!=0){s+=n%10;n/=10;}return s;}
signed main() {
cout << fixed << setprecision(15);
int n;
cin >> n;
int ct=1;
Vi a(n);
int ans = 0;
rep(i,0,n) cin >> a[i];
rep(i,0,n-1){
if(a[i]==a[i+1]) {
ct++;
continue;
}
else{
ans += ct/2;
ct=1;
}
}
ans += ct/2;
cout << ans << endl;
return 0;
}
|
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::cpp_int;
using md = boost::multiprecision::cpp_dec_float_100;
#define forir(i, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,1)
#define eachr(i, e, c) forir(i, auto &&e: adaptors::reverse(c))
#endif
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
#define all(c) (c).begin(), (c).end()
#define coutld cout << fixed << setprecision(10)
#define output(x) do{cout<<x<<endl;exit(0);}while(0)
#define rep(i, b, e) for (ll i = b; i < e; i++)
#define repr(i, b, e) for (ll i = b; e < i; i--)
#define fori(i, ...) if (ll i = -1) for(__VA_ARGS__) if (i++, 1)
#define each(i, e, c) fori (i, auto&& e: c)
#define llong_max 9223372036854775807
#define ldbl_max 1.79769e+308
#define pi 3.1415926535897932
auto Ceil = []
(auto x) { return (ll)ceil(x); };
auto Count = []
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = []
(auto c) { return (ll)c - (ll)'0'; };
auto LtoC = []
(auto n) { return (char)('0' + n); };
auto Pow = []
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = []
(auto n) { return (1LL << n); };
auto Pow10 = []
(auto n) { return (ll)pow(10, n); };
auto Size = []
(auto& c) { return (ll)(c).size(); };
auto Sum = []
(auto b, auto e) { return accumulate(b, e, 0LL); };
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{
v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{
v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{
v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{
MakeVVT(ys, xs, v, fix);
rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{
v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
namespace NyaGadget {}
using namespace NyaGadget;
int main(void)
{
ll M; cin >> M;
vt<pll> dc(M); each(i, e, dc) cin >> e.first >> e.second;
ll sum = 0;
ll keta = 0;
each(i, e, dc)
{
sum += e.first * e.second;
keta += e.second;
}
cout << (sum - 1) / 9 + keta - 1;
return 0;
}
| 0
| 87,974,004
|
#include <algorithm>
#include <cstdio>
#include <map>
int n;
struct point{
long long D;
int id;
}num[100001];
std::map<long long,int>map;
int size[100001],fa[100001],dep[100001];
bool cmp(const point &a,const point &b){return a.D>b.D;}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lld",&num[i].D),num[i].id=map[num[i].D]=i,size[i]=1;
std::sort(num+1,num+n+1,cmp);
for(int i=1;i<n;i++)
if(!(fa[i]=map[num[i].D+(size[num[i].id])-(n-size[num[i].id])])||(fa[i]==num[i].id))
{puts("-1");return 0;}
else size[fa[i]]+=size[num[i].id];
for(int i=n-1;i;i--)num[n].D-=(dep[num[i].id]=dep[fa[i]]+1);
if(num[n].D){puts("-1");return 0;}
for(int i=1;i<n;i++)printf("%d %d\n",fa[i],num[i].id);
}
|
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
int n;
int x[1<<18];
int dp[18][1<<18];
int ans[18][1<<18];
int getdp(int lb, int dat)
{
if(lb == -1) return x[dat];
int& ret = dp[lb][dat];
if(~ret) return ret;
if((1 << lb) & dat)
{
ret = std::max(getdp(lb-1, dat), getdp(lb-1, dat-(1<<lb)));
}
else
{
ret = getdp(lb-1, dat);
}
return ret;
}
int chk(int lb, int dat)
{
if(lb == -1) return 0;
int& ret = ans[lb][dat];
if(~ret) return ret;
ret = 0;
if((1 << lb) & dat)
{
ret = std::max(chk(lb-1, dat), getdp(lb-1, dat)+getdp(lb-1, dat-(1<<lb)));
}
else
{
ret = chk(lb-1, dat);
}
return ret;
}
int main()
{
scanf("%d", &n);
for(int i=0;i<(1<<n);i++)
{
scanf("%d", &x[i]);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<(1<<n);j++)
{
ans[i][j] = dp[i][j] = -1;
}
}
int prev = 0;
for(int i=1;i<(1<<n);i++)
{
prev = std::max(prev, chk(n-1, i));
printf("%d\n", prev);
}
}
| 0
| 809,253
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d)
cout << "Left" << "\n";
else if (a + b < c + d)
cout << "Right" << "\n";
else
cout << "Balanced" << "\n";
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define rint register int
#define INF ((1 << 30) - 1)
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define Pair pair < int, int >
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i, k, j) for(rint i = (k); i >= (j); i--)
#define For(i, k, j) for(rint i = (k); i <= (j); i++)
#define Foe(i, u) for(rint i = lst[u], v = e[i].v; i; i = e[i].nxt, v = e[i].v)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout)
#define ull unsigned ll
const int P = 998244353;
using namespace std;
inline void ckmax(int &a, int b) {a = max(a, b);}
inline void ckmin(int &a, int b) {a = min(a, b);}
inline void mulmod(int &a, int b) {a = 1ll * a * b % P;}
inline void addmod(int &a, int b) {int t = a + b; a = (t >= P ? t - P : t); }
inline int ksm(int a, int b) {int ans=1; for(;b;b>>=1) {if(b&1) ans=1ll*ans*a%P;a=1ll*a*a%P;}return ans;}
inline int inv(int a) {return ksm(a, P-2);}
inline void printarray(int *a, int n) {For(i, 1, n) fprintf(stderr, "%d ", a[i]); fprintf(stderr, "\n");}
namespace FastIO {
const int SIZE=1<<16; char buf[SIZE], obuf[SIZE], str[64]; int bi=SIZE, bn=SIZE, opt;
int read(char *s) {
while (bn) {for (;bi<bn&&buf[bi]<=' ';bi++);if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}
int sn=0;while (bn) {for (;bi<bn&&buf[bi]>' ';bi++) s[sn++]=buf[bi];if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}s[sn]=0;return sn;
}
bool read(int& x) {if(x)x=0;int bf=0,n=read(str); if(!n) return 0; int i=0; if (str[i]=='-') bf=1,i=1; for(x=0;i<n;i++) x=x*10+str[i]-'0'; if(bf) x=-x; return 1;}
void write(int x) {
if(!x) obuf[opt++] = '0'; else {if(x<0) obuf[opt++]='-',x=-x;int sn=0; while(x)str[sn++]=x%10+'0',x/=10;for (int i=sn-1;i>=0;i--) obuf[opt++]=str[i];}
if (opt>=(SIZE>>1)){fwrite(obuf, 1, opt, stdout); opt=0;}
}
void write(char x) {obuf[opt++]=x;if (opt>=(SIZE>>1)){fwrite(obuf, 1, opt, stdout); opt=0;}}
void Fflush() { if (opt) fwrite(obuf, 1, opt, stdout); opt=0;}
};
inline int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
signed main()
{
#ifndef ONLINE_JUDGE
file("pro");
#endif
int x; cin >> x;
cout << 360 / gcd(x, 360) << endl;
return FastIO::Fflush(), 0;
}
| 0
| 98,516,500
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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; }
signed main(){
ll n; cin>>n;
map<ll,ll> a,b;
rep(i,1,n+1){
ll m; cin>>m;
if(i%2==0){
a[m]++;
}
else{
b[m]++;
}
}
vector<pair<ll,ll>> q(n),p(n);
for(auto c:a) q.push_back(make_pair(c.second,c.first));
for(auto c:b) p.push_back(make_pair(c.second,c.first));
sort(all(p)); reverse(all(p));
sort(all(q)); reverse(all(q));
ll x,y;
ll ans=n;
rep(i,0,q.size()){
if(i==2)break;
rep(j,0,p.size()){
if(j==2)break;
if(q[i].second!=p[j].second){
chmin(ans,n-q[i].first-p[j].first);
}
}
}
if(ans==n)ans/=2;
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int mod=1e9+7;
const int MOD=998244353;
int gcd(int a,int b){
return (b?gcd(b,a%b):a);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;cin >> n >> k;
vector<int> a(n);
int mx=0;
for(int i=0;i<n;i++){
cin >> a[i];
chmax(mx,a[i]);
}
int g=0;
for(int i=0;i<n;i++){
g=gcd(g,a[i]);
}
if(k<=mx&&k%g==0){
cout << "POSSIBLE" << endl;
}
else{
cout << "IMPOSSIBLE" << endl;
}
}
| 0
| 45,273,675
|
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
int A ,B ,C;
cin >> A >> B >> C;
for(int i = 1 ;i <= B;i++){
if(i * A % B == C){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
bool isMale() {
string result;
cin >> result;
if (result == "Vacant") {
exit(0);
}
return result == "Male";
}
int main() {
int N;
cin >> N;
int left = 0;
int right = N - 1;
cout << 0 << endl;
bool leftMale = isMale();
cout << N - 1 << endl;
bool rightMale = isMale();
while (left < right) {
int mid = (left + right) / 2;
cout << mid << endl;
bool midMale = isMale();
bool vacantLeft = false;
bool vacantRight = false;
if ((mid - left) % 2 == 0) {
if (leftMale != midMale) {
vacantLeft = true;
}
} else {
if (leftMale == midMale) {
vacantLeft = true;
}
}
if ((right - mid) % 2 == 0) {
if (rightMale != midMale) {
vacantRight = true;
}
} else {
if (rightMale == midMale) {
vacantRight = true;
}
}
if (vacantLeft) {
right = mid;
rightMale = midMale;
} else {
left = mid;
leftMale = midMale;
}
}
}
| 0
| 73,323,131
|
#include<iostream>
#include<algorithm>
using namespace std;
int selectionSort(int A[],int N){
int i,j,minj,count;
count = 0;
for(i=0;i<N;i++){
minj = i;
for(j=i;j<N;j++){
if(A[j]<A[minj])minj = j;
}
if(i!=minj){
swap(A[i],A[minj]);
count++;
}
}
return count;
}
int main(){
int A[100],N,count,i;
cin >> N;
for(i=0;i<N;i++)cin >> A[i];
count = selectionSort(A,N);
for(i=0;i<N;i++){
if(i)cout << " ";
cout << A[i];
}
cout << endl;
cout << count << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
#define M 1046527
typedef long long ll;
char H[M][20];
int getChar(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
ll getKey(char str[]) {
ll sum = 0, p = 1, i;
for (int i = 0; i < strlen(str); i++) {
sum += p * getChar(str[i]);
p *= 5;
}
return sum;
}
int h1(int key) {return key % M;}
int h2(int key) {return 1 + (key % (M - 1));}
int find(char str[]) {
ll key, i, h;
key = getKey(str);
for (int i = 0; ; i++) {
h = (h1(key) + i * h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0) return 0;
}
}
int insert(char str[]) {
ll key, i, h;
key = getKey(str);
for (int i = 0; ; i++) {
h = (h1(key) + i * h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0) {
strcpy(H[h], str);
return 0;
}
}
return 0;
}
char cmd[10];
char str[10];
int n;
int main() {
scanf("%d", &n);
while (n--) {
scanf("%s %s", cmd, str);
if (cmd[0] == 'i') {
insert(str);
} else {
if (find(str)) {
printf("yes\n");
} else {
printf("no\n");
}
}
}
return 0;
}
| 0
| 67,863,080
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll x,y; cin>>x>>y;
ll ans=abs(abs(x)-abs(y));
if(0<=x&&x<y) {cout<<ans<<endl; return 0;}
if(x<0&&0<y) {cout<<ans+1<<endl; return 0;}
if(x<y&&y<=0) {cout<<ans<<endl; return 0;}
if(0<y&&y<x) {cout<<ans+2<<endl; return 0;}
if(y<=0&&0<=x) {cout<<ans+1<<endl; return 0;}
if(y<x&&x<0) {cout<<ans+2<<endl; return 0;}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int w, h, n, x, y, a;
cin >> w >> h >> n;
int u=0, d=w, t=0, q=h;
for(int i=0; i<n; i++){
cin >> x >> y >> a;
if(a==1){
u = max(u,x);
}else if(a==2){
d = min(d,x);
}else if(a==3){
t = max(t,y);
}else{
q = min(q,y);
}
}
if(u>=d||t>=q){
puts("0");
return 0;
}
printf("%d\n",(d-u)*(q-t));
return 0;
}
| 0
| 66,888,300
|
#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>;
struct UnionFind{
vector<int>p,r;
UnionFind(int n){
p.resize(n,-1);
r.resize(n,1);
}
int find(int x){
if(p[x]==-1)return x;
else return p[x]=find(p[x]);
}
void unite(int x, int y){
x=find(x);
y=find(y);
if(x==y)return;
if(r[x]>r[y])swap(x,y);
if(r[x]==r[y])r[y]++;
p[x]=y;
}
bool same(int x, int y){
return find(x)==find(y);
}
};
int main(){
int n,q;
cin>>n>>q;
UnionFind uf(n);
rep(i,q){
int p,a,b;
cin>>p>>a>>b;
if(p==0){
uf.unite(a,b);
}
else{
cout<<(uf.same(a,b)?"1":"0")<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 101;
const ll MAX_K = 100001;
const ll MOD = 1000000007;
int N;
ll K, cum, a[MAX_N], dp[MAX_N][MAX_K];
ll add(ll a, ll b) {
return (a + b) % MOD;
}
ll sub(ll a, ll b) {
return (a - b + MOD) % MOD;
}
int main() {
scanf("%d %lld", &N, &K);
for(int i = 0; i < N; ++i) scanf("%lld", &a[i]);
for(ll c = 0; c <= min(a[0], K); ++c) dp[0][c] = 1ll;
cum = a[0];
for(int i = 1; i < N; ++i) {
ll r = 0ll;
for(ll c = 0; c <= min(a[i], K); ++c) {
r = add(r, dp[i - 1][c]);
dp[i][c] = r;
}
cum += a[i];
for(ll c = a[i] + 1; c <= min(cum, K); ++c) {
r = add(r, dp[i - 1][c]);
r = sub(r, dp[i - 1][c - a[i] - 1]);
dp[i][c] = r;
}
}
printf("%lld\n", dp[N - 1][K]);
return 0;
}
| 0
| 98,277,361
|
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll r,d,x,i,j,t=10;
cin>>r>>d>>x;
while(t--)
{
x=r*x-d;
cout<<x<<endl;
}
return 0;
}
|
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <math.h>
#include <complex>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int INF = 2e9;
int main() {
int n, k; cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(a.begin(), a.end(),greater<int>());
ll sum; int ans = 0;
rep(i, 0, n) {
sum = 0;
rep(j, i, n) {
sum += a[j];
if (sum >= k) {
ans = max(ans, j + 1);
sum -= a[j];
}
}
}
ans = n - ans;
printf("%d", ans);
return 0;
}
| 0
| 59,701,139
|
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) cerr << _x << ", "; cerr << endl
#define dba(a, n) cerr << #a << "="; for (int _i = 0; _i < (n); ++_i) cerr << a[_i] << ", "; cerr << endl
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
return os << "(" << x.first << "," << x.second << ")";
}
typedef long long ll;
typedef long double ld;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> A(n);
for (int i = 0; i < n; ++i) scanf("%d", &A[i]);
for (int i = 0; i < k; ++i) {
vector<int> D(n + 1);
for (int j = 0; j < n; ++j) {
D[max(0, j - A[j])]++;
D[min(n, j + A[j] + 1)]--;
}
bool no = false;
for (int i = 0; i < n; ++i) {
if (i) A[i] = A[i - 1];
else A[i] = 0;
A[i] += D[i];
if (A[i] < n) no = true;
}
if (!no) break;
}
for (int i = 0; i < n; ++i) printf("%d ", A[i]);
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <utility>
#include <vector>
#include <math.h>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define MOD 1e9 + 7
typedef long long ll;
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
char c[h][w];
rep(i, h) rep(j, w) cin >> c[i][j];
int ans = 0;
for (int rmask = 0; rmask < (1 << h) - 1; rmask++) {
for (int cmask = 0; cmask < (1 << w) - 1; cmask++) {
int black = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (((rmask >> i) & 1) == 0 && ((cmask >> j) & 1) == 0 && c[i][j] == '#')
black++;
}
}
if (black == k) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 53,320,564
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
x = N /100 % 10;
if(N <= x * 111) cout << x * 111 << endl;
else cout << (x * 111) + 111 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T, typename E>
struct FGC{
typedef function<T(T, E)> F;
typedef function<E(E, E)> G;
typedef function<bool(T,T)> C;
F &f;
G &g;
C &c;
FGC(F &f,G &g,C &c):f(f),g(g),c(c){}
};
template<typename T, typename E>
struct SkewHeap{
SkewHeap *l,*r;
T val;
E add,e;
FGC<T, E> &fgc;
SkewHeap(T val,E e,FGC<T,E> &fgc):
val(val),add(e),e(e),fgc(fgc){l=r=NULL;}
void eval(){
if(add==e) return;
if(l) l->add=fgc.g(l->add,add);
if(r) r->add=fgc.g(r->add,add);
val=fgc.f(val,add);
add=e;
}
T top(){
return fgc.f(val,add);
}
};
template<typename T, typename E>
SkewHeap<T, E>* meld(SkewHeap<T, E> *a,SkewHeap<T, E> *b){
if(!a) return b;
if(!b) return a;
if(a->fgc.c(a->top(),b->top())) swap(a,b);
a->eval();
a->r=meld(a->r,b);
swap(a->l,a->r);
return a;
}
template<typename T, typename E>
SkewHeap<T, E>* pop(SkewHeap<T, E>* a){
a->eval();
auto res=meld(a->l,a->r);
return res;
};
signed main(){
using Heap = SkewHeap<int, int>;
FGC<int, int>::F f=[](int a,int b){return a+b;};
FGC<int, int>::G g=[](int a,int b){return a+b;};
FGC<int, int>::C c=[](int a,int b){return a<b;};
FGC<int, int> fgc(f,g,c);
Heap* base = new Heap(0,0,fgc);
string s;
while(cin>>s,s!="end"){
int x;
if(s=="insert"){
cin>>x;
base=meld(base, new Heap(x,0,fgc));
}
if(s=="extract"){
x=base->top();
base=pop(base);
cout<<x<<endl;
}
}
return 0;
}
| 0
| 86,276,264
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;++i)
#define loop(i,a,b) for (int i=a ; i<b ;++i)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define gcd(a,b) __gcd((a),(b))
#define fill(a,value) memset(a,value,sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout<<(x)<<endl;
#define sum(v)+x accumulate(v.begin(), v.end(),x);
typedef pair<int,int> pii;
typedef vector<int> vi;
signed main()
{
fastio;
cout << fixed << setprecision(12);
int n;
cin>>n;
multiset<int>s;
vi a;
f(i,n)
{
int x;
cin>>x;
a.pb(x);
s.insert(x);
}
f(i,n)
{
s.erase(s.find(a[i]));
int ans=*s.rbegin();
print(ans)
s.insert(a[i]);
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
int main(void)
{
int n;
pair <char, int> input[128], bubble[128], select[128];
cin >> n;
for (int i = 0; i < n; i++){
cin >> input[i].first >> input[i].second;
bubble[i] = input[i];
select[i] = input[i];
}
bool flag = true;
for (int i = 0; flag; i++){
flag = false;
for (int j = n - 1; j >= i + 1; j--){
if (bubble[j].second < bubble[j - 1].second){
swap(bubble[j], bubble[j - 1]);
flag = true;
}
}
}
for (int i = 0; i < n - 1; i++){
int mini = i;
for (int j = i; j < n; j++){
if (select[mini].second > select[j].second) mini = j;
}
if (mini != i){
swap(select[mini], select[i]);
}
}
for (int i = 0; i < n; i++){
cout << bubble[i].first << bubble[i].second << (i + 1 == n ? '\n' : ' ');
}
cout << "Stable" << endl;
bool stable = true;
for (int i = 0; i < n; i++){
if (bubble[i] != select[i]) stable = false;
}
for (int i = 0; i < n; i++){
cout << select[i].first << select[i].second << (i + 1 == n ? '\n' : ' ');
}
if (stable) cout << "Stable" << endl;
else cout << "Not stable" << endl;
return 0;
}
| 0
| 98,005,341
|
#include <iostream>
#define NIL -1
using namespace std;
int f[45] = {};
int fib(int n){
if(n == 0 || n == 1){
return f[n] = 1;
}
if(f[n] != NIL){
return f[n];
}
return f[n] = fib(n - 1) + fib(n - 2);
}
int main(){
int n;
cin >> n;
for(int i = 0;i < 45;i++) f[i] = NIL;
cout << fib(n) << endl;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
#define maxn 2000005
#define ma 10005
int a[maxn],b[maxn],c[maxn];
void countingSort(int k)
{
for(int i=1;i<=k;++i)
c[a[i]]++;
for(int i=1;i<=ma;++i)
c[i]=c[i-1]+c[i];
for(int i=k;i>=1;--i)
{
b[c[a[i]]]=a[i];
c[a[i]]--;
}
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
countingSort(n);
for(int i=1;i<=n;i++)
{
if(i>1) printf(" ");
printf("%d",b[i]);
}
printf("\n");
return 0;
}
| 0
| 70,541,655
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n",(x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n",(x) ? "Yes" : "No")
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1<<29)
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
#define X first
#define Y second
#define pie 3.14159265358979323846
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
template<class T=int>
T in(){T x;cin>>x;return (x);}
template<class T>
void print(T& x){cout<<x<<'\n';}
const int MOD =(int)1e9+7;
const int mod =(int)1e9+7;
const int MAX =510000;
ll fac[MAX],finv[MAX],inv[MAX];
void COMint(){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<MAX;i++){
fac[i]=fac[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll COM(int n,int k){
if(n<k) return 0;
if(n<0||k<0)return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
ll gcd(ll a,ll b){
if(b==0)return a;
if(a>b){
swap(a,b);
}
return gcd(a,b%a);
}
ll lcm(ll a,ll b){
ll g;g=gcd(a,b);
return a*b/g;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll RS(ll N,ll P,ll M){
if(P==0){
return 1;
}else{
if(P%2==0){
ll t=RS(N,P/2,M);
return t*t%M;
}else{
return N*RS(N,P-1,M)%M;
}
}
}
bool greater_pair(pair<ll,ll> a,pair<ll,ll> b){
if(a.first!=b.first){
return a.first>b.first;
}else{
return a.second>b.second;
}
}
ll N,M,Q;
vector<string>A;
void dfs(ll i,ll j,string S){
if(i==N){
A.pb(S);
return;
}
for(int k=j;k<M;k++){
string Snew=S+to_string(k);
dfs(i+1,k,Snew);
}
}
int main() {
ios::sync_with_stdio(false);
int N,K,S;
cin>>N>>K>>S;
int ume=(S+1)%1000000000;
REP(i,N){
if(i<K){
cout<<S<<" ";
}else{
cout<<ume;
if(i<N-1)cout<<" ";
}
}
cout<<endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__);
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
void out() {
cout << endl;
}
template <typename T, class... U>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
#define rep(i, n) for (long long i = 0; i < n; i++)
void solve();
#ifndef ONLINE_JUDGE
#include "./lib.hpp"
#endif
const ll INF = 1LL << 60;
void solve() {
inl(N, M);
vector<vector<ll>> d(N, vector<ll>(N, INF));
rep(i, N) d[i][i] = 0;
rep(i, M) {
inl(a, b, c);
a--; b--;
d[a][b] = d[b][a] = c;
}
vector<vector<ll>> costs(d);
rep(k, N) {
rep(i, N) {
rep(j, N) {
costs[i][j] = min(costs[i][j], costs[i][k] + costs[k][j]);
}
}
}
ll used = 0;
rep(i, N) {
for(ll j = i + 1; j < N; j++) {
if (d[i][j] == costs[i][j])
used++;
}
}
out(M - used);
}
| 0
| 2,578,232
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Int long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
Int n;
cin>>n;
Int cv=(n*(n+1))/2;
cv*=n;
cv=0;
for(int i = 1;i<=n;i++)
{
cv+=(i)*(n-i+1);
}
for(int i = 1;i<n;i++)
{
int x,y;
cin>>x>>y;
cv-=(min(x,y)*(n-max(x,y)+1));
}
cout<<cv<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
vector<ll> a(N), b(N);
ll suma = 0;
ll sumb = 0;
rep(i,N){
cin >> a[i];
suma += a[i];
}
rep(i,N){
cin >> b[i];
sumb += b[i];
}
if(suma > sumb){
cout << "No" << endl;
return 0;
}
ll M = sumb - suma;
ll manua=0;
ll manub=0;
rep(i,N){
if(a[i] == b[i]) continue;
if(a[i] < b[i]){
M -= (a[i] - b[i])/2 + ((a[i] - b[i])%2);
manua += (a[i] - b[i])/2 + ((a[i] - b[i])%2);
manub += ((a[i] - b[i])%2);
}else{
M -= b[i] - a[i];
manub += b[i] - a[i];
}
if(M < 0){
cout << "No" << endl;
return 0;
}
}
ll MM = sumb-suma;
if(manua <= MM && manub <= MM && manua <= manub){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 0
| 86,276,512
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
map<string,int> A;
rep(i,N) {
string c;
cin >> c;
if (A[c] != 0) {
cout << "NO" << endl;
return 0;
}
else {
A[c] = 1;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<int> v(n);
for(auto &x : v) cin >> x;
int ans = 0;
for(int i = 0; i < n; ++i){
for(int j = i + 1; j < n; ++j){
ans += v[i]*v[j];
}
}
cout << ans << '\n';
return 0;
}
| 0
| 59,605,789
|
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int price;
int change;
int num;
while (1)
{
cin >> price;
if (price == 0) break;
change = 1000 - price;
num = 0;
num += change / 500;
change %= 500;
num += change / 100;
change %= 100;
num += change / 50;
change %= 50;
num += change / 10;
change %= 10;
num += change / 5;
change %= 5;
num += change / 1;
cout << num << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int a, b, sum;
char ope;
cin >> a >> ope >> b;
if (ope == '+')
{
sum = a + b;
}
else
{
sum = a - b;
}
cout << sum << endl;
return 0;
}
| 0
| 19,034,982
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,m;
cin>>n>>m;
char fi1[n][n];
char fi2[m][m];
rep(i,n){
rep(j,n){
cin>>fi1[i][j];
}
}
rep(i,m){
rep(j,m){
cin>>fi2[i][j];
}
}
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
bool ok=true;
rep(k,m){
rep(l,m){
if(fi1[i+k][j+l]!=fi2[k][l]) ok=false;
}
}
if(ok){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
}
|
#include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
ll MM = 1000000000; ll mod = MM + 7; ll MMM=9223372036854775807;
ll GCD(ll x, ll y){ if(y == 0) return x; else return GCD(y, x % y);}
ll LCM(ll x, ll y){ return x / GCD(x, y) * y;}
int dh[4] = {-1, 0, 0, 1};
int dw[4] = {0, -1, 1, 0};
using P = pair<int, int>;
const double pi = acos(-1.0);
using Graph = vector<vector<ll>>;
int main(){
int w,h,n;
cin>>w>>h>>n;
int xt,yt,at;
int xm,ym,xM,yM;
xm=0;
ym=0;
xM=w;
yM=h;
rep(i,n){
cin>>xt>>yt>>at;
if(at==1)xm=max(xt,xm);
if(at==3)ym=max(yt,ym);
if(at==2)xM=min(xt,xM);
if(at==4)yM=min(yt,yM);
}
if(xM-xm<=0)cout<<0<<endl;
else if(yM-ym<=0)cout<<0<<endl;
else cout<<(xM-xm)*(yM-ym)<<endl;
return 0;
}
| 0
| 53,858,735
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
typedef long long int ll;
using namespace std;
string back(string s){
string ret="";
for(int i=s.size()-1;i>=0;i--){
ret+=s[i];
}
return ret;
}
int main(){
string s;
cin>>s;
cout<<back(s)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1 * 100 * 1000 + 1;
int n, sz[N];
vector <int> adj[N];
bool dfs(int u, int par) {
int odd = 0, res = 0;
sz[u] = 1;
for (auto v: adj[u])
if (v ^ par) {
res |= dfs(v, u);
sz[u] += sz[v];
odd += (sz[v] & 1);
}
return (res | (odd > 1));
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
if (n & 1 || dfs(0, -1))
return cout << "First\n", 0;
cout << "Second\n";
}
| 0
| 78,039,493
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define TRACE
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const ll inf = 2e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<pii> v(n - 1);
for(int i = 0; i < n - 1; i++) {
cin >> v[i].fi >> v[i].se;
if(v[i].fi > v[i].se) {
swap(v[i].fi, v[i].se);
}
}
int ans = 0;
for(int i = 1; i <= n; i++) {
ans += i * (n - i + 1);
}
for(int i = 0; i < n - 1; i++) {
ans -= (v[i].fi) * (n - v[i].se + 1);
}
cout << ans;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define mem(a,n) memset(a,n,sizeof(a,n,sizeof(a))
#define rep(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
const int mod=1e9+7;
const double eps=1e-6;
const int N=1e4+5;
const int w=20003;
char s[N];
bool flag[2][2][40009];
int main()
{
int _x=0,x,y,p,q,sum,now=1;
scanf("%s%d%d",s+1,&x,&y);
int len=strlen(s+1);
x+=w,y+=w;
while(now<=len&&s[now]=='F') now++,_x++;
flag[0][0][w+_x]=flag[1][0][w]=1;
while(now<=len)
{
now++;
sum=0;
p^=1;
q^=p;
while(now<=len&&s[now]=='F') sum++,now++;
for(int i=w-len;i<=w+len;i++)
flag[p][q][i]=flag[p][q^1][i+sum]|flag[p][q^1][i-sum];
}
if(p==1&&flag[0][q^1][x]&&flag[1][q][y]||p==0&&flag[0][q][x]&&flag[1][q][y])
puts("Yes");
else puts("No");
return 0;
}
| 0
| 27,348,219
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N; i += R){
for (int j = 0; j <= N; j += G){
int k = N - i - j;
if (k % B == 0 && k >= 0){
ans++;
}
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int main(){
string a,b;
vector<pair<int,int> > time;
int n,h,m,s,ret;
int t1,t2;
int tt[3600*24+1];
while(cin >> n && n){
time.clear();
ret = 0;
for(int i=0;i<3600*24;i++)tt[i]=0;
for(int i=0;i<n;i++){
cin >> a >> b;
sscanf(a.c_str(),"%d:%d:%d",&h,&m,&s);
t1 = h*3600+m*60+s;
sscanf(b.c_str(),"%d:%d:%d",&h,&m,&s);
t2 = h*3600+m*60+s;
for(int k=t1;k<t2;k++){
tt[k]++;
ret = max(ret,tt[k]);
}
}
cout << ret << endl;
}
}
| 0
| 63,801,870
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
#define r 1000001
int main()
{
ll n;
cin>>n;
ll mini=n-1;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
ll d=n/i;
mini=min(mini,i+d-2);
}
}
cout<<mini<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, w, ans = 0, count = 0;
string s, t;
vector<pair<string, pair<lli, lli>>> pr;
cin >> n;
vlli d(n), e(100010, 0), f(100010, 0), g(100010, 0), k, l(100010, 0);
rep(i, 0, n)
{
cin >> d[i];
if (d[i] >= 1)
{
l[d[i] - 1]++;
}
l[d[i] + 1]++;
l[d[i]]++;
}
SORTR(l);
cout << l[0] << endl;
}
| 0
| 5,541,423
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int N = 1005;
const ll mod = 1e9+7;
#define ld long double
#define PI 3.14159265358979323846
const int INF = 10000000;
void flash()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.setf(ios::showpoint);
cout.precision(2);
}
string next(string s){
reverse(s.begin(),s.end());
string s2=s;
int j;
for(j=0;j<s.length();j++){
if(s2[j]=='9'){
s2[j]='0';
}
else break;
}
if(s.length()==j){
s=s2;
s+='1';
reverse(s.begin(),s.end());
return s;
}
if(s.length()==1){
int c1=s[0]-'0';
s[0]=(c1+1)+'0';
}
for(j=0;j<s.length()-1;j++){
int c1 = (s[j]-'0');
int c2 = (s[j+1]-'0');
if(abs(c1-c2)<=1)continue;
else if(abs(c1+1-c2)<=1){
c1++;
s[j]=c1+'0';
s[j+1]=c2+'0';
}
else{
c1=c2;
c2++;
s[j+1]=c2+'0';
s[j]=c1+'0';
}
}
reverse(s.begin(),s.end());
return s;
}
void solve();
int32_t main()
{
flash();
int t;
t = 1;
while(t--){
solve();
}
return 0;
}
void solve()
{
int k;
cin>>k;
queue<int>q;
for(int i=1;i<=9;i++)q.push(i);
for(int i=0;i<k-1;i++){
int d = q.front();
q.pop();
if(d%10!=0){
q.push(10*d+(d%10)-1);
}
q.push(10*d+(d%10));
if(d%10!=9){
q.push(10*d+(d%10)+1);
}
}
cout<<q.front();
return;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
vector<int> h(10); cin >> h;
sort(ALL(h), greater<int>());
REP(i, 3) cout << h[i] << endl;
}
| 0
| 24,741,831
|
#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#define INF 1e8
using namespace std;
int main(void){
set<long long> s;
int n, count=0, min=1e9+5;
cin>>n;
for(int i=0;i<n;++i){
int a;
cin>>a;
if(a <min)
{
count++;
min=a;
}
}
cout<<count;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long sum = accumulate(A.begin(), A.end(), 0LL);
long long m = N * (N + 1) / 2;
if (sum % m != 0) {
cout << "NO" << endl;
return 0;
}
long long num = sum / m;
for (int i = 0; i < N; i++) {
long long gap = 0;
if (i != N - 1) {
gap = A[i + 1] - A[i] - num;
} else {
gap = A[0] - A[N - 1] - num;
}
if (gap % N != 0 || gap > 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| 0
| 7,251,888
|
#include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<<3)+(a<<1)+x-'0';
if(f)a=-a;
return a;
}
using namespace std;
int main() {
LL n, x;
read(n), read(x);
LL gcd = __gcd(n, x);
n /= gcd;
cout << (n * 3 - 3) * gcd;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char ulcase(char i)
{
return 0;
}
int main()
{
char s[1200] = {};
fgets(s, 1200, stdin);
int i = 0;
while (1)
{
if (i > 1200)
break;
if ((*(s+i)) == '\0')
break;
char c = *(s + i);
if (c >= 0x41 && c <= 0x5a) {
c += 0x20;
*(s+i) = c;
} else if (c >= 0x61 && c <= 0x7a) {
c -= 0x20;
*(s+i) = c;
}
i++;
}
for (int i = 0; i < 1200; i++)
{
if (s[i] == 0 || s[i] == '\0')
break;
cout << s[i];
}
return 0;
}
| 0
| 76,999,959
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<ll> vll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<ll, str>> vpls;
typedef vector<tuple<str, ll, ll>> vtsl;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
void Main()
{
ll a, b, c, d; cin >> a >> b >> c >> d;
ll p = abs(b - a), q = abs(c - b), r = abs(c- a);
if(p <= d&&q <= d||r <= d) fin("Yes")
else fin("No")
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll s;
cin >>s;
map<ll,ll> m;
ll now=s;
ll i=1;
while(1){
i++;
m[now]=1;
if(now%2==0){
now/=2;
}else{
now = 3*now + 1;
}
if(m[now]==1){
cout<<i<<endl;
return 0;
}
}
return 0;
}
| 0
| 70,253,659
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
string a,b;
cin>>a>>b;
if(a[0]==b[2] && b[0]==a[2] && a[1]==b[1])
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
string a, b;
cin >> a >> b;
if(a.size()>b.size()){
out("GREATER");
return 0;
}
else if(a.size()<b.size()){
out("LESS");
return 0;
}
else{
rep(i,a.size()){
if(a[i]!=b[i]){
if(a[i]-'0'>b[i]-'0'){
out("GREATER");
return 0;
}
else{
out("LESS");
return 0;
}
}
}
}
out("EQUAL");
}
| 0
| 94,559,706
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll INF = 1LL<<60;
const ll MOD = 1e9 + 7;
int main() {
ll N,K;
cin >> N >> K;
vector<ll> vec;
map<ll,ll> mp;
for (ll i = 0;i<N;i++) {
ll a,b;
cin >> a >> b;
mp[a] += b;
}
ll cnt=0;
for (pair<ll,ll> p : mp) {
cnt += p.second;
if (cnt >= K) {
cout << p.first << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF ((1 << 29)-1)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
int N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) cin >> A[i];
sort(ALL(A));
auto check = [&](int x){
vector<bool> dp(K);
dp[0] = true;
REP(i, N){
if (i == x) continue;
REP_REV(j, K-A[i]){
dp[j + A[i]] = dp[j + A[i]] | dp[j];
}
}
bool noneed = true;
REPN(j, 1, A[x]+1){
if (dp[K - j]){
noneed = false;
break;
}
}
return noneed;
};
int inf = -1;
int sup = N;
while (sup - inf > 1){
int x = (sup + inf) / 2;
if (check(x)){
inf = x;
} else {
sup = x;
}
}
print(inf+1);
return 0;
}
| 0
| 56,356,047
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
rep(i, N) {
if (S[i] != S[K - 1])
cout << '*';
else
cout << S[i];
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265358979323846
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b)
{
intt res = 1;
while (b > 0) {
if (b & 1)res = ((res%mod) * (a%mod))%mod;
a = ((a%mod) * (a%mod))%mod;
b >>= 1;
}
return res;
}
intt fact(intt n) {
if ((n==0)||(n==1))
return 1;
else
return n*fact(n-1);
}
void go()
{
#ifndef ONLINE_JUDGE
freopen("inn.txt","r",stdin);
freopen("ouut.txt","w",stdout);
#endif
}
int dx[4]={0,-1,1,0};
int dy[4]={1,0,0,-1};
int main()
{
fast_io
go();
string s;cin>>s;
int i=0,j=s.size()-1;
int n=s.size()-1;
while(i<j)
{
if(s[i]!=s[j])
{
cout << "No" <<"\n";
return 0;
}
i++;j--;
}
int a=0,b=n/2-1,c=n/2+1,d=n;
while(a<b)
{
if(s[a]!=s[b])
{
cout << "No" <<"\n";
return 0;
}
a++;b--;
}
while(c<d)
{
if(s[c]!=s[d])
{
cout << "No" <<"\n";
return 0;
}
c++;d--;
}
cout << "Yes" <<'\n';
}
| 0
| 69,786,603
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
long ans = 0;
cin >> N >> A >> B;
for(int i=1;i<=N;++i){
int sum = 0;
string s;
s = to_string(i);
for(int j=0;j<s.size();++j){
sum += s.at(j) - '0';
}
if(sum >= A && sum <= B) ans += i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
deque<pair<int, int>> que;
typedef vector<vector<int> > Matrix;
const ll INF = 1e18;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> x(N);
REP(i, N)cin >> x[i];
x.push_back(X);
sort(x.begin(), x.end());
vector<ll> diff(N);
REP(i, N){
diff[i] = x[i+1]-x[i];
}
ll ans = diff[0];
REP(i, N-1){
ans = __gcd(ans, diff[i+1]);
}
cout << ans << endl;
}
| 0
| 38,295,552
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define debug1(a) cout<<#a<<" "<<(a)<<endl;
#define debug2(a,b) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<endl;
#define debug3(a,b,c) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<" "#c<<" "<<(c)<<endl;
typedef long double ld;
void solve()
{
ll n;
cin >> n;
string s, t;
cin >> s >> t;
for (int i = 0; i < n; i++)
{
cout << s[i] << t[i];
}
cout << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
while (t--)
{
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmin(v) v.rbegin()->first
#define mapmax(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define SIZE(s) (int)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;
const double pi = acos(-1.0);
const int mod=1000000007;
const int mod2=998244353;
template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
ost << "{" << p.first << ", " << p.second << "} ";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
ost << "{";
for (int i = 0; i<(int)v.size(); i++) {
if (i)ost << " ";
ost << v[i];
}
ost << "} \n";
return ost;
}
template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
ost << "{";
for (auto p:v) {
ost << "{" << p.first << ", " << p.second << "} ";
}
ost << "} ";
return ost;
}
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;}
void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}
ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}
int main()
{
ll n,ans=0;
cin >> n;
vll a(n);
rep(i,n) cin >> a[i];
rep(i,n){
ans+=a[i]/2;
a[i]%=2;
if(a[i] && a[i+1]>0 && i!=n-1){
ans++;
a[i+1]--;
}
}
cout << ans << endl;
return 0;
}
| 0
| 30,998,292
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
signed main()
{
int a, b;
cin >> a >> b;
cout << ((a <= 8 && b <= 8) ? "Yay!" : ":(") << endl;
}
|
#include<iostream>
#include <string>
using namespace std;
int main() {
int m, f, r, i = 0;
string R[50];
for (i = 0; i < 50; i ++) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
R[i] = "F";
else if (m + f >= 80)
R[i] = "A";
else if (m + f >= 65 && m + f < 80)
R[i] = "B";
else if (m + f >= 50 && m + f < 65)
R[i] = "C";
else if (m + f >= 30 && m + f < 50) {
if (r >= 50)
R[i] = "C";
else
R[i] = "D";
}
else
R[i] = "F";
}
for (int j = 0; j < i; j++)
cout << R[j] << endl;
return 0;
}
| 0
| 92,406,923
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int l[55];
rep(i, N) { cin >> l[i]; }
sort(l, l + N);
reverse(l, l + N);
int total = 0;
rep(i, K) { total += l[i]; }
cout << total << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=(m); i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}
template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
int l = vv.size();
if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n " ) << vv[i] << (i==l-1 ? " ]" : ""); }
return o;
}
template<typename T1, typename T2>
ostream& operator<<(ostream& o, const pair<T1, T2>& p){
return o << "(" << p.first << ", " << p.second << ")";
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) {
freopen(filename.c_str(), "r", stdin);
}
int main(){
ios_base::sync_with_stdio(0);
int m,k; cin >> m >> k;
if(k >= pow(2,m)){
cout << -1 << endl;
return 0;
}
vi ans;
if(m == 0){
rep(i,2) ans.push_back(0);
}else if(m == 1){
if(k == 1){
cout << -1 << endl;
return 0;
}
rep(i,2) ans.push_back(0);
rep(i,2) ans.push_back(1);
}else{
rep(i,1<<m) if(i != k) ans.push_back(i);
ans.push_back(k);
rrep(i,1<<m) if(i != k) ans.push_back(i);
ans.push_back(k);
}
cout << join(ans, " ") << endl;
return 0;
}
| 0
| 18,950,570
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll L,R; cin>>L>>R;
ll ans=INF;
if(R-L+1>=2019) cout<<0<<endl;
else{
FOR(i,L,R)FOR(j,i+1,R+1){
chmin(ans,(i*j)%2019);
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
#include <math.h>
#include <regex>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ld n,m,d;
cin >> n >> m >> d;
ld ans;
if(d){
ans = 2.0*(n-d)*(m-1)/(n*n);
}else{
ans = (m-1)/n;
}
cout << setprecision(15) << ans << endl;
}
| 0
| 70,893,573
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
if(N==1){
cout << 1<<endl;
return 0;
}
int count=0;
for(int i=0;i<10;++i){
++count;
N/=2;
if(N==1||N==0){
break;
}
}
int rui=1;
for(int i=0;i<count;i++){
rui*=2;
}
cout << rui << endl;
}
|
#include <iostream>
#include <iomanip>
#include <queue>
#include <vector>
int main() {
int n;
std::priority_queue<double, std::vector<double>, std::greater<double> > q;
std::cin >> n;
for (int i = 0; i < n; i++) {
int v;
std::cin >> v;
q.push((double) v);
}
while (q.size() > 1) {
double a, b;
a = q.top();
q.pop();
b = q.top();
q.pop();
q.push((a + b) / 2);
}
double r = q.top();
std::cout << std::setprecision(5) << r << std::endl;
}
| 0
| 79,312,468
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
pair<string,int> p[n];
for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second;
string s;
cin >> s;
bool ok = false;
int ans = 0;
for (int i = 1; i < n; ++i) {
if (s == p[i-1].first) ok = true;
if (ok) ans += p[i].second;
}
cout << ans << endl;
return (0);
}
|
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long int maxtime(long long int x, long long int y) {
return(x + y - 1) / y;
}
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
long long int modinv(long long a, long long m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<long long int >meguru;
bool isOK(int index, int key) {
if (meguru[index] <= key) return true;
else return false;
}
int binary_search(int key) {
int left = -1;
int right = (int)meguru.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key)) left = mid;
else right = mid;
}
return left;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int a, b, c,k;
cin >> a >> b >> c >> k;
int ans = 0;
ans = ans + 1 * min(a, k);
k = max(k - a, 0);
k = max(k - b, 0);
ans = ans + (-1) * min(c, k);
cout << ans;
}
| 0
| 3,969,273
|
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
int main() {
ll h;
int n;
cin >> h >> n;
ll damage = 0;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
damage += a;
}
if (damage >= h) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int N, X[1000], Y[1000];
string ans[1000];
bool is_even;
int main(){
cin >> N;
for(int i = 0; i < N; i++){
cin >> X[i] >> Y[i];
}
for(int i = 0; i < N; i++){
if(abs(X[0] + Y[0]) % 2 != abs(X[i] + Y[i]) % 2){
cout << "-1" << endl;
return 0;
}
}
if(abs(X[0]+Y[0]) % 2 == 0){
is_even = true;
for(int i = 0; i < N; i++){
X[i]--;
}
}
int m = 31;
cout << m + (is_even? 1: 0) << endl;
if(is_even){
cout << "1 ";
}
for(int i = 0; i < m; i++){
if(i){
cout << " ";
}
cout << (1 << i);
}cout << endl;
for(int i = 0; i < N; i++){
if(is_even){
cout << 'R';
}
long long u = X[i] + Y[i];
long long v = X[i] - Y[i];
for(int j = 0; j < m; j++){
bool plus_u = ((u + ((1<<m) - 1)) >> (j+1)) & 1;
bool plus_v = ((v + ((1<<m) - 1)) >> (j+1)) & 1;
if(plus_u && plus_v){
cout << 'R';
}else if(plus_u && !plus_v){
cout <<'U';
}else if(!plus_u && plus_v){
cout <<'D';
}else{
cout << 'L';
}
}cout << endl;
}
}
| 0
| 83,593,018
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c;
} else if (a == c) {
cout << b;
} else {
cout << a;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1, i = 1;
while(t--) {
solve();
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
int main(){
string s;
cin >> s;
int len = s.size();
typedef pair<int, int> P;
P ans = make_pair(-1, -1);
if (len == 2){
if(s[0] == s[1]) ans = make_pair(0, 1);
}
else if (s[0] == s[1] || s[0] == s[1] || s[1] == s[2]){
ans = make_pair(0, 2);
}
else {
for (int i = 3; i < len; i++){
if (s[i] == s[i - 1] || s[i] == s[i - 2]){
ans = make_pair(i - 2, i);
}
}
}
if (ans.first == -1) cout << -1 << " " << -1 << endl;
else cout << ans.first + 1 << " " << ans.second + 1 << endl;
return 0;
}
| 0
| 65,625,692
|
#include <bits/stdc++.h>
#define initrand mt19937 mt_rand(time(0));
#define rand mt_rand()
using namespace std;
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define INF 10000000000000000
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int k[n+1];
for(int i = 1;i<=n;i++) k[i] = 0;
vector<int> adj[n+1];
for(int i = 1;i<n;i++){
int u, v;
cin>>u>>v;
if(u>v) swap(u, v);
k[v] = max(k[v], u);
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i = 1;i<=n;i++) sort(adj[i].begin(), adj[i].end());
int dp[n+1];
dp[0] = 0;
int ans = 0;
for(int i = 1;i<=n;i++){
dp[i] = dp[i-1] + (i - k[i]);
int ind = 1;
int sum = 0;
for(;ind<adj[i].size() && adj[i][ind]<i;ind++){
dp[i] -= adj[i][ind-1];
}
ans += dp[i];
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void){
int a, b, c, d, e;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << endl;
return 0;
}
ll gcd(ll a, ll b){
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll power(ll n, ll k){
ll res = 1;
while(k > 0){
if (k & 1)
res = res * n % MOD;
n = n * n % MOD;
k >>= 1;
}
return res;
}
ll genfact(ll n, ll k){
ll res = 1;
while (k >= 0){
res = (res * (n - k)) % MOD;
k--;
}
return res;
}
ll inv(ll n){
return power(n, MOD - 2);
}
ll fact(ll n){
return genfact(n, n - 1);
}
ll nck(ll n, ll k){
if (k == 0)
return 1;
if (n <= 0)
return 0;
return ((genfact(n, k) % MOD) * inv(fact(k))) % MOD;
}
| 0
| 78,819,198
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int s;
cin >> s;
if (s == 1)
{
s += 3;
}
else if (s == 2)
{
s += 2;
}
int i = s;
int cnt = 1;
while (i > 1)
{
if (i % 2 == 0)
i /= 2;
else
i = (i*3)+1;
cnt++;
}
cout << cnt+1 << endl;
return (0);
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
int main(){
long long a, b, p, q, r, t = 1e12; cin >> a >> b;
rep(i, a){
p = i * b;
q = (a-i)/2*b;
r = (a-(a+i)/2)*b;
t = min(t, max(p, max(q, r)) - min(p, min(q, r)));
q = (a-i)*(b/2);
r = (a-i)*(b-b/2);
t = min(t, max(p, max(q, r)) - min(p, min(q, r)));
}
rep(i, b){
p = i * a;
q = (b-i)/2*a;
r = (b-(b+i)/2)*a;
t = min(t, max(p, max(q, r)) - min(p, min(q, r)));
q = (b-i)*(a/2);
r = (b-i)*(a-a/2);
t = min(t, max(p, max(q, r)) - min(p, min(q, r)));
}
cout << t << "\n";
return 0;
}
| 0
| 41,246,269
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n,m,ans=0,a,b;cin>>n>>m;
vector<lvector> jobs(m);
rep(i,n) {
cin>>a>>b;
if(a>m) continue;
jobs[m-a].emplace_back(b);
}
lpque que;
for(ll i=m-1;i>-1;--i) {
for(ll job:jobs[i]) que.push(job);
if(que.size()) {ans+=que.top();que.pop();}
}
print(ans);
return 0;
}
|
#include <iostream>
#define ll long long
const ll int lim = 1e9 + 7;
int H, N, tmp, a[1000], b[1000], out[10001];
void solve() {
std::cin >> H >> N;
for (int i=0; i<N; ++i)
std::cin >> a[i] >> b[i];
for (int i=0; i<10001; ++i)
out[i] = lim*2;
out[0] = 0;
for (int i=0; i<N; ++i) {
for (int j=0; j<H; ++j) {
tmp = std::min(H, j + a[i]);
if (out[tmp] > (out[j] + b[i]))
out[tmp] = out[j] + b[i];
}
}
std::cout << out[H] << std::endl;
}
int main() {
std::ios_base::sync_with_stdio(0);
solve();
return 0;
}
| 0
| 20,511,444
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin(), (a).end()
#define MP make_pair
typedef pair<int, int> P;
template<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }
template<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main(){
int N, a, b, c, x;
while( cin >> N >> a >> b >> c >> x, N | a | b | c | x ){
vector<int> ran( N );
REP( i, N ) cin >> ran[i];
int ans = -1;
int reel = 0;
REP( i, 10001 ){
if( x == ran[reel] ) reel++;
if( reel == N ){
ans = i;
break;
}
x = ( a * x + b ) % c;
}
cout << ans << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#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;
const int MAX = 1010101;
long long fac[MAX], finv[MAX], inv[MAX];
void binom_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long binom(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long perm(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * finv[n - k] % MOD;
}
ll X, Y;
int main() {
cin >> X >> Y;
if (Y > X) {
swap(X, Y);
}
if (X == 0 && Y == 0) {
cout << 1;
return 0;
}
if ((X + Y) % 3 != 0) {
cout << 0;
return 0;
}
binom_init();
ll sum = X + Y;
ll rank = sum / 3;
ll diff = X - Y;
if (abs(diff) > rank) {
cout << 0;
return 0;
}
if (rank % 2 == 0) {
ll mid = rank / 2;
cout << binom(rank, mid - abs(diff) / 2);
} else {
ll mid = rank / 2;
cout << binom(rank, mid - diff / 2);
}
}
| 0
| 14,879,604
|
#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);
}
int main() {
char b; cin >> b;
if (b == 'A') cout << 'T' << endl;
else if (b == 'T') cout << 'A' << endl;
else if (b == 'G') cout << 'C' << endl;
else if (b == 'C') cout << 'G' << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <tuple>
#include <numeric>
#include <cstdio>
#include <cmath>
using namespace std;
using ll = long long;
const int INF = 1e9;
int a, b, c;
int N, rtn = INF;
vector<int> l(8);
void dfs(int depth, vector<pair<int, int>>& abcd) {
if (depth == N) {
if (abcd[0].second == 0 || abcd[1].second == 0 || abcd[2].second == 0) return;
int irtn = abs(a - abcd[0].first) + abs(b - abcd[1].first) + abs(c - abcd[2].first);
for (int i = 0; i < 3; i++) {
if (abcd[i].second >= 2) irtn += (10 * (abcd[i].second - 1));
}
rtn = min(rtn, irtn);
return;
}
for (int i = 0; i < 4; i++) {
abcd[i].first += l[depth];
abcd[i].second++;
dfs(depth+1, abcd);
abcd[i].first -= l[depth];
abcd[i].second--;
}
}
int main() {
cin >> N >> a >> b >> c;
vector<pair<int, int>> abcd(4);
for (int i = 0; i < N; i++) cin >> l[i];
dfs(0, abcd);
cout << rtn << endl;
}
| 0
| 20,738,215
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
int32_t main(){
int n, d;
cin >> n >> d;
ld a[n][d];
for (int i = 0; i < n; i++){
for (int j = 0; j < d; j++){
cin >> a[i][j];
}
}
int ans = 0;
for (int j = 0; j < n; j++){
for (int i = j + 1; i < n; i++){
ld x = 0;
for (int k = 0; k < d; k++){
x += pow(a[i][k] - a[j][k], 2);
}
x = sqrt (x);
if (floor(x) == ceil(x)){
ans ++;
}
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<long long> vl;
typedef pair<ll, ll> pi;
typedef vector<pair<ll, ll> > vpi;
#define itn ll
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ss second
#define ff first
#define dup(x,y) ((x) + (y) - 1)/(y)
#define mins(x,y) x = min(x,y)
#define maxs(x,y) x = max(x,y)
#define all(x) (x).begin(),(x).end()
#define Rep(n) for(ll i = 0;i < n;i++)
#define rep(i,n) for(ll i = 0;i < n;i++)
#define flush fflush(stdout)
#define rrep(i,n) for(ll i = n - 1;i >= 0;i--)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define ioboost cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll qp(ll a, ll b) { ll ans = 1; do { if (b & 1)ans = 1ll * ans*a; a = 1ll * a*a; } while (b >>= 1); return ans; }
ll qp(ll a, ll b, ll mo) { ll ans = 1; do { if (b & 1)ans = 1ll * ans*a%mo; a = 1ll * a*a%mo; } while (b >>= 1); return ans; }
#define _GLIBCXX_DEBUG
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
ll m;
ll d[200020],c[200020];
ll sum,dig;
void input(){
cin >> m;
rep(i,m)cin >> d[i] >> c[i];
}
void calc(){
sum = dig = 0;
rep(i,m){
sum += d[i]*c[i];
dig += c[i];
}
}
void solve(){
cout << (dig - 1) + (sum - 1) / 9 << endl;
}
int main(){
input();
calc();
solve();
}
| 0
| 25,690,073
|
#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>;
const ll m = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for (ll i = k; i <= n + 1; i++) {
cnt += i * (n - i + 1) + 1;
cnt %= m;
}
cout << cnt << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#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 repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
ll const MAX_N = 510000;
ll const MOD = 1000000007;
int main() {
string S_in, T;
cin >> S_in >> T;
vector<ll> idx;
rep(i, S_in.length() - T.length() + 1) {
bool is_s = true;
rep(j, T.length()) {
if (S_in[i + j] == '?') continue;
if (S_in[i + j] != T[j]) {
is_s = false;
break;
}
}
if (is_s) {
idx.push_back(i);
}
}
if (idx.size() == 0) {
cout << "UNRESTORABLE" << endl;
return 0;
}
rep(i, S_in.length()) {
if (S_in[i] == '?') S_in[i] = 'a';
}
vector<string> S_cand;
repv(idx) {
ll i = *it;
string S = S_in;
rep(j, T.length()) { S[i + j] = T[j]; }
S_cand.push_back(S);
}
sort(S_cand.begin(), S_cand.end());
cout << S_cand[0] << endl;
return 0;
}
| 0
| 26,602,434
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
const int maxn=1000005;
int head[maxn],t[maxn<<1],ne[maxn<<1],num,n;
inline void addedge(int x,int y){
ne[++num]=head[x];head[x]=num;t[num]=y;
ne[++num]=head[y];head[y]=num;t[num]=x;
}
int sg[maxn];
inline void dfs(int x,int f){
forE(i,x)if(t[i]!=f){
dfs(t[i],x);
sg[x]^=sg[t[i]]+1;
}
}
int main(){
read(n);
rep(i,1,n)head[i]=-1;
rep(i,1,n-1){
int x,y;read(x);read(y);
addedge(x,y);
}
dfs(1,-1);
puts(sg[1]?"Alice":"Bob");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int main(){
int n;
cin>>n;
map<int,int> sm;
for(int i=1;i<=n;i++){
auto pf=prime_factorize(i);
for(auto p : pf) sm[p.first]+=p.second;
}
int ans=0;
for(int a=2;a<=n;a++){
if(74<=sm[a]) ans++;
}
for(int a=2;a<=n;a++){
for(int b=2;b<=n;b++){
if(a!=b && sm[a]>=14 && sm[b]>=4) ans++;
}
}
for(int a=2;a<=n;a++){
for(int b=2;b<=n;b++){
if(a!=b && sm[a]>=24 && sm[b]>=2) ans++;
}
}
for(int a=2;a<=n;a++){
for(int b=2;b<=n;b++){
for(int c=b+1;c<=n;c++){
if(a!=b && a!=c && sm[a]>=2 && sm[b]>=4 && sm[c]>=4) ans++;
}
}
}
cout<<ans<<endl;
}
| 0
| 2,594,372
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,s1;
cin>>s;
for(int i=0;i<s.length();i++)
{
if(s[i]!='B')
s1+=s[i];
else
{
if(s1.length()>=1)
s1.pop_back();
}
}
cout<<s1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W,M;
cin>>H>>W>>M;
long long h[M],w[M];
set<pair<long long,long long>>m;
vector<long long> a(H,0);
vector<long long> b(W,0);
for(int i=0;i<M;i++){
cin>>h[i]>>w[i];
m.insert({h[i],w[i]});
a[h[i]-1]++;
b[w[i]-1]++;
}
vector<long long> c=a;
vector<long long> d=b;
sort(c.begin(), c.end());
sort(d.begin(), d.end());
long long maxa=c[H-1],maxb=d[W-1];
vector<long long> e;
vector<long long> f;
for(int i=0;i<H;i++){
if(a[i]==maxa){
e.push_back(i);
}
}
for(int i=0;i<W;i++){
if(b[i]==maxb){
f.push_back(i);
}
}
long long ans=maxa+maxb-1;
for(int i=0;i<e.size();i++){
for(int j=0;j<f.size();j++){
if(m.find({e[i]+1,f[j]+1}) == m.end()){
ans=maxa+maxb;
break;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 82,480,732
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__);
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
void out() {
cout << endl;
}
template <typename T, class... U>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
#define rep(i, n) for (long long i = 0; i < n; i++)
void solve();
#ifndef ONLINE_JUDGE
#include "./lib.hpp"
#endif
void solve() {
ini(N, M);
vector<string> A(N), B(M);
rep(i, N) cin >> A[i];
rep(i, M) cin >> B[i];
rep(i, N - M + 1) {
rep(j, N - M + 1) {
bool same = true;
rep(k, M)
same = same && A[i + k].substr(j, M) == B[k];
if (same) {
out("Yes");
return;
}
}
}
out("No");
}
|
#include<stdio.h>
main()
{
long long a,b,c,i,x,y;
while(scanf("%lld %lld %lld",&a,&b,&c)==3){
x=0;
while(x!=c){
if(x%2==0){
if(a%2!=0){
a--;
a=a/2;
b=b+a;
x++;
}
else{
a=a/2;
b=b+a;
x++;
}
}
else{
if(b%2!=0){
b--;
b=b/2;
a=a+b;
x++;
}
else{
b=b/2;
a=a+b;
x++;
}
}
}
printf("%lld %lld\n",a,b);
}
}
| 0
| 68,400,566
|
#include<cstdio>
#include<ctime>
#define gec getchar
#define FILE(F) freopen(F".in","r",stdin),freopen(F".out","w",stdout)
#define RunTime fprintf(stderr,"Running Time:%.5lfs\n",1.*clock()/1e6)
typedef long long ll;
typedef long double lb;
template<typename T>void umin(T &x,T y){if(x>y)x=y;}
template<typename T> T min(T x,T y){return x<y?x:y;}
template<typename T>void umax(T &x,T y){if(x<y)x=y;}
template<typename T> T max(T x,T y){return x>y?x:y;}
template<typename T>
inline void read(T &x)
{
x=0;bool f=0; char c=gec();
for(;c<'0'||c>'9';c=gec())f=(c=='-');
for(;c>='0'&&c<='9';c=gec())x=x*10+c-'0';
x=f?-x:x;
}
namespace DEBUG{
inline void fpr(char *c){fprintf(stderr,"%s\n",c);}
inline void fpr(int x,char *c){fprintf(stderr,"[ %s ] : = %d \n",c,x);}
inline void fpr(ll x,char *c){fprintf(stderr,"[ %s ] : = %lld \n",c,x);}
inline void fpr(double x,char *c){fprintf(stderr,"[ %s ] : = %.5lf\n",c,x);}
inline void fpr(lb x,char *c){fprintf(stderr,"[ %s ] : = %.5Lf\n",c,x);}
}using namespace DEBUG;
char ch[10];
ll NOW=999991515;
int sa[20],sb[20];
bool cmp(ll a,ll b)
{
sa[0]=sb[0]=0;
while(a)sa[++sa[0]]=a%10,a/=10;
while(b)sb[++sb[0]]=b%10,b/=10;
while(sa[sa[0]]==sb[sb[0]]&&sa[0]&&sb[0])sa[0]--,sb[0]--;
fpr(sa[0],"sa");
fpr(sb[0],"sb");
if(!sa[0]||!sb[0])return sa[0]<sb[0];
return sa[sa[0]]<sb[sb[0]];
}
bool Check(ll x)
{
return (x<NOW)==cmp(x,NOW);
}
bool ASK(ll x)
{
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",ch);
return ch[0]=='Y';
}
ll p9[11],p10[12];
int leng,Ans;
void Bit()
{
int l=1,r=10,mid,id=1;p10[0]=1;
for(int i=1;i<=10;i++)p9[i]=p9[i-1]*10+9,p10[i]=p10[i-1]*10;
while(l<=r) if(ASK(p9[mid=(l+r)>>1]))r=mid-1,id=mid;else l=mid+1;
leng=id;
l=1,r=10,id=1;
while(l<=r) if(ASK(p10[mid=(l+r)>>1]))l=mid+1;else r=mid-1,id=mid;
umax(leng,id);
}
void Get_Last()
{
int Last=0;
for(int i=9;i>=(Ans==0);i--)
if(ASK(1ll*(Ans*10+i)*10))Last=i;else break;
Ans=Ans*10+Last;
printf("! %d\n",Ans);
}
void ByBit()
{
if(leng==10){printf("! %d\n",1000000000);return ;}
int l=1,r=9,mid;
if(leng==1)Get_Last();
else
{
while(l<=r) if( ASK( 1ll*(mid=(l+r)>>1)) )l=mid+1,Ans=mid;else r=mid-1;
for(int i=2;i<leng;i++)
{
fpr(Ans,"Ans");
int l=0,r=9,mid,x;
while(l<=r)
{
if(ASK( (1ll*Ans*10+(mid=(l+r)>>1))) )l=mid+1,x=mid;else r=mid-1;
}
Ans=Ans*10+x;
}
Get_Last();
}
}
int main()
{
Bit();
ByBit();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110000;
int a[maxn];
int nxt[maxn][20];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, l, q; cin >> n;
for(int i = 1; i <= n; ++ i) cin >> a[i];
cin >> l;
for(int i = 1; i <= n; ++ i) {
int nx = upper_bound(a + i, a + n + 1, a[i] + l) - a;
nxt[i][0] = nx - 1;
}
for(int j = 1; j < 20; ++ j) for(int i = 1; i <= n; ++ i)
nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
cin >> q;
while(q --) {
int a, b; cin >> a >> b;
if(a > b) swap(a, b);
int ans = 0;
while(a != b) {
int j = 0, f = 0;
for(j = 0; j < 20; ++ j) {
if(nxt[a][j] >= b) {
if(j == 0) {
ans ++;
f = 1;
break;
} else {
-- j;
a = nxt[a][j];
ans += 1 << j;
break;
}
}
}
if(f) break;
}
cout << ans << "\n";
}
return 0;
}
| 0
| 41,081,449
|
#include <iostream>
using namespace std;
int main(){
int m,f,r;
int p[25565][3] = {0};
int i = 0;
do
{
cin >> p[i][0] >> p[i][1] >> p[i][2];
i++;
} while (p[i-1][0] != -1 || p[i-1][1] != -1 || p[i-1][2] != -1);
for (int j = 0; j < i-1; ++j)
{
if (p[j][0] == -1 || p[j][1] == -1)
{
cout << "F";
}else if ((p[j][0] + p[j][1]) >= 80)
{
cout << "A";
}else if ((p[j][0] + p[j][1]) >= 65)
{
cout << "B";
}else if ((p[j][0] + p[j][1]) >= 50)
{
cout << "C";
}else if ((p[j][0] + p[j][1]) >= 30 && p[j][2] >= 50)
{
cout << "C";
}else if ((p[j][0] + p[j][1]) >= 30 && p[j][2] < 50)
{
cout << "D";
}else{
cout << "F";
}
cout << endl;
}
}
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
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;
}
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N, K, S;
cin >> N >> K >> S;
VLL A(N);
rep(i,K){
A[i]=S;
}
rept(i,K,N){
if(S==1000000000){
A[i]=S-1;
}
else{
A[i]=S+1;
}
}
rep(i,N){
cout << A[i] << " ";
}
cout << endl;
}
| 0
| 518,313
|
#include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) { x+=y; y=x-y; x-=y; }
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a = 1;
while (111*a < n) a++;
cout << 111*a << ende;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i,n) cin >> t[i];
sort(all(t));
int ans = 0;
for(int i = 0; i < n;) {
ans++;
int s = i;
while(i<n && t[i]-t[s] <= k && i - s +1 <= c) ++i;
}
cout << ans << endl;
return 0;
}
| 0
| 60,753,264
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
string ans = "Christmas";
if(D<=24) ans += " Eve";
if(D<=23) ans += " Eve";
if(D<=22) ans += " Eve";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len, roads;
cin >> len >> roads;
vector<int> heights(len);
vector<bool> good(len, true);
for(int i = 0; i < len; i++)
cin >> heights[i];
int ans = len;
for(int i = 0; i < roads; i++) {
int a, b;
cin >> a >> b;
if(heights[a - 1] < heights[b - 1] && good[a - 1]) {
good[a - 1] = false;
ans -= 1;
} else if(heights[a - 1] > heights[b - 1] && good[b - 1]) {
good[b - 1] = false;
ans -= 1;
} else if(heights[a - 1] == heights[b - 1]) {
if(good[a - 1]) {
good[a - 1] = false;
ans -= 1;
}
if(good[b - 1]) {
good[b - 1] = false;
ans -= 1;
}
}
}
cout << ans;
}
| 0
| 76,936,653
|
#include<iostream>
using namespace std;
int main(){
int a;
int b;
int c;
cin>>a>>b;
c=a-b;
if(c<0){
cout<<"a"<<" "<<"<"<<" "<<"b"<<endl;
}
if(c==0){
cout<<"a"<<" "<<"=="<<" "<<"b"<<endl;
}
if(c>0){
cout<<"a"<<" "<<">"<<" "<<"b"<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll cnt=0;
ll ans=INT_MIN;
for(int i=0;i<n-1;i++)
{
if(arr[i]>=arr[i+1])
{
cnt++;
ans=max(ans,cnt);
}
else
{
ans=max(ans,cnt);
cnt=0;
}
}
ans=max(ans,cnt);
cout<<ans<<endl;
}
| 0
| 20,558,575
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
cin >> n;
cout << n/3;
}
|
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int imoss[60*60*24+100]={0};
for(int i=0;i<n;i++){
int t,m,s;
scanf("%d:%d:%d",&t,&m,&s);
imoss[t*3600+m*60+s]++;
scanf("%d:%d:%d",&t,&m,&s);
imoss[t*3600+m*60+s]--;
}
for(int i=1;i<=24*60*60;i++)imoss[i]+=imoss[i-1];
int ma=0;
for(int i=0;i<=24*60*60;i++)ma=max(ma,imoss[i]);
printf("%d\n",ma);
}
return 0;
}
| 0
| 93,092,453
|
#include "bits/stdc++.h"
using namespace std;
#define sp(x) cout<<setprecision(x);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX*0.99
#define print(s) cout<<(s)<<endl
#define lint long long
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
vector<int> a(n),t(n);
vector<lint> ans(n,-1);
REP(i,n) cin>>t[i];
ans[0] = 1; ans[n-1] = 1;
REP(i,n) cin>>a[i];
REP(i,n-1){
if(t[i]!=t[i+1]){
ans[i+1] = 1;
if(a[i+1]<t[i+1]) ans[i+1]=0;
}
else if(a[i]!= a[i+1]){
ans[i] = 1;
if(a[i]>t[i]) ans[i]=0;
}
}
lint cnt = 1;
REP(i,n){
if(ans[i]==-1) ans[i] = min(a[i],t[i]);
cnt*=ans[i];
cnt%=1000000007;
}
if(t[n-1]!=a[0]) cnt= 0;
print(cnt);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long int n,i;
int a,flag=0;
cin>>n;
cin>>a;
for(i=a;i>=0;i--){
if((n-i)%500==0){
flag=1;
break;
}
}
if(flag==1){cout<<"Yes"<<endl;}
else {cout<<"No"<<endl;}
}
| 0
| 19,877,104
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int n;
cin>>n;
vpii arr(n);
for(int i=0;i<n;i++) {
int a,b;
cin>>a>>b;
arr[i] = {a,b};
}
ll cnt = 0;
for(int i=n-1;i>=0;i--) {
cnt+= (arr[i].S-((arr[i].F+cnt)%arr[i].S))%arr[i].S;
}
cout<<cnt;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,int> pdi;
typedef pair<double,double> pdd;
typedef pair<double,ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<pdd> vdd;
typedef vector<pdi> vdi;
typedef vector<pdl> vdl;
#define fi first
#define se second
const ll INFLL=LLONG_MAX;
const int INF=INT_MAX;
const ll MAXLL=0x3f3f3f3f3f3f3f3f;
const int MAX=0x3f3f3f3f;
#define eb emplace_back
#define emp emplace
#define mp(a,b) make_pair(a,b)
template<class T> using min_heap=priority_queue<T,vector<T>,greater<T> >;
template<class T>
void sort(vector<T>& v){
sort(v.begin(),v.end());
}
template <class T, class U>
void sort(vector<T>& v,U func){
sort(v.begin(),v.end(),func);
}
template<class T>
void rsort(vector<T>& v){
sort(v.rbegin(),v.rend());
}
template <class T>
int lb_index(vector<T>& v,T k){
return lower_bound(v.begin(),v.end(),k)-v.begin();
}
template <class T>
int ub_index(vector<T>& v,T k){
return upper_bound(v.begin(),v.end(),k)-v.begin();
}
template<class T>
bool is_sorted(vector<T>& v){
return is_sorted(v.begin(),v.end());
}
template<class T>
bool sorted(vector<T>& v){
return is_sorted(v);
}
void precompute(){
return;
}
void solve(){
ll n,m;
cin>>n>>m;
min_heap<pll>pq;
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
pq.emp(a,b);
}
ll cnt=0,ans=0;
while(cnt<m){
pll u=pq.top();
pq.pop();
ans+=min(m-cnt,u.se)*u.fi;
cnt+=min(m-cnt,u.se);
}
cout<<ans;
}
int main(){
ios::sync_with_stdio(0);
int numberofsubtestcases=1;
precompute();
for(int looping=1;looping<=numberofsubtestcases;looping++){
solve();
}
return 0;
}
| 0
| 48,769,537
|
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n, x;
int roop = 0;
vector<int> count(10001, -1);
while (cin >> n >> x, n != 0)
{
count[roop]++;
for (int i = 1; i <= n - 2; i++)
{
for (int j = i + 1; j <= n - 1; j++)
{
for (int k = j + 1; k <= n; k++)
{
if (i + j + k == x)
{
count[roop]++;
}
}
}
}
roop++;
}
roop = 0;
while(count[roop] != -1)
{
cout << count[roop++] << endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#define INF 0x1234567812345678
using namespace std;
typedef long long int lli;
lli d[200][200];
int v,e;
void warshall() {
for(int k=0; k<v; k++)
for(int i=0; i<v; i++)
for(int j=0; j<v; j++)
if(d[i][k] != INF && d[k][j] != INF)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
int main(void) {
scanf("%d%d",&v,&e);
for(int i=0; i<200; i++)
for(int j=0; j<200; j++)
d[i][j] = 0x1234567812345678;
for(int i=0; i<e; i++) {
int s,t,d_;
scanf("%d%d%d",&s,&t,&d_);
d[s][t] = d_;
}
for(int i=0; i<v; i++)
d[i][i] = 0;
warshall();
for(int i=0; i<v; i++)
if(d[i][i] < 0) {
printf("NEGATIVE CYCLE\n");
return 0;
}
for(int i=0; i<v; i++)
for(int j=0; j<v; j++) {
if(d[i][j] == INF)
printf("INF");
else
printf("%lld", d[i][j]);
printf("%c", (j==v-1 ? '\n' : ' '));
}
return 0;
}
| 0
| 26,662,163
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M;
cin >> N >> M;
vector<int> memo(N);
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
if (A.at(i) == 1) {
memo.at(B.at(i) - 1)++;
}
if (B.at(i) == 1) {
memo.at(A.at(i) - 1)++;
}
}
bool ok = false;
for (int i = 0; i < M; i++) {
if (A.at(i) == N) {
if (memo.at(B.at(i) - 1) != 0) {
ok = true;
break;
}
}
if (B.at(i) == N) {
if (memo.at(A.at(i) - 1) != 0) {
ok = true;
break;
}
}
}
if (ok) {
cout << "POSSIBLE" << endl;
}
else {
cout << "IMPOSSIBLE" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long long int gcd(long long int a, long long int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
long long int lcm(long long int a, long long int b)
{
return a / gcd(a, b) * b;
}
int main() {
int n;
cin >> n;
vector<long long int> t(n);
rep(i,n) cin >> t.at(i);
long long int ans=t.at(0);
rep(i,n-1){
ans=lcm(ans,t.at(i+1));
}
cout << ans << endl;
return 0;
}
| 0
| 23,128,763
|
#include<iostream>
#include<string>
using namespace std;
int main(){
size_t len;
string str,code;
int time,pro1,pro2;
cin>>str>>time;
for(int abc=0;abc<time;abc++){
string damy;
cin>>code>>pro1>>pro2;
if(code=="print"){
cout<<str.substr(pro1,pro2-pro1+1)<<endl;
}else{
if(code=="replace"){
cin>>damy;
}else{
for(int abcd=pro2;abcd>=pro1;abcd--){
damy+=str[abcd];
}
}
str=str.substr(0,pro1)+damy+str.substr(pro2+1);
}
}
return 0;
}
|
#include <queue>
#include <iostream>
using namespace std;
int main()
{
string oper;
int n;
priority_queue<int> Q;
cin >> oper;
while (oper!="end")
{
if (oper == "insert")
{
cin >> n;
Q.push(n);
}
else if (!Q.empty()&&oper == "extract")
{
cout << Q.top() << endl;
Q.pop();
}
cin >> oper ;
}
}
| 0
| 4,638,128
|
#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;}
const 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 n;
ll a[60];
bool is_ok(ll mid){
ll sum=0;
REP(i, n){
if(a[i]-(n-1)+mid-1>=0){
sum+=(a[i]-(n-1)+mid-1)/(n+1)+1;
}
if(sum>mid){
return false;
}
}
return sum<=mid;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
REP(i, n){
cin>>a[i];
}
ll lb=-1, ub=1e18;
while(ub-lb>1){
ll mid=(lb+ub)/2;
if(is_ok(mid)){
ub=mid;
}
else{
lb=mid;
}
}
ll ans=0;
for(ll i=max(0ll, ub-500); i<ub+1; ++i){
if(is_ok(i)){
ans=i;
break;
}
}
cout<<ans<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=200003,INF=1<<30;
int dp[MAX];
int main(){
string S;cin>>S;
int N=S.size();
int bit=0;
vector<int> data(N+1,0);
map<int,vector<int>> MA;
for(int i=0;i<N;i++){
bit^=(1<<(S[i]-'a'));
if(MA[bit].size()==2) MA[bit].pop_back();
MA[bit].push_back(i+1);
data[i+1]=bit;
}
for(int i=1;i<=N;i++) dp[i]=INF;
dp[0]=0;
for(int i=0;i<N;i++){
if(dp[i]>=INF) continue;
for(auto to:MA[data[i]]) dp[to]=min(dp[to],dp[i]+1);
for(int j=0;j<26;j++){
data[i]^=(1<<j);
for(auto to:MA[data[i]]) dp[to]=min(dp[to],dp[i]+1);
data[i]^=(1<<j);
}
}
cout<<dp[N]<<endl;
}
| 0
| 46,395,115
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<vll> dp(2002,vll(2002,0));
void solve(){
int s;
cin>>s;
fr(i,3,s+1){
dp[i][1]=1;
}
vll sum(2002,0);
fr(i,6,s+1){
fr(j,1,2002){
sum[j]=(sum[j]+dp[i-3][j])%MOD;;
dp[i][j]=(dp[i][j]+sum[j-1])%MOD;
}
}
ll total=0;
fr(i,0,2002){
total=(total+ dp[s][i])%MOD;
}
cout<<total<<endl;
return;
}
int main()
{
boost();
int tc=1;
while(tc--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
ll ans;
rep(i, n){
if(i == 0){
ans = (ll)k;
continue;
}
ans *= (ll)(k-1);
}
cout << ans << endl;
return 0;
}
| 0
| 18,996,144
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int, string>> ps(m);
rep(i, m){
int a;
string b;
cin >> a >> b;
ps[i] = make_pair(a, b);
}
vector<int> ac(n + 1, 0), wa(n + 1 ,0);
rep(i, m){
if(ps[i].second == "AC"){
if(ac[ps[i].first] == 0){
ac[ps[i].first]++;
}
}else{
if(ac[ps[i].first] == 0){
wa[ps[i].first]++;
}
}
}
int a = 0, w = 0;
rep(i, n + 1){
if(ac[i] != 0){
a += ac[i];
w += wa[i];
}
}
cout << a << " " << w << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int k;
cin >> k >> s;
int n = s.size();
if(n <= k){
cout << s << endl;
return 0;
}else{
int i = 0;
while(i<=k-1){
cout << s.at(i);
if(i==k-1){
cout << "..." << endl;
return 0;
}
i++;
}
}
}
| 0
| 74,041,319
|
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,j,n) for(int i = j; i < n; i++)
#define RFOR(i,j,n) for(int i = j-1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) REP(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) printf(a?"Yes\n":"No\n")
#define _LIBCPP_DEBUG 0
using namespace std;
int64_t MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
REP(i,s.size()) {if(i % 2 == 0) cout << s[i];}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>using P=pair<T,Y>;
template<class T,class Y>ostream& operator<<(ostream&o,P<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
template<class A,size_t N,class T>void Fill(A(&a)[N],const T&v){fill((T*)a,(T*)(a+N),v);}
const int MOD = 1e9+7;
lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m=MOD){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m=MOD){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int N = 12;
int n, m, x, c[N];
int A[N][N];
int b[N];
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m >> x;
FOR(i, 0, n){
cin >> c[i];
FOR(j, 0, m) cin >> A[i][j];
}
int ans = IINF;
FOR(i, 0, bit(n)){
int s = 0;
memset(b, 0, sizeof b);
FOR(j, 0, n)if(i&bit(j)){
s += c[j];
FOR(k, 0, m) b[k] += A[j][k];
}
FOR(j, 0, m) if(b[j]<x) s = IINF;
mins(ans, s);
}
cout << ((ans==IINF) ? -1 : ans) << endl;
}
| 0
| 20,662,416
|
#include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int D[100005], P[100005];
void solve() {
vector<pair<int, int>> vec;
rep(i, N) vec.push_back(make_pair(P[i], D[i]));
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int ans = 0;
for (auto e : vec) {
if (e.second < M) {
M -= e.second;
} else {
ans += e.first * (e.second - M);
M = 0;
}
}
cout << ans << endl;
}
int main() {
while (cin >> N >> M, N) {
rep(i, N) cin >> D[i] >> P[i];
solve();
}
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define gcd(a,b) __gcd((a),(b))
#define fill(a,value) memset(a,value,sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout<<(x)<<endl;
#define sum(v)+x accumulate(v.begin(), v.end(),x);
typedef pair<int,int> pii;
typedef vector<int> vi;
signed main()
{
fastio;
cout << fixed << setprecision(12);
int n,k;
cin>>n>>k;
int ans=0;
f(i,n)
{
int x;
cin>>x;
if(x>=k)ans++;
}
print(ans)
return 0;
}
| 0
| 65,248,551
|
#include<stdio.h>
int main(void)
{
int i,j,l;
char a[11],b[11],c[11];
scanf("%s%s%s",&a,&b,&c);
i=j=l=0;
while(a[i] != '\0')
i++;
i=i-1;
while(b[j] != '\0')
j++;
j=j-1;
if(a[i] == b[0]){
if(b[j] == c[0])
printf("YES\n");
else
printf("NO\n");
}
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
if(v.size() >= 200) {
return "Too big container";
}
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
const int dy8[8] = { 1, 1, 1, 0, 0, -1, -1, -1 };
const int dx8[8] = { -1, 0, 1, -1, 1, -1, 0, 1 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
string toId(int p, int ind) {
string ans = to_string(p);
while(ans.size() < 6) {
ans = "0" + ans;
}
string inds = to_string(ind);
while(inds.size() < 6) {
inds = "0" + inds;
}
return ans + inds;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M; cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> sortIndY(N);
rep(i, M) {
cin >> P[i] >> Y[i];
--P[i];
sortIndY[P[i]].push_back(i);
}
vector<string> ans(M);
rep(i, N) {
sort(all(sortIndY[i]), [&](int&a, int&b) {
return Y[a] < Y[b];
});
rep(j, sortIndY[i].size()) {
ans[sortIndY[i][j]] = toId(i + 1, j + 1);
}
}
for(auto&a:ans) {
print(a);
}
}
| 0
| 38,890,877
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
const int INF=1001001001;
int main(){
int n, m;
cin >> n >> m;
vector<vector<P>> Ni(n, vector<P>(0));
vector<int> Mi(m);
for(int i=0; i<m; ++i){
int a, b, c;
cin >> a >> b >> c;
--a; --b;
Ni[a].push_back(make_pair(b,i));
Ni[b].push_back(make_pair(a,i));
Mi[i] = c;
}
priority_queue<P,vector<P>,greater<P>> que;
map<int, bool> usedMi;
for(int i=0; i<n; ++i){
que.push(make_pair(0, i));
vector<int> minc(n,INF);
minc[i] = 0;
while(!que.empty()){
int c, xi;
tie(c,xi) = que.top();
que.pop();
if(minc[xi] < c) continue;
for(P pi : Ni[xi]){
if(c+Mi[pi.second] < minc[pi.first]){
minc[pi.first] = c+Mi[pi.second];
que.push(make_pair(c+Mi[pi.second],pi.first));
}
}
}
queue<int> que2;
vector<bool> seached(n,true);
que2.push(i);
while(!que2.empty()){
int x = que2.front();
que2.pop();
seached[x] = false;
for(P pi : Ni[x]){
if(seached[pi.first] && minc[pi.first] == minc[x] + Mi[pi.second]){
usedMi[pi.second] = true;
que2.push(pi.first);
}
}
}
}
cout << m - usedMi.size() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long n;
cin >> n;
int a, b, res;
int half = (int)std::sqrt(n);
for(int i=half; i>=1; i--){
if(n%i == 0){
a = i;
b = n/i;
if (a<b){
res = (int)std::log10(b);
}
else{
res = (int)std::log10(a);
}
break;
}
}
printf("%d\n", res+1);
}
| 0
| 42,642,905
|
#include <bits/stdc++.h>
#include <vector>
#include <stack>
using namespace std;
int main(){
int a,b; string s;
cin>>a>>b;
cin>>s;
if(s[a] == '-')
{
for(int i=0;i<s.length();i++)
{
int number = s[i]-'0';
if(number >=0 && number<10)
continue;
else if(i!= a){
cout<<"No"<<endl;
return 0; }
}
}
else{
cout<<"No"<<endl;
return 0; }
cout<<"Yes"<<endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
typedef long long ll;
ll ans,a[60];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
cin>>a[i];
}
ll* p;
while(*(p=max_element(a+1,a+n+1)) >= (ll)n){
for(int i=1;i<=n;++i){
if(a+i!=p){
a[i]+=(*p)/(ll)n;
}
}
ans+=(*p)/(ll)n;
(*p)%=(ll)n;
}
cout<<ans<<endl;
return 0;
}
| 0
| 9,800,017
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
int n;
cin >> n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++){
cin >> a[i];
}
int count=0,pt=1;
vector<bool> check(n+1,false);
bool reach=false;
while(!reach){
if(a[pt]==pt)break;
if(check[pt])break;
check[pt]=true;
pt=a[pt];
count++;
if(pt==2)reach=true;
}
if(reach)cout << count << endl;
else cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
LL dp[SIZE][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
for(int i = 0; i < s.size(); ++i) {
if(i == 0) {
dp[i][1] = 2;
dp[i][0] = 1;
} else {
dp[i][0] = dp[i - 1][0] * 3 % MOD;
if(s[i] == '1') {
dp[i][0] = (dp[i][0] + dp[i - 1][1]) % MOD;
}
if(s[i] == '1') {
dp[i][1] = dp[i - 1][1] * 2 % MOD;
} else {
dp[i][1] = dp[i - 1][1];
}
}
}
cout << (dp[s.size() - 1][1] + dp[s.size() - 1][0]) % MOD << endl;
return 0;
}
| 0
| 67,280,367
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define pp pair<ll, pair<ll, ll>>
#define fi first
#define se second
int main() {
ll n; cin >> n;
ll ans = 0, s = 0;
rep(i, 0, n){
ll a; cin >> a;
if(!a){
ans += s/2;
s = 0;
}
s += a;
}
ans += s/2;
co(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
long long n, k;
cin >> n >> k;
double ans = 0.0;
for (long long num = 1; num <= n; num++) {
long long number = num;
long long index = 0;
while (number < k) {
index += 1;
number *= 2;
}
double plus = 1.0 / (double)n * pow(0.5, index);
ans += plus;
}
cout << fixed << setprecision(12) << ans << endl;
}
| 0
| 1,311,111
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int A; cin>>A;
vector<int> S={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout<<S.at(A-1)<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=110000;
ll a[maxn];
int n;
ll l;
ll q;
int f[maxn][35]={};
inline void init()
{
scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",a+i); scanf("%d%d",&l,&q);
for(int i=1;i<=n;i++)
{
int x=(int)(upper_bound(a+1,a+n+1,a[i]+l)-a-1);
f[i][0]=x;
}
for(int j=1;j<=30;j++) for(int i=1;i<=n;i++) f[i][j]=f[f[i][j-1]][j-1];
}
int main()
{
init();
while(q--)
{
ll a,b;
scanf("%lld %lld",&a,&b);
if(a>b)
swap(a,b);
int ans=0;
int cur=a;
for(int i=30;i>=0;i--)
if(f[cur][i]<b)
{
ans+=1<<i;
cur=f[cur][i];
}
printf("%d\n",ans+1);
}
return 0;
}
| 0
| 100,398,978
|
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, ans;
cin >> N;
vector<ll> T(N);
for(ll i = 0; i < N; i++) {
cin >> T.at(i);
if(i == 0) ans = T.at(0);
else ans = lcm(ans, T.at(i));
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define mii map<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define WL(t) while(t --)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define endl "\n"
#define e "\n"
#define show(arr) REP(i,arr.size()){cout<<arr[i]<<" ";}
const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
#define N 5010
void solve()
{
int n,ans=0;
vi arr;
cin >> n;
n *= 2;
REP(i,n){
int x;
cin >> x;
arr.pb(x);
}
sort(arr.begin(),arr.end());
for (int i=arr.size()-1;i>0;i-=2){
ans += min(arr[i],arr[i-1]);
}
cout<<ans;
}
signed main()
{
int t=1;
WL(t)solve();
return 0;
}
| 0
| 82,947,908
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int H,W,A,B;
cin >> H >> W >> A >> B;
if(A*2<W && B*2<H) {
rep(i,H) {
rep(j,W)
if(i<B&&j<A || i>=B&&j>=A)
cout << 1;
else
cout << 0;
cout << endl;
}
} else
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define MINS(m, s) m.insert(make_pair(s, 1));
#define MFIN(m, s) m.find(s) != m.end()
#define INF (1 << 29)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
cin >> q[i];
}
vector<int> v = p;
asort(v);
int cnt, p_cnt, q_cnt;
cnt = 1;
do {
if(p == v) {
p_cnt = cnt;
}
if(q == v) {
q_cnt = cnt;
}
cnt++;
} while(next_permutation(all(v)));
cout << abs(p_cnt - q_cnt) << endl;
return 0;
}
| 0
| 73,922,605
|
#include <iostream>
#include <iomanip>
using namespace std;
void Main() {
u_int64_t N;
cin >> N;
u_int64_t nums[N+1];
u_int64_t A[N+1];
for (u_int64_t i = 0; i <= N; i++) {
nums[i] = 0;
}
for (u_int64_t i = 1; i <= N; i++) {
u_int64_t num_A;
cin >> num_A;
nums[num_A]++;
A[i] = num_A;
}
u_int64_t comb = 0;
for (u_int64_t i = 1; i <= N; i++) {
comb += nums[i] * (nums[i] - 1) / 2;
}
for (u_int64_t i = 1; i <= N; i++) {
cout << comb - nums[A[i]] + 1 << endl;
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
|
#include <iostream>
#include <set>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int g=max(a,b), l=min(a,b);
set<int> st1, st2;
for (int i=1; i*i<=g; i++) {
if (g%i == 0) {
st1.insert(i);
st1.insert(g/i);
}
if (l%i == 0) {
st2.insert(i);
st2.insert(l/i);
}
}
set<int>::reverse_iterator itr=st2.rbegin();
int cnt = 0;
while (itr != st2.rend()) {
if (st1.find(*itr) != st1.end()) {
cnt++;
if (cnt == k) {
cout << *itr << endl;
return 0;
}
}
itr++;
}
}
| 0
| 26,933,675
|
#include <iostream>
using namespace std;
int main(void){
int H,W;
while(1){
cin>> H >> W;
if(H==0 && W==0){
break;
}else{
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(i==1||j==1||i==H||j==W){
cout<<"#";
}else{
cout<<".";
}
}
cout<<endl;
}
cout<<endl;
}
}
}
|
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se second
#define fr(i,a,b) for(ll i=a;i<=b;i++)
#define frr(i,b,a) for(ll i=b;i>=a;i--)
#define mem(a) memset(a, 0, sizeof(a))
#define vpi std::vector<pair<int,int>>
#define pii pair<int,int>
#define pb push_back
#define sall(v) sort(v.begin(),v.end())
#define all(v) (v.begin(),v.end())
#define minf -10000000
#define vi vector<int>
const ll infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> oset;
auto clk=clock();
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0,lim-1);
return uid(rang);
}
ll power(ll x, ll y,ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res*x) ;
y = y>>1;
x = (x*x);
}
return res;
}
ll max3(ll a,ll b,ll c){
return max(a,max(b,c));
}
ll min3(ll a,ll b,ll c){
return min(a,min(b,c));
}
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
void solve() {
int n;string s;cin>>n>>s;
int cnt[26];
fr(i,0,25)cnt[i]=1;
fr(i,0,n-1)cnt[s[i]-'a']++;
ll res=1;
fr(i,0,25){
res=(res*cnt[i])%mod;
}
res=(res+mod-1)%mod;
cout<<res<<endl;
return ;
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout<<fixed<<setprecision(8);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int t;
t=1;
while(t--){
solve();
}
#ifndef ONLINE_JUDGE
cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
return 0;
}
| 0
| 37,960,388
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
double N, X, T;
int main() {
cin >> N >> X >> T;
cout << int(ceil(N/X) * T) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
for (int i = 1; i < 4; i++) {
if((i != A) && (i != B)) cout << i << endl;
}
}
| 0
| 35,873,561
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSR(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n;
vector<int>ans[1005];
int main(){
scanf("%d",&n);
for(int i=2;i<=1000;i++){
if(i*(i-1)/2 != n) continue;
puts("Yes");
int cur = 0;
for(int j=0;j<i;j++) for(int k=j+1;k<i;k++){
ans[j].pb(cur);
ans[k].pb(cur);
cur++;
}
printf("%d\n",i);
rep(j,i){
printf("%d ",ans[j].size());
rep(k,ans[j].size()) printf("%d ",1+ans[j][k]);
puts("");
}
return 0;
}
puts("No");
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define GOODBYE do { cout << "Impossible" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
signed main(void){
int N;
int a;
vector<int> A;
int B[114]={};
cin >> N;
REP(i,N){
cin >> a;
A.push_back(a);
B[a]++;
}
sort(A.begin(),A.end());
int K=A[N-1];
if(B[K]<2)GOODBYE;
for(int i=K;i>(K+1)/2;i--){
B[i]-=2;
if(B[i]<0)GOODBYE;
}
B[(K+1)/2]--;if(K%2==1){B[(K+1)/2]--;}
if(B[(K+1)/2]<0)GOODBYE;
REP(i,N){
if(i<=(K+1)/2 && B[i]>0)GOODBYE;
}
cout << "Possible" << endl;
return 0;
}
| 0
| 56,333,154
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
long long cnt = 0, buf = K;
cnt += buf;
for(int i=1; i<N; i++){
buf = K - 1;
cnt *= buf;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const int MOD = 1000000007;
template<class T> inline int add(T& a, T b, T M = MOD){a=(a+M)%M;b=(b+M)%M;a=(a+b)%M;return a;};
template<class T> inline int mul(T& a, T b, T M = MOD){if(a>=M)a%=M;if(b>=M)b%=M;a*=b;if(a>=M)a%=M;return a;};
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
ll modpow(ll a, ll n, const ll &MOD = MOD){
ll ret = n == 0 ? 1 : modpow(a, n/2, MOD);
(ret *= ret) %= MOD;
if(n%2)((ret *= a) %= MOD);
return ret;
}
ll modinv(ll d, const ll &MOD = MOD){
return modpow(d, MOD-2, MOD);
}
int n,k, ans, sum;P p[110000];
priority_queue<P, vector<P>, greater<P>> que;
int cnt[110000];
signed main(){
cin>>n>>k;
rep(i,n){
cin>>p[i].second>>p[i].first;
}
sort(p,p+n,greater<P>());
int v = 0;
rep(i,k){
ans += p[i].first;
sum += p[i].first;
if(cnt[p[i].second] == 0)v++;
cnt[p[i].second]++;
que.push(p[i]);
}
ans += v*v;
repd(i, k, n){
int t = p[i].second, d = p[i].first;
if(cnt[t] >= 1)continue;
int b = false;
while(!que.empty()){
if(cnt[que.top().second] > 1){
b = true;v++;
sum -= que.top().first;
sum += d;
cnt[que.top().second]--;
cnt[t]++;
que.pop();
que.push(p[i]);
break;
}
que.pop();
}
if(b){
chmax(ans, sum+v*v);
}
}
cout << ans << endl;
}
| 0
| 51,202,631
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.