code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
using namespace std;
int main(){
long long int n,m,ans=0;
cin>>n>>m;
if(2*n<=m){
m-=2*n;
ans+=n;
}
else{
ans+=m/2;
m%=2;
}
ans+=m/4;
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll MOD=1000000007;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
ll n,m;
cin>>n>>m;
if(2*n<=m){
cout<<n+(m-2*n)/4;
}
else{
cout<<m/2;
}
return 0;
}
| 1 | 7,970,519 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<bool> v(26, true);
for(int i=0; i<s.size(); i++) v[s[i]-'a'] = false;
char ans;
for(int i=0; i<26; i++) {
if(v[i]) {
ans = i+'a';
cout << ans << endl;
break;
}
else if(i==25) cout << "None" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(int i = 0; i < n; ++i) cout << UIET[i] << " "
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
bool isPrime(int x){
for(int i = 2; i * i <= x; ++i){
if(x % i == 0) return 0;
}
return 1;
}
int fun(int n){
if(n & 1) return 3 * n + 1;
else return n/2;
}
int32_t main(){
SPEED;
string s;
cin >> s;
set<char> su;
if(len(s) == 1 && s[0] == 'a') {
cout << "None";
return 0;
}
for(char c: s){
su.insert(c);
}
if(len(su) == 26){
cout << "None" ;
return 0;
}
char c = 'a';
for(int i = 1; i < 30; ++i){
if(su.count(c)){
c++;
}
else{
cout << c;
return 0;
}
}
}
| 1 | 59,220,048 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
#include <atcoder/dsu>
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
atcoder::dsu dsu(N);
while (Q--) {
int t, u, v;
scanf("%d %d %d", &t, &u, &v);
if (t == 0) dsu.merge(u, v);
else puts(dsu.same(u, v) ? "1" : "0");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct Union_Find_Tree{
vector<int> par, rank, num;
const int n;
Union_Find_Tree(int n) : n(n){
par.assign(n, -1), rank.assign(n, 0), num.assign(n, 1);
}
int root(int x){
if(par[x] < 0 || par[x] == x) return x;
return par[x] = root(par[x]);
}
bool unite(int x, int y){
x = root(x), y = root(y);
if(x == y) return false;
if(rank[x] < rank[y]) swap(x, y);
if(rank[x] == rank[y]) rank[x]++;
par[y] = x, num[x] += num[y];
return true;
}
int size(int x) {return num[root(x)];}
bool same(int x, int y) {return root(x) == root(y);}
void clear(){
fill(all(par), -1), fill(all(rank), 0), fill(all(num), 1);
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, Q;
cin >> N >> Q;
Union_Find_Tree uf(N);
while(Q--){
int q, u, v; cin >> q >> u >> v;
if(q == 0) uf.unite(u, v);
else cout << uf.same(u, v) << '\n';
}
}
| 1 | 76,116,679 |
#include <stdio.h>
void swap(int* x, int* y)
{
int swap = *x;
*x = *y;
*y = swap;
}
int main(void)
{
int i, len1, len2, len3, n_iteration;
scanf("%d", &n_iteration);
for (i = 0; i < n_iteration; i++) {
scanf("%d %d %d", &len1, &len2, &len3);
if (len2 < len3) {
swap(&len2, &len3);
}
if (len1 < len2) {
swap(&len1, &len2);
}
if (len1 * len1 == len2 * len2 + len3 * len3) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
|
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<cstdio>
#include<cmath>
#define pb push_back
#define mp make_pair
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) loop(i,0,b)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
int main(){
int n;
cin>>n;
rep(i,n){
vector<int>in(3);
rep(j,3)cin>>in[j];
sort(all(in));
if(in[0]*in[0]+in[1]*in[1]==in[2]*in[2])cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
| 1 | 58,894,545 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = (int)s.size();
string s1 = "";
string s2 = "";
int minn1 = 0;
int minn2 = 0;
for (int i = 0; i < n; i += 2) {
if (i + 1 < n) {
s1 += "10";
s2 += "01";
}else {
s1 += "1";
s2 += "0";
}
}
for (int i = 0; i < n; ++i) {
if (s1[i] != s[i]) minn1++;
if (s2[i] != s[i]) minn2++;
}
cout << min(minn1,minn2);
}
|
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class CColoringColorfully {
public:
void solve(std::istream &in, std::ostream &out) {
string s;
in >> s;
vector<string> ss(2, "");
REP(i, s.length()) {
ss[i % 2] += "0";
ss[(i + 1) % 2] += "1";
}
int t0 = 0, t1 = 0;
REP(i, s.length()) {
if (s[i] != ss[0][i]) {
t0++;
} else if (s[i] != ss[1][i]) {
t1++;
}
}
out << min(t0, t1) << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
CColoringColorfully solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| 1 | 37,377,460 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long x,long y){
if(y==0)return x;
return gcd(y,x%y);
}
long long lcm(long x,long y){
return x*y/gcd(x,y);
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main()
{
string S;
cin>>S;
cout<<S.substr(0,4)+" "+S.substr(4)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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; }
string s;
void solve(){
cin >> s;
cout << s.substr(0,4) << " " << s.substr(4) << endl;
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
while(t--){
solve();
}
return 0;
}
| 1 | 15,783,466 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
printf("%d %d %.9f\n",a/b,a%b,1.*a/b);
return 0;
}
|
#include <stdio.h>
int main(){
int a,b;
scanf("%d",&a);scanf("%d",&b);
printf("%d %d %.5lf\n",(a/b),(a%b),((double)a/(double)b));
return 0;
}
| 1 | 95,946,757 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#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 yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
bool yes = 0;
bool boo = 0;
int maxx = -100000, minn = 100000;
int sum = 0;
int ans = 0;
int co = 0;
bool SQRT(ll a)
{
ll d = sqrt(a);
for (ll i = d - 100; i < d + 100; i++)
{
if (i * i == a)
{
return true;
}
}
return false;
}
int main()
{
int n, d;
cin >> n >> d;
int x[11][11];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < d; j++)
cin >> x[i][j];
}
bool sq[100010] = {};
for (int i = 0; i < 200; i++)
sq[i * i] = 1;
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
int s = 0;
for (int k = 0; k < d; k++)
{
s += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);
}
if (sq[s])
ans++;
}
}
pr(ans);
return 0;
}
|
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
ll bpow(ll b, ll p, ll m = 1000000007LL) {
ll rt = 1;
for (; p; p >>= 1, b = b * b % m)
if (p & 1)
rt = rt * b % m;
return rt;
}
int x[105][105];
int main() {
IOS;
int n, d;
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ll s = 0;
for (int k = 0; k < d; k++)
s += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);
ll ns = sqrt(s);
ns *= ns;
if (s == ns)
cnt++;
}
}
cout << cnt << endl;
}
| 1 | 6,505,710 |
#include <bits/stdc++.h>
using namespace std;
int A[100005];
int N,L;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int pos = -1;
cin >> N >> L;
for(int i=1;i<=N;i++)
{
cin >> A[i];
}
for(int i=N-1;i>=1;i--)
{
if(A[i] + A[i+1] >= L)
{
pos = i;
break;
}
}
if(pos==-1)
{
cout << "Impossible" << '\n';
return 0;
}
cout << "Possible" << '\n';
for(int i=1;i<pos;i++)
{
cout << i << '\n';
}
for(int i=N-1;i>pos;i--)
{
cout << i << '\n';
}
cout << pos << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ')'
constexpr ll MOD = 998244353;
ll INF = 1001001001001001001;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main(){
ll N,L;
cin >> N >> L;
bool flag = 0;
vector<ll> A(N),ans;
rep(i,N){
cin >> A[i];
if(i != 0){
if(A[i] + A[i-1] >= L && !flag){
FOR(j,1,i) ans.push_back(j);
RFOR(j,i+1,N) ans.push_back(j);
ans.push_back(i);
flag = 1;
}
}
}
if(flag){
cout << "Possible" << endl;
rep(i,N-1) cout << ans[i] << endl;
}else{
cout << "Impossible" << endl;
}
}
| 1 | 3,113,058 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x.size()))
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
ll x = 0; char ch = gc(); bool positive = 1;
for (; !isdigit(ch); ch = gc()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = gc()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a){
if(a<0){
a=-a; putchar('-');
}
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
ll rnd(){
ull ans=0;
For(i,0,4)ans=ans<<15^rand();
return ans%((ull)1<<63);
}
const int inf=1e9;
int main(){
#ifdef Brollan
freopen("1.in","r",stdin);
#endif
int n=read(),k=read(),s=read();
if(s<inf){
For(i,1,k)wri(s);
For(i,k+1,n)wri(inf);
}else{
For(i,1,k)wri(s);
For(i,k+1,n)wri(1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, s;
cin >> n >> k >> s;
vector<int> as(n);
int t = 500 * 1000 * 1000 + 1;
for (int &a : as) {
a = t++;
}
for (int i = 0; i < k; i++) {
as[i] = s;
}
cout << as[0];
for (int i = 1; i < n; i++) {
cout << ' ' << as[i];
}
cout << endl;
return 0;
}
| 1 | 65,982,980 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int a,b,c;
cin >> a >> b >> c;
rep(i,0,b){
if((a*i)%b==c){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
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 A,B,C;
cin >>A>>B>>C;
rep2(i,B+5){
if((A*i)%B==C){
cout<<"YES"<<endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 1 | 15,005,581 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(ll i=0;i<n;++i)
#define repinvi(i,n) for(int i=n-1;i>=0;--i)
#define sll(n) scanf("%lld", &n);
#define sii(n) scanf("%d", &n);
#define slf(n) scanf("%lf", &n);
#define pll pair<ll,ll>
#define pii pair<int,int>
#define psi pair<si,si>
typedef long long ll;
typedef double lf;
typedef short int si;
void Main(){
ll N, K, p, c;
cin >> N >> K;
vector<ll> ps(N, 0);
vector<ll> cs(N, 0);
vector<bool> searched(N, false);
vector<vector<ll>> groups;
rep(i, N){
sll(p);
-- p;
ps[i] = p;
}
rep(i, N){
sll(c);
cs[i] = c;
}
rep(i, N){
if(searched[i]){
continue;
}
vector<ll> group;
searched[i] = true;
ll next_v = ps[i];
group.emplace_back(i);
while(next_v != i){
searched[next_v] = true;
group.emplace_back(next_v);
next_v = ps[next_v];
}
groups.emplace_back(group);
}
ll index = 0;
ll ans = -1e15;
for(auto group:groups){
vector<ll> counter(group.size()*2, 0);
ll org_index;
rep(i, group.size()*2-1){
org_index = group[(i+1)%group.size()];
counter[i+1] = counter[i] + cs[org_index];
}
ll num_circle = K / group.size();
ll num_inc = K % group.size();
ll first_v;
if(counter[group.size()]>0){
first_v = 0;
}else{
first_v = cs[org_index];
}
ll max_add_score_num_inc = first_v;
ll max_add_score_all = first_v;
rep(i, group.size()){
rep(j, group.size()){
if(j==0){
continue;
}
if(j<=num_inc){
max_add_score_num_inc = max(max_add_score_num_inc, counter[i+j]-counter[i]);
}
max_add_score_all = max(max_add_score_all, counter[i+j]-counter[i]);
}
}
ll this_ans;
if(counter[group.size()] < 0){
if(K>=group.size()){
this_ans = max_add_score_all;
}else{
this_ans = max_add_score_num_inc;
}
}else{
this_ans = num_circle*counter[group.size()]+max_add_score_num_inc;
this_ans = max(this_ans, (num_circle-1)*counter[group.size()]+max_add_score_all);
}
ans = max(ans, this_ans);
++ index;
}
cout << ans <<endl;
}
int main(){
Main();
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
#define INF ((1LL<<62LL) - 1)
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k; cin >> n >> k;
int p[n+1], c[n+1];
for(int i=1;i<=n;i++) cin >> p[i];
for(int i=1;i<=n;i++) cin >> c[i];
int ans = -INF;
for(int i=1;i<=n;i++){
int start = p[i];
vector<int> v;
while(true){
v.push_back(c[start]);
start = p[start];
if(start == p[i]) break;
}
int times = k/v.size();
int extra = k%v.size();
int sum = 0;
for(int j=0;j<v.size();j++){
sum += v[j];
}
int temp = 0;
if(times == 0){
for(int j=0;j<extra;j++){
temp += v[j];
ans = max(ans, temp);
}
continue;
}
temp = (times - 1LL)*sum;
if(sum < 0) temp = 0;
if(times >= 2){
ans = max(ans, temp);
}
for(int j=0;j<v.size();j++){
temp += v[j];
ans = max(ans, temp);
}
for(int j=0;j<extra;j++){
temp += v[j];
ans = max(ans, temp);
}
}
cout << ans << "\n";
}
| 1 | 56,722,517 |
#include <cstdio>
#include <cmath>
int main(){
double a, b, C;
scanf("%lf %lf %lf", &a,&b,&C);
printf("%.8lf\n", 0.5*a*b*sin(M_PI*C/180));
printf("%.8lf\n", sqrt(a*a+b*b-2*a*b*cos(M_PI*C/180))+a+b);
printf("%.8lf\n", b*sin(M_PI*C/180));
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int a, b;
double c;
double pi = 3.1415926535;
cin >> a >> b >> c;
c = c*pi/180;
printf("%.8lf\n%.8lf\n%.8lf\n", a*b*sin(c)/2.0, a + b + sqrt(a*a + b*b - 2*a*b*cos(c)), b*sin(c));
return 0;
}
| 1 | 44,406,615 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, std::vector<std::vector<T>>(d2, std::vector<int>(d3, initValue)));
#define VECTOR_DIM2(T, name, d1, d2, initValue) \
std::vector<std::vector<T>> name(d1, std::vector<T>(d2, initValue));
#define VECTOR_DIM1(T, name, d1, initValue) \
std::vector<T> name(d1, initValue);
#define ll long long
#define ld long double
#define DUMP(v) "," #v ":" << v
int main(){
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a + 2 > b) {
ans = k+1;
} else {
if (k < a-1) {
ans = k+1;
} else {
k -= a-1;
ans = a + (b - a) * (k / 2);
if (k%2 == 1) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll K, A, B;
cin >> K >> A >> B;
ll ans = 0;
if(A+1 <= K) {
if(A+2 < B) {
if((K-A-1)%2 == 0) ans = B + (B-A) * ((K-A-1) / 2);
else ans = B + (B-A) * ((K-A-1) / 2) + 1;
}
else ans = K + 1;
}
else ans = K + 1;
PR(ans);
return 0;
}
| 1 | 95,424,547 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
#include <complex>
#include <cassert>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T &x, const T &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T &x, const T &y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET{IOSET(){cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
int main() {
int n, m, k;
cin >> n >> m >> k;
rep(i, n + 1) rep(j, m + 1) {
if (i * j + (n - i) * (m - j) == k) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i * j + (n - i) * (m - j) == k) {
cout << "Yes\n";
return 0;
}
}
}
cout << "No\n";
return 0;
}
| 1 | 88,805,909 |
#include <iostream>
using namespace std;
typedef long long llong;
void solve_test()
{
char a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) cout << "Yes\n";
else if (a == c && a != b) cout << "Yes\n";
else if (b == c && b != a) cout << "Yes\n";
else cout << "No\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tests = 1;
while (tests--)
solve_test();
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char S[6];
scanf("%s",S);
if (S[0]==S[1]&&S[1]!=S[2]||S[1]==S[2]&&S[0]!=S[2]||S[0]==S[2]&&S[0]!=S[1])
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
}
| 1 | 36,572,326 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
const double PI = acos(-1);
ll gcd(ll a, ll b){
if(a % b == 0) return b;
return gcd(b, a%b);
}
int main(){
ll n,x; cin >> n >> x;
ll xx; cin >> xx;
ll ans = abs(xx - x);
for(int i = 1; i < n; i++){
cin >> xx;
ans = gcd(ans, abs(xx - x));
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
a.push_back(x);
sort(a.begin(), a.end());
vector<int> dif(a.size() - 1);
rep(i, dif.size()) {
dif.at(i) = a.at(i + 1) - a.at(i);
}
int ans = dif.at(0);
for (int i = 1; i < dif.size(); i++) {
ans = gcd(ans, dif.at(i));
}
cout << ans << endl;
}
| 1 | 58,731,630 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
double w,h;
cin>>w>>h;
double x,y;
cin>>x>>y;
double ans=(w*h)/2;
cout<<ans<<" ";
if(w/2==x && h/2==y)
cout<<"1";
else
cout<<"0";
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
double W, H, x, y, ans, z = 0;
cin >> W >> H >> x >> y;
ans = W * H / 2;
if (x == W / 2 && y == H / 2) {
z = 1;
}
cout << setprecision(15) << ans << " " << z;
return 0;
}
| 1 | 89,462,769 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw "\n"
int main(void)
{
CIN;
string S;
cin >> S;
regex R ("A[a-z][a-z]*C[a-z]*[a-z]");
cout << ((regex_match(S, R)) ? "AC" : "WA") << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin>>s;
bool ans=s[0]=='A';
int cnt=0;
for(int i=1;i<s.size();i++)
{
if('a'<=s[i]&&s[i]<='z');
else
{
if(2<=i&&i<=s.size()-2&&cnt==0&&s[i]=='C')
{
cnt++;
}
else
{
ans=false;
break;
}
}
}
ans&=cnt==1;
puts(ans?"AC":"WA");
return 0;
}
| 1 | 50,659,222 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n;
cin >> n;
vl a(n);
map<ll, set<int>> cnt;
for (int i = 0; i < n; ++i) {
cin >> a[i];
cnt[a[i]].insert(i);
}
vl ret(n, 0);
ll size = cnt.rbegin()->second.size();
while (true) {
auto p = cnt.rbegin();
auto pm = next(p);
if (pm == cnt.rend())
break;
ret[*(p->second.begin())] += (p->first - pm->first) * size;
size += pm->second.size();
pm->second.insert(*(p->second.begin()));
cnt.erase(p->first);
}
auto p = cnt.rbegin();
ret[*(p->second.begin())] += (p->first - 0) * size;
for (auto &r : ret) {
cout << r << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<long long> b(n);
vector<pair<int, int>> c(n);
for (int i = 0; i < n; i++) c[i] = make_pair(~a[i], i);
sort(c.begin(), c.end());
int mn = n;
for (int i = 0; i < n; i++) {
int j = c[i].second;
mn = min(mn, j);
b[mn] += (i + 1LL) * (~c[i].first - (i == n - 1 ? 0 : ~c[i + 1].first));
}
for (int i = 0; i < n; i++) {
cout << b[i] << '\n';
}
return 0;
}
| 1 | 14,637,517 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int min_n= 1000000001, max_n = 0;
int current_n;
for (int i = 0; i < N; i++)
{
cin >> current_n;
min_n = min(min_n, current_n);
max_n = max(max_n, current_n);
}
cout << max_n - min_n << endl;
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int main() {
in(int, n);
V<int> a(n);
rep(i, n) cin >> a[i];
out(*max_element(all(a)) - *min_element(all(a)));
}
| 1 | 32,224,875 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
bool isPrime(ll x){
ll i;
if(x < 2)return 0;
else if(x == 2) return 1;
if(x%2 == 0) return 0;
for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
return 1;
}
signed main(void)
{
ll n;
cin >> n;
ll r = 1e+13;
if (isPrime(n) == 1) {
mes(n-1);
re0;
}
rrep(i, n) {
if (i > n/i) break;
if (n % i == 0) {
r = min((i+n/i -2), r);
}
}
mes(r);
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
int main(){
long long N,X,Y;
long long ans;
cin >> N;
ans = N;
for(long long i=1;i*i<=N;i++){
if(N % i == 0){
X = i;
Y = N / i;
ans = min(ans,X-1+Y-1);
}
}
cout << ans << endl;
}
| 1 | 30,044,816 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <complex>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include <iomanip>
#include <chrono>
#include <unordered_map>
#include <set>
using namespace std;
using ull = unsigned long long;
using ll =long long ;
using prll =pair<ll, ll>;
constexpr ll MOD = 1000000007;
constexpr ll mINF = -922337200085470000;
constexpr ll pINF = 1LL << 60;
constexpr ull uINF= 1844674407399900000;
constexpr long double pi = 3.1415926535897932384;
constexpr ll juu = 100000;
constexpr ll hyaku = 1000000;
constexpr int dx[4] = {0,0,1,-1};
constexpr int dy[4] = {1,-1,0,0};
constexpr int ddx[8] = {0,0,1,-1,1,1,-1,-1};
constexpr int ddy[8] = {1,-1,0,0,-1,1,1,-1};
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Debug(xx) cerr << " DEBUG:"<< xx << endl ;
#define Debug2(xx,yy) cerr << " DEBUG:"<< xx << ":" << yy<< endl ;
ll factor[300];
ll memory[300];
void primefac(ll num)
{
int i = 0, kosuu = 0;
while (*(factor + i) != 0)
{
while (num % *(factor + i) == 0)
{
num /= *(factor + i);
memory[*(factor + i)] += 1;
}
if (num == 1)
break;
i++;
}
}
int elast(ll number)
{
ll tmp = 0;
int flag = 0;
*factor = 2;
for (int i = 3; i <= number; i++)
{
flag = 0;
for (int j = 0; j <= tmp; j++)
{
if (i % (*(factor + j)) == 0)
{
flag = 1;
break;
}
}
if (flag)
continue;
tmp += 1;
*(factor + tmp) = i;
}
return tmp + 2;
}
ll powpow(ll n, ll p)
{
if (p == 1)
return n % MOD;
if (p % 2 == 1)
{
return (n * powpow(n, p - 1)) % MOD;
}
ll dob = powpow(n, p / 2);
return (dob * dob) % MOD;
}
ll nCrMod(ll n, ll r)
{
ll child = 1;
ll parent = 1;
if (r == 0)
return 1;
for (ll i = 0; i < r; ++i)
{
child = child * (n - i) % MOD;
parent = parent * (r - i) % MOD;
}
ll ans = child * powpow(parent, MOD - 2);
return ans % MOD;
}
ll to_digit(ll num){
return (ll)(to_string(num).size());
}
ll nCr(ll n, ll r)
{
ll val = 1,val2 = 1;
if (r == 0)
return 1;
if(n < r)
return 0;
for (ll i = 0; i < r; ++i)
{
val *= (n - i);
val2 *= (r - i);
}
return val/val2;
}
ll nPr(ll n, ll r)
{
ll val = 1;
for (ll i = 0; i < r; ++i)
{
val *= (n - i);
}
return val;
}
template <typename T>
bool chmin(T &a, const T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmax(T &a, const T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
void eraseSame(T &a)
{
sort(all(a));
a.erase(unique(all(a)), a.end());
}
template <typename T>
bool swapmax(T &a, T &b)
{
T temp;
temp = a;
if (a > b)
{
swap(a,b);
return false;
}
return true;
}
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <typename T>
void splitIn(ll N, vector<T> &array)
{
T temp;
int i = 0;
if (N == 0)
{
return;
}
array.resize(N);
while (cin >> temp)
{
array[i] = temp;
++i;
if (i >= N)
{
break;
}
}
return;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, m,l;
ll ans = 0;
ll sum = 0;
string s;
vector<ll> v;
cin >> k >> n >> m;
if(n+2 < m && k + 1 >= n + 2){
ll kremain;
kremain = (k) - (n - 1) - 2;
ans += m;
ll rp;
rp = kremain / 2;
ans += rp*(m-n) + (kremain % 2);
}
else{
ans = k +1;
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
ll K,A,B;
cin >> K >> A >> B;
if(B-A<=2 || K < A-1){
fin(1+K);
}else{
ll sum=A;
K-=A-1;
if(K%2 == 1){
sum++;
K--;
}
sum += (B-A)*(K/2);
fin(sum);
}
}
| 1 | 73,181,708 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#define pii pair<int,int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[]={0,0,+1,-1};
int fy[]={+1,-1,0,0};
using namespace std;
const int maX=1e5+1;
vector<ll>Graph[maX],cost[maX];
ll visit[maX];
ll x[10];
ll y[10];
int main()
{
char a,b;
ll i,j,x,y,z;
cin>>x>>a>>y>>b>>z;
if(x<=2019 && y<=4 && z>=1 && z<=30 )cout<<"Heisei"<<endl;
else cout<<"TBD"<<endl;
return 0;
}
|
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
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; }
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s<="2019/04/30") cout<<"Heisei"<<endl;
else cout<<"TBD"<<endl;
return 0;
}
| 1 | 14,824,528 |
#include <iostream>
#include <cstdio>
using namespace std;
int data[24][60][60];
int main(void)
{
int n;
while (cin >> n, n){
for (int i = 0; i < 24; i++){
for (int j = 0; j < 60; j++){
for (int k = 0; k < 60; k++){
data[i][j][k] = 0;
}
}
}
int s[3], e[3];
for (int i = 0; i < n; i++){
scanf("%d:%d:%d %d:%d:%d", &s[0], &s[1], &s[2], &e[0], &e[1], &e[2]);
int h = s[0], m = s[1], sec = s[2];
data[h][m][sec] += 1;
while (1){
if (h == e[0] && m == e[1] && sec == e[2]){
data[h][m][sec]--;
break;
}
sec++;
if (sec == 60){
m++;
sec = 0;
}
if (m == 60){
h++;
m = 0;
}
data[h][m][sec] += 1;
}
}
int ret = 0;
for (int i = 0; i < 24; i++){
for (int j = 0; j < 60; j++){
for (int k = 0; k < 60; k++){
ret = max(ret, data[i][j][k]);
}
}
}
cout << ret << endl;
}
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
struct Edge{int to,from,cost;};
#ifdef DEBUG
#define debug cout
#else
stringstream __ss__;
#define debug __ss__
#endif
template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << " "; debug << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }
#define rep(i,n) for(int i=0;i<(n);++i)
#define repd(i,n) for(int i=(n)-1;i>=0;i--)
#define repn(i,m,n) for(int i=(m);i<=(n);++i)
#define repnd(i,m,n) for(int i=(n)-1;i>=(m);i--)
#define rep0(i,n) for(i=0;i<(n);++i)
#define all(n) n.begin(),n.end()
#define sz(n) ((int)(n).size())
#define IL for(;;)
#define MP make_pair
#define PB push_back
#define SS stringstream
#define X second
#define Y first
#define PUTLINE debug<<"LINE:"<<__LINE__<<endl;
const int INF = 2147483647/3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[]={1,-1,0,0,1,-1,1,-1,0};
const int dy[]={0,0,1,-1,1,-1,-1,1,0};
int k[300000];
int main() {
IL{
memset(k,0,sizeof(k));
int n=in();
if(n==0)break;
string f,t;
int from,to;
rep(i,n){
cin>>f>>t;
from=(f[0]-'0')*100000+(f[1]-'0')*10000+(f[3]-'0')*1000+(f[4]-'0')*100+(f[6]-'0')*10+f[7]-'0';
to=(t[0]-'0')*100000+(t[1]-'0')*10000+(t[3]-'0')*1000+(t[4]-'0')*100+(t[6]-'0')*10+t[7]-'0';
++k[from];
--k[to];
}
int res=0,p=0;
rep(i,300000){
p+=k[i];
chmax(res,p);
}
cout<<res<<endl;
}
return 0;
}
| 1 | 78,899,975 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
struct Dice {
Dice() { d = new int[6]; }
~Dice() { delete[] d; }
void get() {
for (int i = 0; i < 6; i++) {
cin >> d[i];
}
}
void roll(char c) {
int t = d[0];
int tmp = d[1];
switch (c) {
case 'N':
d[0] = d[1]; d[1] = d[5]; d[5] = d[4]; d[4] = t;
break;
case 'S':
d[0] = d[4]; d[4] = d[5]; d[5] = d[1]; d[1] = t;
break;
case 'W':
d[0] = d[2]; d[2] = d[5]; d[5] = d[3]; d[3] = t;
break;
case 'E':
d[0] = d[3]; d[3] = d[5]; d[5] = d[2]; d[2] = t;
break;
case 'r':
d[1] = d[2]; d[2] = d[4]; d[4] = d[3]; d[3] = tmp;
break;
default:
break;
}
}
int top() { return d[0]; }
int right() { return d[2]; }
int front() { return d[1]; }
int left() { return d[3]; }
Dice & operator=(Dice & obj) { this->d = obj.d; }
int* d;
};
int main() {
Dice d;
d.get();
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
if (d.left() == l) { d.roll('E'); }
if (d.right() == l) { d.roll('W'); }
while (d.top() != l) { d.roll('N'); }
while (d.front() != r) { d.roll('r'); }
cout << d.right() << endl;
}
return 0;
}
|
#include<string>
#include<iostream>
using namespace std;
class Dice{
int dn[6];
int up, front;
string qu;
public:
Dice(int d1, int d2, int d3, int d4, int d5, int d6){
dn[0] = d1;
dn[1] = d2;
dn[2] = d3;
dn[3] = d4;
dn[4] = d5;
dn[5] = d6;
}
void Result(string m){
int w;
qu = m;
for (int i = 0; i < qu.size(); i++){
switch (qu[i]){
case 'E':
w = dn[0];
dn[0] = dn[3];
dn[3] = dn[5];
dn[5] = dn[2];
dn[2] = w;
break;
case 'N':
w = dn[5];
dn[5] = dn[4];
dn[4] = dn[0];
dn[0] = dn[1];
dn[1] = w;
break;
case 'S':
w = dn[0];
dn[0] = dn[4];
dn[4] = dn[5];
dn[5] = dn[1];
dn[1] = w;
break;
case 'W':
w = dn[0];
dn[0] = dn[2];
dn[2] = dn[5];
dn[5] = dn[3];
dn[3] = w;
break;
}
}
}
string Dice2(int a,int b){
up = a;
front = b;
string qq;
if (up == dn[0]){
if (front == dn[2]){
qq = "WSE";
}
else if (front == dn[3]){
qq = "ESW";
}
else if (front == dn[4]){
qq = "WSSE";
}
}
else if (up == dn[1]){
if (front == dn[0]){
qq = "SEE";
}
else if (front == dn[2]){
qq = "WSEE";
}
else if (front == dn[3]){
qq = "ESWW";
}
else if (front == dn[5]){
qq = "N";
}
}
else if (up == dn[2]){
if (front == dn[0]){
qq = "SW";
}
else if (front == dn[1]){
qq = "W";
}
else if (front == dn[4]){
qq = "SSW";
}
else if (front == dn[5]){
qq = "NW";
}
}
else if (up == dn[3]){
if (front == dn[0]){
qq = "SE";
}
else if (front == dn[1]){
qq = "E";
}
else if (front == dn[4]){
qq = "SSE";
}
else if (front == dn[5]){
qq = "NE";
}
}
else if (up == dn[4]){
if (front == dn[0]){
qq = "S";
}
else if (front == dn[2]){
qq = "WS";
}
else if (front == dn[3]){
qq = "ES";
}
else if (front == dn[5]){
qq = "WWS";
}
}
else if (up == dn[5]){
if (front == dn[1]){
qq = "WW";
}
else if (front == dn[2]){
qq = "SWS";
}
else if (front == dn[3]){
qq = "ESE";
}
else if (front == dn[4]){
qq = "NN";
}
}
return qq;
}
int get_right(){
return dn[2];
}
};
int main()
{
int dnum[6];
int qno, ue, mae;
string q;
for (int i = 0; i < 6; i++){
cin >> dnum[i];
}
Dice d(dnum[0], dnum[1], dnum[2], dnum[3], dnum[4], dnum[5]);
cin >> qno;
for (int i = 0; i < qno; i++){
cin >> ue >> mae;
q = d.Dice2(ue, mae);
d.Result(q);
cout << d.get_right() << endl;
}
return 0;
}
| 1 | 55,174,600 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int const INF = 1001001001;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
if(n < 4) {
puts("No");
return 0;
}
if(s.substr(0, 4) =="YAKI") puts("Yes");
else puts("No");
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
string s;cin>>s;
if(s.substr(0,4)=="YAKI")cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
| 1 | 44,900,686 |
#include <stdio.h>
typedef long long lint;
int main() {
lint X, Y;
scanf("%lld%lld", &X, &Y);
if(-((X + Y) % 2) <= X - Y && X - Y <= (X + Y) % 2) printf("Brown");
else printf("Alice");
return 0;
}
|
#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_a_genius = 0; ngtkana_is_a_genius < int(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (int i = int(begin); (i) < int(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#ifndef STOPIT
#define debug(...)\
do {\
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
debug_impl(__VA_ARGS__);\
std::cerr << std::noboolalpha;\
} while (false)
#else
#define debug(...) {}
#endif
int main() {
std::cin.tie(0); std::cin.sync_with_stdio(false);
lint x, y; std::cin >> x >> y;
lint z = x - y;
if (z<0) z=-z;
bool ans = 1 < z;
std::cout << (ans ? "Alice" : "Brown") << std::endl;
return 0;
}
| 1 | 67,511,884 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
ll dp[2200][2200];
int main(){
dp[0][0] = 1;
ll sum; cin >> sum;
ll ans = 0;
for( int i = 0; i < 2100; ++i ){
ll pre = 0;
for( int s = 0; s <= sum-3; ++s ){
pre += dp[i][s];
pre %= mod;
dp[i+1][s+3] = pre;
}
ans += dp[i+1][sum];
ans %= mod;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> ppiii;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
ll S;
cin >> S;
ll res[S + 10];
for(int i = 0; i <= S + 10 ; i++) res[i] = 1;
res[0] = res[1] = res[2] = 0;
ll sub = res[3];
for(int i = 6; i <= S + 10; i++){
res[i] = (res[i] + sub) % MOD;
sub = (sub + res[i - 2]) % MOD;
}
cout << res[S] << endl;
return 0;
}
| 1 | 76,973,186 |
#include<iostream>
using namespace std;
const int MAX = 11;
const int INF = (1<<20);
int D[MAX][MAX];
int n, pos;
void init(){
for(int i = 0; i < MAX; i++)
for(int j = 0; j < MAX; j++)
D[i][j] = INF;
pos = 0;
}
void solve(){
for(int i = 0; i < MAX; i++)
D[i][i] = 0;
for(int k = 0; k < MAX; k++)
for(int i = 0; i < MAX; i++)
for(int j = 0; j < MAX; j++)
D[i][j] = min(D[i][j],D[i][k]+D[k][j]);
int city = -1, T = INF;
for(int i = 0; i <= pos; i++){
int tmp = 0;
for(int j = 0; j <= pos; j++)
tmp += D[i][j];
if(T > tmp){
city = i;
T = tmp;
}
}
cout << city << " " << T << endl;
}
int main(){
while(cin >> n && n){
init();
for(int i = 0; i < n; i++){
int f,t,c;
cin >> f >> t >> c;
pos = max(pos,max(f,t));
D[f][t] = D[t][f] = c;
}
solve();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <utility>
using namespace std;
typedef long long ll;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
int d[20][20];
int cost[20][20];
int n;
int numTown;
int t;
void show(){
for(int i=0;i<t;i++){
for(int j=0;j<t;j++){
printf("%10d ",cost[i][j]);
}
cout<<endl;
}
cout<<endl;
}
void solve(){
for(int i=0;i<t;i++)for(int j=0;j<t;j++)cost[i][j]=d[i][j];
for(int k=0;k<t;k++){
for(int i=0;i<t;i++){
for(int j=0;j<t;j++){
if(i==j||i==k||j==k)continue;
cost[i][j]=cost[j][i]=min(cost[i][j],cost[i][k]+cost[k][j]);
}
}
}
int ans=INT_MAX;
int p=0;
for(int i=0;i<t;i++){
int sum=0;
for(int j=0;j<t;j++){
sum+=cost[i][j];
}
if(ans>sum){
ans=sum;
p=i;
}
}
cout<<p<<" "<<ans<<endl;
}
int main(void){
while(cin>>n,n){
t=0;
for(int i=0;i<22;i++){
for(int j=0;j<22;j++){
if(i==j)d[i][j]=0;
else d[i][j]=10000000;
}
}
for(int i=0;i<n;i++){
int a,b,c;
cin>>a>>b>>c;
d[a][b]=d[b][a]=c;
t=max(t,max(a+1,b+1));
}
solve();
}
}
| 1 | 11,780,428 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
int h,w,n;
char map[1005][1005];
bool vis[1005][1005];
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
int cnt;
int f[1001*1001];
int BFS(int x,int y,int t)
{
int m;
memset(vis,0,sizeof vis);
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
if(map[i][j]=='X')
{
vis[i][j]==1;
}
}
}
queue<int> q;
q.push(x*1001+y);
int xxx,yyy;
while(!q.empty())
{
int xx=q.front()/1001,yy=q.front()%1001;
q.pop();
if(map[xx][yy]=='0'+t)
{
xxx=xx,yyy=yy;
break;
}
for(int i=0;i<4;i++)
{
if(!vis[xx+dx[i]][yy+dy[i]]&&map[xx+dx[i]][yy+dy[i]]!='X')
{
q.push((xx+dx[i])*1001+yy+dy[i]);
vis[xx+dx[i]][yy+dy[i]]=1;
f[(xx+dx[i])*1001+yy+dy[i]]=xx*1001+yy;
}
}
}
m=1;
int s=xxx*1001+yyy;
while(f[s]!=x*1001+y)
{
m++;
s=f[s];
}
return m;
}
int bfs(int f,int t)
{
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
if(map[i][j]-'0'==f)
{
return(BFS(i,j,t));
}
}
}
}
int main()
{
cin>>h>>w>>n;
cnt=0;
memset(map,'X',sizeof map);
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
cin>>map[i][j];
}
}
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
if(map[i][j]=='S')
{
map[i][j]='0';
}
}
}
for(int i=0;i<n;i++)
cnt+=bfs(i,i+1);
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using namespace std;
int dx[4] = {-1,0,0,1}, dy[4] = {0,-1,1,0};
char a[1002][1002];
int b[1002][1002];
queue<pair<int,int> > q;
int main(){
int h, w, n, t = 0;
char str[1000][1000];
rep(i,1002)rep(j,1002)a[i][j] = 'X';
scanf("%d%d%d", &h, &w, &n);
rep(i,h)scanf("%s", str[i]);
rep(i,h)rep(j,w){
a[i+1][j+1] = str[i][j];
if(a[i+1][j+1] == 'S'){
q.push(dmp(i+1, j+1));
}
}
pair<int,int> p;
int x, y, xx, yy, tx, ty, res, ans = 0;
for(int i = 1;i <= n;i++){
fill((int*)b, (int*)(b+1002), INF);
y = q.front().fi, x = q.front().se;
b[y][x] = 0;
while(!q.empty()){
p = q.front();q.pop();
y = p.fi;x = p.se;t = b[y][x];
for(int j = 0;j < 4;j++){
xx = x+dx[j], yy = y+dy[j];
if(a[yy][xx] != 'X'){
if(b[yy][xx] == INF)q.push(dmp(yy, xx));
b[yy][xx] = min(b[yy][xx], t+1);
}
}
if(a[y][x] == i+'0'){
tx = x;ty = y;
res = t;
}
}
q.push(dmp(ty, tx));
ans += res;
}
printf("%d\n", ans);
return 0;
}
| 1 | 73,217,678 |
#include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
int dx[4]={ 1,0,-1,0 };
int dy[4]={ 0,1,0,-1 };
int H, W;
string S[100];
int dp[100][100][2];
int solve(int y, int x, bool c){
if(y >= H || x >= W) return 1e9;
if(y == H-1 && x == W-1){
if(!c && S[y][x] == '#') return 1;
return 0;
}
if(dp[y][x][c] != -1) return dp[y][x][c];
int ret;
if(!c && S[y][x] == '#'){
ret = min(solve(y+1, x, !c), solve(y, x+1, !c)) + 1;
}
else if(c && S[y][x] == '.'){
ret = min(solve(y+1, x, !c), solve(y, x+1, !c));
}
else{
ret = min(solve(y+1, x, c), solve(y, x+1, c));
}
return dp[y][x][c] = ret;
}
signed main(){
cin >> H >> W;
rep(i, H) cin >> S[i];
memset(dp, -1, sizeof(dp));
cout << solve(0, 0, 0) << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> dp(h, vector<int>(w, inf));
dp[0][0] = (s[0][0] == '.' ? 0 : 1);
rep(i, h) {
rep(j, w) {
if (i + 1 != h) {
if (s[i][j] == '.' && s[i + 1][j] == '#') chmin(dp[i + 1][j], dp[i][j] + 1);
else chmin(dp[i + 1][j], dp[i][j]);
}
if (j + 1 != w) {
if (s[i][j] == '.' && s[i][j + 1] == '#') chmin(dp[i][j + 1], dp[i][j] + 1);
else chmin(dp[i][j + 1], dp[i][j]);
}
}
}
cout << dp[h - 1][w - 1] << '\n';
return 0;
}
| 1 | 96,617,423 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
const int MX = 100005;
int w[2], a[2], t;
long long ans, p[2][MX];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> w[0] >> w[1];
rep(i,2){
rep(j,w[i]) cin >> p[i][j];
p[i][w[i]] = 1e9;
sort(p[i],p[i]+w[i]);
}
while(a[0] + a[1] < w[0] + w[1]){
t = p[0][a[0]] > p[1][a[1]];
ans += p[t][a[t]++] * (w[!t]+1 - a[!t]);
}
cout << ans << '\n';
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#define LL long long
LL W, H;
LL SW, SH[100010];
std::vector<LL> PW, PH;
LL ans;
int main() {
std::cin >> W >> H;
for (int i = 0; i < W; i++) {
LL tmp;
std::cin >> tmp;
SW += tmp;
PW.emplace_back(tmp);
}
for (int i = 0; i < H; i++) {
LL tmp;
std::cin >> tmp;
PH.push_back(tmp);
}
std::sort(PW.begin(), PW.end());
std::sort(PH.begin(), PH.end());
for (int i = 1; i <= H; i++) {
SH[i] += SH[i - 1] + PH[i - 1];
}
ans += SW + SH[H];
for (int i = 0; i < W; i++) {
auto it = std::upper_bound(PH.begin(),PH.end(),PW[i]);
LL K = it - PH.begin();
ans += SH[K] + PW[i] * (H - K);
}
std::cout << ans << std::endl;
return 0;
}
| 1 | 72,939,655 |
#include<stdio.h>
int main(){
int a,b,c,x,y,z;
scanf("%d %d %d",&a,&b,&c);
if(a<b){
x=a;
y=b;
}else{
x=b;
y=a;
}
if(y<c){
z=c;
}else{
z=y;
y=c;
}
if(x<y){
printf("%d %d %d\n",x,y,z);
}else{
printf("%d %d %d\n",y,x,z);
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (b > c) {
swap(b,c);
}
if (a > b) {
swap(a, b);
}
printf("%d %d %d\n", a, b, c);
}
| 1 | 46,593,031 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
ll x, y;
cin >> x >> y;
if(x % y == 0) {
cout << -1 << endl;
} else {
cout << x * (y-1) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;
cin >> X >> Y;
int ans=1;
if(X%Y==0) cout << -1 << endl;
else{
while(true){
ans*=X;
if(ans%Y!=0){
cout << ans << endl;
break;
}
}
}
}
| 1 | 15,944,836 |
#include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
string s,t;
int a,b;
string u;
cin >> s >> t >> a >> b >> u;
if(u == s){
cout << a-1 << ' ' << b << endl;
}else{
cout << a << ' ' << b-1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s,t;cin>>s>>t;
int a,b;cin>>a>>b;
string u;cin>>u;
if(s==u){
a--;
}else if(t==u){
b--;
}
cout<<a<<" "<<b<<endl;
}
| 1 | 33,004,021 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
int k = 1;
for(k = 1; k*(k-1)<=2*n; k++){
if(k*(k-1)/2 == n)break;
}
if(k*(k-1)/2!=n){
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
cout << k << endl;
vector<int>s[1000];
int cnt = 1;
rep(i,k){
for(int j = i+1 ; j < k; j++){
s[i].push_back(cnt);
s[j].push_back(cnt++);
}
}
rep(i,k){
cout << k-1 << " ";
rep(j,k-2){
cout << s[i][j] << " ";
}
cout << s[i][k-2] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, sum = 0, scnt = 0;
vector<int> memo[100005];
void solve();
int main() {
cin >> n;
while(sum < n) sum += ++scnt;
if(sum != n)
cout << "No" << endl;
else
solve();
return 0;
}
void solve() {
int nlast = 2, now = 1, cnt = 0;
cout << "Yes" << endl;
while(1) {
while(now < nlast) {
memo[now].push_back(cnt + 1);
memo[nlast].push_back(cnt + 1);
++now;
++cnt;
}
++nlast;
now = 1;
if(cnt == n) break;
}
cout << scnt + 1 << endl;
for(int i = 1; i <= scnt + 1; ++i) {
cout << memo[i].size();
for(int j = 0; j < memo[i].size(); ++j)
cout << " " << memo[i][j];
cout << endl;
}
}
| 1 | 40,237,417 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int editDistance(string x,string y){
int n=x.length(),m=y.length();
int INF=1LL<<55LL;
vector<vector<int> > dp(n+1,vector<int>(m+1,INF));
for(int i=0;i<=n;i++) dp[i][0]=i;
for(int i=0;i<=m;i++) dp[0][i]=i;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
dp[i][j]=min(dp[i][j],dp[i-1][j]+1);
dp[i][j]=min(dp[i][j],dp[i][j-1]+1);
dp[i][j]=min(dp[i][j],dp[i-1][j-1]+(x[i-1]!=y[j-1]));
}
}
return dp[n][m];
}
signed main(){
string s1,s2;
cin>>s1>>s2;
cout<<editDistance(s1,s2)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, char, ll> t4;
#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)
const ll mod = 1000000007;
static const ll INF = 1e15;
struct Levenshtein_distance {
const string s1;
const string s2;
vector<vector<ll>> dp;
Levenshtein_distance(string s1, string s2) : s1(s1), s2(s2) {
}
ll solve() {
dp.resize(s1.size() + 1, vector<ll>(s2.size() + 1, INF));
rep(i, s1.size()) {
dp[i][0] = i;
}
rep(j, s2.size()) {
dp[0][j] = j;
}
rep(i, s1.size()) {
rep(j, s2.size()) {
if (s1[i] == s2[j]) {
dp[i+1][j+1] = dp[i][j];
}
else {
ll cost = dp[i+1][j+1];
cost = min(cost, dp[i][j+1] + 1);
cost = min(cost, dp[i+1][j] + 1);
cost = min(cost, dp[i][j] + 1);
dp[i+1][j+1] = cost;
}
}
}
return dp[s1.size()][s2.size()];
}
};
int main(void)
{
string s1,s2;
cin >> s1 >> s2;
Levenshtein_distance dist(s1, s2);
auto d = dist.solve();
cout << d << endl;
return 0;
}
| 1 | 41,477,567 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B, C;
cin >> A >> B >> C;
if (A % B == C) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i <= 100; i++) {
if (A * i % B == C) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int gcd(int a, int b) {
if (b==0) {
return a;
}
return gcd(b,a%b);
}
int main(){
int a,b,c;
cin >> a >> b >> c;
int d = gcd(a,b);
if (c%d==0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 1 | 31,576,317 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
int a,b,c;
cin >> a >> b >> c;
int maxi = max({a,b,c});
if ((3*maxi-(a+b+c)) % 2 == 0) {
cout << (3*maxi-(a+b+c)) / 2 << endl;
} else {
cout << (3*(maxi+1)-(a+b+c)) / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int>a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
ll ans = 0;
while (!(a.at(0) == a.at(1) && a.at(1) == a.at(2))) {
if (a.at(1) - a.at(0) >= 2) {
ans++;
a.at(0) += 2;
}
else if (a.at(1) - a.at(0) == 1) {
ans++;
a.at(0)++;
a.at(2)++;
}
else {
int x = a.at(2) - a.at(1);
ans += x;
break;
}
}
cout << ans << endl;
}
| 1 | 26,217,979 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
vector<vector<int> >vec;
int n;
vector<int>d;
void bfs(int s) {
queue<int>q;
q.push(s);
d[s] = 0;
while (!q.empty()) {
int u = q.front(); q.pop();
rep(v, 0, vec[u].size()) {
if (d[vec[u][v]] != INF)continue;
d[vec[u][v]] = d[u] + 1;
q.push(vec[u][v]);
}
}
rep(i, 0, n) {
cout << i + 1 << " " << ((d[i]==INF)?-1:d[i]) << endl;
}
}
signed main() {
cin >> n; vec = vector<vector<int> >(n); d = vector<int>(n, INF);
rep(i, 0, n) {
int u, k; cin >> u >> k; u--;
rep(j, 0, k) {
int v; cin >> v; v--;
vec[u].push_back(v);
}
}
bfs(0);
return 0;
}
|
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long int;
#define rep(i,n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = (a); i < (b) ; i++)
#define pb push_back
#define SORT(v,n) sort(v, v+n)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cerr << #x << ": " << x << '\n'
#define elif else if
#define itn ll
#define int ll
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
static const int N = 100;
int d[N];
int n,M[N][N];
void dfs() {
queue<int> q;
q.push(0);
int i;
rep(i, n) d[i] = INF;
d[0] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
int v;
rep(v, n) {
if (M[u][v] == 0) continue;
if (d[v] != INF) continue;
d[v] = d[u] + 1;
q.push(v);
}
}
rep(u, n) {
cout << u + 1 << ' ' << ((d[u] == INF) ? (-1) : d[u]) << '\n';
}
}
signed main() {
ios::sync_with_stdio(false);
cin >> n;
int i;
rep(i, n) {
int u, k, v;
cin >> u >> k;
u--;
int j;
rep(j, k) {
cin >> v;
v--;
M[u][v] = 1;
}
}
dfs();
return 0;
}
| 1 | 26,518,366 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
string s, t;
cin >> s >> t;
map<char, int> ms, mt;
rep(i, s.size()) {
ms[s[i]]++;
}
rep(i, t.size()) {
mt[t[i]]++;
}
vector<int> svec, tvec;
for(auto x : ms) {
svec.push_back(x.second);
}
for(auto x : mt) {
tvec.push_back(x.second);
}
sort(ALL(svec));
sort(ALL(tvec));
bool ans = true;
if(svec.size() != tvec.size()) ans = false;
else {
rep(i, svec.size()) {
if(svec[i] != tvec[i]) ans = false;
}
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
|
#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(){
string S,T;
cin >> S >> T;
ll N = S.size();
vector<ll> v(26,-1),u(26,-1);
rep(i,N){
if(v[S[i]-'a'] == -1 && u[T[i]-'a'] == -1){
v[S[i]-'a'] = T[i] - 'a';
u[T[i]-'a'] = S[i] - 'a';
continue;
}
if(v[S[i]-'a'] == T[i] - 'a' && u[T[i]-'a'] == S[i] - 'a'){
continue;
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
| 1 | 10,292,782 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin>>n;
string a,b;
for(int j=0;j<n;j++){
cin>>a;
if(a=="0") break;
int la=a.size();
int c=0;
for(int i=0;i<la;i++){
if(a[i]=='0'){
if(b=="1"){
c=c%5;
if(c==1) cout<<".";
if(c==2) cout<<",";
if(c==3) cout<<"!";
if(c==4) cout<<"?";
if(c==0) cout<<" ";
}
if(b=="2"){
c=c%3;
if(c==1) cout<<"a";
if(c==2) cout<<"b";
if(c==0) cout<<"c";
}
if(b=="3"){
c=c%3;
if(c==1) cout<<"d";
if(c==2) cout<<"e";
if(c==0) cout<<"f";
}
if(b=="4"){
c=c%3;
if(c==1) cout<<"g";
if(c==2) cout<<"h";
if(c==0) cout<<"i";
}
if(b=="5"){
c=c%3;
if(c==1) cout<<"j";
if(c==2) cout<<"k";
if(c==0) cout<<"l";
}
if(b=="6"){
c=c%3;
if(c==1) cout<<"m";
if(c==2) cout<<"n";
if(c==0) cout<<"o";
}
if(b=="7"){
c=c%4;
if(c==1) cout<<"p";
if(c==2) cout<<"q";
if(c==3) cout<<"r";
if(c==0) cout<<"s";
}
if(b=="8"){
c=c%3;
if(c==1) cout<<"t";
if(c==2) cout<<"u";
if(c==0) cout<<"v";
}
if(b=="9"){
c=c%4;
if(c==1) cout<<"w";
if(c==2) cout<<"x";
if(c==3) cout<<"y";
if(c==0) cout<<"z";
}
c=0;
b="0";
}
else{
b=a[i];
c++;
}
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
string s;
for (int i=0;i<n;i++) {
cin>>s;
int j=0;
while (j<s.size()) {
int count=0;
if (s.at(j)=='1') {
while (s.at(j)!='0') {
count++;
if (count==6) {
count-=5;
}
j++;
}
if (count==1) {
cout<<".";
} else if (count==2) {
cout<<",";
} else if (count==3) {
cout<<"!";
} else if (count==4) {
cout<<"?";
} else if (count==5) {
cout<<" ";
}
} else if (s.at(j)=='2') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"a";
} else if (count==2) {
cout<<"b";
} else if (count==3) {
cout<<"c";
}
} else if (s.at(j)=='3') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"d";
} else if (count==2) {
cout<<"e";
} else if (count==3) {
cout<<"f";
}
} else if (s.at(j)=='4') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"g";
} else if (count==2) {
cout<<"h";
} else if (count==3) {
cout<<"i";
}
} else if (s.at(j)=='5') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"j";
} else if (count==2) {
cout<<"k";
} else if (count==3) {
cout<<"l";
}
} else if (s.at(j)=='6') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"m";
} else if (count==2) {
cout<<"n";
} else if (count==3) {
cout<<"o";
}
} else if (s.at(j)=='7') {
while (s.at(j)!='0') {
count++;
if (count==5) {
count-=4;
}
j++;
}
if (count==1) {
cout<<"p";
} else if (count==2) {
cout<<"q";
} else if (count==3) {
cout<<"r";
} else if (count==4) {
cout<<"s";
}
} else if (s.at(j)=='8') {
while (s.at(j)!='0') {
count++;
if (count==4) {
count-=3;
}
j++;
}
if (count==1) {
cout<<"t";
} else if (count==2) {
cout<<"u";
} else if (count==3) {
cout<<"v";
}
} else if (s.at(j)=='9') {
while (s.at(j)!='0') {
count++;
if (count==5) {
count-=4;
}
j++;
}
if (count==1) {
cout<<"w";
} else if (count==2) {
cout<<"x";
} else if (count==3) {
cout<<"y";
} else if (count==4) {
cout<<"z";
}
}
j++;
}
cout<<endl;
}
}
| 1 | 859,238 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int INF = 1e15;
int n;
vector<pair<int, int> > adj[N];
int dist[N];
void dijkartas(int s) {
for(int i = 0; i < N; i++)
dist[i] = INF;
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
pq.push({0, s});
dist[s] = 0;
while(!pq.empty()) {
int v = pq.top().second;
pq.pop();
for(auto p : adj[v]) {
int u = p.first;
int w = p.second;
if (dist[u] > dist[v] + w) {
dist[u] = dist[v] + w;
pq.push({dist[u], u});
}
}
}
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1;
while (t--) {
cin >> n;
for(int i = 1; i <= n; i++) {
adj[(i % n)].push_back({(i + 1) % n, 1});
adj[(i % n)].push_back({(10 * i) % n, 0});
}
dijkartas(1);
cout << dist[0] + 1 << '\n';
}
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long int mod = 1e9+7;
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main(){
int k; cin >> k;
deque< pair<int, int> > pq;
vector<int> c(k+1, 1e9);
pq.push_back({0, 1});
while(!pq.empty()) {
pair<int, int> p = pq.front();
c[p.second] = min(c[p.second], p.first);
pq.pop_front();
if(c[(p.second+1)%k] == 1e9) pq.push_back({p.first+1, (p.second+1)%k});
if(c[(p.second*10)%k] == 1e9) pq.push_front({p.first, (p.second*10)%k});
}
cout << c[0]+1 << endl;
return 0;
}
| 1 | 86,463,242 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> RailRoad, out;
int buf;
while(cin >> buf){
if(buf == 0){
buf = RailRoad[((int)RailRoad.size() - 1)];
out.push_back(buf);
RailRoad.pop_back();
}else{
RailRoad.push_back(buf);
}
}
for(vector<int>::iterator it = out.begin();it != out.end();++it){
cout << *it << endl;
}
return 0;
}
|
#include <cstdio>
int main() {
int ary[20],s=0,x;
while(scanf("%d", &x)==1) {
if(x) ary[s++] = x;
else printf("%d\n", ary[--s]);
}
return 0;
}
| 1 | 58,754,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int q;
cin >> q;
while (q--) {
string x, y;
cin >> x >> y;
int m = x.length();
int n = y.length();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (x[i - 1] == y[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
int ret = dp[m][n];
cout << ret << '\n';
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
int main(){
int q;
std::string a, b;
std::vector< std::vector< int > > dp;
dp.resize(1001);
for(int i=0;i<=1000;++i){
dp[i].resize(1001);
}
std::cin >> q;
for(int i=0;i<q;++i){
std::cin >> a >> b;
for(int x=1;x<=a.length();++x){
for(int y=1;y<=b.length();++y){
if(a[x-1] == b[y-1]){
dp[x][y] = std::max(std::max(dp[x - 1][y - 1] + 1, dp[x][y - 1]), dp[x - 1][y]);
}else{
dp[x][y] = std::max(std::max(dp[x - 1][y - 1], dp[x][y - 1]), dp[x - 1][y]);
}
}
}
std::cout << dp[a.length()][b.length()] << std::endl;
}
return 0;
}
| 1 | 56,461,458 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
REP(i, n) cin >> a[i];
REP(i, m) cin >> b[i];
bool res = false, ch;
REP(p, n){
REP(q, n){
if(p+m > n || q+m > n) continue;
ch = true;
REP(r, m){
if(a[p+r].substr(q, m) != b[r]) ch = false;
}
if(ch) res = true;
}
}
if (res) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
char a[100][100];
char b[100][100];
int main() {
int N,M;
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cin>>a[i][j];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M;j++){
cin>>b[i][j];
}
}
bool match=false;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(i+M-1>=N||j+M-1>=N){continue;}
bool ok=true;
for(int k=0;k<M;k++){
for(int t=0;t<M;t++){
if(a[i+k][j+t]!=b[k][t]){ok=false;}
}
}
if(ok){match=true;}
}
}
if(match){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;}
| 1 | 84,139,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
ll n,c,k;cin>>n>>c>>k;
ll t[n];
rep(i,n) cin>>t[i];
sort(t,t+n);
ll ans=1,cnt=0,l=t[0]+k;
rep(i,n){
cnt++;
if(cnt>c||l<t[i]){
ans++;
l=t[i]+k;
cnt=1;
}
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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 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;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
int ans = 0;
ll start = t[0];
ll now = 0;
rep(i, n){
if(now < c && t[i]-start <= k){
now++;
}else{
ans++;
now = 1;
start = t[i];
}
}
ans++;
cout << ans << endl;
return 0;
}
| 1 | 329,425 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int g[4][4] = {};
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (i != j) {
g[i][j] = INF;
}
}
}
for (int i = 0; i < 3; ++i) {
int a, b; cin >> a >> b;
--a; --b;
g[a][b] = 1;
g[b][a] = 1;
}
for (int k = 0; k < 4; ++k) {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (g[i][j] == 3) {
puts("YES");
return 0;
}
}
}
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> num(4,0);
vector<int> numans = {1,1,2,2};
for (int i=0; i<6; i++) {
cin >> N;
num[N-1]++;
}
sort(num.begin(),num.end());
if (num == numans) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 1 | 38,191,607 |
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<map>
#include<set>
#include<vector>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<numeric>
#include<string>
#include<tuple>
using namespace std;
#define BEGIN ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I,N) for(auto I=0;I<(N);++I)
#define up(I,A,B) for(auto I=(A);I<=(B);++I)
#define dw(I,A,B) for(auto I=(A);I>=(B);--I)
#define all(C) (C).begin(),(C).end()
#define rall(C) (C).rbegin(),(C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define pt pop_front
#define pk pop_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
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;}
template<class T>inline void in(T &p){cin>>p;}
template<class T1,class T2>inline void in(T1 &p1,T2 &p2){cin>>p1>>p2;}
template<class T1,class T2,class T3>inline void in(T1 &p1,T2 &p2,T3 &p3){cin>>p1>>p2>>p3;}
template<class T1,class T2,class T3,class T4>inline void in(T1 &p1,T2 &p2,T3 &p3,T4 &p4){cin>>p1>>p2>>p3>>p4;}
template<class T1,class T2,class T3,class T4,class T5>inline void in(T1 &p1,T2 &p2,T3 &p3,T4 &p4,T5 &p5){cin>>p1>>p2>>p3>>p4>>p5;}
template<class T>inline void out(T p){cout<<p<<endl;}
template<class T1,class T2>inline void out(T1 p1,T2 p2){cout<<p1<<" "<<p2<<endl;}
template<class T1,class T2,class T3>inline void out(T1 p1,T2 p2,T3 p3){cout<<p1<<" "<<p2<<" "<<p3<<endl;}
template<class T1,class T2,class T3,class T4>inline void out(T1 p1,T2 p2,T3 p3,T4 p4){cout<<p1<<" "<<p2<<" "<<p3<<" "<<p4<<endl;}
inline void solve(void){
long N,K;
in(N,K);
vector<long> a(N),b(N),A(N+1),B(N+1);
rep(i,N){
in(a[i]);
A[i+1]=A[i]+a[i];
b[i]=max(0L,a[i]);
B[i+1]=B[i]+b[i];
}
long ans=0,tmp;
rep(i,N-K+1){
tmp=B[i]+max(A[i+K]-A[i],0L)+B[N]-B[i+K];
chmax(ans,tmp);
}
out(ans);
}
int main(int argc,char**argv){
BEGIN;
solve();
END;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, K; cin >> N >> K;
vector<ll> a(N+1);
for(int i=1; i<=N; i++) cin >> a[i];
vector<ll> cum(N+1, 0);
vector<ll> cum2(N+1, 0);
for(int i=1; i<=N; i++) cum[i] = cum[i-1]+a[i];
for(int i=1; i<=N; i++) cum2[i] = cum2[i-1]+max(0LL, a[i]);
ll ans = -(1LL<<59);
for(int i=1; i<=N+1-K; i++){
ll tmp = cum[i+K-1]-cum[i-1];
ll tmp2 = 0;
tmp += cum2[i-1] + cum2[N]-cum2[i+K-1];
tmp2 += cum2[i-1] + cum2[N]-cum2[i+K-1];
ans = max(ans, max(tmp, tmp2));
}
cout << ans << endl;
}
| 1 | 59,196,265 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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 fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
bool isprime(int n) {
if(n==1)return false;
if(n==2)return true;
for(int i = 2;i<=sqrt(n);i++) {
if(n%i==0) return false;
}
return true;
}
#pragma endregion
int countdiv(int n) {
int count=0;
rep1(i, n) if(n%i==0)count++;
return count;
}
signed main() {
int n;cin >> n;
int cnt=0;
rep1(i, n) if(i&1&&countdiv(i)==8) cnt++;
cout << cnt << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
using namespace std;
void inv(vector<int>& v) {
int length = v.size();
for (int i = 0; i < length; i++) {
cin >> v[i];
}
}
void inv(vector<int>& v, int length) {
for (int i = 0; i < length; i++) {
cin >> v[i];
}
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 != 1) continue;
int cnt = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0) cnt++;
}
if (cnt == 8) ans++;
}
cout << ans << endl;
return 0;
}
| 1 | 53,752,773 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
ll r;
ll L[2];
cin >> N;
if(N == 0)
{
cout << 2;
return 0;
}
if(N == 1)
{
cout << 1;
return 0;
}
L[0] = 2;
L[1] = 1;
for(int i = 2; i < N+1; i++)
{
r = L[1] + L[0];
L[0] = L[1];
L[1] = r;
}
cout << r;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
long long l[88];
l[0]=2;
l[1]=1;
if(n==1)cout<<1<<endl;
else{
for(int i=2;i<=n;i++){
l[i]=l[i-1]+l[i-2];
}
cout<<l[n]<<endl;
}
return 0;
}
| 1 | 28,206,285 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
stack<int> stk;
int input;
int main()
{
while(scanf("%d",&input)!=EOF)
{
if(input==0)
{
printf("%d\n",stk.top());
stk.pop();
}
else
{
stk.push(input);
}
}
return 0;
}
|
#include<iostream>
#include<stack>
using namespace std;
stack<int> s;
int n;
int main(){
while(cin>>n){
if(n==0) {
cout<<("%d\n",s.top())<<endl;
s.pop();
}
else{
s.push(n);
}
}
return 0;
}
| 1 | 69,565,197 |
#include<iostream>
int main(void){
char c;
std::cin>>c;
if(c=='a'){
std::cout<<"vowel"<<std::endl;
}else if(c=='e'){
std::cout<<"vowel"<<std::endl;
}else if(c=='i'){
std::cout<<"vowel"<<std::endl;
}else if(c=='o'){
std::cout<<"vowel"<<std::endl;
}else if(c=='u'){
std::cout<<"vowel"<<std::endl;
}else{
std::cout<<"consonant"<<std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
string c; cin >> c;
set<string> s;
s.insert("a"); s.insert("i"); s.insert("u"); s.insert("e"); s.insert("o");
if(s.count(c)) cout << "vowel" << endl;
else cout << "consonant" << endl;
return 0;
}
| 1 | 42,984,107 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int p, q, r; std::cin >> p >> q >> r;
std::cout << std::min({ p + q, q + r,r + p }) << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
return (a.second<b.second);
}
int main()
{
int p,q,r;
cin>>p>>q>>r;
int k=p+q;
int l=q+r;
int m=p+r;
cout<<min(k,min(l,m))<<endl;
}
| 1 | 22,484,475 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, i, a[210];
cin >> n;
n *= 2;
for (i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int b = 0, c = 0;
for (i = 0; i < n; i += 2) {
b += a[i];
}
for (i = 1; i < n - 1; i += 2) {
c += a[i];
}
c += a[0];
cout << max(b, c) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef unsigned long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const int N = 1e5 + 2;
int A[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n + n; i++) cin >> A[i];
sort(A, A + n + n);
int ans = 0;
for (int i = 0; i < n; i++) ans += A[i + i];
cout << ans << endl;
return 0;
}
| 1 | 39,445,269 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "C:\Users\navodit\Desktop\mycodes\pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
const int N = 1e5+5;
vi g[N+1];
void solve(){
int n, m ;
cin >> n >> m;
rep(i,0,n){
int a , b;
cin >> a >> b;
if(a<=m){
g[a].pb(b);
}
}
priority_queue<int>pq;
int ans = 0 ;
fr(i,1,m){
trav(j,g[i]){
pq.push(j);
}
if(sz(pq)){
int val = pq.top();
pq.pop();
ans+=val;
}
}
cout << ans << endl;
}
signed main() {
unsyncIO();
int tt =1 ;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
priority_queue<int> pq;
pair<int, int> a[111111];
int main(void)
{
int n, m, i, ans = 0;
scanf("%d %d" ,&n, &m);
for (i = 1; i <= n; i++)
scanf("%d %d" ,&a[i].first, &a[i].second);
sort(a + 1, a + n + 1);
int take = 1;
for (i = 0; i < m; i++)
{
while (a[take].first == i + 1)
{
pq.push(a[take].second);
++take;
if (take > n)
break;
}
if (!pq.empty())
{
ans += pq.top();
pq.pop();
}
}
printf("%d" ,ans);
return 0;
}
| 1 | 55,880,810 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int A;
double r=0.00000;
rep(i,N){
cin>>A;
r+=1.00000/A;
}
double ans=1/r;
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1)*4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<int>
#define vll std::vector<ll>
#define YES printf("YES\n");
#define NO printf("NO\n");
#define Yes printf("Yes\n");
#define No printf("No\n");
#define all(n) n.begin(),n.end()
#define point(x) setprecision(x)
#define Test printf("Case %d: ",tc++);
#define Unique(c) (c).resize(unique(all(c))-(c).begin())
#define vout(v) for (auto z: v) cout << z << " "; cout << endl;
#define error(args...) {vector<string>_v=split(#args,',');err(_v.begin(),args);cout<<endl;}
vector<string> split(const string &s, char c) {vector<string>v; stringstream ss(s); string x;
while (getline(ss, x, c))v.emplace_back(x); return move(v);} void err(vector<string>::iterator it) {}
template<typename T, typename... Args>void err(vector<string>::iterator it, T a, Args...args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " "; err(++it, args...);}
const int M = 1e9 + 7;
const ll Inf = (ll)2e18 + 5;
const int N = 2e5 + 5;
ll vis[N],res[N];
long long Lcm(long long a,long long b){
return (((a)*(b)))/__gcd(a,b);
}
int solve()
{
ll n;
cin>>n;
ll a[n];
ll lcm = 1LL;
for(ll i=0LL;i<n;i++){
cin>>a[i];
lcm = Lcm(lcm,a[i]);
}
ll sum = 0LL;
for(ll i=0LL;i<n;i++){
sum += (lcm/a[i]);
}
cout<<point(20)<<(long double)((long double)lcm/(long double)sum)<<endl;
return 0;
}
int main(){
int test = 1;
while (test--)solve();return 0;
}
| 1 | 78,898,568 |
#include <iostream>
#include <cmath>
#define EPS 1.0e-5
using namespace std;
int main() {
double x1,y1,x2,y2,x3,y3,xp,yp;
double a[2],b[2];
double A,B;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
a[0] = x2 - x1;
a[1] = y2- y1;
b[0] = x3 - x1;
b[1] = y3 - y1;
if(fabs(a[0]*b[0]+a[1]*b[1]) != 1) {
A = ( b[1] * (xp-x1) - b[0] * (yp-y1)) / (a[0] * b[1] - b[0] * a[1]);
B = (a[1] * (xp-x1) - (yp-y1) * a[0]) / (a[1] * b[0] - b[1] * a[0]);
if ((A+B < 1) && (A > 0) && (B > 0)) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
else
cout << "NO" << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
#include <sstream>
#include <cstdio>
using namespace std;
double area(const double x1, const double y1, const double x2, const double y2, const double x3, const double y3)
{
double s = x1*y2 - x1*y3 + x2*y3 - x2*y1 + x3*y1 - x3*y2;
if (s < 0)
s = -s;
return s / 2.0;
}
int main()
{
double x1, y1, x2, y2, x3, y3, xp, yp;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
double St = area(x1, y1, x2, y2, x3, y3);
double S1 = area(x1, y1, x2, y2, xp, yp);
double S2 = area(x2, y2, x3, y3, xp, yp);
double S3 = area(x3, y3, x1, y1, xp, yp);
if (S1 != 0 && S2 != 0 && S3 != 0 && S1+S2+S3 == St)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 1 | 4,657,475 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
int n;
cin>>n;
int a[n];
rep(i,n)
cin>>a[i];
lli sum=0;
for(int i=1;i<n;i++){
if(a[i-1]>a[i]){
sum+=(a[i-1]-a[i]);
a[i]=a[i-1];
}
}
cout<<sum<<endl;
}
int main()
{
int t;
t=1;
while(t--){
solve();
}
}
|
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
void solve() {
ll n;
cin >> n;
vector<ll> arr(n);
for (auto &it: arr) {
cin >> it;
}
ll mx = arr[0];
ll ans = 0;
for (int i = 1; i < n; i++) {
if (mx > arr[i]) {
ans += mx - arr[i];
}
mx = max(mx, arr[i]);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll test = 1;
while (test--) {
solve();
}
return 0;
}
| 1 | 29,156,584 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
string s;
cin >> n >> s;
string a, b;
for (int i = 0; i < n / 2; ++i)
a += s[i];
for (int i = n / 2; i < n; ++i)
b += s[i];
if (a == b)
cout << "Yes";
else
cout << "No";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
while (t--) {
solve();
}
}
|
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int t,flag=1;
cin>>t;
int i,n,r;
char s[t+5];
for(i=0;i<t;i++)
{
cin>>s[i];
}
n=t/2;
r=t%2;
if(r!=0)
{
flag = 0;
}
else if(r==0)
{
for(i=0;i<n;i++)
{
if(s[i]!=s[i+n])
{
flag=0;
break;
}
}
}
if(flag)
{
cout<<"Yes"<<'\n';
}
else
{
cout<<"No"<<'\n';
}
return 0;
}
| 1 | 7,930,371 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll expo(ll a, ll b){
ll ex = 1;
rep(i, b){
ex *= a;
}
return ex;
}
ll fact(ll a){
ll fc = 1;
REP(i, 1, a+1){
fc *= i;
}
return fc;
}
int main() {
ll a, b, x;
cin >> a >> b >> x;
if(a<=x&&x<=a+b) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
|
#include<iostream>
int main(){int A,B,X;std::cin>>A>>B>>X;puts(X<A|X>A+B?"NO":"YES");}
| 1 | 29,655,682 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n,m;
cin>>n>>m;
vl x(n),y(n),z(n);
rep(i,n)cin>>x[i]>>y[i]>>z[i];
vvl a(8);
rep(i,n){
int cnt=0;
ll X,Y,Z;
rep(j,2){
rep(k,2){
rep(l,2){
if(j==0)X=x[i];
else X=-x[i];
if(k==0)Y=y[i];
else Y=-y[i];
if(l==0)Z=z[i];
else Z=-z[i];
a[cnt].PB(X+Y+Z);
cnt++;
}
}
}
}
rep(i,8){sort(all(a[i]));reverse(all(a[i]));}
ll ans=-1e18;
rep(i,8){
ll sum=0;
rep(j,m)sum+=a[i][j];
ans=max(ans,sum);
}
cout<<ans<<endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
ll N,M; cin>>N>>M;
vector<vector<ll>> vec(N,vector<ll>(3)); rep(i,N) rep(j,3) cin>>vec[i][j];
ll ans=-INF;
rep(S,1<<3){
vector<ll> svec(N);
rep(i,N){
ll ele=0;
rep(j,3){
if(S&(1<<j)) ele+=vec[i][j];
else ele-=vec[i][j];
}
svec[i]=ele;
}
sort(svec.rbegin(),svec.rend());
ll sans=0;
rep(i,M) sans+=svec[i];
chmax(ans,sans);
}
cout<<ans<<endl;
return 0;
}
| 1 | 37,590,727 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
if(s.size() != t.size()) {
cout << "No" << endl;
return 0;
}
int n = s.size();
rep(i, n) {
string u = t.substr(i, n-i) + t.substr(0, i);
if(s == u) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
bool ok=false;
vector<char>ave(a.size());
vector<char>bve(b.size());
if(a.size()==b.size()){
for(int i=0;i<a.size();i++){
ave.at(i)=a.at(i);
}
for(int i=0;i<b.size();i++){
bve.at(i)=b.at(i);
}
for(int i=0;i<a.size();i++){
ok=true;
int j=0;
for(j=0;j<a.size()-i;j++){
if(ave.at(j+i)!=bve.at(j)){
ok=false;
break;
}
}
for(j=0;j<i;j++){
if(ave.at(j)!=bve.at(a.size()+j-i)){
ok=false;
break;
}
}
if(ok)
break;
}
}
cout << (ok?"Yes":"No") << endl;
return 0;
}
| 1 | 47,678,748 |
#include<stdio.h>
int main(){
char S1;
char S2;
char S3;
scanf("%c %c %c",&S1,&S2,&S3);
if(S1==S2,S1!=S3,S2!=S3){
puts("Yes");
}
else if(S1==S3,S1!=S2,S3!=S2){
puts("Yes");
}
else if(S2==S3,S1!=S2,S1!=S3){
puts("Yes");
}
else {
puts("No");
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
#define INF 10e12
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
int main(void)
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int kazu = count(all(s), 'A');
if (kazu == 0 || kazu == int(s.length()))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| 1 | 63,090,620 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3],n;
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j++){
cin >> a[i][j];
}
}
cin >> n;
int b[n] ;
for ( int i= 0 ; i<n ; i++) {
cin >> b[i] ;
}
bool c[3][3];
for ( int i=0; i<3 ; i++){
for (int j=0 ; j<3 ; j++){
c[i][j]=false ;
for ( int k = 0 ; k<n ; k++){
if ( a[i][j]==b[k]){
c[i][j]=true ;
}
}
}
}
string ans="No" ;
for ( int i=0 ; i<3 ; i++){
if ( c[i][1] && c[i][2]&&c[i][0]){
ans= "Yes" ;
}
if ( c[0][i] && c[1][i]&&c[2][i]){
ans= "Yes" ;
}
}
if ( c[0][0] && c[1][1]&&c[2][2]){
ans= "Yes" ;
}
if ( c[0][2] && c[1][1]&&c[2][0]){
ans= "Yes" ;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
vector<int> a(9);
rep(i,9) {
cin >> a[i];
}
int n;
cin >> n;
vector<int> b(n);
rep(i,n) {
cin >> b[i];
}
rep(i,9) {
rep(j,n) {
if(a[i] == b[j])
a[i] = 0;
}
}
bool tf = false;
if((a[0] == 0 && a[1] == 0 && a[2] == 0) ||
(a[3] == 0 && a[4] == 0 && a[5] == 0) ||
(a[6] == 0 && a[7] == 0 && a[8] == 0) ||
(a[0] == 0 && a[3] == 0 && a[6] == 0) ||
(a[1] == 0 && a[4] == 0 && a[7] == 0) ||
(a[2] == 0 && a[5] == 0 && a[8] == 0) ||
(a[0] == 0 && a[4] == 0 && a[8] == 0) ||
(a[2] == 0 && a[4] == 0 && a[6] == 0))
tf = true;
if(tf)
cout << "Yes" ;
else
cout << "No" ;
return 0;
}
| 1 | 29,267,951 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string s;
cin>>s;
if(n%2==1){
cout<<"No";
}
else{
for(int i=0;i<n/2;i++){
if(s[i]!=s[i+n/2]){
cout<<"No";
exit(0);
}
}
cout<<"Yes";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
int n;
string s;
cin>> n>> s;
if(n &1)
{
cout << "No\n";
return 0;
}
cout<< ( s.substr (0, n/2) == s.substr (n/2, n/2) ? "Yes\n" : "No\n");
return 0;
}
| 1 | 27,361,080 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b, c;
string str, command, s;
cin >> str >> c;
for (int i = 0; i < c;i++){
cin >> command;
if (command == "print"){
cin >> a >> b;
while (a <= b){
cout << str[a];
a++;
}
cout << endl;
}
else if (command == "replace"){
cin >> a >> b >> s;
str.replace(a, b - a + 1, s);
}
else{
cin >> a >> b;
for (int j = 0; j < (b - a + 1) / 2;j++){
swap(str[a + j], str[b - j]);
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
#define ref goto refrain
int main(){
char str[1000];
cin>>str;
int q;
cin>>q;
string order;
int a,b;
char rep[1000];
for(int i=0;i<q;i++){
cin>>order;
cin>>a;
cin>>b;
if(order=="replace"){
cin>>rep;
for(int j=0;a<=b;j++){
str[a]=rep[j];
a++;
}
}
else if(order=="reverse"){
while(a<=b){
char temp=str[a];
str[a]=str[b];
str[b]=temp;
a++;
b--;
}
}
else if(order=="print"){
for(a=a;a<=b;a++){
printf("%c",str[a]);
}
cout<<endl;
}
}
return 0;
}
| 1 | 59,175,328 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define vf vector<float>
#define vs vector<string>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int>>
#define hashmap unordered_map
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf INT64_MAX
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(x) x.begin(),x.end()
#define digits(x) floor(log10(x))+1
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
template<class T>
void printV(vector<T> a) {for (auto v : a)cout << v << " ";}
template<class T>
void readV(vector<T>& a) {int n = a.size(); for (int i = 0 ; i < n ; i++)cin >> a[i];}
template<class T>
void printA(T* a , int n) {for (int i = 0; i < n ; i++)cout << a[i] << " ";}
template<class T>
void readA(T* a , int n) {for (int i = 0 ; i < n ; i++)cin >> a[i];}
auto clk = clock();
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void run_time() {cout << endl<<"Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;}
void aryan_pandeya() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
class dsu{
private:
int* parent;
int* size;
int root(int x){
while(x!=parent[x]){
parent[x] = parent[parent[x]];
x = parent[x];
}
return x;
}
public:
int components;
dsu(int n){
parent = new int [n];
size = new int [n];
components = n ;
for(int i = 0 ; i<n ; i++){
parent[i] = i ;
size[i] = 1;
}
}
bool find(int x , int y){
return root(x)==root(y);
}
void join(int x , int y){
int i = root(x);
int j = root(y);
if(i==j){
return ;
}
else{
components--;
if(size[i]<size[j]){
parent[i] = j;
size[j]+=size[i];
size[i] = 0;
}
else{
parent[j] = i ;
size[i]+=size[j];
size[j] = 0;
}
}
}
int sz(int x){
return size[x];
}
};
int32_t main() {
aryan_pandeya();
FIO;
int n,q;
cin>>n>>q;
dsu g(n);
for(int i = 0 ; i<q ; i++){
int t,x,y;
cin>>t>>x>>y;
if(t==1){
cout<<g.find(x,y)<<'\n';
}
else{
g.join(x,y);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
int main() {
int64_t N, Q;
std::cin >> N >> Q;
atcoder::dsu d(N);
for (int64_t i = 0; i < Q; i++) {
int64_t t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d.merge(u, v);
} else {
std::cout << d.same(u, v) << std::endl;
}
}
}
| 1 | 44,011,919 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int> d(K);
int a;
vector<int> A;
for (int i=0; i<K; i++) {
cin >> d[i];
for (int j=0; j<d[i]; j++) {
cin >> a;
A.push_back(a);
}
}
int NA = A.size();
vector<int> sunuke(N);
for (int i=0; i<NA; i++) {
if (sunuke[A[i]-1] == 0) {
sunuke[A[i]-1] = 1;
}
}
int ans = 0;
for (int i=0; i<N; i++) {
ans += sunuke[i];
}
cout << N-ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long N, K, ans;
vector<long> A;
int main(void) {
cin >> N >> K;
A.resize(N, 0);
for (long i = 0; i < K; i++) {
long d; cin >> d;
for (long j = 0; j < d; j++) {
long a; cin >> a; a--;
A[a]++;
}
}
for (auto e: A) {
if (e == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 1 | 78,650,264 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long long int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); (LoopVariable)++)
#define DEFOR(LoopVariable,numberOFbegin,numberOFend) for (long long int LoopVariable = (numberOFbegin)-1; (LoopVariable) >= (numberOFend); (LoopVariable)--)
#define REP(LoopVariable,numberOFend) for(long long int LoopVariable = 0;(LoopVariable)<(numberOFend);LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max()-5;
constexpr int inf= numeric_limits<int>::max()-5;
constexpr long long int mod = 1000000007;
int main(){
long long int m,k;
cin>>m>>k;
if(k>=(long long int)pow(2,m)){
cout << "-1" << endl;
return 0;
}else if(m==0){
if(k==0){
cout << "0 0" << endl;
}else{
cout << "-1" << endl;
}
return 0;
}else if(m==1){
if(k==0){
cout << "0 0 1 1" << endl;
}else{
cout << "-1" << endl;
}
return 0;
}else{
REP(i,(long long int)pow(2,m)){
if(i!=k){
cout << i << " ";
}
}
cout << k << " ";
DEFOR(i,(long long int)pow(2,m),0){
if(i!=k){
cout << i << " ";
}
}
cout << k << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int m,k;
int main(){
cin>>m>>k;
int tmp=(1<<m)-1;
if(m==0&&k==0){
puts("0 0");
return 0;
}
if(k<=tmp){
if(m==1&&k==1){
puts("-1");
return 0;
}
if(!k){
for(int i=0;i<=tmp;i++){
printf("%d %d%c",i,i,(i==tmp)?'\n':' ');
}
}
else{
printf("0 %d 0 ",k);
for(int i=1;i<=tmp;i++){
if(i==k) continue;
printf("%d ",i);
}
printf("%d ",k);
for(int i=tmp;i>=1;i--){
if(i==k) continue;
printf("%d ",i);
}putchar('\n');
}
}
else{
puts("-1");
}
return 0;
}
| 1 | 61,051,723 |
#include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{ speed_up;
ll n, m, ans = 0;
cin>>n>>m;
if(m>n)
{
m = m - n*2;
ans += n + m/4;
}
else
{
ans += m/2;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
const int mod = 1e9+7;
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m,ans=0;
cin>>n>>m;
if(m<=n*2){
ans = m/2;
}
else{
m = m-(n*2);
ans+=n;
ans += (m/4);
}
cout<<ans<<endl;
return 0;
}
| 1 | 37,594,811 |
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 2000000 + 5;
const int maxm = 10000 + 5;
int n;
int A[maxn],B[maxn],C[maxm];
void Counting_Sort(int left,int right){
for(int i = left;i <= right; i++)C[A[i]]++;
for(int i = 1;i <= maxm; i++)C[i] += C[i-1];
for(int i = left;i <= right; i++){
B[C[A[i]]] = A[i];
C[A[i]]--;
}
}
int main(){
scanf("%d",&n);
for(int i = 1;i <= n; i++)scanf("%d",&A[i]);
Counting_Sort(1,n);
for(int i = 1;i <= n; i++){
if(i != 1)printf(" ");
printf("%d",B[i]);
}
printf("\n");
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
short A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
scanf("%d",&n);
for (int i = 0; i < 10002; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d",&A[i]);
if (A[i] > max) {
max = A[i];
}
C[A[i]]++;
}
for (int i = 1; i <= max; i++) {
C[i] += C[i-1];
}
for (int i = 0; i < n; i++) {
B[C[A[i]]-1] = A[i];
C[A[i]]--;
}
for (int i = 0; i < n-1; i++){
printf("%d ",B[i]);
}
printf("%d\n",B[n-1]);
return 0;
}
| 1 | 33,063,678 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << #x << ":" << x << "\n"
#define dbv(vec) cerr << #vec << ":"; for (auto e : vec) cerr << e << " "; cout << "\n"
#define dbvv(vv) cerr << #vv << ":\n"; for (auto vec : vv) { for (auto e : vec) cerr << e << " "; cerr << endl; }
#define YN(f) cout << (f ? "YES" : "NO") << endl
#define Yn(f) cout << (f ? "Yes" : "No") << endl
#define yn(f) cout << (f ? "yes" : "no") << endl
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int N;
bool issym(vector<vector<char>> T, int k) {
rep(i, N) rep2(j, i, N) if (T.at(i).at(k + j) != T.at(j).at(k + i)) return false;
return true;
}
int main() {
cin >> N;
vector<vector<char>> S(N, vector<char>(N));
rep(i, N) rep(j, N) cin >> S.at(i).at(j);
dbvv(S);
rep(i, N) {
rep(j, N - 1) S.at(i).push_back(S.at(i).at(j));
}
dbvv(S);
int ans = 0;
rep(k, N) if (issym(S, k)) ans += N;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define REP1(i,n) for(int i=1;i<((int)n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
struct RollingHash{
vll hash1, hash2;
vll power1, power2;
ll base1, base2;
ll mod1, mod2;
void Init(string s){
ll n = s.size();
hash1.assign(n+1, 0);
hash2.assign(n+1, 0);
power1.assign(n+1, 1);
power2.assign(n+1, 1);
base1 = 1007;
base2 = 2009;
mod1 = 1e9+7;
mod2 = 1e9+9;
REP(i, n){
hash1[i+1] = (hash1[i]*base1+s[i])%mod1;
hash2[i+1] = (hash2[i]*base2+s[i])%mod2;
power1[i+1] = (power1[i]*base1)%mod1;
power2[i+1] = (power2[i]*base2)%mod2;
}
}
pll getHash(ll l, ll r){
ll h1 = hash1[r]-hash1[l]*power1[r-l]%mod1;
if(h1<0)
h1 += mod1;
ll h2 = hash2[r]-hash2[l]*power2[r-l]%mod2;
if(h2<0)
h2 += mod2;
return {h1, h2};
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
string s[n+1], t[n+1];
REP(i, n){
cin >> s[i];
REP(j, n)
t[j] += s[i][j];
}
RollingHash rh_v[303], rh_h[303];
pll RS2[303][303], RT2[303][303];
REP(i, n){
s[i] += s[i];
t[i] += t[i];
rh_h[i].Init(s[i]);
rh_v[i].Init(t[i]);
REP(j, n){
RS2[i][j] = rh_h[i].getHash(j, n+j);
RT2[i][j] = rh_v[i].getHash(j, n+j);
}
}
ll ans = 0;
REP(a, n){
REP(b, n){
bool flag = true;
REP(k, n){
if(RS2[(a+k)%n][b] != RT2[(b+k)%n][a])
flag = false;
}
if(flag)
ans++;
}
}
cout << ans << endl;
}
| 1 | 55,613,117 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x.size()))
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
ll x = 0; char ch = gc(); bool positive = 1;
for (; !isdigit(ch); ch = gc()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = gc()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a){
if(a<0){
a=-a; putchar('-');
}
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
ll rnd(){
ull ans=0;
For(i,0,4)ans=ans<<15^rand();
return ans%((ull)1<<63);
}
ll sum,ans;
int main(){
#ifdef Brollan
freopen("1.in","r",stdin);
#endif
int m=read();
For(i,1,m){
int d=read(); ll c=read();
ans+=c; sum+=c*d;
}
cout<<ans-1+(sum-1)/9<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
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; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll m; cin>>m;
vector<LP> dc(m); cin>>dc;
ll d = 0;
rep(i, m) d += dc[i].se;
ll s = 0;
rep(i, m) s += dc[i].fi * dc[i].se;
ll ans = d - 1 + (s - 1) / 9;
cout<<ans<<endl;
}
| 1 | 61,010,785 |
#include<iostream>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
int count[26] = {};
while(cin >> ch){
if(isalpha(ch)){
count[tolower(ch) - 'a'] ++;
}
}
for(int i = 0; i <= 25; i++){
printf("%c : %d\n",i + 'a',count[i]);
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
template <typename T_char>
T_char
ToLower(T_char c)
{
return tolower(c);
}
int
main()
{
ios::sync_with_stdio(false);
vector<int> count(26);
string line;
while (getline(cin, line)) {
transform(line.begin(), line.end(), line.begin(), ToLower<char>);
for (string::iterator it = line.begin(); it != line.end(); it++) {
count[*it - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
cout << (char)('a' + i) << " : " << count[i] << endl;
}
return 0;
}
| 1 | 49,994,650 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,a,b;
cin>>n>>a>>b;
ll mi = a*(n-1)+b;
ll ma = b*(n-1)+a;
ll z=0;
cout<<max(ma-mi+1,z)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define mrep(i,j,n) for(int i = j; i < n; i++)
#define mreps(i,j,n) for(int i = j; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val) x.erase(remove(all(x), val), x.end())
typedef long long ll;
typedef pair<int, int> P;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
ll MOD = 1000000007;
int INF = 1001001001;
void solve()
{
ll n, a, b;
cin >> n >> a >> b;
ll ans;
if(a > b)ans = 0;
else if(n == 1)ans = a==b?1:0;
else ans = a+b*(n-1)-a*(n-1)-b+1;
cout << ans << endl;
return;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 1 | 54,707,410 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
const LL inf = 112345678901234567;
LL get_max(std::vector<LL>v)
{
LL res = 0;
rep(i, v.size()) res = std::max(res, v[i]);
return res;
}
LL get_min(std::vector<LL>v)
{
LL res = inf;
rep(i, v.size()) res = std::min(res, v[i]);
return res;
}
int main()
{
LL N;
in >> N;
std::vector<LL>a(N);
rep(i, N) in >> a[i];
LL ans = 0;
while (true)
{
std::sort(a.begin(), a.end());
if (a[N - 1] <= N - 1) break;
if (a[N - 1] - a[0] <= N * N)
{
LL add = std::max<LL>(a[N - 1] - N * N, 0);
ans += add * N;
rep(i, N) a[i] -= add;
do
{
rep(j, N - 1) ++a[j];
a[N - 1] -= N;
++ans;
std::sort(a.begin(), a.end());
} while (a[N - 1] > N - 1);
break;
}
LL left = 0, right = inf;
while (right - left > 1)
{
LL mid = (right + left) / 2;
auto a_ = a;
rep(i, N - 1) a[i] += mid;
a[N - 1] -= N * mid;
if (a[N - 1] < a[0] || get_max(a) <= N - 1) right = mid;
else left = mid;
a = a_;
}
rep(i, N - 1) a[i] += right;
a[N - 1] -= N * right;
ans += right;
}
out << ans << std::endl;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-12;
template <typename T>
void dump(T x) { cout << x << endl; }
void dumpf(ld x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
inline ll mod(ll a, ll b) {
if (a > 0) return a % b;
if (a % b == 0) return 0;
ll x = -a / b + 1;
a += x * b;
return a % b;
}
ll powm(ll a, ll b, ll c) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll d = powm(a, b / 2, c);
return (d * d) % c;
} else
return (a * powm(a, b - 1, c)) % c;
}
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; }
int main() {
IOS();
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
ll s;
while (1) {
s = 0;
for (int i = 0; i < n; i++) {
s += a[i] / n;
}
ans += s;
for (int i = 0; i < n; i++) {
a[i] = a[i] % n + s - a[i] / n;
}
bool ok = true;
for (int i = 0; i < n; i++) {
if (a[i] >= n) ok = false;
}
if (ok) break;
}
dump(ans);
return 0;
}
| 1 | 96,318,703 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> int LIS(const vector<T> &a) {
vector<T> dp(a.size(), numeric_limits<T>::max());
for (int i = 0; i < (int)a.size(); ++i) {
*lower_bound(dp.begin(), dp.end(), a[i]) = a[i];
}
return lower_bound(dp.begin(), dp.end(), numeric_limits<T>::max()) - dp.begin();
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cout << LIS(a) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
constexpr ll MAX = 100010;
ll dp[MAX];
int main(int argc, char **argv)
{
ll n; cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; ++i) cin >> v[i];
for (ll i = 0; i < MAX; ++i) dp[i] = INF;
dp[0] = v[0];
ll len = 1;
for (ll i = 1; i < n; ++i)
{
if (dp[len-1] < v[i]) dp[len++] = v[i];
else *lower_bound(dp, dp+len, v[i]) = v[i];
}
std::cout << len << std::endl;
}
| 1 | 59,186,107 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
#include<bits/stdc++.h>
using namespace std;
int main(){
ll n,h,w;
cin >> n >> h >> w;
int ans=0;
ll a,b;
rep(i,n){
cin >> a >> b;
if(a>=h && b >=w){
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[4] = {-1,0,1,0};
int dx[4] = {0,1,0,-1};
int Dy[8] = {-1,-1,0,1,1,1,0,-1};
int Dx[8] = {0,1,1,1,0,-1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 111111;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,h,w;
cin>>n>>h>>w;
int res=0;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
if(a>=h&&b>=w)res++;
}
cout<<res<<endl;
}
| 1 | 42,365,157 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std ;
int main(){
std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
int N, L ;
cin >> N >> L ;
vector<string> words(N) ;
for (int i = 0; i < N && cin >> words[i]; i++);
sort(words.begin(), words.end());
for (int i = 0; i < N && cout << words[i]; i++) ;
return 0 ;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
vector<string> s;
for(int i = 0; i < n; i++){
string tmp;
cin >> tmp;
s.push_back(tmp);
}
sort(s.begin(), s.end());
string output;
for(int i = 0; i < n; i++){
output = output + s[i];
}
cout << output << endl;
return 0;
}
| 1 | 48,681,971 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1<<31)-1
#define LINF (1LL<<63)-1LL
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++i)
#define repr(i,n) for(int _i=(n),i=_i;i>0;--i)
#define db(x) cerr<<#x<<" = "<<x<<" ";
#define db2(x,y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<") ";
#define db3(x,y,z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = ("<<x<<", "<<y<<", "<<z<<") ";
#define ln cout<<endl;
#define all(a) (a).begin(),(a).end()
#define dig(n) to_string(n).length()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define se second
#define fi first
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> iP;
typedef pair<P,P> PP;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
bool flag=false;
ll ans=LINF,sum=0;
int n,k;
cin>>n>>k;
vector<P> po(n);
vector<int> xl(n);
vector<int> yl(n);
rep(i,n){
int x,y;
cin>>x>>y;
po[i] = P(x,y);
xl[i] =x;
yl[i] =y;
}
sort(all(xl));sort(all(yl));
rep(a,n)rep1(b,a,n)rep(c,n)rep1(d,c,n){
ll x2 = xl[b];
ll x1 = xl[a];
ll y2 = yl[d];
ll y1 = yl[c];
int cnt=0;
rep(i,n){
int x = po[i].fi;
int y = po[i].se;
if( x1<=x&&x<=x2 && y1<=y&&y<=y2 ){
++cnt;
}
}
if(cnt >= k){
chmin(ans,(x2-x1)*(y2-y1));
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 50;
long long X[N],Y[N],X2[N],Y2[N];
int main() {
int n,k2;cin>>n>>k2;
rep(i,n) {cin>>X[i]>>Y[i];X2[i]=X[i];Y2[i]=Y[i];}
long long ans=INFL;
sort(X,X+n);sort(Y,Y+n);
for(int i=0;i<n-1;i++) {
for(int j=i+1;j<n;j++) {
for(int k=0;k<n-1;k++) {
for(int l=k+1;l<n;l++) {
int c=0;
rep(m,n) if(X2[m]>=X[i]&&X2[m]<=X[j]&&Y2[m]>=Y[k]&&Y2[m]<=Y[l]) c++;
if(c>=k2) ans=min(ans,(X[j]-X[i])*(Y[l]-Y[k]));
}
}
}
}
cout<<ans<<endl;
}
| 1 | 97,503,074 |
#include<iostream>
#include<algorithm>
using namespace std;
long long n,a[10000],ams;
int main()
{
ios::sync_with_stdio(0);
cin>>n;
n*=2;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1);
for(int i=1;i<n;i+=2)
ams+=a[i];
cout<<ams;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[1000];
for(int i=1;i<=2*n;i++)
{
cin>>a[i];
}
sort(a+1,a+2*n+1);
int s=0;
for(int i=1;i<=2*n-1;i+=2)
{
s+=min(a[i],a[i+1]);
}
cout<<s<<endl;
return 0;
}
| 1 | 45,232,121 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d) {
cout << "Left" << endl;
}
else if (a + b < c + d) {
cout << "Right" << endl;
}
else {
cout << "Balanced" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int A,B,C,D;
cin>>A>>B>>C>>D;
if(A+B==C+D){cout<<"Balanced"<<endl;}
else if(A+B<C+D){cout<<"Right"<<endl;}
else{cout<<"Left"<<endl;}
return 0;
}
| 1 | 70,684,727 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x; cin >> x;
if(x<1200) cout << "ABC";
else cout << "ARC";
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
if(x<1200)cout<<"ABC\n";
else cout<<"ARC\n";
}
| 1 | 27,290,460 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int n; cin >> n;
int cur = 1;
int ans = 0;
vector<int> a(n+1);
vector<bool> l(n+1);
rep(i,n) cin >> a[i+1];
rep(i,n) l[i+1] = false;
while(1){
if(l[cur]) break;
else{
if(cur == 2) break;
l[cur] = true;
cur = a[cur];
ans ++;
}
}
if(cur == 2) cout << ans;
else cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
vector<bool> pushed(100005, false);
vector<int> a;
int N;
int ans = -1;
void dfs(int button, int count=0){
if (pushed[button]) return;
if (button == 1) {
ans = count; return;
}
pushed[button] = true;
dfs(a[button], count+1);
}
int main(){
cin >> N;
a.assign(N, 0);
rep(i,N) {
int b;
cin >> b;
a[i] = --b;
}
dfs(0);
cout << ans << endl;
}
| 1 | 61,243,451 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << endl;
}
const int mod = 1e9 + 7;
int main(){
ll n; cin >> n;
ll mx = 0;
vl a(n); rep(i,n) cin >> a[i], chmax(mx,a[i]);
ll h = (mx+1)/2;
sort(rall(a));
vl cnt(mx+1,0);
rep(i,n){
if(a[i]<h){
puts("Impossible");
return 0;
}
cnt[a[i]]++;
}
for(ll i=h+1; i<=mx; i++){
if(cnt[i] < 2){
puts("Impossible");
return 0;
}
}
if(mx&1){
if(cnt[h] == 2) puts("Possible");
else puts("Impossible");
}else{
if(cnt[h] == 1) puts("Possible");
else puts("Impossible");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 123;
int N;
int freq[MAXN];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int d; scanf("%d", &d);
freq[d]++;
}
bool ans = true;
int diam = N-1;
while (freq[diam] == 0) diam--;
int mi = 0;
while (freq[mi] == 0) mi++;
ans &= (mi == (diam + 1) / 2);
ans &= (freq[mi] == (diam % 2) + 1);
for (int i = mi+1; i <= diam; i++) ans &= (freq[i] >= 2);
if (ans) puts("Possible");
else puts("Impossible");
return 0;
}
| 1 | 87,405,927 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b;
cin>>a>>b;
int64_t x;
if(a%2==0){
if(b%2==0)
x=b^((b-a)/2%2);
else
x=(b-a+1)/2%2;
}else{
if(b%2==0)
x=a^b^((b-a-1)/2%2);
else
x=a^((b-a)/2%2);
}
cout<<x<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b; cin >> a >> b;
auto f = [&](ll a) {
if(a%2) {
return (a+1)/2%2;
} else {
return ((a+1)/2%2)^a;
}
};
cout << (f(a-1)^f(b)) << endk;
return 0;
}
| 1 | 77,186,291 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0 ; i<(n) ; i++)
#define repr(i,n) for(int i=(n) ; i>=0 ; i--)
#define ALL(x) (x).begin(),(x).end()
using ll = long long;
using ull = unsigned long long;
const ll INF = 1LL<<60;
const int MINF = 1e9;
const int MOD = 1e9+7;
using vi = vector<int>;
using vii = vector<vi>;
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T>
T GCD(T a,T b){ return b ? GCD(b,a%b) : a ;}
template<typename T>
T LCM(T a,T b){ return a*b / GCD(a,b) ;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;cin >> n;
vi a(n+2,0);rep(i,n)cin >> a[i+1];
a.push_back(0);
int sum = 0;
for(int i=1;i<n+2;i++){
sum += abs(a[i] - a[i-1]);
}
for(int i=1;i<n+1;i++){
ll ans = sum - abs(a[i] - a[i-1]) - abs(a[i] - a[i+1]) + abs(a[i+1] - a[i-1]);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
int n;
cin >> n;
vll a(n+2);
a[0] = 0;
a[n+1] = 0;
rep(i,n) cin >> a[i+1];
vll b(n+1);
rep(i,n+1) b[i] = abs(a[i+1]-a[i]);
vll c(n);
rep(i,n) c[i] = abs(a[i+2]-a[i]);
ll cnt = 0;
rep(i,n+1) cnt += b[i];
rep(i,n) {
ll ans = cnt;
ans -= (b[i]+b[i+1]);
ans += c[i];
cout << ans << endl;
}
return 0;
}
| 1 | 47,735,636 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX = 10000000;
int sol(int x)
{
int sum = 0, kai;
for(int i = 1; i <= x; i++)
{
sum += i;
if (sum >= x)
{
kai = i;
return kai;
}
}
return 0;
}
int main()
{
int n,num,i,fin,a[MAX/2] = {0};
cin >> n;
num = n;
i = 0;
while(1)
{
a[i] = sol(num);
num -= a[i];
if (num == 0)
{
fin = i;
break;
}
i++;
}
for(int j = fin; j >= 0 ; j--)
{
cout << a[j] <<endl;
}
return 0;
}
|
#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<28;
const ll INF=1ll<<50;
const double pi=acos(-1);
const double eps=1e-8;
const int mod=1e9+7;
const vi emp;
const int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
const int DX[8]={-1,-1,-1,0,0,1,1,1},DY[8]={1,0,-1,1,-1,1,0,-1};
int n;
int main(){
cin>>n;
int sum=0;
vi a;
int flag;
for(int i=1;i<=n;i++){
sum+=i;
a.push_back(i);
if(sum>=n){
flag=sum-n;
break;
}
}
for(int i=0;i<a.size();i++) if(a[i]!=flag) cout<<a[i]<<endl;
}
| 1 | 99,032,566 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
ll frac[5000];
ll comb(ll a, ll b) {
ll ans = frac[a];
ll sh1, sh2;
ll h = mod-2;
ll two;
while(h>0) {
two = 1;
sh1 = frac[b];
sh2 = frac[a-b];
while(2*two<h) {
two *= 2;
sh1 *= sh1;
sh1 %= mod;
sh2 *= sh2;
sh2 %= mod;
}
h -= two;
ans *= sh1*sh2%mod;
ans %= mod;
}
return ans;
}
int main() {
frac[0] = 1;
for(ll i=1;i<5000;++i) frac[i] = frac[i-1]*i%mod;
ll S;
cin>>S;
ll ans = 0;
for(ll i=1;i<=S/3;++i) {
ans += comb(S-3*i+i-1, i-1);
ans %= mod;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector < pii > vpii;
typedef vector < pll > vpll;
typedef vector <string> vs;
typedef vector < vi > vvi;
typedef vector < vll > vvll;
typedef vector< vpii > vvpii;
typedef vector < vpll > vvpll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ms;
#define all(v) (v).begin(), (v).end()
#define srt(v) sort (all (v))
#define pb push_back
#define fill (x, y) memset(x, y, sizeof(x))
#define clr(a) fill(a, 0)
#define PI 3.14159265358979323
const int Maxn = 2e5+3;
const ll Mod = 1e9 + 7;
#define trace1(x1) cerr << #x1 << ": " << x1 << endl;
#define trace2(x1, x2) cerr << #x1 << ": " << x1 << " | " << #x2 << ": " << x2 << endl;
#define trace3(x1, x2, x3) cerr << #x1 << ": " << x1 << " | " << #x2 << ": " << x2 << " | " << #x3 << ": " << x3 << endl;
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const ll MOD = 1000000007LL;
const ll MAX = 100010LL;
template <typename T> T power(T x, T y, ll m = MOD) { T ans = 1; x %= m; while (y > 0) { if (y & 1ll) ans = (ans * x) % m; y >>= 1ll; x = (x * x)%m; } return ans%m;}
void leastPrimeFactor(vector<int>&least_prime, int n)
{
least_prime[1] = 1;
for (int i = 2; i <= n; i++)
{
if (least_prime[i] == 0)
{
least_prime[i] = i;
for (int j = 2*i; j <= n; j += i)
if (least_prime[j] == 0)
least_prime[j] = i;
}
}
}
vll dp;
ll rec(int n)
{
if(n==3 || n==0)
return 1;
if(n<3)
return 0;
if(dp[n]!=-1)
return dp[n];
ll ans = 0;
for(int i = 3 ; i <= n ; i++)
ans = (ans+rec(n-i))%Mod;
return dp[n] = ans;
}
int main()
{
FAST_IO;
int n;
cin >> n;
dp = vll(n+1,-1);
cout << rec(n) << endl;
}
| 1 | 13,413,825 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#ifdef _debug
#define dout(i) cout << #i << ' ' << i << ' '
#else
#define dout(i)
#endif
using ll = long long;
using ull = unsigned long long;
using ul = unsigned;
using db = double;
int dif = 0;
const int maxn = 300000;
ll a[maxn], b[maxn];
int n;
ll res, sum;
int pos;
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for(int i = 1;i <= n;++i){
cin >> a[i] >> b[i];
sum += b[i];
}
for(int i = 1;i <= n;++i){
if(a[i] > b[i])res = max(res, sum-b[i]);
}
cout << res << '\n';
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
long long a,b,t=1000000001,ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a,&b);
ans+=a;
if(a>b)
t=min(t,b);
}
if(t==1000000001)
printf("0");
else printf("%lld",ans-t);
}
| 1 | 26,063,998 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod = 1e9+7;
#define ll long long
signed main() {
string s;
cin >> s;
int st = 0;
int ed = 1;
rep(i, s.length()-1) {
if(s[st]==s[ed]) {
cout << st+1<<" "<<ed+1 << endl;
return 0;
}
st++;
ed++;
}
st = 0;
ed = 2;
rep(i, s.length()-2) {
if(s[st]==s[ed]) {
cout << st+1<<" "<<ed+1 << endl;
return 0;
}
st++;
ed++;
}
cout << "-1 -1" << endl;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i ,n) for (int i = (n) - 1; i >= 0; i--)
#define LL long long
#define ULL unsigned long long
void fastIOS()
{
cin.tie(0);
ios::sync_with_stdio(false);
}
int main()
{
fastIOS();
string s; cin >> s;
int index = 0 , c = 0;
char x = s[0];
int i = 0;
if(s.size()==2 && s[0] == s[1]){
cout<< 1 << " " << 2;
return 0;
}
if(s.size()>=2){
while(i<s.size()){
if(s[i]==x){
c++;
}
else{
c--;
}
if(c<0)
{
c = 1;
i--;
x = s[i];
index = i;
}
if(i-index>=2){
cout << index+1 << " " << i+1 << endl;
return 0;
}
i++;
}
}
cout << -1 << " " << -1 << endl;
return 0;
}
| 1 | 9,257,790 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound
#define REP(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
bool isnull(vector<int> h)
{
int n=h.size();
for (int i=0;i<n;i++)
{
if (h[i]!=0) return (false);
}
return (true);
}
int main()
{
int N;cin>>N;
vector<int> h(N);
for (int i=0;i<N;i++)
cin>>h[i];
int i=0;
int count=0;
while (!isnull(h))
{
i=0;
while (h[i]==0)
{
i++;
}
while (h[i]>=1)
{
h[i]-=1;
i++;
}
count++;
}
cout<<count<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
int x;
cin>>x;
int y[x];
for (int i=0; i<x; i++)
cin>>y[i];
int a[x]= {},ans=0;
while (1)
{
int cnt=0;
for (int i=0; i<x; i++)
{
if (a[i]==y[i])
{
if (cnt)
{
ans++;
for (int j=i-cnt; j<i; j++)
a[j]++;
}
cnt=0;
}
else
{
cnt++;
}
}
if (cnt)
{
ans++;
for (int j=x-cnt; j<x; j++)
a[j]++;
}
bool end=1;
for (int i=0; i<x; i++)
if (a[i]!=y[i])
end=0;
if (end)
break;
}
cout<<ans;
return 0;
}
| 1 | 20,726,999 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n,k;
int main(void){
cin>>n>>k;
if(k%2==0){
cout<<(n/k)*(n/k)*(n/k)+((n+k/2)/k)*((n+k/2)/k)*((n+k/2)/k)<<endl;
}else{
cout<<(n/k)*(n/k)*(n/k)<<endl;
}
}
|
#include <iostream>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <climits>
#include <numeric>
#include <queue>
#include <cmath>
#include <iomanip>
#include <array>
#include <string>
#include <stack>
#include <cassert>
#include <memory>
int main() {
int n, k; std::cin >> n >> k;
long long int zero{ n / k};
long long int half{ ((k & 1) == 0 && (n >= k / 2)) ? (n - k / 2) / k + 1 : 0 };
std::cout << zero * zero * zero + half * half * half << '\n';
}
| 1 | 52,144,224 |
#include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-9;
const ld PI = 3.141592653589793;
const int maxn = 300001;
const ll MOD = 1e9 + 7;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
}
ll pw(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
}
return res;
}
template<typename Cont>
vector<vector<int>> accum2d(Cont a, int n, int m) {
vector<vector<int>> res(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
res[i][j] = a[i][j];
if (i > 0) {
res[i][j] += res[i - 1][j];
}
if (j > 0) {
res[i][j] += res[i][j - 1];
}
if (i > 0 && j > 0) {
res[i][j] -= res[i - 1][j - 1];
}
}
}
return res;
}
vector<vector<int>> resize2d(vector<vector<int>> a, int n, int m) {
a.resize(n);
for (auto &x:a) {
x.resize(m);
}
return a;
}
int up[1030][1030];
int down[1030][1030];
int lft[1030][1030];
int rght[1030][1030];
int ans[1030][1030];
int pref[1030][1030];
int arifm[1030][1030];
int dp1[1030][1030];
int dp2[1030][1030];
signed main() {
#ifdef zxc
struct rlimit rl;
const rlim_t kStackSize = 512L * 1024L * 1024L;
assert(!getrlimit(RLIMIT_STACK, &rl));
rl.rlim_cur = kStackSize;
assert(!setrlimit(RLIMIT_STACK, &rl));
freopen("../kolya_input.txt", "r", stdin);
#else
#endif
auto solve = [](int _) {
int n;
cin >> n;
ll k;
cin >> k;
vector<int> a(n);
for (int &el:a) {
cin >> el;
}
ll ans = 0;
for (int i = 0; i < n; ++i) {
int pref = 0;
int val = 0;
for (int j = 0; j < n; ++j) {
if (a[i] < a[j]) {
++val;
if (j < i) {
++pref;
}
}
}
ans += 1ll * k * (k - 1) / 2 % MOD * val % MOD + pref * k;
ans %= MOD;
}
cout<<ans;
};
fast_io();
cout.precision(9);
cout << fixed;
auto start = chrono::steady_clock::now();
for (int i = 1; i <= 1; ++i)solve(i);
auto end = chrono::steady_clock::now();
debug("time", chrono::duration_cast<chrono::milliseconds>(end - start).count() / 1000.0);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
using V = vector<int>;
using VV = vector<vector<int>>;
int Inf = (1<<30);
ll inf = (1LL<<60);
const int MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
V a(n);
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll count = 0;
for (i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) count++;
}
}
ll count2 = 0;
for (i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > a[j]) count2++;
}
}
ll ans = 0;
ans += count * k;
ans %= MOD;
ll tmp = (k * (k - 1)) / 2 % MOD;
ans += count2 * tmp;
ans %= MOD;
cout << ans;
return 0;
}
| 1 | 7,968,441 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int main(){
string S;
cin>>S;
for (int i =0; i < S.size(); i+=2) {
cout<<S.at(i);
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int x,t;
string s;
cin >> s;
rep(i,s.size()){
if (i%2 == 1) continue;
else cout << s[i];
}
cout << endl;
return 0;
}
| 1 | 24,579,832 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >>a>>b;
int count = 0;
if(a.at(0) == b.at(0)){
count++;
}if(a.at(1) == b.at(1)){
count++;
}if(a.at(2) == b.at(2)){
count++;
}cout << count <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<long long,long long> > vpll;
typedef vector<vector<ll> > vvll;
template<typename T> T gcd(T a,T b) { if(a==0) return b; return gcd(b%a,a); }
template<typename T> T pow(T a,T b, ll m){T ans=1; while(b>0){ if(b%2==1) ans=(ans*a)%m; b/=2; a=(a*a)%m; } return ans%m; }
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
bool sortinrev(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.first > b.first);
}
int main() {
string s,s1;ll i,c=0;
cin>>s>>s1;
fr(i,0,3)
{
if(s[i]==s1[i])
{
c++;
}
}
cout<<c;
return 0;
}
| 1 | 15,112,790 |
#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()
const int INF = 1LL<<30;
char fi[1010][1010];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int dist[1010][1010];
int main() {
int h,w;
cin>>h>>w;
rep(i,h) rep(j,w) dist[i][j]=-1;
queue<pair<int,int>> que;
rep(i,h){
rep(j,w){
cin>>fi[i][j];
if(fi[i][j]=='#'){
que.push({i,j});
dist[i][j]=0;
}
}
}
while (!que.empty()) {
auto v = que.front();
que.pop();
int x=v.first;
int y=v.second;
rep(i,4){
int nx=x+dx[i];
int ny=y+dy[i];
if(dist[nx][ny]!=-1) continue;
if(nx<0 || nx>=h || ny<0 || ny>=w) continue;
dist[nx][ny]=dist[x][y]+1;
que.push({nx,ny});
}
}
int ans=0;
rep(i,h){
rep(j,w){
ans=max(ans,dist[i][j]);
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e18;
const int mod=1e9+7;
const int M=100009;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
inline int ad(int x,int y){int ret=(x%mod+y%mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int sub(int x,int y){int ret=((x%mod)-(y%mod)+mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int gun(int x,int y){int ret=((x%mod)*(y%mod))%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
int r,c;
string s[1003];
bool vis[1003][1003];
int dis[1003][1003];
inline bool chk(int x,int y)
{
if(x>=0 && x<r && y>=0 && y<c)return true;
else return false;
}
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
main()
{
fast
cin>>r>>c;
queue<pi>q;
int ses=1;
f(i,0,r-1)
{
cin>>s[i];
f(j,0,c-1)
{
if(s[i][j]=='#')
{
q.push(mp(i,j));
vis[i][j]=1;
dis[i][j]=1;
}
}
}
while(!q.empty())
{
int x=q.front().fi;
int y=q.front().si;
q.pop();
f(k,0,3)
{
int nx=x+dx[k];
int ny=y+dy[k];
if(!chk(nx,ny))continue;
if(vis[nx][ny])continue;
vis[nx][ny]=1;
q.push(mp(nx,ny));
dis[nx][ny]=dis[x][y]+1;
ses=max(ses,dis[nx][ny]);
}
}
cout<<ses-1<<endl;
return 0;
}
| 1 | 94,900,743 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=2e9+7;
const long double PI = acos(0);
int main() {
ll a, b;
cin >> a >> b;
cout << (a*b)/__gcd(a, b) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B;
cin>>A>>B;
int ans=0;
for(int i=1;i<=B;i++){
if((A*i)%B==0){
cout<<A*i<<endl;
break;
}
}
return 0;
}
| 1 | 91,470,614 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.