code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int m,l,r;
cin>>m>>l>>r;
if(!m&&!l&&!r)break;
int a[300];
for(int i=0;i<m;i++)cin>>a[i];
sort(a,a+m);
reverse(a,a+m);
int gap=0,n;
for(int i=l-1;i<r;i++)
if(a[i]-a[i+1]>=gap)n=i,gap=a[i]-a[i+1];
cout <<n+1<<endl;
}
r... | 1 |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
std::vector<long long> trips;
int ans=0;
cin>>n;
trips.resize(n);
for(auto &x:trips)
cin>>x;
n = trips.size();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
... | 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>;
using V = vector<int>;
int main(int argc, char const *argv[])
{
int n; cin >> n;
int a, b = 0;
long long int ans = 0;
rep(i,n) {
cin >> a;
if (a>b) ... | /*************************************
* problem: AT2164 Rabbit Exercise.
* user ID: 63720.
* user name: Jomoo.
* time: 2019-08-14.
* language: C++.
* upload place: Luogu.
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define puts_return(x) { puts(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x[100];
cin >> N;
if (N == 0) {
cout << '0';
return 0;
}
for (int i = 0; i < 100; i++) {
x[i] = 0;
}
for (int i = 0; N != 0; i++, N -= N & 1, N /= -2) {
x[i] = N & 1;
}
int foo = 99;
for (; x[foo] == 0; foo--);
for ... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string a = "";
w... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <deque>
#include <stack>
using namespace std;
typedef long long ll;
typedef p... | #include <bits/stdc++.h>
using namespace std;
int n, k;
double kitaichi(vector<int> p, int start, int k){
double ans;
for (int i = 0; i < k; i++){
double sum = 0;
for (int j = 1; j <= p[start+i]; j++){
sum += j;
}
ans += sum/p[start+i];
}
return ans;
}
int main() {
cin >> n >> k;
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, S;
cin >> A >> B >> S;
cout << ((regex_match(S, regex("\\d{" + A + "}-\\d{" + B + "}"))) ? "Yes" : "No") << "\n";
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
double per(double n){
if(n == 1) return n;
return n*per(n-1);
}
int main(){
int n;
cin >> n;
vector<pair<int, int>>p(n);
for(int i=0;i<n;i++){
int x, y;
cin >> x >> y;
p[i] = {x, y};
}
double ans... | #include"bits/stdc++.h"
using namespace std;
#define ll long long
#define mod 1000000007
#define prec(n) fixed<<setprecision(n)
int N;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A.at(i);
for(int k=0;k<K;k++){
vector<int> B(N+1,0);
for(int i=0;i<N;i++){
int left = max(0,i-A.at(i));
int right = min(i+A.at(i)+1,N);
B.at(left)... | 1 |
/* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout <... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for ( int i = 0 ; i < s.length()-1 ; i++ ) {
if ( s[i] ==... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n;
vector<string> vec_n(n);
rep(i, n) cin >> vec_n[i];
cin >> m;
vector<string> vec_m(100);
rep(i, m) cin >> vec_m[i];
int max = -... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
const vector<char> ss = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z',
'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V'... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define debug(x) c... | 1 |
#include <iostream>
#include <algorithm>
#define INF (2 << 28)
using namespace std;
int main(){
int n, m, cost[101][101];
while(cin >> n >> m, n||m){
fill_n(*cost, 101*101, INF);
for(int i = 1; i <= n; i++) cost[i][i] = 0;
while(m--){
int k; cin >> k;
i... | #include <bits/stdc++.h>
using namespace std;
void read(int &x){
char ch=getchar();x=0;
for (;ch==' '||ch=='\n';ch=getchar());
for (;ch!=' '&&ch!='\n';x=x*10+ch-'0',ch=getchar());
}
void write(int x){
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n,m,ans=2e9,SUM,dis[17][17],num[33000],dp[33000][17];
int main(){
... | 0 |
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 1005;
int id[MAX_N][MAX_N],A[MAX_N][MAX_N],dp[MAX_N*MAX_N];
bool visit[MAX_N*MAX_N],calc[MAX_N*MAX_N];
vector<int> G[MAX_N*MAX_N];
void init()
{
rep(i,MAX_N)
{
... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int N = 505;
const int P = 8005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch ... | 0 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <iostream>
// https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
class modint {
private:
static constexpr long long int MOD = 1000000000 + 7; // (10 ** 9) + 7
long... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
constexpr auto INF = 2147483647;
typedef long long ll;
struct Node{
int key;
Node *right, *left, *parent;
};
//property
Node *root, *NIL;
void Insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z= new Node;
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
while(b){
a%=b;
swap(a,b);
}
return a;
}
int main(){
int n;
cin>>n;
vector<int> line(n);
for(int i=0;i<n;++i){
cin>>line[i];
}
int man = line[0];
for(int i=1;i<n;++i){
man = gcd(man,line[i]);
}
vector<... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long i,j,k,a,b,c=0,d=0,n,m,t;
cin>>a>>b>>c>>d;
n=min(a,b);
m=min(c,d);
cout<<n+m;
return 0;
}
| #include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
static char str[1200000];
int len;
vector<pair<char, int> > x;
scanf("%s", str);
len = strlen(str);
x.reserve(len);
for(int i = 0; i < len; ++i) {
int it = i + 1;
while(it < len && str[it] == str[i]) ++it;
x.p... | 0 |
#include <stdio.h>
#include <string.h>
int main (){
char a[100];
char b[100];
char c[100];
scanf("%s %s %s", a, b, c);
int A = strlen(a);
int B = strlen (b);
for (int i = 0; i < 10; i++){
if ( a[A - 1] == b[0] && b[B - 1]== c[0]){
puts ("YES");
break;
}
else{
puts ("NO");
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
string a,b,c;
cin >> a >> b >>c ;
if(a.back() == b.front() && b.back() == c.front()) cout <<"YES" << endl;
else cout << "NO" << endl;
} | 1 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
/// khodaya komak... | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
#define all(x) begin((x)), end((x))
using namespace std;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define x first
#define y second
#define mp make_pair
#define pb push_back
template <typename TYPE> inline void chkmax(TYPE &x,TYPE y){x<y?x=y:0;}
template <typename TYPE> inline void chkmin(TY... | #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... | 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 K, T;
cin >> K >> T;
vector<int64_t> A... | #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<ll,ll>;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
//xにはvectorなどの... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
string s,p;
int main()
{
ft
ll t,i,j,n,m=0,l,r;
cin>>s;
n=s.size();
for(i=0;i<n;i++)
{
if((i+1)<n && s[i]==s[i+1])
{
cout<<(i+1)<<" "<... | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout <... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 99999999;
int main(void) {
int e, t;
vector<int> y2, z3;
for (t = 0; t*t <= 1000000; t++) y2.push_back(t*t);
for (t = 0; t*t*t <= 1000000; t++) z3.push_back(t*t*t);
while (cin >> e, e) {
int m = INF;
fo... | #include <iostream>
using namespace std;
int main() {
int e;
while (scanf("%d", &e) != EOF && e) {
int m = 1000;
for (int z=100; z>=0; z--) {
if (e < z*z*z) {
continue;
}
for (int y=0; y<m; y++) {
if (e < y*y + z*z*z) {
break;
}
int x = e - y*y - z*z*z;
if (x + y + z < m) {
m =... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, point = 0, max = 0;
cin >> N;
vector<string> blue(N);
set<string> ch;
for (int i = 0; i < N; ++i)
{
cin >> blue.at(i);
ch.insert(blue.at(i));
}
cin >> M;
vector<string> red(M);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, m, ans = 0;
cin >> n;
map<string, int> s;
map<string, int> t;
for (int i = 0; i < n; i++)
{
string blue;
cin >> blue;
s[blue]++;
}
cin >> m;
for (int i = 0; i < m; i++)
{
string red;
cin >> r... | 1 |
#include<stdio.h>
int main()
{
int N,R,A;
scanf("%d %d", &N, &R);
A =100*(10-N);
if(N>=10){
printf("%d", R);
}
else{
printf("%d", R + A);
}
return 0;
} | #include<iostream>
using namespace std;
long long int MOD = 1000000007;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
int main() {
//A
int n, r;
cin >> n >> r;
if (n >= 10) {
cout << r << endl;
}
else {
cout << r + 100 * (10 - n) << endl;
}
retur... | 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>;
int main() {
ll N, x;
cin >> N >> x;
vector<ll> a(N);
rep(i,N) cin >> a.at(i);
ll ans = 0;
rep(i,N) {
if (i == 0) continue;
if(a.at(i) + a... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
ll N; cin >> N;
ll a, b, c, d, e; cin >... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 1 |
#include <map>
#include <iostream>
using namespace std;
/** Problem0039 : Roman Figure **/
int main()
{
char num[110]; int now, old, ans;
map<char, int> list;
list.insert(map<char, int>::value_type('I', 1));
list.insert(map<char, int>::value_type('V', 5));
list.insert(map<char, int>::value_type('X', 10));
list.... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
long long A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2!=0){
A-=1;
}
B+=A/2;
A/=2;
}else{
if(B%2!=0){
B-=1;
}
A+=B/2;
B/=2;
... | #include <iostream>
#include <string>
typedef long long ll;
void print()
{
std::cout << std::endl;
}
template<class T>
void print(T param)
{
std::cout << param << std::endl;
return;
}
template<class T, class... S>
void print(T param1, S... param2)
{
std::cout << param1 << " "; print(std::forward<S>(param2).... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int needs[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
bool compare(vector<int>& a, vector<int>& b, int size) {
int cnta = 0, cntb = 0;
for (int i = 0; i < size; i++) {
cnta += a[i];
cntb += b[i];
}
... | #include<iostream>
#include<cstdio>
using namespace std;
int n,S,X[202020],st[202020],top;
long long P[202020];
void solve(int l,int r)
{
if(S<=X[l]) return (void)(st[++top]=r);
if(S>=X[r]) return (void)(st[++top]=l);
if(P[l]<P[r]) return st[++top]=l,P[r]+=P[l],solve(l+1,r);
else return st[++top]=r,P[l]+=P[r],solve... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
ll x,y;
cin >> x >> y;
ll ans;
if (x * y > 0) {
if (y >= x) ans = y - x;
else ans = x - y +... | #include <stdio.h>
int main ()
{
char x[100];
char y[100];
scanf("%s%s\n", &x,&y);
printf("%s%s\n", y, x);
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string s;
cin >> s;
string ans = "Yes";
for(int i = 0; i < a; i++){
if(!(s[i] >= '0' && s[i] <= '9')) ans = "No";
}
if(s[a] != '-') ans = "No";
for(int i = a+1; i < a+b+1; i++){
... | #include<stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
int size = A + B + 1;
char str[100];
scanf("%s", str);
int i, count = 0;
if (str[A] == '-')
{
for (i = 0; i < size; i++)
{
if (str[i] >= '0' && str[i] <= '9')
{
... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
//#define INF (1e9+1)
#define INF (1LL<<59)
#define int ll
signed main(){
int v,e;
cin>>v>>e;
int d[101][101]... | #include<bits/stdc++.h>
#define MAXN 1000005
#define INF int(16843009)
using namespace std;
int N,M;
struct edge{
int u,v;
edge(int u=0, int v=0):u(u), v(v){}
};
vector<edge> adjc[MAXN];
vector<int> adj1[MAXN];
void addE(int u, int v){
cerr<<"addE: "<<u<<" "<<v<<endl;
adj1[u].push_back(v);
adj1[v].push_back(u)... | 0 |
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<ll>x(n), y(m); for (auto&& xx : x)cin >> xx;for (auto&& yy : y)cin >> yy;
sort(x.begin(), x.end());sort(y.begin(), y.end());
ll a = 0, b = 0;
fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph= vector<vector<int>>;
const int TBC= -1;
void DFS(const Graph &tree, int parent, int root, vector<int> *parents, vector<int> *pre_timestamp, vector<int> *post_timestamp, vector<int> *depth){
if(parents->at(root)==TBC){
parents->at(root)= parent;
pre_t... | #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 fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) <... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
string L = "";
for_(i,0,26) L += char('a' + i);
for_(i,0,26) L += char('A' + i);
int n;
while (cin >> n, n) {
vector< int > k(n);
for_(i,0,n) cin >> k[i];
string s;
cin >> s;
int m = s.size()... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2000+5,base=2001*3;
int f[N*3][N*6],mod;
void add(int &x,int y){
x=(x+y)%mod;
}
signed main(){
int n;
cin>>n>>mod;
n*=3;
f[0][base]=1;
for(int i=0;i<n;++i)
for(int j=-i;j<=i;++j)
if(f[i][j+base]){
add(f[i+1][j+1+base],f[i][j+b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> pref(n, 0), suff(n, 0);
for (int i = 1; i < n; i++) {
pref[i] = pref[i-1] + (s[i-1] == 'W');
}
for (int i = n-2; i >= 0; i--) {
suff[i] = suff[i+1] + (s[i+1] ==... | 0 |
/*!enjoy karo yaar!*/
//CF,CC,AtC,SPOJ: hp1999
//HE: hemant269
//HR: hemant2132
#include<bits/stdc++.h>
using namespace std;
/*-----<Defines>-----*/
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#defin... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> num(N, -1);
for (int i=0; i<M; i++) {
int si, ci;
cin >> si >> ci;
si--;
if ((num[si] != -1) && (num[... | 0 |
#include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,ans=0x3f3f3f3f;
int a[100000+5];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-m+1;i++){
int j=m+i-1;
ans=min(ans,min(abs(a[i])+abs(a[j]-a[i]),abs(a[j])+abs(a[j]-a[i])));
}
if(an... | #include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <numeric>
#include <queue>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <map>
#include <functional>
#include <limits>
#include <set>
#include <stack>
#include ... | 1 |
#include <stdio.h>
int main(){
int n,now=-1,temp,a[100000];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
if(a[i]<=a[n-1]){
now++;
temp=a[i];
a[i]=a[now];
a[now]=temp;
}
}
for(int i=0;i<now;i++)printf("%d ",a[i]);
printf("[%d]",a[now]);
for(int i=now+1;i<n;i... | #include<iostream>
#include<map>
#include<string>
#include<vector>
using namespace std;
int inf = 10000000;
int n;
vector<int> a;
int partition(int p, int r){
int x = a[r-1];
int i = p-1;
for(int j=p; j<r; j++){
if( a[j] <= x ){
// i = i + 1;
swap(a[++i], a[j]);
}
}
// swap(a[i+1], a[r]);
... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
ll x;
cin >> x;
ll ans = (x / 11) * 2;
if(ans > 0){
x %= 11;
}
if(x > 6){
ans += 2;
}else if(x > 0){
ans++;
}
cout << ans << endl;
} | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long int
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>
#define fi first
#define se second
#define psb push_back
#define ppb pop_back
#define fio ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
int w, i = 0;
cin >> s >> w;
while(i < (int)s.size()) {
ans += s[i];
i += w;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,ans=0; cin >> A >> B;
if(A>B) ans += 2*A -1;
else if(A<B) ans += 2*B -1;
else if(A==B) ans += 2*A;
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
#define pvec(vec) {for (auto v: vec) cout << v << ' '; cout << endl;}
#define pivec(vec) {rep(i, 0, vec.size()) cout << i << ':' << vec[i] << ' '; cout << endl;}
using namespace std;
using ll... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#incl... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m; scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i)
if (2 * i < m + 2) printf("%d %d\n", i, m + 2 - i);
for (int i = 1; i <= m; ++i)
if (2 * i < m + 1) printf("%d %d\n", m + 1 + i, 2 * m + 2 - i);
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
int main(){
ll n;
cin>>n;
stack<char> st;
while(n!=0){
n--;
st.push('a'+n%26)... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
using namespace std;
string convert(string str) {
int idx = 0;
for (;;) {
idx = str.find("Hoshino", idx);
if (idx == string::npos) break;
str.replace(idx, 7, "Hoshina");
idx += 7;
}
return str;
... | 0 |
#include <stdio.h>
int main(){
char c;
char s[21]={'\0'};
int i = 0,j;
c = getchar();
while(c != '\n'){
for(j=i;j>=0;j--){
s[j+1] = s[j];
}
i++;
s[0] = c;
c = getchar();
}
printf("%s\n",s);
} | #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>;
vector<ll> ve... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k,x;
cin >> k >> x;
for(int i=-k+1;i<k;i++){
cout << x+i << " ";
}
} | #include <bits/stdc++.h>
//登録しよう！→ https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
using namespace std;
using ll = long long;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}//a,bの最大公約数(gcd)を求める
ll lcm(ll a,ll b){return abs(a*b)/gcd(a,b);}//a,bの最小公倍数(lcm)を求める
vector<ll> enum_div(ll n){vector<ll> ret;for(int i=1 ; i*i... | 0 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
void solve() {
int M;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll M;
deque<ll> d;
deque<ll> c;
deque<ll> e;
int main(){
cin >> M;
for(int i=0;i<M;i++){
ll a,b;
cin >> a >> b;
d.push_back(a);
c.push_back(b);
}
ll count = 0;
while(d.size() > 0){
if(c[0] ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
template< typename T >
size_t longest_increasing_subsequence(const vector< T > &a, bool strict) {
vector< T > lis;
for(auto &p : a) {
typename vector< T >::iterator it;
if(strict) it = lower_bound(begin(lis), end(lis), p);
else it = upper_bound(begin(lis), ... | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) //0.0000001 the value
#defi... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
bool check(string s){
if(s == "Vacant") return true;
else return false;
}
int main(){
ios::sync_with_stdio(false);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | 1 |
#include<iostream>
#include<algorithm>
using namespace std ;
int W , H , sx , sy ;
int ans ;
char p ;
int dx[] = {-1,0,1,0} ;
int dy[] = {0,1,0,-1} ;
int table[23][23] ;
void DFS( int x , int y , int cnt ){
if( cnt+1 >= ans ) return ;
for( int i=0 ; i<4 ; i++ ){
int nx = x + dx[i] , ny = y + dy[i] ;
if( ta... | #include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int a[5];
bool isStraight(){
vector<int> n;
for(int i=0 ; i<5 ; i++){
n.push_back(a[i]);
}
sort( n.begin(), n.end() );
if( n[0]+1 == n[1] && n[1]+1 == n[2] && n[2]+1 == n[3] && n[3]+1 == n[4]){
... | 0 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int d;
while(cin){
cin >> d;
if(!cin) break;
int itg=0;
for(int i=1;i*d<600;i++) itg+=pow(i*d,2)*d;
cout << itg << endl;
}
} | #include <iostream>
using namespace std;
int main()
{
int d;
while (cin >> d)
{
cout << 72000000 - 180000 * d + 100 * d * d << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
vector<unsigned long> tapi(1048576, 1), tapu(1048576), tape(1048576);
unsigned long ans{0}, t{500000004}, a{0}, z{0}, A;cin >> A;
while(cin >> A)if(a ^= A){
(tapu[a] += (tapi[a] += tapu[a] * (... | 1 |
#define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
#inc... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; ... | 1 |
#include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX ... | #include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n,... | 1 |
#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 reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
string s;
cin >> n >> s;
ll r = 0, b... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double ep... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int N_MAX=100001;
long long INF = 123456789123456789;
typedef pair<long long,int> P;
void dijkstra(int s, int V, vector<P>* g, long long* d){
if(d[s]==0)
return;
int i,v;
P p,e;
priority_queue<P, vector<P>, greater<... | #include "bits/stdc++.h"
using namespace std;
int dp(int curr, int T, const vector<int>& A, const vector<int>& B, vector<vector<int>>& memo) {
int N = A.size();
if (curr == N) {
return 0;
}
if (T <= 0) {
return 0;
}
if (memo[curr][T] >= 0) {
return memo[curr][T];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int a,b;
void solve(){
cin >> a >> b;
cout << a*b << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,i,ans=0,p,q,r,s;
cin >> A >> B;
for(i=A;i<=B;i++){
p=i%10;
q=(i/10)%10;
r=(i/1000)%10;
s=(i/10000)%10;
if(p==s&&q==r){
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string s;
cin >> s;
string t = "";
for (int i = 0; i < 2; i++){
for (int j = 0; j < 2; j++){
string tmp;
if (i == 0){
tmp += 'S';
} else {
tmp += 'W';
}
if (j == 0){
tmp += 'S... | #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)... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int a[50001];
int S[50001];
int main(){
while(cin >> n && n > 0){
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
S[0] = 0;
for (int i = 0; i < n ; ++i)
{
S[i + 1] = S[i] + a[i];
}
int max = -100000;
... | #include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),... | 0 |
#include<iostream>
using namespace std;
int main(){
int tuki[13]={0,0,31,60,91,121,152,182,213,244,274,305,335};
string cal[400];
cal[1]="Thursday";cal[2]="Friday";cal[3]="Saturday";cal[4]="Sunday";
cal[5]="Monday";cal[6]="Tuesday";cal[7]="Wednesday";
for(int i=1;i<=366;i++)
cal[i+7]=cal[i];
int a,b;
... | #include<stdio.h>
int main()
{
int p[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int M,D,sum;
while(1)
{
sum=0;
scanf("%d",&M);
scanf("%d",&D);if(M==0)break;
if(M==0)break;
for(int i=0;i<M-1;i++)
sum+=p[i];
sum+=D;
switch(sum%7)
{
case 4:
printf("Sunday\n");break;
case 5:
printf("Monday\n");break;
case 6:
printf("Tue... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
string S;
cin >> S;
string ans="AC";
if (S[0]!='A') {ans="WA";}
int c=0, ci;
for (int i=2; i<S.size()-1; i++) {
if (S[i]=='C') {
c++;
ci=i;
}
}
if (c!=1) {ans="WA";}
for (int i=0; i<S.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int count = 0;
map<int, int> mp;
for (int i = 0; i < 3; i++) {
int a;
cin >> a;
if (mp[a])
count++;
mp[a] = 1;
}
if (count == 1)
cout << "Yes" << endl;
else
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
ll n,a,b,c,d,e;cin>>n>>a>>b>>c>>d>>e;
ll s=min(min(min(min(a,b),c),d),e);
ll ans=(n-1)/s+5;
cout<<ans<<"\n";
return 0;
}
| #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>
#include <chrono>
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T conditi... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(true){
int n, k, x, a, b, fee[101][101];
cin >> n >> k;
if(n == 0 && k == 0){
break;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fee[i][j] = 1000000000;
}
}
for(int i = 0; i < k; i++){
... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, tmp0 = 0, tmp1 = 0;
int tmp2 = 0, tmp3, out1 = 0, out2 = 0;
int a[100];
scanf("%d", &n);
while (n) {
for (tmp3=0;tmp3<100;tmp3++) a[tmp3] = 0;
tmp0 = 0, out2 = 0;
while (tmp0 < n) {
tmp1 = 0... | #include <stack>
#include <queue>
#include <cstdlib>
#include <iomanip>
#include <utility>
#include <math.h>
#include <vector>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n && n != 0)
{
int a[11][11];
for(int i = 0;i... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(int n, vector<int> & dims){
int dp[100][101] = {{0}};
for (int span = 2; span != n + 1; ++span){
for (int first = 0; first + span != n + 1; ++first){
for (int last = first + span; last != n + 1; ++last... | 0 |
#include<iostream>
#include<string>
using namespace std;
int data[7];
void N(){int x=data[5];data[5]=data[1];data[1]=data[2];data[2]=data[6];data[6]=x;}
void S(){int x=data[5];data[5]=data[6];data[6]=data[2];data[2]=data[1];data[1]=x;}
void E(){int x=data[3];data[3]=data[1];data[1]=data[4];data[4]=data[6];data[6]=x;}
v... | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define INF (1<<29)//INF
#define F first
#define S second
#define VS vector<string>
#define VI vector<int>
#define REPI(i,s,n) for(int i=s;i<n;i++)//sからn未満の間iを回す
#define REPJ(j,s,n) for(int j=s;j<n;j++)//sからn未満の間iを回す
#define RREPI(i,s,n) for(int i=s;i>=n;i--)//sからn以下の間iを回す
#... | #include <bits/stdc++.h>
using namespace std;
#define INF (1<<29)
set<string> st;
void solve(int K, int S, vector<string> &s, string str)
{
if (K == 0) {
st.insert(str);
return;
}
int N = s.size();
for (int i = 0; i < N; i++) {
if (S >> i & 1) continue;
solve(K-... | 1 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define _ std::ios_base::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int mod = 1e9+7;
const int LOG =... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,X,T;
cin >> N >> X >> T;
int ans = N/X;
double mod = N%X;
if(mod > 0){
ans = ans + 1;
}
ans = ans * T;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
#define ALL(x) (x).begin(),(x).end()
int main(){
ll K;
cin >> K;
ll N = 50;
vector<ll> A(N);
// K/N周回す
for(int i=0;i<N;i++) {
A[i] = (N-1) + K/N;
}
// あまりの処理
ll d = K % N;
for(int i=0;i<d... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(... | 1 |
#include <stdio.h>
int main(){
int H1,H2,M1,M2,K;
scanf("%d %d %d %d %d",&H1,&M1,&H2,&M2,&K);
int sum1 = (H1*60) + M1;
int sum2 = (H2*60) + M2;
int sum3 = sum2 - sum1;
printf("%d", sum3 - K);
return 0;
} | //
// nomura_a.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll INF = 10000... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N,Q; cin >> N >> Q;
stri... | #include<iostream>
// Need start
#include<vector>
#include<algorithm>
#include<functional>
// Need end
#include<cmath>
#include<iomanip>
using namespace std;
// Copy start
template<typename T>
class Polygon2D {
private:
T x_, y_;
int idx_;
public:
Polygon2D() {}
Polygon2D(T x, T... | 0 |
#include <iostream>
#include <limits.h>
using namespace std;
int m;
int dijkstra( const int data[101][101], int start, int end )
{
int i,j,next,min;
bool visited[101];
int distance[101];
for( i = 1;i <= 100;i++ ){
visited[i] = false;
distance[i] = INT_MAX;
}
distance[start] = 0; next = start;
do{
i =... | #include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (... | 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,q,m=0;
cin>>n>>q;
vector<ll> a(n+1);
string s;
cin>>s;
for(int i=1;i<n;i++)
{
if(s[i-1]=='A'&& s[i]=='C')
{
a[i]=1;
}
}
for(int i=1;i<=n;i++)
a[i]+=a[i-... | /*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ... | 0 |
#include <iostream>
int main() {
int k[10] = {}, w[10] = {};
int swap;
for (int i = 0; i < 10; i++) {
std::cin >> w[i];
}
for (int j = 0; j < 10; j++) {
std::cin >> k[j];
}
for (int n = 1; n < 10; n++) {
for (int m = 0; m < 10; m++) {
if (w[n] > w[m]) {
swap = w[m];
w[m] = w[n];
w[n] = swa... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> vec(4); int his, geo, ans;
for (int i = 0; i < 4; i++) cin >> vec[i];
cin >> his >> geo;
sort(vec.begin(), vec.end(), greater<int>());
ans = vec[0] + vec[1] + vec[2] + (his > geo ? his : geo);
cout << ans << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> A(3);
for (int i = 0; i < 3; ++i) cin >> A[i];
long long K;
cin >> K;
sort(A.begin(), A.end());
for (int i = 0; i < K; ++i) A.back() *= 2;
cout << A[0] + A[1] + A[2] << endl;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#incl... | 0 |
#include <stdio.h>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long i = 2; i * i <= N; ++i) {
if (N % i != 0) {... | // C - Factors of Factorial
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a... | 1 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,sum,maxim;
cin>>a>>b>>c;
sum=a+b+c;
maxim=max(a,b);
maxim=max(maxim,c);
cout<<sum-maxim;
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int a[3];
for ( int i = 0; i < 3; i++ ) {
cin >> a[i];
}
sort(a, a+3);
cout << a[0] + a[1] << endl;
return (0);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define IINF 1e9
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
// memo:B... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
int a[1000];
int b[1000];
int c[1000];
int ma... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m, n;
cin >> m >> n;
int aux = 1;
int res = 0;
while(true){
if(aux >= n){break;}
--aux;
aux += m;
res++;
}
cout << res <<"\n";
return 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(){
int k,t;
cin >> k >> t;
vector<int> n(t);
for(int i = 0;i < t;i++)cin >> n[i];... | 0 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 0 |
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | #include<iostream>
using namespace std;
int main(void)
{
int n,m,mo[1001],bo[1001],ans[1001],A=0,i2;
cin>>n>>m;
for(int i=0;i<n;i++){
ans[i]=0;
}
for(int i=0;i<n;i++){
cin>>mo[i];
}
for(int i=0;i<m;i++){
cin>>bo[i];
}
for(int i=0;i<m;i++){
for(int j=0;... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<d... | //最少全域木
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int G[103][103];
int V;
int NG[103][103];//新しくできるほう
int used[103];
int main(){
int ans=0;
cin>>V;
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
cin>>G[i][j];
}
}
for(int i=0;i<103;i++)for(int j=0;j<103;j++)NG[i][j]=-1;
used[0... | 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 n;
bool trust(int flag, int index) {
bool trust = (flag >> index) & 1;
return trust;
}
int count (int flag) {
int dst = 0;
rep(i, n) if (trust(flag, i)) dst+... | #include<iostream>
using namespace std;
int main(){
int n;
string A,B,C;
cin>>n;
int count=0;
cin>>A>>B>>C;
for(int i=0;i<n;i++){
if(A[i]==B[i]){
if(B[i]!=C[i])
count++;
}
else if(B[i]==C[i]){
count++;
}
else if(A[i]==C[i]){
count++;
}
else{
count+=2;
}
}
cout<<count;
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const ll MMM = -1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i=0; i<n; i++) cin >> a[i];
int m = n/2;
if (n&1) {
ll ans = MMM;
vector<ll> suff(m+... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define ... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_map>
//#include"testlib.h"
#define endl "\n"
#define all(v) v.begin(),v.end()
#define allr(s) s.rbegin(),s.rend()
#define RT(s) return cout<<s,0
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1e-8
#define watch(x) cout << (#x)... | #include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define IL inline
#define reg register
#define LL long long
#define N 200010
#define INF 0x3f3f3f3f
using namespace std;
int n,i,j;
int ans=... | 1 |
#include<bits/stdc++.h>
#define maxn 505050
using namespace std;
typedef long long ll;
struct edge{
ll x,y,z;
}e[maxn*4];
ll ans,pre[maxn],fa[maxn],n,a[maxn],b[maxn],c[maxn],d,p,q;
int l[maxn],r[maxn];
int ffind(int x){
if (pre[x]==x) return x;
pre[x]=ffind(pre[x]); return pre[x];
}
void union_(int u,int... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,l=0;
cin>>n;
vector<int> a(n+2);
for(i=1;i<=n;i++) cin>>a.at(i);
for(i=0;i<n+1;i++) l+=abs(a.at(i+1)-a.at(i));
for(i=1;i<n+1;i++){
if((a.at(i+1)-a.at(i))*(a.at(i)-a.at(i-1))>=0) cout<<l<<endl;
else cout<<l-2*min(abs(a.at(i+1)-a.at(i)),... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 400005
#define MOD 998244353
#define LL long long int
LL ans,res,C[MAXN],fac[MAXN],revfac[MAXN];
int n,m,k;
LL qpow(LL a,int b)
{
LL tmp=1;
while(b)
{
if(b&1)
tmp=tmp*a%MOD;
a=a*a%MOD;
b>>=1;
}
return tmp%MOD;
... | #include <bits/stdc++.h>
#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(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
// ------------------------------
int main() {
int N;
string s, t... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
ll t=((h2-h1)*60)-m1+m2;
ll d=t-k;
if(d<=0){
cout<<"0"<<"\n";
}
else{
cout<<d<<"\n";
}
return 0;
} | #include<stdio.h>
int main()
{
int h1,h2,m1,m2,k;
scanf("%d%d%d%d%d",&h1,&m1,&h2,&m2,&k);
m1+=60*h1;
m2+=60*h2;
printf("%d\n",m2-m1-k);
return 0;
} | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
int h, w;
cin >> h >> w;
vector< vector<int> > a( h,... | 1 |
#include<cstdio>
#include<cstring>
#include<stack>
struct p{
int x;
int y;
};
using namespace std;
int main(){
int w,h,sx,sy,gx,gy,n,c,d,x,y,i,j,k,o;
int map[100][100];
int used[100][100];
int mx[4]={-1,0,1,0};
int my[4]={0,-1,0,1};
p v,u;
stack<p> s;
while(1){
scanf("%d %d",&w,&h);
if(w==0&&h==0){
bre... | #include <iostream>
#include <string>
using namespace std;
string ans;
int w,h,gx,gy;
int map[110][110];
int dx_[4] = {0,1,0,-1};
int dy_[4] = {1,0,-1,0};
int dx[2][8] = {
{0,1,2,3,0,1,2,3},
{0,1,0,1,0,1,0,1}
};
int dy[2][8] = {
{0,0,0,0,1,1,1,1},
{0,0,1,1,2,2,3,3},
};
void solve(int x,int y,int color){
if( ans =... | 1 |
#include <iostream>
using namespace std;
//const double PI = acos(-1);
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
... | #include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
//#include <unordered_map>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for(int i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
typedef long long int ll;
using namespace std;
... | 0 |
#include <bitset>
#include <tuple>
#include <string>
#include <array>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cmath>
#ifdef LOCAL
#include <iostream>
#endif
using namespace std;
#define rep(i, n) for (int i =... | #include<bits/stdc++.h>
using namespace std;
int main(){
int s=0;
int a=0,b=INT_MAX;
int c;
for(int d=0;d<4;d++){
scanf("%d",&c);
a+=c;
b=min(b,c);
}
a-=b;
b=INT_MAX;
for(int d=0;d<2;d++){
scanf("%d",&c);
a+=c;
b=min(b,c);
}
printf("%d\n",a-b);
} | 1 |
#include<stdio.h>
int main()
{
int n, A[10001];
scanf("%d", &n);
int i;
for (i = 0; i <= n - 1; i++)
{
scanf("%d ", &A[i]);
}
long int min = 1000001, max = -1000001, total = 0;
for (i = 0; i <= n - 1; i++)
{
if (min > A[i]) min = A[i];
if (max < A[i]) max = A[i];
total = total + A[i];
}
printf("%ld ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#defi... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=103,INF=1<<30;
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
int N;
bool DFS(vector<ll> A){
vector<ll> left(N+2),right(N+2);
ll sum=0;
for(int i=0... | #include<bits/stdc++.h>
using namespace std;
const int N = 1000 * 100 + 10;
int n, a[N], tt = 0;
string ans[2] = {"First\n", "Second\n"};
void solve() {
long long sum = 0;
bool one = false;
int cnt[2] = {0, 0};
for (int i = 0; i < n; i++) {
one |= a[i] == 1;
sum += a[i] - 1;
cnt[a[i] & 1]++;
}
if (one) {... | 1 |
#include <bits/stdc++.h>
#include <cmath>
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;
typedef pair<ll, ll> P;
const ll INF = 10e17... | #include <iostream>
using namespace std;
int main() {
int n, m;
int a[1010][2] = {0};
int b;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i][0];
}
for (int i = 0; i < m; i++) {
cin >> b;
for (int j = 0; j < n; j++) {
if (a[j][0] <= b) {
a[j][1]++;
break;
}
}
}
int max[2] = {0};... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.