code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int bs(ll k,vector<ll> & v){
int l = -1,r = v.size();
while(r-l > 1){
int mid = (... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
vector<vector<int> > ten(20, vector<int>(20, 0));
ll cnt = 0;
REP(i, n) {
double x; cin >> x;
ll tmp = x * 1e9 + 0.1;
int... | 1 |
#include <iostream>
#include <string>
using namespace std;
class Dice{
public:
int l1,l2,l3,l4,l5,l6;
void East(){
int t = l1;
l1 = l4;
l4 = l6;
l6 = l3;
l3 = t;
}
void West(){
int t = l1;
l1 = l3;
l3 = l6;
l6 = l4;
l4 = t;
}
void South(){
int t=l1;
l1 = l5;
l5 = l6;
l6 = l2;
l2 =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int w;
cin>>S>>w;
int i=0;
while(i<S.size()){
cout<<S[i];
i+=w;
}
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
bool ok=true;
int ans=1e9;
//O(N * LOG(MAX(a)))
for(int& x : a) {
cin >> x;
if(x&1) ok=false;
int cnt=0;
while(x) {
if(x&1) {
ans=min(ans... | #include<iostream>
#include<vector>
using namespace std;
int num_2(int a) {
int ret=0;
while (a % 2 == 0) {
ret++;
a /= 2;
}
return ret;
}
int even(vector<vector<int>> a) {
int ret = a.at(1).at(0);
for (int i = 0; i < a.at(0).size(); i++) {
if (ret > a.at(1).at(i))ret = a.at(1).at(i);
}
return ret;
}
int... | 1 |
#include <bits/stdc++.h>
using namespace std;
//Made with <3 by MinumCoklatPanas
typedef long long ll;
const int INF = 1e9;
const ll INFF = 1e18;
const int MAXN = 510;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
vector< pair<int,int> > adj[100010];
ll sum[1... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 1 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int);
int integral(int);
int main(void) {
int a, b;
while(cin >> a >> b) {
cout << integral(a) << endl;
cout << integral(b) << endl;
}
return 0;
}
int integral(int d){
int n = 600 / d;
int sum = 0;
for (int i = 1; i < n; ... | #include<iostream>
using namespace std;
int solve(int d){
int ret=0;
for(int i=d;i<=600-d;i+=d)
ret+=i*i*d;
return ret;
}
int main(){
int d;
while(cin>>d){
cout<<solve(d)<<endl;
}
} | 1 |
#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)... | #include <bits/stdc++.h>
#define range(i,c,o) for(register int i=(c);i<(o);++i)
using namespace std;
// fast_io BEGIN HERE
namespace IO
{
static const size_t isize=1000000;
char *cur,pool[isize];
inline void clear()
{
rewind(stdin),cur=pool+isize;
}
inline char getC()
{
if(cur==pool+isize)
{
int siz=fr... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,M;
cin >> N >> M;
if(N*N==M){
cout << N << endl;
}else... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
long long n,k;
cin>>n>>k;
long double ch[200010];
for(ll i=0;i<n;i++){
cin>>ch[i];
}
long double ans=0;
for(ll i=0;i<k;i++){
long double now=ch[i];
now=(ch[i]+1)/2;
ans+=now;
}
/... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cst... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,x[100005],y[100005],mod=1e9+7;
ll calc(ll a[],ll n){
ll ans =0 ;
for(ll i=0;i<n-1;i++)a[i]=a[i+1]-a[i];
n-=1;
for(ll i=0;i<n;i++){
ans = ans + (i+1)*(n-i)%mod*a[i]%mod;
ans%=mod;
}
return ans;
}
int main(... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
int n; scanf("%d", &n);
std::vector<i64> a(n);
for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
i64 m, k; scanf("%lld%lld", &m, &k);
std::vector<int> b(m);... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
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();++i)
#define ALL(c) (c).begin(), (c).end()
int ba[12][12];
int dx[] = {1,0,-1,0};
int dy[... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, num;
vector< int > a;
while( 1 ) {
cin >> n;
if( n == 0 ) break;
int Max = -100001;
a.push_back( 0 );
for( int i = 0; i < n; i++ ) {
cin >> num;
a.push_back( num );
}
for( int i = 1; i ... | 0 |
#include <cstdio>
#include <iostream>
#define ri register int
using namespace std;
typedef long long LL;
const int N = 102;
char ch[N][N];
short le[N][N], up[N][N], dp[N][N][N][N];
inline void upd(short &x, short y) {
if (x < y) x = y;
}
int main() {
int n, m, ex, ey;
scanf("%d%d", &n, &m);
for (int i = ... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
const int N=200005;
const LL inf=1ll<<40;
int n,q,sta,stb;
int x[N];
struct tree
{
LL mv1[N*4],mv2[N*4],tag[N*4];//mv1-> f[x]-x mv2 -> f[x]+x
void pushup(int k)
{
mv1[k]=min(mv1[k<<1],mv1[k<<1|1]);
mv2... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;cin >> n;
vector<ll> A(n), abs_A(n);
ll min_abs_A = 1e10;
int minus_cnt = 0;
for (int i = 0; i < n; i++){
cin >> A[i];
abs_A[i] = abs(A[i]);
min_abs_A = min(min_abs_A, abs_A[i]);
if... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r;
cin>>r;
if(r<1200)
cout<<"ABC";
else if(r<2800 && r>=1200)
cout<<"ARC";
else
cout<<"AGC";
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 10**9
int main() {
ll n,prev=-1;
cin >> n;
rep(i,100000){
if (pow(i,2)<=n){
prev=pow(i,2);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
Int N;
cin >> N;
Int ans = 0;
for (Int i = 1; i * i <= N; i++) {
ans = i * i;
}
cout << ans << endl;
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
string str;
while( getline( cin, str ) ){
for( int i = 0;i < 26;i++ ){
for( int j = 0;j < str.size();j++ ){
if( str[j] >= 'a' && str[j] <= 'y' ) str[j]++;
else if( str[j] == 'z' ) str[j] = 'a';
}
... | #include <iostream>
using namespace std;
class Rect{
public:
int w;
int h;
int diagonal;
};
void swap(int *a,int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
Rect rect[11180];
for(int i=0;i<11180;i++){
rect[i].diagonal=1000000;
}
int cnt=0;
for(int i=1;i<=150;i++){
for(int j=1;j<i;j++){... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string res = "";
for (int i = sy; i < ty; i++) {
res += 'U';
}
for (int i = sx; i < tx; i++) {
res += 'R';
}
for (int i = sy; i < ty; i++) {
res += 'D';
}
for (int i = sx; i < tx; i++) {
res +=... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9 * 2;
int main() {
int n;
while(cin >> n && n){
int a[5010] = {0};
for(int i = 0; i < n; ++i)
scanf("%d", &a[i]);
int ans = -INF;
for(int i = 0; i < n; ++i){
int sum = 0;
for(int j = i; j < n; ++j){
sum += a[j];
if(ans < sum)... | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int main(void){
int lp;
cin >> lp;
int* ary =(int*)malloc(sizeof(int)*lp);
for(int i=0;i<lp;i++) {
cin >> ary[i];
}
int count =0;
for(int i=0;i<lp;i++) {
for(int j=0;j<lp-i-1;j++) {
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
r... | // @author: khangtq1
#include <bits/stdc++.h>
using namespace std;
#define fto(i, a, b) for(int i = a; i < b; ++i)
#define fdto(i, a, b) for(int i = b - 1; i >= a; --i)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define fill(arr, val) memset(arr, val, sizeof(arr))
#define what_is(x) cerr << #x << " is " << x << "\n... | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include... | /*
Contest 111
B - AtCoder Beginner Contest 111
Rakesh Kumar --> 27/09/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::vector<int> table;
for (int i = 1; i <= 9; ++i)
table.emplace_back(i * 111);
int n = 0... | 0 |
#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(){
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int IN... | 0 |
#include <iostream>
using namespace std;
int main(){
int X;
cin >> X;
int D = X%10;
X /= 10;
int C = X%10;
X /= 10;
int B = X%10;
X /= 10;
int A = X;
if(A+B+C+D==7){
cout <<A<<"+"<<B<<"+"<<C<<"+"<<D<<"=7";
}else if(A+B+C-D==7){
cout <<A<<"+"<<B<<"+"<<C<<"-"<<D<<"=7";
}else if(A+B-C+D==7... | #include<stdio.h>
int main(){
char nama1[102], nama2[102];
scanf("%s %s", nama1, nama2);
printf("%s%s\n", nama2, nama1);
return 0;
} | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#include <time.h>
#include <chrono>
#include <random>
//#include <math.h>
#include <cmath>
#include <fstream>
#include <deque>
#include <unordered_map>
#include <un... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
cin >> A.at(0);
ll ans = 0;
rep(i,N-1){
cin >> A.at(i+1);
if(A.at(i+1) < A.at(i)){
ans += A.at(i) - A.at(i+1);
... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
typedef unsigned long long ull;
#define vvi std::vector<std::vector<int> >
#define vvs std::vector<std::vector<string... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um =unordered_map<pair<string,string>,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void... | 1 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct pos{
int x;
int y;
};
pos dir[] = {
{1, 0},
{-1, 0},
{0, 1},
{0, -1}
};
int main(){
int H, W;
int depth_max = 0;
vector<vector<int>> depth;
queue<pos> dest;
cin >> H >> W;
depth.resize(H, v... | //https://codeforces.com/blog/entry/64250?#comment-576206
#include<bits/stdc++.h>
#define ll double
ll dp[301][301][301];
ll solve(int one, int two, int three, int& n)
{
if(one < 0 || two < 0 || three < 0)
return 0;
if(three == 0 && two == 0 && one == 0)
return 0;
if(dp[one][two][three] ... | 0 |
#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define mx 1000008
#define pii pair<int,int>
#define pi acos(-1.0)
#define pb push_back
#define ss second
#define ff first
typedef long long int ll;
///adja... | #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
#define ll long long
#define fr(i,a,n) for (int i=a;i<n;i++)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vipb(v) int x;cin>>x;v.pb(x);
#define vllpb(v) ll x;c... | #include<iostream>
int main(){
int n,k;
std::cin >> n >> k;
std::cout << n-k+1;
return 0;
} | 1 |
#include <stdio.h>
int main() {
int A, B, pos = 0;
char S[20];
scanf("%d %d %s", &A, &B, S);
for (int i = 0; S[i] != '\0'; i++) {
if (S[i] == '-') {
pos += i;
}
}
pos == A ? puts("Yes") : puts("No");
return 0;
}
| #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
int a,b;
cin>>a>>b>>s;
bool flag=true;
for(int i=0;i<a;i++){
int num=s[i]-'0';
if(num<0||num>9)flag=false;
}
if(s[a]!='-')flag=false;
for(int i=a+1;i<a+b+1... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>... | 1 |
#include <iostream>
#include<string>
#include<map>
using namespace std;
int main(){
string s; cin >> s;
int check[26] = {};
for(int i = 0; i < s.size(); i++){
int t = s[i]-'a';
check[t] = 1;
}
for(int i = 0; i < 26; i++){
if(check[i] == 0) {
char ans = 'a' + i;
cout << ans << endl;
... | #include <iostream>
using namespace std;
int harshad(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
int main() {
int n;
cin >> n;
int sum_of_digits = harshad(n);
if (n % sum_of_digits == 0) {
cout << "Yes" << endl;
} else ... | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <cstring>
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, in... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B];
int x[M], y[M], c[M];
int a_min=1000000, b_min=1000000;
rep(i,A) {
cin >> a[i];
if(a[i] < a_min) a_min = a[i];
}
rep(i,... | 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);
}
sort(A.begin(), A.end());
int ans = 0;
for(int i = 0; i < K; i++){
ans += A.at(N - 1 - i);
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.... | 1 |
#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long ... | #include<iostream>
using namespace std;
int main(){
int a, b, c, d, i, j, cnt=1, n;
int s[100]={ }, r[100];
cin >> n;
for (i=0; i<n*(n-1)/2; i++){
cin >> a >> b >> c >> d;
if (c>d){
s[a-1]+=3;
} else if (c<d){
s[b-1]+=3;
} else {
s[a-1]+=1; s[b-1]+=1;
}
}
for (i=0;... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
int pre[n];
string str;
for(int i=0;i<n;i++){
cin >> pre[i];
}
cin >> str;
for(int i=0;i<str.size();i++)... |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll INF=1e18;
// Binary Indexed Tree (Fenwick Tree)
// https://youtu.be/lyHk98daDJo?t=7960
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
double d[10], v1, v2;
vector<int> result;
while (scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,\n",
d, d+1, d+2, d+3, d+4, d+5, d+6, d+7, d+8, d+9, &v1, &v2) != EOF) {
doub... | #include <iostream>
using namespace std;
int main(){
double a[10], v1, v2;
double t1[11], t2[11];
int cross;
char k;
int i;
while(cin>>a[0]){
for(i=1; i<10; i++) cin>>k>>a[i];
cin>>k>>v1>>k>>v2;
t1[0]=0;
for(i=1; i<11; i++) t1[i]=t1[i-1]+a[i-1]/v1;
t2[10]=0;
for(i=9; i>=0; i--) t2[... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n + 2), d(n + 1), sd(n);
rep(i, n) cin >> a[i + 1];
int sum = 0;
rep(i, n + 1) {
d[i] = abs(a[i + 1] - a[i])... | 1 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false)... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
if(s.find("AC") != string::npos)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(1e6)+10;
int n,m,sum,s,a[maxn],b[maxn];
char S[max... | #include <iostream>
#include <cstdlib>
const int MAX_SIZE = 1000000;
const int MAX_M = 100 + 1;
void insertionSort(int A[], int n, int g, int &count) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i -g;
while ((j >= 0) && (A[j] > v)) {
A[j + g] = A[j];
j -= g;
count ... | 0 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n; // number of vertices
int P[20200], A[20200], B[20200], C[20200];
pair<int, int> D[20200]; // Weights and coordinates
int root(int a) { // find the root of a
if (P[a] == a) return a; // a is the root
return (P[a] = root(P[a]... | 1 |
// VU TRUONG AN
#include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int answer = 0;
for (int i=A; i<=B; i++){
int a, b, c, d, e;
a = i % 10; //1の位
b = (i % 100 - i % 10) / 10; //10の位
c = (i % 1000 - i % 100) / 100; //100の位
d = (... | 1 |
#include <stdio.h>
int main(){
char name1[110];
char name2[110];
scanf("%s%s", &name1, &name2);
printf("%s%s", name2, name1);
return 0;
} | #include<bits/stdc++.h>
#define N 10
using namespace std;
int main(){
int a[N],b[N],ansa,ansb;
for(int i=0;i<N;i++)cin>>a[i];
for(int i=0;i<N;i++)cin>>b[i];
sort(a,a+N,greater<int>());
sort(b,b+N,greater<int>());
ansa=ansb=0;
for(int i=0;i<3;i++)ansa+=a[i];
for(int i=0;i<3;i++)ansb+=b[i];
cout<<ansa<... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main(void) {
int N;cin>>N;
vector<int> A(N + 2);
// departure
A.push_back(0);
for (int i = 1; i <= N; i++) cin>>A[i];
// goal
A.push_back(0);
int SUM[N + 1];
int sum = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 16;
const int MAXL = (1 << 16) + 10;
const ll NEG = -1e18;
vector<int> grafo[MAXL];
ll valor[MAXL],dp[MAXL],mat[MAXN][MAXN];
int vis[MAXL],N;
void brute(int pos,int bitmask,int submask){
if(pos == N){
if(__builtin_popcount(subm... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(... | #include <iostream>
using namespace std;
int table[501][501];
int C[501][501];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, Q;
cin >> N >> M >> Q;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
table[l][r]++;
}
for (int i = 1; i <= N; i++) {
C[i][1] = table[... | 0 |
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
templa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,a,b) for(int i=(a),_end_=(b);i<=_end_;i++)
#define DREP(i,a,b) for(int i=(a),_end_=(b);i>=_end_;i--)
#define EREP(i,a) for(int i=start[(a)];i;i=e[i].next)
template<class T>inline void chkmax(T &a,T b){ if(a<b)a=b;}
template<class T>inline ... | 1 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else co... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void milktea() {
int d, g;
cin >> d >> g;
vector<int> p(d), c(d);
for(int i = 0; i < d; i++) {
cin >> p[i] >> c[i];
}
int ans = 1e9;
for(int bit = 0; bit < (1 << d); bit++) {
int ... | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
string S;
cin >> N >> S;
reverse(S.begin() + N, S.end());
map<pair<string, string>, int64_t> mp[2];
for (int64_t i = 0; i < (1LL << N); i++) {
for (int64_t j = 0; j < 2; j++) {
string str1, str2;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2005;
int n, m, q;
char B[Maxn][Maxn];
int sq[Maxn][Maxn];
int edH[Maxn][Maxn], edV[Maxn][Maxn];
int main()
{
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n; i++)
scanf("%s", B[i] + 1);
for (int i = 1; i <= n; i++)
for ... | #include<cmath>
#include<cstdio>
#include<cctype>
#include<vector>
inline int getint() {
register char ch;
while(!isdigit(ch=getchar()));
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
const int N=600;
int n,d1,d2,col[2][N*N];
std::vector<std::pair<int,int>> v[2];
inlin... | 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << max(n - h + 1, 1) * max(n - w + 1, 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {if(a < b) {a= b;return 1;}return 0;}
template <class T> inline bool chmin(T &a, T b) {if(a > b) {a= b;return 1;}return 0;}
ll mod= 1e9 + 7;
int main(){... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | #include <iostream>
using namespace std;
int main() {
int e,small ;
while(cin >> e && e>0){
small = e;
for(int z = 0; z*z*z <= e; z++){
for(int y = 0; y*y+z*z*z <= e; y++){
int x = e-y*y-(z*z)*z;
small=min(small, x+y+z);
}
}
cout << small << endl ;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int fa[101000],n,k,ans,f[101000];
vector<int> e[101000];
voi... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define x first
#define y second
typedef pair<int,int> pii;
const int MAXN=105;
int n,m;
int sumr[MAXN][MAXN],sumc[MAXN][MAXN],f[MAXN][MAXN][MAXN];
char s[MAXN][MAXN];
pii ed;
int main(){
//freopen("robot.in","r",stdin);
//freopen("r... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | #include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int n;
cin >> str;
cin >> n;
while (n-- > 0) {
string q, p;
int a, b, size;
cin >> q;
cin >> a >> b;
size = b - a + 1;
if (q == "print") {
cout << s... | #include<iostream>
using namespace std;
string rep(string s,int a,int b,string p);
string rev(string s,int a,int b);
void pri(string s,int a,int b);
int main(){
string code,k,p;
int n,a,b;
string haki;
getline(cin,code);
cin >> n;
getline(cin, haki);
for(int i =... | 1 |
//#define MYDEBUG
#include <bits/stdc++.h>
#ifdef MYDEBUG
#define dbp(x) cout<<#x<<": "<<x<<endl
#define dbp2(x,y) cout<<#x<<","<<#y<<": "<<x<<","<<y<<endl
#define dbp3(x,y,z) cout<<#x<<","<<#y<<","<<#z<<": "<<x<<","<<y<<","<<z<<endl
#define dbp4(w,x,y,z) cout<<#w<<","<<#x<<","<<#y<<","<<#z<<": "<<w<<","<<x<<","<<y<<"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define el '\n'
#def... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
set<ll> data;
ll n;
cin ... | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int h,w;
scanf("%d %d",&h, &w);
int aaiDeffer[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
scanf("%d", &aaiDeffer[i][j]);
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string data;
int n;
cin>>data>>n;
while (n--){
string order,p; int a,b;
cin>>order>>a>>b;
if (order=="replace"){
cin>>p;
data.replace(a,b-a+1,p);
}
else if(order=="reverse") reverse(begin... | 0 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... |
#include <bits/stdc++.h>
using namespace std;
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define REP(type, name, beginValue, endCond... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
c... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
const int INF=1e9+10;
const int N=1e5+10;
struct edge
{
int to,cost;
edge(){}
edge(int t,int c):to(t),cost(c){}
};
vector<edge> G[N];
int V,E,S;
int d[N];
void init(int n)
{
for(int i=0;i<=n;i++) G[i].clear();
}
void Dijkstra(in... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int bit[55][55];
void add(int x, int y){
for(int i=x;i>0;i-=(i&-i)){
for(int j=y;j>0;j-=(j&-j)){
bit[i][j]++;
}
}
}
ll g... | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for(int i = a ; i < (int)n ; i++)
using namespace std;
int A[100001];
int partition(int p, int r){
int i;
i = p-1;
REP(j, p, r){
if(A[j] <= A[r]){
i++;
swap(A[i], A[j]);
}
}
swap(A[i+1], A[r]);
return i+... | 0 |
#include<bits/stdc++.h>
//g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lower_bound(A[... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;++i) cin >> a[i];
multiset<int> ms;
for(int i=0;i<n;++i){
int s=a[i];
auto itr=ms.lower_bound(s);
if(itr!=ms.begin())ms.erase(--itr);
ms.insert(s);
}
cout ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
map<ll,ll> mp;
for(int i = 0;i < n;i++)cin ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int a[N+5], dp[N+5], cnt;
int main(){
int n; scanf("%d", &n);
for (int i = 1; i <= n; ++i){
scanf("%d", a+i);
}
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i){
int pos = upper_bound(dp + 1, dp + cnt + 1, a... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll ... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <stack>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main()
{
string str;
cin >> str;
if (str.size() < 26)
{
map<char, l... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | 0 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
//#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#defi... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x,sum=0;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int ans=0;
for(int i=0;i<n;i++)
{
if(sum+a[i]<=x&&i<n-1)
{
++ans;
sum+=a[i]... | 1 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int N, A[100000];
bool check()
{
int even = 0, odd = 0;
for(int i = 0; i < N; i++) {
if(A[i] & 1) ++odd;
else ++even;
}
if(even & 1) return (true);
if(odd > 1) return (false);
for(int i = 0; i < N; i++) {
if(A[i] == 1) re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
/***********debug tools***********/
template<class T> inline ostream& operator<<(ostream& os,vector<T> arr) {os << "["; for(int i = 0; i < (int)arr.size(); i++)os << arr[i] << (i == (int)arr.size() - 1 ? "]" : ",");os << endl;return os;}
template<type... | #include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
templa... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
int x, y, z;
cin >> x >> y >> z;
int an... | 0 |
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
const int MAX = 2600000;
int mod = 998244353;
int n, m;
int fact[MAX];
int inv[MAX];
int factInv[MAX];
void initFact() {
int i;
fact[0] = fact[1] = 1;
factInv[0] = factInv[1] = 1;
inv[1] = 1;
for (i = 2; i <= 3 * m + n; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, x;
c... | 0 |
#include<cstdio>
#define For(i,A,B) for(i=A;i<=(B);++i)
char a[1005][1005];
void work(int x,int k){
if(k==4){
a[x][x]=a[x][x+1]=a[x][x+3]=a[x+1][x+3]=a[x+2][x]=a[x+3][x]=a[x+3][x+2]=a[x+3][x+3]='a';
a[x+1][x]=a[x+1][x+1]=a[x+2][x+2]=a[x+2][x+3]='b';
a[x][x+2]=a[x+1][x+2]=a[x+2][x+1]=a[x+3][x+1]='c';
}else if(k=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 2) {
cout << -1 << endl;
return 0;
}
if (n % 3 == 0) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i % 3 == 0 && j % 3 < 2) {
cout << 'a';
} else if (i % 3 < 2 ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
using P = pair<int,int>;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
const int N = 405;
const int INF = 1e9;
char board[N][N];
int h,w;
bool is_in(int x, int y) {
if(0 <= x ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,char>> array(m);
for(int i=0;i<m;i++) cin >> array.at(i).first >> array.at(i).second;
int s,g;
s = 1;
for(int i=0;i<n-1;i++) s*=10;
g = s * 10;
if(n == 1) s = 0;
for(int i=s;i<g;i++... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int m;
cin >> m;
ll sum = 0, n = 0;
rep(i,m)
{
ll c, d;
cin >> d >> c;
n += c;
sum += c * d;
}
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int nax = 5010;
const ll INF = 1e18L;
ll dp[nax][nax];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
for (int i = 0; i < nax; ++i) {
... | 0 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
typedef vector<int> vi;
typedef vector<vi> vvi;
const int INFTY=1<<29;
int dfs(vvi& a,int ci,int cj,int depth)
{
if(depth==10)
return IN... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using vvi = std::vector<std::vector<int>>;
void solve()
{
using namespace std;
constexpr int inf = (1 << 23);
int n;
cin >> n;
vector<int> d(n + 1);
for (int i = 0; i < n; ++i)
{
cin >> d[i];
... | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), s(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
s... | 1 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int fa[MAXN], n, dep[MAXN], ans, K;
int head[MAXN], nxt[MAXN];
int dfs(int u) {
int res = dep[u];
for (int i = head[u]; i; i = nxt[i]) {
dep[i] = dep[u] + 1;
res = std::max(dfs(i), res);
}
if (res - dep[u] == K - 1 && fa[u] != 1) fa[u] = 1, ++ans, res = 0;
ret... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n,k,head[maxn],to[maxn],nextt[maxn],tot = 1,ans;
void add(int x,int y)
{
to[tot] = y;
nextt[tot] = head[x];
head[x] = tot++;
}
int dfs(int u,int faa,int from)
{
int res = 0;
for (int i = head[u];i;i = nextt[i])
{
... | 1 |
#include <iostream>
int main(){
std::string inp;
std::cin >> inp;
for(char& c:inp)
if (c == '7') {std::cout << "Yes"; return 0;}
std::cout << "No";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
string ans;
if(a==b){
if(a!=c){
ans="Yes";
}else{
ans="No";
}
}else if(b==c){
if(a!=c){
ans="Y... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
int a[3];
cin >> n;
for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
vector<int> can;
for(int i=1;i*i<=a[0];i++){
if(!(a[0]%i)){
can.push_back(i);
if(i*i!=a[0])can.push_back(a[0]/i);
}
}
... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,mini = 100000000;
cin >> n;
int num[n];
for(int i=0;i<n;i++){
cin >> num[i];
mini = min(num[i],mini);
}
for(int i=1;i<=mini;i++){
if(n == 2){
if(num[0]%i == 0 && num[1]%i == 0) co... | 1 |
#include <iostream>
using namespace std;
int main(){
string s;cin>>s;
int festival_len = 8;
int name_len = s.size() - 8;
for (int i=0;i<name_len;i++){
cout << s[i];
}
cout << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double d = sqrt(n);
int i = d;
int ans = i * i;
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; string S; cin >> N >> S;
string first[262200] = {}, second[262200] = {};
for(int i = 0; i < (1 << N); i++){
string tmp1, tmp2;
for(int j = 0; j < N; j++){
if((i >> j) & 1) tmp1.push_back(S.at(j));
else tmp2.push_back(S.at(j));
}
reve... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long M=1e9+7;
void solve(){
int n;
cin>>n;
long long sum=0,ans=0,p;
for(int i=0;i<n;i++){
cin>>p;
ans= (ans+(p*sum)%M)%M;
sum=(sum+p)%M;
}
cout<<ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
t... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _ov... | #include <bits/stdc++.h>
using namespace std;
#define debug(a) cerr << #a << ": " << a << endl
typedef long long ll;
typedef pair<int, int> ii;
#define x first
#define y second
const int N = 20;
int n;
char s[2 * N];
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endi... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | #include <iostream>
using namespace std ;
int main()
{
int A, B, c, d, e;
cin>>A;
cin>>B;
c =(A + B);
d =(A - B);
e =(A * B);
if (c >= e&&c >= d)
{
cout<<c<<endl;
}
else if (e >= d&&e >= c)
{
cout<<e<<endl;
}
else if (d >= e&&d >= c)
{
cout<<d<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
int di[] = {1, 0, -1, 0};
int dj[] = {0, 1, 0, ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 |
#include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
A -= A%2;
B += A/2;
A /= 2;
}
else{
B-=B%2;
A+=B/2;
B/=2;
}
}
cout << A <<" "<< B << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
vector<int> ball(200005,0);
void putball(int n){
for(int i=1; i<=sqrt(n); i++){
if(n%i==0){
ball.at(i)++;
if(i!=n/i)ball.at(n/i)++;
//cout << "putball " << i << ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#de... | 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W, A, B;
cin >> H >> W >> A >> B;
for (int i = 0; i < B; i++) {
for (int j = 0; j < A; j++) {
cout << 0;
}
for (int j = A; j < W; j++) {
cout << 1;
}
cout << endl;
}
for (int i = B; i < H; i++) {
for (in... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;
typedef ve... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define deb... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
r... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
/// https://ideone.com/Fd5s8n
int k;
cin>>k;
string s;
cin>>s;
if(s.length()<=k)
cout << s << endl;
else{
for(int i=0;i<k;i++)
cout << s[i];
cout << "...... | 1 |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bi... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int n = s.length();
if(s.length()==2){
if(s[0]==s[1]) cout<<"1 2";
else cout<<"-1 -1... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
vector<int>vec[26];
char str[MAX];
void Get_P... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
int main()
{
int A, B;
std::cin >> A >> B;
if ((B-1)%(A-1)==0) std::cout << (B-1)/(A-1) << std::endl;
else std::cout << (B-1)/(A-1) + 1 << std::endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef long double ld;
// a>b -> a==b;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
// a<b -> a==b;
template<class T> inline bool chmax(T& ... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
string ten[3]={"A","B","C"};
int main()
{
int n;
cin>>n;
for(;n!=0;cin>>n)
{
rep(i,n)
{
int ma,en,ja;
int ans=2;
cin>>ma>>en>>ja;
if(((ma... | #include<iostream>
using namespace std;
int main(void)
{
int n,pm[10001],pe[10001],pj[10001];
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>pm[i]>>pe[i]>>pj[i];
}
for(int i=0;i<n;i++){
if(pm[i]==100||pe[i]==100||pj[i]==100||(pm[i]+pe[... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define oo 1000000010
#define mod 1000000007
const int N = 100010;
int n , m , arr[N] , v , p;
bool check(int mid){
int val = arr[mid] + m;
if(arr[n - p] > val)
return false;
long long all = 0;
for(int i = 0 ;i < n - p + 1;i++){
all += min(m , max(0 , val - arr[i])... | #include <stdio.h>
#include <stdlib.h>
unsigned gaps[] = {1,8,23,77,281,1073,4193,16577,65921,262913,1050113};
// generated from pow(4,i)+3*pow(2,i-1)+1 (prefixed with 1)
unsigned insertion_sort(unsigned a[], unsigned n, unsigned gap){
unsigned i,count = 0;
for(i = gap; i < n; i++){
unsigned v = a[i];
int... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1){
int m,nmin,nmax;
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0) break;
int p[m];
for(int i=0; i<m; i++){
cin >> p[i];
}
sort(p,p+m,greater<int>());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
long double N,M,D;
cin >> N >> M >> D;
if(D==0){
cout << setprecision(10) << (1/N)*(M-1) << endl;
}else{
// 1組の隣り合っ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <array>
#include <l... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | #include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
#define coa cout << ans << endl; return 0;
using namespace std;
using ll = long long;
template<typename T>
using vec = vector<T>;
template<typename T>
using vvec = vector<vector<T>>;
using qint = queue<int>;
using sint... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
string az="abcdefghijklmnopqrstuvwxyz";
s... | 1 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,y;
cin>>n>>y;
long long f=y/10000;
f(i,0,f+1){
f(j,0,n-i+1){
if(10000*i+5000*j+1000*(n-j-i)==y){
cout<<i<<" "<<j<<" "<<n-i-j<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.