code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, M;
cin >> N >> M;
vector<unsigned long> uf(2 * N), sz(2 * N);
iota(uf.begin(), uf.end(), 0UL);
fill(sz.begin(), sz.begin() + N, 1);
const auto& find = [&uf](unsigned long i) -> unsigned long {
while(i != uf[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | 1 |
#include <bits/stdc++.h>
using namespace std;
#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)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define fi first
#define se second
#define INF 1000000009
#define LLINF 1000000000000000009LL
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b;
cin >> a >> b;
cout << b - a + b << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
int main(){
long x,y;cin>>x>>y;
if(x<0&&y==0){
cout<< -x;
}
if(x>=0&&y>=0){
(y>x)?cout<<y-x:cout<<min(2+x-y,1+y+x);return 0;
}
else ... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
int a, b;
cin >> a >> b;
cout << (a > 8 || b > 8 ? ... | 0 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <bits/stdc++.h>
using namespace std;
#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 sz(obj) ((int)(obj).size())
#define pf push_front
#define pb push_back
int main()
{
int n;
cin >> n;
in... | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | #include<bits/stdc++.h>
#define N 100010
#define ll long long
using namespace std;
ll n, sum, ans, res;
ll a[N], p[70];
void rd(ll &ans)
{
ans = 0; ll f = 1;
char x = getchar();
while(x > '9' || x < '0') {if(x == '-') f = -1; x = getchar();}
while(x >= '0' && x <= '9') ans = ans * 10 + x - '0', x = ge... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin >>s;
if(s.size()%2)cout << "No" << endl;
else{
bool ok = true;
for(int i=0; i<s.size(); i++){
if(i%2==0 && s[i]!='h'){
ok = false;
break;
}
if(i%2==1 && s[i]!='i'){
ok = false;
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
int x,k;
cin>>x>>k;
ll y[x];
for (int i=0;i<x;i++){
cin>>y[i];
}
ll ans=1e18;
for (int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2050)... | 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
using point = pair< int,int >;
using ll = long long;
int main(){
int n;
int m, e, j;
bool hund;
while (~scanf("%d", &n)) {
REP(i, n) {
hund = false;... | #include<cstdio>
int main(){
int n;
for(;;){
scanf("%d",&n);
if(n==0) break;
for(int i=0;i<n;i++){
int p[3];
char r='C';
for(int j=0;j<3;j++){
scanf("%d",&p[j]);
}
int sum=0,sumb=0;
for(int j=0;j<3;j+... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 1 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
char col[maxN][maxN];
bool vis[26];
void dfs(int x, int y, char c) {
if (x > n) {
int val = 0;
memset(vis, 0, sizeof(vis));
for (int j = 1; j <= n; ++j) vis[col[1][j] - 'a'] = 1;
for (char t =... | #include<iostream>
using namespace std;
#include<string>
class dice
{
public:
int F[6];
int q1, q2;
dice();
void input();
void roll_a();
void roll_b();
bool check(const dice& d);
bool equal(const dice& d);
};
dice::dice(){}
void dice::input()
{
int i;
for(i = 0; i < 6; i++) cin >... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
long long INF=1e7;
double EPS = 1e-12;
const long long lim = 2e5+100;
typedef long long int lld;
typedef long long ll;
#define rep(i,a,n) for(long long int i = (a); i <= (n); ++i)
#define mset(a, v) memset(a, v, sizeof(a))
#define Error(x...) { cout <... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int main,temp,count=0;
cin>>main;
temp=floor(main/500);
main=main-temp*500;
count=count+temp*1000;
count=count+floor(main/5)*5;
cout<<count;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int t=1;
//cin>>t;
while... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if(n < 10){
cout << m + (10 - n)*100 << endl;
}else{
cout << m << endl;
}
} | #include<stdio.h>
int main(){
int N;
int R;
scanf("%d %d",&N,&R);
int x;
x = 10 - N;
int inner;
inner = 100 * x;
if(N>100 || N<1 || R<0 || R>4111){
printf("eror");
}
else if(N<10){
printf("%d",inner + R);
}
else if(N>=10){
printf("%d",R);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if ((A + B) > (C + D)){
cout << "Left" << endl;
}
if ((A + B) == (C + D)){
cout << "Balanced" << endl;
}
if ((A + B) < (C + D)){
cout << "Right" << endl;
}
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) SOR... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a,b,azb,abb,amb;
cin>>a>>b;
azb=a*b;
abb=a+b;
amb=a-b;
cout << fmax(fmax(azb,abb),amb);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define rep(i,N) repr(i,0,N)
#def... | 0 |
#include<cstdio>
#include<cmath>
#include <stdlib.h>
#include<algorithm>
using namespace std;
int main(){
int ans;
char sen[100];
while( scanf("%s",&sen) != EOF ){
ans=0;
for(int i=0;sen[i]!='\0';i++){
if(sen[i]=='I'){
if(sen[i+1]=='V'||sen[i+1]=='X'){
ans--;
}
else{
ans++;
}
}
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<vector>
using namespace std;
#define INF (1<<20)
map<string,int> m;
vector<int> num;
main(){
m["I"]=1;
m["II"]=2;
m["III"]=3;
m["IV"]=4;
m["V"]=5;
m["VI"]=6;
m["VII"]=7;
m["VIII"]=8;
m["IX"]=9;
m["X"]=10;
... | 1 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
for (int i=3;i<=n;i++) {
int x=i;
if (i%3==0 || i%10==3) {
printf(" %d",i);
} else {
while (x>0) {
if (x%10==3) {
printf(" %d",i);
... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
cout << 0 << endl;
string ss;
cin >> ss;
if (ss == "Vacant") return 0;
int l = 0, r = n;
while(true){
int mid = (l+r)/2;
cout << mid << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int a[5];
int kari;
char d;
while (cin >> a[0] >> d >> a[1] >> d >> a[2] >> d >> a[3] >> d >> a[4]) {
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j+1]) {
... | #include<queue>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include <cstring>
#include <string.h>
#include <cmath>
#include <math.h>
#include <time.h>
#define ll long long
#define N 100003
#define M 103
#define db double
#define P putchar
#define G getchar
#define inf 998244353
using namespace std;
char ch... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;
int main(){
int n,q;
cin >> n >> q;
vector <int> res;
int a[n];
int sq = sqrt(n);
int nsq = n/sq+1;
int ... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.end());
bool odd, even;
odd = even = true;
REP(i, n) {
if (a[i] % 2) even = fa... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int64_t GreatestCommonDivisor(const int64_t a, const int64_t b) {
// GCD. O(log(min(a, b))). 最大公約数.
int64_t... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll>pll;
ll n,x[100010]={0},y[100010]={0};
vector<pll>vx,vy;
vector<pll>edge[100010];
priority_queue<pll,vector<pll>,greater<pll>>q;
//priority_queue<pll>q;
bool used[100010];
ll res=0;
signed main(){
cin>>n;
for(int i=0;i<n;+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool ... | 0 |
#include <iostream>
#include<algorithm>
using namespace std;
int g[100],jyunni[100];
int n;
void katimake(int a,int b,int c,int d){
if(c>d){g[a-1]+=3;}
else if(d>c){g[b-1]+=3;}
else{
g[a-1]++;
g[b-1]++;
}
}
int main() {
cin>>n;
for(int i = 0;i<100;i++){
g[i]=0;
}
int p,q,r,s;
while(cin>>p>>q>>r>>s){kati... | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
using namespace std;
int main()
{
int n, team1, team2, score1, score2, point[101] = {0};
vector<int> rank;
cin >> n;
for(int i = 0; i < n * (n - 1) / 2; i++){
cin >> team1 >> team2 >> score1 >> score2;
if(score1 > score2)
point[tea... | 1 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){... | #define _GLIBCXX_DEBUG //エラーを出すためのおまじない
#include <bits/stdc++.h>
#include <algorithm>
//#include <cstdlib> // abs() for integer
#include <cmath> // abs() for float, and fabs()
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(15);
int a,b;
cin>>a>>b;
a--;
b--;
cout<<(b+a-1)/a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k=1;
cin >> a >> b;
for(int i=0;i<100000;i++){
if(a*i+k-->=b){
cout << i << endl;
break;
}
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int>so;
vector<bool>un(N + 1, true);
const long long mo = 1e9 + 7;
for (int i = 2; i <= N; i ++) {
if (un[i]) {
so.push_back(i);
for (int j = 0; j <= N / i; j ++) {
un[i * j] = false;
}
}
}... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
vector<ll> v(1001, 0);
ll n, k;
cin >> n;
for (ll i = 2; i <= n; i++)
{
k = i;
for (ll j =... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | /**
* author: souzai32
* created: 05.08.2020 01:20:01
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n=s.size();
vector<bool> alphabet(26);
if(n==26){
int i=1;
while(1){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | // #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
using VV = vector<V>... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; 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 ALL(v) (v).begin(),(v... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
string A;
cin >> A;
ll ans = A.size() * (A.size() - 1) / 2;
char c = 'a';
rep(i,26)
{
ll cnt = 0;
rep(j,A.size())
{
if (A[j] == c) cnt++;
}
if (cnt !=... | 0 |
#include<iostream>
using namespace std;
int main(){
int ans[31]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,6,10,19,34,62,113,207,381,701,1288,2369,4357,8014,14740};
while(1){
cin>>ans[0];
if(!ans[0])
return 0;
cout<<ans[ans[0]]<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
vector<long long int>D;
int main() {
long long int N;
D.push_back( 1 );
D.push_back( 1 );
D.push_back( 2 );
D.push_back( 4 );
while( cin >> N, N ) {
while( D.size() <= N ) {
D.push_back( D[D.size() - 1] + D[D.size() - 2] + D[D.size() - 3] );
}
cout << D[N] ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N,K; cin >> N >> K;
int D[K]; rep(i,K) cin >> D[i];
int ans = N;
while (true) {
int tmp = ans;
bool check = true;
while (check && tmp >0) {
int a = tmp % 10;
rep(i,K)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1... | #include<cstdio>
#include<utility>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1050;
struct vertex {
vector<int> to;
int dist = INF;
};
int n, m;
int sd[1000], prv[1000];
vertex ver[1000];
priority_queue<P, vector<P>, greater<P>> q;
int main() {
scanf("... | 1 |
//marico el que lo lea
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
using ll=long long ;
void solve() {
ll k; cin >> k;
ll x = k/50;
int j = k%50;
vector<ll> a(50, 50+x);
j = (50-j);
for (int i = 0; i < j; i++) {
a[i] += -50+j-1;
}
for (int i = j; i < 50; i++) {
a[i] += j;
}
cout <... | 0 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll t;
cin >> t;
while(t--) {
ll n;
cin >> n;
vec a(n);
for(ll i=0;i<n;i++) ... | 0 |
// 有點不耐煩會破壞偉大的計劃
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e14 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
class SegTree {
constexpr static int DEFAULT = INT_MAX;
int Combine(int l, int r) { return min(l,r); }
vector<int> seg_tree;
int n = 0;
void Build(vector<int>& A, int v, int tl, int tr) {
... | 1 |
#include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int map[21][21],n,a,b,c,d,x,y,n2;
char h;
while(cin>>n){
if(n==0)break;
for(int i=0;i<21;i++)for(int j=0;j<21;j++)map[i][j]=0;
for(int i=0;i<n;i++){cin>>a>>b;map[b][a]++;}
cin>>n2;c=0;x=y=10;
for(int i=0;i<n2;i++){
cin>>h;
cin>>d;
if(h=='N')... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
vector<int> v(s.size());
for(int i=0; i<s.size(); i++) {
v[i] = s[i]-'0';
sum += v[i];
}
if(stoi(s)%sum==0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int f(int n) {
int ret = 0;
while (n >= 1) {
ret += n % 10;
n /= 10;
}
return ret;
}
int main() {
int n;
cin >> n;
if (n % f(n) == 0) {
cout << "Yes" << endl;
... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOE(x, a) for(auto x : a)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FOD(i, a, b) for(int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 2010;
const int MOD ... | 1 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cstring>
using namespace std;
typedef long long ll;
int a[100100];
int c[100100];
bool check(int x,int i)
{
if(c[x]<a[i])
{
retur... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main(){
ll n; cin>>n;
vector<ll> v(5);
rep(i,5) cin>>v[i];
sort(all(v));
cout<<(n+v[0]-1)/v[0]+4<<endl;
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 600000
#define NIL -1
//array
int key[N];
int parent[N];
int leftc[N];
int rightc[N];
//root
int root=NIL;
//function insert
void insert(int z){
int x,y;
y=NIL;
x=root;
while(x!=NIL){
y=x;
if(ke... | #include <bits/stdc++.h>
using namespace std;
struct Node {
int key;
Node *parent, *left, *right;
};
Node *NIL, *root;
void insert(int x) {
Node *p = NIL;
Node *u = root;
Node *in = (Node *)malloc(sizeof(Node));
in->key = x;
in->left = NIL;
in->right = NIL;
while (u != NIL) {
... | 1 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <stdio.h>
int main() {
int h, w, g, result;
scanf("%d %d %d", &h, &w, &g);
result = (h > w) ? (g+h-1)/h : (g+w-1)/w;
printf("%d\n", result);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int soredake(int point, int kazu, int bonasu, int goal) {
int tokukazu = goal / point;
if (goal % point > 0) {
tokukazu++;
}
if (tokukazu > kazu) {
tokukazu = kazu;
}
return tokukazu;
}
int search(vector<vector<int>> questions, int goal) {
int minim... | #include"bits/stdc++.h"
using namespace std;
int main() {
int D, G;
cin >> D >> G;
vector<int> p(D), c(D);
for (int i = 0; i < D; i++)
{
cin >> p.at(i) >> c.at(i);
}
int min_cnt = 1<<30;
for (int bit = 0; bit < (1<<D); bit++)
{
int pnt = 0;
int cnt = 0;
for (int i = 0; i < D; i++)
{
if ((bit >> ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3);
int k, y;
for(int i=0;i<3;i++) cin >> x.at(i);
cin >> k;
sort(x.begin(), x.end());
y = x.at(2);
for(int i=0;i<k;i++) y = 2*y;
cout << x.at(0) + x.at(1) + y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
rep(i,k){
if(max({a,b,c}) == a) a *= 2;
else if(max({a,b,c}) == b) b *= 2;
else c *= 2;
}
cout << a+ b + ... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,x1[4]={0,0,1,-1},y1[4]={1,-1,0,0};
char island[13][13];
int serch(int x,int y)
{
island[x][y]='0';
for(int i=0;i<4;i++){
int x2=x+x1[i],y2=y+y1[i];
if(x2>=0&&x2<=11&&y2>=0&&y2<=11&&island[x2][y2]=='1')serch(x2,y2);
}
//cout... | # include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=305;
int a,b,c,tmp;
double n,dp[N][N][N];
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>tmp;
if(tmp==1)a++;
else if(tmp==2)b++;
else c++;
}
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
for(int k=0;k<=n;k++)
{
if(!i&&!j&&!k)contin... | #include<bits/stdc++.h>
using namespace std;
long long dp[200003][3];
long long ara[200003],n;
long long solve(long long idx,long long sta,long long lim)
{
long long rr=lim-sta;
if(idx+rr==n)return ara[idx];
else if(dp[idx][sta]!=-1)return dp[idx][sta];
else
{
long long p;
p=ar... | 0 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> num, pos;
set<int> s;
vector<int> v;
const int N = 1e5+10;
const int k = 30;
int up[N][k];
int L;
void calc(int i) {
//cout << "this->" << *s.lower_bound(-(v[i]+L)) << endl;
up[i][0] = num[*s.lower_bound(-(v[i]+L))];
//cout << up[i][0] << endl;
for(int... | // Date: 2020-03-19
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO ios::sync_with_stdio(false);cin.tie(0)
#define rep(i, a, b) for(int i = int(a); i <= int(b); ++... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=100010;
bool w[N],v[N];
int fa[N],sz[N];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') o=-1,ch=getchar();
whi... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n,q;
cin >> n >> q;
string s;
cin >> s;
vector<int> sum(n+1);
vector<... | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main()
{
for(;;){
int n;
cin >> n;
if(n==0) break;
multimap< double,set<string> > list;
for(int i=0; i<n; i++){
string name;
int p,a,b,c,d,e,f,s,m;
cin >> name >> p >> a >> b >> c >> d >> e >> f >> s >> m;... | 0 |
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
multiset<int> s;
int main() {
int n;
cin >> n;
s.clear();
for (int i = 1; i <= n; i++) {
int tmp;
scanf("%d", &tmp);
auto id = s.lower_bound(tmp);
i... | #include <iostream>
#include <math.h>
using namespace std;
int main(void){
int X;
cin >> X;
X = pow(X, 3);
cout << X << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, k;
string s[][7] = {{"aacd","bbcd","cdaa","cdbb"}, {"aa.ab",".bbab","a.cca","a.a.a","bbabb"}, {"aacd..","bbcd..","cd..aa","cd..bb","..aacd","..bbcd"},{"aacd...","bbcd...","cd.aa..","cd...bb","..a.baa","..a.b.b","..bbaab"}};
in... | #include<bits/stdc++.h>
using namespace std;
const int N = 1003;
int n;
char ans[N][N];
char m4[4][5] = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};
char m5[5][6] = {
"aabbc",
"hii.c",
"h..jd",
"g..jd",
"gffee"
};
char m6[6][7] = {
"aacd..",
"bbcd..",
"..aacd",
"..bbcd",
"ab..aa",
"ab..bb"
};
char m7[7][8] = {
... | 1 |
#include<iostream>
#include<algorithm>
#include<set>
#define MAX 30
#include<string>
#include<vector>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int k;
cin>>k;
vector<string> vec;
vector<int> ind;
set<string> st;
bool isDone[10001];
for(int i=0;i<10001;i++){
isDone[i] = false;
}
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int n,k,a[10],power[6];
vector<string>vec;
int main(){
while(true){
cin>>n>>k;vec.clear();power[0]=1;for(int i=1;i<5;i++)power[i]=power[i-1]*n;
if(n==0 && k==0)break;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<power... | 1 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//cout << fixed << setprecision(10);//
//最小公倍数//
ll gcd(ll x, ll y) {
if (x == 0) return y;
re... | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - ... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int n;
cin>>n;
cout<<(n-2)*180<<endl;
}
signed main(){
//while(1)
solve();
} | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; i++) cin >> a.at(i);
vector<vector<int>> check(h, vector<int>(w));
int ans = -1;
queue<pair<int, int>> bfs;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int H, W, ans=1; cin >> H >> W; string A[H];
REP(i, H){ cin >> A[i]; }
int B[H][W]={}; vector< pair<int, int> > C;
REP(i, H){ REP(j, W){
if(A[i][j]=='#'){ B[i][j]=1; C.push_back(make_pair(i, j)); }
} }
REP(i, ... | 1 |
// REDO
#include <iostream>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
long long cnt = 0, b = 0, a;
for (int i = 0; i < N; ++i) {
cin >> a;
if (a > x) {
cnt += a - x;
a = x;
}
if (b + a > x) {
cnt += b + a - x;
b = x - b;
} else {
b = a;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[4],e,f;
for(int i=0;i<4;i++){
cin>>a[i];
}
cin>>f>>e;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[j]<a[j+1]){
swap(a[j],a[j+1]);
}
}
}
if(e<f){
... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <fun... | 1 |
// #Sazaの1日1AC
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
//マクロ
//型エイリアス
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
//ショ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N,T;
cin >> N >> T;
int A[N],B[N];
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int DP[N][T+1];
int invDP[N][T+1];
for (int i =... | 0 |
#include <iostream>
#include <string>
using namespace std;
struct node{
int key;
node *p,*l,*r;
};
int n;
node *N;
void tree_insert(node *z){
node *y=NULL;
node *x=N;
while(x!=NULL){
y=x;
if(x->key>z->key)x=x->l;
else if(x->key<z->key)x=x->r;
}
z->p=y;
if(y==NU... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x)... | 0 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B;
cin >> A >> B;
int mx;
mx = std::max(A+B, std::max(A-B, A*B));
cout << mx << endl;
return... | #include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
int tmp = A + B;
tm... | 1 |
#include <bits/stdc++.h>
const int mod = 998244353;
const int max_N = 305;
using LL = long long;
int n, K, a[max_N];
LL dp[max_N][max_N][max_N];
// 前 i 个空隙, 共 j 个 1, 用了 k 步
char s[max_N];
int main() {
scanf("%s", s);
n = 1;
for (int i = 0; i < max_N && s[i]; ++i) {
if (s[i] == '0') {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << end... | 0 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); +... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... | 1 |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2020.08.18 17:43:20
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int m;cin >> m;
ll total = 0;
ll ans = 0;
for (int i = 0; i < m; i++) {
ll d,c;cin >> d >> c;
ans += c;
total ... | #include <bits/stdc++.h>
#define rep(i,n) for (ll 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(... | 1 |
#include<stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r){
int tmp,x = A[r];
int j,i = p - 1;
for (j = p; j < r; j++){
if (A[j] <= x){
i = i + 1;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i + 1;
}
int main(){
int i,j;
scanf... | #include<iostream>
#include<vector>
using namespace std;
int partition(vector<int>& A, int p, int r){
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= A[r]) {
i++;
swap(A[i], A[j]);
}
}
i++;
swap(A[i], A[r]);
return i;
}
int main(){
int n;
... | 1 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
template <typename T>
struct RUQ //calculateはminimum
{
int n;
const T ex = 1 << 30; //dat 初期値(minなので)
const T em = 1 << 30; //lazy 初期値(minなので)
vector<T> dat, lazy; //tree本体
RUQ(vector<T>... | #include<bits/stdc++.h>
using namespace std;
typedef pair<long,long> P;
int main(){
long H,W;cin>>H>>W;
set<P> S,T;
for(long i=0;i<W;i++){S.insert(P(i,0));T.insert(P(0,i));}
for(long k=0;k<H;k++){
long a,b;cin>>a>>b;a--;
long y=LONG_MAX;
for(auto itr=S.lower_bound(P(a,-1));itr!=S.end()&&(itr->first)... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string a;
int num[101],cou=0,ans;
while(cin>>a){
for(int i=0;i<a.size();i++){
if(a[i]=='I')num[i]=1;
if(a[i]=='V')num[i]=5;
if(a[i]=='X')num[i]=10;
if(a[i]=='L')n... | #include <iostream>
using namespace std;
int convert( char c )
{
switch ( c )
{
case 'I': return 1;
case 'V': return 5;
case 'X': return 10;
case 'L': return 50;
case 'C': return 100;
case 'D': return 500;
case 'M': return 1000;
}
}
int main( void )
{
string i... | 1 |
#include <bits/stdc++.h>
#define re register
#define SIZE 10005
#define LL long long
#define MOD 1000000007
using namespace std;
string k;
int d;
int maxn[SIZE],cnt;
LL dp[SIZE][105];
inline LL dfs(int pos,int sta,bool lim)
{
if(pos>cnt)
return sta==0?1:0;
if(!lim && dp[pos][sta]!=-1)
return dp[pos][sta];
int u... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | 0 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m&&!(n==0&&m==0)){
int scores[1001];
vector<int> comb;
for(int i = 0; i < n; i++){
cin>>scores[i];
}
scores[n]=0;
for(int i = 0; i < n+1; i++){
for(int j = 0; j < n+1; j++){
int ... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
int n,m;
ll x,sum,ans;
map<ll,int>mmp;
int main()
{
scanf("%d%d",&n,&m);
s... | #include<bits/stdc++.h>
using namespace std;
int n,q;
int c[500005],pre[500005],ans[500005];
vector<pair<int,int>> qs[500005];
int bit[2000005];
int sum(int pos){
int res=0;
while(pos>0){
res+=bit[pos];
pos-=pos&-pos;
}
return res;
}
void add(int pos,int val){
while(pos<=n){
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i<k;i++)
int w,h,xs,ys,xg,yg,n;
int m[102][102];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool DFS(int x,int y,int c){
if(m[x][y]!=c)return false;
if(x==xg && y == yg)return true;
m[x][y]=-1;
bool ans =false;
rep(i,0,4){
ans ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
... | 0 |
#include<stdio.h>
#define N 8
#define FREE -1
#define NOT_FREE 1
int row[N],col[N],dpos[2*N-1],dneg[2*N-1];
int x[N][N];
void initialize(void);
void printBoard(void);
void recursive(int);
int main(){
int i,j;
initialize();
for( i = 0 ; i < N ; i++ ){
for(j = 0 ; j < N ; j++ ){
x[i][j] = 0;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
... | 1 |
#include<stdio.h>
#include<string.h>
#define N 8
int board[N][N];
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_13_A -- backtracking
//chech previous part but there are fixed point before that
//so check all of them
bool safe(int row, int col){
//chec the column
if(board[row][col]==1) return true;
... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
int V, E, Q, a, b;
vector<int> G[100001];
vector<int> rG[100001];
vector<int> vs;
bool used[100001];
int cmp[100001];
auto dfs(int v) -> void {
used[v] = true;
for (int i = 0; i < G[v].size(); ++i)
if (!used[... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <string>
#include <cstring>
#include <numeric>
#include <iomanip>
using namespace std;
//
const int inf=1e9+7;//0x3f
//
struct UnionFind{
//
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int MAX_N = 1e5+20;
int n;
int a[MAX_N],b[MAX_N],c[MAX_N];
int Q, K;
int x[MAX_N], y[MAX_N];
struct edge { int to, cost; };
vector<edge> G[MAX_N];
ll dist[MAX_N];
void add_edge(int from, int to, int cost)
{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 100010
#define INFTY 1e18
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
struct edge{ll to, cost;};
ll n;
ll dist[MAX];
bool check[MAX];
vector<edge> G[MAX];
void dijkstra(ll s)
{
priority_queue<P, vector<P>, grea... | 1 |
#include<iostream>
#include <climits>
#include<vector>
#include<list>
#include<numeric>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long l... | #include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ... | 0 |
#include <iostream>
#include <cstring>
using namespace std;
int main() {
string teks;
getline(cin,teks);
int n=teks.size();
for (int i=n-1; i>=0; i--) {
cout << teks[i];
}
cout << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
string input;
int num = 0;
int i = 0;
int count = 0;
char temp[1];
cin >> input;
num = input.size();
char str[num]; //= input.toCharArray();
sprintf(str,"%s",input.c_str());
if(num ... | 1 |
#include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
int N;
cin>>N;
vector<int>A(N);
rep(i,N)cin>>A[i];
sort(A.begin(),A.end());
int ans=0;
rep(i,N){
rep(j,i){
rep(k,j){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cout << #x << '=' << x << '\n'
const long long MOD=1e9+7;
//const long long MOD=998244353;
const int INF=1e9;
const long long... | 0 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
#define REP... | #include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
#define INF 1000000000
int main(){
int n,m,flg;
ll a,b,c;
while(cin >> n >> m && n && m){
vector<P> node[101];
for(int k=0;k<m;k++){
cin >> flg;
if(flg){
cin >> a >> ... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define MN 505
using namespace std;
typedef long long ll;
int n,pr[MN<<2],tt;bool p[MN*MN];
ll a[MN][MN];
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
int main(){
scanf("%d",&n);
for(int i=2;i<=1e5;i++){
if(!p[i]){
pr[++tt]=i;
if(... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=502;
int n,ar[N][N],lis[1006],dx[]={0,0,-1,1},dy[]={-1,1,0,0},ar1[N][N];
bool check(int x,int y){
if(x>0&&x<=n){
if(y>0&&y<=n){
return true;
}
}
return false;
}
bool check1(int x){
int i;
for(i=2;i*i<=x;i++){
... | 1 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef set<int> si;
typedef set<string> ss;
typedef map<int,int> mii;
typedef map<string,int>msi;
typedef map<string,string>mss;
void solve(){
string inp,weeks[7];
we... | 0 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
... | #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;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 99824... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b;... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
using namespace std;
#define maxn long long(5*1e8)
int main(){
long long n=0;
scanf("%d",&n);
map<long long,long long,greater<long long>> num;
for(long long i=1;i<=n;++i){
long long temp=0;
scanf("%d",&temp);
num[temp]... | 1 |
#include <algorithm>
#include <cstdio>
#define upd(x, y) (x) = std::max(x, y)
char str[105];
int dp[105][105][105][105], row_pre[105][105], col_pre[105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
const int N=110, M=5e3+300;
int h,w,F[M][M],idh[N][N],idw[N][N];
char mp[N][N]; int stx,sty,s[N][N];
inline int& f(int l,int r,int u,int d) {return F[idh[l][r]][idw[u][d]];}
inline int getarea(int xc1,int xc2,int yc1,int yc2) {
return s[xc2][yc2]-s[xc1-1][yc2]-s[xc2][y... | 1 |
#include <iostream>
#include <cmath>
int n;
int cnt(int i){
if(i == 1) return 1;
if(i == 2) return 2;
if(i == 3) return 4;
return cnt( i-3 ) + cnt( i-2 ) + cnt( i-1 );
}
int main(void){
while(1){
std::cin >> n;
if(n == 0) return 0;
std::cout << std::ceil(cnt(n) / 10.0 / 365.0) << std::endl;
}
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;
int main(){
int N;
while(cin>>N,N){
int dp[31] = {}; dp[... | 1 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int l, r, i, j, ans;
scanf("... | #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() {
int x,... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int t = 1; //cin >> t;
while(t--){
int n; cin >> n;
map<int,int> mp;
while(n--)
{
int x; cin >> x;
if(mp[x] == 0)
mp[x] = 1;
else mp[x] = 0;
}
int ans = 0;
for(aut... | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
size_t isort(vector<int> &A, size_t g) {
size_t count_=0;
for (size_t i=g; i<A.size(); ++i) {
int v=A[i], j;
for (j=i-g; j>=0&&v<A[j]; j-=g) {
A[j+g] = A[j];
++count_;
}
A[j+g]... | 0 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
stat... | #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=1... | 0 |
#include<stdio.h>
#include<map>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
P s[101];
int r[100];
int main(){
int n;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)s[i]=P(0,i);
for(i=0;i<n*(n-1)/2;i++){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
a--;b--;
if(c>d)s[a].first+=3;
if(c<d)s... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 |
#include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=100005;
int n,a[5][N],i,j,k,x,y,b[N],c[2];
int main()
{
scanf("%d",&n);
for(i=1;i<=3;++i)
for(j=1;j<=n;++j)
scanf("%d",a[i]+j);
for(i=1;i<=n;++i)
{
x=y=a[1][i];
for(j=2;j<=3;++j)
x=max(x,a[j][i]),y=mi... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
lli n,x,t;
cin>>n>>x>>t;
lli y = (t*n)/x;
if(y%t==0)
cout<<y<<endl;
else{
y +=t;
cout<<y - y%t<<endl;
}
}
int main()
{
int t;
// cin>>t;
... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod... | 0 |
#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;
... | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n, m;
cin >> n >> m;
char c[n][m];
rep(i, n){
rep(j, m) ci... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int N, S;
vector<pii> P, Q;
vector<int> sol;
int main() {
scanf("%d %d", &N, &S);
for(int i = 0; i < N; i++) {
int x, p; scanf("%d %d", &x, &p);
if(x < S) P.push_back({x, p});
else Q.push_b... | #include <iostream>
using namespace std;
long long p[100001],x[100001],ans=0;
int n,s,l,r;
int main(){
cin>>n>>s;
for (int i=1;i<=n;i++)
cin>>x[i]>>p[i];
l=1;r=n;
while (l<=r){
if (s<=x[l]){
cout<<x[r]-s+ans;
return 0;
}
else if (s>=x[r]){
cout<<ans+s-x[l];
return 0;
} //所有住处都在s的一侧，可以直接开过去
if (... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n, m;
int a[1020], b[1020];
int vote[1020];
int main()
{
while(cin >> n>> m)
{
memset(vote, 0, sizeof vote);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
for(int i=1;i<=m;i++)
{
... | #include<stdio.h>
int main(){
int i,j,x,N,M,a[1000],b,c[1000];
scanf("%d%d",&N,&M);
//syokika
for(i=0;i<1000;i++){
c[i]=0;
}
//
for(i=0;i<N;i++){
scanf("%d",&a[i]);
}
for(i=0;i<M;i++){
scanf("%d",&b);
for(j=0;j<N;j++){
if(a[j]<=b){
c[j]++;
break;
}
}
}
x=0;
for(... | 1 |
#include<iostream>
int power[101];
int motor[101];
int cable[101];
int a, b, c, N;
int la[1024], lb[1024], lc[1024], lr[1024];
void print(){
int i;
for( i = 1; i <= a; i++ ){
std::cout << power[i] << std::endl;
}
for( i = 1; i <= b; i++ ){
std::cout << motor[i] << std::endl;
}
for( i = 1; i <= c; i++ ){
s... | #include <bits/stdc++.h>
#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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Y;
cin >> N >> Y;
int a10000 = -1, b5000 = -1, c1000 = -1;
for(int a = 0; a <= N; a++){
for(int b = 0; a + b <= N; b++){
int c = N - a - b;
int total = 10000*a + 5000*b + 1000*c;
if(Y == total){... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 1 |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
usi... | #include<iostream>
#include<cmath>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
string ans = "-1 -1 -1";
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
int k = N - j - i;
if (k < 0) continue;
if (i * 10000 + j * 5000 + k * 1000 == Y) {
ans = to_string... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string str;
cin>>k;
cin.ignore();
getline(cin,str);
int len = str.length();
if(len>k){
str[k]='.';
k++;
str[k] ='.';
k++;
str[k]='.';
for(int i=0;i<k+1;i++)
cout<<str[i];
}
else
cout<<str;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
//cin>>t;
while( t-- )
{
int k;
cin>>k;
string s;
cin>>s;
if( s.size()<=k )
cout<<s;
else
{
for( int i=0 ;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main(){
long long a;
cin>>a;
vector<long long>v(2*a);
for(long long i=0;i<2*a;i++){
cin>>v[i];
}
priority_queue<long long> p(v.begin(),v.end());
long long sum=0;
while(!p.empty()){
p.pop();
... | 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long int n;
cin >> n;
string ans;
do {
ans.push_back(97 + (--n % 26));
n /= 26;
} while (n > 0);
reverse(ans.begin(), ans.end());
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.