September 2014 – Live with passion

10852

Asif NaeemSeptember 30, 2014

#include <iostream>
#include <map>
#include <fstream>

/*
ofstream out;
	out.open("o.txt");
	for(int i=0;i<11000;i++)
		prime[i]=0;


	for(int i=2;i<11000/2;i++)
	{
		if(prime[i]==0)
		for(int j=i+i;j<11000;j+=i)
		{
			prime[j]=1;
		}
	}

	int cnt=0;
	for(int i=2;i<10000;i++)
	{
		if(prime[i]==0)
		{
			out<<i<<",";
			cnt++;
			if(cnt%10==0)
			out<<"\n";
		}

	}
	cout<<cnt<<"\n";
	out.close();
*/
using namespace std;
//int prime[11000];
int prime[1230]={0,2,3,5,7,11,13,17,19,23,29,
31,37,41,43,47,53,59,61,67,71,
73,79,83,89,97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,
179,181,191,193,197,199,211,223,227,229,
233,239,241,251,257,263,269,271,277,281,
283,293,307,311,313,317,331,337,347,349,
353,359,367,373,379,383,389,397,401,409,
419,421,431,433,439,443,449,457,461,463,
467,479,487,491,499,503,509,521,523,541,
547,557,563,569,571,577,587,593,599,601,
607,613,617,619,631,641,643,647,653,659,
661,673,677,683,691,701,709,719,727,733,
739,743,751,757,761,769,773,787,797,809,
811,821,823,827,829,839,853,857,859,863,
877,881,883,887,907,911,919,929,937,941,
947,953,967,971,977,983,991,997,1009,1013,
1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,
1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,
1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,
1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,
1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,
1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,
1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,
1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,
1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,
1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,
1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,
1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,
1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,
1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,
2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,
2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,
2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,
2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,
2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,
2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,
2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,
2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,
2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,
2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,
2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,
2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,
3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,
3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,
3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,
3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,
3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,
3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,
3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,
3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,
3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,
3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,
3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,
3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,
4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,
4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,
4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,
4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,
4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,
4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,
4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,
4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,
4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,
4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,
4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,
4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,
5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,
5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,
5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,
5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,
5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,
5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,
5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,
5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,
5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,
5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,
5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,
5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,
6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,
6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,
6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,
6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,
6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,
6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,
6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,
6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,
6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,
6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,
6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,
7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,
7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,
7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,
7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,
7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,
7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,
7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,
7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,
7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,
7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,
7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,
8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,
8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,
8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,
8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,
8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,
8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,
8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,
8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,
8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,
8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,
8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,
9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,
9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,
9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,
9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,
9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,
9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,
9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,
9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,
9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,
9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,
9901,9907,9923,9929,9931,9941,9949,9967,9973};
int main()
{

	int t,n,x,p;

	cin>>t;

	while(t--)
	{
		cin>>n;

		for(int i=1;i<=1229;i++)
		{
			if(n/prime[i]>1)
			continue;

			if(n/prime[i]==1)
			{
				p=prime[i];
				break;
			}

		}

		cout<<p<<"\n";

	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

#include <iostream>

#include <map>

#include <fstream>

ofstream out;

out.open("o.txt");

for(int i=0;i<11000;i++)

prime[i]=0;

for(int i=2;i<11000/2;i++)

{

if(prime[i]==0)

for(int j=i+i;j<11000;j+=i)

{

prime[j]=1;

}

int cnt=0;

for(int i=2;i<10000;i++)

{

if(prime[i]==0)

{

out<<i<<",";

cnt++;

if(cnt%10==0)

out<<"\n";

}

cout<<cnt<<"\n";

out.close();

using namespace std;

//int prime[11000];

int prime[1230]={0,2,3,5,7,11,13,17,19,23,29,

31,37,41,43,47,53,59,61,67,71,

73,79,83,89,97,101,103,107,109,113,

127,131,137,139,149,151,157,163,167,173,

179,181,191,193,197,199,211,223,227,229,

233,239,241,251,257,263,269,271,277,281,

283,293,307,311,313,317,331,337,347,349,

353,359,367,373,379,383,389,397,401,409,

419,421,431,433,439,443,449,457,461,463,

467,479,487,491,499,503,509,521,523,541,

547,557,563,569,571,577,587,593,599,601,

607,613,617,619,631,641,643,647,653,659,

661,673,677,683,691,701,709,719,727,733,

739,743,751,757,761,769,773,787,797,809,

811,821,823,827,829,839,853,857,859,863,

877,881,883,887,907,911,919,929,937,941,

947,953,967,971,977,983,991,997,1009,1013,

1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,

1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,

1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,

1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,

1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,

1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,

1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,

1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,

1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,

1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,

1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,

1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,

1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,

1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,

2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,

2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,

2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,

2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,

2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,

2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,

2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,

2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,

2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,

2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,

2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,

2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,

3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,

3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,

3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,

3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,

3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,

3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,

3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,

3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,

3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,

3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,

3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,

3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,

4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,

4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,

4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,

4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,

4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,

4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,

4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,

4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,

4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,

4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,

4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,

4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,

5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,

5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,

5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,

5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,

5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,

5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,

5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,

5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,

5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,

5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,

5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,

5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,

6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,

6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,

6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,

6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,

6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,

6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,

6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,

6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,

6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,

6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,

6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,

7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,

7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,

7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,

7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,

7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,

7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,

7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,

7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,

7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,

7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,

7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,

8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,

8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,

8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,

8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,

8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,

8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,

8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,

8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,

8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,

8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,

8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,

9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,

9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,

9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,

9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,

9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,

9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,

9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,

9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,

9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,

9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,

9901,9907,9923,9929,9931,9941,9949,9967,9973};

int main()

{

int t,n,x,p;

cin>>t;

while(t--)

{

cin>>n;

for(int i=1;i<=1229;i++)

{

if(n/prime[i]>1)

continue;

if(n/prime[i]==1)

{

p=prime[i];

break;

}

cout<<p<<"\n";

}

return 0;

}

725

Asif NaeemSeptember 29, 2014

#include <iostream>
#include <stdio.h>
#include <map>
#include <vector>

using namespace std;



map<int,int> m,n;
vector<int> den[80];
vector<int> numer[80];

int main()
{
	int cnt,org;
	for(int i=0;i<80;i++)
	{
		den[i].clear();
		numer[i].clear();
	}

	for(int i=1234;i<=98765;i++)
	{
		if(i%10==0 && i<10000)
		continue;
		org=i;
		m.clear();
		if(i<10000)
		m[0]=1;
		while(org)
		{
			if(m[org%10])
			break;
			m[org%10]=1;
			org/=10;
		}
		if(org)
		continue;
		cnt=1;
		for(int j=i*2;j<100000;j+=i)
		{
			cnt++;

			if(i<10000 && j<10000)
			continue;
			org=j;
			n.clear();
			while(org)
			{
				if(m[org%10]==1 || n[org%10]==1)
				break;
				n[org%10]=1;
				org/=10;
			}
			if(org)
			continue;
			if(i<10000 && n[0]==1)
			continue;

			numer[cnt].push_back(j);
			den[cnt].push_back(i);

		}
	}

	int N,c=0;
	while(cin>>N)
	{

		if(N==0)
		break;

		if(c)
		cout<<"\n";
		c=1;

		if(den[N].size()==0)
		cout<<"There are no solutions for "<<N<<".\n";

		else
		{
			//cout<<den[N].size()<<"\n";
			for(int i=0;i<den[N].size();i++)
			{
				if(numer[N][i]<10000)
				cout<<0;
				cout<<numer[N][i];
				cout<<" / ";
				if(den[N][i]<10000)
				cout<<0;
				cout<<den[N][i]<<" = "<<N<<"\n";
			}
		}
		//cout<<"\n";
	}

	return 0;
}

#include <iostream>

#include <stdio.h>

#include <map>

#include <vector>

using namespace std;

map<int,int> m,n;

vector<int> den[80];

vector<int> numer[80];

int main()

{

int cnt,org;

for(int i=0;i<80;i++)

{

den[i].clear();

numer[i].clear();

}

for(int i=1234;i<=98765;i++)

{

if(i%10==0 && i<10000)

continue;

org=i;

m.clear();

if(i<10000)

m[0]=1;

while(org)

{

if(m[org%10])

break;

m[org%10]=1;

org/=10;

}

if(org)

continue;

cnt=1;

for(int j=i*2;j<100000;j+=i)

{

cnt++;

if(i<10000 && j<10000)

continue;

org=j;

n.clear();

while(org)

{

if(m[org%10]==1 || n[org%10]==1)

break;

n[org%10]=1;

org/=10;

}

if(org)

continue;

if(i<10000 && n[0]==1)

continue;

numer[cnt].push_back(j);

den[cnt].push_back(i);

}

int N,c=0;

while(cin>>N)

{

if(N==0)

break;

if(c)

cout<<"\n";

c=1;

if(den[N].size()==0)

cout<<"There are no solutions for "<<N<<".\n";

else

{

//cout<<den[N].size()<<"\n";

for(int i=0;i<den[N].size();i++)

{

if(numer[N][i]<10000)

cout<<0;

cout<<numer[N][i];

cout<<" / ";

if(den[N][i]<10000)

cout<<0;

cout<<den[N][i]<<" = "<<N<<"\n";

}

//cout<<"\n";

}

return 0;

}

1213

Asif NaeemSeptember 28, 2014

Hint: Start from 1120 not to count same prime.

#include <iostream>

using namespace std;


int dp[1121][15];


int main()
{
	int n,k;
	int prme[189]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,
					131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,
					353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,
					677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,
					811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117, 1123, 1129};


	for(int i=0;i<1121;i++)
	{
		for(int j=0;j<15;j++)
		{
			dp[i][j]=0;
		}
	}

	dp[0][0]=1;
	for(int i=0;i<187;i++)
	{
		for(int j=1120;j>=prme[i];j--)
		{
			for(int k=1;k<=14;k++)
			{
				dp[j][k]+=dp[j-prme[i]][k-1];
			}

		}
	}

	/*for(int i=0;i<189;i++)
        for(int j=1120;j>=prme[i];j--)
            for(int k=1;k<15;k++)
            dp[j][k]+=dp[j-prme[i]][k-1];
            */
	while(cin>>n)
	{
		cin>>k;
		if(n==0 && k==0)
		break;
		cout<<dp[n][k]<<"\n";
	}
	return 0;
}

#include <iostream>

using namespace std;

int dp[1121][15];

int main()

{

int n,k;

int prme[189]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,

131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,

353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,

677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,

811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117, 1123, 1129};

for(int i=0;i<1121;i++)

{

for(int j=0;j<15;j++)

{

dp[i][j]=0;

}

dp[0][0]=1;

for(int i=0;i<187;i++)

{

for(int j=1120;j>=prme[i];j--)

{

for(int k=1;k<=14;k++)

{

dp[j][k]+=dp[j-prme[i]][k-1];

}

/*for(int i=0;i<189;i++)

for(int j=1120;j>=prme[i];j--)

for(int k=1;k<15;k++)

dp[j][k]+=dp[j-prme[i]][k-1];

while(cin>>n)

{

cin>>k;

if(n==0 && k==0)

break;

cout<<dp[n][k]<<"\n";

}

return 0;

}

12335

Asif NaeemSeptember 22, 2014

Problem Solving Head start: Discussion is quoted from this link: So before proceed recall,if a<b<c<d and string is- abcd, there are 24 permutation,where 1-6 permutation start with smallest, here a. 7-12 permutation start with second smallest, here b. 13-18 permutation start with third smallest, here c. 19-24 permutation start with fourth smallest, here d. lets

Continue Reading “12335” →

12302

Asif NaeemSeptember 21, 2014

Theory: Construction of the Nine-Point Circle 1. Draw a triangle ABC. 2. Construct the midpoints of the three sides. Label them as L, M, N. 3. Construct the feet of the altitudes of the triangle ABC. Label them as D, E, F. Label the point of intersection of the three altitudes as H. This

Continue Reading “12302” →

12347

Asif NaeemSeptember 21, 2014

#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>

using namespace std;

int pre[10001];
int in[10001];

ofstream wrt;

int search(int _in[],int a,int len)
{
	for(int i=0;i<len;i++)
	{
		if(_in[i]==a)
		return i;
	}
	return -1;
}
void printPostOrder(int _in[],int _pre[],int n)
{
	int root=search(_in,_pre[0],n);

	if(root!=0)
	printPostOrder(_in,_pre+1,root);
	if(root!=n-1)
	printPostOrder(_in+root+1,_pre+root+1,n-root-1);

	cout<<_pre[0]<<"\n";
	//wrt<<_pre[0]<<"\n";
}

int main()
{
	int i=0;
	int a;

	while(cin>>a)
	{
		//if(a==0)
		//break;
		in[i]=a;//.push_back(a);
		pre[i]=a;//.push_back(a);
		i++;

	}
	//wrt.open("w.txt");
	sort(in,in+i);

	printPostOrder(in,pre,i);

	//wrt.close();
	//for(int i=0;i<)
}

#include <iostream>

#include <vector>

#include <algorithm>

#include <fstream>

using namespace std;

int pre[10001];

int in[10001];

ofstream wrt;

int search(int _in[],int a,int len)

{

for(int i=0;i<len;i++)

{

if(_in[i]==a)

return i;

}

return -1;

}

void printPostOrder(int _in[],int _pre[],int n)

{

int root=search(_in,_pre[0],n);

if(root!=0)

printPostOrder(_in,_pre+1,root);

if(root!=n-1)

printPostOrder(_in+root+1,_pre+root+1,n-root-1);

cout<<_pre[0]<<"\n";

//wrt<<_pre[0]<<"\n";

}

int main()

{

int i=0;

int a;

while(cin>>a)

{

//if(a==0)

//break;

in[i]=a;//.push_back(a);

pre[i]=a;//.push_back(a);

i++;

}

//wrt.open("w.txt");

sort(in,in+i);

printPostOrder(in,pre,i);

//wrt.close();

//for(int i=0;i<)

}

12376

Asif NaeemSeptember 21, 2014

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int value[104];
vector<int> vb[104];
int visit[104];
queue<int> ue;
int learned;
int _next;


int findAns(int a)
{

	int _max=0;
	if(vb[a].size()==0)
	{
		_next=a;
		//learned+=value[a];
		return 0;
	}
	else
	{

		for(int i=0;i<vb[a].size();i++)
		{
			if(value[vb[a][i]]>_max)
			{
				_max=value[vb[a][i]];
				_next=vb[a][i];
			}
		}
		learned+=_max;
		return findAns(_next);
	}
	return 0;
}
int main()
{
	int t,n,m;
	int a,b,c=1;

	cin>>t;

	while(t--)
	{
		cin>>n>>m;

		for(int i=0;i<n;i++)
		{
			cin>>value[i];
			vb[i].clear();
			visit[i]=0;
		}
		for(int i=0;i<m;i++)
		{
			cin>>a>>b;
			vb[a].push_back(b);
		}

		learned=0;
		learned+=value[0];
		findAns(0);
		cout<<"Case "<<c++<<": ";
		cout<<learned<<" "<<_next<<"\n";

	}

	return 0;
}

#include <iostream>

#include <vector>

#include <queue>

using namespace std;

int value[104];

vector<int> vb[104];

int visit[104];

queue<int> ue;

int learned;

int _next;

int findAns(int a)

{

int _max=0;

if(vb[a].size()==0)

{

_next=a;

//learned+=value[a];

return 0;

}

else

{

for(int i=0;i<vb[a].size();i++)

{

if(value[vb[a][i]]>_max)

{

_max=value[vb[a][i]];

_next=vb[a][i];

}

learned+=_max;

return findAns(_next);

}

return 0;

}

int main()

{

int t,n,m;

int a,b,c=1;

cin>>t;

while(t--)

{

cin>>n>>m;

for(int i=0;i<n;i++)

{

cin>>value[i];

vb[i].clear();

visit[i]=0;

}

for(int i=0;i<m;i++)

{

cin>>a>>b;

vb[a].push_back(b);

}

learned=0;

learned+=value[0];

findAns(0);

cout<<"Case "<<c++<<": ";

cout<<learned<<" "<<_next<<"\n";

}

return 0;

}

12372

Asif NaeemSeptember 20, 2014

#include <iostream>

using namespace std;

int main()
{
    int t,l,w,h;
    int c=1;
    cin>>t;

    while(t--)
    {
       cin>>l>>w>>h;

       if(l>20 || w>20 || h>20)
       cout<<"Case "<<c++<<": bad\n";
       else
       cout<<"Case "<<c++<<": good\n";
    }

    return 0;
}

#include <iostream>

using namespace std;

int main()

{

int t,l,w,h;

int c=1;

cin>>t;

while(t--)

{

cin>>l>>w>>h;

if(l>20 || w>20 || h>20)

cout<<"Case "<<c++<<": bad\n";

else

cout<<"Case "<<c++<<": good\n";

}

return 0;

}

12397

Asif NaeemSeptember 20, 2014

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
#include <map>

using namespace std;

map<int,char> mp;

int main()
{
	int n,p;
	string str;

	mp[1]='I';
	mp[5]='V';
	mp[10]='X';
	mp[50]='L';
	mp[100]='C';
	mp[500]='D';
	mp[1000]='M';

	//mp[2]=

	while(cin>>n)
	{
		str="";
		int cnt=0;

		p=0;
		if(n>=1000)
		{
			p=n/1000;
			cnt+=p*4;
			n-=1000*p;
		}


		p=0;
		if(n>=100)
		{
			p=n/100;
			if(p==1)
			cnt+=2;
			else if(p==2)
			cnt+=4;
			else if(p==3)
			cnt+=6;
			else if(p==4 || p==6)//400=CD
			cnt+=5;
			else if(p==5)
			cnt+=3;
			else if(p==7)
			cnt+=7;
			else if(p==8)
			cnt+=9;
			else if(p==9)
			cnt+=6;
			n-=100*p;
		}

		p=0;
		if(n>=10)
		{
			p=n/10;
			if(p==1)
			cnt+=2;
			else if(p==2)
			cnt+=4;
			else if(p==3)
			cnt+=6;
			else if(p==4 || p==6 || p==9)//40=XL
			cnt+=4;
			else if(p==5)
			cnt+=2;
			else if(p==7)
			cnt+=6;
			else if(p==8)
			cnt+=8;
			n-=10*p;
		}

		if(n!=0)
		{
			if(n==4 || n==6 || n==9)
			cnt+=3;
			else if(n==7)
			cnt+=4;
			else if(n==8)
			cnt+=5;
			else if(n==3)
			cnt+=3;
			else if(n==2 || n==5)
			cnt+=2;
			else if(n==1)
			cnt+=1;
		}


		cout<<cnt<<"\n";
	}
	return 0;
}

100

101

102

103

104

#include <iostream>

#include <stdio.h>

#include <math.h>

#include <string>

#include <map>

using namespace std;

map<int,char> mp;

int main()

{

int n,p;

string str;

mp[1]='I';

mp[5]='V';

mp[10]='X';

mp[50]='L';

mp[100]='C';

mp[500]='D';

mp[1000]='M';

//mp[2]=

while(cin>>n)

{

str="";

int cnt=0;

p=0;

if(n>=1000)

{

p=n/1000;

cnt+=p*4;

n-=1000*p;

}

p=0;

if(n>=100)

{

p=n/100;

if(p==1)

cnt+=2;

else if(p==2)

cnt+=4;

else if(p==3)

cnt+=6;

else if(p==4 || p==6)//400=CD

cnt+=5;

else if(p==5)

cnt+=3;

else if(p==7)

cnt+=7;

else if(p==8)

cnt+=9;

else if(p==9)

cnt+=6;

n-=100*p;

}

p=0;

if(n>=10)

{

p=n/10;

if(p==1)

cnt+=2;

else if(p==2)

cnt+=4;

else if(p==3)

cnt+=6;

else if(p==4 || p==6 || p==9)//40=XL

cnt+=4;

else if(p==5)

cnt+=2;

else if(p==7)

cnt+=6;

else if(p==8)

cnt+=8;

n-=10*p;

}

if(n!=0)

{

if(n==4 || n==6 || n==9)

cnt+=3;

else if(n==7)

cnt+=4;

else if(n==8)

cnt+=5;

else if(n==3)

cnt+=3;

else if(n==2 || n==5)

cnt+=2;

else if(n==1)

cnt+=1;

}

cout<<cnt<<"\n";

}

return 0;

}

306

Asif NaeemSeptember 20, 2014

#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <stdio.h>

/*

10
4 5 3 7 2 8 1 6 10 9
1 Hello Bob
1995 CERC
0
0

Sample Output

BolHeol  b
C RCE

 */
using namespace std;

int arr[202];
vector<char> c_arr[202];
char s[202];


int cycle(int pos)
{
	int org=pos;
	int init=arr[pos];
	int cnt=1;
	c_arr[pos-1].clear();
	c_arr[org-1].push_back(s[arr[pos]]);

	pos=arr[pos];

	while(init!=arr[pos])
	{
		c_arr[org-1].push_back(s[arr[pos]]);
		pos=arr[pos];
		cnt++;
	}

	return cnt;
}

int main()
{
	int n,k,len;
	string str;
	int pos_of_cycle;

	while(cin>>n)
	{
		if(n==0)
		break;
		for(int i=1;i<=n;i++)
		{
			cin>>arr[i];
		}
		while(cin>>k)
		{
			getchar();
			if(k==0)
			break;

			getline(cin,str);

			for(int i=0;i<str.size();i++)
			{
				s[i+1]=str[i];
			}
			for(int i=(str.size()+1);i<=n;i++)
				s[i]=' ';
			for(int pos=1;pos<=n;pos++)
			{
				len = cycle(pos);
				pos_of_cycle=len-1-(k%len);
				cout<<c_arr[pos-1][pos_of_cycle];

			}
			cout<<"\n";
		}
		cout<<"\n";

	}

	return 0;
}

#include <iostream>

#include <map>

#include <vector>

#include <string>

#include <stdio.h>

4 5 3 7 2 8 1 6 10 9

1 Hello Bob

1995 CERC

Sample Output

BolHeol b

C RCE

using namespace std;

int arr[202];

vector<char> c_arr[202];

char s[202];

int cycle(int pos)

{

int org=pos;

int init=arr[pos];

int cnt=1;

c_arr[pos-1].clear();

c_arr[org-1].push_back(s[arr[pos]]);

pos=arr[pos];

while(init!=arr[pos])

{

c_arr[org-1].push_back(s[arr[pos]]);

pos=arr[pos];

cnt++;

}

return cnt;

}

int main()

{

int n,k,len;

string str;

int pos_of_cycle;

while(cin>>n)

{

if(n==0)

break;

for(int i=1;i<=n;i++)

{

cin>>arr[i];

}

while(cin>>k)

{

getchar();

if(k==0)

break;

getline(cin,str);

for(int i=0;i<str.size();i++)

{

s[i+1]=str[i];

}

for(int i=(str.size()+1);i<=n;i++)

s[i]=' ';

for(int pos=1;pos<=n;pos++)

{

len = cycle(pos);

pos_of_cycle=len-1-(k%len);

cout<<c_arr[pos-1][pos_of_cycle];

}

cout<<"\n";

}

cout<<"\n";

}

return 0;

}

Month: September 2014

10852

725

1213

12335

12302

12347

12376

12372

12397

306

Archives

Categories