code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
inline int read(){
int f=1,ans=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
return f*ans;
}
const int MAXN=100001;
int m,k... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
vector<int> array(n);
for (int i = 0; i < n; i++) {
cin >> array.at(i);
}
long max = array.at(0);
for (int j = 0; j < n; j++) {
long total = 0;
for (int k = 0; k < n - j; k++) {... | 0 |
#include <stdio.h>
#include <limits.h>
#include <math.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << ... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n, k;
while(cin >> n >> k && (n || k)){
int card[10] = {0};
map<string, int> m;
for(int i = 0; i < n; ++i)
cin >> card[i];
int ans = 0;
if(k == 2){
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
a = min(a,b);
c = min(c,d);
int ans = a+c;
cout << ans << endl;
... | #include<bits/stdc++.h>
using namespace std ;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
int D,G; cin >> ... | 1 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 1 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef p... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
const long long MOD = 1000000007;
int ... | #include<iostream>
#include<cstdio>
const int N=2e5+5;
char s[N];
typedef long long ll;
const ll mod=1e9+7;
int d[N];
int main() {
int n;
scanf("%d",&n);
scanf("%s",s+1);
if(s[1]=='W') return !printf("0");
d[1]=0;
for(int i=2;i<=n+n;i++) {
if(s[i]==s[i-1]) d[i]=d[i-1]^1;
else d[i... | 1 |
#include<iostream>
#include<string>
using namespace std;
#define W 12
#define H 12
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
string mass[W];
void rec(int x, int y)
{
int xx, yy;
int i;
mass[x][y] = '2';
for (i = 0; i < 4; i++) {
yy = y+dy[i];
xx = x+dx[i];
if (yy<0 || H<=yy || xx<0 || W<=xx) co... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int n;
ll a[200001];
ll dp[2][100011][2];
int main(){
cin>>n;
rep(i,n) cin>>a[i];
int l,r,cur=0;
rep(i,2)rep(... | 0 |
#include<stdio.h>
#include<string.h>
int main()
{
char x[100], y[100], z[100];
scanf("%s %s %s", x, y, z);
int lenA = strlen(x);
int lenB = strlen(y);
if(x[lenA - 1] == y[0] && y[lenB - 1] == z[0])
{
printf("YES\n");
}
else
{
printf("NO\n");
}
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | 0 |
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q; cin >> N >> Q;
string S; cin >> S;
vector<int> L(Q);
vector<int> R(Q);
vector<int> A(N);
for (int i=0; i<Q; i++) {
cin >> L[i] >> R[i];
}
int cnt = 0;
A[0] = 0;
for (int i=1; i<N; i++) {
if (S[i] == 'C' && S[i-1]... | #define _GLIBCXX_DEBUG
#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;
Graph G(100010);
vector<bool> seen(100010, false);... | 0 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | /**
* author: souzai32
* created: 13.08.2020 13:17:00
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
sort(a.begin(),a.end());
int c=0;
for(int i=0; i<n;... | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(... | #include<iostream>
main(){
long a,b=-1,n,r;
std::cin>>n;
while(n--){
std::cin>>a;
if(a>b+1)return std::cout<<-1,0;
r+=a>b?1:a,b=a;
}
std::cout<<--r;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int N,Q; cin >> N >> Q;
string S; cin >> S;
vector<int> ans(N, 0);
for(int i = 1; i < N; i++){
if(S[i] == 'C' && S[i-1] == 'A'){
ans... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void){
int n,q; cin >> n >> q;
string S; cin >> S;
vector<int> sum(n+1,0);
int i = 0;
while (i < n) {
if (S[i] == 'A' && S[i+1] == 'C') {
sum[i+1] = sum... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
typedef pair<int,int> ii;
priority_queue<int> q;
vector<ii> v;
int n, sum = 0;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 0 ; i < n ; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
string x, y, z;
x = a.at(i); y = b.at(i); z = c.at(i);
set<string> s{x, y, z};
if (s.size() == 3) {
ans += 2;
} else if (s.size... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
vector <string> v ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
string S;
cin >> S;
int ans = 7;
if(S == "MON") ans = 6;
if(S == "TUE") ans = 5;
if(S == "WED") ans = 4;
if(S == "THU") ans = 3;
if(S == "FRI") ans = 2... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
char h[3]={" \n"};
int main()
{
int w[3],x;
for(int j=0;j<2;j++){
memset(w,0,sizeof(w));
for(int i=0;i<10;i++){
scanf("%d",&x);
if(x>w[0]){w[2]=w[1]; w[1]=w[0]; w[0]=x;}
else if(x>w[1]) {w[2]=w[1]; w[1]=x;}
else if(x>w[2]) w[2]=x;
}
pr... | #include <iostream>
#include <algorithm>
using namespace std;
int main () {
int w[10];
int k[10];
for (int i = 0; i < 10; i++) {
cin >> w[i];
}
for (int i = 0; i < 10; i++) {
cin >> k[i];
}
sort(w, w + 10);
sort(k, k + 10);
int wSum = 0, kSum = 0;
for (int i = 9; i > 6; i--) {
wSum += w[i];
}
for (in... | 1 |
// Problem : E - Colorful Blocks
// Contest : AtCoder - AtCoder Beginner Contest 167
// URL : https://atcoder.jp/contests/abc167/tasks/abc167_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define fastio... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, i0, n) for (int i = i0; i < n; ++i)
// x^y % m
ll mpow(ll x, ll y, ll m = 998244353) {
ll ret = 1;
while (y != 0) {
if (y & 1) ret = (ret * x) % m;
x = (x * x) % m;
y = y >>... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,j,n,x,ans=0;
string s;
bool fA=0,fc=0,noAZ=0;
cin>>s;
if(s[0]!='A'||(s[1]>='A'&&s[1]<='Z')||(s[s... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
if(s[0]!='A'){
cout << "WA\n";
return 0;
}
int i, cnt = 0;
for(i=1; i<l; i++){
if(isupper(s[i])){
if(i==1 || i==l-1 || s[i]!='... | 1 |
#include <iostream>
using namespace std;
#define MIN(a,b) ((a)<(b)?(a):(b))
int main()
{
int P;
int minR=200,minS=200;
int total=0;
for(int i=0; i<4; ++i) {
cin >> P;
total+=P;
minR=MIN(P,minR);
}
for(int i=0; i<2; ++i) {
cin >> P;
total+=P;
mi... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int ma... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 |
#include <cstdio>
#include <stdlib.h>
int main()
{
int s[600];
int t[6];
int c = 0;
char h[4] = {'N', 'S', 'W', 'E'};
int n;
bool a = false;
scanf("%d", &n);
for (int i = 0; i < 6 * n; i++)
{
scanf("%d", &s[i]);
}
for (int i = 0; i < n; i++)
{
while (1)
... | #include<iostream>
using namespace std;
class Dice {
public:
int f[7];
Dice() {}
void roll_x() { roll(1, 4, 6, 3); } // to E
void roll_y() { roll(1, 2, 6, 5); } // to N
void roll_z() { roll(2, 3, 5, 4); } // 上から見て時計回り
void roll(int i, int j, int k, int l) {
int t = f[i]; f[i] = f[j]; f[j] = f[k]; f[k] = f[... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <sstream>
#include <list>
#include <map>
#define rep(i,p,n) ... | #include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,0,-1,1,-1,-1,1,2,0,-2,0};
const int dy[]={0,1,-1,0,1,1,-1,-1,0,2,0,-2};
const int INF = 1<<30;
const double EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#defin... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[5010];
const int INF = 1e12+10;
int32_t main() {
ios::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
vector<pair<int,int> > v(n);
for(int i=0;i<n;i++)
{
cin>>v[i].first>>v[i].second;
}
sort(v.begin(), v... | #include <bits/stdc++.h>
#define int long long
using pii=std::pair<int,int>;
using namespace std;
const int maxn = 16, maxmask = 1ll << 16;
int n, a[maxn][maxn], dp[maxmask];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//print(fixed << setprecision(10));
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define repk(i,n,k) for(ll i = k; i < (n); i++)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
double PI = acos(-1.0);
int INF = 1e9;
ll LINF = 1e18... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s; cin >> s;
string c = "abcdefghijklmnopqrstuvwxyz";
bool find_flag = false;
for (int i=0; i<26; i++) {
bool target = false;
for (int j=0; j<s.length(); j++) {
if (c[i] == s[j]) target = true;
}
if (!target) {
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin>>H>>W;
char s[60][60];
int a=0;
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
cin>>s[i][j];
}
}
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(s[i][j]=='#'&&s[i-1][j]!='#'&&s[i+1][j]!='#'&&s[i][j-1]!='#'&&s[i][j+1]!='#'){
... | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;} //13以下対応
bool is_prime(int64_t a){if(a<=1)return false;... | 0 |
#include<iostream>
#include<stdio.h>//printf("%.9f\n",*********);
#include<vector>//文字列.erase(n),vector
#include<algorithm>//next_permutation
#include<set>
#include<string>//char(小文字-32=大文字) to_string,string,char
#include<sstream>
#include<complex>
#include<time.h>
#include<random>
#include<cmath>//min,max
#include<mat... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | 1 |
#include <stdio.h>
int main() {
char str[31], ctr = 0;
scanf("%[^\n]", str);
for(int i = 0; str[i] != '\0'; i++) {
if(str[i] == ' ' && str[i-1] == str[i+1]) {
ctr++;
}
}
if(ctr == 2) {
puts("YES");
}
else {
puts("NO");
}
return 0;
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vl = vector<ll>; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
void chmin(int& a, int b) {
if (a > b) a = b;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> minus, plus;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x >= 0) {
plus.push_back(x);
} else {
minus.push_back(-x);
}
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
lli n, k;
int main(void){
cin >>... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | 0 |
#include<iostream>
#include<vector>
using namespace std;
struct Vertex{
int key;
int parent;
int left;
int right;
};
vector<Vertex> V;
int root=-1;
void Preorder(int r){
cout <<" "<< V[r].key;
if(V[r].left!=-1) Preorder(V[r].left);
if(V[r].right!=-1) Preorder(V[r].right);
return;
}
void Inorder(int r){
if(... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 0 |
#include<stdio.h>
int main()
{
int i,a,w1=0,w2=0,w3=0,k1=0,k2=0,k3=0;
for(i=0;i<10;i++){
scanf("%d",&a);
if(w3<a){
w3=a;
if(w2<a){
w3=w2;
w2=a;
if(w1<a){
w2=w1;
w1=a;
}
}
}
}
for(i=0;i<10;i++){
scanf("%d",&a);
if(k3<a){
k3=a;
if(k2<a){
k3=k2;
k2=a;
if(k... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<end... | 1 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int 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)
{
ll n;
cin>>n;
cout<<... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <cstdlib>
using namespace std;
int main () {
int n,m,i,j,t=0;
int a,b,c,d,f,g,a11,b1,c1,d1,f1,g1;
string s="EEEESEEEESEEEESEEEESESEEEESSEEE";
n=s.size();
int a1[n+1],a2[n+1],a3[n+1],a4[n+1],a... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string a;
cin >> a;
reverse(a.begin(),a.end());
cout << a << endl;
} | #include<iostream>
#include<sstream>
using namespace std;
int main(){
string str;
cin >> str;
std::istringstream stream(str);
for(int i=str.length()-1; i>=0; i--){
stream >> str[i];
}
cout << str << endl;
return 0;
} | 1 |
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
double expected_value(int n) {
return (double)((1 + n) * n / 2) / (double)n;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> ps(n + 1);
vector<double> comsum(n + 1, 0);
int p;
... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int x;
cin >> x;
long min, max, sum;
min = max = sum = x;
for (int i = 1; i < n; ++i)
{
cin >> x;
if (x < min) min = x;
if (max < x) max = x;
sum += x;
}
cout << min << ' ' <... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c, mn=100000; cin>> a >> b >> c;
mn = min(b+a,mn);
mn= min(b+c,mn);
mn= min(a+c,mn);
cout<<mn<<endl;
return 0;
} | 0 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,q;
ll a[505][505];
ll b[505][505];
int main(){
cin >> n >> m >> q;
for(ll i=0;i<m;i++){
ll l,r;
cin >> l >> r;
a[r][l]++;
}
for(ll i=0;i<=500;i++){
for(ll j=0;j<=500;j++){
b[i][j+1]=b... | 0 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | 0 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;
#def... | #include <iostream>
using namespace std;
class rect {
public:
int h,w;
// 対角線の2乗
int diagonal() {
return h * h + w * w;
}
};
// x > y なら1を返す
int rect_cmp(rect x, rect y) {
if(x.diagonal() > y.diagonal()) return 1;
else if(x.diagonal() == y.diagonal()) {
if(x.h > y.h) return 1;
else return 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> r(n);
vector<int> g(n);
vector<int> b(n);
for(int i=0;i<n;i++){
if(i){
r[i]=r[i-1];
g[i]=g[i-1];
b[i]=b[i-1];
}
if(s[i]=='R') r[i]++;
else if(s[i]=='G') g[i]++;
else... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
#define pi 3.1415926535898... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) { //最大公約数
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
ll digit_sum(ll a){... | #include <stdio.h>
int main()
{
char s[12];
scanf("%s", &s);
s[3]++;
printf("%s\n", s);
return 0;
} | 1 |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<int> s(n), t(n), x(n);
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
}
vector<pair<int, int>> sx(n), tx(n);
for (int i = 0; i <... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct edge {int u, v, cost; };
bool comp(const edge& e1, const edge& e2) {
return e1.cost < e2.cost;
}
class UnionFind {
public:
int g_num;
vector<int> rank, par;
UnionFind() {}
UnionFind(int size) {
rank.... | 0 |
#include <stdio.h>
#include <vector>
using namespace std;
int main(void){
while(true){
int n, m, t1, t2;
scanf("%d\n%d", &n, &m);
if(n == 0 && m == 0) return 0;
vector< vector<int> > G;
for(int i = 0;i < n;++i){
vector<int> V;
G.push_back(V);
}
for(int i = 0;i < m;++i){
scanf("%d %d", &t1, ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m,ans=0;
cin >> n >> m;
while(n!=0||m!=0){
ans = 0;
n++;
vector<int>a(m,0),b(m,0),hito(n,0),one(n,0);
rep(i,m){
cin>>a[i]>>b[i];
if(a[i]==1){
hito[b[i]]++;
one[b[i]]++;
}
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end... | #include <iostream>
#include <cstdio>
using namespace std;
int partition(int A[],int p,int r)
{
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
int tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
int... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
using namespace std;
typedef long long ll;
int ord[100010], low[100010];
int k;
vector<int> G[100010];
vector<pair<int, int>> bridge;
vector<int> articulation;
bool visit[100010] = {};
void dfs(int v, int p, int &k) {
visi... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include<stdio.h>
int main()
{
printf("100 100\n");
int m,n;
scanf("%d%d",&m,&n);
/*
.*.*.*
******
*.*.*.
......
*/
/*for(int i=0;i<50;i++)
{
for(int j=0;j<100;j++)
{
if(m<n&&(m-n)%2==0)
{
m--;
printf(".");
... | 0 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int N,Q;
while(1){
cin>>N>>Q;if(N==0&&Q==0)break;
int n;
int d[10002]={};
for(int i=0;i<N;i++)
{cin>>n;
for(int j=0;j<n;j++)
{int x; cin>>x;d[x]++;}
}
int c=0;int p=0;
for(int i=0;i<10001;i++)
if(d[... | #include <bits/stdc++.h>
using namespace std;
int n, q;
const long long inf = (1ll << 31) - 1;
const int max_n = (1 << 17);
long long seg[max_n * 2 - 1];
long long lazy[max_n * 2 - 1];
void init()
{
int _n = n;
n = 1;
while (n < _n) n *= 2;
fill(seg, seg + 2 * n - 1, inf);
fill(lazy, lazy + 2 * n - 1, i... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
vector<string> dow = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
stri... | #include <iostream>
#include <string>
int main() {
std::string str;
std::cin >> str;
if (str == "MON") {
std::cout << 6;
}
if (str == "TUE") {
std::cout << 5;
}
if (str == "WED") {
std::cout << 4;
}
if (str == "THU") {
std::cout << 3;
}
if (str == "FRI") {
std::cout << 2;
}
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9+7;
long double dist(ll x1, ll y1, ll x2, ll y2){
return sqrt((double)pow(x2-x1, 2) + (double)pow(y2-y1, 2));
}
int main(){
ll... | 0 |
#include <iostream>
#include <vector>
using namespace std;
char news[4]={'N','E','W','S'};
int to_x[4]={0, 1, -1, 0};
int to_y[4]={1, 0, 0, -1};
int main(){
while(1){
int gems;
cin >> gems;
if(gems==0) break;
vector<vector<bool> > map(21,vector<bool>(21,false));
i... | #include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int mask = 0;
for(int i = 0; i < k; i ++) {
int p;
cin >> p;
mask |= (1 << p);
}
for(int i = n; ; i ++) {
int t = i, m = 0;
while(t) m |= (1 << (t % 10)), t /= 10;
if((mask & m) == 0) {
cout << i << endl;
break;
... | 0 |
#include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, ... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
//template functions
/////////////////////////
long Comb(long N,long M){// nCm
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){// nPm
long ans=1;
for(long i=N;i>N... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Downloa... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int main(){
char a;
int j = 0,o = 0,i = 0;
int jlv = 0,olv = 0,ilv = 0;
int mx = 0;
while(scanf("%c",&a) != EOF){
if(a == 10)break;
if(a == 'J'){
if(o != 0 || i != 0 || o != 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int INF = 1e9;
struct Edge{
/*辺の情報を入れる構造体で行き先とコストを表している*/
int to;
ll cost;
Edge(int to, ll cost) : to(to), cost(cost) {}
};
vector<Edge> g[100005];
vector<ll> dist(100005);
void dfs(int u, in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,k;
const long long mod=1e9+7;
long long dp[3010][3010],jie[4000010],ni[4000010];
inline long long ksm(long long x,long long y)
{
long long res=1;
while(y)
{
if(y&1)
res=res*x%mod;
x=x*x%mod;
y>>=1;
}
return res;
}
int main()
{
scanf("%d%d",&n,&k);
if(k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<vector<int>>>grid(h + 2, vector<vector<int>>(w + 2, vector<int>(2, 0)));
vector<vector<int>>blacks(0, vector<int>(2));
for (int i = 1; i < h + 1; i++) {
for (int j = 1; j < w + 1; j++) {
ch... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int k;
string s;
cin >> k >> s;
cout << ((s.size() <= k) ? s : (s.substr(0, k) + "...")) << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string ch="...";
int limit;
while(cin>>limit)
{
string str;
cin>>str;
int size=str.size();
if(size==limit || size<limit)
{
cout<<str<<'\n';
}
else
{
string temp;
... | 1 |
/*
* atcoder/abc092_2nd/c.cpp
*/
// C++ 14
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring> // memset
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T... | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 1 |
#include <iostream>
#include <vector>
using namespace std;
bool isW(char c){
return c=='W';
}
bool isX(char c){
return c=='x';
}
int main(){//D問題
int n;
string s;
cin >> n >> s;
vector<char> t(n);
char assum[4][2] = {{'S', 'S'}, {'S', 'W'}, {'W', 'S'}, {'W', 'W'}};
for(int i=0;i<4;++i){... | #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,... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
f... | 1 |
#include<iostream>
using namespace std;
int main(){
int x,y, y2, z, z3, e;
while(cin>>e&&e!=0){
int min=1e6;
for(y=0;y<=1e3;y++){
y2=y*y;
for(z=0;z<=1e2;z++){
z3=z*z*z;
x=e-y2-z3;
if(min>x+y+z&&x>=0){
min=x+y+z;
}
}
}
cout<<min<<endl;
}
} | #include <iostream>
#include <cmath>
using namespace std;
namespace Solver {
int e;
inline bool Read() {
cin >> e;
return e != 0;
}
inline void Work() {
int m = 1e+8;
for (int z = 0; z * z * z <= e; z++) {
int r = e - z * z * z;
int y = (int)sq... | 1 |
#include <iostream>
int main()
{
int x;
std::cin >> x;
std::cout << x * x * x;
std::cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
cout << a + b + c + max(a, max(b, c)) * ((1 << k) - 1)... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#include<vector>
using namespace std;
int main(){
int N,M;
while(cin>>N>>M,N||M){
int latte[1001],ans=0;
vector<int> comb;
latte[0]=0;
for(int i=1;i<=N;i++){
cin>>latte[i];
}
for(int i=0;i<N;i++){
for(int... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<ll, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define PI 3.14159265358979
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
b +=... | 1 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int x[N];
LL w[N];
int S, n;
int main() {
scanf("%d%d", &n, &S);
For(i, 1, n) scanf("%d%lld", &x[i], &w[i]);
int l = 1, r = n, nxt = 0;
LL ans = 0;
while (x[l] < S &... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * n * n << endl;
}
| #include<iostream>
using namespace std;
int main(){
int x, y=1, i;
cin >> x;
for(i = 0; i < 3; i++){
y = y * x;
}
cout << y << endl;
return 0;
} | 1 |
#include <iostream>
#define ll long long
using namespace std;
bool mx[1003][1003], flag[10004];
ll a[1003], b[1003], ans[1003][1003];
ll prime[10004];
ll gcd(ll x, ll y){
if (y == 0)
return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y){
if (x == 0 || y == 0)
return x + y;
return x / gcd(x, y) * y;
}
int main(){... | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).en... | #include <iostream>
using namespace std;
#include <cmath>
int main(){
int n,x,t; cin >> n >> x >> t;
cout << (long long)ceil((double)n/x)*t << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
getline(cin,s);
int len=s.size()-8;
for(int i=0;i<len;i++)cout<<s[i];
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main()... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void read(int &x)
{
int f=1;
x=0;
char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-')
f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-'0';
s=getchar();
}
x*=f;
}
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
template<class T> inline b... | 1 |
#include <iostream>
#include <bitset>
#include <vector>
#include <sstream>
#include <algorithm>
int main(){
int purchase_num;
int max_cap;
while(std::cin >> purchase_num >> max_cap){
if(purchase_num == 0 && max_cap == 0) break;
std::vector<int> price;
std::string str;
int ... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int p[1000];
int main() {
int n, m;
while (cin >> n >> m, n) {
int sum = 0;
rep(i, n) {
scanf("%d", &p[i]);
sum += p[i];
}
sort(p, p + n, greater<>());
for (int i = m - 1; i < n; i += m) {
sum -... | 1 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string N,m;
cin >> N;
int x,y = 0;
for(int i = 0; i < int(N.size()); i++){
istringstream n;
m = N[i];
n = istringstream(m);
n >> x;
y += x;
}
if (stoi(N) % y == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
... | 0 |
#include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| #include<iostream>
#include<cstdio>
int main() {
int n;
std::cin >> n;
printf("%d\n", n * n * n);
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n = 0;
cin >> n;
vector<ll> a(n);
for(int i = 0;i < n;i++)cin >> a[i];
ve... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
bool isPrime(ll n)
{
if(n==1||n==2||n==3||n==5||n==7)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const do... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = 1;
while (1) {
if ((a-1) * (cnt-1) + a >= b) break;
cnt++;
}
if (b == 1) cout << 0 << endl;
else cout << cnt << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ templ... | #include <iostream>
using namespace std;
int main(){
int N,Q,i,I,M,data,max,result;
int box[100]={};
while(1){
cin>>N>>Q;
if(N==0||Q==0) break;
for(i=1;i<=N;i++){
cin>>M;
for(I=1;I<=M;I++){
cin>>data;
box[data]++;
}
}
max=-1;
for(i=0;i<100;i++){
if(max<box[i]){
max=bo... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | #define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#defin... | 0 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <iomanip>
#include <stack>
#define int long long
#define ld long double
#define dbg(x) cout <<#x<<":"<<x<<'\n';
#define dbg2(x,y) cout<<#x<<":"<<x<<' '<<#y<<":"... | 1 |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
int w = 0 , k = 0 ;
int score[2][10] = {0} ;
for ( int i = 0 ; i < 2 ; i++ )
{
for ( int j = 0 ; j < 10 ; j++ )
{
cin >> score[i][j] ;
}
sort( score[i],score[i]+10 ) ;
reverse( score[i],score[i... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define Rep(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define Repr(i, b, e) for(int (i)... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int n;
int res = 0;
struct node {
int id;
int parent;
};
node v[100];
vector<tuple<int, int, int>> cost;
vector<int> path;
int find(node x){
if(x.parent =... | #include <bits/stdc++.h>
using namespace std;
const int N = 302;
double dp[N][N][N];
int n;
int cnt[4];
int main(){
cin >> n;
for(int i = 0;i < n;i++){
int x;
scanf("%d", &x);
cnt[x]++;
}
for(int k = 0;k <= cnt[3];k++){
for(int j = 0;j <= cnt[2] + cnt[3] - k;j++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for(int i = (a); i <= (b); i++)
#define PER(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pb push_back
#define mk make_pair
#define S second
#define F first
t... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,a,b,c,d,e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n-1)/min({a,b,c,d,e})+5 << endl;
return 0;
} | 0 |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> W(10),K(10);
for(int i=0;i<10;i++) scanf("%d",&W[i]);
for(int i=0;i<10;i++) scanf("%d",&K[i]);
sort(W.begin(),W.end());
sort(K.begin(),K.end());
printf("%d %d\n",W[7]+W[8]... | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int sum[2] = {0}, num[10] = { 0 }, i, j;
for (j = 0; j < 2; j++) {
for (i = 0; i < 10; i++) {
cin >> num[i];
}
sort(num, num + 10);
sum[j] = num[7] + num[8] + num[9];
}
cout << sum[0] << " " << sum... | 1 |
// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecisio... | #include <iostream>
using namespace std;
char judge(int, int, int);
int main() {
int n, pm, pe, pj;
while (true) {
cin >> n;
if (n == 0) break;
for (int i = 0;i < n;i++) {
cin >> pm >> pe >> pj;
cout << judge(pm, pe, pj) << endl;
}
}
}
char judge(int math, int eng, int jap) {
float twoave = (math +... | 0 |
#include <algorithm>
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main()
{
int N;
long long Y;
cin >> N >> Y;
int a, b , c;
a = 0;
while (a <= Y / 10000)
{
b = 0;
while (10000*a + 5000 * b <= Y)
{
c = N - a - b;
if (10000*a + 5000*b + 1000*c == Y)
{ cout << a << "... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(5);
ll minimum=1e18;
rep(i,5){
cin >> a[i];
minimum = min(minimum,a[i]);
}
if(n <= minimum){
cout << 5 << endl;
}else{
ll times ... | 0 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair <int, int>;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
int main()
{
int a;
cin >> a;
ll ans =... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
}
| 0 |
#include<iostream>
using namespace std;
int main(){
int m, d, ans, month, i, total = 0;
while(1){
cin >> m >> d;
if (m == 0) break;
for(i = 1; i < m; i ++){
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12){
total += 31;
}
else if(i == 2){
total += 29;
}
else{
total += 30;
}
}
to... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
vector<vector<pair<ll,ll>>> a(15);
vector<ll> l(15, -1);
ll ... | #include<iostream>
#include<vector>
#include<map>
#include<numeric>
using namespace std;
int mypow(int x, int y);
vector<int> my_bit(int n, int keta);
int main(){
map<int, vector<pair<int, int>>> shogen;
int N, A, x, y, n, sum_;
int ans = 0;
pair<int, int> p;
//インプット
std::cin >> N;
vecto... | 1 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long... | #include<iostream>
#define LL long long
#define INF 0x7fffffff;
using namespace std;
const int maxn=500010;
int a[maxn];
int L[maxn/2+2],R[maxn/2+2];
int n;
LL merge(int left,int mid ,int right){
int n1=mid-left;
int n2=right-mid;
for(int i=0;i<n1;i++)L[i]=a[left+i];
for(int i=0;i<n2;i++)R[i]=a[mid+i];
int i=0,j=... | 0 |
#include <bits/stdc++.h>
#define N_MAX 200002
#define Q_MAX 200002
#define ll long long
using namespace std;
const ll INF = 1000000000000000;
int n, q, a, b;
int pos[Q_MAX];
struct SGTNode
{
ll mindp;
ll min1, min2;
ll lazy;
};
SGTNode dp[N_MAX * 3];
void split (int node)
{
int lson = (node << ... | #include <bits/stdc++.h>
#define de(x) cout << #x << '=' << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define rep(i,j,k) for (int i=j; i<=k; i++)
#define S second
#define F first
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int N = 2e5+10;
/*
dp... | 1 |
#include <iostream>
using namespace std;
int hi[101];
int main() {
int a, b;
cin >> a >> b;
while (a != 0 || b != 0) {
int no = 0, yes = 0;
for (int i = 1; i <= 101; i++) hi[i] = 0;
for (int i = 0; i < a; i++) {
int x; cin >> x;
for (int o = 0; o < x; o++) {
int yay; ... | #include <atcoder/fenwicktree>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, Q, t, a;
cin >> N >> Q;
atcoder::fenwick_tree<ll> ft(N);
for ( int i = 0; i < N; i++ ) {
cin >> a;
ft.add(i, a);
}
vector<ll> ans;
for ( int q = 0; q < Q; q+... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
in... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll, ll>
#define vl vector<ll>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main()
{
ll n;cin>>n;
ll a[n];
for(ll i=0;i<n;i++)
cin>>a[i];
map<ll,ll>m;ll... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void c_write_and_erase(void) {
int n;
cin >> n;
map<long long, int>a;
long long ain;
for (int i = 0; i < n; i++) {
cin >> ain;
if (a.count(ain)) {
a[ain]++;
... | 1 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp = ... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
string s = to_string(n);
ll wa = 0;
for(int i = 0;i < (int)s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int a = 1;
for (int i =0; i < 9; i++) {
int x;
a *= 10;
x = (N % a - N % (a/10)) / (a/10);
S += x;
}
if (N % S == 0){
cout << "Yes";
}
else {
cout << "No";
}
} | 1 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <... | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.