code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
long long n,m=0,sum=1000,r=0;
long long num[100];
cin>>n;
for(int i=0;i<n;i++)
cin>>num[i];
for(int i=0;i<n-1;i++)
{
if(m==0)
{
if(num[i]<num[i+1])
{
m=sum/num[i];
sum=sum-m*num[i];
}
}
else if(m>0)
{
if(num[i]<=num[i+1])
continue;
else if(num[i]>num[i+1])
{
sum=m*num[i]+sum;
m=0;
}
}
}
if(m>0)
sum=sum+m*num[n-1];
cout<<sum<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, std::vector<std::vector<T>>(d2, std::vector<int>(d3, initValue)));
#define VECTOR_DIM2(T, name, d1, d2, initValue) \
std::vector<std::vector<T>> name(d1, std::vector<T>(d2, initValue));
#define VECTOR_DIM1(T, name, d1, initValue) \
std::vector<T> name(d1, initValue);
#define ll long long
#define ld long double
int main(){
string s;
cin >> s;
const int n = (int)s.length()+1;
vector<int> nums(n+1, 0);
char basech = '\0';
int basei = 0;
int renzoku = 0;
rep(i,n) {
if (renzoku == 0) {
basech = s[i];
basei = i;
renzoku = 1;
} else if (basech == s[i]) {
++renzoku;
} else {
if (basech == '<') {
nums[basei] = max(nums[basei], 0);
for(int j=1;j<=renzoku;++j) {
nums[basei+j] = j;
}
} else {
nums[basei] = max(nums[basei], renzoku);
for(int j=1;j<=renzoku;++j) {
nums[basei+j] = renzoku-j;
}
}
basech = s[i];
renzoku = 1;
basei = i;
}
}
ll sum = accumulate(nums.begin(), nums.end(), 0L);
cout << sum << endl;
return 0;
}
| 0
| 5,483,567
|
#include <bits/stdc++.h>
using namespace std;
int main() {int N;
cin>>N;
string S[N];
int t[N];
int i=0;
while(i<N){cin >> S[i] >> t[i];
i++;}
string x;
cin>>x;
int sum=0;
for(int j=0;j<N;j++){
if(x==S[j]){
for(int k=j+1;k<N;k++){sum +=t[k];}
break; }
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)x.size()
#define eb emplace_back
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("io\\in.txt", "r", stdin);
freopen("io\\out.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ret = 0;
const int mod = 1000000007;
rep(i, 60) {
int cnt0 = 0, cnt1 = 0;
rep(j, n) if (a[j] >> i & 1) cnt1++; else cnt0++;
ret = (ret + (1ll << i) % mod * cnt0 % mod * cnt1) % mod;
}
cout << ret;
return 0;
}
| 0
| 33,725,115
|
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
#define double long double
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _set(x) __builtin_popcount(x)
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
#define dpv(...) cerr<< "["#__VA_ARGS__ " : ";for(int i: (__VA_ARGS__)){cerr<<i<<" ";}cerr<<"]\n"
const int maxN= 105;
const int INF = 1e9;
int dp[maxN][maxN];
bool g[maxN][maxN];
void solve(){
int h,w;
cin>>h>>w;
char c;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c;
g[i][j]=(c=='#')?0:1;
dp[i][j]= INF;
}
}
dp[0][0]= g[0][0]?0:1;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
dp[i+1][j] = min(dp[i+1][j],(g[i][j] && !g[i+1][j])? dp[i][j]+1: dp[i][j] );
dp[i][j+1] = min(dp[i][j+1],(g[i][j] && !g[i][j+1])? dp[i][j]+1: dp[i][j] );
}
}
cout<<dp[h-1][w-1]<<"\n";
}
int32_t main(){
IOS
int _;
_=1;
while(_--){
solve();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
string num;
while(cin >> num){
if(num == "0"){
break;
}else{
int sum = 0;
for(int i = 0; i < num.length(); i++){
sum = (num[i] - '0') + sum;
}
cout << sum << endl;
}
}
return 0;
}
| 0
| 26,616,923
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, 0,-1};
const int dx[]={ 0, 1,1,1,0,-1,-1,-1};
int dec(string s)
{
int coe=1,res=0;
for(int i=0;i<s.size();i++){
if('0'<=s[i] && s[i]<='9') coe=s[i]-'0';
else{
switch(s[i]){
case 'm': res+=1000*coe; break;
case 'c': res+=100*coe; break;
case 'x': res+=10*coe; break;
case 'i': res+=coe; break;
}
coe=1;
}
}
return res;
}
string enc(int x)
{
stringstream s;
int coe=x/1000;
if(coe==1) s<<"m";
else if(coe>1) s<<coe<<"m";
x%=1000;
coe=x/100;
if(coe==1) s<<"c";
else if(coe>1) s<<coe<<"c";
x%=100;
coe=x/10;
if(coe==1) s<<"x";
else if(coe>1) s<<coe<<"x";
x%=10;
coe=x;
if(coe==1) s<<"i";
else if(coe>1) s<<coe<<"i";
return s.str();
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
string s1,s2;
cin>>s1>>s2;
cout<<enc(dec(s1)+dec(s2))<<endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <climits>
#include <cstring>
using namespace std;
int flip=0, h, w, mp[105][105];
char board[105][105];
bool inside(int r, int c){
return r<=h && c<=w;
}
int dp(int r, int c){
int sum =0;
if(r==h && c==w){
if(board[h][w]=='#'){
sum=1;
}
return sum;
}
else if(mp[r][c]!=-1){
return mp[r][c];
}
int result = INT_MAX;
int dx[] ={0, 1};
int dy[] ={1, 0};
for(int i=0; i<2; i++){
int nextRow = r + dx[i];
int nextCol = c + dy[i];
if(!inside(nextRow, nextCol))continue;
else if(board[r][c]=='.')flip = dp(nextRow, nextCol);
else if(board[r][c]=='#' && board[nextRow][nextCol]=='#')flip = dp(nextRow, nextCol);
else if(board[r][c]=='#' && board[nextRow][nextCol]=='.')flip = dp(nextRow, nextCol) + 1;
result = min(result, flip);
mp[r][c]=result;
}
return result;
}
int main(){
memset(mp, -1, sizeof(mp));
cin >> h >> w;
for(int i=1; i<=h; i++){
for(int j=1; j<=w; j++){
cin >> board[i][j];
}
}
cout << dp(1, 1) << endl;
return 0;
}
| 0
| 49,863,528
|
#include <iostream>
using namespace std;
int n,m,p;
int mem[101];
int main(){
while(cin >> n >> m >> p, n || m || p){
int sum = 0;
for(int i = 1; i <= n ; i++){
cin >> mem[i];
sum += mem[i];
}
sum *= 100;
if(mem[m]==0)cout << 0 << endl;
else {
sum = sum * (100-p)/100;
cout << (int)(sum / mem[m]) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define show(x) for(auto i: x){cout << i << " ";}
#define showm(m) for(auto i: m){cout << m.x << " ";}
typedef long long ll;
typedef pair<int, int> P;
#define N_MAX 305
vector<vector<ll>> dp(N_MAX, vector<ll>(N_MAX, MOD*(ll)N_MAX));
int main()
{
int n, k;
cin >> n >> k;
vector<ll> h;
h.push_back(0);
rep(i, n){ int tmp; cin >> tmp; h.push_back(tmp);}
rep(i,n) dp[i][0] = 0;
rep(i,n+1) dp[i][1] = h[i];
for (int x = 1; x <= n; x++)
{
for (int y = 2; y <= n; y++)
{
for (int i = y-1; i <= x-1; i++)
{
dp[x][y] = min(dp[x][y], dp[i][y-1]+max((ll)0, h[x]-h[i]));
}
}
}
ll ans = MOD*N_MAX;
for (int x = 1; x <= n; x++)
{
if (x < n-k) continue;
ans = min(ans, dp[x][n-k]);
}
cout << ans << endl;
}
| 0
| 56,446,799
|
#include<iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
if(n%m == 0) cout << 0;
else {
cout << 1;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
string s,t;
cin>>s>>t;
int ctr=0;
for( int i=0 ; i<s.size() ; i++ )
if( s[i]!=t[i] )
ctr++;
cout<<ctr;
}
return 0;
}
| 0
| 24,458,935
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int,int>
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define extract_word(s) stringstream str(s); while(str>>word)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define SET(s) cout<<fixed<<setprecision(s)
#define chotu 1000000007
#define set0(a) memset(a,0,sizeof(a))
#define endl "\n"
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define lower_string(s) transform(all(s),s.begin(),::tolower())
#define upper_string(s) transform(all(s),s.begin(),::toupper())
#define size(s) s.size()
template<class T> bool umin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool umax(T &a, T b) { return a < b ? (a = b, true) : false; }
template<typename T,typename U>
bool compare(T x,U y){return(abs(x-y)<=1e-9);}
void solve()
{
fastio
int n;
cin>>n;
cout<<(n*(n+1)/2);
}
int main()
{
fastio
int t;
t=1;
while(t--)
{
solve();
cout<<endl;
}
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void)
{
ll n, k;
cin >> n >> k;
ll ans = 0;
for (int i = 0; i < k; i++)
{
if (i * 3 % k == i)
{
ll tmp = 0;
for (int j = i; j <= n; j += k)
{
if (j)
{
tmp++;
}
}
ans += pow(tmp, 3);
}
}
cout << ans << endl;
}
| 0
| 76,087,715
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n;
cin >> n;
vector<pair<string, ll>> st;
rep(i, n) {
string s;
cin >> s;
st.push_back({s, 1});
}
ll m;
cin >> m;
rep(i, m) {
string s;
cin >> s;
st.push_back({s, -1});
}
sort(st.begin(), st.end());
ll ans = 0, cnt = 0;
rep(i, n + m) {
if (st[i].fi == st[i + 1].fi) {
cnt += st[i].se;
} else {
cnt += st[i].se;
chmax(ans, cnt);
cnt = 0;
}
if (i == n + m - 1 && cnt != 0) chmax(ans, cnt);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
int fin = 1;
int sum = 0;
while((fin*(fin+1))/2 < n){
fin++;
}
stack<int> st;
for(int i = fin;i >= 1;i--){
if(n >= i){
n -= i;
st.push(i);
}
}
while(!st.empty()){
cout << st.top() << endl;
st.pop();
}
return 0;
}
| 0
| 68,416,049
|
#include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
if (a % 3 && b % 3 && (a + b) % 3)
cout << "Impossible" << endl;
else
cout << "Possible" << endl;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int a[N];
long long k;
int main()
{
ios_base::sync_with_stdio(0);
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
long long res = 0, A = 0;
for(int i = 1; i <= n; i++){
long long B = 0;
for(int j = i + 1; j <= n; j++){
A += (a[i] > a[j]);
}
for(int j = 1; j <= n; j++){
B += (a[i] > a[j]);
}
res = (res + B * (k * (k - 1) / 2 % mod)) % mod;
}
cout << (res + A * k) % mod << "\n";
}
| 0
| 26,002,127
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0;
string s;
cin >> n >> s;
for(int i=0;i<1000;i++){
string pass = to_string(i);
if(int(pass.size()) == 1) pass = "00" +pass;
else if(int(pass.size()) == 2) pass = "0" +pass;
auto pos1 = s.find(pass[0]);
if(pos1 == string::npos)continue;
auto pos2 = s.find(pass[1], pos1+1);
if(pos2 == string::npos)continue;
auto pos3 = s.find(pass[2], pos2+1);
if(pos3 == string::npos)continue;
ans++;
}
cout << ans << '\n';
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#define Nil -1
#define maxn 100005
using namespace std;
int n,root;
int dep[maxn];
struct node
{
int parent;
int left_son;
int right_brother;
node():parent(Nil),left_son(Nil),right_brother(Nil) {}
};
node t[maxn];
void build()
{
for(int i=0; i<n; ++i)
{
int num,ns,l;
scanf("%d%d",&num,&ns);
for(int j=0; j<ns; ++j)
{
int son;
scanf("%d",&son);
if(j==0) t[num].left_son=son;
else t[l].right_brother=son;
l=son;
t[son].parent=num;
}
}
return ;
}
int find_root()
{
int x;
for(int i=0; i<n; ++i)
if(t[i].parent==Nil)
{
x=i;
break;
}
return x;
}
void rec(int num,int d)
{
dep[num]=d;
if(t[num].right_brother!=Nil) rec(t[num].right_brother,d);
if(t[num].left_son!=Nil) rec(t[num].left_son,d+1);
return ;
}
void print(int num)
{
printf("node %d: ",num);
printf("parent = %d, ",t[num].parent);
printf("depth = %d, ",dep[num]);
if(t[num].parent==Nil) printf("root, [");
else if(t[num].left_son==Nil) printf("leaf, [");
else printf("internal node, [");
for(int i=0,c=t[num].left_son;c!=Nil;i++,c=t[c].right_brother)
{
if(i) printf(", ");
printf("%d",c);
}
printf("]\n");
}
int main()
{
scanf("%d",&n);
build();
root=find_root();
rec(root,0);
for(int i=0; i<n; ++i)
print(i);
return 0;
}
| 0
| 58,506,498
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) int x;cin>>x
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b){if(b<a){a=b;return 1;}return 0;}
signed main() {
int n, m;
cin >> n >> m;
int fl[100001];
memset(fl, 0, sizeof(int) * 100001);
int pe = 0;
int ac = 0;
rep(i, m) {
int p; string s;
cin >> p >> s;
if (s == "AC") {
if (fl[p] >= 0) {
++ac;
pe += fl[p];
fl[p] = -1;
}
} else {
if (fl[p] >= 0) ++fl[p];
}
}
cout << ac << " " << pe;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
#define FW freopen("data2.txt", "w", stdout);
template <class T>
inline bool Read(T& ret)
{
char c;
int sgn;
if (static_cast<void>(c = getchar()), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (static_cast<void>(c = getchar()), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
template <class T>
inline void Write(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
Write(x / 10);
putchar(x % 10 + '0');
}
void slove(int quetion_num)
{
string s;
int ans = 0;
cin >> s;
for (auto i : s)
{
ans += (i - '0');
}
if (ans % 9 == 0)
cout << "Yes";
else
cout << "No";
}
int main()
{
int num = 1;
for (int i = 1; i <= num; ++i) {
slove(num);
}
return 0;
}
| 0
| 63,563,167
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 1;
for (int i = 0; i < n - 1; ++i) {
ans += s[i] != s[i + 1];
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
bool isMale() {
string result;
cin >> result;
if (result == "Vacant") {
exit(0);
}
return result == "Male";
}
int main() {
int N;
cin >> N;
int left = 0;
int right = N - 1;
cout << 0 << endl;
bool leftMale = isMale();
while (left < right) {
int mid = (left + right + 1) / 2;
cout << mid << endl;
bool midMale = isMale();
if ((mid - left) % 2 == (leftMale == midMale)) {
right = mid;
} else {
left = mid;
leftMale = midMale;
}
}
}
| 0
| 50,398,060
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<string>
using namespace std;
int main()
{
string S, T; cin >> S;
int i, l;
i = 0;
l = S.size();
S += "zzzzzzzzzz";
while(i < l-1){
if(S.substr(i,6) == "eraser"){
i += 6;
}else if(S.substr(i,5) == "erase"){
i += 5;
}else if(S.substr(i,8) == "dreamerd" || S.substr(i,8) == "dreamere"){
i += 7;
}else if(i == l-7 && S.substr(i,7) == "dreamer"){
i += 7;
}else if(S.substr(i,5) == "dream"){
i += 5;
}else{
cout << "NO";
return 0;
}
if(i > l-5 && i < l-1){
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb(x) push_back(x)
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int di[4] = {1,0,-1,0};
const int dj[4] = {0,1,0,-1};
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
for (int i=1; i<n; i++) {
if (a[i-1]<=a[i]) continue;
ans += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
cout << ans << endl;
}
| 0
| 64,053,381
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
map< int64_t, int > prime_factor(int64_t n) {
map< int64_t, int > ret;
for(int64_t i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
vector< bool > prime_table(int n) {
vector< bool > prime(n + 1, true);
if(n >= 0) prime[0] = false;
if(n >= 1) prime[1] = false;
for(int i = 2; i * i <= n; i++) {
if(!prime[i]) continue;
for(int j = i + i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
template< typename T >
T binomial(int64_t N, int64_t K) {
if(K < 0 || N < K) return 0;
T ret = 1;
for(T i = 1; i <= K; ++i) {
ret *= N--;
ret /= i;
}
return ret;
}
template< typename T >
vector< vector< T > > binomial_table(int N) {
vector< vector< T > > mat(N + 1, vector< T >(N + 1));
for(int i = 0; i <= N; i++) {
for(int j = 0; j <= i; j++) {
if(j == 0 || j == i) mat[i][j] = 1;
else mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j];
}
}
return mat;
}
struct UnionFind {
vector< int > data;
UnionFind(int sz) {
data.assign(sz, -1);
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
data[y] = x;
return (true);
}
int find(int k) {
if(data[k] < 0) return (k);
return (data[k] = find(data[k]));
}
int size(int k) {
return (-data[find(k)]);
}
};
int main(){
double n,m,d;
cin >> n >> m >>d;
double a;
if(d!=0)a=(2*(n-d)/(n*n))*(m-1);
else a=((n-d)/(n*n))*(m-1);
cout << fixed << setprecision(10);
cout <<a <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define llu unsigned long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define tc int test_case; cin >> test_case; while(test_case--)
#define f(i,a,n) for(int i = a ; i < n ; i++)
#define rf(i,n,a) for(int i = n-1 ; i >= a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define get(a,n) f(i,0,n) cin >> a[i];
#define show(a,n) f(i,0,n) cout << a[i] << " "; cout << endl;
#define sp(x) fixed << setprecision(10) << x
#define fast ios:: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define trace(x) cerr << '>' << #x << ':' << (x) << "\n"
#define trace2(x,y) cerr<< '>' << #x << ':' << (x) << " | " << #y << ':' << (y) << "\n"
#define trace3(a,b,c) cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define trace4(a,b,c,d) cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<pii,int> ppi;
typedef vector<pii> vpi;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
const int inf = 1e9;
const ll inf64 = 1e18;
const int mod = inf + 7;
const int N = 1e6 + 10;
int main()
{
fast;
int a, b, c, k;
cin >> a >> b >> c >> k;
ll ans = min(a,k);
k -= min(a,k);
k -= min(b,k);
ans -= min(c,k);
cout << ans;
}
| 0
| 33,522,238
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
#include <string.h>
using namespace std;
int main()
{
int n = 0;
int k = 0;
long long base = 1e9+7;
scanf("%d %d", &n, &k);
if(k == 0){
printf("1\n");
return 0;
}
vector<int> a(n, 0);
for(int i=0; i<n; i++){
scanf("%d", &a[i]);
}
int good_cnt = 0;
for(int i=0; i<n; i++){
if(a[i] > 0){
a[good_cnt] = a[i];
good_cnt++;
}
}
n = good_cnt;
long long arr[n][k+1];
memset(arr, 0, sizeof arr);
for(int j=0; j<k+1; j++){
if(j >= a[0]){
arr[0][j] = a[0]+1;
}else{
arr[0][j] = j+1;
}
}
for(int i=1; i<n; i++){
for(int j=0; j<k+1; j++){
if(j <= a[i]){
arr[i][j] = arr[i-1][j];
}else{
arr[i][j] = (arr[i-1][j] - arr[i-1][j-a[i]-1] + base ) % base;
}
}
for(int j=1; j<k+1; j++){
arr[i][j] = (arr[i][j] + arr[i][j-1]) % base;
}
}
printf("%lld\n", (arr[n-1][k] - arr[n-1][k-1] + base) % base);
}
|
#define MOD 998244353
#include <iostream>
#include <vector>
using namespace std;
long pow(long a, long b) {
if (!b) return 1;
long c = pow(a, b / 2);
if (b % 2) c = a * c % MOD * c % MOD;
else c = c * c % MOD;
return c;
}
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int& i : D) cin >> i;
if (D.front()) {
cout << 0;
return 0;
}
vector<long> a(N);
for (int& i : D) a[i]++;
if (a.front() != 1) {
cout << 0;
return 0;
}
while (!a.back()) a.pop_back();
long ans = 1;
for (int i = 1; i < a.size(); i++) {
ans *= pow(a[i - 1], a[i]);
ans %= MOD;
}
cout << ans;
}
| 0
| 59,641,930
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
int main() {
int W, H, N; cin >> W >> H >> N;
vector<int> x(N), y(N), a(N); REP(i, N) cin >> x[i] >> y[i] >> a[i];
vector<int> x_vec(W), y_vec(H);
REP(i, W) x_vec[i] = 0;
REP(i, H) y_vec[i] = 0;
for(int i = 0; i < N; ++i) {
if(a[i] == 1) {
for(int k = 0; k < x[i]; ++k) {
x_vec[k] = 1;
}
}
if(a[i] == 2) {
for(int k = x[i]; k < W; ++k) {
x_vec[k] = 1;
}
}
if(a[i] == 3) {
for(int k = 0; k < y[i]; ++k) {
y_vec[k] = 1;
}
}
if(a[i] == 4) {
for(int k = y[i]; k < H; ++k) {
y_vec[k] = 1;
}
}
}
int res_x = 0, res_y = 0;
for(int i = 0; i < W; ++i) {
if(x_vec[i] == 0) res_x++;
}
for(int i = 0; i < H; ++i) {
if(y_vec[i] == 0) res_y++;
}
cout << res_x * res_y << endl;
}
|
#include <iostream>
using namespace std;
int main(void) {
int a[3];
bool flag = true;
int i = 0;
for(int i = 0; i < 3; i++) {
cin >> a[i];
}
while(i != 2) {
if(a[i] >= a[i + 1]) {
flag = false;
}
i++;
}
if(flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 78,113,628
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
int main() {
ll N;
scanf("%lld", &N);
char s[101010];
scanf("%s", s);
vector<vector<char>> dp(N + 1, vector<char>(4, 0));
dp[0][0] = 'S';
dp[0][1] = 'S';
dp[0][2] = 'W';
dp[0][3] = 'W';
dp[1][0] = 'S';
dp[1][1] = 'W';
dp[1][2] = 'S';
dp[1][3] = 'W';
for (ll i = 2; i < N + 1; i++) {
for (ll j = 0; j < 4; j++) {
ll count = 0;
if (dp[i - 2][j] == 'S') {
count++;
}
if (dp[i - 1][j] == 'S') {
count++;
}
if (s[i - 1] == 'o') {
count++;
}
dp[i][j] = (count % 2 == 0) ? 'W' : 'S';
}
}
for (ll j = 0; j < 4; j++) {
if (dp[N][j] == dp[0][j]) {
ll count = 0;
if (dp[N - 1][j] == 'S') {
count++;
}
if (dp[0][j] == 'S') {
count++;
}
if (dp[1][j] == 'S') {
count++;
}
if (s[0] == 'o') {
count++;
}
if (count % 2 == 0) {
for (ll i = 0; i < N; i++) {
printf("%c", dp[i][j]);
}
printf("\n");
return 0;
}
}
}
ll result = -1;
printf("%lld\n", result);
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int d2c[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int dd[8];
int qu[9], aa[9], aa_[9];
int k_, l_;
int c_;
void update(int k, int l) {
if (l_ > l)
return;
for (int h = 0; h < k; h++)
aa[h] = dd[qu[h]];
int m = min(l, 9);
for (int h = k; h < m; h++)
aa[h] = dd[c_];
sort(aa, aa + m, greater<>());
bool better = false;
if (l_ < l)
better = true;
else
for (int h = 0; h < l; h++)
if (aa_[h] != aa[h]) {
if (aa_[h] < aa[h])
better = true;
break;
}
if (better) {
k_ = k;
l_ = l;
for (int h = 0; h < m; h++)
aa_[h] = aa[h];
}
}
void solve(int c, int n, int k) {
while (c > c_ && dd[c] == 0)
c--;
if (c == c_) {
if (n % c == 0) {
int l = k + n / c;
update(k, l);
}
return;
}
for (int h = 0; h < c_; h++) {
solve(c - 1, n, k);
if (n < c || k == 9)
break;
n -= c;
qu[k++] = c;
}
}
int main() {
int n, m; cin >> n >> m;
while (m--) {
int d; cin >> d;
int c = d2c[d];
dd[c] = max(dd[c], d);
}
c_ = 2;
while (dd[c_] == 0)
c_++;
solve(7, n, 0);
m = min(l_, 9);
for (int h = 0; h < m; h++)
if (aa_[h] > dd[c_])
cout << aa_[h];
for (int h = k_; h < l_; h++)
cout << dd[c_];
for (int h = 0; h < m; h++)
if (aa_[h] < dd[c_])
cout << aa_[h];
cout << '\n';
return 0;
}
| 0
| 99,496,506
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a;
cin >> a;
cout << a * a << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
int n, T;
cin >> n >> T;
int t[n];
rep(i, n) {
cin >> t[i];
}
ll ans = 0;
rep(i, n) {
if (i+1 < n) {
ans += min(T, t[i+1] - t[i]);
} else {
ans += T;
}
}
cout << ans << endl;
}
| 0
| 70,317,121
|
#include<iostream>
#include<string>
using namespace std;
int main(){
long long int a[1000000],n,MIN,MAX,SUM;
MIN=100000000;
MAX=-100000000;
SUM=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(MIN>a[i]){
MIN=a[i];
}
if(MAX<a[i]){
MAX=a[i];
}
SUM += a[i];
}
cout<<MIN<<" "<<MAX<<" "<<SUM<<endl;
return 0;
}
|
#include <cstdint>
#include <iostream>
#include <istream>
#include <stack>
using namespace std;
int32_t main()
{
while (true) {
string str;
getline(cin, str);
if (str[0] == '.') break;
stack<char> s;
for (uint32_t i = 0; i < str.size(); i++) {
if (str[i] == '(') {
s.push('(');
} else if (str[i] == ')') {
if (!s.empty() && s.top() == '(') {
s.pop();
} else {
s.push('*');
break;
}
} else if (str[i] == '[') {
s.push('[');
} else if (str[i] == ']') {
if (!s.empty() && s.top() == '[') {
s.pop();
} else {
s.push('*');
break;
}
}
}
if (s.empty()) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
return 0;
}
| 0
| 37,560,698
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(xi, x) for (auto &&xi : x)
template <class T> using vec = vector<T>;
using ll = long long;
using vi = vec<ll>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<ll, ll>;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
template <class T> pair<T, size_t> max(vector<T> &x) {
auto it = max_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> pair<T, size_t> min(vector<T> &x) {
auto it = min_element(all(x));
return mp(*it, it - x.begin());
}
template <class T> inline bool chmax(T &maxval, const T &newval) {
if (maxval < newval) {
maxval = newval;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &minval, const T &newval) {
if (minval > newval) {
minval = newval;
return 1;
}
return 0;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define inside(H, W, y, x) 0 <= (x) && (x) < (W) && 0 <= (y) && (y) < (H)
#ifdef LOCAL
#include "dump.hpp"
#define debug(x) cerr << #x << ": " << x << '\n'
#else
#define dump(...)
#define debug(x)
#endif
void solve(long long A, long long B, long long K) {
if(A>=K){
A -= K;
} else {
B -= K-A;
B = max(B,0LL);
A = 0;
}
cout << A << " " << B << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long K;
scanf("%lld", &K);
solve(A, B, K);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define aall(a) (a), (a)+countof(a)
#define raall(a) (a), (a)+countof(a), greater<>()
#define show(x) cout<<#x<<" = "<<x<<endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) { if (f) puts("YES"); else puts("NO"); }
#define yns(f) { if (f) puts("Yes"); else puts("No"); }
#define show_ary(...) { cout<<#__VA_ARGS__<<" = "; for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define show_pair(...) cout<<#__VA_ARGS__<<" = "<<endl; for (const auto& x : (__VA_ARGS__)) { cout<<" "<<x.fi<<" : "<<x.se<<endl; }
#define out_ary(...) { for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<tuple<ll, int, int>> ls;
rep(i, n) {
int a, b;
cin >> a >> b;
ls.emplace_back(a+b, a, b);
}
sort(rall(ls));
ll T = 0, A = 0;
bool flg = true;
for (auto x : ls) {
if (flg) T += get<1>(x);
else A += get<2>(x);
flg = flg ^ 1;
}
ll ans = T-A;
cout << ans << endl;
return 0;
}
| 0
| 35,660,311
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int value[220000] = {};
int valueSize = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
value[A]++;
if (value[A] == 1) valueSize++;
}
sort(value, value + 220000);
int i = 220000 - valueSize;
int res = 0;
while (K < valueSize) {
res += value[i];
++i;
--valueSize;
}
cout << res << endl;
}
|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
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) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
vector<P> Edge;
vector<vector<bool>> E(114,vector<bool>(114));
int main() {
int N;cin >> N;
int K;cin >> K;
if((N-1)*(N-2)/2 - K < 0){
cout << -1 << endl;
return 0;
}
for(int i = 2;i<=N;i++){
Edge.push_back(make_pair(1,i));
}
int remain = (N-1)*(N-2)/2 - K;
int plus = remain;
bool escape = false;
for(int i = 2;i<=N;i++){
if(escape) break;
for(int j = 2;j<=N;j++){
if(i == j) continue;
if(remain <= 0){
escape = true;
break;
}
if(!E.at(i).at(j) && !E.at(j).at(i)){
E.at(i).at(j) = true;
E.at(j).at(i) = true;
Edge.push_back(make_pair(i,j));
remain--;
}
}
}
cout << N-1+plus << endl;
for(P V : Edge){
int from = V.first;
int to = V.second;
cout << from << " " << to << endl;
}
}
| 0
| 47,973,148
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
const int MAX_N = 100010;
const double PI = acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) {
cin >> a[i];
}
rep(i, n) {
cin >> b[i];
}
ll cnt = 0;
rep(i, n) {
if (a[i] < b[i]) {
cnt += (b[i] - a[i]) / 2;
}
else if (a[i] > b[i]) {
cnt -= a[i] - b[i];
}
}
if (cnt >= 0) out("Yes");
else out("No");
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
const int MAXN = 1000;
const int MAXK = 4;
int dp[MAXN][MAXK][2];
int main() {
string s;
cin >> s;
int K;
cin >> K;
int n = s.length();
dp[0][0][0] = 1;
rep(i, n) rep(j, 4) rep(k, 2) {
int c = s[i] - '0';
rep(l, 10) {
int ni = i + 1, nj = j, nk = k;
if (l != 0) nj++;
if (nj > K) continue;
if (k == 0) {
if (l < c) nk = 1;
else if (l > c) break;
}
dp[ni][nj][nk] += dp[i][j][k];
}
}
int ans = dp[n][K][0] + dp[n][K][1];
cout << ans << endl;
}
| 0
| 41,866,977
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,s;
cin>>n>>s;
if(n>s)
cout<<"safe";
else
cout<<"unsafe";
return 0;
}
|
#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 pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e18;
int main()
{
ll n,m;
ll d[9]={2,5,5,4,5,6,3,7,6};
cin >> n >> m;
vector<pll> a(m);
rep(i,m){
cin >> a[i].fi;
a[i].se=d[a[i].fi-1];
}
sort(a.rbegin(),a.rend());
vector<ll> dp(n+1,-1);
dp[0]=0;
rep(i,n+1){
if(dp[i]!=-1){
rep(j,m){
if(i+a[j].se<=n){
dp[i+a[j].se]=max(dp[i+a[j].se],dp[i]+1);
}
}
}
}
ll match=n,remain=dp[n];
string ans="";
while(match>0){
rep(i,m){
if(match>=a[i].se && dp[match-a[i].se]==remain-1){
match-=a[i].se;
remain--;
string c=to_string(a[i].fi);
ans+=c;
break;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 71,545,105
|
#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 INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
INT(n);
vector<ll> a(n),b(n);
in(a,b);
ll asum=0,bsum=0,dif1=0;
for(int i=0;i<n;i++){
asum+=a[i];
bsum+=b[i];
if(b[i]>a[i]){
dif1+=updivide(b[i]-a[i],2);
}
}
yn(dif1<=bsum-asum);
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N;
cin >> N;
int T[3];
rep(i,3) cin >> T[i];
vector<int> L(N);
rep(i,N) cin >> L.at(i);
int DP[3][1<<8] = {0};
for(int i = 1; i < 1<<N; i++) {
rep(j, 3) {
int WA = 0, num = 0;
rep(k, N) {
if (1<<k & i) WA += L[k], num++;
}
DP[j][i]= (num - 1) * 10 + abs(T[j] - WA);
}
}
int mi = 1 << 30;
for (int i = 1; i < 1<<N; i++) for (int j = 1; j < 1<<N; j++) if ((i & j) == 0)
for (int k = 1; k < 1<<N; k++) if ((i & k) == 0 && (j & k) == 0) {
mi = min(mi, DP[0][i] + DP[1][j] + DP[2][k]);
}
cout << mi << endl;
}
| 0
| 164,008
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i,n,s) for (int i= (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
ll modpow(ll a, ll b){
ll r = 1;
while(b){
r = r*((b%2)?a:1)%mod;
a = a*a%mod;
b>>=1;
}
return r;
}
ll comb(ll N_, ll C_) {
const int NUM_=1000201;
static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
if (fact[0]==0) {
inv[1]=fact[0]=factr[0]=1;
for (int i=2;i<=NUM_;++i) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mod, factr[i]=factr[i-1]*inv[i]%mod;
}
if(C_<0 || C_>N_) return 0;
return factr[C_]*fact[N_]%mod*factr[N_-C_]%mod;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin>>x>>y;
ll ans = 0;
if ((2*y-x)%3!=0 || (2*x-y)%3!=0){
cout<<0<<endl;
return 0;
}
ll x1 = (2*y-x)/3;
ll x2 = (2*x-y)/3;
ans = comb(x1+x2,x1);
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int apple[3][100005], need[2], siz[3];
int main() {
int x, y, a, b, c;
scanf("%d%d%d%d%d", &need[0], &need[1], &siz[0], &siz[1], &siz[2]);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < siz[i]; j++) {
scanf("%d", &apple[i][j]);
}
sort(apple[i], apple[i] + siz[i], greater<int>());
}
vector <int> choice;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < need[i]; j++) choice.push_back(apple[i][j]);
}
for (int i = 0; i < siz[2]; i++) choice.push_back(apple[2][i]);
sort(choice.begin(), choice.end(), greater<int>());
long long res = 0;
for (int i = 0; i < need[0] + need[1]; i++) res += choice[i];
printf("%lld\n", res);
}
| 0
| 92,151,932
|
#include<iostream>
using namespace std;
int main(){
string N;
cin>>N;
for(int i=111; i<=999; i+=111){
string s=to_string(i);
if(N<=s){
cout<<s<<endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)(x).size()
#define ll long long
using namespace std;
ll verif(ll* a , int n){
ll ans = 0;
while(a[n] >= n){
a[n] -= n;
for(int i = 1; i <= n - 1; ++i) ++a[i];
sort(a + 1 , a + n + 1);
++ans;
}
return ans;
}
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll k; cin >>k;
int n = 50;
ll a[n + 1]; for(int i = 1; i <= n; ++i) a[i] = k / n + i - 1;
k %= n;
while(k--){
a[1] += n;
for(int i = 2; i <= n; ++i) --a[i];
sort(a + 1 , a + n + 1);
}
cout << n << '\n';
for(int i = 1; i <= n; ++i) cout << a[i] << ' ';
cout << '\n';
return 0;
}
| 0
| 59,348,186
|
#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--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int changeDoubleToInt(string decimal){
decimal.erase(1, 1);
int n_decimal = atoi(decimal.c_str());
return n_decimal;
}
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
double l;
cin >> l;
double x = l/3;
double ans = pow(x,3);
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define bizarre 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 ll long long
#define ld long double
#define pi acos(-1)
#define point complex<double>
const int N = 1e6 + 9, inf = 2e9, mod = 1e9 + 7;
vector<int> prime_Numbers;
bool primes[1000005];
double dot(point a, point b)
{
return (conj(a) * b).real();
}
double cross(point a, point b)
{
return (conj(a) * b).imag();
}
int main()
{
bizarre
ll n,k;
cin >> n >> k;
ll a[n+2];
for(int i = 0;i<n;i++)cin >> a[i];
ll ans = 0;
ll sum = 0;
while(sum<n)
{
ans++;
if(!sum)sum++;
sum+=k;
sum--;
}
cout << ans;
return 0;
}
| 0
| 2,733,575
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> l(n+1);
l[0] = 2;
l[1] = 1;
for(int i = 2; i < n+1; i++){
l[i] = l[i-1]+l[i-2];
}
cout << l[n] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string ip;
cin>>ip;
ll n=ip.length();
bool isPossible=false;
string pattern[4];
pattern[0]="maerd";
pattern[1]="remaerd";
pattern[2]="esare";
pattern[3]="resare";
ll i=n-1;
string temp="";
while(i>=0){
temp+=ip[i];
bool found=false;
for(int j=0;j<4&&!found;j++){
if(temp==pattern[j]){
found=true;
temp="";
}
}
i--;
}
if(temp==""){
isPossible=true;
}
if(isPossible){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
| 0
| 86,861,904
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1000000000;
int main() {
ll s, v = 1000000000;
cin >> s;
ll x = (v - s % v) % v;
ll y = (s + x) / v;
cout << "0 0 1000000000 1 " << x << " " << y << endl;
return 0;
}
|
#include <iostream>
#include <ios>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n = 0;
int m = 0;
cin >> n >> m;
vector<int> dp(n + 1, n + 1);
dp[0] = 0;
vector<int> ds(m, 0);
for (auto & di : ds) cin >> di;
for (auto di : ds){
if (di > n) continue;
for (int i = di; i != n + 1; ++i){
dp[i] = min(dp[i], dp[i - di] + 1);
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 77,453,076
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 1000000007
#define inf 100000000000000000
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int n,t,d[15][15],cost,x,y,k,i,j;
int main()
{
while(scanf("%d",&n)!=EOF&&n!=0)
{
memset(d,INF,sizeof(d));t=0;
P mi;mi.second=INF;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x,&y,&cost);
d[x][y]=d[y][x]=cost;
t=max(t,max(x,y));
}
for(i=0;i<=t;i++)d[i][i]=0;
for(k=0;k<=t;k++)
{
for(i=0;i<=t;i++)
{
for(j=0;j<=t;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
for(i=0;i<=t;i++)
{
P p;p.first=i;p.second=0;
for(j=0;j<=t;j++)
{
if(i==j)continue;
p.second+=d[i][j];
}
if(mi.second>p.second)mi=p;
}
printf("%d %d\n",mi.first,mi.second);
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
ll solve(){
ll ret = 0;
ll N,K; cin >> N >> K;
vector<ll> A(N),B(N);
for(int i = 0; i < N;i++) cin >> A[i] >> B[i];
for(int i = 0; i < N;i++) if(K == (K|A[i])) ret += B[i];
for(ll i = 1; i <= K; i<<= 1){
if(!(i&K)) continue;
ll nK = (K^i) | (i-1);
ll T = 0;
for(int j = 0; j < N;j++){
if(nK != (nK|A[j])) continue;
T += B[j];
}
ret = max(ret,T);
}
return ret;
}
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
| 0
| 96,347,846
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll h,m;
cin>>h>>m;
ll ch[30000];
ll a[1010];
ll b[1010];
for(ll i=0;i<m;i++){
cin>>a[i]>>b[i];
}
for(ll i=0;i<30000;i++){
ch[i]=inf;
}
ch[0]=0;
ll ans=inf;
for(ll i=0;i<20000;i++){
for(ll j=0;j<m;j++){
ch[i+a[j]]=min(ch[i+a[j]],ch[i]+b[j]);
if(i+a[j]>=h){
ans=min(ans,ch[i+a[j]]);
}
}
}
cout << ans;
}
|
#pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <climits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FAST(); ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define mod 1000000007
typedef long long int bigint ;
typedef std::vector< int > vi;
typedef std::vector< long long int > vll;
typedef std::vector< vi > vvi;
using namespace std;
int main(){
FAST() ;
string str1 , str2 ; cin >> str1 >> str2 ;
if( str1 == str2 )
cout << "EQUAL" << endl ;
else if( str1.length() == str2.length() ){
if( str1 > str2 )
cout << "GREATER" << endl ;
else
cout << "LESS" << endl ;
}
else {
if( str1.length() > str2.length() )
cout << "GREATER" << endl ;
else
cout << "LESS" << endl ;
}
return 0 ;
}
| 0
| 61,490,977
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
const double PI = acos(-1);
const int mod = 1e9+7;
const long long INF = (1LL << 60);
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
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;}
ll stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(const ll a, const ll b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmax(T &a, const T &b){ if(a < b){ a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(a > b){ a=b; return 1; } return 0; }
bool isPrime(int num){
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2){
if (num % i == 0){
return false;
}
}
return true;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
char c;
cin >> c;
if(c == 'A') cout << 'T' << endl;
if(c == 'T') cout << 'A' << endl;
if(c == 'C') cout << 'G' << endl;
if(c == 'G') cout << 'C' << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define INF (int)1e7
class Graph{
typedef pair<int, int> p;
int V;
list<p> *adj;
public:
Graph(int V){
this->V = V;
adj = new list<p> [V];
}
void addEdge(int u, int v, int w){
adj[u].push_back(make_pair(v, w));
}
bool route(lli from, lli to){
vector<lli> vec(V, -1);
dfs(1,from,vec);
return vec[to] >= 0;
}
void dfs(lli ed, lli num, vector<lli>& vec){
for(auto e: adj[num]){
if(vec[e.first] != -1)continue;
vec[e.first] = num;
dfs(ed+1, e.first, vec);
}
}
vector<int> bfs(int n){
queue<int> q;
vector<int> vec(V,-1);
q.push(n);
vec[n]=0;
while(!q.empty()){
int p=q.front();
q.pop();
for(auto e:adj[p]){
if(vec[e.first]==-1){
q.push(e.first);
vec[e.first] = e.second + vec[p];
}
}
}
return vec;
}
vector<int> shortestPath(int src){
priority_queue< p, vector <p> , greater<p> > pq;
vector<int> dist(V, INF);
pq.push(make_pair(0, src));
dist[src] = 0;
while (!pq.empty()) {
int u = pq.top().second;
pq.pop();
list< pair<int, int> >::iterator i;
for (i = adj[u].begin(); i != adj[u].end(); ++i) {
int v = (*i).first;
int weight = (*i).second;
if (dist[v] > dist[u] + weight) {
dist[v] = dist[u] + weight;
pq.push(make_pair(dist[v], v));
}
}
}
for(int i=0;i<V;i++)if(dist[i]==INF)dist[i]=-1;
return dist;
}
};
bool cmpf(const pair<lli, lli> left, const pair<lli, lli> right) {
return left.first< right.first;
}
bool cmps(const pair<lli, lli> left, const pair<lli, lli> right) {
return left.second < right.second;
}
void dfs(lli ed, lli num, vector<map<lli,lli>>& vec){
lli n=1;
for(auto e: vec[num]){
if(n == ed)n++;
if(e.second != -1)continue;
vec[num][e.first] = n;
vec[e.first][num] = n;
dfs(n, e.first, vec);
n++;
}
}
lli gcd(lli a, lli b){
if(a < b)return gcd(b, a);
lli temp;
while((temp = a%b)){
a=b;
b=temp;
}
return b;
}
struct nCr{
vector<lli> f, rf;
lli count=0;
nCr(lli num): f(num), rf(num){
count = num;
f[0] = 1;
rep1(i, num) f[i] = (f[i - 1] * i) % MOD;
rep0(i, num+1) rf[i] = inv(f[i]);
}
lli inv(lli x) {
lli res = 1;
lli k = MOD - 2;
lli y = x;
while (k) {
if (k & 1) res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
lli C(lli n, lli k) {
lli a = f[n];
lli b = rf[n-k];
lli c = rf[k];
lli bc = (b * c) % MOD;
return (a * bc) % MOD;
}
};
struct UF{
vector<int> par,size;
UF(int N) : par(N), size(N, 1){
rep0(i,N)par[i] = i;
}
int root(int x){
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry) return;
par[rx] = ry;
size[rx] += size[ry];
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int getSize(int x){
return size[x];
}
};
int main(){
string str;
cin >> str;
int ans=0;
int numb=0, nume=str.length()-1;
while(numb<nume){
if(str[numb] != str[nume]){
if(str[numb]=='x'){
numb++;
}else if(str[nume]=='x'){
nume--;
}else{
cout << -1;
return 0;
}
ans++;
}else{
numb++;nume--;
}
}
cout << ans;
}
| 0
| 74,415,392
|
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong A,B,C;
llong K;
cin >> A >> B >> C;
cin >> K;
while(K>0){
if(B<=A){
B = B * 2;
K = K - 1;
continue;
}
break;
}
while(K>0){
if(C<=B){
C = C * 2;
K = K - 1;
continue;
}
break;
}
if(A<B && B<C){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
bool cout_flag = false;
cin >> str;
for (int i = 0; i < str.length() - 1; i++)
{
if(str[i] == str[i + 1])
{
cout << i + 1 << " " << i + 2;
cout_flag = true;
break;
}
else if(i < str.length() - 2 && str[i] == str[i + 2])
{
cout << i + 1 << " " << i + 3;
cout_flag = true;
break;
}
}
if (!cout_flag)
{
cout << "-1 -1";
}
return 0;
}
| 0
| 9,573,729
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++)
cin >> a[i];
vector<int> res(n);
res[0] = a[0];
for (int i = 1; i < n - 1; i++) {
res[i] = a[i];
if (res[i] > a[i - 1])
res[i] = a[i - 1];
}
res[n - 1] = a[n - 2];
int ans = accumulate(res.begin(), res.end(), 0);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
const int base = 200003;
const long long MM = 1ll * MOD * MOD;
int n;
bool Count(int x){
string s;
while(x > 0){
int pos = x % 10;
s += pos + '0';
x /= 10;
}
n = s.length();
s = " " + s;
for(int i = 1;i <= n / 2;++i){
if(s[i] != s[n - i + 1]) return 0;
}
return 1;
}
void Solve(){
int a,b;
cin >> a >> b;
int ans = 0;
for(int i = a;i <= b;++i){
ans += Count(i);
}
cout << ans;
}
void NumTime(){cerr << "Toi" << "\n";cerr << "Di" << "\n";cerr << "Chep" << "\n";cerr << "Code" << "\n";}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
#endif
int test = 1;
while(test--){
NumTime();
Solve();
}
}
| 0
| 10,814,456
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n,m;
cin >> n >> m;
vi cnt(n);
rep(i,m){
int a,b;
cin >> a >> b;
a--;b--;
cnt[a]++;
cnt[b]++;
}
rep(i,m){
if(cnt[i]%2){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG
#define PRE_COMMAND \
std::cin.rdbuf(in.rdbuf()); \
std::cout << fixed << setprecision(15);
#else
#define PRE_COMMAND cout << fixed << setprecision(15);
#endif
const double EPS = 1e-10, PI = acos(-1.0);
template <class T> auto MAX(T& seq) {
return *max_element(seq.begin(), seq.end());
}
template <class T> auto MIN(T& seq) {
return *min_element(seq.begin(), seq.end());
}
template <class T> auto SUM(T& seq) {
T temp{0};
auto& temp2 = temp[0];
return accumulate(seq.begin(), seq.end(), temp2);
}
template <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }
template <class T, class S> void SORT(T& seq, S& sort_order) {
sort(seq.begin(), seq.end(), sort_order);
}
template <class T> void SORTR(vector<T>& seq) {
sort(seq.begin(), seq.end(), greater<T>());
}
template <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {
long long n = n_0, k = k_0, mod = mod_0, now = 1;
while (true) {
if (k & 1) { now = now * n % mod; }
if ((k >>= 1) == 0) { return now; }
n = (n * n) % mod;
}
}
ll floor_sum(ll n, ll m, ll a, ll b) {
ll ret = 0;
if (b >= m) {
ret += n * (b / m);
b %= m;
}
if (a >= m) {
ret += n * (n - 1) * (a / m) / 2;
a %= m;
}
ll y = (a * n + b) / m;
if (y == 0) { return ret; }
b = a * n - m * y + b;
ret += floor_sum(y, a, m, b);
return ret;
}
int main() {
PRE_COMMAND
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
cout << (h2 * 60 + m2 - h1 * 60 - m1 + 24 * 60) % 1440 - k << endl;
}
| 0
| 99,068,035
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long M = 1;
for (long long i = 2; i <= sqrt(N); i++) {
if (N % i == 0){
M = i;
}
}
long long L = max(M,N/M);
int count = 0;
for (int i = 0; i < 11; i++) {
count++;
if (L / 10 == 0){
cout << count << endl;
return 0;
}
L /= 10;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k,l;
cin>>n;
vector<long long>a(n);
for(i=0;i<n;i++)
cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
queue<long long >q;
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
q.push(a[i]);
i++;
}
}
if(q.size()>=2)
{
k=q.front();
q.pop();
l=q.front();
}
cout<<k*l<<endl;
return 0;
}
| 0
| 65,031,397
|
#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; cin >> n;
vector<int> r(n);
REP(i, n) {
int tmp; cin >> tmp;
r[i] = tmp - 1;
}
int cnt = 0;
REP(i, n)
if (i == r[r[i]]) cnt++;
cout << cnt / 2 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int h,w;
cin >> h >> w;
vector<vector<char>> map(h+1, vector<char>(w+1));
vector<vector<int>> yoko(h, vector<int>(w));
vector<vector<int>> tate(h, vector<int>(w));
rep(i,h)rep(j,w) cin >> map[i][j];
rep(i,h){
int cnt = 0;
int begin = 0;
rep(j,w+1){
if(map[i][j]=='#'||j==w){
for(int k=begin; k<=begin+cnt-1; k++) yoko[i][k] = cnt;
cnt = 0;
begin = j+1;
}else{
cnt++;
}
}
}
rep(j,w){
int cnt = 0;
int begin = 0;
rep(i,h+1){
if(map[i][j]=='#'||i==h){
for(int k=begin; k<=begin+cnt-1; k++) tate[k][j] = cnt;
cnt = 0;
begin = i+1;
}else{
cnt++;
}
}
}
int ans = 0;
rep(i,h)rep(j,w) ans = max(ans, yoko[i][j] + tate[i][j] - 1);
cout << ans << endl;
return 0;
}
| 0
| 25,821,641
|
#include<iostream>
#include<iomanip>
int a,b;
int main(){
std::cin>>a>>b;
std::cout<<a/b<<" "<<a%b<<" "<<std::fixed<<std::setprecision(8)<<static_cast<double>(a)/static_cast<double>(b)<<std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
ll INF=1e10;
int main(){
ll n,m; cin>>n>>m;
vector<vector<ll>>a(m,vector<ll>(3));
rep(i,m){
cin>>a[i][0]>>a[i][1];
a[i][2]=i+1;
}
sort(a.begin(),a.end());
vector<vector<ll>>na(m,vector<ll>(3));
ll cnt=1;
rep(i,m){
na[i][0]=a[i][2];
na[i][1]=a[i][0];
na[i][2]=cnt;
if(i<=m-2&&a[i+1][0]==a[i][0])cnt++;
else cnt=1;
}
sort(na.begin(),na.end());
rep(i,m){
string s=to_string(na[i][1]);
string t=to_string(na[i][2]);
rep(j,6-s.size())cout<<'0';
cout<<s;
rep(j,6-t.size())cout<<'0';
cout<<t<<endl;
}
}
| 0
| 15,914,675
|
#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 (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
ll a,b; cin>>a>>b;
if(a==1 && b==1) cout<<1;
else if(a==1 || b==1) cout<<1;
else if(a*b%2) cout<<a*b/2+1;
else cout<<a*b/2;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = P<ll, ll>;
using Pdd = P<double, double>;
template<typename T1, typename T2> using M = std::map<T1, T2>;
using Mii = M<int, int>;
using Mll = M<ll, ll>;
using Msi = M<string, int>;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REP2(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
#define RREP(i,s,e) for(int i=(int)(s);i>=(int)(e);--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin(),ie=(c).end();i!=ie;++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin(),ie=(c).rend();i!=ie;++i)
#define ALL(c) (c).begin(), (c).end()
const double PI = acos(-1);
const ll MOD = 1e9+7;
ll n, m;
int main() {
cin >> n >> m;
Vl a(n);
REP(i, n) cin >> a[i];
Vl x(n+1);
x[0] = 0;
REP2(i, 1, n+1) {
x[i] += x[i-1] + a[i-1];
x[i] %= m;
}
Mll cnt;
REP(i, n+1) {
cnt[x[i]] += 1;
}
ll res = 0;
for (auto x: cnt) {
res += x.second * (x.second - 1) / 2;
}
cout << res << '\n';
return 0;
}
| 0
| 38,265,823
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if(l % 2019 == 0)
return cout << l, 0;
vector<int> v;
for(int i = l; i <= r; ++i) {
if(i % 2019 < l % 2019)
return cout << i % 2019, 0;
v.push_back(i % 2019);
}
int mini = 1e9;
for(int x : v) {
for(int y : v) {
if(x == y)
continue;
mini = min(mini, x * y % 2019);
}
}
cout << mini;
}
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string S;
string T;
cin >> S;
cin >> T;
vector<string> ans;
bool judge=false;
rep(i,S.size()-T.size()+1){
ll count=0;
string tmp="";
rep(j,T.size()){
if(T[j]==S[i+j] || S[i+j]=='?'){
count++;
}
}
if(count==T.size()){
judge=true;
tmp+=S;
rep(j,T.size()){
if(tmp[i+j]=='?'){
tmp[i+j]=T[j];
}
}
rep(i,tmp.size()){
if(tmp[i]=='?'){
tmp[i]='a';
}
}
ans.PB(tmp);
}
}
if(judge==false){
cout << "UNRESTORABLE" << endl;
return 0;
}
sort(all(ans));
cout << ans[0] << endl;
}
| 0
| 38,776,285
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int k,x;
cin >> k >> x;
if (500*k < x){
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string S;
int main(){
cin >> S;
char buf = 'a';
int size = S.size();
map<char, int> dict;
for (int i=0; i<size; i++){
dict[S.at(i)]++;
}
int cnt = 0;
for (auto p: dict){
auto key = p.first;
auto value = p.second;
if (key == buf){
buf++;
cnt++;
}
}
if (cnt < 26){
cout << buf << endl;
}
else{
cout << "None" << endl;
}
}
| 0
| 59,260,808
|
#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;
nsum = (nsum + x) % MOD;
}
ll msum = 0, mans = 0;
for (int i = 0; i < M; i++)
{
ll x;
cin >> x;
mans += (x * i - msum);
mans %= MOD;
msum = (msum + x) % MOD;
}
cout << (nans * mans) % MOD << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) cin >> H[i];
int cnt[N];
cnt[N - 1] = 0;
for (int i = N - 2; i >= 0; i--)
cnt[i] = H[i] < H[i + 1] ? 0 : cnt[i + 1] + 1;
int ans = 0;
for (int i = 0; i < N; i++) ans = max(ans, cnt[i]);
cout << ans << '\n';
return 0;
}
| 0
| 662,789
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int N,M,a,b; cin>>N>>M;
map<int,int> ct;
for (int i=0; i<M; i++) {
cin>>a>>b;
ct[a]++; ct[b]++;
}
for (auto it : ct)
if(it.second%2) {
cout<<"NO\n";
return 0;
}
cout<<"YES\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
ios
int num_tests=1;
while(num_tests-->0){
int h1,m1,h2,m2,k; cin>>h1>>m1>>h2>>m2>>k;
int min = h2-h1;
min*=60;
min+=(m2-m1);
cout<<min-k;
}
}
| 0
| 73,572,973
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
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) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll dfs(ll n,ll x,vl s,vl S){
if(n==0)return 1;
else if(x==1)return 0;
else if(x>1 && x<= 1+s[n-1])return dfs(n-1,x-1,s,S);
else if(x==2+s[n-1])return (1+S[n-1]);
else if(x>2+s[n-1] && x<3+2*s[n-1])return S[n-1]+1+dfs(n-1,x-2-s[n-1],s,S);
else return (1+2*S[n-1]);
}
signed main()
{
gearup;
ll n,m; cin >> n >> m;
vector<ll> S(n+1);
vector<ll> s(n+1);
s[0] = 1;
S[0] = 1;
rep1(i,n){
s[i] = 2*s[i-1] + 3;
S[i] = 2*S[i-1] + 1;
}
cout << dfs(n,m,s,S) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using Matrix = vector<vector<T>>;
const ll inf = 1LL<<60;
int main()
{
string s; cin>>s;
ll k; cin>>k;
ll n = s.size();
{
bool flg = true;
rep(i, n-1) if (s[i] != s[i+1]) flg = false;
if (flg) {
cout << n*k/2 << endl;
return 0;
}
}
vector<ll> a;
ll t = 1;
rep(i, n-1) {
if (s[i] == s[i+1]) t++;
else {
a.push_back(t);
t = 1;
}
}
a.push_back(t);
ll ans = 0;
for (auto v:a) {
ans += v/2;
}
ans *= k;
if (s[0] == s[n-1]) {
ans -= (a[0]/2 + a.back()/2 - (a[0]+a.back())/2) * (k-1);
}
cout << ans << endl;
return 0;
}
| 0
| 18,662,929
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t X;
int64_t t;
cin >> X >> t;
X -= t;
if( X < 0) X =0;
cout << X << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define DB(a) cerr << #a << " = " << (a) << endl;
#define OUT( a , n ) for( int J = 0; J < (n); J++ )cout<< (a)[J] << " \n"[J == (n) - 1 ]
#define WAIT cout << flush , system("PAUSE");
#define lowbit(x) ((x) & (-x))
#define CONTAINS(a, x) ((a).find(x) != (a).end())
#define endl '\n'
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repi(i,0,n)
typedef long long ll;
const int N = 1e6+100;
int n , k , p;
char s[15];
char ans[15];
bool test(){
printf("? %s\n",s); fflush(stdout);
scanf("%s", ans);
return ans[0] == 'Y';
}
bool is_pow_10(ll x){
while(x > 1){
if(x % 10)return false;
x /= 10;
}
return true;
}
bool checkend(int pos){
long long num = 0;
for( int i = 0; i <= pos; ++i){
num = num * 10 + s[i] - '0';
}
int last_dig = num % 10;
if(last_dig == 9){
long long other = num + 1;
printf("? %lld\n",other); fflush(stdout);
scanf("%s", ans);
if(is_pow_10(other)){
return ans[0] == 'N';
}
else{
return ans[0] == 'Y';
}
}
else{
num++;
printf("? %lld\n",num); fflush(stdout);
scanf("%s", ans);
return ans[0] == 'Y';
}
}
int main()
{
ios::sync_with_stdio( 0 );
cin.tie( 0 );
for( int i = 0; i < 14; i++ ){
s[i] = '9';
}
for( int i = 0; i < 11; i++ ){
s[i] = '1';
int lo = i == 0 ? 1 : 0;
int hi = 9;
while(lo < hi){
int mid = (lo + hi) / 2;
s[i] = '0' + mid;
if(test()){
hi = mid;
}
else lo = mid + 1;
}
s[i] = '0' + lo;
if(checkend(i)){
s[i + 1] = 0;
printf("! %s\n",s); fflush(stdout);
exit(0);
}
}
return 0;
}
| 0
| 19,999,569
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#define pii pair<int,int>
#define mapii map<int,int>
#define mapll map<ll,ll>
#define mapci map<char,int>
#define mapcl map<char,ll>
#define mapsi map<string,int>
#define mapsl map<string,ll>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vd vector<double,double>
#define all(c) c.begin(),c.end()
#define F first
#define S second
#define mp make_pair
#define ftc(x) cerr << #x << ": " << x << " " << endl;
#define PI acos(-1)
#define lcm(a,b) ((a*b)/__gcd(a,b))
#define optimize ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sqr(a) ((a)*(a))
int main()
{
ll i,j,k,l,m,n;
cin >> n;
string s;
double mm,ans=0.0;
for(i=0;i<n;i++)
{
cin >> mm >>s;
if(s == "BTC")
{
ans += (mm*380000.0);
}
else ans += mm;
}
cout << std::setprecision(10) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
map<int, int> mp;
cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++){
cin >> a[i];
mp[a[i]] += 1;
}
int type_num = 0;
for (auto p : mp) {
++type_num;
}
int num[type_num] = {0};
int count = 0;
for (auto p : mp) {
auto value = p.second;
num[count] += value;
count++;
}
int res = 0;
sort(num, num + count);
for (int i = 0; i < type_num - K; i++){
res += num[i];
}
cout << res << endl;
}
| 0
| 68,237,138
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
long long kotae=0;
if(a<=b)kotae=a*c;
else kotae=b*c+(a-b)*d;
cout<<kotae<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int vec[n];
map<int,int> ma;
map<int,int> mab;
for(int i=0;i<n;i++){
cin>>vec[i];
if(i%2==0){
ma[vec[i]]++;
}
else{
mab[vec[i]]++;
}
}
int a=0,b=0,c=1e6,d,e=0,f=0,g=1e6,h;
for(int i=0;i<n;i+=2){
if(ma[vec[i]]>=a){
b=a;
d=c;
a=ma[vec[i]];
c=vec[i];
ma[vec[i]]=0;
}
else if(ma[vec[i]]>=b){
b=ma[vec[i]];
d=vec[i];
ma[vec[i]]=0;
}
}
for(int i=1;i<n;i+=2){
if(mab[vec[i]]>=e){
f=e;
h=g;
e=mab[vec[i]];
g=vec[i];
mab[vec[i]]=0;
}
else if(mab[vec[i]]>=f){
f=mab[vec[i]];
h=vec[i];
mab[vec[i]]=0;
}
}
if(c!=g){
cout<<n-a-e<<endl;
return 0;
}
cout<<min(n-a-f,n-b-e)<<endl;
return 0;
}
| 0
| 85,788,619
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
if(c%__gcd(a,b)==0) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int sm = 0;
rep(i, n) {
int l, r;
cin >> l >> r;
sm += r - l + 1;
}
cout << sm << endl;
}
| 0
| 94,206,097
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int A[100010] = {};
for(int i = 0; i < N; i++) cin >> A[i];
long long int current = 1;
long long int ans = 0;
for(int i = 0; i < N; i++){
if(A[i] == current) current ++;
else if(A[i] < current) continue;
else{
ans += (A[i] - 1) / current;
if(i == 0) current ++;
}
}
cout << ans << endl;
}
|
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
#define SORT(v) sort(ALL(v))
#define GSORT(v) gsort((v).begin(), (v).end())
#define FOR(i, a, b) for (ll i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); --i)
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}
template <typename T>
T sq(T a) {
return a * a;
}
template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b ;
if (n % 2 == 0) {
return mypow(sq(b) , n / 2);
} else {
return mypow(b, n - 1) * b ;
}
}
ll pcnt(ll b) {
return __builtin_popcountll(b);
}
void solve() {
ll N;
cin >> N;
V<P<ll, ll>> s(N + 1);
s[0] = mp(0, 0);
FOR(i, 1, N) {
ll a;
cin >> a;
s[i] = mp(a, i);
}
GSORT(s);
V<ll> cnt(N + 1, 0);
ll mi = s[0].snd;
FOR(i, 0, N - 1) {
mi = min(mi, s[i].snd);
cnt[mi] += (i + 1) * (s[i].fst - s[i + 1].fst);
}
FOR(i, 1, N) {
cout << cnt[i] << endl;
}
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
int num;
cin >> num;
FOR(_, 1, num) {
cout << "++++++++++++++++++++" << endl;
solve();
}
#else
solve();
#endif
return 0;
}
| 0
| 94,406,705
|
#include<iostream>
using namespace std;
void dfs(int n,int s,int k);
int ans=0;
int main(){
int n,sum;
while(cin>>n>>sum , n||sum){
ans=0;
dfs(n,sum,0);
cout<<ans<<endl;
}
}
void dfs(int n,int sum,int k){
if(n<0){
return ;
}
if(n==0){
if(sum==0){
ans++;
}
}
else{
if(9<k){
return ;
}
for(int i=k;i<=9;i++){
dfs(n-1,sum-i,i+1);
}
}
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
ll c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
ios::sync_with_stdio(false);
int n, a[8] = {}, b[8] = {}, c[8] = {1, 2, 3, 4, 5, 6, 7, 8}, x = 0, y = 0, z = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
do {
bool u = 0, v = 0;
for (int i = 0; i < n; i++) {
if (a[i] != c[i]) u = 1;
if (b[i] != c[i]) v = 1;
}
if (!u) x = z;
if (!v) y = z;
z++;
} while (next_permutation(c, c + n));
cout << abs(x - y);
}
| 0
| 90,892,084
|
#include <iostream>
#include <iomanip>
int main()
{
int d;
while (std::cin >> d) {
double s = 0.0;
for (int i = 1; i < 600 / d; ++i) {
s += d * d * d * i * i;
}
std::cout << (int)s << std::endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main(){
int a,b;
cin >> a >> b;
string s;
cin >> s;
string ans = "Yes";
rep(i,s.size()){
if(s[i]=='-' && i!=a){
ans="No";
}
if(s[a]!='-'){
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| 0
| 91,750,174
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pll;
#define fu(i,a,b) for(ll i=a;i<b;i++)
#define fd(i,b,a) for(ll i=b;i>=a;i--)
#define ms(a,x) memset(a, x, sizeof a)
#define prec(n) fixed<<setprecision(n)
#define pb(i) push_back(i)
#define popb() pop_back()
#define sc(a) cin>>a
#define sc2(a,b) cin>>a>>b
#define pr(a) cout<<a<<" "
#define pr2(a,b) cout<<a<<" "<<b<<" "
#define lowb(a,n,x) lower_bound(a,a+n,x) -a
#define lowb2(a,x) lower_bound(a.begin(),a.end(),x) -a.begin()
#define all(x) (x).begin(), (x).end()
#define sz(a) (ll)a.size()
#define le(s) (ll)s.length()
#define re return
#define mp(a,b) make_pair(a,b)
#define se second
#define fi first
#define debug(x) cerr << #x << " = " << x << endl
#define INPUT freopen("locin.txt", "r", stdin)
#define OUTPUT freopen("locout.txt", "w", stdout)
void inline minize(ll& a,ll b){a=(a>b?b:a);};
void inline maxize(ll& a,ll b){a=(a<b?b:a);};
double const eps = 1e-6;
ll const Base=1e9+7,oo=1e17,MAXN=1e5;
ll n;
bitset <MAXN+5> came;
vi dske[MAXN+5];
ll DFS(ll cur){
ll res=0,x,cntchild=0;
came[cur]=1;
fu(i,0,sz(dske[cur])){
x=dske[cur][i];
if(came[x])continue;
cntchild++;
res^=(DFS(x)+1);
}
re res;
}
ll Solves(){
ll x,k,cnt=0,ans=0,a,b;
came.reset();
sc(n);
fu(i,0,n-1){
sc2(a,b);
dske[a].pb(b);
dske[b].pb(a);
}
if(DFS(1))pr("Alice");
else pr("Bob");
re 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
Solves();
}
|
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)
int n, k;
string s;
int main(){
cin >> n >> s >> k;
k--;
REP(i, n){
if(s[i] != s[k])s[i] = '*';
}
cout << s << endl;
}
| 0
| 64,510,430
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int x;
cin>>x;
int y;
rep(i,(x/105)+2){
y=x-(105*i);
rep(j,(y/104)+2){
y=x-(105*i)-(104*j);
rep(k,(y/103)+2){
y=x-(105*i)-(104*j)-(103*k);
rep(l,(y/102)+2){
y=x-(105*i)-(104*j)-(103*k)-(102*l);
rep(m,(y/101)+2){
y=x-(105*i)-(104*j)-(103*k)-(102*l)-(101*m);
if(y%100==0 && y>=0){
cout<<1<<endl;
return 0;
}
}
}
}
}
}
cout<<0<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
struct SegmentTree{
int n;
vector<int> value;
int SIJK;
SegmentTree(int N){
SIJK = INF;
n = 1;
while(n < N) n *= 2;
value.assign(2 * n - 1, SIJK);
rep(i, N) value[i + n - 1] = i;
for(int i = n - 2; i >= 0; i--){
value[i] = compare(value[2 * i + 1], value[2 * i + 2]);
}
}
int compare(int a, int b){
return min(a, b);
}
void update(int i, int x){
i += n - 1;
value[i] = x;
while(i > 0){
i = (i - 1)/2;
value[i] = min(value[2 * i + 1], value[2 * i + 2]);
}
}
int find(int a, int b, int k = 0, int l = 0, int r = -1){
if(r < 0) r = n;
if(r <= a || b <= l) return SIJK;
if(a <= l && r <= b) return value[k];
else{
int m = (l + r) / 2;
int tmp1 = find(a, b, 2 * k + 1, l, m);
int tmp2 = find(a, b, 2 * k + 2, m, r);
return compare(tmp1, tmp2);
}
}
};
int main(){
int N, M;
cin >> N >> M;
SegmentTree sg(M);
priority_queue<P> que;
rep(i, N){
P tmp;
cin >> tmp.second >> tmp.first;
que.push(tmp);
}
int sum = 0;
while(!que.empty()){
P tmp = que.top();
que.pop();
int a = tmp.second - 1, b = tmp.first;
int f = sg.find(a, M);
if(f == INF) continue;
else{
sg.update(f, INF);
sum += b;
}
}
cout << sum << endl;
}
| 0
| 68,229,731
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, d; cin >> h >> w >> d;
pair<int, int> loca[h*w];
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
int a; cin >> a;
loca[a-1] = make_pair(i, j);
}
}
long long cost[h*w];
for (int i = 0; i < d; i++)
{
cost[i] = 0;
int tmp = i + d;
while (tmp < h * w)
{
cost[tmp] = cost[tmp-d] + abs(loca[tmp].first - loca[tmp-d].first) + abs(loca[tmp].second - loca[tmp-d].second);
tmp += d;
}
}
int q; cin >> q;
for (int i = 0; i < q; i++)
{
int l, r; cin >> l >> r;
l--, r--;
cout << cost[r] - cost[l] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) begin(a), end(a)
int main(void) {
int N, K;
cin >> N >> K;
vector<ll> a(N);
REP(i, N) cin >> a[i];
ll ans = INF;
REP(i, 1 << N) {
vector<bool> b(N);
ll num = 0;
REP(j, N) {
b[j] = (i >> j) & 1;
if (b[j]) num++;
}
if (num < K) continue;
ll cost = 0;
ll highest = 0;
REP(j, N) {
if (b[j]) {
if (a[j] <= highest) {
cost += highest - a[j] + 1;
highest++;
}
}
if (a[j] > highest) highest = a[j];
}
ans = min(cost, ans);
}
cout << ans << endl;
return 0;
}
| 0
| 66,435,982
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
ll a[50];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < 10000; i++) {
ll s = 0;
for (int j = 0; j < N; j++) {
s += a[j] / N;
}
if (s == 0) break;
for (int j = 0; j < N; j++) {
ll k = a[j] / N;
a[j] = a[j] - k * N + (s - k);
}
ans += s;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int N;
int a[200010],b[200010];
int main(){
cin>>N;
int mB=2001001001;
LL sum=0;
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
if(a[i]>b[i] && b[i] < mB){
mB = b[i];
}
sum += b[i];
}
if(mB>=2001001001){
cout<<0<<endl;
return 0;
}
cout << sum - mB <<endl;
return 0;
}
| 0
| 20,297,762
|
#include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const int N = 1e5 + 5;
int n,m;
vector<int> b;
vector<int> adj[N];
int a[N];
int vis[N];
map<int,int> cnt;
void dfs(int u){
vis[u] = 1;
cnt[u]++;
cnt[a[u]]++;
b.pb(u);
for(auto v : adj[u]){
if(!vis[v]){
dfs(v);
}
}
}
void init(){
for(auto x : b){
if(cnt[x] == 2){
a[x] = x;
}
}
cnt.clear();
b.clear();
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
for(int i = 1; i <= n; i++){
cin>>a[i];
}
for(int i = 0; i < m; i++){
int x , y;
cin>>x>>y;
adj[x].pb(y);
adj[y].pb(x);
}
int ans = 0;
for(int i = 1; i <= n; i++){
if(!vis[i]){
dfs(i);
init();
}
}
for(int i = 1; i <= n; i++){
if(a[i] == i){
ans++;
}
}
cout<<ans;
}
|
#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<int>>;
using P = pair<int, int>;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a > d || b < c) cout << 0 << endl;
else if (a >= c) {
if(b <= d) cout << b - a << endl;
else cout << d - a << endl;
}
else {
if(b <= d) cout << b - c << endl;
else cout << d - c << endl;
}
return 0;
}
| 0
| 61,334,660
|
#include<iostream>
using namespace std;
int main() {
int df = 100000;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
df *= 1.05;
if (df % 1000 != 0) {
df /= 1000;
df++;
df *= 1000;
}
}
cout << df << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
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) {
a = b;
return true;
}
return false;
}
long long dp[110][110][2];
int dx[2]={1,0};
int dy[2]={0,1};
int main()
{
int H,W;
cin >> H >> W;
vector<string> A(H);
REP(i, H) cin >> A[i];
REP(i,H){
REP(j,W){
REP(k,2){
dp[i][j][k]=INF;
}
}
}
if(A.at(0).at(0)=='#'){
dp[0][0][1]=1;
}
if(A.at(0).at(0)=='.'){
dp[0][0][0]=0;
}
REP(i,H){
REP(j,W){
REP(k,2){
if(i+dy[k]>=H||j+dx[k]>=W) continue;
if(A.at(i+dy[k]).at(j+dx[k])=='.'&&A.at(i).at(j)=='.'){
chmin(dp[i+dy[k]][j+dx[k]][0],dp[i][j][0]);
}
if(A.at(i+dy[k]).at(j+dx[k])=='#'&&A.at(i).at(j)=='.'){
chmin(dp[i+dy[k]][j+dx[k]][1],dp[i][j][0]+1);
}
if(A.at(i+dy[k]).at(j+dx[k])=='.'&&A.at(i).at(j)=='#'){
chmin(dp[i+dy[k]][j+dx[k]][0],dp[i][j][1]);
}
if(A.at(i+dy[k]).at(j+dx[k])=='#'&&A.at(i).at(j)=='#'){
chmin(dp[i+dy[k]][j+dx[k]][1],dp[i][j][1]);
}
}
}
}
if(A.at(H-1).at(W-1)=='#'){
cout << dp[H-1][W-1][1] << endl;
}else if(A.at(H-1).at(W-1)=='.'){
cout << dp[H-1][W-1][0] << endl;
}
}
| 0
| 86,494,691
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int a[N],b[N];
for(int i=0;i<N;i++){
cin >> a[i];
}
for(int i=0;i<N;i++){
cin >> b[i];
}
ll sa=0; ll sb=0;
for(int i=0;i<N;i++){
if(a[i]<b[i]) sb+=(b[i]-a[i])/2;
if(a[i]>b[i]) sa+=a[i]-b[i];
}
if(sb>=sa){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
float x1,y1,x2,y2,x3,y3,xp,yp;
float a,b,c,d,e,f,s1,s2,t1,t2;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
t2 = 0;
a = sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));
b = sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));
c = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
s1 = (a+b+c)/2.0;
t1 = sqrt(s1*(s1-a)*(s1-b)*(s1-c));
d = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));
e = sqrt((x3-xp)*(x3-xp)+(y3-yp)*(y3-yp));
f = sqrt((x2-xp)*(x2-xp)+(y2-yp)*(y2-yp));
s2 = (a+e+f)/2;
t2 += sqrt(s2*(s2-a)*(s2-e)*(s2-f));
s2 = (b+d+e)/2;
t2 += sqrt(s2*(s2-b)*(s2-d)*(s2-e));
s2 = (c+d+f)/2;
t2 += sqrt(s2*(s2-c)*(s2-d)*(s2-f));
if( (t1 + 0.00001) >= t2){
cout << "YES" << endl;
}else {
cout << "NO" << endl;
}
}
}
| 0
| 51,901,863
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
ll L, R, t; cin >> L >> R;
vector<int> check(2019,0);
for(ll i=L; i<R; i++){
for(ll j=i+1; j<=R; j++){
t = i*j%2019;
check[t] = 1;
if(t == 0){
cout << 0;
return 0;
}
}
}
rep(i,2019){
if(check[i] == 1){
cout << i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
int n,m;
int f[N],d[N];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
string s;
cin>>s;
int kl=0,r=0;
for(int i=0;i<n;i++){
if(s[i]==')'){
if(r==0) kl++;
else r--;
}
else r++;
}
while(kl--){
cout<<'(';
}
cout<<s;
while(r--) {
cout<<')';
}
return 0;
}
| 0
| 56,593,871
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
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) {
a = b;
return true;
}
return false;
}
bool palindrome(string s){
bool flag=true;
rep(i,s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
for(ll i=0;i<v.size();i++) n+=v[i];
return n;
}
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;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
for(ll i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
x++;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n;
cin>>n;
vector<ll> a(n),b(n);
rep(i,n) cin>>a[i]>>b[i];
ll ans=0;
ans=-Svec(b);
vector<ll> v(n);
rep(i,n) v[i]=a[i]+b[i];
sort(ALL(v),greater<ll>());
rep(i,n){
if(i%2==0) ans+=v[i];
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) for(lint i{}; i < (lint)(h); ++i)for(lint j{}; j < (lint)(w); ++j)
#define DREP2(i, j, n) for(lint i{}; i < (lint)(n - 1); ++i)for(lint j{i + 1}; j < (lint)(n); ++j)
#define SZ(x) ((lint)(x).size())
using lint = long long; lint N, M, H, W;
using namespace std;
const long long INF{ 1LL << 60 };
const long double PI{ 3.1415926535897932 };
const long long NUM97{ 1000000007 };
template<class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return 1; } return 0; }
template<class T> inline bool chmin(T& x, T y) { if (x > y) { x = y; return 1; } return 0; }
std::vector<std::string> field;
std::vector<std::vector<bool>> seen(H, std::vector<bool>(W));
const std::vector<int> dx{ 1, 0, -1, 0 };
const std::vector<int> dy{ 0, 1, 0, -1 };
bool first_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.first != b.first) return{ a.first > b.first };
else return { a.second > b.second };
}
bool second_smaller(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second < b.second };
else return { a.first < b.first };
}
bool second_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second > b.second };
else return { a.first > b.first };
}
lint get_digit(lint& n) {
return log10(n) + 1;
}
bool is_prime(lint N) {
if (N == 1) return false;
for (lint i = 2; i * i <= N; ++i) { if (N % i == 0) return false; }
return true;
}
std::vector<lint> divisors(lint N) { std::vector<lint> divisor;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { divisor.push_back(i);
if (N / i != i) divisor.push_back(N / i); }
} std::sort(divisor.begin(), divisor.end());
divisor.erase(std::unique(divisor.begin(), divisor.end()), divisor.end());
return divisor;
}
std::vector<lint> prime_divisors(lint N) { std::vector<lint> p_divisor;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { if (is_prime(i)) { p_divisor.push_back(i); }
if (N / i != i) { if (is_prime(N / i)) { p_divisor.push_back(N / i); } } }
} std::sort(p_divisor.begin(), p_divisor.end());
p_divisor.erase(std::unique(p_divisor.begin(), p_divisor.end()), p_divisor.end());
return p_divisor;
}
int main() {
lint N; std::cin >> N;
vector<lint> A = divisors(N);
std::cout << get_digit(A[SZ(A) / 2]);
}
| 0
| 37,689,450
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = 1e9;
const ll INF = 1e18;
const ld EPS = 1e-10;
int main(){
int N; ll K;
cin >> N >> K;
ll A[N];
rep(i, N){
cin >> A[i]; A[i]--;
}
map<ll, vector<int>> mp;
ll sum = 0;
mp[0].pb(0);
rep(i, N){
sum += A[i], sum %= K;
mp[sum].pb(i+1);
}
ll ans = 0;
for(auto &e: mp){
ll i = 0;
for(auto &v: e.second){
i++;
ll n = lower_bound(all(e.second), v+K) - e.second.begin();
ans += n-i;
}
}
cout << ans << endl;
}
|
#include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t dict;
int n;
string cmd;
string word;
unordered_set<string>::const_iterator got;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cmd >> word;
if (cmd[0] == 'i') {
dict.insert(word);
} else {
got = dict.find(word);
if (got == dict.end()) {
cout << "no" << endl;
} else {
cout << "yes" << endl;
}
}
}
}
| 0
| 77,697,323
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#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 IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int M;
cin >> M;
int keta = 0;
int sum = 0;
REP(i, M){
int d, c;
cin >> d >> c;
keta += c;
sum += d*c;
}
cout << keta-1+(sum-1)/9 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define ull unsigned long long
#define pi (acos(-1))
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
#define vec std::vector
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int n;
cin >> n;
unordered_set<ll> rec;
ll t;
rep(i, n)
{
cin >> t;
if (rec.find(t) != rec.end())
{
cout << "NO" << endl;
return 0;
}
rec.insert(t);
}
cout << "YES" << endl;
return 0;
}
ll extgcd(ll a, ll b, ll &x, ll &y)
{
if (b == 0)
{
x = 1, y = 0;
return a;
}
ll d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
std::vector<unsigned ll> genprimevec(const unsigned ll N)
{
std::vector<bool> is_prime(N + 1);
for (unsigned ll i = 0; i <= N; i++) { is_prime[i] = true; }
std::vector<unsigned ll> P;
for (unsigned ll i = 2; i <= N; i++)
{
if (is_prime[i])
{
for (unsigned ll j = 2 * i; j <= N; j += i) { is_prime[j] = false; }
P.emplace_back(i);
}
}
return P;
}
| 0
| 22,305,846
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
char c;
cin >> c;
cout << (char)(c + 1) << '\n';
return (0);
}
|
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
int main(void) {
ll N;
string S;
cin >> N >> S;
vector<int> RL(2LL*N,0);
for (ll i=0;i<2LL*N;i++) {
ll j = 2*N-i-1;
if (j%2) {
if (S[i] == 'W') S[i] = 'B';
else S[i] = 'W';
}
}
for (ll i=0;i<2LL*N;i++) {
if (S[i] == 'B') RL[i]++;
}
if (count(RL.begin(), RL.end(), 1) != N || RL[0] == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1LL, X = 0LL;
for (ll i=0;i<2LL*N;i++) {
if (!RL[i]) X++;
else {
ans = ans * X-- % MOD;
}
}
for (ll i=1;i<=N;i++) {
ans = ans * i % MOD;
}
cout << ans << endl;
return 0;
}
| 0
| 72,999,996
|
#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--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
map<char, ll> cnt;
rep(i, len(s)) cnt[s[i]]++;
if (sz(cnt) != 2) {
cout << "No" << endl;
return 0;
}
if (cnt.begin()->second != 2) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for(int i=0; i<N; i++) {
int a;
cin >> a;
if(a>0)
pls.push_back(a);
else
mns.push_back(a);
}
sort(mns.begin(), mns.end());
sort(pls.begin(), pls.end());
reverse(pls.begin(), pls.end());
if(pls.size() == 0) {
int k = mns.back();
mns.pop_back();
pls.push_back(k);
}
if(mns.size() == 0) {
int k = pls.back();
pls.pop_back();
mns.push_back(k);
}
vector<PII> output;
while(pls.size() >= 2) {
int k = mns.back();
mns.pop_back();
int j = pls.back();
pls.pop_back();
output.push_back(PII(k, j));
k -= j;
mns.push_back(k);
}
while(mns.size() >= 1) {
int k = pls.back();
pls.pop_back();
int j = mns.back();
mns.pop_back();
output.push_back(PII(k, j));
k -= j;
pls.push_back(k);
}
cout << pls[0] << endl;
for(auto elem: output) {
int a = elem.first;
int b = elem.second;
cout << a << " " << b << endl;
}
return 0;
}
| 0
| 41,827,085
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); i < (n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n; cin >> n;
map<int, int> odd, even;
rep(i, n){
int v; cin >> v;
if(i%2) even[v]++;
else odd[v]++;
}
priority_queue<pii> que_odd, que_even;
que_odd.push(pii(0, -1)); que_even.push(pii(0, -1));
for (auto iter = odd.begin(); iter != odd.end(); iter++) {
int key = iter->first, num = iter->second;
que_odd.push(pii(num, key));
}
for (auto iter = even.begin(); iter != even.end(); iter++) {
int key = iter->first, num = iter->second;
que_even.push(pii(num, key));
}
int x = 0, y = 0;
pii mxOdd = que_odd.top(); que_odd.pop();
pii mxEven = que_even.top(); que_even.pop();
if(mxOdd.first == mxEven.first && mxOdd.second == mxEven.second){
int num = max(que_odd.top().first, que_even.top().first);
x = num, y = mxOdd.first;
} else{
x = mxOdd.first, y = mxEven.first;
}
int res = (n/2 - x) + (n/2 - y);
cout << res << ln;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<pair<ll,ll>>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
vector<bool> seen;
vector<ll> dist;
void dfs(const Graph &G, int v, ll dis) {
seen[v] = true;
dist[v] = dis;
for (auto next_v : G[v]) {
if (seen[next_v.first]) continue;
dfs(G, next_v.first, dis+next_v.second);
}
}
int main()
{
cout << fixed << setprecision(15);
ll N;
cin >> N;
Graph G(N);
pair<ll,ll> p;
ll a, b, c;
REP(i, N-1){
cin >> a >> b >> c;
a--; b--;
p.first = b;
p.second = c;
G[a].push_back(p);
p.first = a;
p.second = c;
G[b].push_back(p);
}
seen.assign(N, false);
dist.assign(N, -1);
ll Q, K;
cin >> Q >> K;
vector<ll> x(Q);
vector<ll> y(Q);
REP(i, Q){
cin >> x[i] >> y[i];
}
dfs(G, K-1, 0);
REP(i, Q){
cout << dist[x[i]-1] + dist[y[i]-1] << endl;
}
return 0;
}
| 0
| 13,260,569
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
bool ip[N]; vector<int> ps;
int c[N];
vector<int> g[N];
int main(void) {
fill_n(ip, N, 1); ip[1] = 0;
for (int i = 2; i < N; ++i) {
if (ip[i]) ps.push_back(i);
for (int j : ps) {
if (i * j >= N) break;
ip[i * j] = 0;
if (i % j == 0) break;
}
}
for (int p : ps)
for (int i = p; i < N; i += p)
g[i].push_back(p);
int n; scanf("%d", &n);
int r = 0;
for (int i = 1; i <= n; ++i) {
int a; scanf("%d", &a);
r = __gcd(r, a);
for (int p : g[a])
c[p]++;
}
int m = 0;
for (int p : ps) m = max(m, c[p]);
if (m <= 1) printf("pairwise coprime\n");
else if (r == 1) printf("setwise coprime\n");
else printf("not coprime\n");
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0)
cout << "Possible" << "\n";
else
cout << "Impossible" << "\n";
}
| 0
| 48,104,112
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a[25];
cin>>a;
int i,la=strlen(a);
for(i=la-1;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int flag=0;
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size()-1;i++)
{
if (s[i]==s[i+1])
{
cout<<i+1<<" "<<i+2<<endl;
flag=1;
return 0;
}
else if (i<s.size()-2&&s[i]==s[i+2])
{
cout<<i+1<<" "<<i+3<<endl;
flag=1;
return 0;
}
}
if (!flag) cout<<-1<<" "<<-1<<endl;
return 0;
}
| 0
| 82,946,729
|
#include <stdio.h>
int main(){
char c;
scanf("%c", &c);
if(c >= 'A' && c <= 'Z'){printf("%c", ++c)
;}
else if(c >= 'a' && c <= 'z'){printf("%c", ++c);}
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
namespace you {
std::string to_string(char val) {
return std::string(1, val);
}
}
vector<ll> h(16);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n,k;
cin>>n>>k;
rep(i,n) cin>>h[i];
int now=h[0];
int see=1;
for(int i=1;i<n;i++){
if(now<h[i]){
see+=1;
now=h[i];
}
}
if(k<=see) cout<<0<<endl;
else{
ll ans=pow(10,12);
int num=pow(2,n-1);
for(int i=0;i<num;i++){
ll cur=0;
int max_h=h[0];
int c=1;
for(int j=0;j<n-1;j++){
int now_h=h[j+1];
if((i>>j)&1){
if(now_h<=max_h){
cur+=(max_h+1-now_h);
now_h=max_h+1;
}
c+=1;
}
if(max_h<now_h) max_h=now_h;
}
if(k<=c) ans=min(ans,cur);
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 7,068,947
|
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#define FORD1(i, n) for (int i = (int)n; i >= 1; i--)
#define FORS(i, n) for(; i < (int)(n); i++)
#define debug(X) { cout << #X << " = " << (X) << endl; }
#define printArr(A,n) { cout << #A << " = "; FOR(i,n) cout << A[i] << ' '; cout << endl; }
using namespace std;
vi len((int)3e5);
int n;
bool check(int x){
unordered_map<int, int> s;
int prev = len[0];
priority_queue<int> q;
FOR1(i, n-1){
if(len[i] <= prev){
if(x == 1)return false;
s[len[i]] += 1;
q.push(len[i]);
int j = len[i];
while(j >= 1 && s[j] == x){
if(j == 1)return false;
s[j] = 0;
j--;
q.push(j);
s[j]++;
}
}else{
while(!q.empty() && q.top() > prev){
s[q.top()] = 0;
q.pop();
}
}
prev = len[i];
}
return true;
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n;
FOR(i, n)cin >> len[i];
int s = 1, e= n;
int ans =n;
while(s <= e){
int mid = (s + e) >> 1;
if(check(mid)){
e = mid -1;
ans = mid;
}else{
s = mid + 1;
}
}
cout << ans;
}
|
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
#define int long long
signed main() {
int n;cin >> n;
vi a(n+1),b(n);
rep(i, n+1) cin >> a[i];
rep(i, n) cin >> b[i];
int count = 0;
rep(i, n) {
if(a[i]>=b[i]) {
a[i]-=b[i];
count+=b[i];b[i]=0;
}
else {
b[i]-=a[i];
count+=a[i];a[i]=0;
}
if(a[i+1]>=b[i]) {
a[i+1]-=b[i];
count+=b[i];b[i]=0;
}
else {
b[i]-=a[i+1];
count+=a[i+1];a[i+1]=0;
}
}
cout << count << endl;
return 0;
}
| 0
| 6,024,904
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N; int64_t ans = 0;
map<string, int64_t> memo;
for (int i = 0; i < N; i++) {
string s; cin >> s;
sort(s.begin(), s.end());
memo[s]++;
}
for (auto x : memo) {
int64_t tmp = x.second;
ans += tmp * (tmp - 1) / 2;
}
cout << ans << endl;
}
|
#include <iostream>
void show_ret(int home[][10], bool use_partition) {
for(int i= 0; i < 3; i++) {
for(int j = 0; j < 10; j++) {
std::cout << " " << home[i][j];
}
std::cout << std::endl;
}
if(use_partition) std::cout << "####################" << std::endl;
}
int main(int argc, char *argv[]) {
int home1[3][10] = {{0}};
int home2[3][10] = {{0}};
int home3[3][10] = {{0}};
int home4[3][10] = {{0}};
int n, b, f, r, v = 0;
std::cin >> n;
for(int i = 0; i < n; i++) {
std::cin >> b >> f >> r >> v;
switch(b) {
case 1:
home1[f-1][r-1] += v;
break;
case 2:
home2[f-1][r-1] += v;
break;
case 3:
home3[f-1][r-1] += v;
break;
case 4:
home4[f-1][r-1] += v;
break;
}
}
show_ret(home1, true);
show_ret(home2, true);
show_ret(home3, true);
show_ret(home4, false);
return 0;
}
| 0
| 9,688,841
|
#include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n, m;
cin >> n >> m;
if(n == 0)
return 0;
vector<pair<int, int> > a(n);
for(int i=0; i<n; ++i)
cin >> a[i].second >> a[i].first;
sort(a.rbegin(), a.rend());
int ret = 0;
for(int i=0; i<n; ++i){
ret += max(0, a[i].second - m) * a[i].first;
m -= min(m, a[i].second);
}
cout << ret << endl;
}
}
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<P,P> PP;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=9999999999;
int dpl[3010][3010];
int dpr[3010][3010];
int main(){
int n;
cin>>n;
map<ll,ll> mp;
vector<ll> canuse(0);
for(int i=0;i<n;i++){
ll a;
cin>>a;
mp[a]++;
if(mp[a]==2) canuse.push_back(a);
if(mp[a]==4) canuse.push_back(a);
}
if(canuse.size()<2){
cout<<0<<endl;
return 0;
}
sort(canuse.begin(),canuse.end(),greater<ll>());
ll ans=canuse[0]*canuse[1];
cout<<ans<<endl;
}
| 0
| 45,196,915
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
n--;
cout << n * (n + 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string b;
char base[2][2] = {{'A','T'},{'C','G'}};
cin >> b;
for(int i=0;i<2;i++) {
for (int j=0;j<2;j++) {
if(b[0] == base[i][j]) {
cout << base[i][(j+1)%2] << endl;
break;
}
}
}
return 0;
}
| 0
| 27,469,423
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
vector<int> h(N);
REP(i, N) cin >> h[i];
ll ans = 0;
for (int num = 1; num < 101; num++) {
bool pooring = false;
REP(i,N){
if(num<=h[i]){
pooring = true;
}else{
if(pooring){
pooring = false;
ans++;
}
}
}
if (pooring) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n,m;cin>> n >> m;
priority_queue<int> q;
for(int i = 0; i < n; i++) {
int a;cin >> a;
q.push(a);
}
for(int i = 0; i < m; i++) {
int x=q.top();
q.pop();
x/=2;
q.push(x);
}
ll sum=0;
for(int i = 0; i < n; i++) {
int x=q.top();
q.pop();
sum += x;
}
cout << sum << endl;
return 0;
}
| 0
| 59,402,868
|
#include<bits/stdc++.h>
int main(){
int h,w,a,b;
std::cin>>h>>w>>a>>b;
for(int i=0;i<b;i++){
for(int j=0;j<a;j++){
std::cout<<"1";
}
for(int j=a;j<w;j++){
std::cout<<"0";
}
std::cout<<std::endl;
}
for(int i=b;i<h;i++){
for(int j=0;j<a;j++){
std::cout<<"0";
}
for(int j=a;j<w;j++){
std::cout<<"1";
}
std::cout<<std::endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll ra = 0, lb = 0, ba = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 2) if (s[i][j] == 'A' && s[i][j + 1] == 'B') ans++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ba++;
else if (s[i][0] == 'B')
lb++;
else if (s[i][s[i].size() - 1] == 'A')
ra++;
}
if (ba == 0)
ans += min(lb, ra);
else {
if (lb + ra > 0)
ans += ba + min(lb, ra);
else
ans += ba - 1;
}
cout << ans << endl;
return 0;
}
| 0
| 2,641,705
|
#include<bits/stdc++.h>
using namespace std;
int checkSize( int X );
int F( int A, int B );
int main( void )
{
long int N;
int max, min;
long int A, B;
cin >> N;
min = 1000;
for( long int i = 1; i * i <= N; i++ ) {
if( i * ( N / i ) == N ) {
A = i;
B = N / i;
if( N % A != 0 ) {
continue;
}
max = F( A, B );
if( max < min )
min = max;
}
}
cout << min << endl;
}
int F( int A, int B )
{
A = checkSize( A );
B = checkSize( B );
if( A > B )
return A;
else
return B;
}
int checkSize( int X )
{
int count = 0;
while( X ) {
X /= 10;
count++;
}
return count;
}
|
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S;
cin >> S;
int e = S.size();
while (e > 0) {
if (S.substr(e - 2, 2) == "er") {
if (S.substr(e - 6, 6) == "eraser") {
e -= 6;
continue;
} else if (S.substr(e - 7, 7) == "dreamer") {
e -= 7;
continue;
}
}
if (S.substr(e - 5, 5) == "erase") {
e -= 5;
continue;
} else if (S.substr(e - 5, 5) == "dream") {
e -= 5;
continue;
} else {
cout << "NO" << endl;
exit(0);
}
}
cout << "YES" << endl;
}
| 0
| 91,535,348
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 100000000
#define LINF 9000000000000000000
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
int a,b;
int dp[20][20];
bool no[20][20];
void init(){
rep(i,20){
rep(j,20){
dp[i][j]=no[i][j]=0;
}
}
}
void DP(){
REP(i,1,a+1){
REP(j,1,b+1){
if(no[i][j])dp[i][j]=0;
else if(i==1&&j==1)dp[i][j]=1;
else dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
}
int main(){
int n,x,y;
while(1){
scanf("%d%d",&a,&b);
if(a==0&&b==0)break;
init();
cin>>n;
rep(i,n){
scanf("%d%d",&x,&y);
no[x][y]=true;
}
DP();
cout<<dp[a][b]<<endl;
}
return 0;
}
|
#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
struct edge{int to,cost;};
const ll MOD=10007;
const ll INF=1000000000;
const int MAX=100001;
typedef pair<int,int> P;
int d[100010];
vector<edge> G[100010];
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P>> que;
fill(d,d+100010,INF);
d[s]=0;
que.push(P(0,s));
while(!que.empty()){
P p=que.top();
que.pop();
int v=p.second;
if(d[v]<p.first){
continue;
}
for(int i=0;i<G[v].size();i++){
edge e=G[v][i];
if(d[e.to]>d[v]+e.cost){
d[e.to]=d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
int main(){
ios::sync_with_stdio(false);
int k;
cin>>k;
for(int i=0;i<k;i++){
G[i].push_back({(i+1)%k,1});
G[i].push_back({(i*10)%k,0});
}
dijkstra(1);
cout<<d[0]+1<<endl;
}
| 0
| 69,653,736
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll fac(ll n){if(n<=1)return 1; else return n*fac(n-1);}
int main()
{
ll n;
cin >> n;
string s;
cin >> s;
if(n%2)cout << "No" << endl;
else
{
if(s.substr(0,n/2)==s.substr(n/2,n/2))cout << "Yes" << endl;
else cout <<"No"<< endl; }
}
|
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",stdout);
#endif
ios_base :: sync_with_stdio(false);
cin.tie(NULL) ;
cout.tie(NULL);
}
signed main()
{
fastio();
int t=1;
while(t--)
{
int n,c=0,m=0;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n-1;i++){
if(a[i]>=a[i+1])
c++;
else
{
m=max(c,m);
c=0;
}
}
m=max(c,m);
cout<<m;
}
}
| 0
| 14,385,710
|
#include<bits/stdc++.h>
using namespace std;
int main()
{int a,b,c;
cin>>a>>b>>c;
int q[a],w[b],n,m,k;
int ans=INT_MAX,a1=INT_MAX,a2=INT_MAX;
for(int i=0;i<a;i++)cin>>q[i],a1=min(a1,q[i]);
for(int i=0;i<b;i++)cin>>w[i],a2=min(a2,w[i]);
while(c--)
{
cin>>n>>m>>k;
ans=min(ans,(q[n-1]+w[m-1]-k));
}cout<<min(ans,a1+a2);
return 0;
}
|
#include <iostream>
#include <cstring>
using namespace std;
int main() {
int k=0,times[1000] = {0},top,topsoeji,hantei,sizetop,sizetopsoeji,size[1000] = {0};
char word[1000][32];
string str;
while (cin >> str) {
for(int i=0;i<str.size();i++) {
word[k][i] = str[i];
size[k] = str.size();
if(size[k] > sizetop) {
sizetop = size[k];
sizetopsoeji = k;
}
}
k++;
}
for(int i=0;i<k;i++) {
for(int j=i+1;j<k;j++) {
if(strcmp(word[i],word[j]) == 0)
hantei = 1;
else
hantei = 0;
if(hantei) {
times[i]++;
times[j]++;
}
}
}
top = times[0];
topsoeji = 0;
for(int i=0;i<k;i++) {
if(times[i] > top) {
top = times[i];
topsoeji = i;
}
}
cout << word[topsoeji] << " " << word[sizetopsoeji] << endl;
}
| 0
| 33,691,590
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
long ans = 0;
if (a % 2 == 1) {
ans ^= a;
a++;
}
if (b % 2 == 0) {
ans ^= b;
b--;
}
if (a < b) {
ans ^= (b - a + 1) / 2 % 2;
}
cout << ans << endl;
return 0;
}
|
#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--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll mc = (n - 1) * (n - 2) / 2;
if (k > mc) {
cout << -1 << endl;
return 0;
}
vector<pair<ll, ll>> ans;
reps(i, 1, n) ans.push_back(make_pair(0, i));
ll cut = mc - k;
reps(i, 1, n) {
reps(j, i + 1, n) {
if (cut == 0) break;
ans.push_back(make_pair(i, j));
cut--;
}
if (cut == 0) break;
}
printf("%lld\n", sz(ans));
rep(i, sz(ans)) {
printf("%lld %lld\n", ans[i].first + 1, ans[i].second + 1);
}
return 0;
}
| 0
| 81,751,553
|
#include "bits/stdc++.h"
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
long long M = max({ A,B,C });
long long sum;
if (M % 2 == (A + B + C) % 2) {
sum = M - A + M - B + M - C;
}
else {
sum = M + 1 - A + M + 1 - B + M + 1 - C;
}
cout << sum / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int h, w; cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i];
}
queue<pair<int, int>> q;
vector<vector<int>> d(h, vector<int>(w, -1));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (a[i][j] == '#') {
d[i][j] = 0;
q.push(make_pair(i, j));
}
}
}
while (!q.empty()) {
auto p = q.front();
q.pop();
int x = p.first;
int y = p.second;
for (int i = 0; i < 4; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || h <= nx || ny < 0 || w <= ny) continue;
if (d[nx][ny] != -1) continue;
d[nx][ny] = d[x][y] + 1;
q.push(make_pair(nx, ny));
}
}
int ans = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
ans = max(ans, d[i][j]);
}
}
cout << ans << endl;
}
| 0
| 76,925,010
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[4]={1,0,-1,0};
const ll dx[4]={0,-1,0,1};
ll modfac(ll a){
ll ans=1;
while(a>1){
ans*=a;
ans%=1000000007;
a--;
}
return ans;
}
ll modinv(ll a,ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
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) {
a = b;
return true;
}
return false;
}
int main(){
ll n;cin >> n;
vl v(n);
rep(i,n)cin >> v[i];
rep(i,n)v[i]-=(i+1);
sort(all(v));
ll x,y=0;
if(n%2==1)x=v[n/2];
if(n%2==0){
x=(v[n/2]+v[n/2-1])/2;
if((v[n/2]+v[n/2-1])%2==1)y=x+1;
}
ll ans1=0,ans2=0;
rep(i,n)ans1+=abs(v[i]-x);
rep(i,n)ans2+=abs(v[i]-y);
cout << min(ans1,ans2) <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s;
cin >> s;
ll n=s.size(), ans=INF;
string a, b;
ll tmp1=0,tmp2=0;
rep(i,n){
a += "10";
b += "01";
}
rep(i,n){
if(s[i] != a[i]) tmp1++;
if(s[i] != b[i]) tmp2++;
}
ans = min(tmp1, tmp2);
cout << ans << endl;
return 0;
}
| 0
| 75,238,382
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vl x(n), y(n);
ll flag = -1;
rep(i,n){
cin >> x[i] >> y[i];
if(flag < 0){
flag = abs(x[i]+y[i])%2;
}else if(abs(x[i]+y[i])%2 != flag){
cout << "-1\n";
return 0;
}
}
ll nw = 1;
if(flag){
cout << "40\n";
rep(i,40){
cout << nw << " ";
nw *= 2;
}
cout << "\n";
}else{
cout << "40\n";
cout << nw << " ";
rep(i,39){
cout << nw << " ";
nw *= 2;
}
cout << "\n";
}
rep(i,n){
if(!flag) cout << 'R', x[i]--;
string s;
ll val = nw / 2;
while(val){
if(y[i] > x[i]){
if(y[i] > -x[i]){
s.pb('U');
y[i] -= val;
}else{
s.pb('L');
x[i] += val;
}
}else{
if(y[i] > -x[i]){
s.pb('R');
x[i] -= val;
}else{
s.pb('D');
y[i] += val;
}
}
val /= 2;
}
reverse(all(s));
cout << s << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v.end()
#define forn(i, n) for(ll i=0;i<(ll)n;i++)
#define fi first
#define se second
int main() {
int k;
cin >> k;
queue<ll> q;
for(int i = 1; i < 10; i++)
q.push(i);
ll prev;
while(k--) {
ll t = q.front();
prev = t;
q.pop();
if(t%10!=0) q.push(10*t+(t%10)-1);
q.push(10*t + t%10);
if(t%10!=9) q.push(10*t + t%10 +1);
}
cout << prev << endl;
return 0;
}
| 0
| 6,721,142
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void abc_170a();
void abc_171a();
void abc_172a();
void abc_173a();
void abc_174a();
void abc_175a();
void abc_170b();
void abc_171b();
int main()
{
abc_171b();
}
void abc_170a()
{
vector<int> x(5);
for (int i = 0; i < 5; ++i) cin >> x[i];
for (int i = 0; i < 5; ++i)
{
if (x[i] == 0)
{
cout << i + 1 << "\n";
return;
}
}
}
void abc_171a()
{
char c;
cin >> c;
if (c == tolower(c)) cout << "a\n";
else cout << "A\n";
}
void abc_172a()
{
int a;
cin >> a;
cout << a + a * a + a * a * a << "\n";
}
void abc_173a()
{
int N;
cin >> N;
if (N % 1000) cout << 1000 - N % 1000 << "\n";
else cout << "0\n";
}
void abc_174a()
{
int x;
cin >> x;
if (x >= 30) cout << "Yes\n";
else cout << "No\n";
}
void abc_175a()
{
string s;
cin >> s;
int cnt = 0, tmp = 0;
for (int i = 0; i < s.size(); ++i)
{
if (s[i] == 'S')
{
tmp = 0;
}
else
{
++tmp;
cnt = tmp;
}
}
cout << cnt << "\n";
}
void abc_170b()
{
int x, y;
cin >> x >> y;
for (int i = 0; i <= x; ++i)
{
int n_c = i, n_t = x - i;
if (n_c * 2 + n_t * 4 == y)
{
cout << "Yes\n";
return;
}
}
cout << "No\n";
}
void abc_171b()
{
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i = 0; i < N; ++i) cin >> p[i];
sort(p.begin(), p.end());
int price = 0;
for (int i = 0; i < K; ++i)
{
price += p[i];
}
cout << price << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
bool custom (vector<int> &a, vector<int> &b) {
return (a.size() < b.size());
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> r(n);
vector<pair<int, int>> b(n);
vector<vector<int>> rpp(n);
vector<vector<int>> bpp(n);
for(int i=0;i<n;i++) {
cin >> r[i].first >> r[i].second;
}
for(int i=0;i<n;i++) cin >> b[i].first >> b[i].second;
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
if(r[i].first < b[j].first && r[i].second < b[j].second) {
rpp[i].emplace_back(j);
bpp[j].emplace_back(i);
}
}
}
vector<vector<int>> rp = rpp;
vector<vector<int>> bp = bpp;
sort(rp.begin(), rp.end(), custom);
int ans = 0;
vector<bool> used(n);
for(int i=0;i<n;i++) {
int partner = -1;
int minSize = 101;
for(int j=0;j<rp[i].size();j++) {
if(used[rp[i][j]]) continue;
if(bp[rp[i][j]].size() < minSize) {
partner = rp[i][j];
minSize = bp[rp[i][j]].size();
}
}
if(partner == -1) continue;
ans++;
used[partner] = true;
}
sort(bp.begin(), bp.end(), custom);
int ans2 = 0;
vector<bool> used2(n);
for(int i=0;i<n;i++) {
int partner = -1;
int minSize = 101;
for(int j=0;j<bp[i].size();j++) {
if(used2[bp[i][j]]) continue;
if(rpp[bp[i][j]].size() < minSize) {
partner = bp[i][j];
minSize = rpp[bp[i][j]].size();
}
}
if(partner == -1) continue;
ans2++;
used2[partner] = true;
}
cout << max(ans, ans2) << endl;
}
| 0
| 81,905,855
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int k;
cin>>k;
string s;
cin>>s;
if(s.length()<=k)cout<<s<<endl;
else{
rep(i,k)cout<<s[i];
cout<<"..."<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long x,long y){
if(y==0)return x;
return gcd(y,x%y);
}
long long lcm(long x,long y){
return x*y/gcd(x,y);
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main()
{
int N,A[100010]={},B[100010]={},ans=0,o[100010]={},ocnt=0;
long long Asum=0,Bsum=0,r=0;
cin>>N;
for(int i=0;i<N;i++){
cin>>A[i];
Asum+=A[i];
}
for(int i=0;i<N;i++){
cin>>B[i];
Bsum+=B[i];
if(A[i]>=B[i]){
o[ocnt]=A[i]-B[i];
ocnt++;
}else{
ans++;
r+=B[i]-A[i];
}
}
if(Bsum>Asum){
ans=-1;
}else{
sort(o,o+ocnt);
while(r>0){
ans++;
r-=o[ocnt-1];
ocnt--;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 67,529,004
|
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000000
int main(){
int A,B,M;
cin>>A>>B>>M;
vector<int> a(A),b(B);
for(int i=0;i<A;i++)cin>>a[i];
for(int i=0;i<B;i++)cin>>b[i];
int ans = 1000000;
for(int i=0;i<M;i++){
int x,y,c;
cin>>x>>y>>c;
x--;y--;
ans = min(ans,a[x]+b[y]-c);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
ans = min(ans,a[0]+b[0]);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
int sum=0;
for(int i=0;i<n;i++){
int w;
cin>>w;
arr[i]=w;
sum+=w;
}
int min=sum;
int summy=0;
for(int j=0;j<n;j++){
summy+=arr[j];
if(abs(sum-summy-summy)<min){
min=abs(sum-summy-summy);
}
}
cout<<min<<endl;
}
| 0
| 44,305,269
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
string s;
cin>>s;
int arr[26]={0},cnt=0;
for(int i=0;i<s.length();i++)
{
arr[s[i]-'A']++;
}
for(int i=0;i<26;i++)
if(arr[i])
cnt++;
if(cnt==2)
cout<<"Yes";
else
cout<<"No";
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int n;
main()
{
while(cin>>n,n)
{
int a[1111];
for(int i=0;i<n;i++)cin>>a[i];
int ans=1e9;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int A=abs(a[i]-a[j]);
ans=ans<A?ans:A;
}
}
cout<<ans<<endl;
}
}
| 0
| 59,673,286
|
#include<iostream>
#include<list>
#include<stack>
using namespace std;
int main() {
int N, Q; cin >> N >> Q;
list<int> E[N];
int a, b, p, x;
long counter[N]; for (int i = 0; i < N; i++) counter[i] = 0;
for (int i = 0; i < N-1; i++) {
cin >> a >> b; a--; b--;
E[a].push_back(b); E[b].push_back(a);
}
for (int q = 0; q < Q; q++) {
cin >> p >> x; p--;
counter[p] += x;
}
bool visited[N]; for (int i = 0; i < N; i++) visited[i] = false;
visited[0] = true;
stack<int> S; S.push(0);
while (!S.empty()) {
int u = S.top(); S.pop();
for (auto it = E[u].begin(); it != E[u].end(); it++) {
if (!visited[*it]) {
visited[*it] = true;
counter[*it] += counter[u];
S.push(*it);
}
}
}
for (int i = 0; i < N; i++) cout << counter[i] << endl;
}
|
#include <iostream>
#include <string>
int main()
{
int sum;
while (1) {
sum = 0;
std::string str;
std::cin >> str;
if (str == "0") {
break;
} else {
for (int i = 0; i < str.length(); i++) {
sum += (int)str[i] - 48;
}
}
std::cout << sum << std::endl;
}
return 0;
}
| 0
| 405,045
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
while ( cin >> n, n ) {
int pre = 0;
int asi = 0;
int cnt = 0;
for ( int i = 0; i < n; i++ ) {
string f;
cin >> f;
if ( f == "lu" ) asi |= 1;
if ( f == "ru" ) asi |= 2;
if ( f == "ld" ) asi ^= 1;
if ( f == "rd" ) asi ^= 2;
if ( !pre && asi == 3 ) {
cnt++;
pre = 1;
} else if ( pre && asi == 0 ) {
cnt++;
pre = 0;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
ll A, B, K; cin >> A >> B >> K;
if(A > K) A -= K;
else if(A + B > K) {
B -= K - A;
A = 0;
} else {
A = 0;
B = 0;
}
cout << A << " " << B << endl;
return 0;
}
| 0
| 35,088,484
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,count=0;
cin >> n;
vector<ll>a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(),a.end());
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
vector<ll>x(n-1),y(n-1);
queue<ll>plus;
queue<ll>minus;
for(int i=0; i<n; i++){
if(a[i]>=0)plus.push(a[i]);
else minus.push(a[i]);
}
if(plus.size()==0){
for(int i=0; i<n-2; i++){
ll p = minus.front();
minus.pop();
minus.push(p);
}
ll minus1=minus.front();
minus.pop();
ll minus2=minus.front();
minus.pop();
plus.push(minus2-minus1);
x[count]=minus2;
y[count]=minus1;
count++;
}
if(minus.size()==0){
ll plus1=plus.front();
plus.pop();
ll plus2=plus.front();
plus.pop();
minus.push(plus1-plus2);
x[count]=plus1;
y[count]=plus2;
count++;
}
while(plus.size()>1){
ll P = plus.front();
ll M = minus.front();
plus.pop();
minus.pop();
minus.push(M-P);
x[count]=M;
y[count]=P;
count++;
}
while(minus.size()>0){
ll P = plus.front();
ll M = minus.front();
plus.pop();
minus.pop();
plus.push(P-M);
x[count]=P;
y[count]=M;
count++;
}
ll ans = plus.front();
cout << ans << endl;
for(int i=0; i<n-1; i++) cout << x[i] << " " << y[i] << endl;
return 0;
}
|
#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(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
ll ara[Max];
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=true;
string str;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>a;
ara[a]++;
}
for(i=1; i<=100000; i++)
ara[i]+=ara[i-1];
for(i=1; i<=100000; i++)
{
if(ara[i]==n-ara[i])
{
ans++;
}
}
cout<<ans<<endl;
}
| 0
| 48,743,276
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int s;
cin >> s;
vector<long long int> vec(1000000, 1000000);
vec.at(0) = s;
bool finished = false;
for(long long int i = 1; i < 1000000; i++) {
if(vec.at(i - 1) % 2 == 0) {
vec.at(i) = vec.at(i - 1) / 2;
}
else {
vec.at(i) = vec.at(i - 1) * 3 + 1;
}
for(long long int j = 0; j < i; j++) {
if(vec.at(j) == vec.at(i)) {
cout << i + 1 << endl;
finished = true;
break;
}
}
if(finished) {
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
string s;
cin>>s;
bool flg=true;
for(int i=0;i<s.size();i++){
if(i==a){
if(s.at(i)!='-')
flg=false;
}
else if(s.at(i)<'0'||s.at(i)>'9')
flg=false;
}
if(flg)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0
| 62,985,207
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> t(N+2, 0), v(N+2, 0);
for(int i = 1; i <= N; i++) cin >> t[i];
for(int i = 1; i <= N; i++) cin >> v[i];
vector<int> l(N+2, 0), r(N+2, 0);
for(int i = 2; i < N+2; i++) l[i] = l[i-1] + t[i-1];
for(int i = 1; i < N+2; i++) r[i] = r[i-1] + t[i];
vector<double> maxv;
for(double x = 0; x <= r[N+1]; x += 0.5) {
double minv = 100;
for(int i = 0; i < N+2; i++) {
if( x <= l[i] ) minv = min( minv, v[i] + (l[i] - x) );
if( l[i] < x && x < r[i]) minv = min( minv, (double) v[i] );
if( r[i] <= x ) minv = min( minv, v[i] + (x - r[i]) );
}
maxv.push_back( minv );
}
double ans = 0;
for(int i = 1; i < maxv.size(); i++) ans += 0.5 * (maxv[i] + maxv[i-1]) / 2;
cout << fixed << setprecision(3) << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n,a[100005],b[100005],ans=0;
cin>>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++){
if(a[i]>=b[i]){
a[i]-=b[i];
ans+=b[i];
}
else if(a[i]+a[i+1]>=b[i]){
b[i]-=a[i];
ans+=a[i];
a[i]=0;
a[i+1]-=b[i];
ans+=b[i];
}
else{
ans+=a[i]+a[i+1];
a[i]=0;
a[i+1]=0;
}
}
cout<<ans<<endl;
return(0);
}
| 0
| 74,235,222
|
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
string N;
cin >> N;
int sum = 0;
for( int i = 0; i < N.size(); i++ )
sum += N.at( i ) - '0';
if( sum % 9 == 0 )
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <cstdio>
int fib(int *a,int n){
if(n==0 || n==1)return 1;
else{
int tmp;
if(a[n])tmp = a[n];
else{
tmp = fib(a,n-1) + fib(a,n-2);
a[n] = tmp;
}
return tmp;
}
}
int main(){
int i, n;
int a[45];
for(i=0;i<45;i++)a[i]=0;
scanf("%d",&n);
printf("%d\n",fib(a,n));
return 0;
}
| 0
| 17,371,820
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, k;
cin >> a >> b >> c >> k;
while (a >= b) {
b *= 2;
k--;
}
while (b >= c) {
c *= 2;
k--;
}
if (k >= 0) cout << "Yes\n";
else cout << "No\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; i += 1) {
string s = to_string(i);
if (s.length() % 2 != 0) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 56,295,409
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<long long> S(N + 1, 0);
for (int i = 1; i <= N; ++i) {
S[i] = S[i - 1] + A[i - 1];
}
sort(S.begin(), S.end());
long long ans = 0;
long long len = 1;
for (int i = 0; i <= N; ++i) {
if (i == N) {
ans += len * (len - 1) / 2;
continue;
}
if (S[i] != S[i + 1]) {
ans += len * (len - 1) / 2;
len = 1;
} else {
++len;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#define llint long long
#define inf 1e18
using namespace std;
typedef pair<double, double> P;
llint n;
llint x[1005], y[1005];
llint u[1005], v[1005];
void get(llint u, llint U[])
{
u = (1LL<<39)-1 - u;
for(int i = 0; i < 39; i++){
if(u&(1LL<<(i+1))) U[i] = -1;
else U[i] = 1;
}
}
string calc(llint u, llint v)
{
llint U[45], V[45];
get(u, U), get(v, V);
string ret;
for(int i = 0; i < 39; i++){
if(U[i] > 0){
if(V[i] > 0) ret += "R";
else ret += "U";
}
else{
if(V[i] > 0) ret += "D";
else ret += "L";
}
}
return ret;
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
llint p = abs(x[1]+y[1]) % 2;
for(int i = 1; i <= n; i++){
if(abs(x[i]+y[i]) % 2 != p){
cout << -1 << endl;
return 0;
}
}
for(int i = 1; i <= n; i++) u[i] = x[i]+y[i], v[i] = x[i]-y[i];
bool odd = (abs(u[1])%2);
if(odd) cout << 39 << endl;
else cout << 40 << endl;
for(int i = 0; i < 39; i++) cout << (1LL<<i) << " ";
if(!odd) cout << 1 << endl;
cout << endl;
for(int i = 1; i <= n; i++){
if(!odd) u[i]--, v[i]--;
string ans = calc(u[i], v[i]);
if(!odd) ans += "R";
cout << ans << endl;
}
return 0;
}
| 0
| 38,904,742
|
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,K,m=0;
cin >> N >> K;
vector<ll> V(N);
rep(i,N){
cin >> V.at(i);
}
rep(i,N+1){
for(ll j=N+1;j>i;j--){
ll t=0;
priority_queue<ll,vector<ll>,greater<ll>> Q;
rep(k,i){
t+=V.at(k);
Q.push(V.at(k));
}
if(i+N+1-j>K) break;
for(ll k=N-1;k>j-2;k--){
t+=V.at(k);
Q.push(V.at(k));
}
rep(k,K-(i+N+1-j)){
if(!Q.empty()&&Q.top()<0){
t-=Q.top();
Q.pop();
}
}
m=max(m,t);
}
}
cout << m << endl;
}
|
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
long long int n,m,a,b,c,d,e,f,g,sum;
cin>>n>>m;
a=n*(n-1)/2;
b=m*(m-1)/2;
sum=a+b;
cout<<sum<<endl;
return 0;
}
| 0
| 83,083,491
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str, op, p;
int32_t q, a, b;
cin >> str >> q;
for (int32_t i = 0; i < q; i++) {
cin >> op >> a >> b;
if (op == "print") {
cout << str.substr(a, b - a + 1) << endl;
} else if (op == "reverse") {
reverse(str.begin() + a, str.begin() + b + 1);
} else if (op == "replace") {
cin >> p;
str.replace(str.begin() + a, str.begin() + b + 1, p);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
int main(){
vi a(3);
cin >> a[0] >> a[1] >> a[2];
sort(all(a));
cout << a[0]+a[1]+a[2]*10 << endl;
return 0;
}
| 0
| 36,036,026
|
#include <stdio.h>
#include <iostream>
int main() {
int r;
std::cin >> r;
std::cout << r * r << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << A[K - 1] << "\n";
return 0;
}
| 0
| 33,250,687
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << P / 2 + (P % 2 + A * 3) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define testcases() int var; cin>>var; while(var--)
int length(ull n)
{
int cnt = 0;
while(n)
{
cnt++;
n>>=1;
}
return cnt;
}
void solve(long long N, std::vector<long long> A){
long long tmp = 0;
for(long long a:A)tmp ^= a;
for(int i=0;i<N;++i){
A[i] &= (1ll<<62) - 1 - tmp;
}
vector<long long> lengths(N);
for(int i=0; i<N; i++)lengths[i] = length(A[i]);
vector<ull> buckets[65];
for(int i=0; i<N; i++)buckets[lengths[i]].push_back(A[i]);
ull modified_array[100], m_index = 0;
for(int i=64; i>0; i--)
{
if(buckets[i].size())
{
modified_array[m_index++]=buckets[i][0];
for(int j=1; j<buckets[i].size(); j++)
{
ull temp = buckets[i][0] ^ buckets[i][j];
int len = length(temp);
buckets[len].push_back(temp);
}
}
}
ull ans = 0;
for(int i=0; i<m_index; i++)
if(ans < (ans ^ modified_array[i]))
ans = (ans ^ modified_array[i]);
cout<<tmp + ans * 2<<endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
| 0
| 36,104,100
|
#include <iostream>
#include <math.h>
#include <map>
using namespace std;
int p,q,a,b; double s;
int main() {
scanf("%d%d",&a,&b);
p=a/b;
q=a%b;
s=(double)a/(double)b;
printf("%d %d %f\n",p,q,s);
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
int N,P;cin>>N>>P;
string S;cin>>S;
if(P == 2) {
ll cnt = 0;
rep(i,N) {
int now = S[i] - '0';
if(now % 2 == 0) {
cnt += i + 1;
}
}
cout<<cnt<<endl;
return 0;
} else if(P == 5) {
ll cnt = 0;
rep(i,N) {
int now = S[i] - '0';
if(now % 5 == 0) {
cnt += i + 1;
}
}
cout<<cnt<<endl;
return 0;
}
vector<int> r(N+1,0);
int ten = 1;
map<int,ll> dic;
rep(i,N) {
r[i+1] = (r[i] + (ten * (S[N-1-i] - '0'))) % P;
dic[r[i+1]]++;
ten = (ten * 10) % P;
}
ll ans = 0;
for(auto it = dic.begin();it != dic.end(); ++it) {
ans += ((it->second) * (it->second - 1) / 2);
if(it->first == 0) ans += it->second;
}
cout << ans << endl;
}
| 0
| 19,643,616
|
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#define INF 1000000000000000
#define MOD 1000000007
using PII = pair<int64_t, int64_t>;
using VI = vector<int64_t>;
using VVI = vector<VI>;
using VS = vector<string>;
using VP = vector<PII>;
using i64 = int64_t;
template<typename T> void invec(vector<T> &A){for(T& a:A) cin >> a;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
VS S(N); invec(S);
int ans = 0;
rep(B, 0, N){
bool sym = true;
rep(i, 0, N-1) if (sym) rep(j, i+1, N) {
if (S[i][(j + B) % N] != S[j][(i + B) % N]){
sym = false;
break;
}
}
if (sym) ++ans;
}
cout << ans*N << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int sum;
int main() {
int n, m;
cin >> n >> m;
int a;
rep(i,m) {
cin >> a;
sum += a;
}
cout << max(n-sum, -1) << endl;
return 0;
}
| 0
| 72,112,681
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.