code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
long long INF = 1e18;
int main(){
long long d, g;
cin >> d >> g;
vector<long long> p(d), c(d), score(d);
for(int i = 0; i < d; i++) {
cin >> p[i] >> c[i];
score[i] = (i + 1) * 100;
}
long long ans = INF;
for(int bit = 0; bit < (1 ... | /**
* author: souzai32
* created: 01.08.2020 23:22:01
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<tuple<int,int>> con(m);
int s,c;
rep(i,m){
cin >> s >> c;
con.at(i)=ma... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3000000;
const int MOD = 998244353;
int fact[N];
int ifact[N];
int C(int n, int k) {
if (k < 0 || k > n) return 0;
return 1LL * fact[n] * ifact[k] % MOD * ifact[n-k] % MOD;
}
int M(int n, int k) {
return C(n + k - 1, k - 1);
}
int n, m;
int main() ... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <map>
using namespace std;
long long A[100002] = {0};
long long S[100002] = {0};
map<long long, long long> m;
int main(int argc, char* argv[]){
int N;
long long M; //N 1.. 100000 M 2..1000000000
cin >> N >... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,M;
cin>>N>>M;
map<int,int> mp;
mp[0]=1;
int n=0;
while(N--){
int a;
cin>>a;
n=(n+a)%M;
mp[n]++;
}
int ans=0;
for(pair<int,int> p:mp)ans+=p.second*(p.second-1)/2;
cout<<ans<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll n;
cin >> n;
vec x(n),y(n);
for(ll i=0;i<n;i++) cin >> x[i] >> y[i];
for(ll i=0;i<n;... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int IN... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << ... | #include <stdio.h>
int main (){
long long int a;
long long int hasil=0;
scanf("%lld",&a);
for (int i=1 ; i<=a ; i++){
if (i%3==0 && i%5==0){
// puts("Fizzbuzz");
}
else if (i%3==0){
// puts ("Fizz");
}
else if (i%5==0){
// puts("Buzz");
}
else{
hasil=(hasil+i);
}
}
printf("%lld",hasil);
re... | 0 |
/*
DISCLAIMER: I don't expect this to AC first submit, but it'd be pretty great if it did...
-> I'm rusty af
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //gp_hash_table
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define sz(a) (int) a.size()
#define ... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N=2e5+5;
int n;
LL a[90][40];
LL ans;
int main()
{
cin>>n;
while(n--)
{
string s;
cin>>s;
LL y=0;
int u=s.size();
for(int i=0;i<s.size();i++)
if(s[i]=='.') u=i;
if(u==s.size()) s+=".";
for(int i=s.size()-u;i<=9;i++) s+="0"... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int h[N], e[N], ne[N], idx;
... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 |
#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
#include <set>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
set... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 1 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <func... | #include <iostream>
using namespace std;
#define INF 10000000
// 0: cost , 1 :time
int d[2][101][101];
int main() {
int n, m, a, b, cost, time, k, p, q, r, i, j;
while ((cin >> n >> m) && n) {
for (i = 1; i <= m; i++) {
for (j = 1; j <= m; j++) {
d[0][i][j] = d[1][j][i] ... | 0 |
// ALDS1_12_A.cpp
// Graph II - Minimum Spanning Tree
#include <iostream>
using namespace std;
const int maxN = 100;
const int INF = 2001;
int w[maxN][maxN];
int color[maxN];
int n;
static const int WHITE = 0;
static const int BLACK = 1;
int prim(int x)
{
int res = 0;
int cnt = 1;
color[x] = BLACK;
wh... | #include <algorithm>
#include <iostream>
using namespace std;
int P[10010];
void init(int N){
for (int i=0; i<N; i++) P[i] = i;
}
int root (int a){
if (P[a] == a) return a;
else {
P[a] = root(P[a]);
return P[a];
}
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b)... | 1 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n,ans,mn;
ans=1;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
}
mn=a.at(0);
for(int i=1;i<n;i++)
{
if(mn>a.at(i))
ans++;
mn=min(mn,a.at(i));
}
cout<<ans<<endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
int n;
int i=0;
int ocnt=0, bcnt=0;
int score=0;
cin >> n;
while(i < n){
cin >> str;
if(str == "OUT"){
ocnt++;
}else if(str == "HIT"){
if(bcnt < 3){
bcnt++;
}else{
score++;
}
}else if(str == "HOMER... | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define cint(a) int a; cin >> a;
#define cstr(str) string str; cin >> str;
#define vv(Type, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main(void) {
ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int a,b; cin >> a >> b;
if(abs(a-b) <= 1){
... | 0 |
# include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int inf = (int)1e9 + 7;
const ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <cstdio>
#include <iostream>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define inver(a) power(a, mod - 2)
#define F(x, y) C(x - 1 + y, y)
using namespace std;
inline char nc()
{
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EO... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll gcd(int a,int b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(int a,int b){return a*b/gcd(a,b);}
const int IN... | #include <bits/stdc++.h>
#define N 1000020
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
char s[N], t[N];
queue<int> q;
int main(int ar... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef struct{
string name;
int p,abc,de,f,s,m;
int sum;
double KORITU; //sum(収入) / 時間(abc+de)+付加時間(de*(m-1)
}K;
int main(){
int n;
int A,B,C,D,E;
while(1){
cin >> n;
if(n==0)break;
K data[51];
K temp;
for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#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 |
#include <cstdio>
#include <algorithm>
using namespace std;
const char *solve(){
int c[20] = {};
int a;
for(int i = 0; i < 5; ++i){
if(scanf("%d,", &a) == EOF){ return 0; }
++c[a];
}
c[14] = c[1];
int mc = 0, ms = 0, p = 0;
for(int i = 1; i < 14; ++i){
mc = max(mc, c[i]);
if(c[i] > 1){ ++p; }
int s =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> primes;
rep2(i, 2, 55555) {
bool flag = true;
rep(j, primes.size()) {... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
bool cmp(const pair<ll,ll> &a, const pair<ll,ll> &b){
if(a.first==b.first)return a.second > b.second;
else return a.first < b.first;
}
int main()
{
ll n ;
cin >> n ;
vector<pair<ll,ll>>... | #include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(), (x).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int a; cin>>a;
if(a<=111){
cout<<111<<endl;
}else if(a<=222){
cout<<222<<endl;
}else if(a<=333){
cout<<333<<endl;
}else if(a<=444){
cout<<444<<endl;
}else if... | 1 |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2020.08.20 03:18:30
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int n) {
par.resize(n, -1);
}
int root(int x) {
if (par[x] < 0) retu... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using pii = pair<int, int>;
using vi = vector<int>;
using lint = lon... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int... | 1 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define fastcin() ios_base::sync_with_stdio(false); cin.tie(0)
using namespace std;
typedef pair<int, int> ii;
int Ceil(int a, int b) { return (a + b - 1) / b; }
int m;
signed main()
{
int s = 0, dig = 0;
cin >> ... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long N, K;
double P[200000];
int main(){
cin >> N >> K;
for(long long i = 0; i < N; i++) {
double p;
cin >> p;
P[i] = (1.0 + p)/2.0;
}
double ans = 0;
double sum = 0;
for(long long i = 0; i < K; i++) {
sum += P[i];
}
ans = sum;
for(long long i = K... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll Mod = 1000000007;
bool exists(vector<ll>& vec,ll x)
{
auto pos = lower_bound(vec.begin(),vec.end(),x);
if(pos == vec.end())return false;
return *pos == x;
}
void solve(ll N, ll M, vector<ll> A, vector<ll> B)
{
ll ans = 1;
... | 0 |
#include <iostream>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
double x1,y1,x2,y2;
scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
printf("%4lf\n",sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
class point{
public:
double x, y;
int set();
};
int point::set()
{
cin >> x >> y;
return 0;
}
int main()
{
point P1, P2;
P1.set();
P2.set();
cout << fixed << sqrt((P1.x - P2.x)*(P1.x - P2.x) + (P1.y - P2.y)*(P1.y - P2.y)) << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define reg register
#define pr std::pair<int, int>
#define fi first
#define se second
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define lep(i, l, r) for (int i... | #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int pds=998244353;
const int N=1000086;
int q1[N+5],q2[N+5];
int Pow(int a,int b)
{
int ans=1;
for(;b;b>>=1,a=1ll*a*a%pds)
if(b&1) ans=1ll*ans*a%pds;
return ans;
}
void Init()
{
q1[0]=1;
for(int i=1;i<=N;i++)
... | 0 |
//Heaplax
//别让自己后悔
#include<bits/stdc++.h>
#define N 2005
#define LL long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
bool a[2001][2001];
int res[2001][2001],v2[2001][2001],v1[2001][2001];
int main(){
IOS
int n,m,q;
cin>>n>>m>>q;
for(int i=1;i<=n;i++){
int cnt=0;
string s;
cin>>s;
for(int j=... | 1 |
// Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int N=2e5+10;
int n,m;
int col[N];
vector <int> g[N];
int cnt[4];
bool flag=0;
void dfs(int x,int c){
col[x]=c;cnt[c]++;
for(int i=0;i<g[x].size();i++){
if(!col[g[x][i]]) dfs(g[x][i],3-c);
if(col[g[x][i]]==col[x])... | 1 |
#include <bits/stdc++.h>
#define int long long
#define mod 998244353
#define foi(i,n) for(int i = 0; i < n ; ++i)
#define pi pair<int,int>
#define pb push_back
#define debug cout << "here" << endl;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
int dp[100000];
int find... | #include<bits/stdc++.h>
#define REP(i,a,b) for(int i=a;i<=b;++i)
typedef long long ll;
using namespace std;
void File(){
freopen("AGC10D.in","r",stdin);
freopen("AGC10D.out","w",stdout);
}
const int maxn=1e5+10;
int n;
ll a[maxn],sum;
bool dfs(bool now){
REP(i,1,n)if(a[i]%2==1)--a[i];
ll d=a[1];
REP(i,1,n)d=_... | 0 |
#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;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
//#define hacks
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endi... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#define re register
const int MAXN=2e5+10;
int n,K,s[MAXN],a[MAXN],timee;
char fin[10010],*p1=fin,*p2=fin;
char getc()
{
return p1==p2&&(p2=(p1=fin)+fread(fin,1,10000,stdin),p1==p2)?EOF:*p1++;
}
int read()
{
re int x=0;
re char ch=0;
while(ch<'0'... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<n; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) {
cin >> v.at(i);
}
int a=0, b=0, c=0, x, y, z;
rep(i, min(K,50)) {
vector<int> vv(N+1);
rep(j,... | 1 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const long long INF10=1e10+1,ID_MAX=20;
const long mod=(1e9)+7;
const long long INF18=1e18+1;
struct edge{
int to;
long cost;
};
void sort2array(double *a,long *b,long n){
for(int i=0;i<n;i++){
b[i]=i;
... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #include <bits/stdc++.h>
using namespace std;
int N, T;
int64_t DP[3010][3010]; // i番目、t分後の最大値
void init()
{
for (int i = 0; i < 3010; i++)
for (int j = 0; j < 3010; j++)
DP[i][j] = -1;
DP[0][0] = 0;
}
int64_t ans()
{
int64_t ans = 0;
for (int j = 0; j <= T; j++)
ans = max(DP[N][j], ans);
retu... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n ;
cin >> n ;
string s , t ;
cin >> s >> t ;
deque<char> S , T ;
rep(i,n){
... | // agc006_a
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int n, m, p, sum;
while(std::cin >> n >> m){
std::vector<int> price_list = {};
if(n == 0 && m == 0){
break;
} else{
sum = 0;
for(int i = 0;i < n;++i){
std::cin >... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,m,sum;
int p[1010];
while(cin >> n >> m,n!=0&&m!=0){
for(int i=0;i<n;i++){
cin >> p[i];
}
sort(p,p+n);
reverse(p,p+n);
sum = 0;
for(int i=0;i<n;i++){
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d, g;
cin >> d >> g;
vector <int> p(d);
vector <int> c(d);
for(int i = 0; i < d; ++i) cin >> p[i] >> c[i];
int ans = 1e9;
for(int mask = 0; mask < (1 << d); ++mask){
int point = 0, num = 0, rest_max = -1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n ,k;
cin>>n>>k;
cout.precision(15);
double p[n];
for(int i=0;i<n;i++)
{
cin>>p[i];
p[i] = (p[i] + 1)/2;
}
double curr =0, ans =0 ;
for(int i=0;i<k;i++)
{
curr += p[i];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p;
while (cin >> n >> p, n) {
int m = 0, q = p, st[50] = {};
while (1) {
if (p == 0) {
p += st[m];
st[m] = 0;
} else {
p--;
st[m]++;
... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a[4];
for(int i=0;i<4;i++) cin>>a[i];
int e,f;
cin>>e>>f;
sort(a,a+4,greater<int>());
if(e<f){
cout<<a[0]+a[1]+a[2]+f<<endl;
}
else{
cout<<a[0]+a[1]+a[2]+e<<endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main ()
{
int a[100],b[100],a1,a2,a3,b1;
a1 = 0;
a2 = 0;
a3 = 0;
b1 = 0;
for (int i = 0; i < 4; i++)
{
cin >> a[i];
}
for (int j = 0; j < 2; j++)
{
cin >> b[j];
}
for (int i = 0; i < 4; i++)
{
if (a[i] >= a1)
{
a3 = 0;
a3 = a2;
a2 = 0;
a... | 1 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> v[10000], rev[10000], order, group(10000, 0);
vector<bool> vis(10000);
void dfs(int x){
vis[x] = true;
for(int j : v[x]){
if(!vis[j]) dfs(j);
}
order.push_back(x);
}
void rdfs(int x, int k){
group[x] = k;
vis[x] = tr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
map<int ,bool> AC;
map<int ,int> WA;
cin >> n >> m;
for (int i = 0; i < m; i++){
int no;
string res;
cin >> no >> res;
if (res == "AC") {
AC[no] = 1;
} else {
if (!AC.count(no)) {
WA[no]++;
... | 0 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll M=1000005,mod=998244353;
ll F[M];
void Init(){
F[0]=1;
for(int i=1;i<M;i++) F[i]=F[i-1]*i%mod;
}
ll Pow(ll n,ll p){
ll r=1;
for(;p>0;p>>=1){
if(p&1) r=(r*n)%mod;
n=(n*n)%mod;
}
return r;
}
ll Div(ll n,ll m){
return n*Pow(m,mod-2)%mod... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define SCLLD(n) scanf("%lld",&n)
#define SCL... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int Q;
cin >> Q;
for (int q = 0; q < Q; q++) {
int k;
cin >> k;
long long cnt_D = 0, cnt_M = 0, cnt_DM = 0, cnt_DMC = 0;
for (int i = 0; i < n; i++) {
if (s.a... | 0 |
/**
* author: boutarou
* created: 10.06.2020 20:12:43
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, const T& b) { if (a <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n;
vector<string> s(n);
for(int i=0; i<n;i++){
cin >> s.at(i);
}
cin >> m;
vector<string> t(m);
for(int i=0; i<m; i++){
cin >> t.at(i);
}
int i;
int sum=1,ans=0;
vector<string> u;
for(i=0;i<n;i++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
return (ret);
}
int main(){
cin.tie(0); ios::sync_with_stdio(fal... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> yakusu(int d){
vector<int> res;
for(int i=1; i*i <= d; i++){
if(d % i == 0) {
res.push_back(i);
if(i*i != d) res.push_back(d / i);
}
}
sort(res.begin(), res.end());
return res;
}
int gcd(int a, ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ ret... | 0 |
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int min_count = 0;
int x0 = A.at(0);
while (x0 % 2 == 0) {
min_count++;
x0 = x0 / 2;
}
for (int x : A) {
int count = 0;
wh... | 1 |
#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;
using P = complex<double>;
using lli = long long int;
using T = lli;
bool cmp_x(const P& p, const P& q)
{
if (p.real() != q.real())
return p.real() < q.real();
... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
using namespace std;
int g[100005];
int F(int x)
{
return g[x]==x?g[x]:g[x]=F(g[x]);
}
void U(int x,int y)
{
g[F(x)]=F(y);
}
int n;
pair <pair<int,int>,int> a[100005]... | 0 |
#include<cstdio>
#define C(x,y) (fct[x]*ifct[y]%TT*ifct[(x)-(y)]%TT)
using namespace std;
const int maxn=2005,TT=1e9+7;
int n,K,m,F[maxn][maxn];
long long fct[maxn*maxn],ifct[maxn*maxn];
inline int read(){
int ret=0;bool f=0;char ch=getchar();
while(ch>'9'||ch<'0') f^=ch=='-',ch=getchar();
while(ch<='9'&&ch>='0') re... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD=1000000007;
int n,k;
LL fac[4000000],inv_fac[4000000],dp[2001];
void check_mod(LL &a) { if (a>=MOD) a%=MOD; }
int ksm(LL a, int b)
{
LL ret=1ll;
while (b) {
if (b&1) ret*=a;
check_mod(ret);
a*=a;
check_mod(a);
b>>=1;
}
retur... | 1 |
#include <stdio.h>
int a[1000000];
long long int ans=0;
void mergesort(int l,int r){
if(l==r)return;
if(l==r-1){
if(a[r]<a[l]){
int temp;
temp=a[l];
a[l]=a[r];
a[r]=temp;
ans++;
}
return;
}
int mid=(l+r)/2,now=0,b[r-l+1];
mergesort(l,mid-1);
mergesort(mid,r);
for(int i=0;i<=r-l;i++){
if(a[l... | /* * * * * * * * * * * **
* *
* saurabh8522 *
* I will handle *
* IT. *
* *
* * * * * * * * * * * **/
#include<bits/stdc++.h>
#define mp(a,b) make_pair(a,b)
#define pb push_back
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int MX = 100005;
vector<int> parents(MX);
vector<int> in(MX);
vector<vector<int>> tree(MX,vector<int>());
int main() {
int n,m;
cin... | 0 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inli... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v)... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,b) for(ll i=(b)-1; i>=a; --i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scanv(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No")... | 1 |
#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 = (l... | #include <iostream>
#include <string>
using namespace std;
const int MOD = 1000000007;
int solve(const string& s){
const int N = s.size()/2;
long long res = 1;
int numS = 0, sumS = 0, inc = 0;
for(auto& c : s){
if(c == 'B'){
if(inc%2 == 0){
++inc;
+... | 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N;
map<long long, long long> mp;... | #include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int N;
cin >> N;
int A[N];
for (int& i: A) cin >> i;
ll ans = 0;
const int mod = 1e9 + 7;
int suff[N] = {0};
suff[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
suff[i] = (A[i] + suff[i + ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int h,w;
cin >> h >> w;
int ans=(n-h+1)*(n-w+1);
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S; cin >> S;
int ans = 1000;
rep(i,S.size()-2) {
in... | 0 |
#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#define MAX 10000
#define INFTY 1<<30 // 2^30
#define N 8
using namespace std;
typedef long long llong;
static const ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
const char Q = 'Q';
const char _ = '.';
char board[8][9] = {
"........",
"........",
"........",
"........",
"........",
"........",
"........",
"........",
};
int n;
bool pre_x[8], pre_y[8];
inline bool c... | 1 |
#include<algorithm>
#include<cstdio>
#define s(A) std::sort(A,A+10);
main(){
int Z[20],p;
for(int i=0;i<20;i++)
scanf("%d",&p),Z[i]=p;
s(Z);
s(Z+10);
printf("%d %d\n",Z[7]+Z[8]+Z[9],Z[17]+Z[18]+Z[19]);
} | #include <cstdio>
#include <algorithm>
#include <string>
#include <iostream>
#define inf 1001001001
using namespace std;
int n, c;
size_t s, t, dp[1001][1001];
string a, b;
int main() {
cin >> a >> b;
s = a.length(), t = b.length();
for (size_t i = 1; i <= s; ++i) dp[i][0] = i;
for (size_t i = 1; i <= t; ++i) dp[0... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, ans = 0;
string A, B, C;
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++){
set<cha... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
// 1. 入力情報.
int N;
char A[111], B[111], C[111];
scanf("%d %s %... | 1 |
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
struct Combination {
vector<long long> inv,finv,fac;
Combination(int n, int kmax) : inv(kmax+1),finv(kmax+1),fac(kmax){
if(kmax>=1){
inv.at(1)=1;
finv.at(1)=1;
fac.at(0) = n;
}
for(int i=2; i<=kmax; i++) inv.at(i)... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int MAXN = 100000 + 1000;
int n;
int s[4][MAXN];
int id[MAXN], rev[MAXN];
int s1, s2, f1, f2;
bool vis[MAXN];
void no()
{
... | #include <iostream>
#include <cassert>
#include <cstring>
#include <vector>
using namespace std;
vector<vector<vector<double>>> dp;
int n;
double find(int i, int j, int k){
if(dp[i][j][k]!=-1) return dp[i][j][k];
dp[i][j][k] = 0.0;
if(i==0 && j==0 && k==0){
return dp[i][j][k];
}
dp[i][... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
char arr[405][405];
bool vis[405][405];
int h, w;
int cb;
int cw;
bool f(int i, int j, int l, int m){
if(l<0 || l>=h || m<0 || m>=w){
return 0;
}
if(vis[l][m]==1){
return 0;
}
if(arr[i][j]==arr[l][m]){
return 0;
}
return 1;
}
void d... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | 1 |
#include <bits/stdc++.h>
using namespace std;
int cnt[100005];
bool ac[100005];
char s[5];
int main() {
int n, m;
scanf("%d%d", &n, &m);
int pen = 0;
int res = 0;
for (int i = 0; i < m; i++) {
int x;
scanf("%d%s", &x, s);
if (s[0] == 'A') {
if (!ac[x]... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX ... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define V(a) a.begin(), a.end()
typedef vector<int> vi;
int main()
{
vi a[2], C;
for (auto &i : a) {
int n;
cin >> n;
i = vi(n);
for (int &j : i)
cin >> j;
sort(V(i));
}
set_intersection(V(a[0]), V(a[1]), inserter(C, C.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
using namespace std;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = 0 ; i < a ; i ++)
#define vi vector<int>
int main(void){
int s,t,r=0;
cin>>s;
vi sv(s);
rep(i,s)cin>>sv[i];
cin>>t;
vi t... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
const ll p = 26;
string ans = "";
ll tmp = n;
while (true) {
tmp--;
ll mod = tmp % p;
string mod_s{ (char)('a' + mod) };
ans += mod_s;
if (tmp / p == 0) break;
tmp /= p;
}
reverse(ans.begin(), ans.end(... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
int sz;
UnionFind(int sz) : data(sz, -1), sz(sz) { }
bool unionSet(int x, int y) {
if ((x = root(x)) == (y = root(y))) return false;
if (data[x] > data[y]) swap(x, y);
... | #include <iostream>
#include <vector>
#include <map>
using namespace std; using P=pair<int,int>; using ll=long long;
const int mx=1e5; vector<vector<int>> v(mx); vector<int> c(mx); int n; bool noco=false;
void dfs(int from, int to, int color) {
if (from == -1) for(int i=0;i<n;i++) c[i]=-1;
if (c[to] == 0 || c[to] == ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double ans = 0;
int count = 0;
int N;
cin >> N;
vector<pair<int, int>> points;
for(int i=0;i<N;i++){
pair<int, int> p;
cin >> p.first;
cin >> p.second;
points.push_back(p);
}
sort(points.begin(), points.... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define my_abs(x) ((x) < 0 ? -(x) : (x))
using namespace std;
typedef long long ll;
ll ans, fact[25];
int arr[25];
inline void chk(int len)
{
ll res = 9 - my_abs(arr[0]);
for (int i = 1; i <= len - 1 >> 1; i++)
res *= 10 - my_abs(arr[i])... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 99824... | /*The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/
//PRABHJOT SINGH A.K.A. PRABHI
//~~~~~conquizztador~~~~~
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second... | 1 |
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char str[25];
cin>>str;
char rev[25];
for(int i=0;i<strlen(str);i++)
rev[i]=str[strlen(str)-i-1];
rev[strlen(str)]='\0';
cout<<rev<<endl;
} | #include<iostream>
#include<sstream>
using namespace std;
int main(){
string str;
cin >> str;
std::istringstream stream(str);
for(int i=str.length()-1; i>=0; i--){
stream >> str[i];
}
cout << str << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
#define pii pair<int,int>
#define vvi vector<vector<int> >
#define vpi vector<pii>
#define F first
#define S second
#define pb push_back
#define INF 0x7fffffff
#define LINF 0x7fffffffffffffff
#define MO... | #include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 200010
using namespace std;
ll n,m,a... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
if(S.length() % 2 == 0){
for(int i=0;i<S.length();i=i+2){
if(S[i] == 'h' && S[i+1] == 'i'){
continue;
}
else{
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repo(i,N) for(int i = 1; i < (N); i++)
//#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
//#define num 1000000007
#define pi acos(-1... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.end());
bool odd, even;
odd = even = true;
REP(i, n) {
if (a[i] % 2) even = fa... | # include <iostream>
# include <vector>
# include <algorithm>
using namespace std;
# define ll long long
int fpb(int a, int b){
return (b == 0 ? a : fpb(b, a%b));
}
int main(){
int n, k;
cin >> n >> k;
int f = 0, largest = 0;
for(int i=0; i<n; i++){
int num;
cin >> num;
largest = max(largest,... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int sum = 1, a, b, i = 0; cin >> a >> b;
while(sum < b){
sum = sum - 1 + a;
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((B-1)%(A-1) == 0){
cout << (B-1)/(A-1) << endl;
}
else {
cout << (B-1)/(A-1) + 1 << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, q;
string s;
cin >> n >> s >> q;
for (ll i = 0; i < q; i++)
{
ll k;
ll d, m, dm, dmc;
d = m = dm = dmc = 0;
scanf("%d", &k);
for (ll i = 0; i < n; i++)
{
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
... | 1 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define sor(a, l, r) sort(a + l, a + r + 1);
#define reve(a, l, r) reverse(a + l, a + r + 1)
using namespace std;
typedef long long LL;
const int N = 205;
const int MAXN = 100005;
template <typename T> inline... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n,x,s[205];
int dp[205][100005],tot[100005];
int main(){
scanf("%d %d",&n,&x);
for(int i=1;i<=n;i++) scanf("%d",&s[i]);
sort(s+1,s+n+1);
for(int i=0;i<=x;i++){
int l=1,r=n,p=0;
while(l<=r){
int mid=(l+r)/2;
if(s[mid]<=i) p=max(p,mid)... | 1 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
struct set {
int h;
int w;
int diagonel;
} all[22500];
int suffix = 0;
void InsSort(int n)
{
int i, j, temp_dia, temp_h, temp_w;
for (i = 1; i < n; i++) {
temp_h = all[i].h;
temp_w = all[i].w;
temp_dia = all[i].diagonel;
for (j = i; j > 0; j--) {
if ... | 0 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | #include <bits/stdc++.h>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//---------------------------------... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
bool judge=true;
if(n%2!=0){
judge=false;
}
for(int i=0;i<n;i+=2){
if(judge==false){
break;
}
if(s.at(i)!='h'||s.at(i+1)!='i'){
judge=false;
}
}
if(judge){
cout << "Yes" ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0... | 1 |
#include <iostream>
#include <vector>
using namespace std;
struct edge
{
int to, d;
};
vector<vector<edge>> g;
int b[100000];
int n, u, v;
int dfs(int v, int parent) {
int res = 0;
for (edge &ne : g[v]) {
if (ne.to == parent) continue;
ne.d = 1;
int now = dfs(ne.to, v) + 1;
res = max(res, now);
}
b[v] =... | #include<bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
struct edge {int to, cost; };
typedef pair<int, int> P;
int V;
vector <edge> G[100010];
int d[100010];
void dijkstrra(int s){
priority_queue <P, vector<P>, greater<P> > que;
fill(d, d + V, 1000000000);
d[s] = 0;
que.push(P(0 , s));
... | 0 |
#include <cstdio>
#include <algorithm>
#define mod 998244353
#define maxn 200010
#define LL long long
using namespace std;
LL fact[maxn],inv[maxn],ans,t[maxn],p;
int n,m,k,nm;
LL quick_pow(LL a,LL b){//a^b
LL ans=1;
while(b){
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans%mod;
}
void init(){
int i;
sc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define mp make_pair
#ifndef ONLINE_JUDGE
#include "/home/asif/Codes/Library/debug.h"
#endif
/*-----------------------------------------------------... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cou... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))
#define SZ(a) (int)a.size()
#defi... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pi;
#defi... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(... | #include <iostream>
#include <string>
using namespace std;
void solve(const string& s) {
for (int i = 0, j = 1; j < s.size(); ++i, ++j) {
if (s[i] == s[j]) {
cout << (i + 1) << " " << (j + 1) << "\n";
return;
}
}
for (int i = 0, j = 2; j < s.size(); ++i, ++j) {
if (s[i] == s[j]) {
c... | 0 |
#include<iostream>
using namespace std;
const int MAXN = 1005, INF = 2e9;
int d[MAXN][MAXN];
int main()
{
int n, m;
cin >> n >> m;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
d[i][j] = INF;
for(int i = 0; i < n; i++)
d[i][i] = 0;
for(int i = 0; i < m; i++)
{
int x, y, w;
cin >> x >> y >> w... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 605;
inline int input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
inline void chkmin(int &x, int y) { x = x < y ? x ... | 0 |
#include<bits/stdc++.h>
#define ll long long
const ll mod=1e9+7;
using namespace std;
ll d[45][1<<17];
ll n,x,y,z;
int main()
{
scanf("%lld%lld%lld%lld",&n,&x,&y,&z);
ll ans=1;
for(ll i=1;i<=n;i++)
{
ans=1ll*ans*10;
ans%=mod;
}
ll s=(1<<x+y+z)-1;
ll u=(1<<x-1)|(1<<x+y-1)|(1<<... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
const int INF=1001001001;
in... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if ((A + B) > (C + D)) {
cout << "Left" <<endl;
}
if ((A + B) == (C + D)) {
cout << "Balanced" <<endl;
}
if ((A + B) < (C + D)) {
cout << "Right" <<endl;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#define mkp... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n, m;
cin >> n >> m;
vector<char> res(n, 0);
for (int i = 1; i <= m; i++) {
int s; char c;
cin >> s >> c;
s--;
... | 1 |
#include <stdio.h>
int main(){
int m,a,b,x,y,r,g,i;
for(;scanf("%d%d%d%d",&m,&a,&b,&x)>3;){
for(g=0,i=1;i<m;i++){
scanf("%d",&y);
if(a<=i&&i<=b && x-y>=g)g=x-y,r=i;
x=y;
}
printf("%d\n",r);
}
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax) {
if (m == 0 && nmin == 0 && nmax == 0) {
break;
}
vector<int> d(m);
for (int i = 0; i < m; i++) {
cin >> d[i];
}
int MAX = d[nmin-1]-d[nmin];
int maxn = n... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Segtree {
int n;
T e;
vector<T> dat;
typedef function<T(T a, T b)> Func;
Func f;
Segtree(){}
Segtree(int n_input, Func f_input, T e_input){
initialize(n_input, f_input, e_input);
}
void initialize(int... | #include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,L;
cin>>N>>L;
int A[N];
for(int i=0;i<N;i++){
A[i]=L+i;
}
int sum=0;
if(L>=0){
for(int i=1;i<N;i++){
sum+=A[i];
}
}else if(L<=-N){
for(int i=0;i<N-1;i++){
sum+=A[i];
}
}else{
for(int i=0;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll GCD(ll a, ll b) {
return a % b ? GCD(b, a % b): b;
}
vector<pair<ll, ll> > prime_factorize(ll n) {
vector<pair<ll,ll>> res;
for (ll a = 2; a * a <= n; ++a) {
if (n % a != 0) continue;
ll ex = 0; // 指数
// 割れる限り割り... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
int main(){
ll N;
cin >> N;
vector<double> A(N,0);
for(ll i=0;i<N;i++){
cin>>A[i]
;}
sort(A.begin(), A.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int N = 1e5+5;
int n, m, v, p, a[N], ans; i64 s[N];
int main()
{
scanf("%d%d%d%d", &n, &m, &v, &p), ans = p;
for(int i = 1; i <= n; ++i) scanf("%d", a+i);
sort(a+1, a+1+n, greater<int>());
for(int i = 1; i <= n; ++i) s[i] = s[i-1... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int k,x;
cin >> k >> x;
x = x-k+1;
rep(i,0,2*k-1){
cout << x+i;
if(i != 2*k-2) cout << " ";
else cout << "" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define MOD 1000000007
void solve() {
string s;
ll n, ans;
cin >> n >> s;
vi r, g;
for (int i = 0; i < n; ++i) {
if (s[i] == ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 123455, LG = 60;
ll n, m, k, A[N], P[N], R[LG][N];
int main()
{
scanf("%lld", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &A[i]), P[i] = i;
scanf("%lld%lld", &m, &k);
for (int i = 0; i < m; i++)
{
int... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#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 sz(a) (int)a.size()
#define de(a) cout << #a << " = " << a << endl
#define dd(a) cout << #a... | 1 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
UL S[2001][2001] = {};
UL J1[2001][2001] = {};
UL J2[2001][2001] = {};
void Query() {
UL y1, y2, x1, x2; cin >... | #include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(void){
int R;
cin >> R;
double ans = (2 * R) * acos(-1.0);
cout << setprecision(20) << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long x;
cin>>x;
if(x/11==0){
if(x>6){
cout<<2<<endl;
}else{
cout<<1<<endl;
}
return 0;
}else{
if(x%11==0){
cout<<x/11*2<<endl;
}else if((x-x/11*11)>6){
cout<<x/11*2+2<<endl;
}else{
c... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
int main() {
long long x;
cin >> x;
long long ans = 0;
if (x % 11 == 0) {
ans = x / 11 * 2;... | 1 |
#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using pii=pair<int,int>;
using vs=vector<string>;
using vpii=vector<pii>;
using si=set<int>;
... | #include <iostream>
using namespace std;
int main(void){
while(1){
int m, nmin, nmax;
cin >> m;
cin >> nmin;
cin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0){ return 0; }
int P[m];
for(int i = 0 ; i < m ; i++){
cin >> P[i];
}
int ans = nmin;
int max = -1;
for(in... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int l[m],r[m];
for(int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int ans = *max_element(l,l+m) - *min_element(r,r+m);
if(ans > 0) {
cout << 0 << endl;
}else {
cout << ab... | #include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main()
{
int n,m;
cin >> n >> m;
int max = 0,min = 1e... | 1 |
#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 m... | #include <bits/stdc++.h>
using namespace std;
int main(){
long x,y;
cin >> x >> y;
if(x==y) cout << 0 << endl;
else if(y-x==1||y==-x) cout << 1 << endl;
else cout << min({abs(x-y),abs(x+y-1),abs(x+y+1),abs(x-y+2)})+2 << endl;
}
| 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
vector<vector<char>> vec;
vector<pair<int, int>> direct = {{1,0},{-1, 0}, {0,1}, {0, -1}};
vector<vector<int>> dist;
queue<pair<int... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n, t0;
cin >> n >> t0;
vector<int> t(n);
for(int i = 0; i < n; i++) cin >> t[i];
long long int ans = t0;
for(int i = 1; i < n; i++){
if(t[i]-t[i-1] >= t0) ans += t0;
else ans += t[i]-t[i-1];
}
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int N,K;
cin >> N >> K;
if(N%K==0){
cout << 0 << endl;
}
else{
cout << 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, K; cin >> N >> K;
cout << (N + K - 1) / K - N / K << endl;
return 0;... | 1 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(long long i=0;i<(long long)(n);i++)
#define N 600000
int main() {
i... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a;
for(int i=3;i<=a;i++){
b=0;
if(i%3==0 || i%10==3){
cout<<" "<<i;
b=1;
}
if(i>=30 && b==0){
for(int j=i;j>=9;){
j=j/10;
if(j%10==3){
cout<<" "<<i;
break;
}
}
}
}
cout<<endl;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.