ans1 = 0
ans2 = 0
for i in range(1, 10) :
    for j  in range(1, 10) :
        if i + j < 10 :
            ans1 += 1
for i in range(0, 10) :
    for j  in range(0, 10) :
        if i + j < 10 :
            ans2 += 1

n = int(input())

for i in range (1, n) :
    ans1 *= ans2

print(ans1)

What is the test №19?

""
from sys import stdin
from collections import Counter

def search():
    tmp = Counter([int(x) for x in stdin])
    return [i for i in tmp.keys() if tmp[i] == max(tmp.values())][0]
search()
"""

Edited by author 22.10.2015 01:31

Wrong answer...
Всё проверялось по 20 раз, толку никакого.
Где тут ошибка то?

#include <iostream>

using namespace std;

int main(){

int a,b;

freopen("INPUT.TXT", "r", stdin);
freopen("OUTPUT.TXT", "w", stdout);
scanf("%ld%ld", &a,&b);
printf("%ld", a+b);
return 0;

}

#include<iostream>

using namespace std;

bool isPrime(int a)
{
    int i;
    if(a==1) return 0;
    for(i=2; i<a; i++){
        if(a==2) return 1;
        else{
            if(a%i==0) return 0;
        }
    }
    return 1;
}

int main()
{
    int t,j,b,count=0;
    cin>>t;
    while(t--){
        int k=1;
        cin>>j;
        while(count!=j){
            b= isPrime(k);
            if(b==1) count++;
            k++;
        }

        cout<<--k<<endl;
        count=0;
    }

    return 0;
}

I think that this problem should be solved with bipartite matching. But the fastest algo for this is O(sqrt(V)*E).

I solved this problem using backtracking with optimization( you start from some position and then you go to the position that has the fewest future possible moves...//from other post). But it's WA 3. Then I checked the answers of my program myself and all was correct.Then I wrote a simple checker for this problem. And it said all right. Then I tried to save the answers(firstly my answers then answers from forum) as the constants in the program. And the answer was WA 3 again. Help me, please!!!

P.S. Sorry for my English.

Edited by author 12.09.2005 23:16

Edited by author 12.09.2005 23:21

I am new in coding..please help me to solve this problem

Edited by author 10.06.2018 23:09

I always have WA8, can you give me some tips about this test?

using System;
namespace t1000{
    class Program{
        public static void Main(string[] args){
            string[] s = Console.ReadLine().Split(' ');
            Console.WriteLine(int.Parse(s[0]) + int.Parse(s[1]));
        }
    }
}

It must be mentioned that two dice are considered equal if the numbers of points on corresponding faces are equal regardless of the orientation of the points on each face. For example, if you superimpose two dice and the numbers of points coincide but two corresponding faces look like this:
#..       ..#
.#.  and  .#.
..#       #..
then the dice have the same schemes.

Edited by author 09.06.2018 22:36

import java.util.*;
import java.lang.*;
public class Factorial{
        public static void main(String[] args){
                Scanner cin=new Scanner(System.in);
                int n=Integer.parseInt(cin.next());
                String k=cin.nextLine();
                int j=k.length()-1;
                int sum=1;
                for(int i=n;i>0;i-=j){
                        sum=sum*i;
                }
                System.out.println(sum);
        }
}

#include <stdio.h>

void main()
{
    int N,i,sum;
    sum = 0;
    scanf_s("%d", &N);
    if (N < 0)
    {
        for (i = N; i < 2; i++)
        {
            sum = sum + i;
        }
    }
    else
    {
        for (i = N; i > 0; i--)
        {
            sum = sum + i;
        }
    }
    printf("%d", sum);

}

I cant understand my mistake for TLE14.
My code
var
    s,s1,s2: string;
    z2,z1,a,i,f,p,code: integer;z,n:int64;
    ch:char;
begin
    readln(s);
    readln(npalindrome? 1 100000);
    for i:=1 to n do
    begin
        readln(s2);
        if s2[1]='p' then
        begin
        a:=13;z1:=0;z2:=0;
            while s2[a]<>' ' do
            inc(a);
         val(copy(s2,13,a-13),z1,code);
         val(copy(s2,a+1,length(s2)-1),z2,code);
             z:=z2-z1+1;
             if z2>length(s) then z2:=length(s);
            s1:=copy(s,z1,z);

             f := 1;
             p:=1;
             while (p<=length(s1)div 2)and(f<>0)  do
             if (s1[p] <> s1[length(s1)-p+1]) then
             begin
                  writeln('No');
                  f := 0;
             end else
             p:=p+1;

             if f = 1 then
             writeln('Yes');
        end else
        begin
        a:=8;z1:=0;
           while s2[a]<>' ' do
           inc(a);
                 Val(copy(s2,8,a-8),z1,code);
             ch:=s2[a+1];
             delete(s,z1,1);
             insert(ch,s,z1);

        end;
    end;
end.

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

const int maxn = (int) 1e5;
int a[maxn];

int main() {
    int n, x;
    cin >> n;
    fo(i, n) {
        cin >> a[i];
    }
    sort(a, a + n);
    string str;
    cin >> str >> n;
    fo(i, n) {
        cin >> x;
        cout << a[x - 1] << '\n';
    }
    re 0;
}

package timusreverseroot;

import java.text.DecimalFormat;
import java.util.*;
public class TimusReverseRoot {

    public static void main(String[] args) {
        DecimalFormat f = new DecimalFormat("#0.0000");
        Scanner keyboard = new Scanner(System.in);
        String inputs = keyboard.nextLine();
        String[] parsed = inputs.split(" ");

        for (String parsed1 : parsed) {
            int square = (int) Math.pow(Integer.parseInt(parsed1), 2);
            System.out.println(f.format(square));
        }
    }

}
I added in the package line but if I left that in, it would give me a compilation error, why is that? And this code runs perfectly fine in Netbeans but the judge gives a compilation error

Edited by author 07.05.2018 22:48

Edited by author 07.05.2018 22:49

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

int main() {
    int n, x;
    ii ans = mp(-1, 0);
    pair <ii, int> cur;
    cin >> n >> cur.fi.fi;
    cur.fi.se = cur.se = 0;
    fo(i, n - 1) {
        cin >> x;
        if (x >= cur.fi.fi) ++cur.fi.se;
        else {
            cur.fi.se++;
            ans = max(ans, mp(cur.fi.se, cur.se));
            cur = mp(mp(x, 1), i + 1);
        }
    }
    ans = max(ans, mp(cur.fi.se, cur.se));
    cout << ans.se + 1 << endl;
}