code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for... | #include <iostream>
using namespace std;
int f[102][102];
bool dfs(int ys,int xs,int yg,int xg,int c){
if(f[ys][xs]!=c)return 0;
if(ys==yg && xs==xg)return 1;;
f[ys][xs]=0;
bool flag=0;
flag += dfs(ys+1,xs,yg,xg,c);
flag += dfs(ys-1,xs,yg,xg,c);
flag += dfs(ys,xs+1,yg,xg,c);
flag += dfs(ys,xs-1,yg,... | 0 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5;
const LL MOD = 1e9+7;
inline LL dmod(LL x){
return x%MOD;
}
LL fakto[N+5];
void pre(){
fakto[0] = 1LL;
for(int i=1;i<=N;i++){
fakto[i] = dmod(fakto[i-1]*(LL)(i));
}
return;
}
LL fe(LL x, LL y){
if(y==0) return 1LL;
LL r... | 1 |
#include <stdio.h>
#include <algorithm>
int m = 0;
int count = 0;
int G[1000000];
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void InsertionSort(int A[], int N, int g) {
for (int... | #include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m,... | 1 |
#include <iostream>
using namespace std;
int main(){
while(true){
int e;
cin >> e;
if(e == 0) break;
int m;
m = e;
for(int z = 0 ; z * z * z <= e ; z++){
for(int y = 0 ; y * y + z * z * z <= e ; y++){
int x = e - z * z * z - y * y;
if(m > x + y + z) m = x + y + z;
}
}
... | #include <bits/stdc++.h>
using namespace std;
bool is_prime(int n){
if(n == 2 || n == 3) return true;
if(n % 6 != 1 && n % 6 != 5) return false;
for(int i = 2; i * i <= n; i++){
if(n % i == 0) return false;
}
return true;
}
int main(){
vector<int> P;
for(int i = 3; i < 10000; i+=2){
if(is_prime(i)) P.pus... | 0 |
#include<bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
bool isBigger(P a, P b){
// return a > b
return (a.first > b.first) && (a.second > b.second);
}
int main(){
int N;
cin >> N;
vector<P> A(N);
vector<P> B(N);
rep(i,N){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int num;
while(cin>>num){
char str;
int hand[14]={};
hand[num]++;
for(int i=0;i<4;i++){
cin>>str>>num;
hand[num]++;
}
bool four=0,three=0,two[2]={};
for(int i=1,j=0;i<14;i++)... | 0 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
transform(s.begin(), s.end(), s.begin(), [](char c) { return c - '0'; });
int64_t n = s.size()... | #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> s(h+2,vector<char> (w+2,'.'));
for ( int i = 1; i < h+1; i++){
for ( int j = 1; j < w+1; j++){
cin >> s[i][j];
}
}
for ( int i = 1; i < h+1; i++){
for ( int j = 1; j < w+1; j+... |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::vector<bool> dict(26, false);
for (char c : s)
dict[c - 'a'] = true;
std::string r = "None";
for (std::size_t i = 0;... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n1 , n2;
vector<int> val1 , val2 , ans;
int input;
cin >> n1 >> n2;
for (int i = 0; i < n1; i++)
{
cin >> input;
val1.push_back(input);
ans.push_back(0);
}
for (int i = 0; i < n2; i++)
{
cin >> ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string S; cin >> S;
const int N = S.size();
int K; cin >> K;
int res = 0;
vector<vector<vector<int>>> dp(K+1, vector<vector<int>>(N, vector<int>(N, 0)));
for(int d=N-1;d>=0;d--){
for(int i=0;i+d<N;... | 0 |
/*program from Wolfycz*/
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 0x7f7f7f7f
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
static char buf[1000000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int cnt = 0, s1 = -1, s2 = -1;
vector<int> a(m);
for ( int i = 0; i < m; ++ i) {
cin >> a[i];
if( a[i] & 1) {
++ cnt;
if( cnt == 1) {
s1... | 1 |
#include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
long long int g[1001],s[1001],d[1001],f[1001];
int j,i,k,a,h[1001];
while(1){
scanf("%d",&a);
if(a==0) break;
for(i=0;i<a;i++){
h[i]=0;
g[i]=0;
}
for(i=0;i<a;i++){
scanf("%lld %lld %lld",&s[i],&d[i],&f[i]);
if(d[i]*f[i]>=100... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int N;
while(cin>>N,N){
vector<int> vi(N*N,0),vi2(N*2+1,0);
for(int i=0;i<N;i++){
int sum=0;
for(int j=0;j<N;j++){
int num;
cin>>num;
vi[i*N+j]=num;
sum+=num;
}
vi2[i]=sum;
}
... | 0 |
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; retur... | #include <bits/stdc++.h>
using namespace std;
int cost[] = {0,2,5,5,4,5,6,3,7,6};
bool d[10] = {};
int main() {
int n, m;
cin >> n >> m;
for (int i=0; i<m; i++) {
int a;
cin >> a;
d[a] = 1;
}
vector<string> dp(n+1, "");
for (int j=0; j<=n; j++) {
for (int i=1; i... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
LLI a, b, x, diff, sum = 0 ;
cin >> n >> x;
cin >> a >> b;
if( a + b > x )
{
diff = a + b - x;
if( diff <= b )
b -= diff;
else
b = 0;
sum += diff;
}
a = b;
for(int i = 2; i < n; i++)
{
cin >> b;... | 0 |
#include<iostream>
#include<cstdlib>
#include<queue>
#define MAX 22
#define BLOCK 1
#define START 2
#define GOAL 3
#define REP(i,a,e) for(int i=(a);i<=(e);++i)
#define REPD(i,a,e) for(int i=(a);i>=(e);--i)
using namespace std;
struct Map{
Map(){
REP(i,0,MAX-1)REP(j,0,MAX-1)map[i][j]=0;
}
int h,w;
char map[MAX][MA... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1 << 30;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
int w, h, field[20][20];
int solve(int x, int y, int t)
{
if (t > 9)
return INF;
int ans = INF;
for (int i = 0; i < 4; ++i) {
int xx = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
const int MAX = 2000000;
const int MOD = 998244353;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
const int mod = 998244353;
typedef long long ll;
#define int long long
int fac[maxn], inv[maxn];
int n, m;
int pw(int a, int n) {
int res = 1;
while(n) {
if(n & 1) res = (ll)res * a % mod;
a = (ll)a * a % mod, n >>= 1;
}
return res;
}
int ... | 1 |
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#incl... | // A.
#include <stdio.h>
typedef long long LL;
char buffer[3072000];
LL cnt[20][20];
LL sum[20][20];
LL n;
LL ans;
int main(int argc, char* argv[]) {
char c, *bufptr = buffer;
fread(buffer, 1, 3072000, stdin);
while ((c = *bufptr++) >= '0') {
n = (n * 10) + (c - '0');
}
for (LL i = 0; i < n; ++i) {
LL x = ... | 1 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using name... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
std::string s;
std::cin >> s;
std::reverse(s.begin(),s.end());
std::cout << s << std::endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,k;
cin >> n >> k;
if(k!=0){
cout << "0\n";
return 0;
}
vector<int64_t>a(n-1);
for(int i=0;i<n-1;i++){
cin >> k;
if(k==0){
cout << "0\n";
return 0;
}
a.at(k-1)++;
}
int64_t ans=1;
for(int i=0;i<n-2;i... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define debug(s, param) std::cerr << s << param << std::endl;
using names... | 1 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll rm[2000005]={0},rc[2000005]={0},rmc[2000005]={0};
ll n;
string s;
ll solve(ll k){
ll res=0;
for(int i=1;i<=n;i++){
if(s[i]=='D'){
res+=rmc[i+k-1]-rmc[i];
res-=rm[i]*(rc[i+k-1]-rc[i]);
}
}
return res;
}
int main(){
cin>>n... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
const int inf = 1e9 + 1e8;
int n, k; cin >> n >> k;
vector<int> x(n);
int pos = 0;
bool flag = false;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (x[i - 1] < 0 && x[i] > 0) pos = i;
if (x[i] == ... | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> a,q;
int b;
for(int i=0;i<4;i++){
cin >> b;
a.push_back(b);
}
for(int i=0;i<2;i++){
cin >> b;
q.push_back(b);
}
sort(a.begin(),a.end(),grea... | #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
int sum = 0;
if (A <= B && A <= C && A <= D) sum += B + C + D;
else if (B <= A && B <= C && B <= D) sum += A + C + D;
else if (C <= A && C <= B && C <= D) sum += A + B + D;
else sum += A + B... | 1 |
#include <iostream>
#include <vector>
using namespace std;
const int INF = 2147483647;
struct SegmentTree {
int n;
vector<int> heap;
SegmentTree(int n): n(n) {
heap.assign(4 * n, INF);
}
void update(int nodeId, int l, int r, int ql, int qr, int v) {
if (qr < l || ql > r)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <cstdlib>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
template <class T>
struct prop_segtree {
int n;
vector<T> data;
vector<bool>... | 1 |
#include <bits/stdc++.h>
#include <time.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vv = vector<vi>;
const ll INF = 1001001001;
const ll NUM = 1<<10;
//(開始, 今)を管理
//例:
//(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)
//壁(1,2) ... | #include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define ll long long
#define ld double
#define pb push_back
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
struct CumulativeSum2D {
vector<vector<long long>> csum;
template<typename T>
CumulativeSum2D(v... | #define _USE_MATH_DEFINES
#include <cmath>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<vector>
#include<cctype>
#define rep(i,start,n) for(int i=start;i<n;i++)
#define And &&
#define Or ||
#define Lb cout<<endl
using namespace std;
int main(void) {
string str; cin >> str;
int q; ... | 0 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define ceil(a,b) (((a)+(b)-1)/(b))
#define dist(a,b) max((a)-(b),(b)-(a))
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#defin... | 1 |
#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
#include <set>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
set... | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(1<=(a&&b)<=100)
{
cout<<a*b;
}
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (... | 1 |
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline cha... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int a,b,c,d,e;
int main(){
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
printf("%d\n",max(c*60+d-a*60-b-e,0));
return 0;
} | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A,B,M,p{100000},q{100000},mi{200000},x,y,c;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (auto &e: a) {
cin >> e;
if(e<p) p = e;
}
for (auto &e: b) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | 1 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int64_t N, ans;
cin >> N;
for (int i=0; i<=sqrt(N); i++) {
if (i*i<=N) {
ans=i*i;
}
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n;cin>>n;
int ans =0;
int i = 0;
while(i*i... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
ll pwr (ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
ll inv (ll a) {
return pwr (a, mod - 2);
}
ll nCr (ll n, ll r) {
l... | #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... | 1 |
#include <stdio.h>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string input;
cin >> input;
reverse(input.begin(), input.end());
cout << input << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << min(a+b,min(b+c,c+a)) << en... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
char field[12][12];
int dx[4]={0,0,-1,1},dy[4]={-1,1,0,0};
void dfs(int x,int y){
field[x][y]='0';
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(0<=nx&&nx<12&&0<=ny&&ny<12&&field[nx][ny]=='1')dfs(nx,ny);
}... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<3)
cout<<0;
else if (n%3==0)
cout<<n/3;
else if(n%3!=0){
while(true){
n++;
if(n%3==0){
cout<<n/3-1;
break;
}
}
}
return... | #include<bits/stdc++.h>
//#define <- プログラムの文字列を置換する
//typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c)... | 1 |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typed... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define M ((ll)(1e9)+7)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
typedef long long ll;
ll power(ll x,ll y)
{
if(y==0)
return 1;
ll res=p... | #include<cstdio>
typedef long long ll;
const ll mod=998244353;
inline ll rev(ll x)
{ll k=mod-2,r=1;for(;k;k>>=1,(x*=x)%=mod)if(k&1)(r*=x)%=mod;return r;}
ll fac[1111111],inv[1111111];
inline ll C(int n,int r)
{return((((fac[n]*inv[r])%mod)*inv[n-r])%mod);}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n<m)n^=m,m^=n,... | 0 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const int MAX_W=20;
const int DIRECTIONS=4;//0:up/1:right/2:down/3:left
const int MAX_DEPTH=10;
const int INF=1<<27;
struct tpl{
int ary[MAX_W][MAX_W];
int depth;
int last... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
const int mod=998244353;
LL jc[2500005];
void add(LL &x,LL y){x=(x+y)%mod;}
LL sqrr(LL x){return x*x%mod;}
LL ksm(LL x,int y){
if (y==0) return 1;if (y==1) return x;
LL... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int>a(n);
vector<double>kit(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
kit.at(i)=(a.at(i)+1.0)/2;
}
double ans=0,bf=0;
for(int i=0;i<k;i++)
bf+=kit.at(i);
ans=bf;
for(int i=k;i<n;i++){
bf+=kit.at(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,X,ans=0;
cin >> N >> X;
vector<int>vec(N);
for(int i=0; i<N; i++){
cin >> vec[i];
}
sort(vec.begin(),vec.end());
for(int i=0; i<N; i++){
if(X<vec[i]){
break;
}
else{
ans++;
X -= vec[i];
}
}
if(ans == N ... | //
// main.cpp
// ITP1_6-A
//
// Created by Saicj on 2015/07/14.
// Copyright (c) 2015??´ saicj. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[])
{
int n;
int index = 0;
cin >> n;
int numList[n];
while (true)... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
int solve(int k, vi& xs){
sort(xs.begin(), xs.end()); //ordena o vector
//xs.back() --> Returns a reference to the last element in the vector
xs.back() *= (1<<k); // shiftar 1 vez pra esquerda eh multiplicar por 2
return accumulate(... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <set>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<vector<char>> matrix;
typedef long long ll;
int N;
matrix ans;
matrix make_m(int n) {
matrix m(n, vector<char>(n, '.'));
if (n == 3) {
m[0][0] = m[0][1] = 'a';
m[1][2] = m[2][2] ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
char piece[10][10][10];
bool DONE = false;
typedef pair<int, int> pii;
vector<pair<pii, pii>> placement[10];
int done[10][10... | 1 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define sz(x) int((x).size())
#define all(x) (x).begin(), (... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 2e5+5;
vector<ll>ans,veca,vecb;
vector<int>adj[N];
vector<double>aka;
vector<pair<int,double>>dp[N];
vector<bool>vis;
void init(int n){
ans.clear();veca.clear();aka.clear();vis.clear();ans.resize(n);
vecb.cle... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
vector<long> l(n);
for (long &x : l) {
cin >> x;
}
long ans = 0;
for (int i = 0; i < n - 2; ... | 1 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for... | 1 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;++i)
#define repi(i,n) for(ll i=n-1;i>=0;--i)
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
f... | 0 |
// include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を... | /*
"Won't stop until I'm phenomenal."
- Phenomenal, Eminem
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int... | 0 |
#include <iostream>
using namespace std;
int a[100005];
int main() {
int n,q = -1,count = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int j = 0; j < n-1; j++) {
if (a[j] <= a[n-1]) {
q++;
int v = a[j];
a[j] = a[q];
... |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
int a[5000];
while(cin >> n && n>0){
for(int i=0;i<n;i++)
cin >> a[i];
long long sum=0,tmp=0,ma=-100000;
int m=-100000;
bool flg=true;
for(int i=0;i<n;i++){
if(flg) m=max(m,a[i]);
if(a[i]>=0){
... | 0 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, Q;
string S;
cin >> N >> S >> Q;
vector<int> k(Q);
for (int i = 0; i < Q; i++) {
cin >> k[i];
}
for (int j = 0; j < Q; j++) {
long long d = 0, m = 0, dm = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (i >= k[j])... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i =... | #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... | 1 |
#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 <cstdio>
using ll = long long;
inline ll gcd(ll x, ll y)
{
while (y)
{
auto r = x % y;
x = y;
y = r;
}
return x;
}
inline bool chk(int n)
{
for (int i = 2; i * i <= n; i++)
{
if (!(n % i))
return false;
}
return true;
}
inline ll lcm(ll x, ll y) { return x && y ? x / gcd(x, y) * y : x + y; }... | 0 |
#include <iostream>
using namespace std;
int D[100][6];
//回転を定義
void spin(int n,char c)
{
if(c=='E'){
swap(D[n][0],D[n][3]);swap(D[n][3],D[n][5]);swap(D[n][5],D[n][2]);
}
else if(c=='W'){
swap(D[n][0],D[n][2]);swap(D[n][2],D[n][5]);swap(D[n][5],D[n][3]);
}
else if(c=='S'){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,count=0;
cin>>N;
vector<long long> A(N);
unordered_map<long long,long long> mp;
for(int i=0;i<N;i++){
cin>>A.at(i);
mp[A.at(i)]++;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
for(int i=0;i<N;i++){
if(mp[A.at(... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int ans = 0;
for (int i = A; i <= B; i++)
{
int c = i % 10, d = i / 10000 % 10;
int e = i / 10 % 10, f = i / 1000 % 10;
if (c == d && e == f)ans++;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> P;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#def... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector <int> vi;
typedef vector <string> vs;
#define N1 5
#define N2 13
int main(void){
vi card(N2);
string prize[7]={"null","one pair","two pair","three card","straight","full house","four card"};
while (true){
for (int i=0; i<N2... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
int a[5][MAXN],n,tg[5],to[MAXN];
int Abs(int x)
{
return x>=0?x:-x;
}
int main()
{
scanf("%d",&n);
for(int i=0;i<3;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=n;i++)
{
to[i]=a[1][i]/3+1;
if(!((a[0][i]-a[1][... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 |
#include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
bool ans=true;
if(s.length()%2==1)
{
cout<<"No";
return 0;
}
for(int i=0;i<s.length();i++)
{
if(i%2==0)
{
if(s[i]!='h')
{
ans=... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, double> P;
int main() {
int n;
cin >> n;
vector<queue<int>> q(n+1);
for (int i=0;i<n; i++){
for (int j=0;j<n-1;j++){
int x;
cin>>x;
q[i].push(x-1);
}
q[i].push(n);
}
q[n].push(n);
int ans=0;
int cnt=n*(n-1);
int f=1;
vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll n, m;
cin >> n >> m;
vector<vector<ll>> G(n);
while(m--) {
ll a, b;
cin >> a >> b;
a--, b--;
G[a].push_back... | #include<bits/stdc++.h>
using namespace std;
int ac[100005];
char ch[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,q;
string s;
cin>>n>>q>>s;
for(int i=0; s[i]; i++) ch[i+1] = s[i];
for(int i=1; i<=n; i++){
if(ch[i]=='A' && ch[i+1]=='C') ac[i]++;
}
for(int i=1; i<=n; i++) ac[i]+... | 0 |
#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;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2e5 + 5;
int n, a[N], b[N];
int s[3 * N], p[3 * N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < n; ++i) scanf("%d", &b[i]);
for (int i = 0; i < n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
rep(bit,1<<3){
int cnt=s[0]-'0';
string t;
t+=s[0];
rep(i,3){
if(bit&(1<<i)){
cnt+=s[i+1]-'0';
t+='+... | #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;
vector<pair<int64_t,int64... | 1 |
//what is going on
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vl w;
int gcd(int a, int b) {
if(a == 0) {return b;}
if(b == 0) {return a;}
return gcd(b,a%b);
}
int main() {
int n;
cin >> n;
for(int i=0;i<n;i++) {
ll t;
cin >> t;
w.push_back(t);
}
int lob = 0;... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
stat... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define length size()
#define endl "\n"
signed main(void){
float a,b,c;
cin >> a >> b >> c;
cout << (int)(c*(ceil(a/b)))+0 << endl;
}
| #include <stdio.h>
#include <stdlib.h>
#define MAX_INPUT_SIZE 1024
int
main(int argc, char* argv[])
{
char input[MAX_INPUT_SIZE];
int n = atoi(fgets(input, sizeof(input), stdin));
int ret = n * n * n;
printf("%d\n", ret);
return 0;
} | 0 |
#include <iostream>
template<typename X>
X input() {
X value;
std::cin >> value;
return value;
}
int main() {
int x = input<int>();
int x3 = x * x * x;
std::cout << x3 << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n) && n != 0){
int arr[n];
for(int i = 0; i < n; i++){
scanf("%d",&arr[i]);
}
int max_e = arr[0], max_s = arr[0];
for(int cur = 1; cur < n; cur++){
ma... | #include<iostream>
#include<cstring>
using namespace std;
int n, a[10], x;
int main() {
while (true) {
cin >> n;
if (n == 0) { break; }
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++) {
cin >> x;
a[x]++;
}
for (int i = 0; i < 10; i++) {
if (a[i] == 0) { cout << '-' << endl; }
else {
fo... | 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>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | 1 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define L(i,u) for (int i=head[u]; i!=0; i=nxt[i])
#define rep(i,a,b) for (register int i=a; i<=b; i++)
#define per(i,a,b) for (regi... | #include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define x first
#define y second
using namespace std;
string s;
int dp[301][301][301];
inline int solve(int l, int r, int k) {
if (k < 0)
return INT_MIN;
if (r - l < 1)
return r - l + 1;
if (dp[l][r][k] != -1)
... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
typedef pair<ll,ll> pll;
vector< pll > v;
ll n;
ll h[5005], p[5005];
ll dp[5005][5005];
const ll inf = 1e16;
int main()
{
cin >> n;
v.pb(make_pair(-2LL , -2LL));
for(ll i=1;i<=n;i++) {
cin ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 |
#include "bits/stdc++.h"
using namespace std;
// Bit Matrix
const int MAX_ROW = 110; // to be set appropriately
const int MAX_COL = 110000; // to be set appropriately
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++)
cin >> v.at(i);
long long mod = 1000000007;
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += v.at(i);
sum %= mod;
}
long long ans;
ans... | 0 |
#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... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 100005
const int mod=1e9+7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
int n,m;
char s[m... | 0 |
#include<cstdio>
#include<iostream>
using namespace std;
#define ll long long
int main() {
int n;
ll a, min, max, sum;
min = 100000000;
max = -min;
sum = 0;
cin >> n;
for (int i = 0; i < n; i ++) {
cin >> a;
if (a < min) min = a;
if (a > max) max = a;
sum += a;
}
cout << min << " " <... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
vector<int> result;
string n;
string input;
getline(cin, n);
getline(cin, input);
istringstream iss(input);
string num;
while (getline(iss, num, ' ')) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/********************************************************************/
#define M1 1000000007
#define M2 998244353
const double pi = 3.14159265;
#define ll long long
#... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include<iostream> //53~70
using namespace std;
int main(){
int a[1000];
int b[1000];
int t[1000];
int n=0;
int m=0;
int i=0;
int j=0;
int k=0;
cin>>n;
cin>>m;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<m;i++){
cin>>b[i];
}
for(i=0;i<1000;i++){
t[i]=0;
}
for(i=0;i<m;i++){
for(j=0;j<n;j++){
... | 0 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7; // change if needed
struct Modint {
ll val;
Modint (ll _val = 0)
: val(_val % MOD) {}
Modint operator+ (Modint other) const {
return Modint(val + other.val);
}
void oper... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(v) v.begin(),v.end()
const int maxn = 3e5 + 100;
const ll inf = 2e18... | 0 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,q;
int cnt=0;
cin>>n;
vector<int>s(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
cin>>q;
vector<int>t(q);
for(int i=0;i<q;i++){
cin>>t[i];
}
for(int i=0;i<q;i++){
for(int j=0;j<n;j++)... | #include <iostream>
#include <algorithm>
using namespace std;
bool Bsearch(int key, int A[], int len) {
int l = 0, r = len - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (A[mid] > key)
r = mid - 1;
else if (A[mid] < key)
l = mid + 1;
else
return true;
}
return false;
}
int main() {
int n, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define Rep(i,n) for(ll 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
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> in... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
const int mod = 1e9+7;
int fac[N],combi[N][N];
int add(int x,int y) {
int ret = ((x+y)%mod + mod)%mod;
return ret;
}
int mul(int x,int y) {
ll ret = (ll)x*y;
ret%=mod;
return ret;
}
int num[2];
int group[2];
int dp... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
const int N = 1e3 + 5;
const int mod = 1e9 + 7;
using namespace std;
int n, a, b, c, d, fac[N], inv[N], g[N][N], f[N][N], ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).b... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double ans=0,n,m,d;
cin >> n >> m >> d;
if(d==0) {
ans=(m-1)/n;
} else {
ans=(n-d)*2*(m-1)/n/n;
}
cout << fixed << setprecision(10);
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc045_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | 0 |
#include <iostream>
#include <vector>
using namespace std;
vector<char>stack;
// stack.back() will bring you to the last index
void checkForT(string s , char character, int index){
if(!stack.empty() && stack.back()!= 'S'){
stack.push_back(character);
}
else if(!stack.empty()){
stack.pop_back();
}
else if(sta... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
string x;
cin >> x;
int stack = 0, puyo = 0;
rep(i, x.length())
{
if (x[i] == 'S')
stack++;
else if (stack)
... | 1 |
#include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 20000000000000000
#define mod 998244353
#define ull unsigned long long int... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 |
#include<stdio.h>
#include<string.h>
char s[524288];
int dp[4],dp2[4];
int main()
{
scanf("%s",s);
int n=strlen(s);
s[n]='1';
n++;
dp[2]=1;
int ans=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<4;j++)
{
dp2[j]=dp[j];
dp[j]=0;
}
for(int j=0;j<4;j++)
{
dp[j&1]+=dp2[j];
if(dp[j&1]>=1000000007)
{... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
const int N=300005,P=1e9+7;
int n,f[N][3][3];
char s[N];
void addx(int&k1,int k2){
(k1+=k2)>=P&&(k1-=P);
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
if(n==1){
puts(s[1]=='0'?"0":"1");
return 0;
}
f[0][0][0]=1;
rep(i,1... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
string s;
int w;
int main(void){
cin>>s>>w;
for(int i=0;i<s.size();i=i+w){
cout<<s[i];
}
cout<<endl;
}
| #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 K, X;
cin >> K >> X;
K--;
for(ll i = X - K; i <= X + K; i++) {
cout << i;
if(i == X + K) {
cout << endl;
} else {
c... | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[128] = { 0 };
short grid[64][64] = { {0} };
int H,W;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d", &H, &W);
for(int i = 0; i < H; i++){
memset(buf, 0, sizeof(buf));
fgets(buf, sizeof(... | #include <iostream>
#include <queue>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;
/*
* union-find???????£??????\???????????????
*/
#define MAX_V 10001
typedef struct UF{
int parent;
}UF;
UF uf[MAX_V + 1];
/*
* ?????????idx???parent??¨???????????????????¨??????????
*/
void i... | 0 |
#include <stdio.h>
int main(void)
{
int n,a[4],t[100],p[100],i,j,k;
scanf("%d",&n);
for(i=0;i!=n;++i)
t[i]=0;
for(i=0;i!=n*(n-1)/2;i++){
for(j=0;j!=4;j++)
scanf("%d",&a[j]);
if(a[2]<a[3])
t[a[1]-1]+=3;
else if(a[2]>a[3])
t[a[0]-1]+=3;
else{
t[a[0]-1]+=1;
t[a[1]-1]+=1;
}
}
for(i=0;i!=n;+... | #include <iostream>
#include <math.h>
using namespace std;
int e,minimum;
int solve(){
minimum = e;
for(int z=0;z*z*z<=e;z++){
for(int y=0;y <= sqrt(e);y++){
int x = e - z*z*z - y*y;
if(x>=0)
minimum = min(x+y+z,minimum);
}
}
return minimum;
}
i... | 0 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
char output;
if ((pm == 100 || pe == ... | #include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n,m,x,y; cin >> n >> m >> x >> y;
int ... | #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 n; cin >>n;
string s,t;
cin >>s >>t;
for(int i = n; 0<=i; i--){
if(s.substr(n-i)==t.substr(0,i)) {
cout << 2*n-i << endl;
return 0;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long D[201][100001], MOD=1000000007;
int main()
{
int n, x, a;
cin >> n >> x;
vector <int> A;
for (int i = 0; i < n; i++)
{
cin >> a;
A.push_back(a);
}
sort(A.begin(),A.end());
for (int i = 0; i <= x; i++)
{
... | //Solution by Tima
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define vi vector <int>
#define ld long double
#define pii pair<int, int>
#define y1 sda
#define all(x) x.begin(), x.end()
using namespace std; ... | 1 |
#include <cstdio>
#define F(i, a, b) for (LL i = a; i <= b; i ++)
#define G(i, a, b) for (LL i = a; i >= b; i --)
#define pf printf
typedef long long LL;
const LL N = 1e7 + 10;
const LL M = 20;
using namespace std;
LL D, L, Ans, Sum, total, w[M];
LL ten[M], v[M], tot[M], TOT[M];
void Dfs(LL k, LL s, LL S) {
if (... | #include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 21001
#define int long long
using namespace std;
int read_p,read_ca;
inline int read(){
read_p=0;read_ca=getchar();
while(read_ca<'0'||read_ca>'9') read_ca=getchar();
while(read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ... | 1 |
#include <iostream>
using namespace std;
int main(void)
{
int a,b,c[101]={0},d,e=0,f=0,g,h,i;
for (a=0;a<4;a++)
{
cin>>b;
c[b]=1;
}
for (a=100;a>0;a--)
{
if (c[a]==1&&e!=3)
{
f=f+a;
e++;
}
}
cin>>d>>e;
if (d>=e)
{
g=d+f;
}
else if (d<=e)
{
g=e+f;
}
cout<<g<<endl;
return 0;
} | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 1 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n... | #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 ... | 0 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typede... | 1 |
#include <stdio.h>
int main(){
char X[3];
scanf("%s",&X);
if(X[0]=='7'){
printf("Yes\n");
}
else if(X[1]=='7'){
printf("Yes\n");
}
else if(X[2]=='7'){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
}
| #include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;... | 0 |
#include<iostream>
#include <bits/stdc++.h>
#include<algorithm>
#include <cstring>
#define endl "\n"
#define SRK ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define EPS 1e-6
#define MAX 100000
typedef long long ll;
const ll MOD = 1e9 + 7;
using namespace std;
int N = 1000000;
int NOD[1000000];
void genera... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
int32_t main()... | 1 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
/*
//functions from gfg
long long int power(long long int x,long long int y,long long int p)
{
long long int res = 1; // Initialize ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef ve... | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii... | 0 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#de... | #include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
while(1) {
int n;
cin >> n;
int m;
cin >> m;
if(n==0 && m ==0) break;
vector <int> re[502];
queue <int > Q;
int a, b;
for(int i=0;i<m;i++) {
cin >> a >> b;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
int n,i,k,a,G,MAX;scanf("%d%d",&n,&k);
scanf("%d",&G);MAX = G;
if(n == 1){
printf((k==G) ? "POSSIBLE\n":"IMPOSSIBLE\n");
return 0;
}
for(i=1;i<n;i++){
scanf("%d",&a);
... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, K; cin >> N >> K;
int A[N]; rep... | 1 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int mod = 1e9 + 7;
int n , x , y , z;
int dp[50][1 << 18];
int main() {
scanf("%d %d %d %d" , &n , &x , &y , &z);
int st = (1 << (x + y + z - 1)) | (1 << (y + z - 1)) | (1 << (z - 1));
dp[0][0] = 1;
int ans = 1;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.