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 int ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define txt freopen("ip.txt", "r", stdin); freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define F first
#define S second
#define PB ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 0 |
// 2020-07-04 23:45:06
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
vector<vector<ll>> g(100010);
vector<ll> dist(100010);
int main(){
... | 1 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 1 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <int> vi;
int main(void){
map <char, int> m;
vi x;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
while (true){
string roman;
cin>>roman;
if (cin.eof()) brea... | #include<iostream>
#include<string>
using namespace std;
int main(){
long i,l,m,n,y;
string s;
while(cin>>s){
l=s.size();
y=0;m=1001;
for(i=0;i<l;i++){
if(s[i]=='I')n=1;
else if(s[i]=='V')n=5;
else if(s[i]=='X')n=10;
else if(s[i]=='L')n=50;
else if(s[i]=='C')n=100;
else if(s[i]=='D')n=500;
else if(s[i]=='M')n=1000;
if(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template<typename T>
#define TTF template<typename T, typename F>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline ... | #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define V... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
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],A[r]);
return i+1;
}
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) ... | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>... | 0 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int ... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... | 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#defi... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef pair<int, int> ii;
const int N = 5e3 + 5;
int n, sum;
vector< pair<int, ii> > vec;
priority_queue<int> pq;
int main () {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int ... | 0 |
#include<iostream>
#include<list>
#include<queue>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
int n, m;
struct Node {
//int id;
list<int> next;
};
Node graph[100005];
int prenum[100005];
int parent[100005];
int lowest[100005];
set<int> answer;
int rootCount;
void dfs(int curNodeId,int ste... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 1 |
#include<iostream>
using namespace std;
int n,x,y,z;
long mod=1e9+7,dp[41][1<<17];
main()
{
cin>>n>>x>>y>>z;
int no=1<<z-1|1<<y+z-1|1<<x+y+z-1;
dp[0][0]=1;
long ans=1;
for(int i=0;i<n;i++)
{
for(int j=1;j<=10;j++)
{
for(int k=0;k<1<<17;k++)
{
int nxt=(k<<j|1<<j-1)&(1<<17)-1;
if((nxt&no)!=no)(dp[... | #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++)
{
... | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<cstring>
#include<fstream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+5;
int tot,head[MAXN];
LL dist[MAXN];
bool vis[MAXN... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
struct Edge{
Edge(int arg_to,ll arg_dist){
to = arg_to;
dist = arg_dist;
... | 1 |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bi... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int res,ll,rr,uu,dd,ad,R,L,D,U,sx,sy,h,w,pr[105][105],pc[105][105],dp[105][105][105];
char s[105][105];
int main()
{
scanf("%d%d",&h,&w);
for (int i=1;i<=h;++i)
scanf("%s",s[i]+1);
for (int i=1;i<=h;++i)
for (int ... | 0 |
#include <iostream>
using namespace std;
int main()
{
int a[5000];
int left[5000], right[5000];
int n;
while (true) {
cin >> n;
if (n==0) break;
bool existsPos = false;
for (int i=0; i<n; i++) {
cin >> a[i];
if (a[i] > 0) existsPos = true;
}
int maximum;
if (existsPos) {
int left... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main(){
int sum;
string st;
map <char,int> code;
code['I']=1;
code['V']=5;
code['X']=10;
code['L']=50;
code['C']=100;
code['D']=500;
code['M']=1000;
while(cin>>st){
sum=0;
f... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fordebug int hoge;cin>>hoge;
#define DEKAI 1000000007;
#define INF 2000000000
#define int long long
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
int a[100000];
int partition(int p,int r){
int x=a[r];
int i=p-1;
lps(j,p,r){
if(a[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | 0 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,i,j,k,l,x,y;
short f[105][105][105][105],ans,s1[105][105],s2[105][105],z;
char s[105][105];
int main()
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)
{
scanf("%s",s[i]+1);
for(j=1;j<=m;++j)
{
s1[i][j]=s1[i][j-1]+(s... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, k;
cin >> n >> k;
// n = 200000;
// k = 100000;
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
bool p[101000];
void prime() {
fill(p, p+101000, true);
p[0] = false;
p[1] = false;
for(int i = 2; i < 101000; i++) {
if(p[i]) {
for(int j = 2; i*j < 101000; j++) {
p[i*j] = false;
}
}
}
}
int main() {
int n;
prime();
... | #include<stdio.h>
int isprime(int n){
for(int i = 2; i * i <= n; i++){
if(n % i == 0)return 0;
}
return 1;
}
int main(){
int v;
while(scanf("%d", &v) != EOF) {
if(v == 0){
break;
}
while(1){
if(isprime(v) == 1 && isprime(v - 2) == 1){
printf("%d %d\n", v - 2, v);
br... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<bool> seen(1'000'000'000);
bool ans = true;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,ans=0,cnt=0;
string s;
cin>>a>>b;
cin>>s;
for(int i=0; i<a; i++)
{
if(s[i]-'0'<0||s[i]-'0'>9)
{
cout<<"No";
return 0;
}
}
if(s[a]!='-')
{
cout<<"No";
... | 0 |
//Now you are making me a boy with luvv...
//I don't want to do this but I'm being forced to ....pls help!!
#include <bits/stdc++.h>
using namespace std;
#define loop(x,n) for(int x = 0; x < n; ++x)
#define ed end()
#define bg begin()
# define ld long double
#define ll long long
#define ub(v,a) upper_bound(all(v),a)
... | #include <iostream>
#include <cstring>
#include <cstdio>
#define Maxn 4010
#define Maxm 4010
using namespace std;
int read() {
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
ret... | 0 |
#include <stdio.h>
int main(){
int X,Y,Z;
int *px,*py,*pz;
scanf("%d",&X);
scanf("%d",&Y);
scanf("%d",&Z);
px = &Z;
py = &X;
pz = &Y;
printf("%d %d %d",*px,*py,*pz);
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z;
cin>>x>>y>>z;
int temp = x;
x = y;
y = temp;
int temp2 = x;
x = z;
z = temp2;
cout<<x<<" "<<y<<" "<<z;
return 0;
} | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a,b,c,i,d;
cin>>a>>b>>c;
i=c;
d=b;
while(a>b){
b=b+d;
c=c+i;
}
cout<<c;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ if (a < b) { a = b; }... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
map<ll, int> mp;
cin >> N;
for (int i = 0; i < N; i++) {
ll A;
cin >> A;
mp[A]++;
}
int ans = 0;
for (auto ite = mp.rbegin(); ite != mp.rend(); ++ite) {
if (ite->second ==... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
typed... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v)... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD=1000000007;
LL nol[60],satu[60];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
LL a;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a;
for(int j=0;j<60;j++){
if(a & (1LL<<j))satu[j]++;
else nol[... | 0 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int h... | 1 |
#include <bits/stdc++.h>
using namespace std;
//Made with <3 by MinumCoklatPanas
typedef long long ll;
const ll INF = 1e9;
const ll INFF = 1e18;
const ll MAXN = 510;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
ll mul(ll x,ll y)
{
return ((x % MOD) * (y %... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double
#define P ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <queue>
using namespace std;
int main(){
long long n... | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | #include<stdio.h>
#include<string.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
#define P 998244353
const int N=305;
int f[N][N][N],K,ans,n,cn[N];
char s[N];
il void mo(it&p,ct q){p+=q,p=(p>=P?p-P:p);}
int main()... | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
int *v,m,n,ans=0;
int main(){
while(true){
std::cin >> n >> m;
if(!n && !m)
return 0;
v = new int[n];
for(int i=0 ;i<n; i++)
std::cin >> v[i];
std::sort(v,v+n,std::greater<int>());
if(m!=1)
for(int i=0; i<n; i++)
if(!((i+1)%m == 0 &... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m&&n != 0 && m != 0) {
int a = n%m, b = (n - a) / m, d = 0, e[1000], sum = 0;
string c, h = "";
getline(cin, c);
getline(cin, c);
c += " ";
for (int i = 0; i < c.length(); i++) {
if (c... | 1 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
typedef pair<double, string> P;
typedef pair<string, double> Q;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
string plant;
int p, a, b, c, d, e, f, s, m;
int time;
dou... | #include<bits/stdc++.h>
using namespace std;
int N;
const double EPS = 1e-10;
struct state{
string name;
double k;
state(){}
state(int P,int A,int B,int C,int D, int E,int F,int S,int M){
int time = A + B + C + (D + E)*M;
int num = M * F;
int mon = num * S;
int s = mon - P;
k = (double)s/(... | 1 |
#if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
int pre;
for(int i=0;i<n_min;++i){
cin>>pre;
}
int buf1=0,ans;
for(int i=n_min;i<=n_max;++i){
int p;cin>>p;
if(buf1<=pre-p){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
typedef tuple<int, int, int> tp;
// input
int N, Q;
vector<tp> XST;
vector<int> D;
vector<int> ans;
set<P> ds;
void input() {
cin >> ... | // 0514 Quality Checking (????????????)
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0514
// by Equim on 16-12-21
#include <cstdio>
int main()
{
while (true)
{
// INPUT
int a, b, c, Cases;
scanf("%d%d%d", &a, &b, &c);
if (a == 0)
break;
scanf(... | 0 |
#include<iostream>
#include<cstring>
int field[14][14];
void dfs(int r,int c);
int main()
{
int num;
char buf[14];
while(1)
{
num=0;
memset(field,0,sizeof(field));
for(int i=1;i<=12;i++)
{
if(std::cin.eof())break;
std::cin.getline(buf,14);
if(buf[0]=='\0')
{
i--;
continue;
}
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popco... | 0 |
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using ui128 = __uint128_t;
#define all(x) (x).begin(),(x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
int N;
string s;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> s;
rep(a, 2) rep(b, 2) {
int A[N];
A[0] = a;
... | 1 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
int main() {
double H, W, N;
cin >> H >> W >> N;
if(H >= W) cout << ceil(N/H) << endl;
else cout << ceil(N/W) << endl;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
int c[10];
int main(){
int n;
while (cin >> n, n){
REP(i,10) c[i] = 0;
... | #include <iostream>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <sstream>
#include <vector>
#include <map>
#include <cmath>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)
using namespace std;
int main(void){
long long n, bg, tn, su;
while(cin >> n){... | 0 |
#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(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, ... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<stdio.h>
#include<cstdio>
#include<string.h>
#include<cmath>
using namespace std;
bool prime(int n) {
if (n == 1)return false;
if (n == 2)return true;
if (n == 3)return true;
if (n == 4)return false;
for (int i = 2; i < ceil(sqrt(n)); i++) {
if (n... | 0 |
#include <iostream>
using namespace std;
const int MAX = 500;
int main() {
int n, m, Q;
cin >> n >> m >> Q;
int S[MAX+1][MAX+1] = {};
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
S[l][r]++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
S[i][j] += S[i][j-1];
}
}
for (int... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
#include <stack>
using namespace std;
using ll = long long;
using Pii = pai... | 0 |
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
ll x,y,sum=0;
cin>>x>>y;
if(x==1)sum+=300000;
if(x==2)sum+=200000;
if(x==3)sum+=100000;
if(y==1)sum+=300000;
if(y==2)sum+=200000;
if(y==3)sum+=100000;
if(x==1&&y==1)sum+=400000;
cout<<sum<<endl;
} | 1 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define iter(i, n) for (int i = 1; i <= n; ++i)
#define iter_r(i, n) for (int i = n; i >= 1; --i)
const int mod = 998244353;
#define NR 1010000
const int N = 1e6 + 10;
int n, m;
struct Int {
int v;
Int(int v = 0) : v(v) {}
void operator+=(Int b) { v =... | #include <cstdio>
#include <algorithm>
using namespace std;
const int mod = 998244353;
typedef long long LL;
const int MAXN = 1e6 + 6;
LL n , m , fac[MAXN] , inv[MAXN] , finv[MAXN];
int main() {
scanf("%lld %lld" , &n , &m);
fac[0] = 1;
for (LL i = 1; i <= n + m; ++i) fac[i] = fac[i - 1] * i % mod;
finv[1] = inv[1]... | 1 |
#pragma region header
#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>
#inc... | #include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#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> // tuple, make_tuple
#include <cstdint> // in... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
int main(void){
int N;
cin >> N;
vector<pair<float, int>> vec(N);
float avg = 0.0f;
rep(i,0,N){
int input;
cin >> input;
vec[i] = make_pair(input, i);
avg+=(float)vec[i].first... | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target ("sse4")
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define MEM(x,a) memset((x),a,sizeof((x)))
#define F first
#define S second
#define imx INT_MAX
const long long MOD = (long long)(1e9+7);
const long long MMX = (l... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(... | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
u... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const ... | 1 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
usi... | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
int main(){
ll K;
cin>>K;
cout<<50<<endl;
REP(i,50){
ll ans;
if (i<K%50){
ans=100-(K%50)+K/50;
}else{
ans=49-(K%50)+K/50;
}
if (i){
cout<<" ";
}
cout<... | 1 |
#include <iostream>
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
using namespace ... | #include <bits/stdc++.h>
using namespace std ;
const int N = 5010 ;
const long long inf = 10000000000000000 ;
pair<int,int> zab [ N ] ;
bool cmp ( pair<int,int> A, pair<int,int> B ) {
return A.first + A.second < B.first + B.second ;
}
long long dp [ N ][ 3 ];
int main() {
// freopen("input.txt", "r", stdin) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
string t("2018"),s;
rep(i,10){
char c; cin >> c;
if(i>=0 && i<=3){
cout << t[i];
}else{
cout << c;... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
cout << s.replace(3, 1, "8") << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll h,w;
cin >> h >> w;
string s[h];
vector<vector<char>> t(h, vector<char>(w));
rep(i,h) cin >... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
str a[60];
#define fi first
#define se second
#define DIRMAX 4
pair<int,int> dir[4]=
{
{ 0,-1},
{-1, 0},
{ 1, 0},
{ 0, 1},
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h,w;cin>>h>>w;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
// Your code here!
ll n,k;
cin>>n>>k;
char d[k];
rep(0,i,k)cin>>d[i];
rep(n,N,100001){
string nN=to_string(N);
bool t=true;
rep(0,i,nN.length()){
... | //
//AtCoder Beginner Contest 042
//C
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
int N, M;
int MOD;
int Fact[6005], Inv[6005], Pw2[6005], Pw3[6005], IPw2[6005], IPw3[6005];
int power(int n, int p){
int sol = 1;
while(p){
if(p & 1)
sol = (1LL * sol * n) % MOD;
p /= 2;
n = (1LL * n * n) % MOD;
}... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<vector>
#include<cctype>
using namespace std;
int main(){
vector<int>a;
int n,s=0,b=0;long sum=0;
cin>>n;int nnn;
if(n>0){
for(int i=0;i<n;i++){cin>>nnn;a.push_back(nnn);}
s=a[0],b=a[0];
for(int i=0;i<a.size();i++)... | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int partition(int A[], int p, int last){
int x = A[last];
int bigger_first_ind = p - 1;
for(int j = p; j < last; j++){
if(A[j] <= x) swap(A[++bigger_first_ind], A[j]);
}
swap(A[++bigger_first_ind], A[last]);
return bigger_... | 0 |
#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 <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 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 ll long long
#define vll vector<ll>
#define ld long double
#define pll pair<ll,ll>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#d... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
void Ans(bool x){if(x) cout<<"Yes"<<endl;else co... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) (... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | 1 |
#include<iostream>
using namespace std;
long long p=998244353,jc[200010],n,m,k,f[200010],ans;
long long ksm(long long a,long long b)
{
long long x=1;
for(;b;a=(a*a)%p,b/=2) if(b%2==1) x=(x*a)%p;
return x;
}
long long c(long long x,long long y)
{
long long z=jc[x];
if(y<=0) return 1;
z=(z*k... | #include <bits/stdc++.h>
#define MOD 998244353LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll fact[400005];
ll mod_pow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1LL){
res=res*x%MOD;
}
x=x*x%MOD;
n>>=1LL;
}
return res;
}
ll extgcd(ll a,ll b,ll& x,ll& y){
ll d=a;
if(b!=0LL){
d... | 1 |
#include <iostream>
#include <iomanip>
#include<vector>
using namespace std;
int main()
{
while(1)
{
int N;
cin >> N;
if(N == 0)
{
return 0;
}
vector<vector<int>> map;
//??????????????????
for(int i = 0; i < N+1; i++)
{
vector<int> column;
for(int j = 0; j < N + 1; j++)
{
if(i == N... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
const int MAX = 10001;
bool isPrime[MAX];
fill_n(isPrime, MAX, true);
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (isPrime[i]) {
for (in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long x;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
long long loss = 0;
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
loss +... | #include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
#include <functional>
using namespace std;
using T=tuple<int64_t,int>;
int main(){
int64_t N,X;
cin>>N>>X;
vector<int64_t> B(N),L(N),U(N);
for(int i=0;i<N;i++){
cin>>B[i]>>L[i]>>U[i];
}
vector<T> V;
for(int ... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1000005;
const int mo=998244353;
int fac[N],inv[N],n,m,ans;
int C(int x,int y){
return 1ll*fac[x]*inv[y]%mo*inv[x-y]%mo;
}
int main(){
fac[0]=inv[0]=inv[1]=1;
for (int i=2;i<N;i++)
inv[i]=1ll*(mo-mo/i)*inv[mo%i]%mo;
for (int i=1;i<N;i++)
fac[i]=1ll*fac[i-... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
// 10x + 5y + z = Y
// x + y + z = N
// 9x + 4y = Y - N
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5,inf=0x3f3f3f3f;
char s[N][N];
int a,b,n=100;
int main()
{
cin>>a>>b;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(j>50)
s[i][j]='#';
else
s[i][j]='.';
}
for(int i=1;i<=n;i+=2)
for(int j=1;j<50;j++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(... | 1 |
// Problem : C - Snuke Festival
// Contest : AtCoder - AtCoder Beginner Contest 077
// URL : https://atcoder.jp/contests/abc077/tasks/arc084_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragm... | #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 repr(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;
... | 0 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define S... | 1 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
vector<int> v;
int x, y, res(2019);
int main() {
DAU
cin >> x >> y;
for (int i = x; i <= min(x + 2020, y); ++i)
v.emplace_back(i % 2019);
sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
namespace program
{
namespace IO
{
struct input_t
{
static const int BUF_SIZ = 500000;
FILE *f;
char Buf[BUF_SIZ], *p, *pend;
input_t(FILE *_f) : f(_f), p(Buf), pend(Buf) {}
~input_t() { fclose(f); }
char getchar();
template <typename T>
T re... | 0 |
#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;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void input(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& ro... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= ... | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define MEM(a,n) memset(a,n,sizeof(a))
#define p(S) cout<<(S)<<endl
using namespace std;
int main(){
int n,p;
while(cin>>n>>p,n){
int a[50],center=p;
MEM(a,0);
int ans;
REP(i,0,n){
if(center>0) {
a[i]++;
center--;
}
else{
... | 1 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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 rep(i, n) for(int i=0;i<n;++i)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
ll n;
cin>>n;
vector<ll>cnt(n+1,0);
while(n>1)
{
ll x=n;
for(ll ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
string s;
ll n;
cin >> s;
n = s.size();
vector<ll>cnt(26);
rep(i,0,n) cnt[s[i]-'a']++;
ll ans = 1+n*(n-1)/2;
rep(i,0,26) ans -= cnt[i]*(cnt[i]-1... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 //1e4
#define base10_5 100000 //1e5
#define base10_6 1000000 //1e6
#... | 0 |
#include<stdio.h>
#include<string.h>
#include<math.h>
void p(int,int);
int a,s,d[4]={0,-1,0,1},f[4]={-1,0,1,0},g,h,c,x;
char z[13][13];
int main(void)
{
int i,j;
while(scanf("%s",z[0])!=EOF){
for(i=1;i<12;i++) scanf("%s",z[i]);
g=0;
for(i=0;i<12;i++){
for(j=0;j<12;j++){
if(z[i][j]=='1'){
g++;
p... | #include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | 0 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(2);
int k;
cin >> a[0] >> a[1] >> k;
int times = 0;
int side = 0;
while(1){
if(a[side] % 2 == 1) a[side] -= 1;
a[side] /= 2;
a[(side+1)%2] += a[side];
side += 1;
side %= 2;
t... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool a=true;
if(S.size()%2==1) a=false;
else for(int i=0;i<S.size()/2;i++){
if(S.at(i*2)!='h'||S.at(i*2+1)!='i') a=false;
}
if(a)cout << "Yes" << endl;
else cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
struct dish{
ll A,B;
bool operator<(const dish &o) const {return A+B < o.A+o.B;}
bool operator>(const dish &o) const {return A+B > o.A+o.B;}
};
int main(){
... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
cin >> n;
vi A(n), B(n), C(n);
rep(i,n) cin >> A[i];
rep(i,n) cin >> B[i];
r... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int n,m,q,v[2002][2002],e[2][2002][2002];
string s[2002];
int main(void){
cin>>n>>m>>q;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
v[i][j]=e[0][i][j]=e[1][i][j]=0;
}
}
for(int i=0;i<n;i++){
cin>>s[i];
}... | #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 <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a[100005];
int main()
{
scanf("%d%d",&n,&m);
int ct=0;
for(int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
if(a[i]%2) ct++;
}
if(ct>2)
{
printf("Impossible\n");
return 0;
}
int id1=0,id2=0;
for(int i=1;i<=m;i++)
if(a[i]%2)
... | 1 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include <stdio.h>
int main(){
int X,Y,Z;
int *px,*py,*pz;
scanf("%d",&X);
scanf("%d",&Y);
scanf("%d",&Z);
px = &Z;
py = &X;
pz = &Y;
printf("%d %d %d",*px,*py,*pz);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int k;
cin >> k >> s;
int n = s.size();
if(n <= k){
cout << s << endl;
return 0;
}else{
int i = 0;
while(i<=k-1){
cout << s.at(i);
if(i==k-1){
cout << "..." << endl;
return 0;
}
i++;... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main ()
{
int M,N,mo[10000],sk[10000]={};
cin>>N>>M;
for(int i=0;i<N;i++)
{
cin>>mo[i];
}
for(int i=0;i<M;i++)
{
int aa;
cin>>aa;
for(int q=0;q<N;q++)
{
if(mo[q]<=aa){sk[q]++;
break;
}
}
}
int z=0,b=0;
... | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int, int> intersect(const pair<int, int> &lhs, const pair<int, int> &rhs) {
return {max(lhs.first, rhs.first), min(lhs.second, rhs.second)};
}
int length(const pair<int, int> &interval) {
if (interval.first > interval.second) {
... | 1 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
void call(int n){
for(int i = 1; i <= n; i++){
if(i % 3 == 0) cout << " " << i;
else{
for(int tmp = i; tmp != 0; tmp /= 10){
if(tmp % 10 == 3){
cout << " " << i;
break;
}
}
... | #include<iostream>
using namespace std;
int x, i = 1;
int n;
void check_num();
void include3();
void end_check_num();
void check_num() {
x = i;
if (x % 3 == 0){
cout << " " << i;
end_check_num();
}else include3();
}
void include3() {
if (x % 10 == 3){
cout << " " << i;
end_check_num();
}else{
x /= 10... | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sort(x) sort(x.begin(), x.e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<'\n';
#define debug(a,b,c) cout << a << " " << b << " " << c << endl;
#de... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define tc ll t; cin >> t; while (t--)
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define ... | 0 |
#include <stdio.h>
//#include <math.h>
using namespace std;
int log10(int n) {
int keta = 0;
do{
n /= 10;
keta++;
} while (n > 0);
return keta;
}
int main() {
const int MAX_N = 20;
int N;
int table[MAX_N][MAX_N];
while (1) {
for (int i = 0;i < MAX_N;i++) {
for (int j = 0;j < MAX_N;j++) {
table[i... | #include<iostream>
#include<vector>
using namespace std;
int main(){
while(1){
int a,b,c,n,p[1002],q[1002],r[1002],s[1002],Q[302];
for(int i=0;i<302;i++)Q[i]=2;
scanf("%d%d%d",&a,&b,&c);
if(a==0&&b==0&&c==0)break;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d%d",&p[i],&q[i],&r[i],&s[i]);
if(s[i]==1){Q[... | 0 |
// 解き直し.
// https://img.atcoder.jp/soundhound2018-summer-qual/editorial.pdf
#include <bits/stdc++.h>
using namespace std;
int main(){
// 1. 入力情報.
double n, m, d;
scanf("%lf %lf %lf", &n, &m, &d);
// 2. 出力.
if(d == 0) printf("%.10lf", (m - 1.0) * 1.0 / n);
else printf("%.10lf", (... | #include <iostream>
using namespace std;
int main()
{
string date;
getline(cin,date);
string date2;
date2=date.substr(4,6);
cout << "2018"<< date2;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
v.push_back({a, b});
}
vector<vector<ll>> dp(n, vector<ll>(n, -1));
function<ll(int... | // http://algorithms.blog55.fc2.com/blog-entry-66.html
#include <stdio.h>
#include <string.h>
#define M 100
int N,R[M+1],C[M][M],B[M][M];
void compute(){
int i=0,j,k,cost;
memset(C,99,sizeof(C));
for(;i<N;i++)C[i][i]=0;
for(j=1;j<N;j++)
for(i=0;i<N - j; i++ )
for (k = i; k < i + j; k++ ){
cost = C[i][k... | 1 |
#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... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const long long mod=1000000007;
const int maxn=200005;
ll inv[maxn],s[maxn];
int N,n,m,x,y;
ll Pow(ll a,int b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=ans*a%mod;
a=a*a%mod;
b>>=1;
... | 1 |
#include<stdio.h>
int main(){
char S[100], T[100];
scanf("%s %s", S, T);
printf("%s%s\n", T, S);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
ll k,x;
cin>>k>>x;
ll n=k-1;
for(ll i=x-n;i<=x+n;i++){
cout<<i<<" ";
}
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll x; cin>>x;
ll ans=x/11*2;
x%=11;
if(x!=0)
{
if(x>=7)
{
ans++;
}
ans++;
}
cout<<ans<<endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int a, b, l, x;
char c;
while (getline(cin, str)) {
x = 0;
l = (int)str.size();
for (int i=0; i<l; i++) {
c = str.at(i);
if (c == 'I') a = 1;
else if (c == 'V') a = 5;
else if (c == 'X') a = ... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
ll n, T;
cin >> n >> T;
ll ans = 0;
vector<ll> t(n);
rep(i, n)
{
cin >> t[i];
}
rep(i, n)
{
... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, T;
cin >> N >> T;
long long ans = 0LL;
long long prevt;
cin >> prevt;
for (long long i = 1; i < N; ++i) {
long long t;
cin >> t;
if (T <= t - prevt) {
ans += T;
}
else {... | 1 |
#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main() {
int n, a[100],ans;
float sum = 0,min=101.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
for (int i = 0; i < n; i++) {
if (fabs(a[i] - sum) == min)continue;
if (fabs(a[i] - sum) < min)... | #include <iostream>
int main(void){
int N, ans=40;
std::cin >> N;
for (int i=0; i<N; ++i){
int a, cnt=0;
std::cin >> a;
while (a % 2 == 0){
a /= 2;
++cnt;
}
if (cnt < ans) ans = cnt;
}
std::cout << ans << std::endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
const Int MOD = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> a(N), b(M);
vector<Int> cnt_a(1000010, 0), cnt_b(1000010, 0);
bool ok = true;
for (int i = 0; i < N; ++i) {
cin >> a[i];
++cnt_a[a[i]];
if (cnt_a[a[i]] > 1) { ok = ... | #include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> ... | 1 |
#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define eb emplace_back
typedef long long ll;
#define int ll
auto const inf = numeric_limits<int>::... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#... | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
using D ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define fi first
#define se second
#define eb emplace_back
#define ef emplace_front
#define pof pop_front()
#define pob pop_back()
#define Rep(i,n) for(li i=0,nn=(li)(n);i!=nn;++i)
#define Rep1(i,n) for(li i=1,nn=(li)(n)+1;i!=nn;++i... | 1 |
#include <iostream>
#define MEN 6
using namespace std;
struct IN_DICE
{
int num1;
int num2;
int num3;
int num4;
int num5;
int num6;
};
struct DICE
{
int num;
};
int main()
{
DICE A[MEN];
DICE B1[MEN];
DICE B2[MEN];
DICE B3[MEN];
IN_DICE in[100];
int flag = 0;
int x;
int n;
cin >> n;
for ( int i ... | /*+lmake
* STD = c++14
* DEFINE += WAAUTOMATON
*/
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#ifdef WAAUTOMATON
#define debug(args...) {dbg,args; cerr<<endl;}
#else
#define debug(args...) // Just strip off all debug tokens
#endif
struct de... | 0 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define ll long long
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define int long lon... |
#include <iostream>
#include <numeric>
#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> // tuple, make_tuple
#include <cst... | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353;//786433;//998244353;
const double Pi = acos(-1);
void ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | 0 |
#include<iostream>
using namespace std;
#include<vector>
#include<functional>
template<typename T>
struct dualsegtree{
function<T(T,T)>lazycalcfn,updatefn;
int n;
T lazydefvalue;
vector<T>dat,lazy;
vector<bool>lazyflag;
dualsegtree(int n_=0,T defvalue=0,
function<T(T,T)>lazycalcfn_=[](T a,T b){return a+b;},
f... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define IN freopen("dichromatic.in","r",stdin)
#define OUT freopen("dichromatic.out","w",stdout)
#define FOR(i,a... | #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#de... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(cons... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) <... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
constexpr ll MOD = 1000000007;
constexpr ll MAX = 1 << 20;
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
//累積XOR
vector<ll> b(N + 1, 0);
for (ll i = 0; i < N; ... | //Δ_E
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1<<20;
const int MO = 1e9+7;
int n... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{int n;
string s;
cin>>n;
cin>>s;
if(s.size()>n)
{
s.erase(n);
cout<<s+"..."<<endl;}
else cout<<s<<endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if(n < 1200)... | 0 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s; cin >> s;
for(int bit=0; bit<(1<<3); bit++){
string str = "";
str += s[0];
int cnt = s[0] - '0';
if(bit & (1<<0)){
cnt += s[1] - '0';
str += "+";
}else{
... | #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... | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
//#include<>
using namespace std;
typedef pair<int,int> Node;
typedef long long ll;
#define rep(i,j) for(i=0;i<j;i++)
#define rev_rep(i,j) for(i=j;i>=0;i—-)
int I... | #include <iostream>
using namespace std;
int main(){
int t[110]={};
int N;
cin >> N;
int a,b,c,d;
//得点
for(int i = 0; i < N*(N-1)/2; i++){
cin >> a >> b >> c >> d;
if(c > d) t[a-1] += 3;
else if(c < d) t[b-1] += 3;
else if(c == d){
t[a-1]++;
t[b-1]++;
}
}
//順位
int p = ... | 0 |
#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() {
ll n,x;cin>>n>>x;
vector<ll> a(n);
rep(i,n)cin>>a[i];
sort(all(a));
int cnt=0;
rep(i,n){
x-=a[i];
if(x<0)break;
cnt++;
}
if(x>0)cn... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase=1;
for(int p=0;p<testcase;p++){
ll n=0,x=0;
cin>>n>>x;
ll array[n]={0};
ll totalsum=0;
for(int i=0;i<n;i++){
cin>>array[i];
totalsum... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.