code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, res = 0, max = 0;;
cin >> N;
for (int i = 1; i <= N; i++) {
int tmp = i;
int cnt = 0;
while (tmp % 2 == 0) {
tmp /= 2;
cnt++;
}
if (max <= cnt) {
max = cnt;
res = i;
}
}
cout << res << endl;
}
|
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(0, 1); \
auto rnd = bind(__dis, __gen);
const int INF = 1E18;
const int mod = 1E9 + 7;
int32_t main() {
int n, a, b;
cin >> n >> a >> b;
cout << (((a^b)&1) ? "Borys" : "Alice") << "\n";
return 0;
}
| 0
| 51,249,246
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<int,int>
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
const ll MOD=1e9+7,MAX=5e5+5;
int n,k;
int add(int x, int y)
{
x += y;
while(x >= MOD)
x -= MOD;
while(x < 0)
x += MOD;
return x;
}
int mult(int x, int y)
{
return (1LL * x * y) % MOD;
}
int power(int base, int exp)
{
int ret = 1;
for (; exp; exp >>= 1, base = mult(base, base))
if (exp&1)
ret = mult(ret, base);
return ret;
}
void fast();
int main()
{
fast();
cin>>n>>k;
ll ans[k+1]={},res=0;
for(ll i=k;i>=1;i--){
ll x=power(k/i,n);
ans[i]=add(ans[i],x);
x=ans[i];
for(ll j=2;j*j<=i;j++){
if(i%j==0){
ans[j]=add(ans[j],-x);
if(i/j!=j)
ans[i/j]=add(ans[i/j],-x);
}
}
if(i!=1)
ans[1]=add(ans[1],-x);
res=add(res,mult(ans[i],i));
}
cout<<res;
}
void fast(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
|
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
ll n,sum1=0,sum2=0;
cin >> n;
vector<vector<ll>> v(n,vector<ll>(3,0));
vector<ll> v2(n);
r(i,n)cin >> v[i][1];
r(i,n){
cin >> v[i][2];
v[i][0]=v[i][1]-v[i][2];
sum1+=v[i][1]; sum2+=v[i][2];
}
if(sum1<sum2)cout<<-1<<endl;
else{
sort(v.begin(),v.end());
r(i,n)v2[i]=v[i][0];
ll i=0,j=n-1;
while(v[i][0]<0){
if(v[j][0]+v[i][0]<0){
v[i][0]+=v[j][0];
v[j][0]=0;
}
else {
v[j][0]+=v[i][0];
v[i][0]=0;
}
if(v[j][0]==0)j--;
if(v[i][0]>=0)i++;
}
ll ans=0;
r(i,n)if(v[i][0]!=v2[i])ans++;
cout<<ans<<endl;
}
}
| 0
| 5,098,905
|
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <tuple>
#include <map>
#include <ctime>
#include <cstdlib>
#include <random>
#include <unistd.h>
using namespace std;
#define int long long
signed main(){
char a;
cin >> a;
if(a <= 'Z')cout << "A" << endl;
else cout << "a" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int INF = 1000000001;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
rep(i, n) {
scanf("%d", &h[i]);
}
int cnt = 0, max_c = 0;
rep(i, n-1) {
if (h[i] >= h[i+1]) {
cnt++;
max_c = max(max_c, cnt);
} else {
cnt = 0;
}
}
printf("%d\n", max_c);
}
| 0
| 16,109,682
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
#define mod 1000000007
#define inf 2147483647
#define range(x,a,b) (a)<=x&&x<=(b)
int main(){
int n,k;
cin>>n>>k;
int p[n];
in(p,n);
sort(p,p+n);
int sum=0;
rep(i,k)sum+=p[i];
cout<<sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2005;
const ll MOD = 1e9 + 7;
int n, m;
ll dp[N][N];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
vector<int> a(n), b(m);
for (auto& i : a) cin >> i;
for (auto& i : b) cin >> i;
rep(i, 0, N) {
dp[0][i] = 1;
dp[i][0] = 1;
}
rep(i, 1, n + 1) {
rep(j, 1, m + 1) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = (2 * dp[i - 1][j - 1]) % MOD + (dp[i - 1][j] + dp[i][j - 1] - 2 * dp[i - 1][j - 1]);
if (dp[i][j] < 0) dp[i][j] += MOD;
dp[i][j] %= MOD;
} else {
dp[i][j] = ((dp[i - 1][j] + dp[i][j - 1]) % MOD - dp[i - 1][j - 1] + MOD) % MOD;
if (dp[i][j] < 0) dp[i][j] += MOD;
dp[i][j] %= MOD;
}
}
}
cout << dp[n][m];
}
| 0
| 29,123,387
|
#include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)
template<typename T> bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int n, a[100];
bool ask(LL v) {
string s;
cout << "? " << v << endl;
cin >> s;
return (s == "Y");
}
void ans(LL v) {
cout << "! " << v << endl;
exit(0);
}
LL ex(LL x, LL y) {
return (y == 0 ? 1 : x * ex(x, y - 1));
}
int main() {
int e = -1;
inc(i, 10) {
if(! ask(ex(10, i))) { e = i; break; }
}
if(e == -1) {
inc(i, 10) {
if(ask(2 * ex(10, i))) { ans(ex(10, i)); }
}
}
LL L = ex(10, e - 1), H = ex(10, e);
while(H - L > 1) {
LL M = (L + H) / 2;
(ask(M * 10) ? H : L) = M;
}
ans(H);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>adj[8];
bool marked[8];
int n=8,m=28;
int dfs(int s,int c)
{
marked[s]=true;
if(c+1==n){
return 1;
}
int sum=0;
for(auto x : adj[s])
{
if(!marked[x]){
sum += dfs(x,c+1);
marked[x]=false;}
}
return sum;
}
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
a--;b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i=0;i<n;i++)
marked[i]=false;
cout<<dfs(0,0)<<"\n";
}
| 0
| 67,019,076
|
#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>
#include<stdio.h>
#include <cstdint>
#include <stdlib.h>
#include <time.h>
using namespace std;
#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,n) REP(i,1,n+1)
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define RNG(x, a, n) &((x)[a]), &((x)[n])
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> PII;
typedef vector<ll> Vl;
typedef vector<int> VI;
typedef tuple<int, int, int> TT;
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define dmt(x, y, z) make_tuple(x, y, z)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
const int MAX = 5100000;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const ll longinf = 1LL << 60;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int v, e;
int h[100005];
VI vec[100005];
VI ans;
int main() {
cin >> v >> e;
rep(i, e) {
int a, b;
cin >> a >> b;
vec[a].pb(b);
h[b]++;
}
queue <int> q;
rep(i, v) {
if (h[i] == 0) q.push(i);
}
while (!q.empty()) {
int tmp = q.front();
q.pop();
ans.push_back(tmp);
rep(i, vec[tmp].size()) {
h[vec[tmp][i]]--;
if (h[vec[tmp][i]] == 0)q.push(vec[tmp][i]);
}
}
rep(i, ans.size())cout << ans[i] << endl;
return 0;
}
|
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int NMAX = 10000;
void PrintArray(int* A, int N)
{
cout << A[0];
for (int k = 1; k < N;k++) {
cout << " " << A[k] ;
}
cout << endl;
}
void Swap(int& a, int &b) {
int tmpA, tmpB;
tmpA = a;
tmpB = b;
a = tmpB;
b = tmpA;
}
int selectionSort(int* A, int N){
int count = 0;
for (int i = 0; i < N - 1; i++){
int minj = i;
for (int j = i+1; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
Swap(A[i], A[minj]);
if (i != minj) {
count += 1;
}
}
return count;
}
int main()
{
int n;
cin >> n;
int x;
int array[NMAX];
for (int i = 0; i < n; i++) {
cin >> x;
array[i] = x;
}
int times;
times = selectionSort(array, n);
PrintArray(array,n);
cout << times << endl;
return 0;
}
| 0
| 54,089,339
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const string col[2] = {"RB", "GY"};
int H, W, d;
char hoge[1005][1005];
char ans[505][505];
void solve1() {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (i % 2 == 0 && j % 2 == 0) ans[i][j] = 'R';
else if (i % 2 == 1 && j % 2 == 0) ans[i][j] = 'G';
else if (i % 2 == 0 && j % 2 == 1) ans[i][j] = 'Y';
else ans[i][j] = 'R';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W >> d;
int n = H + W - 1;
for (int i = 0; i < n; i += d) {
for (int j = 0; j < n; j += d) {
for (int k = 0; k < d; k++) {
for (int l = 0; l < d; l++) {
if (i + k >= n || j + l >= n) continue;
hoge[i + k][j + l] = col[i / d % 2][j / d % 2];
}
}
}
}
int geta = W - 1;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
ans[i][j] = hoge[i + j][i - j + geta];
cout << ans[i][j];
}
cout << endl;
}
return 0;
}
|
#include<iostream>
#include<set>
using namespace std;
int main()
{
ios::sync_with_stdio( false );
int n;
cin>>n;
set< string > dict;
string cmd, key;
for( int i=0; i<n; i++ ) {
cin>>cmd>>key;
if( "insert" == cmd ) {
dict.insert( key );
} else {
if( dict.end() != dict.find( key ) ) {
cout<<"yes\n";
} else {
cout<<"no\n";
}
}
}
return 0;
}
| 0
| 68,169,228
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll ,ll> pll;
typedef pair<ld,ld> pld;
typedef unordered_map<ll,ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5+7;
const ll MAX7 = 1e+7+7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9+7;
const ll N = 2*1e6;
ll T=1;
ll n,x,y,m;
string s,t;
void MAIN() {
cin>>s;
s[5] = ' ';
s[13]= ' ';
cout<<s;
}
int main() {
fastio;randomINT;
while(T--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
string ans="EQUAL";
if(a.length()>b.length()) ans="GREATER";
else if(a.length()<b.length()) ans="LESS";
else if(a.length()==b.length()){
int n=a.length();
for(int i=0; i<n; i++){
if(a.at(i)-'0'>b.at(i)-'0'){
ans="GREATER";
break;
}
else if(a.at(i)-'0'<b.at(i)-'0'){
ans="LESS";
break;
}
}
}
cout << ans << endl;
}
| 0
| 99,700,858
|
#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;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
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;
}
}
int main(){
string K = "keyence";
string S;
cin >> S;
ll s = S.size();
ll left = 0;
rep(i,7){
if(S.substr(0,i + 1) == K.substr(0,i + 1))left = i + 1;
}
ll right = 0;
rep(i,7){
if(S.substr(s - 1 - i,i + 1) == K.substr(6 - i,i + 1))right = i + 1;
}
if(left + right >= 7)cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define REP(i,n) for (int i = 0; i < n; i++)
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
int N;
int A[300010];
ll acc[300010];
ll acc2[300010];
ll ans[300010];
int main ()
{
cin >> N;
REP(i,N) cin >> A[i];
map < int,int > cnt;
REP(i,N) cnt[A[i]]++;
for (auto &a : cnt) {
acc[a.second]++;
acc2[a.second]++;
}
REP(i,300005) {
acc[i] *= (ll)i;
}
REP(i,300005) {
acc[i + 1] = acc[i] + acc[i + 1];
acc2[i + 1] = acc2[i] + acc2[i + 1];
}
for (ll i = 1; i <= N; i++) {
ans[i] = acc[i] + (acc2[N] - acc2[i]) * i;
ans[i] /= i;
}
for (ll K = 1; K <= N; K++) {
ll l = 0, r = N + 1;
while (r - l > 1) {
ll mid = (r + l) / 2;
if (K <= ans[mid]) {
l = mid;
} else {
r = mid;
}
}
cout << l << endl;
}
return 0;
}
| 0
| 90,593,992
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int max, min, sum,n,x,ans;
while(true){
cin>>n;
if(n!=0){
cin>>x;
max=x;
min=x;
sum=x;
for(int i=1;i<n;i++){
cin>>x;
sum+=x;
if(max<x){
max=x;
}
if(min>x){
min=x;
}
}
ans=(sum-min-max)/(n-2);
cout<<ans<<endl;
}else{
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, x, y; scanf("%d %d %d %d", &n, &k, &x, &y);
if (n <= k) printf("%d", x * n);
else {
int cost = k * x;
printf("%d", cost + (n - k) * y);
}
return 0;
}
| 0
| 32,414,227
|
#include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for(int i=a; i<b; i++)
#define mem(arr, val) memset(arr, val, sizeof(arr))
#define MOD 1000000007
#define INF 1000000001
#define epsilon 1e-15
typedef long long int ll;
typedef unsigned long long int ull;
int gcd(int a, int b){
if(b==0) return a;
return gcd(b, a%b);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int A, B, C, K, ops=0;
cin >> A >> B >> C >> K;
while(B<=A){
B *= 2;
ops++;
}
while(C<=B){
C *= 2;
ops++;
}
if(ops > K) cout << "No\n";
else cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
template<class T> struct edge { int to; T cost;};
int main() {
int N; cin >>N;
map<int,int> fact;
for (int i=2; i<=N; i++){
int tmp = i;
for (int factor=2; factor<100; factor++){
while (tmp % factor == 0){
fact[factor]++;
tmp /= factor;
}
if (tmp == 1) break;
}
}
map<int,int> exponent;
for (auto p : fact){
int k = p.first;
int v = p.second;
if (v >= 2) exponent[2]++;
if (v >= 4) exponent[4]++;
if (v >= 14) exponent[14]++;
if (v >= 24) exponent[24]++;
if (v >= 74) exponent[74]++;
}
int res = 0;
res += exponent[74];
res += exponent[14] * (exponent[4]-1);
res += exponent[24] * (exponent[2]-1);
res += exponent[4] * (exponent[4] - 1) / 2 * (exponent[2] - 2);
cout <<res <<endl;
}
| 0
| 1,254,452
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 510;
int n;
int c[N], s[N], f[N], ans[N];
int main() {
cin >> n;
for (int i = 0; i < n - 1; ++i) {
cin >> c[i] >> s[i] >> f[i];
}
for (int i = 0; i < n - 1; ++i) {
int j = i;
int t = 0;
while (j < n - 1) {
if (t <= s[j])
t = s[j] + c[j];
else {
int d = t % f[j];
if (d)
t += f[j] - d;
t += c[j];
}
++j;
}
cout << t << endl;
}
cout << 0 << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define PI 3.141592
int main(void){
long double x1, x2, x3, x4, y1, y2, y3, y4, tilt_a, tilt_b;
int n;
cin >> n;
for(int i=0; i<n; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if(x1 == x2){
if(x3 == x4) cout << "YES" << endl;
else cout << "NO" << endl;
}
else{
tilt_a = (y2-y1)/(x2-x1);
tilt_b = (y4-y3)/(x4-x3);
if(tilt_a == tilt_b){
cout << "YES" << endl;
}
else cout << "NO" << endl;
}
}
return 0;
}
| 0
| 31,228,432
|
#include <bits/stdc++.h>
using namespace std;
vector<int> finalpos;
long long initpos[100005];
long long finpos[100005];
bool clockwise[100005];
long long finalans[100005];
long long n,l,T;
int main(){
scanf("%lld%lld%lld",&n,&l,&T);
for (int x = 0; x<n; x++){
int t;
scanf("%lld%d",&initpos[x],&t);
clockwise[x]= (t==1);
}
for (int x = 0; x<n; x++){
finalpos.push_back(((initpos[x]+(clockwise[x]?T:(-T)))+T*l)%l);
finpos[x] = finalpos[x];
}
sort(finalpos.begin(),finalpos.end());
int finalnum = 0;
for (int x = 1; x<n; x++){
if (clockwise[0]&&!clockwise[x]) {
finalnum += 2*(T/l);
int dist1 = initpos[x]-initpos[0];
int dist2 = dist1+l;
if ((T%l)*2<=dist1) ;
else if ((T%l)*2<=dist2) finalnum++;
else finalnum += 2;
}
if (clockwise[x]&&!clockwise[0]){
finalnum -= 2*(T/l);
int dist1 = initpos[0]+l-initpos[x];
int dist2 = dist1+l;
if ((T%l)*2<dist1) ;
else if ((T%l)*2<dist2) finalnum--;
else finalnum -= 2;
}
finalnum%=n;
}
finalnum+=n;
finalnum%=n;
int t = lower_bound(finalpos.begin(),finalpos.end(),finpos[0])-finalpos.begin();
finalans[finalnum] = finalpos[t];
for (int x = 1; x<n; x++){
finalans[(finalnum+x)%n] = finalpos[(t+x)%n];
}
for (int x = 0; x<n; x++){
printf("%d\n",finalans[x]);
}
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i< (int)(b); ++i)
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
typedef long double ld;
using ll=long long;
using namespace std;
const int mod=1e9+7;
const ld pi = (acos(-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 (b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n,m,k; cin >> n >> m >> k;
rep(j,0,n+1) {
rep(i,0,m+1) {
int res=i*(n-j)+j*(m-i);
if(res==k){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 32,802,423
|
#include <iostream>
using namespace std;
int main(){
int m,f,r;
while(1){
cin>>m>>f>>r;
if(m==-1 && f==-1 && r==-1) break;
else if(m==-1 || f==-1) cout<<"F"<<endl;
else if(m+f>=80) cout<<"A"<<endl;
else if(m+f<80 && m+f>=65) cout<<"B"<<endl;
else if(m+f<65 && m+f>=50) cout<<"C"<<endl;
else if(m+f<50 && m+f>=30 && r<50) cout<<"D"<<endl;
else if(m+f<50 && m+f>=30 && r>=50) cout<<"C"<<endl;
else cout<<"F"<<endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 1010
using namespace std;
int n, m;
long long x[N], y[N], p[50];
int main() {
#ifdef isLOCAL
freopen("work.in", "r", stdin);
freopen("work.out", "w", stdout);
#endif
cin >> n, m = 35;
for (int i = 1; i <= n; ++i) {
scanf("%lld%lld", x + i, y + i);
if (i > 1 && ((x[i] + y[i] + x[i - 1] + y[i - 1]) & 1))
return puts("-1"), 0;
}
for (int i = 0; i < m; ++i)
p[i] = (1ll << i);
reverse(p, p + m);
if ((x[1] + y[1]) % 2 == 0) p[m++] = 1;
cout << m << endl;
for (int i = 0; i < m; ++i)
cout << p[i] << " "; cout << endl;
for (int k = 1; k <= n; ++k) {
for (int i = 0; i < m; ++i)
if (abs(x[k]) > abs(y[k]))
x[k] += (x[k] < 0 ? (putchar('L'), 1) : (putchar('R'), -1)) * p[i];
else y[k] += (y[k] < 0 ? (putchar('D'), 1) : (putchar('U'), -1)) * p[i];
puts("");
}
return 0;
}
| 0
| 1,520,309
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
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) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() {
int n, m;
cin >> n >> m;
V cnt(n, 0);
rep(i, m) {
int a, b;
cin >> a >> b;
a--, b--;
cnt[a] ^= 1;
cnt[b] ^= 1;
}
bool valid = true;
rep(i, n) {
if (cnt[i] != 0) valid = false;
}
puts(valid ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = (1LL<<32);
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
ll n, m, k, ans = 0, sum = 0, cnt = 0;
string s;
char c;
#define Endl endl
static const int MAX = 100;
ll d[MAX][MAX];
void floyd()
{
REP(k, n)
{
REP(i, n)
{
if (d[i][k] == INF)
{
continue;
}
REP(j, n)
{
if (d[k][j] == INF)
{
continue;
}
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
int main()
{
ll e, u, v, c;
cin >> n >> e;
REP(i, n)
{
REP(j, n)
{
d[i][j] = ((i == j) ? 0 : INF);
}
}
REP(i, e)
{
cin >> u >> v >> c;
d[u][v] = c;
}
floyd();
bool negative = false;
REP(i, n)
{
if (d[i][i] < 0)
{
negative = true;
}
}
if (negative)
{
cout << "NEGATIVE CYCLE" << endl;
}
else
{
REP(i, n)
{
REP(j, n)
{
if (j)
{
cout << " ";
}
if (d[i][j] == INF)
{
cout << "INF";
}
else
{
cout << d[i][j];
}
}
cout << endl;
}
}
}
| 0
| 34,646,798
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
string T;
cin >> T;
T = T.substr(0, sz(T) - 1);
bool bl = S == T;
puts(bl ? "Yes" : "No");
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double ld;
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define no {cout << -1; return;}
void solve() {
int m, k;
cin >> m >> k;
if (m == 1) {
if (k == 0)
cout << "1 1 0 0";
else
cout << -1;
return;
}
if (k > (1 << m) - 1)
no;
loop(i, (1 << m))
if (i != k)
cout << i << " ";
cout << k << " ";
for (int i = (1 << m) - 1; i >= 0; --i)
if (i != k)
cout << i << " ";
cout << k;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 73,982,751
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
ll lucas[100];
int main() {
int n;
cin >> n;
lucas[0] = 2;
lucas[1] = 1;
for (int i = 2; i <= n; i++)
{
lucas[i] = lucas[i-1] + lucas[i-2];
}
cout << lucas[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
ll M = 998244353;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
for(int i=0; i<n; i++){
res *= a;
res %= mod;
}
return res;
}
int main(){
ll N; cin >> N;
vll d(N+1);
for(int i=1; i<N+1; i++){
cin >> d[i];
}
vll num(N, 0);
for(int i=1; i<N+1; i++){
num[d[i]]++;
}
if(d[1]!=0||num[0]>1){
cout << 0;
}else{
bool t = true;
for(int i=1; i<N-1; i++){
if(num[i]==0&&num[i+1]>0){
t = false;
}
}
if(t == false){
cout << 0;
}else{
ll p = 1;
for(int i=1; i<N; i++){
if(num[i]==0){
break;
}else{
ll m = modpow(num[i-1], num[i], M);
p *= m;
p %= M;
}
}
cout << p;
}
}
}
| 0
| 13,147,843
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
{
return a;
}
return gcd(b, a%b);
}
int main() {
int n, x;
cin >> n >> x;
vector<int> x_s(n);
for (auto i = 0; i < n; i++)
{
cin >> x_s[i];
}
vector<int> sub(n);
for (auto i = 0; i < n; i++)
{
sub[i] = abs(x_s[i] - x);
}
int ans;
for (auto i = 0; i < n; i++)
{
if (i==0) {
ans = sub[i];
}
else
{
ans = gcd(ans, sub[i]);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int n,k;
cin>>n>>k;
vin a(n);
int M=0;
rep(i,0,n){
cin>>a[i];
chmax(M,a[i]);
}
if(M<k){
cout<<"IMPOSSIBLE"<<endl;
return 0;
}
int g=a[0];
rep(i,0,n-1){
int h=__gcd(a[i],a[i+1]);
if(h==0){
chmin(g,a[i+1]);
}
else{
chmin(g,h);
}
}
if(k%g==0)cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
}
| 0
| 34,045,095
|
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%MOD;
x>>=1;
}
return ans;
}
int gyaku(int n){
return modpow(n,MOD-2);
}
signed main() {
int k,s;
cin>>k>>s;
int ans=0;
rep(i,k+1){
rep(j,k+1){
if(s-i-j>=0&&s-i-j<=k)ans++;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
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 n;
int main() {
cin >> n;
if(n%2 != 0) cout << 0 << endl;
else {
ll now = 10;
ll cnt = 0;
while(now <= n) {
cnt += (n/now);
now *= 5;
}
cout << cnt << endl;
}
}
| 0
| 61,285,329
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[1001][1001];
int main()
{
string s,t;
cin >> s >> t;
int n = s.size(),m = t.size();
for(int i = 0;i<n+1;i++)
{
dp[i][0] = i;
}
for(int i = 0;i<m+1;i++)
{
dp[0][i] = i;
}
for(int i = 1;i<n+1;i++)
{
for(int j = 1;j<m+1;j++)
{
int cost = s[i-1]!=t[j-1];
dp[i][j] = min({dp[i-1][j]+1,dp[i][j-1]+1,dp[i-1][j-1]+cost});
}
}
cout<<dp[n][m]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<string, int> s;
for (int i = 0; i < n; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = 1;
} else {
s[tmp] ++;
}
}
int m; cin >> m;
for (int i = 0; i < m; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = -1;
} else {
s[tmp] --;
}
}
int max = -101;
for (map<string, int>::iterator itr = s.begin(); itr != s.end(); ++itr) {
if(itr->second > max) {
max = itr->second;
}
}
if (max < 1) {
cout << 0 << endl;
} else {
cout << max << endl;
}
return 0;
}
| 0
| 50,501,758
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin>>a;
if(a=='a'||a=='i'||a=='u'||a=='e'||a=='o'){
cout<<"vowel"<<endl;
}
else{
cout<<"consonant"<<endl;
}
}
|
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
const int dx[4]={ 1,0,-1,0 };
const int dy[4]={ 0,1,0,-1 };
int N, Z, W;
int A[2005];
int dp[2005][2];
int solve(int n, int t){
if(dp[n][t] != -1) return dp[n][t];
if(t == 0){
int ret = abs(A[n-1] - A[N]);
for(int i=n; i<N; i++){
ret = max(ret, solve(i+1, t^1));
}
return dp[n][t] = ret;
}
else{
int ret = abs(A[n-1] - A[N]);
for(int i=n; i<N; i++){
ret = min(ret, solve(i+1, t^1));
}
return dp[n][t] = ret;
}
}
signed main(){
cin >> N >> Z >> W;
A[0] = W;
rep(i, N) cin >> A[i+1];
memset(dp, -1, sizeof(dp));
cout << solve(1, 0) << endl;
}
| 0
| 44,191,748
|
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include<memory>
#include<cmath>
#include<stack>
#include<tuple>
#include<numeric>
#include<cassert>
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back
#define DEBUG false
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<int,ll>;
using Pd = pair<double,double>;
using T = tuple<double,double,int>;
const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll LINF=1LL<<60;
const int MAX_N = 8003;
const ll lmod = 1e9+7;
int cnt[2][MAX_N];
bool dp[4][MAX_N];
int main(){
string S; int N,x,y,a;
cin >> S >> x >> y ;
N = S.length();
S = S + "T";
a = 0;
while(S[a]=='F') a++;
x -= a;
fill(dp[0],dp[0]+MAX_N*4,false);
int cnt = 0, flag = 0;
dp[0][0] = dp[1][0] = dp[2][0] = dp[3][0] = true;
int xprev = 0 ,xnow = 1 ,yprev = 2 ,ynow = 3;
REP(i,a,N+1){
if(S[i]=='F') cnt++;
else{
if(cnt!=0){
int now,prev;
if(!flag) prev = xprev, now = xnow, swap(xprev,xnow);
else prev = yprev, now = ynow, swap(yprev,ynow);
fill(dp[now],dp[now]+N,false);
rep(i,N+1){
if(i+cnt<MAX_N) dp[now][i+cnt] |= dp[prev][i];
dp[now][abs(i-cnt)] |= dp[prev][i];
}
}
cnt = 0;
(flag += 1) %= 2;
}
}
cout << (((dp[xprev][abs(x)] && dp[yprev][abs(y)])) ? "Yes" : "No") << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int DP[1001][1001];
int main(){
int T;
cin >> T;
for (int t = 0; t < T; t++) {
char X[1002],Y[1002];
scanf("%s%s",X,Y);
int y = strlen(Y);
int x = strlen(X);
for (int i = 0; i <= y; i++) DP[i][0] = 0;
for (int i = 0; i <= x; i++) DP[0][i] = 0;
for (int r = 1; r <= y; r++) {
for (int c = 1; c <= x; c++) {
if (Y[r-1] == X[c-1]) DP[r][c] = DP[r-1][c-1]+1;
else DP[r][c] = max(DP[r-1][c],DP[r][c-1]);
}
}
cout << DP[y][x] << endl;
}
return 0;
}
| 0
| 21,911,967
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i++){
int b;
cin >> b;
b--;
a.at(i) = b;
}
int nwbt = 0;
int cnt = 0;
while(true){
if(nwbt == 1){
cout << cnt << endl;
break;
}
if(cnt >= N){
cout << -1 << endl;
break;
}
nwbt = a.at(nwbt);
cnt++;
}
}
|
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll N;
cin >> N;
ll sumA=0;
ll sumB=0;
vector<ll> A(N);
REP(i, N){
cin >> A[i];
sumA+=A[i];
}
vector<ll> B(N);
REP(i, N){
cin >> B[i];
sumB+=B[i];
}
if(sumB<sumA){
cout << "No" << endl;
}else{
ll xA = sumB-sumA;
ll xB = sumB-sumA;
REP(i,N){
if(A[i]>B[i]){
xB-=A[i]-B[i];
}else if(A[i]<B[i]){
if((B[i]-A[i])%2==0){
xA-=(B[i]-A[i])/2;
}else{
xA-=(B[i]-A[i])/2+1;
}
xB-=(B[i]-A[i])%2;
}
}
if(xA*2==xB&&xA>=0&&xB>=0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
}
| 0
| 47,205,993
|
#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
#define endl '\n'
void solve() {
int n ;
cin >> n ;
int ans = 0 ;
vector<int> v(2 * n) ;
for (auto &x : v) cin >> x ;
sort(v.begin(), v.end()) ;
for (int i = 0 ; i < 2 * n ; i += 2) {
ans += v[i] ;
}
cout << ans << endl ;
}
int32_t main()
{
fast ;
int testcases = 1 ;
while(testcases--) {
solve() ;
}
return 0 ;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vector<int> v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
char s;
cin >> s;
if(s=='A')
cout << 'T';
else if(s=='T')
cout << 'A';
else if(s=='G')
cout <<'C';
else
cout << 'G';
cout << endl;
}
| 0
| 75,071,445
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t n, l;
cin >> n >> l;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
int f = -1;
for (int i = 0; i < n - 1; i++){
if (A[i] + A[i + 1] >= l){
f = i + 1;
}
}
if (f == -1){
puts("Impossible");
return 0;
}
puts("Possible");
for (int i = 1; i < f; i++)
cout << i << endl;
for (int i = n - 1; i >= f; i--)
cout << i << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
vector<ll> L;
ll getP(int N, ll X) {
if (N == 0) {
if (X > 0) {
return 1;
} else {
return 0;
}
}
if (X <= 0) {
return 0;
} else if (X >= L[N]) {
return 1 + 2 * getP(N - 1, L[N - 1]);
} else if (X >= L[N - 1] + 2) {
return getP(N - 1, L[N - 1]) + 1 + getP(N - 1, X - 2 - L[N - 1]);
} else if (X >= 1) {
return getP(N - 1, X - 1);
}
}
int main() {
int N;
ll X;
cin >> N >> X;
L.resize(N + 1);
L[0] = 1;
for (int i = 1; i <= N; i++) {
L[i] = 2 * L[i - 1] + 3;
}
cout << getP(N, X) << endl;
}
| 0
| 59,227,756
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
struct edge {
int from;
int to;
int cost;
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned Euclidean_gcd(unsigned a, unsigned b) {
if(a < b) return Euclidean_gcd(b, a);
unsigned r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int digit_sum(int n) {
int sum=n%10;
while(n!=0) {
n/=10;
sum+=n%10;
}
return sum;
}
vpll PrimeFactorization(ll n) {
vpll res;
for (ll i=2; i*i<=n; i++) {
if(n%i!=0) continue;
ll ex=0;
while(n%i==0) {
ex++;
n/=i;
}
res.push_back(pll(i,ex));
}
if(n!=1) res.push_back(pll(n,1));
return res;
}
int main() {
char s[100001];
cin >> s;
int n=strlen(s);
string ans="";
REP(i,n) {
if(i%2==0) ans+=s[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int n;
cin >> n;
vector<int> p(n);
REP(i, n) { cin >> p[i]; }
vector<int> a(n), b(n);
int maxi = 40000;
REP(i, n) {
a[i] = maxi * (i + 1);
b[i] = maxi * (n - i - 1) + 1;
}
REP(i, n) { a[p[i] - 1] += i; }
print(a);
print(b);
return 0;
}
| 0
| 36,844,159
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if(s.at(0) == 'R' && s.at(1) == 'R' && s.at(2) == 'R') {
cout << 3 << endl;
}
else if((s.at(0) == 'R' && s.at(1) == 'R') || (s.at(1) == 'R' && s.at(2) == 'R')) {
cout << 2 << endl;
}
else if(s.at(0) == 'R' || s.at(1) == 'R' || s.at(2) == 'R') {
cout << 1 << endl;
}
else {
cout << 0 << endl;
}
}
| 0
| 63,663,181
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
string a,b,c;
cin >> a >> b >> c;
if(a[a.size()-1] == b[0] && b[b.size()-1] == c[0]){
cout << "YES" << "\n";
}else{
cout << "NO"<< "\n";
}
}
|
#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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
int d[n];
rep(i,n){
cin>>d[i];
}
int ans=0;
rep(i,n){
for(int j=i;j<n;j++){
ans=ans+d[i]*d[j];
}
}
rep(i,n){
ans=ans-d[i]*d[i];
}
cout<<ans<<endl;
return 0;
}
| 0
| 9,729,006
|
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
vector<ll> s(n + 1);
for (int i = 0; i < n; ++i) {
ll a;
cin >> a;
s[i + 1] = s[i] + a;
}
vector<ll> x;
for (int l = 1; l <= n; ++l) for (int r = l; r <= n; ++r) {
x.push_back(s[r] - s[l - 1]);
}
ll result = 0;
for (ll b = 40; b >= 0; --b) {
ll cur = 1LL << b;
vector<ll> y;
for (ll t : x) if (t & cur) y.push_back(t);
if (y.size() >= k) {
result |= cur;
x = y;
}
}
cout << result << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
REP(i,v.size()){if(i)os<<" ";os<<v[i];}return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
REP(i,v.size()){if(i)os<<endl;os<<v[i];}return os;}
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int,int>
#define Sort(v) sort(v.begin(),v.end())
#define Reverse(v) reverse(v.begin(),v.end())
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
const int md = 1000000007;
const int INF = 1<<30;
class UnionFind{
private:
vi par,rank;
public:
explicit UnionFind(int n){
par.resize(n);
rank.resize(n);
rep(i,n) par[i] = i;
}
int root(int x){
return x == par[x] ? x : par[x] = root(par[x]);
}
void unite(int x, int y){
x = root(x);
y = root(y);
if(x == y) return;
if(rank[x] > rank[y]) swap(x,y);
par[x] = y;
if(rank[x] == rank[y]) rank[x]++;
}
bool same(int x, int y){
return root(x) == root(y);
}
};
int main(){
int n; cin >> n;
UnionFind u(n);
int q; cin >> q;
rep(i,q){
int c; cin >> c;
int x,y; cin >> x >> y;
if(c == 0){
u.unite(x,y);
}else{
cout << u.same(x,y) << endl;
}
}
}
| 0
| 21,771,582
|
#include <bits/stdc++.h>
using namespace std;
#define tani_nachi_ke ios_base::sync_with_stdio(false); cin.tie(NULL);
#define M_PI 3.14159265358979323846
#define data data_
#define ff first
#define ss second
#define pb push_back
#define ld long double
#define int long long
#define print(t) cout << "Case #" << t << ": ";
int32_t main()
{
tani_nachi_ke
int ans = 0;
int n;
cin >> n;
for(int i = 0; i < n-1; i++)
{
int u,v;
cin >> u >> v;
if(u > v)
swap(u,v);
ans -= u * (n - v + 1);
}
for(int i = 1; i <= n; i++)
{
ans += i*(n-i+1);
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 51;
int mp[MAX_N][MAX_N];
ll X[MAX_N], Y[MAX_N];
pair<ll, ll> dot[MAX_N];
int N, K;
int minmp(int i, int j) {
if(i >= 0 && j >= 0) return mp[i][j];
else return 0;
}
int main()
{
cin >> N >> K;
for(int i = 0; i < N; ++i) {
cin >> dot[i].first >> dot[i].second;
X[i] = dot[i].first, Y[i] = dot[i].second;
}
sort(X, X + N);
sort(Y, Y + N);
for(int i = 0; i < N; ++i) {
int nx = lower_bound(X, X + N, dot[i].first) - X;
int ny = lower_bound(Y, Y + N, dot[i].second) - Y;
++mp[nx][ny];
}
for(int i = 0; i < N; ++i) {
for(int j = 1; j < N; ++j)
mp[i][j] += mp[i][j-1];
}
for(int i = 1; i < N; ++i) {
for(int j = 0; j < N; ++j)
mp[i][j] += mp[i-1][j];
}
ll res = LLONG_MAX;
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j) {
for(int k = i + 1; k < N; ++k) {
for(int l = j + 1; l < N; ++l) {
int num = minmp(k, l) - minmp(i-1, l)- minmp(k, j-1) + minmp(i-1, j-1);
if(num >= K) {
ll S = 1LL * (X[k] - X[i]) * (Y[l] - Y[j]);
res = min(res, S);
}
}
}
}
}
cout << res << endl;
return 0;
}
| 0
| 95,906,537
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define SORTD(s) sort((s).rbegin(),(s).rend())
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main() {
ll a,b,c,d,sum;
cin>>a>>b>>c>>d;
sum +=b/c-(a-1)/c;
sum +=b/d-(a-1)/d;
int e=gcd(c,d);
sum-=b/(c*d/e)-(a-1)/(c*d/e);
cout<<b-a+1-sum<<endl;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
#define N 100005
#define M 20
#define mod 1000000007
int x[N],dp[N][M];
int jumpCity(int stCity,int day) {
int curCity = stCity;
for(int i=0;i<M;++i) {
if(day&(1<<i)) {
curCity = dp[curCity][i];
}
}
return curCity;
}
void solve() {
int n;scanf("%d ", &n);
for(int i=1;i<=n;++i) {
scanf("%d ", &x[i]);
}
int L;scanf("%d ", &L);
for(int i=0;i<M;++i) {
dp[n+1][i] = n+1;
dp[n][i] =n+1;
}
int lastCity = n;
int dist = x[n] - x[n-1];
for(int i=n-1;i>=1;--i) {
while(dist>L) {
dist -= x[lastCity] - x[lastCity-1];
--lastCity;
}
dp[i][0] = lastCity;
for(int j=1;j<M;++j) {
dp[i][j] = dp[dp[i][j-1]][j-1];
}
dist += x[i] - x[i-1];
}
int q;scanf("%d ", &q);
while(q--) {
int a,b;scanf("%d %d ", &a,&b);
if(a>b) {
swap(a,b);
}
int l = 1,r = n,mid;
while(l<r) {
mid = (l+r)/2;
int arrived = jumpCity(a,mid);
if(b<=arrived) {
r = mid;
} else {
l = mid+1;
}
}
printf("%d\n", l);
}
}
int main() {
solve();
return 0;
}
| 0
| 12,833,479
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using M = map<int, int>;
using Ml = map<ll, ll>;
ll const INF = 1ll<<61;
double pi = 3.141592653589793238;
int main() {
ll a, b, c;
cin >> a >> b >> c;
set<ll> s;
s.insert(a);
s.insert(b);
s.insert(c);
cout << s.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define chmax(s, t) s=max(s,t);
#define chmin(s, t) s=min(s,t);
#define deg2rad(deg) (((deg)/360)*2*M_PI)
#define rad2deg(rad) (((rad)/2/M_PI)*360)
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
const ll INF = (1LL<<60);
const int INFi = (1<<29);
bool is_prime(ll n){
if(n==1) return false;
for(ll i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return true;
}
vll enum_divisors(ll n){
vll l;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
l.push_back(i);
if(n/i != i) l.push_back(n/i);
}
}
sort(all(l));
return l;
}
vector<P> prime_factorize(ll n){
vector<P> l;
for(ll i=2;i*i<=n;i++){
if(n%i!=0) continue;
ll e = 0;
while(n%i==0){
e++;
n /= i;
}
l.push_back({i, e});
}
if(n!=1) l.push_back({n, 1});
return l;
}
ll lcm(ll a, ll b){
return a*b/__gcd(a,b);
}
ll gcd(ll a, ll b){
return __gcd(a,b);
}
const ll CMAX = 1010000;
const ll CMOD = 1e9+7;
ll fac[CMAX], finv[CMAX], inv[CMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < CMAX; i++) {
fac[i] = fac[i - 1] * i % CMOD;
inv[i] = CMOD - inv[CMOD%i] * (CMOD / i) % CMOD;
finv[i] = finv[i - 1] * inv[i] % CMOD;
}
}
ll comb(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % CMOD) % CMOD;
}
ll factorial(ll n){
const ll FMOD = 1e9+7;
ll ret = n;
for(ll i=n-1;i>0;i--){
ret*=i;
ret%=FMOD;
}
return (ret?ret:1);
}
int main(){
ll n, m; cin >> n >> m;
vll x(n);
ll in;
rep(i, n){
cin >> in;
x[i] = abs(in-m);
}
ll ans = x[0];
rep2(i, 1, n){
ans = gcd(ans, x[i]);
}
cout << ans << endl;
return 0;
}
| 0
| 34,424,805
|
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
if(a < b) {a = b; return true;}
return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
if(a > b) {a = b; return true;}
return false;
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
os << p.first << ":" << p.second;
return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if(i) os << " ";
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string s; cin >> s;
int n = SZ(s);
map<ll, int> mp;
mp[0] = 0;
ll now = 0;
REP(i, n) {
now ^= 1ll << (s[i] - 'a');
int mi = mp.find(now) != mp.end() ? mp[now] : INF;
REP(j, 26) {
ll tmp = now ^ (1ll<<j);
if(mp.find(tmp) != mp.end()) chmin(mi, mp[tmp] + 1);
}
mp[now] = mi;
}
cout << max(1, mp[now]) << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
int n;
std::cin >> n;
std::vector<int> v(n), o(100001,0), e(100001,0);
rep(i,n){
std::cin >> v[i];
if(i%2) o[v[i]]++;
else e[v[i]]++;
}
auto io = std::distance(o.begin(),std::max_element(o.begin(),o.end()));
auto ie = std::distance(e.begin(),std::max_element(e.begin(),e.end()));
std::sort(o.begin(),o.end());
std::sort(e.begin(),e.end());
if(o.back()==n/2 && e.back()==n/2 && v[0]==v[1]){
std::cout << n/2 << "\n";
return 0;
}
int ans = 0;
if(io==ie){
ans = std::min(n-o[o.size()-1]-e[e.size()-2],n-o[o.size()-2]-e[e.size()-1]);
}else{
ans = n - o.back() - e.back();
}
std::cout << ans << "\n";
return 0;
}
| 0
| 19,517,857
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
using ll = int64_t;
ll mod_pow(ll x, ll n, const ll mod){
ll ans = 1;
while(n){
if(n & 1) ans = ans * x % mod;
x = x * x % mod;
n >>= 1;
}
return ans;
}
int main(){
const ll mod = 1e9+7;
int n, k; cin >> n >> k;
ll d[k+1];
loop(i, 1, k+1) d[i] = mod_pow(k/i, n, mod);
for(int i = k; i > 0; i--){
for(int j = 2*i; j < k+1; j += i){
d[i] -= d[j];
d[i] %= mod;
}
}
ll ans = 0;
loop(i, 1, k+1){
ans += d[i]*i;
ans %= mod;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long,long long> P;
int main() {
long long N,M;
cin >> N >> M;
vector<P>A(N);
for(long long i = 0; i < N; i++) {
long long a,b;
cin >> a >> b;
A[i].first = a;
A[i].second = b;
}
sort(A.begin(),A.end());
long long ans = 0;
long long cnt = 0;
while(M != 0) {
if(M > A[cnt].second) {
ans+=A[cnt].first*A[cnt].second;
M-=A[cnt].second;
}
else {
ans+=M*A[cnt].first;
M = 0;
}
cnt++;
}
cout << ans << endl;
}
| 0
| 38,258,269
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int,int> P;
const int inf=1000000007;
const ll mod=1000000007;
const double PI=3.14159265358979323846;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int main(){
int N,K;
cin >> N >> K;
ll a[N];
rep(i,N) cin >> a[i];
ll ans = 1000000000000;
for(int bit=0; bit < (1<<N); bit++) {
vector<bool> ch;
int num = 0;
ll pre = 0;
ll tmp = 0;
rep(i,N) {
if(bit & (1<<i)) {
ch.push_back(true);
num++;
}
else ch.push_back(false);
}
if(num<K) continue;
rep(i,N) {
if(ch[i]) {
if(pre >= a[i]) {
pre++;
tmp += pre - a[i];
}
}
pre = max(pre,a[i]);
}
ans = min(ans,tmp);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
long long ans = 0;
sort (a.begin(), a.end());
for (auto p : a) {
ans += p.first * min (m, p.second);
m = max (0ll, m - p.second);
if (m == 0) break;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 16,307,362
|
#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 n,a,b;
cin>>n>>a>>b;
if(a>b) cout<<0;
else if(n==1){
if(a==b) cout<<1;
else cout<<0;
}
else cout<<(b-a)*(n-2)+1;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const int mod = 1e5;
const long long INF = 1LL<<60;
int main(){
int n;
while(cin >> n){
if (n == 0) break;
vector<long long> imos(101010);
rep(i,n){
string s1, s2;
cin >> s1 >> s2;
int start_h1 = ((s1[0] - '0') * 10 + (s1[1] - '0')) * 3600;
int start_m1 = ((s1[3] - '0') * 10 + (s1[4] - '0')) * 60;
int start_s1 = (s1[6] - '0') * 10 + s1[7] - '0';
int start_time = start_h1 + start_m1 + start_s1;
int arrival_h2 = ((s2[0] - '0') * 10 + (s2[1] - '0')) * 3600;
int arrival_m2 = ((s2[3] - '0') * 10 + (s2[4] - '0')) * 60;
int arrival_s2 = (s2[6] - '0') * 10 + s2[7] - '0';
int arrival_time = arrival_h2 + arrival_m2 + arrival_s2;
for (int j = start_time; j < arrival_time; j++) imos[j]++;
}
long long ans = 0;
for (int i = 0; i <86400; i++) ans = max(ans, imos[i]);
cout << ans << endl;
}
}
| 0
| 65,776,850
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]!=s[1] || s[1]!=s[2] || s[0]!=s[2])
cout<<"Yes";
else cout<<"No";
}
|
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int k;
cin>>k;
vector<ll> a;
for(int i=1;i<=9;i++) a.push_back(i);
while(1){
if(k<=(int)a.size()){
cout<<a[k-1]<<endl;
return 0;
}
k-=(int)a.size();
vector<ll> v;
swap(v,a);
for(ll x : v){
for(int i=-1;i<=1;i++){
int d=x%10+i;
if(d<0||d>9) continue;
a.push_back(x*10+d);
}
}
}
}
| 0
| 58,595,717
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool isev(string &s,ll x)
{
if(x&1) return 0;
for(int i=0;i<x/2;i++)
{
if(s[i]!=s[x/2+i])
{
return 0;
}
}
return 1;
}
int main()
{
string s;
cin>>s;
ll n=s.size();
n--;
while(isev(s,n)==0)
{
n--;
}
cout<<n<<endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
constexpr long MOD = 1e9 + 7;
using namespace std;
#include <map>
map<pair<int,int>, int> m;
long h, w, n;
long counter[10];
long nonzero = 0;
void hoge(int a, int b) {
for (int i = -1; i < 2; i++) {
for (int j = -1; j < 2; j++) {
if (0 <= a + i && a + i < h && 0 <= b + j && b + j < w) {
m[make_pair(a + i, b + j)]++;
}
}
}
}
int main() {
cin >> h >> w >> n;
int a, b;
REP(i,n) {
cin >> a >> b;
hoge(a-1,b-1);
}
for (auto itr = m.begin(); itr != m.end(); itr++) {
if (itr->first.first > 0 && itr->first.first < h - 1 && itr->first.second > 0 && itr->first.second < w - 1) counter[itr->second]++;
}
for (int i = 1; i < 10; i++) nonzero += counter[i];
cout << (h-2) * (w-2) - nonzero << endl;
for (int i = 1; i < 10; i++) cout << counter[i] << endl;
}
| 0
| 37,645,874
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,sum=0;
cin>>a>>b>>c>>k;
while(k&&a){
sum++;
a--;
k--;
}
while(k&&b){
b--;
k--;
}
while(k&&c){
sum--;
c--;
k--;
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const double PI = 3.14159265358979323846;
int main()
{
int H, N;
cin >> H >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
}
vector<vector<int>> dp(N + 1, vector<int>(H + 1, 1000000000));
for (int i = 0; i <= min(A[0],H); i++)
{
dp[1][i] = B[0];
}
for (int i = 0; i <= N; i++)
{
dp[i][0] = 0;
}
for (int i = 0; i < N; i++)
{
for (int j = 1; j < H + 1; j++)
{
if (j >= A[i])
{
dp[i + 1][j] = min(dp[i + 1][j - A[i]] + B[i], dp[i][j]);
}
else
{
dp[i + 1][j] = min(dp[i][j], dp[i + 1][0] + B[i]);
}
}
}
cout << dp[N][H] << endl;;
return 0;
}
| 0
| 30,172,650
|
#include <iostream>
int main (){
int a,b,c;
std::cin >> a >> b >> c;
if (a < b && b < c)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
|
#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;
}
int main() {
ll K;
cin >> K;
queue<ll> que;
rep(i, 10) {
if (i == 0) continue;
que.push(i);
}
ll cnt = 0;
while (1) {
ll now = que.front();
que.pop();
cnt++;
if (cnt == K) {
cout << now << "\n";
return 0;
}
if (now % 10 != 0) que.push(now * 10 + now % 10 - 1);
que.push(now * 10 + now % 10);
if (now % 10 != 9) que.push(now * 10 + now % 10 + 1);
}
return 0;
}
| 0
| 83,767,637
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for(int i = 0 ; i < s.size(); i++) {
if(s[i] == 'o') sum++;
}
if(8 - sum <= 15 - s.size()) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod = 1e9+7;
const int mod1 = 998244353;
const int inf = 9223372036ll;
const int nax = 55;
int n,k,ans = 0;
int v[nax];
int check(vector<int> s,int left)
{
int sum = 0;
sort(s.begin(), s.end());
for(auto x: s){
if(x<0 && left>0)
left--;
else
sum += x;
}
return sum;
}
void solve()
{
cin>>n>>k;
loop(i,1,n+1)
cin>>v[i];
vector<int> s;
for(int i=0; i<=min(n,k); i++)
{
if(i!=0)
s.pb(v[i]);
int left = k-i;
vector<int> now = s;
int temp = left;
for(int j=n+1; j>=i+1; j--)
{
if(j!=n+1){
now.pb(v[j]);
temp--;
}
if(temp>=0)
ans = max(ans,check(now,temp));
else
break;
}
}
cout<<ans;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 65,722,632
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
vector<vector<int>> black(50, vector<int>(100, 0));
vector<vector<int>> white(50, vector<int>(100, 1));
A--;
B--;
int x = 1;
int y = 1;
rep(i, A) {
black[y][x] = 1;
x += 2;
if (x > 98) {
x = 1;
y += 2;
}
}
x = 1;
y = 1;
rep(i, B) {
white[y][x] = 0;
x += 2;
if (x > 98) {
x = 1;
y += 2;
}
}
cout << 100 << " " << 100 << endl;
rep(i, 2) {
vector<vector<int>> board = black;
if (i == 1) board = white;
rep(h, 50) {
rep(w, 100) {
if (board[h][w] == 0) cout << "#";
else cout << ".";
}
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, p[100005], ans[100005];
vector<pair<int, int>> v[100005];
int ta;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", p + i, &ta);
v[p[i]].emplace_back(ta, i);
}
for (int i = 1; i <= n; i++) {
sort(v[i].begin(), v[i].end());
for (int j = 0; j < v[i].size(); j++)
ans[v[i][j].second] = j + 1;
}
for (int i = 0; i < m; i++)
printf("%06d%06d\n", p[i], ans[i]);
return 0;
}
| 0
| 67,863,893
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define IREP(i, v) for(auto i = (v).begin(); i != (v).end(); ++i)
#define IRREP(i, v) for(auto i = (v).rbegin(); i != (v).rend(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int N, cntInside(0), mincnt(0); ll K; cin >> N >> K;
VI A(N);
REP(i, N) cin >> A[i];
REP(i, N){
REP(j, N){
if(i == j) continue;
if(i < j && A[i] > A[j]) ++cntInside;
if(A[i] > A[j]) ++mincnt;
}
}
ll ans(cntInside * K % MOD);
ans = (ans + (K*(K-1)/2 % MOD * mincnt % MOD)) % MOD;
if(ans < 0) ans += MOD;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#define din cin
#else
stringstream dummy;
#define dout dummy.str(""); dummy.clear(stringstream::goodbit); dummy
#endif
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif
#define disp(A) dout << #A << " = " << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef unsigned long long ll;
const int INF = 999;
int main() {
int n; din>>n;
int s, g, numOfAdjacent;
int adjacent[101];
bool adjacencyMatrix[101][101] = {0};
rep(i,0,n) {
din>>s>>numOfAdjacent;
rep(j,0,numOfAdjacent) {
din>>g;
adjacencyMatrix[s][g]=1;
}
}
rep(i,1,n+1) {
rep(j,1,n+1) {
dout<<(j==1?"":" ")<<adjacencyMatrix[i][j];
}
dout<<endl;
}
#ifdef INPUTFILE
inputfile.close();
#endif
#ifdef OUTPUTFILE
outputfile.close();
cout << "\"" << OutputFilePath << "\"" << endl;
#endif
return 0;
}
| 0
| 44,291,692
|
#include<bits/stdc++.h>
using namespace std;
const int N=8005,low=8000;
char s[N];
int x,y,n;
bitset<N*2>bx,by;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
scanf("%d%d",&x,&y);
bx[0+low]=1;by[0+low]=1;
bool flag=true;
int t=0,st=0;
for(int i=1;i<=n;i++)
if(s[i]=='F') t++;
else
{
if(flag)
bx<<=t,flag=false;
else
{
if(st) by=(by<<t)|(by>>t);
else bx=(bx<<t)|(bx>>t);
}
st^=1;
t=0;
}
if(flag)
bx<<=t,flag=false;
else
{
if(st) by=(by<<t)|(by>>t);
else bx=(bx<<t)|(bx>>t);
}
if(bx[x+low]&&by[y+low]) printf("Yes\n");
else printf("No\n");
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
vector<string>s(h);
rep(i,h)cin>>s[i];
vector<vector<int>>dist(h,vector<int>(w,INF));
queue<P>q;
rep(i,h)rep(j,w){
if(s[i][j]=='#'){
q.push(P(i,j));
dist[i][j]=0;
}
}
while(!q.empty()){
int y=q.front().first;
int x=q.front().second;
q.pop();
rep(dir,4){
int vy=y+dy[dir];
int vx=x+dx[dir];
if(vy<0||vy>=h||vx<0||vx>=w)continue;
if(dist[vy][vx]!=INF||s[vy][vx]=='#')continue;
dist[vy][vx]=dist[y][x]+1;
s[vy][vx]='#';
q.push(P(vy,vx));
}
}
int ans=0;
rep(i,h)rep(j,w)ans=max(ans,dist[i][j]);
cout<<ans<<endl;
return 0;
}
| 0
| 58,362,807
|
#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 argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s1,s2,s3;
cin>>s1>>s2>>s3;
s1[0]=toupper(s1[0]);
s2[0]=toupper(s2[0]);
s3[0]=toupper(s3[0]);
cout<<s1[0]<<s2[0]<<s3[0]<<endl;
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<utility>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int dp[1000005];
bool leap[1000005];
int main()
{
#ifdef LOCAL
freopen("C:\\Users\\巍巍\\Desktop\\in.txt","r",stdin);
#endif
memset(leap,false,sizeof(leap));
memset(dp,0,sizeof(dp));
for(ll i = 2;i <= 999999;i++)
{
if(leap[i])continue;
dp[i] = 1;
for(ll j = i*i;j <= 999999;j = j + i)
leap[j] = true;
}
for(int i = 1;i <= 999999;i++)dp[i] = dp[i] + dp[i - 1];
int n;
while(scanf("%d",&n) != EOF)
{
printf("%d\n",dp[n]);
}
return 0;
}
| 0
| 68,332,019
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
int main(){
ll n;
cin >> n;
vector<ll> d;
for(ll i = 1; i * i <= n; ++i){
if(n % i == 0){
d.push_back(i);
if(i * i != n){
d.push_back(n / i);
}
}
}
ll ans = 0;
for(int i = 0; i < d.size(); ++i){
if(d[i] != 1 && n % (d[i] - 1) == n / (d[i] - 1)){
ans += d[i] - 1;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (ll 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;
std::istream &operator>>(std::istream &in, set<int> &o) {
ll 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(); }
const int mod = 1000000007;
typedef priority_queue<string, vector<string>, greater<string> > PQ_ASK;
#include <iostream>
#include <vector>
using namespace std;
const int ROW_MAX = 100;
int main() {
int n;
cin >> n;
vector<vector<char>> a(n, vector<char>(n));
rep(i, n) rep(j, n) cin >> a[i][j];
auto check = [&](int x) {
vector<vector<char>> b(n, vector<char>(n));
rep(i, n) rep(j, n) {
b[i][j] = a[(i + x) % n][j];
}
rep(i, n) rep(j, n) {
if (b[i][j] != b[j][i]) return false;
}
return true;
};
int ans = 0;
rep(x, n) {
if (check(x)) ans++;
}
cout << ans * n << endl;
}
| 0
| 92,578,025
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define fi first
#define se second
#define int long long
signed main(){
int K;cin>>K;
if(K<1000){
Cout(2);
int a=K/2+1,b=K/2+1;
if(K%2){a++;b--;}
cout<<a<<" "<<b<<endl;
}
else{
Cout(50);
std::vector<int> v(50,K/50);
for(int i=0;i<50;i++)v[i]+=i;
for(int i=0;i<K%50;i++){
for(int j=0;j<50;j++){
if(j==i)v[j]+=50;
else v[j]--;
}
}
for(int i=0;i<50;i++){
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int H, W;
bool loop = true;
while (loop) {
cin >> H >> W;
if ((H == 0) && (W == 0)) {
loop = false;
continue;
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i == 0) || (i == H-1)) {
cout << "#";
} else {
if ((j == 0) || (j == W-1)) {
cout << "#";
} else {
cout << ".";
}
}
}
cout << endl;
}
cout << endl;
}
return 0;
}
| 0
| 15,165,841
|
#include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
int T[110] = {};
int V[110] = {};
int S[110] = {};
for(int i = 1; i <= N; i++){
cin >> T[i];
S[i] = S[i-1] + T[i] * 2;
}
for(int i = 1; i <= N; i++){
cin >> V[i];
}
int A[40010] = {};
for(int t = 0; t <= S[N]; t++){
A[t] = min(t, S[N] - t);
}
for(int i = 1; i <= N; i++){
for(int t = 0; t <= S[N]; t++){
if(t < S[i-1]){A[t] = min(A[t], V[i] * 2 - t + S[i-1]);}
else if(t >= S[i-1] && t <= S[i]){A[t] = min(A[t], V[i] * 2);}
else if(t > S[i]){A[t] = min(A[t], V[i] * 2 + t - S[i]);}
}
}
int ans = 0;
for(int i = 1; i < S[N]; i++){
ans += A[i];
}
cout.precision(10);
cout << (double) ans * 0.25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y; cin >> x >> y;
string ans = "No";
if (y % 2 == 1) {
cout << ans << endl;
return 0;
}
if (2 * x <= y && y <= 4 * x) ans = "Yes";
cout << ans << endl;
return 0;
}
| 0
| 11,761,796
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int sumDight(int x) {
int sum = 0;
while (x > 0) {
sum += (x % 10);
x /= 10;
}
return sum;
}
int divideReverse(int x) {
int reverse = 0;
int r;
while (x > 0) {
r = x % 10;
reverse = reverse * 10 + r;
x /= 10;
}
return reverse;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int w, h,n;
cin >> w >> h >> n;
vector<int> x(110);
vector<int> y(110);
vector<int> a(110);
rep(i, n) cin >> x[i] >> y[i] >> a[i];
int mix = 0;
int maxx = w;
int miy = 0;
int may = h;
rep(i,n){
if(a[i]==1){
if (mix < x[i]) mix = x[i];
} else if (a[i] == 2) {
if (maxx > x[i]) maxx = x[i];
} else if (a[i] == 3) {
if (miy< y[i]) miy = y[i];
} else {
if (may > y[i]) may = y[i];
}
}
if (maxx > mix && may > miy)
cout << (mix - maxx) * (miy - may) << endl;
else
cout << 0 << endl;
}
|
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# define int long long
using namespace std;
const int N = 2e5 + 7;
const int mod = 1e9 + 7;
vector < int > adj[N];
int used[N], cnt, mx;
void dfs( int v ) {
used[v] = 1;
cnt++;
for ( auto u: adj[v] ) {
if ( !used[u] ) {
dfs( u );
}
}
}
int32_t main() {
speed;
int n, m;
cin >> n >> m;
for ( int i = 0; i < m; i++ ) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for ( int i = 1; i <= n; i++ ) {
if ( !used[i] ) {
cnt = 0;
dfs( i );
mx = max( mx, cnt );
}
}
cout << mx;
}
| 0
| 50,191,597
|
#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 n, ans = 0;
cin >> n;
vector<pair<ll, ll>> a;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
continue;
ll e = 0;
while (n % i == 0)
{
e++;
n /= i;
}
a.push_back({i, e});
}
if (n != 1)
a.push_back({n, 1});
for (auto p : a)
{
for (int i = 1;; i++)
{
if (p.second >= i * (i + 1) / 2)
ans++;
else
break;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vvi = vector<vector<int>> ;
struct unionfind{
vector<int> r;
unionfind(int n){
r = vector<int>(n,-1);
}
int root(int x){
if(r.at(x) < 0) return x;
else return r.at(x) = root(r.at(x));
}
bool unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry) return false;
r.at(x) = ry;
return true;
}
};
int main(){
int n,m;
cin >> n >> m;
vector<set<int>> r(n);
for(int ix=0;ix<m;ix++){
int a,b; cin >> a >> b;
a--; b--;
r.at(a).insert(b);
r.at(b).insert(a);
}
bool can = false;
for(int ix=0;ix<n;ix++){
if(r.at(ix).count(0) == true && r.at(n-1).count(ix) == true) can = true;
}
cout << (can == true ? "POSSIBLE" : "IMPOSSIBLE") << endl;
}
| 0
| 7,435,237
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int dp[1001][1001];
int main()
{
string s, t;
cin >> s >> t;
rep(i, 1001) dp[i][0] = i;
rep(j, 1001) dp[0][j] = j;
for (int i = 0; i < s.size(); i++)
{
for (int j = 0; j < t.size(); j++)
{
if (s[i] == t[j])
dp[i + 1][j + 1] = min({dp[i][j], dp[i + 1][j] + 1, dp[i][j + 1] + 1});
else
dp[i + 1][j + 1] = min({dp[i][j] + 1, dp[i + 1][j] + 1, dp[i][j + 1] + 1});
}
}
OP(dp[s.size()][t.size()]);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans = 1000000000;
for (int i = -100; i <= 100; i++){
int s = 0;
rep(j, n){
s += (a[j] - i) * (a[j] - i);
}
ans = min(s, ans);
}
cout << ans << endl;
}
| 0
| 14,083,745
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) cout<<#x<<x<<" ", nl
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define mid(a,b) ((a+b)/2)
#define pb push_back
#define LCM(a,b) ((a*b)/__gcd(x,y))
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
class triplet{
public:
ll f, s, t;};
vl in(ll n){vl v;ll x;
f(i,n)
cin>>x, v.pb(x);
return v;}
vll in_pr(ll n){
vll ar;
ll x,y;
f(i,n)
{cin>>x>>y;
ar[i]={x,y};
}return ar;
}
void out(vl v, char ch='\0'){
fl(i,v)
cout<<i<<ch;
}
void solve(){
ll N,x,sum=0;
cin>>N;
vl d;
f(i, N)
cin>>x, d.pb(x);
f(i, N){
fs(j, i+1, N, 1){
sum+=(d[i]*d[j]);
}
}
cout<<sum;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
bool visited[100005];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (visited[i]) {
continue;
}
if (a[a[i]] == i) {
cnt++;
visited[a[i]] = true;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 89,580,004
|
#include <string>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int min = a, max = b;
if(a > b){
min = b;
max = a;
}
rep(i, max){
cout << min;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a = vector<int>(N);
for(int i=0;i<N;i++){
cin >> a.at(i);
}
sort(a.begin(), a.end());
int answer = 100000000000;
int tmp;
for(int x=a.at(0);x<=a.at(N-1);x++){
tmp = 0;
for(auto num : a){
tmp += (num - x) * (num - x);
}
if(answer > tmp){
answer = tmp;
}
}
cout << answer << endl;
}
| 0
| 78,987,037
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(max(a,c)-min(a,c)<=d) cout<<"Yes"<<endl;
else if(max(a,b)-min(a,b)<=d&&max(b,c)-min(b,c)<=d) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
#define pr(x) cout<<x<<endl;
#define pr2(x,y) cout<<x<<" "<<y<<endl;
#define pr3(x,y,z) cout<<x<<" "<<y<<endl;
#define prv(v) for(auto x:v) cout<<x<<" ";
using namespace std;
const ll N =(2e5+5);
const ll MOD = 1e9+7;
const ll INF = 1e16;
const ll LOG = 29;
long long binpow(long long a, long long b) {
a%=MOD;
long long res = 1;
while (b > 0) {
if (b & 1)
res = (res * a)%MOD;
a = (a * a) %MOD;
b >>= 1;
}
res%=MOD;
return res;
}
void solve(){
ll n,l;
cin>>n>>l;
ll idx = -1;
ll a[n+1];
for(int i= 1;i<=n;i++){
cin>>a[i];
}
for(int i =1;i<n;i++){
if(a[i+1]+a[i]>=l){
idx =i;
break;
}
}
if(idx == -1){
cout<<"Impossible\n";
return;
}
cout<<"Possible\n";
for(int i =1;i<idx;i++)cout<<i<<"\n";
for(int i = n-1;i>idx;i--)cout<<i<<"\n";
cout<<idx<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 48,457,523
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s; cin>>s;
ll ans=INF;
rep(i,s.size()){
ll x=stoll(s.substr(i,3));
ll tmp=abs(753-x);
ans=min(ans,tmp);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SIZE = 1e5 + 100, INF = 1e9 * 1e4 + 10, MOD = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll n, a, b, c, d, dp[SIZE][30], lf, q;
vector<ll> vec;
map<ll, ll> ch;
ll check(int val, int pos) {
if (val == 0) return pos;
ll lft = val, u = pos;
for (ll i = 29; i >= 0; i--) {
if (lft - (1ll << i) >= 0) {
u = dp[u][i];
lft -= (1ll << i);
}
}
return u;
}
void sol() {
cin >> n;
vec.resize(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
cin >> lf;
cin >> q;
for (int i = 29; i >= 0; i--) {
dp[n - 1][i] = n - 1;
}
for (int i = vec.size() - 2; i >= 0; i--) {
int l = i, r = vec.size();
while (r - l > 1) {
int mid = (l + r) / 2;
if (vec[i] + lf < vec[mid]) {
r = mid;
}
else {
l = mid;
}
}
dp[i][0] = l;
for (int j = 1; j < 30; j++) {
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
while (q--) {
ll lq, rq;
cin >> lq >> rq;
if (lq > rq) swap(lq, rq);
if (lq == rq) {
cout << "0\n";
continue;
}
lq--;
rq--;
ll dist = 0, cur = lq, curR = rq;
int l = 0, r = vec.size() + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (check(mid, cur) >= curR) {
r = mid;
}
else {
l = mid;
}
}
cout << r << "\n";
}
}
int main()
{
fastInp;
ll t = 1;
while (t--) {
sol();
}
return 0;
}
| 0
| 96,475,492
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<string>
#include<stdio.h>
#include<cmath>
#include<map>
#include<bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define repr(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define lint long long
int main(){
int n; cin >> n;
vector<lint> a;
rep(i, n){
lint x; cin >> x;
a.push_back(x);
}
lint count = 0;
lint sum = 0;
lint xr = 0;
int r = 0;
for(int l = 0; l < n; l++){
while(r < n){
if (sum + a[r] == (xr ^ a[r])){
sum += a[r];
xr ^= a[r];
r++;
}
else{
break;
}
}
count += r - l;
sum = sum - a[l];
xr = xr ^ a[l];
if(r == l) r++;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
# define M_PI 3.14159265358979323846
void solve(){
ll total=0;
int d;
cin>>d;
vector<int>a(d);
for(int i=0;i<d;i++)
cin>>a[i];
for(int i=0;i<d;i++){
for(int j=i+1;j<d;j++)
total+=(ll)a[i]*(ll)a[j];
}
cout<<total;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
int t=1;
for(int i=1;i<=t;i++){
solve();
}
return 0;
}
| 0
| 19,942,108
|
#include <stdio.h>
#include <string.h>
int main() {
char kata1[15];
char kata2[16];
scanf("%s",kata1);
scanf("%s",kata2);
int str = strlen(kata1);
int a = 0,count = 0;
for(a = 0; a<str; a++){
if(kata1[a] == kata2[a]){
count++;
}
}
if(count == str){
printf("Yes\n");
}else{
printf("No");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
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 = 1e9;
const ll INF = 1e18;
const ld EPS = 1e-10;
using pdi = pair<ld, int>;
int main(){
int N, n = 0;
cin >> N;
vector<ld> x, y;
vector<pdi> p;
rep(i, N){
ld a, b;
cin >> a >> b;
if(a != 0 || b != 0){
x.pb(a), y.pb(b);
p.pb(pdi(atan2(b, a), n));
n++;
}
}
sort(all(p));
ld ans = 0;
rep(i, n){
ld sumx = 0, sumy = 0;
rep(j, n){
int k = p[(i+j)%n].second;
sumx += x[k], sumy += y[k];
ans = max(ans, sumx*sumx + sumy*sumy);
}
}
cout << sp(15) << sqrt(ans) << endl;
}
| 0
| 30,813,486
|
#include <iostream>
using namespace std;
int main() {
int a[5];
for(int i=0; i<5; i++){
cin >> a[i];
}
for(int j=0; j<5; j++){
int v = a[j];
int k = j-1;
while(a[k]<v && k>=0){
a[k+1] = a[k];
k--;
a[k+1] = v;
}
}
for(int l=0; l<4; l++){
cout << a[l] << ' ';
}
cout << a[4] << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w;
vector<string>g;
cin >> h >> w;
g.resize(h);
rep(i, h) cin >> g[i];
vector<vector<int>>dp(h, vector<int>(w, 100000000));
if(g[0][0] == '#') dp[0][0] = 1;
else dp[0][0] = 0;
for(int i = 1; i < w; i++){
if(g[0][i-1] == '.' && g[0][i] == '#') dp[0][i] = dp[0][i-1] + 1;
else dp[0][i] = dp[0][i-1];
}
for(int i = 1; i < h; i++){
rep(j, w){
if(g[i-1][j] == '.' && g[i][j] == '#') dp[i][j] = dp[i-1][j] + 1;
else dp[i][j] = dp[i-1][j];
if(j > 0){
if(g[i][j-1] == '.' && g[i][j] == '#') dp[i][j] = min(dp[i][j], dp[i][j-1] + 1);
else dp[i][j] = min(dp[i][j], dp[i][j-1]);
}
}
}
cout << dp[h-1][w-1] << endl;
}
| 0
| 29,171,491
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int k = 0; k < 4; k++) {
vector<int> sw(n);
if (k == 0) sw[0] = sw[1] = 0;
else if (k == 1) {
sw[0] = 0;
sw[1] = 1;
} else if (k == 2) {
sw[0] = 1;
sw[1] = 0;
}
else sw[0] = sw[1] = 1;
for (int i = 1; i < n-1; i++) {
if (sw[i] == 0) {
if (s[i] == 'o') {
sw[i+1] = 1 - sw[i-1];
} else {
sw[i+1] = sw[i-1];
}
} else {
if (s[i] == 'o') {
sw[i+1] = sw[i-1];
} else {
sw[i+1] = 1 - sw[i-1];
}
}
}
bool b1 = true;
if (sw[n-1] == 0) {
if (s[n-1] == 'o') {
if (sw[n-2] == sw[0]) b1 = false;
} else {
if (sw[n-2] != sw[0]) b1 = false;
}
} else {
if (s[n-1] == 'o') {
if (sw[n-2] != sw[0]) b1 = false;
} else {
if (sw[n-2] == sw[0]) b1 = false;
}
}
bool b2 = true;
if (sw[0] == 0) {
if (s[0] == 'o') {
if (sw[n-1] == sw[1]) b1 = false;
} else {
if (sw[n-1] != sw[1]) b1 = false;
}
} else {
if (s[0] == 'o') {
if (sw[n-1] != sw[1]) b1 = false;
} else {
if (sw[n-1] == sw[1]) b1 = false;
}
}
if (b1 && b2) {
string ans = "";
rep(i,n) ans += (sw[i] ? 'S': 'W');
cout << ans << endl;
return 0;
}
}
cout << -1 << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int change, pay, cnt;
while(true){
cin>>pay; if(pay==0) break;
cnt=0;
change = 1000 - pay;
cnt+= change / 500 ;
cnt+= (change / 100) %5;
cnt+= (change / 50) %2;
cnt+= (change / 10) %5;
cnt+= (change / 5) %2;
cnt+= change %5;
cout<<cnt<<endl;
}
return 0;
}
| 0
| 55,449,876
|
#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, m; cin >> n >> m;
vector<ll> A(n), B(n), id(n);
rep(i, n) {
cin >> A[i] >> B[i];
id[i] = i;
}
sort(all(id), [&](int i, int j) {
return A[i] < A[j];
});
int cnt = m;
ll ans = 0;
int i = 0;
while(cnt) {
if(cnt < B[id[i]]) {
ans += A[id[i]] * cnt;
break;
} else {
ans += A[id[i]] * B[id[i]];
cnt -= B[id[i]];
}
i++;
}
cout << ans << "\n";
return 0;
}
|
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
typedef long double ldouble;
typedef vector<llong> vecllong;
typedef vector<vecllong> vvecllong;
const llong MOD = 1e9 + 7;
const llong INF = 1e17;
#define FOR(i, n) for (llong i = 0; i < n; i++)
#define FORS(i, a, b) for (llong i = a; i < b; i++)
#define FORR(i, n) for (llong i = n; i > 0; i++)
int main(void) {
llong A, B;
cin >> A >> B;
A--;
B--;
char ans[100][100];
FOR(i, 50) {
FOR(j, 100) {
ans[i][j] = '#';
ans[99 - i][j] = '.';
}
}
for(int i = 0; i < 50; i+=2) {
for(int j = 0; j < 100; j+=2) {
if (A<=0) {
i = 1000;
j = 1000;
break;
}
ans[i][j] = '.';
A--;
}
}
for(int i = 0; i < 50; i+=2) {
for(int j = 0; j < 100; j+=2) {
if (B<=0) {
i = 1000;
j = 1000;
break;
}
ans[99 - i][j] = '#';
B--;
}
}
cout << "100 100" << endl;
FOR(i, 100){
FOR(j, 100){
cout << ans[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 586,158
|
#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 m,n;
cin >> n >> m;
int left=-1;
int right=n+2;
rep(i,m){
int t_left, t_right;
cin >> t_left >> t_right;
left = max(left, t_left);
right = min(right, t_right);
}
cout << max(right - left +1,0) << endl;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <time.h>
#include <climits>
#include <bitset>
using namespace std;
int gcd(int a, int b) {
if (a < b) gcd(b, a);
int r;
while ((r = a%b)) {
a = b;
b = r;
}
return b;
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
long long b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t*b; swap(a, b);
u -= t*v; swap(u, v);
}
u %= mod;
if (u < 0) u += mod;
return u;
}
namespace NTT {
const int MOD = 998244353;
const long long PR = 3;
void trans(vector<long long> &v, bool inv = false) {
int n = (int)v.size();
for (int i = 0, j = 1; j < n - 1; j++) {
for (int k = n >> 1; k >(i ^= k); k >>= 1);
if (i > j) swap(v[i], v[j]);
}
for (int t = 2; t <= n; t <<= 1) {
long long bw = modpow(PR, (MOD - 1) / t, MOD);
if (inv) bw = modinv(bw, MOD);
for (int i = 0; i < n; i += t) {
long long w = 1;
for (int j = 0; j < t / 2; ++j) {
int j1 = i + j, j2 = i + j + t / 2;
long long c1 = v[j1], c2 = v[j2] * w % MOD;
v[j1] = c1 + c2;
v[j2] = c1 - c2 + MOD;
while (v[j1] >= MOD) v[j1] -= MOD;
while (v[j2] >= MOD) v[j2] -= MOD;
w = w * bw % MOD;
}
}
}
if (inv) {
long long inv_n = modinv(n, MOD);
for (int i = 0; i < n; ++i) v[i] = v[i] * inv_n % MOD;
}
}
vector<long long> mult(vector<long long> A, vector<long long> B) {
int size_a = 1; while (size_a < A.size()) size_a <<= 1;
int size_b = 1; while (size_b < B.size()) size_b <<= 1;
int size_fft = max(size_a, size_b) << 1;
vector<long long> cA(size_fft, 0), cB(size_fft, 0), cC(size_fft, 0);
for (int i = 0; i < A.size(); ++i) cA[i] = A[i];
for (int i = 0; i < B.size(); ++i) cB[i] = B[i];
trans(cA); trans(cB);
for (int i = 0; i < size_fft; ++i) cC[i] = cA[i] * cB[i] % MOD;
trans(cC, true);
vector<long long> res((int)A.size() + (int)B.size() - 1);
for (int i = 0; i < res.size(); ++i) res[i] = cC[i];
return res;
}
};
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
long long x, y;
cin >> x >> y;
if (abs(x - y) > 1)cout << "Alice";
else cout << "Brown";
}
| 0
| 1,075,951
|
#include <iostream>
#include <math.h>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#define DOLL long double
#define LOLI long long int
using namespace std;
const long C_10PW9 = 1000000000;
const int ULCODE = 32;
int main()
{
int H, W, M;
cin >> H >> W >> M;
vector<int> Height(H), Width(W);
vector<pair<int, int>> BOM;
for (int i = 0; i < M; i++) {
int hi, wi;
cin >> hi >> wi;
Height[hi - 1]++;
Width[wi - 1]++;
BOM.push_back(make_pair<int, int>(hi - 1, wi - 1));
}
auto Hbeg = Height.begin();
auto hinx = distance(Hbeg, max_element(Hbeg, Height.end()));
auto Wbeg = Width.begin();
auto winx = distance(Wbeg, max_element(Wbeg, Width.end()));
int HM = Height[hinx], WM = Width[winx];
LOLI HC = 0, WC = 0;
for (int i = 0; i < H; i++) { if (Height[i] == HM) { HC++; } }
for (int i = 0; i < W; i++) { if (Width[i] == WM) { WC++; } }
LOLI HWC = HC * WC;
for (int i = 0; i < M; i++) {
int h = BOM[i].first, w = BOM[i].second;
if (Height[h] == HM && Width[w] == WM) { HWC--; }
}
int vec = 0;
if (HWC <= 0) { vec = -1; }
cout << HM + WM + vec << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
ll N,Q,K;
vector<vector<pair<ll,ll>>> G(100010);
vector<ll> d(100010,INF);
void dijkstra(){
d[K] = 0;
priority_queue<Pi,vector<Pi>,greater<Pi>> pque;
pque.push(mp(0,K));
while(!pque.empty()){
Pi p = pque.top();
pque.pop();
ll pos=p.second,cost=p.first;
if( cost > d[pos] )continue;
rep(i,G[pos].size()){
ll to = G[pos][i].first;
ll newcost = cost + G[pos][i].second;
if(newcost < d[to]){
d[to] = newcost;
pque.push(mp(d[to],to));
}
}
}
}
int main() {
cin >>N;
rep(i,N-1){
ll a,b,c;
cin>>a>>b>>c;
a--;b--;
G[a].pb(mp(b,c));
G[b].pb(mp(a,c));
}
cin>>Q>>K;
K--;
dijkstra();
rep(i,Q){
ll x,y;
cin>>x>>y;
x--;y--;
cout<<d[x]+d[y]<<endl;
}
return 0;
}
| 0
| 94,019,129
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a=0, b=0, c=0;
int d=0;
cin >> a >> b;
c = (a+b)/2;
d = (a+b)/2;
if(c-d>0){
d++;
}
cout << d << endl;
}
|
#define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const ll MAXN = (ll)8e3+7;
bool dp[MAXN*4+1];
void Update(ll v) {
bool dp1[MAXN*4+1];
rep(i,0,MAXN*4+1) dp1[i] = false;
rep(i,0,MAXN*4+1) {
if (dp[i]) {
if (i+v< MAXN*4+1 && i+v>=0) dp1[i+v] = true;
if (i-v< MAXN*4+1 && i-v>=0) dp1[i-v] = true;
}
}
swap(dp,dp1);
return;
}
int main(void) {
string S;
cin>>S;
ll x,y;
cin>>x>>y;
vector<ll> vx[2];
ll now = 0;
ll dir = 0;
rep(i,0,S.size()) {
if(S[i] == 'F') now++;
if (S[i] == 'T' || i == S.size()-1) {
vx[dir].push_back(now);
dir++;
dir = dir%2;
now = 0;
}
}
if (!vx[0].size()) {
if (x!=0) {
cout<<"No"<<endl;
return 0;
}
} else {
auto itr = vx[0].begin();
x -= vx[0][0];
vx[0].erase(itr);
}
bool ans = true;
rep(i,0,MAXN*4+1) dp[i] = false;
dp[MAXN*2] = true;
for (auto el: vx[0]) Update(el);
if (!dp[MAXN*2+x]) ans = false;
rep(i,0,MAXN*4+1) dp[i] = false;
dp[MAXN*2] = true;
for (auto el: vx[1]) Update(el);
if (!dp[MAXN*2+y]) ans = false;
if (ans) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 0
| 11,931,913
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c) cout<<"Yes";
else cout<<"No";
cout<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , h[N] , f[N];
int main()
{
cin >> n;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
}
f[1] = 0;
f[0] = 99999;
h[0] = 99999;
for(int i = 2 ; i <= n; ++i)
{
f[i] = min(f[i-1] + abs(h[i-1] - h[i]), f[i-2] + abs(h[i-2] - h[i]));
}
cout << f[n] << endl;
return 0;
}
| 0
| 14,389,586
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int A, P;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> A >> P;
cout << (3*A+P)/2 << endl;
}
|
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
ll N, M;
cin >> N >> M;
vector<string> A(N), B(M);
rep(0, i, N)
{
cin >> A.at(i);
}
rep(0, i, M)
{
cin >> B.at(i);
}
for (ll i = 0; i <= N - M; i++)
{
for (ll j = 0; j <= N - M; j++)
{
ll flag = 1;
for (ll k = 0; k < M; k++)
{
for (ll l = 0; l < M; l++)
{
if (A.at(i + k).at(j + l) != B.at(k).at(l))
{
flag = 0;
}
}
}
if (flag == 1)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 17,657,056
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
int main(){
char b;
cin >> b;
if(b == 'A'){
cout << 'T' << endl;
}else if(b == 'T'){
cout << 'A' << endl;
}else if(b == 'C'){
cout << 'G' << endl;
}else{
cout << 'C' << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 1200005;
int main(){
int n, m, x;
cin >> n >> m >> x;
int c[n], a[n][m];
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = inf;
for(int bit = 0; bit < (1 << n); bit++){
int s = 0;
vector<int> al(m);
for(int i = 0; i < n; i++){
if(1 & (bit >> i)){
s += c[i];
for(int j = 0; j < m; j++){
al[j] += a[i][j];
}
}
}
int cnt = 0;
for(int i = 0; i < m; i++)
if(al[i] >= x)
cnt ++;
if(cnt == m)
ans = min(ans, s);
}
if(ans == inf)
ans = -1;
cout << ans << endl;
return 0;
}
| 0
| 96,013,489
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll m = INF;
for (int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
m = min(m, a[i]);
}
ll l = n * (n + 1)/2;
if (sum % l != 0 || sum / l > m){
cout << "NO" << endl;
}
else {
ll k = sum / l;
bool ok = 1;
for (int i = 0; i < n; i++){
if (a[(i + 1) % n] % n != (a[i] + k) % n){
ok = 0;
}
}
if(ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
int counting(int N_H, int N_W, vector< vector<int> > &Graph, queue< pair<int, int> > &PaintingPos)
{
int count = 0;
pair<int, int> pos_y_x;
queue< pair<int, int> > PaintingPos_new;
int x, y;
pair<int, int> dy_dx[4] = { make_pair(-1, 0), make_pair(1, 0), make_pair(0, 1), make_pair(0, -1) };
while( PaintingPos.size() >0 || PaintingPos_new.size()>0 )
{
while( PaintingPos.size()>0 )
{
pos_y_x = PaintingPos.front(); PaintingPos.pop();
for(int i=0; i<4; i++)
{
y = pos_y_x.first + dy_dx[i].first, x = pos_y_x.second + dy_dx[i].second;
if(x <0 || x>= N_W || y<0 || y>= N_H || Graph[y][x] == 1) continue;
Graph[y][x] = 1;
PaintingPos_new.push(make_pair(y, x) );
}
}
count++;
swap( PaintingPos, PaintingPos_new );
}
return count-1;
}
int main(void)
{
int N_H, N_W;
cin >> N_H >> N_W;
vector< vector<int> > Graph(N_H, vector<int>(N_W) );
queue< pair<int, int> > PaintingPos;
char color;
for(int i=0; i<N_H; i++)
{
for(int j=0; j<N_W; j++)
{
cin >> color;
if(color == '#')
{
Graph[i][j] = 1;
PaintingPos.push(make_pair(i, j) );
}
}
}
if(PaintingPos.size() == 0)
{
cout << 0 << endl;
}
else
{
cout << counting(N_H, N_W, Graph, PaintingPos) << endl;
}
return 0;
}
| 0
| 14,469,072
|
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 10000000000000007LL
#define ll long long
using namespace std;
int cnt[1000009];
int ka[214514],inv[214514];
void setkaijo(int n){
ka[0]=1;
for(int i=1;i<=n;i++){
ka[i] = ka[i-1] * i;
ka[i] %= inf;
}
}
int modpow(int x,int k){
int p2[55],res=1;
p2[0]=1;p2[1]=x%inf;
for(int i=2;i<=50;i++){
p2[i]=p2[i-1]*p2[i-1];
p2[i] %= inf;
}
for(int i=1;i<=50;i++){
if(k%2==1){
res *= p2[i];
res %= inf;
}
k /= 2;
}
return res;
}
void setinv(int n){
for(int i=0;i<=n;i++){
inv[i] = modpow(ka[i],(ll)inf-2);
}
}
int comb(int n,int k){
if(n<0)return 0;
if(k<0 || k>n)return 0;
if(k==0 || k==n)return 1;
int res = (ka[n] * inv[k]) % inf;
res = (res*inv[n-k]) % inf;
return res;
}
signed main(){
int n; cin>>n;
vector<int> a;
for(int i=0;i<=n;i++){
int x;
cin>>x;
a.pb(x);
cnt[x]++;
}
setkaijo(114514);
setinv(114514);
int db = -1;
for(int i=1;i<=n;i++){
if(cnt[i] == 2)db=i;
}
vector<int> pos;
for(int i=0;i<=n;i++){
if(a[i] == db)pos.pb(i);
}
vector<ll> ans;
ans.pb(n);
for(int k=2;k<=n;k++){
ll tmp = 0;
tmp += comb(n-1,k);
tmp += 2 * comb(n-1,k-1);
tmp += comb(n-1,k-2);
tmp -= comb( pos[0]+n-pos[1], k-1 );
tmp += inf;
tmp %= inf;
ans.pb(tmp);
}
ans.pb(1);
for(int i=1;i<=n+1;i++){
cout<<ans[i-1]<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int N;
int ma;
int main()
{
cin >> N;
for(int i = 1;i <= N;i++)
{
if((i + 1) * i / 2 >= N)
{
ma = i;
break;
}
}
for(int i = ma;i >= 1;i--)
{
if(N - i >= 0)
{
cout << i << endl;
N -= i;
}
}
return 0;
}
| 0
| 85,047,517
|
#include <iostream>
#include <string>
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define SIZE(x) ll(x.size())
typedef long long ll;
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int num = SIZE(S);
REP(i, num) {
if (S == T) {
cout << "Yes";
return 0;
} else {
string tmp = T;
tmp.erase(num - 1);
T = T[num - 1] + tmp;
}
}
cout << "No";
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll W, H, N;
cin >> W >> H >> N;
ll min_x = 0, max_x = W;
ll min_y = 0, max_y = H;
for (ll i = 0; i < N; i++)
{
ll x, y, a;
cin >> x >> y >> a;
switch (a)
{
case 1:
min_x = max(min_x, x);
break;
case 2:
max_x = min(max_x, x);
break;
case 3:
min_y = max(min_y, y);
break;
case 4:
max_y = min(max_y, y);
break;
default:
break;
}
}
cout << max(max_x - min_x, 0LL) * max(max_y - min_y, 0LL) << endl;
}
| 0
| 74,305,436
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int t;
cin>>t;
long long int ans = 0, max = t;
for(int i = 1; i < n; i++) {
cin>>t;
if(t < max) {
ans += max-t;
}
else if(t > max) {
max = t;
}
}
cout<<ans<<endl;
return 0;
}
|
#pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
bool isprime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll ketasum(ll n) {
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#define double long double
#pragma endregion
signed main() {
vector<vector<int>>A(3, vector<int>(3));
rep(i, 3) {
rep(j, 3) {
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
vector<int>b(N);
rep(i, N) {
cin >> b.at(i);
}
rep(i, 3) {
rep(j, 3) {
rep(k, N) {
if (A.at(i).at(j) == b.at(k)) {
A.at(i).at(j) = 0;
}
}
}
}
bool a = false;
rep(i, 3){
rep(j, 3) {
if (A.at(i).at(0) + A.at(i).at(1) + A.at(i).at(2) == 0 || A.at(0).at(j) + A.at(1).at(j) + A.at(2).at(j) == 0 || A.at(0).at(0) + A.at(1).at(1) + A.at(2).at(2) == 0 || A.at(0).at(2) + A.at(1).at(1) + A.at(2).at(0) == 0) {
a = true;
}
}
}
if (a) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0
| 24,569,818
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll gcd(ll a, ll b) { return __gcd(a,b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
ll modinv(ll a) {
return modpow(a, MOD - 2);
}
int main(){
int N,L,a[100000];
cin>>N>>L;
rep(i,N) cin>>a[i];
int ma(0);
int tmpi(0);
for (int i(0); i < N - 1; i++){
if (a[i] + a[i+1] > ma){
ma = max(ma,a[i] + a[i+1]);
tmpi = i;
}
}
if (ma < L){
cout << "Impossible" << endl;
}else{
cout << "Possible" << endl;
for (int i(0);i<tmpi;i++){
cout << i+1 << endl;
}
for (int i(N-2);i>=tmpi;i--){
cout << i+1 << endl;
}
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};
int main(void) {
string s, t;
cin >> s >> t;
vector<ll> ss(27, 0), ts(27, 0);
for(ll i = 0; i < s.length(); i++){
char a = s[i], b = t[i];
ss[a-97]++; ts[b-97]++;
}
sort(ss.begin(), ss.end());
sort(ts.begin(), ts.end());
bool ok = true;
for(ll i = 0; i < 27; i++){
if(ss[i]!=ts[i])
ok = false;
}
if(ok==true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0
| 34,800,343
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
template<typename T>
void print(T x) {
cout << x << endl;
}
int main(void) {
int n; cin >> n;
string s; cin >> s;
int k; cin >> k; k--;
char x = s[k];
rep(i, s.size()) {
if(s[i]!=x) s[i] ='*';
}
print(s);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long ;
void solve() {
int n; cin >> n;
vector<ll> sum(n+1);
sum[0] = 0;
for (int i = 1; i <= n; i++) {
int x; cin >> x;
sum[i] = sum[i-1] + x;
}
ll res = 1ll<<60;
for (int i = 1; i < n; i++) {
ll d = abs(2*sum[i] - sum[n]);
res = min(res, d);
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| 0
| 5,445,539
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
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<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
int n; cin >> n;
int now_x = 0,now_y = 0;
int time = 0;
rep(i,n){
int t,x,y; cin >> t >> x >> y;
int dist = abs(x-now_x)+abs(y-now_y);
int dif = t - time;
if(dif < dist){
out("No");
return 0;
}
if(abs(dist - (dif))%2 == 1){
out("No");
return 0;
}
now_x = x,now_y = y;
time = t;
}
out("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
lint N;
cin >> N;
if (N % 2 == 1) {
cout << 0 << endl;
return 0;
}
N /= 2;
lint x = 5;
lint ans = 0;
while (x <= N) {
ans += (lint)N / (x);
x *= 5;
}
cout << ans << endl;
return 0;
}
| 0
| 91,833,021
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
bool dp[100010]={0};
string div[] = { "dream", "dreamer", "erase", "eraser" };
string S; cin >> S;
dp[0] = 1;
for (int i = 0; i < S.size(); ++i) {
if (!dp[i]) continue;
for (string s : div) {
if (s == S.substr(i, s.size())) {
dp[i + s.size()] = 1;
}
}
}
cout << (dp[S.size()] ? "YES" : "NO") << endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
#define il inline
constexpr int N=1e5+5;
struct EDGE
{
int to,nxt,w;
};
int n,cnt;
EDGE e[N*2];
int dis[N],head[N];
bool vis[N];
queue<int>q;
il void add(int x,int y,int z)
{
e[++cnt].to=y;
e[cnt].nxt=head[x];
e[cnt].w=z;
head[x]=cnt;
}
void SPFA()
{
for(int i=0;i<n;++i) dis[i]=1e9;
dis[1]=1,q.push(1);
while(!q.empty())
{
int x=q.front();
q.pop();
vis[x]=0;
for(int i=head[x];i;i=e[i].nxt)
{
if(dis[e[i].to]>dis[x]+e[i].w)
{
dis[e[i].to]=dis[x]+e[i].w;
if(!vis[e[i].to]) q.push(e[i].to),vis[e[i].to]=1;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cout.tie(0),cin.tie(0);
cin>>n;
for(int i=0;i<n;++i) add(i,(i+1)%n,1);
for(int i=0;i<n;++i) add(i,(i*10)%n,0);
SPFA();
printf("%d\n",dis[0]);
return 0;
}
| 0
| 6,931,198
|
#include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd;
};
vector<vector<int>>adj(10);
int sum,n,m,visited[11];
void dfs(int i){
visited[i]=1;
int flag=1;
for(int j=1;j<=n;++j){
if(!visited[j]){
flag=0;
}
}
if(flag){
sum++;
return;
}
for(auto x:adj[i]){
if(!visited[x]){
dfs(x);
visited[x]=0;
}
}
}
int main()
{
_IOS();
cin>>n>>m;
while(m--)
{
int a,b;
cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(1);
cout<<sum;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 1000000000000;
ll num;
bool judge;
for(ll i = 1; i*i <= N; i++){
if(N % i == 0){
num = N / i + i - 2;
ans = min(ans, num);
}
}
cout << ans << endl;
}
| 0
| 62,643,803
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
ll ans =0;
vector<ll> C(N),S(N),F(N);
for(int i=0;i<N-1;i++){
cin >> C[i] >>S[i] >>F[i];
}
for(int i=0;i<N;i++){
ll ans =0;
for(int j=i;j<N-1;j++){
if(ans<=S[j]){
ans = S[j];
}else{
ll n= (ans-S[j] +F[j]-1)/F[j];
ans = S[j]+F[j]*n;
}
ans += C[j];
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#define N_MAX 1000000000
using namespace std;
int func(long long n){
static int cnt = 0;
if(cnt++ > 64)return -1;
char ans;
cout << "? " << n << endl;
cin >> ans;
if(ans == 'Y')return 1;
return 0;
}
int main(void){
long long left = (long long)N_MAX*10-1, right = (long long)N_MAX*100;
while(left + 1 < right){
long long mid = (left + right) / 2;
if(func(mid)){
right = mid;
}else{
left = mid;
}
}
while(right%10 == 0)right /= 10;
if(right == 1){
while(func(right*2) == 0){
right *= 10;
}
cout << "! " << right << endl;
}else{
left = 10;
right--;
while(func(right*left) == 1){
left *= 10;
}
left /= 10;
right++;
cout << "! " << right*left << endl;
}
}
| 0
| 90,828,626
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
void solve1()
{
int n;
cin >> n;
vector < int > v(n + 2 , 0);
for( int i = 1; i <= n; i++ ){
cin >> v[i];
}
int sum = 0;
for( int i = 1; i <= n; i++ ){
sum = sum + abs(v[i] - v[i - 1]);
}
sum += abs(v[n]);
for( int i = 1; i < n; i++ ){
cout << sum - abs(v[i] - v[i - 1]) - abs(v[i] - v[i + 1]) + abs(v[i - 1] - v[i + 1]) << "\n";
}
cout << sum - abs(v[n]) + abs(v[n - 1]) - abs(v[n] - v[n - 1]);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0); srand(time(0));
int cghf = 1;
while( cghf-- ){
solve1();
}
}
|
#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 n;
cin >> n;
vector<int> a(100005);
rep(i,n){
int x;
cin >> x;
a[x]++;
}
int ans = 0;
rep(i,100000){
int cnt = 0;
rep(j,3) cnt += a[i+j];
ans = max(ans, cnt);
}
cout << ans << endl;
}
| 0
| 100,131,126
|
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
typedef pair<int, int> Student;
priority_queue<Student, vector<Student>, greater<Student>> que;
int num;
for(int i=0; i<N; i++){
cin >> num;
que.push(Student(num, i));
}
while (!que.empty()){
Student student = que.top();
que.pop();
cout << student.second + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool ok(vector<bool> &is_sheep, bool s1, bool s2) {
is_sheep[0] = s1;
is_sheep[1] = s2;
for (int i=1; i<n-1; i++) {
if (is_sheep[i]) {
if (s[i] == 'o') {
is_sheep[i+1] = is_sheep[i-1];
} else {
is_sheep[i+1] = !is_sheep[i-1];
}
} else {
if (s[i] == 'o') {
is_sheep[i+1] = !is_sheep[i-1];
} else {
is_sheep[i+1] = is_sheep[i-1];
}
}
}
if (is_sheep[n-1]) {
if (s[n-1] == 'o' ^ is_sheep[0] == is_sheep[n-2]) {
return false;
}
} else {
if (s[n-1] == 'x' ^ is_sheep[0] == is_sheep[n-2]) {
return false;
}
}
if (is_sheep[0]) {
return s[0] == 'o' ^ is_sheep[n-1] != is_sheep[1];
} else {
return s[0] == 'x' ^ is_sheep[n-1] != is_sheep[1];
}
}
int main() {
cin>>n;
cin>>s;
vector<bool> is_sheep(n);
bool state[2] = {true, false};
for (bool s1: state) {
for (bool s2: state) {
if (ok(is_sheep, s1, s2)) {
for (bool b: is_sheep) {
if (b) {
cout<<"S";
} else {
cout<<"W";
}
}
cout<<endl;
return 0;
}
}
}
cout<<-1<<endl;
}
| 0
| 76,904,805
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
ll a[n],b[n];
REP(i,n)cin>>a[i]>>b[i];
ll ans=0;
REPD(i,n)
{
if((a[i]+ans)%b[i]!=0)
{
ans+=b[i]-(a[i]+ans)%b[i];
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int solve(int n, int m, int p) {
int a[n];
int ret = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ret += 100*a[i];
}
if (a[m-1]) ret = ret * (100-p)/100 / a[m-1];
else ret = 0;
return ret;
}
int main(void){
int n, m, p;
vector<int> ans;
while (1) {
cin >> n >> m >> p;
if (!n && !m && !p) break;
ans.push_back(solve(n, m, p));
}
for (auto &i: ans) {
cout << i << endl;
}
}
| 0
| 40,600,035
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int m =0;
int n1=n;
while(n1!=0){
m = m+(n1%10);
n1=n1/10;
}
if(!(n%m)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0, 0, -1, -1, 1, -1, 1};
const int dy[] = {0, 1, -1, 0, -1, 1, 1, -1};
void debug() {
cerr << "\n";
}
template<typename Type1, typename... Type2>
void debug(Type1 a, Type2... b) {
cerr << a << " ";
debug(b...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
char c; cin >> c;
if(islower(c)) cout << "a";
else cout << "A";
return 0;
}
| 0
| 54,217,211
|
#include<iostream>
using namespace std;
int main(){
int a=1;
int b=1;
for(a=1;a<10;a++){
for(b=1;b<10;b++){
cout << a <<"x"<<b<<"="<<a*b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz size
#define se second
#define fe first
#define mper make_pair
#define all(x) x.begin(), x.end()
#define mal ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define vl vector<ll>
#define vi vector<int>
#define vli vector <pair <ll, int> >
#define vll vector <pair <ll, ll> >
#define vii vector <pair <int, int> >
using namespace std;
ll n, ans;
string s[306];
int main(){
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> s[i];
}
for(int k = 0; k < n; ++k) {
bool lol = 0;
for(int i = 1; i <= n; ++i) {
for(int j = 0; j < n; ++j) {
ll A = (j + k) % n + 1;
ll B = i - 1;
ll ka = A;
ll kb = (B - k);
if(kb < 0) {kb += n;}
if(s[i][j] != s[A][kb]) {lol = 1;}
}
}
if(!lol) {ans++;}
}
cout << (ans * n * 1ll);
return 0;
}
| 0
| 20,145,756
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec)
{ for (auto v : vec) os << v << ' '; os << '\n'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa)
{ os << '(' << pa.first << ',' << pa.second << ')'; return os; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T)
{ cerr << " " << H; debug_out(T...); }
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 = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
vector<int> G[200000];
vector<int> X(200000);
vector<ll> ans(200000);
void dfs(int v = 0, int p = -1) {
ans[v] += X[v];
for (auto u : G[v]) {
if (u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}
void solve() {
int n, q;
cin >> n >> q;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
rep(i, q) {
int p, x;
cin >> p >> x;
p--;
X[p] += x;
}
dfs();
rep(i, n) cout << ans[i] << " \n"[i == n - 1];
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> ac(n);
rep(i,m) {
int p;
string s;
cin >> p >> s;
p--;
if (ac.at(p).first == 0) {
if (s == "WA") ac.at(p).second++;
if (s == "AC") ac.at(p).first = 1;
}
}
int nac = 0, np = 0;
rep(i,n) {
if (ac.at(i).first == 1) {
nac++;
np += ac.at(i).second;
}
}
cout << nac << ' ' << np << endl;
return 0;
}
| 0
| 5,393,339
|
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
long long int Fraction = 1;
for(int i = 0; i < n; i++){
Fraction *= n-i;
}
printf("%lld\n", Fraction);
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);
string s; cin >> s;
deque<char> q;
int n = s.size();
int ans = 0;
rep(i, n) q.push_back(s[i]);
while(!q.empty()) {
if(q.size() == 1) q.pop_front();
else if(q.front() == q.back()) {
q.pop_front(); q.pop_back();
} else if(q.front() == 'x') {
ans++; q.pop_front();
} else if(q.back() == 'x') {
ans++; q.pop_back();
} else {
cout << -1 << "\n";
return 0;
}
}
cout << ans << "\n";
return 0;
}
| 0
| 54,796,131
|
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main () {
int n,Q;
cin >> n >> Q;
dsu d(n);
while(Q--) {
int type,u,v;
cin >> type >> u >> v;
if(type == 0) d.merge(u,v);
if(type == 1) cout << d.same(u,v) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
vector<int> A_cnt(N);
int count=0;
for(int i=0; i<N; i++){
int a; cin >> a;
if(A_cnt.at(a-1) == 0){
count++;
}
A_cnt.at(a-1)++;
}
sort(A_cnt.rbegin(),A_cnt.rend());
int ans = 0;
for(int i=K; i<count; i++){
ans += A_cnt.at(i);
}
cout << ans << endl;
}
| 0
| 87,127,672
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define rep(i, n) for(int i = 0;i < n;i++)
#define reprb(i, n) for(int i = n;i >= 0;i--)
#define reps(i, m, n) for(int i = m;i < n;i++)
#define repsb(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
vector<int> a;
int main(int argc,char * argv[])
{
int n,in,mi=0;
while(true)
{
cin>>n;
if(n==0) break;
rep(i,n){
cin>>in;
a.pb(in);
mi=max(mi,in);
}
rep(i,n){
rep(j,n){
if(i!=j) mi=min(mi,abs(a[i]-a[j]));
}
}
cout<<mi<<endl;
a.clear();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#include <map>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mod 998244353
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define vv(z,a,b) vector<vector<int>>z(a,vector<int>(b))
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(c) begin(c),end(c)
#define pp pair<int,int>
#define fix(n) fixed << setprecision(n)
#define gmax(a,b) __gcd(a,b)
#define gmin(a,b) a/__gcd(a,b)*b
using namespace std;
class binary{
public:
bool isOK(int index, int key,vi a) {
if (a[index] >= key) return true;
else return false;
}
int binary_search(int key,vi a) {
int ng = -1;
int ok = (int)a.size();
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key,a)) ok = mid;
else ng = mid;
}
return ok;
}
}obj;
int main(){
int n,x,t;
cin>>n>>x>>t;
int b=n%x;
int a=n/x;
if(b!=0)a++;
int ans=t*a;
cout<<ans<<endl;
return 0;
}
| 0
| 9,918,508
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=2e5+5;
typedef vector<vector<lint>> mat;
mat mtx{
{1,0,1},
{1,0,0},
{0,1,0},
};
vector<lint> F{0,0,1};
mat mul(mat &A,mat &B){
mat C(A.size(),vector<lint>(B[0].size()));
rep(i,A.size()) rep(j,B.size()) rep(k,B[0].size()){
C[i][k]=(C[i][k]+A[i][j]*B[j][k])%MOD;
}
return C;
}
mat powmat(mat A,lint n){
mat B(A.size(),vector<lint>(A.size()));
rep(i,A.size()) B[i][i]=1;
while(n){
if(n&1) B=mul(B,A);
A=mul(A,A);
n>>=1;
}
return B;
}
lint calc(lint n){
mat A=mtx;
A=powmat(A,n-1);
lint res=0;
rep(i,A.size()) res=(res+A[A.size()-1][i]*F[A.size()-1-i])%MOD;
return res;
}
int main(void){
int S;
cin >> S;
cout << calc(S) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n, m;
cin >> n >> m;
vector<bool> fst(n, false);
vector<bool> snd(n, false);
int a, b;
for(int im=0;im<m;im++) {
cin >> a >> b; a--; b--;
if(a==0) fst.at(b) = true;
if(b==n-1) snd.at(a) = true;
}
queue<int> q;
for(int in=0;in<n;in++) {
if(fst.at(in)==true) q.push(in);
}
int v;
while(!q.empty()) {
v = q.front(); q.pop();
if(snd.at(v)==true) {
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
| 0
| 20,134,834
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int a,b;
cin>>a>>b;
int pow=1;
int ans=0;
while(pow<=b && a)
{
pow*=2;
ans++;
a--;
}
if(a)
{
cout<<pow+a*b<<endl;
}
else
cout<<pow<<endl;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define f1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define cases ll t;cin >> t;while(t--)
#define rr return 0
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define deb(a) std::cerr<<#a<<"="<<(a)<<"\n"
#define deb2(a,b) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define deb3(a,b,c) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
const int MOD = 1000 * 1000 * 1000 + 7;
ll getRes(char grid[1001][1001],ll n,ll m)
{
vvll dp(n + 1, vll(m + 1, 0));
dp[0][0] = 1;
for (ll i = 0; i < n; i++)
{
for (ll j = 0; j < m; j++)
{
if (i == 0 && j == 0)
dp[i][j] = 1;
if (grid[i][j] == '.')
{
if (i > 0 && grid[i - 1][j] != '#')
(dp[i][j] += dp[i - 1][j]%MOD) %= MOD;
if (j > 0 && grid[i][j - 1] != '#')
(dp[i][j] += dp[i][j - 1] % MOD) %= MOD;
}
}
}
return dp[n - 1][m - 1] % MOD;
}
void solve()
{
ll n, m;
cin >> n >> m;
char grid[1001][1001];
f(i, n)
f(j, m)
cin >> grid[i][j];
ll res = getRes(grid, n, m);
cout << res % MOD << "\n";
}
int main()
{
fast;
ll t = 1;
while (t--)
{
solve();
}
rr;
}
| 0
| 17,921,767
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
ll n;
cin >> n;
ll ans=0,a,p=0;
for (int i=0; i<n; i++){
cin >> a;
if (a<p) {
ans+=p-a;
}
else p=a;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int K = 10000;
bool XC[3*K], YC[3*K], XCN[3*K], YCN[3*K];
int main() {
string S; int N, X, Y;
cin >> S >> X >> Y;
N = S.size();
bool mode = 0;
vector<int> xs, ys;
int x = N, cnt = 0;
for(int i=0; i<N; i++) {
if(S[i] == 'T') {x = i; break;}
++cnt;
}
XC[cnt + K] = YC[K] = 1;
for(int i=x, c=0; i<N; i++) {
if(S[i] == 'T') {
if(c) {
if(mode) ys.push_back(c);
else xs.push_back(c);
c = 0;
}
mode = !mode;
}
else {
++c;
if(i == N-1 && c) {
if(mode) ys.push_back(c);
else xs.push_back(c);
}
}
}
for(auto& it: xs) {
for(int i=-8000; i<=8000; i++) if(XC[i + K]) XCN[i - it + K] = XCN[i + it + K] = 1;
for(int i=-8000; i<=8000; i++) XC[i + K] = XCN[i + K], XCN[i + K] = 0;
}
for(auto& it: ys) {
for(int i=-8000; i<=8000; i++) if(YC[i + K]) YCN[i - it + K] = YCN[i + it + K] = 1;
for(int i=-8000; i<=8000; i++) YC[i + K] = YCN[i + K], YCN[i + K] = 0;
}
if(XC[X + K] && YC[Y + K]) puts("Yes");
else puts("No");
return 0;
}
| 0
| 56,725,264
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long ll;
ll n,l; cin>>n>>l;
string p;
vector<string>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=0;i<n;i++)
{
cout<<v[i];
}
cout<<p<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int used[300000];
int main(){
int N;
cin >> N;
int A[(1<<N)+1];
for(int i=0; i<(1<<N); i++){
cin >> A[i];
}
A[1<<N] = -1;
long long data[1<<N][2];
data[0][0] = 0; data[0][1] = -1;
for(int i=1; i<(1<<N); i++){
vector<int> arr;
arr.push_back(i);
for(int j=0; j<N; j++){
if(i & (1<<j)){
int bit = i &~(1<<j);
if(used[data[bit][0]] == 0){
used[data[bit][0]] = 1;
arr.push_back(data[bit][0]);
}
if(data[bit][1] != -1){
if(used[data[bit][1]] == 0){
arr.push_back(data[bit][1]);
used[data[bit][1]] = 1;
}
}
}
}
int ma = (1<<N), ma2 = (1<<N);
for(int j=0; j<arr.size(); j++){
if(A[ma] < A[arr[j]]) ma = arr[j];
}
for(int j=0; j<arr.size(); j++){
if(arr[j] != ma){
if(A[ma2] < A[arr[j]]) ma2 = arr[j];
}
}
data[i][0] = ma, data[i][1] = ma2;
for(int j=0; j<arr.size(); j++){
used[arr[j]] = 0;
}
}
int ans[1<<N];
ans[0] = 0;
for(int i=1; i<(1<<N); i++){
ans[i] = max(ans[i-1], A[data[i][0]] + A[data[i][1]]);
cout << ans[i] << endl;
}
return 0;
}
| 0
| 77,149,417
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int> > dp(s.size() + 1, vector<int>(t.size() + 1, 100000));
dp[0][0] = 0;
for (int i = 0; i <= s.size(); i++) dp[i][0] = i;
for (int j = 0; j <= t.size(); j++) dp[0][j] = j;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
int cnt = 1;
if (s[i] == t[j]) cnt = 0;
dp[i + 1][j + 1] =
min({dp[i][j + 1] + 1, dp[i + 1][j] + 1, dp[i][j] + cnt});
}
}
cout << dp[s.size()][t.size()] << endl;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (1LL<<60)
#define endl "\n"
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
typedef unsigned long long int ull;
typedef long long lint;
int main(void){
int N;
bool ans=true;
cin >> N;
int dis[N]={};
rep(i,N){
int x; cin >> x;
dis[x]++;
}
int remain=N,p=N-1;
while(true){
if(dis[p]==1) ans=false;
else if(dis[p]>=2){
dis[p]-=2;
remain-=2;
break;
}
p--;
}
int L=p-1,able;
while(L>0){
p--;
if(p==0 && L>0){
ans=false;
break;
}
int minus=min(L,2);
if(dis[p]<minus) ans=false;
dis[p]-=minus;
L-=minus;
remain-=minus;
able=p;
}
able++;
rep(i,N) if(i<able && dis[i]>0) ans=false;
if(ans) cout << "Possible" << endl;
else cout << "Impossible" << endl;
}
| 0
| 95,690,219
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
for(int i=0,x;i<10;i++)
cin>>x,pq.push(x);
for(int i=0;i<3;i++,pq.pop())
cout<<pq.top()<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int ar[10005];
lli dp[10005][200][2];
lli getSum(int pos , int n , lli d, lli sum , bool flag)
{
if(pos > n) {
if(sum==d) return 1;
return 0;
}
if(dp[pos][sum][flag] != -1) return dp[pos][sum][flag];
int limit = 9;
if(!flag) limit = ar[pos];
lli res = 0;
for(int i=0;i<=limit;i++)
{
if(flag || i != limit)
res +=getSum(pos + 1 , n ,d, (sum + !(!i)) , true);
else
res+=getSum(pos + 1 , n ,d, (sum + !(!i)) , false);
}
return dp[pos][sum][flag] = res;
}
int digitSum(string num)
{
int res = 0;
for(char digit : num)
res += digit - '0';
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a;
lli d=0,ans=0;
cin>>a;
cin>>d;
lli L;
for(int i=0;i<a.size();i++)
ar[i+1] = a[i] - '0';
memset(dp , -1 , sizeof dp);
L = getSum(1 , a.size() , d, 0 , 0);
cout<<L<<endl;
}
| 0
| 62,381,656
|
#include<stdio.h>
#include<math.h>
int main()
{
int N;
scanf("%d", &N);
int i, a[1000], b[1000], c[1000];
for (i = 0; i < N; i++)
{
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < N; i++)
{
float A = a[i], B = b[i], C = c[i];
float d = fmax(A, B), sm1 = fmin(A, B);
float biggest = fmax(d, C), sm2 = fmin(d, C);
if (pow(biggest, 2) == (pow(sm1, 2) + pow(sm2, 2)))printf("YES\n");
else printf("NO\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,p,x;
int a[100];
int sum;
while(1){
cin>>n>>m>>p;
if(n==0 && m==0 && p==0) break;
sum=0;
for(int i=0;i<100;i++){
a[i]=0;
}
for(int i=0;i<n;i++){
cin>>x;
a[i]=x;
sum+=x;
}
if(a[m-1]!=0){
sum=sum*(100-p);
cout<<sum/a[m-1]<<endl;
}
else cout<<0<<endl;
}
return 0;
}
| 0
| 13,943,959
|
#include <stdio.h>
int main(void){
int a,b;
scanf("%d%d",&a,&b);
printf("%d %d %.12lf\n",a/b,a%b,(double)a/b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
inline double inp(pair<double, double> a, pair<double, double> b) {
return a.first * b.first + a.second * b.second;
}
bool cmp(pair<double, double> a, pair<double, double> b) {
return atan2(a.second, a.first) > atan2(b.second, b.first);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int n;
cin >> n;
vector<pair<double, double>> z(n);
rep(i, 0, n) cin >> z[i].first >> z[i].second;
sort(z.begin(), z.end(), cmp);
double ans = 0;
rep(i, 0, n) {
double s = 0, t = 0;
rep(j, 0, n) {
int k = (i + j) % n;
s += z[k].first;
t += z[k].second;
ans = max(ans, sqrt(s * s + t * t));
}
}
cout << ans << endl;
return 0;
}
| 0
| 82,135,985
|
#include <stdio.h>
#include <string.h>
int main(){
int Tc;
scanf("%d",&Tc );
long long int data[Tc]={}; long long int Tot=1;
for (int i=0; i<Tc; i++){
scanf("%lld", &data[i]);
}
for (int j=0; j<Tc; j++){
if (data[j]==0){
printf("0");
return 0;
}
}
for(int k=0; k<Tc; k++){
if (data[k]>1000000000000000000/Tot){
printf ("-1");
return 0;
} else {
Tot *= data[k];
}
}
printf ("%lld", Tot);
return 0;
}
|
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 1e5 + 10 , P = 1e9 + 7;
int n , a[N] , cnt[N] , fac[N] = {1} , ifac[N];
int inv(int x){return x == 1 ? 1 : P - ll(P / x) * inv(P % x) % P;}
int comb(int a,int b){return ll(fac[a])*ifac[b]%P*ifac[a-b]%P;}
int main(){
rep(i,1,N) fac[i] = ll(fac[i-1]) * i % P;
ifac[N - 1] = inv(fac[N - 1]);
per(i,1,N) ifac[i-1] = ll(ifac[i]) * i % P;
scanf("%d",&n);
rep(i,0,n+1) {
scanf("%d",a + i);
cnt[a[i]] ++;
}
rep(i,1,n+1) if(cnt[i] == 2) {
int l = find(a , a + n + 2 , i) - a;
int r = find(a + l + 1 , a + n + 2 , i) - a;
int remain = n + 1 - (r - l + 1);
rep(k,1,n+2) {
int ans = comb(n + 1 , k);
if(remain + 1 >= k) {
ans -= comb(remain , k - 1);
if(ans < 0)
ans += P;
}
printf("%d\n",ans);
}
return 0;
}
return 0;
}
| 0
| 81,982,381
|
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#define INF 1000000000000000
#define MOD 1000000007
using PII = pair<int64_t, int64_t>;
using VI = vector<int64_t>;
using VVI = vector<VI>;
using VS = vector<string>;
using VP = vector<PII>;
using i64 = int64_t;
template<typename T> void invec(vector<T> &A){for(T& a : A) cin >> a;}
#include <boost/multiprecision/integer.hpp>
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
VI T(N), A(N); invec(T), invec(A);
i64 cnt = 1;
i64 Tmax = *max_element(ALL(T));
i64 Amax = *max_element(ALL(A));
if (Tmax != Amax){
cout << "0\n";
return 0;
}
int i = 1, j = N - 2;
for(; i < N && T[i] < Tmax; ++i){
if (T[i-1] == T[i]) (cnt *= T[i]) %= MOD;
}
for(; j >= 0 && A[j] < Amax; --j){
if (A[j] == A[j + 1]) (cnt *= A[j]) %= MOD;
}
if (N > 1 && j < i){
cout << "0\n";
return 0;
}
if (T[0] == Tmax) i = 0;
if (A[N-1] == Amax) j = N-1;
cout << cnt * boost::multiprecision::powm(Tmax, max(0, j-i - 1), MOD) % MOD << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll h,w;cin >> h >>w;
vector<string> g(h);rep(i,h)cin >> g[i];
vvl seen(h,vl(w));seen[0][0]=1;
rep(i,h){
rep(j,w){
if(g[i][j]=='#')continue;
if(i+1<h)seen[i+1][j]+=seen[i][j],seen[i+1][j]%=MOD;
if(j+1<w)seen[i][j+1]+=seen[i][j],seen[i][j+1]%=MOD;
}
}
cout << seen[h-1][w-1] <<endl;
}
| 0
| 71,676,833
|
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int findSum(string s) {
int sum = 0;
for (int i = 0; i < s.length(); i++) {
sum += s[i] - '0';
}
return sum;
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
string s;
cin >> s;
if (findSum(s) % 9 == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main(){
ll n, k;
cin >> n >> k;
vector<P> sushi(n);
rep(i, n){
ll t, d;
cin >> t >> d;
t--;
sushi[i] = {d, t};
}
sort(sushi.begin(), sushi.end());
reverse(sushi.begin(), sushi.end());
ll ans = 0;
vector<ll> used(n,0);
stack<ll> sta;
ll res = 0;
ll kind = 0;
rep(i, k){
res += sushi[i].first;
if(used[sushi[i].second]++==0) kind++;
else sta.push(sushi[i].first);
}
ans = res + kind * kind;
for(int i = k; i < n && sta.size(); i++){
if(used[sushi[i].second]++)continue;
ll a = sta.top();
sta.pop();
res -= a;
res += sushi[i].first;
kind++;
ans = max(ans, res + kind * kind);
}
cout << ans << endl;
return 0;
}
| 0
| 28,070,752
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
template <typename T>
T gcd(T a, T b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
template <typename T>
T lcm(T a, T b) {
if (a <= b)
return b / gcd(a, b) * a;
else
return a / gcd(a, b) * b;
}
int main() {
int n;
cin >> n;
vector<ll> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
ll ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, lcm(t[i], ans));
}
cout << ans << endl;
}
|
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int N;
int A[1<<20];
int dp1[1<<20][20] = {},dp2[1<<20][20] = {};
int main(){
cin >> N;
for(int i=0;i<(1<<N);i++){
cin >> A[i];
dp1[i][0] = A[i];
}
for(int j=0;j<N;j++){
for(int i=0;i<(1<<N);i++){
priority_queue<int> Q;
if(i&(1<<j)){
Q.push(dp1[i][j+1]);
Q.push(dp2[i][j+1]);
Q.push(dp1[i][j]);
Q.push(dp2[i][j]);
Q.push(dp1[i&~(1<<j)][j]);
Q.push(dp2[i&~(1<<j)][j]);
}else{
Q.push(dp1[i][j+1]);
Q.push(dp2[i][j+1]);
Q.push(dp1[i][j]);
Q.push(dp2[i][j]);
}
dp1[i][j+1] = Q.top();
Q.pop();
dp2[i][j+1] = Q.top();
}
}
int ans = 0;
for(int i=1;i<(1<<N);i++){
ans = max(ans,dp1[i][N]+dp2[i][N]);
cout << ans << endl;
}
}
| 0
| 10,447,765
|
#include<iostream>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<list>
#include<map>
#include<tuple>
#include<cmath>
#include<bitset>
using namespace std;
int main()
{
double W, H, x, y,ans;
double S_x1, S_x2, S_y1, S_y2, S_x, S_y;
cin >> W >> H >> x >> y;
cout << double(W)*double(H) / 2 << endl;
if (x + x == W && y + y == H)
cout << '1';
else
cout << '0';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
const int INF = 1001001001;
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s.at(i);
vector<vector<int>> dp(h, vector<int>(w, INF));
if(s.at(0).at(0) == '.') dp.at(0).at(0) = 0;
else dp.at(0).at(0) = 1;
rep(i, h){
rep(j, w){
int di[] = {1, 0}, dj[] = {0, 1};
rep(k, 2){
int ni = i + di[k], nj = j + dj[k];
if(nj < 0 || w <= nj || ni < 0 || h <= ni) continue;
int add = 0;
if(s.at(i).at(j) == '.' && s.at(ni).at(nj) == '#')add++;
dp.at(ni).at(nj) = min(dp.at(ni).at(nj), dp.at(i).at(j) + add);
}
}
}
cout << dp.at(h-1).at(w-1) << endl;
return 0;
}
| 0
| 49,287,061
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=5e3+5;
struct Q{
int id[N*2],s,t,k;
LL q[N*2];
void init(){s=t=0;}
void insert(LL x,int i){
while(s<t&&i-id[s]>=k)s++;
while(s<t&&x<=q[t-1])t--;
q[t]=x,id[t]=i;t++;
}
LL top(){return q[s];}
}q;
int p[N],c[N],st[N*2],top,k;
bool vis[N];LL ans=-1e18;
void solve(){
LL sum=0,w,w1;int s=top*2;
for(int i=1;i<=top;i++)st[i+top]=st[i],sum+=c[st[i]];
if(sum>=0){
q.init(),q.k=k%top,w=0,w1=k/top;
q.insert(0,0);
ans=max(ans,sum*w1);
if(q.k)for(int i=1;i<=s;i++){
w+=c[st[i]];
ans=max(ans,sum*w1+w-q.top());
q.insert(w,i);
}
if(k>=top){
w1--,q.init(),q.k=top,w=0;
q.insert(0,0);
for(int i=1;i<=s;i++){
w+=c[st[i]];
ans=max(ans,sum*w1+w-q.top());
q.insert(w,i);
}
}
}
q.init(),q.k=k,w=0;
q.insert(0,0);
for(int i=1;i<=s;i++){
w+=c[st[i]];
ans=max(ans,w-q.top());
q.insert(w,i);
}
}
int main(){
int n,x;scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)scanf("%d",p+i);
for(int i=1;i<=n;i++)scanf("%d",c+i);
for(int i=1;i<=n;i++){
if(vis[i])continue;
top=0,x=i;
do{
st[++top]=x,vis[x]=1;
x=p[x];
}while(x!=i);
solve();
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
ll N,X,mod; cin >> N >> X >> mod;
vector<ll> lib(mod,-1);
vector<ll> A(10000000,0);
A[1] = X;
ll line1;
for(ll i=2; i<=10000000; i++) {
A[i] = (A[i-1]*A[i-1])%mod;
if(lib[A[i]]>0) {
line1 = i;
break;
}
else lib[A[i]] = i;
}
ll a=0,b=0,e=0;
for(int i=1; i<=lib[A[line1]]-1; i++) a+=A[i];
for(int i=lib[A[line1]]; i<=line1-1; i++) b+=A[i];
ll y = (N-lib[A[line1]]+1)/(line1-lib[A[line1]]);
ll c = y*b;
ll z = (N-lib[A[line1]]+1)%(line1-lib[A[line1]]);
ll d;
if(z==0) d=0;
else {
for(int i=lib[A[line1]]; i<=lib[A[line1]]+z-1; i++) e+=A[i];
}
ll ans = a+c+e;
cout << ans << endl;
}
| 0
| 57,859,035
|
#include <cstdio>
#include <iostream>
#include <deque>
#include <vector>
using namespace std;
int main(){
int k;
cin >> k;
while(k % 2 == 0){
k /= 2;
}
while(k % 5 == 0){
k /= 5;
}
vector<int> digitSum_mod(k, 1e9);
deque<int> dq;
digitSum_mod[1] = 1;
dq.push_back(1);
while(!dq.empty()){
int u = dq.front(); dq.pop_front();
if (digitSum_mod[u*10 % k] > digitSum_mod[u]){
digitSum_mod[u*10 % k] = digitSum_mod[u];
dq.push_front(u*10 % k);
}
if (digitSum_mod[(u+1) % k] > digitSum_mod[u] + 1){
digitSum_mod[(u+1) % k] = digitSum_mod[u] + 1;
dq.push_back((u+1) % k);
}
}
cout << digitSum_mod[0] << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b)
{
if (a < b) {
int k = a;
a = b;
b = k;
}
if (b == 0) return a;
return gcd(b, a%b);
}
int p(int n)
{
for (int i = 2; i*i <= n; i++) {
if (n%i == 0) return i;
}
return n;
}
int main()
{
int n, a, s = 0, k;
bool pwc = true, swc = false;
vector<bool> f(1'000'001, false);
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
s = gcd(a, s);
if (s == 1) swc = true;
while (pwc && (k = p(a)) != 1) {
if (f[k]) pwc = false;
f[k] = true;
while (a%k == 0) a /= k;
}
}
if (pwc) cout << "pairwise coprime" << endl;
else if (swc) cout << "setwise coprime" << endl;
else cout << "not coprime" << endl;
}
| 0
| 6,646,459
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.