code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using ll = long;
using namespace std;
int main(){
ll k, d=2, u=2; cin >> k;
ll a[k]; for(ll i =0 ; i < k; i++) cin >> a[i];
for(ll i = k-1; i >= 0; i--){
d = (d+a[i]-1)/a[i]; u = u/a[i];
if(d > u){ cout << -1 << endl; return 0; }
d *= a[i]; u *= a[i]; u += a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin>>n;
vector<int> A(n);
rep(i,n)cin>>A[i];
int sum=abs(A[0]);
rep(i,n-1)sum+=abs(A[i+1]-A[i]);
cout<<sum-abs(A[0])-abs(A[1]-A[0])+abs(A[1])+abs(A[n-1... | 0 | 86,920,256 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
int main(){
int N; cin >> N;
vector<long long> a(N);
for(int i=0; i < N; ++i){
cin >> a[i];
}
map<long long, long long> delta_cnt;
vector<long long> delta_array(N);
for(int... | 0 | 96,259,772 |
#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>
#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()
{
... | 0 | 57,110,155 |
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include ... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
type... | 0 | 88,049,374 |
#include <stdio.h>
#include <string.h>
int main(void)
{
int sum,len;
char x[1000];
while(1){
scanf("%s",x);
if(x[0]=='0'){
break;
}
len = strlen(x);
sum=0;
for(int n=0;n<len;n++){
sum+=(x[n]-'0');
}
printf("%d\n",sum);
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
#define rep(i,N) for(int i=0;i<(int)(N);++i)
#define rrep(i,N) for(int i=(int)(N)-1;i>=0;--i)
#define debug(x) cout<<#x<<"="<<x<<endl;
constexpr ll MOD=1000000007;
constexpr ll INF=1LL<<60;
template<class T> inline bool chmin(T& a,T ... | 0 | 42,251,291 |
#include<cstdio>
int main(){
int a, b, c, n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d %d %d", &a, &b, &c);
if(a * a + b * b == c * c || a * a + c * c == b * b || a * a == b * b + c * c){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
} | #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 rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | 0 | 77,561,124 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> w(n);
ll sumA = 0, sumB = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sumA += w[i];
}
ll ans = 1e9;
ans = min(ans, abs(su... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
using namespace std;
int main(void){
int h,w;
cin >> h;
cin >> w;
vector< vec... | 0 | 6,343,405 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) ... | 0 | 50,044,230 |
#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() {
int a,b;
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N, L;
cin >> N >> L;
vector<string> S(N, "");
for(int i = 0; i < N; ++i)
{
cin >> S[i];
}
auto f = [L](const string& a, const string& b){
for(int i = 0; i < L; ++i)
{
if(a[i] < b[i]) return... | 0 | 22,232,145 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb(a) push_back(a)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
using P = pair<int,int>;
using vP = vector<P>;
const int INF = 1001001001;
int main(){
int n;
cin>>n;
vector<int64_t> a(n);... | #include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,l... | 0 | 4,943,730 |
class in{struct my_iterator{int it;const bool rev;explicit constexpr my_iterator(int it_, bool rev=false):it(it_),rev(rev){}int operator*(){return it;}bool operator!=(my_iterator& r){return it!=r.it;}void operator++(){rev?--it:++it;}};const my_iterator i,n;public:explicit constexpr in(int n):i(0),n(n){}explicit constex... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it))... | 0 | 56,321,687 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,k,j,d,a[200]={0},i,l,h,s=0;
cin>>n>>k;
for(i=1;i<=k;i++)
{
cin>>d;
for(j=1;j<=d;j++)
{
cin>>l;
a[l]=a[l]+1;
}
}
for(h=1;h<=n;h++)
{
if(a[h]==0)... | #include<bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int cnt = 0;
int n;
cin >> n;
vi a(n+1), b(n);
rep(i, n+1) cin >> a... | 0 | 54,232,712 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
cin>>s;
if(s.length()<4)cout<<"No"<<endl;
else if(s.substr(0,4)=="YAKI")cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 53,524,225 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) {
cout << '+' << endl;
}
else if (a * b == 15) {
cout << '*' << endl;
}
else {
cout << 'x' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int i,j,ara[1000],n=0,ara2[1000],k=0,c=1,max=0,mode,m;
while (scanf ("%d",&m)!=EOF)
{
ara[n]=m;
n++;
}
for (i=0;i<n-1;i++)
{
mode=0;
for (j=i+1;j<n;j++)
{
if (ara[i]==ara[j])
... | 0 | 41,460,520 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if(a<b) std::swap(a, b);
return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int f(int x) {
int res = 0;
while (x%2 == 0) {
x /= 2;
res++;
}
return re... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> ac(N + 1, 0);
vector<int> cnt_was(N + 1, 0);
for (int i = 0; i < M; ++i) {
int p;
string S;
cin >> p >> S;
if (S == "AC") {
ac[p] = 1;
} else {
if ... | 0 | 79,073,926 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::ma... | 0 | 82,974,882 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cctype>
#include <map>
#include <set>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int mai... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
void bfs(std::vector<std::vector<char> > &map, std::pair<int, int> start) {
int w = map.size();
int h = map[0].size();
int dy[4] = {0, 0, 1, -1};
int dx[4] = {1, -1, 0, 0};
std::queue<std::pair<int, int> > que;
int cost... | 0 | 63,558,386 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #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;
int n, Cnt, m;
stri... | 0 | 62,601,816 |
#include<bits/stdc++.h>
#define LL long long
#define RG register
#define R RG int
using namespace std;
vector<int>c[400];
int main(){
R n,now=0;
cin>>n;
R d=(1+sqrt(1+8*n))/2;
if(d*(d-1)!=2*n)return puts("No"),0;
printf("Yes\n%d\n",d);
for(R i=1;i<=d;++i){
printf("%d",d-1);
for(R j=1;j<i;++j)
printf(" %d",... | #include <iostream>
using namespace std;
int main(){
int n;
long min,max,sum;
cin >> n;
long work[n];
for(int i = 0; i < n;i++){
cin >> work[i];
}
max = sum = min = work[0];
for(int i = 1; i < n;i++){
if(max < work[i]){
max = work[i];
}
if(min ... | 0 | 98,980,978 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
#define yes_or_no(flag) if (flag) { println("Yes"); } else { println("No"); }
#define sort_vec(vec) sort(vec.begin(), vec.end())
#define rsort_vec(vec) sort(vec.rbegin(), vec.rend())
int main() {
int N, K;
cin >> N >> K;
vecto... | 0 | 97,885,177 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,count=0;
cin >> n;
vector<ll>a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(),a.end());
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
vector<ll>x(n-1),y(n-1);
... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 15,884,915 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n-1) * (n-2) / 2 < k) {
cout << -1 << endl;
}
else {
int d = (n-1) * (n-2) / 2 - k;
cout << n - 1 + d << endl;
for (int i = 2; i <= n; ++i) {
cout << 1 << " " << i << ... | #include<iostream>
#include<numeric>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int const MAXN = 2e5;
int const MAXNN = 1<<18;
struct seg_tree {
int data_[MAXNN*2-1], e_;
int NN;
seg_tree(int N, int e) : e_(e) {
NN... | 0 | 85,717,905 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin>>n;
double bo=0;
rep(i,n){
double a;
cin>>a;
bo+=1/a;
}
cout<<fixed<<setprecision(10)<<1/bo<<endl;
} | #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;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
... | 0 | 55,782,269 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 90000;
int h, w, d, a, q, l ,r;
pair<int, int> coord[MX];
int cost[MX];
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> h >> w >> d;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> a; --a;
coor... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
int count(int c[6][6]){
long res=0;
long long i,j;
for(i=0;i<6;i++){
for(j=0;j<6;j++){
res+=c[i][j];
}
}
return res;
}
int main(void){
long long h,w,k;
long long i,j,l,m;
string tmp;
long long res=0;
int tmp2... | 0 | 46,671,681 |
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
... | 0 | 5,788,558 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
long long n,m;
cin>>n>>m;
cout<<(n==1 ? 1 : n-2)*(m==1 ? 1 : m-2)<<endl;
return 0;
} | #include <stdio.h>
#include <math.h>
double eps = 1e-10 ;
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2;
s1 = ((xp - x1) * (y2 - y1)... | 0 | 18,718,175 |
#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;
struct Point {
double x;
double y;
};
static void CreateTriangle(const Point& p1, const Point& p2, int n) {
if (n <= 0)
return;
static const double kCos60 = cos(60.0 * M_PI / 180.0);
static const double kSin60 = sin(60.0 * M_PI / ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int nax=1e5+5;
const int mod=1e9+7;
vector<int> edges[nax];
ll mul(ll a,ll b){
return(a*b)%mod;
}
pair<ll,ll> dfs(int u,int prev){
ll all_white=1;
ll sth_is_black=0;
for(auto v:edges[u]){
if(v!=prev){
pair<l... | 0 | 66,062,823 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int long long
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n,h;
cin >> n >> h;
vector<tuple<int,char>> atc(2*n);
int a,b;
rep(i,n){
cin >> a >> b;
atc.at(2*i)=make_tuple(a,'a');
atc.at(2*i+1)=make_tuple(b,'b');
}
... | 0 | 60,687,049 |
#include <iostream>
using namespace std;
int main() {
string number;
int sum[1000];
int j = 0;
while(1){
sum[j] = 0;
cin >> number;
if(number == "0"){
sum[j] = 0;
break;
}
for (int i =0; i < number.length(); i++){
sum[j] += number[i] - '0';
}
j++;
}
j = 0;
while(1){
if(sum[j] == 0)
br... | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
for_(i,1,10) {
for_(j,1,10) {
cout << i << "x" << j << "=" << i * j << endl;
}
}
} | 0 | 62,027,307 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
queue<int> q;
vector<int> dist(n, -1);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> A(X);
vector<long long> B(Y);
vector<long long> C(Z);
for (int i=0;i<X;i++){
cin >> A.at(i);
}
for (int i=0;i<Y;i++){
cin >> B.at(i);
}
for (int i=0;i<Z;i++){
cin >> C.at(i... | 0 | 93,984,748 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n;
cin>>n;
vector<pair<int... | 0 | 50,467,372 |
#include <stdio.h>
#include <map>
using namespace std;
int main(){
while(1){
map<char, char> data;
int n,i;
scanf("%d", &n);
if(n==0) break;
char a,b;
for(i=0;i<n;i++) {
scanf(" %c %c", &a, &b);
data.insert(pair<char,char>(a,b));
}
scanf("%d", &n);
for(i=0;i<n;i++){
scanf(" %c", &a);
if(d... | #include <iostream>
using namespace std;
int n,id,k;
typedef struct{
int key;
int parent;
int lch;
int rch;
}NODE;
NODE node[251];
int main(){
cin >> n;
for(int i=1;i<=n;i++){
cin >>node[i].key;
if(i/2>0){
node[i].parent=i/2;
}else{
node[i].parent=-1;
}
if(2*i<=n){
node[i].lch=2*i;
}else{
... | 0 | 2,068,356 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t Q,H,S,D,N; cin>>Q>>H>>S>>D>>N;
int64_t sP=min(4*Q,min(2*H,S)),ans=0;
ans+=min(2*sP,D)*(N/2);... | #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 MAIN() {
int n; cin >> n;
map<int, int> m;
for (int i = 1; i <= n; i++) {
int t; cin >> t;
m[t]++;
}
vector<ii> v;
for (auto &i : ... | 0 | 76,360,329 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | #include <cstdio>
using namespace std;
int main(void){
int N, M, P;
int sum, ans;
int X[1001];
while((scanf("%d %d %d", &N, &M, &P) != EOF) && (N != 0 || M != 0 || P != 0)){
sum = 0;
for(int i = 0; i < N; i++){
scanf("%d", X+i);
sum += X[i];
}
P = 100 - P;
if(X[M-1] == 0) ans = 0;
else ans = sum *... | 0 | 52,437,675 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 59,440,180 |
#include <bits/stdc++.h>
#define pii pair<int, int>;
#define ss second
#define ff first
#define all(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const ll oo = 1 << 31;
int main(void){
int n;
cin >> n;
cout << (n*800) - ((n/15)*200) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
vi dy = { 0,0,1,-1 };
v... | 0 | 41,888,065 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
ll gcd2(ll a, ll b) {
if (a < b)sw... | #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
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ... | 0 | 1,077,557 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string _S = "keyence";
int N = S.size();
int _N = _S.size();
for (int i = 0; i <= _N; ++i) {
if (_S.substr(0, i) == S.substr(0, i) && _S.substr(i) == S.substr(N - _N + i)) {
printf("YES\n... | #include <bits/stdc++.h>
using namespace std;
int main(){
int S;
cin >> S;
int A = S;
int count = 0;
for(int i = 1; i <= A; i++){
if(i < 10){
count++;
}
else if(i >= 100 && i < 1000){
count++;
}
else if(i >= 10000 && i < 100000){
... | 0 | 68,056,673 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
int main() {
int a, b, c, d ;
cin >> a >> b >> c >> d;
int ab, cd;
if (a > b) ab = b;
else ab = a;
if (c > d) cd = d;
else cd = c;
cout << ab+cd << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
const lli mod = 1e9+7;
lli n, k;
int m... | 0 | 32,980,325 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
int ans = 0;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
if(i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
ll MAX = 2*(1e5);
vector<vector<ll>> V(MAX);
vector<ll> C(MAX, 0);
vector<bool> vis(MAX, false);
int dfs(int x){
for(auto v : V[x]){
if(!... | 0 | 48,845,386 |
#include <iostream>
#include <string>
using namespace std;
string shuffle(string str,int num){
string newStr(str.length(),'a');
for(int i = 0; i < str.length() ; i++){
newStr[i] = str[ ( i + num) % str.length() ];
}
return newStr;
}
int main()
{
string str;
int shuffleCount;
cin >> str;
while(str !="-"){
ci... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
#define mod 1000000007
#define mod2 998244353
#define double long double
#define pb push_back
#define swap(x,y) (x^=y^=x^=y)
#define TC int TESTCASE;cin>>TESTCASE;while(TESTCASE--)
#defi... | 0 | 78,187,400 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
const int INF = 100100100;
const int MOD = ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n,v) rep(i,n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef long l... | 0 | 77,115,262 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;cin>>n>>k;
int cpy = n - 2;
cpy*=(cpy + 1);
cpy/=2;
if(k > cpy){
cout<<-1<<endl;
} else{
vector<int> edges[n+1];
int cnt = cpy;
int y = 0;
for(int... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 13,702,179 |
#include <bits/stdc++.h>
#define N int(2e5+5)
#define mod 1000000007
using namespace std;
typedef long long ll;
ll ans;
int main(){
int n, k;
cin >> n >> k;
int arr[n];
for(int i=0; i<n; i++) cin >> arr[i];
n--;
if(n%(k-1)) cout << n/(k-1)+1;
else cout << n/(k-1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FileIO freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); ios_base::sync_with_stdio(0);
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define endl "\n"
#define mod 1000000007
int main()
{
IO;
... | 0 | 546,080 |
#include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << ... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod ... | 0 | 22,620,958 |
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char base[4] = {'A', 'C', 'T', 'G'};
for (int i=0; i<4; i++) {
if (b == base[i]) {
cout << base[(i+2)%4] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
int main(){
string S;
ll K;
cin >> S >> K;
rep(i,S.size()){
K--;
... | 0 | 71,848,677 |
#include <iostream>
#define NIL -1
using namespace std;
class node{
public:
int parent, left, right;
int depth;
int num;
string tag;
node* parentn;
node* leftn;
node* rightn;
node(){
parent = NIL;
left = NIL;
right = NIL;
depth = NIL;
parentn = NULL;
leftn = NULL;
rightn = NU... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 0 | 91,772,085 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
lli k;
lli calc(string x){
lli ret = 0;
lli n = x.size();
for(int i = 0, j = 0; i < n; i = j){
while(j < n && x[i] == x[j]) j++;
ret += (j-i)/2;
}
return ret;
}
int main(void){
cin >> s >> k;
l... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | 0 | 76,187,788 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, p;
scanf("%d %d", &a, &p);
int t1, t2, t3;
ll sum = 0;
sum += p / 2;
t1 = p % 2;
t2 = (a * 3) / 2;
t3 = (t1 + ((a * 3) % 2)) / 2;
sum += t2 + t3;
printf("%lld\n", sum);
r... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
string s; cin >> s;
... | 0 | 24,115,682 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #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>
... | 0 | 59,869,811 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (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;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
vector<int> a(3), b(3);
vector<int> cnt(4);
rep(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll>A(N);
map<ll, int>mp;
ll ans = 0;
rep(i, 0, N){
cin >> A[i];
... | 0 | 84,167,402 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int a=0,b=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='A')
a++;
else
b++;
}
if(a==3 || b==3)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
re... | 0 | 74,864,442 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | #include<iostream>
#include<stdlib.h>
using namespace std;
struct Node{
int key;
Node* next;
Node* prev;
};
struct List{
Node* nil;
void init(){
nil=(Node*)malloc(sizeof(Node));
nil->next=nil;
nil->prev=nil;
nil->key=0;
}
Node* find(int key){
for(Node* i=nil->next;i!=nil;i=i->next){
... | 0 | 9,433,550 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c),end(c)
#define mp make_pair
#define pb push_back
#define xx first
... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 18,472,291 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
int main()
{
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
int MOD=1000000007;
void calc(vector<int>& a... | 0 | 80,098,031 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
vector<int> a(5);
rep(i,5) cin >> a[i];
int sum = 0;
int k = 10;
rep(i,5){
if(a[i]%10==0){
sum += a[i];
}
else{
k = min(k,a[i]%10);
... | 0 | 79,528,587 |
#include <bits/stdc++.h>
#define endl '\n'
#define PB push_back
#define PF push_front
#define MP make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll>... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | 0 | 17,396,142 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void)
{
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;... | #include <iostream>
#include <vector>
using namespace std;
bool isCheck(int y){
return y % 3 == 0;
}
int main(){
int n, i,j,k,l,y,m,d;
cin >> n;
for(i=0; i<n; i++){
cin >> y >> m >> d;
int res = 0;
for(j=y; j<1000; j++){
for(k=(j == y ? m : 1); k<=10; k++){
... | 0 | 28,432,228 |
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int base, extra;
if (N <= K) {
base = X * N;
extra = 0;
}
else {
base = X * K;
extra = Y * (N - K);
}
cout << base + extra << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) {
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int a, b;
cin >> a >> b;
re... | 0 | 37,014,952 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 1010
ll x[N],y[N],n;
int NOE(){
cout<<-1<<endl;
return 0;
}
int main(){
cin>>n;
set<bool> sl,sr;
lol... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(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>
#def... | 0 | 64,612,835 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | #include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
using namespace std;
int n;
int c[15000];
int A[2000001];
void countingsort(int A[], int k){
for (int i = 0; i < k; ++i) {
c[i] = 0;
}
for (int j = 0; j < n; ++j) {
c[A[j]]++;
}
}
int main() {
cin >> n;
... | 0 | 84,972,076 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
map<ll,ll>l2;
int main()
{
ll n,a=0,b=0,c=0,x=0,y,z;
cin>>n;
ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
l2[l1[i]]++;
}
for(int i=0;i<100000;i++){
if(i==0)x=max(x,l2[i]+l2[i+1]);
else x=max(x... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | 0 | 68,386,277 |
#include<iostream>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
cout << s[i];
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 0 | 14,109,859 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
cin >> n;
cout << n*(n-1)/2 + n << endl;
return 0;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int a[26];
int main()
{
string s;
cin >> s;
rep(i, s.size()) {
a[s[i] - 'a']++;
}
... | 0 | 43,606,792 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF 999999999
int h,w,n;
string data[11... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef complex<double> pnt;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, pii> pp;
typedef double ld;
typedef long double lld;
#define INF 0x3f3f3f3f ... | 0 | 5,465,071 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K, rec[60], ans[60];
const ll N = 50;
int main() {
cin >> K;
if (K == 0) {
cout << 2 << endl;
cout << 1 << " " << 1;
exit(0);
}
ll div = (K - 1) / N, mo = K % N;
iota(ans, ans + N, 0);
for (ll i=0;i<N;i++)
ans[i] += div;
if (mo == 0)
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()... | 0 | 65,538,554 |
#include "bits/stdc++.h"
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" <... | #include <iostream>
using namespace std;
int mtoi(const string& str)
{
int res = 0,temp = 1;
for (int j = 0; j < str.length(); j++) {
if(str[j] >= '0' && str[j] <= '9')
temp = (int)(str[j] - '0');
else if (str[j] == 'i') {
res += temp;
temp = 1;
}
else if (str[j] == 'x') {
res += temp * 10;
tem... | 0 | 3,565,067 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyg";
const string ALP="ABCDEFGHIJKLMNOPQRSTUVWXYG";
typedef long lo... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 72,963,396 |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d,e,f,g,h;
int sum=0;
while(cin>>a){
if(a==0)break;
b=1000-a;
c=b/500;
d=(b-500*c)/100;
e=(b-500*c-100*d)/50;
f=(b-500*c-100*d-50*e)/10;
g=(b-500*c-100*d-50*e-10*f)/5;
h=b-500*c-100*d-50*e-10*f-5*g;
cout<<c+d+e+f+g+h<<endl;
}
return 0... | #include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define popf pop_front
#define p() cou... | 0 | 60,027,683 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll cnt[26];
int main()
{
st... | #include<iostream>
#include<string>
int main(){
std::string S;
std::cin >> S;
if(S[0]==S[1] && S[2] == S[3] && S[1] != S[2]) std::cout << "Yes";
else if(S[0]==S[3] && S[2] == S[1] && S[3] != S[2]) std::cout << "Yes";
else if(S[0]==S[2] && S[1] == S[3] && S[0] != S[1]) std::cout <... | 0 | 54,147,718 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
while(getline(cin,s),s!="."){
stack<int> b;
bool isBn=true;
for(auto c : s){
if(c=='(') b.push(1);
if(c=='[') b.push(2);
if(c==')'){
if(!b.empty() && b.top()==1){
... | #include <iostream>
using namespace std;
int ans,s,n;
void fanc(int sum,int i,int j){
if (sum==s&&i==n) {
ans++;
return;
}
if (sum>s||i>n||j>9) {
return;
}
fanc(sum+j,i+1,j+1);
fanc(sum,i,j+1);
return;
}
int main () {
while(1){
cin>>n>>s;
if (n==0&&s==0) {
break;
}
ans=0;
fanc(0,0,0);
cout ... | 0 | 63,052,057 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 78,575,485 |
#include<iostream>
using namespace std;
int main()
{
int x,a;
cin>>x>>a;
if(x>=a){
cout<<"10"<<endl;
}
else cout<<"0"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
typedef double DOUBLE;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REP... | 0 | 84,948,107 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double f(double x, int l, int r, int v){
if(0.0 <= x && x <= l) return v+l-x;
else if(l <= x && x <= r) return v;
else return v+(x-r);
}
int main(){
int N; cin >> N;
vector<int> l(N+2), r(N+2), v(N+2), t(N+1);
for(int i=1; i<=N;... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 18,367,227 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll const MOD = 1e9 + 7;
int main() {
ll N;
string S;
... | #include <bits/stdc++.h>
using namespace std;
struct xy{
double x, y;
};
void koch(int n, xy a, xy b){
if(n == 0) return;
xy s, t, u;
double v = M_PI * 60.0/180.0;
s.x = (a.x*2 + b.x)/3;
s.y = (a.y*2 + b.y)/3;
t.x = (a.x + b.x*2)/3;
t.y = (a.y + (b.y*2))/3;
u.x = (t.x - s.x)*cos(v) - (t.y - s.y)*sin(v... | 0 | 63,389,833 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <assert.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
ll ans=1;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
if(A[i]==0){
cout << 0 << endl;
return 0;
}
}
for(int i=0;i<N;i++){
if(ans>(double)1e18/(double)A[i]){
cout << -1... | 0 | 15,108,535 |
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
set<int> in, out;
pair<int, int> sushi[N];
for(int i=0; i<N; i++){
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi, sushi + N, greater<pair<int, i... | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<random>
using namespace std;
template <class T> using V = vector<T>;
templa... | 0 | 13,503,694 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
const int MOD = 1e9+7;
const int MOOD = 998244353;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
vector... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const long long mod = 1e9+7;
long long power(long long a, long long b, long long m = mod) {
if(b < 0) {
return power(power(a, -b), mod-2);
}
long long x = 1;
while(b) {
if(b & 1) {
x = 1ll * x * a % m;
... | 0 | 16,364,197 |
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <math.h>
#i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | 0 | 36,684,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
ll A, B;
cin >> A >> B;
cout << A ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ar array
#define db do... | 0 | 10,176,121 |
#include <bits/stdc++.h>
using namespace std;
int n, a[111];
void ss(){
int minj;
int cnt = 0;
for(int i = 0; i < n; i++){
minj = i;
for(int j = i; j < n; j++){
if(a[j] < a[minj]){
minj = j;
}
}
swap(a[i],a[minj]);
if(a[i] < a[minj]) cnt++;
}
for(int i = 0; i < n; i++){... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 5,785,879 |
#include <iostream>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for (int i = s; i < t; i++)
#define rng(a) a.begin(),a.end()
typedef long long ll;
using namespace std;
int main() {... | #include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define ... | 0 | 17,764,010 |
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int card[] = {13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
if (card[A-1] == card[B-1]) {
cout << "Draw" << endl;
}
else if (card[A-1] > card[B-1]) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
struct Point{ double x; double y; };
void printPoint(Point p){
printf("%.5lf %.5lf\n", p.x, p.y);
}
void koch... | 0 | 83,428,032 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll n = s.size();
ll up = 0;
ll down = 0;
ll ans = 0;
vector<ll> number(n+1);
for (ll i = 0; i < n; i++) {
if (s.at(i) == '<') {
up++;
number.at(i+1) = up;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int N = 100;
vector<vector<bool>> G(N, vector<bool>(N));
for (int i = 0; i < N / 2; i++) {
for (int j = 0; j < N; j++) {
G[i][j] = 1;
}
}
int i = 0, j = 0;
for (int c = 0; c < A - 1; c++) {
G[i][j] = 0;... | 0 | 21,605,153 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 73,838,623 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a = 1;
for (int i=1; i<=sqrt(n); i++) {
if (n % i == 0) a = max(a, i);
}
int b = n / a;
int ans = 0;
int x = max(a, b);
while(x > 0) {
ans++;
x/=10;
}
cout << ... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 3,954,618 |
#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
#include <set>
#include <bitset>
typedef long long ll;
typedef long double ld;
#define PI ... | #include <iostream>
using namespace std;
int main(){
int N; cin >> N;
int res = 0;
int cnt = 0;
int prev = -1;
for(int i=0;i<N;i++){
int a; cin >> a;
if(a != prev){
res += cnt/2;
cnt = 1;
} else {
++cnt;
}
prev = a;
}
... | 0 | 87,780,482 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,G;
int pa;
cin >> R;
cin >> G;
pa = 2*G - R;
cout << pa << endl;
} | #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for... | 0 | 3,735,416 |
#include <iostream>
using namespace std;
int main(){
int r,g;
cin >> r;
cin >> g;
cout << r+(g-r)*2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int INF = 1005;
const int MAXN = 105;
const int MAXM = 1005;
int G[MAXN][MAXN];
int U[MAXM], V[MAXM], W[MAXM];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >>... | 0 | 69,335,854 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include<bits/stdc++.h>
int main(){
using namespace std;
size_t N, K;
cin >> N >> K;
vector<size_t> p(N + 1), n(N + 1);
for(size_t i = 1; i <= N; ++i){
long a;
cin >> a;
(a > 0 ? p : n)[i] = abs(a);
}
partial_sum(p.begin(), p.end(), p.begin());
partial_sum(n.begin... | 0 | 13,011,955 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define pb push_back
#define mp make_pair
#define ll long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define testcase ll T; cin >> T; for (ll tc = 1; tc <= T; tc++)
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, A;
cin >> N >> A;
while(true){
N -= 500;
if(N < 0){
N += 500;
break;
}
}
if(N <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 0 | 15,001,643 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 78,032,028 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
ll dfs(bitset<15> b,int k,vector<int> &a,int now){
ll ans=1e18;
int n=a.size();
if(now==n){
if(b.count()!=k) return ans;
ll sum{};
int hi{a.at(0)};
for(int i=1; i<n; i++){
if(b.test(i)){
if(a.at(i)<=hi) {
su... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int N;
i... | 0 | 18,065,797 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
int main()
{
std::string s;
std::cin >> s;
int n;
std::cin >> n;
for (int i = 0; i < s.length(); i += n) {
std::cout << s[i];
}
putchar('\n... | #include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int n, a, b, c, s;
int g[11][11];
int main() {
while ((~scanf("%d", &n)) && n) {
for (int i = 0; i < 11; ++i)
for (int j = 0; j < 11; ++j)
if (i == j) g[i][i] = 0;
else g[i][j] = 1000000;
... | 0 | 22,409,297 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll calc(ll c){
if (c<=0) return 0;
c++;
ll ans = 0;
for(int i=0; i<50; i++){
ll loop = (1LL << (i+1));
ll count=(c/loop)*(loop/2);
count += max(0LL,(c%loop)-(loop/2));
if(count%2==1) ans+=1LL << i;
}
return ans;
}
int main(... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)998244353;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline b... | 0 | 46,997,060 |
#include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N, M; cin >> N >> M;
int a[N];
vector<vector<int>> G(N);
int v1,v2;
for (i... | 0 | 8,077,887 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool ... | 0 | 92,617,419 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int mod=1e9+7;
int po(int x,int y,int m) { if (y==0) return 1; int t=po(x,y/2,m)%m; t=(t*t)%m; if (y&1) return (t*x)%m; return t%m; }
const int mx=1000001;
vector<bool> prim(mx,true);
void seive(){
for (int p = 2;p*p<=1000001;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
const int MOD = 2019;
int main() {
ll l, r, ans;
cin >> l >> r;
ans = 3000;
if ((r - l)>=2019) {
ans = 0;
}else{
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j... | 0 | 29,598,505 |
#include<iostream>
using namespace std;
int main(){
int room[4][3][10];
int b,f,r,v;
for (b=0; b<4; b++){
for (f=0; f<3; f++){
for (r=0; r<10; r++){
room[b][f][r]=0;
}
}
}
int n;
cin >>n;
for (int i=0; i<n; i++){
int x,y,z,w;
cin >> x >> y >> z >> w ;
for (b=0; b<4; b++){
for (f=0; f<3; f+... | #include<bits/stdc++.h>
using namespace std;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(int)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(int)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
... | 0 | 32,929,573 |
#include<cstdio>
#include<cstring>
int main(){
char s[201], t[101], p[101];
scanf("%s %s", s, p);
strcpy(t, s);
strcat(s, t);
if ( strstr(s, p) == NULL ) printf("No\n");
else printf("Yes\n");
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstd... | 0 | 98,733,432 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.