code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
using namespace std;
int p = 1000000007;
int log2_p_MAX = 32;
long long felmer(long long a)
{
long long rem[log2_p_MAX];
rem[0] = a%p;
for(int i=1;i<log2_p_MAX;i++)
rem[i] = (rem[i-1]*rem[i-1])%p;
long long res = 1;
long long expo = p-2;
for(int i=0;i<log2_p_MAX;i++){
if(expo%2==1){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
ll ch[3];
for(ll i=0;i<3;i++){
ch[i]=-1;
}
for(ll i=0;i<m;i++){
ll x,z;
cin>>x>>z;
x--;
if(ch[x]==-1){
ch[x]=z;
}
else{
if(ch[x]!=z){
cout << -1;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<int> s(M);
vector<int> c(M);
int ans=0;
if(M == 0 && N==1){
cout << "0" << endl;
return 0;
}
for(int i=0; i<M; i++){
cin >> s.at(i) >> c.at(i);
if(N>1 && s.at(i) =... | 1 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
long long min=0,max=0,total=0;
int x,n;
cin >>x;
for (int i=1; i<=x; i++) {
cin >> n;
if(i==1){
min =n;
max=n;
total=n;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1... | 0 |
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
unordered_map<int64_t, int64_t> count;
int64_t sum = 0;
count[sum]++;
rep(i, N) {
int a;
c... | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000000000000LL
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)... | 1 |
//FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define v... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define printp(x... | 0 |
#include <iostream>
#include <fstream>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
int limit(int lim, int exp) {
int res = 0;
for (int i = 0; pow(i,exp) < lim+1; i++) {
res = i;
}
return res;
}
int main(void) {
int e;
cin >> e;
while (e != 0) {
int m = 0;
int res;
int en = e;
... | #include<iostream>
using namespace std;
int e,x,y,MIN,i,j;
int main(){
while(true){
MIN=1<<27;
cin>>e;if(!e){break;}
for(i=0;i*i*i<=e;i++){
for(j=0;j*j+i*i*i<=e;j++){
MIN=min(MIN,i+j+e-(i*i*i+j*j));
}
}
cout<<MIN<<endl;
}
} | 1 |
#include <cstdio>
#include <vector>
using namespace std;
int main()
{
int n, q;
scanf("%d", &n);
vector<int> S(n);
for(auto it=S.begin(); it!=S.end(); it++){
scanf("%d", &(*it));
}
S.push_back(-1);
scanf("%d", &q);
int sum=0;
for(int i=0; i<q; i++){
int qq;
... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &rviTrg, vector<int> &rviSch)
{
int iTrgCnt;
cin >> iTrgCnt;
rviTrg.resize(iTrgCnt + 1);
for (int i = 0; i < iTrgCnt; i++)
cin >> rviTrg[i];
int iSchCnt;
cin >> iSchCnt;
rviSch.resize(iSchCnt);
for (int i = 0; i... | 1 |
#include <iostream>
using namespace std;
char c[55][55];
int H, W, cnt;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> c[i][j];
}
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (c[i][j] == '#' && c[i][j - 1] != '#' && c[i - 1][j] != '#' &&... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
constexpr double PI = acos(-1);
cout << fixed << setprecision(16);
cin.tie(0); ios::sync_with_stdio(false);
ll n;
cin >> n;
ll v[] = {101,131,151,181,191,211,241,251,271,28... | #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,int>;
int main(){
string S;
cin >> S;
vector<bool> alpha(26);
int N = S.size();
string s = "abcdefghijklmnopqrstuvwxyz";
rep(i,N){
alpha[S[i] - 'a'] = true;
}
rep(i,26){... | 0 |
#include<cstring>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;//往左走w-1,往下走h-1
const ll mod=1000000007;
ll f[1000000];
ll quick(ll a,ll b)
{
// cout<<"a"<<a<<"b"<<b<<endl;
ll ans=1;
while(b)
{
if(b&1)
{
ans=(ans*a)%mod;
}
b>>=1;
a=(a*... | #include<bits/stdc++.h>
#define reg register
#define F(i,j,k) for(reg int i=j;i<=k;++i)
#define dF(i,j,k) for(reg int i=j;i>=k;--i)
using namespace std;
typedef long long ll;
int n,k;
const int mod=998244353;
const int MN=2005;
int C[MN<<1][MN<<1],pw[MN<<1];
inline ll solve(int i,int n){
reg int k2=min(k-i/2,(i-1)/2);... | 0 |
#include<iostream>
#include<vector>
#include<string.h>
#include<queue>
using namespace std;
const int N = 1e5 + 7;
string x[3] = { "RGB","GBR","BRG" };
int y[3][N];
int main() {
int n, k;
while (cin >> n >> k) {
cout << n - k + 1 << '\n';
}
return 0;
}
| #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 1 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int n;
while(cin>>n,n)
{
int f[n+1][n+1];
memset(f,0,sizeof(f));
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
cin>>f[i][j];
f[i][n]+=f[i][j];
f[n][j]+=f[i][j];
f[n][n]+=f[i][j];
}
... | 1 |
#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... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main()
{
//ifstream cin("input.txt");
int n, q;
string s;
cin>>n>>q;
cin>>s;... | 1 |
#include<iostream>
#include<map>
#include<vector>
using namespace std;
const int mod=1e9+7;
int modpow(long a,int p){
long res=1;
while(p){
if(p&1) (res*=a)%=mod;
(a*=a)%=mod;
p>>=1;
}
return res;
}
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int x[n];
x[0]=a[0];
for(int ... | #include <bits/stdc++.h>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
main() {
int64_t n;
cin >> n;
int64_t x = 0;
vector<int64_t> xx(n);
for (auto i : irange(0L, n)) {
int64_t aa;
cin >> aa;
x ^= aa;
xx[i] = x;
}
constexp... | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define ll long long
using namespace std;
typedef pair<char,int> pii;
set<ll>mapa;
const int maxv=2300000;
int n,pos[maxv+10],br;
ll primes[maxv],rows[1010],cols[1010],aa[519][510];
vector<ll>a[510][510];
void check(){
ll maxx=LONG_MIN;
ll... | #include<bits/stdc++.h>
#define Fail puts("NO"),exit(0);
#define eps 1e-10
#define maxn 505
#define maxm 4010
#define inf 1000000007
#define mod 998244353
#define pi acos(-1)
#define mp(x,y) make_pair(x,y)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef u... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxx = 110;
const int INF = 1 << 30;
int main()
{
int n, p[maxx], m[maxx][maxx];
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (int i = 1; i <= n; i++)
m[i][i] = 0... | /**
* matrix chain multiplication
* f(n,m) = multiply Mn*M(n+1)*...*M(m-1)*M(m)
* f(n,n) = 1
* r(n)=c(n-1)
* f(n,n+1) = C(n) * R(n) * C(n+1) = c(n) * c(n-1) * c(n+1)
* f(n,k,m) = f(n,k)*f(k+1,m)*C(n)*r(n)*c(k)
* f(n,m) = min(f(n,k,m)
*/
#include <iostream>
#include <cmath>
#include <climits>
using name... | 1 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define num(a) a-'0'
#define maxself(a,b) if(b>a)a=b
#define minself(a,b) if(b<a)a=b;
#define debug(x) cout<<#x<<":"<<x<<" "
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#defi... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | 0 |
#include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define var(type, ...) type __VA_ARGS__; read(__VA_ARGS__);
#ifndef ... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define HMAX 20
#define WMAX 20
using namespace std;
int w,h;
int dd[5]={0,1,0,-1,0};
void dfs_aux(int sx, int sy, int map[WMAX][HMAX],int *min,int count){
rep(r,4){
int nx=sx,ny=sy;
if(map[nx+dd[r]][ny+dd[r+1]]==1)
continue;
while(... | #include <iostream>
#include <algorithm>
using namespace std;
int v[22][22], W, H, turn, m;
void dfs(int h, int w){
if(turn < 11){
turn++;
if(v[h][w+1]==0 || v[h][w+1]==3){
for(int i=1; w+i<W; i++){
if(v[h][w+i]==3 && turn<m){
m = turn;
break;
... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
char ch[1000000];
int main(){
int n;
cin>>n;
... | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = 998244353;
int N, M;
long long dat[2000009];
long long quickpow(long long b, long long e)
{
return e ? ((e & 1 ? b : 1)*quickpow((b*b) % MOD, e >... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
if (s.length() == 2)
{
if (s[0] == s[1])
{
cout << 1 << " " << 2 << endl;
return 0;
}
}
for (int i = 0; i < s.length() - 2; i++)
{
if (s[i] == s[i + 2])
{
cout << i + 1 << " " << i + 3 << ... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#in... | #include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
#include <math.h>
#define MOD 1000000007
using namespace std;
ifstream fin("../data.txt");
int x;
unordered_map<int, long long> factorization(int x) {
unordered_map<int, long long> factors;
while(x % 2 == 0) {... | 0 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int> P;
const int MAX = 120;
int maze[MAX][MAX];
bool come[MAX][MAX];
P s,g;
int W,H,c;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
void init(){
memset(come,false,sizeof(come));
memset(maze,0,sizeof(maze));
}
vo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
char ch[] = "ENWS";
int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};
signed main()
{
int N, M;
while(cin >> N, N) {
... | 0 |
///
// File: grl_1_c.cpp
// Author: ymiyamoto
//
// Created on Thu Oct 19 23:14:36 2017
//
#include <cstdint>
#include <iostream>
using namespace std;
#define SIZE 100
#define INF INT32_MAX
static int64_t graph[SIZE][SIZE];
int32_t main()
{
uint32_t V, E;
cin >> V >> E;
for (uint32_t i = 0; i < V; i++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
map<int, int> m;
multiset<int> v;
for(int i = 0; i < w; i++)
m[i] = i;
for(int i = 0; i < w; i++)
v.insert(0);
for(int i = 0; i < h; i++){
int a, b;
cin >> a >> b;
a--;
... | 0 |
/*
* @Author: Kaizyn
* @Date: 2020-08-29 19:57:44
* @LastEditTime: 2020-08-30 10:24:35
*/
#include <bits/stdc++.h>
// #define DEBUG
using namespace std;
const int N = 2e5+7;
const int INF = 0x3f3f3f3f;
struct SegmentTree {
struct TreeNode {
int l, r, v, lazy;
} tr[N<<2];
void push_down(int i) {
if... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | 0 |
#include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
std::vector<std::string> split(const std::string &str, char sep)
{
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while( std::getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return ... | #include<bits/stdc++.h>
using namespace std;
#define MN 200005
#define LL long long
#define mp make_pair
#define fir first
#define sec second
#define pii pair<int,int>
inline void chkmax(int &a,int b){if(a<b)a=b;}
inline void chkmin(int &a,int b){if(a>b)a=b;}
inline int read(){
int a=0,fh=1;char c=getchar();
wh... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int k, x;
cin >> k >> x;
int l = max(-1000000, x-(k-1));
int r = min(100000, x+(k-1));
... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int K, X;
cin >> K >> X;
for(int i=X-K+1; i<K+X; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct SCC {
int n;
vector<vector<int>>& G;
vector<vector<int>> G_rev;
vector<int> comp, order;
vector<bool> visited;
SCC(vector<vector<int>>& G) : G(G), n(G.size()) {
comp.resize(n, -1);
visited.resize(n);
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
// order_of_key (val): r... | 1 |
#include <iostream>
using namespace std;
int N, Q, tp, a, b, c, d[109][109];
int main() {
while (cin >> N >> Q, N) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j) d[i][j] = 0;
else d[i][j] = 999999999;
}
}
while (Q--) {
cin >> tp;
if (tp == 1) {
cin >> a >> b >> ... | #include <cstdio>
#include <utility>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int n, k;
vector<P> way[128];
int query(int a, int b);
int main()
{
while (scanf("%d %d", &n, &k), n != 0){
for (int i = 1; i <= n; i++) way[i].cl... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
bool f[10] = {};
int num[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++) {
int A;
cin >> A;
f[A] = true;
}
vector<int> dp(N + 1, -1);
dp[0] = 0;
for (int i = 1; i <... | #include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=105;
int n,m,a[maxn],b[maxn];
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch... | 0 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool... | 1 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
... | // https://atcoder.jp/contests/abc077/tasks/arc084_a
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y,z;
cin>>a>>b;
x=a+b;
y=a-b;
z=a*b;
if(x>=y && x>=z)
{
cout<<x<<endl;
}
else if(y>=x && y>=z)
{
cout<<y<<endl;
}
else
{
cout<<z<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
int x=a+b,y=a-b,z=a*b;
int A=max(x,max(y,z));
cout<<A<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define maxn 100005
#define ld long double
ll fastpower (ll b , ll p){
ll k= p%2 ? b : 1 ;
return p==0 ? 1 : k*(fastpower(b*b,p/2));
}
ld dp[305][305][305];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | 0 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll t;
cin >> t;
if(t < 1200)
cou... | #include <iostream>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main(){
int n,m;
cin >> n;
int r1,r2,r3;
for(int i=0; i<999;i++){
m = n;
r1 = (n%10);
n-=r1;
n/=10;
r2 = (n%10);
n-=r2;
n/=10;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s ;
cin >> s ;
int n ;
cin >> n ;
double t=s.size();
string a ;
for(int i=0 ; i<(t/n) ; i++ ){
a+=s.at(0+i*n);
}
cout << a << endl;
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T ... | 1 |
#include<iostream>
using namespace std;
bool search(int);
int q,T[500];
int main(){
int n,S[10000],counter=0;
cin >>n;
for(int i=0 ; i < n ; i++)cin >>S[i];
cin >>q;
for(int i=0 ; i < q ; i++)cin >>T[i];
for(int i=0 ; i < n ; i++)counter+=search(S[i]);
cout <<counter<<endl;
return 0;
}
bool se... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
type... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for(int i = 0; i < A; i++) {
cin >> a.at(i);
}
for(int i = 0; i < B; i++) {
cin >> b.at(i);
}
int ans = 200000;
for(int i = 0; i < M; i++) {
int x, y, c;
ci... | #include<bits/stdc++.h>
using namespace std;
#define N 1001000
#define inf INT_MAX
inline int read()
{
int s=0,w=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){s=s*10+ch-'0';ch=getchar();}
return s*w;
}
int n;
char a[N],b[N];
int pos[N],Ans,cnt,ans[N];
... | 0 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std... | #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){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD... | #include <bits/stdc++.h>
using namespace std;
inline bool isLeapYear(int year) {
return year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
}
inline int countLeapYear(int year) {
return year / 4 - year / 100 + year / 400;
}
inline int getMaxDay(int year, int month) {
const int days[] = {0, 31, 28, 31, 30, ... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
#include<cmath>
typedef long long int ll;
#define VI vector<int>
#define rep(i,a) for(int i=0;i<(a);i++)
int n,m;
using namespace std;
int main(){
while(1){
int num[10]={};
int a=0;
cin>>a;
if(a==0)br... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while (getline(cin, s))
{
string dec = s;
while (true)
{
if (dec.find("the") != -1 || dec.find("this") != -1 || dec.find("that") != -1)
{
cout << dec << endl;
break;
}
for (int i = 0; i < dec.size(); i++)
... | 0 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int LLI;
int main()
{
int a, b, ans = 0;
cin >> a >> b;
int arr[a];
for(int i = 0; i < a; i++)
cin >> arr[i];
sort(arr,arr+a);
for(int i = a - b; i < a; i++)
ans += arr[i];
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.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 chma... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;... | #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... | 1 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
bool sol(vector<int>d1,vector<int>d2){
for(int i=0;i<4;i++){
int tmp1=d1[0];
d1[0]=d1[2], d1[2]=d1[5], d1[5]=d1[3], d1[3]=tmp1;
for(int j=0;j<4;j++){
int tmp2=d1[0];
d1[0]=d1[1], d1[1]... | // ABC 080 B- Harshed Number
/*
各桁の和ってどうプログラムすればええんだ
あ、10で割り続けて、商と余りを考えればいいんだ
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0 ;
cin >> N;
int N2 = N;
while (N != 0) { // Nが0になるまで割り続ける。
sum += N % 10; // 総和を更新して
N /= 10; // Nを更新 N = N / 10 → N /= 10
}
if (N2 % sum =... | 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
using namespace std;
#define REP(i,n) for(int i=0; i... | /**
* created: 27.06.2020 19:04:28
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
#define mod 100... | 0 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <set>
#include <functional>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <stack>
#define MX 1000005
#define INF 1000000005
using namespace std;
typedef long long int ll;
typedef pair <... | #include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5+5;
int N,M,K,Cnt0,Cnt1;
int Fa[MaxN],Size[MaxN],Col[MaxN];
vector<int> To[MaxN];
int Get_Fa(int x){
return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}
bool Check(int u){
int i,v;
for(i=0;i<To[u].size();i++)
if(!Col[v=To[u][i]]){
Col[v]=3-Col[u];
if(!... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M, N || M) {
vector<int> P;
vector<int> v;
for(int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
P.push_back(tmp);
}
P.push_back(0);
for(int i = 0; i < P.size(); i++) {
for(i... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int m, nmin, nmax;
while(cin... | 0 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
//int isalpha(char ch): ch がアルファベットなら true を返す
//int isdigit(char ch): ch が数字なら true を返す
//int islo... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t m,j,l,q=0;
cin>>m;
for(j=1;j*j<=m;j++){
if(m%j==0) l=m/j;
}
while(l>0){
q++;
l/=10;
}
cout<<q<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int a[4];
string key = "0123456789";
for (int i = 0; i < 4; i ++) {
char c;
cin >> c;
for (int j = 0; j < 10; j ++) {
if (c == key[j]) a[i] = j;
}
}
//4桁の数字を1桁ずつに分解
for (int i = 0; i < 1 << 3; i ++) {
int i_ = i;
char c... | #include<bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
//using namespace atcoder;
const ll mod=1000000007;//998244353;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F f... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,b,c;cin>>a>>b>>c;
bool flag=false;
if(a==b){
... | 1 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,k;
ci... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int a[... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define RREP(i,n) for (int i=(n)-1;i>=0;--i)
#define MOD 1000000007
using namespace std;
using ll = long long;
ll solve() {
int H, W;
cin >> H >> W;
vector<int> A(H), B(W);
set<int> As, Bs;
REP(i, H) {
cin >> A[i];
... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#define MAX 30
using namespace std;
string S;
int main(){
while (1) {
int p;
cin >> p;
if (p!=0) {
int stx[MAX],sty[MAX];
for (int i = 0; i<p; i++){
cin >> stx[i] >> sty[i];
}
... | #include <stdio.h>
#include<math.h>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,c;
while(true){
scanf("%d",&n);
if(n == 0)break;
for(int i = 0; i < n; i++){
scanf("%d %d %d",&a,&b,&c);
if(a == 100 || b == 100 || c == 100 || a + b >= 180 || a+b+c >= 240){
printf("A\n");
}else ... | 0 |
/*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ... | /* ALDS1_5_D: The number of inversions */
#include <iostream>
#include <cmath>
const int MAX_VALUE = pow(10, 9);
long long count_and_merge(int A[], int left, int mid, int right) {
int n_left = mid - left;
int n_right = right - mid;
int *L = new int[n_left + 1];
int *R = new int[n_right + 1];
fo... | 0 |
#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... | #include <iostream>
#include <algorithm>
using namespace std;
long long N, X, p, l, c;
long long A[100100];
int main() {
cin>>N;
for(int i=1; i<=N; i++) {
cin>>A[i];
}
sort(A+1,A+N+1);
for(int i=N; i>=1; i--) {
if(A[i]==A[i-1]) {
p=A[i];
c=i-2;
b... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i = 0; i < 5; i++)
cin >> V.at(i);
sort(V.begin(),V.end());
int K;
cin >> K;
if (V.at(4) - V.at(0) > K)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... |
// C - Grid Repainting 2
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
bool grid[52][52];
int main() {
int H, W;
cin >> H >> W;
for (int i=1; i<=H; i++) {
for (int j=1; j<=W; j++) {
char s... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> A(n), B(n), C(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
cin >> C[i];
}
sort(A.begin(), ... | #include <iostream>
#include<algorithm>
using namespace std;
//upper_bound, lower_boundを用いた
//のになぜか通らない・・・
int main(){
int n;
long long a;
if(scanf("%d", &n)==EOF){return 0;}
long long top[n];
long long center[n];
long long down[n];
for(int i = 0; i<n; i++){if(scanf("%lld", &a)==EOF){return 0;} top[i] = a;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second... | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
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;
}
signed main()
{
int a... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
namespace Fread {
const int MAXN=1<<20;
char buf[MAXN],*S,*T;
inline char getchar() {
if (S==T) {
T=(S=buf)+fread(buf,1,MAXN,stdin);
if (S==T) return EOF;
}
return *S++;
}
}
inline int read() {
int x(0),neg(1);
char ch=getchar();
whil... | /*
AuThOr GaRyMr
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
int i,j;
for(;;)
{
cin >> n ;
if(n==0)
break;
int table[12][12]={0};
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cin >> table[i][j] ;
}
}
for(i=0;i<=n;i++)
{
for(j=0;j<=n;j++)
{
if(j!=n)
{
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
while( cin >> n, n ) {
for(int i=0; i<n; i++) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
int ave = (pm + pe + pj) / 3;
if( pm == 100 || pe == 100 || pj == 100 ) cout << 'A' << endl;
else if( (pm + pe) / 2 >= 90... | 0 |
#include <bits/stdc++.h>
using namespace std;
// boost
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
#define int long long
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int n, q, sum[N], total[N], ways;
string s;
bool used[N];
vector<int> vec;
signed main() {
... | 1 |
// template version 1.8
// varibable settings {{{
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 998244353
#define infile "../test/sample-1.in"
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se se... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e4 + 10;
const int MAXD = 1e2 + 10;
const int MOD = 1e9 + 7;
vector<int> digitos;
string s;
int N,D;
ll dp[MAXN][2][MAXD];
ll solve(int pos,int flag,int resto){
if(pos == N) return (resto == 0);
if(dp[pos][flag][resto] != ... | 0 |
#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... | /*-- ILSH --*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector < int >
#define vll vector < ll >
#define dt cout<<"HERE\n";
#define pii pair < int , int >
#define pll pair < ll , ll >
#define... | 0 |
#include <iostream>
#include <string>
#include <stddef.h>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main() {
double x1, x2, y1, y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define REP3(i, m, n) for(int i = m, i##_len=(n);i < i##_len;i++)
#define FORVEC(i, v) for(int i = 0;i < v.size();i++)
#define INF 1000000000
#define pb(a) push_back(... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);
#define mem(a,v) memset(a,v,sizeof(a))
const ll INF=... | 1 |
//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
//My i/o stream
str... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string>s(N);
for(int i=0; i<N; i++)cin >> s.at(i);
cin >> M;
vector<string>t(M);
for(int i=0; i<M; i++)cin >> t.at(i);
int red =0;
int blue=0;
int money = 0;
sort(s.begin(), s.end());
sort(t.begin(), t.end(... | 0 |
#include <bits/stdc++.h>
using namespace std;
// cout << (char)(z + 1);
int main(){
string S;
int frag;
cin >> S;
for (char c = 'a'; c != '{'; c = (char)(c + 1)){
frag = 0;
for (int i = 0; i < S.size(); i++){
if(S.at(i) == c){
frag = 1;
}
}
if(frag == 0){
cout << c <<... | #include<iostream>
#include<string>
#include<iterator>
std::string reverse_str(std::string str);
int main()
{
std::string str;
while (std::cin >> str)
{
str = reverse_str(str);
std::cout << str << std::endl;
}
return 0;
}
std::string reverse_str(std::string str)
{
std::string str_ans;
for (unsigned long i... | 0 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
vector<ll> value; // ノードの値を持つ配列
ll N; // 葉の数
void update(ll i, ll x) {
// i 番目の葉の値を x に変える
i += N - 1; // i 番目の葉のノード番号
value[i] += x;
while (i > 0) {
i = (i - 1) / 2; // ノード i の親ノードの番号に変える
val... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define MAX_N 1000
using namespace std;
int p[MAX_N + 1];
vector<int > lat;
int N;
int M;
int solve(){
int res = 0;
int fake;
sort(p,p + N + 1);
for(int i = 0;i <= N;i++){
for(int j = i;j <= N;j++){
lat.push_back(p[i] + p[j]);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int R;
cin >> R;
if (R<1200) {
cout << "ABC" << endl;
}
else if (R<2800) {
cout << "ARC" << endl;
}else {
cout << "AGC" << endl;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (a); i < (int)(b); i++)
#define pw(x) (1LL<<(x))
static const int fast_io = [](){io... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define int long long int
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define se second
#define fi first
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
const int inf = 0x3f3f3f3f;
const int mod = 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ll long long
#define ld long double
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
int n=s.size();
bool a=false;
rep(i,n-1){
if(s.at(i)=='A' && s.at(i+1)=... | 0 |
#include <cstdio>
#include <cstdlib>
using namespace std;
template <class Type>
class Bit {
public:
Bit(int n) : size(n + 1) {
bit = (Type *)calloc(size, sizeof(Type));
}
~Bit() {
free(bit);
}
void add(int x, Type value) {
for (x++; x < size; x += x & -x) bit[... | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using Graph=vector<vector<ll>>;
int main(){
ll n,t;cin>>n>>t;
vector<ll> ti(n);
rep(i,n)cin>>ti[i];
ll c=t;
for(int i=n-1;i>0;--i){
c+=min(t,ti[i]-ti[i-1]);
}
cout<<c;
} | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI n, t, tmp, next, ans;
cin >> n >> t >> tmp;
ans = t;
for(int i = 1; i < n; i++)
{
cin >> next;
if( next - tmp >= t )
ans += t;
else
ans += next - tmp;
tmp = next;
}
cout <<... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a,... | #include <iostream>
using namespace std;
int main(void){
int cd=0;
char c;
for (int i=0; i<3; i++){
cin >> c;
cd = (cd<<1) | (c=='R'?1:0);
}
cout << (cd["01121123"]) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
vector<ll> x(5);
rep(i,5) cin >> x[i];
ll k; cin >> k;
if(x[4]-x[0]>k)... | /** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
**/
#include<bits/stdc++.h>
using namespace std;
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#defi... | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int h,w,a,b;
scanf("%d %d %d %d", &h, &w, &a, &b);
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if( (2 * i - 2 * b + 1) * (2 * j - 2 * a + 1... | #include<bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("gymnastics.in","r",stdin );
#define outF freopen("... | 0 |
#include<bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;//cost, vertex
struct edge{
int to, cost;
};
int main(int argc, char *argv[]){
int n, m, r;
cin >> n >> m >> r;
vector<vector<edge> > g(n);
int from;
for (int i = 0; i < m; i++) {
edge e;
cin >> from >> e.t... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,a,b) for(int i=(a),_end_=(b);i<=_end_;i++)
#define DREP(i,a,b) for(int i=(a),_end_=(b);i>=_end_;i--)
#define EREP(i,u) for(int i=start[u];i;i=e[i].next)
#define fi first
#define se second
#define mkr(a,b) make_pair(a,b)
#define SZ(A) ((int)... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
map<int,int> mp;
while(N--){
int a;
cin>>a;
mp[a]++;
}
int ans=0;
for(auto p:mp)
if(p.second%2)ans++;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,x;
cin>>n;
vector <int> v;
for (int i=0;i<n;i++){
cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
/*
for(int i=0;i<n;i++){
cout<<v[i]<<" ";
}
*/
int duplicate=0,no=0;
for (int i=0;i<n;){
if (v[i]==v[i+1]){
duplicate++;
i+=2;... | 1 |
// link here :
#include <bits/stdc++.h>
using namespace std;
#define NAME "S - Digit Sum"
#define show(x) cout << (#x) << " is " << (x) << endl
#define ll long long
#define ms(arr,val) memset(arr,val,sizeof(arr))
#define len length()
const int mod = 1e9 + 7;
void addmod(ll &x, ll val){
x+=val;
if (x>mod) x-=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9+7;
int n, d;
vector<int> a;
ll mult(ll a,ll b){return ((a%mod)*(b%mod))%mod;}
ll add(ll a,ll b){return ((a%mod)+(b%mod))%mod;}
ll ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int m;
cin >> m;
ll ans = 0, lst = 0, d, c;
vector<ll> nxt = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};
for... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;
const int maxn=2e5+7;
const ll modn=1e9+7;
const int inf=2e9+7;
const ll INF=1000000000000000000ll;
const double PI = acos(-1.0);
const double eps=1e-8;
inline int lo... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll par[314514];
ll ran[314514];
ll n=314514;
ll root(ll x){
return par[x]==x?x:par[x]=root(par[x]);
}
void unite(ll x,ll y){
x=root(x);
y=root(y);
if(x==y)return;
if(ran[x]<ran[y])par[x]=y;
else{
par[y]=x;
if(ran[x]==ran[y])ran[x]++;
}
}
str... | #include <bits/stdc++.h>
using namespace std;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREP... | 1 |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,i,j,res = 0,temp;
cin >> n;
long long int a[n];
for(i = 0;i<n;i++) {
cin >> a[i];
if(i>0){
temp = a[i] - a[i-1];
if(temp < 0) {
res += (-1 * temp);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long sum=0;
int n;
cin>>n;
int mx;cin>>mx;n--;
while(n--){
int a;
cin>>a;
sum+=max(0,mx-a);
mx=max(mx,a);
}
cout<<sum;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int n=1,A=0,B=0;
while(n!=0){
cin>>n;
if(n==0){break;}
for(int i=0;i<n;i++){
int ap=0,bp=0;
cin>>ap;
cin>>bp;
if(ap<bp){
B=B+ap+bp;
}
if(ap>bp){
... | #include<bits/stdc++.h>
using namespace std;
#define For(start,end) for(int i = (int)start;i<(int)end;i++)
using Int = long long int;
int main(){
set<int>paper;
int N;
cin >> N;
For(0,N)
{
int before_size=paper.size();
int tmp;
cin>>tmp;
paper.insert(tmp);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define REP3(i, m, n) for(int i = m, i##_len=(n);i < i##_len;i++)
#define FORVEC(i, v) for(int i = 0;i < v.size();i++)
#define INF 1000000000
#define pb(a) push_back(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll; //10^19 < 9223372036854775807
typedef unsigned long long ull; //10^20 < 18446744073709551615
int main(){
int n;cin>>n;
vector<int> p(n);
rep(i,n) cin>>p.at(i);
int ans=0;
int min=p.at(0);
for... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, x;
cin >> N >> x;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
int ans = 0;
for(int i = 0; i < N; i++){
x -= A.at(i);
if(x < 0){
break;
... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;... | 0 |
#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 ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) co... | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
vector<int> ab(2);
rep(i, 2) cin >> ab[i];
cout << ab[0] * ab[1] << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
int main(){
int a,b;
cin>>a>>b;
cout<<100<<' '<<100<<endl;
string s1(100,'#'),s2(100,'.');
a--; b--;
rep(i,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using product = pair<ll,ll>;
using graph = vector<vector<ll>>;
using vll = vector<ll>;
template <class type> void printVector(vector<type> vec){
stringstream ss;
for(ll i=0;i<vec.size();i++)
{
ss<<vec[i]<<" ";
if(i!=vec.siz... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int x = N / 111;
if(N % 111 !=0) x++;
printf("%d\n",x * 111);
return 0;
} | // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include ... | 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
string A, B, C;
cin >> A >> B >> C;
string next;
next.push_back( A[ 0 ] );
int a{}, b{}, c{};
while( true )
{
if( next == "a" )
{
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
const int MN = 100010;
using D = double;
int ... | #include<vector>
#include<iostream>
using namespace std;
string solve(){
vector<int> a;
for(int i=0;i<3;i++){
int tmp;
cin>>tmp;
a.push_back(tmp);
}
for(int i=0;i<a.size();i++){
if(a[i]==100)return "A";
}
if(a[0]+a[1]>=90*2)return "A";
int ave = (a[0]+a[1]+a[2])/3;
if(ave>=80)return "... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int w;
cin >> w;
int i=0;
while(i<s.length()){
cout << s[i];
i += w;
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int main(){
// 1. 入力情報.
char c[2020];
int w;
scanf("%... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
string v;
cin >> N >> v;
vector<in... | //
// Created by hide on 2020/05/15.
//
//参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
//インクルード(アルファベット順,bits/stdc++.hは使わない派閥)
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#includ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main(){
ll n;cin >>n;
ll o;cin >>o;
bool flg=true;
if(o!=0){
flg=false... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W, B = 0;
cin >> H >> W;
vector<int> color(H * W);
vector<vector<int>> grid(H * W);
for (int i = 0; i < H; i++) {
string S;
cin >> S;
for (int j = 0; j < W; j++) {
color.at(i * W + j) = S.at(j);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll h,w;
cin >> h >> w;
char c[h][w];
ll dist[h][w];
ll ans=0;
rep(i,h){
rep(j,w){
cin >> c[i][j];
dist[i][j]=-1;
if(c[i][j]=='.'){
ans++;
}
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.