code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <cstdio>
#include <iostream>
using namespace std ;
typedef long long ll ;
const int N = 300010 ;
int n ;
ll ans ;
ll S[4] ;
ll minx ;
ll maxx ;
ll sum[N] ;
ll base[N] ;
ll gt(ll x){
return x < 0 ? -x : x ;
}
void chkmin(ll x){
minx = x >= minx ? minx : x ;
}
void chkmax(ll x){
maxx = x >= maxx... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll N, M;
cin >> N >> M;
vector<ll> A(N);
for (ll i=0; i<N; i++){
cin >> A[i];
}
ll temp=0;
map<ll,ll> count;
vector<ll> elem;
count[0]=1;
el... | #include <bits/stdc++.h>
#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 repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 1 |
#include <bits/stdc++.h>
#define loop(v, f, l) for(int v = (f), v##_ = (l); v < v##_; ++v)
using namespace std;
typedef long long int lint;
static inline int in(){ int x; scanf("%d", &x); return (x); }
static inline lint inl(){ lint x; scanf("%lld", &x); return (x); }
int matrix[11][11];
int main()
{
int n;
whi... | #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 1e9
typedef long long ll;
int main() {
int A,B; cin >> A >> B; // Aが白
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll k, a[55] = {};
cin >> k;
for (int i = 0; i < 50; i++) a[i] = k / 50 + 50 - 1;
for (int i = 0; i < k % 50; i++) {
for (int ... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <stack>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <set>
#include <functional>
#include <cstring>
using namespace std;
template... | 0 |
#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 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll N; cin >> N... | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
static const int N = 100;
struct Matrix{int row, col;};
Matrix M[N];
int cost[N][N] = {0};
int prod(int begin, int end){
int mincost = 100000000, l = end - begin;
if(cost[begin][end] > 0){
return cost[begin][end];
} else {
if(l == 0){
mi... | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> p(n+1);
cin >> p[0] >> p[1];
for(int i = 0; i < n-2; i++){
int a, b; cin >> a >> b;
p[i+2] = b;
}
{
int a, b; cin >> a >> b;
p[n] = b;
}
int dp[101][... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int solve(int a,int b,int c){
if(c==0)return 0;
if(b<=c&&b<=a)return b;
return 0;
}
int main(){
string s;
cin>>s;
int ans=0;... | #include<stdio.h>
int max(int a,int b){return a>b?a:b;}
int main(){
int i,j;
int n;
char c;
int jc=0;
int oc=0;
int ic=0;
int lev=0;
int ans=0;
scanf("%d",&n);
while(scanf("%c",&c)!=EOF){
switch(c){
case 'J':
if(jc==0){
oc=0;
ic=0;
lev=0;
}
jc++;
break;
case 'O':
if(oc==0){
... | 1 |
#include <iostream>
#include <map>
#include <set>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
map<int, int> m;
multiset<int> s;
for (int w = 1; w <= W; ++w) {
m[w] = w;
s.insert(0);
}
int a, b;
for (int h = 1; h <= H; ++h) {
cin >> a >> b;
auto it = m.lower_bound(a);
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | 0 |
/// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) fo... | #include <iostream>
#include<map>
using namespace std;
const int maxn = 2e6 + 10;
typedef pair<int, int> P;
int fa[maxn], ma[maxn];
void init(int n)
{
for (int i = 0; i <= n; ++i)
{
fa[i] = i;
ma[i] = i;
}
}
int find(int* fa, int x)//找到根节点
{
if (fa[x] == x)
{
return fa[x];
}
return fa[x] = find(fa, fa[x])... | 0 |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#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 <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
using namespace std;
int main(int argc, const char *argv[]) {
vector<int> abc(3);
int k;
cin >> abc[0] >> abc[1] >> abc[2];
cin >> k;
vector<int>::iterator iter = max_element(abc.begin(), abc.end());
size_t ind... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
const int MAX_k = 200010;
const int mod = 998244353;
ll com[MAX_k];
ll... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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; }
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>ans = { 2,7,17,37,47,67,97,107,127,137,157,167,197,227,257,277,307,317,337,347,367,397,457,467,487,547,557,577,587,607,617,647,677,727,757,787,797,827,857,877,887,907,937,947,967,977,997,1087,1097,1117,1187,... | 1 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<cmath>
#include<list>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 100000 + 8;
int n,a[maxn];
int Partition(int a[],int p... | #include <iostream>
#include <string>
#include <sstream>
int partition(int* arr, int n)
{
const int x = arr[n - 1]; //pivot value
int i = 0; //increment if swaped
int j = 0; //increment every loop
for (; j < n; ++j) { //scan start to end
if (arr[j] <= x) {
std::swap(arr[i], a... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n;
int a,b,c,d;
int team[100];
int p[100];
int sum=0;
cin >> n;
for(int i=1 ;i<n+1 ;i++){
team[i] = 0;
p[i] = 1;
}
for(int i=0 ;i<(n*(n-1))/2 ;i++){
cin >> a >> b >> c >> d;
if(c > d)
team[a] += 3;
else if(c < d)
team[b] += 3;
else... | #include <cstdio>
#include <cstring>
#define repeat(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int table[11][11];
int main() {
for (;;) {
int n;
scanf("%i", &n);
if (!n) return 0;
memset(table, 0, sizeof table);
repeat(i, n) {
repeat(j, n) {
scanf("%i", &table[i][j]... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll N,D;
ll A[200005];
cin>>N>>D;
ll ret = D*(N-1);
for(int i = 0;i < N;i++){
cin>>A[i];
ret += A[i];
}
for(int i = 1;i < N;i++){
A[i]=min(A[i-1]+D,A[i]);
}
for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
class U {
public:
int n;
vector<int> p, s;
U(int _) {
n = _;
p.resize(n);
s.resize(n);
for (int i = 0; i < n; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
templat... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 |
#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | #include<iostream>
#include<iomanip>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string s;
int out=0,score=0,base=0;
while(out<3){
cin>>s;
if(s=="HIT"){
base++;
if(base>3){
s... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 2e5+10;
ll dp[mx],arr[mx];
int main()
{
ll n ;
cin>>n;
ll sum=0;
for(int i=1; i<=n; i++)
{
cin>>arr[i];
if(i%2!=0)
sum+=arr[i];
if(i!=1)
{
if(i%2!=0)
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
float r,g,ans;
cin>>r>>g;
ans=2*g-r;
cout << ans << endl;
} | #include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
double a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
printf("%lf\n",a);
} | 0 |
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
using std::accumulate;
using std::array;
using std::cin;
using std::cout;
using std::endl;
using std::for_each;
using std::getline;
using std::replace;
using std::string;
using std::stringstream;
int main... | #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int l[11],v1,v2,ans;
double x;
while(1){
int sum=0,y=0;
rep(i,0,10){
scanf("%d,",&l[i]);
sum+=l[i];
}
if(scanf("%d,%d",&v1,&v2)==EOF) break;
x=(double)sum*v1/(v1+v2);
rep(j,0,10){
y+=l[j];
if(y>... | 1 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
string S; cin >> S;
if (S[0] != 'A') {
cout << "WA" << endl;
return 0;
}
for (char c : S) {
if (c == 'A' || c == 'C') continue;
if (isupper(c)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D ;
int T ;
int S ;
cin >> D;
cin >> T;
cin >> S;
if (T*S < D ) {
cout << "No" << endl;
}
else if (T*S >= D) {
cout << "Yes" << endl;
}
}
|
#include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
typedef long long ll;
using namespace std;
const ll inf = 1e18;
const ll mod = 1e9+7;
const int N = 2e5+5;
//int a[N];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef... | 1 |
// ABC178F.cpp
#include <iostream>
#include <vector>
#include <algorithm> // sort
#include <string>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
using P = pair<int, char>;
using Pi = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<P>a(n), b(n);
vector<P>c(n *... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define MAXN 100010
int n, k, a[MAXN];
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int g;; k ^= 1) {
int count = 0;
for (int i = 1; i... | 0 |
#include <iostream>
using namespace std;
int main() {
int n;
while(1){
cin >> n;
if(n == 0) break;
int num[10000][2] = {};
int score[2] = {};
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < 2; ++j){
cin >> num[i][j];
}
if (num[i][0] > num[i][1])
... | #include<iostream>
int main(){
while(1){
int n,A,B,Ap=0,Bp=0;
std::cin>>n;
if(n==0)
break;
for(int i=0;i<n;++i){
std::cin>>A>>B;
if(A>B)
Ap+=A+B;
else if(A==B){
Ap+=A;
Bp+=B;
}
else Bp+=A+B;
}
std::cout<<Ap<<' '<<Bp<<std::endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EP... | #include<iostream>
#include<string>
using namespace std;
class dice
{
private:
int asp[6];
string order;
public:
void setdice( int* j ); //サイコロの値を格納
void dice_print(); //サイコロの値を出力
void exchange( int& x, int& y ); //サイコロの場所を交換
v... | 0 |
#include <stdio.h>
int main () {
int H1,M1,H2,M2,K;
scanf("%d%d%d%d%d", &H1,&M1,&H2,&M2,&K);
int sum= ((H2-H1)*60) + (M2-M1) -K;
printf("%d", sum);
} | #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... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N,M;
double x[100010];
ll K;
int a[100010];
vector<int> replace(vector<int> A,ll n){
vector<int> B(... | #include<bits/stdc++.h>
#define Rint register int
using namespace std;
typedef long long LL;
const int N = 100003;
int n, m, c[N], d[N], cnt;
LL ans[N], x[N], k;
bool vis[N];
int main(){
scanf("%d", &n);
for(Rint i = 1;i <= n;i ++) scanf("%lld", x + i), c[i] = i;
for(Rint i = n;i;i --) x[i] -= x[i - 1];
scanf("%d%l... | 1 |
#include <bits/stdc++.h>
#define debug(x) cerr<<#x<<'='<<x<<endl
#define set0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
template<typename T> void read(T &x){
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.en... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef pair<int,int> int_pair;
typedef pair<ll,ll> ll_pair;
#define N 1002
#define INF 1e9+1
string s1,s2;
int dp[N][N];
int main(){
FOR(i,0,N)FOR(j,0,N)dp[i][j]=-1;
cin>>s1>>s2;
FOR(i,0,s1.size()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i,k,n) for(int i = k; i < n; i++)
#define mmax(start, end) *max_element(start, end)
#define mmin(start, end) *min_element(start, end)
#define argmax max_element
#define argmin min_element
#define push push_back
#define pop pop_bac... | 1 |
#ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x),... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0... | 0 |
#include <stdio.h>
int isprime(int n) {
int i;
for(int i = 2; i * i <= n; i++) {
if(n % i == 0) return 0;
}
return 1;
}
int main() {
int i, k, v,an1,an2,suu;
int MAX_V = 10000;
int prime[MAX_V+1];
for(i = 0; i <= MAX_V; i++) {
prime[i] = 1;
}
for(i = 2; i*i <= MAX... | #include <iostream>
#include <string>
#include <algorithm>
int main()
{
std::string s;
while (std::cin >> s) {
std::reverse(s.begin(), s.end());
std::cout << s << std::endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair < int , int > pii;
typedef long long LL;
#define mpr make_pair
#define FS first
#define SC second
#define PB push_back
template < typename T > T MAX(T a,T b){return (a>b)?a:b;}
template < typename T > T MIN(T a,T b){return (a<b)?a:b;}
template < typename T > vo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 50;
const ll inf = 1e18;
const int mod = 998244353;
int sum,n;
int a[maxn];
ll dp[305][305 * 305];
ll ans = 1;
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i),sum += a[i], ans = (ans ... | 0 |
// 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; ... | #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 <iostream>
using namespace std;
int main(void){
int a, b, c; cin >> a >> b >> c;
if ((a <= c && c <= b) || (b <= c && c <= a)) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | # include <iostream>
# include <string>
using namespace std;
int main(){
int n;
string s, t;
cin >> n >> s >> t;
int maxLen = 0;
for(int i=1; i<=n; i++){
if(s.substr(n-i) == t.substr(0,i))
maxLen = max(maxLen, i);
}
cout << 2*n - maxLen << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin>>R>>G;
int res = G + (G-R);
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int r,g;
double p;
cin >> r >> g;
//g = (r + p) / 2
p = 2 * g - r;
cout << p << endl;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define INF (1<<29)
int G[101][101];
int n, k;
void init(){
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
G[i][j] = INF;
if(i == j) G[i][j] = 0;
}
}
}
int main()... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long Int;
int main(){
map<int,Int> table;
vector<int> ids;
int n;
bool flug;
while(cin >> n, n != 0){
flug = false;
table.clear();
ids.clear();
for(int i=1;... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
signed main(){
string s, t, u, p;
int n, a, b;
cin >> s >> n;
rep(i, 0, n){
cin >> t >> a >> b;... | #include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int len[10];
int v1,v2;
while( scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", &len[0],&len[1],&len[2],&len[3],&len[4],&len[5],&len[6],&len[7],&len[8],&len[9],&v1,&v2) != EOF ){
int accum[10] = {0};
accum[0] = len[0];
for(int i=1;i<10;i++){
... | 0 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
class TEdge;
struct TNode
{
int TreeIndex;
std::set<const TEdge*> Connected;
TNode();
void SetIndex(int Index, const TEdge* Edge);
};
class TEdge
{
std::pair<TNode*, TNode*> FEnds;
int FWeight;
public:
TEdge(TNode* EndA, TNode* EndB, i... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.141592653589793238462... | 1 |
#include "iostream"
using namespace std;
int main(){
int a; int b;
cin>>a>>b;
if(a==b){
cout<<2*a<<endl;
}
else if(a>b){
cout<<a+(a-1)<<endl;
}
else{
cout<<b+(b-1)<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int a, b, maior, res = 0;
cin >> a >> b;
rep(i,2){
if (a > b){
maior = a;
a--;
}else{
maior = b;
b--;
}
res += maior;
}
cout << res;
} | 1 |
//Love and Freedom.
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define ll long long
#define inf 20021225
using namespace std;
int read()
{
int s=0,t=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') t=-1; ch=getchar();}
while(ch>='0' && ch<='9') s=s*10+ch-'0',ch=getchar();
return s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 1e9+7;
string s;
ll d, n;
ll dp[10005][101][2]; // k = 0, cannot cross limit, k = 1 can
ll solve(ll i, ll sum, ll k){
if(i == n) return sum == 0;
if(dp[i][sum][k] == -1) {
ll dig = s[i] - '0';
if(k) dig = 9;
l... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main()
{
ll K;
cin >> K;
co... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,a,b;
cin>>n;
cout<<50<<endl;
a=n/50;
b=n%50;
for(int i=0;i<b;i++){
cout<<50+a-i<<" ";
}
for(int i=b;i<50;i++){
cout<<max(0LL,49+a-i)<<" ";
}
} | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int mod=998244353;
int n,m,f[1000005],inv[1000005];
long long C(int n,int m){
return 1LL*f[n]*inv[m]%mod*inv[n-m]%mod;
}
long long quick_pow(long long a,int b){
long long ans=1;
for(;b;b>>=1,a=a*a%mod)
if(b&1) ans=ans*a%mod;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll x, y; cin >> x >> y;
ll ans = LINF;
if (x <= y) ans = min(ans, y - x);
if (-x <= y) ans = min(ans, y + x + 1);
if (x <= -y) ans = min(ans, -y - ... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
const long long mod = 998244353;
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int> a(n); cin >> a;
map<int, int... | #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 ;
template <typename PB>
using ordered_set = tree<PB,null_type,less<PB>,rb_tree_tag,tree_order_statistics_node_update> ;
*/
#define Boost ios::sync... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
... | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | 1 |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int n, i, j, k, c, x;
char s[1001], r[1001], t[8] = "Hoshino";
cin >> n;
cin.ignore(1024, '\n');
for (i = 0; i < n; i++)
{
cin.getline(s, sizeof(s));
c = 0;
for (j = 0; j < strlen(s); j++)
{
r[c] = s[j];
c++;
if (s[j] == 'H'... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main() {
int n;
string str;
getline(cin, str);
n = atoi(str.c_str());
for (int i = 0; i ... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
uint N;
long long x;
cin >> N >> x;
vector<long long> a(N, 0);
long long sum = 0;
for (auto &c: a) {
cin >> c;
sum += c;
}
if (sum < x) {
cout << a.size() - 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
ll arr[5],k;
for(int i=0;i<5;i++)
cin>>arr[i];
cin>>k;
if(arr[4]-arr[0]>k)
{
cout<<":(";
return 0... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// mid... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
void add(ll& x, ll y) {
if (x>=mod) x%=mod;
if (y>=mod) y%=mod;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
int tr[21][21];
while(true){
scanf("%d", &N);
if(N == 0) break;
for(int i = 0; i <= 20; i++){
fill(tr[i], tr[i] + 21, 0);
}
for(int i = 0; i < N; i++){
int x, y;
s... | #include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
ll div_2(ll a) {
ll ans = 0;
while(a % 2 == 0) {
ans++;
a /= 2;
}
return ans;
}
int main() {
int N;
cin >> N;
vector<ll> A(N);
ll min = 1000000000;
rep(i, N) {
cin >> A[i... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <bitset>
#include <queue>
... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
struct point{
int x, y;
}w[110];
int n;
double P[210];
const double PI = acos(-1.0);
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> w[i].x >> w[i].y;
}
for(int i = 1; i <= n; i++)
{
int cnt = 0;
... | 1 |
#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<iostream>
#include<string>
using namespace std;
int main()
{
char s[5000];
long long n,i,j,k,total=0,red[5000]={0},green[5000]={0},blue[5000]={0},r=0,g=0,b=0,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
}
for(i=1;i<=n;i++)
{
if(s[i]=='R')
{
r++... | 1 |
#include<iostream>
#include<string>
using namespace std;
string map[20]={""};
void check(int x,int y);
int main(void){
while(1){
int ans=0;
for(int i=0;i<12;i++){
cin>>map[i];
if(cin.eof())goto end;
}
for(int i=0;i<12;i++){
for(int j=0;j<12;j++){
... | #include <array>
#include <cstdlib>
#include <iostream>
#include <string>
#include <queue>
#include <vector>
class SSF {
private:
void ScanLine(std::vector<std::string> *map, const char lx, const char rx, const char y, const char oy, std::array<std::queue<char>, 4> *buffer) {
unsigned char i = lx;
while (i <= rx) ... | 1 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
double x[2]{}, y[2]{}, distance{};
cin >> x[0] >> y[0] >> x[1] >> y[1];
distance = sqrt(pow(x[0] - x[1], 2) + pow(y[0] - y[1], 2));
cout << fixed << distance;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) cout << "No" << endl;
else if (A == B || B == C || C == A) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0 |
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
size_t ldistance(string s, string t) {
/* Levenshtein Distance */
size_t slen=s.length(), tlen=t.length();
vector<vector<size_t>> dp(slen+1, vector<size_t>(tlen+1));
for (size_t i=0; i<=slen; ++i)
... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<set>
#include<array>
#include<cassert>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3);
int k, y;
for(int i=0;i<3;i++) cin >> x.at(i);
cin >> k;
sort(x.begin(), x.end());
y = x.at(2);
for(int i=0;i<k;i++) y = 2*y;
cout << x.at(0) + x.at(1) + y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int mod=1000000007;
int n;
cin >> n;
long to=0;
vector<int>a(n);
vector<int>b(n);
vector<int>c(n);
rep(i,n){
cin>>a.at(i)>>b.at(i... | 0 |
#include<bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
int n,x[101],y[101];
const double PI=acos(-1);
double k[101];
int main(){
scanf("%d",&n);
if(n==2){puts("0.5\n0.5");return 0;}
F(i,1,n) scanf("%d%d",x+i,y+i);
F(i,1,n){
int cnt=0;
F(j,1,n) if(j!=i){
k[++cnt]=atan2(x[j]-x[i],y[j]-y[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ... | 1 |
#include <iostream>
using namespace std;
int main(){
int l[10];
int v[2];
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", &l[0], &l[1],
&l[2], &l[3], &l[4], &l[5], &l[6], &l[7], &l[8], &l[9], &v[0], &v[1]) != EOF){
double sum = 0.0;
int i;
for(i=0; i<10; ++i) sum ... | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> q;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solv... | 0 |
#include<cstdio>
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
int point=0;
int base=0;
int out=0;
while(out!=3){
char s[8];
scanf(" %s",s);
switch(s[1]){
case 'I':
base++;
... | #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(){
int n; cin >> n;
vector<int> A;
A.push_back(0);
rep(i,n){
... | 0 |
#include <bits/stdc++.h>
#define assem99 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define endll '\n'
#define sz(a) (int)(a).size()
#define RWFile freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
int dx[] = { 0, -1, 0, 1, -1, 1, -1, 1 };
int dy[] =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,M;
cin >> N >> M;
vector<int>A(N+1);
for(int i = 1; i <= N; i++) {
cin >> A[i];
A[i] +... | 1 |
#include<iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 303;
const int MAX_A = 303;
const ll MOD = 998244353;
ll A[MAX_N], dp[MAX_N][MAX_N * MAX_A], sub_dp[MAX_N][MAX_N * MAX_A];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll sum = 0;
for (in... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int mod=998244353;
#define N 321
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,a[N],dp[... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int INF = 0x3f3f3f3f; c... | 0 |
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, M;
cin >> N >> M;
vector<unsigned long> uf(2 * N), sz(2 * N);
iota(uf.begin(), uf.end(), 0UL);
fill(sz.begin(), sz.begin() + N, 1);
const auto& find = [&uf](unsigned long i) -> unsigned long {
while(i != uf[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define maxn 240000
typedef long long LL;
const LL mod = 1000000007;
LL A[maxn], D;
LL mi[2][maxn * 4];
void build(int p, int o, int l, int r){
if(l == r){
mi[p][o] = p ? D * l + A[l] : - D * l + A[l];
return;
}
int m = (l + r) >> 1;
build(p, o * 2, l, m);
build(p, ... | #include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
#define LP pair<LL, LL>
const LL inf = 1e17;
struct segtree {
int n = 1;
vector<LP> node;//cost, place
void init(int N) {
node.clear();
while (N > n) n *= 2;
node.resize(n * 2,... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define il inline
#define gc getchar()
#define ll long long
#define int long long
#define ri register int
#define rc register char
#define rb register bool
#define rp(i,x,y) for(ri i=x;i<=y;++i)
#define my(i,x,y) for(ri i=x;i>=y;--i)
const int N=200000+10,inf=1e18;
int ... | #include <bits/stdc++.h>
using namespace std;
#define SIZE 262144
#define int long long
#define INF 1000000000000000000LL
class segtree{
public:
int seg[SIZE * 2];
void update(int a, int b){
a += SIZE;
seg[a] = b;
while(true){
a /= 2;
if (a == 0)break;
seg[a] = min(seg[a * 2], seg[a * 2 + 1]);
}
}
... | 1 |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
long long int m;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
long long int b;
vector<long long int> ss;
ss.push_back(0);
for (int i = 0; i < n; i++) {
cin >> b;
if ... | 0 |
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define ll long long
int main() {
ll a,b;
cin >> a >> b;
vector<ll> ay;
vector<ll> by;
for(ll i = 1; i <= sqrt(a);i++){
if(a%i == 0){
ay.push_back(i);
if(i != a/i){
ay.push_back(a/i);
}
}
}
for(ll ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1... | 1 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int n, m;
cin >> n >> m;
cout << n * m << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9+7;
int main(){
ll H, W; cin >> H >> W;
vector<string> S(H); for(int i = 0; i < H; i++) cin >> S[i];
ll bs = 0;
for(int... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r)... | 0 |
#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 pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1001, M = 2001;
int n, m, a, b;
vector<int> edge[N];
vector<int> path;
unordered_map<int, int> mp;
bool check(int from, int to) {
int s = mp[from];
int e = mp[to];
// index [s, e] in path
for (int i =... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <cstdio>
int fact(int k) {
int w = 1;
for (int i = 2; i <= k; i++)
w *= i;
return w;
}
int main() {
double sum = 0;
std::vector<int> k;
int n, x, y;
std::cin >> n;
std::vector<std::pair<int, int>> v(n);
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF... | #include<bits/stdc++.h>
using namespace std;
long long l,r;
int main()
{
scanf("%lld%lld",&l,&r);
long long ans=2019;
for(long long i=l;i<=r;++i)
{
for(long long j=i+1;j<=r;++j)
{
ans=min(ans,(i*j)%2019);
if(ans==0)
{
cout<<ans<<endl;
return 0;
}
}
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
bool ch[82][82][13000];
int main() {
ll h,w;
cin>>h>>w;
ll a[82][82],b[82][82];
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>a[i][j];
}
}
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>b[i]... | 0 |
#include<cstdio>
#define RI int
#define CI const int&
using namespace std;
const int N=6005;
int n,mod,f[N][N<<1],ans;
inline void inc(int& x,CI y)
{
if ((x+=y)>=mod) x-=mod;
}
int main()
{
RI i,j,k,t; scanf("%d%d",&n,&mod); n*=3; f[0][n]=1;
for (i=0;i<n;++i) for (j=-i;j<=i;++j) if (f[i][n+j])
inc(f[i+1][n+j-1],f[i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main(){
int N, MOD;
while(cin >> N >> MOD){
const int maxSize = 3*N+1;
vector<long long> inv(maxSize);
vector<long long> fact(maxSize);
for(int i=0;i<2;i++) inv[i] = fact[i] = 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | #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>
#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()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ve... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <queue>
#include <vector>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getch... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
const int maxn = 6010;
const int mod = 998244353;
int fac[maxn];
map <int,int> mp;
int expo(int x, in... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
rep(i, n) rep(j, m) cin >> a[i][j];
set<int> excluded;
int ans = 1e6;
for (int k = 0; k < m; k... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3f
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define N 305
using namespace std;
typedef pair<int,int> Pair;
const int mod = 1e9 + 7;
inline int add(int x, int y) { return (x += y) - (x >= mod ? mod : 0); }
inline void inc(int... | 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace st... | #include<bits/stdc++.h>
const int N=1e6+9,mo=998244353;
int f[N/2],f2[N/2],G[N/2],mi[N],vf[N],inv[N],fac[N],i,n,m,z,ans;
inline int C(int x,int y){return x<y?0:1ll*vf[y]*vf[x-y]%mo*fac[x]%mo;}
int main(){
*f=*f2=1;
for(i=*mi=*vf=*fac=1;i<N;++i)mi[i]=4ll*mi[i-1]%mo,inv[i]=i==1?1:1ll*(mo-mo/i)*inv[mo%i]%mo,
fac[i]=1l... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
long long x;
cin>>x;
long long thousand=(x/500)*1000;
long long rest=(x%500)/5*5;;
long long ans=thousand+rest;
cout<<ans... | #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=2... | 1 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
vector<int> nodes;
vector<pair<int, int>> child;
int n = 0;
for (int i = 0; i < m; i++){
string q;
cin >> q;
if (q == "insert"){
int k;
cin >> k;
if (n != 0){
int v = 0;
while (1){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Node{
ll key;
Node *parent,*left,*right;
};
struct Tree{
Node *nil,*root;
void init(){
root=nil;
}
void add(ll key){
Node *newnode;
Node *p;
newnode = (Node*)malloc(sizeof(Node));
... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <sstream>
#include <cmath>
#include <queue>
using namespace std;
int main(){
int n;
while(true){
cin >> n;
if(n == 0){
break;
}
for(int i = 0; i < n; i++){
int a, b, c;
cin >> a >> b >> c;
if(a == 100 ||... | /*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
b... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main () {
int n;
vector<int> values;
cin >> n;
cin.ignore();
for (int i = 1; i <= n; i++){
string tmp_value;
if(i == n)
getline(cin, tmp_value);
else
getline(cin, tmp_value, ' ');
values.push_back(stoi(tmp_value... | #include <bits/stdc++.h>
using namespace std;
int main(){
int b,a[100];
cin>>b;
for(int i=0;i<b;i++){
cin>>a[i];
}
for(int i=b-1;i>=0;i--){
cout<<a[i];
if(i!=0)cout<<" ";
}
cout<<endl;
return 0;
}
| 1 |
/* */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <... | #include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | //vec[i]の範囲外エラー表示
#define _GLIBCXX_DEBUG
//includeとusing
#include <bits/stdc++.h>
using namespace std;
//型名省略
using ll = long long;
using st = string;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using pll = pa... | 0 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i) = (n); (i) < (m); ++(i))
// constexpr int INF = 1e9;
constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9+7;
l... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
typedef pair<int, int> P;
const ll INF = 1ll<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 1000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::s... | 0 |
#include<bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main(){
string K;
cin >> K;
int D;
cin >> D;
vector<vector<vector<long long>>> dp(K.size() + 1, vector<vector<long long>>(D, vector<long long>(2, 0)));
dp[0][0][1] = 1;
for(int i = 0; i < (int)K.size(); i++){
for(int j ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int pref[250005], suff[250005], ans, prefix[250005], h , w, a, b;
const int mod = 1e9 + 7;
int BinPow(int x,int n){
if(n == 0)
return 1;
if(n == 1)
return x;
else{
int sum = BinPow(x, n / 2) % mod;
sum*=s... | 0 |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<ctime>
#include<set>
#include<iomanip>
#define sqr(x) (x)*(x)
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=... | #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 MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
//typedef pair<ll, P> T;... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int bubble_sort(int n,vector<int> &vec);
int main() {
int n,count;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
count=bubble_sort(n,a);
for (int i = 0; i < n; i++) {
cout << a[i];
if (i != n - 1) { cout << " ... | #include <cstdio>
void printArray(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i != N-1) {
printf("%d ", A[i]);
} else {
printf("%d", A[i]);
}
}
printf("\n");
}
void bubbleSort(int A[], int N) {
bool unsorted = 1;
int i = 0;
int counter = ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[n], b[n], c[n];
for(int i=0; i<n; i++) cin >> a[i];
for(int i=0; i<n; i++) cin >> b[i];
for(int i=0; i<n; i++) cin >> c[i];
sort(a, a+n);
sort(b, b+n)... | #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];
... | 0 |
#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;
#define ll long long
#define ull unsigned long long
// #define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_stati... | #include <bits/stdc++.h>
using namespace std; inline void fileio(const char* in, const char* out) { freopen(in, "r", stdin); freopen(out, "w", stdout); }
#define TD typedef
#define forx(i,n) for(int i = 0; i < (n); ++i)
#define forxr(i,n) for(int i = (n)-1; i >= 0; --i)
TD long long ll; TD long double ld; TD pair<int,i... | 0 |
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long INF = 1LL << 60;
ll MOD = 1e9+7;
int main() {
int A,B; cin>>A>>B;
cout<<A*B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fast_IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
typedef long long int lli;
typedef long long ll;
typedef long double ld;
signed main(){
fast_IO;
int t=1;
//cin>>t;
while(t--){
ld n,b;
cin>>n>>b;
... | 1 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <string> vs;
int main(void){
map <char, int> m;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
char c;
string r;
while (cin>>r){
int tmp, tmp2= m[r[0]],s=0;
i... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#... | 0 |
#include<iostream>
using namespace std;
int main(){
int w[10],k[10],tmp,i,j;
for(i=0;i<10;i++){
cin>>w[i];
}
for(i=0;i<10;i++){
cin>>k[i];
}
for(i=0;i<9;i++){
for(j=9;j>i;j--){
if(w[j]>=w[j-1]){
tmp=w[j];
w[j]=w[j-1];
w[j-1]=tmp;
}
if(k[j]>=k[j-1]){
tmp=k[j];
k[j]=k[j-1];
k[j-1]=tmp;
}
}
}
cout<<w[0]+w[1]+w[2]<<" "<<k[... | #include <cstdio>
#include <queue>
using namespace std;
int main(void)
{
priority_queue <int> w, k;
int tmp;
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
w.push(tmp);
}
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
k.push(tmp);
}
int sumw = 0, sumk = 0;
for (int i = 0; i < 3; i++){
sumw +=... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.