Test#11
4 10 4
2497

Out - 10 10 10 2

What's wrong?

Don't use int. Use long long.

Edited by author 31.10.2012 15:46

My program got Crash (assert), cause this test has some trash in the end.

Валят первым тестом, вроде работает
#include <stdio.h>
void main()
{
    int i=0,cash=0;
    char text[1000];
    gets(text);
    while(text[i]!=NULL && i<1001)
    {
        if (text[i]=='a' || text[i]=='d' || text[i]=='g' || text[i]=='j' || text[i]=='m' || text[i]=='p' || text[i]=='s' || text[i]=='v' || text[i]=='y' || text[i]=='.' || text[i]==' ') cash+=1;
        if (text[i]=='b' || text[i]=='e' || text[i]=='h' || text[i]=='k' || text[i]=='n' || text[i]=='q' || text[i]=='t' || text[i]=='w' || text[i]=='z' || text[i]==',') cash+=2;
        if (text[i]=='c' || text[i]=='f' || text[i]=='i' || text[i]=='l' || text[i]=='o' || text[i]=='r' || text[i]=='u' || text[i]=='x' || text[i]=='!' ) cash+=3;
        i++;
    }
    printf("%d",cash);
}

Edited by author 30.10.2012 18:58

Поясните пример, пожалуйста

#include <iostream>
int fow(int n,int m)
{int s=1;
for(int i=0;i<m;i++)
{s=s*n;}
return s;
}

int main()
{int x=0,y,m,n;
std::cin>>n>>m>>y;
for(int i=0;i<m;i++)
{
if(fow(i,n)%m==y)
{std::cout<<i<<' ';
x=1;}
}
if(x==0) std::cout<<"-1";
return 0;

}

this my solution:

#include <iostream>
#include <string>
#include <stdlib.h>
#include <algorithm>

using namespace std;

int main(){

int bilo;
string s;
cin>>s;


for (int j = 0; j < s.length() - 1; j++){
    bilo = 0;
    for (int i = 0; i < s.length()-1; i++){
      if (s[i] != '1')
        if ((s[i] == s[i+1])){
          s[i] = '1';
          s[i+1] = '1';
          bilo = 1;

          if (i < s.length()-1){
          rotate(&s[i], &s[i+1], &s[i] + s.length() - i);
          rotate(&s[i], &s[i+1], &s[i] + s.length() - i);
          }

        }
     }
  if (bilo = 0)
      break;
}

int i = 0;
while (s[i]!='1'){
    cout<<s[i];
    i++;
}


   //system("pause");
    return 0;
}

please send me answer on my e-mail: sergeo_91_@mail.ru  or write me here.
P.S. thank you in advance.

i use BFS and can't pass test 8 because MLE

help me, please

Edited by author 30.10.2012 09:44

В условии почему-то не упоминается что команда сплочённая ещё и когда она состоит из всех людей и при этом эффективная.

If i input 4, what is answer? or if i input 8, what answer?

#include<iostream>
#include<cstdlib>
using namespace std;
int main(){
int i,j,n,m,k;
for(i=0;i<1000000;i++){
k=rand()%26;
k+=97;
cout<<(char)k;
}
//cin.get();
return 0;
}

Why do you have as a result is 31, not 32. please make sure that!

Что для центров важнее: получить больше прибыли или минимизировать прибыль соперника?

Don't use any collections (TreeSet/HashSet/etc) (ArrayList might also be a problem)

looks like when they add/remove/update their elements they do some stuff to their elements, so that doubles change their magnitude.

u might also try to use YouOwnDouble class implements Comparable

What is it

var n,i,j,k:integer;
s,h,g,r:string;
a:array[1..200] of string;

begin
s:='Slytherin';
h:='Hufflepuff';
g:='Gryffindor';
r:='Ravenclaw';

readln(n);
for i:=1 to 2*n do readln(a[i]);

writeln(s,':');
for i:=2 to 2*n do
if a[i]=s then writeln(a[i-1]);
writeln;

writeln(h,':');
for i:=2 to 2*n do
if a[i]=h then writeln(a[i-1]);
writeln;

writeln(g,':');
for i:=2 to 2*n do
if a[i]=g then writeln(a[i-1]);
writeln;

writeln(r,':');
for i:=2 to 2*n do
if a[i]=r then writeln(a[i-1]);
end.

If n = 3 then general headquarters are NOT able to form the three-man groups from the rest of fighters so that every group will contain at least one teddyhater.
So, it seems that correct answer should be 0 for n =3 (test #2)

Какие ограничения накладываются на c[i]? Какой максимальной длины может быть это число?