code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f
int max(int x,int y)
{
return x>y?x:y;
}
int min(int x,int y)
{
return x<y?x:y;
}
int d[110][110];
void floyd(int n)
{
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
d[i][j]=min(d[i][j],(d[i][k]+d[k][j]));
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(... | 0 | 86,290,991 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#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; } ret... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
bool G[10][10];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int ... | 0 | 57,101,656 |
#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++)
int main() {
long a,b;
cin >> a>>b;
long ans;
if(a==1||b==1){
ans=max(1LL,a-2LL)*max(1LL,b-2LL);
}
else{
ans=max(0LL,a-2LL)*max(0LL,b-2LL);
}... | #include<bits/stdc++.h>
#define endl "\n"
#define M_PI 3.14159265358979323846
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define fix_prec cout.setf( std::ios::fixed, std:: ios::floatfield ); cout.precision(9);
#define vi vector<int>
#define vvi vector<vector<int... | 0 | 94,094,045 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int d, A;
int sunuke[N] = {0};
for (int i = 0; i < K; i++) {
cin >> d;
for (int j = 0; j < d; j++) {
cin >> A;
sunuke[A - 1]++;
}
}
int ans = 0;
for (int i ... | #include <iostream>
#include <vector>
#include <algorithm>
int main(void){
long long N, ans=0;
std::cin >> N;
std::vector<long long> A(N + 1);
for (int i=0; i<N+1; ++i){
std::cin >> A.at(i);
}
for (int i=0; i<N; ++i){
long long b, tmp;
std::cin >> b;
tmp = A.at(i)... | 0 | 1,909,420 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[100005]={0};
int main(){
ll n;
cin>>n;
vector<ll> vec,cos,cnt,pos;
vec.push_back(0);
cos.push_back(0);
cnt.push_back(0);
pos.push_back(0);
ll max_val=0;
for(int i=1;i<=n;i++){
ll a;
cin>>a;
if(a>max_val) {
vec.... | 0 | 42,198,573 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A,B;
cin>>A>>B;
int ans=(A-1)*(B-1);
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n;
cin>>n;
cout<< n*n;
return 0;
} | 0 | 41,636,990 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, M;
cin >> N >> M;
map<int, vector<pair<int, int>>> city_map;
int p, y;
for ( int i=0; i<M; i++ ) {
cin >> p >> y;
city_map[p].push_back(make_pair(y, i));
}
vector<pair<int, int>> ans(M);
int pref, orig... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n; cin >> n;
vi v(n + 2), jf(n + 2, n + 1), jf2(n + 2, n + 1), jb(n +... | 0 | 31,763,021 |
#include <iostream>
int main() {
int n, i;
std::cin >> n >> i;
std::cout << n - i + 1 << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 0 | 95,420,119 |
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <stack>
#include <string>
#include <algorithm>
#include <set>
#include <sstream>
#include <bit>
#include <bitset>
#include <cstdint>
#include <iomanip>
#include <queue>
#include <initializer_list>
#include <stdio.h>
typedef long long int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string x,y;
cin>>x>>y;
int l=x.length(),m=y.length(),j;
if(l<m) cout<<"LESS"<<endl;
else if(l>m) cout<<"GREATER"<<endl;
else{
for(j=0;j<l;j++){
if(x.at(j)<y.at(j)){
cout<<"LESS"<<endl;
break;
}
else if(x.at(j)>y.a... | 0 | 57,278,630 |
#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;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b){
if( a < b ) swap(a,b);
if(a%b == 0) return b;
else return gcd(b,a%b);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a[i];
in... | 0 | 91,477,962 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<string> divide={"maerd","remaerd","esare","resare"};
reverse(S.begin(),S.end());
bool can=true;
for(int i=0;i<S.size();){
bool can2=false;
for(int j=0;j<4;j++){
string d=divide.at(j);
if(S.substr(i,d.size... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K; cin >> N >> K;
vector<ll> P(N), C(N);
for (auto& x: P) cin >> x, x--;
for (auto& x: C) cin >> x;
ll res = -1e18;
for (int i = 0; i < N; i++) {
vector<ll> sum;
ll t = 0;
int idx = i;
do {
t += C[idx... | 0 | 44,038,790 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(void)
{
int n;
char sti[21];
scanf("%s",sti);
n=strlen(sti);
for(int i=n-1;i>=0;i--){
cout<<sti[i];
}
cout<<"\n";
} | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int q;
ll solve(ll a,ll b){
ll ans;
ll s=ll(sqrt(a*b));
ans=2*s-1;
if(s*(s+1)>=a*b)ans--;
if(s*... | 0 | 9,594,471 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
ll n = 0, k;
bool result = true;
while(n < S.length() && result) {
ll k = S.length() - n;
if(k >= 5) {
string sClip = S.substr(n, 5);
if(sClip == "dream") {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
ll gcdf(ll a, ll b)
{
if(a < b) swap(a,b);
while(a%b){
ll tmp = a%b;
a = b;
b = tmp;
}
return b;
}
int main()
{
ll i,j;
ll n,k;
... | 0 | 87,479,960 |
#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 r, d, x;
int tmp;
cin >> r >> d >> x;
rep(i, 10) {
int tmp = x;
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 0 | 1,123,474 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 72,451,137 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define vi vector<int>
#define pb push_back
#define i197 1000000007
#define MAX_N 200002
using namespace ... | 0 | 69,404,336 |
#include <cstdio>
#include <cmath>
long Parent(long i) {
return (long)floor((double)i / 2.0);
}
long Left(long i) {
return 2 * i;
}
long Right(long i) {
return (2 * i + 1);
}
int main() {
int H;
scanf("%d", &H);
long A[H];
for (int i=0; i<H; i++) scanf("%ld", &A[i]);
for (int i=0; i<H; i... | #include<iostream>
#include<list>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
list<int> L;
int n;
cin >> n;
pair<string,int> u;
for(int i=0;i<n;i++) {
cin >> u.first;
if (u.first[0] == 'i')
{
cin >> u.second;
L.push_front(u.second);
}
else if (u.first[6] == 'F')
{L.pop_front(... | 0 | 386,106 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int m=1e9;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
t=1;
while(t--)
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n<=k)
{
cout<<n*x<<endl;
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -... | 0 | 96,290,060 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <iostream>
using namespace std;
int main(){
int start,end,number;
cin >> start >> end >> number ;
int counter=0;
for(int i=start ; i<=end ; i++ ){
if(number%i==0)
counter++;
}
cout << counter << endl;
return 0;
} | 0 | 376,307 |
#include <bits/stdc++.h>
using namespace std;
long long k;
int main()
{
cin >>k;
printf("%d\n",50);
long long t1=k%50,t2=k/50;
for(int i=1;i<=t1;i++)
printf("%lld ",t2-t1+51+49);
for(int i=t1+1;i<=50;i++)
printf("%lld ",t2-t1+49); puts("");
return 0;
} | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | 0 | 36,720,513 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> v1;
int main(){
int n,p,q;
int i,j,k;
int a,b,c;
int s=0;
while(cin>>n>>p>>q){
if(!n)break;
p--,q--;
v1.clear();
for(i=0;i<n;i++){
cin>>a;
v1.push_back(a);
}
sort(v1.rbegin(),v1.rend());
a=0;
for(i=p;i<=q... | 0 | 75,913,149 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int dp[100001];
int main(){
int n;
cin >> n;
f... | #include "bits/stdc++.h"
using namespace std;
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) c.begin(),c.end()
static co... | 0 | 29,265,545 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int ... | #include<iostream>
int main(void){
int H, W;
while(1){
std::cin >> H >> W;
if (H == 0 && W ==0) break;
for (int i = 1; i <= H; i++) {
if (i == 1 || i == H){
for (int j = 1; j <= W; j++) {
std::cout << '#';
}
std::cout << std::endl;
} else {
for (int j = 1; j <= W; j++) {
if (j ... | 0 | 28,346,481 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | #include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
const int P = 1e9+7;
#define fr(i,low,up,st) for(register int i = low;i <= up;i += st)
#define nfr(i,low,up,st) for(register int i = low;i >= up;i -= st)
#define clr(a) memset(a,0,sizeof a)
#define SZ(a) (a.size())
int n,m,k;
char ch[N];
int a[N];
int c... | 0 | 87,800,780 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> v, ans, sum, memo;
map<long long, long long> mp;
void solve();
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
long long x;
cin >> x;
++mp[x];
}
solve();
for(int i = 0; i < n; ++i) cout << ans[i] << endl;
return 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 1e18LL
const ll MAX = 1000000000000000000;
int main(){
int n; cin >> n;
vector<string> w(n);
bool exist = false... | 0 | 12,260,250 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vector<int> ... | 0 | 18,268,086 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include <iostream>
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
while(n !=0 && k !=0){
int a;
int s[100010];
s[0]=0;
for(int i=0;i<n;i++){
cin >> a;
s[i+1]=s[i]+a;
}
int m=0;
... | 0 | 25,540,951 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define gap ' '
#define L(i) ((i) - (&i))
const int MAXN = 1e9+1;
const int MAX = 1e6 + 1;
const int MOD = 1e9;
const int INF = 1e9 + 5;
int main(){
int n,k,s; cin >> n >> k >> s;
vector<int> a;
for(int i = 0; i < k; ++i)
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tup... | 0 | 66,654,475 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 33,262,062 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#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 rev(i,... | #include<stdio.h>
int main(){
int apel,potongan;
scanf("%d %d", &apel, &potongan);
int total=((apel*3)+potongan)/2;
printf("%d\n", total);
return 0;
} | 0 | 82,131,746 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; 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 namespace std;
template<class T> inline bool chmax(T& a,... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int dp[n-1]={0};
dp[0] = 0;
for(int i=1;i<n;i++){
dp[i] = INT_MAX;
int step_1, step_2;
if(i-1 >= 0){
dp[i] = min(dp[i], dp[i-1] + abs(a[i]-a[i-1]));
}
if(i... | 0 | 76,266,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
in... | #include "bits/stdc++.h"
using namespace std;
#define FI freopen("input.txt", "r", stdin)
#define FO freopen("output.txt", "w", stdout)
#define FasterIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
typedef long long ll;
typedef uns... | 0 | 91,492,240 |
#include <iostream>
using namespace std;
int main()
{
int A , B, C;
cin>>A>>B>>C;
if ( A != B && A!=C){
cout<< A<< endl;
}
else if (B!=A && B!=C){
cout<<B<< endl;
}
else {
cout << C<< endl;
}
return 0;
} | #include <bits/stdc++.h>
char key[10][6] = {
{},
{5, '.', ',', '!', '?', ' '},
{3, 'a', 'b', 'c'},
{3, 'd', 'e', 'f'},
{3, 'g', 'h', 'i'},
{3, 'j', 'k', 'l'},
{3, 'm', 'n', 'o'},
{4, 'p', 'q', 'r', 's'},
{3, 't', 'u', 'v'},
{4, 'w', 'x', 'y', 'z'}
};
int main(){
int N;
std::cin >> N;
while(N)... | 0 | 16,780,157 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int i = 0; i < N; i++){
cin >> x[i];
}
int hantei;
for(int i = 0; i < M; i++){
cin >> y[i];
}
for(int i = X + 1; i <= Y; i++){
hantei = 1;
for(int j = 0; j... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <... | 0 | 67,270,185 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<int>());
if (s < t)
{
cout << "Yes" << endl;
}
else
{
cout << "No... | #pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n, a[maxn];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) c... | 0 | 76,961,795 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
vector<int> L;
int N, A, B, C;
const int INF = 1 << 30;
int rec(int index, int a, int b, int c)
{
if (N == index)
{
if (!a || !b || !c)
{
... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll gcd(ll a, l... | 0 | 13,135,150 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
int main(){
long long N,T;
cin >> N >> T;
vector<long long> t(N,0);
long long sum=0;
for(long long i=0;i<N;i++){
cin >> t[i];
if(i==0){
sum+=0;
}
if(i>=1){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,int>>ans;
if(n%2==1){
for(int l=1,r=n-1;l<r;l++,r--){
ans.emplace_back(l,r);
}
}else{
bool flag=false;
for(int l=1,r=n-1;l<r;l++,r--){
if(!flag && r-l<=n/2){
--r;
flag=true... | 0 | 6,244,755 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<string> str;
vector<string> sn;
for(int i=0; i<n; i++){
string s;
cin >> s;
str.push_back(s);
sn.push_back(s);
... | 0 | 49,635,043 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e13;
int main()
{
ll N, K;
cin >> N >> K;
vector<vector<ll>> s(N);
for (int i = 0; i < N; i++)
{
ll t, d;
cin >> t >> d;
t--;
s[t].push_back(d);
}
for (auto &v : s)
{
sort(v.begin(), v.end(), greater<ll>());
if (v.em... | #include <iostream>
#include <math.h>
#include <stdio.h>
#define PI 3.1415926535897932384626433832795028841971
using namespace std;
int main(){
long long max,min,sum,sum2,num;
max = -1000001;
min = 1000001;
sum = 0;
sum2 = 0;
cin >> num;
for(int ii=0;ii<num;ii++){
int val;
c... | 0 | 81,221,332 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
ty... | #include <bits/stdc++.h>
using namespace std;
struct StronglyConnectedComponents
{
vector< vector< int > > gg, rg;
vector< pair< int, int > > edges;
vector< int > comp, order, used;
StronglyConnectedComponents(size_t v) : gg(v), rg(v), comp(v, -1), used(v, 0) {}
void add_edge(int x, int y)
{
gg[x].push_... | 0 | 81,555,889 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int m = 0, f = 1, table[] = {1, 1};
string rep;
cout << "0\n"; cin >> rep;
if(rep == "Female") table[0] = f, table[1] = m;
else if(rep == "Male") table[0] = m, table[1] = f;
else return 0;
int s = 0, t = n;
for(int i=0; i<5... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | 0 | 8,640,456 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
int n = s.size();
bool ans = false;
rep(i, n){
rep(j, n){
if(j < i) continue;
if(s.substr(0, i)+s.substr(j) == "keyence") ans = true;
}
}
if(ans) cout << "YES" <<... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 18,622,055 |
#include<iostream>
using namespace std;
int main(void){
int a,b,c = 0;
cin >> a >> b >> c;
int sum = a+b;
if(c > sum){
cout << "No";
}else
{
cout << "Yes";
}
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#includ... | 0 | 15,066,687 |
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas" << endl;
else if (d == 24)
cout << "Christmas Eve" << endl;
... | 0 | 37,738,310 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define INCANT cin.ti... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int fact[9] = { 1, 1, 2, 6, 24, 120, 720, 5040, 40320 };
int order[9];
int n; cin >> n;
int porder = 0, qorder = 0;
for (int i = 0; i <= n; ++i) order[i] = i;
for (int i = 0; i < n; ++i) {
int a; cin >> a;
por... | 0 | 1,343,958 |
#include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
ll sum[N+1];
sum[0] =0;
ll canNotNum =0;
for(int i=0;i<N-1;i++){
sum[i+1] = sum[i] + A[i]... | 0 | 38,120,966 |
#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
bool flag = false;
int begin;
for (begin = S.size() - T.size(); begin >= 0; --begin){
flag = true;
for (int j = 0; j < T.size(); ++j){
if(S[begin + j] != '?' && S[begin + j] != T[j]){
flag =... | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.141592653589793238
#define INF 1050... | 0 | 20,670,988 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for(unsigned i = 0;i < moto;i ++){
S.insert(s[i]);
}
if(S.size() == moto)cout << "yes" << endl;
else cout << "no" << endl;
} | #include<stdio.h>
int main(void)
{
double f,e,x;
int a,b,d,r;
scanf("%d %d",&a,&b);
d=a/b;
r=a%b;
e=a;
x=b;
f=e/x;
printf("%d %d %1f",d,r,f);
return 0;
} | 0 | 16,506,790 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
string s;
cin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | 0 | 90,032,429 |
#include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <vector>
#define REP(i,n) for(long long int i=0;i<n;i++)
#define P 1000000007
using namespace std;
long long int powmp(long long x,long long n){
const long long p = 1000000007;
if(n=... | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
int t[102], v[102];
t[0] = 0;
for(int i = 0; i < n; i++){
cin >> t[i + 1];
t[i + 1] *= 2;
t[i + 1] += t[i];
}
for(int i = 0; i < n; i++){
cin >> v[i];
v[i] *= 2;
... | 0 | 10,589,803 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);... | 0 | 43,644,445 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
while (true) {
cin >> h >> w >> n;
if (h + w == 0) return 0;
int sheet[20][20] = {};
while (n--) {
int x, y;
cin >> x >> y;
sheet[x][y] = 1;
}
int dp[20][20... | #if 0
accept?????????
40?????????????????£???
???????????¨??????????????¢?´¢???????????????????????????
???????????????????????????????????°????????????????????????
31-169584????????????????????????????????¨??£??????????????????????????£????????§????????????????????????????????????
#endif
#include <queue>
#include <ios... | 0 | 58,385,455 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | #include<bits/stdc++.h>
#define sc(x) scanf("%lld",&x)
#define pcase(x) printf("Case %d: ",x++)
#define pn printf("\n")
#define fri(f) for(int i=0;i<f;i++)
#define frj(f) for(int j=0;j<f;j++)
#define reset(x,e) memset(x,e,sizeof(x))
#define all(x) x.begin(),x.end()
#define input... | 0 | 54,390,819 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long LL ;
LL ans, sum, xorr ;
deque<LL> ar ;
void update(int n){
while(true){
if((sum + n) == (xorr ^ n))
break ;
sum -= ar.front() ;
xorr ^= ar.front() ;
ar.pop_front() ;
}
sum += n ;
xorr ^= n ;
ar.push_back(n) ;
ans += (LL)ar.size() ;
... | #define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vec... | 0 | 70,168,517 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int a, b;
cin >> a >> b;
if (a+b == 15) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {... | 0 | 5,874,769 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,X;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,k;
cin >> n >> k;
ll v[n];
for(ll i=0;i<n;i++) cin >> v[i];
ll res=0;
for(ll a=0;a<=min(n,k);a++){
for(ll b=0;b+a<=min(n,k);b++){
ll cur=0;
vector<ll> vec;
for(ll i=0... | 0 | 97,595,598 |
#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)
#define all(x) (x).begin(),(x).end()
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) { ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 55,072,734 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n)... | 0 | 83,965,352 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greate... | #include <iostream>
using namespace std;
bool f(int i){
int dgt=0;
while (i) {
dgt++;
i/=10;
}
return dgt%2==1;
}
int main(int argc, const char * argv[]) {
int n;
cin>>n;
int ans=0;
for(int i=1;i<=n;i++){
if(f(i)==true) ans++;
}
cout<<ans<<endl;
retur... | 0 | 78,434,313 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) (ll) a... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <bitset>
#include <utility>
#include <cstring>
#include <numeric>
using namespace ... | 0 | 70,235,453 |
#include <iostream>
#include <cmath>
#include <cassert>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
typedef long long ll;
const ll INF = (ll)1e18 + 1;
ll H, W;
void print(){ std::cout << std::endl; }
template <typename Head> void print(Head&& head) { std::cout << head << std::endl; }
templat... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "---... | 0 | 16,189,881 |
#include<iostream>
using namespace std;
int main(){
int f=0,s=0,t=0,num,tmp;
for(int i=0;i<10;i++){
cin>>num;
if(num>t){
t=num;
}
if(t>s){
tmp=s;
s=t;
t=tmp;
}
if(s>f){
tmp=f;
f=s;
s=tmp;
}
}
cout << f << endl << s << endl << t << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int X, Y, Z, K;
scanf("%d", &X);
scanf("%... | 0 | 63,437,536 |
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else... | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.length()>b.length()){
cout << "GREATER" << endl;
}else if(a.length()<b.length()){
cout << "LESS" << endl;
}else{
for(int i = 0; i < a.length(); i++){
if(a[i]>b[i]){
... | 0 | 39,151,078 |
#include<iostream>
#include<cstdio>
using namespace std;
int parent(int num)
{
return num / 2;
}
int left(int num)
{
return num * 2;
}
int right(int num)
{
return num * 2 + 1;
}
int main()
{
int A[100000];
int N;
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= N; i++) {
... | #include <iostream>
#include <bitset>
#include <vector>
using namespace std;
int n, k;
int a[5000];
bitset<5001> DP[5001];
bitset<5001> DQ[5001];
void pre() {
DP[0][0] = true;
DQ[0][0] = true;
for (int i = 0; i < n; ++i) {
DP[i + 1] = DP[i] | (DP[i] << a[i]);
DQ[i + 1] = DQ[i] | (DQ[i] << a[n - 1 - i]);
... | 0 | 34,983,989 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #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... | 0 | 79,950,776 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string S;
cin >> S;
if(S=="zyxwvutsrqponmlkjihgfedcba"){
cout <<-1<<endl;
return 0;
}
vector<bool> used(26,false);
for(int i=0;i<S.size();i++){
used[S[i]-'a'] = true;
}
for(int i=0;i<26... | 0 | 17,254,864 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector < string > S(n);
for (int i = 0; i < n; i++) {
cin >> S[i];
}
vector < vector < int >>cnt(26, vector < int >(n));
for (int i = 0; i < n; i++) {
for (size_t j = 0; j < S[i].size(); j++) {
cnt[S[i][j] - 'a'][i]++;
}
}
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define FOR(i, a, b) for (ll i = (a), i < (N): i++)
#define all(A) (A).begin(), (A).end()
int main(){
int N;
cin >> N;
int V[N];
re... | 0 | 62,306,963 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,m;
cin>>n>>m;
vector<pair<int64_t, int64_t> > student_pos(n);
for(int i=0;i<n;i++){
cin>>student_pos.at(i).first>>student_pos.at(i).second;
}
vector<pair<int64_t, int64_t> > checkpoint_pos(m);
for(int i=0;i<m;i++){
cin>>checkpoin... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define A... | 0 | 7,329,622 |
#include <iostream>
using namespace std;
using ll = long long;
const int K = 1e5 + 10;
const int mod = 1e9 + 7;
ll dp[K];
ll qmi(int m, int k, int p) {
ll res = 1 % p, t = m;
while (k) {
if (k & 1) res = res * t % p;
t = t * t % p;
k >>= 1;
}
return res;
}
int main(){
ios::sy... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 88,133,083 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | #include <bits/stdc++.h>
using namespace std;
struct TopologicalGraph
{
vector< vector<int> > graph;
vector<int> order;
TopologicalGraph(int sz):graph(sz){}
TopologicalGraph(vector< vector<int> > graph):graph(graph){}
void add_edge(int from, int to)
{
graph[from].push_back(to);
}
bool visit(int u, v... | 0 | 59,335,552 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
lint a,b,c,k; cin>>a>>b>>c>>k;
cout<<(k%2==0?a-b:b-a)<<'\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
int main (){
int n;
cin >> n;
int ans=1;
while(n>=ans*2){
ans*=2;
}
cout << ans << endl;
return 0;
} | 0 | 76,901,226 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a,b;
char c;
cin >> a >> ... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
if(n>=1 && n<=100)
{
int a[n];
int flag = 1;
for(int i=0; i<n; i++)
{
cin >> a[i];
if(a[i]<-100 || a[i]>100)flag = 0;
}
if(flag)
{
... | 0 | 95,599,190 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 4,099,420 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
using namespace std;
int inf = 0x3f3f3f3f;
int maps[50][50];
void floyd(int k,int n)
{
for(int t =k; t<=n; t++)
for(int i = k; i<=n; i++)
for(int j = k; j<=n; j++)
if(map... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 11,046,000 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n, x, y;
char s[500];
cin >> s;
n = strlen(s);
x = n;
while(1)
{
x = x - 2;
y = strncmp((s), (s+(x/2)), (x/2));
if(y==0)
{
cout << x << endl;
break;
... | #include <iostream>
#include <string>
#include <vector>
int main()
{
std::string str,exstr;
while(std::cin >> str){
if(str == "-"){
break;
}
int exnum,b;
std::cin >> exnum;
std::vector<int> num;
num.clear();
for(int a = 0;a < exnum;a++){
std::cin >> b;
num.pus... | 0 | 23,591,378 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> gr[N];
int slt, cnt[5], mark[N];
long long ans;
bool z;
void dfs(int v, int rang = 1) {
mark[v] = rang;
for (auto u : gr[v]) {
if (!mark[u])
dfs(u, 3 - rang);
else {
if (mark[u] == mark[v])
z = true;
}
}
}
int main() {... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
const ll MAX_N=1e6+10,INF=99999999;
ll n,a[MAX_N],s[MAX_N],from[MAX_N],to[MAX_N],w[MAX_N];
vector<int> adj[MAX_N];
void dfs(int v,int p){
for(int k:adj[v]){
int u=from[k]^to[k]^v;
... | 0 | 91,228,634 |
#include <iostream>
#include <string>
#include <map>
#include <cmath>
using namespace std;
long long fact(long long x, int life) {
if (life == 0)
return 1;
else if (x == 1)
return 1;
else
return (x * fact(x - 1, life - 1)) % 1000000007;
}
int main(int argc, char* argv[]) {
int N;
cin >> N;
strin... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, right = 0, sum = 0, ans = 0;
cin >> N;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++)... | 0 | 20,748,805 |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 1e5 + 5;
ll a[maxn];
int n;
ll L;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin... | 0 | 80,308,811 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
string S;
cin >> N >> S;
const long long MOD = 1000000000 + 7;
vector<long long> v( 26 );
for( int i = 0; i < N; i++ ) {
int n = S[i] - 'a';
v[n]++;
}
long long ans = 1;
for( int i = 0; i < 26; i++ ) {
if( v[i] == 0 ) continue;
ans *= v[... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[... | 0 | 33,828,052 |
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rrep(i,a,b) for(int i = a ; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#define nl "\n"
#define debug2(x, y) cout << #x << " ... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 29,324,411 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a[6],c1=0,c2=0,c3=0,c4=0;
for(int i=0;i<6;i++){
cin>>a[i];
if(a[i]==1) c1++;
else if(a[i]==2) c2++;
else if(a[i]==3) c3++;
else c4++;
}
if((c1>2||c2>2)||(c3>2||c4>2)) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
for(int i = 0; i < n; ++i){
cin >> w[i];
}
int res = 1000000;
int c1,c2;
for(int i = 0; i < n; ++i){
c1 = 0;
c2 = 0;
for(int j = 0; j < n; ++j){
if(j <= i){
c1 += w[j];
}else{... | 0 | 94,706,072 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int d;
cin >> d;
cout << ((d > 24) ? "Christmas\n" : (d > 23) ? "Christmas Eve\n" : (d > 22) ? "Christmas Eve Eve\n" : "Christmas Eve Eve Eve\n... | #include<iostream>
int main(){
int m,f,r;
std::string c;
while(1){
std::cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
if(m==-1 || f==-1){
c= "F";
}else if(m+f>=80) {
c="A";
}else if(m+f>=65) {
c="B";
}else if(m+f>=5... | 0 | 58,330,753 |
#include<iostream>
using namespace std;
int main(){
int f[3]={1,1,1},n;
cin >> n;
while(1<n--){
f[2]=f[0]+f[1];
f[0]=f[1];
f[1]=f[2];
}
cout<<f[2]<<endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<numeric>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
#define MOD 1000000007
int main(){
long long n,m;
cin ... | 0 | 64,396,129 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn= 5e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int n,k;
int main(){
cin>>n>>k;
int even=0,... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int... | 0 | 57,301,562 |
#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define DBG(x) cerr << #x << ": " << (x) << " (L" << __LINE__ << ")" << endl;
#define FOR(i, n) for (auto i : (n))
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
void setmin(int& a, int b) {
if (a > b) a = b;
}
const int INF = 1... | #include<bits/stdc++.h>
#define mod 1000000009
#define int long long
#define garou ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int pow(int p,int r){
int ans=1;
while(r>0){
if(r&1){
ans=((ans%mod)*(p%mod))%mod;
}
r=r>>1;
p=((p%mod)*(p%mod))%mod;
}
return ans;
}
signed main(... | 0 | 49,097,505 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int lld;
const lld mod = 1e9+7;
const lld INF = 1e9;
int fib[45] = {0};
int f(int n)
{
if (n == 0 || n == 1)
{
fib... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const int N = 1e5 + 10;
const ll M = 998244353;
int main() {
ll n, x, m;
cin >> n >> x >> m;
map<ll, int> p... | 0 | 17,276,092 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+5,mod=1e9+7;
int main() {
int n;
cin>>n;
ll ans=0,sum=0;
vector<int> v;
for (ll i = 0; i < n; ++i)
{
ll x;
cin>>x;
sum+=x;
if(x==0){
ans+=sum/2;
sum=0;
}
}
ans+=sum/2;
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#defi... | 0 | 79,050,178 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x) cerr << #x << ... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define fi first
#define se second
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
fio;
string s; cin>>s;
... | 0 | 33,752,766 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 94,694,180 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using P = pair<ld,ld>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v) get... | 0 | 57,038,505 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 10000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using ... | #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 _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | 0 | 93,414,462 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,a,i;
double x=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
x+=(double)1/a;
}
printf("%lf\n",1/x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a[5]={},sum=0,m=0;
for(int i=0;i<5;i++)
{
cin>>a[i];
sum+=((a[i]+9)/10 * 10);
m = max(m,(((a[i]+9)/10 * 10)-a[i]));
}
cout<<sum-m;
return 0;
} | 0 | 85,957,634 |
#include<iostream>
using namespace std;
int main(){
string s1,s2,s3;
cin>>s1>>s2>>s3;
char x = s1[0]-0x20;
char y = s2[0]-0x20;
char z = s3[0]-0x20;
string s = {x,y,z};
cout<<s<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
int h,w,ans=1,ty;
cin>>h>>w;
vector<string>grid(h);
rep(i,h)cin>>grid[i];
rep(i,h)rep(j,w)if(grid[i][j]=='#'){
ty=1;
... | 0 | 39,545,383 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
string s;
ll k,count=0;
cin >> s >> k;
rep(i,100){
if(s[i]=='1') count++;
if(s[i]!='1') break;
}
if(k>count){
rep(i,100){
if(s[i]!='1'){
cout << s[i] << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) ... | 0 | 92,219,361 |
#include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ ";
for(auto v:V)os << v << " "; return os << "]";
}
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ ";
for(auto s:S) os<<s<<" "; return os<<"}";
}
template<class L, cla... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
ll A, B, K;
cin >> A >> B >> K;
if(A > K) {
A = A - K;
} else {
K = K - A;
A = 0;
if (B >... | 0 | 100,312,714 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
#define IOS std::cin.tie(0);std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define v... | 0 | 39,974,480 |
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
ll ans = LLONG_MIN;
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin >> S >> T;
if( S.size() < T.size() ){
cout << "UNRESTORABLE" << endl;
return 0;
}
bool same = true;
string ans = "UNRESTORABLE";
for(int i=0;i<=S.size()-T.size();i++){
for(int j=0;j<T.size();j++){
if( S.at(i+j) !=... | 0 | 55,390,395 |
#include <iostream>
int main(){
int N, K;
std::cin >> N >> K;
int ans = K;
for (int i=0; i<N-1; i++){
ans = ans * (K-1);
}
std::cout << ans << std::endl;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
long long K;
cin >> S;
cin >> K;
long long num1st1 = 0;
long long the1stNon1 = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '1') {
++num1st1;
}
else {
the1stNon1 = S[i... | 0 | 90,553,170 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
char b;
signed main() {
cin >> b;
if (b=='A') cout << 'T' << endl;
else if (b=='T') cout << 'A' << endl;
else if (b... | #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;
int ans = 0;
rep(i, 1000)
{
string t = "000";
int a = i;
rep(j, 3)
{
if (a == 0)
break;
... | 0 | 50,532,857 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
enum {L... | 0 | 86,949,819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.