code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int dis... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | 0 | 5,677,472 |
#include <iostream>
#include <utility>
using namespace std;
void output(int n, int element[])
{
for (int i = 0; i < n - 1; i++)
cout << element[i] << " ";
cout << element[n - 1] << endl;
}
int selection_sort(int n, int element[])
{
int swap_count = 0;
for (int i = 0; i < n; i++) {
int minimam = i;
for (int j ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,... | 0 | 93,725,573 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | #include<iostream>
#include<string>
#define rep(i,start,n) for(int i=0 ; i < n ; i++)
using namespace std;
int main(){
int count[26]={0};
int x=0;
string sentence;
while(getline(cin,sentence)){
x = sentence.lengt... | 0 | 14,581,076 |
#include <bits/stdc++.h>
using namespace std;
# define ll long long
# define VI vector<int>
# define VL vector<ll>
# define PII pair<int,int>
# define VII vector<PII>
# define mp make_pair
# define pb push_back
# define vt vector
# define PI acos(-1)
# define ld long double
# define endl "\n"
# define all(c) (c).begi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll n; cin >> n;
vector<ll> a(n);
rep(i,n) {
cin >> a[i];
}
ll guu = 0;
if (n % 2 == 0) guu = 1;
else guu = 0;
ll dir = 0;
... | 0 | 33,176,812 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){ cin >> a[i]; }
int min=0, max=0;
long long sum=0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.end());
for(in... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | 0 | 47,076,244 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef struct node{
int data;
struct node *pre, *next;
}Node;
Node *head;
void init()
{
head = (Node*)malloc(sizeof(Node));
head->next = head;
head->pre = head;
}
void insert(int key)
{
Node *x = (Node*)malloc(sizeof... | #include<bits/stdc++.h>
using namespace std;
#define mx 105
#define ll long long
int ar[mx][mx];
char ch[mx][mx];
int n,m,k,ii;
void solve()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%s",ch[i]+1);
if(ch[1][1]=='#')ar[1][1]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
... | 0 | 56,010,889 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int ok = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') ok++;
}
cout << (8 <= 15 - s.size() + ok ? "YES" : "NO") << endl;
return 0;
} | #include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
cin>>n;
set<string> s;
string v,w;
for(int i=0;i<n;i++){
cin>>v>>w;
if(v=="insert"){
s.insert(w);
}
else{
if(s.count(w)){cout<<"yes"<<endl;}
e... | 0 | 72,519,328 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
for(int i=0; i<n; i++){
int a, b;
cin >> a >> b;
if(a >= h && b >= w) ans += 1;
}
cout << ans << endl;
return 0;
} | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | 0 | 81,913,535 |
#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++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ... | #include <bits/stdc++.h>
template <typename T>
class SegmentTree {
public:
using Operation = std::function<T(T, T)>;
using RangeOperation = std::function<T(T, int)>;
SegmentTree(
int size, Operation operation, T identity = T(),
RangeOperation range_operation = [](int v, int) { return v; })
: op... | 0 | 5,748,887 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void){
int n, k;
cin >> n >> k;
vector<ll> s(n+1);
s[0] = 0;
rep(i, n){
ll a;
cin >> a;
s[i+1] = (s[i] + a - 1) % k;
}
map<ll, ll> mp;
queue<ll> q;
ll ans = 0;
rep(... | #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 log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 49,108,690 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int A,B,m,x,y,c,mn=2e5;
cin >> A >> B >> m;
vector<int> a(A),b(B);
rep(i,A)cin >> a.at(i);
rep(i,B)cin >> b.at(i);
rep(i,m){
cin >> x >> y >> c;
mn=min(a.at(x-1)+b.at(y-1)-c,mn);
}
... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 50,749,714 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++){
cin>>a[i];
}
sort(a,a+5);
for(int i=4;i>=0;i--)
printf("%d%c",a[i],i==0?'\n':' ');
return 0;
} | #pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DE... | 0 | 70,085,963 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,K;cin>>N>>K;
long long ans=K*pow((K-1),N-1);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
int k,a,b;
cin >> k >> a >>b;
ll bis=1;
int money=0;
rep(i,k){
if (money>0){
money--;
bis+=b;
}
else if(bis>=a && a<b &&(b-a)>2 &&(k-i)>1){
money++;
bis-... | 0 | 99,649,345 |
#include <iostream>
using namespace std;
int main(){
long long x, y;cin>>x>>y;
if (x % y == 0){
cout << -1 << endl;
} else {
long long num=1;
bool success_flag = true;
while(true){
if (x * num <= 1000000000000000000){
if (x * num % y != 0){
... | #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;
int a[n],s[n+1];
int sum=0;
rep(i,n)cin>>a[i];
s[0]=a[0];
rep(i,n){
sum+=a[i];
s[i+1]=s[i]+a[i+1];
}
int ans = 99999999;
rep(i,n)... | 0 | 8,615,702 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) ((a+b-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pie 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define ff first
#define ss second
#define INF 1ll<<63 - 1
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)... | 0 | 31,277,974 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 100000007
#define MAX_E 1000000
#define MAX_V 1000000
using namespace std;
int V, E;
vector<int> adj[MAX_V];
int visited[MAX_V];
stack<int> stk;
void DFS(int u){
visited[u]=2;
int d=adj[u].size();
for(int j=0; j<d; ++j){
if(visited[adj[u][j]]==2){
printf(... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,sum;
cin >> N;
vector<int> A(N+2,0);
vector<bool> bs(N+1,false);
sum = 0;
for(int i=0;i<N;i++) {
cin >> A[i+1];
if(i) {
if(((A[i+1] >= A[i]) && (A[i] >= A[i-1]))
|| ((A[i+1] <= A[i]) ... | 0 | 90,404,299 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
map<string,int> mp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
vector<ll> a(n),sum(n+1,0);
for(int i=0;i<n;i++)cin>>a.at(i);
for(int i=0;i<n;i++)sum.at(i+1)=a.at(i)+sum.at(i);
vector<ll> tmp;
for(int... | 0 | 24,304,134 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
typedef long long lint;
typedef double Double;
typedef pair<int, int> pii;
type... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = (ll)5e15;
int main() {
int n;
cin >> n;
P now = P(0,0);
int time = 0;
rep(i,n) {
int t,x,y;
cin >> t >> x >> y;
int dist = abs(x-now.first) + a... | 0 | 3,480,514 |
#include<cstdio>
unsigned prime[15] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47}, over[5], divisor[5] = {3,5,15,25,75};
int main(){
unsigned N;
scanf("%u", &N);
unsigned power, _N;
for (size_t i = 0; i < 15; i++){
power = 1, _N = N;
while(_N /= prime[i]) power += _N;
for (size_t ... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin>>s>>t;
vector<int> ss(s.length());
vector<int> tt(t.length());
for(ll i=0;i<s.length();++i){
ss[i]=s[i];
}
for(ll i=0;i<t.length();++i){
tt[i]=t[i];
}
sor... | 0 | 3,723,805 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) v; cin >> v;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins... | #include <bits/stdc++.h>
using namespace std;
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 97,057,566 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); ++i)
#define repj(n) for (long long j = 0; j < (n); ++j)
#define repk(n) for (long long k = 0; k < (n); ++k)
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define it... | #include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ON... | 0 | 48,909,272 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define p... | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < cha... | 0 | 32,103,784 |
#include <iostream>
using namespace std;
int main(){
char C[6] = {'A','B','C','D','E','F'};
char A,B;
int a,b;
cin >> A >> B;
for(int i = 0; i < 6; i++){
if(C[i] == A) a = i;
if(C[i] == B) b = i;
}
if(a > b) cout << ">" << endl;
else if(a < b) cout << "<" << endl;
else cout << "=" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 30,056,674 |
#include <iostream>
using namespace std;
int main(void){
int N;
cin >> N;
int x = N * 800;
int y = (N / 15);
y *= 200;
cout << x - y << endl;
} | #include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data(std::make_unique<int[]>(max_size()))
{
for (int i = 0; i < max_size(); ++i) {
... | 0 | 44,561,390 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll amari = 1000000007;
#define rep(n,x) for(ll ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | 0 | 69,089,498 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> nums(n);
for (int &a : nums) {
cin >> a;
}
sort(nums.begin(), nums.end());
int res = 0;
for (int i = 0; i < k; ++i) {
res += nums[i];
}
cout << res << endl;
} | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 14,685,988 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long>T(N);
for (int i = 0; i < N; i++) {
cin >> T.at(i);
}
if (N == 1){
cout << T.at(0) << endl;
return 0;
}
long long gcd;
long long lcm = T.at(0);
long long X = T.at(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 84,117,379 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,t=0,r,c=0,a;
cin>>n>>m;
m=m+1;
while(m>n)
{
a=n;
while(n!=0)
{
r=n%10;
t=r+t*10;
n=n/10;
}
if(t==a)
{
c++;
n=a+1;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a > b){
while(a > 0){
cout << b;
a--;
}
}
else{
while(b > 0){
cout << a;
b--;
}
}
cout << endl;
} | 0 | 20,264,049 |
#include <iostream>
#include <algorithm>
using namespace std;
int N, K, a[100009], b[100009];
long long solve(int x) {
long long ret = 0;
for (int i = 0; i < N; i++) {
if ((x & a[i]) == a[i]) ret += b[i];
}
return ret;
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
long long ret... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 55,970,266 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long double a,b,c;
cin>>a>>b;
c=a/b;
cout<<c<<endl;
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b,... | 0 | 52,021,773 |
#include <bits/stdc++.h>
using namespace std;
#define forloop(n) for(int i = 0; i < n; i++)
#define ll long long
int main(){
int n; cin>>n;
ll res = 0, sum = 0;
forloop(n){
ll a,b; cin>>a>>b;
sum += a*b;
res += b;
}
cout<< (sum-1)/9 + res-1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << '\n'
const int MOD = (int)1e9 + 7;
signed main() {
int A... | 0 | 18,330,599 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 38,637,973 |
#include<iostream>
using namespace std;
int main()
{
int n;
int room[4][3][10] = { { 0 } };
cin >> n;
for (int i = 0; i < n; i++){
int b, f, r, v;
cin >> b >> f >> r >> v;
room[b - 1][f - 1][r - 1] = room[b - 1][f - 1][r - 1] + v;
}
for (int i = 0; i < 4; i++){
for (int j = 0; j < 3; j++){
for (int k =... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 32,433,659 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | #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;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> Pati(N + 1), Maisuu(N + 1);
Pati[0] = 1, Maisuu[0] = 1;
for (int i = 1; i <= N; i++) {
Pati[i] = 2 * Pati[i - 1... | 0 | 48,213,507 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | #include<iostream>
int a = 0 , b = 0 ;
int main()
{
std::cin >> a >> b ;
if( a == b )
{
std::cout << "a == b" <<std::endl ;
}
else if( a > b )
{
std::cout << "a > b" <<std::endl ;
}
else if( a < b)
{
std::cout << "a < b" <<std::endl ;
}
} | 0 | 34,862,941 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
long long ans = 0,w = 0;
for(int i = 0 ; i < S.size() ; i++){
if(S[i] == 'W'){
ans +=i;
w++;
}
}
cout << ans-(w-1)*w/2 << endl;
} | #include <iostream>
using namespace std;
int main()
{
string n;
cin >> n;
for(int i = 0; i < 3; i++) {
if(n[i] == '1') {
cout << 9;
} else if(n[i] == '9') {
cout << 1;
} else {
cout << n[i];
}
}
cout << endl;
return 0;
} | 0 | 52,423,248 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0);
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b == 1) {
cout << "Draw" << endl;
} else if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else {
if (a == b)
... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | 0 | 17,685,804 |
#include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{ speed_up;
int m, n, i, j, k, l;
cin>>n>>m;
vector<string> a(n), b(m);
for(i = 0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF= 1LL << 60;
#define REP(i,n) for(ll i=0; i<n; i++)
#define FOR(i,a,n) for(ll i=a; i<n; i++)
struct c{
int num,sum;
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n);
ve... | 0 | 26,479,057 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N;
cin >> N;
ll num = 0;
for(ll i = 1; i <= N; i++) {
if(to_string(i).size() % 2 == 1) {
num++;
}
}
cout << num << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)(v).size())
#define clr(v, d) memset(v, d, sizeof(v))
#define Fast ios::sync_with_stdio(0);cin.tie(0... | 0 | 10,091,820 |
#include<bits/stdc++.h>
using namespace std;
const int mod = 200003;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begi... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)
#define ll long long
#define fm_t ll t;cin>>t;while(t--)
#define fr(i,a,b) for( ll i=a;i<b;i++)
#define fr1(i,n,a) for( ll i=n-1;i>=a;i--)
#define sz(x) (ll)(x).size()
#define all(v) (v).begin(), (v).end()
#define Sor... | 0 | 90,439,723 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c >= a && c <= b) puts("Yes");
else puts("... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n,monster = 0,sum = 0;
cin >> n;
vector<int> city(n+1);
vector<int> hero(n);
for (int i = 0; i < n+1; i++){
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++){
cin >> hero.at(i);... | 0 | 62,011,198 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN = 1e5+20;
int n;
int64_t v[mxN+1][3];
int64_t dp[mxN+1][4];
int64_t go(int idx, int last) {
if(idx == n) {
if(last == 1) {
return max(v[idx][1... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 81,190,878 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t,n,i,j,k;
cin>>n;
int s=((n-1)*n)/2;
cout<<s;
} | #include<iostream>
#include<string>
#define MAX 2000000
#define nINF -1
int parent(int);
int left(int);
int right(int);
void maxHeapify(int*, int);
void buildMaxHeap(int*);
void insert(int*, int);
void heapIncreaseKey(int*, int);
int extractMax(int*);
int n=0;
int main(){
int *T, key;
std::string func, ins="insert"... | 0 | 32,173,200 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).rbegin(),(a).rend())
#define ll long long
#define pb(a) push_back(a)
#define PRINTV(v) {for(ll deB=0; deB<(v).size(); de... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp ... | 0 | 77,045,809 |
#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 <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 | 40,590,456 |
#include <stdint.h>
#include <stdio.h>
#include <vector>
unsigned readUnsigned() {
int c;
do { c = ::getchar_unlocked(); } while (c < '0');
unsigned result = c - '0';
while ((c = ::getchar_unlocked()) >= '0') {
result *= 10;
result += c - '0';
}
return result;
}
void writeUnsigne... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
string s, t;
cin >> s >> t;
int N = s.size();
in... | 0 | 55,226,099 |
#include<iostream>
using namespace std;
int main(void){
int d;
int sum;
int x_now;
cin >> d;
while(!cin.eof()){
sum = 0;
x_now = 0;
for(int i=600;i!=0;){
sum += x_now*x_now*d;
i -= d;
x_now += d;
}
cout << sum << endl;
cin >> d;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e12;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pii;
const ll mod = 1e9 + 7;
void faster()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const ll M = 10 + 10;
const ll N = 200 * 1000 + 10;
ve... | 0 | 4,431,046 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
int ans... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 4,368,611 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<long long> height(N);
for (int i=0; i<N; i++) cin >> height[i];
long long ans = 100000000000;
for (int i=0; i<pow(2, N); i++)
{
long long cost=0;
vector<long long> tmp_height(N);
... | #include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 0 | 63,433,297 |
#include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int main() {
int n;
cin >> n;
vector <int> a(n);
rep (i, n) cin >> a[i];
sort(a.begin(), a.end());
int mini = 1e9, num;
rep (i, n - 1) {
if (n % 2) {
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long> A(N, 0);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<long> base(N, 0);
for (int i = 0; i < N; ++i)
base[i] = A[i] - (i + 1);
sort(base.begin(), ba... | 0 | 77,712,749 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <vector>
#define MAXN 100005
#define eps 1e-7
#define mo 974711
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
in... | #include <bits/stdc++.h>
using namespace std;
using univ= pair<int64_t, int64_t>;
int main(){
int N;
cin >> N;
vector<univ> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i).first;
}
for(int i=0; i<N; i++){
cin >> data.at(i).second;
}
auto comp= [](univ a, univ b){
return a.second- a.first ... | 0 | 15,966,085 |
#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>;
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; } re... | #include<iostream>
using namespace std;
int main()
{
int n, s = 0, h[100];
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> h[i];
}
for(int i = 0; i < n; i++)
{
int k = 0;
for(int j = 0; j <= i; j++)
{
if(h[j] > h[i])
k++;
}
... | 0 | 13,238,026 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=2001,INF=1<<30;
int main(){
int N;cin>>N;
vector<int> A(N),S(100,0);
for(int i=0;i<N;i++){
cin>>A[i];
S[A[i]]++;
}
sort(all(A));
bool flag=true;
... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll calc(string S, ll rep)
{
string temp_s = S;
for (ll i = 0; i < rep - 1; ++i) {
S = S + temp_s;
}
ll res = 0;
ll cnt = 1;
for (ll i = 1; i < S.size(); ++i) {
if (S[i] == S[i ... | 0 | 82,321,273 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string a;
while(true){
int count=0;
cin>>a;
if(a=="#")
break;
bool right=true,mae;
for(int i=0;i<a.size();i++){
mae=right;
if(a[i]=='y'||a[i]=='u'||a[i]=='i'||a[i]=='o'||a[i]=='p'||a[i]=='h'||a[i]=='j'||a[i]=='k'||a[i]=='l'||a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 52,692,067 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int flag=0,i;
string s,t;
cin>>s>>t;
if(t.size()==s.size()+1)
{
for(i=0;i<t.size()-1;i++)
{
if(s[i]!=t[i])
flag++;
}
}
else
{
flag++;
}
if(flag==0)
cout<<"Yes"<<en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
if(S.at(0)!='k'){
if(S.substr(S.size()-7,7)=="keyence") cout << "YES" << endl;
else cout << "NO" << endl;
}
else if(S.at(S.size()-1)!='e'){
if(S.substr(0,7)=="keyence... | 0 | 83,689,294 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll A, B, K;
cin >> A >> B >> K;
ll take = min(A, K);
A -= take;... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
... | 0 | 76,924,911 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #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()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 0 | 49,035,158 |
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define mp make_pair
#define pii pair<int,int>
#define pb push_back
#define ri register int
#define rep(i,a,b) for(ri i=(a);i<=(b);++i)
#define rep2(i,a,b,c) for(ri i=(a);i<=(b);i+=(c))
#define REP(i,a,b) for(ri i=(a);i>=(b);--i)
#define REP2(i,a,b,c) ... | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int,int> P;
using ll... | 0 | 62,951,517 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N;
long sum=0;
long max=0;
cin>>N;
vector <int>a(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
if(a.at(i)>max){
max=a.at(i);
}
else{
sum+=max-a.at(i);
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
set<int> st;
rep(i, K) {
... | 0 | 63,530,243 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#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++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 76,556,601 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++... | 0 | 97,723,417 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
ll ans ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int A,B,M;
cin >> A >> B >> M;
int a[A],b[B];
rep(i,A)cin >> a[i];
rep(i,B)cin >> b[i];
int minA = 100000;
int minB = 100000;
... | 0 | 9,256,727 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fb(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define f... | 0 | 64,228,022 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A.at(i);
for(int k=0;k<K;k++){
vector<int> B(N+1,0);
for(int i=0;i<N;i++){
int left = max(0,i-A.at(i));
int right = min(i+A.at(i)+1,N);
B.at(left) ++;
... | #include <iostream>
#include <limits>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ... | 0 | 45,031,201 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | 0 | 43,450,121 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int N,M;
cin >> N >> M;
cout << 6-N-M;
} | #include <iostream>
int main()
{
int a,hanako = 0,tosiki = 0;
std::cin >> a;
std::string str1,str2;
for(int b = 0; b < a;b++){
std::cin >> str1;
std::cin >> str2;
if(str1 < str2){
tosiki = tosiki + 3;
}
if(str1 > str2){
hanako = hanako + 3;... | 0 | 16,654,402 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a_max, tmp = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec.at(i);
sort(vec.begin(), vec.end());
a_max = vec.back();
vector<bool> bl(a_max + 1, true);
for (size_t i = 0; i < vec.size(); i++) {
... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define... | 0 | 95,777,421 |
#include<bits/stdc++.h>
#define INF (1e9)
#define N 1005
using namespace std;
int main(){
int n,a[N];
while(1){
cin>>n;
if(!n)break;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int ans=INF;
for(int i=0;i<n-1;i++)
ans=min(ans,a[i+1]-a[i]);
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF ... | 0 | 3,473,915 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 68,920,119 |
#include <iostream>
using namespace std;
int main(int argc, char **argv)
{
int n, tmp, count;
while(cin >> n){
count = 0;
for(int i = 0; i <= 9; i++){
if(i > n){
break;
}
for(int j = 0; j <= 9; j++){
if((i + j) > n){
break;
}
for(int k = 0; k <= 9; k++){
tmp = i + j + k;
if... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | 0 | 16,328,959 |
#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 reps(i, s, e) for(int i=s; i<e; i++)
#define inf 1e18
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ceil(a, b) (a+b-1)... | #include <bits/stdc++.h>
using ll = long long int;
struct Point {
Point(ll a, ll b) : x(a), y(b) {}
ll x = 0;
ll y = 0;
};
inline ll dist(const std::shared_ptr<Point>& a,
const std::shared_ptr<Point>& b) {
return std::abs(a->x - b->x) + std::abs(a->y - b->y);
}
inline int pos(const std::s... | 0 | 77,310,333 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespac... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 88,160,045 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
string s;
cin >> n >> s;
s.erase(unique(s.begin(), s.end()), s.end());
cout <... | #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 dp[105][4][2];
int main(){
string s; cin >> s;
i... | 0 | 85,662,285 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
int cnt=0;
int m[16]={0};
while(scanf("%d%d",&a,&b),a,b){
int ro[32][32]={{0}};
ro[0][1]=1;
int n;
scanf("%d",&n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);... | #include <bits/stdc++.h>
#define MAXN 100000
using namespace std;
int par[MAXN];
int rank[MAXN];
void init(int n) {
for (int i=0; i<n; i++) {
par[i] = i;
rank[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
par[x] = find(par[x]);
return par[x];
}
}
void unite(int x,int ... | 0 | 93,127,087 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> M;
bool compare_by_b(pair<int, double> a, pair<int, double> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, std::vector<long long> A)
{
sort(A.begin(), A.end());
if (A[0] == 0)
{
cout << 0 << endl;
return;
}
ll ans = 1;
double res = 1;
for (ll i = 0; i < N; i++)
{
if (ans * A[i] ... | 0 | 79,481,577 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 37,741,805 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(ll i=0;i< (n);i++)
#define rep1(i,n) for(ll i=1;i<= (n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const static ll MOD = 998244353;
ll modcross(ll a,ll n){
if(n == 0)return 0;
if(n % 2 == 1)return (a+modcross(a,n-1))... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
#include <stack>
using namespace std;
#define COUT(x) c... | 0 | 90,503,440 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string N;
cin >> N;
bool seven=false;
for (int i=0;i<3;i++) {
if(N[i]=='7') {
seven = true;
break;
}
}
if(seven==true) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
... | #include <stdio.h>
using namespace std;
int main(){
int N;
scanf("%d",&N);
int a,b,c;
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 || b*b+c*c==a*a) {
printf("YES\n");
continue;
}
printf("NO\n");
}
... | 0 | 2,834,576 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
int main(){
LL ans = 0, u, v;
scanf("%d", &n);
for(LL i = 1; i <= n; i++){
ans += i * (n - i + 1);
}
for(int i = 1; i < n; i++){
scanf("%lld%lld", &u, &v);
if(v < u) swap(u, v);
ans -= u * (n - ... | #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--)
#define pb push_back
#define a first
#define b second
#define all(x) x.beg... | 0 | 19,403,467 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
int n;
cin >> n;
bool ans = true;
int t,x,y;
int time = 0;
int dx = 0;
int dy = 0;
rep(i,n){
cin >> t >> x >> y;
time = abs(time-t);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using P = pair<int, int>;
int main(){
int n,k;
cin >> n >> k;
ll ans;
if(... | 0 | 99,633,373 |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int ans=1, a=0;
cin >> s;
for(int i=0; i<3; i++){
if(s[i]=='R'){
a=1;
if(s[i]==s[i+1]) ans++;
}
}
if(ans==1 && a==0){
cout << 0;
}else{
cout << ans;
}
return 0;
} | 0 | 32,436,640 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <tuple>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <numeric>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> ... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 0 | 32,487,974 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
string tmp, p, q, o;
rep(i, n) {
cin >> tmp;
p += tmp;
}
rep(i, n) {
cin >> tmp;
q += tmp;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define nxvarep(n,x,a) ll n,x;cin>>n>>x;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define gcd... | 0 | 16,844,753 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
long long n, k;
cin >> n >> k;
double ans = 0.0;
for (long long num = 1; num <= n; num++) {
long long number = num;
long lo... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 33,035,531 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void){
string s;
cin >> s;
string div[4] = {"dream","dreamer","erase","eraser"};
reverse(s.begin(),s.end());
rep(i,4) reverse(div[i].begin(),div[i].end());
bool can = true;
for(int i=0;i<s.... | 0 | 91,011,828 |
#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... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll N;
cin>>N;
vector<ll> pos(N,0);
for(ll i=0;i<N;i++){
ll curr;
cin>>curr;
curr--;
pos[curr]=i;
}
multiset<ll> ms;
ms.insert(-1);
ms.insert(-1);
ms.insert(N);
ms.insert(... | 0 | 47,855,873 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
int ans = 1e9;
for (int i = 1; i <= N; i++) {
int sum = 1;
for (int j = 1; j <= i; j++) {
sum *= 2;
}
sum += K*(N-i);
ans = min(ans, sum);
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std ;
double a = 0 ;
double b = 0 ;
double c = 0 ;
double D = 0 ;
double R = 0 ;
double S = 0 ;
double L = 0 ;
double h = 0 ;
int main()
{
cin >> a >> b >> D ;
R = D * M_PI / 180.0 ;
c = sqrt( pow( a ,2 ) + pow( b ,2 ) - ( ( 2 * a * b ) * cos( R ) ) ) ;
L... | 0 | 12,944,611 |
#include <bits/stdc++.h>
using namespace std;
const int kN = 100'000 + 5;
const int kMod = 1'000'000'000 + 7;
int x[kN], y[kN];
int f(int *a, int n) {
int sum = 0, res = 0;
for (int i = 0; i < n; ++i) {
a[i] = (a[i] % kMod + kMod) % kMod;
int add = (1LL * a[i] * i + kMod - sum) % kMod;
(... | #include <iostream>
int countPattern(int n) {
int count = 0;
int ni, ij, ijk;
for (int i = 0; i < 10; i ++) {
ni = n - i;
for (int j = 0; j < 10; j ++) {
ij = ni - j;
for (int k = 0; k < 10; k ++) {
ijk = ij - k;
if (0 <= ijk && ijk <= 9) {
count ++;
}
}... | 0 | 55,444,658 |
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
retu... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#defi... | 0 | 100,407,520 |
#include <iostream>
#include <iomanip>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a <= c && c <= b ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmin(T &a, T b) {
if (a > b) a = b; return true;
return false;
}
void solve(long long N, long long M, std::vector<long long> a, std::vector<long long> b, std... | 0 | 24,561,838 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
int main(int, char**)
{
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(_,k) {
vector<int> d(n, 0);
int... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<iterator>
#include<math.h>
#include<cstring>
using namespace std;
void lets_play()
{
int a,b,i;
cin>>a>>b;
if(a>=b)
{
for(i=1;i<=a;i++)
cout<<b;
cout<<endl;
}
else
{
for(i=1... | 0 | 70,163,299 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long do... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <cmath>
#include <iterator>
#include <map>
#include <fstream>
#include <iomanip>
using namespace std;
const int MAX_N = 1000000;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::c... | 0 | 37,297,851 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using name... | 0 | 10,871,059 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | #include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | 0 | 48,331,377 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <bitset>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using names... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | 0 | 81,945,047 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _LOCAL_DEBUG
#include "templates/debug.h"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int& it : a)
cin >> it;
int j = 0;
l... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string S,T;
int x[10000],y[10000];
int dp[10000][10000];
char U[53]="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int MAXN;
int main(){
int q;
cin>>q;
for(int i=0;i<q;i++){
MAXN=0;
cin>>S>>T;
for(int i=0;i<S.size();i++){
... | 0 | 18,669,711 |
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define INFTY 2000000001
#define MAX 101
int n = 0;
int adl[MAX][MAX], deg[MAX];
int adm[MAX][MAX];
int main() {
scanf("%d", &n);
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < n; j++ ) {
adm[i][j] = 0;
}
}
for ( i... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S == "keyence" || S.substr(0,7) == "keyence" || S.substr(S.size()-7,7) == "keyence") {
cout << "YES" << endl;
return 0;
}
vector<vector<string>> v = {
{"k", "eyence"},
... | 0 | 45,810,460 |
#include<cstdio>
using namespace std;
int s;
long long dp[2005];
int main() {
scanf("%d",&s);dp[0]=1;
for(int i=3;i<=s;++i) {
for(int j=0;j<=i-3;++j) {
dp[i]=(dp[i]+dp[j])%1000000007;
}
}
printf("%lld",dp[s]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 36,932,579 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,r,s,p;
string t;
cin>>n>>k>>r>>s>>p>>t;
long long kotae=0;
for(int i=0;i<n;i++){
if(i+k<n){
if(t[i]==t[i+k]){
t[i+k]='a';
}
}
if(t[i]=='r')kotae+=p;
else if(t[i]=='s')kotae+=r;
else if(t[i]=='p')kotae+=s... | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endi... | 0 | 79,392,521 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
long long int l;
cin >> n >> l;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int memo = -1;
for(int i=0; i+1<n; i++){
if(a[i] + a[i+1] >= l) memo = i+1;
}
if(memo == -1){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> ans;
vector<vector<int>> g(200005,vector<int> (0));
void dfs(int v,int p){
for(auto i:g[v]){
if(i==p) continue;
ans[i] += ans[v];
dfs(i,v);
}
}
int main(){
int n,q;
cin ... | 0 | 53,900,097 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.