code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main() {
double a, b, c, C, S, L, h;
cin >> a >> b >> C;
h = b * sin(C * M_PI / 180.0);
S = 0.5 * a * h;
c = sqrt(a * a + b * b - 2 * a * b * cos(C * M_PI / 180.0));
L = a + b + c;
cout << fixed;
cout.precision(4);
cout << S << endl;
cout << L << endl;
cout << h << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
char str[maxn];
unordered_map<int, int>mi;
int get(int x)
{
if(mi.count(x))
{
return mi[x];
}
return maxn;
}
void add(int x, int val)
{
if(!mi.count(x))
{
mi[x]=val;
}
else mi[x]=min(mi[x], val);
}
int main()
{
scanf("%s", str);
int i, j;
int dp=0, mask=0;
for(i=0; str[i]; i++)
{
add(mask, dp);
mask^=1<<(str[i]-'a');
dp=get(mask)+1;
for(j=0; j<26; j++)
{
dp=min(dp, get(mask^(1<<j))+1);
}
}
printf("%d\n", dp);
}
| 0
| 51,238,772
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+7;
int n,k;
ll sum[MAXN],sum2[MAXN],a[MAXN],ans;
int main() {
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%lld",&a[i]);
if(a[i]>0) sum[i]+=a[i];
}
for(int i=1;i<=n;i++) {
sum[i]+=sum[i-1];
sum2[i]=sum2[i-1]+a[i];
}
for(int i=k;i<=n;i++)
ans=max(ans,sum[n]-sum[i]+sum[i-k]+max(0ll,sum2[i]-sum2[i-k]));
printf("%lld",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
int n; string s;
cin >> n >> s;
char pre = '#';
int ans = 0;
for(int i = 0; i < n; ++i) {
if(s[i] != pre) {
pre = s[i];
ans++;
}
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cout.flags(ios::fixed);cout.precision(9);
run_case();
cout.flush();
return 0;
}
| 0
| 50,315,336
|
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
if(head==tail) {
int l=fread(buffer,1,Size,stdin);
tail=(head=buffer)+l;
}
if(head==tail) return -1;
return *head++;
}
inline int read() {
int x=0,f=1;char c=Getchar();
for(;!isdigit(c);c=Getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=Getchar()) x=x*10+c-'0';
return x*f;
}
typedef long long ll;
const int maxn=100010;
int n,m,pa[maxn],d[maxn],siz[maxn],cnt[maxn];
int findset(int x) {
if(x==pa[x]) return x;
int res=findset(pa[x]);
d[x]+=d[pa[x]];
return pa[x]=res;
}
int main() {
n=read();m=read();
rep(i,1,n) pa[i]=i,siz[i]=1;
rep(i,1,m) {
int x,y;
int u=findset(x=read()),v=findset(y=read());
if(u==v) {
if((d[x]%2)==(d[y]%2)) cnt[v]++;
}
else {
pa[u]=v;d[u]=d[x]+d[y]+1;
siz[v]+=siz[u];cnt[v]+=cnt[u]+1;
}
}
ll a=0,b=0,c=0;
rep(i,1,n) if(findset(i)==i) {
if(siz[i]==1) c++;
else if(cnt[i]+1==siz[i]) a++;
else b++;
}
ll ans=0;
ans+=2*a+b+2*a*(a-1)+2*b*a+b*(b-1);
int cur=n-c;
rep(i,1,c) {
ans+=1+2*cur;
cur++;
}
printf("%lld\n",ans);
return 0;
}
|
#include <stdio.h>
int main(){
int arr[3][3];
int arr1[3][3] = {};
int n;
for(int i = 0 ; i < 3 ; i++){
for(int j = 0 ; j < 3 ; j++){
scanf("%d", &arr[i][j]);
}
}
scanf("%d", &n);
int b[n];
for(int i = 0 ; i < n ; i++){
scanf("%d", &b[i]);
}
for(int i = 0 ; i < n ; i++){
if(b[i] == arr[0][0]){
arr1[0][0] += 1;
continue;
}
if(b[i] == arr[0][1]){
arr1[0][1] += 1;
continue;
}
if(b[i] == arr[0][2]){
arr1[0][2] += 1;
continue;
}
if(b[i] == arr[1][0]){
arr1[1][0] += 1;
continue;
}
if(b[i] == arr[1][1]){
arr1[1][1] += 1;
continue;
}
if(b[i] == arr[1][2]){
arr1[1][2] += 1;
continue;
}
if(b[i] == arr[2][0]){
arr1[2][0] += 1;
continue;
}
if(b[i] == arr[2][1]){
arr1[2][1] += 1;
continue;
}
if(b[i] == arr[2][2]){
arr1[2][2] += 1;
continue;
}
}
if(arr1[0][0] > 0 && arr1[0][1] > 0 && arr1[0][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][0] > 0 && arr1[1][1] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[1][0] > 0 && arr1[1][1] > 0 && arr1[1][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[2][0] > 0 && arr1[2][1] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][0] > 0 && arr1[1][0] > 0 && arr1[2][0] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][1] > 0 && arr1[1][1] > 0 && arr1[2][1] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][2] > 0 && arr1[1][2] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][2] > 0 && arr1[1][1] > 0 && arr1[2][0] > 0){
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
}
| 0
| 26,085,144
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
vector<int> t(N);
int total =0;
for(int i=0;i<N;i++){
cin >> s.at(i) >> t.at(i);
total +=t.at(i);
}
string X;
cin >> X;
int second =total;
for(int i=0;i<N;i++){
second -= t.at(i);
if(s.at(i) ==X){
break;
}
}
cout << second << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string rotation ( string S ){
int N = S.size();
char last = S[0];
for ( int i = 0; i < N-1; ++i){
S[i] = S[i+1];
}
S[N-1] = last;
return S;
}
int main() {
string S,T;
cin >> S >> T;
bool flg = false;
int N = S.size();
for ( int i = 0; i < 2*N; ++i){
S = rotation(S);
if ( S == T ) flg = true;
}
if ( flg ) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 37,913,980
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl '\n'
#define int long long int
using namespace std;
#define pii pair <int, int>
#define mii map<int, int>
#define pb push_back
#define deb(x) cout << #x << " " << x << endl
#define deb2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl
#define Loop(s, e, itr) for (int itr = s; itr < e; itr++)
#define loop(n) for(int i = 0; i < n; i++)
#define vin vector<int>
#define w(t) int tc; cin >> tc; for(int t = 1; t <= tc; t++)
#define vec vector
#define mod 1000000007
#define all(x) x.begin(), x.end()
int N, k;
int dp[105][100005] = {0};
int32_t main(){
cin >> N >> k;
int arr[105];
Loop(1, N+1, i) cin >> arr[i];
loop(103) dp[0][i] = 0;
dp[0][0] = 1;
Loop(1, N+1, i){
int sums[100005] = {0};
sums[0] = dp[i-1][0]%mod;
dp[i][0] = sums[0];
Loop(1, k+1, j){
sums[j] = (sums[j-1] + dp[i-1][j])%mod;
dp[i][j] = sums[j];
int ur = j - arr[i] - 1;
if(ur >= 0) dp[i][j] = (dp[i][j] - sums[ur] + mod)%mod;
}
}
cout << dp[N][k] << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
string A, B;
cin >> A >> B;
reverse(B.begin(),B.end());
if (A == B) {
cout << "YES"<<endl;
}
else {
cout << "NO"<<endl;
}
return 0;
}
| 0
| 88,664,357
|
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
void findzero() {
int ret = 1;
for (int i = 2; 2*i/2 == i; i *= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
break;
}
else ret *= 10;
}
cout << "! " << ret << endl;
}
int findbase() {
for (int i = 100000000; i >= 1; i /= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
return i;
}
}
}
void search(LL base) {
LL left = base + 1;
LL right = base * 10 - 1;
while (left < right) {
LL mid = (left+right) >> 1;
cout << "? " << mid*10 << endl;
string s;
cin >> s;
if (s == "Y") {
right = mid;
}
else {
left = mid + 1;
}
}
cout << "! " << left << endl;
}
int main() {
cout << "? " << 1000000000 << endl;
string s;
cin >> s;
if (s == "Y") {
findzero();
}
else {
int base = findbase();
search(base);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x=0,s2=0,k;
cin>>n>>k;
ll l1[n+1];
map<ll,ll>m;
map<ll,ll>m2;
vector<ll>v;
vector<ll>v2;
set<ll>s;
for(int i=1;i<=n;i++){
cin>>x;m2[x]++;
if(m[x]==0){
m[x]=1;
v.push_back(x);
}
s.insert(x);
}
if(k>=s.size())cout<<0<<endl;
else{
for(int i=0;i<v.size();i++){
v2.push_back(m2[v[i]]);
}
sort(v2.begin(),v2.end());
for(int i=0;i<s.size()-k;i++){
s2+=v2[i];
}
cout<<s2<<endl;
}
}
| 0
| 72,620,253
|
#include<stdio.h>
int main () {
char c1, c2, c3, c4, c5, c6;
scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);
c3 == c4 && c5 == c6 ? puts("Yes") : puts("No");
return 0;
}
|
#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;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> H(n); rep(i, n) cin >> H[i];
int ans = 0;
while(1) {
int cnt = 0;
bool flag = false;
rep(i, n) {
if(flag && H[i]<=0) {
cnt++; flag = false;
} else if(!flag && H[i]>0) {
flag = true;
}
}
if(flag) cnt++;
if(cnt) {
ans += cnt;
rep(i, n) H[i]--;
} else {
break;
}
}
cout << ans << "\n";
return 0;
}
| 0
| 93,799,888
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int64_t M = 0, M2 = 0;
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (A.at(i) == A.at(i + 1)) {
M2 = M;
M = A.at(i);
A.at(i + 1) = 1000000001;
count++;
}
if (count == 2) {
break;
}
}
cout << M2 * M << endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N,K; cin>>N>>K;
ll ans=-INF;
vector<ll> A(N);
vector<ll> B(N);
rep(i,N){
cin>>A[i];
B[i]=max(0ll,A[i]);
}
vector<ll> sA(N+1,0);
vector<ll> sB(N+1,0);
rep(i,N){
sA[i+1]=sA[i]+A[i];
}
rep(i,N){
sB[i+1]=sB[i]+B[i];
}
rep(i,N-K+1){
chmax(ans,max(0ll,sA[i+K]-sA[i])+sB[N]-sB[i+K]+sB[i]-sB[0]);
}
cout<<ans<<endl;
}
| 0
| 93,231,941
|
#include <cstdio>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <random>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <bitset>
#include <stack>
#define mod 1000000007
#define INF 9999999999
#define rep(i,n) for(int (i)=0; (i)<(n); (i)++)
#define P pair<int, int>
using namespace std;
using ll = long long;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int dx2[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy2[] = {0, -1, -1, -1, 0, 1, 1, 1};
struct edge {int from, to, cost; };
int v, e;
ll s[10000], t[10000], c[10000];
ll d[105][105];
void warshall_floyd_init(){
rep(i, v){
rep(j, v){
if(i != j){
d[i][j] = INF;
}else{
d[i][j] = 0;
}
}
}
}
void warshall_floyd(){
rep(k, v)
rep(i, v)
rep(j, v)
if(d[i][k] != INF && d[k][j] != INF)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
bool isNegativeCycle(){
rep(i, v){
if(d[i][i] < 0) return true;
}
return false;
}
void solve(){
scanf("%d%d", &v, &e);
warshall_floyd_init();
rep(i, e) scanf("%lld%lld%lld", &s[i], &t[i], &c[i]);
rep(i, e) d[s[i]][t[i]] = c[i];
warshall_floyd();
if(isNegativeCycle()){
printf("NEGATIVE CYCLE\n");
return;
}
rep(i, v){
rep(j, v){
if(d[i][j] == INF) printf("INF");
else printf("%lld", d[i][j]);
if(j != v-1) printf(" ");
}
printf("\n");
}
}
int main(){
solve();
return 0;
}
|
#include "bits/stdc++.h"
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
const LL MOD=1000000007ll;
const LL INF=2000000000ll;
long power(long a,long b){return b?power(a*a%MOD,b/2)*(b%2?a:1)%MOD:1;}
long comb(int N,int K)
{
long x=1,y=1;
for(int i=1;i<=K;i++)
{
x=x*(N-i+1)%MOD;
y=y*i%MOD;
}
return x*power(y,MOD-2)%MOD;
}
long hcomb(int N, int K){
return comb(N+K-1, N-1);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int N, K;
cin >> N >> K;
VI a(N);
REP(i,N) cin >> a[i];
LL ans = INF*INF;
REP(bit, 1<<N){
if (__builtin_popcount(bit) >= K && bit & (1<<0)){
LL M = a[0], cost = 0;
FOR(i,1,N){
if (bit & (1<<i)){
if (a[i] <= M) {
M++;
cost += M-a[i];
}
else {
M = a[i];
}
}
else {
M = max(M, (LL)a[i]);
}
}
ans = min(ans, cost);
}
}
cout << ans << endl;
}
| 0
| 36,632,713
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll ans = 0;
repr(i, n - 1) {
if ((a[i] + ans) % b[i] != 0) {
ans += b[i] - (a[i] + ans) % b[i];
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
vector<string> a, b;
int n, m;
bool checker(int r, int c) {
for(int i = 0; i < m; i++) {
for(int j = 0; j < m; j++) {
if(a[r + i][c + j] != b[i][j])
return false;
}
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
a.resize(n);
b.resize(m);
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
for(int i = 0; i <= n - m; i++) {
for(int j = 0; j <= n - m; j++) {
if(checker(i, j)) {
cout << "Yes";
return 0;
}
}
}
cout << "No";
}
| 0
| 6,159,585
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
cout << ('A' <= c && c <= 'Z' ? 'A' : 'a') << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
string s, t;
cin >> s >> t;
if(s.size()+1 == t.size())
{
string tmp = t.substr(0, s.size());
if(s == tmp)
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| 0
| 60,557,622
|
#include <iostream>
#include <vector>
#include <string>
#define ll long long
#define MOD 1000000007
using namespace std;
int main(){
int n; cin >> n;
vector<char> s(2*n);
vector<int> k(2*n);
int j = 0;
for(int i=0;i<2*n;i++){
cin >> s[i];
if((i % 2 == 1 && s[i] == 'B') || (i % 2 == 0 && s[i] == 'W')){
k[j] = i - 2*j;
j++;
}
}
if( j != n ) cout << 0;
else{
ll ans = 1;
for(int i=0;i<j;i++){
ans *= k[i];
ans %= MOD;
}
for(int i=1;i<=n;i++){
ans *= i;
ans %= MOD;
}
cout << ans % MOD;
}
return 0;
}
|
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int n,i,array1[N],counter=0;
map<int,int>visited;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d",&array1[i]);
}
i=1;
while(true){
if(i==2){
break;
}
counter++;
if(visited[i]){
counter=-1;
break;
}
visited[i]=1;
i=array1[i];
}
printf("%d",counter);
return 0;
}
| 0
| 80,727,679
|
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#define mod 1000000009
#define ll long long
using namespace std;
int main() {
int a, b, c;
vector<int>v;
cin >> a >> b >> c;
v.push_back(a);v.push_back(b);v.push_back(c);
sort(v.begin(), v.end());
cout << (v[2] * 10 + v[1] + v[0]);
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
vector<ll> ss;
ll solve(const int N, const int M) {
map<int, ll> m;
ll ans = 0;
for (int i = 0; i <= N; i++) {
int x = ss[i] % M;
ans += m[x];
m[x]++;
}
return ans;
}
int main(void) {
int N, M;
cin >> N >> M;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
ss.resize(N + 1, 0);
for (int i = 0; i < N; i++) {
ss[i + 1] = ss[i] + as[i];
}
cout << solve(N, M) << endl;
return 0;
}
| 0
| 34,987,650
|
#include<bits/stdc++.h>
using namespace std;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
long double a, b, x;
int main(){
cin >> a >> b >> x;
long double tan = (2*(a*a*b - x)) / (a*a*a);
long double thita = 0.0;
if(a*a*b/2.0 <= x){
thita = PI/2 - atan(1.0/tan);
}else{
thita = PI/2 - atan(2*x / (a*b*b));
}
thita = thita*360/(2*PI);
cout << fixed << setprecision(10) << thita << endl;
return 0;
}
|
#pragma region header
#include <bits/stdc++.h>
#define int long long
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()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
signed main() {
string s;cin >> s;
while(true) {
s.pop_back();
bool ok = false;
rep(i, (s.size()+1)/2){
if(s.size()%2==1){
ok=true;
break;
}
if(s[i]!=s[i+s.size()/2]) {
ok=true;
break;
}
}
if(ok)continue;
cout << s.size() << endl;
return 0;
}
return 0;
}
| 0
| 86,721,299
|
#include<iostream>
using namespace std;
int main(void)
{
int n,c,A=0,b,a1,b1,A1=100000;
cin>>n;
for(int i=0;i<n;i++){
b1=A1*0.05;
c=b1;
b1/=1000;
a1=b1*1000;
if(c%1000!=0)a1+=1000;
A1+=a1;
} cout<<A1<<"\n";
}
|
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repi(i, n) for(auto i = (n).begin(); i != (n).end(); ++i)
#define in_arr(type, a, n) copy_n(istream_iterator<type>(cin), n, (a).begin());
#define INF ((1 << 30) - 1)
int main(){
istream_iterator<int> itr(cin);
int n = *itr, m = *(++itr);
vector<int> a(m), b(m), c(m);
rep(i, m){
a[i] = *(++itr) - 1;
b[i] = *(++itr) - 1;
c[i] = *(++itr);
}
vector< vector<int> > p(n);
rep(i, n){
p[i] = vector<int>(n, INF);
}
rep(i, n){
p[i][i] = 0;
}
rep(i, m){
p[a[i]][b[i]] = c[i];
p[b[i]][a[i]] = c[i];
}
rep(i, n)
rep(j, n)
rep(k, n)
p[j][k] = min(p[j][k], p[j][i] + p[i][k]);
int sum = 0;
rep(i, m){
bool used = false;
rep(j, n){
if(p[j][a[i]] + c[i] == p[j][b[i]] || p[j][b[i]] + c[i] == p[j][a[i]]){
used = true;
break;
}
}
if(!used){
sum++;
}
}
cout << sum << endl;
return 0;
}
| 0
| 22,633,823
|
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
using namespace std;
int min(int a,int b){
return a<b?a:b;
}
int main(void){
int A,B;
cin >> A >> B;
int xa,xb;
xa = (A*100+8-1) / 8;
xb = (B*100+10-1) / 10;
int ans;
if(int(xa*0.10) == B && int(xb*0.08) == A){
ans = min(xa,xb);
}
else if(int(xa*0.10) == B && int(xb*0.08) != A){
ans = xa;
}
else if(int(xa*0.10) != B && int(xb*0.08) == A){
ans = xb;
}
else{
ans = -1;
}
cout << ans << endl;
}
|
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=50;
int time[maxn],minn,pos,n;
bool vis[maxn];
vector <pair<int,int> > ve[maxn];
void init() {
pos=-1;
minn=0x7f7f7f7f;
for(int i=0;i<=n;i++)
ve[i].clear();
int m=0;
for(int i=1;i<=n;i++) {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
ve[a].push_back(make_pair(b,c));
ve[b].push_back(make_pair(a,c));
m=max(m,a);
m=max(m,b);
}
n=m;
}
void spfa(int s) {
queue <int> qu;
memset(vis,0,sizeof(vis));
memset(time,0x7f,sizeof(time));
qu.push(s);
time[s] = 0;
while(!qu.empty()) {
int now=qu.front();
qu.pop();
vis[now]=false;
for(int i=0;i<ve[now].size();i++) {
int v=ve[now][i].first;
int d=ve[now][i].second;
if(d+time[now]<time[v]) {
time[v]=time[now] + d;
if(!vis[v]) {
qu.push(v);
vis[v] = true;
}
}
}
}
}
bool updatamin() {
int sum=0;
for(int i=0;i<=n;i++)
sum+=time[i];
if(sum<minn) {
minn=sum;
return true;
}
return false;
}
int main() {
while(scanf("%d",&n)) {
if(n==0) break;
init();
for(int i=0;i<=n;i++) {
spfa(i);
if(updatamin()) {
pos = i;
}
}
printf("%d %d\n",pos,minn);
}
return 0;
}
| 0
| 71,033,444
|
#include <iostream>
#include <vector>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull powmod(ull a,ull b, ull mod) {
ull res=1;
for(; b; b >>= 1){
if(b & 1){
res = res * a % mod;
}
a = a * a % mod;
}
return res;
}
bool MillerRabin(ull n, ull k){
if (n == 2){
return true;
}
if (n == 1 || (n & 1) == 0){
return false;
}
random_device rd;
mt19937 rand_src(rd());
uniform_int_distribution<ull> rand_dist(1, n - 1);
ull d = n - 1;
while ((d & 1) == 0){
d >>= 1;
}
while(k--){
ull a = rand_dist(rand_src);
ull t = d;
ull y = powmod(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1){
y = (y * y) % n;
t <<= 1;
}
if (y != n - 1 && (t & 1) == 0){
return false;
}
}
return true;
}
int main(){
ull a, b, c;
cin >> a >> b >> c;
ull count = 0;
for (ull i = a; i <= b; i ++){
if (c % i == 0) {
count ++;
}
}
cout << count <<"\n";
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9+5;
constexpr long long INFLL = 1LL<<60;
constexpr double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<bool>> con(n, vector<bool>(m, false));
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s; cin >> s; s--;
con[s][i] = true;
}
}
vector<int> p(m);
rep(i, m) cin >> p[i];
auto f = [&](const vector<int>& n_on) {
rep(i, m) {
if (p[i] != (n_on[i] % 2)) return false;
}
return true;
};
ll ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
vector<int> n_on(m, 0);
rep(i, n) {
if ((bit >> i) & 1) {
rep(j, m) {
if (con[i][j]) n_on[j]++;
}
}
}
if (f(n_on)) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 82,474,515
|
#include<iostream>
#include<math.h>
using namespace std;
int main(){
long long a,b,c,d=0,e=0;
cin>>a>>b;
a*=3;
a+=b;
a/=2;
cout<<a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
vector<string> s;
for(int i=0; i<n; i++){
string a;
cin >> a;
s.push_back(a);
if(i==0) continue;
if(s[i-1][s[i-1].length()-1]!=a[0]){
cout << "No" << endl;
return 0;
}
for(int j=0; j<i; j++){
if(a==s[j]){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 23,650,043
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long int;
const int N_MAX = 100005;
int n, m;
vector<ll> a;
template< typename T >
T extgcd(T a, T b, T &x, T &y) {
T d = a;
if(b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(){
cin >> n >> m;
int e;
bool ans = true;
for(int i = 0; i < n; i++){
ll ai;
cin >> ai;
a.push_back(ai);
int num = 0;
while(!(ai & 1)){
ai = ai >> 1;
num++;
}
if (i == 0)e = num;
else{
if (e != num)ans = false;
}
}
if (!ans){
cout << 0 << endl;
return 0;
}
ll L = a[0];
for(int i = 1; i < n; i++){
ll x, y;
if (L <= 2 * m){
ll gcd = extgcd(L, a[i], x, y);
L = L * a[i] / gcd;
}
}
ll ansn = 0;
ll now = L / 2;
while(now <= m){
ansn++;
now += L;
}
cout << ansn << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int k;
int dist[100010];
queue<int> dial[2];
void update(int cvor, int vrednost, int ind)
{
cvor=cvor%k;
if(vrednost<dist[cvor])
dist[cvor]=vrednost, dial[ind%2].push(cvor);
}
int dijkstra()
{
int i=1;
while(true)
{
while(dial[i%2].empty())
i++;
int tek=dial[i%2].front();
dial[i%2].pop();
if(tek==0)
return dist[tek];
update(tek+1, dist[tek]+1, i+1);
update(tek*10, dist[tek], i);
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>k;
for(int i=0;i<k;i++)
dist[i]=1e7;
dist[1]=1;
dial[1].push(1);
cout<<dijkstra();
return 0;
}
| 0
| 46,742,461
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
char s[H][W];
rep(i, H){
rep(j, W){
if((i < B && j < A) || (i >= B && j >= A)) s[i][j] = '1';
else s[i][j] = '0';
}
}
rep(i, H){
rep(j, W) cout << s[i][j]; cout << endl;
}
}
|
#include<bits/stdc++.h>
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int main()
{
fast;
int k;
cin>>k;
string s;
cin>>s;
int m=s.length();
if(k==m||k>m)
{
cout<<s<<endl;
return 0;
}
else{
for(int i=0;i<k;i++)
{
cout<<s[i];
}
cout<<"..."<<endl;
}
}
| 0
| 12,291,136
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (min(a, b) + min(c, d)) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<ll> enum_divisors(ll n){
vector<ll> res;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
res.push_back(i);
if(i!=n/i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
int main(){
ll n;
cin>>n;
auto ed=enum_divisors(n);
ll ans=0;
for(auto e : ed){
ll m=e-1;
if(m<=0) continue;
if(n/m==n%m) ans+=m;
}
cout<<ans<<endl;
}
| 0
| 96,999,947
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int C[510], S[510], F[510];
for (int i = 0; i < N-1; i++){
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N-1; j++) {
if (sum < S[j]) {
sum = S[j];
}else if(sum % F[j] == 0){
}else{
sum = sum + F[j] - sum % F[j];
}
sum += C[j];
}
cout << sum << endl;
}
}
|
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=100005;
int N;
vector<int> adj[MAXN];
int col[MAXN];
bool dfs(int u,int f)
{
if(adj[u].size()==1U)
{
col[u]=0;
return false;
}
int cnt[2]={0};
for(int i=0;i<(int)adj[u].size();i++)
{
int v=adj[u][i];
if(v==f)
continue;
if(dfs(v,u))
return true;
cnt[col[v]]++;
}
if(cnt[0]>=2)
return true;
if(f==0&&(int)adj[u].size()==cnt[1])
return true;
if(cnt[0])
col[u]=1;
else
col[u]=0;
return false;
}
int main()
{
scanf("%d",&N);
for(int i=1;i<N;i++)
{
int u,v;
scanf("%d%d",&u,&v);
adj[u].push_back(v);
adj[v].push_back(u);
}
if(N==2)
puts("Second");
else
{
bool ans;
for(int i=1;i<=N;i++)
if(adj[i].size()>1U)
{
ans=dfs(i,0);
break;
}
puts(ans?"First":"Second");
}
return 0;
}
| 0
| 3,204,924
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
int main() {
int n;
int a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[100000];
fill_n(dp, 100000, LLONG_MAX / 2);
dp[0] = a[0];
int len = 1;
for (int i = 1; i < n; i++)
if (dp[len-1] < a[i])
dp[len++] = a[i];
else {
int j = len-1;
for (; j >= 0; j--)
if (dp[j] < a[i])
break;
dp[j+1] = a[i];
}
cout << len << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
while (A.size() <= 100)
A.insert(0, "0");
while (B.size() <= 100)
B.insert(0, "0");
if (B < A)
cout << "GREATER" << endl;
else if (A == B)
cout << "EQUAL" << endl;
else
cout << "LESS" << endl;
return 0;
}
| 0
| 83,809,644
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
int n = s.size();
cout << ((15 - n) + count(s.begin(), s.end(),'o') >= 8 ? "YES" : "NO" ) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0,mod=1000000007;
bool b=true;
cin >> n;
vector<long> t(n),a(n),max(n);
vector<bool> ika(n,true);
for(long i=0;i<n;i++) cin >> t[i];
for(long i=0;i<n;i++) cin >> a[i];
max[0]=t[0];
ika[0]=false;
for(long i=1;i<n;i++) {
max[i]=t[i];
if(t[i-1]!=t[i]) ika[i]=false;
}
if(ika[n-1]) {
if(max[n-1]<a[n-1]) b=false;
else {
max[n-1]=a[n-1];
ika[n-1]=false;
}
} else {
if(max[n-1]!=a[n-1]) b=false;
}
for(long i=n-2;i>=0;i--) {
if(a[i]!=a[i+1]) {
if(ika[i]) {
if(max[i]<a[i]) b=false;
else {
max[i]=a[i];
ika[i]=false;
}
} else {
if(max[i]!=a[i]) b=false;
}
} else {
if(ika[i]) max[i]=min(max[i],a[i]);
else if(a[i]<max[i]) b=false;
}
}
if(b) {
ans=1;
for(long i=0;i<n;i++) {
if(ika[i]) ans=ans*max[i]%mod;
}
}
cout << ans << endl;
}
| 0
| 38,979,250
|
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{
private:
int s[6];
int top;
int bottom;
int r_side;
int l_side;
int face;
int rev;
public:
dice(){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = 1;
s[1] = 2;
s[2] = 3;
s[3] = 4;
s[4] = 5;
s[5] = 6;
}
dice(int a[5]){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
REP(i, 6) s[i] = a[i];
}
dice(int x, int y, int z, int u, int v, int w){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = x;
s[1] = y;
s[2] = z;
s[3] = u;
s[4] = v;
s[5] = w;
}
int get_top() {
return s[top];
}
int get_bottom(){
return s[bottom];
}
int get_r_side(){
return s[r_side];
}
int get_l_side(){
return s[l_side];
}
int get_face(){
return s[face];
}
int get_rev(){
return s[rev];
}
int set_top(int i) {
top = i;
bottom = 5 - top;
r_side = (i+1)%5;
l_side = 5 - r_side;
face = (i+2)%5;
rev = 5 - face;
return s[top];
}
int rotate_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = face;
face = r_side;
r_side = rev;
rev = l_side;
l_side = temp;
}
return s[top];
}
int roll_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = l_side;
l_side = bottom;
bottom = r_side;
r_side = temp;
}
return s[top];
}
int roll_f(int i){
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = face;
face = bottom;
bottom = rev;
rev = temp;
}
return s[top];
}
};
int search(dice d) {
int f, t;
cin >> t >> f;
while(d.get_top() != t || d.get_face() != f){
if(d.get_top() == t)
while(d.get_face() != f)
d.rotate_r(1);
else if(d.get_face() == f)
while(d.get_top() != t)
d.roll_r(1);
else {
REP(i, 4){
d.roll_f(1);
if(d.get_face() == f || d.get_top() == t)
break;
}
}
}
return d.get_r_side();
}
int main() {
ostringstream os;
int in[6];
int q;
REP(i, 6) cin >> in[i];
dice d = dice(in);
cin >> q;
REP(i, q)
os << search(d) << endl;
cout << os.str();
return 0;
}
|
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define boolsize 1000001
#define pi pair<ll,ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template<typename T>
void showvector(vector <T> v)
{
for(T x:v)
cout<<x<<" ";
cout<<endl;
}
template<typename T>
void showvector1(vector <T> v)
{
ll n=v.size();
fo1(i,n-1)
cout<<v[i]<<endl;
}
template<typename T>
void showset(set <T> s)
{
for(T x: s)
cout<<x<<" ";
cout<<endl;
}
template<class T>
void showvectorpair(vector<T> v)
{
for(auto it=v.begin();it!=v.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T,typename P>
void showmap(map <T,P> m)
{
for(auto it=m.begin();it!=m.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T>
bool comp(T a,T b)
{
return (a>b);
}
template<class T>
bool comppair(T a,T b)
{
if(a.first==b.first)
return(a.second>b.second);
return (a.first>b.first);
}
bool sameparity(ll a,ll b)
{
return (a%2==b%2);
}
bool difparity(ll a,ll b)
{
return !(a%2==b%2);
}
bool isprime(ll x)
{ if(x<=1)
return false;
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return false;
}
return true;
}
bool iseven(ll x)
{
return !(x%2);
}
bool isodd(ll x)
{
return (x%2);
}
void vfun()
{
ll n,k;
cin>>n;
vector <ll> v(n);
fo(i,n)
cin>>v[i];
}
ll noofdigits(ll n)
{
ll cnt=0;
while(n!=0)
{
n/=10;
cnt++;
}
return cnt;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll test=1;
while(test--)
{
ll n;cin>>n;
vector <string> v(n);
map <char,ll> fv;
fo(i,n)
{
cin>>v[i];
map<char,ll> m;
{
fo(j,v[i].size())
m[v[i][j]]++;
}
if(fv.empty()){
for(auto it=m.begin();it!=m.end();it++)
fv[it->first]=(it->second);}
else{
for(char ch='a';ch<='z';ch++)
fv[ch]=min(m[ch],fv[ch]);
}
}
for(char ch='a';ch<='z';ch++)
cout<< string(fv[ch],ch);
}
}
| 0
| 69,401,855
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
#define MAX_N 1000001
bool divisible[MAX_N];
bool visited[MAX_N];
void init(){
rep(i,MAX_N){
divisible[i] = false;
visited[i] = false;
}
}
int A[MAX_N];
int main(){
init();
int n;
cin>>n;
rep(i,n){
cin>>A[i];
}
sort(A,A+n);
for(int i = 0; i < n; i++){
if( divisible[A[i]] == false && visited[A[i]] == true){
divisible[A[i]] = true;
}else if( divisible[A[i]] == false && visited[A[i]] == false){
visited[A[i]] = true;
for(int j = 2; A[i]*j <= MAX_N; j++){
divisible[A[i]*j] = true;
}
}
}
int ans = 0;
rep(i,n){
if( divisible[A[i]] == false) ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long ll;
typedef pair<ll,ll> P;
int n;
bool use[1010101] = {0};
int main(){
cin >> n;
int cnt = 0, i;
for(i = 1; cnt < n; i++){
cnt += i;
}
if(cnt == n){
for(int j = 1; j < i; j++){
cout << j << endl;
}
return 0;
}
for(int j = 1; j < i; j++){
if(j == cnt - n) continue;
cout << j << endl;
}
return 0;
}
| 0
| 8,069,176
|
#include "bits/stdc++.h"
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if (A>B) {
cout << ">"<<endl;
}
else if (A<B) {
cout << "<"<<endl;
}
else {
cout << "="<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, int> pli;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
constexpr lint mod = 1e9+7;
constexpr lint INF = mod*mod;
constexpr int MAX = 100010;
int main(){
int n;
while(scanf("%d", &n) && n){
string s;
int l=0, r=0, t=0, ans=0;
rep(i, n){
cin>>s;
if(s[0]=='l') l^=1;
else r^=1;
if(!t && l && r) ++ans, t^=1;
else if(t && !l && !r) ++ans, t^=1;
}
printf("%d\n", ans);
}
}
| 0
| 76,639,343
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
struct Monster {
ll x, h;
};
std::istream &operator>>(std::istream &in, Monster &o) {
cin >> o.x >> o.h;
return in;
}
int main() {
int n;
ll d, a;
cin >> n >> d >> a;
vector<Monster> monsters(n);
rep(i, n) cin >> monsters[i];
sort(monsters.begin(), monsters.end(), [](Monster &m1, Monster &m2) {
return m1.x < m2.x;
});
vector<ll> positions(n);
rep(i, n) positions[i] = monsters[i].x;
vector<ll> damages(n);
ll ans = 0;
rep(i, n) {
if (i != 0) damages[i] += damages[i - 1];
ll h = monsters[i].h;
ll da = damages[i] * a;
h -= da;
if (h <= 0) continue;
ll c = (h + a - 1) / a;
ans += c;
damages[i] += c;
ll r = monsters[i].x + (d * 2);
auto it = upper_bound(positions.begin(), positions.end(), r);
if (it == positions.end()) continue;
int ri = distance(positions.begin(), it);
damages[ri] -= c;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(a, b) for (int i = 0; i < (b); ++i)
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
void solve(void)
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<bool> f(n, true);
const int INF = 1e9;
int res = INF;
while (n > 1)
{
auto mn = min_element(a.begin(), a.end());
vector<int> tmp;
tmp.push_back(*mn);
int dis = distance(a.begin(), mn);
rep(i, n)
{
if (dis == i)
continue;
if (a[i] % *mn != 0)
tmp.push_back(a[i] % *mn);
else
--n;
}
a = tmp;
res = min(res, *mn);
}
cout << res << endl;
}
int main(void)
{
solve();
}
| 0
| 10,478,714
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod=1e9+7;
int main(){
ll n,m,k;
cin >> n >> m >> k;
rep(i,k){
if(i%2==0){
if(n%2){
n--;
}
n/=2;
m+=n;
} else {
if(m%2){
m--;
}
m/=2;
n+=m;
}
}
cout << n << " " << m << endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<typename T> bool chmin(T &a,T b){
if(a>b){
a=b;
return true;
}
return false;
}
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD=1000000007;
const int INTMAX=1001001000;
const ll LLMAX=1010010010010010000;
ll modadd(ll a,ll b,ll mod=MOD){
return (a%mod+b%mod)%mod;
}
ll modsub(ll a,ll b,ll mod=MOD){
a%=mod;
b%=mod;
if(a>=b) return a-b;
else return mod-b+a;
}
ll modmul(ll a,ll b,ll mod=MOD){
return ((a%mod)*(b%mod))%mod;
}
ll modpow(ll a, ll n,ll mod=MOD) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll moddiv(ll a,ll b,ll mod=MOD) {
return modmul(a, modpow(b, mod-2));
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string L;
cin>>L;
ll N=L.size();
vvll dp(N,vll(2));
for(int i=0;i<N;i++){
int X=L[i]-'0';
if(i==0){
dp[i][0]=1;
dp[i][1]=2;
}else{
if(X==1){
dp[i][0]=modadd(modmul(dp[i-1][0],3),dp[i-1][1]);
dp[i][1]=modmul(dp[i-1][1],2);
}else{
dp[i][0]=modmul(dp[i-1][0],3);
dp[i][1]=dp[i-1][1];
}
}
}
cout<<modadd(dp[N-1][0],dp[N-1][1])<<endl;
return 0;
}
| 0
| 443,612
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c,a,b) *min_element(c+a,c+b)
#define maxi(c,a,b) *max_element(c+a,c+b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int,int>
#define upp(a,n,x) upper_bound(a,a+n,x)-a;
#define low(a,n,x) lower_bound(a,a+n,x)-a;
#define UF UnionFind
int keta(int x){
rep(0,i,30){
if(x<10){
return i+1;
}
x=x/10;
}
}
int gcd(int x,int y){
if(x==0||y==0)return x+y;
int aa=x,bb=y;
rep(0,i,1000){
aa=aa%bb;
if(aa==0){
return bb;
}
bb=bb%aa;
if(bb==0){
return aa;
}
}
}
int lcm(int x,int y){
int aa=x,bb=y;
rep(0,i,1000){
aa=aa%bb;
if(aa==0){
return x/bb*y;
}
bb=bb%aa;
if(bb==0){
return x/aa*y;
}
}
}
bool p(int x){
if(x==1)return false;
rep(2,i,sqrt(x)+1){
if(x%i==0&&x!=i){
return false;
}
}
return true;
}
int max(int a,int b){
if(a>=b)return a;
else return b;
}
string maxst(string s,string t){
int n=s.size();
int m=t.size();
if(n>m)return s;
else if(n<m)return t;
else{
rep(0,i,n){
if(s[i]>t[i])return s;
if(s[i]<t[i])return t;
}
return s;
}
}
int min(int a,int b){
if(a>=b)return b;
else return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n,int y){
int ni=1;
for(int i=0;i<41;i++){
n2[i]=ni;
ni*=2;
}
int bunsi=1,bunbo=1;
rep(0,i,y)bunsi=(bunsi*(n-i))%mod;
rep(0,i,y)bunbo=(bunbo*(i+1))%mod;
mody[0]=bunbo;
rep(1,i,41){
bunbo=(bunbo*bunbo)%mod;
mody[i]=bunbo;
}
rep(0,i,41)nis[i]=0;
nn=mod-2;
for(int i=40;i>=0;i-=1){
if(nn>n2[i]){
nis[i]++;
nn-=n2[i];
}
}
nis[0]++;
rep(0,i,41){
if(nis[i]==1){
bunsi=(bunsi*mody[i])%mod;
}
}
return bunsi;
}
int gyakugen(int n,int y){
int ni=1;
for(int i=0;i<41;i++){
n2[i]=ni;
ni*=2;
}
mody[0]=y;
rep(1,i,41){
y=(y*y)%mod;
mody[i]=y;
}
rep(0,i,41)nis[i]=0;
nn=mod-2;
for(int i=40;i>=0;i-=1){
if(nn>n2[i]){
nis[i]++;
nn-=n2[i];
}
}
nis[0]++;
rep(0,i,41){
if(nis[i]==1){
n=(n*mody[i])%mod;
}
}
return n;
}
int yakuwa(int n){
int sum=0;
rep(1,i,sqrt(n+1)){
if(n%i==0)sum+=i+n/i;
if(i*i==n)sum-=i;
}
return sum;
}
bool integer(double n){
if(n==long(n))return true;
else return false;
}
int poow(int y,int n){
if(n==0)return 1;
n-=1;
int ni=1;
for(int i=0;i<41;i++){
n2[i]=ni;
ni*=2;
}
int yy=y;
mody[0]=yy;
rep(1,i,41){
yy=(yy*yy)%mod;
mody[i]=yy;
}
rep(0,i,41)nis[i]=0;
nn=n;
for(int i=40;i>=0;i-=1){
if(nn>=n2[i]){
nis[i]++;
nn-=n2[i];
}
}
rep(0,i,41){
if(nis[i]==1){
y=(y*mody[i])%mod;
}
}
return y;
}
int minpow(int x,int y){
int sum=1;
rep(0,i,y)sum*=x;
return sum;
}
int ketawa(int x,int sinsuu){
int sum=0;
rep(0,i,100)sum+=(x%poow(sinsuu,i+1))/(poow(sinsuu,i));
return sum;
}
int sankaku(int a){
return a*(a+1)/2;
}
int sames(int a[1111111],int n){
int ans=0;
rep(0,i,n){
if(a[i]==a[i+1]){
int j=i;
while(a[j+1]==a[i]&&j<=n-2)j++;
ans+=sankaku(j-i);
i=j;
}
}
return ans;
}
bool search(int x){
int n;
int a[n];
int l=0,r=n;
while(r-l>=1){
int i=(l+r)/2;
if(a[i]==x)return true;
else if(a[i]<x)l=i+1;
else r=i;
}
return false;
}
int XOR(int a,int b){
int ni=1;
rep(0,i,41){
n2[i]=ni;
ni*=2;
}
rep(0,i,41)nis[i]=0;
for(int i=40;i>=0;i-=1){
if(a>=n2[i]){
nis[i]++;
a-=n2[i];
}
if(b>=n2[i]){
nis[i]++;
b-=n2[i];
}
}
int sum=0;
rep(0,i,41)sum+=(nis[i]%2*n2[i]);
return sum;
}
struct UnionFind {
vector<int> par;
vector<int> siz;
UnionFind(int N) :par(N),siz(N){
for(int i = 0; i < N; i++){
par[i] = i;
siz[i]=1;
}
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
if(siz[rx]>siz[ry]){
siz[rx]+=siz[ry];
par[y]=x;
}
else{
siz[ry]+=siz[rx];
par[x]=y;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x){
return siz[root(x)];
}
};
int d[11];
signed main(){
ic(n)
ic(a) ic(b) ic(c)
int ma[1024577][21];
for(int bit=0;bit<(1<<2*n);bit++)rep(0,i,2*n)if(bit&(1<<i))ma[bit][i]=1;
rep(0,i,n)cin>>d[i];
int ans=inf;
rep(0,i,minpow(4,n)){
int A=0,B=0,C=0;
int sum=0;
rep(0,j,n){
if(ma[i][j*2]==0&&ma[i][j*2+1]==1){
if(A>0)sum+=10;
A+=d[j];
}
else if(ma[i][j*2]==1&&ma[i][j*2+1]==0){
if(B>0)sum+=10;
B+=d[j];
}
else if(ma[i][j*2]==1&&ma[i][j*2+1]==1){
if(C>0)sum+=10;
C+=d[j];
}
}
if(A>0&&B>0&&C>0){
sum+=abs(A-a)+abs(B-b)+abs(C-c);
ans=min(sum,ans);
}
}
c(ans)
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
const int mod = 1e9 + 7;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << to_string(H) << " " ;
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define RESET(a, b) memset(a, b, sizeof(a))
#define EB emplace_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define size(v) (int)v.size()
#define endl "\n"
#define UMO unordered_map
#define USO unordered_set
#define setBits(n) __builtin_popcountll(n)
#define MX *max_element
#define MN *min_element
#define TC int t; cin >> t; while (t--)
void Panda() {
int a, b;
cin >> a >> b;
cout << (a * b) / __gcd(a, b) << endl;
}
int32_t main() {
FAST;
Panda();
return 0;
}
| 0
| 12,936,272
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
char C; cin>>C;
C++;
cout<<C<<endl;
}
|
#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 n;
cin>>n;
rep(i,n,1000){
string x=to_string(i);
if(x[0]==x[1] && x[1]==x[2]){
cout<<x<<endl;
return;
}
}
}
int main(){
optimizeIO();
{ solve();
}
}
| 0
| 25,665,306
|
#include<stdio.h>
#include<string.h>
int main(){
char m[1000],b[2],g[1000][1000],c[2]="-";
int n,a,i,j,d,f=0;
while(1){
scanf("%s",m);
if(strcmp(m,c)==0){
break;
}
int e=strlen(m);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
for(j=0;j<a;j++){
b[0]=m[0];
d=1;
while(d!=e){
m[d-1]=m[d];
d++;
}
m[e-1]=b[0];
}
}
strcpy(g[f],m);
f++;
}
for(i=0;i<f;i++){
printf("%s\n",g[i]);
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n;cin>>n;
string s;cin>>s;
ll ans=0;
rep(i,1000){
ll a=i/100,b=(i-a*100)/10,c=i%10;
bool flag1=false,flag2=false,flag3=false;
rep(j,n){
if(flag2 && c==s[j]-'0') flag3=true;
if(flag1 && b==s[j]-'0') flag2=true;
if(a==s[j]-'0') flag1=true;
}
if(flag3) ans++;
}
cout<<ans<<endl;
}
| 0
| 86,647,807
|
#include <bits/stdc++.h>
using namespace std;
long long f(long long a, long long b){
if(b == 0) return -a;
if(a >= b) return f(b, a%b) + 2*b*(a/b);
return f(b, a%b);
}
int main(){
long long n, x;
scanf("%lld%lld", &n, &x);
printf("%lld\n", n + f(n-x, x));
}
|
#include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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; }
typedef long long ll;
using namespace std;
int main(void){
int h,w;cin>>h>>w;
char c[h][w];
rep(i,h)rep(j,w)cin>>c[i][j];
vector<vector<ll>> vu(h,vector<ll>(w,0)),vd(h,vector<ll>(w,0)),vr(h,vector<ll>(w,0)),vl(h,vector<ll>(w,0));
rep(i,h){
rep(j,w){
if(c[i][j]=='.'){
vu[i][j]++;
vd[i][j]++;
vr[i][j]++;
vl[i][j]++;
}
}
}
rep(i,h){
rep(j,w-1){
if(c[i][j+1]=='.')vl[i][j+1]+=vl[i][j];
}
for(int j=w-1;j>0;j--){
if(c[i][j-1]=='.')vr[i][j-1]+=vr[i][j];
}
}
rep(j,w){
rep(i,h-1){
if(c[i+1][j]=='.')vd[i+1][j]+=vd[i][j];
}
for(int i=h-1;i>0;i--){
if(c[i-1][j]=='.')vu[i-1][j]+=vu[i][j];
}
}
ll res=0;
rep(i,h){
rep(j,w){
ll buf=vu[i][j]+vd[i][j]+vr[i][j]+vl[i][j];
if(c[i][j]=='.')buf-=3;
chmax(res,buf);
}
}
cout<<res<<endl;
}
| 0
| 1,367,652
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int sum(int n)
{
if(n==0) return 0;
return n%10+ sum((n/10));
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
vector<int> v(n);
f(n)cin>>v[i];
int operation=1;
int i=k;
while(i<n)
{
i+=k-1;
operation++;
}
cout<<operation<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K;
cin >> N >> K;
vec<ll> A(N),B(N);
for(int i=0;i<N;i++) cin >> A[i] >> B[i];
ll ans = 0;
vec<int> use(N,1);
int h = 0;
for(int i=0;i<30;i++) if(K>>i&1) h = i;
for(int i=0;i<N;i++){
int a = 0;
for(int j=0;j<30;j++) if(A[i]>>j&1) a = j;
if(a>h) use[i] = 0;
}
for(int k=h;k>=0;k--){
ll now = 0;
if(K>>k&1){
for(int i=0;i<N;i++) if(use[i]){
if(!(A[i]>>k&1)) now += B[i];
}
}
if(!(K>>k&1)){
for(int i=0;i<N;i++){
if(A[i]>>k&1) use[i] = 0;
}
}
ans = max(ans,now);
}
ll s = 0;
for(int i=0;i<N;i++) if(use[i]) s += B[i];
ans = max(ans,s);
cout << ans << "\n";
}
| 0
| 58,073,921
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int q;
scanf("%d",&q);
while(q--)
{
long long a,b;
scanf("%lld %lld",&a,&b);
long long lo =0, hi = 2e9;
long long c = 0;
while(lo <= hi)
{
long long mid = (lo + hi) >> 1;
if(mid * mid < a*b)
{
c = mid;
lo = mid+1;
}
else
{
hi = mid-1;
}
}
long long ans = 2*c;
if(a <= c)
ans--;
if(b <= c)
ans--;
if(c*(c+1) >= a*b)
ans--;
printf("%lld\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main(){
int n;
cin >> n;
long a[n+1],b[n],ans=0.0;
rep(i,0,n)cin >> a[i];
rep(i,0,n-1)cin >> b[i];
rep(i,0,n-1){
if(b[i]==0)continue;
if(b[i] <= a[i]){
ans += b[i];
continue;
}
if(b[i] <= a[i] + a[i+1]){
ans += b[i];
b[i] -= a[i];
a[i+1] -= b[i];
continue;
}
ans += a[i]+a[i+1];
a[i+1]=0;
}
cout << ans << endl;
return 0;
}
| 0
| 52,326,958
|
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int x_pos[16010][16010] = {0};
int y_pos[16010][16010] = {0};
int x_dir[8000] = {};
int y_dir[8000] = {};
int main()
{
string s;
int x, y;
cin >> s;
scanf("%d %d", &x, &y);
int direction = 0;
int x_res;
int y_res;
int x_idx = 0;
int y_idx = 0;
int val = 0;
int count = 0;
int x_sum = 0;
int y_sum = 0;
int first_count = 0;
for(int i=0; i<s.size(); i++){
if(s[i] == 'F'){
first_count ++;
}
else{
break;
}
}
for(int i=first_count; i<=s.size(); i++){
if(s[i] == 'F'){
if(val == 0){
direction = direction ^ (count % 2);
count = 0;
}
val++;
}
else{
if(val != 0){
if(direction == 0){
x_dir[x_idx] = val;
x_sum -= val;
x_idx++;
}
else{
y_dir[y_idx] = val;
y_sum -= val;
y_idx++;
}
val = 0;
}
count++;
}
}
x_res = x - x_sum - first_count;
y_res = y - y_sum;
if(x_res < 0 || y_res < 0){
printf("No\n");
}
else{
x_pos[0][0] = 1;
y_pos[0][0] = 1;
for(int i=0; i<x_idx; ++i){
for(int j=0; j<=x_res; ++j){
x_pos[i+1][j] |= x_pos[i][j];
if(j>=x_dir[i]*2){
x_pos[i+1][j] |= x_pos[i][j - x_dir[i]*2];
}
}
}
for(int i=0; i<y_idx; ++i){
for(int j=0; j<=y_res; ++j){
y_pos[i+1][j] |= y_pos[i][j];
if(j>=y_dir[i]*2){
y_pos[i+1][j] |= y_pos[i][j - y_dir[i]*2];
}
}
}
if(x_pos[x_idx][x_res] == 1 && y_pos[y_idx][y_res] == 1){
printf("Yes\n");
}
else{
printf("No\n");
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
long long int A;
long long int B;
long long int C;
long long int K;
long long int sum = 0;
cin>>A;
cin>>B;
cin>>C;
cin>>K;
if(K != 0){
if(min(A,K) == A){
sum += (A * 1);
}else{
sum += (K * 1);
}
K = K - (min(A,K));
}
if(K != 0){
if(min(B,K) == B){
sum += (B * 0);
}else{
sum += (K * 0);
}
K = K - (min(B,K));
}
if(K != 0){
if(min(C,K) == C){
sum += (C * -1);
}else{
sum += (K * -1);
}
K = K - (min(C,K));
}
cout<<sum<<'\n';
}
| 0
| 95,381,466
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define INF 1000000007
int main(){
string S;
cin>>S;
map<char,bool> m;
rep(i,S.size()){
if(m[S[i]]){
cout<<"no"<<endl;
return 0;
}else{
m[S[i]]=true;
}
}
cout<<"yes"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
int nmax=200000;
vvec g(nmax);
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n;
cin>>n;
vec a(n);
vec b(n);
int sum=0;
int mem=0;
rep(i,n){
cin>>a[i]>>b[i];
sum+=a[i];
if(a[i]==b[i]) mem++;
}
if(mem==n) cout<<0<<endl;
else{
int m=INF;
rep(i,n){
if(a[i]>b[i]){
chmin(m,b[i]);
}
}
cout<<sum-m<<endl;
}
}
| 0
| 24,971,645
|
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
int main()
{
int n;
string s;
int k;
cin >> n >> s >> k;
k--;
for (int i = 0; i < n; ++i)
cout << (s[i] == s[k] ? s[i] : '*');
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
ll mod=1e9+7;
int main()
{
ll n,k;
cin>>n>>k;
vector<ll> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
ll ans=0;
for(int i=0;i<n;i++)
{
int ct1=0;
int ct2=0;
for(int j=0;j<i;j++)
{
if(a[j]<a[i])
ct1++;
}
for(int j=i+1;j<n;j++)
{
if(a[j]<a[i])
ct2++;
}
ll p=((k*(k-1))/2)%mod;
ll q=((k*(k+1))/2)%mod;
ans=(ans+ct1*p)%mod;
ans=(ans+(ct2*q))%mod;
}
cout<<ans<<endl;
}
| 0
| 55,402,329
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main(){
int n, k; cin >> n >> k;
int c = (n-1)*(n-2)/2-k;
if(c < 0) cout << -1 << endl;
else{
cout << c+(n-1) << endl;
rep(i,n-1) cout << i << " " << n << endl; if(!c) return 0;
for(int i=1; i<=n-1; i++) for(int j=i+1; j<=n-1; j++){
cout << i << " " << j << endl;
c--; if(!c) return 0;
}
}
}
|
#include <math.h>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
int main()
{
vector<int> d(7);
int q;
for(int i=1;i<7;i++){cin >> d[i];}
cin >> q;
for(int i=0;i<q;i++)
{
int t,f,o,ans;
o=0;
cin >> t >> f;
for(int j=1;j<7;j++){if(t==d[j])t=j;if(f==d[j])f=j;}
if(f>t){o=t;t=f;f=o;o=1;}
if(t==2)ans=4;
else if(t==3){if(f==1)ans=2;else ans=6;}
else if(t==4){if(f==1)ans=5;else ans=1;}
else if(t==5){if(f==1)ans=3;else if(f==3)ans=6;else ans=1;}
else {if(f==2)ans=4;else if(f==3)ans=2;else if(f==4)ans=5;else ans=3;}
if(o!=0)ans=7-ans;
cout << d[ans] << endl;
}
}
| 0
| 46,049,356
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mp make_pair
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MOD = 998244353;
ll mult(ll x, ll y) {
return (x * y) % MOD;
}
const int N = 100100;
int a[N];
int main()
{
int n;
scanf("%d", &n);
int x;
scanf("%d", &x);
if (x != 0) {
printf("0\n");
return 0;
}
a[0] = 1;
for (int i = 1; i < n; i++) {
scanf("%d", &x);
a[x]++;
}
if (a[0] != 1) {
printf("0\n");
return 0;
}
while(a[n] == 0) n--;
ll ans = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < a[i + 1]; j++)
ans = mult(ans, a[i]);
printf("%lld\n", ans);
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
ll a[100005];
ll maxsum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] > 0) maxsum += a[i];
}
ll psum = 0;
ll nsum = 0;
for(int i = 0; i < k; i++){
if(a[i] > 0) psum += a[i];
else nsum -= a[i];
}
ll ans = 0;
for(int i = k; i <= n; i++){
ans = max(ans, maxsum - min(psum, nsum));
if(a[i] > 0) psum += a[i];
else nsum -= a[i];
if(a[i - k] > 0) psum -= a[i - k];
else nsum += a[i - k];
}
cout << ans << endl;
}
| 0
| 93,848,780
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
inline int read(){
int f=1,ans=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
return f*ans;
}
const int MAXN=101;
int n,a[MAXN],maxn,num[MAXN];
void wrong(){printf("Impossible\n");exit(0);}
int main(){
n=read();
for(int i=1;i<=n;i++) a[i]=read(),num[a[i]]++,maxn=max(maxn,a[i]);
int minn=(maxn+1)/2+1;
if(maxn%2==1) if(num[minn-1]!=2) wrong();
if(maxn%2==0&&num[minn-1]!=1) wrong();
for(int i=1;i<minn-1;i++) if(num[i]) wrong();
for(int i=minn;i<=maxn;i++) if(num[i]<2) wrong();
printf("Possible\n");
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d; cin >> a >> b >> c >> d;
if(a+b > c+d) cout << "Left" << endk;
else if(a+b == c+d) cout << "Balanced" << endk;
else cout << "Right" << endk;
return 0;
}
| 0
| 96,691,287
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
if(k<=a) cout<<k;
else if(a<k&&k<=a+b) cout<<a;
else if(a+b<k) cout<<a-(k-(a+b));
}
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(xi, x) for (auto&& xi : x)
template <class T> using vec = vector<T>;
using ll = long long;
using vi = vec<int>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<int, int>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase( unique(all(v)), v.end() )
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
template<class T> pair<T, size_t> max(vector<T> &x){ auto it = max_element(all(x)); return mp(*it, it-x.begin()); }
template<class T> pair<T, size_t> min(vector<T> &x){ auto it = min_element(all(x)); return mp(*it, it-x.begin()); }
template<class T> inline bool chmax(T &maxval, const T &newval) { if (maxval<newval) { maxval=newval; return 1; } return 0; }
template<class T> inline bool chmin(T &minval, const T &newval) { if (minval>newval) { minval=newval; return 1; } return 0; }
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
#define inside(H,W,y,x) 0<=(x) && (x)<(W) && 0<=(y) && (y)<(H)
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
#ifdef LOCAL
#include "dump.hpp"
#define debug(x) cerr << #x << ": " << x << '\n'
#else
#define dump(...)
#define debug(x)
#endif
int main(){
cin.tie(0); ios::sync_with_stdio(false);
int n; cin >> n;
vector<ll> h(n);
rep(i,n) cin >> h[i];
int ret = 0; int m = 0;
rep(i,1,n){
if(h[i-1]>=h[i]) ret++;
else ret = 0;
m = max(m,ret);
}
cout << m << endl;
return 0;
}
| 0
| 98,085,810
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int a,b;
cin >> a >> b;
switch(a*b){
case 2:
cout << "3" << endl;
break;
case 3:
cout << "2" << endl;
break;
case 6:
cout << "1" << endl;
break;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
bool is_integer( float x ){
return floor(x)==x;
}
int main() {
int a,b;
int flag = false;
vector<int> vc;
cin >> a >> b;
for(int i = a; i < 10000; i ++){
if((int)(i*0.08) == a) vc.push_back(i);
}
for(int i = 0; i < vc.size(); i ++){
if((int)(vc[i]*0.1) == b){
cout << vc[i];
flag = true;
break;
}
}
if(!flag) cout << -1;
return 0;
}
| 0
| 47,486,236
|
#include <iostream>
#include <algorithm>
using namespace std;
int po10[]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};
int n,s;
int dp[20][110];
int main(){
dp[0][0]=dp[1][0]=1;
for(int i=1;i<=9;i++){
for(int j=9;j>=1;j--){
for(int k=100;k>=i;k--){
dp[j][k]+=dp[j-1][k-i];
}
}
}
while(true){
int res=0;
cin>>n>>s;
if(n==0&&s==0) break;
cout<<dp[n][s]<<endl;
}
return 0;
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cctype>
#define rep(i,a) for(i=0;i<a;i++)
#define kk 26
using namespace std;
typedef pair<char,int> P;
int main(void)
{
FILE *fp;
int i,j,k;
P data[27];
char cc[27]={"abcdefghijklmnopqrstuvwxyz"};
char mozi;
string ss;
rep(i,kk){data[i].first=cc[i];data[i].second=0;}
while(scanf("%c",&mozi)!=EOF) {
rep(j,kk) {
if(data[j].first==mozi ||
data[j].first==tolower(mozi)) {
data[j].second++;
break;
}
}
}
rep(i,kk) cout<<data[i].first<<" : "<<data[i].second<<endl;
return 0;
}
| 0
| 77,333,023
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
int dp[40010][202];
int main(){
int n;
cin>>n;
int 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 lmt[40010]={},crt=0;
for(int i=0;i<n;i++){
for(int j=0;j<2*t[i];j++){
lmt[++crt]=2*v[i];
}
}
for(int i=0;i<40010;i++){
for(int j=0;j<202;j++){
dp[i][j]=-INF;
}
}
dp[0][0]=0;
for(int i=1;i<40010;i++){
for(int j=0;j<=lmt[i];j++){
if(j>0)dp[i][j]=max(dp[i][j],dp[i-1][j-1]+2*j+1);
if(j<lmt[i])dp[i][j]=max(dp[i][j],dp[i-1][j+1]+2*j-1);
dp[i][j]=max(dp[i][j],dp[i-1][j]+2*j);
}
}
cout<<fixed<<setprecision(5)<<dp[40009][0]/8.0<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,x,light;
void FindLight(ll Long,ll Short)
{
if(Long%Short==0)
{
light+=((Long<<1)-Short);
return;
}
light+=(Long/Short*Short*2);
FindLight(Short,Long%Short);
}
int main()
{
cin>>n>>x;
light=n;
if(x>=n-x) FindLight(x,n-x);
else FindLight(n-x,x);
cout<<light<<"\n";
}
| 0
| 96,727,034
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define mem(a,b) memset(a, b, sizeof a)
#define vii vector<pair<int,int>>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr <<#x<<" = "<<x<<"\n"
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for (int i = a; i<b; ++i)
#define len(s) s.length()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}
void angshuGod()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5+1;
const double pi = acos(-1);
void solve(){
int n,m;
cin>>n>>m;
vii v(n);
fo(i,n){
cin>>v[i].ff>>v[i].ss;
}
sort(all(v));
int cost = 0;
for(int i = 0;i<n;i++){
if(m==0) break;
else if(m>v[i].ss){
cost += v[i].ff*v[i].ss;
m -= v[i].ss;
}
else{
cost += v[i].ff*m;
m = 0;
}
}
cout<<cost;
}
int32_t main()
{
angshuGod();
int t;
t = 1;
while(t--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(){
long long a,b,k;
cin >> k >> a >> b;
long long res;
if(k<a)res = k+1;
else{
if(a+2>=b)res=k+1;
else{
k-=(a-1);
res = (k/2)*b-(k/2-1)*a+k%2;
}
}
cout << res << endl;
}
void solve2(){
int n;
cin >> n;
vector<long long>a(n);
vector<long long>b(n);
vector<long long>to_change(0);
vector<long long>to_lower(0);
long long k=0;
long long min_c = 0;
for(int i=0;i<n;i++){
cin >> a[i];
k += a[i];
}
for(int i=0;i<n;i++){
cin >> b[i];
if(b[i]>a[i]){
to_change.push_back(i);
min_c += b[i];
}else{
min_c += a[i];
to_lower.push_back(a[i]-b[i]);
}
}
sort(to_lower.begin(),to_lower.end(),greater<int>());
if(min_c <= k)cout << to_change.size() << endl;
else{
int cnt = 0;
bool done = false;
for(int i=0;i<to_lower.size();i++){
min_c-=to_lower[i];
cnt++;
if(min_c <= k){
done = true;
break;
}
}
if(done)cout << to_change.size()+cnt << endl;
else cout << -1 << endl;
}
}
int main(){
solve2();
return 0;
}
| 0
| 50,832,582
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
int n;
cin >> n;
vector<int> t(n), x(n), y(n);
rep(i,n) cin >> t[i] >> x[i] >> y[i];
int preX = 0, preY = 0, preT= 0;
rep(i,n){
int diffX, diffY, diffT;
diffX = abs(x[i] - preX);
diffY = abs(y[i] - preY);
diffT = abs(t[i] - preT);
if (diffT < (diffX + diffY)){
cout << "No" << endl;
return 0;
}
if (((diffX + diffY) % 2) != (diffT % 2)){
cout << "No" << endl;
return 0;
}
preX = x[i];
preY = y[i];
preT = t[i];
}
cout << "Yes" << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
string S;
cin >> S;
int N = S.size();
vector<string> v = {"dream", "dreamer", "erase", "eraser"};
reverse(S.begin(), S.end());
for(auto &e: v) {
reverse(e.begin(), e.end());
}
int now = 0;
while(now < N) {
bool flag = false;
for(auto e: v) {
if(S.substr(now, e.size()) == e) {
now += e.size();
flag = true;
}
}
if(flag) continue;
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
}
| 0
| 77,447,291
|
#include <iostream>
using namespace std;
int main()
{
int a, b, c, d1, d2, d3, i, N = 0;
cin >> N;
for ( i = 0; i < N; i++ ) {
cin >> a >> b >> c;
d1 = a * a;
d2 = b * b;
d3 = c * c;
if ( d1 == ( b * b ) + ( c * c ) ) {
cout << "YES" << endl;
} else if ( d2 == ( a * a ) + ( c * c ) ) {
cout << "YES" << endl;
} else if ( d3 == ( a * a ) + ( b * b ) ) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll factorial(ll n) {
if (n == 1) {
return 1;
}
ll ans = factorial(n-1);
return ans*n;
}
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;
}
bool is_prime(ll n) {
for (ll i = 2; i*i <= n; i++) {
if (n%i == 0) return false;
}
return n != 1;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0) return 1;
ll res = mod_pow(x*x%mod, n/2, mod);
if (n & 1) res = res * x % mod;
return res;
}
int main() {
ll n;
cin >> n;
if (n < 1200) cout << "ABC" << endl;
else cout << "ARC" << endl;
}
| 0
| 31,337,816
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
int count=0;
for(int i=x;i<=y;i++){
int a=i/10000,b=i%10;
int c=i/1000%10,d=i%100/10;
if(a==b && c==d)count++;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
int m, p;
ll ans = 0;
m = 1e6;
rep(i, n) {
cin >> p;
if (m >= p) {
ans++;
}
m = min(m, p);
}
cout << ans << endl;
return 0;
}
| 0
| 11,216,459
|
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
typedef long long ll;
using namespace std;
int main()
{
double x1, y1, x2, y2, x3, y3, xp, yp;
double s, t;
while (scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp) != EOF)
{
s = ((xp - x1) * (y3 - y1) - (yp - y1) * (x3 - x1)) /
((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1));
t = ((xp - x1) * (y2 - y1) - (yp - y1) * (x2 - x1)) /
((x3 - x1) * (y2 - y1) - (x2 - x1) * (y3 - y1));
if (s > 0 && t > 0 && s + t < 1)
{
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end(); it++)
#define TRvii(c, it) \
for (vii::iterator it = (c).begin(); it != (c).end(); it++)
#define TRmsi(c, it) \
for (msi::iterator it = (c).begin(); it != (c).end(); it++)
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define in(x,n) for(int e=0;e<n;e++){ll y;cin>>y;x.pb(y);}
#define print(x) for(auto it:x) cout<<it<<' '; cout<<endl;
#define printii(x) for(auto it:x) cout<<it.F<<' '<<it.S<<'\t'; cout<<endl;
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll,ll>
#define pll pair<ll,ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii,ll>>
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define uset unordered_set
#define umap unordered_map
using namespace std;
ll gcd(ll a, ll b){ll temp;while (b > 0){temp = a%b;a = b;b = temp;} return a;}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
clock_t time_p=clock();
void TimeTaken()
{
time_p=clock()-time_p;
cerr<<"Completion time : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
void solve() {
}
int n,k,b,a[200001],s;
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>b,a[b]++;
sort(a,a+n);
for(int i=n-1;i>=n-k;i--)
s+=a[i];
cout<<n-s<<endl;
return 0;
}
| 0
| 74,243,749
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define dbv(v) cout<<endl;cout<<#v<<"-->> ";for(auto it:v){cout<<it<<" ";}cout<<endl;
#define dbm(m)cout<<endl;cout<<#m<<"-->> ";for(auto it:m){cout<<it.fi<<" "<<it.se<<endl;}
#define dbs(s)cout<<endl;cout<<#s<<"-->> ";for(auto it:s){cout<<it<<" ";}cout<<endl;
#define mod 1000000007
#define db1(x) cout<<#x<<"="<<x<<endl;
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl;
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl;
#define mx 1e18
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define double long double
#define io std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
int32_t main()
{
io
float d,t,s;
cin>>d>>t>>s;
if(d/s<=t)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int N, M; cin >> N >> M;
vector<vector<LLONG>> xyzs(3, vector<LLONG>(N));
for (int i = 0; i < N; ++i)
{
cin >> xyzs[0][i] >> xyzs[1][i] >> xyzs[2][i];
}
LLONG ans = 10e-13;
for (int bit = 0; bit < (1 << 3); ++bit)
{
vector<LLONG> sums(N);
for (int i = 0; i < N; ++i)
{
for (int xyz = 0; xyz < 3; ++xyz)
{
if (bit & (1 << xyz))
{
sums[i] += xyzs[xyz][i];
}
else
{
sums[i] -= xyzs[xyz][i];
}
}
}
sort(sums.rbegin(), sums.rend());
ans = max(ans, accumulate(sums.begin(), sums.begin() + M, 0LL));
}
cout << ans << endl;
}
| 0
| 38,118,384
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<vector<char>> mat(n);
for (int i = 0; i < n; i++)
{
mat[i] = vector<char>(n);
for (int j = 0; j < n; j++)
cin >> mat[i][j];
}
int ans = 0;
for (int i = 0; i < n; i++)
{
bool valid = true;
for (int r = 0; r < n; r++)
{
for (int c = 0; c < n; c++)
{
int rr = r;
int cc = (c - i + n) % n;
if (mat[r][c] != mat[cc][(rr + i) % n])
valid = false;
}
}
if (valid)
ans += n;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main (){
int h,w;
cin >> h >> w;
vector<string> grid(h);
vector<vector<int>> dp(h, vector<int>(w,0));
dp[0][0]=1;
for(int i=0; i<h; ++i) cin >> grid[i];
for(int i=0; i<h; ++i){
for(int j=0; j<w; ++j){
if(grid[i][j]=='.'){
if(i+1<h) dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
if(j+1<w) dp[i][j+1]=(dp[i][j+1]+dp[i][j])%mod;
}
}
}
cout << dp[h-1][w-1]%mod;
return 0;
}
| 0
| 55,865,894
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[101][101];
ll n,m;
ll g[101][101];
int main()
{
for(ll i=0;i<101;i++)
for(ll j=0;j<101;j++)
if(i!=j)
dp[i][j]=1e15;
cin>>n>>m;
for(ll i=0;i<m;i++)
{
ll x,y,w;
cin>>x>>y>>w;
g[x][y]=w;
dp[x][y]=w;
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
bool nc=0;
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(dp[i][k]+dp[k][j]<dp[i][j])
{
nc=1;
break;
}
if(nc)
cout<<"NEGATIVE CYCLE\n";
else
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
if(dp[i][j]>=1e13)
cout<<"INF";
else
cout<<dp[i][j];
if(j==n-1)
cout<<endl;
else
cout<<" ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vector<int> vi;
#define m1 make_pair
#define in insert
#define pb push_back
#define int long long int
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
inline ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m)
{
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p * p) % m;
if (n % 2)
return (p * a) % m;
else
return p;
}
const ll MOD = 998244353;
#define int long long int
int32_t main()
{
IOS;
string s;
cin >> s;
int n = s.size();
int y = 0;
for (int i = 0; i < n; i++)
if (s[i] == 'o')
y++;
n = 15 - n;
if (n + y >= 8)
{
cout << "YES";
}
else
{
cout << "NO";
}
}
| 0
| 28,340,612
|
#include <iostream>
using namespace std ;
int main()
{
int ary[101] ;
int get ;
int tmp = 0 ;
for( int i = 1 ; i < 101 ; i ++ )
{
ary[i] = 0 ;
}
while( cin >> get )
{
ary[get] ++ ;
if( ary[get] > tmp )
{
tmp = ary[get] ;
}
}
for( int i = 1 ; i < 101 ; i ++ )
{
if( ary[i] == tmp )
{
cout << i << endl ;
}
}
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long a, b;
char s;
cin >> a >> s >> b;
cout << (s == '+' ? a + b : a - b) << endl;
return 0;
}
| 0
| 12,355,062
|
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f;
const ll mod = 998244353LL;
clock_t TIME_START, TIME_END;
void program_end()
{
#ifdef ONLINE
printf("\nTime used: %.6lf(s)\n", ((double)TIME_END - TIME_START) / CLOCKS_PER_SEC);
system("pause");
#endif
}
int n;
ll a[55];
void solve()
{
cin >> n;
for (int i = 1; i <= n;++i)
cin >> a[i];
ll ans = 0;
for (int i = 1; i <= n;++i)
for (int j = i + 1; j <= n;++j)
{
ans += a[i] * a[j];
}
cout << ans << endl;
}
int main()
{
TIME_START = clock();
int Test = 1;
while (Test--)
solve();
TIME_END = clock();
program_end();
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#define MAXV 10001
#define MAXE 100001
using namespace std;
int main() {
int i, j, v, e, s, t, isVisited[MAXV] = {};
vector<int*> ntopa[MAXV];
vector<int*>::iterator itv;
cin >> v >> e;
for (i = 0; i < e; i++) {
cin >> s >> t;
ntopa[t].push_back(&isVisited[s]);
}
i = -1;
while (1) {
++i %= v;
if (isVisited[i])continue;
for (itv = ntopa[i].begin(); itv != ntopa[i].end(); itv++) {
if (*(*itv) == 0)break;
}
if (itv == ntopa[i].end()) {
isVisited[i] = 1;
cout << i << endl;
i = 0;
for (j = 0; j < v; j++) {
if (isVisited[j] == 0)break;
}
if (j == v) return 0;
}
}
return 0;
}
| 0
| 82,103,103
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a,b,c,h,i,j,k,l,m,n,x,y;
ll ans = 0;
string s;
cin >> a >> b;
ans = (a*3 + b ) / 2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int getFirst10(int n){
int numb = 0;
while(numb < n){
numb += 10;
}
return numb;
}
int main(){
Hello
int a[5], ans = 1e9;
for(int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
do{
int lst = 0;
for(int i = 0; i < 5; i++){
if(i == 4) lst = lst + a[i];
else lst = getFirst10(lst + a[i]);
}
ans = min(ans, lst);
}
while(next_permutation(a, a + 5));
cout << ans;
return 0;
}
| 0
| 77,843,392
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <math.h>
#include <assert.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1000000007;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
inline double nCr(const int n, int r)
{
if (n == 0)
{
return 0;
}
if (r == 0)
{
return 1;
}
if (r == 1)
{
return n;
}
if (n == r)
{
return 1;
}
if (r > n / 2)
{
r = n / 2;
}
double result = 1;
for (double i = 1; i <= r; i++)
{
result *= (n - i + 1) / i;
}
return (result);
}
template <typename T>
T seinomi(T a)
{
if (a > 0)
{
return a;
}
else
{
return 0;
}
}
template <typename T>
map<T, T> soinsuubunkai(T n)
{
map<T, T> ret;
for (T i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <typename T>
T ketasuu(T num)
{
return std::to_string(num).length();
}
template <typename T>
T kaizyou(T k)
{
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value)
{
while (first != last)
{
*first++ = value;
++value;
}
}
int factorial(int n)
{
int answer = 1;
while (n > 1)
{
answer *= n;
n--;
}
return answer;
}
int comb(int n, int r)
{
return factorial(n) / (factorial(r) * factorial(n - r));
}
template <typename T>
T amarinasi(T a,T b){
if(a%b==0)
{
return a/b;
}
else if(a%b>0)
{
return a/b+1;
}
else
{
return a/b-1;
}
}
ll modpow(ll a, ll b, ll mod = 1000000007) {
ll res = 1;
for (a %= mod; b; a = a * a % mod, b >>= 1)
if (b & 1) res = res * a % mod;
return res;
}
ll llpow(ll a, ll n){
ll x = 1;
while(n > 0){
if(n&1){
x = x*a;
}
a = a*a;
n >>= 1;
}
return x;
}
int main(){
ll n,k;
cin>>n>>k;
ll a=0,b=0;
for(ll i=1;i<=n;i++){
if(i%k==0){
a++;
}
if(i%k==k/2){
b++;
}
}
if(k%2==0){
cout<<llpow(a,3)+llpow(b,3)<<endl;
}
else{
cout<<llpow(a,3)<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
struct segtree{
ll size;
vl sums;
void init(ll n){
size=n+1;
sums.resize(2*size,0);
}
void allot(ll n){
size=1;
while(size<=n)size*=2;
sums.resize(2*size,0);
}
void build(vl& a,ll x,ll lx,ll rx){
if((rx-lx)==1)
{
if( lx<sz(a))
sums[x]=a[lx];
return;
}
ll m=(lx+rx)/2;
build(a,2*x+1,lx,m);
build(a,2*x+2,m,rx);
sums[x]=sums[2*x+2]+sums[2*x+1];
}
void build(vl& a){
build(a,0,0,size);
}
void add(ll i,ll v,ll x,ll lx,ll rx){
if(rx-lx==1){
sums[x]+=v;
return;
}
ll m=(lx+rx)/2;
if(i<m)add(i,v,2*x+1,lx,m);
else add(i,v,2*x+2,m,rx);
sums[x]=sums[2*x+1]+sums[2*x+2];
}
void add(ll i, ll v){
add(i,v,0,0,size);
}
void set(ll i,ll v,ll x,ll lx,ll rx){
if(rx-lx==1){
sums[x]=v;
return;
}
ll m=(lx+rx)/2;
if(i<m)set(i,v,2*x+1,lx,m);
else set(i,v,2*x+2,m,rx);
sums[x]=sums[2*x+1]+sums[2*x+2];
}
void set(ll i, ll v){
set(i,v,0,0,size);
}
ll calc(ll l,ll r,ll x,ll lx,ll rx){
ll tot=0;
if(lx>=r||rx<=l)return 0;
else if(lx>=l&&rx<=r)return sums[x];
ll m=(lx+rx)/2;
return calc(l,r,2*x+1,lx,m)+calc(l,r,2*x+2,m,rx);
}
ll calc(ll l,ll r){
return calc(l,r,0,0,size);
}
ll find(ll k,ll x,ll lx,ll rx){
if(rx-lx==1)return lx;
ll m=(lx+rx)/2;
if(sums[2*x+1]>=k){
return find(k,2*x+1,lx,m);
}
else {
return find(k-sums[2*x+1],2*x+2,m,rx);
}
}
ll find(ll k){
return find(k,0,0,size);
}
};
char a[2005][2005];
int main()
{
IOS;
ll h,w;
cin>>h>>w;
vvl c1(h,vl(w));
FOR(i,h){
ll cnt=0;
FOR(j,w){
cin>>a[i][j];
if(a[i][j]=='.'){
c1[i][j]=cnt;
cnt++;
}
else {
cnt=0;
}
}
}
FOR(i,h){
ll cnt=0;
for(int j=w-1;j>=0;j--){
if(a[i][j]=='.'){
c1[i][j]+=cnt;
cnt++;
}
else {
cnt=0;
}
}
}
FOR(i,w){
ll cnt=0;
FOR(j,h){
if(a[j][i]=='.'){
c1[j][i]+=cnt;
cnt++;
}
else {
cnt=0;
}
}
}
FOR(i,w){
ll cnt=0;
for(int j=h-1;j>=0;j--){
if(a[j][i]=='.'){
c1[j][i]+=cnt;
cnt++;
}
else {
cnt=0;
}
}
}
ll ans=0;
FOR(i,h){
FOR(j,w){
ll x=c1[i][j];
if(a[i][j]=='.')x++;
else x=0;
ans=max(ans,x);
}
}
cout<<ans;
return 0;
}
| 0
| 61,020,549
|
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int MAXN = 2345;
const int MOD = (int)1e9 + 7;
int A[MAXN], B[MAXN];
int dp[MAXN][MAXN][3];
int main() {
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
for (int i = 1; i <= M; i++) scanf("%d", &B[i]);
for (int i = 0; i <= N; i++) dp[i][0][0] = 1;
for (int j = 0; j <= M; j++) dp[0][j][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
dp[i][j][1] = dp[i][j - 1][1];
dp[i][j][2] = dp[i - 1][j][2];
dp[i][j][0] = (dp[i - 1][j - 1][0] + dp[i][j][1]) % MOD;
dp[i][j][0] = (dp[i][j][0] + dp[i][j][2]) % MOD;
if (A[i] == B[j]) {
dp[i][j][1] = (dp[i][j][1] + dp[i - 1][j - 1][0]) % MOD;
dp[i][j][2] = (dp[i][j][2] + dp[i - 1][j - 1][0]) % MOD;
dp[i][j][0] = (dp[i][j][0] + dp[i - 1][j - 1][0]) % MOD;
}
}
}
printf("%d\n", dp[N][M][0]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K, a;
cin >> N >> K;
vector<int> d(K);
vector<vector<int>> A(K);
for (int i=0; i<K; i++) {
cin >> d[i];
for (int j=0; j<d[i]; j++) {
cin >> a;
A[i].push_back(a-1);
}
}
vector<int> vec(N,0);
for (int i=0; i<K; i++) {
for (int j=0; j<d[i]; j++) {
vec[A[i][j]]++;
}
}
int ans = 0;
for (int i=0; i<N; i++) {
if (vec[i]==0) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 672,412
|
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll mod = 1000000007;
ll N,K;
cin >> N >> K;
ll A[N];
rep(i,N) cin >> A[i];
ll S = 0;
rep(i,N){
for(ll j=i+1;j<N;j++){
if(A[i]>A[j]) S++;
}
}
ll out = (S*K)%mod;
ll T = 0;
rep(i,N){
rep(j,N){
if(A[i]>A[j]) T++;
}
}
out = (out+((K*(K-1))/2)%mod*T)%mod;
cout << out << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <list>
#include <vector>
#include <stack>
#define N 100001
#define WHITE 0
#define GRAY 1
using namespace std;
int color[N];
vector<int> G[N];
list<int> L;
stack<int> S;
void dfs (int u, int V) {
color[u] = GRAY;
S.push(u);
while (S.size()) {
bool flag = false;
for (int i = 0; i < G[S.top()].size(); i++) {
int v = G[S.top()][i];
if (color[v] == WHITE) {
S.push(v);
color[v] = GRAY;
flag = true;
break;
}
}
if (!flag) {
L.push_front(S.top());
S.pop();
}
}
}
void dfs_init (int V) {
for (int i = 0; i < V; i++) {
if (color[i] == WHITE) {
dfs(i, V);
}
}
}
int main () {
int V, E, u, v;
cin >> V >> E;
for (int i = 0; i < E; i++) {
cin >> u >> v;
G[u].push_back(v);
}
dfs_init(V);
for (list<int>::iterator it = L.begin(); it != L.end(); it++)
cout << *it << endl;
return 0;
}
| 0
| 33,332,483
|
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
ll an = 0;
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) {
cin >> a.at(i);
}
rep(i, N - 1) {
if (a.at(i) == a.at(i + 1)) {
a.at(i + 1) = -1;
an++;
}
}
cout << an << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const double PI = 4*atan(1);
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
int x;
void solve() {
cin >> x;
if (x < 600) {
cout << "8\n";
} else if (x < 800) {
cout << "7\n";
} else if (x < 1000) {
cout << "6\n";
} else if (x < 1200) {
cout << "5\n";
} else if (x < 1400) {
cout << "4\n";
} else if (x < 1600) {
cout << "3\n";
} else if (x < 1800) {
cout << "2\n";
} else {
cout << "1\n";
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| 0
| 77,849,254
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
int a[n];
rep(i,n) cin>>a[i];
int mn=10e9+1;
int mx=0;
rep(i,n){
mn=min(mn,a[i]);
mx=max(mx,a[i]);
}
cout << mx-mn << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int64_t func(int64_t n,int64_t x){
if(n==0){return 1;}
int64_t b=pow((int64_t)2,n+1)-3;
int64_t p=pow((int64_t)2,n)-1;
if(x==1){return 0;}
else if(x<=b+1){return func(n-1,x-1);}
else if(x==b+2){return 1+p;}
else if(x<2*b+2){return 1+p+func(n-1,x-2-b);}
else {return 2*p+1;}
}
int main() {
int64_t N,X;
cin>>N>>X;
cout<<func(N,X)<<endl;
return 0;
}
| 0
| 49,739,812
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
bool rest = false;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (rest && A > 0) {
ans++;
A--;
}
ans += (long long)A / 2;
rest = A % 2 == 1;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
vector<vector<ll>> dp(11);
for(ll i=1;i<10;i++)dp[1].push_back(i);
for(ll i=2;i<11;i++){
for(ll j=0;j<dp[i-1].size();j++){
ll a=dp[i-1][j];
if(a%10==0){
dp[i].push_back(a*10);
dp[i].push_back(a*10+1);
}
else if(a%10==9){
dp[i].push_back(a*10+8);
dp[i].push_back(a*10+9);
}
else{
dp[i].push_back(a*10+a%10);
dp[i].push_back(a*10+a%10-1);
dp[i].push_back(a*10+a%10+1);
}
}
}
vector<long long int> b;
for(int i=1;i<11;i++){
for(int j=0;j<dp[i].size();j++){
b.push_back(dp[i][j]);
}
}
sort(b.begin(),b.end());
int d;
cin >> d ;
cout << b[d-1] << endl;
}
| 0
| 37,139,975
|
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
const int MX = 1<<19;
const int MM = 998244353;
pii D[MX];
int main()
{
int N;
scanf("%d", &N);
for(int i = 1; i <= N; i++) scanf("%d%d", &D[i].first, &D[i].second);
for(int i = 1; i <= N; i++){
if((D[i].first + D[i].second + D[1].first + D[1].second) % 2 != 0) return !printf("-1\n");
}
int ch = 0;
if((D[1].first + D[1].second) % 2 == 0) ch = 1;
if(ch) printf("32\n1 ");
else printf("31\n");
for(int i = 30; i >= 0; i--) printf("%d ", 1<<i);
printf("\n");
for(int i = 1; i <= N; i++){
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
char s[5] = "LDRU";
pii cur = pii(0, 0);
if(ch) printf("R"), cur = pii(1, 0);
for(int m = 30; m >= 0; m--){
ll dist = 1e18;
char ans;
pii x;
for(int d = 0; d < 4; d++){
pii nxt = pii(cur.first + dx[d] * (1<<m), cur.second + dy[d] * (1<<m));
ll t = abs((ll)nxt.first - D[i].first) + abs((ll)nxt.second - D[i].second);
if(dist > t) dist = t, ans = s[d], x = nxt;
}
cur = x; printf("%c", ans);
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
ll N, A, B;
cin >> N >> A >> B;
ll M = B*(N-1)+A, m = B+A*(N-1);
if(A > B || (N == 1 && A != B)) cout << 0 << endl;
else cout << M-m+1 << endl;
}
| 0
| 17,696,357
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,end) for(ll i = 0; i < end ; i++ )
#define print(ans) cout << fixed << setprecision(15) << ans << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
typedef long long ll;
typedef vector<ll> vi;
int main() {
ll N;
cin >> N;
ll M;
M = pow(N, 0.5);
rep(i, M){
if (N%(M-i) == 0){
print(M-i+N/(M-i) -2);
return 0 ;
}
}
print(N-1);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
cin >> m;
vector<string> t(m);
rep(i, m) cin >> t[i];
int ans = 0;
for(int i = 0; i < n; i++) {
int scnt = 1;
int tcnt = 0;
for(int j = 0; j < n; j++) {
if(i == j) continue;
if(s[i] == s[j]) scnt++;
}
for(int j = 0; j < m; j++) {
if(s[i] == t[j]) tcnt--;
}
ans = max(ans, scnt+tcnt);
}
cout << ans << endl;
return 0;
}
| 0
| 98,401,300
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring>
#include <functional>
#define ll 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 fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
signed main(){
int n,k; cin >> n >> k;
vector<Pll> v;
rep(i,n){
ll x,y; cin >> x >> y;
v.pb({x,y});
}
sort(ALL(v));
ll ans=-1;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
ll x1=v[i].fi,x2=v[j].fi;
vector<ll> vec;
rep(l,n){
if(v[i].fi<=v[l].fi && v[l].fi<=v[j].fi) vec.pb(v[l].se);
}
if(vec.size()<k) continue;
sort(ALL(vec));
ll dy=vec[k-1]-vec[0];
for(int l=0;k-1+l<vec.size();l++){
chmin(dy,vec[k-1+l]-vec[l]);
}
if(ans==-1) ans=(x2-x1)*dy;
chmin(ans,(x2-x1)*dy);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
int K;
ll ans = 0;
bool flag = false;
cin >> S >> K;
int left = 1, right = 1;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) != S.at(i + 1)) {
flag = true;
break;
} else
left++;
}
if (!flag) {
cout << (S.size() * K) / 2 << endl;
return 0;
}
for (int i = S.size() - 1; i > 0; i--) {
if (S.at(i) != S.at(i - 1)) {
break;
} else
right++;
}
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == S.at(i + 1)) {
S.at(i + 1) = '0';
ans++;
}
}
ans *= K;
if (S.at(0) == S.at(S.size() - 1))
ans -= ((left / 2) + (right / 2) - ((left + right) / 2)) * (K - 1);
cout << ans << endl;
}
| 0
| 90,220,338
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
if(d == 25) cout << "Christmas\n";
else if(d == 24) cout << "Christmas Eve\n";
else if(d == 23) cout << "Christmas Eve Eve\n";
else cout << "Christmas Eve Eve Eve\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll count = 0;
for (ll i=0; i<N; i++) {
if (S[i]!=T[i]) {
count++;
}
}
cout << count << endl;
}
| 0
| 36,653,102
|
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
vector<long long> a(S.size() + 1);
vector<long long> b(S.size() + 1);
vector<long long> c(S.size() + 1);
for (int i = 0; i <= S.size() - 1; i++)
{
if (S[i] == '<') a[i + 1] = a[i] + 1;
}
for (int i = S.size() - 1; i >= 0; i--)
{
if (S[i] == '>') b[i] = b[i + 1] + 1;
}
long long ans = 0;
for (int i = 0; i < c.size(); i++)
{
c[i] = max(a[i], b[i]);
ans += c[i];
}
cout << (long long)accumulate(c.begin(), c.end(), 0LL) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> count(200000, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int x : a) {
count.at(x)++;
if (x - 1 >= 0) {
count.at(x - 1)++;
}
count.at(x + 1)++;
}
int count_max = 0;
for (int x : count) {
count_max = max(x, count_max);
}
cout << count_max << endl;
}
| 0
| 25,329,795
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
unordered_map<int,int> mp ;
int count=1 ;
while(true){
if(mp[n]==1){
break ;
}
mp[n]=1 ;
if(n%2==0){
n=n/2 ;
}
else{
n=3*n+1 ;
}
count++ ;
}
cout<<count ;
}
int main(){
int y ;
y=1 ;
while(y--)
{
solve() ;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
int main() {
long long int n, k;
cin >> n >> k;
long long int cnt = 0;
for (long long int a = 1; a <= n; a++){
long long int t = a % k;
if(2*(k-t)%k==0){
long long int m = (n - k + t) / k + 1;
cnt += m * m;
}
}
cout << cnt << endl;
}
| 0
| 76,417,748
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define maxc(v) *max_element(ALL(v))
#define minc(v) *min_element(ALL(v))
#define sqr(a) (a)*(a)
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) m*(n/GCD(m,n))
#define inputarr(a,n) for(int xxx=0;xxx<n;++xxx) cin>>a[xxx]
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define invect(data,n,commands) for(int xxx = 0;xxx<n;xxx++){int tmp;cin>>tmp;data.pb(tmp);commands}
#define inset(data,n,commands) for(int xxx = 0;xxx<n;xxx++){int tmp;cin>>tmp;data.insert(tmp);commands}
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl
#define debug cerr<<"bhau"<<endl
#define between(n,a,b) (a<=n&&n<=b)
#define clamp(n,a,b) (((n)<(a))?(a):(((n)>(b))?(b):(n)))
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
template<typename T, typename U> static inline void amin(T &x, U y)
{
if (y < x)
x = y;
}
template<typename T, typename U> static inline void amax(T &x, U y)
{
if (x < y)
x = y;
}
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ld long double
#define pii std::pair<int, int>
#define pll std::pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi >
#define vii vector<pii >
#define point complex<ll>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
std::ostream& operator<<(std::ostream& out,pii a)
{
out<<a.fi<<" "<<a.se;
return out;
}
std::ostream& operator<<(std::ostream& out,pll a)
{
out<<a.fi<<" "<<a.se;
return out;
}
std::istream& operator>>(std::istream& in,pii &a)
{
in>>a.fi>>a.se;
return in;
}
std::istream& operator>>(std::istream& in,pll &a)
{
in>>a.fi>>a.se;
return in;
}
using namespace std;
using namespace __gnu_pbds;
void meowmeow321()
{
int n;
cin>>n;
int cnt[n+1]={0};
int a[n];
inputarr(a,n);
for (int i = 0; i < n; ++i)
{
cnt[a[i]]++;
}
sort(cnt,cnt+n+1);
ll presum[n+1]={0};
for (int i = 0; i < n; ++i)
{
presum[i+1]=presum[i]+cnt[i+1];
}
int id[n+1]={0};
id[0]=-1;
for (int i = 0; i < n; ++i)
{
id[i+1]=lower_bound(cnt,cnt+n+1,i+1) - cnt -1;
}
for (int k = 1; k <= n; ++k)
{
int lo=0,hi=n/k;
while(hi-lo>0){
int mid=(hi+lo+1)/2;
int sum=0;
if(id[mid]!=-1){
sum=presum[id[mid]];
}
sum+=mid*(n-id[mid]);
if(sum>=mid*k){
lo=mid;
}else hi=mid-1;
}
cout<<lo<<endl;
}
}
int main()
{
FAST;
int testcases=1;
for(int i=0;i<testcases;++i)
{
meowmeow321();
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void){
vector<int>list;
while (true) {
int n, x;
cin >> n >> x;
if (n == 0 && x == 0) break;
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
if (j == i) continue;
for (int k = j; k <= n; k++) {
if (k == i) continue;
if (k == j) continue;
if (i + j + k == x) {
count++;
}
}
}
}
list.push_back(count);
}
for (auto count : list) {
cout << count << endl;
}
return 0;
}
| 0
| 100,225,490
|
#include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int N = S.size();
vector<int>num(N);
for (int i = 0; i < N; i++) {
num.at(i) = S.at(i) - '0';
num.at(i) -= 49;
}
int Min;
int count = 0;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < N; j++) {
if (num.at(j) == i){
break;
}
else if (j == N-1){
Min = i;
count++;
}
}
if (count > 0){
break;
}
}
if (N != 26){
cout << S;
printf("%c", Min + 'a');
}
else {
if (S == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
reverse(num.begin(), num.end());
for (int i = 0; i < 25; i++) {
if (num.at(i) > num.at(i+1)){
for (int j = 0; j < 26-i-2; j++) {
cout << S.at(j);
}
for (int k = 0; k <= i; k++) {
if (num.at(k) >= num.at(i+1)){
printf("%c", num.at(k) + 'a');
break;
}
}
cout << endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <tuple>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
#include <list>
#include <cstring>
using namespace std;
#define pi pair<int,int>
#define pl pair<long long,long long>
#define chmax(a,b) (a<b ? a=b:0)
#define chmin(a,b) (a>b ? a=b:0)
#define en cout << endl
typedef long long ll;
const int MM = 1e9;
const int MOD = MM+7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1,0,1,0,-1,-1,1,1};
int dy[8] = {0,-1,0,1,-1,1,1,-1};
template<typename T>
T GCD(T u,T v){
return v ? GCD(v,u%v) : u;
}
template<typename T>
T LCM(T x,T y){
T gc = GCD(x,y);
return x*y/gc;
}
struct edge
{
int to, cost;
};
vector<vector<int> > g;
vector<int> isVisited, out;
void Topological(int pos){
isVisited[pos] = true;
for (int i = 0; i < g[pos].size(); i++){
if (!isVisited[g[pos][i]]){
Topological(g[pos][i]);
}
}
out.push_back(pos);
}
int main(){
int V, E; cin >> V >> E;
g.resize(V);
isVisited.resize(V, 0);
vector<int> IsVisited(V, 0);
for (int i = 0; i < E; i++){
int s, t; cin >> s >> t;
g[s].push_back(t);
}
for (int i = 0; i < V; i++){
if (isVisited[i]) continue;
Topological(i);
}
reverse(out.begin(), out.end());
for (int i = 0; i < out.size(); i++){
cout << out[i] << endl;
}
}
| 0
| 70,589,505
|
#define _USE_MATH_DEFINES
#include<iomanip>
#include<cmath>
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x) cout << x
#define wrln(x) cout << x << endl
ll K;
ll N = 50, a[55];
int main() {
rd(K);
wrln(N);
repi(i, 0, N) {
if (i < (K%N)) wr((N - 1) + (K / N) + (N - (K%N) + 1));
else wr((N - 1) + (K / N) - (K%N));
if (i != N - 1) wr(" ");
else cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
ll gcd(ll a,ll b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
ll lcm(ll a,ll b){
return a /gcd(a,b) * b;
}
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
int n;
cin >> n;
string s[n+1];
map <char,ll> cnt;
map <char,ll> ans;
rep (i,n) {
cin >> s[i];
sort(s[i].begin(),s[i].end());
rep (j,s[i].size()) {
cnt[s[i][j]]++;
}
for (char k = 'a';k <= 'z';k++){
if (i == 0) {
ans[k]=cnt[k];
}
else {
ans[k]=min(ans[k],cnt[k]);
}
cnt[k]=0;
}
}
for (char k = 'a';k <= 'z';k++){
while(ans[k]>0){
cout << k;
ans[k]--;
}
}
cout << endl;
}
| 0
| 78,726,346
|
#include <iostream>
#include <bitset>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int min = 10000000;
for (int tmp = 0; tmp < (1 << N); tmp++) {
int D = 1;
bitset<10> s(tmp);
for (int i = 0; i < N; i++) {
if (s.test(i)) {
D = D * 2;
}else{
D = D + K;
}
}
if (min > D){
min = D;
}
}
cout << min << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M, c, d;
c = 0;
cin >> N;
vector<string> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
cin >> M;
vector<string> b(M);
for (int i = 0; i < M; i++) {
cin >> b.at(i);
}
for (int i = 0; i < N; i++) {
d = 0;
for (int j = 0; j < N; j++) {
if (a.at(i) == a.at(j)) {
d++;
}
}
for (int j = 0; j < M; j++) {
if (a.at(i) == b.at(j)) {
d--;
}
}
if (d > c) {
c = d;
}
}
cout << c << endl;
}
| 0
| 54,909,536
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
int x1 = 0, y1 = 0;
int flag = 1;
int t1 = 0;
for (int i = 0; i < n; i++) {
int t2, x2, y2;
cin >> t2 >> x2 >> y2;
int dist = abs(x2 - x1) + abs(y2 - y1);
if (dist > (t2 - t1) || (t2 - t1 - dist) % 2 == 1) {
flag = 0;
}
x1 = x2, y1 = y2;
t1 = t2;
}
if (flag == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
int main() {
int N;
cin >> N;
vector<int> A(N);
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
ll acc = A[0];
ll ans = 1LL << 62;
for(int i = 1; i < N; i++) {
ans = min(ans, abs(acc - (sum - acc)));
acc += A[i];
}
cout << ans << endl;
return 0;
}
| 0
| 15,241,997
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, ans=""; cin>>s;
for (int i=0; i<s.length(); i += 2) ans += s[i];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int a, b, c;
cin >> a >> b >> c;
for (int x = a; x <= a * 100; x += a)
{
if (x % b == c)
{
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 53,870,458
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n,m;
cin>>n>>m;
vvec x(3,vec (n));
rep(i,n){
rep(j,3){
int a;cin>>a;
x[j][i]=a;
}
}
for(int i = 0; i < (1 << n); i++)
{
for(int j = 0; j < n; j++)
{
if ((i >> j & 1))
{
}
}
}
ll ans=0;
rep(i,(1<<3)){
vec sum(n);
int memo=0;
rep(j,3){
rep(k,n){
if((i>>j)&1){
sum[k]-=x[j][k];
}
else{
sum[k]+=x[j][k];
}
}
}
sort(rall(sum));
rep(k,m){
memo+=sum[k];
}
chmax(ans,memo);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[110];
int main()
{
cin>>n;
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
int max_diff = 0;
for (int i = 0; i < n-1; i++)
{
for (int j = i+1; j < n; j++)
{
max_diff = max(max_diff, abs(a[i] - a[j]));
}
}
cout << max_diff << endl;
return 0;
}
| 0
| 30,708,979
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
int n;
cin >> n;
int k = -1;
for (int i = 0; i < 1010; i++)
{
if (i * (i - 1) / 2 == n)
{
k = i;
break;
}
}
if (k == -1)
{
Yes(false);
return 0;
}
int num = 1;
vector<int> v[10010];
rep(i, k) REP(j, i + 1, k)
{
v[i].push_back(num);
v[j].push_back(num);
num++;
}
Yes(true);
cout << k << "\n";
rep(i, k)
{
cout << v[i].size() << " ";
rep(j, v[i].size()) cout << v[i][j] << (j == v[i].size() - 1 ? "\n" : " ");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll X,Y;
string S;
cin >> X>>Y;
ll ans = 1;
while (2*X<=Y){
X *= 2;
ans++;
}
cout << ans << endl;
}
| 0
| 75,672,528
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MAX/2;
#define PI 3.14159265358979323846264338327950L;
const int INF2 = 1001001001;
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll mod = 1e9 + 7;
const ll LINF = 1e18 + 100;
using namespace std;
using Graph = vector<vector<int>>;
int cnt_digit(ll N)
{
int digit = 0;
while (N > 0)
{
N /= 10;
digit++;
}
return digit;
}
ll gcd(ll a, ll b)
{
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
struct union_find
{
vector<int> par, r;
union_find(int n)
{
par.resize(n);
r.resize(n);
init(n);
}
void init(int n)
{
for (int i = 0; i < n; i++) par[i] = i;
for (int i = 0; i < n; i++) r[i] = 0;
}
int find(int x)
{
if (par[x] == x)return x;
else return find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (r[x] < r[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (r[x] == r[y])
{
r[x]++;
}
}
}
};
const int MAX_N = 110000;
int memo[MAX_N];
int rec(int n) {
if (n == 0)return 0;
if (memo[n] != -1)return memo[n];
int res = n;
for (int pow6 = 1; pow6 <= n; pow6 *= 6)res = min(res, rec(n - pow6) + 1);
for (int pow9 = 1; pow9 <= n; pow9 *= 9)res = min(res, rec(n - pow9) + 1);
return memo[n] = res;
}
int calc(int x) {
int ret = 0;
while (x % 2 == 0) {
x /= 2;
ret++;
}
return ret;
}
int a[12][12];
int D;
ll G;
vector<ll> P, C;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> data(n);
rep(i, 0, n) {
cin >> data[i];
}
bool ans = true;
rep(i, 0, n - 1) {
if (data[i].back() != data[i + 1].front()) {
ans = false;
}
}
sort(data.begin(), data.end());
rep(i, 0, n - 1) {
if (data[i] == data[i + 1]) {
ans = false;
}
}
if (ans)cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <cstdio>
#include <vector>
#include <string>
using namespace std;
typedef unsigned long long llong;
#define MAX 200001
int main()
{
llong N, P;
char S[MAX];
llong mod = 0, ans = 0;
llong T[MAX], M[MAX];
M[0] = 1;
T[0] = 1;
scanf("%llu%llu", &N, &P);
for (llong i = 1; i < P; i++)
{
M[i] = 0;
}
scanf("%s", S);
if (P == 2 || P == 5)
{
for (int i = 1; i <= N; i++)
{
if ((S[i - 1] - '0') % P == 0)
{
ans += i;
}
}
}
else
{
for (llong i = 1; i < N; i++)
{
T[i] = (T[i - 1] * 10) % P;
}
for (llong i = 0; i < N; i++)
{
mod = (mod + (S[N - 1 - i] - '0') * T[i]) % P;
ans += M[mod];
M[mod]++;
}
}
printf("%llu", ans);
return 0;
}
| 0
| 99,978,014
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
int H,W; cin >> H >> W;
vector<string> S(H);
REP(i,H) cin >> S[i];
vecveci cnt_W(H,veci(W)),cnt_H(H,veci(W));
REP(i,H) {
int cnt = 1;
REP(j,W) {
if(S[i][j] == '#') cnt = 1;
else {
cnt_W[i][j] = cnt;
cnt++;
}
}
for(int j = W-2; j >= 0; --j) {
if(S[i][j] == '.' && S[i][j+1] == '.') cnt_W[i][j] = cnt_W[i][j+1];
}
}
REP(j,W) {
int cnt = 1;
REP(i,H) {
if(S[i][j] == '#') cnt = 1;
else {
cnt_H[i][j] = cnt;
cnt++;
}
}
for(int i = H-2; i >= 0; --i) {
if(S[i][j] == '.' && S[i+1][j] == '.') cnt_H[i][j] = cnt_H[i+1][j];
}
}
int ans = 0;
REP(i,H) REP(j,W) {
if(S[i][j] == '#') continue;
else {
chmax(ans,cnt_H[i][j]+cnt_W[i][j]-1);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll C(ll N) {
return N * (N - 1) / 2;
}
const double PI = 3.14159265358979323846;
int main() {
ll X, Y; cin >> X >> Y;
ll ans = 1;
while (1) {
ll num = X * pow(2, ans);
if (num > Y) break;
ans++;
}
cout << ans << endl;
}
| 0
| 24,702,511
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double res = 0;
for (int i = 1; i <= min(N, K - 1); ++i) {
res += pow(0.5, ceil(log2(ceil((double)K / i))));
}
printf("%.10f\n", (res + max(0, N - K + 1)) / N);
}
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> ip;
typedef pair<ll,ll> lp;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
struct st{
int c;
int s;
int f;
};
int main(){
int N; cin>>N;
vector<st> train(N-1);
rep(i,N-1)cin>>train[i].c>>train[i].s>>train[i].f;
rep(i,N-1){
int e_ans = 0;
for(int j = i; j<N-1; ++j){
e_ans = max(train[j].s, (int)ceil((double)e_ans/train[j].f)*train[j].f);
e_ans += train[j].c;
}
cout<<e_ans<<endl;
}
cout<<0<<endl;
return 0;
}
| 0
| 66,803,585
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define all(a) (a).begin(), (a).end()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
string S; cin >> S;
int N = S.length();
map<char, int> mp;
REP(i,N) mp[S[i]]++;
char ans = ' ';
for(char a = 'a';a<='z';a++){
if(mp[a] == 0){
ans = a;
break;
}
}
if(ans == ' ') cout << "None" << endl;
else cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> blue(N);
int MAX = 0;
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int count;
string S;
for(int i = 0; i < N; i++){
count = 0;
S = blue.at(i);
for(int j = 0; j < N; j++){
if(S == blue.at(j)){
count++;
}
}
for(int k = 0; k < M; k++){
if(S == red.at(k)){
count--;
}
}
if(MAX < count){
MAX = count;
}
}
if(MAX < 1){
cout << 0 << endl;
}else{
cout << MAX << endl;
}
}
| 0
| 41,815,967
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
LL x, y;
cin >> x >> y;
if (abs(x - y) <= 1) cout << "Brown\n";
else cout << "Alice\n";
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ask(ll x){
printf("? %lld\n",x);
fflush(stdout);
char res;scanf(" %c",&res);
if(res=='Y')return true;
else return false;
}
int p[11];
int main(){
p[1]=1;
for(int i=2;i<=10;i++)p[i]=p[i-1]*10;
ll ans;
if(ask(1000000000)){
int l=1,r=10;
int mid,res;
while(l<=r){
mid=l+r>>1;
if(ask(p[mid]*2))res=mid,r=mid-1;
else l=mid+1;
}
ans=p[res];
}
else{
int l=1,r=9;
int mid,res;
while(l<=r){
mid=l+r>>1;
if(ask(p[mid]))res=mid,l=mid+1;
else r=mid-1;
}
l=p[res],r=p[res+1]-1;
while(l<=r){
mid=l+r>>1;
if(ask(1ll*mid*10))res=mid,r=mid-1;
else l=mid+1;
}
ans=res;
}
printf("! %lld\n",ans);
return 0;
}
| 0
| 56,012,488
|
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
int main() {
long n, m;
pair<long, long> a[110000];
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a, a+n);
long sum = 0;
for(int i = 0; i < n; i++) {
if(m >= a[i].second) {
sum += a[i].first * a[i].second;
m -= a[i].second;
if(m == 0) break;
}
else {
sum += a[i].first * m;
break;
}
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
ll X[4] = {1,0,-1,0};
ll Y[4] = {0,1,0,-1};
int main(){
ll H,W;
cin >> H >> W;
vector<string> A(H);
queue<Pll> que;
vector<vector<ll>> memo(H, vector<ll>(W));
vector<vector<ll>> c(H, vector<ll>(W,1e18));
rep(i,H){
cin >> A[i];
}
rep(i,H){
rep(j,W){
if(A[i][j] == '#'){
que.push(Pll(i,j));
c[i][j] = 0;
}
}
}
ll ans = 0;
while(!que.empty()){
ll h = que.front().first;
ll w = que.front().second;
que.pop();
if(!(0 <= h && h < H)) continue;
if(!(0 <= w && w < W)) continue;
if(memo[h][w] != 0) continue;
memo[h][w] = 1;
rep(i,4){
if(!(0 <= h+Y[i] && h+Y[i] < H)) continue;
if(!(0 <= w+X[i] && w+X[i] < W)) continue;
que.push(Pll(h+Y[i],w+X[i]));
c[h+Y[i]][w+X[i]] = min(c[h+Y[i]][w+X[i]], c[h][w] + 1);
}
}
rep(i,H){
rep(j,W){
cmax(ans,c[i][j]);
}
}
cout << ans << endl;
}
| 0
| 79,644,739
|
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define n0 cout<<"No\n"<<endl
#define test cin>>t; while(t--)
#define for(i,a,n) for(i=a;i<n;i++)
#define mp make_pair
#define ft first
#define sc second
#define gp ' ';
#define MAX 9999999
#define MOD 1000000007
#define nd endl
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string a,b,c;
cin>>a>>b;
c = b+a;
cout<<c<<nd;
}
|
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 100000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(),v.end()
ll INF = 10010001010;
ll lcm(ll a,ll b)
{
return a * b / __gcd(a, b);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll A, B, C, K;
cin >> A>>B>>C>>K;
if(abs(A-B) > 1000000000000000000){
cout << "Unfair" << endl;
}
else{
if(K%2 == 0){
cout << A - B << endl;
}
else{
cout << B - A << endl;
}
}
}
| 0
| 60,174,623
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n, k;
cin >> n >> k;
vector < pair < int, int > > v;
for(int i = 0; i < n; i++){
int t, d;
cin >> t >> d;
v.push_back({d, t});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
priority_queue < int, vector < int >, greater < int > > q;
vector < bool > used(n + 1, false);
ll y = 0, x = 0;
for(int i = 0; i < k; i++){
y += v[i].first;
if(!used[v[i].second]){
used[v[i].second] = true;
x++;
}else{
q.push(v[i].first);
}
}
ll ans = y + x * x;
for(int i = k; i < n && !q.empty(); i++){
if(used[v[i].second]) continue;
x++;
y -= q.top();
q.pop();
y += v[i].first;
used[v[i].second] = true;
ans = max(ans, x * x + y);
}
cout << ans << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n)cin >> a[i];
vector<pair<int,int>>dataa(110000);
vector<pair<int,int>>datab(110000);
rep(i,110000){
dataa[i].second = i;
datab[i].second = i;
dataa[i].first = 0;
datab[i].first = 0;
}
rep(i,n){
if(i%2==0){
datab[a[i]].first++;
}else {
dataa[a[i]].first++;
}
}
sort(all(dataa));
reverse(all(dataa));
sort(all(datab));
reverse(all(datab));
int x = dataa[0].second;
int y = datab[0].second;
if(x == y){
if(dataa[1].first < datab[1].first)y = datab[1].second;
else x = dataa.at(1).second;
}
int ans = 0;
rep(i,n){
if(i%2==0){
if(a[i]!=y)ans++;
}else{
if(a[i]!=x)ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 33,973,491
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return 1;}return 0;}
template <typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return 1;}return 0;}
vector<ll> sum_b,sum_w;
void pre_process(vector<ll> &a, vector<ll> &s)
{
ll n = (ll)a.size();
s.assign(n + 1, 0);
for (ll i = 0; i < n; i++)
{
s[i + 1] = s[i] + a[i];
}
}
ll query(ll i, ll j, vector<ll> &s)
{
return (s[j] - s[i]);
}
int main(){
string s;cin>>s;
ll n=s.size();
ll ans=0;
rep(i,n-1){
if(s[i]!=s[i+1]){
ans++;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int c1=0;
int c2=0;
if(n+m==2)
cout<<0<<endl;
else{
if(n>=2)
c1=n*(n-1)/2;
if(m>=2)
c2=m*(m-1)/2;
cout<<c1+c2<<endl;
}
}
| 0
| 81,721,269
|
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include <functional>
using namespace std;
int INF = 10000000;
int n;
int cast(int y,int m,int d)
{
int sum = 0;
for(int i = 999;i > 0;i--)
{
for(int j = 10;j > 0;j--)
{
for(int k = j%2 || i % 3 == 0 ? 20 : 19 ;k > 0;k--)
{
sum++;
if(i == y && j == m && d == k)
{
return sum;
}
}
}
}
}
int main()
{
cin >> n;
for(int i = 0;i < n;i++)
{
int y,m,d;
cin >> y >> m >> d;
cout << cast(y,m,d) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = int_fast64_t;
using pll = pair<ll,ll>;
constexpr ll INF = 1LL<<60;
constexpr ll MOD = 1e9+7;
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;}
#if loc||local
template<class T>void dump(T&& t){cerr<<t<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cerr<<h<<", ";dump(forward<Ts>(t)...);}
#else
void dump(){}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){}
#endif
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T> ostream &operator<<(ostream& os,vector<T>const& v){for(auto const& vi:v)os<<vi<<" ";return os;}
template<class T,class U> ostream &operator<<(ostream& os,pair<T,U>const& p){os<<p.first<<","<<p.second;return os;}
template<class T>vector<T> vec(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto vec(size_t a, Ts... ts){return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));}
signed main(){
ll n,k;
cin>>n>>k;
vector<ll> v(n);
cin>>v;
auto vl = v,vr = v;
reverse(begin(vr),end(vr));
ll ans = 0;
for(int l=0;l<=n;++l)for(int r=0;r<=n;++r){
if(l+r>n)break;
if(l+r>k)break;
priority_queue<ll,vector<ll>,greater<>> que;
for(int i=0;i<l;++i)que.emplace(vl[i]);
for(int i=0;i<r;++i)que.emplace(vr[i]);
int s = k-(l+r);
while(s--){
if(que.empty())break;
if(que.top()<0)que.pop();
else break;
}
ll sum = 0;
while(!que.empty()){
sum += que.top();
que.pop();
}
chmax(ans,sum);
}
cout<<(ans)<<endl;
}
| 0
| 39,317,335
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
int getint(char c) {
if (c == 'A') return 1;
else if (c == 'C') return 2;
else if (c == 'G') return 3;
else return 4;
}
int getint(string s) {
int j = 1;
int a = 0;
REP(i, s.size()) {
a += j * getint(s[i]);
j *= 5;
}
return a;
}
int main() {
int n;
cin >> n;
set<int> st;
REP(i,n) {
string s, t;
cin >> s >> t;
int h = getint(t);
if (s[0] == 'i') st.insert(h);
else {
if (st.find(h) != st.end()) cout << "yes" << endl;
else cout << "no" << endl;
}
}
return 0;
}
|
#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);
ll H, W;
cin >> H >> W;
ll ans = H * W;
ll s[3];
rep(i, 2) {
for (ll h = 1; h < H; ++h) {
s[0] = h * W;
s[1] = (H - h) * (W / 2);
s[2] = H * W - (s[0] + s[1]);
sort(s, s + 3);
ans = min(ans, s[2] - s[0]);
s[0] = h * W;
s[1] = ((H - h) / 2) * W;
s[2] = H * W - (s[0] + s[1]);
sort(s, s + 3);
ans = min(ans, s[2] - s[0]);
}
swap(H, W);
}
cout << ans << endl;
return 0;
}
| 0
| 22,982,562
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(),v.end())
#define sor(v) sort(v.begin(),v.end())
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define ve vector
#define pq priority_queue
#define vi vector<int>
#define vl vector<long long>
#define vii vector<vector<int>>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
int main()
{
int N;cin>>N;
vi a(N);
in(N,a);
rep(i,N) a[i]--;
vi idx(N);
rep(i,N) idx[a[i]] = i;
ll ans = 0;
set<int> s;
for (int x = N-1; x >= 0; x--) {
int i = idx[x];
ll c = 0;
s.insert(i);
vi l(2,-1),r(2,N);
auto it = s.find(i);
rep(j,2){
if(it == s.begin()) break;
--it;
l[j] = *it;
}
it = s.find(i);
rep(j,2){
++it;
if(it == s.end()) break;
r[j] = *it;
}
vi ls(2);
ls[0] = -l[0]+i; ls[1]=l[0]-l[1];
vi rs(2);
rs[0] = r[0]-i; rs[1]=r[1]-r[0];
c = (ll)ls[0]*rs[1] + (ll)ls[1]*rs[0];
ans += c*(x+1);
}
out(ans);
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static void printArray(vector<string> vector) {
int size = vector.size();
for (int i = 0; i < size; ++i) {
if (i == size - 1) {
cout << vector[i] << endl;
} else {
cout << vector[i] << " ";
}
}
}
static string isStable(vector<string> in, vector<string> out) {
int N = in.size();
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
for (int a = 0; a < N; ++a) {
for (int b = a + 1; b < N; ++b) {
if (in[i].substr(1, 1) == in[j].substr(1, 1) && in[i] == out[b] && in[j] == out[a]) {
return "Not stable";
}
}
}
}
}
return "Stable";
}
int main() {
int N;
cin >> N;
vector<string> cards(N);
for (int i = 0; i < N; ++i) {
cin >> cards[i];
}
vector<string> bubbleCards(N);
bubbleCards = cards;
vector<string> selectionCards(N);
selectionCards = cards;
for (int i = 0; i < N; ++i) {
for (int j = N - 1; j > i; --j) {
if (bubbleCards[j].substr(1, 1) < bubbleCards[j - 1].substr(1, 1)) {
swap(bubbleCards[j], bubbleCards[j - 1]);
}
}
}
for (int i = 0; i < N; ++i) {
int minj = i;
for (int j = i; j < N; ++j) {
if (selectionCards[j].substr(1, 1) < selectionCards[minj].substr(1, 1)) {
minj = j;
}
}
swap(selectionCards[i], selectionCards[minj]);
}
printArray(bubbleCards);
cout << isStable(cards, bubbleCards) << endl;
printArray(selectionCards);
cout << isStable(cards, selectionCards) << endl;
return 0;
}
| 0
| 9,162,846
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll x,y;cin>>x>>y;
ll ans = 0;
ll xa = abs(x);
ll ya = abs(y);
ans += abs(ya - xa);
if(x >= 0 && y >= 0 && x < y)ans+=0;
else if(x > 0 && y > 0 && x > y)ans+=2;
else if(x < 0 && y <= 0 && x < y)ans+=0;
else if(x < 0 && y < 0 && x > y)ans+=2;
else ans+=1;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
s[i].resize(k);
rep(j, k) {
cin >> s[i][j];
--s[i][j];
}
}
int p[m];
rep(i, m) cin >> p[i];
int ans = 0;
rep(si, 1 << n) {
int now = 0;
rep(i, m) {
int cnt = 0;
for (auto j : s[i]) {
if (si >> j & 1) ++cnt;
}
if (cnt % 2 == p[i]) ++now;
}
if (now == m) ++ans;
}
cout << ans << endl;
return 0;
}
| 0
| 50,725,234
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int A;
cin >> N >> A;
cout << N * N - A;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>a(n),b(n),c(n);
for(int i=0;i<n;i++){
cin>>a[i];
c[i] = a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
sort(c.begin(),c.end());
int apos,bpos,cnt = 0;
do{
if(a == c) apos = cnt;
if(b == c) bpos = cnt;
cnt++;
}while(next_permutation(c.begin(), c.end()));
cout<<abs(apos-bpos)<<endl;
}
| 0
| 37,474,542
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++)
cin >> a.at(i);
map<int,int>even;
map<int,int>odd;
for(int i=0;i<n;i+=2)
even[a.at(i)]++;
for(int i=1;i<n;i+=2)
odd[a.at(i)]++;
vector<pair<int,int>>eve(even.size()+1);
vector<pair<int,int>>od(odd.size()+1);
eve.at(0)=make_pair(0,0);
od.at(0)=make_pair(0,0);
int c=1;
for(auto x:even){
eve.at(c)=make_pair(x.second,x.first);
c++;
}
c=1;
for(auto x:odd){
od.at(c)=make_pair(x.second,x.first);
c++;
}
sort(od.begin(),od.end(),greater());
sort(eve.begin(),eve.end(),greater());
int ans=0;
if(od.at(0).second==eve.at(0).second){
if(od.at(0).first=eve.at(0).first){
if(od.at(1).first>eve.at(1).first)
ans=n-eve.at(0).first-od.at(1).first;
else
ans=n-od.at(0).first-eve.at(1).first;
}else if(od.at(0).first>eve.at(0).first){
ans=n-od.at(0).first-eve.at(1).first;
}else{
ans=n-eve.at(0).first-od.at(1).first;
}
}else{
ans=n-eve.at(0).first-od.at(0).first;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned long long int
#define test int t;cin>>t; while(t--)
#define um unordered_map
#define en '\n'
#define us unordered_set
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
bool check_prime(long long n)
{
int flag = 0;
for (long long i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
flag = 1;
break;
}
}
if (n == 1)
return false;
else if (flag == 0 || n == 2 || n == 3)
{
return true;
}
else
{
return false;
}
}
int BE(int x, int n, int m)
{
int result = 1;
while (n > 0)
{
if (n % 2 == 1)
result = result * x % m;
x = x * x % m;
n = n / 2;
}
return result;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
int n;
cin >> n;
int a[n]; zip(i, 0, n) cin >> a[i];
int x = a[0];
zip(i, 1, n)
{
x = __gcd(a[i], x);
}
cout << x << en;
return 0;
}
| 0
| 60,834,357
|
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,M,A[20]={},B,c[200],res=0,Match[20]={0,2,5,5,4,5,6,3,7,6};
string S[300];
map<string,long long int>mp;
long long int dp[10005][12]={};
int main()
{
cout << fixed << setprecision(18);
cin>>N>>M;
for(long long int i = 0; i < M; i++){
cin>>A[i];
}
for(long long int i = 0; i < N; i++){
for(long long int j = 0; j < 10; j++){
dp[i][j]=-INF/10;
}
}
for(long long int i = N; i >=1; i--){
for(long long int j = 0; j < M; j++){
if(i<Match[A[j]]){continue;}
bool ok=false;
if(dp[i-Match[A[j]]][0]<dp[i][0]+1){ok=true;}
for(long long int k = 9; k >=1; k--){
if(A[j]==k){
if(dp[i-Match[A[j]]][k]<dp[i][k]+1){ok=true;break;}
else if(dp[i-Match[A[j]]][k]>dp[i][k]+1){break;}
}else{
if(dp[i-Match[A[j]]][k]<dp[i][k]){ok=true;break;}
else if(dp[i-Match[A[j]]][k]>dp[i][k]){break;}
}
}
if(ok){
for(long long int k = 1; k <= 9; k++){
dp[i-Match[A[j]]][k]=dp[i][k];
}
dp[i-Match[A[j]]][A[j]]++;
dp[i-Match[A[j]]][0]=0;
for(long long int k = 1; k <= 9; k++){
dp[i-Match[A[j]]][0]+=dp[i-Match[A[j]]][k];
}
}
}
}
for(long long int i = 9; i >= 1; i--){
for(long long int j = 0; j < dp[0][i]; j++){
cout<<i;
}
}
}
|
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define f first
#define s second
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
string s,h="";
cin>>s;
h+= s[0];
bool flag =0;
for(int i = 1;i<s.length() ; i++)
{
if(s[i]==s[i-1])
{
cout<<i<<" "<<i+1<<endl;
flag =1;
break;
}
else
{
h+= s[i];
string f="";
if(i>1)
f = s.substr(i-2,3);
else
f = h;
sort(h.begin(),h.end());
for(int j =0; j<2; j++)
{
if(h[j]==h[j+1])
{
cout<<i-1<<" "<<i+1<<endl;
flag = 1;
break;
}
}
if(f.length()==3)
h = f.substr(1,2);
if(flag)
break;
}
}
if(!flag)
cout<<-1<<" "<<-1<<endl;
return 0;
}
| 0
| 77,829,086
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll k, a[55] = {};
cin >> k;
for (int i = 0; i < 50; i++) a[i] = k / 50 + 50 - 1;
for (int i = 0; i < k % 50; i++) {
for (int j = 0; j < 50; j++) a[j]--;
a[i] += 51;
}
cout << 50 << '\n';
for (int i = 0; i < 50; i++) cout << a[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
void bfs(queue<ll> que, vector<ll> &isVisited, vector<vector<ll> > &vec, ll K, vector<vector<pair<ll,ll> > > &length){
que.push(K);
isVisited[K] = 0;
while(que.size() != 0){
int q = que.front();
rep(i,vec[q].size()){
if (isVisited[vec[q][i]] == -1){
que.push(vec[q][i]);
isVisited[vec[q][i]] = isVisited[q] + length[q][i].second;
}
}
que.pop();
}
}
int main(){
ll N;
cin >> N;
vector<ll> a(N - 1);
vector<ll> b(N - 1);
vector<ll> c(N - 1);
rep(i,N - 1){
cin >> a[i] >> b[i] >> c[i];
a[i]--;
b[i]--;
}
ll Q,K;
cin >> Q >> K;
K--;
vector<ll> x(Q);
vector<ll> y(Q);
rep(i,Q){
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
}
vector<vector<ll> > connection(N, vector<ll> (0));
rep(i,N - 1){
connection[a[i]].push_back(b[i]);
connection[b[i]].push_back(a[i]);
}
vector<ll> isVisited(N, -1);
vector<vector<pair<ll,ll> > > length(N, vector<pair<ll,ll> > (0));
rep(i,N - 1){
length[a[i]].push_back(pair<ll,ll> (b[i], c[i]));
length[b[i]].push_back(pair<ll,ll> (a[i], c[i]));
}
queue<ll> que;
bfs(que, isVisited, connection, K, length);
rep(i,Q){
cout << isVisited[x[i]] + isVisited[y[i]] << endl;
}
}
| 0
| 40,242,148
|
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define vi vector<int>
#define vll vector<ll>
#define vi2 vector<vector<int>>
#define eb emplace_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
using P = pair<ll,ll>;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};
#define INT(name) int name;cin >> name;
#define VEC(type,name,n) vector<type> name(n);REP(i,n) cin >> name[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()
{
INT(A);
INT(B);
cout << 100 << " " << 100 << endl;
vector<vector<int>> ans(100,vector<int>(100,0));
REP2(i,50,99){
REP(j,100){
ans[i][j]=1;
}
}
int cnt=0;
int flag=0;
REP(i,49){
REP(j,100){
if(cnt==B-1){
flag=1;
break;
}
if(i%2==0&&j%2==0){
ans[i][j]=1;
cnt++;
}
}
if(flag==1){
break;
}
}
cnt=0;
flag=0;
REP2(i,51,100){
REP(j,100){
if(cnt==A-1){
flag=1;
break;
}
if(i%2==1&&j%2==0){
ans[i][j]=0;
cnt++;
}
}
if(flag==1){
break;
}
}
REP(i,100){
REP(j,100){
if(ans[i][j]==0){
cout << ".";
}else{
cout << "#";
}
}
cout << endl;
}
}
|
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
queue<int> Q;
int n,u,k,vv,cur,dst;
cin >> n;
vector<int> D(n,-1),check(n,0);
vector< vector<int> > v(n);
for(int i = 0;i < n;++i){
cin >> u >> k;
for(int j = 0;j < k;++j){
cin >> vv;
v[u - 1].push_back(vv);
}
sort(v[u - 1].begin(),v[u - 1].end());
}
D[0] = 0;
check[0] = 1;
Q.push(1);
while(!Q.empty()){
cur = Q.front();
Q.pop();
for(int i = 0;i < v[cur - 1].size();++i){
dst = v[cur - 1][i];
if(check[dst - 1] == 0){
D[dst - 1] = D[cur - 1] + 1;
check[dst - 1] = 1;
Q.push(dst);
}
}
}
for(int i = 0;i < n;++i)
cout << i + 1 << " " << D[i] << endl;
}
| 0
| 62,830,685
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int a[26]={0};
cin>>s;
for (size_t i = 0; i < s.length(); i++)
{
a[s[i] - 'a'] += 1;
}
for (size_t i = 0; i < 26; i++)
{
if(a[i]>1){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
int main() {
ll n, k;
cin >> n >> k;
map <ll, ll> mp;
map <ll, ll> mp2;
ll r = 0;
rep(i, n) {
ll a;
cin >> a;
mp[a] ++;
}
ll kind = mp.size();
if (kind <= k) {
mes(0);
re0;
}
for (auto i: mp) {
mp2[i.second]++;
}
for (auto i: mp2) {
rep(j, i.second) {
r += i.first;
kind --;
if (kind <= k) {
mes(r);
re0;
}
}
}
}
| 0
| 43,831,990
|
#include <iostream>
int main(void){
int tmp=0, ans=0;
for (int i=0; i<5; ++i){
int N, rem;
std::cin >> N;
rem = -(N % 10);
if (rem != 0) rem += 10;
if (tmp < rem) tmp = rem;
ans += N + rem;
}
ans -= tmp;
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
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; }
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# define DBG(fmt, ...)
#endif
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
const int MAX_N = 100010;
template <typename T> T gcd(T a, T b) { while (a) { b %= a; swap(a, b); } return b; }
template <typename T> T lcm(T a, T b) { return a / gcd(a,b) * b; }
map<ll, ll> PrimeFactor(ll n) {
map<ll, ll> res;
for(ll i = 2; i * i <= n; ++i) {
while(n % i == 0) {
++res[i];
n /= i;
}
if(LLINF / i <= i) { break; }
}
if(n != 1) { res[n] = 1; }
return res;
}
int N, M;
vector<int> A, B;
signed main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cin >> N >> M;
A.resize(N);
REP(i, N) {
cin >> A[i];
A[i] /= 2;
}
auto Check = [](int num) {
int ret = 0;
while(num % 2 == 0) {
num /= 2;
ret++;
}
return ret;
};
int check = Check(A[0]);
REP(i, N) {
if(check != Check(A[i])) {
printf("0\n");
return 0;
}
A[i] >>= check;
}
M >>= check;
int lcm_a = 1;
REP(i, N) {
lcm_a = lcm(lcm_a, A[i]);
}
int ans = M / lcm_a;
ans = (ans + 1) / 2;
printf("%lld\n", ans);
return 0;
}
| 0
| 29,169,850
|
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int n; cin >> n;
vector<int> a(n), b(n);
map<int, int> mp;
rep(i, n)
{
cin >> a[i];
b[i] = a[i];
}
sort(all(b));
rep(i, n)mp[b[i]] = i;
int cnt = 0;
rep(i, n)
{
if ((i - mp[a[i]]) % 2)++cnt;
}
cout << cnt / 2 << endl;
}
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
ll fac[510000], finv[510000], inv[510000];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 510000; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
int main(){
ll X,A,B;
cin >> X >> A >> B;
if(A >= B){
cout << "delicious" << endl;
return 0;
}
else if(B - A <= X){
cout << "safe" << endl;
return 0;
}
cout << "dangerous" << endl;
}
| 0
| 81,318,103
|
#include <queue>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <map>
#include <stdio.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vint;
typedef vector<string> vstr;
typedef pair<ll, ll> pint;
unsigned long long inf = (1LL << 62);
ll MOD = (ll)pow(10.0, 9.0) + 7;
pint dx[4] = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} };
ll min(ll a, ll b)
{
return (a < b) ? a : b;
}
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll N;
int main() {
cin >> N;
vector<string> S(N);
rep(i, N)
cin >> S[i];
ll ans = 0;
for (int d = 0; d < N; d++) {
if (d != 0) {
string u = S[0];
S.erase(S.begin());
S.push_back(u);
}
bool flag = true;
rep(i, N) {
rep(j, N) {
if (S[i][j] != S[j][i]) { flag = false; break; }
}
}
if (flag == true) {
ans += N;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt[100005];
long long d[100005];
pair<long long, int> p[100005];
vector<int> to[100005];
int ta;
long long tb;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &p[i].first);
p[i].second = i + 1;
cnt[i] = 1;
}
sort(p, p + n);
for (int i = n - 1; i; i--) {
tb = p[i].first - n + 2 * cnt[i];
ta = lower_bound(p, p + i, make_pair(tb, 0)) - p;
if (p[ta].first != tb) {
printf("-1\n");
return 0;
}
d[ta] += d[i] + cnt[i];
to[ta].push_back(i);
cnt[ta] += cnt[i];
}
if (d[0] != p[0].first) {
printf("-1\n");
return 0;
}
for (int i = 0; i < n; i++)
for (int j : to[i])
printf("%d %d\n", p[i].second, p[j].second);
return 0;
}
| 0
| 81,297,751
|
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y) * y;
}
void solve(ll N, vector<ll> T) {
ll ans(1);
REP(i, N)
ans = lcm(max(ans, T[i]), min(ans, T[i]));
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> T(N);
REP(i, N)
cin >> T[i];
solve(N, move(T));
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
if(a.second > b.second) return true;
else return false;
}
int main() {
int n, h;
cin >> n >> h;
vector<pair<int, int>> k(n);
for(int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
k.push_back(make_pair(a, b));
}
sort(k.begin(), k.end(), cmp);
pair<int, int> amaxpair = *max_element(k.begin(), k.end());
int amax = amaxpair.first;
int damage = 0;
int ans = 0;
for(int i = 0; i < n; i++) {
if(k[i].second > amax) {
damage += k[i].second;
ans++;
}
else break;
if(damage >= h) break;
}
if(damage >= h) {
cout << ans << endl;
} else {
ans += (h - damage + amax - 1) / amax;
cout << ans << endl;
}
return 0;
}
| 0
| 10,200,682
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1001001001;
const ll LONGINF = 1001001001001001LL;
const ll MOD = 1000000007LL;
const double PI = acos(-1);
const double EPS = 1e-9;
int main() {
int N; cin >> N;
vector< pair<int, int> > points(N);
for(int i=0; i<N; i++) {
int x, y; cin >> x >> y;
points[i] = make_pair(x, y);
}
sort(points.begin(), points.end(), [](auto a, auto b) {
double ra = atan2(a.second, a.first);
double rb = atan2(b.second, b.first);
return ra < rb;
});
double ans = 0;
for(int i=0; i<N; i++) {
double x = 0, y = 0;
for(int l=0; l<N; l++) {
int k = (i + l) % N;
x += points[k].first, y += points[k].second;
ans = max(ans, sqrt(x*x + y*y));
}
}
printf("%.12f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define vvp vector<vector<pair<int,int>>>
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vector<ll>>;
#define all(v) v.begin(),v.end()
#define output_s(a) printf("%s\n",(a).c_str())
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define RepS(i,n,m) for(int i=(int)(n);i<=(int)(m);i++)
#define RRepS(i,n,m) for(int i=(int)(n);i>=(int)(m);i--)
#define RepA(x) for(auto &item:(x))
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
template<typename TypeInt>
TypeInt GCD(TypeInt a,TypeInt b){
if(a%b==0) return b;
else return GCD(b,a%b);
}
template<typename TypeInt>
TypeInt LCM(TypeInt a,TypeInt b){
return a*b/GCD(a,b);
}
int IN_int(){
int x;
scanf("%d",&x);
return x;
}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const int NMAX = 200;
bool flag;
bool comp(int x,int y){
return abs(0-x)<abs(0-y);
}
signed main(){
CIN(N,M,R);
Graph G(N,vector<ll>(N,INF));
vi r(R);
rep(i,R)cin>>r[i];
rep(i,N)G[i][i]=0;
rep(i,M){
int from,to,dis;
cin>>from>>to>>dis;
G[from-1][to-1]=dis;
G[to-1][from-1]=dis;
}
ll ans=INF;
sort(all(r));
rep(i,N){
rep(j,N){
rep(k,N){
G[j][k]=min(G[j][k],G[j][i]+G[i][k]);
}
}
}
do
{
ll cls=0;
rep(i,R-1){
cls+=G[r[i]-1][r[i+1]-1];
}
ans=min(ans,cls);
} while (next_permutation(all(r)));
printf("%lld\n",ans);
return 0;
}
| 0
| 52,036,141
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.