SPOJ.com - Problem CP306

Problem hidden

|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

CP306 - Math5

Ó¨ĐłŃÓŠĐ˝ 3 ĐžŃĐžĐ˝ŃĐžĐš ŃĐžĐžĐ˝Ń Đ°ŃĐ°Đ˛Ń ĐąĐ° ĐˇŃŃŃŃĐ˝ ĐžŃĐ˝Ń ŃĐ¸ŃŃŇŻŇŻĐ´Đ¸ĐšĐ˝ Đ°ĐťŃ Đ¸Ń ĐąĐžĐťĐžŃŃĐł ŃĐžĐłŃĐžĐž. ĐĽŃŃŃĐ˛ Đ°ŃĐ°Đ˛ŃŃĐ˝ ŃĐ¸ŃŃ Đ¸Ń ĐąĐžĐť ARAVT, ĐˇŃŃŃŃĐ˝ ŃĐ¸ŃŃ Đ¸Ń ĐąĐžĐť ZUUT ĐłŃĐś ŃŃĐ˛ĐťŃ.

Input

ĐŃŃĐ˛Đ°Đ˝ ĐžŃĐžĐ˝ŃĐžĐš Đ˝ŃĐł ĐąŇŻŃŃĐť ŃĐžĐž ÓŠĐłÓŠĐłĐ´ÓŠĐ˝ÓŠ. ĐŃĐ°Đ˛Ń ĐąĐžĐťĐžĐ˝ ĐˇŃŃŃŃĐ˝ ĐžŃĐžĐ˝ĐłĐ¸ĐšĐ˝ ŃĐ¸ŃŃŇŻŇŻĐ´ Đ˝Ń ŃĐťĐłĐ°Đ°ŃĐ°Đš ŃĐžĐž ÓŠĐłÓŠĐłĐ´ÓŠĐ˝ÓŠ.

Output

ARAVT, ZUUT ĐłŃŃŃĐ˝ ŇŻŃ Đ´ŇŻĐ˝ĐłŇŻŇŻĐ´Đ¸ĐšĐ˝ Đ˝ŃĐłĐ¸ĐšĐł ŃŃĐ˛ĐťŃĐ˝Ń.

Example

Input:
526

Output:
ZUUT

Submit solution!

Нэмсэн:	munkhbat
Огноо:	2015-03-09
Хугацааны хязгаарлалт:	1s
Эх кодын хэмжээний хязгаарлалт:	50000B
Memory limit:	1536MB
Cluster:	Cube (Intel G860)
Програмчлалын хэлүүд:	Бүгд дараах хэлүүдээс бусад: ASM64 NCSHARP JS-MONKEY JULIA PYPY3

hide comments

2024-12-09 05:47:45
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n,m,k,c;
cin>>n>>m>>k>>c;
if (k<c){
cout<<"0";
return 0;
}
ll a=m*(n/k);
a+=(n%k)*(m/k);
ll x=1,y=c;
while(x<=(n%k)) {
if(y>=1 && y<=(m%k)) {
a++;
}
x++;
y--;
if(y==0) {
y+=(k-1);
}
}
cout<<a;
}

2024-12-09 05:02:21

2024-12-09 05:02:11
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n,m,k,c;
cin>>n>>m>>k>>c;
ll a=m*(n/k);
a+=(n%k)*(m/k);
ll x=1,y=c;
while(x<=(n%k)) {
if(y>=1 && y<=(m%k)) {
a++;
}
x++;
y--;
if(y==0) {
y+=(k-1);
}
}
cout<<a;
}

2024-12-09 05:02:00
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n,m,k,c;
cin>>n>>m>>k>>c;
ll a=m*(n/k);
a+=(n%k)*(m/k);
ll x=1,y=c;
while(x<=(n%k)) {
if(y>=1 && y<=(m%k)) {
a++;
}
x++;
y--;
if(y==0) {
y+=(k-1);
}
}
cout<<a;
}

2024-12-09 05:01:53
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n,m,k,c;
cin>>n>>m>>k>>c;
ll a=m*(n/k);
a+=(n%k)*(m/k);
ll x=1,y=c;
while(x<=(n%k)) {
if(y>=1 && y<=(m%k)) {
a++;
}
x++;
y--;
if(y==0) {
y+=(k-1);
}
}
cout<<a;
}

2024-12-09 03:35:57
#include<bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,k,c,s=0;
int l=0;
string q;
cin>>n>>m>>k>>c;
for(int i=1;i<=m;i++)
{
l++;
q.push_back(l+'0');
if(l==k) l=1;
}
q=q+q;
cout<<q;
for(int i=0;i<n;i++)
{
for(int j=0+i;j<m+i;j++)
{
cout<<q[j];
}
cout<<endl;
}

}
//dulmaa nohoi

Last edit: 2024-12-09 03:38:11

2024-12-09 03:35:23
#include<bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,k,c,s=0;
int l=1;
string q="";
cin>>n>>m>>k>>c;
for(int i=1;i<=m;i++)
{
l++;
q.push_back(l+'0');
if(l==k) l=1;
}
q=q+q;
cout<<q;
for(int i=0;i<n;i++)
{
for(int j=0+i;j<m+i;j++)
{
cout<<q[j];
}
cout<<endl;
}

} //dulma

2024-12-09 03:35:02
#include<bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,k,c,s=0;
int l=1;
string q="";
cin>>n>>m>>k>>c;
for(int i=1;i<=m;i++)
{
l++;
q.push_back(l+'0');
if(l==k) l=1;
}
q=q+q;
cout<<q;
for(int i=0;i<n;i++)
{
for(int j=0+i;j<m+i;j++)
{
cout<<q[j];
}
cout<<endl;
}

a

}

2024-12-08 08:36:16
#include <bits/stdc++.h>
using namespace std;
int T, R, C, r, c;
char G[1005][1005], P[1005][1005];
void s() {
cin >> R >> C;
for (int i = 0; i < R; ++i) cin >> G[i];
cin >> r >> c;
for (int i = 0; i < r; ++i) cin >> P[i];
for (int i = 0; i <= R - r; ++i) {
for (int j = 0; j <= C - c; ++j) {
bool m = true;
for (int a = 0; a < r; ++a) {
for (int b = 0; b < c; ++b) {
if (G[i + a][j + b] != P[a][b]) {
m = false;
break;
}
}
if (!m) break;
}
if (m) {
cout << "YES" << endl;
return;
}
}
}
cout << "NO" << endl;
}

int main() {
cin >> T;
while (T--) s();
return 0;
}

2024-12-06 06:16:32
#include <stdio.h>

int main() {
int n, m = 0, k, i = 1, c, a[2002];
scanf("%d", &n);

while (i <= n) {
scanf("%d", &a[i++]);
}

i = 1;
while (i <= n) {
k = a[i++];
c = 0;
while (k > 0) {
k = a[k];
c++;
}
if (c > m) {
m = c;
}
}

printf("%d\n", m + 1);
return 0;
}
// udeshleg

PROGRAMING PROBLEMS

CP306 - Math5

Input

Output

Example