text stringlengths 49 983k |
|---|
#include<stdio.h>
int main(void)
{
int i,a,s,d;
for(i=1;i<=4;i++){
scanf("%d %d",&s,&d);
if(s==1){
s=6000;
}
if(s==2){
s=4000;
}
if(s==3){
s=3000;
}
if(s==4){
s=2000;
}
a=s*d;
printf("%d\n",a);
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int a,b,ans;
for(int i=0;i<4;i++){
cin >> a >> b;
if(a==1)ans=6000*b;
else if(a==2)ans=4000*b;
else if(a==3)ans=3000*b;
else if(a==4)ans=2000*b;
cout << ans << endl;
}
} |
#include <iostream>
using namespace std;
int main(){
int t,n;
for(int i=0;i<4;i++){
cin>>t>>n;
if(t==1)cout<<6000*n<<endl;
else if(t==2)cout<<4000*n<<endl;
else if(t==3)cout<<3000*n<<endl;
else cout<<2000*n<<endl;
}
}
|
#include <iostream>
using namespace std;
int main(){
int a,b;
for (int A=0;A<4;A++){
cin>>a>>b;
if (a==1)cout<<6000*b<<endl;
if (a==2)cout<<4000*b<<endl;
if (a==3)cout<<3000*b<<endl;
if (a==4)cout<<2000*b<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int t,n;
for(int i=0;i<4;i++){
cin >> t >> n;
int re;
if(t==1){
re=6000*n;
}else if(t==2){
re=4000*n;
}else if(t==3){
re=3000*n;
}else if(t==4){
re=2000*n;
}
cout<< re << "\n";
}
return 0;
} |
#include <iostream>
using namespace std;
int price[4] = { 6000, 4000, 3000, 2000 };
int main() {
int t, n;
for (int i=0; i<4; ++i) {
cin >> t >> n;
cout << price[t-1] * n << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
for(int i=0;i<4;i++){
cin >> a >> b;
if(a==1){
cout << b*6000 << endl;
}else if(a==2){
cout << b*4000 << endl;
}else if(a==3){
cout << b*3000 << endl;
}else{
cout << b*2000 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, n, a[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> t >> n;
cout << a[t-1] * n << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int m[] = {6000,4000,3000,2000};
int a, b;
for(int i=0; i<4; i++) {
cin >> a >> b;
cout << b*m[a-1] << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int price[4] = {6000, 4000, 3000, 2000};
void solve()
{
for(int i = 0; i < 4; ++i)
{
int t, n;
cin >> t >> n;
cout << price[t - 1] * n << endl;
}
}
int main()
{
solve();
return(0);
} |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<vector>
#include<map>
using namespace std;
int main(){
int p[5]={0,6000,4000,3000,2000};
int t,n;
for(int i=0;i<4;i++){
scanf("%d %d",&t,&n);
printf("%d\n",p[t]*n);
}
}
|
#include <iostream>
using namespace std;
int main() {
int money[] = { 0, 6000, 4000, 3000, 2000 };
int s, n;
for (int i = 0; i < 4; i++) {
cin >> s >> n;
cout << money[s] * n << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int t,n,i;
for(i=0; i<4; i++){
cin>>t>>n;
if(t==1)cout<<6000*n<<endl;
else if(t==2)cout<<4000*n<<endl;
else if(t==3)cout<<3000*n<<endl;
else if(t==4)cout<<2000*n<<endl;
}
return 0;
}
|
#include <iostream>
int main(){
int cost[] = {0, 6000, 4000, 3000, 2000};
int t,n;
for(int i=0; i<4; i++){
std::cin >> t >> n;
std::cout << cost[t]*n << std::endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int kingaku[] ={6000, 4000, 3000, 2000};
for (int i =0; i < 4; i++){
int t,n;
cin >> t >> n;
cout << kingaku[t-1] * n << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main () {
int a[4]={6,4,3,2},b,c,i;
for (i=0;i<4;i++) {
cin >> b >> c;
cout << a[b-1]*c*1000 << endl;
}
return 0;
}
|
#include<stdio.h>
int main(void)
{
int a,b,i,s;
for(i=0;i<4;i++){
scanf("%d %d",&a,&b);
if(a==1){
s=b*6000;
}
if(a==2){
s=b*4000;
}
if(a==3){
s=b*3000;
}
if(a==4){
s=b*2000;
}
printf("%d\n",s);
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
long long t,n,sum=0;
while(cin>>t>>n){
sum=0;
if(t==1)sum+=6000*n;
else if(t==2)sum+=4000*n;
else if(t==3)sum+=3000*n;
else if(t==4)sum+=2000*n;
cout<<sum<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int val[5] = {0, 6000,4000,3000,2000};
rep(i,4){
int t, n;
cin >> t >> n;
cout << val[t]*n << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
const int p[] = {6000,4000,3000,2000};
int main(){
int t,n;
for(int i=0;i<4;i++){
cin >> t >> n;
cout << p[t-1] * n << endl;
}
} |
#include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 4; i++) {
int t, n; cin >> t >> n;
if (t == 1) cout << 6000 * n << endl;
if (t == 2) cout << 4000 * n << endl;
if (t == 3) cout << 3000 * n << endl;
if (t == 4) cout << 2000 * n << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int t,n,price[4]={6000,4000,3000,2000};
for(int i=1;i<=4;++i){
cin>>t>>n;
cout<<price[t-1]*n<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int s[5] = { 0,6000,4000,3000,2000 };
int a, b;
for (int i = 0; i < 4; i++) {
cin >> a >> b;
cout << s[a] * b << endl;
}
}
|
#include <iostream>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
int main(){
int price[] = {0, 6000, 4000, 3000, 2000};
REP(i, 4){
int t, n;
std::cin >> t >> n;
std::cout << price[t] * n << std::endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int a,b;
for(int i=0;i<4;i++){
cin>>a>>b;
if(a==1)
cout<<b*6000<<endl;
if(a==2)
cout<<b*4000<<endl;;
if(a==3)
cout<<b*3000<<endl;
if(a==4)
cout<<b*2000<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int t,n;
for(int i=0;i<4;i++){
cin>>t>>n;
if(t==1){
cout<<n*6000<<'\n';
}else if(t==2){
cout<<n*4000<<'\n';
}else if(t==3){
cout<<n*3000<<'\n';
}else{
cout<<n*2000<<'\n';
}
}
return(0);
}
|
#include<iostream>
using namespace std;
int main(){
int tick, n;
int temp[5] = {0, 6000, 4000, 3000, 2000};
for(int i=0;i<4;i++){
cin >> tick >> n;
cout << temp[tick] * n << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
vector<int> v = {6000,4000,3000,2000};
int main(){
for(int i=0;i<4;i++){
int t,n;
cin>>t>>n;
cout<<v[t-1]*n<<endl;
}
} |
#include<stdio.h>
int main(void){
int t,n,i;
for(i=0;i<4;i++){
scanf("%d %d",&t,&n);
if(t==1) printf("%d\n",n*6000);
else if(t==2) printf("%d\n",n*4000);
else if(t==3) printf("%d\n",n*3000);
else printf("%d\n",n*2000);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int tmp[] = {6000,4000,3000,2000};
int main(){
int a,b;
for(int i = 0;i < 4;i++){
cin >> a >> b;
cout << tmp[a-1] * b << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int ticket[]={0,6000,4000,3000,2000};
int t,n;
while(cin>>t>>n)cout<<ticket[t]*n<<endl;
return 0;
} |
#include<stdio.h>
int c[]={0,6000,4000,3000,2000};
int main(){for(int i=0;i<4;i++){int a,b;scanf("%d%d",&a,&b);printf("%d\n",c[a]*b);}} |
#define scanf_s scanf
#include<stdio.h>
int main(void) {
int a, b, i, mo[4] = { 6000,4000,3000,2000 };
for (i = 0; i < 4; i++) {
scanf_s("%d %d", &a, &b);
printf("%d\n", mo[a - 1] * b);
}
return(0);
} |
#include <iostream>
using namespace std;
int main() {
int t,n,s=4;
while(s--) {
cin >> t >>n;
int sum=0;
if(t==1) cout << 6000*n << endl;
else if(t==2) cout << 4000*n << endl;
else if(t==3) cout << 3000*n << endl;
else cout << 2000*n << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int t, n;
for (int i = 0; i < 4; i++) {
cin >> t >> n;
if (t == 1) cout << 6000 * n << endl;
if (t == 2) cout << 4000 * n << endl;
if (t == 3) cout << 3000 * n << endl;
if (t == 4) cout << 2000 * n << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=0;i<4;i++){
int a,b;
cin>>a>>b;
if(a==1){
b*=6000;
}
if(a==2) b*=4000;
if(a==3) b*=3000;
if(a==4) b*=2000;
cout<<b<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int x[4]={6000,4000,3000,2000};
int main(){
int t,n,d[4];
for(int i=0;i<4;i++){ scanf("%d%d",&t,&n); printf("%d\n",n*x[t-1]);}
} |
#include <iostream>
using namespace std;;
int main(){
int t,n;
for(int i=0;i<4;i++){
cin>>t>>n;
if(t==1) cout<<6000*n<<endl;
if(t==2) cout<<4000*n<<endl;
if(t==3) cout<<3000*n<<endl;
if(t==4) cout<<2000*n<<endl;
}
return 0;
}
|
/*
0277:Ticket Sales
*/
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
const int saleTic[4] = { 6000, 4000, 3000, 2000 };
for(int i = 0; i < 4; i++) {
int a, b;
cin >> a >> b;
cout << saleTic[a - 1] * b << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(void)
{
int t,n;
for(int i=0;i<4;i++){
cin>>t>>n;
if(t==1)cout<<n*6000<<"\n";
else if(t==2)cout<<n*4000<<"\n";
else if(t==3)cout<<n*3000<<"\n";
else cout<<n*2000<<"\n";
}
} |
#include<stdio.h>
int main(void)
{
int i,a,b,c;
for(i=1;i<=4;i++){
scanf("%d %d",&a,&b);
if(a==1){
c=6000*b;
}
if(a==2){
c=4000*b;
}
if(a==3){
c=3000*b;
}
if(a==4){
c=2000*b;
}
printf("%d\n",c);
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int i=0;
int a=0;
int b=0;
int s[5];
int n[4]={6000,4000,3000,2000};
for(i=0;i<4;i++){
cin>>a>>b;
a--;
s[i]=n[a]*b;
}
for(i=0;i<4;i++){
cout<<s[i]<<endl;
}
} |
#include<iostream>
using namespace std;
int main(void)
{
int t, n, ans = 0;
for(int i = 0;i < 4; i++){
cin >> t >> n;
if(t == 1) cout << 6000 * n << endl;
if(t == 2) cout << 4000 * n << endl;
if(t == 3) cout << 3000 * n << endl;
if(t == 4) cout << 2000 * n << endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int ticket[]={6000,4000,3000,2000};
int a,b;
int ans[4]={0};
for(int i=0;i<4;i++){
cin >> a >> b;
ans[i] = b * ticket[a-1];
}
for(int i=0;i<4;i++){
cout << ans[i] << endl;
}
} |
#include <iostream>
using namespace std;
int main()
{
int a[4]={6000,4000,3000,2000},b,c;
for(int i=0;i<4;i++){
cin>>b>>c;
cout<<c*a[b-1]<<endl;
}
return 0;
} |
#include<stdio.h>
int main (void)
{
int n,s,m;
int i;
for(i=0;i<4;i++){
scanf("%d %d",&n,&s);
if(n==1){
m=6000*s;
}
else if(n==2){
m=4000*s;
}
else if(n==3){
m=3000*s;
}
else if(n==4){
m=2000*s;
}
printf("%d\n",m);
}
return 0;
} |
#include <stdio.h>
int main(void){
int price[]={0,6,4,3,2};
int t, n;
for (int i=0; i<4; i++){
scanf("%d %d", &t, &n);
printf("%d\n", price[t]*n*1000);
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int nedan[5] = {0,6,4,3,2};
for(int i=0; i<4; i++){
int a,b;
cin>>a>>b;
cout<<nedan[a]*b*1000<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
int n;
for(int i=0;i<4;++i){
cin>>t>>n;
if(t==1)
cout<<6000*n<<endl;
else if(t==2)
cout<<4000*n<<endl;
else if(t==3)
cout<<3000*n<<endl;
else if(t==4)
cout<<2000*n<<endl;
}
}
|
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int N,M,S;
int dp[2][50][3001];
#define AMA (100000)
int solve(){
memset(dp,0,sizeof(dp));
int now;
int next;
int ret = 0;
dp[1][0][0]=1;
for(int m=1;m<=M;m++){
now = m&1;
... |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sst... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
using namespace std;
#define ... |
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
const int MOD = 100000;
int N, M, S;
int dp[50][3010];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
while (cin >> N >... |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 100000;
int main() {
while (true) {
int n, numLimit, sum;
cin >> n >> numLimit >> sum;
if (n == 0)break;
n *= n;
vector<vector<int>> dp(n + 1, vector<int>(sum + 1));
dp[0][0] = 1;
... |
#include<iostream>
#include<algorithm>
using namespace std;
#define reps(i,b,n) for(int i = b ; i < n ; ++i )
#define rep(i,n) reps(i,0,n)
#define INF (1 << 30)
#define MOD 100000
int dp[51][3001],N,M,S;
int main(){
while(cin >> N >> M >> S , N){
fill_n(dp[0],51*3001,0);
dp[0][0] = 1;
for(int i = 1 ; i <=... |
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... |
/* 剰余取り忘れてしもたwガハハw */
#include <stdio.h>
#include <string.h>
int dp[50][3001];
int main() {
while (1) {
int i;
int n, m, s;
int square;
scanf("%d %d %d", &n, &m, &s);
if (n == 0 && m == 0 && s == 0) {
return 0;
}
memset(dp, 0, sizeof(dp... |
#include <cstdio>
#include <algorithm>
int N, M, S;
int dp[2][2001][3001];
int main()
{
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &S);
if (N == 0 && M == 0 && S == 0) { break; }
for (int i = 0; i < M; i++)
{
for (int j = 0;... |
#include<stdio.h>
int main()
{
int N,M,S,i,j,k,MOD=100000;
while(scanf("%d%d%d",&N,&M,&S),N)
{
int dp[50][3001]={1};
for(i=M;i>0;--i)
for(j=N*N;j>0;--j)
for(k=S-i;k>=0;--k)
{
int &r=dp[j][i+k];
r=(r+dp[j-1][k])%MOD;
}
printf("%d\n",dp[N*N][S]);
}
return 0;
} |
#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 (... |
#include<bits/stdc++.h>
using namespace std;int d[51][3210],n,m,s,i,j,k;int main(){while(cin>>n>>m>>s&&n){n*=n;memset(d,0,sizeof(d));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;}return 0;} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... |
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const int mod = 100000;
for(int n, m, s; cin >> n >> m >> s, n;) {
vector<vector<int> > dp(s + 1, vector<int>(n * n + 1, 0));
dp[0][0] = 1;
for(int i = 1; i <= m; ++i) {
for... |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... |
#include <cstdio>
#include <cstring>
using namespace std;
int d[50][3001];
int main() {
int n,m,s;
while(scanf("%d%d%d",&n,&m,&s),n) {memset(d,0,sizeof(d));
d[0][0]=1;for (int i=1;i<=m;++i)for (int j=n*n;j;--j)for (int k=s;k>=i;--k)
d[j][k]=(d[j][k]+d[j-1][k-i])%100000;
printf("%d\n",d[n*n][s]);
}
} |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cctype>
using namespac... |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,M,S;
while(1){
int fie[51][3002]={0};
cin>>N>>M>>S;
if(N==0&&M==0&&S==0)break;
fie[0][0]=1;
for(int i=1;i<=M;i++){
for(int j=N*N;0<=j;j--){
... |
#include <stdio.h>
int dp[50][3333];
int dpw[50][3333];
int main()
{
while(1)
{
int n,m,s;
scanf("%d %d %d",&n,&m,&s);
if(n == 0)
{
break;
}
n *= n;
for(int i = 0; i < n; i++)
{
for(int ii = 0; ii <= s; ii++)
{
dp[i][ii] = 0;
}
}
for(int i = 1; i <= m; i++)
{
for(int ii = 0;... |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n,m,s;
int dp[55][3003];
int main(void){
while(cin >> n >> m >> s && n){
memset(dp,0,sizeof(dp));
dp[n*n][s] = 1;
for(int i = 1; i <= m; i++){
for(int j = 0; j < n*n; j++){
for(int k = 0; k+i <= ... |
#include <iostream>
#include <vector>
template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }
constexpr int MOD = 100000;
bool solve() {
int n, m, s;
std::cin >> n >> m >> s;
if (n == 0) return false;
n *= n;
auto dp = vec(n + 1, vec(s + 1, 0));
dp[0][0] ... |
#include<iostream>
#include<cstdio>
using namespace std;
#define LATTE 100000
int dp[2][2001][3001];
int main(){
int N,M,S;
while(cin>>N>>M>>S, N||M||S){
for(int i=1;i<=M;i++)for(int j=1;j<=S;j++) dp[0][i][j]=dp[1][i][j]=0;
for(int i=1;i<=M;i++){
dp[1][i][i]=1;
}
fo... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for(int i = ... |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int N, M, S;
typedef long long int ll;
int DP[2001][3001];
int MOD = 100000;
int main()
{
while (true){
scanf("%d%d%d", &N, &M, &S);
if (N == 0 && M == 0 && S == 0)break;
for (int i = 0; i <= N*N; i++)for (int j = 0; j <=S; j++)DP[i][j]... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e5;
int main() {
int N, M, S;
while (true) {
cin >> N >> M >> S;
if (N == 0) break;
long long dp[N * N + 1][S + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= N * N; ++i) {
... |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
int n,m,s;
while(cin>>n>>m>>s&&(n||m||s)){
ll dp[51][3001] = {};
dp[0][0]=1;
for(int i=1;i<=m;i++){
for(int j=n*n;j>=1;j--){
for(int k=1;k<=s;k++){
if(k-i>=0)dp[j][k] = ( dp... |
#include<bits/stdc++.h>
using namespace std;
int mod=100000;
int N,M,S;
int dp[2001][3001];
int dpsum[2001][3001];
//int dp1[2009][3009];
int main()
{
while(true){
scanf("%d%d%d",&N,&M,&S);
if(N==0&&M==0&&S==0)break;
for(int i=0;i<=M;i++){
for(int j=0;j<=S;j++){
dp[i][j]=0;dpsum[i][j]=0;
}
}
dp[0][0]=1;
fo... |
#include <iostream>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
int dp[50][3001];
int n, m, s;
const int mod = 100000;
int main() {
while (cin >> n >> m >> s, n || m || s) {
n *= n;
fill(dp[0], dp[n + 1], 0);
dp[0][0] = 1;
FO... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define UNDEF -1
int N,M,S,dp[2001][3001];
int ths(int begin,int end,int count)
{
return ((begin + end) * count) / 2;
}
int main(void)
{
while(true)
{
cin >> N >> M >> S;
if(N == 0 && M == 0 && S == 0)
exit(0);
for(int i = ... |
#include<stdio.h>
#include<algorithm>
using namespace std;
int MOD=100000;
int dp[2001][3001];
int sum[2001][3001];
int main(){
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c),a+b+c){
for(int i=0;i<2001;i++)
for(int j=0;j<3001;j++)
dp[i][j]=dp[i][j]=sum[i][j]=0;
dp[0][0]=1;
for(int i=0;i<=b;i++){
sum[i][0]=... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#d... |
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX_N 7
#define MAX_S 3000
#define MOD 100000
int dp[MAX_N * MAX_N + 1][MAX_S + 1];
int main()
{
int N, M, S;
while (scanf("%d %d %d", &N, &M, &S), N || M || S) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int k = 1; k <= M; ++k) {
fo... |
#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 <bits/stdc++.h>
using namespace std;
const int mod = 1e5;
int main()
{
ios::sync_with_stdio(false), cin.tie(0);
int N, M, S;
while (cin >> N >> M >> S, N | M | S) {
N *= N;
vector<vector<int>> dp(S + 1, vector<int>(N + 1));
dp[0][0] = 1;
for (int i = 1; i <= M; i++) {
for (int j = S; j >= i; j-... |
#include <iostream>
#include <algorithm>
using namespace std ;
const int M = 100000;
int main(){
int n, m, s, dp[50][3001];
while(cin >> n >> m >> s && (n|m|s)){
fill(dp[0], dp[50], 0);
dp[0][0] = 1;
for(int k=1;k<=m;k++){
for(int i=n*n;i>0;i--){
for(int j=k;j<=s;j++){
dp[i][j... |
//y09-6 ビンゴ(2回目)
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace... |
#include<iostream>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
... |
#include<iostream>
using namespace std;
typedef long long ll;
ll mod=100000;
int N,M,S;
ll dp[50][3001];
void init(){
for(int i=0;i<50;i++)
for(int j=0;j<3001;j++)
dp[i][j]=0;
dp[0][0]=1;
}
int main(){
while(1){
cin>>N>>M>>S;
if(N==0&&M==0&&S==0)break;
init();
for(int i=1;i<=N*N;i++){... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
int n,m,s;
while(cin>>n>>m>>s){
if(n==0&&m==0&&s==0)break;
static int dp[2][2300][3300];
rep(i,2)rep(j,2300)rep(k,3300)dp[i][j][k]=0;
... |
#include<bits/stdc++.h>
using namespace std;
int dp[2][2000][3000];
signed main() {
int a, b, c;
while (cin >> a >> b >> c, a || b || c) {
a *= a;
c -= a*(a + 1) / 2;
b -= a;
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int d = 1; d <= a; d++) {
memset(dp[d & 1], 0, sizeof(dp[d & 1]));
for (int... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int dp[2][2300][3300];
int main(){
int n,m,s;
while(cin>>n>>m>>s){
if(n==0&&m==0&&s==0)break;
rep(i,2)rep(j,2300)rep(k,3300)dp[i][j][k]=0;
dp[0][0]... |
#include <iostream>
#include <cstring>
using namespace std;
int n,m,s;
int dp[50][3001];
int main(){
while(cin >> n >> m >> s && n){
n *= n;
m = min(m,s);
memset(dp,0,sizeof(dp));
dp[0][0] = 1;
for(int j = 1 ; j <= m ; j++){
for(int k = s-j ; k >= 0 ; k--){
for(int i = 1 ; i <= n ; i++){
(dp[i][... |
#include<iostream>
using namespace std;
int dp[2][2001][3001];
const int mod = 100000;
int main(){
int n,m,s;
while(cin>>n>>m>>s){
if(n==0)break;
n *= n;
for(int j=0;j<=m;j++)
for(int k=0;k<=s;k++)
dp[0][j][k]=0;
dp[0][0][0]=1;
for(int i=0;i<=n;i++){
int now=i&1;
int n... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep1(i,n) for(int i=1;i<=(n);++i)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define fs first
#define s... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
#define MOD 100000
int N, M, S;
int dp[2][2001][2001];
int T[2001][2001];
int main() {
while (cin >> N >> M >> S) {
if (N == 0 && M == 0 && S == 0) break;
for (int j=1; j<=M; j++) {
for (int k=1; k<=S; k+... |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
constexpr int mod = 100000;
int main() {
int N, M, S;
while(cin >> N >> M >> S, N) {
vector<vector<int>> dp(N * N + 1, vector<int>(S + 1));
dp[0][0] = 1;
for(int i =... |
#include<cstdio>
#include<algorithm>
using namespace std;
static const int MAX_N = 7;
static const int MAX_M = 2000;
static const int MAX_S = 3000;
static const int MOD = 100000;
int N, M, S;
int memo[2][MAX_M + 1][MAX_S + 1];
int main(){
for(;;){
scanf("%d %d %d", &N, &M, &S);
if(N == 0 && M ==... |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAX_N 2000
#define MAX_M 3000
int x[MAX_N + 1][MAX_M + 1];
int y[MAX_N + 1][MAX_M + 1];
int z[50][MAX_M];
int sum = 0;
int main() {
int n, m, s, d, e, f, g;
while (true) {
cin >> n >> m >> s;
if ((n == 0 && m == 0) && s == 0... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int mod=100000;
int dp[2][2001][3001];
int main(){
int n,m,s;
while(cin>>n>>m>>s,n){
fill(dp[0][0],dp[0][0]+2*2001*3001,0);
n*=n;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.