code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
template <class operator_monoid> class dual_segment_tree{
public:
typedef typename operator_monoid::underlying_type underlying_type;
typedef typename operator_monoid::value_type value_type;
size_t n;
vector<underlying_type> v;
vector<value_ty... | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define mkt make_tuple
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int n, q, s, t, x, u;
iP a[1<<18];... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
vector<int>A(100000,0);
for (int i = 0; i < n; i=i+2) {
A.at(v.at(i)-1)++;
}
vector<int>a(100000,0);
for (int i = 0; i < 100000; i++) {
a.... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long inf = numeric_limits<long long>::max();
typedef long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
bool x = true;
if( e-a>k || e-b>k || e-c>k || e-d>k || d-a>k || d-b>k || d-c>k || c-a>k || c-b>k || b-a>k ){
x = false;
}
if( x ){
cout << "Yay!" << endl;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
cout << (H2 - H1) * 60 + M2 - M1 - K << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n)
{
return ((n & 1) ? 3 * n + 1 : n / 2);
}
int main()
{
int n;
cin >> n;
cout <... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(),(obj).end()
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define rep(i,n) for(int i=0;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> inline bool chmin(T& a, T b) { if... | 1 |
#include<bits/stdc++.h>
#define oo ll(1e16)
#define maxn 200005
#define block 400
using namespace std;
typedef long long ll;
int n, q, a, b;
ll d[maxn];
ll L[maxn], R[maxn];
ll ret = 0;
ll get(int st, int en, int ok) {
ll ret = oo;
for (int i = st; i <= en;)
if (i % block == 1 && i + block <= en + 1) {
... | // luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename _tp> inline void read(_tp&x){
char ch=getchar(),ob=0;x=0;
while(ch!='-'&&!isdigit(ch))ch=getchar();if(ch=='-')ob=1,ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();if(ob)x=-x;
}
#define lson l... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
const int mod=1e9+7;
int... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;
string s;
int a[4];
int main() {
cin >> s;
forn(i, 4) a[i] = s[i] - '0';
forn(mask, 16) if (!(mask & 1)) {
... | 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=101;
char a[N][N];
int row[N][N],col[N][N],f[N][N][N][N];
int n,m,x,y;
inline void chk(int &a,int b){a=max(a,b);}
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;++i) scanf("%s",a[i]+1);
for(int i=1;i<=n;++i)
for(int ... | #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()
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int x,y;
scanf("%d%d",&x,&y);
ll ans = 0;
if(x == 3) ans += 100000;
else if(x == 2) ans += 200000;
else if(x == 1) ans += 300000;
if(y == 3) ans += 100000;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int m, d, past;
int day[] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
string week[] = { "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday", "Wednesday" };
while (cin >> m >> d, m != 0) {
past = 0;
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>> ans(h... | #include<bits/stdc++.h>
#define int long long
#define rg register
#define file(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout);
using namespace std;
const int N=200000+10;
const int mod=1e9+7;
int read(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9') f=(c=='-')?-1:1,c=getchar();
while(c>='0'&&c... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; i++){
if( i % 3 == 0 || i % 10 == 3 || i / 10 % 10 == 3 || i / 100 % 10 == 3 || i / 1000 % 10 == 3) cout << " " << i;
}
cout<<endl;
// your code goes here
return 0;
} | 0 |
#include <iostream>
#include <cmath>
#define B 600
int f(int x);
using namespace std;
int main(void) {
int d, S = 0;
while(cin >> d) {
for(int i = 0; i < B/d; i++) {
S = S + d*f(i*d);
}
cout << S << '\n';
S = 0;
}
return 0;
}
int f(int x) {
return pow(x,2);
} | #include <stdio.h>
int main (){
int c;
scanf ("%d", &c);
int firstNumber = c / 100;
int secondNumber = (c % 100) / 10;
int thirdNumber = c % 10;
if (firstNumber == 7 || secondNumber == 7 || thirdNumber == 7){
printf ("Yes", c);
}else{
printf ("No", c);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_u... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll g[15][15];
for(ll i=0;i<n;i++){
for(ll j=0;j<n;j++)g[i][j]=-1;
}
for(ll i=0;i<n;i++){
ll m;
cin >> m;
for(ll j=0;j<m;j++){
ll a,x;... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
/* ちゃんと考えてわかって実装 */
int main(void){
ll n, k;
cin >> n >> k;
vector<ll> x;
for(int i=0; i<n; i++){
int tmpx; cin >> tmpx;
x.push_back(tmpx);
}
ll ans = 1e19;
for(int l=0; l<=n-k; l++)... | #include<bits/stdc++.h>
#define int long long
#define out(x) cerr << #x << " = " << x << "\n"
using namespace std;
// by piano
template<typename tp> inline void read(tp &x) {
x = 0;char c = getchar();bool f = 0;
for(; c < '0' || c > '9'; f |= (c == '-'), c = getchar());
for(; c >= '0' && c <= '9'; x = (x << 3) + ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long... | #include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
#include <string.h>
using namespace std;
typedef pair<int,int> P;
const int INF = ~(1<<31) / 2;
int c[1... | 0 |
#include<iostream>
bool rc(int);
bool board[64]{}, row[8]{}, column[8]{}, right_down[15]{}, left_down[15]{};
int main()
{
int k, r, c;
std::cin >> k;
for (int i = 0; i < k; ++i)
{
std::cin >> r >> c;
board[r * 8 + c] = true;
row[r] = column[c] = true;
right_down[7 + c - r] = left_down[r + c] = true;
}
... | // ※※※ 解答不能 ※※※
// Um_nik氏
// https://atcoder.jp/contests/agc041/submissions/9181788
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i ... | 0 |
#include <bits/stdc++.h>
using namespace std;
namespace program
{
namespace IO
{
struct input_t
{
static const int BUF_SIZ = 500000;
FILE *f;
char Buf[BUF_SIZ], *p, *pend;
input_t(FILE *_f) : f(_f), p(Buf), pend(Buf) {}
~input_t() { fclose(f); }
char getchar();
template <typename T>
T re... | #include<bits/stdc++.h>
using namespace std;
int n,m,pos[100010],p[100010],to[100010],w[100010],ans[100010];
long long u[100010],k;
bool v[100010];
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9') {
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') {
x=(x<<3)+(x<<1)+ch-'0';
ch=get... | 1 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
cout << min(a+b,min... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 0 |
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <climi... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n)!=EOF){
long ans=0;
//printf("%d\n",n);
for(int i=0;i<600;i+=n){
ans+=i*i*n;
}
printf("%l... | 0 |
/*
verified on 2019/12/13
vec2d<double> -> https://atcoder.jp/contests/agc021/submissions/8932641
vec2d<long> -> https://atcoder.jp/contests/abc022/submissions/8932886
*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
/* ここからスニペット */
#include <complex>
#include <numeric>
#include ... | #include <iostream>
#include <vector>
using namespace std;
int InsertionSort(vector<int> &A, int g){
int N = A.size();
int cnt = 0;
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 = j - g;
... | 0 |
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
int w,h;
int sx,sy,gx,gy;
int field[104][104];
class Info{
public:
int x,y;
};
bool bfd(void){
int search = field[sy-1][sx-1];
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
queue<Info> q;
Info tmp = {sx-1,sy-1};
if(search == 0){r... | #include <iostream>
#include <limits.h>
using namespace std;
int m;
int dijkstra( const int data[101][101], int start, int end )
{
int i,j,next,min;
bool visited[101];
int distance[101];
for( i = 1;i <= 100;i++ ){
visited[i] = false;
distance[i] = INT_MAX;
}
distance[start] = 0; next = start;
do{
i =... | 0 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
typedef pair<double, string> P;
typedef pair<string, double> Q;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
string plant;
int p, a, b, c, d, e, f, s, m;
int time;
dou... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).beg... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define GOOD 1000000
long total[4005];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, id, p, q, cnt;
cin >> n;
while (n != 0) {
for (int i = 0; i < 4005; i++) {
total[i] = 0;
}
cnt = 1;
for (int i = 0; i < n; i++) {
cin >> id >> p >> ... | #include <iostream>
using namespace std;
int main(){
int n, x, y, m, d;
char l;
int field[21][21];
int rx, ry;
cin >> n;
while(n){
for(int i=0;i<21;++i){
for(int j=0;j<21;++j){
field[i][j] = 0;
}
}
rx = 10, ry = 10;
for(int... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M = 1000000007;
int mod(int a){
return (a%M + M)%M;
}
int mul(int a, int b){
return mod(mod(a) * mod(b));
}
int add(int a, int b){
return mod(mod(a) + mod(b));
}
int sub(int a, int b){
return mod(mod(a) - mod(b));
}
main(){
int n; cin>>n;
i... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
long long all = 0;
long long p = 1000000007;
for(int i = 0; i < n; i++){
all += a[i];
all = all % p;
}
long long ans = 0;
for(int i = 0; i ... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <co... | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,sum = 0,ans,sumkeep;
while(cin >> n){
if(n == 0)break;
ans = 0;
sumkeep = 0;
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
sumkeep = 0;
for(int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
string ans;
if(n<1200) ans = "ABC";
else if(n<2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
return 0;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, se... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
template<class V, int ME> class BIT {
public:
V bit[1<<ME]... | #include <climits>
#include <iostream>
#include <vector>
typedef std::vector<int> IntVector;
void Input(IntVector& Inputs)
{
std::cin.tie(0);
std::ios::sync_with_stdio(false);
long long Count;
std::cin >> Count;
Inputs.resize(Count);
for(long long i=0;i<Count;i++){
int N = 0;
std::cin >> N;
Inputs[i] = N;... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi firs... | #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... | 0 |
#include <cstdio>
#include <set>
int main()
{
int s, t; //number of integers for S and T
int count = 0; // number of integers of T in S
std::set<int> S; // set S to be checked against
scanf("%d", &s);
for (int i = 0; i < s; ++i) {
int input;
scanf("%d", &input);
S.insert(input);
}
sc... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;
int n,q;
int a=0;
int c=0;
int s[10000]={};
int t[10000]={};
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>s[i];
}
cin... | 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 n,m;
vector<int> v[3];
int main(){
read(n);read(m);
fo... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include<bits/stdc++.h>
#define mod 998244353
#define maxn 1000005
using namespace std;
typedef long long LL;
int read()
{
char c=getchar();int f=1,sum=0;
while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
int n,m;
LL fac[maxn],inv[m... | 1 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int cards[5];
char dummy;
while (cin>>cards[0]>>dummy>>cards[1]>>dummy>>cards[2]>>dummy>>cards[3]>>dummy>>cards[4])
{
int count=0,ans=0;
sort(cards,cards+5);
for (int i=0; i<4; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
void print() { cout << endl; }
template <typename Head, typename... Tail>
void print(Head head, Tail... tail) {
int size = sizeof...(Tail);
cout << head;
if (size > 0) {
cout << " ";
}
print(tail...);
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | #include <cstdio>
const int MAXN = 6000;
int f[4][2*MAXN + 5], N, M;
int main() {
scanf("%d%d", &N, &M);
f[0][MAXN] = 1;
for(int i=1;i<=3*N;i++) {
int lb = MAXN - (i - 1), ub = MAXN + (i - 1);
for(int j=lb;j<=ub;j++) {
for(int o=3;o>=1;o--)
f[o][j] = f[o-1][j];
f[0][j] = 0;
}
for(int j=lb;j<=u... | 0 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
bool isprime(ll n){
if (n == 0 || n == 1)
return false;
for (ll i = 2; i*i <= n; i++){
if (n % i == 0)
... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
map < int, int > primes (int x) {
map < int, int > res;
for (int i = 2; i * i <= x; ++i) {
while (x % i == 0) {
x /= i;
++res[i];
}
}
if (x != 1)
++res[x];
return res;
}
signed main() {
ios_base::sync_with_stdi... | 1 |
#include<bits/stdc++.h>
#define GPA 4
#define ROLLMAN endl
using namespace std;
typedef int OTAKU;
OTAKU main(){
OTAKU roll[ GPA ], man[ GPA ];
for(OTAKU i = 0; i < 4; i++)cin>>roll[i];
for(OTAKU i = 0; i < 2; i++)cin>>man[i];
sort(roll,roll+4);
sort(man,man+2);
OTAKU Happy_Birthday=0;
for(... | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> v;
for (int i =0 ;i < 2 * N; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
int ans = 0;
for (int i =0 ;i < N; i++) {
ans += v[2 * i];
}
cout... | 0 |
//khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize ("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const ll INF... | #include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;//998'244'353;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
int dx[4]={ 1,0,-1,0 };... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
int ai = a.size() - 1;
int bi = b.size() - 1;
if (a[ai] == b[0] && b[bi] == c[0]) cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<string, string> P;
string s;
void dfs(int i, int end, const string lTemp, const string rTemp, vector<P> &x)
{
if (i == end)
{
x.push_back(make_pair(lTemp, rTemp));
return;
}
dfs(i + 1, end, lTemp + s[i], ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<long long ... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
if(a1 <= a3 && a3 <= a2 || a2 <= a3 && a3 <= a1) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 1 |
#include <cstdio>
#define ll long long
ll mod = 1000000007;
ll big(ll b, ll p){
if (p == 1) return b;
ll h = big(b, p / 2);
ll res = (h * h) % mod;
if (p % 2 == 1) res = (res * b) % mod;
return res;
}
int main(){
ll n, m, k, ans = 1, x = 0, y = 0;
scanf("%lld %lld %lld", &n, &m, &k);
for (int i = 2; i < k; i++)... | #include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace s... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vect... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int t;
cin>>t;
long long int ans = 0, max = t;
for(int i = 1; i < n; i++) {
cin>>t;
if(t < max) {
ans += max-t;
}
else if(t > max) {
max = t;
}
}
cou... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> P;
typedef pair<ll, pair<ll, ll> > P3;
const ll MOD = ll(1e9 + 7);
const ll LLINF = LLONG_MAX;
const int IINF = INT_MAX;
const int MAX_N = int(1e5) + 5;
const double EPS = 1e-8;
int dx[] = {1, 0, ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a,b,c,d,x;
double da,db;
string s,ss,sss;
int ans = 0;
str... | 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... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for(int i =... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void) {
long n, m;
cin >> n >> m;
vector<vector<long>> a(n, vector<long>(m));
for(auto &l: a)
for(auto &c: l)
cin >> c, c--;
long ok = 300, ng = 0;
while(ok - ng > 1) {
long mid = (ok+ng)/2;
vector<long>... | #include <bits/stdc++.h>
using namespace std;
int N,M;
int FS[310][310];
vector<int>K;
int main(){
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
cin>>FS[i][j];
}
}
for(int i=1;i<=M;i++){
K.push_back(i);
}
int eachmaxcnt=0;
int maxcnt=300;
int C[310];
int temp=0;
//ゲ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int x = 0;
cin >> x;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ans = 0;
sort(A.begin(),A.end());
for (size_t i = 0; i < N; i++)
{
// cout << x << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
sort(v.rbegin(), v.rend());
int j = 0;
ll x = 1;
for (int i = 0; i < n; i++) {
if (v[i] == v[i+1]) {
x *= v[i];
j... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str;
int i;
int a, b;
string order, str1;
cin >> str >> i;
for(int j=0;j<i;j++){
cin >> order >> a >> b;
if(order == "replace"){
cin >> str1;
for(int k=0;k<b-a+1;k++)str[a+k]=str... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<T> &v){
for... | 0 |
#include <queue>
#include <cmath>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define set0(x) memset(x,0,sizeof(x))
#define id(x,lev) x*52+lev
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
using namespace std;
typedef l... | #include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n;
long long tot=1,d[99001],e[99001],s=0;
int main()
{
cin>>n;
d[0]=e[0]=1;
for(int i=1,x;i<=n;i++)
{
cin>>x;
s+=x;
tot=tot*3%mod;
for(int j=s;j>=0;j--)
{
d[j]=(d[j]*2+(j>=x?d[j-x]:0))%mod;
e[j]=(e[j]+(j>=x?e[j-x]:0))%mod;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (i... | /*
* X_Cubic.cpp
*
* Created on: 2014/07/20
* Author: WanWan1985
*/
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
// 入力値
int iInput;
cin >> iInput;
// 実行
double dOutput = pow((double)iInput, 3.0);
// 出力
cout << (int)dOutput << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4e3 + 5, MOD = 998244353;
int c[N][N], pw[N] = {1};
int mul() {return 1;}
template <typename Head, typename... Tail>
int mul(Head H, Tail... T) {return 1ll * mul(T...) * H % MOD;}
int sum() {return 0;}
template <typename Head, typename... Tail>
int sum(Head ... | #include<cstdio>
#include<algorithm>
using std::max;
#define int long long
const int mod=998244353;
int K,n,_2[5010],C[5010][5010];
signed main(){
scanf("%lld%lld",&K,&n);
C[0][0]=1;
for(int i=1;i<=5000;i++){
C[i][0]=1;
for(int j=1;j<=i;j++)
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
_2[0]=1;
for(int i=1;i<=50... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++)... | #ifdef APTEST
#include "debug_tools/program.h"
#endif
#include <iostream>
using namespace std;
const unsigned int maxn = 100000, maxm = 100000;
struct edge
{
unsigned int to;
const edge* pre;
} ed[maxm * 2 + 1];
const edge* head[maxn + 1];
unsigned long long siz[2][maxn + 1];
bool col[maxn + 1], vis[maxn + 1];... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
template<class... | 1 |
#include<iostream>
using namespace std;
char classify(int m, int e, int j){
if(m == 100 || e == 100 || j == 100) return 'A';
if((m+e)/2 >= 90) return 'A';
if((m+e+j)/3 >= 80) return 'A';
if((m+e+j)/3 >= 70) return 'B';
if((m+e+j)/3 >= 50 && max(m,e) >= 80) return 'B';
return 'C';
}
i... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
int main () {
int a,b,n,i;
char c;
string str,s,f,g;
cin >> str;
cin >> n;
for(i=1;i<=n;i++){
cin >> s >>a >> b;
if(s[2]=='i'){cout << str.substr(a,b-a+1) << endl;}
else if(s[2]=='v'){
f=str.substr(a,b-a+1... | 0 |
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fast_io() ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int n;
pair <int, int> get(string& s)
{
stack <char> st;
pair <int, int> ans;
ans.first = 0;
for (int i = 0; i < (int)s.size(); i++)
{
if (s[i] == '('... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4]... | 0 |
//##Moh_K_Imar .......
//27/08/2020 ... 8.10
//Ya Rab....
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ll a,b;
cin>>a>>b;
cout<<a*b<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
int x,y,z;
cin >> x >> y >> z;
swap(x,y);
swap(x,z);
cout << x << "... | 0 |
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<long long ... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
int A,B,m;
cin >> A >> B >> m;
int a[A],b[B];
int mina=999999;
int minb=999999;
int xyc[m][3];
for (int i = 0; i < A; i++)
{
cin >> a[i];
if (a[i] < mina)
{
mina=a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int A, B, m; cin >> A >> B >> m;
V<int> a(A), b(B);
int amin = 1e9, bmin = 1e9;
f... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
void printVector(vector<int> v) {
for (auto x : v) {
cout << x << ' ';
}
cout << '\n';
}
void printArray(ll A[], int size) {
for (int i = 0; i <= size - 1; i++) cout << A[i] << ' ';
}
int main() {
int a, b, c, d, e, k;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int N = S.size();
int count = 0;
if (S[0] == 'A' && S[1] >= 'a' && S[1] <= 'z' && S[N - 1] >= 'a' && S[N - 1] <= 'z')
{
for (int i = 2; i < N; i++)
{
if (S[i] >= 'a' && S[i] <= 'z')
... | 0 |
#include <iostream>
#include <algorithm>
#include <set>
std::set <int> s;
int main()
{
int n;
std::cin >> n;
for(int i = 1;i <= n;i++)
{
int x;
std::cin >> x;
if(s.find(x) != s.end())
{
s.erase(x);
}
else
{
s.insert(x);
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define dupl(s) s.erase(unique(s.begin(), s.end()), s.end());//重複取り除き
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s){return accumulate(s.begin... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int mem[4010][6010][3];
void add(int &x, int v)
{
x = (x + v) % m;
}
int main()
{
scanf("%d%d", &n, &m);
mem[1][1][0] = 1;
for(int i = 1; i <= 2 * n; i++)
{
for(int j = 1; j <= 3 * n - 1; j++)
{
for(int k = 0; k ... | #if 0
date +%Y.%m.%d
题解先咕着。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
} read;
const int maxn = 6005;
ll f[maxn][maxn << 1];
ll inv[maxn];
int main () {
int n = read * 3,... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int JOIlevel(const string &s){
int J=0,O=0,I=0;
int res = 0;
char prec = -1;
for(int i = 0; i < (int)s.length(); ++i){
if( s[i] == 'J' && (prec == 'J' || prec == -1 ) ){
++J;
O = 0;
I = 0;
prec = s[i];
... | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define REP(i,n) for( (i)=0 ; (i)<(n) ; (i)++ )
#define rep(i,x,n) for( (i)=(x) ; (i)<(n) ; (i)++ )
#define REV(i,n) for( (i)=(n) ; (i)>=0 ; (i)-- )
#define FORIT(it,x) for( (it)=(x).begin() ; (it)!... | 0 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
class Node{
public:
vector< int > e_to;
vector< int > e_cost;
bool def;
int min_cost;
Node(){
def = false;
min_cost = -1;
}
};
bool operator==(const Node& ot1, const Node& ot2){
return ot1.min_cost == ot2.mi... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=10000;
const ll INF=1000000010;
const ll LINF=1000000000000000010;
const int MAX=100001;
int dx[8]={0,1,0,-1,1,-1,1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
int dp[310][310][610]... | 0 |
#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 yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = 0;
vector<vector<int>> graph(N);
for(int i = 0; i < N; ++i) {
int a; cin >> a;
a--;
if(i) graph[a].emplace_back(i);
else if(a) ans++;
}
auto dfs = [&](auto &&dfs, in... | #include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using names... | 0 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
using P = pair<int,int>;
const int INF = 1001001001;
const int MOD = 1000000007;
int main(){
int r;
cin >> r;
co... | 1 |
#include<bits/stdc++.h>
using namespace std;
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is >> a.first >> a.second; }
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os << a.first << " " << a.second; }
template<typename T> ist... | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <stack>
#include <vector>
#include <math.h>
#include <queue>
using namespace std;
struct Info{
int succeed_num;
};
int main(){
char* buf = new char[1000001];
char pre;
Info J_data,O_data;
J_data.succeed_num = O_data.succeed_num = 0;
scanf("... | 1 |
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int total = 0;
if (A >= B) {
total += A;
A -= 1;
}
else {
total += B;
B -= 1;
}
if (A >= B) {
total += A;
A -= 1;
}
else {
total += B;
B -= 1;
}
cout << total << endl;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000000;
const ll mod = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
static const int NIL = -1;
struct Vertex {
vector<int> link;
int parent = NIL;
int ord;
int lowlink;
bool is_visit = false;
};
class ArticulationPoint {
private:
int n;
vector<Vertex> graph;
int timer = 1;
publ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> articulation_points;
vector<int> graph[100000];
int ord[100000],low[100000];
bool visited[100000];
int visit_time = 0;
void dfs(int v,int p){
visited[v] = true;
ord[v] = visit_time;
low[v] = ord[v];
visit_time++;
b... | 1 |
#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... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#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) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(... | 1 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int i, j, n, m[11][11];
while(cin >> n) {
if(n==0)
break;
for(i=0; i<n+1; i++) {
for(j=0; j<n+1; j++) {
m[i][j]=0;
}
}
for(i=0; i<n; i++) {
for(j=0; j<n; j++) {
cin >> m[i][j];
m[i][n]+=m[i][j];
m[n][j]+=m[... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
multiset<int,greater<int> > M;
for(int i=1,x;i<=n;i++)
cin>>x,M.insert(x);
int ans = 0;
while(M.size()){
int x = *M.begin();
M.erase(M.begin());
int y = (1<<(32-__builtin_clz(x)))-x;
if(M... | #include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf ... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int k,t;
cin >> k >> t;
multiset<int> s;
rep(i,t){
int temp;
ci... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define erep(n) for (ll i = 0; i <= n; ++i)
#define erep2(i,... | 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>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
int main() {
int k,x;
cin >> k >> x;
for (int i = x-k+1; i < x+k; i++) {
cout << i << " ";
}
cout << endl;
}
| 1 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N, M, A[1111], B[1111], V[1111];
int main()
{
cin >> N >> M;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= M; i++)
{
for (int j = 1; i <= N; j++)
{
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> cost(N);
for(int i = 0; i < N; ++i)
cin >> cost[i];
vector<int> score(N, 0);
while(M--) {
int x; cin >> x;
for(int i = 0; i < N; ++i) {
if(cost[i] <= x) {
... | 1 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<L... | #include<bits/stdc++.h>
using namespace std;
int main(){
int prime[10001]={0};
prime[0]=prime[1]=1;
for(int i=2;i<sqrt(10000);i++){
if(!prime[i]){
for(int j=0;i*(j+2)<10000;j++){
prime[i*(j+2)]=1;
}
}
}
int n;
while(cin>> n,n){
for(int i=n;i>1;i--){
if(!prime[i] && !prime[i... | 1 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using pii=pair<double,string>;
int main(){
int n;
while(cin >> n,n){
vector<pii> v(n);
rep(i,n){
string l;
int p,a,b,c,d,e,f,s,m;
cin >> l>>p>>a>>b>>c>>d>>e>>f>>s>>m;
auto time=a+b+c+m*(d+e);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
int sum = 0;
int d = 10000000;
int a,b,c;
int x;
cin >> n;
for(i = 0 ; i < 8 ; i++)
{
a = d*10;
b = n/a;
c = b*10;
sum += n/d - c ;
d /= 10;
}
x = n/sum;
if (sum != 0 && x*sum == n)
cout << "Yes" << endl;
else
cout << "N... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int num = 0;
for(int i = 0; i < (int)str.size(); ++i){
num +=(int)(str[i] - '0');
}
int N = atoi(str.c_str());
if(N % num == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int i,a,b,m[3];
scanf("%d %d",&a,&b);
for(i=0;i<3;i++){
m[0]=a+b;
m[1]=a-b;
m[2]=a*b;
}
sort(m,m+3);
printf("%d\n",m[2]);
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int max = a + b;
if (a - b > max)
max = a - b;
if (a*b > max)
max = a * b;
cout << max;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | //
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i... | 0 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
struct st {
int f[20][20], cnt, x, y, id;
};
int dx[]{ 1,-1,0,0 }, dy[]{ 0,0,1,-1 };
int ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define reep(i,a,b) for(int i=a; i<b; i++)
#define fi first
#define se second
using pii = pair<int,int>;
using vint = vector<char>;
using vvint = vector<vector<char>>;
using bit = bitset<400>;
int w,h;
bool inside(int a, int b){
r... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <bits/stdc++.h>
#include<cmath>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,char>> vec;
for(int i=0;i<m;i++){
int s;
char c;
cin>>s>>c;
vec.push_back(make_pair(s,c));
}
for(int i=0;i<1000;i++){
string s=to_string(i);
if(s.size()!=n)continue;
bool ok=true;
fo... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m,n)
{
vector<int> G[500];
int u,v;
for(int i=0;i<m;i++)
{
cin>>u>>v;
u--;v--;
G[u].push_back(v);
G[v].push_back(u);
}
vector<int> F;
for(int i=0;i<G[0].size();i++)
{
F.pu... | 0 |
#include <iostream>
using namespace std;
int main() {
int numberA[4], b, c, i, min, ans=0;
for (i = 0; i <= 3; i++) {
cin >> numberA[i];
if (i == 0) {
min = numberA[0];
}
if (i > 0) {
if (numberA[i] < min) {
min = numberA[i];
}
else if (numberA[i] > min) {
min = min;
}
else {
mi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll minimum(ll a,ll b,ll c,ll d,ll e){
return min(min(a,min(b,c)),min(d,e));
}
int main(){
ll n,a,b,c,d,e;
cin >> n >> a >> b >> c >> d >> e;
ll time=4;
ll data=minimum(a,b,c,d,e);
time+=(n/data);
if(n%data!=0){
time++;
}
cout <<... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool at=true;
if(s.size()%2!=0){
cout<<"No"<<endl;
return 0;
}
for(int i=0;i<s.size()-1;i+=2){
if(s[i]!='h'||s[i+1]!='i'){
at=false;
break;
}
}
if(at==true) cout<<"Yes"<<endl;
else cout<<"No"<<endl;... | #include<iostream>
#include<string>
using namespace std;
class Dice{
public:
int face[7];
Dice(){
for(int i = 1; i <= 6; i++)
cin >> face[i];
}
void roll_z(){ roll(2,3,5,4);}
void roll_y(){ roll(1,3,6,4);} // to W
void roll_x(){ roll(1,2,6,5);} // to N
void roll(int i, int j, int k, int l){
... | 0 |
#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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
int V;
vector<int> G[MAX],rG[MAX],vs;
bool used[MAX];
int cmp[MAX];
void add_edge(int from,int to){
G[from].push_back(to);
rG[to].push_back(from);
}
void DFS(... | 0 |
#include<stdio.h>
#include <iostream>
#include <cmath>
using namespace std;
int main ()
{
double x1,y1,x2,y2,x3,y3;
cin>>x1>>y1>>x2>>y2;
x3=pow(x1-x2,2);
y3=pow(y1-y2,2);
printf("%f",sqrt(x3+y3));
return 0;
}
| #include<cstdio>
long double sqrt(double);
int main(void){
long double d;
double x1,y1,x2,y2,D;
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
D=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
sqrt(D);
d=sqrt(D);
printf("% 8.8Lf\n",d);
return 0;
}
long double sqrt(double a){
int i;
long double b=3;
for(i=0;i<256;i++){
b=(b/2)+(a/(2*b));
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
string solve() {
size_t k; cin >> k;
string s; cin >> s;
if (s.size() > k) {
return s.substr(0, k) + "...";
}
return s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
if (s.size() <= k) cout << s << endl;
else {
for (int i = 0; i < k; i++) {
cout << s.at(i);
}
cout << "..." << endl;
}
} | 1 |
#include <bits/stdc++.h>
//#include <math.h>
using namespace std;
//#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n... | #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,-1,0};
int dy[4]={1,0,0,-1};
long double eps = 1e-6;
lo... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 303
const int mod=998244353;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,m,gu,dp[... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 5e5 + 100, base = 13, m1 = 1e9 + 7, m2 = 1e9 + 9;
int n, a[maxN + 1], b[maxN + 1];
int ha[2][35][maxN + 1], hb[2][35], hc[2][35];
int pw[2][maxN + 1], ans[35][maxN + 1];
inline int read()
{
int num = 0, f = 1;
char ch = getchar();
while( !isdigit( ch ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> suffix_array(vector<int>& s) {
int n = s.size();
vector<int> p(n), c(n), cnt(n);
for (int i = 0; i < n; i++) cnt[s[i]]++;
for (int i = 1; i < n; i++) cnt[i] += cnt[i-1];
for (int i = 0; i < n; i++) p[--cnt[s[i]]] = i;
... | 1 |
#include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_INPUT_SIZE 1024
void trace(int num, int* array);
int bubbleSort(int num, int* array);
int
main(int argc, char* argv[])
{
char input[MAX_INPUT_SIZE];
int num = atoi(fgets(input, sizeof(input), stdin));
int* array = new int[num];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0583
template<typename T>
vector< T > divisor(T n) {
vector< T > ret;
for(T i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(beg... | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int stage[12][12] = {{0}};
int n;
int j = 0;
int x = 0,y = 0,xx = 0;
for(;;){
cin >> n;
if(n == 0)break;
for(int i = 0;i < n; i++){
for(j = 0;j < n; j++){
cin >> stage[i][j];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
templat... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int m,l,r;
cin>>m>>l>>r;
if(!m&&!l&&!r)break;
int a[300];
for(int i=0;i<m;i++)cin>>a[i];
sort(a,a+m);
reverse(a,a+m);
int gap=0,n;
for(int i=l-1;i<r;i++)
if(a[i]-a[i+1]>=gap)n=i,gap=a[i]-a[i+1];
cout <<n+1<<endl;
}
r... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
long long Mod = 998244353, F[10100], InvF[10100], po[10100];
long long Pow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1)r = r*a%Mod;
a = a*a%Mod; b >>= 1;
}
return r;
}
long long Comb(int a, int b) {
if (a >= b&&b >= 0)return F[a] ... | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
string res;
cin >> a >> b >> c;
if(a == b && c != a)
res = "Yes";
else if(a == c && b != a)
res = "Yes";
else if(b == c && a != b)
res = "Yes";
else res = "No";
cout << res << "\n";
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll power(ll p,ll n){
ll result=1;
while(n!=0){
if(n%2==0){
n/=2;
p*=p;
}
else{
n--;
result=result*p;
}
}
return result;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,t,a,b,c,d... | 1 |
#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>
using namespace std;
int main()
{
vector<string> days = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string d;
cin >> d;
cout << 7 - distance(days.begin(), find(days.begin(), days.end(), d)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//print(fixed << setprecision(10));
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define repk(i,n,k) for(ll i = k; i < (n); i++)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
double PI = acos(-1.0);
int INF = 1e9;
ll LINF = 1e18... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#defin... | #include <iostream>
using namespace std;
int main(void){
string s;
cin>>s;
if (s.size()%2){
cout<<s[2]<<s[1]<<s[0];
}
else{
cout<<s;
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,k;
cin>>n>>k;
vector<int> p(n);
rep(i,n){
cin>>p[i];
p[i]++;
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define dbg(x) cerr << "[" #x << " : " << x << "]\n";
const int mod = (int)1e9+7;
int main()
{
int n, k;
scanf("%d%d", &n, &k);
int p[210000];
for(int i = 0; i < n; i++) scanf("%d", &p[i]);
double ans = 0;
double s = 0;
int... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int ans = 1;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ans = min(ans*2, ans+k);
}
cout << ans << endl;
} | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.