Simple Descending sort

#include <stdio.h>
#include<math.h>
 int main(){
     int a=1;
     while ( a!= 0){


     scanf("%d",&a);
        if (a>=1)
        if (a<=4)
        printf("few\n");
        if (a>=5)
        if (a<=9)
        printf("several\n");
        if (a>=10)
        if (a<=19)
        printf("pack\n");
        if (a>=20)
        if (a<=49)
        printf("lots\n");
        if (a>=50)
        if (a<=99)
        printf("horde\n");
        if (a>=100)
        if (a<=249)
        printf("throng\n");
        if (a>=250)
        if (a<=499)
        printf("swarm\n");
        if (a>=500)
        if (a<=999)
        printf("zounds\n");
        if (a>=1000)
        printf("legion\n");
}

     return 0;
 }

Edited by author 02.07.2015 03:53

Or should we have our program do all calculations?

Try this
+1.111e+3
5

I got TL although i'm using the binary tree , and when I looked for a solution on the net i found the same of mine but in another words
here is my code:

#include <cstdio>
#include <cstring>

using namespace std;
#define max 32002
int a[max];
void update(int i,int n,int v)
{
    while(i<=n)
    {
        a[i]+=v;
        i+=i&(-i);
    }

}
int read(int i)
{
    int v=0;
    while(i>0)
    {
        v+=a[i];
        i-=i&(-i);
    }
    return v;

}

int main()
{
    int n;
    scanf("%d",&n);

    int b[15010];
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    for(int i=1;i<=n;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);


        b[read(x)]++;
        update(x,32002,1);
    }
    for(int i=0;i<n;i++)
        printf("%d \n",b[i]);
    return 0;
}

so please help me cause i'm about to lose my mind!!!

0 0
5 0
6 1
1 1

Answer: 0

Sandro't have anywhere to teleport him to stay in the point (0;0). Simply calculate the distance of most distant demon!

First digit of the numbers will start from 1 and end with non-zero digit.and there will not present any successive zero.

Edited by moderator 23.08.2020 01:25

var
a:array[1..15000] of integer;
i:integer;
m,n,k:integer;
b:array[1..1000000] of longint;
j:integer;
Begin
k:=0;
readln(n);
for i:=1 to n do read(a[i]);
readln(m);
for j:=1 to m do readln(b[j]);
for i:=1 to n do
for j:=1 to m do
if b[j]=a[i] then k:=k+1;
writeln(k);
end.

using int gives AC

why authors didn't rejudge???
some authors got accepted more than 0.5 sec....
i don't understand why?

1+sqrt(2)

Edited by author 26.06.2015 05:22

I've just looked through the submission list. Almost everyone had WA #11. Maybe someone with AC can give me some hint about it?

Can somebody give some hints about that test?

Dear All,

I am a student and I got an assignment from my teacher to run "1409 Two Gangsters". I write Python program v.2.7 as per following codes. I run the program many times, but it still showed "Runtime Error". I could not fix it.

It would be appreciated if someone can help me. Thanks.


# 1409 Two Gangsters (Created: 24th June 2015 / Python 2.7)


# -------------------- Start of Program -------------------- #

# Set initial values
total = 0    # total number of cans shot by Harry and Larry
Harry = 0    # the number of cans shot by Harry
Larry = 0    # the number of cans shot by Larry
h = 0            # the number of cans that were not shot by Harry
l = 0           # the number of cans that were not shot by Larry


Harry = int(input("Please enter the number of cans shot by Harry: ")
Larry = int(input("Please enter the number of cans shot by Larry: ")


# Calculation of "The number of cans that were not shot by Harry and Larry"
total = Harry + Larry -1
h = total - Harry
l = total - Larry


# Output
print "-"*100
print "Total number of cans are : ", total
print "The number of cans that were not shot by Harry and Larry are ", h, "and", l, "respectively."
print "-"*100




# -------------------- End of Program -------------------- #

My code got WA7.
const Nmax=100500;
var
 Dp:array[1..Nmax] of longint;
 A,V:array[1..Nmax] of longint;
 N,i:longint;

BEGIN
 readln(N);
 for i:=1 to N do
 begin
  read(A[i]);
  Dp[a[i]]:=Nmax+5;
 end;

 Dp[a[n]]:=0;
 V[a[n]]:=0;
 for i:=N-1 downto 1 do
 begin
  if(Dp[a[i]]>Dp[a[i+1]]+1) then begin
   Dp[a[i]]:=Dp[a[i+1]]+1;
   V[a[i]]:=a[i+1];
  end;
 end;

 write(a[1],' ');
 i:=V[a[1]];
 while(i<>0) do begin
  write(i,' ');
  i:=V[i];
 end;
END.

#include<iostream>

int main()
{
 using namespace std;
 unsigned long long n,id[10000],x;
 int m[100],y,i,j;
 cin>>n;
 for(i=0;i<n;i++)
  cin>>id[i]>>m[i];
 for(i=0;i<n;i++)
 {
  for(j=i;j<n;j++)
  {
   if(m[i]<m[i+1])
   {
    x=id[i];
    id[i]=id[i+1];
    id[i+1]=x;
    y=m[i];
    m[i]=m[i+1];
    m[i+1]=y;
   }
  }
 }

 for(i=0;i<n;i++)
  cout<<id[i]<<"  "<<m[i]<<"\n";
 return 0;
}

i try use hungary to get some line use more student，than try the no use student，but wa on #12，pls help me！