code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 4,918,293 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | 0 | 56,664,164 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<... | #include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<cstdio>
#include<sstream>
#include<cmath>
#include<set>
#include<algorithm>
#include<map>
#define mp make_pair
#define pii pair<int,int>
#pragma GCC optimize ("O3")
#define pdd pair<double,double>
#define pll pair<ll,ll>
#define mst(a,b) mem... | 0 | 87,784,005 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef float fl;
typedef long long ll;
static const int N = 100;
int main(){
int n, p[N + 1], m[N + 1][N + 1];
cin >> n;
for(int i = 1; i <= n; i++) cin >> p[i - 1] >> p[i];
for(int i = 1; i <= n; i++) m[i][i] ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 65,915,132 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << endl;
if (x * 2 == W && y * 2 == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll m;
int d[10000], p[10000];
int main() {
while(scanf("%d%lld",&n,&m)&&(n!=0||m!=0)) {
for (int i=0; i<n; i++) scanf("%d%d",&d[i],&p[i]);
vector<P> v;
for (int i=0; i<n; i++) v.push_back(P(p... | 0 | 84,070,745 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll n;
cin >> n;
vector<ll> a(n + 1);
REP(i, n + 1){
... | #include<iostream>
using namespace std;
int main()
{
int num,tmp;
int a,b,c;
cin >> num;
while(num-->0){
cin >> a >> b >> c;
if(b>a){
tmp=a;
a=b;
b=tmp;
}
if(c>a){
tmp=a;
a=c;
c=tmp;
}
if(a*a==b*b+c*c)
cout << "YES" << endl;
else cout << "NO... | 0 | 93,210,257 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str;
cin>>str;
int w=0;
int l = 0;
int total = 15;
for(int i=0;i<str.length();i++){
if(str[i]=='o'){
w++;
}
else{
l++;
}
}
int r = total-str.length();
if((r+w)>=8){... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 35,028,091 |
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
long long binpow(long long a, long long b) {
long long res = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<int, vector<int>> Y_list;
map<pair<int, int>, int> PY_to_idx;
int main() {
int N, M;
cin >> N >> M;
for (int i=0; i<M; i++) {
int P, Y;
cin >> P >> Y;
Y_list[P].push_back(Y);
PY_to_idx[make_pair(P, Y)] = i;
}
vector<string> ans(M);
fo... | 0 | 69,116,651 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
const ll MOD=1000000007;
int main(){
int N;
ll Z,W;
cin >> N >> Z >> W;
vector<ll> a(N);
rep (i,N){
cin >> a[i];
}
int ans;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
long long ans = 0;
int count = 0;
if(k%2 == 1){
ans = pow(n/k,3);
}
else{
ans = pow(n/k,3);
for(int i=0; i<INT_MAX; i++){
if((k*i+k/2) <= n){
count += 1;
... | 0 | 57,998,608 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int minm = 1e8;
for(int i = 2; i < (int)s.size(); i++) {
int ans = (s[i-2] - '0')*100 + (s[i-1] - '0')*10 + (s[i]... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
int N,K;
int main(void)
{
cin >> N >>K;
vector<int> H(N);
for(int a=0;a<N;a++){
cin >> H[a];
}
sort(H.begin(),H.end(),... | 0 | 36,598,818 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
t... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
std::vector< std::pair<long long, long long> > drinks;
for (int i = 0; i < n; i++) {
long long a, b;
std::cin >> a >> b;
drinks.push_back(std::make_pair(a, b));
}
std::sort(drinks... | 0 | 39,405,023 |
#include <bits/stdc++.h>
using namespace std;
int check(char c){
if( (c >= 'h' && c<='p') || c == 'y' || c == 'u') return 1;
else return 0;
}
int main(){
while(1){
string s; cin>>s;
if(s == "#") break;
int count = 0;
for(int i=1; i<s.size(); i++){
if(check(s[i-1])... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
map<int, int> mp;
for(int i=0; i<n; i++){
int a;
cin >> a;
mp[a]+=1... | 0 | 52,801,743 |
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i > ll(b);... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
string ans;
if (n < m) {
for (int i = 0; i < n; i++) {
if (s[i] < ... | 0 | 59,690,817 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong A,B;
cin >> A >> B;
string S;
cin >> S;
for(int i=0; i<(A+B+1)... | 0 | 66,045,556 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(void) {
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N+1);
for(int i=1; i<=N; i++) {
cin >> A[i];
}
for(int i=1; i<=N; i++) {
A[i] = (A[i-1] + A[i] - 1) % K;
}
map<int64_t,int64_t> mp;
... | #include<stdio.h>
int main()
{
long long a,b,c,d;
scanf("%lld %lld %lld",&a,&b,&c);
if(c<=a)
{
printf("%lld %lld",a-c,b);
}
else if(c>a)
{
d=c-a;
if(d<=b) printf("0 %lld",b-d);
else printf("0 0");
}
return 0;
} | 0 | 3,916,353 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
voi... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
using namespace std;
#define pi 3.14159265358... | 0 | 59,857,247 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int x,y,mul,cnt=0,ans;
cin>>x>>y;
if(x%y==0)
{
cout<<"-1\n";
return 0;
}
for(int i=1;; i++)
{
if(x%y!=0)
{
cout<<x*i<<endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
const ll INF = 100100100... | 0 | 8,019,607 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin >> A >> B >> C;
vector<ll> rei(A);
vector<ll> denshi(B);
ll rban[200000];
ll dban[200000];
ll wari[200000];
for(int i = 0; i < A; i++){
cin >> rei[i];
}
for(int i = 0; i < B; i++){
cin >> denshi[i];
}
for(int i = 0; i < C;... | 0 | 21,675,910 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,S;
cin >> K >> S;
long long count = 0;
for (int i = 0; i <= K; i++) {
if (S-i >= K){
count += max(2*K + i + 1 - S,0);
}
else {
count += max(S - i + 1,0);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0;i < (int)(n);i++)
int main() {
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int H, W, nh, nw, S = 0, c = 0;cin >> H >> W;
P p;
vector<string> v(H);
queue<P> q, nq;
rep(i, H) cin >> v[i];
rep... | 0 | 21,490,472 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define vuni(v) ... | 0 | 22,620,136 |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair < db, db > pdd;
typedef pair < db, ld > pdl;
typedef pair < ld, db > pld;
typedef pair < ld, ld > ldp;
typedef pair < ll... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, l, r) for (int i=(l); i<(r); ++i)
#define RREP(i, r, l) for (int i=(r); i>(l); --i)
#define CASET int _T; cin >> _T; REP(caset, 0, _T)
#define print(x) cout << to_string(x) << '\n'
#define vi vector<int>
#define vb vector<bool>
#define v... | 0 | 23,580,036 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
cout<<(n*(n-1))/2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim... | 0 | 44,534,107 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
int main(){
int N;
cin >> N;
string s, t;
cin >> s >> t;
int ans = 2*N;
rep (i, N){
if (s.substr(i, N-i) == t.substr(0, N-i)){
ans -= N-i;
break;
}
}
cou... | #include<stdio.h>
struct UF{
int u[10001];
void init(int x){
for(int i=0;i<x;i++){
u[i] = i;
}
}
int unite(int x,int y){
x = find(x);
y = find(y);
if(x > y) u[x] = y;
if(y > x) u[y] = x;
}
int find(int x){
if(x != u[x]) u[x] = find(u[x]);
return u[x];
}
};
int main(){... | 0 | 86,246,948 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, a, b;
int main() {
ll i, j, k=0, z;
cin >> n >> a >> b;
if(n < a+b-1 || n > a*b) return puts("-1")*0;
for(i=a-1; i>=0; i--) {
z = min(b, n-i);
for(j=0; j<z; j++) printf("%lld ", k+z-j);
k += z;
n -= z;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
ll repow(ll k,ll n)
{
ll ans=1;
for(int i=0;i<n;i++)
{
ans= (((ans)*k) )%mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
... | 0 | 65,523,940 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<string> templates = {"dream", "dreamer", "erase", "eraser"};
for (auto &compare : templates) {
reverse(compare.begin(), compare.end());
}
st... | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
#define ld long double
#define ff first
#define ss second
using namespace std;
ll fact(ll a)
{
if(a==0) return 1;
else return a*fact(a-1);
}
vl<ll> divisor(ll n)
{
vl<ll> v;
for(int i=2;i<=sqrt(n);i++)
{
if(n... | 0 | 59,747,476 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | 0 | 15,192,448 |
#include<bits/stdc++.h>
#include<algorithm>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll t,i,j,n,m,p,x,sum=0;
string a,b,c;
cin>>a>>b>>c;
if(a[a.length()-1]==b[0]&&b[b.length()-1]==c[0])
cout<... | #include <vector>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve(long long N, std::vector<long long> A){
ll mask = 0;
for(ll i=0; i<N; i++){
mask ^= A[i];
}
for(ll i=0; i<N; i++){
A[i] = A[i] & (~mask);
}... | 0 | 79,673,878 |
#include <bits/stdc++.h>
#define endl "\n"
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; }
using namespace std;
int main(){
using ll = long long;
ll n; cin >> n;
vector<ll> a(n);
for... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int n, i, j, k;
int b, f, r, v;
int count[4][3][10] = {0};
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%d %d %d %d", &b, &f, &r, &v);
count[b - 1][f - 1][r - 1] += v;
}
for(i = 0; i < 4; i++){
... | 0 | 21,385,314 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long step = 0;
int max_height = 0;
for (int i = 0; i < n; i++)
{
if (a[i] < max_height) step += max_height - a[i];
else max_height = a[i];
}
cout << step << endl;... | 0 | 82,327,149 |
#include <bits/stdc++.h>
#include <vector>
#include <cmath>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define REPR2(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#de... | #include <iostream>
#define MAX_N 10000
using namespace std;
int par[MAX_N];
int rank[MAX_N];
int find(int x) {
if (par[x] == x) return x;
return find(par[x]);
}
bool same(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return true;
return false;
}
void unite(int x, int y) {
x = find(x);
y = find(... | 0 | 19,846,359 |
#include <bits/stdc++.h>
#define MAXN 2010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const ll mod = 1e9 + 7;
ll n, m, ps[MAXN][MAXN];
int main (){
ios_base::sync_with_stdio(false);
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h, w;
cin >> h >> w;
string s[h + 1];
for (int i = 0; i < h; i++) {
cin >> s[i];
s[i] += 'X';
}
vector<vector<int>> dp(h + 1, vec... | 0 | 22,850,241 |
#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>;
using matrix = vector<vector<ll>>;
#defin... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str[9];
str[0] = ".,!? ";
str[1] = "abc";
str[2] = "def";
str[3] = "ghi";
str[4] = "jkl";
str[5] = "mno";
str[6] = "pqrs";
str[7] = "tuv";
str[8] = "wxyz";
string a;
int h,t = 0;
cin >> h;
while (t < h) {
cin >> ... | 0 | 40,267,041 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
vector<int> a(n); for(int i = 0; i < n; i++){cin >> a[i]; a[i]--;}
int cnt = 0;
for(int i = 0; i < n; i++) {
if(a[a[i]] == i)cnt++;
}
cout << cnt / 2 << endl;
} | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#includ... | 0 | 56,501,014 |
#include<bits/stdc++.h>
typedef long long ll ;
typedef double db;
typedef long double ldb;
typedef unsigned long long ull ;
const double PI = acos(-1) ;
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<... | #include<bits/stdc++.h>
using namespace std;
int mi[4]={-1,0,1,0};
int mj[4]={0,-1,0,1};
int main()
{
int H,W;scanf("%d %d",&H,&W);
char S[H][W];string ans="Yes";
bool check[H][W];for(int i=0;i<H;i++)fill(check[i],check[i]+W,false);
for(int i=0;i<H;i++)for(int j=0;j<W;j++)c... | 0 | 24,140,284 |
#include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
#define f first
#define s second
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,sum=0,mn=INF... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 12,072,795 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
map<string,int> table;
#if 0
所用時間:
感想:
#endif
void solve(){
string word, frequent, longest;
int N = 0;
while(cin >> word){
table[word] += 1;
if(table[word] > N){
frequent = word; N = table[word];
}
if(word.size() > longes... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 0 | 1,633,668 |
#include<iostream>
using namespace std;
int main(void){
int area = 0;
int n,x,y;
while(cin >> n){
for(int i = 0;i < 600 / n -1 ;i++){
x = (i+1) * n;
y = x * x;
area += n * y;
}
cout << area << endl;
area = 0;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout ... | 0 | 90,520,714 |
#include<stdio.h>
int step(int s,long long a){
if(s==0)return a;
return step(s-1,a*s);
}
int main(){
int n;
scanf("%d",&n);
printf("%lld\n",step(n,1));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define TEST ll t;cin>>t;while(t--)
ll s... | 0 | 28,625,487 |
#include <stdio.h>
int main(){
int n;
scanf("%d",&n);
int a,b;
scanf("%d %d",&a,&b);
for (a==a;a<=b;a++){
if(a%n==0){
printf("OK");
return 0;
}
else{
continue;
}
}
printf("NG");
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int A,B,C,K;
cin >> A >> B >> C >> K;
int i = 0;
while(!(A < B && B < C)){
if(A >= B){
B *= 2;
}
else{
C *= 2;
}
i++;
}
if(i <= K){
cout << "Yes" << endl;
}
el... | 0 | 35,319,740 |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define il inline
#define LL long long
#define ULL unsigned LL
#define pb push_back
#define mp make_pair
#define p... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 2,528,057 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n,m,r;
cin>>n>>m>>r;
int R[r];
for(int i = 0; i<r; i++)
{
cin>>R[i];
--R[i];
}
sort(R,R+r);
ll sp[n][n];
for(int i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string zero_padding(int n) {
if (n == 0) { return "000"; }
int n_copy = n;
int digits = 0;
while (n>0) {
n = n / 10;
digits++;
}
string s;
for (int i = 0; i < (3-digits); i++) {
s += '0';
}
return s+to_string(n_copy);
}
in... | 0 | 86,831,652 |
#include<iostream>
using namespace std;
int main()
{
while (1) {
int n, i, j, a[5000], max = -100001, c;
cin >> n;
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
c = 0;
for (j = i; j < n; j++) {
c+= a[j];
max = max < c ? c : max;
}
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> v(H, vector<char>(W));
for (int i = 0; i < H; i++) {
... | 0 | 5,824,222 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
vector<vector<int>> G(404040);
vector<int> score(404040,0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h,n;
ll a[1111];
ll b[1111];
int main(){
cin >> h >> n;
for(ll i=0;i<n;i++){
cin >> a[i] >> b[i];
}
vector<ll> dp(h+1,1e9);
dp[0]=0;
for(ll i=0;i<n;i++){
for(ll j=1;j<=h;j++){
if(j-a[i]<=0) dp[j]=m... | 0 | 53,347,115 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long H,N,X,SUM=0;
cin>>H>>N;
rep(i,N){cin>>X;SUM+=X;}
if(H>SUM){cout<<"No"<<endl;}else{cout<<"Yes"<<endl;}
} | #include<bits/stdc++.h>
using namespace std;
int n,m;
void dfs(int i, vector<bool> &checked, bool c[10][10], int &ans){
int t = 0;
for (int j = 0; j < n; j++)
{
if(checked[j]) t++;
}
if(t == n) ans ++;
else{
for (int j; j < n; j++)
{
if(c[i][j] == true && !che... | 0 | 18,155,112 |
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k,m=1,r=0,i;
cin >> n >> k;
if (n == 1) {
if (2 > k + 1)
cout << k + 1 << endl;
else
cout << 2 << endl;
return 0;
}
while (m < k ) {
m *= 2;
r++;
}
for (i=0;i < n-r;i++) {
m += k;
... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | 0 | 52,663,273 |
#include <bits/stdc++.h>
using namespace std;
#define fcout(d) cout << fixed << setprecision(d)
#define repU(i,s,t) for(int i = (s); i <= (t); ++i)
#define repD(i,t,s) for(int i = (t); i >= (s); --i)
#define rep(i,n) repU(i,0,n - 1)
#define rep1(i,n) repU(i,1,n)
#define all(v) begin(v),end(v)
#define l_bnd lower_bound... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define timer_start() \
chrono::system_clock::time_point start, end; \
start = chrono::system_clock::now();
#define timer_wrap() \
end = chrono::system_clock::now(); ... | 0 | 71,503,793 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string s,s0,s1,ans="~";
cin>>s>>s1;
s0=s;
if(s.size()<s1.size())
{
cout<<"UNRESTORABLE";
return 0;
}
for(int t=s.size()-s1.size();t>=0;t--)
{
bool ok=1;
for(int i=t;i<t+s1.size();i++)
{
if(s[i]==s1[i-t]||s[i]=='?')
{
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int,int> pi;
#define fi first
#define se second
typedef vector... | 0 | 72,795,960 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
ll n;
ll a[100];
ll ans=1000;
ll k;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=1;i<n;i++){
if(a[i-1]<a[i]){
k=ans/a[i-1];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | 0 | 61,647,002 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << (a+b >= c ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 4,036,043 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int n,m;
ll a[100001],b[100001];
int main(){
cin>>n>>m;
rep(i,n) cin>>a[i],b[i]=a[i];
int pre=-1,cnt=0;
rep(i,... | 0 | 27,776,277 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using lint = long long;
using v1i = vector<int>;
int main(){
int n, t; scanf("%d %d", &n, &t);
v1i v(n); rep(i, n) scanf("%d", &v[i]);
lint x = 0;
rep(i, n){
if(i < n-1 && v[i] + t > v[i+1]) x += v[i+1] - v[i];
el... | #include<stdio.h>
#define MAX 250
typedef struct Node {
int key;
Node *parent, *left, *right;
} Node;
Node *NIL, T[MAX];
void print(int n) {
int i;
Node *N;
for (i=1; i<=n; i++) {
N = &T[i];
printf("node %d: key = %d, ", i, N->key);
if (N->parent!=NIL) printf("parent key = %d... | 0 | 4,275,676 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N);
REP(i, M) {
int a, b;
cin >> a >> b, a--, b--... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int i,j,l,n,k;
cin >> n >> k;
if((n-1)*(n-2)/2<k){
cout << -1 << endl;
return 0;
}
int x[110][110];
for(i=0;i<n;i++){
for(j-0;j<n;j++){
x[i][j]=0;
}
}
for(i=1;i<n;i++){
x[0][... | 0 | 12,594,329 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
for (u_int64_t price = 1; price < 1010; price++) {
if (floor(price * 0.08) == A && floor(price * 0.1) == B) {
cout << price << endl;
return;
}
}
... | #include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
int main()
{
ll n,i,c=0;
cin>>n;
ll a[n];
for(int j=0;j<n;j++)
cin>>a[j];
for(i=0;i<n-1;i++)
{
while(a[i]>a[i+1])
{
a[i+1]++;
c++;
}
}
cout<<c<<endl;
} | 0 | 19,433,049 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) for(int i = 0; i < n; i++) cin >> a[i];
#define print(a) for(int i = 0; i < n; i++) cout << a[i] << " ";
#define pb push_back
#define pql priority_queue<int>
#define pqs priority_queue... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ii> P;
typedef unsigned long long i... | 0 | 40,264,639 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll,ll>>
#define vvl vector<vector<ll>>
#include<algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
templa... | #include <bits/stdc++.h>
using namespace std;
bool is_left(char c) {
string left="qwertasdfgzxcvb";
for(int i=0;i<left.size();i++) if(left[i]==c) return 1;
return 0;
}
int main() {
string s;
while(cin>>s,s!="#") {
bool L=is_left(s[0]);
int ans=0;
for(int i=1;i<s.size();i++) {... | 0 | 13,140,076 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
for (int i = 0; i < l; i += 2) {
cout << s[i];
}
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define mp make_pair
#define pb(x) push_back(x)
#define... | 0 | 65,395,167 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/arc063_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | 0 | 91,881,750 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 150
#define L 1000
int LCSLength(char *X, char *Y){
int m = strlen(X), n = strlen(Y);
int i,j;
int c[m+1][n+1];
for(i=1; i<=m; i++) c[i][0] = 0;
for(j=0; j<=n; j++) c[0][j] = 0;
for(i=1; i<m+1; i++){
for(j=1; j<n+1; j++){
if(X[... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int n,x;cin>>n>>x;
vector<int> a;
int d;
for(int i=0;i<n;i++)
{
cin>>d;
a.push_back(abs(x-d));
}
int g=a[0];
for(int i:a)g=__... | 0 | 46,793,914 |
#include <iostream>
#include <string>
int main()
{
while (true) {
std::string in_str;
std::cin >> in_str;
if (in_str.at(0) == '0'){
break;
}
int sum = 0;
for (size_t i = 0; i < in_str.size(); i++){
if (in_str.at(i) == '\0'){
bre... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#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--)
LL x[101010];
int r[31][101010];
int pow2[31];
int main(){
int N;
... | 0 | 57,226,440 |
#include <bits/stdc++.h>
using namespace std;
int solve(int d, int tate){
return d * tate * tate;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int d;
while(cin>>d){
int ans = 0;
for(int i=0;i<=600-d;i+=d)
ans += solve(d, i);
cout << ans << endl;
}
return EXIT_SUCCESS;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define size(x) (int)x.size()
#define reverse(l, sz) reverse(c + l, c + l + sz)
const int N = 1e6 + 1, mod = 1e9 + 7, inf = 2e9;
int n, a, b, c[N];
int main() { cin.tie(0)->sync_with_stdio(0);
cin >> n >> a >> b;
if (a + b - 1 > n || 1ll * a * b < n)... | 0 | 90,503,571 |
#include "bits/stdc++.h"
#include <unordered_set>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vec... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007... | 0 | 2,472,742 |
#include<bits/stdc++.h>
#define ll long long
#define nes ios_base :: sync_with_stdio(0); cin.tie(0);
using namespace std;
int main(){
nes;
ll n,k;
cin>>n>>k;
ll dp[n+1]={0};
dp[0]=1;
for(int i=1;i<=n;++i) dp[i]=min(dp[i-1]*2,dp[i-1]+k);
cout<<dp[n];
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=105;
ll F[N][5],k;
string str;
vector <ll> B;
ll solve(ll pos,ll num,bool check)
{
if(pos < 0) return num==k;
if(check==true && F[pos][num] > -1) return F[pos][num];
ll dem=0;
for(int i=0;i<=max(check*9ll,B[pos]);i++)
{
... | 0 | 46,391,106 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using pll = pair<ll,ll>;
using Graph = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i,l,r) for(ll i = (l); i <= (ll)(r); i++)
#define rep3(i,l,r) for(ll i =... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 0 | 60,623,001 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for(int i=0; i<N ;i++){
cin >> p.at(i);
}
sort(p.begin(),p.end());
int ans = 1;
for(int i=0; i<N-1 ;i++){
int goukei=1;
for(int j=1; j<N-i ; j++){
if(p.at(i)==p.at(i+j) || p.at(i)+1==p.at(i+j)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, m, X, Y; cin >> n >> m >> X >> Y;
vector<int> x(n); for (int i = 0; i < n; ++i) cin >> x[i];
vector<int> y(m); for (int i = 0; i < m; ++i) cin >> y[i];
bool ok = false;
for (int i = X +... | 0 | 50,869,451 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int a, b;
cin >> a >> b;
if (a % 3 == 0 ||
b % 3 == 0 ||
(a + b) %... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 41,686,636 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
using Graph = vector<vector<int>>;
using pint = pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ... | #include <bits/stdc++.h>
int64_t func(int64_t v) {
const int64_t num = v + 1;
if (num % 2 == 0) {
const int64_t d = num / 2;
if (d % 2 == 0) {
return 0;
} else {
return 1;
}
} else {
const int64_t d = (num - 1) / 2;
if (d % 2 == 0) {
... | 0 | 31,029,705 |
#include <iostream>
using namespace std;
int W, H, x, y, r;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> W >> H >> x >> y >> r;
if (x + r > W || x - r < 0 || y + r > H || y - r < 0) {
cout << "No" << "\n";
}
else {
cout << "Yes" << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using tint = long long;
using ld = long double;
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
using vi = vector<tint>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi =... | 0 | 76,090,663 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int MAX=1001;
int lcs(string X,string Y)
{
int i=0,j=0,c[MAX][MAX],x=X.length(),y=Y.length();
for(i=0;i<=x;i++)c[i][0]=0;
for(i=0;i<=y;i++)c[0][i]=0;
for(i=1;i<=x;i++)
for(j=1;j<=y;j++)
if(X[i-1]==Y[j-1])c[i][j]=c[i-1][j-1]+1... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1.0)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x... | 0 | 68,287,692 |
#include <bits/stdc++.h>
using namespace std;
#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define re... | #include <bits/stdc++.h>
using namespace std;
void solve(int n, int k, vector<int>&a){
int needed = (log(n) + 1.0)/log(1.34);
needed = min(needed, k);
for(int kk = 0; kk < needed; kk++){
vector<int>B(n, 0);
for(int i = 0; i < n; i++){
int l = max(0, i - a[i]);
int r =... | 0 | 49,512,615 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | #include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#... | 0 | 23,214,587 |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define _dec(i,N,j) for(int i = (N-1);i >= (j);i--)
#define _rec(i,N,j) for(int i = (N);i >=(j);i--)
#define ALL(x) x.begin(),x.end()
#define MEM(a,n) memset(a,n,sizeof(a))
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
int main()
{
string s;
cin >> s;
rep(i, 4)
{
cout << s[i];
}
cout << " ";
rep(i, s.length() - 4)
{
... | 0 | 79,041,836 |
#include<iostream>
using namespace std;
struct Card {char suit, value;};
void BubbleSort(struct Card C[36], int N){
for(int i = 1; i < N; i ++){
for(int j = N - 1; j >= i; j --){
if(C[j].value < C[j - 1].value){
Card temp;
temp = C[j];
C[j] = C[j- 1];
C[j - 1] = temp;
}
}
}
}
void SelectionS... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 80,698,383 |
#include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int i=0;
int j=0;
int n=0;
int a[1000000]={};
int sum=0;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<1000000;i++)
a[i]=1;
sum=0;
for(i=2;i<=... | #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;++... | 0 | 19,992,319 |
#include <iostream>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
int N;
std::string S;
cin >> N >> S;
int cnt = 1;
for(int i = 0;i<N-1;i++){
if(S[i] != S[i+1]){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 18,963,186 |
#include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++) cin >> x[i];
typedef long long int ll;
using namespace std;
int main(){
while(1){
int h,w; cin >> h >>w;
if(h==0 && w==0)break;
for(int i=0;i<h;i++){
if(i==0 || i==h-1){
for(int j=0;j<w;j++){
cout <<"#";
}
cout << endl;... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 11,391,048 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll N=pow(10,9)+7;
ll mod_pow(ll x, ll y){
ll ans;
if(y==0) return 1;
else if(y%2==0){
ans = (mod_pow(x,y/2) * mod_pow(x,y/2)) % N;
return ans;
}
else{
ans =... | 0 | 18,002,453 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <time.h>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <string.h>
#define sf scanf
#define pf printf
#define lf double
#define ll long... | #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | 0 | 35,391,992 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define 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)
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,L,T;
cin >> N >> L >> T;
vec<ll> X(N),W(N);
map<ll,ll> mp;
vvec<ll> list(2);... | 0 | 91,534,231 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<n;i++)
#define REP(i, n) for(int i=1;i<=n;i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
ll sum = 0;
vector<ll> d(n);
rep(i, n) {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ff first
#define ss second
#define endl "\n"
#define MOD 10000... | 0 | 59,596,580 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++){
cin >> W[i];
}
int ans = INT_MAX;
for(int i = 0; i < N; i++){
int s1_Sum = 0;
... | #include <iostream>
#include <set>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int INF = 1e7;
int n, m;
vector<P> edge[110];
P dist[110][110];
set<P> edges;
long long ans;
void dijkstra(int s) {
for (int i = 0; i < n; i++) {
dist[s][i] = P(INF, -1);
}
d... | 0 | 39,522,086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c, d;
c = a % 2;
d = b % 2;
if (c == 0 || d == 0){
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 97,600,183 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int x;
cin >> x;
v.push_back(x);
cin >> x;
v.push_back(x);
cin >> x;
v.push_back(x);
sort(v.begin(), v.end());
cout<<v[0] +v[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 0 | 31,713,580 |
#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;
int main() {
char c;
cin >> c;
string ans;
if(c == 'A') ans = "T";
else if(c == 'T') ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#include <b... | 0 | 72,286,228 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
int flag = 0;
while(N >= 0) {
if (N%7 == 0) {
cout << "Yes" << endl;
flag++;
break;
... | #include <bits/stdc++.h>
using namespace std;
int n;
int arr[100100];
int main() {
int i;
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%d",&arr[i]);
sort(arr,arr+n);
int mini = 2e9, t = 0;
for (i=0;i<n-1;i++) {
if (mini>abs(arr[n-1]-2*arr[i])) {
mini=abs(arr[n-1]-2*arr[i]);
... | 0 | 65,680,297 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
using namespace std;
int main(){
int k,s;
cin >> k >> s;
int ans = 0;
rep(x,k){
rep(y,k){
int z = s - (x + y);
if(0 <= z && z <= k) ans++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | 0 | 80,595,463 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<... | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);
int n;
ll a, b;
int main () {
cin >> n;
ll sol = 0;
for (int i = 1; i <= n; i++) {
ll tren = ... | 0 | 46,192,510 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define INPUT(x) scanf("%d",&x)
#define REP1(x,n) for(int x = 0; x < n; x++)
#define REP2(s,e) for(int x = s; x <= e; x++)
#define BR printf("\n")
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int h,w;
cin>>h>>w;
vector<vector<char> >a(h);
vector<vector<int> >r(h);
vector<vector<int> >re(h);
for(int i=0;i<h;i++)
{
a[i].resize(w);
r[i].resize(w);
int t=-1;
for(int j=0;j<w;j++)
{
cin>>a[i][j]... | 0 | 7,109,550 |
#include <iostream>
using namespace std;
int main(void){
int a;
cin>>a;
int b=a/1000;
int c=(a%1000)/100;
int d=(a%100)/10;
int e=a%10;
if((b==c&&c==d)||(c==d&&d==e)||(b==c&&c==d&&d==e)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x;
cin>>x;
vector<int>vec(x);
for(int i=0;i<x;i++){
cin>>vec[i];
}
int y = vec.at(0);
for(int i=1;i<x;++i){
y = min(y,vec.at(i));
}
int z = vec.at(0);
for(int i=1;i<x;++i){
... | 0 | 57,079,352 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int i,n;
cin>>n;
for(i=0;i<n;i++)
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[2]*a[2] == a[0]*a[0] + a[1]*a[1])
{
cout<<"YES"<<endl;
} else
cout<<"NO"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)n; i++)
#define PI 3.14159265358979323846
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define pll pair<long long, long long>
#define cld complex<long double>
using namespace std;... | 0 | 4,870,209 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void solve(string, string);
int main(){
int q; cin >> q;
for(int i=0; i<q; i++){
string s, t; cin >> s >> t;
solve(s, t);
}
return 0;
}
void solve(string s, string t){
int m=s.length(), n=t.length();
s = " " + s; t = " ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitse... | 0 | 9,247,050 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int cnt,i,j,k,a,b,c,d,x,y;
while(~scanf("%lld %lld %lld %lld",&a,&b,&c,&d))
{
x = a*c;
if(x< a*d) x = a*d;
if(x< b*c) x = b*c;
if(x< b*d) x = b*d;
if(x<0 && ((a<=0 && b>=0) || (c<=0 && d>=0))) x =0;
... | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 37,759,795 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putc... | 0 | 28,577,321 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
void solve(long long N, std::vector<long long> P){
vector<ll> M(N, P[0]);
for(ll i = 1; i < N; ++i){
M[i] = min(P[i], M[i-1]);
}
ll cnt = 0;
for(ll i = 0; i < N; ++i){
if(P[i] == M[i]) cnt++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, type... | 0 | 22,654,975 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, K;
cin >> N >> K;
vector<ll> A(N), B(N);
for ( int i = 0; i < N; i++ ) {
cin >> A[i] >> B[i];
}
ll ans = 0;
ll k = K;
bool f = true;
while ( f || k > 0 ) {
ll mask = f ? k : k-1;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n;
vector<int> G[maxn];
int main() {
scanf("%d", &n);
for (int i = 1, u, v; i < n; i++) {
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
function<int(int, int)> solve = [&](int v, int fa) {
... | 0 | 40,308,071 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, h;
cin >> n >> h;
vector<int> a(n);
priority_queue<int> b;
rep(i,n) {
int bi;
cin >> a.at(i) >> bi;
b.push(bi);
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 0 | 15,846,068 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
const ll mod=1e9+7;
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
ret... | 0 | 96,578,591 |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int S = 0;
int W = 0;
cin >> S;
cin >> W;
if(S > W){
cout <<"safe"<< endl;
}else{
cout <<"unsafe"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,x;
while(1) {
cin >> n >> x;
int count = 0;
if(n == 0 && x == 0) break;
for(int a = 1; a <= n; ++a) {
for(int b = a + 1; b <= n; ++b) {
for(int c = b + 1;c <= n; ++c) {
if(a + b + c == x) ++count;
}
... | 0 | 79,733,712 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a,b,c;
int ans=0;
scanf("%d %d %d",&a,&b,&c);
for(int i=a;i<=b;i++){
if(c%i==0){
ans+=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 7,664,111 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int main(void){
int n;
string in;
while(1){
cin>>n;
if(n==0)break;
char data[n];
char into[n];
for(int i=0;i<n;i++){
... | 0 | 79,809,905 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main() {
string S; cin >>S;
string check[4]={"dream","dreamer","erase","eraser"};
reverse(S.begin(),S.end());
rep(i,0,4) {
reverse(check[i].begin(),check[i]... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
int main()
{
int n, k;
cin >> n >> k;
int ans = 0;
deque<int> dq(n);
for(int i = 0; i < n; i++)cin >> dq[i];
for(int i = 0; i <= k; i++) {
for(int j = 0; j <= k; j++) {
... | 0 | 39,148,414 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.