text stringlengths 49 983k |
|---|
//Solution for aoj:0537 Bingo
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const int surplus = 100000;
int N, ans;
int b[2][2001][3001];
int main(){
int n, m, s;
while (cin >> n >> m >> s){
if (!n&&!m&&!s)
return 0;
ans =... |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
void solve(int n,int m,int s){
int dp[50][3010]={0};
dp[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n*n-... |
#include <iostream>
#include <string.h>
using namespace std;
int dp[50][3001];
void solve()
{
int N, M, S;
while(cin >> N >> M >> S, N || M || S)
{
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= M; ++i)
{
for (int j = N * N; j > 0; --j)
{
for (int k = S; k >= i; --k)
{
dp[... |
#include <iostream>
#include <cstring>
using namespace std;
const int mod = 100000;
int main(){
int n,m,s;
int dp[50][3001];
while(cin>>n>>m>>s,n){
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=m;++i){
for(int j=n*n-1;j>=0;--j){
for(int k=0;k<=s-i;+... |
#include <iostream>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
using namespace std;
const int mod = 100000;
int main() {
while (true) {
int n, m, s; cin >> n >> m >> s;
if (n == 0 and m == 0 and s == 0) bre... |
#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se... |
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int dp[2][55][3005];
int n,m,s;
int main(void){
while(1){
cin>>n>>m>>s;
if(!n&&!m&&!s)break;
n*=n;
for(int i=0;i<=n;i++){
for(int j=0;j<=s;j++){
dp[0][i][j]=0;
dp[1][i][j]=0;
}
... |
#include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int N,M,S;
while(scanf("%d %d %d",&N,&M,&S),N) {
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int m=1;m<=M;m++)for(int k=N*N;k>=1;k--)for(int s=m;s<=S;s++) {
dp[k][s]+=dp[k-1][s-m];
if(dp[k][s]>100000)dp[k][s]-=100000;
}
printf("%d\n",dp[... |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <compl... |
#include<cstdio>
#include<algorithm>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define reps(i,n) for(i=1;i<=n;i++)
int dp[50][2][3001];
int main(){
int n,m,s,nn,st,i,j,k;
int t1=0,t2=1;
while(1){
scanf("%d%d%d",&n,&m,&s);
if(n==0)break;
t1=0;
t2=1;
n*=n;
rep(i,50)rep(j,2)rep(k,s+1)d... |
#include <iostream>
using namespace std;
int dp[55][3005];
int n,m,s,i,j,k;
int main(void){
while(1){
cin>>n>>m>>s;
if(!n)break;
n*=n;
for(i=0;i<=n;i++)for(j=0;j<=s;j++)dp[i][j]=0;
dp[0][0]=1;
for(i=1;i<=m;i++)for(j=n;j>0;j--)for(k=i;k<=s;k++)dp[j][k]=(dp[j-1][k-i]+dp[j][k])%100000;
cout... |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=1e9;
const int mod=100000;
int dp[2][3010][50];
i... |
#include <cstdio>
#include <string.h>
using namespace std;
int n, m, s, ans;
int dp[2][2001][3001];
int main(){
while(scanf("%d%d%d", &n, &m, &s) && n && m && s){
for(int i = 1; i <= m; i++)
dp[0][i][i] = 1;
for(int i = 2; i <= n * n; i++){
for(int j = 1; j < m; j++){
... |
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int dp[50][3001];
const int MOD = 100000;
int main() {
while (true) {
int n, m, s;
cin >> n >> m >> s;
if (n == 0) break;
n = n * n;
rep (i, 50) rep (j, 3001) dp[i][j] = 0;
dp[0][0] = 1;
rep (i, ... |
#include<stdio.h>
int main(){
int n,m,s,i,j,w=1e5;
while(scanf("%d%d%d",&n,&m,&s),n){
int d[51][3001]={};d[0][0]=1;
for(i=1;i<=n*n;i++)for(j=i;j<=s;j++){
int &x=d[i][j];x+=d[i-1][j-i]+d[i][j-i];
if(j-1-m>=0)x+=w-d[i-1][j-1-m];x%=w;
}printf("%d\n",d[n*n][s]);
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORE(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
using namespace std;
typedef long long ll;
int DP[2][2001][3001];
int main() {
int N,M,S;
while(cin >> N >... |
#include <vector>
#include <iostream>
using namespace std;
const int mod = 100000;
int N, M, S;
int main() {
while (cin >> N >> M >> S, N) {
N *= N;
M -= N;
S -= N * (N + 1) / 2;
vector<vector<int> > dp(M + 1, vector<int>(S + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < N; i++) {
vector<vector<int> > dp2(M... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
... |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
... |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n);... |
#include<iostream>
using namespace std;
int d[51][3210],n,m,s,i,j,k;
int main(){
while(cin>>n>>m>>s&&n){
n*=n;
for(i=0;i<=n;i++)for(j=0;j<=s;j++)d[i][j]=0;d[0][0]=1;
for(k=1;k<=m;k++){
for(i=n;i;i--){
for(j=k;j<=s;j++){
d[i][j]=(d[i][j]+d[i-1][j-k])%100000;
}
}
}
cout<<d[n][s]<<endl;
}
r... |
#include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n,m,s;
while(scanf("%d %d %d",&n,&m,&s),n) {
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=m;i++)
for(int j=n*n;j>=1;j--)
for(int k=i;k<=s;k++) {
dp[j][k]+=dp[j-1][k-i];
if(dp[j][k]>=100000)dp[j][k]-=100000;
}
p... |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int dp[2][3001][50];
const int mod=100000;
int n,m,s;
int main(){
while(cin>>n>>m>>s&&(n|m|s)){
memset(dp,0,sizeof(dp));
for(int i=0;i<2;i++)dp[i][0][n*n]=1;
for(int i=m;i>=0;i--){
for(int j=0;j<=... |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#i... |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
... |
//AOJ0537 bingo
#include <iostream>
#include <algorithm>
#include <vector>
#define MOD 100000
using namespace std;
int main(){
int n,m,s;
/*int dp[2001][50][3001] = {};
dp[1][1][1] = 1;
dp[1][0][0] = 1;
for(int i = 2;i <= 2000;i++){
for(int j = 0;j <= 49;j++){
for(int k = 0;k <= 3000;k++){
if(j == 0) dp[... |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
const int M = 100000;
int main(){
int n, m, s;
while(cin >> n >> m >> s,n){
... |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... |
#include<iostream>
#include<cstring>
using namespace std;
int n,m,s;
int map[50][3001];
int main(void){
while(1){
cin >> n >> m >> s;
if(n==0 && m==0 && s==0)break;
memset(map,0,sizeof(map));
map[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n*n;j>=1;j--){
for(int k=i;k<=s;k++){
map[j][k]=(map[j][... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstdio>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
const int MAXN = 7, MAXS = 3000 ;
int n, m, s;
unsigned int dp[MAXN * MAXN + 2][... |
#include <iostream>
#include <algorithm>
#include <cstring>
constexpr int MOD=(int)1e5;
constexpr int MAX_S=3000;
int n,m,s;
int dp[50][MAX_S+1];
int main() {
while(std::cin>>n>>m>>s, n+m+s){
std::memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=std::min(m,s);++i){
fo... |
#include<cstdio>
#include<cstring>
#define mod 100000
using namespace std;
int dp[50][3001];
int main()
{
int n,m,s;
while(scanf("%d%d%d",&n,&m,&s),n){
n*=n;
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n;j>0;j--){
for(int l=i;l<=s;l++){
dp[j][l]=(dp[j][l]+dp[j-1][l-i])%m... |
#include <cstdio>
#include <algorithm>
#pragma warning(disable: 4996)
#define MOD 100000
#define MAX_M 2000
#define MAX_S 3000
int N, M, S;
int dp[2][MAX_M + 1][MAX_S + 1];
int main()
{
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &S);
if (N == 0 && M == 0 && S == 0) { break; }
for (... |
//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... |
#include <iostream>
#include <algorithm>
using namespace std;
/*
1からmまでの数をn*n個重複しないように選び、合計がsになるパターンの数を求める。
ナップサック
*/
int n,m,s;
int dp[50][3001];
int main(){
while(cin>>n>>m>>s,n){
//初期化?
for(int i=0;i<50;i++)for(int j=0;j<=3000;j++)dp[i][j]=0;
dp[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n*n... |
#include <iostream>
using namespace std;
void solve(int N, int M, int S) {
int dp[2][M+1][S+1];
dp[0][0][0]=0;
dp[1][0][0]=0;
for(int j=1; j<=M; ++j) {
dp[0][j][0]=0;
dp[1][j][0]=0;
for(int k=1; k<=S; ++k) {
dp[1][j][k]=(k<=j?1:0);
dp[0][j][k]=0;
... |
//びぃあいえぬじぃおぉ＝BINGO!!
#include <cstdio>
int main(void)
{
while (1){
int n, m, s;
scanf("%d%d%d", &n, &m, &s);
int dp[50][3001]={0};
if (n == 0) break;
dp[0][0] = 1;
for (int i = 1; i <= m; i++){
for (int j = n * n; j >= 1; j--){
f... |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0537
// status:
// tag: [DP]
#define SUBMIT
//#define DEBUG
#include <bits/stdc++.h>
using namespace std;
using ui64 = unsigned long long;
using i64 = long long;
const int MOD = 100000;
// dp[i][j] 場所iで今の合計がjになる組み合わせの数
int dp[7 * 7 + 1][3000 + 1];
int N, M... |
#include<iostream>
#include<cstring>
using namespace std;
const int MOD = 100000;
int n, m, s;
int dp[2][2001][3001];
int main()
{
while(cin >> n >> m >> s && n && m && s){
memset(dp, 0, sizeof dp);
int ans = 0;
dp[0][0][0] = 1;
for(int i = 1; i <= n * n; i++){
for(int j = 1; j <= m; j++)
... |
#include <stdio.h>
#include <string.h>
#include <array>
using namespace std;
int n, m, s;
array<array<array<int, 3001>, 2001>,2>memo;
int main()
{
for (;;)
{
scanf("%d %d %d",&n,&m,&s);
if (n == 0)break;
for (int i = 0; i <= n*n; ++i)
{
for (int j = 0; j <= m; ++j)
{
for (int k = 0; k <= s; ++... |
#include <stdio.h>
#include <algorithm>
using namespace std;
int _now[50*3001];
int _next[50*3001];
int main(){
while(1){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
if(n==0&&m==0&&s==0)
break;
int* now = _now;
fill(now,now+(n*n+1)*(s+1),0);
int* next = _next;
fill(next,next+(n*n+1)*(s+1),0);
now[0] = 1... |
#include <iostream>
#include <cstring>
using namespace std;
int n,m,s;
int dp[50][3001];
int main() {
while(cin>>n>>m>>s, n|m|s) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
// ????????????
for (int i=1; i<=m; ++i)
for (int j=n*n; j>0; --j)
for (int k=s; k>=i; --k)
dp[j][k] = (... |
#include<bits/stdc++.h>
using namespace std;
int dp[10][55][3010] = {0};
int main()
{
int N,M,S;
while(scanf("%d%d%d",&N,&M,&S),N + M + S)
{
for(int i = 1; i < N * N + 1; i++)
{
for(int j = 1; j < S + 1; j++)
{
dp[0][i][j] = 0;
}
}
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,s;
while(scanf("%d %d %d",&n,&m,&s),n!=0&&m!=0&&s!=0){
int sum[50][3001] = {};
sum[0][0] = 1;
for(int i=1;i<=m;i++){
for(int j=min(i,n*n);j>0;j--){
for(int k=i;k<=s;k++){
sum[j][k] = (sum[j][k] + sum[j-1][k-i])%100000;
}
}... |
#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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <complex>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <sstream... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <complex>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <sstream... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
struct edge{
int u, v, cost;
edge(int u_, int v_, int cost_){
u = u_; v = v_; cost = cost_;
}
};
bool operator<(const edge &a, const edge &b){
return a.cost < b.cost;
}
// Union-Find
struct union_find{... |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#inclu... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define IINF (INT_MAX)
#define MAX 200
using namespace std;
struct Data{
int from,to,cost,index;
Data(int from=-1,int to=-1,int cost=-1,int index=-1):from(from),to(to),cos... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <string>
#include <cctype>
#include <map>
#include <iomanip>
using namespace std;
#define eps 1e-8
#define pi acos(-1.0)
#define inf 1<<30
#d... |
//58
#include<iostream>
#include<vector>
#include<set>
using namespace std;
struct E{
int x,y,c;
};
int n,m;
int p[100];
int find(int x){
return p[x]==x?x:p[x]=find(p[x]);
}
void unite(int a,int b){
p[find(a)]=find(b);
}
int ds(vector<E> v){
for(int i=0;i<n;i++){
p[i]=i;
}
for(int i=0;i<v.size();i... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <complex>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <sstream... |
#include <bits/stdc++.h>
using namespace std;
#define MAX 110
#define INF INT_MAX
typedef pair<int, int> pii;
struct Edge {
int from, to, cost;
Edge(int from, int to, int cost) :
from(from), to(to), cost(cost) {}
};
int N, M;
vector<Edge> G[MAX], cycle;
int color[MAX];
void dfs(int v, vector<Ed... |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n);... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
typedef long long LL;
#define ... |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <complex>
#include <cmath>
#include <cstdio>
using namespace std;
#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])
#define INF (1ll<<60)
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin... |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#inclu... |
#include <vector>
#include <numeric>
#include <algorithm>
class unionfind {
private:
int size_;
std::vector<int> parent;
std::vector<int> rank;
public:
unionfind() : size_(0), parent(std::vector<int>()), rank(std::vector<int>()) {};
unionfind(int size__) : size_(size__), parent(std::vector<int>(size_)), rank(std:... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <queue>
using namespace std;
#define SZ(v) ((int)(v).size())
const int maxint = -1u>>1;
const int maxn = 100 + 30;
typedef long long ll;
int n, m;
ll adj[maxn][maxn... |
#include<iostream>
#include<vector>
#include<cassert>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0 ; i < int(n); ++i)
int main() {
while (true) {
long long n, m;
cin >> n >> m;
if (n == 0 && m == 0) break;
assert(n >= m);
long long sum = 0, mn = 1234567890123456789LL, m... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... |
#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>
using namespace ... |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cassert>
#include<climits>
#include<map>
#include<set>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define IINF (INT_MAX)
#define MAX 200
using namespace std;
struct Data{
int from,to,cost,inde... |
#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
using namespace std;
#define typec long long
#define V 111
typec g[V][V], w[V];
typec a[V], v[V], na[V];
typec Stoer_W... |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
struct SCC{
int n;
vector<vector<int> > G,rG,T,C;
vector<int> vs,used,belong;
SCC(){};
SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}
void add_edge(int from,int to){
G[from].push_back(to);
rG[to].push_back(from);
}
voi... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... |
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int D_MAX_V=210;
const int D_v_size=210;
struct D_wolf{
int t,r;
long long c;
D_wolf(){t=c=r=0;}
D_wolf(int t1,long long c1,int r1){
t=t1;c=c1;r=r1;
}
};
vector<D_wolf>D_G[D_MAX_V];
int D_level[D_MAX_V];
int D_iter[... |
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int inf = 0x3f3f3f3f ;
const int maxw = 1000 ;
int g[105][105] , w[105] ;
int a[105] , v[105] , na[105] ;
int n , m ;
int mincut( int n ) {
int i , j, pv , zj ;
int best = inf ;
for( i = 0 ; i < n; i ++ ) {
v[i] = i ;
}
whil... |
#include<stdio.h>
#include<algorithm>
#include<vector>
struct S{int f,t,c;}s;
int C(S l,S r){return l.c>r.c;}
int u[100],r[100];
int F(int x)
{
return (u[x]-x?u[x]=F(u[x]):x);
}
void U(int x,int y)
{
x=F(x),y=F(y);
if(r[x]>r[y])u[y]=x;
else if(r[x]<r[y])u[x]=y;
else u[x]=y,++r[y];
}
int main()
{
int n,m,i,a;
whi... |
#include<queue>
#include<cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int INF=1<<29;
template<class T>
struct AdjMatrix:public vector< vector<T> >{
AdjMatrix(int n,const vector<T> &v=vector<T>()):vector< vector<T> >(n,v){}
};
template<class T>
T augment(const AdjMatrix<T> &capa,int s... |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#inclu... |
// I'm the Topcoder
//C
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
//C++
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cctype>
#include <stack>
#include <string>
#include ... |
#include <stdio.h>
#include <string.h>
#define MaxN 110
const int oo = 0x7fffffff;
int g[MaxN][MaxN], d[MaxN];
bool used[MaxN], vst[MaxN];
int main()
{
int min, n, m, max, tmp, pre, cur, a, b, w, cnt;
while (scanf("%d%d", &n, &m), n) {
min = oo, cnt = 0;
memset(g, 0, sizeof(g));
memse... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <complex>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <sstream... |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#inclu... |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#inclu... |
#include<stdio.h>
#include<string.h>
long m,n,a,b,c;
long val[105];
long v[105][105];
int getans(){
int ans,i,j,k,r,s1,s2;
long a[105];
long mark[105];
long w[105];
memset(w,0,sizeof(w));
if (n==2){
return val[0];
}
a[0]=0;
for (i=0;i<n;i++)
mark[i]=1;
ans=val[a[0]];
for (i=1;i<=n-1;i++){
r=0;
m... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <complex>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <sstream... |
#include<bits/stdc++.h>
#define N 105
using namespace std;
struct edge{
int to, num;
};
int n, m;
vector<edge> G[N];
int A, B, minuscost;
int used[N], cost[N];
int dfs(int x){
if(used[x]) return 0;
used[x]=1;
int res=0;
for(int i=0;i<G[x].size();i++){
if(A==G[x][i].num) continue;
if(B==G[... |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
struct Fordfulerson{
const int INF = 1<<28;
struct edge{
int to,cap,rev;
edge(){};
edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){};
};
int n;
vector<vector<edge> > G;
vector<int> used;
Fordfulerson(){};
Fordfulerso... |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstdlib>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(C) (C).begin(),(... |
#include <iostream>
#include <cstring>
#include <climits>
using namespace std;
void solve(string s,string key){
int left = 0, right = 0;
int n = s.length(), m = key.length();
int minLen = INT_MAX, cnt = 0;
string minStr = "";
int level[256];
bool flg[256];
memset(flg,0,sizeof(flg));
memset(level,0,siz... |
#include<list>
#include<set>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i;
string s;
while(getline(cin, s)){
string t=s,u;
while(getline(cin,s)){
if(s.length()==0)
break;
t+=s;
}
if(t... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#ifdef _MSC_VER
#include <agents... |
#include <set>
#include <iostream>
#include <sstream>
#include <vector>
#include <cstdio>
#include <algorithm>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
using namespace std;
int main(){
while(true){
stringstream ss;
string tm... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
#define FOUND 1
#define NOT_FOUND -1
bool compare(string s1, string s2){
if(s1.size() == s2.size()) return s1 < s2;
return s1.size() < s2.size();
}
... |
#include<iostream>
#include<vector>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
int need[255];
bool is_need[255];
void solve(string &a,int num){
pair<int,int> ans;
int tlength=a.size()+1,cnt=0;
int bef=0;
rep(i,a.size()){
if ( is_need[a[i]]==false)continu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string S,K;
const int n = 1<<8;
int getlen(){
int mx[n],res=1e9;
memset(mx,-1,sizeof(mx));
for(int i=0;i<S.size();i++){
int ch = S[i];
mx[ch] = max(mx[ch],i);
int c=0,l=1e9;
for(int j=0;j<K.size();j++)c+=mx[K[j]]>=0,l=min(l,mx[K[... |
#include<iostream>
#include<cmath>
#include<cstdio>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<29)
using namespace std;
void compute(string text,string S)
{
int nt = text.size(),nS = S.size();
int mlen = inf;
string ans;
bool found[nS];
int CNT = 0;
int fpos[nS... |
//47
#include<iostream>
#include<sstream>
#include<string>
#include<map>
#include<algorithm>
#include<set>
using namespace std;
int main(){
for(string si;getline(cin,si),si!="";){
string s;
do{
s+=si;
getline(cin,si);
}while(si!="");
string k;
getline(cin,k);
bool ap[128]={};
... |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n);... |
#include<cstdio>
#include<string>
#include<iostream>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
while(1){
string s,tmp;
while(1){
getline(cin,tmp);
if(tmp=="") break;
s+=tmp;
}
string a; getline(cin,a);
getline(cin,tmp);
if(a=="") break;
int m=a.length();
bool... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <queue>
#include <map>
#include <set>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin... |
//47
#include<iostream>
#include<sstream>
#include<string>
#include<map>
#include<algorithm>
#include<set>
using namespace std;
int main(){
for(string si;getline(cin,si),si!="";){
string s;
do{
s+=si;
getline(cin,si);
}while(si!="");
string k;
getline(cin,k);
cin.ignore();
ma... |
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
#define MAX (1<<24)
int main()
{
string s;
while(getline(cin,s))
{
string str(s), sb;
while(getline(cin, s))
{
if(s.size()==0) break;
str+=s;
}
if(str.size()==0) break;
while(getline(cin, s))
{
i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string buf;
while(getline(cin,buf),buf!=""){
string s=buf;
while(getline(cin,buf),buf!="") s+=buf;
string a;
getline(cin,a);
//cout<<s<<endl<<a<<endl;
int n=a.size();
vector<int> pos[n];
for(int i=0;i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.