code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n&&n){
vector<int> k(n);
for(int i=0;i<n;++i)
cin>>k[i];
string s;cin>>s;
vector<char> c;
for(int i=0;i<s.size();++i){
c.emplace_back(s.at(i));
int key = k[i%k.size()];
while(key!=0){
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define debug(x) c... | 1 |
#include<bits/stdc++.h>
#define FL "a"
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const int N=2e5+10;
const ll INF=1ll<<60;
inline ll read(){
ll d=0,w=1;char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
if(ch=='-')w=-1,ch=getchar();
while(ch<='9'&&ch>='0')d=d*10+ch-48,ch=getc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 4e18;
struct STNode {
typedef STNode* NP;
NP l, r;
int sz;
ll mi;
STNode(int _sz) : sz(_sz) {
mi = INF;
if (sz == 1) return;
l = new STNode(sz/2);
r = new STNode(sz-sz/2);
}
... | 1 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return ... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n;
string s, t;
int main(void){
cin >> n >> s >> t;
lli ans = 2*n;
rep(i, n){
if(s.substr(i, n-i) == t.substr(0, n-i)){
ans = min(ans, n+i);
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#include<string>
#define fo(i, n) for(ll i = 0; i < n; i++)
#define endl "\n"
#define of(i, n) for(ll i = n - 1; i >= 0; i--)
#define ll long long
#define vec vector<ll>
#define fio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define tr(container, it) \
for(typ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long ... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double x1, y1, x2, y2, x, y, ans;
cin >> x1 >> y1 >> x2 >> y2;
x = x1 - x2;
y = y1 - y2;
ans = sqrt(x*x + y*y);
printf("%f", ans);
return 0;
} | 0 |
/**Lucky Boy**/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxn 200005
#define maxm 1000006
#define maxc 1000000007
#define pii pair <int,int>
#de... | #include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#define ld long double
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, ... | 0 |
#include <bits/stdc++.h>
int main() {
int v[128];
int n;
std::cin >> n;
for(int i = 0; i < n; ++i) {
std::cin >> v[i];
}
for(int i = n-1; i > 0; --i) {
std::cout << v[i] << " ";
}
std::cout << v[0] << std::endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long n,m,sum=0;
cin>>n;
vector<long long> vec;
for(int i=0;i<n;++i){
cin>>m;
vec.push_back(m);
sum+=m;
}
sort(vec.begin(),vec.end());
long long max,min;
max=vec[n-1];
min=vec[0];
cout<<min<<" "<<max<<" "<... | #include<iostream>
int main(void){
int n, min = 1000000, max = -1000000;
long long sum = 0;
std::cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++){
int x;
std::cin >> x;
sum = sum + x;
if (min > x) min = x;
if (max < x) max = x;
}
std::cout << min << " " << max << " " << sum << std::e... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
const int lens = 1e5 + 1;
long long n,m,a[lens],sum[lens];
std::map<long long,long long> map;
int main()
{
std::ios::sync_with_stdio(false);
std::cin >> n >> m;
for(int i = 1;i <= n;i++)
{
std::cin >> a[i];
}
long long ans = 0... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;
struct SccKosaraju {
int n;
vector<vector<int>> g;
vector<vector<int>> rg;
vector<bool> visited;
vector<int> sccno;
int sccCount = 0;
vector<int> s;
SccKosaraju(int... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecisio... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define S... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (100000 * (max(0, 4 - x) + max(0, 4 - y)) + (x == 1 && y == 1 ? 400000 : 0)) << endl;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef pair<int, int> P;
int k, a[100000], dist[100000];
vector<int> v[100000];
vector<P> w;
bool b[100000];
void cal(int x, int y){
dist[x] = y;
b[x] = false;
w.push_back(P(y, x));
for(int i... | #include <bits/stdc++.h>
using namespace std;
vector<int> adjlist[100005];
int mx[100005];
int ans = 0;
int n,k;
void dfs(int u){
mx[u] = 0;
for (auto v : adjlist[u]){
dfs(v);
if (mx[v] == k && u != 1){
ans++;
}
else{
mx[u] = max(mx[u],mx[v]);
}
... | 1 |
#include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits... | #include<bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar(); int cn = 0, flus = 1;
while(cc < '0' || cc > '9') { if( cc == '-' ) flus = -flus; cc = getchar(); }
while(cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 1000 + 5 ;
#def... | 1 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int NUM_BITS = 18;
template<typename T>
vector<vector<T>> Make2DVector(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
// Returns a tuple of (l, u) s.t.
// - ... | #include <bits/stdc++.h>
using namespace std;
int x[100005];
int par1[17][100005], par2[17][100005];
int main(){
int n, l, q;
scanf("%d", &n);
for(int i=1;i<=n;i++) scanf("%d", &x[i]);
scanf("%d%d", &l, &q);
for(int i=1;i<=n-1;i++){
int lo = i+1, hi = n, ans;
while(lo <= hi){
... | 1 |
#include <iostream>
#include <vector>
using namespace std;
using int_vec = vector<int>;
using Iterator = int_vec::iterator;
Iterator partition(Iterator begin, Iterator end, int x) {
for (auto it = begin; it != end; ++it) {
if (*it <= x) {
swap(*begin++, *it);
}
}
return begin-... | #include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<map>
#include<iterator>
#include<cstdlib>
#include<cmath>
using namespace std;
#define MAX 100000
#define SENTINEL 2000000000
int A[MAX],n;
int partition(int p,int r)
{
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)... | #include <cstdio>
#include <algorithm>
using namespace std;
int N, M, p[1001], s[1001 * 1001];
int main(){
while(scanf("%d%d", &N, &M) != EOF && (N|M)){
for(int x = 0; x < N; x++){
scanf("%d", p+x);
}
p[N++] = 0;
for(int x = 0; x < N; x++){
for(int y = 0; y ... | 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() {
int64_t n, m, d;
cin >> n >> m >> d;
double ans;
if (!d) {
double p = (double)n / (n * n);
ans = (double)p * (m - 1);
}
else {
double p = (double)2 * (n - ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string sa;
while(getline(cin,sa)){
for(int j=0;j<26;j++){
int a=sa.size();
for(int i=0;i<a;i++){
if(sa[i]>='a'&&sa[i]<='z'){
sa[i]+=1;
if(sa[i]>'z'){
sa[i]-=26;
}
}
}
size_t z=sa.find("this");
size_t za=sa.find("t... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll income[1010011];
vector<ll>adj[1010011];
map<ll,ll>m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll num;
ll cur=1;
for(ll i=1;i<=n;i++)
{
for(ll j=i+1;j<=n;j++)
{
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 |
#include <bits/stdc++.h>
#if defined(__GNUC__)
#pragma GCC optimize ("Ofast")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.firs... | #include <algorithm>
#include <cctype>
#include <cstring>
#include <cstdio>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 3e2+5;
int n, m, f[N][... | 1 |
#include <cstdio>
#include <cstring>
using namespace std;
int map[22][22];
int st[2],gl[2];
int n,m,ans;
int move[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
void dfs(int x,int y,int z){
if(z>=ans)return;
for(int i=0;i<4;i++){
int xx=x,yy=y;
if(map[x+move[i][0]][y+move[i][1]]!=0&&map[x+move[i][0]][y+mo... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
ll n,t,x; cin>>n>>t;
ll px=-1,ans=0;
for(ll i=0;i<n;i++){
cin>>x;
ans+=t;
if(px!=-1) ans-=max((ll)0,px-x+t);
px=x;
}
cout<<ans;
}
| #include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(){
int n,m;
string S;
int dice[6];
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>S;
for(int i=0;i<S.size();i++){
if(S[i]=='N'){
m=dice[0];
dice[0]=dice[1];
... | 0 |
#include <stdio.h>
#include <limits.h>
#include <math.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << ... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100010,mod=998244353;
const char str[2][10]={"First","Second"};
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read... | 0 |
#include <iostream>
#include <cstring>
using namespace std;
class Dice {
public:
int a1, a2, a3, a4, a5, a6;
string D;
Dice(int x) {
a1 = a2 = a3 = a4 = a5 = a6 = x;
}
void rotateFront() {
int newa1 = a5;
a5 = a6;
a6 = a2;
a2 = a1;
a1 = newa1;
}
void rotateRight(... | //#define _USE_MATH_DEFINES
#include <iostream>
//#include <stdio.h>
//#include <iomanip>
//#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <cmath>
using namespace std;
class Dice
{
public:
Dice(int num[6]);
int Play(char c);
int T;
private:
int NS[4],EW[4];
int NS... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 998244353
int f[12001];
int fi[12001];
int n, k;
int m(int a,int b){
return (a * b)% mod;
}
int fp(int x,int y) {
int res=1;
while(y){
if(y&1) res = res*x%mod;
x=x*x%mod;
y>>=1;
}
return res;
}
int iv(int x){
return fp(x, mod - ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main(){
int N,M; cin >> N >> M;
vector<ll> A(N),B(M);
map<ll,ll> mA,mB;
for(int i = 0; i < N; i++){ cin >> A[i]; mA[A[i]]++;}
for(int j = 0; j < M; j++){ cin >> B[j]; mB[B[j]]++;}
for(auto ne : mA){ i... | 0 |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
using namespace std;
namespace zyt
{
template<typename T>
inline bool read(T &x)
{
char c;
bool f = false;
x = 0;
do
c = getchar();
while (c != EOF && c != '-' && !isdigit(c));
if (c == EOF)
return false;
if (c == '-')
... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 1 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
string s;cin>>s;
int a[n+1],sum[n+1];
memset(a,0,sizeof(a));
memset(sum,0,sizeof(sum));
rep(i,n){
if(s[i]=='W'){
++a[i];
--... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 998244353 //1000000007 // 100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 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 rep(i, n) for... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vect... | 1 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #include<vector>
using namespace std;
int N, Q;
int num[110];
int mnum, mday;
int main(){
while(cin>>N>>Q, N||Q){
for(int i = 0; i < 110; i++)num[i] = 0;
for(int n = 0; n < N; n++){
int M;
cin>>M;
for(int m = 0; m < M; m++){
int tmp;
cin>>tmp;
num[tmp] += 1;
}
}
int i;
mday = 110... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T, typename U>
using pv=vector<pair<T,U>>;
template<typename T>
using matrix=vector<vector<T>>;
template<typename T>
using pque=priority_queue<T>;
template<typename T>
using lpque=priority_queue<T,vector<T>,greater<T>>;
using ll=long long;
using intpair=... |
#include<iostream>
#include<vector>
using namespace std;
int foot(int);
int main() {
int n;
vector<int>floor;
cin >> n;
while (n != 0) {
floor.push_back(n);
cin >> n;
}
floor.push_back(0);
int i = 0;
while (floor[i] != 0) {
int res = 0;
res = foot(floor[i]) / 3650;
if( foot(floor[i]) % 3650... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
string x;
cin >> x;
int n = x.size();
stack<char> s;
int cn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 99824... | 0 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | #include <iostream>
using namespace std;
int main() {
int sx, sy, tx, ty; cin >> sx >> sy >> tx >> ty;
for (int i = 0; i < ty-sy; i++)
cout << 'U';
for (int i = 0; i < tx-sx; i++)
cout << 'R';
for (int i = 0; i < ty-sy; i++)
cout << 'D';
for (int i = 0; i < tx-sx; i++)
... | 1 |
#include <bits/stdc++.h>
#include <cstdlib> //abs()で絶対値を取得する（整数）
#include <cmath> //abs()かfabs()で絶対値を取得する（少数）
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
int n, r;
cin >> n >> r;
if (n >= 10){
cout << r << endl;
}else{
in... | // In The Name Of Allah
#include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define int long long
#define ld lo... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000001;
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#i... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int h, w;
int grid[20][20];
int sx, sy, gx, gy;
bool ok(int x, int y)
{
return x >= 0 && y >= 0 && x < h && y < w;
}
bool search(int d, int x, int y)
{
if (d == 0){
return x == gx && y == gy;
}
for (... | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
int veg[1024];
int sum;
while (1){
sum = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0){
break;
}
for (int i = 0; i < n; i++){
scanf("%d", &veg[i]);
}
sort(veg, veg + n);
reverse(veg, ... | 0 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i... | #include<iostream>
#include<string>
#include<map>
using namespace std;
int main() {
map <char, int> a;
a.insert(map<char, int>::value_type('I', 1));
a.insert(map<char, int>::value_type('V', 5));
a.insert(map<char, int>::value_type('X', 10));
a.insert(map<char, int>::value_type('L', 50));
a.insert(map<char, int>::... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i,j,c,d,an=0,k,mod;
mod=1000000007;
cin>>n;
ll ar[n+2];
for(i=0;i<n;i++)
{
cin>>ar[i];
}
for(i=0;i<60;i++)
{
k=(1LL<<i);
c=0;
d=0;
for(j=0;j<n;j++)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
const int sz = 1e5+5;
int n, m, a[sz];
void solve(){
cin >> n >> m;
for(int i = 0; i < n; ++i) cin >> a[i];
ll ans = 0;
map<int, int> cnt;
cnt[0] = 1;
int sum = 0;
for(int i = 0; i < n; ... | 0 |
//list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int x;
cin >> x;
int c500 = 500;
int c5 = 5;
int ans = (x / 500) * 1000 + ((x % 500) / 5) *5;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
int main() {
vector<int> ab(2);
for (auto &abi: ab) cin >> abi;
int k; cin >> k;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++)
{
cin >> a;
v.push_back(a);
}
reverse(v.begin(), v.end());
for (int i = 0; i < n - 1; i++)
{
cout << v[i] << " ";
}
cout << v[n - ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
string s; cin >> s;
ll length = s.length(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N; cin >> N;
long long x; cin >> x;
vector<long long> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
sort(a.begin(), a.end());
int res = 0;
for (int i = 0; i < N; ++i) {
if (x >= a[i]) +... | 0 |
#include <iostream>
using namespace std;
long gcd(long a, long b){ return b? gcd(b,a%b) : a; }
int main() {
int n,k;
cin >> n >> k;
long GCD;
cin >> GCD;
long _max = GCD;
bool f = k == GCD;
for (int i=1; i<n; i++) {
long a;
cin >> a;
f = f || k==a;
GCD = gc... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ran 1001001
struct Node {
int pre, det, suf;
Node() {}
} info[ran];
int n;
char s[ran];
Node analysis() {
int len = strlen(s);
int h = 0;
int mi = 0;
for(int i=0;i<len;i++) {
if(s[i]=='(') h++;
else h--;
mi = min(mi, h);
}
Node res;
res.pre = -... | #include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
int main(){
int n,i,j,k,p,count=0;
set<int>::iterator it;
vector<int>x,y;
cin>>n;
for(i=0;i<n;i++){
cin>>p;
x.push_back(p);
}
sort(x.begin(),x.end());
for(i=0;i<n;i++){
if(x[i]==x[i+1]){
x[i]=0;
x[i+1]=0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool ok = true;
if (S.size() % 2 == 1) ok = false;
for (int i = 0; i < S.size() / 2; i += 2) {
if (S.substr(i, 2) != "hi") {
ok = false;
}
}
if(ok) cout << "Yes" << endl;
else co... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
if(s[0] != 'A' || isupper(s[1]) || isupper(s[s.size() - 1])){
cout << "WA" << endl;
return 0;
}
bool isFoundC = false;
for(int i = 2; i < s.size() - 1; i++){
if(!isFoundC && s[... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//datatypes
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define si set<int>
#define vii vector<ii>
#define ii pair<int,int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 400;
int h, w;
string s;
int grid[MX][MX];
ll black[MX*MX], white[MX*MX];
bool used[MX][MX];
ll ans;
int curGroup = -1;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void dfs(int x, int y) {
used[x][y] = true;
if (grid[... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, n) for(i... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=1e9+7;
int... | 0 |
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int res = 0;
for (int i = 0; i < 3; ++i) res = (res + 1) * a;
cout << res << endl;
}
| #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void){
int a;
cin >> a;
cout << a+a*a+a*... | 1 |
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int a[100][100];
bool r[100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
cin>>a[i][j];
}
}
priority_queue<pa... | #include<iostream>
using namespace std;
#define N 105
#define INF 1<<21
int n;
int a[N][N];
int d[N],p[N],color[N]; //0.未访问的节点 1.正在访问的节点 2.已经访问过的节点
int prim(){
int u ,minv;
for (int i = 0;i < n;i++){
d[i] = INF;
p[i] = -1;
color[i] = 0;
}
d[0] = 0;
while (1){
minv = INF;
u = -1;
for (... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long double dx,dy,RR,avdist,prt;
cin >>N;
int arrive[N];
vector<vector<long double>> b(N, vector<long double>(2));
vector<vector<long double>> dist(N, vector<long double>(N,0));
for(int i=0;i<N;i++){
arrive[i]=i;
cin... | 1 |
#include <iostream>
#include <unordered_map>
#include <cmath>
void FactrizePrime(int x, std::unordered_map<int, int> &count)
{
while (x % 2 == 0)
{
++count[2];
x /= 2;
}
for (int i = 3; i <= x; i += 2)
{
while (x % i == 0)
{
++count[i];
x /= i... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#defin... | 1 |
#include <iostream>
using namespace std;
long long cnt = 0; //for counting num of invensions
void merge(int *a, int left, int mid, int right) {
int nL = mid - left;
int nR = right - mid;
int L[nL], R[nR];
for(int i=0; i<nL; i++) {
L[i] = a[left + i];
}
for(int i=0; i<nR; i++) {
... | #include <cstdio>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[200000];
int b[200001];
void add(int i, int x){
while(i <= n){
b[i] += x;
i += i & -i;
}
}
int sum(int i){
int s = 0;
wh... | 1 |
#include<bits/stdc++.h>
#define rint register int
#define rep(i,a,b) for (rint i=(a),_E=(b); i<=_E; ++i)
#define per(i,a,b) for (rint i=(a),_E=(b); i>=_E; --i)
#define REP(i,n) for (rint i=(0),_E=(n); i<_E; ++i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pa... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
//#define MOD (998244353)
#define PI ... | 1 |
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e16
typedef long long ll;
int main() {
ll N;
cin >> N;
ll m = ... | #include<iostream>
#include<vector>
using namespace std;
void print(vector<int> &v){
vector<int>::iterator ite = v.begin();
while(ite != v.end()){
cout << *ite << endl;
ite++;
}
}
int insSort(vector<int> &v, int g){
int i, j, x, n = v.size(), cnt = 0;
for(i = g; i < n; i++){
... | 0 |
#include <iostream>
#include <string>
using namespace std;
static const int MAX_LENGTH = 1000;
void nreplace(char *input, int start, int end, char *target);
void nswap(char *input, int start, int end);
void nprint(char *input, int start, int end);
int main(void) {
char *input = new char[MAX_LENGTH+1];
char *... | #include<stdio.h>
int main()
{
int masu[12][12];
int n,i,j,w=0,h=0,t=0;
for(;;h=0,w=0,t=0){
for(i=0;i<11;i++){
for(j=0;j<11;j++){
masu[i][j]=0;
}
}
scanf("%d",&n);
if(n==0)break;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&masu[i][j]);
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++)... | 0 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
int in = 1,res=0;
while (in <b){
in += a - 1;
res += 1;
... | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,K;
cin >> N >> K;
if(N%K) cout << "1\n";
else cout << "0\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
cout<<((N%K)+K-1)/K<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<int> a(n, 0);
vector<ll> ans(n, 0);
ll fee = 0;
for (ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll tmp = 0;
for (ll i = 0; i < n + 1; i++)
{
if (i == n)
{
fee += abs(tmp - 0);
... | #include <iostream>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)
using namespace std;
int main(void){
string ws;
int n;
while(cin >> n){
if... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
const ll INF = (ll)1e11;
const ll MOD = 998244353;
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A;
ll S = 0;
for (int i = 0, a; i < ... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define trav(x,a) for (const auto& x: a)
#define sz(x) (int)(x).size()
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
const int maxm=1e6+5;
int a[maxm];
int n;
signed main(){
cin>>n;
for(int i=1;i<=n*2;i++)cin>>a[i];
int ans=0;
sort(a+1,a+1+n*2);
for(int i=1;i<=n*2;i+=2){
ans+=min(a[i],a[i+1]);
}
cout<<ans<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int n,m;
int s[5];
int c[5];
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
scanf("%d %d",&s[i],&c[i]);
for(int i=0;i<1000;i++)
{
char num[5];
sprintf(num,"%d",i);
// itoa(i,num,10);
if(strlen(num)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<int> ds(N, -1);
bool isExist = true;
rep(i, M) {
int s, c;
cin >> s >> c;
s--;
if (ds[s] == -1) {
... | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | #include <cstring>
#include <cctype>
#include <cstdio>
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 1e2+5;
int max(int a, int b) { return a>b?a:b; }
int min(int a, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
string s;
long long k;
int main(){
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='7')k++;
}
if(k>0)cout<<"Yes";
else cout<<"No";
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() {
string s;
cin >> s;
if(s.at(0)=='7' ||s.at(1)=='7' || s.at(2)=='7') cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 1 |
#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 ... | #include<iostream>
using namespace std;
int main(){
int A,B,h=100,w=100;
char g[100][100];
for(int i=0;i<h*w;i++)g[i/w][i%w]=(i<h*w/2?'#':'.');
cin>>A>>B;
cout<<"100 100"<<endl;
for(int i=0;i<A-1;i++)g[2*(i/50)+1][2*(i%50)]='.';
for(int i=0;i<B-1;i++)g[98-2*(i/50)][2*(i%50)]='#';
for(int... | 1 |
#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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
string s,t;
cin>>N>>s>>t;
long long len1,len2,count=0;
len1=s.length();
len2=t.length();
if(len1==len2&&len1==N&&N>=1&&N<=100){
if (N>=len1+len2){
count=N;
}
else {
count=len1+len2;
for(int i=0;i<=l... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long int cnt=0;
void Merge(int A[],int left,int mid,int right)
{
int n1=mid-left;
int n2=right-mid;
int L[n1+1],R[n2+1];
int i,j;
for(i=0;i<n1;++i)
{
L[i]=A[left+i];
}
for(i=0;i<n2;++i)
{
R[i]=A[mid+i];
}
L[n1]... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 0 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
cout << 2*b - a;
return 0;
} | #include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <typeinfo>
#include <tuple>... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i,n) for(... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
ll x; cin >> x;
ll ans = x/11;
int r = x % 11;
int add = ... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LO... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y)... | #include <bits/stdc++.h>
using namespace std;
int main() {
queue<int> s[5];
char winner;
for(int i=0;i<3;i++) {
string st;
cin>>st;
for(int j=0;j<(int)st.size();j++) s[i].push(st[j]-'a');
}
int now=0;
while(1) {
if(s[now].empty()) {winner=now+65;break;}
int t=s[now].front();
s[now].pop();
now=t;
}
... | 0 |
/*
t.me/ivanesipovvpered
*/
#pragma ARCENIY_KIRILLOV_POVELITEL_KROKODILOV
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("no-stack-protector")
//#pragma GCC push_options
//#pragma GCC op... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N=505;
const int M=4*N;
const int S=10000;
int pr[M],psz;
bool sieve[S];
ll val[N][N];
vector<pair<int,int> > id;
int Find(pair<int,int> x){ return lower_bound(id.begin(),id.end(),x)-id.begin()+1;}
int... | 1 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
int64_t n = s.size();
int64_t ans = 1;
vector<int64_t> nums('z' - 'a' + 1);
for (auto ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 1 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int ma... | #include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int main() {
string s;
cin >> s;
vector <pair <char, int>> ci;
rep (i, s.size()) {
if ((i == 0) || (i != 0 && s[i] != s[i - 1])) ci.emplace_back(s[i], 1);
... | 0 |
#include <iostream>
using namespace std;
void solve(long long N){
cout << N / 3 << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld",&N);
solve(N);
return 0;
}
| #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
string s;
cin >... | 0 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
voi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll S;
ll N = 1;
cin >> S;
while (S/(ll)pow(10,N)) {
//cout << pow(10,N) << endl;
//cout << S/pow(10,N) << endl;
//cout << N << endl;
N++;
}
//cout << N << endl;
ll ans = 1000;
... | 1 |
#include<stdio.h>
int main()
{
int N, count=0, min, i=0;
scanf("%d", &N);
int P[N+5];
while(i != N)
{
scanf("%d", &P[i]);
i++;
}
if(P[0] <= N)
{
count++;
//printf("1st count = %d\n", count);
min = P[0];
}
for(i=1; ... | #include <vector>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long int ll;
double solve(vector<vector<vector<double>>>& dp,vector<vector<vector<bool>>>& memo,int a,int b,int c,int n)
{
if (a<0 || b<0 || c<0) return 0;
if (a==0 && b==0 && c==0) return 0;
if (memo[a][b][c]) return... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> a(n);
for(int i = 0; i < n; i++){
if(s[i] == 'R') a[i] = 0;
if(s[i] == 'G') a[i] = 1;
if(s[i] == 'B') a[i] = 2;
}
vector<ll> cnt(3);
for(int i = 0; i < n; i++){
cn... | 0 |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typenam... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+5;
const int M=(1<<20)+5;
const int p=1e9+7;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0... | 0 |
#include<iostream>
using namespace std;
int main(){
int i,j,h,w,minh,minw;
while(1){
int result;
int resultmin=100000000;
cin >> h >> w;
if(h==0 && w==0)break;
int original = h*h+w*w;
int original_minh = h;
int flag = 0;
for( i = 1;i < 150; i++ ){
for( j = i+1; j <=150;... | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if(a < 10) {
a = 100 * (10 - a);
b = b + a;
printf("%d", b);
} else {
printf("%d", b);
}
return 0;
} | 0 |
#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;
}
}
| /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#d... | 1 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int dp[34];
int main(){
int N,x;
cin >> x;
dp[0] = 1;
for(int i = 0; i < 31; i++){
dp[i+1] += dp[i];
dp[i+2] += dp[i];
dp[i+3] += dp[i];
}
while(x != 0){
cout << dp[x]/3650 +... | #include<iostream>
using namespace std;
int main(){
while(1){
int n;
cin>> n;
if(n==0) break;
int dp[31];
fill(dp, dp+31, 0);
dp[1]=1; dp[2]=2; dp[3]=4;
for(int i=4; i<=n; i++){
dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
}
cout<< (dp[n]+36... | 1 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | #include <bits/stdc++.h>
using namespace std;
void solve(std::string S){
vector<string> yobi = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
for(int i = 0; i < yobi.size(); ++i){
if(yobi[i] == S){
cout << 7 - i << endl;
break;
}
}
}
int main(){
std::string... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#defi... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#define MN 1000000
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
char s[MN+5],t[MN+5];
int last[MN+5][26],a[MN+5],n,... | #include <cstdio>
using namespace std;
#define REP(a,b,c) for(int a=b;a<=c;++a)
#define RREP(a,b,c) for(int a=b;a>=c;--a)
char s[1000005],t[1000005];
int n,x[1000005],l,r,ans,q,j;
int main() {
scanf("%d%s%s",&n,s+1,t+1);
j=n; l=1; r=0; ans=0; q=0;
RREP(i,n,1) {
if(j>i) --j;
if(s[j]==t[i]) continue;
while(j&&... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if(N == 1) cout << "Hello World" << endl;
else {
cin >> A >> B;
cout << A+B << endl;
}
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a... | 1 |
#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;
const int INF = 1e9;
const ll MOD = 1000000007;
const string V = "Vacant";
int main() {
ll N;
cin >> N;
string l, r;
cout << 0 << endl << flush;
cin >> l;
cout <... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
long long Comb(in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N, a, H = 0, W = 0;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
sort(A.begin(), A.end());
for(int i=N-1; i>=1; i--) {
if(A[i] == A[i-1]) {
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<T> &v){
for... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author rahdirigs
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void s_max(T& a, T b) {
if (a < b) {
a = b;
}
}
class TaskU {
public:
int N;
vector<vector<int>> a;
vector... | 0 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int R;
cin >> R;
if (R < 1200)
cout << "ABC" << endl;
else if (R < 2800)
cout << "ARC" << endl;... | #include<iostream>
#include<stdio.h>
using namespace std;
bool include_3(int);
int main(){
int n,i;
cin>>n;
for(i=1;i<=n;i++){
if(i%3==0||include_3(i)){
cout<<" "<<i;
}
}
cout<<endl;
return 0;
}
bool include_3(int n){
while(n){
if(n%10==3){
return 1;
}
n=n/10;
}
... | 0 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
const int MAXN = 1e6 + 10;
class no_solution: std::exception
{
public:
const char * what() const noexcept
{
return "There is no solution under such constrains";
}
};
int len;
char a[MAXN], b[MAXN];
auto findSolution() -> std::deque<int... | #include <cstdio>
using namespace std;
double l[10],v1, v2;
int main()
{
loop:
while ( scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf\n", &l[0], &l[1], &l[2], &l[3], &l[4], &l[5], &l[6], &l[7], &l[8], &l[9], &v1, &v2 ) != EOF )
{
v2 += v1;
for( int i = 0; i < 10; i++ )
{
... | 0 |
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
int n, k, a[MAXN], dep[MAXN], sum[MAXN], adv[MAXN], fa[MAXN], ans;
vector<int> g[MAXN];
int read() {
char c = getchar();
int x = 0;
while (!isdigit(c))
c = getchar();
while (isdigit(c)) {
x = (x << 3) + (x << 1) + c - ... | #include <cstdio>
typedef long long ll;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
// getchar
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | #include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector... | #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... | 0 |
#include <stdio.h>
typedef long long ll;
ll abs(ll a) {
return a > 0 ? a : -a;
}
int main(void) {
ll i, j, k, h, w;
scanf("%lld%lld", &h, &w);
ll a[h][w], b[h][w], d[h][w];
bool dp[w][80 * (h + w)], tmp[w][80 * (h + w)];
for(j = 0; j < w; ++j) for(k = 0; k < 80 * (h + w); ++k) dp[j][k] = false;
for(i = ... | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.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,n,a) for(int i = (int)(n); i >= (int)(a... | 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() {
vector<int> X(3);
rep(i,3) cin >> X.at(i);
swap(X.at(0), X.at(1));
swap(X.at(0), X.at(2));
for(auto e:X) cout << e << " ";
cout << endl;
return 0;... | //#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//find_by_order(k) returns iterator to kth element starting from 0;
//order_of_key(k) returns count of elements strictly smaller th... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
int n,ans=0,cnt[5007],id[5007];
long long h[5007],p[5007],dp[5007];
bool cmp(int x,int y){
return (h[x]+p[x]<h[y]+p[y]);
}
int main(){
ios_base::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>h[i]>>p[i];... | #include <iostream>
using namespace std;
void direction(char d, int dice[])
{
int temp;
switch(d)
{
case 'E': temp = dice[1];
dice[1] = dice[4];
dice[4] = dice[6];
dice[6] = dice[3];
dice[3] = temp;
break;
... | 0 |
#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<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
ll n, x, y;
cin >> n;
vector<P> red, blue;
vector<bool> is_pair_red(n, f... | //
// Created by tac on 2016/10/16.
//
#include <algorithm>
#include <cstdlib>
#include <string>
#include <iostream>
namespace {
void print(const std::string &str,
std::string::size_type a,
std::string::size_type b) {
std::cout << str.substr(a, b - a + 1) << std::endl;
return;
}
const ... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(),a.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if(i == n - 1) {
if(x =... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int dp[101][101];
int r[100],c[100];
int solv(int a,int b){//a??????b-1?????§?????????????????????????????????????????°???????°???¨?????????????????????????????????
if(dp[a][b]==-1){
if(a == b-1){
dp[a][b]=0;
}else if(a==b-2){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x <... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.