code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF 1e18
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define PI (acos(-1))
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, init, n) for(int i = init; i <(int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
cout << max(0, a-b) << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
int n;
int a_cnt[1000000 + 5];
int ft[1000000 + 5];
int t;
int main() {
cin >> n;
vector<int> a;
memset(a_cnt, 0, sizeof(a_cnt));
memset(ft, 0, sizeof(ft));
for (int i = 0; i < n; ++i) {
cin >> t;
a.push_back(t);
++a_cnt[t];
}
sort(a.begin(), a.end());
int maxnum = a[n - 1];
for (int i = 0; i < n; ++i) {
t = a[i];
if (ft[t]) continue;
for (int j = t * 2; j <= maxnum; j=j+t) {
ft[j] = 1;
}
}
int ans = 0;
for (int i = 0; i < n; ++i) {
t = a[i];
if (a_cnt[t] > 1) continue;
if (ft[t]) continue;
++ans;
}
cout << ans << endl;
}
| 0
| 17,477,473
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n;
string s, t;
cin >> n >> s >> t;
for (int i=0 ; i<n ; i++)
cout << s.at(i) << t.at(i);
}
|
/*http:
#include <iostream>
#include <cmath>
#define MAX 1000000
#define hash(key,p) ((key)%(p))
#define hash_a(key) hash(key,MAX)
#define hash_b(key) (hash(key,MAX-1)+1)
#define myhash(key, n) hash_a(hash_a(key)+(n)*hash_b(key))
using namespace std;
string s[MAX];
int getKey(string value){
int key = 0;
for(int i=0;i<value.length();i++){
switch (value[i]) {
case 'A':
key += pow(5,i)*1;
break;
case 'C':
key += pow(5,i)*2;
break;
case 'G':
key += pow(5,i)*3;
break;
case 'T':
key += pow(5,i)*4;
break;
}
}
return key;
}
bool insert(string value){
int key = getKey(value);
for (int j = 0; j<MAX; j++) {
int h= myhash(key,j);
if(s[h]==""){
s[h]=value;
return true;
}else if(s[h]==value){
return false;
}
}
}
bool search(string value){
int key = getKey(value);
for (int j = 0; true; j++) {
int h= myhash(key,j);
if(j>MAX+1 || s[h]==""){
return false;
}else if(s[h]==value){
return true;
}
}
}
int main(){
int n;
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for (int i = 0; i < n; i++) {
string ins;
string value;
cin >> ins >> value;
if(ins=="insert"){
insert(value);
}else if(search(value)){
cout<<"yes"<<endl;
}else{
cout<<"no"<<endl;
}
}
return 0;
}
| 0
| 26,881,628
|
#include<iostream>
using namespace std;
int main()
{
int i,j,s=0,t=0,a[4],b[4];
for(j=0;j<2;j++)
{
for(i=0;i<4;i++)
{
if(j==0)
{
cin>>a[i];
s=a[i]+s;
}
else
{
cin>>b[i];
t=b[i]+t;
}
}
}
if(t<s)
{
cout<<s<<endl;
}
else
{
cout<<t<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define empb emplace_back
#define mp make_pair
#define F first
#define S second
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define vpii vector<pii>
#define mapii map<int,int>
#define mapll map<ll,ll>
#define all(a) a.begin(),a.end()
#define test int t; cin>>t; while(t--)
#define prec(n) fixed<<setprecision(n)
#define ItsFUN ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mod 1000000007
const int MIN = INT_MIN;
const int MAX = INT_MAX;
bool comp(const pair<ll,ll> &a, const pair<ll,ll> &b) {
return (a.second < b.second) ;
}
ll binpow(ll a, ll b) {
ll res = 1;
while(b) {
if(b&1) res = res * a;
a = a*a;
b = b >> 1;
}
return res;
}
int main(){
ItsFUN;
ll k, x; cin >> k >> x;
if(k*500 >= x) {
puts("Yes");
}
else puts("No");
return 0;
}
| 0
| 48,378,704
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
vector<ll> sum(n+1,0);
rep(i,n){
sum.at(i+1) = sum.at(i) + a.at(i);
}
map<ll,ll> nums;
rep(i,n+1) nums[(sum.at(i) % m)] ++;
ll res=0;
for(auto it:nums){
ll num=it.second;
res += num*(num-1)/2;
}
cout << res << endl;
}
|
#include <iostream>
#include <cstdio>
#include <climits>
using namespace std;
int main(void) {
int num;
while(cin >> num, num != 0) {
int ary[num + 1];
ary[0] = 0;
for(int r = 1; r <= num; r++) {
int input; cin >> input;
ary[r] = ary[r - 1] + input;
}
int max = INT_MIN;
for(int r = 1; r <= num; r++) {
for(int c = 0; c < r; c++) {
int val = ary[r] - ary[c];
if(val > max) max = val;
}
}
cout << max << endl;
}
return(0);
}
| 0
| 64,480,589
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 100000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
int N, M;
vector<int> vec(MAX_N);
int main() {
cin >> N >> M;
int L = 1; int R = MAX_N;
int tmpL, tmpR;
rep(i, M) {
cin >> tmpL;
L = max(L, tmpL);
cin >> tmpR;
R = min(R, tmpR);
}
int ans = 0;
for (int i = L; i <= R; i++)
{
ans++;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define MOD 1000000007
#define INF INT32_MAX / 2
#define PIE 3.14159265358979323
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
T GCD(T a, T b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<vector<pair<int, int>>> prefecture(n + 1, vector<pair<int, int>>(0));
vector<pair<int, int>> res(m + 1);
int p, y;
rep(i, m) {
cin >> p >> y;
prefecture[p].push_back(make_pair(y, i + 1));
}
repk(i, 1, n + 1) sort(prefecture[i].begin(), prefecture[i].end());
repk(i, 1, n + 1) {
for (int j = 0; j < prefecture[i].size(); j++) {
res[prefecture[i][j].second] = make_pair(i, j + 1);
}
}
repk(i, 1, m + 1) {
cout << setfill('0') << right << setw(6) << res[i].first;
cout << setfill('0') << right << setw(6) << res[i].second << endl;
}
}
| 0
| 4,795,210
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
#define INF 1 << 29
#define REP(i,n) for(ll i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(ll i=(k);i<(int)(n);i++)
vector<bool> gen_sosuu(vector<bool> sosuu){
int size = sosuu.size();
REP(i,size){
sosuu[i] = true;
}
sosuu[0] = false;
sosuu[1] = false;
sosuu[2] = true;
FOR(i,2,sqrt(size)+1){
if(sosuu[i] == false) continue;
for(int j = 2; i*j<size;j++){
sosuu[i*j] =false;
}
}
return sosuu;
}
int n;
vector<int> a;
int main(){
cin >> n;
REP(i,n){
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(),a.end(),greater<int>());
int ma = a[0];
int mi = INT_MAX;
int ans;
FOR(i,1,n){
if(mi > abs(ma/2-a[i])){
mi = abs(ma/2-a[i]);
ans = a[i];
}
}
cout << ma << " " << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int arr[200001];
int main()
{
fast_in_out;
int n, cnt = 1;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> arr[i];
if(i > 0)
{
if(arr[i] < arr[i - 1])
{
cnt++;
}
else
{
arr[i] = arr[i - 1];
}
}
}
cout << cnt;
}
| 0
| 2,694,614
|
#include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <string>
#include <climits>
#include <set>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <numeric>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
for (int i = 1; i <= 3; i++)
{
if (a != i && b != i)
{
cout << i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<int>X(26,0);
string S;cin>>S;
for(long long i=0;i<S.size();i++){
X[(int)S[i]-97]++;
}
for(long long i=0;i<26;i++){
if(X[i]==0){
int ans=i+97;
cout<<(char)ans<<endl;
return 0;
}
}
cout<<"None"<<endl;
return 0;
}
| 0
| 45,972,048
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
cout << 360 / gcd(360, n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (int) (1e9+7)
#define INF (int) 1e9
#define LLINF (ll) 1e18
int main(){
string s;
cin >> s;
int tmp=0, ans = 0;
rep(i, s.size()){
if(s[i]=='R'){
tmp++;
}else{
tmp=0;
}
chmax(ans, tmp);
}
cout << ans << endl;
return 0;
}
| 0
| 72,088,743
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num,fin=0;
string str;
char a=str[0];
cin >> num >> str;
for (int i=0; i<num; i++) {
char b=str[i];
if (a!=b){
fin++;}
a=b;}
cout << fin;}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
struct Point {
ll x, y;
Point() : x(0), y(0) {}
Point(ll x, ll y) : x(x), y(y) {}
int quadrant() const {
if(x == 0 && y == 0){
return 0;
}
if(x >= 0){
if(y >= 0){
return 1;
}else{
return 4;
}
}else{
if(y >= 0){
return 2;
}else{
return 3;
}
}
}
Point& operator+=(const Point& other){
x += other.x;
y += other.y;
return *this;
}
bool operator<(const Point& q) const {
int qp = quadrant();
int qq = q.quadrant();
if(qp != qq){ return qp < qq; }
return (x * q.y - y * q.x) > 0;
}
ll norm2() const {
return x * x + y * y;
}
double norm() const {
return sqrt((double)norm2());
}
};
int main(){
ll n;
cin >> n;
vector<Point> p(n);
for(int i = 0; i < n; ++i){
cin >> p.at(i).x >> p.at(i).y;
}
sort(p.begin(), p.end());
double ans = 0;
for(int i = 0; i < p.size(); ++i){
Point a;
for(int j = 0; j < p.size(); ++j){
a += p.at((i + j) % p.size());
ans = max(ans, a.norm());
}
}
printf("%.11f\n", ans);
return 0;
}
| 0
| 45,052,380
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long int ull;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=1e18;
struct UnionFindTree{
vector<int> par,rank;
UnionFindTree(int n):par(n),rank(n,0){
for(int i=0;i<n;i++) par[i]=i;
}
int root(int x){
if(par[x]==x) return x;
return par[x]=root(par[x]);
}
void unite(int x,int y){
int rx=root(x),ry=root(y);
if(rx==ry) return ;
if(rank[rx]<rank[ry]) par[rx]=ry;
else par[ry]=rx;
if(rank[rx]==rank[ry]) rank[rx]++;
}
bool same(int x,int y){
return root(x)==root(y);
}
};
int main(){
int n,m;cin>>n>>m;
vector<int> p(n);
for(int i=0;i<n;i++){
cin>>p[i];p[i]--;
}
UnionFindTree UFT(n);
for(int i=0;i<m;i++){
int x,y;cin>>x>>y;
x--;y--;
UFT.unite(x,y);
}
int ans=0;
for(int i=0;i<n;i++)if(UFT.same(i,p[i])) ans++;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll ans = 9000000000000000000;
vector<ll> vx;
vector<ll> vy;
vector<pair<ll, ll>> vxy;
rep(i,n){
ll x, y;
cin >> x >> y;
vx.push_back(x);
vy.push_back(y);
vxy.push_back(make_pair(x, y));
}
sort(vx.begin(), vx.end());
sort(vy.begin(), vy.end());
for (int xi = 0; xi < n; xi++){
for (int xj = xi + 1; xj < n; xj++){
for (int yi = 0; yi < n; yi++){
for (int yj = yi + 1; yj < n; yj++){
int cn = 0;
ll tmp = (ll)(vx[xj] - vx[xi]) * (vy[yj] - vy[yi]);
for (int i = 0; i < n; i++){
pair<ll, ll> p = vxy[i];
if(vx[xi] <= p.first && p.first <= vx[xj] && vy[yi] <= p.second && p.second <= vy[yj]){
cn++;
}
if(cn >= k && ans > tmp){
ans = tmp;
}
}
}
}
}
}
cout << ans << endl;
}
| 0
| 35,603,085
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, K;
ll R, S, P;
string T;
map<char, ll> points;
vector<vector<char>> wake;
ll count = 0;
cin >> N >> K;
cin >> R >> S >> P;
cin >> T;
points['r'] = P;
points['s'] = R;
points['p'] = S;
wake.resize(K);
rep(i, N) wake[i % K].push_back(T[i]);
iter(line, wake) {
bool win = false;
rep(i, line.size()) {
if(i != 0) {
if(line[i - 1] == line[i]) {
if(win) {
win = false;
} else {
count += points[line[i]];
win = true;
}
} else {
count += points[line[i]];
win = true;
}
} else {
count += points[line[i]];
win = true;
}
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long N,M,L =1; cin >> N >> M;
long a[N];
for (int i =0; i<N; i++) {
cin >> a[i]; a[i] /=2; L = lcm(L,a[i]);
}
for (int i =0; i<N; i++) {
if (L / a[i] % 2 ==0) {
cout << 0 << endl;
return 0;
}
}
long ans;
if (M % (2*L) >=L) ans = M / (2*L) + 1;
else ans = M/(2*L);
cout << ans <<endl;
}
| 0
| 9,762,059
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
cout << (x < 1200 ? "ABC" : "ARC") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int maxn = 2000005;
void solve() {
ll n;
cin >> n;
ll ans = 0;
f1(n) {
ans += i * (n + 1 - i);
}
f(n - 1) {
int x, y;
cin >> x >> y;
ans -= (n + 1 - max(x,y)) * (min(x,y));
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c = 0;
int t;
if (!c) {
t = 1;
}
else {
cin >> t;
}
while (t--) {
solve();
}
}
| 0
| 99,810,690
|
#include<iostream>
using namespace std;
int main()
{
int m, f, r;
for(int i=0; ; i++){
cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
int a = m+f;
if(a>=80) cout << 'A' << endl;
else if(a>=65 && a<80) cout << 'B' << endl;
else if(a>=50 && a<65) cout << 'C' << endl;
else if(a>=30 && a<50 && r>=50) cout << 'C' << endl;
else if(m==-1 || f==-1) cout << 'F' << endl;
else if(a>=30 && a<50) cout << 'D' << endl;
else if(a<30) cout << 'F' << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
for (int i=0; i<1e6; i++) {
if ((int)(i*0.08) == a && (int)(i*0.1) == b) {
cout << i << "\n";
return 0;
}
}
cout << "-1\n";
}
| 0
| 55,396,827
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
ull s;
cin>>s;
int cnt = 0;
unordered_set<ull> se;
while(se.count(s)==0) {
se.insert(s);
++cnt;
if(s&1)s=3*s+1;
else s>>=1;
}
cout<<cnt+1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
|
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
int n,x,i;
list <int> a;
list<int>::iterator it;
string com;
cin>>n;
for(i=0;i<n;i++){
cin>>com;
if(com=="deleteFirst") a.pop_front();
else if(com=="deleteLast") a.pop_back();
else{
cin>>x;
if(com=="insert") a.push_front(x);
else for(it=a.begin();it!=a.end();it++) if(*it==x){
a.erase(it);
break;
}
}
}
i=0;
for(it=a.begin();it!=a.end();it++){
if(i++) cout<<" ";
cout<<*it;
}
cout<<endl;
return 0;
}
| 0
| 38,464,042
|
#include<bits/stdc++.h>
#define lli long long int
#define endl "\n"
using namespace std;
typedef long long int LLI;
typedef double DB;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
bool comparator(pair<lli,lli> a,pair<lli,lli> b)
{
if(a.first>b.first)
return true;
else if (a.first==b.second)
{
if(a.second>=b.second)
return false;
return true;
}
return false;
}
int mods(int x)
{
if(x>0)
return x;
return -x;
}
lli gcd(lli a,lli b)
{
return __gcd(a,b);
}
lli lcm(lli x,lli y,lli z)
{
lli j=gcd(x,y);
lli k=gcd(y*x/j,z);
return (((x*y)/j)*z)/k;
}
int main()
{
fastio();
lli h,w; cin>>h>>w;
if(h==1 || w==1) {cout<<1<<endl; return 0;}
cout<<((w+1)/2)*((h+1)/2)+(w/2)*(h/2);
return 0;
}
|
#include<stdio.h>
int main () {
int matrix[3][3];
char x;
for (int i = 0 ; i < 3 ; i++) {
for (int j = 0 ; j < 3 ; j++) {
scanf("%d", &matrix[i][j]);
}
}
int n;
scanf("%d", &n);
int angka[n];
for (int i = 0 ; i < n ; i++) {
scanf("%d", &angka[i]);
for (int j = 0 ; j < 3 ; j++) {
for (int k = 0 ; k < 3 ; k++) {
if (angka[i] == matrix[j][k]) {
matrix[j][k] = x;
}
}
}
}
int counter[8] = {0};
int akhir = 2;
for (int i = 0 ; i < 3 ; i++) {
if(matrix[i][0] == x) {
++counter[0];
}
if(matrix[i][2] == x) {
++counter[1];
}
if(matrix[0][i] == x) {
++counter[2];
}
if(matrix[2][i] == x) {
++counter[3];
}
if(matrix[i][i] == x) {
++counter[4];
}
if(matrix[i][akhir--] == x) {
++counter[5];
}
if(matrix[1][i] == x) {
++counter[6];
}
if(matrix[i][1] == x) {
++counter[7];
}
}
int flag = 0;
for(int i = 0 ; i < 8 ; i++) {
if(counter[i] == 3) {
flag = 1;
}
}
printf("%s\n", (flag == 1) ? "Yes" : "No") ;
return 0;
}
| 0
| 87,821,085
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> ab(n);
rep(i, n) cin >> ab[i].first >> ab[i].second;
sort(all(ab), [](pair<ll, ll> &a, pair<ll, ll> &b){ return a.first < b.first; });
auto it = ab.begin();
priority_queue<ll> pq;
ll ans = 0;
rrep(i, m) {
while((it != ab.end()) && (i <= (m - it->first))) {
pq.push(it->second);
it++;
}
if (pq.empty()) continue;
ans += pq.top();
pq.pop();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
string T;
cin>>S>>T;
int a[26];
for(int i=0;i<26;i++){
a[i]=-1;
}
for(int i=0;i<S.length();i++){
if(a[S.at(i)-'a']==-1){
a[S.at(i)-'a']=T.at(i)-'a';
}
if(a[S.at(i)-'a']>=0){
if(T.at(i)-'a'==a[S.at(i)-'a']){
continue;
}
else{
cout<<"No"<<endl;
return 0;
}
}
}
map<int,int>mp;
for(int i=0;i<26;i++){
if(a[i]!=-1){
mp[a[i]]++;
if(mp[a[i]]>=2){
cout<<"No"<<endl;
return 0;
}
}
}
cout<<"Yes"<<endl;
return 0;
}
| 0
| 25,485,670
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,S,H,J,I;
cin >> N;
S = N / 1000;
N = N % 1000;
H = N / 100;
N = N % 100;
J = N / 10;
I = N % 10;
if (S == H && H == J ) {
cout << "Yes" << endl;
}
else if (H ==J && J == I) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define DEBUG
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD (ll)(1e9 + 7)
#define vi vector<int>
#define vii vector<vector<int> >
#define vl vector<ll>
#define vll vector<vector<ll> >
#define vc(T, nm) vector<T> nm
#define pb push_back
#define popb pop_back
#define si set<int>
#define sl set<ll>
#define F first
#define S second
#define pii pair<int, int>
#define mp make_pair
#define ins insert
#define ers erase
#define endl "\n"
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define adr(a, b) ((a % MOD) + (b % MOD)) % MOD
#define FORA(x, s, e, inc) for(ll x = s; x != e; x += inc)
#define ROFA(x, s, e, inc) for(ll x = s; x != e; x -= inc)
#define FOR(x, s, e) FORA(x, s, e, 1)
#define ROF(x, s, e) ROFA(x, s, e, 1)
#define loop(x, n) FOR(x, 0, n)
#define rd1(t, a) t a; cin >> a;
#define rd2(t, a, b) rd1(t, a); rd1(t, b);
#define rd3(t, a, b, c) rd2(t, a, b); rd1(t, c);
#define rd4(t, a, b, c, d) rd3(t, a, b, c); rd1(t, d);
#define rd5(t, a, b, c, d, e) rd4(t, a, b, c, d); rd1(t, e);
#define rd6(t, a, b, c, d, e, f) rd5(t, a, b, c, d, e); rd1(t, f);
#define rdA(t, nm, len) t nm[len]; loop(i, len) {cin >> nm[i];}
#ifdef DEBUG
#define deb(v) cout << endl << #v << ": " << v << endl
#define db1(v) cout << endl << #v << ": " << "[ "; for(auto x: v) {cout << x << " ";}; cout << "]" << endl;
#define db2(v) cout << endl << #v << ": " << endl; for(auto r: v) {cout << "[ "; for(auto x: r) {cout << x << " ";}; cout << "]" << endl;};
#define dbl cout << "-------------------------------" << endl
#else
#define deb(v)
#define db1(v)
#define db2(v)
#define dbl
#endif
vl parent(100005), weight(100005);
ll findset(ll u) {
if(parent[u] == u)
return u;
return parent[u] = findset(parent[u]);
}
void joinset(ll u, ll v) {
ll a = findset(u);
ll b = findset(v);
if(a != b) {
parent[a] = b;
weight[b] += weight[a];
}
}
ll solve(ll n, ll m, vl &A, vector<pair<ll, ll> > &P) {
FOR(i, 0, 100005) {
parent[i] = i;
weight[i] = 1;
}
FOR(i, 0, m) {
ll u = P[i].F, v = P[i].S;
joinset(u, v);
}
ll ct = 0;
FOR(i, 0, n) {
if(A[i] == i + 1)
ct++;
else {
if(findset(i + 1) == findset(A[i]))
ct++;
}
}
return ct;
}
void Input() {
rd2(ll, n, m);
vl A(n);
FOR(i, 0, n)
cin >> A[i];
vector<pair<ll, ll> > P(m);
FOR(i, 0, m)
cin >> P[i].F >> P[i].S;
cout << solve(n, m, A, P);
}
int main() {
fastio;
ll t = 1;
while(t--) {
Input();
}
return 0;
}
| 0
| 89,176,263
|
#include <iostream>
using namespace std;
int main() {
long long n, m, k;
cin >> n >> m >> k;
cout << max(n-k, 0LL) << ' ' << max(0LL, m + min(0LL, n - k));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 1e5 + 5;
int n, m;
vector <int> adj[N];
int col[N];
ll cnt[3];
bool val;
void dfs(int v) {
for (auto u : adj[v]) {
if(!col[u]) {
col[u] = 3 - col[v];
dfs(u);
}
else if(col[u] == col[v])
val = 0;
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int v, u;
cin >> v >> u;
v--, u--;
adj[v].push_back(u);
adj[u].push_back(v);
}
for (int i = 0; i < n; i++) {
if(!col[i]) {
if(adj[i].size() == 0)
cnt[0]++;
else {
col[i] = val = 1;
dfs(i);
if(val)
cnt[1]++;
else
cnt[2]++;
}
}
}
cout << 1LL * (2 * n - cnt[0]) * cnt[0] + 1LL * (cnt[1] + cnt[2]) * (cnt[1] + cnt[2]) + (cnt[1] * cnt[1]) << "\n";
}
| 0
| 57,786,612
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a,b,x;
inline int read() {
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
inline void smax(ll &x,ll y) {
x=x<y?y:x;
}
int main() {
cin>>a>>b>>x;
if (x>a) {
b-=(x-a);
smax(b,0);
}
a-=x;
smax(a,0);
cout<<a<<' '<<b<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LLU long long unsigned
#define rarr(arr, n) for(int aab = 0; aab < n; aab++){cin >> arr[aab];}
#define parr(arr, n) for(int aab = 0; aab < n; aab++){cout << arr[aab] << " ";}
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n";
#define freopen freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout);ios_base::sync_with_stdio(0);cin.tie(0);
int main(){
long long int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
long long int aa[a], bb[b], cc[c];
rarr(aa, a);
rarr(bb, b);
rarr(cc, c);
sort(aa, aa + a, greater<>()), sort(bb, bb + b, greater<>());
vector<long long int> v1;
for(int i = 0; i < x; i++) v1.pb(aa[i]);
for(int i = 0; i < y; i++) v1.pb(bb[i]);
for(int i = 0; i < c; i++) v1.pb(cc[i]);
sort(all(v1), greater<>());
long long int ans = 0;
for(int i = 0; i < x + y; i++) ans += v1[i];
cout << ans;
}
| 0
| 53,800,417
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll n;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
ll ans=0;
for(ll i=1;i*i<=n;i++){
if((n-i)%i==0&&(n-i)/i>i)ans+=(n-i)/i;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
string s; cin>>s;
ll k; cin>>k;
rep(i, k){
if(i >= s.size()) break;
if(s[i] != '1'){
cout << s[i] << endl;
return 0;
}
}
cout << '1' << endl;
return 0;
}
| 0
| 63,004,157
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int len = s.size();
bool ok = true;
if(s.at(0) != 'A') ok = false;
int cntc = 0;
for(int i = 1; i < len; i++){
if(isupper(s.at(i))){
if(i == 1 || i == len - 1 || s.at(i) != 'C') ok = false;
if(s.at(i) == 'C') cntc++;
}
}
if(cntc != 1) ok = false;
if(ok) cout << "AC" << endl;
else cout << "WA" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ppp pop_back
#define fi first
#define se second
#define pii pair<int,int>
const int N = 1e5 + 5;
int a[N];
int b[500][N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i=1; i<N; i++) a[i] = 0;
for (int k=2; k*(k-1)/2 < N; k++) a[k*(k-1)/2] = k;
if (a[n]) {
int k = a[n];
for (int i=1; i<=k; i++) {
for (int j=1; j<=n; j++) {
b[i][j] = 0;
}
}
int col = 1;
for (int i=1; i<=k-1; i++) {
for (int j=i+1; j<=k; j++) {
b[i][col] = 1;
b[j][col] = 1;
col++;
}
}
cout << "Yes\n";
cout << k << "\n";
for (int i=1; i<=k; i++) {
cout << k-1 << " ";
for (int j=1; j<=n; j++) {
if (b[i][j]) cout << j << " ";
}
cout << "\n";
}
}
else cout << "No\n";
return 0;
}
| 0
| 7,785,739
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
string s = " ";
string t;
cin >> t;
s += t;
int N = (int)t.size();
bool is = true;
int a = N/2;
rep(i, a){
if(s[1+i] != s[N-i]) is = false;
}
int b = a/2;
rep(i, b){
if(s[1+i] != s[(N-1)/2-i]) is = false;
}
rep(i, b){
if(s[(N+3)/2+i] != s[N-i]) is = false;
}
if(is) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
int main()
{
int q;scanf("%d",&q);
while(q--)
{
scanf("%lld%lld",&a,&b);
ll s=a*b,ans;
ll t=sqrt(s);
if(t*(t+1)<s) ans=2*(t-1)+1;
else ans=2*(t-1);
if(t*t==s&&a!=b) ans--;
if(a*b==4) ans=1;
printf("%lld\n",ans);
}
}
| 0
| 2,120,449
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define endl '\n'
#define lli long long int
#define rep(i, s, e) for (int i = s; i < e; i++)
int main()
{
int N;
cin >> N;
string S;
cin >> S;
vector<int> R, G, B;
rep(i, 0, N)
{
switch (S[i])
{
case 'R':
R.push_back(i);
break;
case 'G':
G.push_back(i);
break;
case 'B':
B.push_back(i);
break;
default:
break;
}
}
const int res = R.size() * G.size() * B.size();
unsigned int even = 0;
for (int r : R)
{
const int rr = 2 * r;
for (int g : G)
{
const int gg = 2 * g;
int rg = r + g;
for (int b : B)
{
const int bb = 2 * b;
const int br = b + r;
const int bg = b + g;
if (gg == br || bb == rg || rr == bg)
even++;
}
}
}
cout << res - even << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v1(n);
vector<bool> ok(n,true);
int mx = 0;
REP(i,n){
cin >> v[i];
v1[i] = v[i];
}
sort(v1.begin(),v1.end());
REP(i,n){
if(v[i] != v1[n-1]){
mx = max(mx,v[i]);
}
}
if(v1[n-1] == v1[n-2]){
REP(i,n){
cout << v1[n-1] << endl;
}
}
else{
REP(i,n){
if(v[i] == v1[n-1]){
cout << mx << endl;
}
else{
cout << v1[n-1] << endl;
}
}
}
}
| 0
| 36,958,417
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
string s;
cin >> s;
int ans = 0;
ans += (s[0] == '7');
ans += (s[1] == '7');
ans += (s[2] == '7');
cout << (0 < ans ? "Yes" : "No") << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
cin >> n;
int taro = 0, hanako = 0;
for (size_t i = 0; i < n; i++){
string s, t;
cin >> s >> t;
if (s > t)taro += 3;
else if (s < t)hanako += 3;
else{
++taro;
++hanako;
}
}
cout << taro << ' ' << hanako << endl;
char c;
cin >> c;
}
| 0
| 58,630,948
|
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF=1LL<<60;
int n;
int main(){
cin>>n;
vector<int> d(n);
rep(i,0,n) cin>>d[i];
ll ans=0;
rep(i,0,n-1){
ll num=0;
rep(j,i+1,n) num+=d[j];
ans+=d[i]*num;
}
cout<<ans<<"\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
struct LLPair {
int num;
int prev_last_match;
};
int main() {
const int use[10] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int N, M;
scanf("%d %d", &N, &M);
vector<int> A(M);
for (int i = 0; i < M; i++) {
scanf("%d", &A[i]);
}
static LLPair dp[5010][10010];
memset(dp, 0, sizeof(dp));
for (int iM = 0; iM < M; iM++) {
if (N < use[A[iM]]) {
continue;
}
if (A[iM] > dp[1][N - use[A[iM]]].num) {
dp[1][N - use[A[iM]]].num = A[iM];
dp[1][N - use[A[iM]]].prev_last_match = 0;
}
}
for (int iKeta = 1; iKeta <= N / 2; iKeta++) {
for (int iLast = 2; iLast <= N; iLast++) {
if (dp[iKeta][iLast].num == 0) {
continue;
}
for (int iM = 0; iM < M; iM++) {
if (iLast < use[A[iM]]) {
continue;
}
if (A[iM] > dp[iKeta + 1][iLast - use[A[iM]]].num) {
dp[iKeta + 1][iLast - use[A[iM]]].num = A[iM];
dp[iKeta + 1][iLast - use[A[iM]]].prev_last_match = iLast;
}
}
}
}
int next_index = 0;
int next_keta = 0;
for (int iKeta = N / 2; iKeta > 0; iKeta--) {
if (dp[iKeta][0].num > 0) {
next_keta = iKeta;
break;
}
}
while (next_keta > 0) {
printf("%d", dp[next_keta][next_index].num);
next_index = dp[next_keta][next_index].prev_last_match;
next_keta--;
}
printf("\n");
return 0;
}
| 0
| 78,229,737
|
#include <iostream>
using namespace std;
int main()
{
while (true)
{
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
return 0;
if (m == -1 || f == -1)
cout << "F" << endl;
else if (m + f >= 80)
cout << "A" << endl;
else if (m + f >= 65)
cout << "B" << endl;
else if (m + f >= 50 || r >= 50)
cout << "C" << endl;
else if (m + f >= 30)
cout << "D" << endl;
else
cout << "F" << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <assert.h>
using namespace std;
typedef long long LL;
const int N=100000+10;
int n,sz[N];
pair<LL,LL> d[N];
vector<LL> g[N];
bool cmp(pair<LL,LL> p1,pair<LL,LL> p2){
return p1.second>p2.second;
}
map<LL,LL> mp;
vector< pair<LL,LL> > res;
int dep[N]; LL sum=0;
void prt(int u,int p){
for(auto v:g[u]){
if(v==p)continue;
res.push_back(make_pair(u,v));
dep[v]=dep[u]+1; sum+=dep[v];
prt(v,u);
}
}
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++){
d[i].first=i;
scanf("%lld",&d[i].second);
mp[d[i].second]=i;
sz[i]=1;
}
sort(d+1,d+1+n,cmp);
for(int i=1;i<n;i++){
LL tmp=d[i].second;
LL nex=tmp-(n-2*sz[d[i].first]);
if(mp[nex]==0||nex>=tmp){
return !printf("-1\n");
}
int u=mp[nex];
int v=d[i].first;
g[u].push_back(v); g[v].push_back(u);
sz[u]+=sz[v];
}
prt(d[n].first,d[n].first);
if(sum != d[n].second) return !printf("-1\n");
if(res.size()==n-1){
for(auto p: res) printf("%lld %lld\n", p.first, p.second);
} else {
printf("-1\n");
}
}
| 0
| 68,067,761
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int hig=0, ans=0;
for(int i=0; i<n; ++i){
int x;
cin >> x;
if(x>hig) ans += x-hig;
hig = x;
}
cout << ans << endl;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define sqr(x) ((x) * (x))
#define ull unsigned long long
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("blackjack.out","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
#define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
void bad(string mes = "Impossible"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
template<typename T>
string bin(T x, int st = 2){
string ans = "";
while (x > 0){
ans += char('0' + x % st);
x /= st;
}
reverse(ans.begin(), ans.end());
return ans.empty() ? "0" : ans;
}
mt19937_64 mt_rand(
chrono::system_clock::now().time_since_epoch().count()
);
template<typename T1, typename T2> inline bool upmax(T1& a, T2 b) { return (a < b ? (a = b, true) : false); }
template<typename T1, typename T2> inline bool upmin(T1& a, T2 b) { return (b < a ? (a = b, true) : false); }
template<typename T>
T gcd (T a, T b) { while (b) { a %= b; swap (a, b); } return a; }
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)1e5 + 3, base = (int) 1e9+2012;
const ll llinf = 2e18 + 5;
int main() {
fast_io;
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
int j = n - i;
if (j <= i) {
continue;
}
ans++;
}
cout << ans;
return 0;
}
| 0
| 12,113,860
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int N;cin>>N;
int T[N],A[N],tlH[N],thH[N],alH[N],ahH[N];
REP(i,N)tlH[i]=thH[i]=alH[i]=ahH[i]=0;
REP(i,N)cin>>T[i];
REP(i,N)cin>>A[i];
REP(i,N){
if(i==0)tlH[i]=thH[i]=T[i];
else{
if(T[i]==T[i-1]){
tlH[i]=1;thH[i]=T[i];
}
else tlH[i]=thH[i]=T[i];
}
}
REP(i,N){
if(i==0)alH[N-1-i]=ahH[N-1-i]=A[N-1-i];
else{
if(A[N-1-i]==A[N-i]){
alH[N-1-i]=1;ahH[N-1-i]=A[N-1-i];
}
else alH[N-1-i]=ahH[N-1-i]=A[N-1-i];
}
}
int ans=1;
REP(i,N){
int d=min(ahH[i],thH[i])-max(alH[i],tlH[i])+1;
if(d<=0){
ans=0;
}
ans*=d;
ans%=MOD;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x, y) min<ll>(x, y)
#define tmax(x, y, z) lmax((x), lmax((y), (z)))
#define tmin(x, y, z) lmin((x), lmin((y), (z)))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
const ll INF = 1LL << 60;
const ll MM = 1000000000; const ll MOD = MM + 7; const ll MMM=9223372036854775807;
#define ADD(a,b) a = (a + ll(b)) % MOD
#define MUL(a,b) a = (a * ll(b)) % MOD
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;}
template<class T> inline bool chmin(T& a, T b){ if(a > b){ a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if(a < b){ a = b; return true;} return false;}
template<typename A, size_t N, typename T> void FILL(A (&array)[N], const T &val){ fill( (T*)array, (T*)(array+N), val );}
ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
ll n, ans = -1; cin >> n;
map<ll, ll> mp;
rep(i, n){
ll a; cin >> a;
mp[a]++, mp[a-1]++, mp[a+1]++;
}
for(auto p: mp){
chmax(ans, p.second);
}
cout << ans << endl;
}
| 0
| 37,681,624
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
ll ans=15-s.size();
for(ll i=0;i<s.size();i++){
if(s[i]=='o'){
ans++;
}
}
cout << (ans>=8?"YES":"NO");
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const T &_pair, ll num=0){
cout << endl; for(pair<ll, int> x: _pair){ cout << x.first << " " << x.second << endl;}
}
template <typename T>
void print_vec2(const vector<vector<T>>& v){
cout << endl; cout << " ";
for(ll i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(ll i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(ll j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
int cost(vector<int> vec, int length){
int res = 0, sum = 0;
res += ((int)vec.size()-1) * 10;
for(int x : vec) sum += x;
res += abs(length - sum);
return res;
}
int main(){
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> bamb(N);
for(int i=0; i<N; i++) cin >> bamb[i];
const int INF = 1e9+1;
int ans = INF;
const int NUM = 16;
for(int i=0; i<(1<<NUM); i++){
bitset<NUM> bit(i);
vector<int> a, b, c;
for(int j=0; j<N; j++){
if(bit[j] == 0 && bit[j+N] == 0) a.push_back(bamb[j]);
if(bit[j] == 0 && bit[j+N] == 1) b.push_back(bamb[j]);
if(bit[j] == 1 && bit[j+N] == 0) c.push_back(bamb[j]);
}
if((int)a.size()==0) continue;
if((int)b.size()==0) continue;
if((int)c.size()==0) continue;
int yen = 0;
yen += cost(a, A);
yen += cost(b, B);
yen += cost(c, C);
ans = min(ans, yen);
}
cout << ans << endl;
return 0;
}
| 0
| 3,070,681
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define rep(i,n) for(int i = 0 ; i < n ;i++)
int main(){
string s ;
cin >> s ;
rep(i,s.size()){
if( s[i] == ',' )cout << ' ';
else cout << s[i] ;
}
}
|
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n;
cin>>n;
int a[n],i;
for(i=0;i<n;i++)
cin>>a[i];
int l=a[0]; int r=a[0];
for(i=0;i<n;i++)
{
l=min(l,a[i]);
r=max(r,a[i]);
}
int sum=1000000000;
for(i=l;i<=r;i++)
{
int ans=0;
for(int j=0;j<n;j++)
ans+=(a[j]-i)*(a[j]-i);
sum=min(sum,ans);
}
cout<<sum<<"\n";
}
| 0
| 63,599,852
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int a = N / X;
if(N % X != 0) T *= a + 1;
if(N % X == 0) T *= a;
cout << T << endl;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define ld long double
#define endl "\n"
#define ff first
#define ss second
#define pi pair<ll, ll>
#define PI 3.141592653589793238462643383279502884L
#define mp make_pair
#define pb push_back
#define fall(i, a, b) for (int i = a; i < b; i++)
#define sz(x) (ll) x.size()
#define all(x) x.begin(), x.end()
#define ed cout << "ed";
#define time_passed 1.0 * clock() / CLOCKS_PER_SEC
ll MOD = 1e9 + 7;
ll MOD1 = 1e9 + 123;
ll MOD2 = 1e9 + 321;
int main()
{
fio;
ll t, a, n, q, k, i, l, m, c, u, f, j, p, x, y, b, d;
cin >> n >> m;
if(m<=2*n)cout<<m/2<<endl;
else{
cout<<(m-2*n)/4 + n<<endl;
}
return 0;
}
| 0
| 68,833,522
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N,M;
cin >> N >> M;
vector<int> cnt(N,0);
for(int i=0;i<M;i++){
int a,b;
cin >> a >> b;
a--;
b--;
cnt.at(a)++;
cnt.at(b)++;
}
for(int i=0;i<N;i++){
if(cnt.at(i)%2!=0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
for(int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> z[i];
}
ll ans = 0;
for(int i = 0; i < 8; i++) {
vector<ll> sum(n, 0);
for(int j = 0; j < n; j++) {
if(i >> 0 & 1){
sum[j] += x[j];
}else{
sum[j] -= x[j];
}
if(i >> 1 & 1){
sum[j] += y[j];
}else{
sum[j] -= y[j];
}
if(i >> 2 & 1){
sum[j] += z[j];
}else{
sum[j] -= z[j];
}
}
sort(sum.rbegin(), sum.rend());
ll score = 0;
for(int j = 0; j < m; j++) {
score += sum[j];
}
ans = max(ans, score);
}
cout << ans << endl;
return 0;
}
| 0
| 19,352,194
|
#include <bits/stdc++.h>
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end();
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a,b,c;cin>>a>>b>>c;
if(a+b >= c){
cout << "Yes";
}else{
cout << "No";
}
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 40005
#define eps 1e-12
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
string s;
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
cin >> s;
if(s.substr(0,4) == "YAKI") puts("Yes");
else puts("No");
}
| 0
| 8,624,053
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long int i,s=0,j;
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j=j+i)
{ s=s+j;
}
}
cout<<s<<endl;
}
|
#include <iostream>
#include <string>
using namespace std;
struct Trump{
string suit;
string num;
};
void print(Trump trump[], long N){
for (long i = 0; i < N; i++){
cout << trump[i].suit << trump[i].num;
if (i < N - 1) cout << " ";
}
cout << endl;
}
void BubbleSort(Trump trump[], long N){
for (long i = 0; i < N; i++){
for (long j = N - 1; j >= i && j > 0; j--){
if (trump[j].num < trump[j - 1].num){
swap(trump[j], trump[j - 1]);
}
}
}
}
void SelectionSort(Trump trump[], long N){
for (long i = 0; i < N; i++){
long minj;
minj = i;
for (long j = i; j < N; j++){
if (trump[j].num < trump[minj].num){
minj = j;
}
}
Trump tmp;
tmp = trump[i];
trump[i] = trump[minj];
trump[minj] = tmp;
}
}
bool isStable(Trump card1[], Trump card2[], long N){
BubbleSort(card1, N);
SelectionSort(card2, N);
for (long i = 0; i < N; i++){
if (card1[i].num == card2[i].num){
if (card1[i].suit != card2[i].suit){
return false;
}
}
}
return true;
}
int main(){
long N;
cin >> N;
string c;
Trump card1[36];
Trump card2[36];
for (long i = 0; i < N; i++){
cin >> c;
card1[i].suit = c[0];
card1[i].num = c[1];
}
for (long i = 0; i < N; i++){
card2[i] = card1[i];
}
BubbleSort(card1, N);
SelectionSort(card2, N);
print(card1, N);
cout << "Stable" << endl;
print(card2, N);
if (isStable(card1, card2, N)) cout << "Stable" << endl;
else cout << "Not stable" << endl;
return 0;
}
| 0
| 10,767,716
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int D, X;
cin >> D >> X;
int choco[110];
for(int i = 0; i < N; i++){
cin >> choco[i];
}
for(int i = 0; i < N; i++){
int niti = 1;
while(D >= niti){
niti += choco[i];
X++;
}
}
cout << X << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
struct primegroup{
vector<int> r;
primegroup(int n){
r = vector<int>(1000001, 0);
r[1] = n;
}
void unite(int x){
for(int i=2; i*i<=x; i++){
if(x%i != 0) continue;
while(x%i == 0){
x/=i;
}
r[i]++;
}
if(x != 1) r[x]++;
}
void judge(){
int maxval=0;
for(auto i=2; i<r.size(); i++){
if(r[i]>0)
maxval = max(maxval, r[i]);
}
if(maxval <= 1)
cout<<"pairwise coprime"<<endl;
else if(maxval != r[1])
cout<<"setwise coprime"<<endl;
else
cout<<"not coprime"<<endl;
}
};
int main(){
int n;
cin>>n;
primegroup pg(n);
for(int i=0; i<n; i++){
int m;
cin>>m;
pg.unite(m);
}
pg.judge();
return 0;
}
| 0
| 98,616,251
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll N, i; cin >> N >> i;
cout << N - i + 1 << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>
#include <new>
using namespace std;
#define EPS (1e-9)
#define INF (1e9)
#define MOD (ll)(1e9 + 7)
#define PI (acos(-1))
#define REP(i,a,n) for(int i=a;i<n;i++)
#define rep(i, n) REP(i,0,n)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" ; "IMPOSSIBLE")
using ll = long long int;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll beki(ll a, ll b) {
ll tmp = 1;
rep(i, b) tmp *= a;
return tmp;
}
ll modPow(ll x, ll a) {
if (a == 1) return x;
if (a % 2) return (x * modPow(x, a - 1)) % MOD;
ll t = modPow(x, a / 2);
return ((t % MOD) * (t % MOD)) % MOD;
}
ll modInv(ll x) {
return modPow(x, MOD - 2);
}
ll X, Y, A, B, C;
vector<ll> p(100010), q(100010), r(100010);
priority_queue<ll, vector<ll>, greater<ll>> p_que, q_que;
ll ans = 0;
int main() {
cin >> X >> Y >> A >> B >> C;
rep(i, A) cin >> p[i];
rep(i, B) cin >> q[i];
rep(i, C) cin >> r[i];
sort(p.begin(), p.end(), greater<ll>());
sort(q.begin(), q.end(), greater<ll>());
sort(r.begin(), r.end(), greater<ll>());
rep(i, X) {
p_que.push(p[i]);
}
rep(i, Y) {
q_que.push(q[i]);
}
for (ll i = 0; min(p_que.top(), q_que.top()) < r[i]; i++) {
if (p_que.top() <= q_que.top()) {
p_que.pop();
p_que.push(r[i]);
}
else {
q_que.pop();
q_que.push(r[i]);
}
}
rep(i, X) {
ans += p_que.top();
p_que.pop();
}
rep(i, Y) {
ans += q_que.top();
q_que.pop();
}
cout << ans << endl;
}
| 0
| 37,586,508
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) sort(v.begin(), v.end())
typedef long long ll;
using Graph = vector<vector<int>>;
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i < n; i++)
{
for (int j = 1; j <= (n / i); j++)
{
if (i * j < n)
{
cnt++;
}
else
{
break;
}
}
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long mod=1000000007;
long long bigmod(long long n,long long p)
{
if(p==0)return 1;
if(p%2==0)
{
long long ret=bigmod(n,p/2);
return ((ret%mod)*(ret%mod))%mod;
}
else
return ((n%mod)*(bigmod(n,p-1)%mod))%mod;
}
long long ara[100005];
int main()
{
long long n,k,i,j,lp,ans=0,fr,sc,tr,p,q,r,z;
scanf("%lld %lld",&n,&k);
for(i=k;i>=1;i--)
{
p=k/i; fr=bigmod(p,n);
sc=ara[i];
if(fr>=sc)tr=fr-sc;
else{ tr=(mod-sc)+fr; }
z=(tr*i)%mod;
ans=(ans+z)%mod;
for(j=1;j*j<=i;j++)
{
if(i%j==0)
{
ara[j]=(ara[j]+tr)%mod;
r=i/j;
if(r!=i && r!=j)
{
ara[r]=(ara[r]+tr)%mod;
}
}
}
}
printf("%lld\n",ans);
return 0;
}
| 0
| 12,539,987
|
#include <iostream>
#include <queue>
using namespace std;
struct pos{
int x,y;
pos(int _x,int _y){x=_x;y=_y;}
};
int a[1000][1000],m[1000][1000],sh,sw;
int ans(int p,int q,int h,int w,int count);
void map(int H,int W){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout << m[i][j] << " ";
}
cout<<"\n";
}
cout<<"\n";
}
int main(){
int H,W,count,d,T;
char b;
cin>>H;
cin>>W;
cin>>d;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>b;
if('1'<=b&&b<='9'){
a[i][j]=b-48;
}else if(b=='X'){
a[i][j]=-1;
}else if(b=='S'){
sh=i;
sw=j;
a[i][j]=0;
}else if(b=='.'){
a[i][j]=0;
}
}
}
for(T=0,count=0;count<d;count++){
T+=ans(sh,sw,H,W,count);
}
cout<<T<<endl;
return 0;
}
int ans(int p,int q,int h,int w,int count){
int gx,gy;
int dy[4]={-1,0,0,1},dx[4]={0,-1,1,0};
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
m[i][j]=-1;
if(a[i][j]==count+1){
gx=i;
gy=j;
}
}
}
sh=gx;
sw=gy;
m[p][q]=0;
queue<pos> Q;
Q.push(pos(p,q));
while(Q.size()){
pos b=Q.front();
Q.pop();
for(int i=0;i<=3;i++){
if(0<=b.x+dx[i]&&b.x+dx[i]<h&&0<=b.y+dy[i]&&b.y+dy[i]<w&&m[b.x+dx[i]][b.y+dy[i]]==-1){
if(a[b.x+dx[i]][b.y+dy[i]]!=-1){
Q.push(pos(b.x+dx[i],b.y+dy[i]));
m[b.x+dx[i]][b.y+dy[i]]=m[b.x][b.y]+1;
}
}
}
}
return m[gx][gy];
}
|
#include <bits/stdc++.h>
using namespace std;
#define long long long
#define size 5005
const long MOD = 1e9+7;
bool dp[size];
int A[size];
pair<int,int>pos[size];
signed main()
{
long test;
test=1;
while(test--){
long i,j,b,n,x,k,ans,most,index,c,maxi=0,temp,aw,bw,w,count,sum;
cin>>n>>k;
for(i=0;i<n;i++)cin>>A[i];
sort(A,A+n);
sum=0;
for(i=0;i<n;i++)sum+=A[i];
memset(dp,false,sizeof(dp));
dp[0]=true;
int ret=0;
for(i=n-1;i>=0;i--)
{
bool up=false;
for(j=0;j<k;j++)
{
if(dp[j] && j+sum>=k)up=true;
}
if(!up)ret++;
sum-=A[i];
for(j=k-1;j>=A[i];j--)
{
dp[j]|=dp[j-A[i]];
}
}
cout<<ret;
}
}
| 0
| 14,375,220
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[100005];
ll p[100005];
ll S[100005];
ll ans= 0;
int main(){
scanf("%d",&n);
for (int i = 0; i <= n; i++){
scanf("%lld",&a[i]);
}
for (int i = n; i >= 0; i--){
p[i] = p[i+1]+a[i];
}
for (int i = 0; i <= n; i++){
S[i] = (i==0?1:2*S[i-1])-a[i];
S[i] = min(S[i],p[i+1]);
ans += S[i]+a[i];
if (S[i] < 0){
printf("-1\n");
return 0;
}
}
printf("%lld",ans);
}
|
#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;
int n;
cin >> n;
vector<int> arr(n);
for(int i = 0; i < n; ++i){
cin >> arr[i];
}
int ans = 0, cnt = 0;
for(int i = 1; i < n; ++i){
if(arr[i] <= arr[i - 1]){
cnt++;
}
else{
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans, cnt) ;
}
| 0
| 37,327,873
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
ll n,m,a,b;
cin>>n>>m;
vector<pair<ll,ll>> v(n);
REP(i,n){
cin>>a>>b;
v[i]=make_pair(a,b);
}
sort(ALL(v));
ll bottles=0, cost=0, i=0;
while(bottles<m){
bottles+=v[i].second;
cost+=v[i].first*v[i].second;
if(bottles>=m){
break;
}
i++;
}
while(bottles>m){
bottles--;
cost-=v[i].first;
}
cout<<cost;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define mem0(a) memset(a,0,sizeof(a))
#define rep(i,a,n) for( ll i=a ; i<n ; i++)
#define ld long double
#define rall(a) (a).rbegin(),(a).rend()
ll power(ll b,ll e,ll m)
{
if(e==0) return 1;
if(e&1) return b*power(b*b%m,e/2,m)%m;
return power(b*b%m,e/2,m);
}
ll power( ll b, ll e)
{
if(e==0) return 1;
if(e&1) return b*power(b*b,e/2);
return power(b*b,e/2);
}
bool isPowerOfTwo(ll x)
{
return (x && !(x & (x - 1)));
}
void solve()
{
ll a,b,c,k;
cin>>a>>b>>c>>k;
int x=0,y=0;
while(b<=a)
{
b*=2;
x++;
}
while(c<=b)
{
c*=2;
y++;
}
if(x+y<=k) cout<<"Yes"<<"\n";
else cout<<"No"<<"\n";
}
int main()
{
fastio
ll tt=1;
while(tt--)
{
solve();
cout<<"\n";
}
return 0;
}
| 0
| 71,787,523
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.14159265358979;
const ll MAX=200020;
int main() {
ll N;
cin>>N;
ll a[N];
ll b[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
for(int i=0;i<N;i++){
cin>>b[i];
}
ll cnt=0;
for(int i=0;i<N;i++){
if(a[i]>b[i]){
cnt+=a[i]-b[i];
}
else{
cnt-=(b[i]-a[i])/2;
}
}
if(cnt>0){
cout<<"No";
}
else{
cout<<"Yes";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc106_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
string S;
int K;
cin >> S >> K;
int ans = 1;
int N = min(K, (int)S.size());
rep(i, N) {
int j = S[i] - '0';
if (j != 1) {
ans = j;
break;
}
}
cout << ans << endl;
}
| 0
| 51,600,700
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; int64_t K; cin >> S >> K;
int64_t sumF = 0, sumS = 0, sumT = 0;
string tmpF = S, tmpS = S + S, tmpT = S + S + S;
for (int i = 0; i < tmpF.size() - 1; i++) {
if (tmpF.at(i) == tmpF.at(i + 1)) {
sumF++;
tmpF.at(i + 1) = '0';
}
}
for (int i = 0; i < tmpS.size() - 1; i++) {
if (tmpS.at(i) == tmpS.at(i + 1)) {
sumS++;
tmpS.at(i + 1) = '0';
}
}
for (int i = 0; i < tmpT.size() - 1; i++) {
if (tmpT.at(i) == tmpT.at(i + 1)) {
sumT++;
tmpT.at(i + 1) = '0';
}
}
int64_t addS = sumS - sumF, addT = sumT - sumS;
if (K == 1) { cout << sumF << endl; return 0; }
if ((K - 1) % 2 == 0) cout << sumF + (addS + addT) * ((K - 1) / 2) << endl;
else cout << sumF + (addS + addT) * ((K - 1) / 2) + addS << endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
int main(){
ll n;
cin>>n;
vector<long double> v(n);
REP(i,n){
cin>>v[i];
}
sort(ALL(v));
long double mean=(v[0]+v[1])/2;
FOR(i,2,n){
mean=(mean+v[i])/2;
}
cout<<mean;
return 0;
}
| 0
| 18,230,764
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#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()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
ll gcd(ll x, ll y) {
if(x > y)
return gcd(y, x);
else if(x == 0)
return y;
else
return gcd(y % x, x);
}
ll lcm(ll x, ll y) {
ll g = gcd(x, y);
return g * (x / g) * (y / g);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> T(N);
ll ans = 1;
rep(i, N) {
cin >> T[i];
ans = lcm(ans, T[i]);
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
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 pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int 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 = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,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 T> inline void print(T &a){
for(auto itr = a.begin(); itr != a.end(); itr++){
cout << *itr << " ";
}
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
cout << "debug: " << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << "debug: " << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b,a%b);
}
int main(){
int n; cin >> n;
int M = 1e6;
vector<int> b(M+1,0);
vb visit(M+1,0);
int gc = 0;
rep(i,n){
int a; cin >> a;
gc = GCD(gc,a);
b[a]++;
}
if(gc > 1){
cout << "not coprime" << "\n";
return 0;
}
for(int i=2; i<=M; i++){
if(visit[i]) continue;
int a = 0;
for(int j=i; j<=M; j+=i){
visit[j] = 1;
a += b[j];
}
if(a >= 2){
cout << "setwise coprime" << "\n";
return 0;
}
}
cout << "pairwise coprime" << "\n";
}
| 0
| 51,514,115
|
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; }
else if(k == 1) { return n; }
else return C(n-1,k-1) + C(n-1,k);
}
lint P(lint n, lint k) {
if(k == 1) { return n; }
return (n*(P(n-1,k-1)%1000000007)%1000000007);
}
int main() {
lint n; cin >> n;
cout << (n-1)*n/2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
set<int> chair;
for(int i=0;i<n;i++){
int l,r;
cin>>l>>r;
for(int i=l;i<=r;i++){
chair.insert(i);
}
}
cout<<chair.size()<<endl;
return 0;
}
| 0
| 54,745,171
|
#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");}
# define M_PI 3.14159265358979323846
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...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[], int n) {
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
int no = 1, n1;
int recu(int n, int k, int val) {
if (n == n1) {
return min(val * 2, val + k);
}
return min( recu(n + 1, k, 2 * val), recu(n + 1, k, val + k) );
}
int digit(int n) {
int temp = 0;
while (n) {
n = n / 10;
temp++;
}
return temp;
}
bool check(int a[], int n) {
for (int i = 0; i < n; ++i)
{
if (a[i] % 2)
return false;
}
return true;
}
bool ispalin(int n) {
string str = to_string(n);
for (int i = 0; i < str.size() / 2; ++i)
{
if (str[i] != str[str.size() - i - 1]) {
return false;
}
}
return true;
}
bool is_palindrome(string s) {
int n = s.size();
for (int i = 0; i < n / 2; ++i)
{
if (s[i] != s[n - i - 1])
return false;
}
return true;
}
int check(string s, string t) {
int sum = 0;
for (int i = 0; i < s.size(); ++i)
{
if (s[i] == t[i])
sum++;
}
return sum;
}
vector<int> ad[10];
int n;
int ans = 0;
void dfs(int node , int parent, bool visited[]) {
visited[node] = true;
for (int child : ad[node]) {
if (!visited[child]) {
dfs(child, node, visited);
visited[child] = false;
}
}
int kk=0;
for (int i = 1; i <=n; ++i)
{
if(visited[i])
kk++;
}
if(kk==n)
ans++;
}
int main() {
int i, m, k;
long long int sum = 1;
c_p_c();
int a, b;
cin >> n >> m;
bool visited[10] = {false};
for (int i = 0; i < m; ++i)
{
cin >> a >> b;
ad[a].pb(b);
ad[b].pb(a);
}
dfs(1, -1, visited);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> 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<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
string s;
cin>>s;
int n=s.size();
bool ok=true;
map<char,int> cnt;
rep(i,0,n){
cnt[s[i]]++;
if(cnt[s[i]]>1){
ok=false;
}
}
if(ok)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
| 0
| 52,485,966
|
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<set>
#include<array>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i);
using namespace std;
string r="qwertasdfgzxcvb";
string l="yuiophjklnm";
bool serch(string str,char ch){
rep(i,str.size()){
if(str[i]==ch) return true;
}
return false;
}
int main(){
while(1){
string str;
cin >>str;
if(str=="#")break;
int flag=-1;
int ans=0;
if(serch(r,str[0])) flag=1;
else flag=0;
for(int i=1;i<str.size();i++){
if(serch(r,str[i])&&flag==0){
ans++;
flag=1;
}else if(serch(l,str[i])&&flag==1){
ans++;
flag=0;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int main()
{
fio;
string s;
cin>>s;
ll ans = 0;
for(ll i=0;i<s.length();i++)
{
ans += (s[i] - '0');
}
cout<<(ans%9 ? "No" : "Yes");
return 0;
}
| 0
| 74,288,420
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll INF=1LL<<60;
ll gcd(ll x,ll y){return y? gcd(y,x%y) :x;}
ll dp[200010];
int main(){
int n,k;
cin>>n>>k;
vector<ll>h(n);
rep(i,200010)dp[i]=INF;
rep(i,n)cin>>h[i];
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=1;i<n;i++){
for(int j=0;j<k;j++){
if(i-j-1>=0)chmin(dp[i],dp[i-j-1]+abs(h[i]-h[i-j-1]));
}
}
cout<<dp[n-1]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = 1e18 + 5;
const int mod = 1e9 + 7;
const int N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
void solve(){
int n;
string s;
cin>>n>>s;
int cnt=0;
for(char i = '0'; i <= '9'; i++){
for(char j = '0'; j <= '9'; j++){
string x = "";
x+=i, x+=j;
for(char l = '0'; l <= '9'; l++){
string y = x;
y+=l;
int z = 0;
for(int k = 0; k < n; k++){
if(s[k]==y[z])z++;
}
if(z==3)cnt++;
}
}
}
cout<<cnt;
}
signed main(){
speed;
int t=1;
while(t--)solve();
}
| 0
| 70,507,608
|
#include "bits/stdc++.h"
using namespace std;
const int mx = 200000 + 9;
bitset <mx> mark;
int d[mx];
vector <int> adj[mx];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
mark[1] = 1;
queue <int> q;
q.push(1);
while (!q.empty()) {
auto u = q.front();
q.pop();
for (auto v : adj[u]) {
if (mark[v]) continue;
mark[v] = 1;
d[v] = 1 + d[u];
q.push(v);
}
}
if (d[n] == 2) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
int m, n_min, n_max, p;
vector<int> v;
while (cin>>m>>n_min>>n_max, m||n_min||n_max) {
for (int i = 0; i < m; ++i) {
cin>>p;
v.push_back(p);
}
sort(v.begin(), v.end(), greater<int>());
int size = static_cast<int>(v.size());
int diff = 0;
int ans = 0;
for (int i = n_max - 1; i >= n_min - 1; --i) {
if (v[i] - v[i+1] > diff) {
diff = v[i] - v[i+1];
ans = i;
}
}
cout<<ans+1<<endl;
v.clear();
}
return 0;
}
| 0
| 72,850,169
|
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >>x;
long long ans = 0;
int mx = 0;
for (int i = 0 ; i < n; i++) {
if (a[i] < mx) ans += mx - a[i];
mx = max(a[i], mx);
}
cout << ans;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
int main(){
int cnt[4] = {};
rep(i, 3){
int a, b;
cin >> a >> b;
cnt[a-1]++, cnt[b-1]++;
}
rep(i, 4)if(cnt[i]>=3){
cout << "NO\n";
return 0;
}
cout << "YES\n";
}
| 0
| 98,945,882
|
#include <iostream>
using namespace std;
int main() {
int i, x, y, z, ans = 0;
cin >> x >> y >> z;
for (i = x; i <= y; i++) {
if(z % i == 0)
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
int main()
{
int n, ans=0;
cin >> n;
for(int i=105;i<=n;i+=2){
int count=0;
for(int j=1;j<=i;j++){
if(i%j==0)count++;
if(count >= 9)break;
}
if(count==8){
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 31,088,725
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,n) for(int i = 1; i < n; i++)
#define repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;
char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
inline void I(int&a,int&b){scanf("%d%d",&a,&b);}
inline void I(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void I(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void L(ll&a){scanf("%lld",&a);}
inline void L(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void L(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void L(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void S(string&str){str.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)str.pb(BUF[i]);}
inline void SV(vector<int>&v){v.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)if('a'<=BUF[i]&&BUF[i]<='z')v.pb(BUF[i]-'a');else v.pb(BUF[i]-'A');}
const auto EPS = 1e-10;
const auto INF = 100000000;
const auto MOD = 1000000007;
typedef pair<ll,ll> P;
int n, m;
bool saw[100000];
bool ssaw[100000];
int dep[100000];
vector<int> e[100000];
void init(int v, int d){
ssaw[v] = true;
rep(i,e[v].size()){
if(ssaw[e[v][i]]) continue;
dep[e[v][i]] = d+1;
init(e[v][i], d+1);
}
}
bool check(int v){
saw[v] = true;
rep(i,e[v].size()){
if(!saw[e[v][i]]){
bool rec = check(e[v][i]);
if(!rec) return false;
} else{
if(abs(dep[v]-dep[e[v][i]])%2 == 0){
return false;
}
}
}
return true;
}
int main(){
memset(saw,0,sizeof(saw));
I(n,m);
rep(i,m){
int u, v;
I(u,v); u--; v--;
e[u].push_back(v);
e[v].push_back(u);
}
ll counter = 0;
ll count = 0;
ll ans = 0;
ll hoge = 0;
rep(i,n){
if(ssaw[i] == false){
if(e[i].size() == 0){
ans += (n-hoge)*2-1;
hoge++;
continue;
}
dep[i] = 0;
init(i,0);
if(!check(i)){
count++;
}
counter++;
}
}
ans += count*counter;
ans += (counter-count)*(count+(counter-count)*2);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
using str = string;
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
long int M = 1e+9+7;
int inf = 1e+9;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int e5 = 100000;
int n;
cin >> n;
int v;
vi c0(e5+1),c1(e5+1);
rep(i,n){
cin >> v;
if(i%2) c1[v]++;
else c0[v]++;
}
int mxf0=0,mxs0=0,mxf1=0,mxs1=0;
rep(i,e5+1){
if(c0[mxf0] < c0[i]){
mxs0=mxf0;
mxf0=i;
}else if(c0[mxs0] < c0[i]){
mxs0=i;
}
if(c1[mxf1] < c1[i]){
mxs1=mxf1;
mxf1=i;
}else if(c1[mxs1] < c1[i]){
mxs1=i;
}
}
int ans;
if(mxf0 != mxf1) ans = n - (c0[mxf0]+c1[mxf1]);
else ans = n - max(c0[mxf0]+c1[mxs1], c0[mxs0]+c1[mxf1]);
cout << ans << endl;
return 0;
}
| 0
| 4,382,977
|
#include<bits/stdc++.h>
#include<unordered_map>
#include<tr1/unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define lin1(x) ll int x; x = scan();
#define lin2(x,y) ll int x, y; x = scan(), y = scan();
#define lin3(x,y,z) ll int x, y, z; x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x,y) make_pair(x,y)
#define mx(a,b) (a)>(b)?(a):(b)
#define mn(a,b) (a)<(b)?(a):(b)
#define fori(s,e) for(i=s;i<=e;i++)
#define forj(s,e) for(j=s;j<=e;j++)
#define fork(s,e) for(k=s;k<=e;k++)
#define rep(i,s,e) for(int i=s;i<=e;i++)
#define brep(i,s,e) for(int i=s;i>=e;i--)
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main()
{
#ifdef RAHUL
freopen("input.txt","r",stdin);
#endif
int a,b;
cin>>a>>b;
int max=a*3+b;
cout<<max/2<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const int INF32 = 1<<30;
const ll INF64 = 1LL<<60;
const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (ll i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
ll inv(ll a) {
return binpow(a, mod - 2);
}
ll A(ll n, ll m) {
return fac[n] * inv(fac[n - m]) % mod;
}
ll C(ll n, ll m) {
return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod;
}
void solve(){
ll x,y;cin >> x >> y;
if(y>x) swap(x,y);
ll j = x - y;
if((y-j)%3||y - j<0){
cout << 0;
return;
}
ll k = (y-j)/3;
ll k2 = k+j;
init();
cout << A(k+k2,k+k2)*inv(A(k,k)*A(k2,k2)%mod)%mod;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 0
| 15,192,386
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int n;
cin >> n;
long long ans=1, a;
bool zero = false, over = false;
rep(i, n){
cin >> a;
if(a == 0){
zero = true;
} else if(ans <= 1000000000000000000 / a){
ans *= a;
} else {
over = true;
}
}
if(zero){
cout << 0 << endl;
} else if(over){
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s,t;
cin>>s>>t;
int n = (int)s.size();
for(int i=0;i<n;i++){
if(s == t){
cout<<"Yes";
return 0;
}
t = t[n-1]+t;
t.pop_back();
}
cout<<"No";
return 0;
}
| 0
| 53,231,901
|
#include<bits/stdc++.h>
int main() {
long long num; std::cin >> num;
std::vector<long long>v(num + 1, 0);
for (long long x = 1; x <= num; x++) {
v[x]++;
for (long long z = x * 2; z <= num; z += x) {
v[z]++;
}
}
long long ans = 0;
for (long long x = 1; x <= num; x++) {
ans += (1LL * x * v[x]);
}
std::cout << ans;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define NIL -1
int main() {
LL h;
LL w;
cin >> h >> w;
LL min_num1=h*w;
LL min_num2=h*w;
LL min_num3=h*w;
LL min_num4=h*w;
LL tmp1;
LL tmp2;
LL tmp3;
LL tmp_diff;
LL ans;
if(h>=3){
if(h%3==0){
min_num1=0;
}else{
min_num1=w;
}
}
for(int i=1; i<=w; i++){
tmp1=i*h;
if(h%2==0){
tmp2=h/2*(w-i);
tmp3=h/2*(w-i);
}else{
tmp2=(h/2+1)*(w-i);
tmp3=h/2*(w-i);
}
if(tmp1>tmp2){
tmp_diff=tmp1-tmp3;
}else{
tmp_diff=tmp2-min(tmp1, tmp3);
}
if(min_num2>tmp_diff){
min_num2=tmp_diff;
}
}
if(w>=3){
if(w%3==0){
min_num3=0;
}else{
min_num3=h;
}
}
for(int i=1; i<=h; i++){
tmp1=i*w;
if(w%2==0){
tmp2=w/2*(h-i);
tmp3=w/2*(h-i);
}else{
tmp2=(w/2+1)*(h-i);
tmp3=w/2*(h-i);
}
if(tmp1>tmp2){
tmp_diff=tmp1-tmp3;
}else{
tmp_diff=tmp2-min(tmp1, tmp3);
}
if(min_num4>tmp_diff){
min_num4=tmp_diff;
}
}
ans = min(min(min_num1, min_num2), min(min_num3, min_num4));
cout << ans << endl;
return 0;
}
| 0
| 81,547,920
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
ll ans = pow(N/K, 3);
if (K % 2 == 0) {
ans += pow((2*N/K+1)/2, 3);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ,di = 0;
scanf("%d",&n);
vector <int> cnt(n);
for(int a,i=0; i<n; i++)
scanf("%d",&a) ,cnt[a]++ ,di = max(di ,a);
cnt[(di+1)/2] -=(di&1 ? 2 : 1);
bool poss = !cnt[(di+1)/2];
for(int i=(di+1)/2+1; i<=di; i++)
poss &= (cnt[i] >= 2);
for(int i=1; i<=(di+1)/2; i++)
poss &= !cnt[i];
printf(poss? "Possible\n" : "Impossible\n");
}
| 0
| 52,507,451
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<b;i++)
int main(){
ll n,k;
cin>>n>>k;
vector<ll> a(n),b(n);
rep(i,0,n){
cin>>a[i]>>b[i];
}
vector<ll> ks(1);
ks[0]=k;
bool f=0;
rep(i,0,30){
if(k&(1<<i)){
if(f){
ks.push_back(k^(1<<i)|((1<<i)-1));
}
}
else f=1;
}
ll ans=0;
rep(j,0,ks.size()){
ll cnt = 0;
rep(i,0,n){
if((a[i]|ks[j])==ks[j]) {
cnt+=b[i];
}
}
if(ans<cnt)ans=cnt;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#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()
using ll = long long;
using P = pair<int, int>;
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
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;
}
int main() {
int a, b;
cin >> a >> b;
if(a <= 8 && b <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
}
| 0
| 87,253,072
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++){
int temp;
cin >> temp;
mp[temp]++;
}
int cnt = 0;
for(auto x : mp){
if(x.first < x.second){
cnt += x.second - x.first;
} else if(x.first > x.second){
cnt += x.second;
}
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int> > a(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
a[u][v] = 1;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << a[i][j] << (j != n ? ' ' : '\n');
}
}
return 0;
}
| 0
| 86,930,875
|
#include <iostream>
#include <stack>
#include <queue>
#include <fstream>
using namespace std;
int main(){
int ans[1024] = {0};
int dataCounter = 0;
int i = 0;
while(1){
int visited[20][20] = {0};
int data[20][20];
int x,y;
int w = 0;
int h = 0;
queue<int> xst;
queue<int> yst;
cin >> w;
cin >> h;
if(w == 0 && h == 0) break;
for(i=0;i<h;i++){
int inputCounter = 0;
char d;
while(cin >> d){
if(d == '.')
data[i][inputCounter] = 0;
else if(d == '#')
data[i][inputCounter] = 1;
else if(d == '@'){
data[i][inputCounter] = 2;
x = inputCounter;
y = i;
}
if(inputCounter == w-1)break;
inputCounter++;
}
}
int j=0;
xst.push(x);
yst.push(y);
while(!xst.empty()){
x = xst.front();
y = yst.front();
xst.pop();
yst.pop();
if(x < 0 || w <= x || y < 0 || h <= y)continue;
if(visited[y][x]==1 || data[y][x] == 1)continue;
visited[y][x] = 1;
ans[dataCounter]++;
xst.push(x+1);
yst.push(y);
xst.push(x);
yst.push(y+1);
xst.push(x-1);
yst.push(y);
xst.push(x);
yst.push(y-1);
}
dataCounter++;
}
for(i=0;i<dataCounter;i++){
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = (int)1e5, MOD = (int)1e9 + 7, INF = (int)3e18;
int pref[N][5];
main() {
ios :: sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
pref[0][0] = (s[0] == 'R');
pref[0][1] = (s[0] == 'B');
pref[0][2] = (s[0] == 'G');
for (int i = 1; i < n; ++i) {
pref[i][0] = pref[i - 1][0] + (s[i] == 'R');
pref[i][1] = pref[i - 1][1] + (s[i] == 'B');
pref[i][2] = pref[i - 1][2] + (s[i] == 'G');
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n - 1; ++j) {
int k = -1;
if (s[i] == 'R' && s[j] == 'B') k = 2;
if (s[i] == 'B' && s[j] == 'R') k = 2;
if (s[i] == 'R' && s[j] == 'G') k = 1;
if (s[i] == 'G' && s[j] == 'R') k = 1;
if (s[i] == 'G' && s[j] == 'B') k = 0;
if (s[i] == 'B' && s[j] == 'G') k = 0;
if (k == -1)
continue;
int l = j + (j - i);
if (l < n) {
ans += pref[n - 1][k] - pref[l][k];
ans += pref[l - 1][k] - pref[j][k];
}
else {
ans += pref[n - 1][k] - pref[j][k];
}
}
}
cout << ans;
return 0;
}
| 0
| 85,244,198
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define scan4Int(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
typedef long long ll;
const int INF = 1001001001;
using namespace std;
int main() {
char s[101], t[101];
rep(i, 101) s[i] = t[i] = '\0';
scanf("%s", s);
scanf("%s", t);
int p = 0;
while (t[p] != '\0') {
printf("%c", t[p++]);
}
p = 0;
while (s[p] != '\0') {
printf("%c", s[p++]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int mx=0;
string s,t;cin>>s>>t;
REP(i,s.size()-t.size()+1){
int cnt=0;
REP(j,t.size()){
if(s[i+j]==t[j])cnt++;
}
mx=max(mx,cnt);
}
cout<<t.size()-mx<<endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0
| 4,949,027
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int A, B;
cin >> A >> B;
int ans = -1;
for (int i = 1; i <= 1000; ++i) {
double a = i * 0.08;
double b = i * 0.1;
if ((int)a == A && (int)b == B) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld",&a)
#define sf(a) scanf("%d",&a)
#define pf(a) printf("%d\n",a)
#define pfl(a) printf("%lld\n",a)
#define FOR(x,n) for(ll x=1;x<=n;++x)
#define pii pair< ll , ll >
#define mp(a,b) make_pair(a,b)
#define mod 1000000007
#define INF 2e18
#define EPS 1e-15
#define f1 first
#define f2 second
#define all(v) v.begin(),v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
int main(){
ll l,r,mn,g,h,p,q,r1,r2,ans;
sfl(l),sfl(r);
if(r-l>2019){
printf("0\n");
}
else{
ll mn=INF;
for(ll i=l;i<=r;i++){
for(ll j=i+1;j<=r;j++){
ll val =(i*j)%2019;
mn = min(mn,val);
}
}
pfl(mn);
}
return 0;
}
| 0
| 29,774,102
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s, result = ""; cin >> s;
for (int i = 0; i < s.length(); i += 2) result += s[i];
cout << result << "\n";
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
int a,b;
cin>>a>>b;
cout<<a*b-a-b+1<<endl;
}
int main(){
optimizeIO();
{ solve();
}
}
| 0
| 76,913,238
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
long long p[a],q[b],r[c];
for(int i=0;i<a;i++){
cin >> p[i];
}
for(int i=0;i<b;i++){
cin >> q[i];
}
for(int i=0;i<c;i++){
cin >> r[i];
}
LL ans = 0;
sort(p,p+a,greater<LL>());
sort(q,q+b,greater<LL>());
sort(r,r+c,greater<LL>());
LL s[x+y+c],iter = 0;
for(int i=0;i<x;i++){
s[iter] = p[i];
iter++;
}
for(int i=0;i<y;i++){
s[iter] = q[i];
iter++;
}
for(int i=0;i<c;i++){
s[iter] = r[i];
iter++;
}
LL t = x + y + c;
sort(s,s+t,greater<LL>());
for(int i=0;i<x+y;i++){
ans += s[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, A, B;
cin >> X >> A >> B;
string ans;
if (B <= A) ans = "delicious";
else if (B <= A + X) ans = "safe";
else ans = "dangerous";
cout << ans << endl;
return 0;
}
| 0
| 49,621,428
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
char ac = a[0] -0x20;
char bc = b[0] -0x20;
char cc = c[0] -0x20;
cout << ac << bc << cc << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for(int i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(int i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(int j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
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 num_2(ll x){
int res = 0;
while(x%2 == 0){
res++;
x /= 2;
}
return res;
}
int main(){
int N;
ll M;
cin >> N >> M;
vector<ll> a(N);
for(int i=0; i<N; i++) cin >> a[i];
for(int i=0; i<N; i++) a[i] = a[i]>>1;
for(int i=0; i<N-1; i++){
if(num_2(a[i]) != num_2(a[i+1])){
cout << 0 << endl;
return 0;
}
}
if(N == 1 ) a.push_back(1);
ll lcm = LCM(a[0], a[1]);
for(int i=0; i<N; i++){
lcm = LCM(lcm, a[i]);
}
if(lcm > M){
cout << 0 << endl;
return 0;
}
ll ans = (M/lcm+2-1) /2;
cout << ans << endl;
}
| 0
| 55,717,822
|
#include <iostream>
using namespace std;
int main() {
int house[4][3][10], n, building, floor, address, number;
for (int h = 0; h < 4; h++) {
for (int i = 0; i < 3; i++) {
for (int s = 0; s < 10; s++) {
house[h][i][s] = 0;
}
}
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> building >> floor >> address >> number;
house[building - 1][floor - 1][address - 1] += number;
if (house[building - 1][floor - 1][address - 1] >= 10) {
house[building - 1][floor - 1][address - 1] = 9;
} else if (house[building - 1][floor - 1][address - 1] < 0) {
house[building - 1][floor - 1][address - 1] = 0;
}
}
for (int h = 0; h < 4; h++) {
for (int i = 0; i < 3; i++) {
for (int s = 0; s < 10; s++) {
cout << " " << house[h][i][s];
}
cout << endl;
}
if ((h + 1) != 4) {
cout << "####################" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << '\n'; exit(0);}
ll quadrant(pair<ll, ll> xy)
{
ll x = xy.first, y = xy.second;
if (x >= 0 && y >= 0)
return 1;
if (x < 0 && y >= 0)
return 2;
if (x < 0 && y < 0)
return 3;
if (x >= 0 && y < 0)
return 4;
return 0;
}
bool comp(pair<ll, ll> xy1, pair<ll, ll> xy2)
{
ll q1 = quadrant(xy1), q2 = quadrant(xy2);
if (q1 != q2)
return (q1 < q2);
ll x1 = xy1.first, y1 = xy1.second;
ll x2 = xy2.first, y2 = xy2.second;
return (x2 * y1 < x1 * y2);
}
int main()
{
ll N;
cin >> N;
vector<pair<ll, ll>> XY;
for (ll i = 0; i < N; i++)
{
ll x, y;
cin >> x >> y;
if (!(x == 0 && y == 0))
XY.push_back(make_pair(x, y));
}
N = XY.size();
sort(XY.begin(), XY.end(), comp);
for (ll i = 0; i < N; i++)
{
XY.push_back(XY.at(i));
}
ll ans = 0;
for (ll i = 0; i < N; i++)
{
ll X = 0, Y = 0;
for (ll j = i; j < i + N; j++)
{
ll x = XY.at(j).first, y = XY.at(j).second;
X += x, Y += y;
ll tmp = X * X + Y * Y;
chmax(ans, tmp);
}
}
cout << fixed << setprecision(20) << sqrt(ans) << endl;
}
| 0
| 43,324,874
|
#include <bits/stdc++.h>
int n,i=1;
main(){
std::cin>>n;
for(;(i*i+i)/2<n;i++);
for(;i>0;i--){
if(n-i>=0){
std::cout<<i<<'\n';
n-=i;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int x[5],y[5];
cin >> x[1] >> y[1] >> x[2] >> y[2];
int dx = x[2] - x[1];
int dy = y[2] - y[1];
int ddx = abs(dx);
int ddy = abs(dy);
if(dx >= 0){
if(dy >= 0){
swap(ddx, ddy);
x[3] = x[2] - ddx;
y[3] = y[2] + ddy;
swap(ddx, ddy);
x[4] = x[3] - ddx;
y[4] = y[3] - ddy;
}
else{
swap(ddx, ddy);
x[3] = x[2] + ddx;
y[3] = y[2] + ddy;
swap(ddx, ddy);
x[4] = x[3] - ddx;
y[4] = y[3] + ddy;
}
}
else{
if(dy >= 0){
swap(ddx, ddy);
x[3] = x[2] - ddx;
y[3] = y[2] - ddy;
swap(ddx, ddy);
x[4] = x[3] + ddx;
y[4] = y[3] - ddy;
}
else{
swap(ddx, ddy);
x[3] = x[2] + ddx;
y[3] = y[2] - ddy;
swap(ddx, ddy);
x[4] = x[3] + ddx;
y[4] = y[3] + ddy;
}
}
cout << x[3] << " " << y[3] << " " << x[4] << " " << y[4] << endl;
}
| 0
| 43,949,748
|
#include <iostream>
int main() {
int n,b,f,r,v,a[4][3][10] = {};
scanf("%d", &n);
while (n--) {
scanf("%d%d%d%d", &b, &f, &r, &v);
a[b-1][f-1][r-1] += v;
}
for (int i=0; i<4; i++) {
for (int j=0; j<3; j++) {
for (int k=0; k<10; k++) {
printf(" %d", a[i][j][k]);
}
puts("");
}
if (i != 3) puts("####################");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
prev[i][j] = prev[k][j];
}
}
}
}
}
vector<int> get_path(const vector<vector<long long>> &prev, int s, int t) {
vector<int> path;
for (int cur = t; cur != s; cur = prev[s][cur]) {
path.push_back(cur);
}
path.push_back(s);
reverse(path.begin(), path.end());
return path;
}
bool is_negative(const vector<vector<long long>> &dist) {
int V = dist.size();
for (int i = 0; i < V; i++) {
if (dist[i][i] < 0) {
return true;
}
}
return false;
}
int main() {
int V, E;
cin >> V >> E;
vector<vector<long long>> dist(V, vector<long long>(V, INF));
vector<vector<long long>> prev(V);
for (int i = 0; i < V; ++i) {
dist[i][i] = 0;
prev[i] = vector<long long>(V, i);
}
for (int i = 0; i < E; i++) {
long long s, t, c;
cin >> s >> t >> c;
dist[s][t] = c;
}
warshall_floyd(dist, prev);
if (is_negative(dist)) {
cout << "NEGATIVE CYCLE" << endl;
} else {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][j] >= INF / 2) {
cout << "INF";
} else {
cout << dist[i][j];
}
if (j != V - 1) {
cout << " ";
}
}
cout << endl;
}
}
return 0;
}
| 0
| 10,821,786
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin(), (a).end()
#define MP make_pair
typedef pair<int, int> P;
template<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }
template<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main(){
int N, a, b, c, x;
while( cin >> N >> a >> b >> c >> x, N | a | b | c | x ){
vector<int> ran( N );
REP( i, N ) cin >> ran[i];
int ans = -1;
int reel = 0;
REP( i, 10001 ){
if( x == ran[reel] ) reel++;
if( reel == N ){
ans = i;
break;
}
x = ( a * x + b ) % c;
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <map>
#include <vector>
#include <array>
#include <string>
#include <cstdint>
using namespace std;
int main() {
int n; cin >> n;
vector<string> sv(n);
for (auto &e : sv) cin >> e;
constexpr size_t alphabet = 'z' - 'a' + 1;
auto count = [](const string &s) {
array<int, alphabet> counter = { 0 };
for (auto c : s) {
++counter[c - 'a'];
}
return counter;
};
int64_t ans = 0;
map<array<int, alphabet>, int> anagram;
for (auto &s : sv) {
++anagram[count(s)];
}
for (auto &s : sv) {
ans += --anagram[count(s)];
}
cout << ans << endl;
}
| 0
| 5,636,267
|
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int n, m, i, j, s[2003], t[2003], dp[2003][2003] = {};
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
for (j = 0; j < m; j++) {
scanf("%d", &t[j]);
}
for (i = 0; i <= n; i++) {
dp[i][0] = 1;
}
for (j = 0; j <= m; j++) {
dp[0][j] = 1;
}
for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
if (s[i - 1] != t[j - 1]) {
dp[i][j] = (dp[i][j] + mod - dp[i - 1][j - 1]) % mod;
}
}
printf("%d\n", dp[n][m]);
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
template<typename T>
vector<T> read_vec(size_t n){
vector<T> tmp(n);
for(size_t i = 0; i < n; i++){
cin >> tmp[i];
}
return tmp;
}
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
void prime_factor(int n, map<int, int>& mp){
for(int i = 2; i * i <= n; i++){
int k = 0;
while(n % i == 0) n /= i, k++;
if(k > 0) mp[i] += k;
}
if(n > 1) mp[n]++;
}
int main(){
Stream io;
int N;
io.read(N);
map<int, int> mp;
for(int i = 2; i <= N; i++){
prime_factor(i, mp);
}
vector<vector<int>> dp(mp.size() + 1, vector<int>(76, 0));
dp[0][1] = 1;
int i = 1;
for(auto& x : mp){
for(int j = 1; j <= 75; j++){
for(int k = 0; k <= x.second; k++){
if((k + 1) * j <= 75) {
dp[i][(k + 1) * j] += dp[i - 1][j];
}
}
}
i++;
}
cout << dp[mp.size()][75];
return 0;
}
| 0
| 58,685,005
|
#include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstdlib>
#define reep(n1,n2,n3) for(int n1=n3;n1<n2;n1++)
#define rep(n1,n2) reep(n1,n2,0)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define INF 1e9
using namespace std;
typedef long long int lint;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int,int> > vp;
typedef pair<int,int> pi;
typedef pair<int,pair<int,int> > pii;
typedef vector<string> vs;
const double PI = acos(-1.0);
int main(){
int s=0,t=0;
rep(i,4){
int a;
cin>>a;
s+=a;
}
rep(i,4){
int a;
cin>>a;
t+=a;
}
cout<<(s>=t?s:t)<<endl;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
string s;
int ans=0;
cin >>s;
set<char>dis;
for(char i:s){
dis.insert(i);
}
dis.insert('z' + 6);
for (char i = 'a'; i <= 'z'; i++) {
if(*dis.lower_bound(i)!=i){
cout << i << endl;
return 0;
}
}
cout << "None" << endl;
}
| 0
| 20,109,737
|
#include <iostream>
using namespace std;
string shuffle(string str, int n)
{
string leftString = str.substr(0, n);
string rightString = str.substr(n, str.size());
return rightString + leftString;
}
int main()
{
string str;
int m, n;
while (true) {
cin >> str;
if (!str.compare("-")) {
return 0;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> n;
str = shuffle(str, n);
}
cout << str << endl;
}
}
|
#include<bits/stdc++.h>
#define int long long int
#define ull unsigned long long int
#define getFaster ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define rep(i,init,n) for(int i=init;i<n;i++)
#define rev(i,n,init) for(int i=n;i>=init;i--)
#define MAXN 1200005
#define MOD 1000000007
#define f first
#define s second
#define endl '\n'
#define pii pair<int,int>
#define precise cout<<fixed<<setprecision(6)
using namespace std;
const double PI = atan(1.0)*4;
const int64_t INF=100000000000000003;
const int32_t LOG=21;
const int BIG=pow(2,20);
int32_t main(){
int n;
cin>>n;
vector<int> v;
int arr[n+1];
int cnt[n+1];
int bounds[n+1];
int pref[n+1];
fill(cnt,cnt+n+1,0);
v.clear();
rep(i,1,n+1)
{
cin>>arr[i];
cnt[arr[i]]++;
}
rep(i,1,n+1)
{
if(cnt[i]!=0)v.push_back(cnt[i]);
}
int tot=(int)(v.size());
sort(v.begin(),v.end());
rep(x,1,n+1)
{
int l=0,r=tot-1;
int ans=tot;
while(l<=r)
{
int mid=(l+r)>>1;
if(v[mid]<x)
{
l=mid+1;
}
else
{
ans=min(ans,mid);
r=mid-1;
}
}
bounds[x]=ans-1;
}
pref[0]=v[0];
rep(i,1,v.size())pref[i]=pref[i-1]+v[i];
rep(k,1,n+1)
{
int l=1,r=n/k;
int ans=0;
while(l<=r)
{
int mid=(l+r)>>1;
int cur=bounds[mid];
int val=tot-cur-1;
if(cur!=-1)val+=(pref[cur]/mid);
if(val>=k){ans=max(ans,mid);l=mid+1;}
else r=mid-1;
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 15,216,549
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
int enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
return res.size();
}
int main() {
int n; cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i+=2) {
int num = enum_divisors(i);
if (num == 8) cnt++;
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int cnt[4] = {0};
rep(i, 3){
int a, b;
cin >> a >> b;
cnt[a-1]++;
cnt[b-1]++;
}
if(cnt[0] == 1 && cnt[1] == 2 && cnt[2] == 2 && cnt[3] == 1){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
}
| 0
| 73,579,802
|
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int x,t;
cin >> x >> t;
int ans = x-t;
if(ans<0)ans=0;
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
template< template<class ...> class Ctn,class T>
std::ostream& operator<<(std::ostream& os,const Ctn<T>& v){
auto itr=v.begin();
while(itr!=v.end()){
if(itr!=v.begin())cout << " ";
cout << *(itr++);
}
return os;
}
li pow(li a,int n){
li ans=1;
while(n){
if(n%2) {
ans*=a;
if(df)print("*",a,ans);
ans%=MOD;
}
(a*=a)%=MOD;
n/=2;
}
return ans;
}
int main(){
int n,k; cin >>n >>k;
vector<li> v(k+1);
rep(i,k+1) v[i]=i;
auto f=
[&](int a){
int s=a*2;
while(s<=k){
v[s]-=v[a];
s+=a;
}
};
if(df)print(pow(10,10));
li ans=0;
repa(i,1,k+1){
(ans+=pow(k/i,n)*v[i]%MOD)%=MOD;
f(i);
}
if(df)print(v);
print(ans);
}
| 0
| 84,870,998
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> c;
int dp[50001][20];
void sortt(){
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
}
void ume(){
for(int i=0;i<20;++i){
dp[0][i]=0;
for(int j=1;j<50001;++j){
dp[j][i]=100000;
}
}
}
void toku(){
for(int i=1;i<n+1;++i){
for(int j=0;j<m;++j){
if(i-c[j]>=0){
dp[i][j]=dp[i-c[j]][j]+1;
}
if(j!=0){
dp[i][j]=min(dp[i][j],dp[i][j-1]);
}
}
}
}
int main(){
cin>>n>>m;
for(int i=0;i<m;++i){
int a;
cin>>a;
c.emplace_back(a);
}
sortt();
ume();
toku();
cout<<dp[n][m-1]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
string s, t;
cin >> s >> t;
vector<set<char>> temp1(26);
vector<set<char>> temp2(26);
rep(i, s.size()) {
temp1[s[i] - 'a'].insert(t[i]);
temp2[t[i] - 'a'].insert(s[i]);
}
rep(i, 26) {
if(temp1[i].size() > 1 || temp2[i].size() > 1) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
| 0
| 24,726,448
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
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,H,W,A,B,ans=0;
cin>>N>>H>>W;
for(int i=1;i<=N;i++){
cin>>A>>B;
if(A>=H&&B>=W)ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw";
else if (a == 1) cout << "Alice";
else if (b == 1) cout << "Bob";
else if (a > b) cout << "Alice";
else cout << "Bob";
}
| 0
| 53,554,329
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
using Graph = vector<vector<int>>;
const unsigned long long mod = 1e9 + 7;
const long long INF = 1LL<<60;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
int main(void){
ios::sync_with_stdio(0);
cin.tie(0);
ll sum=0,N,d; cin>>N;
vector<int> data(N);
FOR(i,0,N){
cin>>d;
data.at(i)=d;
}
FOR(i,0,N-1){
FOR(j,i+1,N){
sum+=data.at(i)*data.at(j);
}
}
cout<<sum<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<ll> vll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<ll, str>> vpls;
typedef vector<tuple<str, ll, ll>> vtsl;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
void Main()
{
ll a, b, c, d; cin >> a >> b >> c >> d;
ll p = abs(b - a), q = abs(c - b), r = abs(c- a);
if(p <= d&&q <= d||r <= d) fin("Yes")
else fin("No")
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0
| 2,437,538
|
#include <iostream>
using namespace std;
#define MAXN 100005
#define NIL -1
struct Node{
int p, l, r;
};
Node T[MAXN];
int n, D[MAXN];
void print(int u){
int i, c;
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].p == NIL) {
cout << "root, ";
}else if (T[u].l == NIL) {
cout << "leaf, ";
}else {
cout << "internal node, ";
}
cout << "[";
for (i = 0, c = T[u].l; c != NIL; i++, c = T[c].r) {
if (i) {
cout << ", ";
}
cout << c;
}
cout << "]" << endl;
}
void setDepth(int u, int p){
D[u] = p;
if (T[u].r != NIL) {
setDepth(T[u].r, p);
}
if (T[u].l != NIL) {
setDepth(T[u].l, p+1);
}
}
int main(int argc, char *argv[]) {
cin >> n;
for (int i = 0; i < n; i++) {
T[i].p = T[i].l = T[i].r = NIL;
}
for (int i = 0; i < n; i++) {
int v, m, l;
cin >> v >> m;
for (int j = 0; j < m; j++) {
int child;
cin >> child;
if (j == 0) {
T[v].l = child;
}else {
T[l].r = child;
}
l = child;
T[child].p = v;
}
}
int root;
for (int i = 0; i < n; i++) {
if (T[i].p == NIL) {
root = i;
}
}
setDepth(root, 0);
for (int i = 0; i < n; i++) {
print(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define sum(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define count(a, key) count(v.begin(), v.end(), 1)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
void YN(bool flg) {cout<<(flg?"YES":"NO")<<'\n';}
void Yn(bool flg) {cout<<(flg?"Yes":"No")<<'\n';}
void yn(bool flg) {cout<<(flg?"yes":"no")<<'\n';}
template <typename T>
int getIndexOfLowerBound(vector <T> &v, T x){
return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T>
int getIndexOfUpperBound(vector <T> &v, T x){
return upper_bound(v.begin(),v.end(),x)-v.begin();
}
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; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &df) {
for(int i=0;i<df.size();i++)for(int j=0;j<df[i].size();j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT<<'{';
os << pair_var.first;
DUMPOUT<<',';
os << " "<< pair_var.second;
DUMPOUT<<'}';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT<<'[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT<<']';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto& vec : df) os<<vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
string s; cin>>s;
if(s == "keyence"){ print("YES"); return 0;}
int n = s.size();
rep(i, n){
string t = s.substr(0, i);
string r = s.substr(i);
for(int j=i+1;j<n;j++){
string str = s.substr(0, i) + s.substr(j);
if(str == "keyence" || t == "keyence"|| r == "keyence") {print("YES"); return 0;}
}
}
print("NO");
}
| 0
| 52,634,317
|
#include <bits/stdc++.h>
using namespace std;
#define FileIO freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); ios_base::sync_with_stdio(0);
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define endl "\n"
#define mod 1000000007
int main()
{
IO;
set<int> out;
for(int i = -3; i <= 200; i++)
{
out.insert(i);
}
int n,x;
cin>>x>>n;
int a[n];
for(int i = 0; i < n; i++)
{
cin>>a[i];
out.erase(a[i]);
}
n = out.size();
int arr[n]={};
int j = 0;
for(int i : out)
{
arr[j++] = i;
}
int idx[3]={};
idx[0] = lower_bound(arr, arr+n, x) - arr;
idx[1] = idx[0] + 1;
idx[2] = idx[0] - 1;
int diff[3]={};
diff[0] = abs(x - arr[idx[0]]);
diff[1] = abs(x - arr[idx[1]]);
diff[2] = abs(x - arr[idx[2]]);
int ans = arr[idx[0]], d = INT_MAX;
j = 0;
for(int i : diff)
{
if(i < d)
{
d = i;
ans = arr[idx[j]];
}
if(i == d)
{
ans = min(arr[idx[j]], ans);
}
j++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll dp[100010][2];
int main()
{
string str;
cin >> str;
vector<int> l;
int len = str.length();
rep(i,(int)len)
{
l.push_back(str[i]-'0');
}
dp[0][0] = 1;
rep(i,len)
{
(dp[i+1][1] += dp[i][1]*3%MOD)%=MOD;
if (l[i]==1)
{
(dp[i+1][1] += dp[i][0]%MOD)%=MOD;
(dp[i+1][0] += dp[i][0]*2%MOD)%=MOD;
}
if (l[i]==0)
{
(dp[i+1][0] += dp[i][0]%MOD)%=MOD;
}
}
cout << (dp[len][0]+dp[len][1])%MOD<< endl;
}
| 0
| 43,656,756
|
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
ll cnt[3];
int main(){
ll k,s;
cin >> k >> s;
rep(x,k+1){
arep(x+1,y,k+1){
arep(y+1,z,k+1){
if(x+y+z==s)
cnt[0]++;
}
}
}
rep(x,k+1){
arep(x+1,z,k+1){
if(x+x+z==s)
cnt[1]++;
}
}
rep(x,k+1){
arep(x+1,y,k+1){
if(x+y+y==s)
cnt[2]++;
}
}
rep(x,k+1){
if(x+x+x==s)
cnt[3]++;
}
cout << cnt[0]*6+cnt[1]*3+cnt[2]*3+cnt[3] << endl;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void debug(int k){
cout << k << endl;
}
int A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
cin >> 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]);
}
cout << B[n-1] << endl;
return 0;
}
| 0
| 87,114,850
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int k,s,ans=0;
cin>>k>>s;
for (int i = 0; i <= k; ++i)
{
for (int j = 0; j <= k; ++j)
{
int z = s - i - j;
if(z>=0 && z<=k){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a-1; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<vector<ll>> v;
vector<ll> cost;
int main(){
ll w, h, n; cin >> w >> h >> n;
ll l=0, r=w, t=h, b=0, res=0;
rep(i, n){
ll x, y, op; cin >> x >> y >> op;
if(op==1) l = max(x, l);
else if(op==3) b = max(y, b);
else if(op==2) r = min(x, r);
else t = min(y, t);
}
if(l<r && b<t) res = (r-l)*(t-b);
cout << res << endl;
}
| 0
| 58,899,614
|
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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; }
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9+7;
const ll LINF = 1LL<<60;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
int n = s.length();
sort(s.begin(), s.end());
if (s[0] == 'a' && s[1] == 'b' && s[2] == 'c') cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int n, h, w; cin >> n >> h >> w;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i] >> b[i];
}
int ans = 0;
rep(i, n) {
if(a[i] >= h && b[i] >= w) {
++ ans;
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 19,869,578
|
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
vector<int> B(N+1) ;
int cnt = 0 ;
for(int i = 1 ; i <= N-1 ; i++){
cin >> B.at(i) ;
}
B.at(0) = 10e6 ;
B.at(N) = 10e6 ;
for(int i = 0 ; i < N ; i++){
if(B.at(i) <= B.at(i+1)){
cnt += B.at(i) ;
}
else{
cnt += B.at(i+1) ;
}
}
cout << cnt << endl ;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,i,len1,h,t,cnt=0,cnt1=0,x,m,flag=0,k,h1=0,h2=0,od=0,ev=0,y,l;
double w;
cin>>n>>l;
ll a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=1;i<n;i++)
{
if(a[i]+a[i-1]>=l)
{
len1=i;
flag=1;
}
}
if(flag==0)
{
cout<<"Impossible"<<endl;
}
else{
cout<<"Possible"<<endl;
for(i=1;i<len1;i++)
{
cout<<i<<endl;
}
for(i=n-1;i>len1;i--)
{
cout<<i<<endl;
}
cout<<len1<<endl;
}
return 0;
}
| 0
| 55,156,732
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
for (int i = 0; i < 1000; i++) {
S = S.at(S.size() - 1) + S;
S.pop_back();
if (S == T) return cout << "Yes" << "\n", 0;
}
cout << "No" << "\n";
}
|
#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(){
int N;cin>>N;
set<int>s;
int a;
bool flag=true;
rep(i,N){
cin>>a;
if(s.count(a)){
flag=false;
break;
}else{
s.insert(a);
}
}
if(flag){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}
| 0
| 60,453,591
|
#include <stdio.h>
#include <string.h>
int main() {
char a[100], b[100], c[100];
scanf("%s %s %s", a, b, c);
if(a[strlen(a) - 1] == b[0] && b[strlen(b) - 1] == c[0]) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
using namespace std;
#define NIL -1
#define MAX 100005
struct Node {
int parent;
int left;
int right;
};
struct Node T[MAX];
int Depth[MAX];
int n;
void rec(int u, int depth) {
Depth[u] = depth;
if (T[u].right != NIL) {
rec(T[u].right, depth);
}
if (T[u].left != NIL) {
rec(T[u].left, depth + 1);
}
}
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", T[u].parent);
printf("depth = %d, ", Depth[u]);
if (T[u].parent == NIL) {
printf("root, ");
}
else if (T[u].left == NIL) {
printf("leaf, ");
}
else {
printf("internal node, ");
}
printf("[");
for (i = 0, c = T[u].left; c != NIL; i++,c=T[c].right) {
if (i) {
printf(", ");
}
printf("%d", c);
}
printf("]\n");
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int id;
int degree;
int chilId;
int left;
int r;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
T[i].left = T[i].right = T[i].parent = NIL;
}
for (int i = 0; i < n; i++) {
scanf("%d", &id);
scanf("%d", °ree);
for (int j = 0; j < degree; j++) {
scanf("%d", &chilId);
if (j == 0) {
T[id].left = chilId;
}
else {
T[left].right = chilId;
}
left = chilId;
T[chilId].parent = id;
}
}
for (int i = 0; i < n; i++) {
if (T[i].parent == NIL) {
r = i;
}
}
rec(r, 0);
for (int i = 0; i < n; i++) {
print(i);
}
return 0;
}
| 0
| 46,494,880
|
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(string S, string T) {
cout << T << S << endl;
}
int main() {
string S;
cin >> S;
string T;
cin >> T;
solve(S, T);
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<ld, ld> pld;
typedef pair<string, string> pss;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all((x)))
#define X first
#define Y second
#define Mp make_pair
#define sep ' '
#define endl '\n'
#define debug(x) cerr << #x << " = " << x << endl
#define SZ(x) ll(x.size())
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);
#define set_random mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll input() {
ll n;
cin >> n;
return n;
}
ll poww(ll a, ll b, ll md) {
return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
set_random;
const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7;
ll n , k;
int main() {
fast_io;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| 0
| 52,626,149
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a,b,c,d,e,f,g,h;
cin >> a >> b >> c >> d;
e = c - (d - b);
f = d + c - a;
g = e - (f - d);
h = f + e - c;
cout << e << " " << f << " " << g << " " << h << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define all(x) (x).begin(),(x).end()
int main(){
int M, K; cin >> M >> K;
if (K == 0) {
REP(i,1<<M) {
cout << i << ' ' << i;
if (i != (1<<M)-1) cout << ' ';
}
cout << endl;
}else if (M == 1 && K == 1) {
cout << -1 << endl;
}else if (K >= 1<<M) {
cout << -1 << endl;
}else if (K == 1){
vector<int> v1;
vector<int> v2 = {3,2,1,2,3};
vector<int> v3;
REP(i,1<<M) {
if (i!=1 && i!=2 && i!=3) {
v1.push_back(i);
v3.push_back(i);
}
}
reverse(all(v1));
for (auto x:v1) cout << x << ' ';
for (auto x:v2) cout << x << ' ';
for (auto x:v3) cout << x << ' ';
cout << 1 << endl;
}else {
vector<int> v1;
vector<int> v2 = {K^1,1,K,1,K^1};
vector<int> v3;
REP(i,1<<M) {
if (i!=1 && i!=K && i!=(K^1)) {
v1.push_back(i);
v3.push_back(i);
}
}
reverse(all(v1));
for (auto x:v1) cout << x << ' ';
for (auto x:v2) cout << x << ' ';
for (auto x:v3) cout << x << ' ';
cout << K << endl;
}
}
| 0
| 48,427,162
|
#include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,6,3,7,6}, cs[200], n, m;
string a[15];
void update (string &x, string y, string z)
{
if (x.size() > y.size() + 1) return;
if (z[0] > y[0]) z += y, swap(y, z);
else y += z;
if (x.size() < y.size()) x = y;
else
{
for (int i=0; i<x.size(); i++)
{
if (x[i] > y[i]) return;
else if (x[i] < y[i])
{
x = y;
break;
}
}
}
}
signed main()
{
XinAi
for (int i=0; i<9; i++) cs[num[i]] = c[i];
cin >> n >> m;
for (int i=0; i<m; i++) cin >> a[i];
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
{
if (i!=0 && dp[i]=="") continue;
update(dp[i+cs[a[j][0]]], dp[i], a[j]);
}
cout << dp[n] << '\n';
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int f(int x, int y) {
if(x > 0 && x > y && -x <= y) return f(-x, y) + 1;
if(x >= 0 && abs(x) < abs(y)) return f(x + abs(abs(x) - abs(y)), y) + abs(abs(x) - abs(y));
if(x < 0 && x > y) return f(x - abs(abs(x) - abs(y)), y) + abs(abs(x) - abs(y)) + 2;
if(x < 0 && -x <= y) return f(-x, y) + 1;
if(abs(x) == abs(y)) return x != y;
int ret = INF;
if(x <= y) ret = y - x;
if(x < y && -x > y) {
ret = min(ret, abs(abs(x) - abs(y)) + 1);
}
return ret;
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
cout << f(x, y) << endl;
return 0;
}
| 0
| 33,594,371
|
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
cin>>n;
cout<<n*n<<endl;
return 0;
}
|
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#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>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < ll(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < ll(b); i++)
#define FORD(i, a, b) for (int i = a; i > ll(b); i--)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
const long long INF = 1e12;
const int MOD = 1e9 + 7;
#define MAXR 100000
#define Umap unordered_map
#define Uset unordered_set
#define int long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
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;
}
signed main() {
string s;
cin >> s;
int ls = s.length();
int ret = 0;
REPD(i, ls-1) {
if (i % 2 == 0) {
continue;
}
int subls = i / 2 + 1;
if (s.substr(0, subls) == s.substr(subls, subls)) {
ret = subls*2;
break;
}
}
print(ret);
}
| 0
| 61,210,154
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
ll a,b,c; cin>>a>>b>>c;
ll k; cin>>k;
ll res;
if(k%2==0) res=a-b;
else res=b-a;
if(abs(res)>1e18) cout<<"Unfair"<<endl;
else cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
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;
}
double lim[40100];
void update(int now,double t,double v){
now*=2;
t*=2;
for(int i=now;i<=now+t;i++){
chmin(lim[i],v);
}
}
int main(){
int n;cin >> n;
vector<double> t(n),v(n);
for(int i=0;i<n;i++) cin >> t[i];
for(int i=0;i<n;i++) cin >> v[i];
int tot=0;
for(int i=0;i<n;i++) tot+=t[i];
fill(lim,lim+40100,INF);
int now=0;
for(int i=0;i<n;i++){
update(now,t[i],v[i]);
now+=t[i];
}
lim[0]=0;
lim[2*tot]=0;
for(int i=0;i<=2*tot;i++) chmin(lim[i+1],lim[i]+0.5);
for(int i=2*tot;i>=0;i--) chmin(lim[i-1],lim[i]+0.5);
double ans=0.0;
for(int i=0;i<2*tot;i++){
ans+=(lim[i]+lim[i+1])/2*0.5;
}
cout << setprecision(10) << ans << endl;
return 0;
}
| 0
| 33,480,362
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
int main(){
int h,m;
cin >>h >>m;
int L[h][m]={},R[h][m]={},U[h][m]={},D[h][m]={};
char a[h][m];
rep(i,h){
rep(ii,m)cin >> a[i][ii];
}
rep(i,h){
rep(ii,m){
if(a[i][ii]=='#'){
R[i][ii]=0;
}else{
if(ii>0){R[i][ii]=R[i][ii-1]+1;}else{R[i][ii]=1;}
}
if(a[i][m-ii-1]=='#'){
L[i][m-ii-1]=0;
}else{
if(m-ii<m){L[i][m-ii-1]=L[i][m-ii]+1;}else{L[i][m-ii-1]=1;}
}
}
}
rep(ii,m){
rep(i,h){
if(a[i][ii]=='#'){
D[i][ii]=0;
}else{
if(i>0){D[i][ii]=D[i-1][ii]+1;}else{D[i][ii]=1;}
}
if(a[h-i-1][ii]=='#'){
U[h-i-1][ii]=0;
}else{
if(h-i<h){U[h-i-1][ii]=U[h-i][ii]+1;}else{U[h-i-1][ii]=1;}
}
}
}
int ans=0;
rep(i,h){
rep(ii,m){
int g=L[i][ii]+R[i][ii]+U[i][ii]+D[i][ii]-3;
chmax(ans,g);
}
}
cout << ans << endl;
}
|
#include <stdio.h>
int main (){
int n,m,a,b;
scanf("%d %d",&n,&m);
if(n==1 && m==1){
puts("0");
}else{
n--;
m--;
a=(n*(n+1))/2;
b=(m*(m+1))/2;
printf("%d\n",a+b);
}
return 0;
}
| 0
| 54,191,184
|
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a>b)
printf("a > b\n");
else if(a<b)
printf("a < b\n");
else
printf("a == b\n");
return 0;
}
|
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int f(int x){
int cnt = 0;
while (x > 0){
x /= 10;
cnt++;
}
return cnt;
}
int main(){
int n;
cin >> n;
int ans = 0;
rep(i,n+1){
int a = f(i);
if(a%2 != 0)ans++;
}
cout << ans;
}
| 0
| 72,936,128
|
#include<cstdio>
#include<cmath>
struct Point{
double x;
double y;
void print(){
std::printf("%f %f\n",x,y);
}
};
void koch(int n,Point p1,Point p2){
Point s,t,u;
if(n == 0) return;
s.x = (2 * p1.x + p2.x) / 3.0;
s.y = (2 * p1.y + p2.y) / 3.0;
t.x = (p1.x + 2 * p2.x) / 3.0;
t.y = (p1.y + 2 * p2.y) / 3.0;
u.x = (t.x - s.x) * cos(60.0 * M_PI / 180.0)
- (t.y - s.y) * sin(60.0 * M_PI / 180.0) + s.x;
u.y = (t.x - s.x) * sin(60.0 * M_PI / 180.0)
+ (t.y - s.y) * cos(60.0 * M_PI / 180.0) + s.y;
koch(n - 1,p1,s);
s.print();
koch(n - 1,s,u);
u.print();
koch(n - 1,u,t);
t.print();
koch(n - 1,t,p2);
}
int main(){
int n;
Point p1,p2;
std::scanf("%d",&n);
p1.x = 0.0;
p1.y = 0.0;
p2.x = 100.0;
p2.y = 0.0;
p1.print();
koch(n,p1,p2);
p2.print();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<ll>>;
template<typename T=ll,typename U=ll> using p = pair<T,U>;
template<typename T> T chmin(T &a,T b) {return a=min(a,b);}
template<typename T> T chmax(T &a,T b) {return a=max(a,b);}
const ll INF = (ll)1e9;
ll misum =0;
ll func(ll i,const v<> &c){
if(i<=0||misum>=0)return 0;
misum+=c[i];
return func(i-1,c)+1;
}
int main(){
ll n; cin >> n;
auto a = v<>(n,0);
auto b = v<>(n,0);
auto c = v<>(n,0);
ll sum=0;
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
rep(i,n) {
c[i] = a[i]-b[i];
sum+=c[i];
}
sort(c.begin(),c.end());
ll ans =count_if(c.begin(),c.end(),[](ll i)mutable{
if(i<0) {
misum+=i;
return true;
}
return false;
});
if(sum<0){
cout << -1 << endl;
return 0;
}
cout << ans+func(n-1,c);
return 0;
}
| 0
| 54,642,915
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int h,i;
scanf("%d",&h);
int a[h+1];
for(i=1;i<=h;i++)
scanf("%d",&a[i]);
for(i=1;i<=h;i++){
printf("node %d: key = %d, ",i,a[i]);
if(i>1) printf("parent key = %d, ",a[i/2]);
if(2*i<=h) printf("left key = %d, ",a[2*i]);
if(2*i+1<=h) printf("right key = %d, ",a[2*i+1]);
cout<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define eb emplace_back
#define endl '\n'
#define INF INT_MAX
#define nl cout << endl;
#define sz(a) (a).size()
#define len(a) (a).length()
#define all(v) v.begin(),v.end()
#define set(v) memset(v, 0, sizeof(v));
#define some(v, x) v.begin(), v.begin()+x
#define RANGET(i,a) for(ll i=0; i<a; ++i)
#define RANGE(i,a,b) for(ll i=a; i<b; ++i)
#define RANGEI(i,a,b,inc) for(ll i=a; i<b; i+=inc)
#define RANGER(i,a,b) for(ll i=a; i>=b; --i)
#define TEST_CASES(a) int t;if(a==1){t=1;}else{cin>>t;}while(t--)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define level 18
#define MAXN 1000001
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpl;
typedef vector<vpl> vvpl;
namespace io {
inline int rdi() { int v; cin >> v; return v; }
inline long long rdll() { long long v; cin >> v; return v;}
inline string rds() { string s; cin >> s; return s; }
inline char rdc() { char c; cin >> c; return c; }
template<class T>
void rdv(T beg_iter, T end_iter) {
for (; beg_iter != end_iter; ++beg_iter)cin >> *beg_iter;
}
inline void wri(const int v) { cout << v; }
inline void wrll(const long long &v) { cout << v; }
inline void wrs(const string& s) { cout << s; }
inline void wrc(const char c) { cout << c; }
template<class T>
void wrv(T beg_iter, T end_iter, string separator = " ", string end_of_line = "\n") {
for (; beg_iter != end_iter; ++beg_iter) {
cout << *beg_iter;
cout << separator;
}
cout << end_of_line;
}
}
using namespace io;
bool sortbysec(const pair<ll, ll> &a, const pair<ll, ll> &b) {return (a.second < b.second);}
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
string path = "DLRU";
vi di = {1, 0, 0, -1};
vi dj = {0, -1, 1, 0};
void solve();
int main()
{
fast_io;
TEST_CASES(1) solve();
return 0;
}
void solve()
{
int n;
cin >> n;
vvl A(n, vl(3));
RANGET(i, n)
rdv(all(A[i]));
RANGE(i, 1, n)
{
A[i][0] += max(A[i - 1][1], A[i - 1][2]);
A[i][1] += max(A[i - 1][0], A[i - 1][2]);
A[i][2] += max(A[i - 1][0], A[i - 1][1]);
}
cout << max(A[n - 1][0], max(A[n - 1][1], A[n - 1][2])) << endl;
}
| 0
| 95,786,252
|
#include <bits/stdc++.h>
#include <gmpxx.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return(0);
#define IPT(v, n) REP(i, 0, n){ cin >> v[i]; }
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "no" << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<double> vd;
typedef vector<vector<double>> vvd;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
const static ll MOD = 1e9 + 7;
const static ll INF = 1LL << 30;
ll a, b, c, d, k, l, m, n, h, w, q, x, y;
string s, t;
ll ans = 0;
ll sum = 0;
ll cnt = 0;
ll cur = 0;
ll tmp = 0;
ll mini = INF;
ll maxi = 0;
double ave = 0.0;
ll mod_pow(ll base, ll power) {
if (power == 0) return 1;
if (power == 1) return base % MOD;
if (power % 2 == 0) return ((mod_pow(base % MOD, (power / 2)) % MOD) * (mod_pow(base, (power / 2)) % MOD)) % MOD;
return (base % MOD * (mod_pow(base % MOD, power - 1) % MOD)) % MOD;
}
ll mod_fact(ll number) {
ll ret = 1;
ll count = 1;
while (count <= number) {
ret *= (count % MOD);
ret %= MOD;
count++;
}
return ret % MOD;
}
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int main() {
cin >> n;
vector<pair<string, ll>> v;
NREP() {
cin >> s >> a;
v.emplace_back(s, a);
}
cin >> t;
ans = 0;
bool flag = false;
for(auto item : v) {
if (flag) {
ans += item.second;
}
if (item.first == t) {
flag = true;
}
}
MSG(ans)
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<b;++i)
int main(){
int n,y,m,d; cin>>n;
REP(i,n){
cin>>y>>m>>d;
int ds=0;
FOR(j,y+1,1000){
if(j%3) ds+=(20+19)*5;
else ds+=20*10;
}
if(y%3){
if(m%2) ds+=21-d;
else ds+=20-d;
FOR(k,m+1,11){
if(k%2) ds+=20;
else ds+=19;
}
}else{
ds+=21-d;
ds+=20*(10-m);
}
cout<<ds<<endl;
}
return 0;
}
| 0
| 40,121,521
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = INT_MAX >> 1;
constexpr auto LINF = 5000000000000000;
constexpr auto MOD = 1000000007;
int main() {
int n;
cin >> n;
V<T> dish(n);
rep(i, n) {
int a, b;
cin >> a >> b;
dish[i] = make_tuple(a + b, a, b);
}
sort(all(dish), greater<T>());
ll taka = 0, aoki = 0;
rep(i, n) {
if (i & 1) aoki += get<2>(dish[i]);
else taka += get<1>(dish[i]);
}
cout << taka - aoki << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).begin(), (s).end()
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int k,s;
cin>>k>>s;
int ans=0;
REP(i,k+1)
{
REP(j,k+1)
{
if(0<=s-(i+j) && s-(i+j)<=k)ans++;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 7,588,837
|
#include<bits/stdc++.h>
using namespace std;
void depth(vector<vector<vector<int>>> &g,vector<int64_t> &d,vector<bool> &c,int v,int64_t vd){
d.at(v)=vd;
c.at(v)=1;
for(auto x:g.at(v)){
int va=x.at(0);
int vc=x.at(1);
if(c.at(va))
continue;
depth(g,d,c,va,vd+vc);
}
return;
}
int main(){
int n;
cin>>n;
vector<vector<vector<int>>> g(n);
for(int _=0;_<n-1;_++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
g.at(a).push_back({b,c});
g.at(b).push_back({a,c});
}
int q,k;
cin>>q>>k;
k--;
vector<int64_t> d(n);
vector<bool> c(n,0);
depth(g,d,c,k,0);
for(int _=0;_<q;_++){
int x,y;
cin>>x>>y;
x--;
y--;
cout<<d.at(x)+d.at(y)<<endl;
}
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
int A[9];
int match_map[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
bool used_match_no[10];
int dp[10][10001];
vector <int> use_matches;
int main(){
int N;
int M;
cin >> N >> M;
for(int i = 0; i < M; i++){
cin >> A[i];
}
sort(A, A + M);
for(int i = M - 1; i >= 0; i--){
if(!used_match_no[match_map[A[i]]]){
use_matches.push_back(A[i]);
used_match_no[match_map[A[i]]] = true;
}
}
reverse(use_matches.begin(), use_matches.end());
for(int i = 0; i < use_matches.size(); i++){
for(int j = 0; j <= N; j++){
dp[i][j] = -1;
}
}
for(int i = 0; i <= N; i++){
if(i % match_map[use_matches[0]] == 0){
dp[0][i] = i / match_map[use_matches[0]];
}
}
for(int i = 1; i < use_matches.size(); i++){
dp[i][0] = 0;
for(int j = 0; j <= N; j++){
int cur_match_no = match_map[use_matches[i]];
if(j < cur_match_no || dp[i][j - cur_match_no] < 0){
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - cur_match_no] + 1);
}
}
}
string ans = "";
int cur_total_match_no = N;
for(int i = use_matches.size() - 1; i >= 1; i--){
while(cur_total_match_no - match_map[use_matches[i]] >= 0
&& dp[i][cur_total_match_no - match_map[use_matches[i]]] >= 0
&& dp[i][cur_total_match_no - match_map[use_matches[i]]] + 1 >= dp[i - 1][cur_total_match_no]){
cur_total_match_no -= match_map[use_matches[i]];
ans.push_back('0' + use_matches[i]);
}
}
for(int i = 0; i < dp[0][cur_total_match_no]; i++){
ans.push_back('0' + use_matches[0]);
}
cout << ans << endl;
return 0;
}
| 0
| 69,240,213
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,d,a;
cin>>n>>d>>a;
vector<pair<ll,ll> >v;
for(int i=0;i<n;i++){
ll x,h;
cin>>x>>h;
v.pb({x,(h+a-1)/a});
}
sort(v.begin(),v.end());
queue<pair<ll,ll> > q;
ll ans = 0;
ll cur = 0;
for(int i=0;i<n;i++){
while(!q.empty()){
if(q.front().fi>v[i].fi)break;
cur-=q.front().se;
q.pop();
}
ll trt = max(0ll,v[i].se-cur);
cur+=trt;
if(trt)q.push({v[i].fi+d+d+1,trt});
ans += trt;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p(int x,int y) {
int yy=y;
long long X=x,count=1;
while(yy!=0) {
if (yy%2==1) {
count*=X;
count%=1000000007;
}
yy/=2;
X*=X;
X%=1000000007;
}
return count;
}
int main() {
int X,Y;
cin >> X >> Y;
if ((X+Y)%3!=0) cout << 0 << endl;
else {
int Z=(X+Y)/3;
if (Z>X || Z>Y) cout << 0 << endl;
else {
X-=Z,Y-=Z;
long long count=1,x=1,y=1;
for (int i=1; i<=Z; i++) {
count*=i;
count%=1000000007;
}
for (int i=1; i<=X; i++) {
x*=i;
x%=1000000007;
}
for (int i=1; i<=Y; i++) {
y*=i;
y%=1000000007;
}
y=p(y,1000000005);
x=p(x,1000000005);
count*=x;
count%=1000000007;
count*=y;
count%=1000000007;
cout << count << endl;
}
}
}
| 0
| 10,719,719
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include<cstring>
#include <stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include <string>
const int MAXN = 2000 * 100 + 6;
typedef long long LL;
int t, n, m;
using namespace std;
struct node {
int parent = -1;
int depth = 0;
vector<int>child;
}tree[MAXN];
void dfs(node &root) {
for (auto it : root.child) {
tree[it].depth = root.depth + 1;
dfs(tree[it]);
}
}
int main()
{
#ifdef _DEBUG
freopen("E:\\input.txt", "r", stdin);
#endif
int i, j;
LL ans;
scanf("%d", &n);
int root = 0;
for (int i = 0; i < n; i++) {
int id, numofchild;
scanf("%d %d", &id, &numofchild);
for (int j = 0; j < numofchild; j++) {
int child;
scanf("%d", &child);
tree[id].child.push_back(child);
tree[child].depth = tree[id].depth + 1;
tree[child].parent = id;
}
if (tree[id].depth == 0)root = id;
}
dfs(tree[root]);
for (int i = 0; i < n; i++) {
printf("node %d: parent = %d, depth = %d, ", i, tree[i].parent, tree[i].depth);
if (tree[i].depth == 0)printf("root");
else if (tree[i].child.size() == 0)printf("leaf");
else printf("internal node");
printf(", [");
int j = 0;
for (auto it : tree[i].child) {
if (j++)printf(", ");
printf("%d",it);
}
printf("]\n");
}
return 0;
}
|
#include <fstream>
#include <cstring>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <climits>
using namespace std;
const int BUFFSIZE = 1 << 17;
char buffer[BUFFSIZE];
int pointer = BUFFSIZE;
char Advance() {
if (pointer == BUFFSIZE) {
fread(buffer, 1, BUFFSIZE, stdin);
pointer = 0;
}
return buffer[pointer++];
}
int Read() {
int answer = 0;
char ch = Advance();
while (!isdigit(ch))
ch = Advance();
while (isdigit(ch)) {
answer = answer * 10 + ch - '0';
ch = Advance();
}
return answer;
}
char color[2][2] = {{'B', 'G'},
{'R', 'Y'}};
char Color(int i, int j, int d) {
return color[(i / d) % 2][(j / d) % 2];
}
int main() {
int n, m, d;
scanf("%d%d%d", &n, &m, &d);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int i0 = j + i, j0 = j - i + n;
char ch = Color(i0, j0, d);
printf("%c", ch);
if (j == m - 1)
printf("\n");
}
return 0;
}
| 0
| 69,138,690
|
#include <cstdio>
int main(){
int n;
scanf("%d", &n);
short a[n+1];
int c[10001];
for(int i = 0; i < 10001; i++){
c[i] = 0;
}
for(int i = 1; i <= n; i++){
scanf("%hd", &a[i]);
}
for(int i = 1; i <= n; i++){
c[a[i]]++;
}
for(int i = 1; i < 10001; i++){
c[i] = c[i] + c[i-1];
}
short b[n+1];
for(int i = n; i > 0; i--){
b[c[a[i]]] = a[i];
c[a[i]]--;
}
for(int i = 1; i <= n; i++){
if(i > 1){
printf(" ");
}
printf("%d", b[i]);
}
printf("\n");
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void solve() {
int X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<int>A(X), B(Y), C(Z);
REP(i, X)cin >> A[i];
REP(i, Y)cin >> B[i];
REP(i, Z)cin >> C[i];
VSORT(A); VREVERSE(A);
VSORT(B); VREVERSE(B);
VSORT(C); VREVERSE(C);
vector<int>v;
REP(i, X) {
int cb = min(Y, (3000 + i) / (i + 1));
REP(j, cb) {
int cc = min(Z, (3000 + (i + 1)*(j + 1) - 1) / ((i + 1)*(j + 1)));
REP(k, cc) {
v.push_back(A[i] + B[j] + C[k]);
}
}
}
VSORT(v); VREVERSE(v);
REP(i, K)print(v[i]);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 0
| 86,986,706
|
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define ALL(x) x.begin(), x.end()
#define INF 0x3f3f3f3f
#define debug(x) cout << "##### " << x << endl;
typedef long long ll;
const int N = 2e5 + 105;
int main(){
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = a * c;
ans = max(ans, a * d);
ans = max(ans, b * c);
ans = max(ans, b * d);
cout << ans << endl;
}
|
#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;
int a, b, m;
cin >> a >> b >> m;
int arr[a], brr[b];
for(int i = 0; i < a; ++i){
cin >> arr[i];
}
for(int i = 0; i < b; ++i){
cin >> brr[i];
}
int ans = *min_element(arr, arr + a) + *min_element(brr, brr + b);
while(m--){
int x, y, c;
cin >> x >> y >> c;
x--;
y--;
if(x <= a && y <= b){
int cal = arr[x] + brr[y] - c;
ans = min(ans, cal);
}
}
cout << ans ;
}
| 0
| 71,270,794
|
#include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
using namespace std;
int main()
{
FastRead
ll int n,m,i;
cin>>n>>m;
string a[n];
f(i=0; i<n; i++)
{
cin>>a[i];
}
sort(a,a+n);
f(i=0; i<n; i++)
{
cout<<a[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> P;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main() {
int n; cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = INF;
rep(p,101) {
int hp = 0;
rep(j,n) {
hp += (x[j]-p)*(x[j]-p);
}
chmin(ans,hp);
}
cout << ans << endl;
}
| 0
| 94,328,062
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.