code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
char Decryption(int k, char s) {
char station[] = {'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'... | #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin>>n;
if(n==0) break;
int a[100];
lp(i,n){
cin>>a[i];
}
int count=0;
char x;
scanf("%c",&x);
while(1){
scanf("%c",&x);
if('A'<=x&&'z'>=x){
lp(i,a[count]){
x--;
i... | 1 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<string, int>mp;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
mp[s]++;
}
int M;
cin >> M;
for (int i = 0; i < M; ++i) {
string s;
cin >> s;
mp[s]--;
}
int ans = 0;
for (auto x : mp) {
ans = max(ans, max(0, x.se... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 0 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstdio>
#include <queue>
using namespace std;
long long cnt = 0;
void merge(vector<int> &v, int left, int mid, int right){
int n1 = mid - left;
int n2 = ri... | 1 |
#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)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l[10], v[2];
double total, point, now;
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]) + 1) {
total = 0;
now = 0;
for(int i = 0; i < 10; ++i) tota... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int l[10], v1, v2, cnt;
double n, d, t;
char ch;
while (cin>>l[0]>>ch){
n = l[0];
for (int i = 1; i < 10; i++)
{
cin >> l[i] >> ch;
n += l[i];
}
cin >> v1 >> ch >> v2;
t=n/(v1+v2);
d=v1*t; //列車1の動く距離
cnt=0;
whi... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Z algorithm O(|S|)
vector<int> Z_algorithm(vector<int> &s) {
vector<int> Z(s.size());
Z[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j]) j++;
Z[i] = j;
if (j == 0) {
... | //\\//\\ * * * //\\// ||
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
template <typename T>
class fenwick {
public:
vector<T> fenw;
int n;
fenwick(int _n) : n(_n) {
fenw.resize(n);
}
void modify(int x, T v) {
while (x ... | 0 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <stdio.h>
int main(void){
int n, a[100], i, j;
char c, s[53] = {"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
while(1){
scanf("%d",&n);
if(!n) break;
for(i = 0;i < n;i++)
scanf("%d",&a[i]);
getchar();
for(i = 0;(c = getchar()) != '\n';i++){
for(j = 0;j < 52;j++){
if(s[j] == c... | 1 |
#include<cstdio>
int main(){
int n,max,sum,t;
scanf("%d", &n);
while(n){
scanf("%d", &t);
max = sum = t;
for(int i = 1; i < n; i++){
if(sum < 0){
sum = 0;
}
scanf("%d", &t);
sum += t;
if(sum > max){
max = sum;
}
}
printf("%d\n", max);
scanf("%d", &n);
}
return 0;
} | #include <bits/stdc++.h>
#define iso ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
using namespace std;
int main()
{ iso
unsigned ll n,s=0,w=0;
cin>>n;
vector<unsigned ll>vec;
while(n--)
{
ll x;
cin>>x;
vec.push_back(x);
s+=x;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,k;
cin >> N >>k;
int sum;
if(k==1){
sum = N+1;
}
else if(k==2||k==3||k==4){
if (N==1){
sum = 2;
}
else{
sum = 4 + k*(N-2);
}
}
else if(k==5||k==6||k==7){
if (N==1){
sum = 2;
}
else if(N==2){
... |
#include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main()
{
long long n,k,sum=0;
cin>>n>>k;
long long ans = 1;
while(n--){
long long ans2 = ans*2;
long long ani = ans+k;
if(ans2 < ani)
ans = ans2;
else ans = ani;
}
cou... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n - 1)
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
else
{
cout << "Hello World" << endl;
}
return 0;
} | 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() {
int n;
cin >> n;
int res;
for (int i = n; i <= 999; i++) {
string str = to_string(i);
bool ok = true;
for (int j = 0; j < str.length() - 1; j... | /*ॐॐ*/
/* I have already deleted My old account because somebody stole my code
and i have no idea how. If you are copying this code atleast make it look different.
Change variable names or change some Data structres or anything just make sure MOSS do not
Detect Anything.
Yours Faithfully
Shobhit Yadav */
/* I do not f... | 0 |
//FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <list>
#include <string.h>
#include <functional>
//#include <Windows.h>
//#include "Library.h"
//#include "Math.h"
usin... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
vector<int> v(1001);
int cnt=0;
for(int i=1; i<1002; i++){
if(i%3==0) cnt++;
v[i]=cnt;
}
int n; cin>>n;
cout<<v[n]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << ... | 1 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
string s;
int main(void){
cin >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
string str;
vector<int> vec(26, 0);
cin >> str;
if (str == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1;
} else if (str.size() == 26) {
string tmp = str;
next_permutation(str.begin(), str.end());
stri... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int M;
cin >> M;
vector<int64_t> d_vec(M), c_vec(M);
for (int i = 0; i < M; ++i)
cin >> d_vec.at(i) >> c_vec.at(i);
int64_t sum_digit = 0;
int64_t num_digit = 0;
for (int i = 0; i < M; ++i) {
sum_digit += d_vec.at(i)... | #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
int main(){
// read problem
long long int M, tmp1, tmp2;
std::vector<long long int> d, c;
... | 1 |
#include <bits/stdc++.h>
//{{{ graph.hpp
#ifndef INCLUDE_GRAPH_HPP
#define INCLUDE_GRAPH_HPP
#include <vector>
namespace orislib {
struct Edge {
typedef int weight_t;
int from, to;
weight_t w;
Edge(int from, int to, weight_t w) : from(from), to(to), w(w) {}
bool operator<(const Edge& e) const {
return w ... | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int V,E,r;
const int Inf = 10000*100000+100;
ll C[100010];
int main(){
while(cin >> V >> E >> r && V >0){
vector< vector< P > > v(V+10);
for(int i=0;i<E;i++){
ll s,t,d;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ld = long double;
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> a(n),b(n),c(n);
rep(i,n) cin >> a[i];... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, m, a, b;
int grid[N][N];
void solve() {
cin >> n >> m >> a >> b;
memset(grid, 0, sizeof(grid));
for(int i = 1; i <= b; i++) {
for(int j = 1; j <= a; j++) {
grid[i][j] = 1;
}
}
for(int i = b + 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
/*
A
001111B
001111
110000
110000
110000
*/
int H, W, A, B;
scanf("%d %d %d %d", &H, &W, &A, &B);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i < B) ^ (j < A)) {
cout... | 1 |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define INF (2 << 28)
#define fr first
#define... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int cnt = 0;
vector<int> g;
void insertionSort(vector<int> &a, int g)
{
for (int i = g; i < a.size... | 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
for(int i=0;i<S.size();i++){
if(i%w==0){
cout << S.at(i);
}
}
cout << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x, y; cin >> x >> y;
if (0 < x && 0 < y) {
if (x < y) cout << y - x << endl;
else cout << abs(y - x) + 2 << endl;
}
if (x == 0) {
if (x < y) cout << y << endl;
else cout << abs(y) + 1 << endl;
}
if (y == 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int count[n + 1];
// i文字目までにWがいくつあるか(1-indexed)
// 累積和テーブル
count[0] = 0;
rep(i, n) {
// その地点までの累積和だから前のcount[i]を代入してる
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
... | #include<iostream>
#include<vector>
using namespace std;
struct data{
int a, b, c;
data(int _a, int _b, int _c) : a(_a), b(_b), c(_c) {}
};
int main(){
int a, b, c;
while(cin >> a >> b >> c){
if(a + b + c == 0) break;
int da[a], db[b], dc[c];
for(int i = 0; i < a; i++) da[i] ... | 0 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w, a, b;
scanf("%lld", &h);
... | #include<iostream>
using namespace std;
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
if((i<=B && j<=A) || (i>B && j>A)){
cout << 0;
} else{
cout << 1;
}
}
c... | 1 |
/*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size()==3){
for(int i=2;i>=0;i--){
cout << s.at(i);
}
cout << endl;
}
else{
cout << s << endl;
}
}
| #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ex, ey;
char a[105][105];
short dp[101][101][101][101], sr[105][105], sc[105][105];
inline void getmax(short &x, short y) {
if (x < y) x = y;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf(" %s", a[i] + 1);
for (int j = 1; j <= m... | //#pragma GCC optimize(2)
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define N 100005
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<22,stdin),p1 == p2)?EOF:*p1++)
using namespace std ;
//char buf[(1 << 22)] , *p1 = buf , *p2 = buf ;
inline int read ()
{
char c = getchar () ; int x = 0 , f = 1 ;
... | 0 |
#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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int gcdi(int a, int b) {
if(a<0) a=b;
if(b<0) b=a;
if (b == 0) return a;
return gcdi(b, a%b);
}
int lcmi(int a, int b) {
ret... | 0 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make ... | 0 |
#include <iostream>
#include<vector>
#include<string>
using namespace std;
int Roma(char a){
switch(a){
case 'I':return 1;
case 'V':return 5;
case 'X':return 10;
case 'L':return 50;
case 'C':return 100;
case 'D':return 500;
case 'M':return 1000;
}
return 0;
}
int main() {
while(1){
string a;
cin>>a;
if(cin.f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
bool ok = true;
if (s[0] != 'A') ok = false;
int cnt = 0;
for (int i = 1; i < s.size(); i++) {
if (i >= 2 && i <= s.size() - 2) {
if (s[i] == 'C') {... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int check = 1000;
for(int i; i < N; i++){
int A;
int count = 0;
cin >> A;
while(A % 2 == 0){
A /= 2;
count += 1;
}
if(count < check){
check = count;
}
}
cout << check << endl;
} | // ALDS 1_10_B
#include<cstdio>
#include<cstring>
#include<vector>
#define rep(i,a) for( int i = 0; i != (a); ++i )
#define repi(i,a,b) for( int i = (a); i != (b); ++i )
const int INF = 1<<28;
int n;
std::vector<int> r(100);
std::vector<std::vector<int> > dp( 100, std::vector<int>( 100, INF ) );
int main()
{
scanf(... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i)>= min((a), (b))) && ((i) <= max((a), (b))))
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define fi first
#define se s... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,pt... | 1 |
/*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N,T;cin >> N >> T;
ll sum =0;
vector<ll> C(N);
for(int i=0;i<N;i++){
cin >> C[i];
}
for(int i=0;i<N-1;i++){
sum += min(T,C[i+1]-C[i]);
}
sum += T;
cout << sum << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define mult... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 |
#include <iostream>
using namespace std;
int XX(int a, int d){
return a * a * d;
}
int main(){
int d;
while (true){
int sum = 0;
cin >> d;
if (cin.eof()) { break; }
for (int i = 0;i<600/d;i++){
sum += XX(i*d, d);
}
cout << sum << endl;
}
return 0;
} | #include<stdio.h>
int l;
int ans=0;
int main()
{
while(scanf("%d",&l)!=-1)
{
ans=0;
for(int i=0;i*l<600;i++)
{
ans=ans+i*l*i*l*l;
}
printf("%d\n",ans);
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(){
int a=0,b=0;
int na,nb;
int nc;
while(1){
cin>>nc;
if(nc==0) break;
a=b=0;
for(int i=0;i<nc;i++){
cin>>na>>nb;
if(na>nb) a+=(na+nb);
else if(na<nb) b+=(na+nb);
else {a+=na;b+=nb;}
}
cout<<a<<" "<<b<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
string station = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n;
int main() {
while(cin>>n) {
if(n==0) return 0;
vector<int> vec(n);
rep(i,n) {
int a; cin>>a;
vec[i]... | 0 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, H, W; cin >> N >> H >> W;
cout << (N-H+1) * (N-W+1) << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long int ll;
int main()
{
int n;
ll a, b, x, d, op = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
d = a + b - x;
if( d <= b ){
b -= d;
}
else
{
b = 0;
}
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<int> cpa = a;
long long ans = 0;
for (int i = 0; i < N; ++i) {
if (i == 0) {
if (cpa[i] > x) ans += cpa[i] - x, cpa[i] = x;
}
else {
if (cpa[i] + cp... | 1 |
// https://atcoder.jp/contests/abc152/tasks/abc152_c
#include <bits/stdc++.h>
using namespace std;
int main()
{
long a, b;
cin >> a >> b;
long ans = 0;
for (int x = a; x <= b; x++)
{
string s, t;
s = to_string(x);
t = s;
reverse(t.begin(), t.end());
if (s ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int res = 0;
for (int i = A; i <= B; i++) {
if (i/10000 == i%10) {
if (i/1000%10 == i%100/10) {
res += 1;
}
i += 9;
}
}
cout << res << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
c... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;
int main(void) {
string alp = "IVXLCDM";
int num[... | #include <stdio.h>
int main(void){
char fig[101];
int num;
while (scanf("%s", fig) != EOF){
num = 0;
for (char *pt=fig; *pt!='\0'; pt++){
switch (*pt){
case 'I':
switch(*(pt+1)){
case 'V':
num += 4;
... | 1 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
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;
#define forn(i, n) for (int (i) = 0; (... | #include <iostream>
#include <algorithm>
using namespace std;
int N;
int L[200];
int main() {
int total = 0;
cin >> N;
for (int i = 0; i < 2 * N; i++) {
cin >> L[i];
}
sort(L, L + 2 * N);
for (int i = 0; i < 2 * N; i += 2) {
total += min(L[i], L[i + 1]);
}
cout << total... | 1 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (l... | #include <iostream>
#include <map>
typedef long long ll;
using namespace std;
// 素数 -> 個数
map<ll, ll> mp;
// 素数
map<ll, bool> prime;
bool isPrime(ll n) {
if (prime.find(n) != prime.end()) return prime[n];
if (n == 2) {
prime[2] = true;
return true;
}
else {
bool flg = true;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a--;b--;
cout << (a+b-1)/a << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int a, b, sum, c = 1;
cin >> a >> b;
sum = a;
if(b == 1){
cout << 0;
}
else if(b <= a){
cout << 1;
}
else{
while(1){
sum = sum + (a - 1);
c++;
if(sum ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B >> S;
string ans="Yes";
for (int i=0; i<A; i++) {
if (S[i]=='-') {
ans="No";
}
}
if (S[A]!='-') {
ans="No";
}
for (int i=A+1; i<A+B+1; i++) {
if (S[i]=='-') {
ans="No";
}... | 0 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
vector<string>vec(n);
int s;
string c;
rep(i,m){
c... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
sta... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = (s.size()%2 == 0);
while(s.size()>0 && flag){
if(s.substr(0,2) == "hi"){
s = s.substr(2,s.size()-2);
}
else flag = 0;
}
cout << (flag?"Yes":"No") << endl;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
map<int, bool> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if(m[a]) m.erase(a);
else m[a] = true;
}
cout << m.size() << ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
std::vector<long long>A(N);
for(long long i=0;i<N;i++){
cin>>A[i];
}
sort(A.begin(),A.end());
long long ans=0;
long long tmp=0;
for(long long i=1;i<N;i++){
if(A[i]==A[i-1]){
tmp... | 1 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | #include <iostream>
#include <time.h>
#include <algorithm>
#include <stdio.h>
#include<string.h>
typedef long long LL;
using namespace std;
const int times = 20;
LL fac[1001];
int cnt;
LL mul(LL a, LL b, LL mod)
{
LL ans = 0;
while (b)
{
if (b & 1)
{
ans = (ans + a) % mod;
}
a = (a << 1) % mod;
b >>... | 1 |
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b,c;
string s,t,q;
cin>>a>>b;
cout<<a+(b-a)*2<<"\n";
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B) {
cout << A * B << endl;
}
int main() {
long lo... | 0 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<v... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
inline int read(){
register int x=0,w=1,ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-48;
return w*x;
}
int n,s,x[maxn];
long long p[maxn];
long long calc(int l,int r,int lst){
if(... | #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... | 0 |
#include<bits/stdc++.h>
using namespace std;
char str[303]; int dp[303][303][303] , N , K;
int solve(int x , int y , int z){
if(x > y) return 0;
if(x == y) return 1;
if(dp[x][y][z]) return dp[x][y][z];
if(str[x] == str[y]) return dp[x][y][z] = solve(x + 1 , y - 1 , z) + 2;
return dp[x][y][z] = max(solve(x + 1 , ... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
const int inf=1<<28;
char s[310];
int n,f[310][310],g[310][310],K;
int main()
{
scanf("%s",s+1);n=strlen(s+1);
scanf("%d",&K);
memset(f,-63,sizeof(f));
for(int i=0;i<=K;i++) f[1][i]=1;
for(int i=2;i<=n;i++)
{
for(int j=... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
typedef long long ll;
typedef long double lld;
... | #include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<list>
#include<math.h>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vecto... | 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) rng(i,0,r)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) rrng(i,0,r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#de... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll ex... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
... | 0 |
#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, x;
cin >> n >... | #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
fo... | 0 |
#include <bits/stdc++.h>
using namespace std;
int rr[8], cc[8];
int r[8], c[8];
int main(){
int k;
cin >> k;
int count=0;
for(int i=0;i<k;i++) cin >> r[i] >> c[i];
for(int co=0;co<pow(8,8-k);co++)
{
for(int i=0;i<8;i++)
{
rr[i]=-1;
cc[i]=-1;
}
//無理やり配置を用意して
for... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define ... | 1 |
// include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(stri... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if (x == 0){
if (y >= 0){
cout << y << endl;
} else {
cout << 1 - y << endl;
}
} else if (y == 0){
if (x <= 0){
cout << -x << endl;
} else {
cout << x + 1 << endl;
}
} else if (x ... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <numeric>
#include <iomanip>
#include <climits>
#include <cstring>
#include <cmath>
using namespace std;
#define int long long... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define ... | 0 |
#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... | #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 n;... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int n;
vector<int> adj[N];
vector<int> bfs(int src){
vector<int> vis(n + 2, 0);
vector<int> dis(n + 1, 0);
vis[src] = 1;
dis[src] = 0;
queue<int> q;
q.push(src);
while(q.size()){
... | #include<stdio.h>
int main(){
int N;
int n1;
int M;
int m1;
int k;
scanf("%d %d %d %d %d",&N ,&n1,&M,&m1,&k );
int waktu = ((M*60+m1)-(N*60+n1))-k;
printf ("%d",waktu);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n' << flush;
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (true) {
int m = (l + r) / 2;
R = query(m);
... | // This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
int32_t main()... | #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... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=10005;
int P=1e9+7,d,len;
char k[MAXN];
long long a[MAXN],dp[10005][105];
long long dfs(int pos,int tot,bool lim)
{
// cout<<pos<<' '<<tot<<' '<<lim<<endl;
if(pos==len+1)
{
if(tot==0) return 1;
return 0;
}
if(!lim&&dp[pos][tot]!=-1) return dp[pos][t... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 3e2 + 2;
const int mod = 1e9 + 7;
int n;
bool vis[A][A][A];
ld mem[A][A][A];
ld solve (int c1, int c2, int c3) {
if (c1 + c2 + c3 == 0) return 0;
if (vis[... | 0 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
using namespace std;
#define MAX 100
int main(){
int n,dammy;
cin>>n;
int p[MAX+1];
cin>>p[0];
for(int i=0;i<n-1;i++){
cin>>p[i+1];
cin>>dammy;
}
cin>>p[n];
int C[MAX+1][MAX+1];
for(int i=1;i<=n;i++) C[i][i]=0;
for(in... | #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
int res=1e9;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
return dp[l][r]=res;
}
signed main(){
memset(dp,-1,si... | 1 |
#include<bits/stdc++.h>
#define reg register
const int maxn = 1000005;
int N;
char S[maxn];
char T[maxn];
int main(){
scanf("%d", &N);
scanf("%s%s", S+1, T+1);
int flag = 1;
for(reg int i = 1; i <= N; i ++)
if(S[i] != T[i]){ flag = 0; break ; }
if(flag){ print... | /******************
* Author: BD747 *
******************/
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
#define MP m... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> b;
while(n!=0){
if(abs(n)%2==0)
b.push_back(0);
else{
b.push_back(1);
n--;
}
n/=-2;
}
if(b.empty())
cout<<0;
for(int i=b.size()-1;i>=0;i--)
cout<<b.at(i);
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 9;
const long long mod = 1e9 + 7;
struct matrix {
int n, m;
long long a[N][N];
matrix(int n, int m) : n(n), m(m) {
memset(a, 0, sizeof a);
}
void reset() {
memset(a, 0, sizeof a);
for(int i = 0; i<n; i++)
a[i][i] = 1;
}
const ... | 0 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cmath>
#include<deque>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<utility>
#include<vector>
using namespace std;
typedef lon... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#define N 100002
using namespace std;
struct node{
int u,v,w;
}e[200002];
vector<int> id[N];
int head[2000002],ver[2000002],nxt[2000002],edge[2000002],l;
int n,m,i,j,cnt[N],now[N],dis[2000002],num;
bool in[2000002];
int read... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,no-stack-protector,fast-math")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 1e5 + 5, M = 4 * N + 5;
int head[N], nxt[M], to[M], typ[M], ... | 1 |
#include <iostream>
using namespace std;
typedef struct {
int top;
int S;
int E;
int W;
int N;
int bottom;
} dice;
void swap4(int *a, int *b, int *c, int *d) {
int tmp = *a;
*a = *b;
*b = *c;
*c = *d;
*d = tmp;
}
void roll(dice *dp, char dir) {
if (dir == 'E') {
s... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n, ans=0, i;
map<long long, long long> mp;
cin >> n;
for(i=0;i<n;i++){
long long a;
cin >> a;
mp[a]++;
}
for(auto x : mp){
if(x.second%2!=0) ans++;
}
cout << ans <<endl;
return 0... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
scanf("%d%d%d",&n,&x,&y);
printf("%d",(n+x-1)/x*y);
} | #include <iostream>
using namespace std;
int main(){
int n,x,t;
cin>>n>>x>>t;
int ans = n/x * t;
ans += (n%x != 0)? t:0;
cout<<ans<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define lowbit(i) ((i)&(-(i)))
#define lson(i) ((i)<<1)
#define rson(i) ((i)<<1|1)
#define sqr(x) ((x)*(x))
#define fi first
#define se second
#define mp(x,y) make_pair((x),(y))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef pair<int,int> ... | #include <iostream>
using namespace std;
long long p[100001],x[100001],ans=0;
int n,s,l,r;
int main(){
cin>>n>>s;
for (int i=1;i<=n;i++)
cin>>x[i]>>p[i];
l=1;r=n;
while (l<=r){
if (s<=x[l]){
cout<<x[r]-s+ans;
return 0;
}
else if (s>=x[r]){
cout<<ans+s-x[l];
return 0;
} //所有住处都在s的一侧，可以直接开过去
if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x <... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
#include <climits>
using namespace std;
int main() {
int i, j, k, to, min, temp_result;
int n;
int r[100], c[100];
int result[100][100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> r[i] >> c[i];
result[... | 1 |
#include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", stdin);
#define fileo freopen("output.txt", "w", stdout);
#... | /*=============================================================================================================================/*
Bismillahir Rahmanir Rahim
_ ____ ___ ____ _ _ _ ___ ____ _ _ __ __
/ \ / ___||_ _|| __ ) | | ... | 1 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include ... | #include<bits/stdc++.h>
using namespace std;
struct parts{int power; int motor; int cable; int pass;};
int main(){
int a, b, c;
int N;
int is_disorder[300];
parts result[1000];
for(;;){
cin >> a >> b >> c;
if(a == 0 && b == 0 && c == 0) break;
for(int i = 0; i < a + b + c; i++) is_disorder[i] = 2;
cin >... | 1 |
#include<set>
#include<queue>
#include<vector>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 0x7fffffff
#define lli long long int
int n,len;
char c[50];
vector<set<pair<int,int> > > trie;
vector<lli> s;
inline int fd(int now,int k){
if(trie... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
i... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,T;
cin>>N>>X>>T;
if(N%X==0) cout<<N/X*T;
else cout<<(int(N/X)+1)*T<<endl;
}
| #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(){
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> dp(H + 1, vector<int>(W, 0));
dp[0][0] = 1;
for (int i = 0; i < H; i++){
for (int j = 0; j < (1 << (W - 1)); j++){
bool ok = true;
for (int k = 0; k < W - ... | 0 |
#include <iostream>
#include<cmath>
#include<vector>
using namespace std;
#define ll long long
#define ld long double
int main(void){
string s;
cin>>s;
string ans="2018";
ans+=s.substr(4);
cout<<ans;
} | // B - Around Square
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
int64_t ans = 0;
for(int i=1; i*i<=N; ++i) ans = i*i;
cout<<ans<<endl;
}
| 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<vector<int>> vec(100010);... | #include <iostream>
#include <algorithm>
using namespace std;
int straight(int card[])
{
for(int i=1; i<9; i++){
if(((card[0]==i)&&(card[1]==i+1)&&(card[2]==i+2)&&(card[3]==i+3)&&(card[4]==i+4)) ||
(card[0]==1&&card[1]==10&&card[2]==11&&card[3]==12&&card[4]==13))
return 1;
}
return 0;
}
int main(){
int c... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, q;
while(true){
cin >> n >> q;
if(n == 0)
break;
int m;
vector< vector<int> > sch(n, vector<int>(101, 0));
for(int i=0; i<n; i++){
cin >> m;
for(int j=0; j<m; j++){
int temp;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
while(cin >> n >> q && (n || q)){
int cnt[1000] = {0}, m, d;
for(int i = 0; i < n; ++i){
cin >> m;
for(int j = 0; j < m; ++j){
cin >> d;
cnt[d]++;
}
}
int maxium = 0, day = 0;
for(int i = 1; i <= 100; ++i){
if(maxium ... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+5;
const ll mod=1e9+7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
ll n,ans=0,mx=0,a[N],num[100]={0},cnt[100]={0};
void split(ll x){
ll p=0;
while(x){
if(x%2) cnt[p]++;
p++;
x/=2;
... | #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> Set;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob... | 0 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if(e - a > f){
cout << ":(" << endl;
return 0;
}
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int,int>;
using psi = pair<string,int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i++... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
const int COUNT = 6;
#define size_array(x) ((sizeof(x)) / (sizeof(x[0])
class Dice
{
private:
int num[6];
public:
Dice();
void play_dice(string);
void play(int, int, int, int);
void print_() {printf("%d\n", num[0]);}
};
Dice::Dice()... | #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 <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
const ll inf=(1e14);
ll solve(){
ll n,ans=0;
string s;
cin>>n>>s;
int r[n],g[n],b[n];
g[n-1]=r[n-1]=b[n-1]=r[0]=g[0]=b[0]=0;
unor... | #include <iostream>
#include <cstring>
using namespace std;
char a[4005];
int main() {
int N, cnt = 0;
long long sum = 0;
cin >> N >> a;
for(int i = 0; i < N; i++)
if(a[i] == 'B')
cnt ++;
for(int i = 0; i < N; i++)
if(a[i] != 'R')
continue;
else for(in... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double a, b, c, d, x, y, ans;
cin >> a >> b >> c >> d;
x = a - c;
y = b - d;
ans = sqrt(x*x + y*y);
printf("%f", ans);
return 0;
} | 0 |
/*
Code for problem D by cookiedoth
Generated 22 Mar 2020 at 06.57 PM
,##. ,==.
,# #. \ o ',
# # _ _ \ \
# # (_) (_) / ;
`# #' / .'
`##' "=="
=_=
>_<
o_O
*/
#include <iostream>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair <int, int> pii;
char buf[1000010];
bool cmp(pii a, pii b) {
return max(-a.se, -a.fi - b.se) < max(-b.se, -b.fi - a.se);
}
int main () {
int n; scanf("%d", &n);
int tot = 0;
vector <pii> p, q;
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.... | 0 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int A[200000],B[200000];
for(int i=0;i<N;i++) cin>>A[i];
for(int i=0;i<N;i++) cin>>B[i];
sort(B,B+N,greater<int>());
vector<int> same;
for(int i=0;i<N;i++){
... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define F... | 1 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int>... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 100000000... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
vector<int> v(5000);
int n , sum=0 , max=-2000000000;
while(cin>>n,n){
sum=0;
max=-2000000000;
for(int i=0;i<n;++i){
cin >> v[i];... | #include <iostream>
#include <climits>
#include <set>
#include <string>
#include <algorithm>
#include <vector>
#define MAX 1000000001
using namespace std;
#define ll long long
#define dbg if(0)
int main(){
while(true){
int n;
ll ans= LLONG_MIN;
cin>>n;
if (n==0)break;
ll... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fori(x,y) for(ll i=x;i<y;i++)
#define forj(x,y) for(ll j=x;j<y;j++)
#define rfori(a,b) for(int i=a;i>=b;i--)
#define for_it(a) for(auto it: a)
#define pb push_back
#define pf push_front
#define ff first
#define ss second
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxn = 11;
vector<bool> val(mxn, 1);
bool valid(string s){
bool ok = 1;
int n = int(s.size());
for(int i = 0; i < n && ok; ++i){
ok &= (val[s[i] - '0']);
}
return ok;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int... | 1 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >>n;
long long a,min=0,max=0,sum=0;
for (int i=1; i<=n; i++){
cin>> a;
if (i==1)min=a, max=a;
if (a<min)min=a;
if (a>max)max=a;
sum +=a;
}
cout<< min <<" "<< max <<" "<< sum <<"\n";
return 0;
} | #include<iostream>
#define LL long long
using namespace std;
int main() {
LL sum, min, max, n, d;
cin >> n;
cin >> d;
sum = d;
min = d;
max = d;
n--;
while (n--) {
cin >> d;
sum += d;
if (min > d)min = d;
if (max < d)max = d;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
} | 1 |
/*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
- William Butler Yeats
*/
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GC... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a[11], b[11], c[11];
cin >> a >> b >> c;
if(a[strlen(a)-1] == b[0] && b[strlen(b)-1] == c[0]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
#define MOD (long long)(998244353)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fi(v) get<0>(v)
#define se... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> in... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
usin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int L = 17;
int go[N][L];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector <int> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int l;
cin >> l... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Wavelet {
public:
explicit Wavelet(const vector<unsigned int>& a) : N(a.size()), vb(getDigits_(a), BitVector(a.size())){
vector<unsigned int> v = a;
vector<unsigned int> v0(N), v1(N);
for(int i=vb.size()-... | #include <bits/stdc++.h>
struct FastIO {
FastIO() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
}
} fast_io;
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.