code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | #include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#d... | 0 | 36,512,260 |
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define each(it,v) for(auto &it : v)
#define All(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
#define Graph vector<vector<int>>
using namespace std;
main()
{
... | 0 | 8,370,881 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
string s,t;
cin >> s >> t;
bool flag = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 89,512,632 |
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
#define pl pair<ll, ll>
#define vl vec... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= ... | 0 | 11,863,943 |
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAX_N 5000
#define MAX_K 5000
int N, K;
ll A[MAX_N];
bool dp[MAX_N][MAX_K];
ll max(ll a, ll b) { return a > b ? a : b; }
bool need(int i) {
for (int n = 0; n < N; n++)
for (int k = 0; k < K; k++)
... | 0 | 89,607,475 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
void chmax(int &a, int b) {
if(a < b... | 0 | 7,723,772 |
#include <stdio.h>
int main() {
char s1[11], s2[11], s3[11];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c\n", s1[0] - 32, s2[0] - 32, s3[0] - 32);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5;
... | 0 | 26,736,801 |
#include <bits/stdc++.h>
using namespace std;
int n,t,tarr[51],total,totalnot;
string s,x,arr[51];
int main(){
cin>>n;
for(int i = 1;i <= n;i++){
cin>>s>>t;
arr[i] = s;
tarr[i] = t;
total = total + t;
}
cin>>x;
for(int i = 1;i <= n;i++){
if(arr[i] != x){
totalnot = totalnot + tarr[i];
}else{
tota... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const int int_inf = 100000000;
const double eps = 1e-9;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a... | 0 | 11,784,984 |
#include<iostream>
using namespace std;
int main()
{
long long n, min=0, max=0, sum=0;
cin >> n;
for(int i=0;i<n;++i){
int j;
cin >> j;
sum += j;
if(i){
if(j>max) max = j;
if(j<min) min = j;
}else{
max = j;
min = j;
}
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
vector<int> fact[N + 1];
int freq[N + 1];
int main() {
for (int i = 1; i <= N; i++)
for (int j = 1; j * i <= N; j++)
fact[i * j].push_back(i);
int n, ans = 0;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
freq[... | 0 | 28,131,675 |
#include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
int x,y,d,r;
double z;
cin>>x>>y;
d=x/y;
r=x%y;
z=double(x)/double(y);
printf("%d %d %.5lf\n", d,r,z);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h, w;
cin >> h >> w;
char grid[h][w];
bool flag = false;
for (int i=0; i<h; i++) for (int j=0; j<w; j++) cin >> grid[i][j];
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if (grid[i][j] == '#'){
... | 0 | 8,984,825 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 10,379,483 |
#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
ll getma(ll x, ll y){
if(y<=x){
return x*y;
}
else{
if( (x+y)%2 == 0){
return (x+y)*(x+y)/4;
}
else{
return (x+y-1)*(x+y+1)/4;
}
}
}
ll solve(ll a, ll b){
if(a>b) retu... | #include<iostream>
using namespace std;
int main(){
while(1){
int grade[3] = {};
for (int i = 0; i < 3; i++){
cin >> grade[i];
}
if (grade[0] == -1 && grade[1] == -1 && grade[2] == -1) break;
if (grade[0] == -1 || grade[1] == -1) cout << "F" << endl;
else ... | 0 | 72,855,446 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
ci... | 0 | 39,399,161 |
#include<iostream>
using namespace std;
int main()
{
float t,x,k;
cin >> t >> x;
k=t/x;
cout << k;
} | #include<stdio.h>
#include<ctype.h>
#include<string.h>
int main(){
char s[100],p[100];
int i,k,n,cnt=0,t=0,lens,lenp;
scanf("%s %s",s,p);
lens=strlen(s);
lenp=strlen(p);
for(i=0;i<lens;i++){
cnt=0;
if(s[i]==p[0]){
cnt++;
for(k=1;k<lenp;k++){
if(p[k]==s[(i+k)%lens]){
cnt... | 0 | 100,152,380 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int now = a[0];
int cou = 0;
int ans = 0;
for(int i = 1; i < n; i++){
if(a[i] == now){
cou++;
}else{
now = a[... | 0 | 86,850,212 |
#include <bits/stdc++.h>
namespace org
{
template <class T>
T make_value()
{
T tmp;
return tmp;
}
template <class T>
T VALUE()
{
T tmp;
std::cin >> tmp;
return tmp;
}
template <class T>
std::vector<T> make_vector(long long size)
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int m,a[N];
ll ans=0;
int top,s[N];
int solve()
{
while(top>1)
{
ans++;
s[top-1]+=s[top];
if(s[top-1]<10) top--;
else
{
s[top]=s[top-1]%10;
s[top-1]=1;
}
... | 0 | 76,675,365 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | #include<iostream>
using namespace std;
int main()
{
int money,count = 0,oturi[1000] = {};
int money2[6] = {500,100,50,10,5,1};
for(int i = 0;i >= 0;i++){
cin >> money;
count++;
if(money == 0)
break;
oturi[i] = 1000 - money;
}
for(int j = 0;j < count;j++){
int maisu = 0;
for(int ... | 0 | 52,839,920 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
... | 0 | 89,221,645 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
ll a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < 1000; i++)
{
int d1 = i/100;
int d2 = (i%100)/10;
int d3 = i%10;
int sel = 0;
for (int i = 0; i < N; i++)
... | 0 | 36,446,774 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
static const int num = 1001;
int lcs(string ch1, string ch2) {
int s = ch1.size();
int t = ch2.size();
ch1.insert(0, " ");
ch2.insert(0, " ");
int c[num][num]... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output1.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | 0 | 28,612,888 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
#define coutc "\033[48;5;196m\033[38;5;15m"
#define endc "\033[0m"
#define endl '\n'
#define M(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) M(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep4(_, x, n, s) for (int _ = x; (s < 0) ? _ > n : _ < n; _ += s)
#def... | 0 | 15,604,343 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
string s;
cin>>s;
rep(i,0,3){
if(s[i]=='1') cout<<9;
else cout<<1;
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
std::deque<string> deq;
string tmp="";
for (int i=0;i<s.size();i++) {
tmp+=s[i];
if (i!=s.size()-1) {
if (s[i]=='>'&&s[i+1]=='<') {
deq.emplace_back(tmp);
tmp="... | 0 | 13,894,563 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
void YN(bool x){
if(x) cout<<"Yes";
else cout<<"No";
}
int main() {
vector<vector<int>> A(3,vector<int>(3));
vector<vector<bool>> S(3,vector<bool>(3,false));
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#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(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, M, tmp, result = 0;
cin >> N;
vecto... | 0 | 74,208,790 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
vector<int> scores(n);
for (int i = 0; i < n; i++) {
cin >> scores[i];
}
sort(scores.begin(), scores.end());
cout <... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int n,par[100000],typ[100000],dep[100000];
vector <int> chi[100000];
int depth(int now){
if(dep[now] != -1)return dep[now];
if(par[now]==-1)return 0;
return depth(par[now])+1;
}
int main(){
cin >> n;
for(int... | 0 | 85,574,902 |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int N,V,P;
long long M;
cin>>N>>M>>V>>P;
long long A[100000],emp[100000];
for(int i=0;i<N;i++) cin>>A[i];
sort(A,A+N);
emp[N-P]=0;
for(int i=N-P-1;i>=0;i--){
emp[i]=A[N-P]-A[i];
emp[i]+=emp[i+1];
}
in... | #include <bits/stdc++.h>
#define eps 1e-3
#define pi acos(-1.0)
#define inf 0x3f
#define INF 0x3f3f3f3f
#define pb push_back
#define debug1 cout<<"&&";
#define debug2 cout<<"**";
#define ms(a, x) memset(a, x, sizeof(a))
#define for0(i, n) for(int i = 0; i < n; ++i)
#define for1(i, n) for(int i = 1; i <= n; ++i)
using n... | 0 | 30,589,110 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
string s, t;
cin >> s >> t;
int cnt = 0;
if (s[0] == t[0])
cnt++;
if (s[1] == t[1])
cnt++;
if (s[2] == t[2])
cnt++;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
usi... | 0 | 38,820,548 |
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,div,rem,fived;
cin>>n;
div=n/100;
rem=n%100;
fived=rem/5;
if(rem%5)
fived++;
if(fived<=div)
cout<<"1"<<endl;
else
co... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 65,529,143 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t=0,s=0;;
string S,T;
cin >> S>>T;
for(int i=0; i<S.length()-T.length()+1; i++){
t=0;
for(int j=0; j<T.length(); j++){
if(S.at(i+j)==T.at(j)) t++;
if(s<t) s=t;
}
}
cout << T.length()-s << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 48,000,293 |
#define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cst... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n,d,x;
cin>>n>>d>>x;
int sum=0;
rep(i,n){
int a;
int b;
cin>>a;
b=1;
while(b<=d){
b+=a;
sum++;
}
}
cout... | 0 | 62,744,416 |
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, m;
cin >> n >> m;
vector<int> ans(n+1);
vector<bool> flag(n+1, true);
vector<vector<int>> g(n+1);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b... | 0 | 15,944,640 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const int MOD = 1e9 + 7;
using namespace std;
... | 0 | 35,040,215 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int N;cin >> N;
vector<int> v(N);
rep(i,N)cin >> v[i];
sort(v.begin(),v.end());
double ans = v[0];
for(int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | 0 | 91,732,273 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int N, A, B; cin >> N >> A >> B;
if ((B-A)%2 == 1) cout << "Borys" << endl;
else cout << "Alice" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define int long long
#define maxn 101
#define maxh 1001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const int dx[4] = {0, 1, -1, 0}, dy[4] = {1, 0, 0, -1};
typedef std::pair<int, int> P;
vec... | 0 | 54,264,987 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se se... | 0 | 98,571,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#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,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
priority_queue<int>q;
for(int i=0;i<n;i++){
int a;
cin>>a;
q.push(a);
}
int a,b,amari;
while(q.size()>0){
if(q.size()==1){
amari=q.top();q.pop();
break;
}else if(q.size()==2){
a=q.top();q.pop... | 0 | 83,578,520 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int min_value = 100000000;
for (int i = 2; i < S.size(); ++i) {
int A, B, C;
A = S.at(i - 2) - '1' + 1;
B = S.at(i - 1) - '1' + 1;
C = S.at(i) - '1' + 1;
int value = A * 100 + B * 10 + C * 1;
min_value = min(m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# 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)... | 0 | 38,180,969 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >>... | 0 | 95,640,856 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <stack>
#include <string>
#include <math.h>
#define MAX 16777216
using namespace std;
bool dct[MAX+1];
int fourToTen(string key){
string::iterator itr;
int number=0;
itr = key.begin();
for(int i=0;;i++){
if(itr == key.end())
return number;
i... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
while (cin >> n && n != 0) {
int *a = new int[n];
int m;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a[i] = t;
}
m = a[0];
for (int j = 0; j < n; ... | 0 | 83,710,042 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
int main() {
int N,K;
cin >> N >> K;
vector<long long int> a(N);
vector<long long int> max_a(N);
f... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 0 | 2,696,748 |
#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;
sort(s.begin(), s.end());
bool bl = false;
if (s[0]==s[1] && s[2]==s[3] && s[0]!=s[2]) bl = true;
if (bl) puts("Yes");
else puts("N... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 65,976,485 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s; cin >> s;
if(s.size()==2 && s[0] == s[1]){
cout << s.size() << endl;
return 0;
}
while(true){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s1,s2,s3;
cin>>s1>>s2;
cin>>a>>b;
cin>>s3;
if(s3.compare(s1)==0){
a--;
}
else if(s3.compare(s2)==0){
b--;
}
if(a<0){
a=0;
}
if(b<0){
b=0;
}
cout<<a<<" "<<b<<en... | 0 | 40,470,058 |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
using namespace std;
int n = 0;
int s = 0;
static int ans;
void check(int atai, int num, int count){
if (num > 9) {
if (atai == s && count == n) {
ans++;
}
return;
}
check(at... | #include<iostream>
using namespace std;
int main(){
int H,W;
bool flag= true;
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
while(flag==true){
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
cout<<"#";
if(1<i&&i<H&&0<j&&j<W){
for(int k=1;k<W-1;k++){
cout<<".";
j=W-1;
}
... | 0 | 69,419,190 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n];
rep(i,n)cin >>a[i];
int ans=a[0];
for(int i=1;i<n;i++){
ans=__gcd(ans,a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,sum;
cin >> n >> m;
sum = 0;
vector<int> vec(n);
for(int i=0;i<n;i++){
cin >> vec.at(i);
}
for(int i=0;i<n;i++){
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
if(sum % (4*m) == 0){
i... | 0 | 30,233,784 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | 0 | 45,717,941 |
#include <iostream>
#include <complex>
#include <cmath>
#include <string>
using namespace std;
typedef complex<double> C;
#define EPS (1e-8)
#define EQ(a,b) (abs((a)-(b)) < EPS)
const string mes[2] = {"YES","NO"};
double cross(C a, C b) {
return a.real()*b.imag() - a.imag()*b.real();
}
bool is_paralelle(C a, C b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
#define pb push_back
#define PI acos(-1.0)
#define EPS 1e-4
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(fal... | 0 | 55,998,968 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
int n, x, y;
int c=0;
while(cin>>n>>x && !(n==0 && x==0)){
int c=0;
for(int i=1; i<=n-2; i++){
for(int j=i; j<=n-1; j++){
for(int k=j; k<=n; k++){
if(!(i==j || j==k || k==i... | 0 | 62,571,081 |
#include <iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,i,max=0;
vector<int> count(100,0);
while(cin>>a){
count[a]++;
}
for(i=1;i<count.size();i++){
if(max<count[i])max=count[i];
}
for(i... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[2002];
int m[2][2002];
int main() {
cin>>n>>a[0]>>a[1];
for (int i=0; i<n; i++) cin>>a[i+2];
for (int i=n+1; i>1; i--) {
m[0][i] = abs(a[i-1] - a[n+1]);
for (int j=n+1; j>i; j--) {
m[0][i] = max(m[1][j], m[0][i]);
}
m[1][i] = abs(a[i... | 0 | 9,720,492 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
using namespace std;
const int64_t MOD = 1e9 + 7;
int n;
vector<vector<int>> M(100, vector<int>(100));
vector<int> d(100), C(100);
static const int INFTY = INT_MAX;
void bfs(int s) {
for (int i = 0; i < n; i++) {
C.at(i) = 0;
d.at(i) = INFTY;
}
C... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
char buf[10]{};
string s;
cin >... | 0 | 85,095,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n;
a = n / 1000;
b = n % 1000 / 100;
c = n % 1000 % 100 / 10;
d = n % 1000 % 100 % 10;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}... | #include <iostream>
using std::cout;
using std::endl;
using std::cin;
int main()
{
int a, b, c;
while (cin >> a >> b >> c) {
if (a < b && b < c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} | 0 | 78,676,216 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using l... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | 0 | 100,215,600 |
#include <iostream>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
cout<<T+S;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5... | 0 | 57,079,678 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=1e5+1e3+7;
int n,a[N],val;
int ab(int x)
{
return x<0?-x:x;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
int k=a[n];
double v=(double)k/2;
val=a... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 0 | 88,766,044 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
int n=s.size();
set<char> chk;
bool c=true;
rep(i,n){
if(chk.count(s.at(i))... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
string s; cin>>s;
vector<pair<int,int>> a(1,{1,0});
for(auto i:s){
if(a.back().first==i-'0') a.back().second++;
else a.push_back({i-'0',1});
}
if(a.back().first==0) a.push_back({1,0});
d... | 0 | 65,651,071 |
#include <bits/stdc++.h>
using namespace std;
#define elif else if
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG(x) cout << (x) << endl
ll n, p;
string s;
ll tmp[10005] = {0};
int main()
{
scanf("%lld %lld", &n, &p);
cin >> s;
tmp[0] = 1;
ll ans = 0;
ll now = 0;
ll times = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll INF = 1e9+7;
int main()
{
int n;
cin >> n;
map<int, int> m;
for(int i = 0; i < n; i++)
{
int a;
cin >> a;
m[a]++;
}
vector<int> v;
for(auto itr = m.begin(); itr != m.end... | 0 | 53,667,711 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int d;
while(cin >> d){
int sum = 0;
for(int x = d; x < 600; x += d) sum += x * x * d;
cout << sum << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
using namespace std;
int main()
{
string phone[10] = {".,!? ... | 0 | 64,893,484 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int ans=n/3;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
void Output(int sum){
if((int)(sum/1000) != 0){
if((int)(sum/1000) != 1){
cout << sum/1000;
}
cout << 'm';
}
sum = sum%1000;
if((int)(sum/100) != 0){
if((int)(sum/100) != 1){
cout << sum/100;
}
cout << 'c';
}
sum = sum%100;
i... | 0 | 87,078,263 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | # include <iostream>
# include <cstring>
using namespace std;
int N;
string S;
long long counting[100005];
long long ans=1;
int order;
int n;
int main()
{
cin>>N;
cin>>S;
for (int i=0; i<N; i++)
{
order=S[i]-'a';
counting[order]++;
}
for (int i=0; i<26; i++)
{
if (cou... | 0 | 80,075,795 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,a,cnt=1;
cin>>n;
rep(i,n){
cin>>a;
if(a==cnt){
cnt++;
}
}
if(cnt==1){
cout<<-1;
... | #include <iostream>
#include <algorithm>
using namespace std;
const int MAXSIZE = 2000005;
int htop = 0;
int Heap[MAXSIZE];
void insert(int x);
int extract(void);
void interact(char command[])
{
switch (command[0])
{
case 'I':
case 'i':
int k;
cin >> k;
insert(k);
break;
case 'E':
case 'e':
cout << ext... | 0 | 98,449,947 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
int s = 111;
for(int i = 1;i<10;i++){
if(s*i >= n){
cout << s*i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
... | 0 | 59,141,756 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(I,0,n){cout<<(I ? " ":"")<<A[I]x;}cout<<endl;
#define pprint(A,y,m,n) rep(J,0,m){print(A[J],y,n);}
const long mod=1e9+7;
const int size=1e5+1;
const long inf=1e14;
int main(){
int N; cin>>N;
int A[N]; map<int... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | 0 | 95,409,792 |
#include <iostream>
int main()
{
long long N, A, B;
std::cin >> N >> A >> B;
std::cout << (N/(A+B))*A + std::min(A, N%(A+B)) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | 0 | 20,481,534 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c <= b) cout << "delicious" << "\n";
else if (c <= b + a) cout << "safe "<< "\n";
else cout << "dangerous" << "\n";
} | #include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | 0 | 41,422,549 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main() {
string s;
cin >> s;
int sSize = s.size() ... | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<ioman... | 0 | 46,414,703 |
#include<bits/stdc++.h>
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define one 1.0
#define inf 1000000000000000000
#define ret return
#define all(vl) vl.begin(),vl.end()
#define sor sort
#define cl clear
#define m_p make_pair
#define sz(a) a.size()
using namespace ... | #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... | 0 | 6,300,977 |
#include <iostream>
using namespace std;
int main (){
int a, b, c;
cin >> a >> b >> c;
if ((b-a)*(c-b) > 0) cout << "Yes" << '\n';
else cout << "No" <<'\n';
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
const lli mod = 1e9+7;
lli n;
string s;
lli modpow(lli a, lli x){
lli ret = 1;
while(x > 0){
if(x&1){
ret *= a;
ret%=mod;
x--;
}else{
a*=a;
a%=mod;
x >>= 1;
}
}
return ret;
}
int main(vo... | 0 | 91,897,466 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
while(cin>>n){
int count=0;
for(int i=0;i<10; i++){
for(int s=0;s<10; s++){
for(int t=0;t<10; t++){
for(int w=0;w<10; w++){
if(i+s+t+w==n)count++;
}
... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 35,751,728 |
#include <iostream>
using namespace std;
int main()
{
int X, T;
cin >> T >> X;
cout << double(T)/double(X);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n'
#define ld long double
#define mid (l+r)/2
typedef pair<int,int> pii;
const int maxn=(1<<18)+5;
int a[maxn];
int ans[maxn],mx[maxn];
int tot;
... | 0 | 2,189,826 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
char c;
cin >> c;
char ans = 'G';
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int num = 1;
for (int i = 0; i < n... | 0 | 64,917,103 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll s;
cin >> s;
ll ans = s;
while(s >= 100)
{
ans = min(ans, ... | #include <string>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll p[64];
void ins(ll x)
{
for (int i = 60; i >= 0; --i)
{
if (x >> i)
{
if (!p[i])
{
p[i] = x;
break;
}
x ^= p[i]... | 0 | 375,987 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define SORT(s) sort((s).begin(), (s).e... | 0 | 36,662,425 |
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int kyu = 8;
for (size_t i = 400;; i += 200) {
if (i <= x && x < i + 200) {
cout << kyu << endl;
return 0;
}
kyu--;
}
} | 0 | 14,564,760 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int N;
cin >> N;
vi a(N), b(N), c(N);
rep(i, N){
cin >> a[i];
}
ll X = 0LL;
rep(i, N) {
cin >> b[i];
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s){return accumulate(s.begin(),s.end(),0);}
void p(vector<int> A){rep(i,A.size()){cout << A[i] << ... | 0 | 83,309,229 |
#include<iostream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
bool cant[20][20];
int a,b,ans;
int main()
{
while(cin >> a >> b,a)
{
for(int i = 0;i < 20;i++)for(int j = 0;j < 20;j++)
{
cant[i][j] = false;
}
ans = 0;
int n;
cin >> n;
for(int i = 0;i < n;i++)
{
int x,y... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 81,774,757 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[0]==s[1] && s[1]==s[2]) cout << "Yes" << endl;
else if(s[1]==s[2] && s[2]==s[3]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define ff first
#define ss second
#define vi vector<ll>
#define mod 1000000007
#define MOD 1000000007
#define full(a) a.begin(),a.end()
#define inf INT_MAX
#define... | 0 | 99,998,059 |
#include <stdio.h>
int main(){
char C;
int z;
scanf("%c", &C);
z= C+1;
printf("%c\n", z);
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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 Graph = vector<vector<int>>;
in... | 0 | 5,717,240 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a+5);
for (int i = 4; i > 0; i--)
cout << a[i] << " ";
cout << a[0] << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
ll INF = 1000000007;
ll mod = 998244353;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0... | 0 | 80,435,339 |
#include<iostream>
using namespace std;
#define ll long long
int N;
ll X;
ll a[50],p[50];
ll fact(int n,ll x){
if(n==0) return 1;
if(x==1) return 0;
if(x<=1+a[n-1]) return fact(n-1,x-1);
if(x==2+a[n-1]) return p[n-1]+1;
if(x<=2*a[n-1]+2) return p[n-1]+1+fact(n-1,x-a[n-1]-2);
if(x==2*a[n-1]+3) return p[n-1]*... | #include<bits/stdc++.h>
using namespace std;
#define ll long int
int main()
{
string s;
cin>>s;
ll l=s.length();
ll i=0, j=l-1;
ll cnt=0;
while(j-i>=0)
{
if(s[i]==s[j])
{
i++;
j--;
}
else if(s[i]=='x')
{
i++;
... | 0 | 24,288,643 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
typedef pair<ll,ll> pll;
const int N = 1e2+2;
const int INF = 1e9;
int n, m;
int dr[2] = {0,1};
int dc[2] = {1,0};
int dp[N... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool canstop=false;
vector<int> a(N);
for(int i=0;i<N;i++) cin >> a.at(i);
int now=0,cnt=0;
for(int i=0;i<N;i++){
if(now!=1){
now = a.at(now)-1;
cnt++;
}
else{
... | 0 | 7,277,582 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char d[5] = { '.', ',', '!', '?', ' ' };
int m[10] = { 5, 3, 3, 3, 3, 3, 4, 3, 4 };
int h[10] = { 0, 0, 3, 6, 9, 12, 15, 19, 22 };
long long int n;
cin >> n;
for ( long long int i = 0; i < n; i++ ) {
string in;
cin >> in;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define deb(x) cerr << "\n" \
<< #x << ... | 0 | 80,616,116 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 89,285,024 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ; ... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 88,185,908 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < ... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >>n;
vector<int> a(n);
rep(i,n) {
cin>>a.at(i);
}
vector<int> b(n);
vector<int> c(n);
rep(i,n) {
b.at(i) = a.at(i)+1;
c.at(i) = a.at(i)-1;
... | 0 | 53,950,051 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
char s;
cin>>s;
if(s == 'A'){
cout<<"T"<<endl;
} else if(s == 'T'){
cout<<'A'<<endl;
}else if(s == 'G'){
cout<<"C"<<endl;
}else{
cout<<"G"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | 0 | 46,709,501 |
#include <iostream>
using namespace std;
int main() {
for (int l = 1; l < 10; l++) {
for (int r = 1; r < 10; r++) {
cout << l << 'x' << r << '=' << l * r << endl;
}
}
return 0;
} | #include <cstdio>
#include <cstring>
typedef long long int64;
static const int MAXD = 10;
int N;
int pow10[MAXD];
inline bool query(int64 n)
{
static char r[20];
printf("? %lld\n", n); fflush(stdout);
scanf("%s", r);
return r[0] == 'Y';
}
bool result[MAXD];
int main()
{
pow10[0] = 1;
for (int i ... | 0 | 44,101,022 |
#include<iostream>
#include<string>
#include<cstdio>
#include <cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#i... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define base 196471
int n;
int main() {
cin >> n;
int Y, M, D;
vector<int> ans;
while (n--) {
int tmp = 0;
cin >> Y >> M >> D;
tmp += (Y % 3 && !(M % 2)) ? 20 - D : 21 - D;
for (int i = M+1; i <= 10; ++i) {
tmp ... | 0 | 92,511,588 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e6+5;
vector<ll> V;
int pre[maxn];
int main() {
ll n;cin>>n;
cout<<n*(n+1)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll &x : a) {
cin >> x;
}
sort(a.begin(), a.end());
v... | 0 | 1,158,821 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
typedef long long LL;
const int MaxN = 1e5;
using namespace std;
int n, K;
int a[MaxN + 5], b[MaxN + 5];
int main()
{
while(~scanf("%d%d", &n, &K)) {
K++;
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
LL ans = 0, now = 0;
f... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll > P;
... | 0 | 83,662,560 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int m, n, i, cnt = 0, sum = 0;
float x;
cin>>n>>m;
int a[n];
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(i = 0; i<n; i++)
{
sum += a[i];
}
x = (1.0/(4.0*m))*sum;
for(i = 0; i<n; i++)
{
if(a[... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<pair<long long,long long>>ab(n);
for(int i=0; i<n; i++){
cin >> ab[i].first >> ab[i].second;
}
sort(ab.begin(),ab.end());
long long ans = 0, tmp=m;
for(int ... | 0 | 31,256,240 |
#include <iostream>
#include <climits>
#include <vector>
class TMinimumMultiplications
{
std::vector<std::vector<int> > FTable;
std::vector<std::pair<int, int> >& FMatrixChain;
int GetMinimum(int Begin, int End);
public:
TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain);
int Get(int Begin, in... | #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 | 72,800,316 |
#include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) ... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
#define rep(i,n) for (ll i = 0; ... | 0 | 29,364,104 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
int n, a[MAXN];
void run(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
int mx = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 11,605,629 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
con... | #include<bits/stdc++.h>
using namespace std;
int main(void){
vector<vector<char> > number(10);
number[1].push_back('.');
number[1].push_back(',');
number[1].push_back('!');
number[1].push_back('?');
number[1].push_back(' ');
number[2].push_back('a');
number[2].push_back('b');
number[... | 0 | 60,667,454 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#de... | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, k, m=1e9+7, cnt[100009], f[100009],ph[100009];
vector<int> v[100009];
ll ans;
ll fastpower(ll b, ll p)
{
if(p == 0)
return 1 ;... | 0 | 33,494,073 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
int n, m; cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
rep(i, n)
{
cin >> a[i];
}
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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; }
int main()... | 0 | 16,893,443 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, X = 1;
cin >> N >> K;
while (X < K && N > 0) {
X *= 2;
N--;
}
cout << X + N * K << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
vector<double>x(N);
vector<string>u(N);
... | 0 | 92,206,654 |
#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 INF = 1001001001;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool ... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n; cin >> n;
int x[102] = {0};
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> x[i]; sum += x[i];
}
int c = sum / n;
int d1 = 0, d2 = 0;
for (int i = 0; i < n; i++)
{
d1 += (c - x[i]) * (c - x[i... | 0 | 94,786,652 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <deque>
using namespace std;
#define endl "\n"
#define ll long long int
#define c(... | 0 | 54,190,380 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int list[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int l; cin >> l;
cout << list[l - 1] << endl;
return 0;} | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
if(n&1)res = res*a%mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
int N;
cin >> N;
... | 0 | 1,310,583 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <c... | #include<iostream>
#include<vector>
#include<string>
#include <queue>
#include<map>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include<set>
using namespace std;
#define _USE_MATH_DEFINES
# define M_PI 3.14159265358979323846
# define MOD 1000000007
#define ll long long int
#define pii pair<ll,... | 0 | 15,536,470 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s,t;
int main()
{
scanf("%d",&n);
cin >> s >> t;
for(int i=n;i >= 0;i--)
if(s.substr(n-i) == t.substr(0,i))
{
printf("%d\n",2*n-i);
return 0;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i#... | 0 | 16,421,866 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.