code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
string s; cin >> s;
rep(i,3){
if(s[i] == '7'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin>>N>>M>>X>>Y;
int k=X,l=Y;
for(int i=0;i<N;i++){
int j=0;
cin>>j;
k=max(k,j);
}
for(int i=0;i<M;i++){
int j=0;
cin>>j;
l=min(l,j);
}
if(k<l)
cout<<"No War"<<endl;
else
cout<<"War"<<endl;
} | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_ba... | 0 |
#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; }... | #include <bits/stdc++.h>
using namespace std;
using pdd = pair<double, double>;
int main() {
int N; cin >> N;
vector<pdd> points(N);
for (int i = 0; i < N; i++) {
double x, y; cin >> x >> y;
points[i] = make_pair(x, y);
}
vector<vector<double>> dist(N, vector<double>(N));
for (i... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long> v;
for (int i = 0; i < n; ++i) {
long x;
cin >> x;
v.push_back(x);
}
cout << *min_element(v.begin(), v.end()) << " ";
cout << *max_element(v.beg... | #include <iostream>
using namespace std;
int main(void){
long long n,a,min=1000000,max=-1000000,s=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a>max)max=a;
if(a<min)min=a;
s=s+a;
}
cout<<min<<" "<<max<<" "<<s<<endl;
}
| 1 |
/*
飲んだ魔剤で家が建つ。
created at: 2020-04-19 14:53:28
2020-04-19 16:16:46 余計な部分を削った版
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define INF 1000000000
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define INF 10000000
#define rep(i,a,b) for(ll (i)=a;(i)<(ll)(b);(i)++)
using ipair = pair<ll,ll>;
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A&lang=jp
vector<vector<ll>> capacity;
vector<vector<ll>> flow;
vector<ll> pred;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int I... | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, m, result = 0;
cin >> n >> m;
long long x[n], y[m];
for (long long i = 0; i < n; i++) {
cin >> x[i];
}
for (long long i = 0; i < m; i++) {
cin >> y[i];
}
long long left ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define x first
#define y second
#define mp make_pair
#define pb push_back
template <typename TYPE> inline void chkmax(TYPE &x,TYPE y){x<y?x=y:0;}
template <typename TYPE> inline void chkmin(TY... | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
vector< pair< double, string > > ans;
for(int i = 0; i < n; i++) {
string str;
int p, a, b, c, d, e, f, s, m;
... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(int i=0,_i=(n);i<_i;++i)
#define _rep3(i,a,b) for(int i... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
// 二分探索
// 求める点以上の場合にtrueを返すよう実装する。
template <class V>
V binary_se... | 1 |
#include<bits/stdc++.h>
using namespace std;
int N,P;
int D[55];
bool check(int ind){
for(int i=0;i<N;i++){
if( i == ind ) continue;
if( D[i] ) return false;
}
return true;
}
int main(){
while( cin >> N >> P && (N||P) ) {
memset(D,0,sizeof(D));
int ind = 0;
while( 1 ){
if( P ){
P-... | #include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int W, H;
int curl[22][22];
int ans;
P s;
bool inCurl(int x, int y)
{
return (x >= 0 && y >= 0 && x < W && y < H);
}
void dfs(int x, int y, int n)
{
if (n >= ans)
... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str, instruction, temp;
int a,b,q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++){
cin >> instruction >> a >> b;
if (instruction == "replace"){
cin >> temp;
str.replace (a, (b-a)+1, temp);
}
else if (instruction =... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back
using namespace std;
int main() {
int n, tmp;
string s, res, station... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t M,a=0,b=0;
cin>>M;
for(int64_t i=0;i<M;i++){
int64_t x,y;
cin>>x>>y;
a+=x*y;
b+=y;
}
cout<<(a-1)/9+b-1<<endl;
} | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int a=h2-h1;
int b=m2-m1;
int c=(a*60+b)-k;
cout<<c<<endl;
exit(0);
}
| #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sy... | 0 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=2e5+100;
const int M=4e5+100;
int head1[N],ver1[M],Next1[M];
int tot1,tot2;
int add1(int x,int y)
{
ver1[++tot1]=y;
Next1[tot1]=head1[x];
head1[x]=tot1;
}
int head2[N],ver2[M],Next2[M];
int add2(int x,int y)
{
ver2[++tot2]=y;
Next2[tot2... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)... | 0 |
#include <cstdio>
#include <vector>
using namespace std;
vector<int> a[1000];
bool v[1000];
int s, prevv[1000], n, m, x, y;
void dfs(int cur){
v[cur] = true;
for (auto e : a[cur]){
if (e == s){
prevv[e] = cur;
}
if (!v[e]){
prevv[e] = cur;
dfs(e);
}
}
}
vector<int> optimize(vector<int> p){
bool b[n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<int> arr(n+1);
for(int i = 1; i <= n; i++) cin>>arr[i];
vector<ll> pf(n+1);
vector<ll> dp(n+1,LLONG_MIN);
for(int i = 1; i <= n; i++) if(i&1) pf[i]+=arr[i]+pf[i-2 < 0 ? 0 : i-2]; // pref... | #include <bits/stdc++.h>
//#include "atcoder/all"
typedef long long int ll;
using namespace std;
// using namespace atcoder;
#define MAXN 200001
#define INF -200000000000000
ll a[MAXN];
ll dp[MAXN][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < MAXN; i++) {
for (int j = 0; j < 3; j++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int>vec(5);
cin >> vec[0] >> vec[1] >> vec[2] >> vec[3] >> vec[4];
int k;
cin >> k;
bool x = true;
for(int i=0; i<4; i++){
for(int j=i+1; j<5; j++){
if(vec[j]-vec[i] > k){
cout << ":(" << endl;
return 0;
}
... | #include <bits/stdc++.h>
#define fast_io ios :: sync_with_stdio(false);
using namespace std;
int main() {
cout << fixed << setprecision(3);
fast_io;
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a<=k)cout<<"Yay!";
else cout<<":(";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
#define chmin(x,y) x = min(x,y)
int main(){
int n,k;
cin >> n >> k;
ve<int> x(n),y(n);
rep(i,n) cin >> x[i];
rep(i,n) y[i] = -x[n-1-i];
... | #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];
bool zero_exist = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll an... | /*input
10 100000
50000 50001 50002 50003 50004 50005 50006 50007 50008 50009
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS io... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=100000+10;
int n;
int a[maxn];
int partition(int a[],int p,int r)
{
int x=a[r];
int i=p-1;
for(int j=p;j<r;j++)
{
if(a[j]<=x)
{
i++;
swap(a[i],a[j]);
}
}
swap(a[i+1],... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 100010
using namespace std;
typedef long long ll;
ll read()
{
ll x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getch... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <deque>
#include <queue>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define FOR(i, a, b) for(int i=a, loop=b; i<=loop; ++i)
#define REV... | #include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 100050
#define M 605
int n,d1,d2,head[N],cnt,col[M][M],col2[M][M],vis[M][M],ct,s1[N][2];
queue<int> tp;
void bfs(int x,int y)
{
vis[x][y]=1;
tp.push(x*1000+y);
while(!tp.empty())
{
int s=tp.front()/1000,t=tp.front()%1000;tp.pop();
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
char bd[12][12];
void del(int y, int x) {
if (0 <= y && y < 12 && 0 <= x && x < 12 && bd[y][x] == '1') {
bd[y][x] = '0';
del(y-1, x);
del(y+1, x);
del(y, x-1);
del(y, x+1);
}
}
int main() {
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int N,K;
cin >> N >> K;
int l[N];
for(int i = 0; i < N ;i++){
cin >> l[i];
}
sort(l ,l+N ,greater<int>());
int answer = 0;
for(int i = 0; i < K ; i++){
answer += l[i];
}
cout << answer ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define mult... | 0 |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
// ---------------------------... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define ar array
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL);
int32_t main() {
fast_io;
// int t; cin >> t;
// while (t--) {
// }
string K; cin >> K;
int D; cin >> D;
int len = (int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define flash ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
ll dp[2][2][100];
ll mod=1e9+7;ll d;
ll mo(ll x)
{
if(x>=0)
return(x%d... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#define RG register
using namespace std;
const int N=1e6+10;
int n,ans;
char st[N],ed[N];
queue<int> pn;
inline int mi(int a,int b){return a<b ? a : b;}
inline int mx(int a,int b){return a>b ? a : b;}
int main()
{
// freopen("Shik and Copying String.... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 1000000000000000LL
#define N 5010
int n;
PII a[N];
ll f[N], g[N]; // min height
bool cmp(PII x, PII y) {
return x.fi + x.se < y.f... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int lld;
const lld MAX=300020;
const lld MOD=1000000007;
char s[MAX];
lld n,dp[MAX][4][10],alt[MAX],fin;
int main(){
scanf(" %s",s);
n=strlen(s);
dp[0][3][3]=1;
alt[n]=1;
for(lld x=n-1;x>=0;x--) {
alt[x... | #include <bits/stdc++.h>
using namespace std;
long long MOD = pow(10, 9) + 7;
// O(sqrt(N))の素因数分解
int main(){
int Q;
cin >> Q;
vector<int> bucket(Q+1, 1);
if (Q == 1)
{
cout << 1 << endl;
return 0;
}
for (int i = 2; i <= Q; i++)
{
int target = i;
for (i... | 0 |
//#define USE_CPP11
// #define USE_PRINTF
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#includ... | #include <iostream>
using namespace std;
int main() {
int m,min,max,ten[200],gap=10001,sa;
cin>>m>>min>>max;
while(1){
if(m==0 && min==0 && max==0){
break;
}
for(int i=1;i<=m;i++){
cin>>ten[i];
}
for(int i=min;i<=max;i++){
if(gap>=ten[i+1]-ten[i]){
gap=ten[i+1]-ten[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5, MOD = 998244353;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int mx = 0;
for (int i = 0; i < n; i++) {
int... | #include <iostream>
#include <map>
using namespace std;
int main() {
map<int, bool> check;
int n; cin >> n;
while (n--) {
int a; cin >> a;
if (check[a]) {
cout << "NO" << endl;
return 0;
}
check[a] = true;
}
cout << "YES" << endl;
}
| 0 |
// IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr... | #ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif
#include <bits/stdc++.h>
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), e... | 1 |
#include <cstdio>
#include <queue>
using namespace std;
int main(void)
{
priority_queue <int> w, k;
int tmp;
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
w.push(tmp);
}
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
k.push(tmp);
}
int sumw = 0, sumk = 0;
for (int i = 0; i < 3; i++){
sumw +=... | #include <iostream>
int main(){
int w[10], k[10];
for (int i = 0; i < 10; i++) {
std::cin >> w[i];
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 9; j++) {
if (w[j] < w[j + 1]) {
int c = w[j];
w[j] = w[j + 1];
w[j + 1] = c;
}
}
}
for (int i = 0; i < 10; i++) {
std::cin >> k[i];
}
... | 1 |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define ld long double
#define ff first
#define ss second
const ll mod = 1e9 +7 ;
ll multiply(ll a, ll b ){ return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a%mod) ... | /*program by mangoyang*/
#pragma GCC optimize("Ofast", "inline")
#include<bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
int ch = 0, f = 0; x = 0;
fo... | 1 |
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
#define N 6005
#define INF 0x3f3f3f3f
#define LL long long
int n,MOD,f[4][N*2];
int rd()
{
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1; c=ge... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAX_FACT = 1e5 * 2 + 1;
ll fact[MAX_FACT], invFact[MAX_FACT], inv[MAX_FACT];
void init() {
fact[0] = fact[1] = 1;
invFact[0] = invFact[1] = 1;
inv[1] = 1;
f... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
void solve()
{
ll n;
cin>>n;
vector<ll> x(n);
for(ll i=0;i<n;i++)
cin>>x[i];
sort(x.begin(),x.end());
ll a=0,b=0,c=0;
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI aco... | #include <bits/stdc++.h>
const int N=100005,M=20;
using namespace std;
int n,L,q,ar[N],nx[M][N];
int calc(int i){
int l=i,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
if(ar[m]-ar[i]<=L){
ans=m;
l=m+1;
}else{
r=m-1;
}
}
return ans;
}
int kth(... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s,t;
cin>>s>>t;
cout<<t<<s;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){//繰り返し2乗法
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int nin;
while(1){
scanf("%d",&nin);
if(!nin)break;
long long int human[4002]={0};
long long int no[4002],tanka,kazu,outflag=0;
for(int i=0;i<nin;i++){
scanf("%d %d %d",&no[i],&tanka,&kazu);
human[no[i]]+=tanka*kazu;
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m,ans=0;
cin >> n >> m;
while(n!=0||m!=0){
ans = 0;
n++;
vector<int>a(m,0),b(m,0),hito(n,0),one(n,0);
rep(i,m){
cin>>a[i]>>b[i];
if(a[i]==1){
hito[b[i]]++;
one[b[i]]++;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string A;
cin >> A;
char B, C;
if(A.size() == 2) {
cout << A << endl;
}
else {
B = A.at(0);
C = A.at(2)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
ll sum(int n);
void go(){
string s;cin>>s;
if(sz(s)==3) reverse(all(s));
cout << s;
}
int main(){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(ll i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()... | // King's Inspection
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
int n;
int now=0;
int k[102];
int ansNum;
char station[102];
char ans[102];
string alpha = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
//vector... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define INF 100000000000000000LL
using namespace std;
signed main() {
int n, m, cun, ans = 0;
string s[10000], t[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> t[i];
}
for (int... | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int N,M;
cin >> N;
map<string,int> blue;
string s;
for(int i=0;i<N;++... | 1 |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#includ... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 998244353
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[310][310][310];
string s;
int calc( int lef, int rig, int k){
if( dp[lef][rig][k] != 0){
return dp[lef][rig][k];
}
if( ... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x... | #include<cstdio>
#include<algorithm>
using int64=long long;
using uchar=unsigned char;
constexpr int maxn(200000);
constexpr int64 inf(1e17);
template<class _Tp>
inline bool bchkMin(_Tp&x,const _Tp&y)
{return(x>y)&&(x=y,1);}
namespace IOManager{
constexpr int FILESZ(131072);
char buf[FILESZ];
const char*ibuf=... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
//const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define A... | #include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>
using namespace std;
#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
std::vector<long long> trips;
int ans=0;
cin>>n;
trips.resize(n);
for(auto &x:trips)
cin>>x;
n = trips.size();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int... | 1 |
#include <iostream>
#include <map>
#include <set>
#define HW 160
using namespace std;
/*struct rect
{
int h;
int w;
int tai;
};*/
int main(int argc, char const *argv[])
{
int h,w;
map<int,set<pair<int,int> > > mp;
for(int i1=1;i1<HW;i1++){
for(int i2=i1+1;i2<HW;i2++){
mp[i1*i1+i2*i2].insert(make_pair(i1... | #include <cstdio>
using namespace std;
#define min(a,b) (((a) > (b))?(b):(a))
#define INF 1000001
int dp[100][100];
int V;
int warshall_floyd(int k) {
int i;
for (i=0;i<V;i++) {
int j;
for (j=0;j<V;j++) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
int main() {
while (1) {
... | 0 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int,int>
#define ll long lo... | #include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n, k;
cin >> n >> k;
s... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,... | #include <stdio.h>
const int MAX_V = 1000000; // 100????????§??´???°??¨?????????
int prime[MAX_V+1];
int main() {
int k,i,max,min,n; // 1????´???°???0????´???°??§???????
for(i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2??\?????´???°??¨??????
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]) {
for(k = 2 * i; k <=... | 0 |
#include <iostream>
#define INF (int)1e09
int main(void) {
int m;
int n_min;
int n_max;
int gap;
int pass_num;
int pass;
int fail;
while (1) {
std::cin >> m >> n_min >> n_max;
pass = INF;
fail = INF;
gap = 0;
if (m == 0) {
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i... | 1 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_A... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c>min(a,b)&&c<max(a,b))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 0 |
// This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <stdio.h>
#include <string.h>
int main()
{
int n;
int runner;
int score;
int out;
char nyuuryoku[114514];
scanf("%d",&n);
for(int i=0;i<n;i++){
runner=0;
score=0;
out=0;
while(out<... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
string event;
int base=0;
int inning=0;
cin>>n;
vector<int> point(n);
int outnum=0;
while(inning<n){
cin>>event;
if(event=="HIT"){
base<<=1;
base|=1;
if(base&8){
point[inn... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int e;
while(cin >> e,e){
int minn = e;
int res;
for(int y=0;y<=e/2;y++){
if(y*y > e) break;
for(int z=0;z<=e/3;z++){
if(z*z*z+y*y > e) break;
int x = e - y*y - z*z*z;
res = x + y + z;
if(res < minn){
minn = res;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <utility>
#define INF 1000000000
using namespace std;
typedef long long int lli;
typedef pair<int, int> P;
struct edge{
int to, cost;
};
int V, E;
vector<edge> e[10000];
int mincost[10000];
bool used[10000];
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool rangeCheck(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return false;
} else {
return true;
}
}
void outputDone(ll h, ll w, vector<vector<ll>> a) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll n;
cin >> n;
string ans = "";
while(n != 0){
char b = 'a' + n%26 - 1;
if(b == '`') b = 'z';
ans += b;
n = (n-1)/26;
}
reverse(ans.begin(), ans.end())... | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const str... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<ty... | #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;
cout << (N + 110) / 111 * 111 << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long int LLI;
void formula(int arr[], int step, string st_ans, int ans, vector <string> & all)
{
string tmp1 = st_ans, tmp2 = st_ans;
if( step < 4 )
{
tmp1 += "+";
tmp1 += (char)(arr[step]+'0');
formula(arr, step+1, tmp1, ans+arr[step], a... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) ... | 0 |
#include<string>
#include<iostream>
using namespace std;
int main()
{
int n; cin>>n;
string s;
int runner=0,out=0,score=0;
while(cin>>s){
if(s=="HIT"){
runner<<=1;
if(runner&8)runner&=~8,score++;
runner|=1;
}
else if(s=="HOMERUN"){
for(int i=0;i<3;i++){
runner<<=1;
if(runner&8)runner&=~8... | #include <iostream>
#include <string>
using namespace std;
int main() {
int point = 0, hits = 0, out = 0;
int n; cin >> n;
int i = 0;
while (i < n) {
string s; cin >> s;
if (s == "HIT") {
hits++;
if (hits == 4) {
point++;
hits--;
}
}
if (s == "OUT") {
out++;
if (out == 3) {
hi... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1000000000 + 7;
ll dp[200][10];
void init() {
rep(i, 0, 200) rep(j, 0, 10) dp[i][j] = 0;
}
int main(){
init();
// input
ll h, w, k;
... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //10^19 < 9223372036854775807
typedef unsigned long long ull; //10^20 < 18446744073709551615
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i... | # include <iostream>
# include <deque>
using namespace std;
string X;
deque<char> dchar;
int main()
{
cin>>X;
for (int i=0; i<X.size(); i++)
{
dchar.push_back(X[i]);
if (dchar.size()>=2 && dchar[dchar.size()-2]=='S' && dchar[dchar.size()-1]=='T')
{
dchar.pop_back();
... | 0 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int dp[1100][1100]={};
int main()
{
string a=" ",b=" ",x;
cin>>x;a+=x;
cin>>x;b+=x;
for(int i=0;i<1100;i++)dp[i][0]=dp[0][i]=i;
for(int i=1;i<a.size();i++)
{
for(int l=1;l<b.size();l++)
{
int cost (a[i]==b[l]... | /*
Contest 092
A - Traveling Budget
Rakesh Kumar --> 21/09/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a = 0, b = 0, c = 0, d = 0;
std::cin >> a >> b >> c >> d;
std::cout << std::min(a, b) + std::min(c, d) << s... | 0 |
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int n, *nums,tmp,counter = 0;
cin >> n;
nums = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++)
{
cin >> nums[i];
}
for (int i = 0; i < n - 1; i++)
{
for (int j = n - 1; j >= 1 ; j--)
{
if (nums[j] < nums[j-1])... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,num[3];
cin>>n;
for(int i=0;i<n;i++) cin>>num[i];
if(n==2) num[2]=num[1];
ll d=__gcd(num[0],num[1]);
d=__gcd(d,num[2]);
for(int i=1;i<=d;i++)if(d%i==0) cout <<i<<endl;
return 0;
} | 0 |
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
vector<int> G[20000];
vector<int> rG[20000];
int id[20000];
int rid[20000];
int cid[20000];
void enume(int s, int &n) {
if(id[s]) return;
id[s] = -1;
for(int t : G[s])
enume(t, n);
id[s] = ++n;
rid[n] = s;
}
void dfs(int ... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 1 |
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const long double eps = 1e-2;
const long double pi = acos(-1.0);
using namespace std;
const int N = 1e5 + 1;
const int L... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<ll>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD ... | 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long ll;
int ... | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = int(1e5) + 2;
const int inf = (int)1e15;
int n, a[N], s... | 1 |
#include <bits/stdc++.h>
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
void timecalculater(){
#ifndef ONLINE_JUDGE
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
cerr<<"Time Taken : "<<diff.co... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
using namespace std;
int w,h;
int sx,sy;
int res;
int table[30... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int A;
A= S.size();
A--;
for(int i=0; i<A ; i++)
{
if(S.at(i)=='A' && (S.at(i+1)=='C'))
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
vector<ll>a(6);
for(int i=0;i<6;i++){
cin>>a.at(i);
}
ll min=a.at(0);
for(int i=1;i<6;i++){
if(a.at(i)<a.at(i-1)&&min>a.at(i)){
min=a.at(i);
}
}
ll ans=(a.at(0)-min)/min+5;
if((a.at(0)-min)%min!=0)ans++;
cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
ll N;
cin >> N;
vector<ll> V(5);
ll min_v = 1e16;
for(int i=0; i<5; i++) {
cin >> V[i];
min_v = min(min_v, V[i]);
}
ll X = N/min_v;
if(N % min_v == 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout <... | 1 |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
ce... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
int k;
string s;
cin >> k >> s;
if(s.length() <= k){
cout << s << endl;
}else if(s.length() > k){
rep(i,k){
cout << s[i] ;
}
cout << ".... | 0 |
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
bool rangeCheck(int row,int col){
if(row >= 0 && row <= 11 && col >=0 && col<= 11)return true;
else{
return false;
}
}
void erase(char buf[12][13],int row,int col){
buf[row][col] = '0';
if(rangeCheck(row,col-1)&&buf[row][col-1] == ... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9+7 ;
const ll INF = 1e18 ;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(2));
for (int i = 0; i < N; ++i) {
cin >> A[i... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define priqu... | 0 |
#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 ... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<ty... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for(int i=0; i<s.size(); i+=n) cout << s[i];
cout << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
void all_enum(string R, string B, string &S, map... | 0 |
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
struct BIT{
int bit[200001];
int size;
BIT(int n){
size = n;
for(int i=0;i<=n;i++) bit[i] = 0;
}
void add(int i,int x){
i++;
while(i<=size){
bit[i] += x;
i += i & -i;
}
}
int sum(int i){
int ret = 0;
i++;
while(i>0){
... | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
long long int c = 0;
void merge(int a[], int left, int mid, int right) {
int n1 = mi... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
// 約数までしか作れない
int n, k;
cin >> n >> k;
s... |
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int n, m, p, sum;
while(std::cin >> n >> m){
std::vector<int> price_list = {};
if(n == 0 && m == 0){
break;
} else{
sum = 0;
for(int i = 0;i < n;++i){
std::cin >... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
void ruiseki(vector<int> &sum){
for(int i=1;i<sum.size();i++){
sum[i] = mod(sum[i] + sum[i-1]);
}
}
int main(){
string S;
cin>>S;
int K;
cin>>K;
K = min(... | #include <cstdio>
using namespace std;
namespace roadagain
{
struct union_find_node
{
unsigned parent;
unsigned lank;
union_find_node() = default;
union_find_node(unsigned num)
{
this->parent = num;
this->lank = 1;
}
};
class union_find_tree
{
public:
union_find_tree(unsi... | 0 |
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<cmath>
#include<bitset>
#include<cassert>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<fstream>... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | 1 |
#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 <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define IG cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define ll long long int
#define... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double lld;
typedef long long int lli;
using namespace std;
const int N = 1000001;
const int MOD = 1e9+7;
const bool DEBUG = 1;
#define sd(x) scanf("%d ", &x... | 0 |
/***
Muhammad Imdad-Ul-Haque Rakib(Attari)
CSE'19
Chittagong,Bangladesh
***/
#include<bits/stdc++.h>
/**Definitions**/
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb pu... | #include "assert.h"
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <set>
using ll = long long;
using namespace std;
// xorの掃き出し法をするためのクラス
// matに基底たちが入る
// Tはbitsetは無理(minしないといけないから)
template <typename T>
class BitLinearSpace {
vector<T> bases; // この中身をsortしちゃうと壊れる
public:
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll an... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (ll)c.size()
#define fr first
#defi... | 1 |
#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 int long long
#define pb push_back
#... | #include<bits/stdc++.h>
using namespace std;
int nearPow2(int n){
if (n <= 0) return 0;
if ((n & (n - 1)) == 0) return (uint)n;
uint ret = 1;
while (n > 0) { ret <<= 1; n >>= 1; }
return ret;
}
int main(){
int n,ans=0;
cin >> n;
map<int,int> mp;
for(int i=0;i<n;i++){
int a;
cin >> a;
mp[a]... | 0 |
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define ceil(a,b) (((a)+(b)-1)/(b))
#define yn(i) print((i)?"Yes":"No")
#defin... | //https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cou... | 1 |
#include <bits/stdc++.h>
using namespace std;
// ascii 97~122
int main(){
string s;
getline(cin,s);
vector<bool> vec(26);
for(int i=0; i<26; i++){
vec.at(i) = false;
}
char c;
int n = s.size();
for(int i=0; i<n; i++){
c = s.at(i);
vec.at((int)(char)c - 'a') = tru... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#i... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int sgn(int x){return (x>0)-(x<0);}
int abs(int x){return x>0?x:-x;}
int a,b;
int main()
{
scanf("%d%d",&a,&b);
if(!a){if(b>=0)cout<<b<<endl;else cout<<1-b<<endl;return 0;}
if(!b){if(a>0)cout<<a+1<<endl;else cout<<-a<<endl;return 0;}... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, cnt = 0, plug = 1;
cin >> a >> b;
while(plug < b) {
plug--;
plug += a;
cnt++;
}
cout << cnt << endl;
return ... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = v.size() - 1; i >= 0; --i) {
if (i < v.size() - 1) cout << " ";
cout << v[i];
}
cout << endl;
return 0... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 1000000007;
constexpr i64 INF = 1LL << 60;... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main(void){
int x[5];
while(scanf("%d,%d,%d,%d,%d"
,&x[0],&x[1],&x[2],&x[3],&x[4])!=EOF){
sort(x,x+5);
int cnt[15];
fill(cnt,cnt+15,0);
for(int i=0;i<5;i++){
cnt[x[i... | #include <cstdio>
#include <functional>
#include <algorithm>
using namespace std;
/** Application main entry point. */
int main (
int argc,
char * argv[ ]
)
{
int d[ 5 ];
int i;
while ( scanf ( " %d,%d,%d,%d,%d"
, d, d + 1, d + 2, d + 3, d + 4 ) == 5 )
{
int c[ 13 ] = { 0 };
... | 1 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define MP std::make_pair
#define rep(i, l, r) for (int i = (l); i <= (r); ++ i)
#define per(i, r, l) for (int i = (r); i >= (l); -- i)
#defi... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
// nCr mod p(n<p)をキビキビ計算する
// 構築:O(n), クエリ:O(1)
struct combination_mod {
using lint = long long int;
int sz;
lint mod;
vector<lint> fac;
vector<lint> finv;
combination_mod(int _sz, lint _mod) : sz(_sz), mod(_mod) {
fa... | 0 |
#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 per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #define C
typedef long long readtype;
/* Header {{{ */
#ifdef C
#include <stdio.h>
#include <math.h>
#include <string.h>
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
template<typename type> type abs(type a) { return a < 0 ? -a : a; }
template<typename type> type min(type a, type b) { return a < b ? a :... | 1 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long LL ;
int n ;
LL ar[200005] ;
pair<LL,LL> BS(const int lower, const int upper){
LL extra ;
if(lower == 0) extra = 0 ;
else extra = ar[lower - 1] ;
int l = lower, u = upper, mid, indx = -1 ;
LL min_diff = LLONG_MAX ;
while(l <= u){
mid = ... | #include <bits/stdc++.h>
using namespace std;
vector<int> calc_cut_left(vector<long long> pref, int n) {
vector<int> ans(n);
int cur = 0;
ans[1] = 0;
for (int i = 2; i + 2 < n; i++) {
long long s1 = abs(pref[cur + 1] - (pref[i] - pref[cur + 1]));
long long s2 = abs(pref[cur] - (pref[i] - pref[cur]));
... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
int n,m;
vector<int> fri[501];
int ff[501];
main(){
while(1){
scanf("%d",&n);
scanf("%d",&m);
if(n==0 && m==0) break;
memset(ff,0,sizeof(ff));
for(int i=0;i<=501;i++)
fri[i].clear(... | #include<bits/stdc++.h>
using namespace std;
long long stu[510],memo[510][510],m,n,sum,a,b;
int main(){
while(1){
cin >> n >> m;
if(n==0)break;
for(int i=0;i<m;i++){
cin >> a >> b;
if(a==1&&stu[b]==0){
stu[b]=1;
sum++;
}else memo[a][b]=5;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while ( cin >> N ) {
if ( N == 0 ) {
break;
}
typedef pair<double, string> P;
vector<P> ans;
while ( N-- ) {
string l;
int p;
cin >> l >> p;
int t = 0;
int d = 0;
for ( int i = 0; i < 5; i++ ) {
int a;
cin >> ... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<double,string> P;
const ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s1[100],s2[100];
string t;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >> ty;
int i=0,j=0;
while(j<(ty-sy))
{cout << 'U'; j++;}
while(i<(tx-sx))
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | 1 |
// Etavioxy
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define il inline
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[u];i;i=bow[i].nxt)
#define file(s) f... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
//0繰り上がりなし, 1繰り上がりあり
//long long dp[1000][2];
long long dp[1000100][2];
const long long INF = 1LL << 61;
int main(){
string money = "0";
string s;
cin >> s;
money += s;
long long n = money.size();
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.