code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> cost(N);
for(int i = 0; i < N; ++i)
cin >> cost[i];
vector<int> score(N, 0);
while(M--) {
int x; cin >> x;
for(int i = 0; i < N; ++i) {
if(cost[i] <= x) {
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.en... | 0 |
// 解説見たやつ
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T>
void setma... | #include<cstdio>
const int N=1e5+9;
int L[17][N],R[17][N],n,t,q,X[N],ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",X+i);
scanf("%d",&t);
for(int i=1,it=1;i<=n;++i){
while(it<n&&X[it+1]-X[i]<=t)++it;
R[0][i]=it;
}
for(int i=n,it=n;i;--i){
while(it>1&&X[i]-X[it-1]<=t)--it;
L[0][i]=it;
}
... | 0 |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 1e5+5;
ll N, M, i, x, y, f, val[MN], c1, c2, ans, sz;
vector<ll> adj[MN];
void dfs(int n){
for(auto v : adj[n]){
if(val[v]==-1) val[v]=!val[n], dfs(v);
else if(val[v]==val[n]) f=1;
}
}
int main(){
for(scanf("... | 0 |
#include<iostream>
int cnt[100005];
const long long mod = 998244353;
int max_val = 0;
long long ans = 1;
long long mpow(int a, int b) {
if (!a) return 0LL;
if (!b) return 1LL;
return b%2 ? (long long)a * mpow(a, b-1) % mod : mpow((long long)a*a%mod, b/2);
}
int main(void) {
int n;
std::cin >> n;
for (int i = 0... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(long long i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(long long i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rep(i, st, n) for (int i = (st); i < (n); ++i)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll>... | #include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7,INF=1e18;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
ll modInv(ll a)
{
ll res=1;
ll b=mod-2;
while(b)
{
if(b&1)
res=(res*a)%mod;
... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | #include <bits/stdc++.h>
#define rep(i,n) for(i=0;i<n;i++)
#define NIL -1
using namespace std;
typedef struct{
int key;
int right;
int left;
int parent;
}node;
void insert(vector<node> &T, int i, int *root) {
int x=*root, y = NIL;
while(x != NIL){
y = x;
T[i].key<T[x].key?x=T... | 1 |
#include <stdio.h>
#include<math.h>
#include <algorithm>
using namespace std;
int main(){
int subA[4],subB[2];
for(int i=0; i < 4; i++)scanf("%d",&subA[i]);
for(int i=0; i < 2; i++)scanf("%d",&subB[i]);
for(int i = 1; i <= 3; i++){
for(int k = 3; k >= i; k--){
if(subA[k] > subA[k-1]){
swap(subA[k],subA[... | #include <iostream>
#include <deque>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
int n;
int ans=0;
typedef vector<int> vi;
int main()
{
vi a(4,0);
vi b(2,0);
cin >> a[0] >> a[1] >> a[2] >> a[3];
cin >> b[0] >> b[1];
sort(a.begin(),a.end(... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
while(1){
int n,m;
scanf("%d%d",&n,&m);
if(n == 0 && m == 0) break;
int a[1001] = {0};
for(int i = 1; i <= n; i++){
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
reverse(a+1,a+n+... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int do_stuff(int n)
{
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
int max_so_far = 0;
int max_ending_here = 0;
for (int i = 0; i < n; ++i) {
int curr = a[i];
max_end... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double R;
double G;
cin >> R >> G;
double performance = 2 * G -R;
cout << performance << endl;
} | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1e6 + 100;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
int main(){
long long a, b;
cin >> a >> b;
long long GCD = gcd(a, b);
vector<bool> primes(MAX, true);
primes[0... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <iostream>
#include <bits/stdc++.h>
#define MAX_SIZE 500010
#define INFTY 2000000000
using namespace std;
struct Node {
int key;
Node *parent, *left, *right;
};
Node *root, *NIL;
void insert(int k) {
Node *z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left = NIL;
z->right = NIL;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g;
cin>>r>>g;
cout<<g-r+g<<'\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int first_rate, goal, second_rate;
cin >> first_rate >> goal;
second_rate = 2 * goal - first_rate;
cout << second_rate << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = int(A); I < int(B); ++I)
#define FORR(I,A,B) for(ll I = int((B)-1); I >= int(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(vector<int> v)
{
int n=v.size();
vector<int> l(n,-1);
stack<array<int,2>> s;
s.push({-1,-1});
for(int i=0;i<n;i++)
{
while(s.top()[0]>=v[i]) s.pop();
l[i]=s.top()[1];
s.push({v[i],i});
}
... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <cstring>
#include <cmath>
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define MP make_pair
#define X first
#defi... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int a[100009];
for(int b: {0, 1}){
for(int c: {0, 1}){
a[1] = b;
a[2] = c;
a[0] = (s[1]=='o'?1:0)^b^c;
for(int i=3;i<n;i++){
a[i] = (s[i-1]=='o'?1:0)^a[i-1]^a[i-2];
}
if(... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> v... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define fr(i,k) for(i=0;i<k;i++)
#define deb(x) cerr<<#x<<" = "<<x<<endl;
#define deb2(x,y) cerr<<#x<<" ="<<x<<endl<<#y<<" ="<<y<<endl;
#define SZ(x) (x).size();
#define ll long long
#define mo... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second... | #include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
... | 1 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <u... | #include <bits/stdc++.h>
using namespace std;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void input(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& ro... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
int main(){
map<char, int> m;
m['I'] = 1;m['V'] = 5;m['X'] = 10;m['L'] = 50;
m['C'] = 100;m['D'] = 500;m['M'] = 1000;
string s;
while(cin >> s){
int i = 0, ans = 0;
while(i < s.size()){
char c = s[i];
int t = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int N;
cin >> N;
map<ll, ll> A;
rep(i, N) {
ll tmp;
cin >> tmp;
A[tmp]++;
}
vl st;... | 0 |
#include<iostream>
using namespace std;
int cnt = 0;
int n;
int a[1000000];
int w[500000];
int G[500000];
int m;
int shellsort();
int aho(int g);
int shellsort()
{
m = n / 2;
if (m == 0)
{
m = 1;
}
//cout << m << endl;
for (int i = 0; i < m; i++)
{
if (i == 0)
{
G[0] = m;
}
else
G[i] = G[i - ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <string>
#include <vector>
#include <limits.h>
#include <stack>
#include <queue>
#define maxn 1e9
#define pi acos(-1)
#define LL long long
using namespace std;
double aabs(double x)
{
if(x<0)return -x;
return x;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll n,m;
cin >> n >> m;
ll p[m];
string s[m];
rep(i,m) cin >> p[i] >> s[i];
ll acnum[n+1];
for(ll i = 0; i < m; i++){
if(s[i] == "AC"){
acnum[p[i]] = 1;
... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) f... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string S;
int counter=0;
cin>>S;
for(int i=0;i<3;i++){
if(S[i]=='R'){
counter++;
for(int j=1;j<3;j++){
if(S[i+j]=='R'){
counter++;
if(j==2){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec... | 0 |
// This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <stdio.h>
#include <string.h>
int main()
{
int n;
int runner;
int score;
int out;
char nyuuryoku[114514];
scanf("%d",&n);
for(int i=0;i<n;i++){
runner=0;
score=0;
out=0;
while(out<... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if (i%2) {
if (b%2) {
b--;
a += b/2;
b /= 2;
} ... | 1 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N, K;
cin >> N >> K;
vector<int> D(10, 0);
for(int i=0; i<K; i++) {
int a;
cin >> a;
D[a] = 1;
}
for(int i=N; i<=100000; i++) {
int num = i;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int f[2][7],a[7][2]={
{1,3},
{2,0},
{1,1},
{4,5},
{6,3},
{5,5},
{4,4}
};
int main(){
string s;cin>>s;
int*p=f[0],*q=f[1];
p[0]=1;
for(char c:s){
memset(q,0,sizeof(f[0]));
for(int i=0;i<7;i++)
for(int j=0;j<2;j++)
if(c=='0'+j||c=='?... | #include <bits/stdc++.h>
using namespace std;
#define lor(a,b,c) for(register int a=b;a<=c;++a)
#define ror(a,b,c) for(register int a=c;a>=b;--a)
typedef long long ll;
const int N=3e5+5;
const ll MOD=1e9+7;
char s[N]; int n;
ll f[N][3][3],ans;
inline void inc(ll &a,ll b){
(a+=b)>=MOD?a-=MOD:a;
}
inline void trans(... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<set>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
// person q is stopped by construction i
// S_i <= D_q + X_i < T_i
// S_i - X_i <= D_q < T_i - X_i
// for i of smallest X_i
vector<pair<int, pair<int, int>>> X... | #include<algorithm>
#include<cstring>
#include<cstdio>
#include<cctype>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
using namespace std;
const int N=17,M=40000,INF=1000000000;
int n,m,f[M],q[M],tot,dis[N][N],u,v,c,g[N][M];
int getint()
{
char ch;
int f=1;
while(!isdigit(ch=getchar())) if(ch=='-') f=-1;
int x=ch-... | 0 |
#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 pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
const int mod=1000000007;
int n,m;
int ca,cb;
ll a[1001],b[1001];
set<ll> sa,sb;
int main(){
cin>>n>>m;
bool flag=fal... | #include <cassert>
#include "limits.h"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
const int MAXV = 1000005;
int A[1005][1005];
int ID[1005][1005];
vector<int> to[MAXV];
int toId(int i, int j)
{
if (i > j)
{
swap(i, j);
}
return ID[i][j];
}
vector<int> dp(MAXV, -1);
vector<bool> visited(MAXV, 0);
int dfs(int u)
{
if (visited[u])
{... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" = "<<(x)<<endl
#define debug2(x,y) cout<<"("<<#x<<","<<#y<<") = ("<<(x)<<","<<(y)<<")\n"
using vi = vector<int>;
using vvi = vector<vi>;
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define vmin(v) *min_element(all(v))
#define vmax... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
... | 1 |
#include <iostream>
#include<cmath>
using namespace std;
int main()
{
int n,i;
cin>>n;
double res;
for(i=n; i>=1; i--)
{
res=pow(i,0.5);
if(abs(res-int(res))==0)
{
cout<<i;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int N = 100000;
bool a[100000];
for(int i = 0; i < N; i++){
a[i] = true;
}
a[0] = false;
a[1] = false;
for(int i = 2; i < N; i++){
if(a[i]){
for(int j = i * 2; j < N; j += i){
a[j] ... | #include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),... | 1 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 3009;
int N, T;
int A[MAX_N], B[MAX_N];
int dp[MAX_N][MAX_N];
void solve()
{
vector<pair<int,int>> v;
for(int i=0;i<N;++i) v.emplace_back(A[i],B[i]);
sort(v.begin(),v.end());
for(int i=0;i<N;++i){
int ti = v[i].first, de = v[... | 1 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int D,K;
cin>>K>>D;
//vector<int>ans;
for(int k=K;k>1;k--){
cout<<D-k+1<<" ";
}
cout<<D<<" ";
for(int k=1;k<K;k++){
cout<<D+k<<" ";
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
template<typename T, typename Q>
istream &operator>>(istream &is, pair<T, Q> &p) {
return is >> p.first >> p.second;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)... | 1 |
#include <cstdio>
const int maxn = 1e6 + 10;
int n, fnt, rar, q[maxn], ans, i, j;
char s[maxn], t[maxn];
int main() {
scanf("%d%s%s", &n, s + 1, t + 1);
j = 1;
for (i = 1; i <= n; ++i) {
if(s[i] != t[i]) {
j = 0;
break;
}
}
if(j) {
return !puts("0");
}
j = n + 1;
for (i = n; i; --i) {
if(!(j - ... | //khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const in... | 1 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100000+10;
int n,m,a[maxn],ans[maxn],res[maxn],tmp[maxn];
long long k;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",a+i);
for(int i=1;i<n;++i)ans[i]=... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, A,B;;
cin >> N >> A >> B;
if(N == 1){
cout << "Hello World";
}
else{
cout << A + B;
}
}
| #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, c... | 0 |
#include <iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
ll d;cin>>d;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
vector<ll> r(n);
r[n-1]=n-1;
for(int i=n-2;i>=0;i--){
if(a[r[i+1]]+(r[i+1]-i)*d>a[i]){
r[i]=i;
}else{
r[i]=r[i+1];
}
}
int r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
#define per(i, a, b) for (int (i) = (a); (i) >= (b); --(i))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define ff first
#define ss second
#define sz(x) ((int) x.size())
#... | 0 |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _... | 1 |
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int k=m*2+1;
// first part
for ( int l=1,r=m; l<r; l++,r-- ) {
cout << l << ' ' << r << '\n';
}
for ( int l=m+1,r=k; l<r; l++,r-- ) {
cout << l << ' ' << r << '\n';
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) +... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string cipher;
while (getline(cin, cipher)) {
for (int i = 0; i < 26;i++) {
for (unsigned int n = 0;n < cipher.length();n++) {
if (cipher.at(n) == 'z') {
cipher.at(n) = 'a';
}
else if (cipher.at(n) >= 'a'&&cipher.at(n) <= ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_u... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tiii;
typedef pair<ll, ll> pll;
const int INF = 100000000;
const ll LINF = 1e18+5;
ll A[200000... | #include<iostream>
#include<vector>
using namespace std;
struct Answer
{
int m;
vector<int> G;
int cnt;
};
void insertionSort(vector<int> &A, int &g, int &cnt)
{
for(int i = g; i < A.size(); i++){
int v = A[i];
int j = i - g;
while(j >= 0 && A[j] > v){
A[j+g] = A[j];
j = j - g;
cnt++;
}
A[j+g] ... | 0 |
#include <bits/stdc++.h>
#define TOP 0
#define FRONT 1
#define LEFT 2
#define RIGHT 3
#define BACK 4
#define BOTTOM 5
using namespace std;
//TOP,FRONT,LEFT,RIGHT,BACK,BOTTOM
int dice[6]={1,2,4,3,5,6};
void rotN(){
swap(dice[TOP],dice[FRONT]);
swap(dice[FRONT],dice[BOTTOM]);
swap(dice[BOTTOM],dice[BACK]);
}
voi... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
ll gcd (ll x, ll y){
ll r = x % y ;
if(r == 0) ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int sum = 0;
for (int i = A; i <= B; i++) {
int x = i;
int n1 = x % 10;
x = x / 10;
int n2 = x % 10;
x = x / 10;
//int n3 = x % 10;
x = x / 10;
int n4 = x % 10;
x = x / 10;
int n5 =... | #include <iostream>
using namespace std;
int main()
{
int r;
int g;
//int ans;
cin >> r;
cin >> g;
cout << 2 * g - r << endl;
} | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++... | #include<cstdio>
#include<set>
using namespace std;
set<int> numbers;
int n, k, cards[10], used[10];
void addcard(int x, int y){
if(x == 0){
numbers.insert(y);
}
for(int i = 0;i < n;i++){
if(used[i] == 0){
int shift = 10;
if(cards[i] >= 10)shift *= 10;
used[i] = 1;
addcard(x - 1,... | 0 |
#include<stdio.h>
#define ll long long
int main(){
ll n, rev, i = 0;
scanf("%lld", &n);
char str[100];
while(n){
if(n == 0){
break;
}
n--;
rev = n % 26;
n /= 26;
str[i] = 'a' + rev;
i++;
}
for(ll j = i - 1; j >= 0; j--){
printf("%c", str[j]);
}
puts("");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
string S="";
while(N){
N--;
int A=N%26;
N/=26;
char a='a'+A;
S.push_back(a);
}
reverse(S.begin(),S.end());
cout << S << endl;
} | 1 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 12
char A[SIZE],B[SIZE],C[SIZE];
int main(){
scanf("%s %s %s",A,B,C);
char last_... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct data {
string l;
int p, a, b, c, d, e, f, s, m;
};
int n;
vector<data> v;
bool ch(data l, data r);
void solve();
double calc(data now);
int main() {
while(1) {
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; ++i) {
data now;
cin >>... | #include<bits/stdc++.h>
using namespace std;
pair<int,int> pii;
int main() {
int w,h,n;
int xs,ys;
int xg,yg;
int c,d,x,y;
int v[101][101];
int u[101][101];
int flag=0;
int xx[4]={-1,0,1,0};
int yy[4]={0,1,0,-1};
int xxx,yyy;
while(cin>>w>>h,w||h){
cin>>xs>>ys;
cin>>xg>>yg;
cin>>n;
fill(v[0],v[101],0);
... | 0 |
#include<iostream>
#include<cmath>
#include<iomanip>
#include<string>
#include<vector>
#include<stack>
#include<cstdlib>
#include<queue>
#include<list>
using namespace std;
int main(){
int n, m, b, j, ans=0;
cin>>n;
int a[n+1];
for(int i=0; i<n; i++) cin>>a[i];
cin>>m;
for(int i=0; i<m; i++){
... | #include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <list>
using namespace std;
int main(int argc, char *argv[])
{
vector<int> S;
int q = 0;
int t = 0;
int C = 0;
int n = 0;
int s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin... | 1 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templ... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | 1 |
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<cmath>
#include<cstring>
#include<climits>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
//#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
//... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a), i##_end_ = (b); i <= i##_end_; ++i)
#define drep(i, a, b) for(int i = (a), i##_end_ = (b); i >= i##_end_; --i)
#define clar(a, b) memset((a), (b), sizeof(a))
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long LL;
typedef l... | 1 |
#include <iostream>
using namespace std;
void MySwap(int &a, int &b){
int tmp = a;
a = b;
b = tmp;
}
int partition(int *A, int p, int r){
int x = A[r];
int i = p - 1;
for(int j = p; j < r; j++){
if(A[j] <= x){
MySwap(A[++i], A[j]);
}
}
MySwap(A[++i], A[r]);
return i;
}
int main(){
... | #include <iostream>
#include <utility>
static int isort(long *a, int n, int g) {
int c = 0;
for (int i = g; i < n; ++i) {
long v = a[i];
int j = i - g;
for (; j >= 0 && a[j] > v; j -= g, ++c) {
a[j + g] = a[j];
}
a[j + g] = v;
}
return c;
}
static int ... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N, x, ans=0;
std::cin >> N >> x;
std::vector<int> a(N);
for (int i=0; i<N; ++i){
std::cin >> a.at(i);
}
std::sort(a.begin(), a.end());
for (int i: a) {
x -= i;
if (x < 0){
br... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool pal(int a)
{
return true;
}
int main()
{
int n,m,mn=0,mx;
cin>>n>>m;
mx=n+1;
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
if(a>=mn)
mn=a;
if(b<=mx)
mx=b;
}
if(mn>mx)
cout... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = /*1'000'000'007LL;*/ 998'244'353LL;
#define pb push_back
#define mp make_pa... | 0 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
double a, b, c, d;
while(cin >> a >> b >> c >> d){
double ans = sqrt( (c-a) * (c-a) + (d-b) * (d-b));
printf(... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | 1 |
#include<iostream>
#include<string>
using namespace std;
int Roman_to_Arabia(char c){
if (c == 'I')return 1;
else if (c == 'V')return 5;
else if (c == 'X')return 10;
else if (c == 'L')return 50;
else if (c == 'C')return 100;
else if (c == 'D')return 500;
else if (c == 'M')return 1000;
else return 0;
}
int mai... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <int> vi;
int main(void){
map <char, int> m;
vi x;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
while (true){
string roman;
cin>>roman;
if (cin.eof()) brea... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
int get_int(){int x;scanf("%d",&x);return x;}
typedef long long ll;
const int mod = 998244353;
inline int mul(int x,int y){return 1ll*x*y%... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<cla... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int x = 0;
int y = 0;
cin >> N;
vector<string> blue(N);
for (int i = 0; i < N; i++) {
string s;
cin >> s;
blue.at(i) = s;
}
sort(blue.begin(), blue.end());
reverse(blue.begin(), blue.end());
cin >> M;
vector<st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
cin >> m;
vector<string> t(m);
rep(i, m) cin >> t.at(i);
int ans = 0;
string say;
rep(i, n) {
... | 1 |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int n, x, t;
cin >> n >> x >> t;
int time = 0;
while (n > 0) {
time = time + t;
n = n - x;
}
cout << time;
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
cout << (int)(ceil(1.0*N / X) * T) << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, Q;
cin >> N >> Q;
fenwick_tree<ll> ft(N);
for(ll i = 0; i < N; ++i) {
ll ai;
cin >> ai;
ft.add(i, ai);
}
for(;Q... |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <iterat... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "Yes";
int h, w;
cin >> h >> w;
vector<string> S(h);
for (int i = 0; i < h; ++i)
{
cin >> S[i];
}
int dx... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
rep(i,n)cin>>a[i];
rep(i,k){
vector<int>sum(n);
rep(j,n){
int l=max(0,j-a[j]);
... | 0 |
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define all(v) v.begin(), v.end()
#define rip return;
#define fo(i,a,b) for(int i = a ; a < b ? i <= b : i >= b ; i += (a < b ? 1 : -1))
#define F first
#define S second
#define sz(x) int(x.size())
using nam... | #include<bits/stdc++.h>
using namespace std;
int st[1000003][5];
string q;
int dmc(int g,int k)
{
if(g==q.length())return k;
if(st[g][k]!=1e9)return st[g][k];
int z=1e8;
if(!k)z=min((dmc(g+1,0)+(q[g]-'0')),(dmc(g+1,1)+10-(q[g]-'0')));
else{
z=min(z,dmc(g+1,0)+1+(q[g]-'0'));
z=min(z,d... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n, h[11][11];
while(scanf("%d", &n)){
if(!n)break;
for(int i = 0;i < n;i++){
int num = 0;
for(int j = 0;j < n;j++){
scanf("%d", &h[i][j]);
num += h[i][j];
printf("%5d", h[i][j]);
}
h[i][n] = num;
printf("%5d\n",... | #include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 3e5 + 10;
const int Mod = 1e9 + 7;
void Chkadd(int &x, const int &y) { if ((x += y) >= Mod) x -= Mod; }
char s[maxn];
int F[7], G[7];
int main()
{
int n = fread(s, 1, maxn, stdin);
while (s[n - 1] != '0' && s[n - 1] != '1' && s[n - 1] !... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N,L;
cin >> N >> L;
long long wa=0,sa=10000000000;
for(int i=0; i<N; i++){
long long kaage = L+i;
wa += kaage;
if(abs(sa) > abs(kaage)){
sa = kaage;
}
}
cout << wa-sa << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n, l;
cin >> n >> l;
int r = n + l - 1;
int eat;
if (r <= 0) eat = r;
else if (l >= 0) eat = l;
else eat = 0;
cout << (r + ... | 1 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
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++)
#define rev(i, n) for(int i = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
int main(void)
{
int n;
while(cin >> n && n != 0)
{
vector<int> a(n+1);
a[0] = 1;a[1] = 1;a[2] = 2;
for (int i = 3; i <= n; i++)
a[i] = a[i-1] + a[i-2] + a[i-3];
double year;
year = cei... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
int n;
vector<int> K(100);
string s;
string c="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
while(1){
int l=0;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++) cin>>K[i];
for(int j=n;j<100;j++){
... | 0 |
#include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef p... | #include <bits/stdc++.h>
const int MAXN = 100010;
int xs[MAXN], D, n, Q;
int R[MAXN][20];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i) std::cin >> xs[i];
std::cin >> D >> Q;
for (int i = 1; i <= n; ++i)
R[i][0] = std::upper_bound(xs + 1, xs + 1... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define all(a) a.begin(), a.end()
#define All(a) a.rbegin(), a.rend()
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.precision(10), cout << fixed
//double Time=clock();
int main() {
ios;
int a, b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, k;
cin >> n >> k;
double ans = 0.0, ex = 0.0;
vector<double> p(n);
for(int i=0; i<n; i++){
cin >> p... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(decltype(t) _##i = (t), i = (f); i <= _##i; i++)
#define uptil(f, t, i) for(decltype(t) _##i = (t), i = (f); i < _##i; i++)
#define downto(f, t, i) for(decltype(t) _##i = (t), i = (f); i >= _##i; i--)
... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
int main(){
int n;
cin >> n;
int table[101][101] = {0};
for(int i=0 ; i < n*(n-1)/2 ; i++ ){
int a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--;
int s1, s2;
if( c > d ){
s1 = 3;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
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 print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool vanmo = false;
while(n > 0){
if(n % 10 == 7){
vanmo = true;
}
n = n / 10;
}
if(vanmo){
cout << "Yes";
}else{
cout << "No";
}
return 0;
}
| #include<iostream>
using namespace std;
int main() {
int N; cin >> N;
string s = to_string(N);
int sum = 0;
for (int i = 0; i < s.size(); i++) {
sum += s[i] - '0';
}
if (N % sum == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, m;
while(cin >> n >> m, n || m) {
vector<int> v;
for(int i = 0; i < n; i++) {
int tmp;
cin >> tmp; v.push_back(tmp);
}
sort(v.rbegin(), v.rend());
int res = 0;
for(int i = 0; i < v.size(); i++) {
... | #include<iostream>
using namespace std;
int main(){
int n, i;
while(cin >> n && n != 0) {
int dp[n+1] = {};
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for(i = 4; i <= n; i++) {
dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
}
i = 0;
while(dp[n] > 0) {
dp[n]-=3650;
i++;
}
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
int main(){
int H, W;
cin >> H >> W;
int a[510][510];
rep(i,H){
rep(j,W) cin >> a[i][j];
}
int ans=0;
vector<int> ys, xs, yg, xg;
rep(i,H){
rep(j,W){
if(i==H-1 && j==W-1) break;
if(a[i][j]%2==1){
ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define _dec(i,N,j) for(int i = (N-1);i >= (j);i--)
#define _rec(i,N,j) for(int i = (N);i >=(j);i--)
#define ALL(x) x.begin(),x.end()
#define MEM(a,n) memset(a,n,sizeof(a))
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int n;cin>>n;
int a[n],b[n];
REP(i,n)cin>>a[i];
REP(i,n)cin>>b[i];
int j=0,now=-1;
REP(i,n){
if(now!=a[i])j=0;
if(a[i... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 200010
int n,a[N],b[N],c[N],d[N];
int main(){
cin>>n;
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
rep(i,n+1)c[i]=d[i]=0;
rep(i,n)c[a[i]]++,d[b[i]]++;
rep(i,n+1){
if(c[i]+d[i]>n){
cout<<"No\n";
retur... | 1 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
LLI a, b, x, diff, sum = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
diff = a + b - x;
if( diff <= b )
b -= diff;
else
b = 0;
sum += diff;
}
a = b;
for(int i = 2; i < n; i++)
{
cin >> b;... | #include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n, x;
std::cin >> n >> x;
std::vector<int> arr;
arr.reserve(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr.push_back(tmp);
}
int64_t count = 0;
if (arr[0] + arr[1] ... | 1 |
#include <iostream>
#include <algorithm>
#include <set>
std::set <int> s;
int main()
{
int n;
std::cin >> n;
for(int i = 1;i <= n;i++)
{
int x;
std::cin >> x;
if(s.find(x) != s.end())
{
s.erase(x);
}
else
{
s.insert(x);
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long... | 1 |
#include <bits/stdc++.h>
#define inf 1e9
using namespace std;
int w,h,ans = inf,gx,gy;
int grid[21][21];
int syoki[21][21];
int x[4] = {-1,0,1,0};
int y[4] = {0,1,0,-1};
bool in(int a,int b){
if(a< 0 || b<0 || w<=a || h<=b)return false;
return true;
}
void dfs(int w1,int h1,int count){
// cout<<h1<<" "<<w1<<" ... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long LL;
const int MAXN=400;
LL n, m, ans, cntW, cntB;
bool visited[MAXN][MAXN];
string s[MAXN];
bool avail(int i, int j, char c){
if(i < 0 || i >= n || j < 0 || j >= m) return false;
if(s[i][j] == c) return false;
return tru... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int l[10];
int v1, v2;
char c;
int d;
while(cin >> l[0]){
d=l[0];
for(int i=1;i<10;i++){
cin >> c >> l[i];
d+=l[i];
}
cin >> ... | #include<iostream>
#include<numeric>
#include<cstdio>
int l[10],v,v2;
int main(){
while(true){
for(int i=0;i<10;i++){
if(scanf("%d,",&l[i])==EOF)return 0;
}
if(scanf("%d,%d",&v,&v2)==EOF)return 0;
double k=(double)std::accumulate(l,l+10,0)/(v+v2)*v;
int sum=0;
for(int i=0;i<10;i++){
sum+=l[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
long long ans = 0;
ans += abs(abs(x) - abs(y));
if(x > 0){
if(y > 0 && x > y) ans += 2;
if(y < 0) ans++;
}
if(x < 0){
if(y < 0 && x > y) ans += 2;
if(y > 0) ans++;
}
if(x == 0 && y < 0) ans++;
if(y... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(stri... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(long long H, long long W, long long A, long long B){
rep(i,H-B) {
rep(j,W-A) {
std::cout << 1;
}
rep(j,A) {
std::cout << 0;
}
std::cout << std::endl;
}
rep(i,... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,d,k=1;
long long minx=10000;
cin>>n;
while(1){
d=n/k%1000;
if(d<100){
break;
}
else if(abs(753-d)<minx){
minx=abs(753-d);
}
k*=10;
}
cout<<minx<<... | #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){
string S;
cin>>S;
int len=S.size();
int num;
int ans=1000;
rep(i,len-2){
num=(S[i]-'0')*100+(S[i+1]-'0')*10+S[i+2]-'0';
ans=min(ans,abs(753-num));
}
cout<<ans... | 1 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <math.h>
/********
* ?????¢????±???????????????°??????
*********/
/*********??¢?????´?????????
* (1)??°????????\???
* (2)?¨???????????????????
*********/
int main(void)
{
double answer;
double x1,x2,y1,y2;
cin >> x1 >> y1>> x2 >> y2 ;
answe... | #include <iostream>
using namespace std;
class Dice {
private:
int num[6];
void go2N() {
int tmp = num[0];
num[0] = num[1];
num[1] = num[5];
num[5] = num[4];
num[4] = tmp;
}
void go2S() {
int tmp = num[0];
... | 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v... | 1 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#includ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define tri pair<pll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#define _USE_MATH_DEFINES
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#includ... | 0 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int R;
cin >> R;
if (R < 1200) cout << "ABC" << endl;
else if (R < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string A;
cin >> A;
if(A.at(0)-'0'==7||A.at(1)-'0'==7||A.at(2)-'0'==7) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 |
#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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define pf push_front
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define r... | 1 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n;
cin >> n;
map<ll, int> a;
rep(i, n) {
ll temp;
cin >> temp;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
// input
int N;
vector<int> A;
void input() {
cin >> N;
A = vector<int>(N);
rep(i, N) cin >> A[i];
}
int main() {
input();
set<int> s;
for (int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
ll N; cin >> N;
ll x[N]; rep(i,N) cin >> x[i];
ll M, K; cin >> M >> K;
ll a[M]; rep(i,M) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
const int N=1e5+5;
int a[N],b[N],d[N],p[N],ans[N],vis[N],st[N],tt=0,n,m;ll k;
void dfs(int u){if(!vis[u])vis[u]=1,st[++tt]=u,dfs(p[u]);}
main()
{
scanf("%lld",&n);for(int i=1;i<=n;i++)scanf("%lld",&a[i]),d[i]=a[i]-a[i-1];
scanf("%l... | 1 |
#include <iostream>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
int i, a[10001] = { 0 }, b[10001] = { 0 };
bool list[2][1001] = { false };
if (n == 0 && m == 0) goto END;
for (i = 0; i < m; i++) {
cin >> a[i] >> b[i];
if (a[i] == 1) {
list[0][b[i]] = true;
list[1][b[i]] =... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu_... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 1e5 + 2;
int n, k, p[11], c[11];
ll dp[11][A];
ll solve(int ind, int rem) {
if (rem <= 0) return 0;
if (ind == n) return 1e9;
if (~dp[ind][rem])
retur... | 1 |
#include <bits/stdc++.h>
#include<string>
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
ll n; cin >> n;
ll ans=0;
ll s=n/3;
ll a=n/5;
ll d=n/15;
ans=(1+n)*n/2;
ans=ans-(3+s*3)*s/2-(5+a*5)*a/2+(15+d*15)*d/2;
cout << ans << "\n";
}
| #include <stdio.h>
int main(){
int n;
scanf("%d", &n);
long long int ans=0;
for(int i=1;i<=n;i++){
if(i%3==0 ||i%5==0){
continue;
}
ans +=i;
}
printf("%lld\n", ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int a, b;
string s;
cin >> a >> b >> s;
if(a+b+1 != s.size() || s[a]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
ll a,b;
cin>>a>>b;
string s;
cin>>s;
bool ans=true;
rep(0,i,a)if(!(s[i]>='0'&&s[i]<='9'))ans=false;
if(s[a]!='-')ans=false;
rep(0,i,b)if(!(s[a+1+i]>='0'&&s[a+1+i]<='... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N, mcount=0;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++){
cin >> A[i];
if (A[i]<0){
mcount++;
A[i] *= -1;
}
}
long long ans = 0;
if (mcount%2==0){
for (int i = 0; i < N; i++){
ans +=... | 1 |
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
//#define hacks
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endi... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[1005][1005];
void ExtendedEditDistance(vector<string> s1, vector<string> s2){
const int INF = 1e9;
for(int i=0;i<1005;i++)
for(int j=0;j<1005;j++) dp[i][j] = INF;
dp[0][0] = 0;
int sum1 = 0, sum2;
for(int i=0;i<(in... | 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;
int a, b;
int m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
cout << t + s << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
using namespace std;
class cLSearch
{
int mn, mq;
string mS, mT;
vector<int> vs, vt;
int ans... | #include <cstdio>
#include <vector>
#define rep(i, N) for (int i = 0; i < N; ++i)
using namespace std;
bool linerSearch(vector<int> vec, int key) {
rep(i, vec.size()) if (vec[i] == key) return true;
return false;
}
int main() {
int n, q, key;
scanf("%d", &n);
vector<int> S(n);
rep(i, n) scan... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.