hiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii

#include "iostream"
using namespace std;
int main()
{
int n;
cin>>n;
int ar[101][101];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>ar[i][j];
cout<<ar[0][0]<<' ';
for(int i=1;i<n;i++)
{
int b=0;
for(int j=i;j>=0;j--)
{
cout<<ar[j][b]<<' ';
b++;
}
}
for(int i=1;i<4;i++)
{
int b=n-1;
for(int j=i;j<n;j++)
{
    cout<<ar[b][j]<<' ';
    b--;
}
}
return 0;
}
Help me!

var n,i,j:longint;
begin
  readln(n);
  if (n<=2)then begin writeln('0') ; halt; end;
  j:=trunc(sqrt(n));
  for i:=3 to j do
    begin
      if (n mod i=0) then break;
    end;
  writeln(i-1);
end.


Can anybody tell me why?
It seems rigth^Why ? It drives me crazy^

Edited by author 15.06.2008 14:10

Edited by author 15.06.2008 14:10

0

Edited by author 12.01.2012 22:05

Does any one know if 2008 will also work? or must you use 2010?

1
1
2
4
6
9
14
21
31
46
68
100
147
216
317
465
682
1000
1466
2149
3150
4617
6767
9918
14536
21304
31223
45760
67065
98289
144050
211116
309406
453457
664574
973981
1427439
2092014
3065996
4493436
6585451
9651448
14144885
20730337
30381786
44526672
65257010
95638797
140165470
205422481
301061279
441226750
646649232
947710512

5
12:00:00
12:00:00
12:00:00
12:00:00
1:00:00

Can anyone tell me my mistake. Here is my code. Thanks
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>
//#include <conio.h>

using namespace std;

#define oo 1000000000
#define fi first
#define se second
#define sqr(a) ((a)*(a))
#define FR(i,n) for (int i = 0; i < (n); i++)
#define DN(i,a) for(int i = (a)-1; i >= 0; i--)
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define DOWN(i,a,b) for(int i = (a); i >= (b); i--)
#define FORV(i,a) for(typeof(a.begin()) i = a.begin(); i != a.end(); i++)

typedef pair<int, int> PII;
typedef vector<int> VI;

double kc(double x1, double y1, double x2, double y2) {
    return sqrt(sqr(x1 - x2) + sqr(y1 - y2));
}

int main () {
    double a, b, d, r11, r12, r21, r22, h;
    cin >> a >> b >> d;
    cin >> r11 >> r12 >> r21 >> r22 >> h;
    if (2 * max(r21, r11) > min(a, b)) {
        cout << "NO" << endl;
        return 0;
    }
    double x1 = r11, y1 = r11;
    double x2 = a - r21, y2 = b - r21;
    if (kc(x1, y1, x2, y2) < r11 + r21) {
        cout << "NO" << endl;
        return 0;
    }
    if (d >= h) {
        if (2 * max(r12, r22) > min(a, b)) {
            cout << "NO" << endl;
            return 0;
        }
        double x1 = r12, y1 = r12;
        double x2 = a - r22, y2 = b - r22;
        if (kc(x1, y1, x2, y2) < r12 + r22) {
            cout << "NO" << endl;
            return 0;
        }
    }
    if (d < h) {
        double r1m = d * (r12 - r11) / h + r11;
        double r2m = d * (r22 - r21) / h + r21;
        if (2 * max(r1m, r2m) > min(a, b)) {
            cout << "NO" << endl;
            return 0;
        }
        double x1 = r1m, y1 = r1m;
        double x2 = a - r2m, y2 = b - r2m;
        if (kc(x1, y1, x2, y2) < r1m + r2m) {
            cout << "NO" << endl;
            return 0;
        }
    }
    cout << "YES" << endl;
    return 0;
}

#include <stdio.h>
#include <math.h>

int a[20];
int count;

int main()
{

   scanf("%d", &count);

   for(int i = 0; i < count; i++)
   {
        scanf("%d", &a[i]);
   }


    // Сортировка пузырьком
    bool t = true;
    while(t)
    {
        t = false;
        for(int i = 0; i < count-1; i++)
        {
            if(a[i] > a[i+1])
            {
                int tmp = a[i];
                a[i] = a[i+1];
                a[i+1] = tmp;
                t = true;
            }
        }
    }



   int r1 = a[count - 1], r2 = 0;

   for(int i = count - 2; i >= 0; i--)
   {
        if(r1 > r2)
            r2 += a[i];
        else
            r1 += a[i];
   }


   if(r2 > r1)
       r1 = r2 - r1;
   else
       r1 = r1 - r2;

   printf("%d\n", r1);

   return 0;
}

I always have WA1?
Give me some tests

My code is here:
======================================

#include <iostream>
#include <math.h>
using namespace std;

void Attack(int &, int &, int &, int &);
void Guard(int &, int &);
void Defense(int &);
void Patrol(int &, int &);

void OffensiveStrike(int &, int &);
void RetreatStrike(int &, int &);

void LEFT(int &);
void RIGHT(int &);
void FRONT(int &);
void BACKWARD(int &);
void FIRE(int &);
void STOP();

int X,P;
int M,MP,MA;

int main()
{
    cin >> X >> P;

    char model;
    cin >> model;

    cin >> M >> MP >> MA;

    if ('A'==model)
    {
        int N,NP;
        cin >> N >> NP;
        Attack(N,NP,M,MP);
    } else
    if ('G'==model)
    Guard(M,MA);
      else
    if ('D'==model)
    Defense(M);
      else
    if ('P'==model)
    {
        int A;
        cin >> A;
        Patrol(M,A);
    }

}

void Attack(int &N, int &NP, int &M, int &MP)
{
    if (N*NP>M*MP*3) OffensiveStrike(M,MA);
        else RetreatStrike(M,MA);
}

void Guard(int &M, int &MA)
{
    if (0==M) STOP;
    else
        if (MA>=5) LEFT(X);
        else if (MA<=-5) RIGHT(P);
            else FIRE(P);
}

void Defense(int &M)
{
    if (M*20>=P) RetreatStrike(M,MA);
        else Guard(M,MA);
}

void Patrol(int &M, int &A)
{
    if (M>0) Defense(M);
    else if (abs(A)<=20 || 180-abs(A)<=20)
        {
            if (abs(A)<=20) FRONT(X);
            else BACKWARD(X);
        } else
            if ((A>=90 && A<160) || (A>=-90 && A<-20)) RIGHT(X);
            else LEFT(X);

}


void OffensiveStrike(int &M, int &MA)
{
    if (abs(MA)>=10 || 0==M) FRONT(X);
            else FIRE(P);
}

void RetreatStrike(int &M, int &MA)
{
    if (abs(MA)>=5 || 0==M) BACKWARD(X);
               else FIRE(P);
}

void LEFT(int &X)
{
    if (X>100) cout << "LEFT 100";
    else   cout << "LEFT " << X;
}

void RIGHT(int &X)
{
    if (X>100) cout << "RIGHT 100";
    else   cout << "RIGHT " << X;
}

void FRONT(int &X)
{
    if (X>100) cout << "FRONT 100";
    else   cout << "FRONT " << X;
}

void BACKWARD(int &X)
{
    if (X>100) cout << "BACKWARD 100";
    else   cout << "BACKWARD " << X;
}

void FIRE(int &P)
{
    if (P>20) cout << "FIRE 20";
    else  cout << "FIRE " << P;
}

void STOP()
{
    cout << "STOP";
}

Help.

6 2 3
4 5
2 3
4 5

answer is 1

#include <iostream>              //1086 acm.timus.ru
bool table [170000];
int       user [15001];
long     n = 170000;
int         num = 0;

int main()
{
    std::cin>>num;
    for (int i = 0; i < num; i++)
    {
        std::cin>>user[i];
    }


  for (long i =1; i < 2*n+1; i++)
  {
      for (long j = 1; i >= j&&i+j+2*i*j < n; j++)
      {
          table[i+j+2*i*j] = 1;
      }
  }
  table[0] = 1;
  table[1] = 0;




  for (int i = 0, a = 1, j = 0;  user[j] > 0; i++)
  {
      if (user[j] == 1)
      {
          std::cout<<2<<std::endl; j++; i = 0; a = 1;
      }
      if  ( !(table[i]) )  a++;
      if  (a == user[j]) {
          std::cout<<i*2+1<<std::endl;
          j++;
          i = 0;
          a = 1;
      }
  }
return 0;
}



Edited by author 16.01.2012 23:47

My code:
BS))))
Isn't it because in (1) round answer?
Could you help me?

Edited by author 12.01.2012 00:24

After A lot of attemps I Got AC with pretty desent times (according to me :) ):
http://acm.timus.ru/status.aspx?space=1&num=1013&author=40769.

I wonder, is it possible??
http://acm.timus.ru/status.aspx?space=1&author=43335

He uses only 2 K memory

Edited by author 06.07.2006 22:21

Edited by author 06.07.2006 22:21

Hello!
I found the following interesting test:

n 1 n
1 1
2 2
3 3
...
n-1 n-1
1 n-1

where n is a large number (such as 100000)

The result is n-1

0.17sec,86k;
var prost:array[1..16000] of longint;
    i,j,k,x,n:longint;flag:boolean;
procedure look(x:longint);
var i:longint;
begin
  i:=prost[k];
  repeat
    i:=i+2;
    flag:=true;
    for j:=1 to k do begin
      if i mod prost[j]=0 then begin
         flag:=false;
         break;
      end;
      if prost[j]*prost[j]>i then break;{This is very important}
    end;
    if flag then begin
       k:=k+1;
       prost[k]:=i;
    end;
  until k=x;
  writeln(prost[k]);
end;
begin
  prost[1]:=2;
  prost[2]:=3;
  prost[3]:=5;
  k:=3;
  read(n);
  for i:=1 to n do begin
    read(x);
        if x>k then look(x)
           else writeln(prost[x]);
        end;
end.