code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPr(i,n) for(int i=(n)-1;i>=0; --i)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define FORqr(i, m , n) for(int i = (n);i >=(m);--i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d"... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
const int MOD = 1000000007;
int main()
{
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ll k;
cin >> k;
int n = 50;
ll x = (k + n*n - n) / n;
ll arr[50];
for(int i = 0;i < 50;i++){
arr[i] = x;
}
ll ... | 1 |
#include <bits/stdc++.h>
using namespace std;
//TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#def... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int ac = 2e5 + 5, bc = (1 << 18);
ll PR[ac];
ll CS[ac];
struct Tree
{
vector<ll> T;
Tree()
{
T.resize(bc * 2);
}
void update(int a, ll b)
{
a += bc;
T[a] = b;
while (a)
{
a /= 2;
T[a] = min(T[a * 2], T[a * 2 + 1]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
template <typename T,typename E>
struct SegmentTree{
using F = function<T(T,T)>;
using G = function<T(T,E)>;
using H = function<E(E,E)>;
int n,height;
F f;
G g;
H h;
... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
vector<vector<ll>> cnt(62, vector<ll>(62, 0));
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (find(s.begin(), s.end(), '.') == s.end()) s.push_... | #include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ ";
for(auto v:V)os << v << " "; return os << "]";
}
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ ";
for(auto s:S) os<<s<<" "; return os<<"}";
}
template<class L, cla... | 1 |
// AtCoder Beginner Contest 167 - Problem F: Bracketing Sequencing (https://atcoder.jp/contests/abc167/tasks/abc167_f)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
string solve(int N, const vector<string>& xs)
{
vector<int> cs;
vector<ii> ds, es;
int open =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<ll,ll> pii;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define ff it->first
#define ss it->second
#define all(v) (v).beg... | 1 |
///f. fizzbuzz sequence
#include <stdio.h>
#include <math.h>
int main()
{
long long int n;
scanf("%lld",&n);
long long int d3,d5,d15;
d3=n/3; d5=n/5; d15=n/15;
long long sum = (n*(n+1)-3*d3*(d3+1)-5*d5*(d5+1)+15*d15*(d15+1))/2;
printf("%lld",sum);
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
#define MOD 1000000007;
void solve(){
int n; cin >> n;
long long ans = 1;
vector<int> pn;
map<int, int> mp;
for(int i = 2; i <= n; ++i){
int cnt = 0;
for(int j = 1; j <= i; ++j){
if(i % j == 0)cnt++;
... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
const int MAXV = 1e5 + 5;
double solve(int a, int b, int c, auto &dp, int n) {
if (dp[a][b][c] != -1) return dp[a][b][c];
... | /* Bismillahir Rahmanir Rahim */
#include<bits/stdc++.h>
#include<vector>
#include<cmath>
#include<string>
#include<stdlib.h>
#define mod 1000000007
#define lp(i,a,b) for(ll i=a;i<=b;i++)
#define ll long long int
#define ull unsigned long long int
#define tst int t;cin>... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(... | #include <iostream>
using namespace std;
int main()
{
int x, coin500, coin5;
cin >> x;
coin500 = x / 500;
x -= coin500 * 500;
coin5 = x / 5;
cout << coin500 * 1000 + coin5 * 5 << endl;
return 0;
} | 0 |
#include <cstdio>
#include <cstring>
using namespace std;
const int Max_L(50);
typedef long long int LL;
int L, len, D[Max_L], N[Max_L], X[Max_L];
char input[Max_L];
LL Ans;
int work(int p, int x)
{
int Ret(0);
for (int c = (p == len - 1 ? 1 : 0);c <= 9;++c)
if (0 <= c - x && c - x <= 9)
++Ret;
return Ret;
... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <locale>
#include <iostream>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include ... | 1 |
#include<iostream>
#include<iomanip>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<utility>
#include<map>
#include<set>
#include<vector>
#include<functional>
using namespace std;
#ifd... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 |
/**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
string s, t;
cin >> N >> s >> t;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
const int N=2e2+5,mod=1e9+7;
ll n,m,k,dp[N][N],num[N][N];
int main(){
cin>>n>>m>>k;
for(int s=0;s<(1<<(m-1));s++){
bool ok=true;
for(int j=0;j<m-1;j++){
int b1=(s>>j)&1;
int b2=(s>>(j+1))&1;
if(b1==b2&&b1) ok=fa... | 0 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
if(l==r)return dp[l][r]=0;
int res=1e17;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
retu... | #include <stdio.h>
#define INF 10000000
int main(){
int n,i,j,k,l,t,m[101],c,o;
int mm[101][101];
scanf("%d",&n);
for(i = 1 ; i < n+1; i++){
scanf("%d%d",&m[i-1],&m[i]);
}
for( i = 1 ; i <= n ; i++ ){
mm[i][i] = 0;
}
for(l = 2 ; l <n+1 ; l++){
for(i=1;i<n-l+2;i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
int X,Y;
cin >> X >> Y;
int ans = 2e9+1;
for(int i=0;i<2;i++) for(int j=0;j<2;j++)... | #include <bits/stdc++.h>
#include <vector>
#include <math.h>
using namespace std;
int main(){
long long x,y;
cin>>x>>y;
if(x*y < 0) cout<<abs(abs(x) - abs(y))+1<<endl;
else if(x*y == 0){
if(x<y) cout<<y-x<<endl;
else cout<<x-y+1<<endl;
}
else {
if(x<y) cout<<y-x<<endl;
else
co... | 1 |
#include <iostream>
using namespace std;
void solve()
{
int l[10];
while(cin >> l[0])
{
for(int i = 1; i <= 9; ++i)
{
scanf(",%d", &l[i]);
}
int v[2];
scanf(",%d,%d", &v[0], &v[1]);
int sum = 0;
for(int i = 0; i < 10; ++i)
{
sum += l[i];
}
double time = (double)sum / (v[0] + v[1]);
doub... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int n,k;
cin >> n >> k;
vector<int> l(n);
for (int i = 0; i < n; i++)
{
cin >> l[i];
}
sort(l.begin(),l.end());
reverse(l.begin(),l.end());
int x = 0;
for (i... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | // A - Rated for Me
#include <bits/stdc++.h>
using namespace std;
int main(){
int r; cin>>r;
string ans = "ARC";
if(r < 1200) ans = "ABC";
if(2800 <= r) ans = "AGC";
cout<< ans <<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector... | #include<stdio.h>
#include<math.h>
int main(){
double a,b,c,d;
scanf("%lf %lf %lf %lf",&a,&b,&c,&d);
printf("%.8lf\n",sqrt(pow(c-a,2.0)+pow((d-b),2.0)));
} | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
bool ok = false;
REP(i,3){
if(s[i] == '7') ok = true;
}
if(ok) cout << "Y... | #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;
rep(i, s.size()-8) cout << s[i];
cout << endl;
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
template<class T>using vv = vector<vector<T>>;
using vvi = vv<int>;
using vvl = ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
LL cal(int S, auto &arr, auto &sum) {
if (~sum[S]) return sum[S];
sum[S] = 0; int n = arr.size();
for (int i = 0 ; i <... | 1 |
#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)... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | 0 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
int n; cin >> n;
vector<int> a(n), groups;
rep(i, n) cin >> a[i];
groups.push_back(a[0]);
rep(i, n-1){
int ng = -1, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
multiset<int> ms;
for(auto a : A)
{
if(ms.empty() || *ms.begin() >= a) ms.insert(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | #include <cstdio>
#include <algorithm>
#include <iostream>
// 18:45 -
using namespace std;
int main(void)
{
while(1){
int n, p;
scanf("%d %d", &n, &p);
if(n == 0 & p == 0)
break;
int mine[n];
for(int i = 0; i < n; i++) mine[i] = 0;
int all = 0;
in... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
string s; cin >> s;
string t; cin >> t;
int cnt=0;
bool flg = false;
for(int i=0; i<s.length(); i++){
string s_sub = s.substr(i, s.length()-i);
for(int j=0; j<t.length(); j++){
string t_sub = t.... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typede... | 0 |
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
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 ... | 1 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t ans=1;
int m,j,k,y,mod=1e9+7;
bool f;
cin>>m;
vector<int> p={2};
for(j=3;j<=m;j+=2){
f=true;
for(k=0;k<(int)p.size();k++){
if(j%p.at(k)==0){
f=false;
break;
}
}
if(f==true) p.push_back(j);
}
int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define plll pair <... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
int ans = 0;
if(x < 4)
{
ans += (4 - x) * 100000;
}
if(y < 4)
{
ans += (4 - y) * 100000;
}
if(x == 1 && y == 1)
{
ans +=... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#defi... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define rp(i,n) for(long long i=1;i<n;i++)
#define sor(v) s... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int a;
cin>>a;
int ans =0;
for(int i=0;i<3;i++){
ans+=pow(a,i+1);
}
cout<<ans<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int a;
cin >> a;
cout << a + a * a + a * a * a;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string ans;
rep(i,ty-sy) ans+='U';
rep(i,tx-sx) ans+='R';
rep(i,ty-sy) ans+='D';
rep(i,tx... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0;
rep(i, n){
cin >> a[i];
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int d, t, s;
cin >> d >> t >> s;
string ans;
if((double)d/s <= t){
ans = "Yes";
}else{
ans = "No";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9+7;
#define REP(i,j,n) for(int i=j;i<n;i++)
#define rep(i,n) REP(i,0,n)
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line b... | 1 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typede... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
ll n,Y; cin >> n >> Y;
ll sum;
REP(i,n+1){
... | 0 |
#include <iostream>
#include <vector>
using namespace std;
struct FenwickTree {
vector<int> bit; // binary indexed tree
int n;
FenwickTree(int n) {
this->n = n;
bit.assign(n, 0);
}
FenwickTree(vector<int> a) : FenwickTree(a.size()) {
for (size_t i = 0; i < a.size(); i++)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main() {
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> a(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
s -=x;
t -= ... | 0 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
wh... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c,k;
int64_t target;
int64_t remains;
cin >> a >> b >> c >> k;
target = max(a,max(b,c));
remains = a + b + c - target;
target = target * pow(2,k);
cout << target + remains << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double n, x, t;
cin>>n>>x>>t;
double t1 = ceil(double(n/x));
//cout<<n/x<<endl;
//cout<<t1<<endl;
ll t11 = ll(t1)*ll(t);
cout<<t11<<endl;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,a[10]={99,111,222,333,444,555,666,777,888,999};
cin>>n;
for(i=0;i<10;i++){
if(a[i]==n){
cout<<n;
return 0;
}
if(a[i]<n && a[i+1]>n){
cout<<a[i+1];
return 0;
}}
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pb push_back
#define eb emplace_back
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,r) for (ll i = 0; i < (ll)(r); i++)
ll dp[1000010][2];
int main(){
string s; cin >> s;
s = '0' + s;
int n = s.size();
dp[0][1] = 1;
for(int i=1;i<n;i++){
int c = s[i]-'0';
dp[i][0] = min(dp[i-1][0... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | #include<bits/stdc++.h>
#include<boost/dynamic_bitset.hpp>
using namespace std;
using u64 = uint64_t;
using s64 = int64_t;
int main(void) {
u64 N, M;
cin >> N >> M;
u64 lM = M / 2;
u64 lN = N / 2;
u64 rM = M - lM;
u64 rN = N - lN;
if(lN == rN) {
lN--;
}
for(u64 i=0, l=1, ... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;
int main() {
while(true) {
int N, K;
cin >> N >> K;
if(!N && !K) break;
vector<vector<int> > v(N, vector<int>(N, -1));
while(K--) {
int cmd;
cin >> cm... | 0 |
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
int main()
{
int n, q, m, d, dt, days[101];
while(cin >> n >> q && n && q) {
memset(days, 0, sizeof(days));
for(int i = 0; i < n; i++) {
cin >> d;
for(int j = 0; j < d; j++) {
ci... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#incl... | 1 |
#include <stdio.h>
const long long int INF=100000000000000000;
int main(){
int n,m,l,r,c;
long long int g[110][110];
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)for(int j=0;j<n;j++){
if(i==j)g[i][j]=0;
else g[i][j]=INF;
}
while(m--){
scanf("%d%d%d",&l,&r,&c);
g[l][r]=c;
}
for(int k=0;k<n;k++)for(int i=0;i... | #include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 1000000007
#define inf 1000000007
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie... | 0 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#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,... | 1 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_st... | #include <stdio.h>
int main () {
int a, b;
scanf("%d %d", &a, &b);
int flag = 0;
char str [a+b+1];
scanf("%s", str);
int atr = 0;
for ( int i = 0 ; i < a+b+1 ; i++) {
if (str[i] == '-' && i == a ) {
flag = 1;
}
if (str[i] >= '0' && str[i] <= '9') {
++atr;
}
}
int total = a+b;
if (flag == 1 &... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int bzmax = 60;
typedef class LinearBasis {
public:
ll a[bzmax];
void insert(ll x) {
for (int i = bzmax; i-- && x; ) {
if ((x >> i) & 1) {
x ^= a[i];
}
if ((x >> i) & 1) {
a[i] = x;... | #include<bits/stdc++.h>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)
#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin... | 0 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
... | #include <iostream>
#include <cstdio>
#include <cstring>
#define ll long long
#define ls(_o) (_o << 1)
#define rs(_o) ((_o << 1) | 1)
#define abs(_o) ((_o < 0) ? -(_o) : _o)
using namespace std;
namespace ywy {
inline int get() {
int n = 0;
char c;
while ((c = getchar()) || 23333) {
... | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,m;
string s[200],t[200];
cin >> n;
for(int i = 0; i < n; i++)
cin >> s[i];
cin >> m;
for(int i = 0; i < m; i++)
cin >> t[i];
int sum = 0;
for(int i = 0... | #include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <complex>
#include <functional>
using namespace std;
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int e;
cin >>e;
while(e)
{
int x=0;
int y=0;
int z=0;
int m=0;
for(z=0;z*z*z<=e;z++)
for(y=0;z*z*z+y*y<=e;y++)
{
x = e-z*z*z-y*y;
if(x<0)
continue;
... | #include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxN = 1000009;
int N, X, b[maxN], p[maxN], l[maxN], r[maxN];
/*int lg, N, X, aib[2 * maxN], val[2 * maxN];
long long aibSum[2 * maxN], ans = 1LL << 60;
pair < int, int > h[2 * maxN];
pair < int, pair < int, int > > v[maxN];
set < int > S;
void able (int pos, in... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 0 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL <... | #include "bits/stdc++.h"
#define ll long long
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef pair<ll, ll> pairs;
typedef pair<ll, pairs> tpl;
ll c[4];
double dp[301][301][301];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a;
cin >> n;
for (ll i = 0; i < n; i++)
... | 1 |
#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&... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#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 =... | 1 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll,ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
template<class T> inline void checkmin(T &a,const T &b){if(b<a) a=b;}
template<class T> inline void checkmax(T &a,const T &b){if... | #include<bits/stdc++.h>
using namespace std;
struct Stat {
int unmatchedOpening, unmatchedClosing, index;
Stat(int _uo, int _uc, int _index): unmatchedOpening(_uo), unmatchedClosing(_uc), index(_index) {}
};
//Comparing two stats which unmatchedOpening - unmatchedClosing >= 0
bool cmpFirst(Stat a, Stat b) {
... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[105];
int bubble_sort(int a[], int n)
{
bool flag = true;
int cnt = 0;
for(int i = n-1; i >= 0; i--)
{
flag = true;
for(int j = 0; j < i; j++)
{
if(a[j+1] < a[j])
{
swap(a[j+1], a[j]);
cnt++;
flag = false;
}
}
if(fl... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCa... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
#define BIT_FLAG_0 (1<<0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1<<1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1<<2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1<<3) // 0000 0000 0000 1000
#define BIT_... | #include <iostream>
using namespace std;
int main()
{
double U = 3.14;
int R;
cin >> R >> U;
cout << R * 2 * U <<"\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct{
int first;
int second;
int third;
}T;
//昇順
bool comp_Se(T& l, T& r){
return l.second < r.second;
}
ll mod = 1e9+7;
int main(void){
int i,j,N,X;
cin >> N >> X;
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
//setprecision(15)
int main()... | #include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int A,B; cin >> A >> B;
int skt = 1;
int ans = 0;
while(B > skt) {
skt--;
skt += A;
ans++;
}
cout << ans << endl;
return 0;
}
| 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... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 1000000
using namespace std;
int main(){
//木曜日を０とする
int table[12][31];
int cnt=0,day;
for(int i=1; i<=12; i++){
if(i == 4 || i == 6 || i == 9 || i == 11) day = 30;
else if(i == 2) day = 29;
else day = 31;... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string day[]={"Wednesday","Thursday","Friday","Saturday","Sunday","Monday","Tuesday"};
int Mon[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int m,d;
while(cin>>m>>d,m*d){
int allDay=d;
for(int i=0;i<m-1;i++){
... | 1 |
#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... | #include <bits/stdc++.h>
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 rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#define uni(e) e.erase(u... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
cout << n / 3 << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
... | 0 |
#include<bits/stdc++.h>
#define ri register int
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
#define fi first
#define se second
const int rlen=1<<18|1;
char buf[rlen],*ib=buf,*ob=buf;
#define gc() (((ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin)),i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... | 1 |
#include <iostream>
using namespace std;
const int MAX = 100000;
int seq[MAX];
int partition(int a[], int l, int r) {
int x = a[r];
int i = l - 1;
for (int j = l; j < r; ++j) {
if (a[j] <= x) {
++i;
swap(a[j], a[i]);
}
}
swap(a[i+1], a[r]);
return i + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb ... | 0 |
#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il voi... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
ret... | #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 dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const ll INF=1e18;
int main() {
double n,x,t;
cin >> n >> x >> t;
x = ceil(n/x);
cout << int(x * t) << endl;
} | 1 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(5);
for (int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP ... | 1 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <time.h>
#include <c... | #include<iostream>
using namespace std;
struct Node {
int key;
Node* parent;
Node* left;
Node* right;
Node(int key_in){
key = key_in;
parent = NULL;
left = NULL;
right = NULL;
}
};
class Tree {
Node* root;
void inorder(Node* n){
if (n == NU... | 0 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
int main() {
int N; cin >>N;
vector<ll> check;
rep(i,0,N) {
ll A; cin >>A;
check.push_back(A);
}
sort(check.rbegin(),check.rend());
... | #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 = (int)(n - 1); i >= 0; i... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
bool check(int m, char c, int l, int r){
bool res = true;
if(m == 0){
if(c == ... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define ... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> xs(n + 1), ys(m + 1);
cin >> xs[0] >> ys[0];
for (int i = 1; i <= n; ++i)
cin >> xs[i];
for (int i = 1; i <= m; ++i)
cin >> ys[i];
if (*max_element(xs.begin(), xs.end... | #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()
{
int n,m,X,Y;
cin >> n >> m >> X >> Y;
int x[n],y[m];
rep(i,n) cin >> x[i];
rep(i,m) cin >> y[i];
int flag = 0;
for(int z = X+1; z <= Y; z++){
rep(i,n){
if(... | 1 |
#include <iostream>
using namespace std;
int a,b,sum,dif,tim;
int main(){
cin >> a >> b;
sum = a + b;
dif = a - b;
tim = a * b;
if((sum > dif)&&(sum > tim)){
cout << sum;
}else{
if(dif > tim){
cout << dif;
}else{
cout << tim;
}
}
cout << endl;
} | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define FOR(I,A,B) for( int I = A; I < B; ++I )
#define SFI(X) scanf("%d",&X)
#define SFL(X) scanf("%lld",&X)
int main() {
// SAT, SUN, MON, TUE, WED, THU, FRI
// 1 2 3 4 5 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | // C - Grid Repainting 2
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(... | 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(){
string x;
cin >> x;
int n = x.length();
if(n == 2){
if(x[0] == x[1]){
printf("1 2");
}
else ... | 1 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int ... | #include<bits/stdc++.h>
//#include<pair>
using namespace std;
typedef long long ll;
typedef int ii;
//typedef vector<ll> vi;
#define INF 1000000007
#define pi 3.141592654
#define T while(t--)
#define for2(i,a,b) for(i=a;i>=b;i--)
#define for3(i,a,b) for(i=a;i<=b;i=i+2)
#define for1(i,a,b) for(i=a;i<=b;i++)
#define ... | 0 |
#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 all(x) (x).begi... | #include <bits/stdc++.h>
using namespace std;
string s;
int n, dp[305][305][305];
int go(int l, int r, int k) {
if (dp[l][r][k] != -1) return dp[l][r][k];
if (l == r) {
return dp[l][r][k] = 1;
}
if (l + 1 == r) {
if (s[l] == s[r] || k) {
return dp[l][r][k] = 2;
} else {
return dp[l][r][k] = 1;
}
}
d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<ll> A(n);
rep(i,n) cin >> A[i];
sort(A.begin(),A.end());
rep(i,n-1){
if(A[i]... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,m,x,y,z;
string ans="War";
cin>>n>>m>>x>>y;
vector<int> a(n);
vector<int> b(m);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
}
for(int i=0;i<m;i++)
{
cin>>b.at(i);
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
sort(b.... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define ra... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int, int>> v1(1e5+1);
vector<pair<int, int>> v2(1e5+1);
for(int i=0; i<n; i++){
int in;
cin>> in;
if(i % 2 == 0){
v1[in].first++;
v1[in].second = in;
}else{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
int last = 0;
int exist = 0;
rep(i, n) {
if (a... | 0 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
std::vector<string> d(3);
for(ll i=0;i<3;++i){
cin>>d[i];
}
ll a=0,b=0,c=0;
char now='a';
while(1){
switch(now){
case 'a':
if(a>=d[0].length()){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
queue<char>q[3];
void scan(int n)
{
char c;
while((c=getchar() )!='\n')
{
q[n].push(c);
}
}
int main()
{
fast;
scan(0);
... | 1 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
int main(){
LL N;
cin >> N;
int f = 10;
for(LL A=1; A*A<=N; A++){
if(N%A != 0) continue;
LL a = A;
LL b = N/A;
int B_d = 0;
int A_d = 0;
while(a>0){
a /= 10;
... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
//int isalpha(char ch): ch がアルファベットなら true を返す
//int isdigit(char ch): ch が数字なら true を返す
//int islo... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m; cin >> n >> m;
vector<int> p(n+1,0);
vector<bool> ac(n+1);
int ac_cnt = 0, pe_cnt = 0;
rep(i,... | #include <bits/stdc++.h>
using namespace std;
int main () {
int d, g;
cin >> d >> g;
vector<pair<int,int>> p(d);
for (int i = 0; i < d; i++)
cin >> p[i].first >> p[i].second;
vector<int> v(d);
iota (v.begin(), v.end(), 0);
int ans = 1000;
do {
int sum = 0, c = 0;
for (int i = 0; i < d; i... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string S;
vector<vector<int>> color;
void hantei(int i){
if(S[i]=='R'){
color[0][i]++;
}
else if(S[i]=='G'){
color[1][i]++;
}
else if(S[i]=='B'){
color[2][i]++;
}
}
int main(){
int N;
cin >> N >> S;
vector<vector<int>> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | 0 |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int main()
{
int d,g,p[11],c[11],scr[11][1001]={};
scanf("%d %d",&d,&g);
int sm=0;
for(int i=1;i<=d;i++)
{
scanf("%d %d",&p[i],&c[i]);
s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int d,g,i,j,y,z,ans=1000;
cin>>d>>g;
vector<int> p(d),c(d);
for(i=0;i<d;i++) cin>>p.at(i)>>c.at(i);
for(i=0;i<(1<<d);i++){
bitset<10> b(i);
y=0;z=0;
for(j=0;j<d;j++){
if(b.test(j)){
y+=p.at(j);
z+=100*(j+1)*p.at(j)+c.at... | 1 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
rep(i,n) c... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define pi pair <int, int>
#define sz(x) (int)((x).size())
#define int long long
const int dx[] = {0, 1, 0... | //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
template<typename T>
auto print(std::vector<T> array,bool reverse = false)
-> void{
if(reverse){
auto iterator = array.rbegin();
std::cout<<*iterator;
iterator++;
for(;iterator != array.rend();++iterator){
std::cout<<" "<< *iterator;
}
}else{
... | #include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int array[n];
for(int i = 0;i < n;i++) scanf("%d",&array[i]);
for(int i = n;i > 0;i--){
if(i != 1){
printf("%d ",array[i-1]);
} else{
printf("%d\n",array[i-1]);
}
}
}
| 0 |
#include<stdio.h>
#define N 101
int main(){
int n;
int p[N];
int m[N][N];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&p[i-1],&p[i]);}
for(int i=1;i<=n;i++)
m[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
/*2<<21*/
m[i][j]=2097152;
... | #include <stdio.h>
const int N=110;
const int INF=1<<30;
int min(int a,int b){
return a>b?b:a;
}
int main(){
int n,dp[N][N],a[N];
scanf("%d%d%d",&n,&a[0],&a[1]);
for(int i=1;i<n;i++)scanf("%d%d",&a[i],&a[i+1]);
for(int k=1;k<n;k++){
for(int i=0;i<n-k;i++){
dp[i][i+k]=INF;
... | 1 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
#define vecvec(a) vector<vector<(... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
#define pr(x) cout<<x<<endl;
#define pr2(x,y) cout<<x<<" "<<y<<endl;
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s, r;
cin >> k >> s;
if(s.size()<=k) cout << s << endl;
else{
for(int i=0;i<k;i++){
r += s.at(i);
}
cout << r << "..." << endl;
}
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define int ll
vector<ll> node[100005];
ll group[100005]={0},group_num[100005]={0},col[100005]={0};
ll nibu[100005]={0};
bool used[100005]={0};
bool dfs(ll pos,ll k,ll cl){
used[pos]=true;
group[pos]=k... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t,r,c,i,j,k=0;
cin>>r>>c;
int ar[r][c];
int cn[r*c][4];
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
cin>>ar[i][j];
}
}
for(i=0;i<r;i++)
{
for(j=0;j<c-1;j++)
{
if(a... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void computeLPSArray(string pattern, int m, int lps[]){
int len=0;
lps[0]=0; //lps[0] is always 0
int i=1;
while(i<m){
if(pattern[i]==pattern[len]){
len++;
lps[i]=len;
i++;
}else{
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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 (b<a) { a=b... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> G[1010];
bool H[1010][1010];
bool visited[1010];
vector<int> path;
vector<int> cycle;
void dfs(int v) {
visited[v] = true;
path.push_back(v);
for (int u : G[v]) {
if (!cycle.empty()) continue;
if (find(path.begin(), path.en... | #include<bits/stdc++.h>
using namespace std;
const int N = 1003;
int n, m, dis[N], par[N];
vector<int> adj[N], ans;
int main(int argc, char const *argv[])
{
scanf("%d %d\n", &n, &m);
for (int i = 0; i < m; ++i)
{
int u, v;
scanf("%d %d\n", &u, &v);
adj[u].push_back(v);
}
for (int s = 1; s <= n; ++s)
{
que... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *t... | //BINARY_BOY!!
//THINK TWICE CODE ONCE { TRUE }
// ##### ### ## # ### ##### # # ##### #####
// # # # # # # # # # # # # # # # #
// ##### # # # # ##### ##### # ##### # #
// # # # # ## # # # # # # # # #
// ##### ### # # # # # # # #... | 1 |
#include<iostream>
#include<vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n;
cin>>n;
vector<int>in(n);
rep(i,n)cin>>in[i];
rep(i,n-1)cout<<in[n-i-1]<<" ";
cout<<in[0]<<endl;
} | // class point の練習（クラスの高度な実装）
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#define INF 1000001
typedef long long llong;
using namespace std;
int main() {
int n;
int a_i;
vector<int> vt;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a_i;
vt.push_back(a_i... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
int A,B,M;
cin>>A>>B>>M;
int a[100010],b[100010],x[100010],y[100010],z[100010];
rep(i,A)cin>>a[i];
rep(i,B)cin>>b[i];
rep(i,M)cin>>x[i]>>y[i]>>z[i];
int min=200100;
rep(i,M){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
vector<int> ac(A);
vector<int> bc(B);
int minA = 1<<30, minB = 1<<30;
rep(i, A) {
cin >> ac.at(i);
minA = min(minA, ac.at(i));
}
rep(j, B) {
cin >> bc.at(j);
minB =... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n; cin >> n;
vector<int> x(n);
vector<int> y(n);
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
vector<int> perm(n);
for (int i = 0; i < n; ++i) perm[i] = i;
do... | #include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i,n) for(UL i=0; i<(n); i++)
UL buf[9][8][8]={};
UL mask[9]={};
UL ans[8][8];
void put(int x, int y, int k){
buf[k][x][y]=2;
for(int xx=0; xx<8; xx++) for(int yy=0; yy<8; yy++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> ans(2);
if(n%2 == 1){
for(int l = 1, r = n-1; l < r; l++, r--){
ans.at(0).push_back(l);
ans.at(1).push_back(r);
}
}
else{
bool flag = false;
for(int l = 1, r = n-1; l ... | #include <iostream>
int main()
{
int sx, sy, tx, ty;
std::cin >> sx >> sy >> tx >> ty;
for (int i = 0; i < ty - sy; ++i)
{
std::cout << 'U';
}
for (int i = 0; i < tx - sx; ++i)
{
std::cout << 'R';
}
// tに到達した
for (int i = 0; i < ty - sy; ++i)
{
std:... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.