code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m, sum;
scanf("%d %d %d", &n, &m, &sum);
for (int i = 0; i < m;i++){
printf("%d ", sum);
}
if(sum==2||sum==1){
for (int i = 0; i < n - m;i++){
printf("%d ", 3);
}
}
else{
for (int i =... | # 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; ... | 1 | 62,213,470 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, m, a[107];
int main() {
cin >> n >> m;
ll sum = 0;
for(ll i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n, greater<ll>());
ll cnt = 0;
for(ll i = 0; i < m; ++i) {
if(a[i] * 4 ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int k;
cin>>n>>k;
int a[n];
int sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
double c= ((double)1/(4*k))*sum;
int count=0;
for(int i=0;i<n;i++)
{
if(a[i]>=c)
count++;
}
if(count>=k)
{
cout<<"Yes"<<endl;
}
else
{
c... | 1 | 82,458,433 |
#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 <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <bitset>... | 1 | 48,945,756 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
#define ll long long int
#define pi 3.141592653589793238
const int N = 1e5 + 10;
int main(){
FAST;
ll t=1;
while(t--)
{
ll n,ans=0;
cin>>n;
vecto... | 1 | 6,303,633 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
string con[15] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main() {
string s;
int n;
cin >> n;
for(int q = 0; q < n; ++q){
cin >> s;
string ans("");
P cnt;
cnt.first = cnt.second = 0;
for(int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
vector<string> ans;
while(n--)
{
string on=".,!? ";
string s; cin>>s;
int cnt=0 ,num=0;
string tmp;
for(int i=0; i<s.size(); ++i)
{
if(num==s[i]-'0') cnt++;
else
{
if(num==1) tmp+=on[cnt... | 1 | 43,271,533 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
int dp[N][2];
string s;
int solve(int idx, int prv){
if(idx == s.size())
return 0;
int &ans = dp[idx][prv];
if(~ans)
return ans;
if(s[idx] - '0' == prv)
return ans = solve(idx + 1, !prv) + 1;
els... | 1 | 71,420,379 |
#include<bits/stdc++.h>
#define fr(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define rf(i,j,p) for(int i=p;i>=j;i--)
#define vi vector<int>
#define vll vector<long long>
#define ll long long
#define hmm "\n"
#define sp " "
#define srt(v) sort(v.begin()... | #define _GLIBCXX_DEBUG
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<int,int> A;
for(int i=0; i<N; i++){
cin >> A[i+1];
}
int B[N];
for(auto& i:A){
B[i.second-1] = i.first;
}
for(int i=0; i<N; i++){... | 1 | 70,251,141 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> s >> k;
char c = s[k-1];
for(int i = 0; i < n; i++){
if(s[i] != c) cout << "*";
else cout << c;
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n;
string s;
cin>>s;
cin>>k;
for(int i=0; i<n; i++)
{
if(s[i]==s[k-1])
cout<<s[i];
else
cout<<"*";
}
cout<<"\n";
return 0;
} | 1 | 36,956,683 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
int N = S.size();
if (N == 1) {
cout << 0 << endl;
return 0;
}
int L = 0, R = N-1;
int cnt = 0;
while (L < R) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
int main(int, char**) {
string s; cin >> s;
deque<char> S;
for (int i=0; i<s.size(); i++) S.push_back(s[i]);
int ret = 0;
while (!(S.empty() || S.size()==1)) {
char f = S.front();
char b = S.b... | 1 | 302,872 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,key="keyence";
cin >> s;
int st=0,skp=s.size()-7;
bool isky=false;
for(int i=0;i<s.size();i++){
string n="";
for(int k=0;k<s.size();k++){
if(k<st||k>=st+skp)
n+=s.at(k);
}
if(n=="keyence")
isky=true;
st++... | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int len = N.size();
int E = len - 7;
for (int i = 0; i < len; i++) {
string Ni = N;
Ni.erase(i, E);
if (Ni == "keyence") {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | 1 | 11,988,845 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using vin=vector<int>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
int main() {
string... | #include <bits/stdc++.h>
using namespace std;
int check(string s, string t, int idx){
for (int i=0; i<t.size(); i++){
if (s[idx+i]!='?' && s[idx+i]!=t[i])return 0;
}
return 1;
}
int main()
{
string s, t;
cin>>s>>t;
int n = s.size(), m = t.size();
int flag = 0, idx=-1;
if (m>n){
... | 1 | 92,857,351 |
#include <iostream>
using namespace std;
int main() {
while(1) {
int i, j;
cin >> i >> j;
if(i == 0 && j == 0) break;
if(i < j) cout << i << ' ' << j << endl;
else cout << j << ' ' << i << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> X;
vector<int> Y;
for(;;){
int x, y;
cin >> x >> y;
if(x == 0 && y == 0) break;
X.push_back(x);
Y.push_back(y);
}
for(int i = 0; i < X.size(); i++){
int x = X.at(i), y = Y.at(i);
... | 1 | 76,358,131 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define ll long long
int main(){
int a,b; cin>>a>>b;
if(a<b){
while(b--) cout<<a;
}else{
while(a--) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a <= b){
for(int i = 0; i < b; i++){
cout << a;
}
}
else if(a > b){
for(int i = 0; i < a; i++){
cout << b;
}
}
} | 1 | 98,588,685 |
#include<bits/stdc++.h>
#define sd(x) scanf("%d",&x)
#define ss(x) scanf("%s",x)
#define sc(x) scanf("%c",&x)
#define sf(x) scanf("%f",&x)
#define slf(x) scanf("%lf",&x)
#define slld(x) scanf("%lld",&x)
#define me(x,b) memset(x,b,sizeof(x))
#define pd(d) printf("%d\n",d);
#define plld(d) printf("%lld\n",d);
#define eps... | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 11
#define INF (1<<23)
int G[MAX][MAX];
int main() {
int n, x, y, c;
int V;
while(cin >> n, n) {
fill(G[0], G[MAX], INF);
for(int i=0; i<MAX; i++) {
G[i][i] = 0;
}
V = 0;
for(int i=0; i<n; i++) {
cin >> x >> ... | 1 | 18,244,145 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b;
cin>>a>>b;
if(a+b==15) cout<<"+"<<'\n';
else if(a*b==15) cout<<"*"<<'\n';
else cout<<"x"<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b;
cin >> a >> b;
if(a + b == 15) cout << '+' << endl;
else if(a * b == 15) cout << '*' << endl;
else cout<< 'x' <<... | 1 | 13,482,183 |
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i <= x ; i --)
using namespace std ;
typedef long long ll ;
typedef pair<int , int> pii ;
const int inf = 0x3f3f3f3f ;
const int maxn = 2e5 + 5... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#i... | 1 | 10,757,406 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
vector<bool> s(200100);
vector<bool> t(200100);
bool ok=false;
int n,m;
cin >> n >> m;
rep(i,m){
int a,b;
cin >> a >> b;
if(a==1) s[b] = t... | 1 | 57,999,626 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int last = 10000;
int cnt = 0;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1]) {
a[i] = last--;
++cnt;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 1 | 18,755,078 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).b... | #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... | 1 | 78,823,012 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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&... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> N(4);
rep(i, 4){
cin >> N.at(i);
}
vector<int> a = {1, 9, 7, 4};
rep(i, 4){
if(count(N.begin(), N.end(), a.at(i)) ... | 1 | 76,612,320 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
double a=0,b=0;
cin >> a >> b;
double avg=0;
avg=(a+b)/2;
avg=avg+0.5;
cout << (int)avg << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b; cin >> a >> b;
cout << (a+b+1)/2 << "\n";
return 0;
} | 1 | 58,053,181 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N];
int main ()
{
int n;
cin >> n;
set<int>st;
for (int i = 0; i < n ; i ++) {
cin >> a[i];
st.insert(a[i]);
}
cout << st.size()-(st.size()%2?0:1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#de... | 1 | 51,357,327 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(),v.end()
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
#define pb push_back
struct edge{in... | #include <iostream>
#include<string>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef long long ll;
#define mod 1000000
#define INF 10000000
int main() {
int n, m;
cin >> n >> m;
vi C(m);
for (int i = 0; i <... | 1 | 50,619,205 |
#include<stdio.h>
int main(){
int kazu[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int number;
scanf("%d",&number);
printf("%d",kazu[number-1]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long k,a[]= {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin>>k;
cout<<a[k-1]<<endl;
return 0;
} | 1 | 73,446,822 |
#include <iostream>
#define rep(i,n) for(int i=0; i<n;i++)
using namespace std;
int main()
{
int a,b,c,k,i=0;
cin >> a >> b >> c >> k;
while(i<k){
if(a>=b)
b=b*2;
else if(c<=b)
c=c*2;
if(a<b && b<c) break;
i++;
}
if(i==k) cout << "No\n";
else cout << "Yes\n";
return 0;
} | #include <bits/stdc++.h>
#define fst first
#define snd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); cout.ti... | 1 | 71,047,579 |
#include<iostream>
using namespace std;
int main(){
int n;
int B,F,R,V;
int v[4][3][10] = {};
cin >> n;
for(int i=1;i<=n; i++){
cin >> B >> F >> R >>V;
v[B-1][F-1][R-1] += V;
}
for(int i = 0;i<=3;i++){
for(int j = 0;j<=2;j++){
for(int k = 0;k<=9;k++){
... | #include<iostream>
using namespace std;
int main(){
int b,f,r,v,n,i,k,l,m,max[5][4][11]{0};
cin>>n;
for(i=0;i<n;i++){
cin>>b>>f>>r>>v;
if(r>0){
max[b][f][r]=max[b][f][r]+v;
}
}
for(k=1;k<=4;k++){
if(k!=1){
cout<<"####################"<<endl;
... | 1 | 37,807,303 |
#include <bits/stdc++.h>
#define re register
using namespace std;
inline int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
return X*w;
}
const int N=100+10;
int n,a[N],o[N];
int main() {
n=read();
... | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 1 | 29,236,321 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
vector<pair<char, long long>> runLengthEncoding(string s); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 1 | 76,887,408 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
if(c >= 97 && c <= 122){
cout << 'a' << endl;
}else{
cout << 'A' << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char u;
cin >> u;
if('A' <= u && u <= 'Z') cout << 'A' <<endl;
else cout << 'a' <<endl;
return 0;
} | 1 | 76,987,728 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000
int main(){
int N;
cin>>N;
vector<long long> A(N);
long long X = 0;
for(int i=0;i<N;i++){
cin>>A[i];
}
vector<int> cnt(60,0);
for(int i=0;i<N;i++){
for(int j=... | 1 | 73,884,182 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long n,m,s,r;
cin>>n>>m;
s=(n*(n-1))/2;
r=(m*(m-1))/2;
cout<<(s+r)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 1 | 94,651,139 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
if(s[0] == s[1] && s[1]==s[2] && s[2]==s[3]){
cout<<"No"<<endl;
return 0;
}
if((s[0]==s[1] && s[2]==s[3]) || (s[0]==s[2] && s[1]==s[3]) || (s[0]==s[3] && s[1]==s[2]))cout << "Yes"<<endl;
else cout<<"No"<... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
set<int> set{s.at(0),s.at(1),s.at(2),s.at(3)};
if(set.size()==2){
int count = 0;
for(int i=1;i<4;i++){
if(s.at(0)==s.at(i))count++;
}
if(count==1){
cout << "Yes" << endl;... | 1 | 59,215,188 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main(){
ll N, M;
cin >> N >> M;
vector<bool> is_safe;
is_safe.assign(N+1, true);
for(int i=0; i<M; i++){
int a; cin >> a;
is_safe[a] = false;
}
vector<int> dp(N+1, 0);
dp[0] = 1;
if(is_safe[1]) d... | #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-... | 1 | 77,653,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < s.length(); i++) {
if(s[i] == s[i+1]) {
s.erase(i,1);
i--;
}
}
cout << s.length() << endl;
} | #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;
string s;
cin >> n >> s;
for (int i = 1; i < s.size(); ++i)
if (s[i] == s[i-1]) --n;
cout << n << endl;
return 0;
} | 1 | 60,458,776 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | 1 | 62,905,202 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e15;
int main(){
string yes = "YES", no = "N... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
int... | 1 | 176,132 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef p... | #include<iostream>
using namespace std;
int main(){
int a,b;
for(int j = 1; j<10; j++){
a = j;
for(int i = 1; i<10; i++){
b = i;
cout << a << "x" << b << "=" << a*b << endl;
}
}
} | 1 | 42,965,233 |
#define _GLIBCXX_DEBUG
#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,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 1 | 10,632,679 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <stdlib.h>
using namespace std;
int main (void)
{
int a[3],b[3],A,B;
A = 0;
B = 0;
for (int i = 0; i < 4; i++)
{
cin >> a[i];
... | #include<stdio.h>
int main(void)
{
int zyo,suu,ri,ei;
int zyo2,suu2,ri2,ei2;
int s,t;
s=0;
t=0;
scanf("%d %d %d %d",&zyo,&suu,&ri,&ei);
scanf("%d %d %d %d",&zyo2,&suu2,&ri2,&ei2);
s=zyo+suu+ri+ei;
t=zyo2+suu2+ri2+ei2;
if(s<=t){
printf("%d\n",t);
}
else{
printf("%d\n",s);
}
return 0;
} | 1 | 75,990,881 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
#define ex(k) (a*(b-n)+(a-b)*(k)-(k)*(k))
using namespace std;
int dsu[MAX];
int sz[MAX];
int search(int a) {
if(dsu[a]==a) return a;
return dsu[a]=search(dsu[a]);
}
void join(int a, int b) {
a = search(a);
b =... | 1 | 52,638,501 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string q;
int l;
vector<int> b(3);
cin>>q;
for(l=0;l<3;l++) b.at(q.at(l)-'a')=1;
if(b.at(0)==1&&b.at(1)==1&&b.at(2)==1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
int total = 0;
for (char c: s)
total += c - 'a';
std::cout << (total == 3 ? "Yes" : "No") << std::endl;
return 0;
} | 1 | 82,281,887 |
#include <iostream>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <complex>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
... | #include<iostream>
using namespace std;
int main(){
long double ax[100],ay[100],bx[100],by[100],cx[100],cy[100],dx[100],dy[100];
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>ax[i]>>ay[i]>>bx[i]>>by[i]>>cx[i]>>cy[i]>>dx[i]>>dy[i];
}
for(int i=0;i<n;i++){
long double A=0,B=0;
A=(by[i]-ay[i])/(bx[i]-ax[i]);
B=(... | 1 | 92,038,597 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int K,l;
string S;
cin >> K >> S;
l = S.size();
if(l<=K)cout << S << endl;
else {
S = S.erase(K) + "...";
cout << S << endl;
}
} | #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 k;
cin >> k;
string s;
cin >> s;
if(s.size() <= k) cout << s << endl;
else{
rep(i,k)cout << s.at(i);
cout << "..." << endl;
}
} | 1 | 82,470,710 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
int a, b;
cin >> a >> b;
rep(i, 1100){
if((floor(i * 0.08) == a) && (floor(i * 0.1) == b)){
cout << i << ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a, b;
cin>>a>>b;
rep(c, 10000) if(c*8/100==a && c*10/100==b){
cout<<c<<endl;
... | 1 | 37,525,165 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
string s,t;
cin >> s >> t;
reverse(t.begin(), t.end());
if(s == t) cout << "YES" << endl;
else cout << "NO" << endl... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = ve... | 1 | 54,135,956 |
#include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 1 | 26,869,397 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) nu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | 1 | 30,701,173 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, K;
cin >> N >> K;
vector<int> d(N);
... | 1 | 38,739,216 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 85;
int n, a[maxn];
LL m;
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
m = 1000;
for(int i = 1; i < n; ++i)
{
if(a[i] < a[i + 1]) m += (LL)(a[i + 1] - a[i]) * (m / a[i]);
}
printf("%lld", m);
r... | #include <iostream>
#include <vector>
using namespace std;
int main(){
unsigned long long N,cur;
cin >> N;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A.at(i);
cur=1000;
for(int i=1;i<N;i++){
if(A.at(i)>A.at(i-1)){
cur=cur+(cur/A.at(i-1))*(A.at(i)-A.at(i-1));
}
}
cout << cur << endl;
} | 1 | 10,227,876 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int num = 0;
cin>>N;
string S = to_string(N);
for(int i = 0;i < S.size();i++){
if(S[i] == '7'){
cout<<"Yes"<<'\n';
num = 1;
break;
}
}
if(num == 0){
cout<<"No"<<'\n'... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
bool p = (s[0] == '7');
bool q = (s[1] == '7');
bool r = (s[2] == '7');
if (p || q || r)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 57,891,457 |
#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | 1 | 41,629,151 |
#include <iostream>
#include <algorithm>
using namespace std;
int h, w, d;
char color[1024][1024];
int main() {
cin >> h >> w >> d;
if (d == 1) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ((i + j) % 2 == 0) {
cout << 'B';
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(decltype(n) i=0; i<(n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define st first
#define nd second
#define pb push_back
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef long long ll;
void solve(){
int h,... | 1 | 13,664,962 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
sort(s.begin(), s.end());
char prev = s.at(0);
for (int i = 1; i < (int)s.size(); i++) {
if (s.at(i) == prev) {
cout << "no" << endl;
return 0;
}
prev=s.at(i);
}
... | #include<iostream>
#include<vector>
using namespace std;
int main()
{
char c;
vector<int> found(26);
while (cin >> c)
{
if (found.at((int)c - 97) > 0)
{
cout << "no";
return 0;
}
found.at((int)c - 97) ++;
}
cout << "yes";
return 0;
} | 1 | 4,443,443 |
#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 REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
static const int N = 100;
static const long long INFTY = (1LL << 32);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
long long m[N][N], n;
void Floyd()
{
for (int k = 0; k < n; ++k){
for (int i = 0; i ... | 1 | 86,041,263 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(ll int i=a;i<=b;++i)
#define rep(i,n) for(ll int i=0;i<n;i++)
#define rep3(i,a,b) for(int i=a;i>=b;i--)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
ll int MOD=1e9+7;
int INF=1e6;
ll int MAX_N=1e18;
using namespace std;
string alphabet("a... | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
const int MX = (int)2e+5;
const int MOD = (int)1e+9 + 7;
int powmod(int n, int k) {
int res = 1;
while(k > 0) {
if(k & 1) res = (res * n) % MOD;
n = (n... | 1 | 28,468,757 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
#define MP make_pair
#define PB push_back
#define fi first
#de... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll a, b, c, k, ans = 0;
cin >> a >> b >> c >> k;
ll ad = k - a, bd = k - a - b;
if (ad <= 0) ans = k;
else if (bd <= 0) ans = a;
else ans = a - bd;
cout << an... | 1 | 23,477,237 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,l,r) for(int i = l; i < r; ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll int> dp(n+1, 0);
vector<int> h(n+1, 0);
rep(i, 1, n+1) cin >> h[i];
dp[2] = abs(h[1]-h[2]);
for(int i = 3; i <= n; ++i) {... | #include<iostream>
#include<cstring>
using namespace std;
int dp[100001];
int solve(int* arr, int i, int n) {
if(i==n) return 0;
if(dp[i] != -1) return dp[i];
int op1 =10e8;
int op2 =10e8;
if(i+1 <= n) op1 = abs(arr[i] - arr[i+1]) + solve(arr, i+1, n);
if(i+2 <= n) op2 = abs(arr[i] - arr[i+2]) + solve(... | 1 | 677,712 |
#include<bits/stdc++.h>
using namespace std;
int solve(vector<int>&a){
map<int,int>kazu;
for(int i=0;i<a.size();i++){
kazu[a.at(i)]++;
kazu[a.at(i)-1]++;
kazu[a.at(i)+1]++;
}
int ans=0;
for(auto i:kazu){
ans=max(ans,i.second);
}
return ans;
}
int main(){
int n;
cin >> n;
vector<int>a... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 1 | 72,566,002 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> l(m),r(m);
int lmax=1, rmin=100000;
for(int i=0; i<m; i++){
cin >> l.at(i) >> r.at(i);
lmax=max(l.at(i),lmax);
rmin=min(r.at(i),rmin);
}
if(rmin-lmax+1>0) cout << rmin-lmax+1... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int n, m, ans = 0;
cin >> n >> m;
vector<int> l(m), r(m);
for(int i = 0; i < m; ++i){
cin >> l.at(i) >> r.... | 1 | 56,663,703 |
#include <iostream>
using namespace std;
int main(){
char alpabet;
cin >> alpabet;
if(alpabet == 'a' || alpabet == 'i' ||
alpabet == 'u' || alpabet == 'e' || alpabet == 'o'){
cout << "vowel" << endl;
}
else{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0; i < (int)(n); i++ )
int main( void )
{
char c;
cin >> c;
string x = "aiueo";
bool y = false;
rep(i,x.size())
{
if ( c == x.at(i) )
{
y = true;
}
}
if ( y )
cout << "... | 1 | 22,877,292 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
int main()
{
int X, N;
std::cin >> X >> N;
std::vector<int> data(N);
for(int i=0; i < N; i++) {
std::cin >> data[i];
}
std::sort(data.begin(), data.end() );
int start = 0;
int end = N-1;
int point... | 1 | 36,722,080 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | 1 | 644,968 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | #include <stdio.h>
int main() {
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d", &H1, &M1, &H2, &M2, &K);
int H = H2 - H1;
int M = M2 - M1;
M += H * 60;
printf("%d\n", M - K);
return 0;
} | 1 | 6,709,865 |
#include <iostream>
using namespace std;
int main() {
int a,b,c,cnt=0;
cin>>a>>b>>c;
for(;a<=b;a++) {
if(!(c%a)) {
cnt++;
}
}
cout<<cnt<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
void spritStr(string str, vector<string>& v)
{
while (str.find(' ') != -1)
{
v.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
}
v.push_back(str);
}
i... | 1 | 31,049,310 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define ll long long
#define read1(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | 1 | 85,180,759 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using pll = pair<long long, long long >;
int main(){
int n;
cin >> n;
long long m;
cin >> m;
vector<pll> vec(n);
for(int i=0; i<n; i++){
cin >> vec[i].first >> vec[i].second;
}
sort(vec.begin(), vec.end... | #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... | 1 | 11,430,187 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,x;
cin >> n >>a;
x = n % 500;
if (x == 0){
cout << "Yes";
}
else {
if (x <= a){
cout << "Yes";
}
else {
cout << "No";
}
}
} | #include <iostream>
using namespace std;
int main()
{
int N , A , C;
cin >> N >> A;
C = (N % 500) - A;
if(C <= 0) {cout << "Yes";}
else {cout << "No";}
} | 1 | 32,383,157 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<set>
#include<string>
#include<bitset>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a[150];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
int pick = 0;
for (int i = 0; i < N; i++) {
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a[n];
rep(i,n)cin >> a[i];
sort(a,a+n,greater<int>());
int sum=0;
rep(i,n)sum+=a[i];
string ans="No";
int cnt=0;
rep(i,m){
if(4*m*a[i]>=sum)cnt++;
else break;
}
if(m... | 1 | 51,691,569 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,n) for(int i = 0; i , (n); ++i)
using ll = long long;
using namespace std;
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
int N, K, sum=0;
cin >> N >> K;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
int ans = accumulate(arr.begin(), arr.begin() + k, 0);
cout << ans ... | 1 | 95,898,875 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
vector<vector<int>> m;
bool possible(int s,int pre,int count){
bool ans = false;
if(count == 2){
if... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, M;
cin >> N >> M;
int a, b;
vector<vector<int>> island(N);
for ( int i=0; i<M; i++ ) {
cin >> a >> b;
a--; b--;
island.at(a).push_back(b);
island.at(b).push_back(a);
}
bool possible = false... | 1 | 67,574,221 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> A;
int N;
int sw = 0;
cin >> N;
for (int i = 0; i < N; i++)
{
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; i++)
{
int mini = i;
for (int j = i; j < N; j++)
{
if (A[j] < A[mini... | #include <ios>
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n, i, j, k, m, c = 0, a[100] = {};
cin >> n;
for(i = 0; i < n; ++i)
cin >> a[i];
for(i = 0; i < n; ++i){
m = i;
for(j = i; j < n; ++j){
if( a[j] < a[m] )
m = j;
}
if( m != i ){
k = a[i];
a[i... | 1 | 51,761,351 |
#include<stdio.h>
int main()
{
char c;
int n;
int out;
int end;
int i;
scanf("%d",&n);
for(i=0;i<n+1;i++)
{
end=0;
while(1)
{
out=0;
while(1)
{
scanf("%c",&c);
if(out==0)
{
switch(c)
{
case '1':
out=1;
break;
case '2':
... | #include <cstdio>
const char *TABLE[] = {
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main(){
int N;
scanf("%d", &N);
while(N--){
char input[1025];
scanf("%s", input);
int key = -1, idx = -1;
for(char *p = input; *p != '\0'; p++){
int k = *p - '0' - 1;
if(k < 0){
... | 1 | 39,475,310 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int main(){
int x, a;
cin >> x >> a;
if(x < a)
cout << "0";
else
cout << "10";
} | #include <bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
int x,a;
cin>>x>>a;
if(x<=9&&x>=0&&a<=9&&a>=0){
if(x<a){
std::cout << "0" << std::endl;
}else{
std::cout << "10" << std::endl;
}
}
} | 1 | 28,311,680 |
#include <iostream>
#include <algorithm>
#include <cmath>
#define int long long
using namespace std;
signed main() {
double a, b, c, d, h, t;
cin >> a >> b >> t;
t = t / 180 * 3.14159265358979;
h = b * sin(t);
d = a - sqrt(b * b - h * h);
if (t > 3.14159265358979 / 2)d = a + sqrt(b * b - h * h);
c = sqrt(d * d +... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
double a, b, c;
std::cin >> a >> b >> c;
c *= M_PI/180;
std::cout << std::fixed << std::setprecision(6) << a*b*std::sin(c)/2 << "\n";
std::cout << std::... | 1 | 18,986,966 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
void swap(int a,int b) {
int tmp = a;
a = b;
b = tmp;
}
ll runrun(ll a) {
queue<ll> Q;
for (ll i = 1; i < 10;i++) {
Q.push(i);
}
ll count = 1;
while (1) {
ll x = Q.front();
Q.pop();
if (a==count) {
return x;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
vector<pair<char, long long>> runLengthEncoding(string s); ... | 1 | 81,763,548 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s, t;
cin >> s >> t;
int length = s.length();
int l = t.length();
int ans=0;
int mini = 10000;
for (int i = 0; i <= length-l; ++i){
for (int j = 0; j < l; ++j){
if(s[j+i] != t[j]){
++ans;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s,t; cin>>s>>t;
int ans = t.size();
for(int i=0; i<s.size(); ++i){
int cnt=0;
if(i+t.size() > s.size()) continue;
for(int j=0; j<t.size(); ++j){
if(s[i+j]!=t[j]) c... | 1 | 12,098,727 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#include <cmath>
#include <time.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define SQ... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double v = 100000;
double r;
int n;
cin >> n;
for(int i = 0; i < n; i++) {
v += v * 0.05;
r = fmod(v, 1000.0);
if(r != 0) {
v += (1000 - r);
}
}
n = v;
cout << n << end... | 1 | 94,502,839 |
#include <iostream>
using namespace std;
int main () {
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n || a || b || c || x) {
int y[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int frame = 0;
for (int i = (y[0] == x); i < n; i++) {
do {
x = (a * x + b) % c;
frame++;
if (frame... | #include<iostream>
#include<map>
#include<algorithm>
#include <iomanip>
#include <cmath>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#incl... | 1 | 61,146,212 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n=0;
int sum=0;
cin >> n;
for(int i=0; i<n; i++)
{
sum = sum+i+1;
}
cout << sum;
} | 1 | 44,896,821 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, ans;
string s;
cin >> n;
cin >> s;
ans = n;
for ( int i = 1; i < n; i++ ) {
if ( s[i] == s[i-1] ) {
ans --;
}
}
cout << ans << endl;
return (0);
} | #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;
vector<char> t(n);
for(int i = 0; i < n; ++i)
{
t... | 1 | 44,957,109 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | 1 | 54,584,350 |
#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() {
ll a, b, c;
cin >> a >> b >> c;
map<ll, ll> mp;
ll i = 1;
while (mp[(a * i) % b] == 0) {
mp[(a * i) % b]++;
if ((a * i) % b == c) {
cout << "YE... | #include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | 1 | 55,899,810 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
string S; cin>>S;
vector<int> word(S.size());
set<int> ch;
rep(i,S.size())
{
word.at(i)=S.at(i)-'a';
... | 1 | 21,264,748 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 1 | 71,791,423 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
int a,b;
cin >> a >> b;
if(a > 8 | b > 8)... | #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 A, B;
cin >> A >> B;
if (A <= 8 && B <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 1 | 98,962,569 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[2];
int sum=0;
for(int i=0;i<N;i++){
cin >> a[0] >> a[1];
sum += (a[1]-a[0]+1);
}
cout << sum << endl;
} | 1 | 76,900,020 |
#include <bits/stdc++.h>
#define rep0(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define mREP(i,a,b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespa... | #include"bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << endl;
return 0;
} | 1 | 78,447,531 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;... | #include<iostream>
#include<cstring>
using namespace std;
int dp[100001];
int solve(int* arr, int i, int n) {
if(i==n) return 0;
if(dp[i] != -1) return dp[i];
int op1 =10e8;
int op2 =10e8;
if(i+1 <= n) op1 = abs(arr[i] - arr[i+1]) + solve(arr, i+1, n);
if(i+2 <= n) op2 = abs(arr[i] - arr[i+2]) + solve(... | 1 | 77,855,007 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
int lA[N+10];
for (int i=0; i<N; i++) cin >> lA[i];
sort(lA, lA + N, greater<int>());
int sum = 0;
for (int i=0; i<K; i++) sum+=lA[i];
cout << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long n,k,he;
int a[10000];
int main()
{
cin>>n>>k;
for(int i=1; i<=n; i++)
{
cin>>a[i];
he+=a[i];
}
sort(a+1,a+1+n);
for(int i=1; i<=n-k; i++)
{
he-=a[i];
}
cout<<he<<endl;
return 0;
} | 1 | 89,475,761 |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n,r;
cin>>n>>r;
if(n>=10)
cout<<r<<"\n";
else
cout<<r+(100*(10-n))<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... | 1 | 58,693,477 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
const int MAX = 1000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
... | 1 | 80,175,417 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n, h, w;
cin >> w >> h >> n;
ll ux = w, bx = 0, uy = h, by = 0;
rep(i, 0, n){
ll x, y, a;
cin >> x >> y >> a;
if(a == 1... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int l=0, r=W, d=0, u=H;
rep(i,N) {
int x, y, a;
cin >> x >> y >> a;
switch (a) {
case 1:
if (x > l) l = x;
break;
case 2:
if (x < r) ... | 1 | 72,294,917 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,c;
cin >> n;
c = 0;
int a,b;
for (int i = 0 ; i < n ; i++){
cin >> a >> b;
c = c-a+b+1;
}
cout << c << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main() {
int n;
cin >> n;
int count =0;
rep(i,n){
int L,R;
cin >> L >> R;
int ans = R-L+1;
count +=ans;
}
cout << count << endl;
} | 1 | 62,084,434 |
#include "bits/stdc++.h"
using namespace std;
void 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 {
cout << (A > B ? "Al... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
if (a == 1 || b == 1) {
if (a == 1 && b == 1)
cout << "Draw" << endl;
else if (a == 1)
cout << "Alice" << end... | 1 | 53,281,572 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long factorials[500001];
int pre_factorials(int n){
factorials[0] = 1;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9+100;
const int MOD = 1e9+7;
ll dp[3000] = {0};
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
dp[0] = 1;
for (int i = 3; i <= n; i++){
for (int j = 3; j <= i; j++){
dp[i] += dp[i-j];
dp[i] %= MO... | 1 | 47,466,277 |
#include <iostream>
using namespace std;
int main(void){
int N, A, B;
cin >> N >> A >> B;
if((B-A)%2 == 1) cout << "Borys" <<"\n";
else cout << "Alice" <<"\n";
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 1 | 49,348,427 |
#include <iostream>
using namespace std;
int main(){
int a[100], i = 0;
while (true){
cin >> a[i];
if (cin.eof()) { break; }
if (a[i] == 0 ){
cout << a[i - 1] << endl;
i--;
}
else { i++; }
}
return 0;
} | #include <stdio.h>
int main(void){
int t,s=0;
while(scanf("%d",&t),t){
int i,now=0,count=0;
int train[12]={0},car[12]={0};
for(;;){
if(s!=0){
scanf("%d",&t);
}
else {
s=1;
}
if(t!=0){
train[now]=t;
now++;
}
else{
now--;
car[count]=train[now];
train[now]=0;
co... | 1 | 15,504,769 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#define M (long long)3e5 + 10
using namespace std;
long long cnt[M], a[M], sum[M];
i... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define REP... | 1 | 17,549,076 |
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
inline bool isOK(vector<int>& sum) {
rep(i, 20) {
if (sum[i] >= 2) return false;
}
return true;
}
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { ci... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<int> A(... | 1 | 83,705,243 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main(){
int n,m;
cin >> n >> m;
vector<int> s(n),t(m);
rep(i,n) cin >> s[i];
rep(i,m) cin >> t[i];
vector<vector<ll>> dp(n+1, vector<ll>(m+1));
rep(i,m+1) dp[0][i]... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
using namespace std;
#define N 2003
#define mod 1000000007
int dp[N][N];
int add(int x,int y) {
int ret = x+y;
if(ret>=mod) {
ret -= mod;
}
if(ret<0) {
... | 1 | 44,696,704 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.