code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include<algorithm>
int main()
{
int N, K, X, Y;
std::cin >> N >> K >> X >> Y;
std::cout << std::min(N,K)*X + std::max(N-K, 0)*Y << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,K,X,Y;
cin>>N>>K>>X>>Y;
if(K>=N){
cout<<N*X<<endl;
}
else if(K<N){
cout<<K*X+Y*(N-K)<<endl;
}
} | 1 | 76,459,954 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i = 1; i <= 9; i++)
{
if (n <= 111 * i)
{
cout << 111 * i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | 1 | 81,119,451 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
string a;
cin>>a;
ll counter=0;
for(int i=0;i<a.size();i++){
if(a[2]==a[3]&&a[4]==a[5]){
counter++;
}
}
if(counter!=0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
... | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overlo... | 1 | 24,857,077 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> grid(h, vector<char>(w));
rep(i, h) {
rep(j, w) {
cin >> grid.at(i).at(j);
}
}
bool flg;
rep(i, h) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin>>H>>W;
vector<vector<char>> A(H,vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>A.at(i).at(j);
}
}
vector<int> L(H),R(W);
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(A.at(i).at(j)=='#'){
... | 1 | 53,459,049 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll sa = 0, sb = 0, n, cnt = 0, t;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] > b[i]) {
t = ... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 1 | 14,483,181 |
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define pb push_back
#define F first
#define S second
#define WLL(t) while(t--)
#define FOR(i,... | 1 | 8,451,614 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
int res=0;
for... | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define... | 1 | 30,266,290 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <queue>
#include <climits>
using namespace std;
#define rep(i,l,r) for(int i=l;i<r;i++)
#define repb(i,r,l) for(int i=r;i>l;i--)
#define ll long long
#define ull unsigned lon... | #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.at(i);
}
for (int i = N - 1; i >= 0; i -= 2) {
cout << A.at(i) << " ";
}
if (N % 2 == 0) {
for (int i = 0; i < N; i += 2) {
cout << A.at(i) << " ";
... | 1 | 2,183,068 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for (ll i = 0; i * R <= N; ++i) {
ll red = i * R;
for (ll j = 0; j * G <= N - red; ++j) {
ll green = j * G;
... | #include<iostream>
#include<cstdio>
using namespace std;
const int N=3005;
int R,G,B,n;
int main()
{
scanf("%d%d%d%d",&R,&G,&B,&n);
int ans=0;
for(int r=0;r*R<=n;r++)
for(int g=0;r*R+g*G<=n;g++)
{
int ret=n-r*R-g*G;
if(ret%B==0) ans++;
}
printf("%d",ans);
return 0;
} | 1 | 44,500,642 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double pi ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using Graph = VV;
int Inf = (1 << 30)... | 1 | 5,273,040 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int A , B ;
cin >> A >> B ;
string S ;
cin >> S ;
int cnt = 0 ;
if(S.at(A) == '-' && S.size() == A+B+1 ){
for(int i = 0 ; i < S.size() ; i++){
if(S.at(i) == '-') cnt++ ;
}
if(cnt == 1){
cout << "Yes" << endl ;
retu... | #include <stdio.h>
int main () {
int a, b;
scanf("%d %d", &a, &b);
int flag = 0;
char str [a+b+1];
scanf("%s", str);
int atr = 0;
for ( int i = 0 ; i < a+b+1 ; i++) {
if (str[i] == '-' && i == a ) {
flag = 1;
}
if (str[i] >= '0' && str[i] <= '9') {
++atr;
}
}
int total = a+b;
if (flag == 1 && a... | 1 | 47,955,461 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
string s[55];
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 | 14,726,002 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int x,y;
cin >> x >> y;
int ans = x + y/2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int a,b;
cin... | 1 | 35,760,297 |
#include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main(){
int N , Y , A=-1 , B=-1 , C=-1;
cin >> N >> Y;
Y /= 1000;
for(int i = 0; i <= N; i++){
for(int j = 0; j <= N - i; j++){
if(9 * ... | #include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 105
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rev... | 1 | 77,631,168 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
int maxh = 0;
rep(i, N) {
maxh = max(maxh, A[i]);
ans += maxh - A[i];
}
cout << ans << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
while (cin >> n) {
long long stool = 0;
int prev = 0;
for (int i = 0; i < n; ++i) {
int aux;
cin >> aux;
if (aux <= prev) {
stool += ... | 1 | 17,461,798 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t k, a, b, ans;
cin >> k >> a >> b;
if ((b-a <= 2) || (k <= a-1)) {
ans += k+1;
} else {
ans = a;
k -= a-1;
ans += (b-a) * (k/2);
if (k % 2 == 1) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ll k,a,b;
cin >>k >>a >>b;
ll ans=1;
if(k<=a-1){
cout << ans+k<< endl;
return 0;
}
else {
if(b-a<=2){
cout << ans+k<< endl;
return 0;
}
ans=a;k-=(a-1);
ans+=(b-a)*(k/2)+k%2;
... | 1 | 13,502,300 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include<iostream>
#include<numeric>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<map>
#include<utility>
#include<cmath>
#include<tuple>
#include<string>
#include<bitset>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
using ll = long long;
class DisjoinSet{
pu... | 1 | 61,612,631 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9+7;
int main(){
ll a;
cin >> a;
string b;
cin >> b;
int k = int(b[0]-'0')*100 + int(b[2]-'0')*10 + int(b[3]-'0');... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | 1 | 85,020,636 |
#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 = 1e9+7;
int N;
int A[114514];
int T[114514];
int L[114514];
int R[114514];
int main() {
scanf("%d", &N);
rep(i, N) {
scanf("%d", &T[i+1]);
}
rep(i, N) {
scanf("%d", &A[i+1])... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
const llong mod = (llong)1e9 + 7;
llon... | 1 | 95,102,966 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
ll n;
cin >> n;
ll b[n-1];
for (ll i=0;i<=n-2;i++)
{
cin >> b[i];
}
ll ans=b[0];
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
cin>>n;
n--;
ll arr[n];
for(i=0;i<n;i++) cin>>arr[i];
ll sum=arr[0]+arr[n-1];
for(i=0;i<n-1;i++)
... | 1 | 30,227,088 |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define ... | #include <bits/stdc++.h>
using namespace std;
#define w(x) int x;cin>>x;while(x--)
#define ll long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define vi vector<int>
#define fr(a,b) for(int i=a;i<=b;i++)
#define inf 1e18
#define mod 1000000007
int main()
{
fast;
ll n;
... | 1 | 2,252,527 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
char s[303][303];
int ans = 0;
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) cin >> s[i][j];
for(int l = 0; l < n; l++){
bool yes = true;
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(s[(i +... | #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++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << ... | 1 | 42,859,044 |
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
void solve() {
int n, k;
cin >> n >> k;
ll cnt = 0;
for(int i = 0; i < n; ++i) {
int x;
cin >> x;
if(x >=k) cnt++;
}
cout << cnt << e... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 51,194,387 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
int N,M; cin >> N >> M;
vector<ll> h(N);
map<int,bool> m;
for(int i = 0; i < N; i++){
cin >> h[i];
m[i] = true;
}
for(int i = 0; i < M; i++){
int tmp1, tmp2;... | #include <bits/stdc++.h>
using namespace std;
int main(void){
[[maybe_unused]] long long int n,m,i,j,c=0,h[1000010],a[1000010],b[1000010],x[1000010],ans=0;
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> h[i];
x[i]=0;
}
for(i=0;i<m;i++)
{
cin >> a[i] >> b[i];
if(h[a[... | 1 | 20,726,522 |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005;
int n;
int a[N];
int q[N];
bool solv()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a +... | #include <cstdio>
#include <cctype>
#include <set>
#include <iostream>
using namespace std;
typedef long long LL;
inline char gc()
{
static const int L = 23333;
static char sxd[L], *sss = sxd, *ttt = sxd;
if (sss == ttt)
{
ttt = (sss = sxd) + fread(sxd, 1, L, stdin);
if (sss == ttt) return EOF;
}
return *sss+... | 1 | 83,830,144 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int dp[1000][1000];
void solve() {
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
dp[i][j] = (i < 1 || j < 1 ? 0 : dp[i-1][j-1]) + (s[i] == t[j] ? 1 : 0);
int a = (i < 1 ? 0 : dp[... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void lcs(string x,string y){
int m=x.length();
int n=y.length();
int c[m+1][n+1];
for(int i=0;i<=m;i++) c[i][0]=0;
for(int j=1;j<=n;j++) c[0][j]=0;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(x[i-1]==y[j-1]){
... | 1 | 54,581,099 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int n=(int)s.length();
if(n<26)
{
for(char c='a';c<='z';c++)
{
if(s.find(... | 1 | 73,811,020 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
string S; cin >> S;
ll SUM = 0;
for(auto ch : S){ SUM += ch - 48; }
if(SUM % 9 == 0) cout << "Yes" << endl;
else cout... | 1 | 84,548,694 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);i++)
#define REAP(i,a,n) for(int i=(a);i<(n);i++)
#define YES cout<<"Yes"<<endl
#define NO cout<<"No"<<endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(),v.end()
bool check(ll ma,ll ... | #ifdef DBG1
#define LOCAL
#endif
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#ifdef DBG1
#define dbg(...) fprintf(... | 1 | 8,982,454 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
cout<<a[n-1]-a[0];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 | 84,263,173 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
double w,h,x,y; cin >>w >>h >>x >>y;
double ans = w*h/2;
cout << fixed << setprecision(6) << ans << ' ';
if(x*2==w && y*2==h)cout << 1;
else cout << 0;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int w, h, x, y;
cin >> w >> h >> x >> y;
do... | 1 | 56,839,477 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int FindPrefix(string s, string t) {
int i = 0;
while (i < s.size() && i < t.size() && s[i] == t[i]) i++;
re... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size(),flag=0;
for(int i=0;i<n;i++){
for(int j=0;i+j-1<n;j++){
string t = s;
t.erase(i,j);
if(t=="keyence") flag = 1;
}
}
if(flag) cout << "YES" << endl;
... | 1 | 94,099,820 |
#include <iostream>
#include <sstream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <climits>
#include <set>
using namespace std;
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vect... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 1 | 68,609,867 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 1 | 46,504,703 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
for(int i=0;i<k;i++){
if(b<=a)
b*=2;
else if(a<b||c<=b)
c*=2;
if(a<b&&b<c){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
while(a >= b && k--) b *= 2;
while(k--) c *= 2;
cout << (a < b && b < c ? "Yes" : "No") << '\n';
return 0;
} | 1 | 15,202,867 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
string n;
int k;
ll dp[111][4][2];
ll f(int i, int non_zero, bool less) {
if(non_zero > k) return 0;
if(i == (int)n.size()) return non_zero == k;
ll &ans = dp[i][non_zero][less];
if(~ans) return ans;
ans = 0;
if(less) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#de... | 1 | 78,265,863 |
#include<stdio.h>
int main(void)
{
int n,s,ss,i;
scanf("%d",&n);
s=100000;
for(i=0;i<n;i++){
ss=s*0.05;
s+=ss;
if(s%1000!=0){
s=s/1000;
s=(s+1)*1000;
}
}
printf("%d\n",s);
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int debt = 100000, n;
cin >> n;
for (int i = 0; i < n; i++) {
debt *= 1.05;
debt = (int)ceil(debt/1000.0)*1000;
}
cout << debt << endl;
} | 1 | 95,588,439 |
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
set<int> in, out;
pair<int, int> sushi[N];
for(int i=0; i<N; i++){
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi, sushi + N, greater<pair<int, i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
ll flg[101010];
int main(){
ll N, K;
cin >> N >> K;
priority_queue<P>Q;
priority_queue<P, vect... | 1 | 59,899,951 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
unsigned long long res;
if(N&1){
res = N-1;
res >>= 1;
res *= N;
}else{
res = N;
res >>= 1;
res *= N-1;
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define el << endl
#define PI 3.141592653589793238
#define _test_ int t; cin >> t; while(t--)
#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)
ll g... | 1 | 93,214,861 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
ll ans;
int a = n / k;... | 1 | 42,435,934 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort( a , a+3);
int ans=0;
ans += a[2] -a[1];
a[0] += a[2] -a[1];
ans +=ceil ((a[2] -a[0])/double(2) ) + (a[2] -a[0])%2;
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
while(v[0] != v[1] || v[0] != v[2]) {
sort(v.begin(), v.end());
int x = v[2] - v[1];
ans += x;
v[1] = v[2];
v[0] += x;
int y = v[2] - v[0];
if(y % 2 == 0) {
an... | 1 | 85,514,284 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll x, y;
int main() {
scanf("%lld %lld", &x, &y);
for(ll i = 0; i <= x && i <= y/4; ++i) {
ll cur = x - i;
if(i * 4 + cur * 2 == y) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 2e5 + 10;
const int SIZ = 1e6 + 10;
const ... | 1 | 61,347,695 |
#include <bits/stdc++.h>
using namespace std;
#include <string.h>
#include <map>
#define MEM(var, val) memset(var, (val), sizeof(var))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define nitro \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define maxn 200004
#define MOD 1000000007
int H, W;
int main()
{
cin >> H >> W;
char board[H][W];
long long int dp[H][W];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> board... | 1 | 29,572,111 |
# include <stdio.h>
int main() {
int a,b;
scanf("%d %d",&a,&b);
if(a==b){
printf("a == b\n");
}else if(a > b){
printf("a > b\n");
}else if(a < b){
printf("a < b\n");
}
getchar();
} | #include <stdio.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a < b){
printf("a < b\n");
}
if(a > b){
printf("a > b\n");
}
if(a == b){
printf("a == b\n");
}
} | 1 | 76,851,384 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
int size=s.size();
int count=0;
char now;
for (int i=0;i<size;i++) {
if (i==0) {
now=s[i];
} else {
if (s[i]!=now) {
now=s[i];
count++;
... | #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() {
string s;
cin >> s;
int ans = 0;
for (int i = 1; i < s.size(); ++i) if (s[i-1] != s[i]) ++ans;
cout << ans << endl;
return 0;
} | 1 | 28,877,740 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
for(int i = 7;i >= 0;i--) {
b = pow(2, i);
if(b <= a) {
cout << b << endl;
break;
}
}
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
int N;
std::cin >> N;
int ans = 1;
int cnt_max = 0;
for(int i = 1; i <= N; i++)
{
int num = i;
int cnt = 0;
while(((num % 2) == 0) && (num != 0) && (num != 1)... | 1 | 88,629,407 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int l=s.length(),j,k;
vector<int> v(26,-1);
for(j=0;j<l;j++){
k=s[j]-'a';
if(v[k]==-1||j-v[k]>2) v[k]=j;
else{
cout<<v[k]+1<<' '<<j+1<<endl;
return 0;
}
}
cout<<"-1 -1"<<endl;
} | 1 | 63,134,663 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int n,m;
int main(){
cin>>n>>m;
int s... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 1 | 68,782,838 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, n, f = 0;
cin >> N;
n = N;
while ( n > 0 ) {
f += n % 10;
n = n / 10;
}
if ( N % f == 0 ) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long LL;
typedef long long int int64;... | 1 | 43,712,145 |
#include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <s... | #include <iostream>
#include <array>
#include <algorithm>
using namespace std;
const int maxn = 3e5+6;
using ll = long long;
array<ll,maxn>arr;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int num;
ll tot = 0;
cin >> num;
for(int i = 0;i<num;++i)
{
cin >> arr[i];
arr... | 1 | 14,945,632 |
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n;
vector <ll> a;
ll calc(ll m){
ll ret = 0;
for(auto &i : a){
if((i + m) % (n + 1) == n) return -1;
ret += (i + m) / (n + 1);
}
return ret;
}
int main(){
ios_base::sy... | #include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#de... | 1 | 87,161,423 |
#include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 1 | 37,158,685 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
uint N; cin >> N;
vector<int> d(N, 0);
int recover = 0;
for (auto &x: d) cin >> x;
for (uint i=0; i<N; i++) {
for (uint j=(i+1); j<N; j++) {
recover += d[i] * d[j];
}
}
cout << recover << endl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
int n, sum=0, ans=0;
cin >> n;
vi d(n);
rep(i, n){
cin >> d[i];
sum+=d[i];
}
rep(i, n){
ans+=(sum-d[i])*d[i];
}
c... | 1 | 57,335,755 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1000000000000000... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int l = -1, r = -1;
for (int i = 0; i+2 <= n; i++) {
if (s[i] == s[i+1]) {
l = i+1, r = i+2;
break;
} else if (i+3 <= n && (s[i+1] == s[i+2] || s[i+2] == s[i])) {
... | 1 | 91,425,852 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a<=16 && b<=16 && (a+b)<=16){
if(a==b || a==(b+1) || b==(a+1)){
cout << "Yay!" << endl;
}
else{
cout << ":(" << endl;
}
}
return 0;
} | #include<iostream>
int main(){
int A,B;
std::cin >> A >> B;
if(A <= 8 && B <= 8) std::cout<<"Yay!";
else std::cout<<":(";
} | 1 | 79,532,322 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
vector <int> cnt(26);
for (int i = 0; i < s.length(); ++i) cnt[s[i]-'a']++;
for (int i = 0; i < 26; ++i){
if (cnt[i] == 0) {
char c = 'a' + i;
cout << c << "\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
set<char> cs;
for (char c: s) {
cs.insert(c);
}
if (cs.size() == 26) {
cout<<"None"<<endl;
return 0;
}
for (int i='a'; i<='z'; i++) {
if (cs.find(i) == cs.end()) {
cout<<(char)i<<endl;
return 0;
... | 1 | 1,212,884 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main(){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int a=x2-x1;
int b=y2-y1;
cout<<x2-b<<" "<<y2+a<<" "<<x2-a-b<<" "<<y2+a-b<<"\n";
return 0;
} | 1 | 83,990,440 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<math.h>
using namespace std;
bool sok(int* a,int n){
for(int i=1;i<n;i++){
if(a[i-1]>a[i])return false;
}
return true;
}
int main(){
int a[100],n;
cin>>n;int cnt=0;
for(int i=0;i<n;i++)cin>>a[i];
int mini=0;
for(int i=0;... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, minj, count = 0;
cin >> n;
int A[n];
for(int i = 0; i < n; i++)
cin >> A[i];
for(int i = 0; i < n; i++){
minj = i;
for(int j = i; j < n; j++){
if(A[j] < A[minj])
minj = j;
}
swap(A[i], A[minj]);
if(i != minj)
... | 1 | 19,332,155 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ld pie=3.1415926535;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000... | #include <bits/stdc++.h>
using namespace std;
const unsigned long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for(;exp > 0;exp >>= 1) {
if((exp & 1) == 1) tot = tot * base % MOD... | 1 | 25,716,753 |
#include<stdio.h>
int main(){
char str[21]={0};
int cou=0;
scanf("%s",str);
for(int i=0;str[i]!='\0';i++){
cou++;
}
for(int i=cou-1;i>=0;i--){
printf("%c",str[i]);
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
int i;
string str;
cin >> str;
for(i = 0; i < str.size(); ++i){
cout << str.at(str.size() - i - 1);
}
cout << endl;
} | 1 | 24,861,778 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i <... | 1 | 94,389,091 |
#include <stdio.h>
int main(void){
int t[100];
int n = 0;
int c = 0;
for(int i=0;i<=9;++i){
for(int j=0;j<=9;++j){
t[i*10+j] = i+j;
}
}
while(scanf("%d", &n) != EOF){
c = 0;
for(int i=0;i<100;++i){
for(int j=0;j<100;++j){
if(t[i]+t[j] == n){
c++;
}
}
}
printf("%d\n", c);
}
retu... | #include<iostream>
using namespace std;
#define RENT 100000
int main(){
int n, ans;
int counter = 0;
while (cin >> n){
counter = 0;
for (int i = 0; i < 10; i++){
for (int q = 0; q < 10; q++){
for (int w = 0; w < 10; w++){
for (int e = 0; e < 10; e++){
ans = i + q + w + e;
if (ans == n){
... | 1 | 2,418,082 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int pointT = 0, pointH = 0;
string taro, hanako;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> taro >> hanako;
int count = 0;
if( taro.size() > hanako.siz... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string t_str, h_str;
int t_point = 0, h_point = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t_str >> h_str;
if (t_str > h_str) {
t_point += 3;
} else if (t_str < h_str) {
h_point += 3;
} else {
... | 1 | 94,708,045 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("outp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
vector<int> prime(int N) {
vector<bool> a(N, true);
for(int i=1; i<sqrt(N); i++) {
... | 1 | 92,060,212 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
string ans = (abs(c-a) <= d || (abs(b-a) <= d && abs(c-b) <= d)) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | #include<iostream>
#include<math.h>
using namespace std;
int main()
{
int a, b,c,d;
cin>>a>>b>>c>>d;
if(abs(a-c)<=d) cout<<"Yes"<<endl;
else{
if(abs(a-b)<=d && abs(c-b)<=d) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
} | 1 | 100,236,915 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,d,ak,c=0; cin>>n>>k;
int a[n]={0};
while(k--){
cin>>d;
while(d--) cin>>ak,a[--ak]++;
}
for(int i:a) if(!i) c++;
cout<<c;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k,d,a,count[101],sum=0;
cin >> n >> k;
for(int i=0;i<n;i++){
count[i]=0;
}
for(int i=0;i<k;i++){
cin >> d;
for(int j=0;j<d;j++){
cin >> a;
count[a-1]++;
}
}
for(int i=0;i<n... | 1 | 16,049,770 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int x,n;cin>>x>>n;
vector<int> p(n);
for(int i=0; i<n; ++i) cin>>p[i];
vector<bool> q(102,true);
for(int i=0; i<n; ++i) q[p[i]]=false;
vector<int> r;
for(int i=0; i<102; ++i) if(q[i]==true) r.push_back(i);
auto s=lower_bound(r.begin(),r.end(),... | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("input.txt", "r", stdin)
#define Write ... | 1 | 45,517,062 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t n;
cin >> n;
int64_t a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int64_t zero = 0;
for(int i = 0; i < n; i++){
if(a[i] == 0){
zero++;
}
}
if(zero > 0){
cout << 0 << endl;
return 0;
}
int64_t sum = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;cin>>N;
long long H=1;bool F=false;bool J=false;long long P=0;long long U=1;
for(int X=0;X<N;X++){
long long A;cin>>A;
string S=to_string(A);P+=S.size()-1;
if(A==0)J=true;
H*=A;U*=A;
if(H/1000000000000000001!=0)F=true;
H%=100... | 1 | 49,614,281 |
#include <iostream>
#include <vector>
using namespace std;
class Solution {
private:
int N, M, X;
vector<int> costs;
vector<vector<int>> arr;
public:
void load() {
cin >> N >> M >> X;
costs.assign(N, 0);
arr.resize(N);
for (int i = 0; i < N; ++i) {
arr[i].resi... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 1 | 55,709,063 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N; cin >> N;
vector<int> div(101);
fo... | 1 | 74,763,039 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <iomanip>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll a[100000];
ll b[100000];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
ll sum=0;
ll cnt=0;
for(int... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, sum = 0;
cin >> n;
vector<ll> a(n, 0LL);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
if (2 * sum % (n * (n + 1)) != 0) {
cout << "NO" << endl;
return ... | 1 | 62,769,259 |
#include<iostream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
int w,h;
string matrix[20];
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
bool valid(int x,int y)
{
return (x>=0)&&(x<w)&&(y>=0)&&(y<h)&&(matrix[y][x]!='#');
}
int main()
{
while(true)
{
queue<pair<int,int> > q;... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int W, H;
char X[20][20];
bool V[20][20];
int DX[4] = {0, -1, 1, 0};
int DY[4] = {-1, 0, 0, 1};
int main() {
while (cin >> W >> H) {
if (W == 0 && H == 0) break;
int sx ... | 1 | 47,559,581 |
#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 int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
int L; cin >> L;
... | #include<bits/stdc++.h>
using namespace std ;
int main(){
double a;
cin>>a;
printf("%.12f",(a*a*a/27));
} | 1 | 100,448,164 |
#include <iostream>
using namespace std;
int main(void)
{
while (true) {
u_int n, x;
cin >> n >> x;
if (!n && !x)
break;
u_int count = 0;
for (u_int a = 1; a <= n; a++)
for (u_int b = a + 1; b <= n && a + b <= x; b++)
for (u_int c = b +... | #include <iostream>
using namespace std;
int main(){
int n, x;
int result;
while(true){
cin >> n >> x;
result = 0;
if(n==0 && x==0){
return 0;
}else{
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
for(int k=j+1; k<n; k++){
if((i+1)+(j+1)+(k+1) == x){
... | 1 | 25,131,067 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long a,b,c,d;
cin >> a >> b >> c >> d;
cout << max(b*d, max(a*c, max(a*d, b*c))) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair<ll,ll>
#define INF 0x3f3f3f3f
#define LINF 98765432123456789
#define testcases() ll t; cin>>t; while(t... | 1 | 69,230,471 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | #include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
class ADoubleHelix {
public:
void solve(std::istream &in, std::ostream &out) {
char b;
in >> b;
switch (b) {
case 'A':
out << 'T' << endl;
break;
case 'C':
out << 'G' ... | 1 | 10,987,353 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
vector<int> pows;
int dp[N];
int n;
int dfs(int m = 0) {
int ret = 1e... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 1 | 38,676,055 |
#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++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
int main() {
int X, A; cin >> X >> A;
if (X < A)cout << 0;
else cout << 10;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if(X >= A) cout << 10 << endl;
else cout << 0 << endl;
} | 1 | 90,915,506 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.... | #include <bits/stdc++.h>
typedef long long ll;
const int maxn = int(1e5) + 7, mod = int(1e9) + 7;
ll power_mod(ll p, ll q) {
ll ret = 1;
while (q) {
if (q & 1) ret = ret * p % mod;
p = p * p % mod;
q >>= 1;
}
return ret;
}
struct Combination {
ll fac[maxn], inv[maxn];
Com... | 1 | 16,336,881 |
#include <iostream>
using namespace std;
int main() {
int n,x;
while(cin >> n >> x, n || x) {
int sum = 0;
for(int i=1;i<n;i++)
{
for(int j=i+1;j<x-i;j++)
{
int k = x-i-j;
if(j<k && k<=n) {
sum += 1;
... | #include <iostream>
using namespace std;
int main(){
int n,x;
int counter = 0;
while(true){
cin >> n >> x;
if(n == 0 && x == 0)break;
for(int i = 1; i <= (n - 2); i++)
for(int j = (i + 1); j <= (n - 1); j++)
... | 1 | 64,534,712 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int i,j,k;
int n1=0,n2=0;
int v[5];
int temp;
for(i=0;i<5;i++){
cin>>v[i];
}
for(i=0;i<4;i++)
for(j=0;j<4;j++)
if(v[j+1] > v[j]){
temp = v[j];
v[j] = v[j+1];
v[j+1] = temp;
}
for(i=0;i<4;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int a[5];
int main(){
REP(i,5){
cin>>a[i];
}
sort(a,a+5);
REP(i,5){
if (i) cout<<" ";
cout<<a[4-i];
}
cout<<endl;
return 0;
} | 1 | 15,132,182 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 | 28,696,896 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))... | 1 | 79,471,233 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<array<int, 3>> vt(n - 1);
for (int i = 0; i < n - 1; ++i) {
cin >> vt[i][0] >> vt[i][1] >> vt[i][2];
}
for (int i = 0; i < vt.size(); ++i) {
int cur = i, t = 0;
while (cur < vt.size()) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | 1 | 11,243,335 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(int argc, char **argv)
{
int n, m, *a, t, p;
while(1){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){
break;
}
a = (int *)calloc(n+1, sizeof(int));
t = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
t +... | #include<iostream>
using namespace std;
int N,M,P;
void solve() {
int sum=0;
int a;
for(int i=1;i<=N;i++) {
int b;
cin>>b;
sum+=b;
if(i==M) a=b;
}
sum*=100;
sum=sum*(100-P)/100;
if(a==0) sum*=0;
else sum/=a;
cout<<sum<<endl;
}
int main() {
while(ci... | 1 | 31,910,973 |
#include<iostream>
#include<map>
using namespace std;
int main(){
long N, K;
cin >> N >> K;
map<long, long> List;
for (int i=0; i<N; i++){
long a, b;
cin >> a >> b;
if (List.find(a) == List.end()){
List.emplace(a,b);
}
else{
List[a] += b;
... | #include <iostream>
using namespace std;
int main() {
long long int freq[100001] = {0};
long long n, k;
cin >> n >> k;
long long a, b;
for (long long i = 0; i < n; i++) {
cin >> a >> b;
freq[a] += b;
}
for (long long i = 1; i < 100001; i++) {
if (freq[i] >= k) {
cout << i << endl;
... | 1 | 28,053,806 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> i;
vector<int> u;
vector<int> o;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a=0,b,c,d=0,e=0,f=0,g;
string s;
cin >>a>>s>>b;
for(int n=0;n<a;n++){
if(s[b-1]!=s[n]) s[n]='*';
}
... | 1 | 28,479,103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int S = 0;
vector<int> A(M);
for(int i = 0; i < M; i++) {
cin >> A.at(i);
S += A.at(i);
}
if(S > N) cout << -1 << endl;
else cout << N - S << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,a,s=0,ans=-1,i;
cin>>n>>m;
for(i=0;i<m;i++)
{
cin>>a;
s+=a;
}
cout<<(s>n?ans:n-s)<<endl;
} | 1 | 11,231,382 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
const int MAXN = 1e5 + 4;
int n;
char s[MAXN];
int a[MAXN];
int main() {
cin >> n;
cin >> s;
s[n] = s[0], s[n + 1] = s[1];
REP(i, 4) {
a[0]... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N; string S; cin >> S;
vector<bool> assign(N);
for(int k = 0; k < 4; k++){
if(k==0){ assign[0] = true; assign[1] = true;}
if(k==1){ assign[0] = true; assign[1] = false;}
if(k==2){ assign[0] = false; assign[1] = tru... | 1 | 58,494,981 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
int N, K;
int mod = 1000000007;
signed main()
{
cin >> N >> K;
int l = 0, r = 0;
int ans = 0;
for(int i = 0; i < K - 1; i++)
{
l += i;
r += N - i;
}
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
const int mod=1e9+7;
int main(){
ll n,k;
cin>>n>>k;
ll ans=0;
for(int i=k;i<=n+1;i++){
ans=(ans+(n-i+1)*i%mod+1)%mod;
}
cout<<ans<<endl;
... | 1 | 44,001,603 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n",(x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
int main(){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
char s[11];
cin >> s;
if(s[2]==s[3]&&s[4]==s[5]){
cout << "Yes\n";
}
else
cout <<"No";
return 0;
} | 1 | 36,205,180 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se secon... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <deque>
#include <map>
#define rep0(i, n) for (i = 0; i < n; i++)
#define rep(s, i, n) for (i = s; i < n; i++)
using namespace std;
#define INF 1<<30
int main(){
int h,w,m,i,wi,hi;
cin>>h>>w>>m;
vector<map<int... | 1 | 93,642,202 |
#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... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 84,822,101 |
#include <iostream>
using namespace std;
int main()
{
int N;
bool seven = false;
cin >> N;
for (int i = 0; i < 3; i++)
{
if (N % 10 == 7)
{
seven = true;
}
N /= 10;
}
if (seven)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin>>S;
if(S[0]=='7'){
cout<<"Yes"<<endl;
}
else if(S[1]=='7'){
cout<<"Yes"<<endl;
}
else if(S[2]=='7'){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 79,877,524 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define BOLT ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define X first
#define Y second
#define endl "\n"
using namespace std;
void solve() {
int n, m;
cin >> n >> ... | 1 | 79,561,982 |
#include<cstdio>
#include<cctype>
int main(void){
char ch;
while(1) {
scanf("%c", &ch);
if ( isalpha(ch) ) {
if (islower(ch)){
ch = toupper(ch);
printf("%c", ch);
}
else{
ch = tolower(ch);
printf("%c", ch);
}
}
else {
printf("%c", ch);
}
if ( ch == '\n') break;
}
return 0;... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
getline(cin, s);
for(int i = 0 ; s[ i ] ; i++)
if(s[ i ] >= 65 && s[ i ] <= 90)
s[ i ] += 32;
else if(s[ i ] >= 97 && s[ i ] <= 122)
s[ i ] -= 32;
cout << s << en... | 1 | 20,145,316 |
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define lppi pair<pair... | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <cstring>
using namespace std;
#define X first
#define Y second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define de(x,y) cout<<#x<<" :"<<x<<... | 1 | 34,698,982 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#define PI 3.141592653589
using namespace std;
typedef struct{
double x;
double y;
}Pos;
void displayKoch(Pos, Pos, int, double rad);
void Koch(Pos*, Pos, Pos, double rad);
int main(){
int n;
Pos pos0, pos1;
pos0.x = 0;
pos0.y = 0;
pos1.x = 100;
pos1.y = ... | #include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef pair<double,double> P;
vector<P> ans;
void kohho(P b,P e,int c){
if(!c)return;
P s,u,t;
s.X=(-b.X+e.X)/3.0+b.X;
s.Y=(-b.Y+e.Y)/3.0+b.Y;
t.X=s.X+s.X-b.X;
t.Y=s.Y+s.Y-b.Y;
u.X=t.X-s.X;
u.Y=t.Y-s.Y;
double st = u.X;
... | 1 | 12,034,020 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
string s_1, s_2;
cin >> s_1 >> s_2;
int l_1 = (int)s_1.size(), l_2 = (int)s_2.size();
int dp[l_1 + 1][l_2 + 1];
memset(dp, 0, sizeof(dp));
rep(i, l_1+1) {
dp[i][0] = i;
}
rep(i, l_2+1) {
... | 1 | 93,840,888 |
#include <stdio.h>
#include <string.h>
int main () {
int k;
char s[101];
scanf ("%d", &k);
scanf ("%s", &s);
int pnjg = strlen(s);
if (pnjg<=k) {
printf ("%s", s);
} else {
s[k] = '\0';
printf ("%s...", s);
}
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int k;
cin >> k;
string s, ans;
cin >> s;
int t = s.size();
if(t <= k) {
cout << s << endl;
}else{
for (int j = 0; j < k; j++){
cout << s.at(j);
}
cout << "..." << endl;
}
} | 1 | 94,887,153 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.